hey folks, i'm new here! about a year ago, I made this little script and used it now and then to dig through puzzle 66 key ranges, but no luck at all. now I'm on puzzle 67 and figured I should share it with you all.
it's a straightforward CPU script that checks a range of private keys in decimal format. it works well on slower machines since I can run it in the background while doing other things on my PC. my ryzen 5 5600x can handle scanning around 40-50,000 keys per second.
to get started, you'll need to:
- set the wallet you want to find
- pick the range for the script to search through [in decimals]
for instance, for puzzle 67, the hexadecimal range is 40000000000000000:7ffffffffffffffff, which translates to decimals as 73786976294838206464:147573952589676412927.
this script will check through the decimals you choose, and if it spots the right wallet, it saves the details to a text file.
it's pretty user-friendly and my first tool. I’ve been aware of BTC since 2018 when I was just 11 years old, and my parents haven't dabbled in crypto at all.
if you find it useful, I’d appreciate your support. hoping to create better tools down the line!
here’s a link to it on GitHub: https://github.com/dibzzy/Easy-Bitcoin-puzzle-key-scanner
thanks everyone, and hope this helps!
Hello, also new here: Is puzzle 67 related to "Bitcoin puzzle transaction ~32 BTC prize to who solves it"
https://bitcointalk.org/index.php?topic=1306983.0;topicseen
I am running Rotor Cuda on my second PC with an old Zotac Nvidia 1060 GTX and I am getting about 150.000.000 keys per seconds...
I am learning Python and try to also to make my way for scan private/public keys...
I think the fastest way to generate public keys with CPU is to use ice library
https://github.com/iceland2k14/secp256k1
you can use ice.point_sequential_increment(3500000, P)
So you have point P and in 2 seconds I get 3.5 million of next points (+G+G+G+G+G+G....) and then you can proceed with that array... That is the faster way than checking one by one
And when you are finished with 3.5 million of points then last point from that batch will be the next point P and then again ice.point_sequential_increment(3500000, P)
Keep experimenting... that is the only way to success
That's a terrible speed to get points of sequential keys, on a CPU. A good implementation can reach at least 20 million pubKeys / second, on a single thread, on a modest CPU.
thx for the feedback , yes i used this in the past but i upgraded my gpu recently and now im using some version of vanity search and im doing about 500mk/keys ... this cpu tool i made is for slower/older laptops .. its not that bad imo since its my first code .. good luck everyone finding puzzle 67