Imagine P=NP: Verifiable Tasks Solved by Compute, Security in Tatters
gleech · x · 2026-11-21
A shared thought experiment: in a world where P=NP, any easily verifiable task could be accomplished with compute alone, giant gaps would open in all security systems, and machines could autonomously solve the biggest open math problems—an analogy for compute, verifiability, and AI safety.
More from AGI Musings
- Hassabis predicted 2 years for AI to crack a Millennium Prize problem; 6 months later, both Riemann and Navier–Stokes have proposed solutions — Hesamation · 2026-11-21
- Terence Tao on AI math: 'strip mining' that wins proofs but teaches us nothing — yacineMTB · 2026-11-21
- Anthropic claims Claude proved the Riemann hypothesis; Stanford posts all-human rival proof hours later — The Decoder · 2026-11-21
- From Coding to Medicine: Every Profession Will Rework Itself Around AI — ayushthakur0 · 2026-11-21
- Riemann Hypothesis proof passes independent Lean kernel checks: 17M lines, zero rejections — flngr · 2026-11-21
- "RH is not even a sliver of what is coming": investor says AI math breakthroughs validate his forecasts — burny_tech · 2026-11-21