OpenAI 用通用推理模型解决了一个困扰数学家近 80 年的难题，证明 AI 不需要专用引擎也能做前沿数学研究。做 AI 推理或数学建模的团队值得关注——它展示了“推理时计算”比“更多训练”更能带来突破。
OpenAI 的通用推理模型成功推翻了一个自 1946 年以来的 Erdős 平面单位距离猜想，证明了存在无限族构造能多项式改进已知上界。关键在于该模型并非专用定理证明引擎，而是通过增加测试时计算（推理阶段思考）来提升表现，无需大量领域特化训练。这一突破展示了通用推理系统在数学探索中的潜力，能够跨越几何与代数数论（如类域塔理论）的鸿沟，发现人类因学科边界和直觉限制而忽略的路径。外部数学家已验证了该证明的正确性。
AI in math is creating history again, as OpenAI's …
AI in math is creating history again, as OpenAI's general-purpose reasoning model has disproved a major Erdős conjecture from 1946.
The important part is not that AI solved a hard math problem, but how little special machinery it needed.
For decades, the planar unit distance problem looked almost embarrassingly simple: place points on a plane, then ask how many pairs can be exactly one unit apart.
For decades, the best examples looked like stretched versions of a square grid, so mathematicians believed grids were almost the best possible design.
OpenAI’s internal model broke that picture by finding an infinite family of constructions that gives a polynomial improvement, with the proof checked by external mathematicians.
The point to note is that the model was not a bespoke theorem-proving engine trained only for this problem, and the official post says its success improved with more test-time compute, meaning more reasoning at inference rather than only more training.
That matters so much, because research progress often comes from holding a fragile chain of ideas together long enough to cross from one field into another.
In this case, the bridge ran from a plain geometric question into deep algebraic number theory, including machinery like infinite class field towers and Golod–Shafarevich theory.
And now we see a general-purpose reasoning system appears able to search a conceptual space where human taste, field boundaries, and inherited guesses may have quietly narrowed the path.
So future is not machines replacing judgment, but machines widening the map before judgment begins.