increase the search speed of the Pubkeys, dividing the search range.

First of all, let me make it clear that this script is slow and basic, I did it like this in order to explain the range division method.

If you want to apply it quickly, modify keyhunt or other c++ code before compiling to make it work with this method.

The method consists in changing the parameters of the curve by x,y of a higher point (for the script I used pk#100).
by default the curve uses pubkey #1
what works in sequence 1,2,3,4....
pubkey #100
which works in sequence 100,200,300,400....

if we want to find pk# 3922
in a range of 2000:6000
in the traditional way we would need to advance +1900 pubkeys
In this method we will only need 19 pubkeys (1900/100).

the database is done by subtracting 1 consecutively from the target pubkey (in my case I need to subtract( 1), 100 times because I chose pubkey pk# 100 as divisor.

The trick is in your ability to use fast databases, the more pubkey you store in the database, the higher the divisor will be, therefore the search range is smaller.

I currently don't have what it takes to code in C++ using the quick search methods, my resources are limited to the basics.
I currently don't have an up-to-date pc to do the relevant tests (the disadvantages of the third world).

However, later I will share faster methods, ECC tricks.