I still dont see how skipping is more efficient than scanning everything.
A certain density of X bits prefixes (what you call being lucky) in an arbitrary range has zero impact on the probability of finding something on the next key, or on 100m keys later.
You can think of it this way : since distribution is random, any key can be replaced by any other key. As a result changing the traversal order does not improve odds of success.
Everyone can say that scanning by jumping is not logical.
But I explained that it is possible with PROBABILITY calculation and some data.
Example;
You bought mixed colored candies sold in the market. You prioritize the colors or flavors you like. Then it is up to you to eat or not eat the others.
Actually, the range is within a certain area. But since your hardware power is too much, I understand that you do not want to miss it.
I can prove it to you like this.
Send me a few wallets in order. I will tell you in which direction and how far away the nearest 1MVDYgVaSN prefix is on AVERAGE.