basically by changing Gx, Gy for example by pubkey of pk #1000
the sequence of the curve would be 1000,2000,3000,4000...
and you will wonder what happens with 1001,1002,1003...1999.
for that you subtract 1, 1000 times from the target and store it in the database.
If you search for 10924, and subtract 1000 times 1, the database would look like this: 10923,10922,10921...10000...9999,9998.
therefore you would find the pk 10000 in 10 steps, and you would know that your target is in the range 10000-10999
So the database is our actual target and some of it's offsets and we select a known key and add it as target so the script adds or subtracts from our known key until it lands on any one of the keys stored in database?
Is data base file loaded into the RAM? How many keys per second can we generate and compare at the same time?
This looks good as an idea, but in reality the performance is not what we need. Thanks for explanation.
the script is basic, it was made on purpose to expose the idea from the beginning clarify that the script was made for that nothing else, change the curve for pk# 2 in keyhunt or other software before compiling, subtract 1 time from the target, divide the range by 2.
and you will be doubling your speed.
it is not the same to jump x key to change the curve and apply scalar, double and add.