Hi every one, i'm new in this forum i'm developer.
I want to open this thread to talk about the tool that i develop
Keyhunt available on github.
https://github.com/albertobsd/keyhuntKeyhunt use the BSGS algorimth to find privatekeys with the publickey, the program runs on CPU and make several use of RAM to boost the speed.
To try to find the privatekey from the 120 puzzle you need to add this publickey "uncompress" to a txt file:
04ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a26302b195386bea3f5f002dc033b92cfc2c9e71b586302b09cfe535e1ff290b1b5ac # Uncompress publickey from the compressed Address : 17s2b9ksz5y7abUm92cHwG8jEPCzK3dLnT
you can run the tools agains that file:
./keyhunt -m bsgs -f 120.txt -r 800000000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF -R
[+] Version 0.1.20210112 BSGS
[+] Setting mode BSGS
[+] Setting random mode.
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Setting N up to 17592186044416.
[+] Init bloom filter for 4194304 elements : 7.00 MB
[+] Allocating 128.00 MB for aMP Points
[+] Precalculating 4194304 aMP points
[+] Allocating 144.00 MB for bP Points
[+] precalculating 4194304 bP points
[+] Sorting 4194304 elements
[+] Thread 0: 0000000000000000000000000000000000d80083712e9650075586dd5e162d44
[+] Thread 0: 0000000000000000000000000000000000f92eb8e27b7fb1bd2ec4eb4ac223a1
[+] Thread 0: 0000000000000000000000000000000000dda9ebacc83b0f0d1d36829fcc17b7
Total 35184372088832 keys in 30 seconds: 1172812402961 keys/s
[+] Thread 0: 0000000000000000000000000000000000ac445f232e0207b9cf46b73e106fed
Well in that example (same in github) we can reach 1Terakeys/s with one thread, and latter 8 Terakeys/s with a param
-n 1000000000000000I will release a new version in this next with that version can reach some 100 Terakeys/s and upto 1 Petakeys/s with some 16 GB of RAM and 5 threads
FAQQ: Why the Progress is not displayed?
R: The speed depent of the number of target publickeys if you load 1000 publickeys, it will take some more time, the speed is only displayed when at least one thread finish one of his cycles
Q: Can we faster this code with Gpu?
R: Well yes, but the BSGS algo use RAM, only high end video cards have a lot of RAM, for GPU is better to use Kangaroo
Q: How long will take the scan the 120 bit range?
R: Human brain usually can't handle big numbers, the 120 bit space have
664613997892457936451903530140172287 (six hundred sixty four decillion...) and we speed is about
1000000000000 (one trillion or one terakey/s) the spected time acording with your speed is:
Puzzle 120 @ 1 Terakeys/s : 21074771622667996 years
Puzzle 120 @ 1 Petakeys/s : 21074771622667 years
Q: Why should i keep using brute force tools?
R: You should not, but people hope in luck.
Nexts releases- BSGS with K factor
- Network/Pool versión
- Pollard rho
Best regards!