Why Lean Code Matters for Verification
Levent Alpöge, a mathematician at Anthropic, announced Friday that he proved the Riemann hypothesis using the company's AI model, Claude. He published a four-page note on his personal website detailing the claim. The proof exists as code written for Lean, a formal verification tool that checks every logical step.
Breaking news
Samsung Shifts Galaxy Watch Strategy to Two-Year Release Cycle
Tesla rolls out FSD v15 with major safety upgrade
Open-Source Tools Challenge AI-Powered Development Platforms
AI Infrastructure Bottlenecks: Why Release Pipelines Hold Back Fast ClustersThe Riemann hypothesis is the most famous open problem in mathematics. It concerns the distribution of prime numbers. Riemann proposed it in 1859. A proof would reshape number theory and cryptography.
Alpöge did not publish a traditional written proof. Instead, he released machine-checkable code. Lean is a proof assistant that validates logic line by line. This approach reduces human error. Mathematically, the code must compile without errors to be valid.
What Happens If the Proof Holds?
Critics may question whether AI assistance counts as a human proof. Alpöge's note explains his role versus Claude's role. The AI handled computational search. Alpöge guided the strategy. This hybrid method is new for a problem of this magnitude.
If verified, the result would settle a 165-year-old conjecture. Prime number distribution would gain a complete theoretical framework. Cryptographic systems relying on prime gaps would need reassessment.
Other mathematicians will now scrutinize the Lean code. Independent verification is the next step. The mathematical community typically requires peer review before accepting such a result.
Frequently Asked Questions
Is the proof already verified by other mathematicians? No. The proof exists as Lean code. Independent verification is pending.
What is the Riemann hypothesis? It states that all non-trivial zeros of the Riemann zeta function lie on the critical line. It remains unproven for over a century and a half.
How did Claude contribute to the proof? Claude handled the computational search for logical steps. Alpöge directed the overall strategy. The final artifact is machine-checkable code.

