OpenAI and Anthropic reportedly attacking P vs NP — what would a constructive P=NP proof break?
MohMayaTyagi · reddit · 2026-09-11
The poster claims OpenAI, and likely Anthropic, are attempting the P vs NP problem with an unknown timeline. Intuitively favoring P ≠ NP, they open a discussion on the real-world short- and long-term implications if a constructive proof of P = NP were found — most immediately for cryptography — inviting input from those with math or theoretical CS backgrounds.
More from AGI Musings
- DeepMind researcher: all of mathematics will soon be formalizable, with agents hunting proofs — ChrSzegedy · 2026-10-28
- AI reply bots are degrading X discourse, a 'Gresham's Law' for social replies — generativist · 2026-10-28
- Be prepared: your life's research problem could be solved by a stranger's idle AI prompt on a commute — fkasummer · 2026-10-28
- A fine-tuned 'cat obsession' control fools every AI welfare criterion — MirrorEthic_Anchor · 2026-10-28
- OpenAI researcher: frontier AI ideas can't be patched for safety after the fact — willdepue · 2026-10-28
- Big Short's Eisman: the whole market is now 'one trade' on AI — and it 'better succeed' — SumitGup · 2026-10-28