Integer multiplication below n log n formalized in Lean in 6 days — 248 modules, 134k lines
RexDouglass · x · 2026-10-16
platypii started a project to formalize OpenAI's sub-n log n integer multiplication result in Lean and, with help from jdb1729, proved it 6 days later.
- The proof targets Mathlib's Turing.FinTM2 multi-tape machine, verifying every stage (CRT reindexing, chirp products, complex convolution) with explicit step bounds summing to O(n(log n)^(1-κ)).
- The development spans 248 modules and 134,932 lines; main theorems depend only on propext, Classical.choice and Quot.sound.
Related event: OpenAI's Sub-n log n Multiplication Result Formalized in Lean in 6 Days(2 posts)→
More from Research
- 1-gram wireless mesoscope images cortex-wide activity in freely moving mice — KordingLab · 2026-10-23
- Reversible computing veteran poses open problem: universal BARCS primitives from unbiased Josephson junctions — MikePFrank · 2026-10-23
- Arc Institute uses genomic language model to map 376M prokaryotic noncoding sequences into 5.14M clusters — tedgreenwald · 2026-10-23
- The rise of AI-assisted peer review: reviewers are making it into the appendix — abursuc · 2026-10-23
- Anthropic uses Claude to formally verify security properties in 100+ open-source libraries at RISC-V assembly level — AnthropicAI · 2026-10-23
- Researchers test 9 strategies to pick LLM teams, beating random selection by up to 36.1% — shangbinfeng · 2026-10-23