Infinite monkeys, Lean compiler: can brute-force proof search teach us anything?

MilesCranmer · x · 2026-11-20

Miles Cranmer reflects on the AI formal-proof milestone: with infinite compute and a Lean compiler you can find any proof — mathematics via the infinite monkey theorem. But he asks the deeper question: do we actually learn anything from it? A timely counterpoint to the massive Riemann hypothesis Lean proof discussion.

Original post →

More from Research

Research channel →