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.
- Public-key systems (RSA, elliptic curves, Diffie-Hellman) rely on hardness that would vanish, breaking TLS, banking, digital signatures, secure messaging and most blockchain infrastructure.
- Society would need an emergency migration to information-theoretically secure schemes (one-time pads) or certain quantum approaches.
- The upside: optimal solutions for logistics, scheduling, protein folding and circuit design become feasible.
- Caveat: polynomial time can be useless with huge degrees or constants, and non-constructive proofs would change little in practice.
More from AGI Musings
- Disney's 1940 Fantasia already depicted the AI alignment problem, decades early — JeremyNguyenPhD · 2026-11-22
- Terence Tao's deeply physical problem-solving sparks debate: does intelligence require embodiment? — CatAstro_Piyush · 2026-11-22
- AI safety researcher urges US-China coordination on a common frontier AI red line — S_OhEigeartaigh · 2026-11-22
- Google reports first fully autonomous AI cyberattack: 'era of autonomous attacks has arrived' — aftahi_ai · 2026-11-22
- AI makers are mostly untrustworthy doomers — open distribution is the real path, argues thread — sebkrier · 2026-11-22
- Seth Lazar's Tanner Lectures 'Power, Justice, and AI' now open access at Oxford — random_walker · 2026-11-22