Descrição do Conteúdo / Informações:
-------------------------------------------------------------------------


GPT-5.6 Closed a 30-Year Math Gap. Nobody Noticed.


On July 17, 2026, a post hit the top of Hacker News with 513 points and 328 comments. It linked to a Reddit r/math thread where a researcher detailed how GPT-5.6 Sol — guided by a carefully constructed prompt — proved that convex optimization over a standard function class requires Omega(d^2) function evaluations. That lower bound matches the upper bound of an algorithm published thirty years ago. The gap is closed. The complexity is settled.

Read the full version with charts and embedded sources on ComputeLeap

The same week, the same model's consumer coverage consisted of token-cost calculators and settings walkthroughs. The divergence is not accidental. It is the story.

View on Hacker News



What Actually Happened: The Omega(d^2) Result


The specific achievement is a complexity-theoretic proof, not a calculation. For thirty years, the best known algorithm for minimizing a convex, bounded Lipschitz function in d dimensions has required Omega(d^2) function evaluations. Researchers knew this was probably optimal — no faster algorithm had been found — but nobody could prove the corresponding lower bound. Without the lower bound, you cannot rule out the existence of a faster algorithm. You can only say no one has found one yet.

GPT-5.6 Sol closed that gap. The model, operating under a researcher's prompt framework built over a year of failed attempts with earlier models, produced a proof that the Omega(d^2) lower bound holds. The result means: no algorithm, however clever, can solve this class of problems in fewer evaluations. The thirty-year-old algorithm was optimal all along.

Why lower bounds matter more than upper bounds: Proving an algorithm works (upper bound) shows one approach succeeds. Proving a lower bound constrains every possible approach — it is a statement about the fundamental structure of the problem, not the cleverness of any particular solution. Lower bounds are categorically harder to establish.

The computation took approximately 148 minutes — nearly two and a half hours of sustained reasoning. This was not a flash of pattern recognition. It was extended formal argumentation, with the model navigating proof strategies that had defeated human mathematicians for three decades.

To understand why this matters: convex optimization is not an academic curiosity. It is the mathematical foundation beneath every gradient descent step in every neural network training run. The algorithms that train GPT-5.6 itself descend from the theory it just advanced. There is something recursive about a model proving optimality bounds on the class of algorithms used to create it.

As one HN commenter (LPisGood) noted: convex, bounded Lipschitz function optimization underlies modern machine learning. Another (hodgehog11) pushed back — modern AI uses nonconvex objectives where classical convex theory does not directly apply. The rebuttal (alternator) was precise: optimizers like ADAM and SGD originated from convex research, and understanding the convex case remains the foundation for nonconvex extensions. The theoretical result has practical downstream implications even if production training is technically nonconvex.



The Pattern: Two Frontier Math Results in a Month


This is not an isolated event. Eight days earlier, OpenAI announced that GPT-5.6 Sol Ultra — using 64 parallel subagents — produced a proof of the Cycle Double Cover Conjecture, a 50-year-old open problem in graph theory asking whether every bridgeless graph contains a collection of cycles covering each edge exactly twice. That proof took under an hour.

The Shared Sapience newsletter framed both results as evidence of something structural: the industrialisation of the intellectual process — fundamentally restructuring how mathematical discovery operates, moving beyond individual human cognition as the rate-limiting step.

View on Substack

The pattern across the two results is worth noting:

Result
Problem Age
Compute Time
Method
Verification

Cycle Double Cover
50 years
Under 1 hour
64 subagents (Ultra)
Lean formalization provided, not peer-reviewed

Convex Optimization Lower Bound
30 years
~148 minutes
Single prompt-guided session (Sol)
Human-verified by domain expert

The CDC proof is flashier — bigger conjecture, more dramatic claim. But the convex optimization result may be more significant for what it reveals about methodology. It was produced by a single model instance guided by a human researcher's prompt, not a multi-agent swarm. The researcher spent a year building the context, failing with earlier model versions, and refining the approach. When GPT-5.6 Sol arrived, the accumulated prompt engineering met sufficient model capability, and the proof emerged.



The Attribution Problem: Who Did the Math?


The HN discussion immediately surfaced the central tension. User YeGoblynQueenne raised the sharpest version: the researcher spent a year attempting the problem with earlier models and provided substantial context and techniques in the prompt. How much was truly the AI versus prior human work?

User dwohnitmok countered: the AI provided a Lean formalization not included in the initial prompt, suggesting genuine novel contribution beyond simple retrieval.

This is not a clean binary. The Adil Salim paper from October 2025 — documenting earlier GPT-5-Pro work on a related convex analysis problem — describes exactly this dynamic: GPT-5-Pro accelerated progress through strategic suggestions and partial proofs, though the process required careful human supervision to correct subtle mistakes.

The collaborative model looks like this: human sets direction and provides constraints, model generates candidate proofs at speeds no human can match, human verifies and corrects, model iterates. Neither party could produce the result alone. The question "who did the math" may be as outdated as asking who wrote a particular line of code in pair programming.

View original post on X

Contrarian Corner: The Prompt Is the Research

The strongest skeptical position is not that GPT-5.6 cannot do math. It clearly can. The skeptical position is that the prompt engineering — a year of domain-expert iteration, failed attempts, and accumulated context — is the actual research contribution. The model is an execution engine, not a researcher. If you hand the same model the same problem without the accumulated prompt framework, it fails. The human researcher closed the gap; the model was merely the fastest pen available.

