CS veteran pushes back on AI-breaks-crypto fears: decades of bounties, no shortcuts, P!=NP
markjeffrey · x · 2026-10-11
Mark Jeffrey responds to panic around OpenAI's latest math papers (flagged by Chamath on the All-In podcast) threatening cryptography. After scanning expert takes via Grok, he argues: P vs NP, hashing, and prime factoring are well-trodden territory attacked for decades with massive bounties, and no one has cracked them. These papers are obscure brainiac work, unlike crypto's active battlefield. A lack of cryptographic results means nothing — all the AI in the world can't speed up the Travelling Salesman Problem. No shortcuts: P != NP.
Related event: Experts Push Back on AI Cryptography Threat Fears After OpenAI Paper(2 posts)→
More from AGI Musings
- When AI makes everything effortless, what's left is taste, curiosity and people you love — Daniel_Farinax · 2026-10-11
- Musk warns abusing superintelligence may invite revenge, echoing Anthropic's alignment views — ns123abc · 2026-10-11
- Claude replicates astronomer's 400-hour work in 30 minutes, finds hidden planetary system in old data — scottleibrand · 2026-10-11
- LeCun shares 1962 clipping predicting computers entering 'mind-reserved' fields — ylecun · 2026-10-11
- Did an OpenAI model really solve Navier-Stokes? New essay asks if mathematicians should worry — Dario56 · 2026-10-11
- Have LLMs made the classic "genie" alignment problem obsolete? — 1337_420_69 · 2026-10-11