Comment by perching_aix

Yeah, happy to see. Wouldn't it be cool if the many computational hardness assumptions were no longer just assumptions? If the algorithms and implementations used would no longer require the holy blessings of arbitrary - if credentialed - researchers?

Or consider the algorithmic complexity classes underpinning all of this, not just P vs NP, but also whether quantum computers are actually a distinct class, since that is not proven yet either afaik. The reason we're moving to quantum resistant algos in the first place.