I haven’t seen people talk about this at all, so thought I’d share this article about it. For those depressed that no one will actually understand the RH Proof: we have another, entirely human proof which means there are humans who understand it. It might have been overshadowed, but assuming it ends up working out (I have heard there have been some problems found, hopefully they are surmountable) then I think it will be the far more impactful result.



The AI solution is formalized in LEAN in such a way that it’s easy to verify by humans that it’s formalized correctly, and from there the proof as a whole can be verified by software. It’s unreadable because it’s 17 million lines of LEAN and it’s hard to get a full understanding of it, but there is now a strong consensus that it’s correct. A working LEAN proof is a much higher standard than proofs in human language are generally held to. Humans can now go through it and look for techniques that look interesting and novel and build on them. Likely there will be a shorter proof at some point in the future.
The human solution is human readable because it’s written in human language. But it’s still almost 1000 pages of text and it has to be understood by humans to verify it. By traditional standards for human work, a few mathematicians need to be convinced it’s correct and put their name on it. If we want to test it by the same standard as the AI solution then someone now has to translate 1000 pages of English into LEAN. However it was rushed out, and it’s fairly easy to see that it has holes because it literally has chapters that are empty. People are also claiming that AI agents can trivially find errors in it, but I haven’t verified those. However, human proofs of the Riemann Hypothesis that turn out to be wrong are kind of a regular thing, so I would not be surprised. If it’s salvageable though it’s still worthwhile because the human proof goes in an entirely different direction than the AI one.
Unreadable machine proofs are not a new LLM era thing by the way. The first machine generated proof that was considered unreadable wasn’t something from the last few years or even from this century, it was the one for the Robbins conjecture in 1996.
To be specific, Lean is a programming language, just one that’s specifically made for writing math proofs. If it compiles them it’s logically consistent. If part of that is an understandable version of the RH then it definitely works out. It might just take a lot of effort to understand why.
If RH being true or not is important then this is useful. If you need to understand why it’s true or not (often this is just as important, or even moreso, than the knowledge of if it’s true) then it’s less valuable.