Post
Topic
Board Development & Technical Discussion
Re: BitCrack - A tool for brute-forcing private keys
by
AuorFedelmid
on 16/05/2021, 02:06:50 UTC
Does BitCrack always find keys or can it miss?

I have searched the whole of the puzzle 64 range and not been able to find the key 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

0x0000000000000000000000000000000000000000000000008000000000000000
0x000000000000000000000000000000000000000000000000ffffffffffffffff

https://privatekeys.pw/puzzles/bitcoin-puzzle-tx
Hahaha....another one claiming to have searched the entire range.

Absolutely no way you ran the entire range.

If you had GPUs that could search 10,000,000,000,000,000,000,000 keys a second, it would take you 159 days to search the entire range.

Not the entire, just the 64-bit range.
 
If that is the case then why does clBitcrack on my RTX 3070 say the range has been completed. from decimal 18446744073709551615 to 9223372036854775808? Using clBitcrack as cuBitcrack dont work on my 3070, I'm doing around 1100MKey/s?

I have inputted the hex ranges:

0000000000000000000000000000000000000000000000008000000000000000
000000000000000000000000000000000000000000000000ffffffffffffffff

Altogether it has taken around 2 days (~42 hours) to search non-stop.
Ok, when I said entire range I meant the one you were referring to...2^64, 64 bit range.

No, you did not search the entire 64 bit range. At 1100 Mkey/s it would take you around 1,448,907,898,153,186 days to search the entire 64 bit range.

Not disagreeing with you, but the hex ranges I showed above are correct right? Why would clBitcrack state "[Info] Reached end of keyspace" unless there is some bug or those are not the correct ranges. maybe I missed a 0 or two?

Appreciate the explanation.