3 months of Claude Code on Erdős #993 — a full proof appeared last week
Odd-Sympathy1274 · reddit · 2026-10-05
A Reddit user has had Claude Code and Codex grinding since July on Erdős Problem #993 (unimodality of the independent-set sequence of trees, posed 1987). A literature check today found a complete proof posted last week by Tong Zhang and Wei Li, with two Lean 4 formalizations already claiming clean builds. Not yet peer-reviewed; links to the Zenodo paper, two GitHub Lean repos, and the erdosproblems.com page.
More from coding & agent
- Ponytail Hits 150k+ Stars Telling AI Coding Agents to Stop Overbuilding — we93 · 2026-10-05
- Dev predicts companies will wall off MCP servers, ushering in agent-to-agent era — JosephJacks_ · 2026-10-05
- Dots and Muse AI Coding Tools Can't Resize Browser Below ~500px, Blocking Mobile Testing — pkragthorpe · 2026-10-05
- Dev orchestrates 6 AI skills for a test-fix pipeline, spending just $3/week on DeepSeek — Own-Awareness8037 · 2026-10-05
- fastapi-gql-mcp: one GraphQL MCP surface cuts tool tokens from ~11k to ~2.5k and stops payload bloat — tangkikodo · 2026-10-05
- Tencent Hunyuan's RSR Boosts 27B Model Terminal-Bench 2 pass@3 from 57% to 74% — Tencent-Hunyuan · 2026-10-05