{"arxiv_id":"2610.28627","title":"Matrix Multiplication from Polynomial Packings: A Constructive and Elementary Proof of $\\omega\\le9/4$","abstract":"We give a self-contained constructive proof that the matrix multiplication exponent satisfies $\\omega\\le9/4$. In a recent breakthrough, OpenAI~\\cite{original} established this bound in the model of exact scalar arithmetic over the complex numbers, using non-constructive arguments in Strassen's asymptotic spectral framework. We explicitly construct a Strassen-style matrix multiplication identity and obtain the bound by ordinary block recursion. For every $\\gamma>0$, the resulting algorithm multiplies two $n\\times n$ integer matrices using $O(n^{9/4+\\gamma})$ integer arithmetic operations.\n  As an independent contribution, we develop a framework of \\emph{polynomial packings}---methods for reducing many polynomial multiplications to fewer ones using linear operations. We isolate and generalize a construction of OpenAI~\\cite{original} to obtain a simple packing, and show how packings can be composed to amplify their ``compression rate\", which finally yields Strassen-like identities.","primary_cat":"cs.CC","cross_cats":[],"submitted_at":"2026-10-20T17:59:14+00:00","latest_version":2,"source":"arxiv","source_label":"arXiv","source_url":null,"has_pdf":true,"has_source":false,"verdict":null,"confidence":null,"one_line_summary":null,"novelty_score":null,"correctness_risk":null,"formal_verification":null,"upvotes":0,"downvotes":0,"pith_score":0.0,"inbound_count":5,"_links":{"html":"https://pith.science/paper/2610.28627","verdict":"/api/v1/verdicts/2610.28627"}}