Remix.run Logo
▲ pera 31 minutes ago

> 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.

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.

▲odyssey7 28 minutes ago | parent [-]

The language is optimized for being certain about its results, as compared to something like the V8 engine, which does weird things with C++ to squeeze every drop of performance it can out of consumer hardware, even at the risk of security vulnerabilities.

▲pera 9 minutes ago | parent [-]

> The language is optimized for being certain about its results

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?