GPT-5.6 Closes a 30-Year Open Problem in Convex Optimization

A thread on r/math surfaced a claim that GPT-5.6, following OpenAI's CDC proof announcement, used a carefully constructed prompt to close a gap in convex optimization that had been open for roughly three decades.

The significance is not that an LLM generated text about math. It is that the model produced a result researchers could not close despite sustained effort. Convex optimization underpins a large surface area of applied work: training dynamics, resource scheduling, signal processing, control systems. A structural advance there is not academic noise.

What matters for engineers building on top of frontier models is the prompt dependency. The result was not produced by running the model out of the box. A specific prompting structure was required. That detail is underreported in the coverage but carries real weight: it implies the capability existed in the model but required elicitation, which means the gap between what a model can do and what it routinely does is still being probed.

For technical founders, this is a calibration point. If GPT-5.6 can close a 30-year problem in a mature mathematical domain, the ceiling on what these models can do in constrained, well-defined problem spaces is not well understood yet. The useful question is not whether LLMs can do hard math. It is what class of problems in your domain has the same structure: bounded, formally checkable, historically resistant to human progress.

The pattern is also worth tracking. OpenAI's CDC proof and now this result suggest the lab is either surfacing or enabling a cluster of hard mathematical results in a short window. Whether that reflects a genuine capability jump in GPT-5.6 or better prompting methodology is still unclear. Both explanations have different implications for how you use these models in production.

Source