rohanpaul_ai· @rohanpaul_ai · X·· 3 天前AI 评分
OpenAI 发布 722 项 AI 生成数学证明，将矩阵乘法复杂度降至约 n^2.25
OpenAI 发布 722 项 AI 生成的数学证明，其中一项关于矩阵乘法的结果把两个 n×n 矩阵相乘的已证明成本从约 n^2.371177（AlphaEvolve 于 8 月创下的纪录）降至约 n^2.25。该结果附带 Lean 形式化证明，但属于理论上界，尚未给工程师提供适用于真实 GPU 工作负载的更快例程。
OpenAI today released 722 AI generated math proofs.
This is one of the achievement, on the topics of Matrix multiplication
Here it lowers the proven cost of multiplying 2 n×n matrices from about n^2.371177, the record that AlphaEvolve set in August, to about n^2.25.
The result comes with a Lean formalization, but it is a theoretical bound and does not yet hand engineers a faster routine for real GPU workloads.
来源：rohanpaul_ai · x.com