Szegedy predicts proofs without formal verification won't count within a year
aran_nayebi · x · 2026-11-22
Christian Szegedy predicts that "within a year we would not even consider something a proof if it is not formally checked/checkable." Quoter Tim Nguyen contrasts a formally verified "AI-slop" proof of the Riemann Hypothesis via a Lean dump with the human "proof" of the abc conjecture published in a journal, asking why the former gets more hate — a sign AI formal proving tools are rapidly reshaping math's verification standards.
More from AGI Musings
- Ex-NSA's Perlroth: AI is multiplying cyber risk, exploits now beat patches by 7 days — chrisrohlf · 2026-11-22
- Quant firms 'print money' with reasoning models — and early access looks like cheating — scaling01 · 2026-11-22
- Takeoff math: separate training compute from the compute to actually explore — 1a3orn · 2026-11-22
- Two compute costs that decide AI takeoff: training the improver and paying for its exploration — 1a3orn · 2026-11-22
- Largest Lean proofs cost at most ~$50 in compute, per Claude's estimates — 1a3orn · 2026-11-22
- a16z: LLMs update predictions in mathematically precise ways — but AGI needs continual learning — vishalmisra · 2026-11-22