Quote from: Virtuose on Today at 03:35:47 PM

Quote from: teguh54321 on Today at 01:27:24 PM

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.

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