Rohan Paul· @rohanpaul_ai · X·· 2 小时前AI 评分67
AI 导读
OpenAI 发布 722 篇 AI 生成的数学证明论文，覆盖 372 个数学结果族。其中矩阵乘法证明将 2 个 n×n 矩阵乘法的已证明成本从 AlphaEvolve 今年 8 月创下的约 n^2.371177 降至约 n^2.25，并附 Lean 形式化，但这是理论界，尚未给工程师提供可用于真实 GPU 负载的更快例程；这些结果来自内部模型处理约 4K 研究问题后的分组过滤，每个平均使用约相当于 3 小时 ChatGPT Pro 思考的算力。
正文
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.
OpenAI published the full papers behind its open-problems claim: 722 manuscripts covering 372 math results. OpenAI built this catalogue by giving its internal model roughly 4K research problems during testing, then grouping and filtering the output into 372 significant result families. Almost all of those results came from the same standard setup, and each used on average the computing equivalent of 3 hours of ChatGPT Pro thinking.在 X 查看被引用的帖子
来源：Rohan Paul · x.com