Prime parity proof: 5,488 lines of Lean 4 written with Claude Code, zero sorry
xennygrimmato_ · x · 2026-11-06
Technical numbers behind the new prime parity algorithm: x^o(1) time (down from x^(1/2+o(1))); works on any interval [A, B], not just short ones; one query to Anthropic's #SAT engine; 5,488 lines of Lean 4 written with Claude Code; zero sorry and 3 standard axioms; 855,150 intervals checked numerically. Caveats: no prime finding or exact π(x) — impractical at real sizes, and it rests on Anthropic's ETH proof, under review and not yet human-checked.
More from coding & agent
- How to automate one recurring task with AI agents: a step-by-step guide — Mahmoud_Zalt · 2026-11-13
- Claude Meetings lets work finish before the meeting even ends — Flomerboy · 2026-11-13
- johnlindquist: 'Best tool for the job' is now 'benchmark everything, ship the winner' — johnlindquist · 2026-11-13
- AIE Code Summit wraps 10th edition with three themes: Factories, Type One models, Dreaming bigger — altryne · 2026-11-13
- Athena v1.2: Local MCP Server Gives Coding Agents AST-Based Blast Radius in 14 Languages — Significant-Log-4272 · 2026-11-13
- 'Look at your data': Evals for AI Engineers book makes the rounds at product meetup — sh_reya · 2026-11-13