Hello,
I just created a simple solo-pool to find puzzle 66.
It only works with BTC Puzzle 66. If you want to scan all private keys in puzzle 66; you need to do 36 quintillion scans in total. In case you do a random scan; previously generated private keys will be regenerated (random problem). This extends the scan time by x10.
Puzzle 66 HEX ranges as follows. It starts with 2 or 3. Any private key in this range is 17 characters long.
20000000000000000 to 3ffffffffffffffff
We take the first 7 characters and delete the rest for now. The result will be as follows.
2000000 to 3ffffff
We now have about 33 million possible private keys to search. All possible private keys are stored in the database. A random value will come up each time a scan job is called and will be marked as scanned when the scan is complete.
I can scan each key in about 10 minutes on NVIDIA 3090. This actually means about 1,1 trillion private keys. When the private key is scanned, it is marked as scanned. So it won't show up anymore.
https://github.com/ilkerccom/bitcrackrandomiser
I just created a simple solo-pool to find puzzle 66.
It only works with BTC Puzzle 66. If you want to scan all private keys in puzzle 66; you need to do 36 quintillion scans in total. In case you do a random scan; previously generated private keys will be regenerated (random problem). This extends the scan time by x10.
Puzzle 66 HEX ranges as follows. It starts with 2 or 3. Any private key in this range is 17 characters long.
20000000000000000 to 3ffffffffffffffff
We take the first 7 characters and delete the rest for now. The result will be as follows.
2000000 to 3ffffff
We now have about 33 million possible private keys to search. All possible private keys are stored in the database. A random value will come up each time a scan job is called and will be marked as scanned when the scan is complete.
I can scan each key in about 10 minutes on NVIDIA 3090. This actually means about 1,1 trillion private keys. When the private key is scanned, it is marked as scanned. So it won't show up anymore.
https://github.com/ilkerccom/bitcrackrandomiser
I did something like that with puzzle 64 using keyhunt-cuda.. it was a file of 17,666,000 ranges .. after 64 got solved, i was curious as to where the correct range lied in my file, you know where it was?
Line number 1+ million !!!!!
Doesn't work. But you could be more lucky and find the correct range in line number 10 or something in your file
What do you mean it didn’t work?! So you were going through sequentially versus random?
Here is what i exactly did:
1. Generate the entire 64 range divided as 17,666,000 sub-ranges sorted sequentially at first.
2. Randomize the sub-ranges completely
3. Search each sub-range line by line, so that each sub-range completed gets me 1 in 17.6 million chance of winning.
After someone solved 64 and the pvt key was revealed, i found out that right sub-range after randomization was in line 1 million.
i.e: i was never meant to solve it if i kept going forward with this plan.