I'm just now seeing this, is this worth trying to use?
No it not worth the time or effort
./bPfile 3355443200 bPfile.bin
The file is 90 GB and the process continues, how do I calculate the final file size and creation time?
each bP item is 32 bytes in disk.
In RAM is about ~24 Bytes
2. A 100 GB file was created.
./keyhunt -m bsgs -f 50bit.txt -b 50 -R -k 800 -t 12
I don't notice any performance gain from bPfile.bin.
The only performance is the time to generate the bPitems in runtime or read those from disk, anything else (Final speeed) is going to be the same
./keyhunt -m bsgs -f 1-63.txt -R -t 12 -r 0000000000000001:8000000000000000 -k 800
File 1-63 contains public keys 1 through 63 of the puzzle bits.
more than 1.5 hours passed, nothing went wrong, although if you make one public key of 63 bits, it finds it quickly.
upd. Understood, it was necessary to remove the -R parameter
The mode bsgs works with each publickey individualy, this mean that 1 publickey give you some speed but 2 publickeys give you the half of that speed and so on...
It remains to understand whether the bPfile.bin file is necessary, since I did not notice any benefit from it, except for the 100GB of space on the ssd.
When people stop and rerun the program so many times the bP file is good but is you are going to let it run for months then the file is useless.
anyone wondering if this is legal, or nah... ?
I made this program for the puzzles.
Is it possible with the help of a key hunt to make base58 > hash160?
All functionality is available, someone even created it for windows.
https://github.com/kanhavishva/b58decThis can be useful for preparing a bloom filter for Brainflayer.
there are some tools that can do that.
Trying to make on Ubuntu(WSL)
can anyone help with the below error?
/usr/bin/ld: cannot find -lgmp
collect2: error: ld returned 1 exit status
Install libgmp
