Thomas Hales on Lean reliability, soundness bugs, and AI-driven autoformalization
Original titleWhat mathematicians should know about the Lean Theorem Prover: reliability & AI
AISummary
Thomas Hales argues that proofs checked in the Lean theorem prover are only as reliable as its kernel, which has had several soundness bugs. He says autoformalization by AI makes formalization far faster, but human audits of kernels and statements remain essential. He also notes that Lean's type theory lacks a complete public consistency proof.
Source: Hacker News · AI (150+ points) · terrytao.wordpress.comPublished · added here