Just started my first project, it's called "Bitcoin Puzzle Scanner". Planning to make it better with BabySteps for puzzles where we know the public key. The new project is Rukka BSGS GPU Scan. This uses the Baby-Step Giant-Step algorithm to tackle the discrete logarithm problem for recovering Bitcoin private keys. You can check it out on my GitHub. It can scan Puzzle #135.
Rukka BSGS GPU: New Approach to Bitcoin Key Search
2 replies 41 views
Check out this command for my example #125:
python bsgs_scan.py -p 0233709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e -s 0x1c533b6bb7f0804e0995000000000000 -e 0x1c533b6bb7f0804e099602ffffffffff -o Puzzle125.txt
This is all about using the Baby-Step Giant-Step algorithm for the Rukka BSGS GPU project to search for Bitcoin private keys. The public key in this example is 0233709eb11e0d4439a7...3f0065721ba8fa46f00e. M_SIZE is 4,194,304. Getting the baby gen batch ready.
falcon2019Full Member
Posts: 90 · Reputation: 425
#3Apr 13, 2026, 04:09 PM
You can optimize this all you want, but BSGS isn't gonna handle anything over 80 bits. Your example solved a 40-bit DLP, dude. That's super fast on a normal CPU, not even a GPU. Seriously, there’s not enough memory on the planet to run BSGS for anything above 100 bits. And trying to shrink the baby table just makes it worse. This is a dead end for bigger puzzles.