Cryptographer says frontier LLMs refuted every P=NP trick from his 30-year attack
naval · x · 2026-10-29
naval resurfaces a claim that open-source cryptography experts are quietly using frontier models to attack crypto problems. In the quoted thread, an expert who built SHA-256 as a Boolean circuit says he fed 30 years of P=NP reasoning to frontier LLMs, which "thoroughly and convincingly refuted" every line of his argument; he argues SHA-256 inversion is likely NP-complete.
More from AGI Musings
- Developer ditches 'deep work': with agents, juggling 100 problems beats flow state — zack_overflow · 2026-10-29
- a16z's Andrew Chen jokes AI agents will exhaust all 415 area code numbers — andrewchen · 2026-10-29
- Scott Aaronson on AI Cracking Decades-Old Math Problems: Are Mathematicians Obsolete? — romanyam · 2026-10-29
- Anthropic mocked for poor AI-risk messaging: right about the issue, wrong in delivery — NathanpmYoung · 2026-10-29
- Theoretical CS is applied math, and applied math should inform practice — beenwrekt · 2026-10-29
- Claire Vo: Teams slowest on AI adoption face the biggest cyber risk — DavidWells · 2026-10-29