Would be funny if lean has bugs (it's a program after all) and Claude tasked with a hard problem brute forced a vulnerability that allows proving wrong statements.
> The checkers 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.
TFA addresses this concern
Would be funny if this was an original thought and not something regurgitated in every thread about this topic
My understanding is that Lean has many independent implementations, and the proof has been verified in several of them. There is very little chance that the same bug would be exploitable across different implementations.
See question 4 here -
https://xenaproject.wordpress.com/2026/11/12/and-the-proof-i...