Anthropic claims 3SUM bounds breakthrough with Lean-verified Claude-assisted proof
HankYeomans · x · 2026-10-07
A much-discussed result: Anthropic, using Claude, improved polynomial bounds on 3SUM-family problems — potentially a major step toward P=NP. The release scheme is notable: the proof was formalized in Lean so correctness is machine-checked, then Anthropic contacted the original authors, offering compensation and Claude access to co-write the paper. Commenters see it as a promising model for AI-academia collaboration, opening follow-up research on further exponent reductions.
More from Research
- Fields Medalist Bao Chau Ngo on AI proof of Riemann Hypothesis: treat AI output as data — Dr_Atoosa · 2026-11-22
- AI-written six-page proof of Deligne's bound lands, checked only by Claude models — Singularitarian · 2026-11-22
- AI math pace outruns expert timelines: two Millennium Prize-level problems now reportedly solved — haider1 · 2026-11-22
- Darmok AI solves all 7 Times Crossword Championship puzzles, beats human champ by 3m13s — rohanpaul_ai · 2026-11-22
- Do adaptive optimizers still work? Reddit users doubt it for flow-matching models — Inevitable_Pen9043 · 2026-11-22
- Thinking Machines' loop dial tested: 3 inner loops cut written reasoning 41% while MATH accuracy rose to 99% — SonglinYang4 · 2026-11-22