Explicit Diophantine equation whose unsolvability equals Con(ZFC), proved in Lean
davidad · x · 2026-10-29
Vladimir Reshetnikov open-sourced the ProveIt project on GitHub, constructing an explicit Diophantine equation whose unsolvability is equivalent to Con(ZFC), with the equivalence proved in the Lean proof assistant.
A delightful self-referential wrinkle: Lean proving Con(ZFC) could itself be trivial, so the author is now working on a Lean proof that the equivalence is provable in PA (Peano arithmetic). The repo includes Lean formalization, candidate equations, circuit encodings, research notes, and reviews.
Safety researcher davidad boosted it with the quip "Stack Overflow is so over, but Cleo is so back," a tongue-in-cheek salute to the formal-math achievement.
More from Fun
- "Computer use is just every teenager in the 2010s": AI circle meme — himanshustwts · 2026-10-29
- New Macs cost $10-20k, roughly the inflation-adjusted price of a 1977 Apple II — SydSteyerhart · 2026-10-29
- Pedro Domingos mocks NYT: the brain runs one dimension per synapse — a trillion — pmddomingos · 2026-10-29
- That Anthropic Super Bowl Ad Mocking ChatGPT's Tone? Only 7 Months Ago — signulll · 2026-10-29
- Arena skill makes 100 Claude Code sub-agents fight in a tournament for the best answer — blaizedsouza · 2026-10-29
- "AI haters are the new vegans": the latest AI culture meme on X — AIandDesign · 2026-10-29