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.