Pages:
Author

Topic: BitCrack - A tool for brute-forcing private keys - page 10. (Read 74373 times)

full member
Activity: 1050
Merit: 219
Shooters Shoot...
Hex - f7051f27b09112d4 dec - 17799667357578236628

17799667357578236628 / 2 = in loop

result -

8.899833678789118e+18
4.449916839394559e+18
2.2249584196972795e+18
1.1124792098486397e+18
5.562396049243199e+17
2.7811980246215994e+17
1.3905990123107997e+17
6.952995061553998e+16
3.476497530776999e+16
1.7382487653884996e+16
8691243826942498.0
4345621913471249.0 (only this 2 decimal number are integer format others are float till zero)
2172810956735624.5

if i plus this integer numbers 4345621913471249 + 4345621913471249 (in loop) until reach 17799667357578236628 (f7051f27b09112d4)

the closest hex i reach

count: 4097 | found: 0 hex: 000000000000000000000000000000000000000000000000f7051f27b0911000

INT: 17799667357578235904

BTC comp:      1JcfWxUhWPCvTPYRs3J56sRefVKcppjqar

how can i get the exact decimal number which deliver me this hex   00000000000000000000000000000000000000000000000f7051f27b09112d4

it is 4345621913471249 (52 bit) but still not exact i need 32 bit or less to plus as --stride in Bitcrack until hit targeted hex..

in simple words. Someone knows such a number that when added continuously, 17799667357578236628 (f7051f27b09112d4) is obtained.
Lol, this is silly. It would depend on your stride and your starting position/key, I could say that 1 added to 1 continuously would eventualy equal 17799667357578236628, or 2 added to 2 would eventually equal 17799667357578236628.
But a number close to your number of: 4345621913471249; would be the number 4732695388880148. Run that as stride and see what happens...let me know.
Or you can try: 50847529 (in hex = 307DF29), if you need 32 bit or less.
member
Activity: 261
Merit: 19
the right steps towerds the goal
Hex - f7051f27b09112d4 dec - 17799667357578236628

17799667357578236628 / 2 = in loop

result -

8.899833678789118e+18
4.449916839394559e+18
2.2249584196972795e+18
1.1124792098486397e+18
5.562396049243199e+17
2.7811980246215994e+17
1.3905990123107997e+17
6.952995061553998e+16
3.476497530776999e+16
1.7382487653884996e+16
8691243826942498.0
4345621913471249.0 (only this 2 decimal number are integer format others are float till zero)
2172810956735624.5

if i plus this integer numbers 4345621913471249 + 4345621913471249 (in loop) until reach 17799667357578236628 (f7051f27b09112d4)

the closest hex i reach

count: 4097 | found: 0 hex: 000000000000000000000000000000000000000000000000f7051f27b0911000

INT: 17799667357578235904

BTC comp:      1JcfWxUhWPCvTPYRs3J56sRefVKcppjqar

how can i get the exact decimal number which deliver me this hex   00000000000000000000000000000000000000000000000f7051f27b09112d4

it is 4345621913471249 (52 bit) but still not exact i need 32 bit or less to plus as --stride in Bitcrack until hit targeted hex..

in simple words. Someone knows such a number that when added continuously, 17799667357578236628 (f7051f27b09112d4) is obtained.
full member
Activity: 1050
Merit: 219
Shooters Shoot...
how can i know 32 bit or smaller --stride of  f7051f27b09112d4 i tried to divide these hex but result are always in float..
Can you explain better? thanks.
member
Activity: 261
Merit: 19
the right steps towerds the goal
how can i know 32 bit or smaller --stride of  f7051f27b09112d4 i tried to divide these hex but result are always in float..
legendary
Activity: 2842
Merit: 7333
Crypto Swap Exchange
HI, Who can rewrite the program so that it search for the privat keys from the file .txt ?

or mask generation

I don't know what do you mean by "mask generation", but for .txt file you could create .bat file to parse/loop parameter on  .txt file and then execute BitCrack.

i pay....

You could create a thread on Services to seek people who can do the job.

how is possible that high puzzles already cracked in this high bit range

70 , 75 , 80 , 85 , 90 , 95 , 100 , 105 , 110 , 115

and why 120 and 125 and 130 unsolved
The author of the puzzles release the publickey by doing some small spending in those puzzles. Those were solved with kangaroo or some other tools. The 120 bit puzzle and above are really big and the cost to solve those puzzles is bigger than they worth.

