An interesting post that you link to.

Not interesting because it refines the truth, but interesting because it elaborates the mistake of trusting public key cryptography.

Your 'prime' paradigm consists of vectors, or whatever, with 24 or however many sections. That starts with an underlying understanding which precludes understanding why pkc can never be secure.

"Math" is a science, and like all academic sciences it does not reflect nature directly, but rather several steps removed. There is "something", then there is "something a person understands" etc etc etc and eventually there is a science as a group project.

So "primes" cannot be organized in a way that reflects something that is derived from them, as your post suggests. You cannot give a person an orange and say "I bought a hundred gallons of orange juice and managed to build this orange out of it".

So the initial point about pkc is that there are two competing variables.

There is "any" algorithm, then there is the product of that algorithm.

If there is a gross discrepancy such that patterns in the product of the algorithm e.g. bitcoin address, advances at a much slower pace than the complexity of the algorithms then you cannot create what people call 'secure' pkc. Because you can find patterns in the product i.e., 'bitcoin addresses' for example that are computationally inexpensive compared to the 'initial' algorithm. Maybe why ltc is computationally heavier than btc.

It doesn't seem to be a big secret, but it also is not something discussed publicly, for reasons that are probably not what most 'insiders' would be comfortable admitting.

PKC is a massive globalist fraud which is designed to profit the individuals who have power in the melting pot.

As long as they can keep the discrepancy between algorithm/product patterns hidden they can maintain control over the trillions of dollars controlled by the pkc scam.

They do this in part simply by preventing access to computers powerful enough to let people demonstrate the discrepancy in 'secure' algorithms.

Anybody can demonstrate it using simple algorithms.