Ok, so I think I understand how this works... certainly has some interesting potential.

Couple questions...

1. If I am searching a higher range, the most this will script will give me is a distance of 2^32 from the unknown pk. Since it's unknown where the target begins, there's no way to know how many 2^32 jumps are needed to encompass the entire range. (for this example, I'm searching puzzle #130)... What would I need to do so that I can be sure the entire range is covered? Would I need to re-run the script multiple times using subtracted vales as inputs?

2. What range values should I enter in the script? Should I start from 0 to upper range limit, or only the range I'm searching?

It's been decades since I've thought about any advanced math topics, so it may take a bit to wrap my head around this type of stuff. Definitely interesting though!

Thanks