Elementary proof with 4.5k-line Lean formalization beats SOTA on Erdős problem 4
teortaxesTex · x · 2026-09-04
A new long-gaps result uses a strikingly elementary proof that seemingly slipped past analytic number theorists; its Lean formalization is only 4.5k lines and sets a new SOTA, improving beyond Sol's result on Erdős problem 4.
Related event: GPT-6-Astra Proves Prime Gaps ≤186 in Lean as Records Fall in Days(22 posts)→
More from Models
- GPT-6 Astra and Claude Fable 5.1 write $10,000 research papers — experts reject all — sayashk · 2026-10-21
- GitHub Copilot's HydraFusion Orchestrates Multiple Models Per Task — WirelessLife · 2026-10-21
- OpenVLHarness turns any MLLM into a visual reasoner, +9.9 points across 22 datasets — yining_hong · 2026-10-21
- User claims Gemini analyzed his tennis match video and improved his game — zacharynado · 2026-10-21
- Opus 5.5 tops OpenRouter spending in 20 of 29 task categories — mmurph · 2026-10-21
- Meta team builds open-source 30B LLM from scratch in months, hails 'second era' — TimDarcet · 2026-10-21