Langford: proofs are now only machine-checkable, like compiled programs

JohnCLangford · x · 2026-11-21

Quoted context: the Riemann proof reportedly spans 250,000+ pages in English, with a Lean version too big to share across 14 part files — a collaboration between Antonio Alpoge and Claude requiring frequent steering. John Langford comments that we're in a new era where proofs are only machine-checkable, like compiled programs, and that's great because it lets us tackle new questions.

Original post →

More from AGI Musings

AGI Musings channel →