OpenAI's Fast Matrix Multiplication Proof Generalized to Arbitrary Fields

A new work by Sela Navot generalizes OpenAI's fast matrix multiplication algorithm achieving the exponent bound ω≤9/4 (O(n^2.25)) from the complex field to arbitrary fields, with the proof formalized and verified in Lean.

2026-10-07 ~ 2026-10-08 · 2 related posts

• OpenAI's matrix multiplication ω≤9/4 proof extended to all fields, verified in Lean with GPT-6 assistance — thomasahle · 2026-10-07
• OpenAI's O(n^2.25) Fast Matrix Multiplication Algorithm Generalized to All Fields, Verified in Lean — aran_nayebi · 2026-10-08