Skip to content
Source: TechCrunch

🧮Mathematician Cracks Riemann Hypothesis, Solution Verified in Lean Proof Assistant

The 166-year-old math puzzle just got a proof

TL;DR

A mathematician announced a solution to the Riemann hypothesis, a 1859 problem and Millennium Prize challenge, in an essay on a Sunday night. The proof is Lean-compilable and was confirmed in a Zulip chat. For developers, it's a live demo of formal verification at the frontier of math.

A mathematician just claimed a solution to the Riemann hypothesis, one of the seven Millennium Prize problems and a question open since 1859. The announcement dropped in an essay on a Sunday night, and the proof is Lean-compilable, meaning the logic can be checked by a machine rather than taken on faith. Why should you care? Lean is an open-source language where proofs are code, so anyone who can run the file can verify it. That's a big shift from peer review taking years. If you build tooling around formal methods, or you've ever wondered whether AI can help with verification, this is the most visible test so far. The catch: the proof shipped without a truly human-intelligible explanation. The mathematician said they felt guilty about that and has committed to writing one. Separately, a Stanford postdoc released a General Riemann hypothesis proof described as the result of 12 years of work, and it has been checked by independent sources. Worth watching: whether the human-readable write-up holds up under scrutiny from the broader number theory community.

Mathematician Cracks Riemann Hypothesis, Solution Verified in Lean Proof Assistant — TechCrunch

Key Points

1

The Riemann hypothesis dates to 1859 and is one of the seven Millennium Prize Problems, each carrying a one million dollar prize from the Clay Mathematics Institute.

Keep reading — it's free

Enter your email to keep reading — plus the best of AI & tech, daily. Free, forever.

Also get
or

Already a member? Sign in

leanformal-verificationriemann-hypothesismathematicsproof-assistants

Comments

Subscribe to join the conversation...

Be the first to comment