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.

Original post →

More from AGI Musings

AGI Musings channel →