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.
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.
Not at all saying it is inconsistent, but I personally find the liberal use of introducing inaccessible cardinals axioms a bit concerning.
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.
I don't think so. They depend on some kind of type theory and formulate everything from those primitives.
(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.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.