Why a P=NP proof would collapse most of modern cryptography

doctorBobG · x · 2026-11-22

In a widely shared thread, Jenzi Scott explains the stakes if P=NP is proven with a practical polynomial-time algorithm for an NP-complete problem.

Original post →

More from AGI Musings

AGI Musings channel →