Posted by g-b-r 6 hours ago
> ... has been carefully vetted by experts in Lean and number theory.
So, if the vetting was not careful enough and done by people expert enough, what could happen?
. ... con-leche and con-ron come with a formal proof, relative to set theory, that they cannot accept a false proof, thus addressing concerns that Lean’s logic itself might have flaws that the proof could exploit.
And what verified con-leche and con-ron?
> These checks ran on an inert export of the proof, out of reach of hypothetical malicious code in the Lean proof source
Hmmm...
Guess I'm splitting hairs here; like I said, maybe this is as close as you get to formal proof verification, but still...
In normal life, multiple qualifications like that mean a lack of confidence that should be taken as lack of trust in the statements overall.
But in an area like this where it's all about formal verification and the consequence of bad link in the chain is severe, more qualifications should give an informed person more confidence.
1) Surely agents can be employed to simplify the proof now? "Make it smaller while it still verifies" in a loop; maybe, to a level where a human (research mathematician specializing in RH) can grok it?
2) con-leche is vibe coded; isn't it a concern w.r.t. trusting its soundness?
3) This is so exciting. Please prove P != NP already and spare us the tension
With people being as confused as they are (just look at the messages in this thread), I think it's good that TFA is very clear about what it is saying, namely that a specific formal artifact that was posted to the internet is correct, and nothing else. Making value judgements or contrasting the proofs (or proof attempts) is not the point of the post.
(I work at the Lean FRO, but I wasn't involved in the verification effort or the writing of the post)
[1]: https://leanprover.zulipchat.com/#narrow/channel/113488-gene...
GG @ AI
Could someone expand on this point? I still don't understand how con-leche (or con-ron) can be absolutely free of bugs/guaranteed to be consistent.
Isn't the same true for every proof assistant? But only con-leche claims to be perfect 100% bug free software, so what makes con-leche special in this regard?
It looks like the meaning of the word "mathematical proof" changed fundamentally. Mathematics looks like a flattened animal on the asphalt by the CS steamroller.