To be more specific, those algorithm (such as Pollad's Kangoroo and BSGS) have time complexity lower than O(2^bits). For example, Pollad's Kangoroo time complexity O(sqrt(2^bits)).
newbie
Activity: 54
Merit: 0
HI, Who can rewrite the program so that it search for the privat keys from the file .txt ?

or mask generation


i pay....
hero member
Activity: 828
Merit: 657
how is possible that high puzzles already cracked in this high bit range

70 , 75 , 80 , 85 , 90 , 95 , 100 , 105 , 110 , 115

and why 120 and 125 and 130 unsolved

The author of the puzzles release the publickey by doing some small spending in those puzzles. Those were solved with kangaroo or some other tools. The 120 bit puzzle and above are really big and the cost to solve those puzzles is bigger than they worth.
newbie
Activity: 72
Merit: 0
how is possible that high puzzles already cracked in this high bit range

70 , 75 , 80 , 85 , 90 , 95 , 100 , 105 , 110 , 115

and why 120 and 125 and 130 unsolved
newbie
Activity: 6
Merit: 0
hi
i was testing this and it found private key.
what does 153869ACC5B mean? doesn't look like a private key, its too short.


[2023-01-04.16:57:39] [Info] Found key for address '1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E'. Written to 'Found.txt'
[2023-01-04.16:57:39] [Info] Address     : 1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E
Private key : 153869ACC5B
Compressed  : yes
Public key  : 03B357E68437DA273DCF995A474A524439FAAD86FC9EFFC300183F714B0903468B


It leaves out the leading zeros. So if you are looking for the longer version of this private key, it is:

00000000000000000000000000000000000000000000000000000153869ACC5B
thank you
full member
Activity: 1050
Merit: 219
Shooters Shoot...
hi
i was testing this and it found private key.
what does 153869ACC5B mean? doesn't look like a private key, its too short.


[2023-01-04.16:57:39] [Info] Found key for address '1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E'. Written to 'Found.txt'
[2023-01-04.16:57:39] [Info] Address     : 1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E
Private key : 153869ACC5B
Compressed  : yes
Public key  : 03B357E68437DA273DCF995A474A524439FAAD86FC9EFFC300183F714B0903468B


It leaves out the leading zeros. So if you are looking for the longer version of this private key, it is:

00000000000000000000000000000000000000000000000000000153869ACC5B
hero member
Activity: 630
Merit: 731
Bitcoin g33k
Congratulations. You have successfully found the private key for puzzle #41.
newbie
Activity: 6
Merit: 0
hi
i was testing this and it found private key.
what does 153869ACC5B mean? doesn't look like a private key, its too short.


[2023-01-04.16:57:39] [Info] Found key for address '1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E'. Written to 'Found.txt'
[2023-01-04.16:57:39] [Info] Address     : 1L5sU9qvJeuwQUdt4y1eiLmquFxKjtHr3E
Private key : 153869ACC5B
Compressed  : yes
Public key  : 03B357E68437DA273DCF995A474A524439FAAD86FC9EFFC300183F714B0903468B
hero member
Activity: 828
Merit: 657
i also can test keyhunt, if you tell me how to setup on windows and for #66 address. use python to keep track of your ranges, how to?

It is easy, make a python script to keep track of the ranges, and use os.system to call keyhunt with new ranges.

Regards.
newbie
Activity: 74
Merit: 0
https://github.com/albertobsd/keyhunt

i did think albertobsd developed keyhunt - sorry.
in my tests keyhunt-cuda is always showing higher performance and rate so i do not understand why some people still use bitcrack or bitcrack2

what is the best tool in term of performance rate in your opinion to use for trying to crack puzzle 66 where no pubkey is known?
Some may use bitcrack because of the --continue option, however, a simple python script could be used instead, using keyhunt-cuda. keyhunt-cuda allows for multiple GPUs to be used together, and the speed is faster so I do not know why others use bitcrack, unless for the stride function.

I think keyhunt-cuda is the best option for #66...use python to keep track of your ranges ran or to continue. Someone just has to get lucky and land in the right zone to find the key.

i also can test keyhunt, if you tell me how to setup on windows and for #66 address. use python to keep track of your ranges, how to?
full member
Activity: 1050
Merit: 219
Shooters Shoot...
https://github.com/albertobsd/keyhunt

i did think albertobsd developed keyhunt - sorry.
in my tests keyhunt-cuda is always showing higher performance and rate so i do not understand why some people still use bitcrack or bitcrack2

what is the best tool in term of performance rate in your opinion to use for trying to crack puzzle 66 where no pubkey is known?
Some may use bitcrack because of the --continue option, however, a simple python script could be used instead, using keyhunt-cuda. keyhunt-cuda allows for multiple GPUs to be used together, and the speed is faster so I do not know why others use bitcrack, unless for the stride function.

I think keyhunt-cuda is the best option for #66...use python to keep track of your ranges ran or to continue. Someone just has to get lucky and land in the right zone to find the key.
jr. member
Activity: 70
Merit: 1
puzzle 66 where no pubkey is known?

puzzle 66 Address  13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so compressed or Uncompressed ??
newbie
Activity: 72
Merit: 0
https://github.com/albertobsd/keyhunt

i did think albertobsd developed keyhunt - sorry.
in my tests keyhunt-cuda is always showing higher performance and rate so i do not understand why some people still use bitcrack or bitcrack2

what is the best tool in term of performance rate in your opinion to use for trying to crack puzzle 66 where no pubkey is known?
full member
Activity: 1050
Merit: 219
Shooters Shoot...
what is the difference between bitcrack and keyhunt?both work with cuda and keyhunt delivers the higher rate without exception.
what is the reason for this?
why therefore do not most use keyhunt from albertobsd for cracking the puzzles?
If you are referring to keyhunt-cuda, albertobsd did not program it.

Why people still use bitcrack, maybe for the stride function...I'm not sure.
newbie
Activity: 72
Merit: 0
what is the difference between bitcrack and keyhunt?both work with cuda and keyhunt delivers the higher rate without exception.
what is the reason for this?
why therefore do not most use keyhunt from albertobsd for cracking the puzzles?
full member
Activity: 1050
Merit: 219
Shooters Shoot...
Hi, i have a laptop with nvidia gpu rtx and i tried cuBitcrack and i get only around 150 Mkey/s and with VanitySearch i get 450 Mkey/s , but i want to use Bitcrack as i can save progress. Is there any chance to get more Mkey/s with cuBitcrack? I need different version or to make some settings on it for higher rate?

what are your bitcrack settings such as:  -b 96 -t 512 -p 1024
that will help the community better assist you.


hi i used deafult and i tried this  -b 96 -t 512 -p 1024 get out of memory and  tried  -b 96 -t 256 -p 1024 i get 395 Mkey/s now. should i try different one? anyway thanks i get more x3 speed than before with Bitcrack
yes, you should experiment with your GPU, since each one will get better performance using different settings.
Pages:
Jump to: