upvote
A lot has happened since the fake Collatz refutation: https://leodemoura.github.io/blog/2026-10-15-lean-now-ships-...

In short, Lean has formally verified checkers now, and the RH proof was checked with them. So any such soundness hole would have to be exploited in the correctness proofs of the checkers, which is a much smaller attack surface than the RH formalization.

reply
I might be asking a stupid question, but how are the checkers formally verified? Do they use another theorem prover that is not Lean?
reply
It's turtles all the way down (what if every x86 and ARM chip has some obscure ISA exploit that agents are silently using that we don't know about?) but the idea is that while you can't remove absolute dependence, you can remove chains of dependencies and keep making it smaller and smaller w/ reductionism
reply
You can keep writing simpler checkers that check the more complicated checkers. But at some point you will have to give up and say "this checker looks correctly implemented (to us) and gives the results we expect on all our tests."

Depending on how the checker works, you might be able to run it on itself. But that doesn't say much; maybe it only approves itself due to a bug.

reply
There's multiple independent kernels, run on distinct hardware; they're trusted because they're small.
reply
Checkers all the way down?
reply
Yo dawg, I heard you like formal verification...
reply
Dont get me started...hate it...
reply
One thing that every manual/automated verification relies on is the consistency of ZFC + few inaccessible cardinals. I mean while humans have carefully thought about the flaws in that for century and didn't find any, it's not grounded in any clear reasoning why it is consistent.

Not at all saying it is inconsistent, but I personally find the liberal use of introducing inaccessible cardinals axioms a bit concerning.

reply
Much of mathematics relies on these axioms. There is nothing special about the dependency of proof checkers or verification of this particular hypothesis. What is the purpose of this statement in this context?
reply
Most natural problems like RH, twin primes, etc dont fundamentally rely on the inaccessible cardinals. Any problem that depends on them, there is much debate whether they can be called natural.

Many problems may not require even full zfc. zf, peano or even weaker may be enough.

There are also many theorem provers not just lean. lean depends on type theory, but metamath for example depends on zfc directly.

It may be a good but likely tedious exercise to convince yourself by translating the current proof to a zfc dependent prover.

reply
> relies on is the consistency of ZFC + few inaccessible cardinals

I don't think so. They depend on some kind of type theory and formulate everything from those primitives.

reply
It's possible that the question of consistency is too abstract to judge its significance. Why?

  (1) A lot of the mathematics that was done in the 18th century was
      obviously inconsistent and yet still useful.
  (2) Trying to verify logical consistency of a theory is basically impossible
      because of Goedel's 2nd Incompleteness Theorem.
Hitting a wall like this makes me think we're asking the wrong question.
reply
> But the statement as written has 4 points, none of which rests on the human involvement.

The theory and implementation of Lean is very much so a result of human involvement, on a massive scale even. Just because it is something repeatable does not lower that in any way.

Distrust of LLM output should not turn into distrust of automation, I think. The former I totally get (and deeply hold myself), the later is likely to hold one back - imagine banning calculators because there is not human in the loop, to make an extreme example.

reply