Hacker News · AI·· 2 h agoAI score60
Rebuilding a Master's Thesis Proof on the Riemann Hypothesis With a Multi-Agent AI Harness
Revisiting my Master's thesis with AI – Understanding the Riemann Hypothesis
AI summary
A mathematician rebuilt the proof from his 2011 master's thesis on squarefree numbers in arithmetic progressions with polynomial moduli using a self-built harness of Claude Code and Codex agents on $20 subscription plans. The neutral run reached the main-term asymptotic for x^(7/9+δ) ≤ f(y) ≤ x^(1−δ), with nine proposition proofs written by Claude Sonnet 5.5 and Codex handling planning, numerics, refereeing and integration. The AI readings also flagged bookkeeping gaps in the printed thesis and a factor-of-two error in its leading constant, which the experiments corrected to about 0.138083 for f(k)=k²+1.
Source:Hacker News · AI · riemannhypothesis.blog