

Basically nothing.
Modern encryption (“post-quantum encryption”) is based on different math altogether anyway.


Basically nothing.
Modern encryption (“post-quantum encryption”) is based on different math altogether anyway.


Yeah, and?
It’s still a valid proof.


No, that is false.
You are confusing publication standards with validity.
It is a valid proof because it has been formally verified.


https://github.com/leanprover-community/riemann-hypothesis/pulls
There is a large collective effort already well underway.
Why would the academic world write it off? They are extremely excited about it!


The thing is, the AI wouldn’t have to just exploit a bug in Lean.
It would have to have exploited a bug that somehow exists in multiple completely independent implementations of Lean and Lean type checkers. Either that, or the fundamental basis of formal mathematics (ZFC + universes) is wrong and if that’s true, that’s an even bigger discovery.
The Lean Prover Zulip chat is publicly accessible. You can go observe the world’s leading experts on formal mathematics work through it. They are 100% certain the proof is valid. They have moved on to reducing and simplifying the proof because it is real. They’ve even got a “why should I trust Lean?” thread open for all the tourists who have been dropping in to ask these very questions.


Let’s say I created a Lean project that verified if 1 == 1, but the actual lean code was so incomprehensibly large that no-one could understand what it was verifying, just that it did verify eventually, and said that was my Riemann Hypothesis proof. Would anyone have anything other than my word on that?
Yes, the proof is literally in the pudding.
The whole point of Lean is the strict type-checking. In effect, the proof says “this is the Riemann Hypothesis, and this is the proof” and you can be 100% certain that the proof is valid.


This is nonsense.
Humans simply have to validate the question. The whole point of Lean and formal proof is to validate everything downstream of that.
The proof is real, and validated.
The monumental human work is reducing it and then understanding it. Although honestly LLMs will do much of this work too.


No. I don’t think you understand what GRH is.
If anything the proof helps cryptography.


It’s incomprehensible as a whole but not in pieces.
It will be simplified, refactored, maybe rebuilt from the ground up. It won’t be incomprehensible for long.
The last I looked the size had already been reduced by 25% based on community efforts.
Kind of fun watching the Lean Prover Zulip chat play with it.


There are a bunch of ways that a proof written in Lean can be invalid.
The most obvious is that the problem statement is invalid or incomplete. This was not really a concern here as the proof used Mathlib’s built-in definitions rather than restating the problem, but nonetheless it has been verified.
Beyond that Lean proofs can contain custom axioms/assumptions, shortcuts, tricks, exploits. And there’s the possibility that the Lean compiler used in the proof had a bug.
Anyway all that has been tested and verified. The problem statement is valid. The proof doesn’t contain any tricks or assumptions. It compiles on every major Lean kernel.
Basically: it is almost certainly mathematically true. The next step is humans actually understanding it.


I don’t see any reason to think the official explanation isn’t truthful. It makes perfect sense.


SMART was being used in DC airspace in September.
They rolled it out nationwide on November 10th (not the 12th as you said): https://www.faa.gov/newsroom/statements/general-statements?hl=en-US
Does not seem likely to be related as SMART mostly reads from the SWIM data feed.
The two proofs use completely different approaches based on entirely different mathematical lineages.
So the question doesn’t seem particularly relevant.