They used 2 checkers that are maintained and developed independently of the Lean kernel. But they did use Lean formats/syntax. They’ve also done some manual verification, though there might be more to do. The proof did use the statement if RH directly from the well established Mathlib.
I’ve also seen claims that the proof has some weird things in it that might be hints that it is finding holes in the theory Lean models.
Honestly, even if it ends up not being a proof of RH, it will tell us something about computable / constructive maths.
It is 2028. Another lean CVE was registered; GRH was proven again. I am excited that yet another logic bug will be fixed.
Scott Optimized (Aaronson) declared the proof likely correct on friday, before this news, so I’d take their word for it.
Edit: Update from Scott Optimized:
[Update (Nov 21): The proof has now been verified independently by the Lean community, using con-leche, a piece of Lean that itself is formally verified all the way down to the axioms of set theory. This is a much higher degree of verification than a typical human paper accepted to a math journal. The proof is correct.]
They used 2 checkers that are maintained and developed independently of the Lean kernel. But they did use Lean formats/syntax. They’ve also done some manual verification, though there might be more to do. The proof did use the statement if RH directly from the well established Mathlib.
I’ve also seen claims that the proof has some weird things in it that might be hints that it is finding holes in the theory Lean models.
Honestly, even if it ends up not being a proof of RH, it will tell us something about computable / constructive maths.
It is 2028. Another lean CVE was registered; GRH was proven again. I am excited that yet another logic bug will be fixed.
Scott Optimized (Aaronson) declared the proof likely correct on friday, before this news, so I’d take their word for it.
Edit: Update from Scott Optimized: