The short version
In 1957, a machine that could beat the world chess champion would be intelligent. In 1997 one did, and it became just brute-force search. That summer, Go was declared the real test, perhaps a century away. In 2016 it fell, and it became pattern matching on a board. In 2019, ARC-AGI was built around novel puzzles language models could not touch. On 2 September 2026, a model scored 99.9% on its third version; the benchmark’s creators wrote, reasonably, that saturation would not prove AGI.
Six days later, OpenAI reported something categorically different. An internal multi-agent system had produced an analytical proof and Lean formalization for finite-time singularity in the forced three-dimensional incompressible Navier–Stokes equations, a proposed resolution of a Millennium Prize Problem that had remained open for roughly 90 years. [77]
This is not another score on a test with known answers. It is a claim to new, formally checkable knowledge. It also reveals that the relevant unit of intelligence is no longer obviously one model: OpenAI describes roughly 10,000 concurrent agents, code and internet tools, cross-group synthesis, 2.7 million messages, and about 130 billion output tokens. Capability now appears at the level of an organized system.
The result still has to survive independent mathematical scrutiny. Clay continues to list the problem as unsolved, and its rules require publication in a qualifying outlet, two years of elapsed time, and general acceptance by the global mathematics community before consideration. [78] [79] That delay is not a footnote. It exposes three different clocks: discovery, verification, and institutional acceptance.
The cycle is older than the computer. In 1843, Ada Lovelace wrote that the Analytical Engine “has no pretensions to originate anything.” Turing quoted the sentence in 1950, named it “Lady Lovelace’s Objection,” and answered that machines surprised him frequently. The objection has been reissued after every milestone in the vocabulary of the day: brute force, lookup, pattern matching, autocomplete, training data. The verdict is 183 years old. Only the noun changes.
This page keeps the ledger: who drew each line, when it fell, what people said afterward, and where the line went next. The latest event changes the final question. If a machine can originate a result that no one knew, the argument can no longer stop at whether it passed our test. It must ask whether the result is correct, attributable, reproducible, and accepted.