So you went from prob. stat. 90% reduction achievements straight to breaking the DLP sqrt(N) bound theorem, which is proven for 40 years?

The public keys are nothing more than labels, unless one actually breaks the EC math itself. In a N-bit set / interval / whatever, there are 2**N colors. Or 2**N emojis. Or 2**N fruits. Using any kind of binary logic on their index / value / counter has exactly zero relevance, because it is totally relative and can always be rebased to some other base value. This is like saying you have telepathic capacities and can read someone's mind when they think of a color / emoji / fruit.

And it would be a stupid idea to solve 135 using a 100-bit solver, it just increases the complexity terribly, no matter how you approach the problem (splitting to 2**35 100-bit solve steps, introducing statistical non-sense, mixing unicorn algorithms, etc.). Because it would defy the laws of nature to find something that goes below sqrt(N) (on long-term average, not on a lucky hit exception).