正文 · AI 翻译
Thanks to IT Home readers pzvincent, 软媒新友2202498, 逮捕八公, 亿百卢闪葱, 不一样的体验, 上升式寂寞, and SNOS雪诺 for the tips!
IT Home reported on November 22 that the Lean and Mathlib communities issued a joint statement on November 21 saying that Levent Alpöge’s proof of the Riemann Hypothesis, presented as a Lean library of approximately 17 million lines of code, had passed verification. (IT Home note: Lean is an interactive theorem prover that can mechanically check, line by line, whether mathematical reasoning follows logical axioms.)
The statement was jointly issued by the Lean and Mathlib communities and endorsed by the Lean FRO and the Mathlib Initiative. It says Alpöge’s library depends directly only on Mathlib and that the Lean and Mathlib communities participated in verification over the past day.
The statement lists 4 verification criteria and says all have been met:
The statement is correct: The statement used in the proof is Mathlib’s RiemannHypothesis and has been reviewed by experts in Lean and number theory;
The code compiles: Dozens of people have reported successful compilation and reproduced the same raw proof export file;
The proof establishes the correct statement: The community added a file that imports only Mathlib to isolate the statement, then used 2 independent tools, comparator and con-leche --compare, to confirm that the theorem proved in the library exactly matches Mathlib’s statement;
The proof is valid: The raw export file has been checked by multiple proof checkers, including Lean’s official kernel, con-leche, con-ron, and third-party checkers implemented in different programming languages.
The statement specifically notes that con-leche and con-ron come with formal proofs, relative to set theory, that they cannot accept a false proof, addressing concerns that Lean’s logic itself might have flaws. These checks ran on an inert export file, beyond the reach of potentially malicious code in the sources.
The statement closes by thanking community members who provided resources for verification and expressing anticipation for further work by the mathematical community to explain the proof’s new ideas.
IT Home note: The Riemann Hypothesis was proposed in 1859 by German mathematician Bernhard Riemann. It holds that prime numbers, which appear randomly distributed along the number line, actually follow a complex and meaningful pattern. Since then, the Riemann Hypothesis has become an important guide for the entire field of number theory and one of mathematics’ most famous unsolved problems.
IT Home provides the original statement and its translation below:
Lean verification of the Riemann Hypothesis
Joint statement by the Lean and Mathlib communities, endorsed by the Lean FRO and the Mathlib Initiative.
On November 20, 2026, Levent Alpöge released a proof of the Riemann Hypothesis as a Lean library comprising 17 million lines of code.
We have full confidence that Alpöge's proof of the Riemann Hypothesis is correct, and we congratulate him on this achievement.
Our rationale is outlined below.
The codebase depends directly only on Mathlib. Over the past day, the Lean and Mathlib communities have rallied to verify the proof's correctness. We hereby certify that both the statement and the proof of the Riemann Hypothesis are correct. The four criteria in https://xenaproject.wordpress.com/2026/11/12/and-the-proof-is-checked-in-lean/ are all satisfied.
The statement of the Riemann Hypothesis is correct. This statement is part of Mathlib: RiemannHypothesis and has been carefully vetted by experts in Lean and number theory.
Alpöge’s library compiles correctly. By now, dozens of people have reported correct compilation of the codebase, reproducing the same raw proof export file. The library compiles without errors or build failures.
The code proves the correct statement. Crucially, the community has added a file that isolates the statement of the Riemann Hypothesis and imports only Mathlib. That statement was compared against the theorem proved by Alpöge using two independent tools ( and ), both confirming that the theorem proved in Alpöge’s library is exactly Mathlib’s statement of the Riemann Hypothesis. comparatorcon-leche –compare
The Lean proof is valid. The exported raw proof has been checked by several proof checkers, including Lean’s official kernel, the and checkers, and several independent checkers contributed by third parties and implemented in different programming languages. The checkers and come with a formal proof, relative to set theory, that they cannot accept a false proof, thus addressing concerns that Lean’s logic itself might have flaws that the proof could exploit. An extensive overview is available at https://math.mit.edu/~drew/grh/. These checks ran on an inert export of the proof, out of reach of hypothetical malicious code in the Lean proof sources. con-lechecon-roncon-lechecon-ron
Thanks are owed to everyone in the community who provided resources for the verification.
We look forward to all the activity in the mathematical community that will help explain the new ideas in this proof.
Lean Verification of the Riemann Hypothesis
Joint statement by the Lean and Mathlib communities, endorsed by the Lean FRO and the Mathlib Initiative.
On November 20, 2026, Levent Alpöge released a proof of the Riemann Hypothesis as a Lean library containing 17 million lines of code.
We have full confidence that Alpöge’s proof of the Riemann Hypothesis is correct, and we congratulate him on this achievement.
Our rationale is as follows.
The codebase depends directly only on Mathlib. Over the past day, the Lean and Mathlib communities have worked together to verify the proof’s correctness. We hereby certify that both the statement and the proof of the Riemann Hypothesis are correct. All 4 criteria have been met.
The statement of the Riemann Hypothesis is correct. It is part of Mathlib and has been carefully reviewed by experts in Lean and number theory.
Alpöge’s library compiles correctly. Dozens of people have now reported that the codebase compiles correctly and have reproduced the same raw proof export file. The library compiles without errors or build failures.
The code proves the correct statement. Crucially, the community added a file that isolates the statement of the Riemann Hypothesis and imports only Mathlib. That statement was compared with the theorem proved by Alpöge using 2 independent tools (comparator and con-leche --compare). Both confirmed that the theorem proved in Alpöge’s library is exactly Mathlib’s statement of the Riemann Hypothesis.
The Lean proof is valid. The exported raw proof has passed checks by multiple proof checkers, including Lean's official kernel, the con-leche and con-ron checkers, and several independent checkers contributed by third parties and implemented in different programming languages. con-leche and con-ron come with formal proofs relative to set theory showing that they cannot accept an incorrect proof, addressing concerns that “Lean's logic itself might be flawed and that the proof might exploit that flaw.” These checks were run on the proof's lazy export file, so they do not encounter any malicious code assumed to be present in the Lean proof source.
We look forward to further work by the mathematical community to help explain the new ideas in this proof.
Related reading:
“Did Claude Really Prove the Riemann Hypothesis? Anthropic Mathematician Releases Only Lean Code, with a Written Proof Exceeding 250,000 Pages”
“Has AI Cracked the Riemann Hypothesis? Anthropic Mathematician Claims to Have Completed a Proof with Claude”