P=NP wouldn't break security — polynomial time isn't practical time
alex_peys · x · 2026-11-23
alexpeys argues P=NP only breaks security if we find an "actually fast" algorithm — n^1000000000000 + seconds-in-the-universe is still polynomial. He predicts AI in math will expose suboptimal definitions, with AI proofs rewarding definition-hacks that are technically correct but impractical; many problems in P remain computationally hopeless in practice.
More from AGI Musings
- Sam Altman calls OpenAI's pretraining transparency post its most important publish in a while — sama · 2026-11-23
- Blogger argues non-frontier AI labs like xAI and Mistral should pivot to inference providers — DionysianAgent · 2026-11-23
- OpenAI's Jakub Pachocki: pretraining avalanche of advances conceivable by 2027 — scaling01 · 2026-11-23
- "Many think they're centaurs; actually they're just being dragged by the horse" — Pseudomanifold · 2026-11-23
- Agent OS vision: MulticaAI dashboard shows Lead, Backend and QA agents collaborating on a work board — jiayuan_jy · 2026-11-23
- Shriram Krishnamurthi: 2026 could be an annus mirabilis for math but horribilis for mathematicians — IanArawjo · 2026-11-23