Lean-checked step past 1986 bound on Erdős #357, argued with GPT Astra
kevrussell · x · 2026-11-03
Kevin Russell, working with GPT Astra, produced a candidate improvement on the any-order version of Erdős Problem #357: for every k ≥ 10^22, k distinct integers whose consecutive-run sums are all distinct need numbers above (3/2 + 10^-10)k, passing Hegyvári's 3/2 bound from 1986. The argument comes with a Lean proof that Lean accepted, audited by Ford with no gaps found; sources and audit receipts are on GitHub. The authors stress every review so far is AI-only — no human expert has refereed it — and the gain is tiny, holding only for enormous k.
Related event: GPT Astra Helps Advance Lower Bound on Erdős Problem #357(3 posts)→
More from Research
- RoboArchitect turns frozen VLA policies into memory-equipped robot agents, lifting success rates — _Hao_Zhu · 2026-11-03
- ARC Prize 2026 closes with 18.5K entrants and 67K submissions, winners due December 4 — GregKamradt · 2026-11-03
- Should AI read cardiac MRI first? Lancet Digital Health study on ejection fraction — EricTopol · 2026-11-03
- "Emergent capability" claim mocked; Fleet hiring researchers to automate mech interp with frontier models — sebkrier · 2026-11-03
- Goodfire's Neural Geometry series: steering models along manifolds — burny_tech · 2026-11-03
- Prediction: an open model rated for 10M context within 3 months — teortaxesTex · 2026-11-03