What happens when you ask an AI model a question that no human has been able to answer for three decades? A Reddit discussion on r/math and a Medium post by researcher Philippe Kerger reveal that GPT-5.6 Sol Pro, given a precisely engineered prompt, produced a novel approach that effectively closes a long-standing gap in convex optimization. The problem had resisted solution since the mid-1990s, surviving through multiple generations of mathematical tools and techniques. Now, a language model appears to have cracked it. While the mathematics community is still reviewing the details, the implications are immediate and profound: AI is transitioning from a code-generation assistant into a genuine research partner capable of original contributions in one of the most mature fields of applied mathematics.
The Problem: A 30-Year Blind Spot in Optimization Theory
The open problem sits at the intersection of convex optimization and operations research, two fields that underpin everything from machine learning training algorithms to logistics routing to financial portfolio construction. Convex optimization problems are the gold standard in mathematical optimization because they guarantee that any local minimum is also a global minimum : meaning you can always find the best possible answer. But not all convex problems are equally tractable. The specific gap that GPT-5.6 addressed involves a class of optimization problems where existing theory could not determine whether an efficient solution existed. Researchers had tried and failed to prove convergence guarantees for this problem family since the 1990s, and it had become something of a known limitation in the field. Graduate seminars taught it as an open question. Textbooks mentioned it as a frontier. And then Kerger asked GPT-5.6 Sol Pro to take a look.
How GPT-5.6 Solved It: Prompt Engineering Meets Emergent Reasoning
Kerger did not feed the model a textbook or a paper. He wrote a prompt describing the problem structure, the existing partial results, and the specific gap that needed closing. According to his account, GPT-5.6 Sol Pro produced a multi-step reasoning chain that introduced a novel transformation technique not present in the literature. The model did not merely synthesize existing approaches : it generated a genuinely new method for bounding the convergence rate of the optimization algorithm in question. Early community review suggests the reasoning is sound, though full peer validation is still underway. What makes this case remarkable is not just that the model found a solution, but that it did so without training on the specific problem. The capability appears to have emerged from GPT-5.6's broader mathematical reasoning ability, honed across millions of problems during training but never explicitly directed at this gap. This is the difference between a model that can solve textbook problems and one that can extend the frontier of human knowledge.
Not the First Time: AI's Growing Track Record in Mathematical Discovery
This convex optimization breakthrough follows a pattern that has accelerated dramatically in 2026. Earlier this year, OpenAI's CDC (Coordination and Discovery) proof demonstrated that GPT-5.6 could verify and extend complex mathematical arguments. Independent researchers have since documented cases of the model generating novel proofs in combinatorics, number theory, and graph theory. What is changing is the sophistication of the problems being solved. Early AI-assisted math discoveries tended to involve problems that were obscure or had small search spaces. The convex optimization gap is different: it is a well-known problem in a mature field that multiple research groups had worked on. The fact that a language model could make progress where specialized optimization researchers could not signals that AI is beginning to operate at the frontier rather than just behind it. For context, Google DeepMind's AlphaTensor discovered new matrix multiplication algorithms in 2022, and AlphaFold solved protein folding in 2021. Those were specialized systems trained for specific domains. GPT-5.6 is a general-purpose language model solving an open math problem from a plain-text prompt.
What This Means for Builders
For founders and builders, this development carries three concrete implications. First, AI-augmented R&D is no longer speculative. If a general-purpose model can close a 30-year gap in convex optimization on a single prompt, then investing in AI-assisted research workflows is becoming a competitive necessity. Startups in quant finance, logistics optimization, ML infrastructure, and scientific computing should be building prompt-based research pipelines today, not next quarter. Second, the moat around specialized mathematical expertise is thinning. For decades, hiring PhDs in operations research or optimization was the only path to working on hard problems in those domains. GPT-5.6's performance suggests that a skilled prompter with domain knowledge can now achieve results that previously required years of specialized training. That does not eliminate the need for experts, but it does multiply their effectiveness. Third, this changes the economics of R&D for math-intensive startups. The cost of attempting a hard optimization problem just dropped from months of researcher time and tens of thousands of dollars to a single API call. Founders who build their workflows around this new capability will have a structural cost advantage over those who do not. The message is clear: bring your hardest unsolved problems to the prompt. You might be surprised what comes back.
