Hi everyone, i will update the code today with a new version, this new version is a little more faster and use less RAM, using less RAM meaning tha you can load a bigger bP Table with a bigger K value.
Glad to see this project here on bitcointalk . I am using it from last many days and its quite impressive . I found it via iceland2k14 comments on his bsgs repo. Anyways i have some questions for you.
Thanks
1. What exactly are BP points and AMP points in your code. How are they calculated. Any specific formulae.
bP points are G values, G, 2G, 3G, etc...
aMP points vary with the the values -n value or -k value
check this link to see a good explanation of the BSGS algo:
https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/2. Where can i find BP file and Amp file after it gets calculated in your program. I am not able to locate any 1920 MB BP file generated for -k 30 im the directory.
My program dont generate that file by default, i really dont want to sature the HDD of the users of my program.
If you want to generate the bPfile by your own use the bPfile program is already compilied in the last version of keyhunt.
https://github.com/albertobsd/keyhunt/blob/main/bPfile.c3. -a how to make this file of precalculated amp points.
aMP Points change if you change your -n value or -k value. I can publish the tool to generate that file, but i need to add some "self-test" in the main program just to avoid that some user load a different or wrong files.
4. A question not related to this tool , i am supposing that this tool is calculating different key pairs at different spaces in a range. And matches the pubkey generated with the input pubkey - keyspace*G , my question is that since its comparing one single key from a keyspace of trillion keys then the output that its showing like 30 trillion keys scanned means that it actually matched 30 precalculated results from 30 trillion private keys. Right ? Or it is 30 trillions keys are converted to 30 trillion pub keys and matched in 30 second.
And what are K factor related to M , what is M here.
The program only do one math operation to check if one publickey is in a especific Range
https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/So only one publickey is generated from sustractions and additions and that is compared agains all the bloom filter (bPTable)
If you read the link you will see that if we have a Range N we get an M value getting the squaredroot of N, the K factor was an Iceland recomendation, we can load in the bloom filter kM elements from G to kM, and we only are going to need M/k operaions instead of the orginal M operations sugested in the link.
