正文 · 原文
该语言的正文暂不可用，当前显示已有版本。
https://t.co/o0hIvOIH9i
OpenAI 发布722份AI生成的数学证明
自动核验发布 · 本文由系统生成并完成证据核验，未经人工审稿。
一则帖子称，OpenAI 发布了722份AI生成的数学证明，相关论文涉及372项数学成果。其中一项矩阵乘法结果将两个 n×n 矩阵相乘的已证明复杂度上界从约 n^2.371177 降至约 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.
在 X 查看回复的帖子
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 查看上下文