Quote from: viljy on Today at 09:54:27 AM

What are the possible solutions. For now, let's consider only the case of public keys, since going through addresses is uninteresting and useless, so there are two options:
A. Fast discrete logarithm algorithm. Whether it exists is unknown, just as it is unknown whether the expression P=NP is true. But there are two algorithms that, in a sense, can be considered as such: kangaroo and BSGS, since they reduce the complexity to O(n^1/2).
B. Probabilistic approximation, that is, in other words, a reduction in the search space, where the above algorithms can already be effective, working on reasonable resources, and not on all video cards in the world.

I am working in some probabilistic BSGS version it will increase the "probabilistic speed" but since probabilistic means drop some keys with unlikely endings or repeated patterns there is the possibility of a misshit.

Quote from: viljy on Today at 09:54:27 AM

There are no other options yet. And these are definitely not magic circles or "solstice of prime numbers" tables.

Yeah aggree with you 100% all those users writing BS should not be here.