Why not reach these addresses yet?
 Each of these is in completely different points, as I may think that there is no!

 1PWo3JeB9jrGwfHDNpdGK54CRas7BJwzGg
1PWo3JeB9jrGwfHDNpdGK54CRas8JAZddJ
1PWo3JeB9jrGwfHDNpdGK54CRas7sVHpYM

1PWo3JeB9jrGwfHDNpdGK54CRas7o1Quvw
1PWo3JeB9jrGwfHDNpdGK54CRas7SKdbnS
1PWo3JeB9jrGwfHDNpdGK54CRas7JiafEz
1PWo3JeB9jrGwfHDNpdGK54CRas79PsfyU

Dude, my craps bet (which is actually yours) is exactly what you described as "natural to bet that 6 doesn't appear again in 4 rolls". So if there's anything crappy about it, it was your original statement, which was proven to be false. If you happen to find something's wrong with it, please let me know and I'm happy to refactor it according to your conditionals or whatever. But the results will be identical, since it's simply empirical proof that in whatever 4 rolls (sequential, skipped, timed out and resumed, changing the dice, etc etc etc), any value has a 51.8% chances of showing up at least once. Conditionals are irrelevant, just like skipping is irrelevant. I think you should be the one to go back to the drawing board here.

If you have some other statement about something, or you discover what's wrong with the simulations (not flakes of snow) let me know. Congrats on discovering and demonstrating that there's a 63% chance of success to hit X at least once, when p=1/N, in N tries, btw. No one really bothered to do the math on that one. You're definitely the first.

Forget it, this guy’s ego is so inflated he never even considered that if prefix search actually worked or had any real merit, academics would’ve published on it by now. But there’s nothing because it’s just hot air. You can use any kind of filtering you want, but without the public key, you’ll still end up brute-forcing every private key anyway. In fact, its so-called "prefix search" just makes things less efficient. Good luck to him on his impossible quest.

What about prefix jump ? Example after find  1PWo3JeBthen prefix then jump 1-3  trilion key ...

Mybe have to test safe jump range and how many prefix digit.  

Seems the aaaa bbbb filtering only reduce less than 2% 🙃. Now im focusing on finding sample range from quadrilion of keys to consider the safe jump range

Filtering doesn’t actually reduce the work in this context because you still have to find the correct value before you can filter it. It’s like claiming you can pick winning lottery tickets faster by throwing out the losing ones, but you still have to check each ticket to know if it’s a winner. With private keys, unless you already have extra information (like a public key prefix that actually leaks some useful bits), every candidate has to be generated and checked in full. Filtering after the fact doesn’t magically cut down the number of computations, it just adds an unnecessary layer. You can only filter something once you’ve already done the work to find out if it matches or not so there’s no real gain.

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).

The further you go with your search for the "minimum distance", the more likely you are to find two close prefixes, and your "safe jump" will keep getting smaller

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

The hash's rigged.

There is no way that, with whatever 15 digits prefix, you'll ever find two private keys on secp256k1, right next to each other, having a common 15 digit base58 prefix in address.

Is this what you wanted to hear? If so, learn that it's wrong, and it's basically a certainty that with any 15 digit prefix you choose, somewhere on the curve, there will be 2 adjacent keys sharing that address prefix.

15 digits ~= 88 bits

Chance to find 2 in a row: once in ~176 bits

Curve order: ~256 bit.