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)→

Original post →

More from AGI Musings

AGI Musings channel →