Post #2712424

@RonJeffries@mastodon.social I don't intend to say I'd claim this solves P=NP, this is more complicated unsolved problem. This is because complexity classes have complicated structure and it links with the abstraction on concurrency and parallelism. OTOH, decision problems have a fairly clear notion of verification that has been linked with the problem. And P = NP would immediately imply the password verification problem could be inverted too easily (breaking most cryptography using sophisticated guesses).