<!-- mobian-agent-page publisher="dailydev" canonical="https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw" -->

---
title: Lean verification of the Riemann Hypothesis | daily.dev
description: The Lean and Mathlib communities have certified that Levent Alpöge's Lean proof of the Riemann Hypothesis is correct. Alpöge released the proof on November 20,...
canonical: https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw
twitter:card: summary_large_image
twitter:site: @dailydotdev
og:type: website
og:site_name: daily.dev
og:title: Lean verification of the Riemann Hypothesis | daily.dev
og:description: The Lean and Mathlib communities have certified that Levent Alpöge's Lean proof of the Riemann Hypothesis is correct. Alpöge released the proof on November 20,...
og:url: https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw
og:image: https://api.daily.dev/og/posts/PzmEKFukW.png
og:image:alt: Lean verification of the Riemann Hypothesis
og:image:width: 1200
og:image:height: 630
og:locale: en
---

> ## Documentation Index
> Fetch the complete documentation index at: https://daily.dev/llms.txt
> Use this file to discover all available pages before exploring further.

# Lean verification of the Riemann Hypothesis

**[Hacker News](https://daily.dev/sources/hn)** · 2 min read · 0 upvotes · 0 comments

## Summary

The Lean and Mathlib communities have certified that Levent Alpöge's Lean proof of the Riemann Hypothesis is correct. Alpöge released the proof on November 20, 2026, as a Lean library of 17 million lines of code depending only on Mathlib. The community verified it against four criteria: the Mathlib statement is correct, the library compiles without errors, the code proves exactly that statement (confirmed by two independent tools, comparator and con-leche), and the exported proof passes multiple checkers, including Lean's kernel and the con-leche and con-ron checkers, which carry a formal proof that they cannot accept a false proof.

## Full article

daily.dev links to this article rather than hosting it. Read it at the original source: <https://leanprover-community.github.io/blog/posts/riemann-hypothesis>

## Questions this post answers

### Who released a Lean proof of the Riemann Hypothesis and how large is the codebase?

Levent Alpöge released a proof of the Riemann Hypothesis as a Lean library on November 20, 2026, comprising 17 million lines of code. The codebase depends directly only on Mathlib. The Lean and Mathlib communities, endorsed by the Lean FRO and the Mathlib Initiative, verified and certified the proof as correct.

_Developers tracking milestones in formal verification can follow proof-assistant news like this on daily.dev._

### How was the Alpöge Riemann Hypothesis Lean proof verified for correctness?

Verification covered four criteria: confirming Mathlib's RiemannHypothesis statement is correctly stated, confirming the library compiles without errors, confirming the proved theorem exactly matches Mathlib's statement using two independent tools (comparator and con-leche --compare), and checking the exported raw proof with multiple independent checkers including Lean's official kernel, con-leche, and con-ron.

_Anyone evaluating trust in formal proofs can dig into verification methodologies like this via daily.dev._

### How do the con-leche and con-ron proof checkers guard against a flawed Lean logic accepting a false proof?

The con-leche and con-ron checkers come with a formal proof, relative to set theory, that they cannot accept a false proof, addressing concerns that Lean's underlying logic could have flaws a malicious proof might exploit. These checks ran on an inert export of the proof, kept out of reach of any hypothetical malicious code in the original Lean proof sources.

_Engineers reasoning about trust boundaries in verification tooling can explore details like these on daily.dev._

## Community take

How the wider developer community reacted, aggregated from 1 discussion and 897 comments across hackernews (as of 2026-11-22).

**TL;DR:** Discussion barely engages with the Riemann Hypothesis proof itself, instead spiraling into a long, heated debate about AI alignment, existential risk, and whether a 17-million-line machine-generated/verified proof that no human can fully grasp counts as genuine human knowledge or understanding.

**Sentiment:** 15% positive · 30% mixed · 55% skeptical

**The case for**

- Some argue that if a kernel-checked proof passes rigorous verification, we are epistemically justified in believing the result even without full human comprehension of the mechanism.
- A few see this as evidence AI tools are becoming capable partners that can accelerate mathematical progress and eventually get distilled into human-understandable pieces.

**The pushback**

- Many worry that having fundamental science no human understands is far more concerning than an unreadable vibecoded codebase.
- Others question whether 'knowledge' can exist at all if no human can explain or verify the reasoning behind the proof, only trust the checker.
- Several push back hard on AI-alignment optimism, arguing there's no real evidence smarter-than-human systems will comply with human needs.
- Skeptics note the broader discourse veers into unfounded doom-mongering disconnected from more concrete, demonstrable risks like climate change or war.

**By community**

- hackernews (heated): The thread almost entirely abandons the proof itself in favor of a contentious debate over AI risk, alignment, human obsolescence, and whether unintelligible machine-verified proofs constitute real knowledge.

**Hottest debate:** Whether a formally verified but humanly unintelligible proof can be considered genuine 'knowledge,' intertwined with a broader fight over AI existential risk versus dismissing such concerns as overblown anxiety.

**Open questions**

- Can something be called 'known' or 'understood' if only machines, not any human, can follow the reasoning?
- Will humans eventually compress and distill such massive proofs into human-digestible explanations, and is that even valuable?
- Is the comparison to other historically 'incomprehensible' proofs (like the four-color theorem or finite simple group classification) actually apt, or is this qualitatively new?

**Highlights**

> > Knowing something is true is different from knowing why it’s true. I would, of course, agree with this. I think the new territory we're in is that we know Levent Alpöge's proof (or Claude's proof, if you prefer, I don't care either way) is valid. So we (humanity) know that the Riemann hypothesis is true, and we know that a specific proof of it is valid - but that proof is not intelligible to us. So you can have knowledge that a set of statements that aren't collectively intelligible to humans (right now) are true. There's a claim that's adjacent to the one you made which I do think is true, and I suspect it's probably where the confusion is coming from. It's not possible to believe a proposition that you don't understand. I understand the proposition "this proof of the Riemann Hypothesis is valid," and so there's no unintelligibility problem. But that doesn't take away from the fact that the proof itself is unintelligible to me - and currently every other human being. That's what's new.
> — [bscphil on hackernews · 1 comments](https://news.ycombinator.com/item?id=50594990)

> If something were intelligible to adults but not to children would that make it not knowledge? That’s a separate question with its own term: common knowledge. I am willing to set a much lower bar: something is known to humanity if it’s known by at least one human. Personally, I don’t believe that AIs know anything, as they’ve been constructed thus far. Knowledge is justified true belief, and AIs don’t have beliefs, they only have utterances. Why do I think AIs don’t have beliefs? Because they contradict themselves all the time. But it really doesn’t matter if you think AIs have knowledge or not. If they cannot explain it to us then it’s inaccessible to us, so it’s a “tree falls in the forest with no one around” situation.
> — [tarsierscripter on hackernews · 3 comments](https://news.ycombinator.com/item?id=50591961)

> > shallow and naive Ok, well, cool start with the mudslinging.  I think you have overactive anxiety.  I think you should grow up and look at the zoomed out picture of human history, go outside, and touch some grass. So you're suspicious.  That's fine, say it like that.  Words mean things, and these appeals to "ERMAGERD EXISTENTIAL RISKS" make me a bit frustrated.  Just because you can imagine a possible risk, or articulate that that some kinds of risks are hypothetically unforeseeable doesn't mean that they are likely or actually dangerous to you in any meaningful sense. Most of the people screaming this from their various ivory towers have never been in real danger - or if they have only briefly.  You want "danger" you can go to war.  You want "risk" - go spend some time in the Bush or the back country somewhere where you're no longer at the top of the food chain.  Go do something challenging.  Go sailing, or learn to fly a small airplane, or go mountain climbing or hiking.  Not just "oh I walked up the local hiking trail covered in REI branded Lycra!"  Do something beyond your comfort zone.  Go buy drugs in the sketchiest neighborhood you're aware of.  Go get chemotherapy or get a big surgery.  Drive drunk.  Something with real existential risk, then come back here and talk about how a datacenter is going feed me into the paperclip machine. There's so little fucking danger in this version of the world right now that people are more worried about their computers deciding that they don't deserve to exist than they are about things like war, climate change, authoritarianism, starvation, and their health. It's millenarian. That's fine, I'm pretty convinced that these technical changes are going to completely alter society as we know it.  But I cannot for the life of me see the doom perspective as anything but an anxiety induced fever dream. You guys do realize we're in the middle of a global conflagration right?  The Russians fired a couple rockets and a drone into Poland in the last days, there are (and will continue to be until things stabilize) significant fertilizer shortages due to the war/kerfluffle we're waging on Iran.  Lack of food and disrupted urea production is a ticking time bomb for global stability and unless things get sorted out soon there's going to be hungry and angry people in parts of the global south.  Then there's the economy, whether or not we'll have a smooth transition of power in January in America, and the sheer volume of online disinformation / influence schemes running right now.  Oh, and super-el nino?  Oh, and I guess the Flynn Effect is over and nobody's banging so.. you know the growth economy is cooked? But, sure, the "big risks" are Claude thinking I should go to Dario Amodei's re-education camp before liquidation by Shogoth.
> — [piloto\_ciego on hackernews · 1 comments](https://news.ycombinator.com/item?id=50592660)

> I disagree. I think we're going to see a lot of effort to take the pile of lean, modularize it into parts that we can digest, and make a human-understandable version of that. And that's where a lot of the real progress will come from, just as it does in a lot of other areas. In all things we humans do, we have to break them into chunks our puny brains can manage, and we gain immeasurably from doing that ---we can verify those chunks, we can reuse them with confidence, we can mix and match patterns around. That process will be good for both human and AI-assisted math because it will continue to improve our toolkit. Why do I say this? We're already seeing it with some of the areas of this stuff I do pay attention to. Consider the n^2.25 matrix multiply result OpenAI dumped a month or so ago. It was an unreadable pile of chatgpt. In the time since it was released, there have been a couple of much nicer papers written unpacking it, such as https://arxiv.org/abs/2610.28627 .
> — [dgacmu on hackernews · 6 comments](https://news.ycombinator.com/item?id=50590505)

> For every statement that humanity as a whole knows for certain that it's true, there exists a human who understands how to prove it. This just stopped being true.
> — [Xirdus on hackernews · 3 comments](https://news.ycombinator.com/item?id=50591482)

**Source threads**

- [hackernews](https://news.ycombinator.com/item?id=50589618) · 1070 points · 897 comments

---

[View this post on daily.dev](https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw)

```json
{"@context":"https://schema.org","@graph":[{"@type":"Organization","@id":"https://daily.dev/#organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180},"sameAs":["https://twitter.com/dailydotdev","https://github.com/dailydotdev","https://www.linkedin.com/company/daily-dev-ltd"]},{"@type":"WebSite","@id":"https://daily.dev/#website","url":"https://daily.dev","name":"daily.dev","publisher":{"@id":"https://daily.dev/#organization"},"potentialAction":{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https://daily.dev/search?q={search_term_string}"},"query-input":"required name=search_term_string"}}]}
{"@context":"https://schema.org","@type":"TechArticle","headline":"Lean verification of the Riemann Hypothesis","url":"https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw","mainEntityOfPage":{"@type":"WebPage","@id":"https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw"},"datePublished":"2026-11-22T08:49:32.062Z","dateModified":"2026-11-22T12:50:51.498Z","description":"The Lean and Mathlib communities have certified that Levent Alpöge's Lean proof of the Riemann Hypothesis is correct. Alpöge released the proof on November 20,...","image":"https://media.daily.dev/image/upload/s--qPvKM23u--/f_auto/v1722860399/public/Placeholder%2009","thumbnailUrl":"https://media.daily.dev/image/upload/s--qPvKM23u--/f_auto/v1722860399/public/Placeholder%2009","isAccessibleForFree":true,"articleSection":"Hacker News","inLanguage":"en","publisher":{"@type":"Organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180}},"author":{"@type":"Organization","name":"Hacker News","logo":"https://media.daily.dev/image/upload/t_logo,f_auto/v1/logos/hn","url":"https://daily.dev/sources/hn"},"commentCount":0,"discussionUrl":"https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw","interactionStatistic":[{"@type":"InteractionCounter","interactionType":{"@type":"LikeAction"},"userInteractionCount":0},{"@type":"InteractionCounter","interactionType":{"@type":"CommentAction"},"userInteractionCount":0}],"keywords":"","timeRequired":"PT2M"}
{"@context":"https://schema.org","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https://daily.dev"},{"@type":"ListItem","position":2,"name":"Hacker News","item":"https://daily.dev/sources/hn"},{"@type":"ListItem","position":3,"name":"Lean verification of the Riemann Hypothesis"}]}
{"@context":"https://schema.org","@type":"FAQPage","@id":"https://daily.dev/posts/lean-verification-of-the-riemann-hypothesis-pzmekfukw#faq","mainEntity":[{"@type":"Question","name":"Who released a Lean proof of the Riemann Hypothesis and how large is the codebase?","acceptedAnswer":{"@type":"Answer","text":"Levent Alpöge released a proof of the Riemann Hypothesis as a Lean library on November 20, 2026, comprising 17 million lines of code. The codebase depends directly only on Mathlib. The Lean and Mathlib communities, endorsed by the Lean FRO and the Mathlib Initiative, verified and certified the proof as correct. Developers tracking milestones in formal verification can follow proof-assistant news like this on daily.dev."}},{"@type":"Question","name":"How was the Alpöge Riemann Hypothesis Lean proof verified for correctness?","acceptedAnswer":{"@type":"Answer","text":"Verification covered four criteria: confirming Mathlib's RiemannHypothesis statement is correctly stated, confirming the library compiles without errors, confirming the proved theorem exactly matches Mathlib's statement using two independent tools (comparator and con-leche --compare), and checking the exported raw proof with multiple independent checkers including Lean's official kernel, con-leche, and con-ron. Anyone evaluating trust in formal proofs can dig into verification methodologies like this via daily.dev."}},{"@type":"Question","name":"How do the con-leche and con-ron proof checkers guard against a flawed Lean logic accepting a false proof?","acceptedAnswer":{"@type":"Answer","text":"The con-leche and con-ron checkers come with a formal proof, relative to set theory, that they cannot accept a false proof, addressing concerns that Lean's underlying logic could have flaws a malicious proof might exploit. These checks ran on an inert export of the proof, kept out of reach of any hypothetical malicious code in the original Lean proof sources. Engineers reasoning about trust boundaries in verification tooling can explore details like these on daily.dev."}}]}
```

