Hmm but im against this. From what i discover now. Some long adress prefix actually have some significant distance between them.
I can skip trilions of key before continue brute force . And yes there a chance of missing it if the skip to far away. now im gathering bout quadrilions of keyspace and look the lowest distance between those prefix. And only skip half of the lowest distance that i discover , so it will be consider safe skip
What you're discovering is simply how elements are distributed in a uniform distribution. You could search for prefixes across the entire space by jumping randomly, then calculate the distances between the prefixes using the jump index (instead of using the private key), you would get the same results (assuming the hash functions aren't rigged).
What you're doing is like trying to find the ace of hearts in a deck of 52 cards, and skipping 5 cards if you find an ace of another suit, because on average the distance between adiacent aces in a shuffled deck is around 10.6