How can a fancy autocomplete / stochastic parrot solve the Riemann Hypothesis?
For those who are out of the loop, here is a TLDR of the situation:
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.
Source: …github.io/…/riemann-hypothesis/
It’s not a stochastic parrot or autocomplete. Well, not just those things. Yes, at their core LLMs are still just predicting tokens, but there’s been a lot of work on harness software and model improvements (though it blows my mind that they can apparently generate mathematical proofs while still being unable to consistently count the instances of “r” in “strawberry.”)
That said, I have my doubts. In a Lean proof that long, there’s ample opportunity to find and exploit unknown flaws in the kernel, and no human has had the time to check it (let alone the absurd 250,000 pages of the argument in prose).
I’m going to withhold judgment until an actual team of mathematicians can verify it.