Top
Best
New

Posted by g-b-r 6 hours ago

Lean verification of the Riemann Hypothesis(leanprover-community.github.io)
639 points | 505 commentspage 5
zkmon 5 hours ago|
It's not that bad if the mathematical proofs now join the other things in a stratosphere of information that is out of reach for human comprehension. Mathematics was already on that course for a few decades now. What's bad is, even the simpler stuff that was fully comprehensible by common person are also being pushed into the stratosphere, making us dependent on the great creatures that live there.
gostsamo 5 hours ago||
Correct me if wrong, but didn't lean have a statement that forced the compiler to accept a statement as true with no need to prove it aimed at shortening obvious stuff? If so, are there checks for incorrect usages?
baggy_trough 5 hours ago||
> These checks ran on an inert export of the proof, out of reach of hypothetical malicious code in the Lean proof sources.

I’d like to know more about this part.

TwoFx 5 hours ago||
The problem we need to solve is that building a Lean project allows for arbitrary code execution, just like many other programming languages. Thus, building a Lean project might interfere with your proof checking infrastructure and fool it into accepting an incorrect proof.

"Building" a Lean project actually consists of two steps that can be separated: compiling the high-level Lean document to the simple expression format of the Lean kernel (this part is called "elaboration") and then checking that this expression consistutes a valid proof of the claimed statement (this part is called "kernel checking"). Only the first part potentially involves arbitrary code execution.

Lean ships with a component called `lake comparator` [1]. It works like this: a trusted challenge (formal statement) and the potential proof are elaborated separately in sandboxed environments so that code execution during the build of the proof cannot interfere with the checker or the trusted statement. Then the statement and proof are both exported into a simple JSON-format [2] that represents the relevant terms in the expression format of the Lean kernel, and then the checkers check this JSON.

If this process succeeds, then you know that you definitely have a proof of the relevant statement, with the JSON as a witness of the proof.

[1]: https://lean-lang.org/doc/reference/latest/ValidatingProofs/... [2]: https://github.com/leanprover/lean4export

javra 5 hours ago||
Out of the box, compiling (checking) Lean code can entail execution of arbitrary code. This removes any execution of code besides the adding of type checked definitions and theorems to Lean's environment.
est 6 hours ago||
Now next step is what can we actually learn from these. Any interesting new theorem developed as by-product?
jvanderbot 6 hours ago||
GRH was kind of assumed to be true so this kind of proves the status quo. Like saying you have a proof p! =np. Enormous, but not unexpected.
danavar 3 hours ago||
I think there are proofs it made inside it. Some arithmetic geometry stuff that was all proved to reach the GRH. Overall the proof contains about all of the number theory produced in the last 50 years so I expect a lot to be studied.
danavar 4 hours ago||
amazing
34987349068 4 hours ago||
[dead]
globular-toast 5 hours ago||
[dead]
alexey-salmin 5 hours ago||
Would be funny if lean has bugs (it's a program after all) and Claude tasked with a hard problem brute forced a vulnerability that allows proving wrong statements.
vzqx 5 hours ago||
My understanding is that Lean has many independent implementations, and the proof has been verified in several of them. There is very little chance that the same bug would be exploitable across different implementations.

See question 4 here -

https://xenaproject.wordpress.com/2026/11/12/and-the-proof-i...

nialv7 5 hours ago|||
> The checkers con-leche and con-ron 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.
specked-citrus 5 hours ago|||
TFA addresses this concern
phoghed 5 hours ago|||
Would be funny if this was an original thought and not something regurgitated in every thread about this topic
iandanforth 5 hours ago|
IMO the really interesting bits here are going to be the simplifications that will come from combining ideas from Alpoge and Masullo.
ion_trapper 5 hours ago||
Until Masullo actually posts a proof instead of the outline of a proof with “fill in proof here” all over the document, there’s not much to work with or reason to get excited about his result. Remember that there have been numerous false proof claims of RH to date.
neuralkoi 5 hours ago||
I can imagine the folks at OpenAI have already thrown both papers into the mouths of their leading model.
More comments...