What was already known
The earlier supported-model bounds over fields were and . Using a newer centralised multiplication exponent in the latter framework would give .
AI involvement
The authors credit OpenAI models, primarily GPT-6, with the algorithm design. They name GPT-6 Astra and GPT-6.1 Sol among the tools used for the design, proof and Lean work.
- Gupta, Suomela and Vahidi’s sparse multiplication algorithmAI disclosure and provenance
Importance
Clustering dense rectangles of requested output positions lets the algorithm handle those blocks and the sparse remainder separately. The improvement works over semirings and does not use fast centralised matrix multiplication.
Technical verification
The authors link a Lean formalization. The archive could not be inspected to establish the exact checked theorem and a completed run.
Human understanding
The authors explain the algorithm in the paper, including why removing dense output rectangles bounds the communication needed for the remaining products.
Correction and publication history
Published a scoped research advance with primary evidence of central AI work.
Read this published revision