{"schema":"postcutoff/event@1","as_of":"2026-10-30T13:42:00+01:00","url":"https://postcutoff.com/e/2026-10-06-openai-matrix-multiplication-omega-9-4/","md":"https://postcutoff.com/e/2026-10-06-openai-matrix-multiplication-omega-9-4/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-06-openai-matrix-multiplication-omega-9-4","date":"2026-10-06","date_precision":"day","short_title":"OpenAI proves ω ≤ 9/4 for matrix multiplication","deck":null,"takeaway":"Family 107 of OpenAI's 6 Oct 2026 release proves that two n × n matrices can be multiplied with O(n^(9/4+ε)) arithmetic operations, the largest drop in the exponent in decades; the best bound before was ω < 2.371177, set in August 2026 with AlphaEvolve. The 13-page proof is non-constructive and comes with a Lean formalization. By 21 Oct, Amanov, van den Berg and Zuiddam had re-proved it over every field and Rafael Pass had given an explicit construction. The resulting algorithms are galactic and give no practical speedup.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":[{"n":1,"title":"OpenAI: An Upper Bound of 9/4 for the Matrix Multiplication Exponent (2 Oct)","url":"https://github.com/openai/math/blob/main/preprints/Matrix-Multiplication-Nine-Fourths-October-2-2026/paper.pdf","type":"paper","group":"primary","domain":"github.com"},{"n":2,"title":"OpenAI: Complex Matrix Multiplication Below 2.258 and Rectangular Bounds","url":"https://github.com/openai/math/blob/main/preprints/Complex-Matrix-Multiplication-Below-2.258-and-Rectangular-Bounds-September-24-2026/Complex-Matrix-Multiplication-Below-2.258-and-Rectangular-Bounds-September-24-2026.pdf","type":"paper","group":"primary","domain":"github.com"},{"n":3,"title":"Lean scope note for family 107","url":"https://github.com/openai/math/blob/main/lean/docs/107.md","type":"code","group":"primary","domain":"github.com"},{"n":4,"title":"Lean comparator challenge: MatrixMultiplication.lean","url":"https://github.com/openai/math/blob/main/lean/ComparatorChallenges/MatrixMultiplication.lean","type":"code","group":"primary","domain":"github.com"},{"n":5,"title":"arXiv 2610.30054: Amanov, van den Berg, Zuiddam, Multiplying matrices via polynomials: exposition and barriers","url":"https://arxiv.org/abs/2610.30054","type":"paper","group":"primary","domain":"arxiv.org"},{"n":6,"title":"arXiv 2610.28627: Rafael Pass, A Constructive and Elementary Proof of ω ≤ 9/4","url":"https://arxiv.org/abs/2610.28627","type":"paper","group":"primary","domain":"arxiv.org"},{"n":7,"title":"arXiv 2610.10494: Przemysław Uznański, Rectangular matrix multiplication from polynomial products","url":"https://arxiv.org/abs/2610.10494","type":"paper","group":"primary","domain":"arxiv.org"},{"n":8,"title":"arXiv 2610.18914: Houxi Lü, matrix multiplication in arbitrary characteristic","url":"https://arxiv.org/abs/2610.18914","type":"paper","group":"primary","domain":"arxiv.org"},{"n":9,"title":"oai-math-revised: comparator run on all challenges (LEAN_CHECKS.md)","url":"https://github.com/mathcommunity/oai-math-revised/blob/main/docs/LEAN_CHECKS.md","type":"code","group":"primary","domain":"github.com"},{"n":10,"title":"Scientific American: The most exciting claims from OpenAI's heap of new proofs (Vassilevska Williams on 107)","url":"https://www.scientificamerican.com/article/the-most-exciting-claims-from-openais-heap-of-new-proofs/","type":"press","group":"press","domain":"scientificamerican.com"},{"n":11,"title":"Abbas Mehrabian on X (8 Oct)","url":"https://x.com/abbas_mehrabian/status/2108002041742393818","type":"discussion","group":"reactions","domain":"x.com"},{"n":12,"title":"Yuval Filmus on X (17 Oct)","url":"https://x.com/YFilmus/status/2111319639208910889","type":"discussion","group":"reactions","domain":"x.com"},{"n":13,"title":"Sergey Gusev on X: explicit 9/4-type algorithms are galactic (20 Oct)","url":"https://x.com/13SergeyGusev/status/2112373928802799741","type":"discussion","group":"reactions","domain":"x.com"}],"official":9,"filed":"2026-10-29","updated":"2026-10-29","orgs":["OpenAI"],"title":"OpenAI's release lowers the matrix multiplication exponent to ω ≤ 9/4, from about 2.371, with a Lean proof; experts have since re-proved the bound over every field and made it constructive","summary":"\"An Upper Bound of 9/4 for the Matrix Multiplication Exponent\" (OpenAI, dated 2 Oct 2026, released 6 Oct, family 107) proves that for every ε > 0, n × n complex matrices can be multiplied using O_ε(n^(9/4+ε)) arithmetic operations, so ω ≤ 2.25. The previous record from the laser-method line was ω < 2.371177. The proof works with Strassen's asymptotic spectrum and inequalities for polynomial-multiplication tensors, gives no explicit algorithm, and is formalized in Lean (statement checked by community comparator runs). Independent expositions and proofs followed: Amanov, van den Berg and Zuiddam (arXiv 2610.30054) re-prove it over every field, and Rafael Pass (arXiv 2610.28627) gives a constructive, elementary proof.","key_facts":["Theorem 1.1 (verbatim): 'For every ε > 0, two n × n complex matrices can be multiplied using Oε(n^{9/4+ε}) arithmetic operations. In particular, ω ≤ 9/4.' The paper adds that its proof 'does not specify a competitive finite matrix size'. 13 pages, dated 2 Oct 2026","Companions in the family: 'Complex Matrix Multiplication Below 2.258 and Rectangular Bounds' (83 pp., 24 Sep; ω < 2.258, dual exponent α > 0.465, ω(1, 0.709, 1) < 2.092 in characteristic zero) and 'Staggered extraction for exact matrix multiplication over every field' (35 pp., 24 Sep; ω < 2.371054886006746 over every fixed field, including positive characteristic)","Method (paper): 'The present proof combines explicit tensor degenerations with the spectral viewpoint.' A separation construction turns blocks that share one tensor leg into independent blocks; two inequalities for polynomial-multiplication tensors force a growth rate a^{4/3}, which gives 3t ≤ 9/4 for every spectral character","Previous records (as listed by Pass): ω < 2.371339 (Alman et al., 2025) and ω < 2.371177 (Dupont et al., August 2026, found with AlphaEvolve; see 2026-08-17-alphaevolve-matrix-multiplication-exponent)","Lean: comparator challenge MatrixMultiplication.lean defines straight-line programs with constant, input, add, subtract and multiply gates, counts the arithmetic gates, and defines ω as the infimum of exponents τ admitting correct programs of cost C·n^(τ+ε) for every n; theorem complex_omega_le_nine_quarters (plus α > 93/200 and the rectangular bound). The oai-math-revised comparator run (25–26 Oct) accepted it","Amanov, van den Berg and Zuiddam (arXiv 2610.30054, 21 Oct, verbatim): 'We give an exposition of OpenAI’s recent proof that the exponent ωC of matrix multiplication over the complex numbers satisfies ωC ≤ 9/4. Our version of the proof gives ωF ≤ 9/4 over every field F.' They prove an 'operational barrier' showing the current analysis cannot be pushed further with the same ingredients, and note that Sela Navot, Kunal Marwaha and they themselves each released Lean proofs of ω_F ≤ 9/4 for every field on 7 Oct","Rafael Pass (arXiv 2610.28627, 20 Oct, verbatim): 'We give a self-contained constructive proof that the matrix multiplication exponent satisfies ω ≤ 9/4 … We explicitly construct a Strassen-style matrix multiplication identity and obtain the bound by ordinary block recursion.' His AI statement says Codex (Astra) was used extensively, while 'The main ideas behind the construction, analysis, and abstractions are my own'","Other follow-ups: Przemysław Uznański (arXiv 2610.10494) extends the analysis to rectangular products, ω(1, 1/2, 1) = 2, and all-pairs shortest paths in directed unweighted graphs in O(n^2.5); Houxi Lü (arXiv 2610.18914) replaces a Fourier step by polynomial interpolation to get ω ≤ 9/4 in every characteristic","Reactions: Steven Strogatz: 'This leap in progress is like Bob Beamon's long jump'; Abbas Mehrabian (X, 8 Oct): 'a groundbreaking algorithm to multiply matrices, showing ω⩽2.25. Our team had the best bound before OpenAI's result'; Virginia Vassilevska Williams (Scientific American): 'In a maybe diabolical sense, the advance on matrix multiplication can be seen as an attempt by the LLMs to speed themselves up'; Yuval Filmus (X, 17 Oct): the proof is 'outlandish, using Strassen's theory of asymptotic spectra'","Practicality: Sergey Gusev (X, 20 Oct) says the explicit algorithms built so far are 'galactic'; a first AI-written construction needed matrices with about 10^(2.3×10^11) rows even at exponent 2.67, later reduced to about 10^4,650 rows"],"key_numbers":[],"tags":["math","computer-science","algorithms","matrix-multiplication","algebraic-complexity","tensors","lean","openai","openai-math-release"],"science":{"field":"computer-science","subfield":"algebraic complexity theory (matrix multiplication, tensor rank)","problem":"Exponent ω of matrix multiplication (Strassen 1969: ω < 2.81; laser-method records near 2.371)","result":"ω ≤ 9/4 over ℂ (OpenAI, non-constructive, Lean-formalized); re-proved over every field and made constructive by independent authors within three weeks","open_since":"1969","ai_system":["OpenAI internal model (openai/math release)"],"human_role":"Autonomous AI output released by OpenAI; independent human-led re-proofs (Amanov–van den Berg–Zuiddam, Pass), both AI-assisted","verification":{"key":"lean","label":"Lean-verified","text":"Lean formalization (comparator accepted); expert exposition and independent constructive proof on arXiv (unrefereed)"},"status":"confirmed","shock":"Since Coppersmith–Winograd (1990, about 2.3755) decades of laser-method work had moved ω only to about 2.3712; the release drops it by more than 0.12 with a 13-page argument."},"body_md":"## What happened\n\nThe exponent ω measures how fast matrices can be multiplied: the schoolbook method costs n³ operations, Strassen showed in 1969 that\nfewer suffice, and a long line of tensor-based \"laser method\" refinements brought the bound to about 2.371 by 2025–2026, each step\ngaining a few thousandths. OpenAI's 6 Oct release includes a 13-page manuscript, dated 2 Oct, that proves ω ≤ 9/4 = 2.25 over the\ncomplex numbers. Two companion papers from late September give the intermediate bound 2.258, rectangular bounds, and a small\nimprovement over every field.\n\nThe proof does not exhibit an algorithm. It works in Strassen's spectral framework: it bounds every \"character\" of the matrix\nmultiplication tensor by comparing it with polynomial multiplication, using a new way of separating tensor blocks that share one\nleg. OpenAI formalized the main bound in Lean, with a statement that defines arithmetic programs and their cost from scratch; the\ncommunity comparator run accepted it.\n\n## Why it matters\n\nω is one of the central constants of algebraic complexity theory, and a jump from 2.371 to 2.25 is far larger than anything achieved\nsince the 1980s. Practical matrix multiplication is unaffected: the constructions behave like \"galactic\" algorithms whose advantage\nappears only at sizes far beyond any computer.","disputed":[],"related":[{"id":"2026-10-07-colkitt-codex-integer-multiplication-exponent","url":"https://postcutoff.com/e/2026-10-07-colkitt-codex-integer-multiplication-exponent/","date":"2026-10-07","date_precision":"day","short_title":"Outside researchers using AI crowdsource a tighter exponent in OpenAI's integer-multiplication result #109, from 2^-182 to about 2^-8.4 (conditional)","deck":null,"takeaway":"Everything is conditional on OpenAI's unverified manuscript; Lean checks cover only finite certificates and arithmetic, and the gains are asymptotic, not practical speedups.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":39,"official":19,"filed":"2026-10-07","updated":"2026-10-29","orgs":["Independent researchers","OpenAI"]},{"id":"2026-10-06-openai-math-release-722-manuscripts","url":"https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems","deck":"Including quasi-Riemann, Unique Games, Hodge for CM abelian varieties and free group factors","takeaway":"If even a fraction of these results hold up, this is the largest single jump in mathematical knowledge on record, produced by an AI system in about six weeks.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":79,"official":13,"filed":"2026-10-07","updated":"2026-10-29","orgs":["OpenAI"]},{"id":"2026-08-17-alphaevolve-matrix-multiplication-exponent","url":"https://postcutoff.com/e/2026-08-17-alphaevolve-matrix-multiplication-exponent/","date":"2026-08-17","date_precision":"day","short_title":"AlphaEvolve helps lower the matrix multiplication exponent ω to below 2.371177","deck":null,"takeaway":"A paper by Alman, Vassilevska Williams and co-authors including DeepMind researchers (arXiv 2608.16884) improved the bound on the matrix multiplication exponent from ω < 2.371339 to ω < 2.371177.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":3,"official":2,"filed":"2026-09-29","updated":"2026-09-29","orgs":["Google DeepMind","MIT"]}],"people":[{"id":"virginia-vassilevska-williams","name":"Virginia Vassilevska Williams","url":"https://postcutoff.com/person/virginia-vassilevska-williams/"},{"id":"steven-strogatz","name":"Steven Strogatz","url":"https://postcutoff.com/person/steven-strogatz/"}],"posts":[{"id":"x-13sergeygusev-2112373928802799741","title":"“Recently, OpenAI showed that matrix multiplication algorithms with exponent near 2.25…”","url":"https://postcutoff.com/p/x-13sergeygusev-2112373928802799741/"},{"id":"x-yfilmus-2111319639208910889","title":"“OpenAI recently proved that 𝜔≤2.25. Their proof is outlandish, using Strassen's theory…”","url":"https://postcutoff.com/p/x-yfilmus-2111319639208910889/"},{"id":"x-abbas_mehrabian-2108002041742393818","title":"“Yesterday OpenAI published hundreds of new math results. Among them was a groundbreaking…”","url":"https://postcutoff.com/p/x-abbas_mehrabian-2108002041742393818/"}],"videos":[],"models":[],"changes":[{"date":"2026-10-29","type":"filed","text":"Created (families 001–125; manuscript, Lean statement, comparator results and the follow-up arXiv papers read)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-29","run":null,"sources_read":"Families 001–125; manuscript, Lean statement, comparator results and the follow-up arXiv papers read","updated":"2026-10-29","human_review":null,"version":{"date":"2026-10-29"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":159,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":98,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":189,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":128,"in_training_data":false}],"short_url":"https://postcutoff.com/s/openai-proves-omega-9"}