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/bitcrackrandomiserI looked at your pool and code and it works well but there is a central server that assigns the ranges and receives the finished data and uploads that data to the server, None of the completed range data is left with the user, you would have to manually write down the assigned ranges. So we could just be used as bots to collect range data for the server owner to eliminate ranges for their benefit. and if the address is detected will the user really be the one notified? There is a test mode in the code, how do I run that?