└─$ ./keyhunt -m bsgs -f tests/testpubkey.txt -k 1500 -S -t 10 -b 66
- Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
- K factor 1500
- Threads : 10
- Mode BSGS sequential
- Opening file tests/testpubkey.txt
- Added 1 points from file
- Bit Range 66
- -- from : 0x20000000000000000
- -- to : 0x40000000000000000
- N = 0xfffb4000000
- Bloom filter for 6291456000 elements : 21566.38 MB
- Bloom filter for 196608000 elements : 673.95 MB
- Bloom filter for 6144000 elements : 21.06 MB
- Allocating 93.00 MB for 6144000 bP Points
- processing 6291456000/6291456000 bP points : 100%
- Making checkums .. ... done
- Sorting 6144000 elements... Done!
- Writing bloom filter to file keyhunt_bsgs_4_6291456000.blm .... Done!
- Writing bloom filter to file keyhunt_bsgs_6_196608000.blm .... Done!
- Writing bP Table to file keyhunt_bsgs_2_6144000.tbl .. Done!
- Writing bloom filter to file keyhunt_bsgs_7_6144000.blm .... Done!
- Total 36893523135430656000 keys in 720 seconds: ~51 Pkeys/s (51241004354764800 keys/s)
End
Your precious key is not in this public key range.
Provide some more let's scan.
We will hit the key soon and share some funds too.
So you used around 20GB of RAM for this scan or am I reading it wrong? I wouldn't waste my time with findings based on similarity of addresses, just because a public key has a somewhat similar address to another key which we know is in 66 bit range doesn't mean the key of that address is in the same bit range. There could be billions of such addresses in 2^255+ range, should you go and search there if we find a look a like address in those ranges?
If solving a puzzle was that easy by just comparing addresses with each other!!! More equipped people would have taken the coins long ago. Actually lowering the bit range down to 66 bit is as difficult as solving DLP.
Though if you have spare resources, I could ask to go for a certain key whenever I am sure about it's exact range.😉