AI Just Closed a 30-Year Math Gap in One Session. The “AI Can’t Do Original Work” Moat Just Cracked.

The problem is old and specific: how many function evaluations does it take to minimize a convex function when you can only query exact values, with no gradients? Since 1996, there was a gap between Protasov’s d² upper bound and a much weaker d lower bound. Nobody had closed it in three decades.

Working from a roughly 10-page prompt, GPT-5.6 Sol Pro produced a proof establishing a near-quadratic lower bound of Ω(d²/log(d+1)) — essentially matching the upper bound up to polylogarithmic factors. The whole thing came out of a single ~2.5-hour session and was formalized in Lean 4 using the Mathlib library. It compiles without a single sorry, the marker Lean uses for a step you haven’t actually proven. In other words: a machine, not a reviewer’s intuition, confirmed the argument holds together.

Here’s the caveat that most breathless coverage skipped, and it’s the important part. Over on r/math, mathematicians are debating whether the result is genuinely new or a reformulation of a lemma already floating around in 1990s Russian optimization literature. The proof is verified; its originality is contested. Hold both of those in your head at once, because the honest version is where the founder lesson lives.

A lot of moats have quietly rested on one assumption: AI can automate the routine, but the genuinely new work is safe with humans. Your defensibility, the story went, is the novel algorithm, the clever architecture, the research insight the model could never have on its own. This week is a data point against the strong version of that story — at least in domains where “correct” can be checked.

And this isn’t a one-off. The same month, labs reported AI disproving a 1946 Erdős conjecture and clearing problems that had been open for 50 years; systems now solve a large share of historical IMO problems. When you can verify an answer — a proof, a passing test suite, a spec a compiler accepts — AI can now search the space of candidate solutions faster and more tirelessly than you can.

Look at the exact conditions that made this work: a crisply specified problem, a formal language to express the answer in, and an automatic verifier to say yes or no. That is a very particular kind of playground. Most of what founders do lives nowhere near it. There is no Lean compiler that tells you your positioning is correct, your pricing is right, or that customers will trust you.

So the takeaway isn’t “AI does everything now.” It’s that the frontier of “too hard for AI” just moved, and it moved along a specific line: verifiability. Work that can be checked mechanically is getting commoditized fast. Work whose quality is a matter of taste, context, and judgment is not — which is the same reason we argued the moat is moving to the judgment AI can’t fake.

It’s also why the smart money keeps flowing toward vertical AI in messy, regulated domains. The defensibility there isn’t a clever proof anyone can reproduce — it’s the proprietary data, the workflow trust, and the accountability a compiler can never sign off on.

Don’t rewrite your roadmap over one contested proof. Do use it as a prompt to pressure-test where your defensibility actually comes from.

Expect the pattern to spread wherever a domain gets its own “Lean.” Formal verification is coming to more of software, hardware, and finance — and the moment a field can mechanically check an answer, AI gets very good at producing one. Watch for the verifier, not the headline: the arrival of automated checking is the real leading indicator that a task is about to commoditize.

The founders who stay calm through this are the ones who never built their business on being the only mind that could find the answer. They built it on choosing the right questions, owning the data and the customer relationship, and being trusted to judge what “good” means. GPT-5.6 can close a 30-year gap in an afternoon. It still can’t tell you which gap was worth closing. That part — for now — is still the job.