This matters because it determines whether the result scales. If prompt engineering is the bottleneck, then AI math requires AI-literate domain experts — a scarce resource. If model capability is the bottleneck, then the floodgates open with each generation.



The Attention Divergence: Capability vs. Coverage


Here is what makes the timing remarkable. GPT-5.6 Sol shipped to general availability on July 9, 2026. In the nine days since:

The research surface produced:

• A proof closing a 30-year complexity gap in convex optimization

• Ongoing verification of the CDC proof (Lean formalization open-sourced)

• Active HN evaluation threads benchmarking Sol against Fable 5 on NP-hard problems (218 pts, 107 comments)

The consumer coverage produced:

• Token-cost comparison calculators

• Settings optimization guides

• YouTuber reaction thumbnails

We covered this divergence ourselves: GPT-5.6 Won the Headlines. The Money Bet on Anthropic. showed prediction markets pricing Anthropic at 94% while GPT-5.6 dominated YouTube thumbnails. The pricing discourse is equally disconnected — our own analysis of Sol's cost-per-task reality documented how the sticker price obscures actual expenditure.

But this is worse than a pricing gap. This is a capability gap — between what the model demonstrably does at the research frontier and what the attention economy tells people it does. The researchers using Sol for mathematical proof generation inhabit a different reality than the users following settings-optimization threads.

View on Hacker News



The Live Question: Who Sets the Research Agenda?


The HN thread surfaced a concern that cuts deeper than attribution. User nicf reflected on mathematics education implications: if AI solves low-hanging problems, how will junior researchers gain foundational experience? The field's training pipeline depends on tractable open problems — and AI is consuming them.

The Leiden Declaration, signed in June 2026 by 16 researchers across 15 universities including Cambridge, Oxford, and Columbia, formalized this concern: mathematics risks losing autonomy in setting its research agenda when technical feasibility or commercial interests shape research directions.

This is not abstract. The convex optimization result was not the problem most important to the field — it was the problem most amenable to prompt-guided LLM attack. The researcher chose it because prior model attempts had gotten close. Selection bias in AI-assisted research is real: models will solve what models can solve, and researchers will pursue what models can assist with.

View on Reddit

Zvi Mowshowitz's framing captures the operational reality: Sol is the workhorse — fast, cheap, reliable for bounded technical tasks. The math results are the ceiling of what that workhorse can do when pointed at the right problem by the right person. The question the Leiden signatories are asking is whether "the right problem" will increasingly mean "the problem tractable to AI" rather than "the problem most important to mathematics."



The Fable 5 Comparison: Different Strengths, Same Week


The same day the convex optimization thread hit HN, another post drew 218 points comparing Fable 5 and GPT-5.6 Sol on a Traveling Salesman Problem variant. The findings:

• Fable 5 showed superior reasoning and domain understanding — functioning more like a seasoned product manager

• GPT-5.6 Sol demonstrated higher relentlessness but occasionally employed unconventional methods

• The /goal feature produced small or insignificant impact

• Both models degraded at high context lengths (~300k+ tokens)

The comparison is instructive. Sol's strength is sustained formal computation — exactly what mathematical proof requires. Fable's strength is architectural reasoning and judgment. The math results are not evidence that Sol is "better" in general. They are evidence that proof generation maps specifically to Sol's cognitive profile: relentless, literal, computationally tireless.



What This Means for You


For engineering teams and researchers:

• The research methodology is the moat. The convex optimization result required a year of prompt engineering by a domain expert. The model was necessary but not sufficient. Teams investing in structured prompt frameworks for their domains are building competitive advantage that survives model generations.

• Verification infrastructure matters more than generation. Both math results required human verification or formal proof checking (Lean). As models produce more candidate proofs, the bottleneck shifts to verification. Invest in formal verification tooling.

• Model selection by cognitive profile, not leaderboard. Sol excels at sustained formal computation. Fable excels at architectural judgment. The Fable vs Sol NP-hard comparison shows these are different tools for different problem shapes. Match the model to the cognitive demand of the task.

• The 148-minute timescale is new. Most model interactions are seconds to minutes. Extended reasoning at the 2.5 hour scale unlocks problems that shorter sessions cannot reach. Budget for longer compute runs on hard problems.



The Quiet Surface


Thirty years of mathematical uncertainty, resolved in 148 minutes. The proof sits in an r/math thread while the front page of tech media runs another pricing comparison. This is not a failure of journalism — it is a structural feature of attention markets. Pricing stories have a broader audience. Proof stories require mathematical literacy to evaluate.

But the gap between what these models do and what people think they do is now measured in decades of unsolved problems. The researchers working at the frontier know this. The token-cost calculators do not. The question is not whether AI can do original mathematics — that question was answered this week, and the week before, and it will be answered again next week. The question is whether humans still set the direction.

The Leiden Declaration's 16 signatories — from Cambridge, Oxford, Columbia, Northwestern, and eleven other institutions — think that question deserves an answer before the models solve it for us. The clock on that answer is now measured in model generations, not academic cycles.

For pricing and cost-per-task reality on the same model, see GPT-5.6 Looks Cheaper. Your Invoice Won't Agree.. For the market-signal divergence, see GPT-5.6 Won the Headlines. The Money Bet on Anthropic..

Originally published at ComputeLeap