Event ·Multi-source

OpenAI 发布 722 个 AI 生成的数学证明

OpenAI 发布了 722 个由 AI 生成的数学证明。其中在矩阵乘法这一问题上,把已证最低复杂度从 AlphaEvolve 在 8 月创下的约 n^2.371177 降到约 n^2.25。结果附带 Lean 形式化验证,但属于理论上界,尚未转化为可用的更快的 GPU 实际计算例程。

Current read

OpenAI 用 AI 生成了 722 个数学证明,还把矩阵乘法的复杂度纪录从 AlphaEvolve 的 n^2.37 压到 n^2.25,附带 Lean 验证,搞数学和算法的可以看看。

11 sources91° AI heatLast updated 2026/10/7 00:41:43

Evidence

11 sources
Primary sourcerohanpaul_ai
View source
Related source 1arXiv: OpenAI
View source
Related source 3OpenAI Blog
View source
Related source 4kimmonismus
View source
Related source 5Thomas Wolf
View source
Related source 8Greg Brockman
View source
Related source 9Gary Marcus
View source
Related source 10Tech in Asia
View source

Conflict check

Dedup data only shows that these sources discuss the same event, not that they agree. There is no structured supporting or refuting evidence yet, so no conflict is inferred automatically.