GPT-5.6 Closes 30-Year Gap in Convex Optimization Theory

Last updated: July 18, 2026

A week after OpenAI claimed GPT-5.6 Sol Ultra proved the Cycle Double Cover Conjecture, another mathematical result has emerged - this time with a Lean-verified proof and a more instructive backstory about how humans and LLMs collaborate on research.

Phillip Kerger's paper "Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization" appeared on arXiv this week, establishing a near-quadratic lower bound that resolves a theoretical gap dating to 1996.

The Problem#

The paper addresses a fundamental question in optimization theory: how many function evaluations does it take to minimize a convex Lipschitz function when you can only query exact function values (no gradients)?

The prior state of the art:

• Lower bound: Omega(d) queries, established through first-order oracle methods
• Upper bound: O(d squared log squared d) queries, via Protasov's 1996 value-only method

This gap between linear and near-quadratic had remained open for 30 years.

Kerger's result establishes a new lower bound of Omega(d squared / log(d+1)), essentially matching the upper bound up to polylogarithmic factors. The gap is closed.

The Prompt Strategy#

What makes this result notable for the AI community isn't just the mathematics - it's how it was achieved. The prompt that produced the proof spans 10 pages of specialized mathematical context.

As the author explains in the Reddit discussion: "I wouldn't really say that this result is using or creating some fundamentally new techniques in convex geometry or optimization theory."

The key insight: the techniques to solve this problem already existed in the literature. What GPT-5.6 provided was the capacity to explore combinatorial possibilities systematically, guided by an expert who knew what direction to push.

What HN Is Saying#

The Hacker News discussion drew 150+ comments, with thoughtful debate about what this means for mathematical research.

"If knowledge is a Swiss cheese, LLMs can help fill the holes, but not make the cheese bigger." This metaphor captured the consensus: LLMs excel at connecting existing techniques, but haven't yet demonstrated genuinely novel mathematical insight.

The prompt expertise matters enormously. Multiple commenters noted that this wasn't "ChatGPT, solve this problem." It required a year of prior research, deep domain expertise, and a 10-page prompt encoding that expertise. One wrote: "The prompt is on page 27. It is ten pages of advanced mathematics priming the model in the right direction."

Some see this as a clear signal. The author's own assessment resonated: "I don't think researchers in math/TCS will be made obsolete, but I think it will instead no longer make sense to work on any low-hanging, or even medium-hanging fruit. We'll be needed for problems where actual novel approaches are needed."

Others see existential implications. One commenter asked: "Is this where the goalpost has moved now? Sure, it's not a breakthrough that opens new roads in mathematics." The pace of AI capability growth has made it difficult to agree on what counts as impressive.

Verification is real this time. Unlike the Cycle Double Cover proof (still under review), this result was formalized in Lean. Several commenters noted this makes the mathematical claims checkable by computer, eliminating concerns about hallucinated proofs.

The Collaboration Model#

This result illustrates what effective human-AI mathematical collaboration looks like today:

1. Human identifies the problem - Kerger had been working on this gap for about a year
2. Human provides domain context - 10 pages of mathematical background, relevant techniques, and direction
3. LLM explores the solution space - systematic exploration of combinatorial possibilities
4. Human verifies and formalizes - Lean proof assistant confirms correctness
5. Human publishes - standard academic process with arXiv preprint

The LLM isn't replacing the mathematician. It's serving as an extremely capable research assistant that can explore possibilities faster than any human.

What This Means for Researchers#

The author's conclusion deserves attention: working on "low-hanging" or "medium-hanging" fruit may no longer make sense when LLMs can tackle those problems given proper context.

This shifts the value proposition for mathematical researchers toward:

• Problem identification - recognizing which open questions matter
• Novel technique development - approaches that don't exist yet in training data
• Cross-domain synthesis - connecting fields in ways not yet documented
• Verification and formalization - ensuring claimed results are actually correct

The mechanical work of exploring known technique combinations? That's increasingly automatable.

The Bigger Picture#

Two LLM-assisted mathematical proofs in one week - one in graph theory (Cycle Double Cover), one in optimization theory - suggests this is becoming routine rather than exceptional.

The pattern seems clear: problems solvable through systematic application of existing techniques are vulnerable to LLM assistance. Problems requiring genuinely new mathematical ideas remain human territory - for now.

The question for working mathematicians isn't whether to use these tools, but how to use them effectively while focusing human effort where it still uniquely matters.

Continue Reading#

• AGENTS.md Configuration Smells: 91% of Popular Repos Get One of Six Wrong
• Anthropic Discovers J-Space: A Global Workspace Inside Language Models
• CLAUDE.md Files Never Stop Growing: A New Paper Names the Mechanism
• GPT-5.6 Sol Ultra Produces Proof of the Cycle Double Cover Conjecture
• Terence Tao Digests the Jacobian Conjecture Counterexample: How Claude Fable 5 Broke an 87-Year-Old Math Problem
• OpenAI Publishes Ten Decade-Open Math Proofs, Each Formalized in Lean

Sources#

• arXiv Paper: Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization - Phillip Kerger's full paper
• Reddit Discussion - Original r/math thread
• Hacker News Discussion - 150+ comments on implications