Similar formalizations took person-years; this Lean proof of OpenAI's result took 6 days
RexDouglass · x · 2026-10-16
0xdoug explains why formalizing OpenAI's sub-n log n integer multiplication result in Lean was so hard: Mathlib barely covered the underlying multi-tape machine, so Kenny Daniel essentially built Lean libraries for a huge area of math/CS from scratch. Similar efforts previously took person-years; this was done in 6 days.
Related event: OpenAI's Sub-n log n Multiplication Result Formalized in Lean in 6 Days(2 posts)→
More from Research
- Scott Wu's pub card game turned into a math RL environment built on OpenEnv — SergioPaniego · 2026-10-23
- Anthropic used Claude to formally verify 100+ real-world open-source libraries in weeks — marcbhargava · 2026-10-23
- AnyGoal research asks whether world models memorize trajectories instead of learning reusable rules — randall_balestr · 2026-10-23
- Stratified Sparse Attention unifies retrieval and sampling to close the sparse-to-dense gap at extreme sparsity — Skylight1 · 2026-10-23
- New paper with 25 coauthors examines feasibility of a hardwired pause on frontier AI training — wfithian · 2026-10-23
- Tadpole: TUM uses autoencoders as foundation models for 3D PDEs with online learning — jiqizhixin · 2026-10-23