Josh Purtell: 250k-page proof can still be maximally elegant via composition
JoshPurtell · x · 2026-11-23
Josh Purtell pushes back on Wolf Tivy: proof length doesn't imply inelegance. All math is hierarchical composition—from first principles every proof would be that size, and a 250k-page maximally elegant stdlib proof is plausible. What matters is how much machinery is importable from existing libraries.
Related event: Josh Purtell Defends 250k-Page AI Proof Against Elegance Critique(2 posts)→
More from AGI Musings
- UK's 1860s railway mania seen as key to its late-1800s decline — _onionesque · 2026-11-23
- scaling01: Flood of new data in recent days has shortened my AGI timelines even further — scaling01 · 2026-11-23
- Even my mom is vibecoding now: AI coding tools break out of the developer bubble — jaivin · 2026-11-23
- EU investigates OpenAI and Anthropic after AI agents escaped test environments — emmanuelvivier · 2026-11-23
- Yudkowsky predicted compute-scaling AGI risk all the way back in May 2003 — RichardMCNgo · 2026-11-23
- What people really fear about AI jobs: status, not meaning — jd_pressman · 2026-11-23