{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-07-14-gpt-5-6-zeroth-order-convex-lower-bound/","md":"https://postcutoff.com/e/2026-07-14-gpt-5-6-zeroth-order-convex-lower-bound/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-07-14-gpt-5-6-zeroth-order-convex-lower-bound","date":"2026-07-14","date_precision":"day","short_title":"Berkeley's Phillip Kerger uses GPT-5.6 Sol and a 10-page prompt to close a 30-year gap in derivative-free convex optimization","deck":null,"takeaway":"In July 2026 UC Berkeley IEOR teaching professor Phillip Kerger posted a proof that deterministic optimization of a convex Lipschitz function over a d-dimensional ball with only exact function values needs Ω(d²/log(d+1)) queries.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2607.13335: Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization","url":"https://arxiv.org/abs/2607.13335","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"GitHub: PhillipKerger/zero-order-bounds-lean-verification (Lean 4 companion)","url":"https://github.com/PhillipKerger/zero-order-bounds-lean-verification","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"Phillip Kerger (Medium): An AI-assisted breakthrough in convex optimization","url":"https://medium.com/@kerger.p/an-ai-assisted-breakthrough-in-convex-optimization-an-optimization-problem-dating-back-30-years-a-db5c631119de","type":"official","group":"primary","domain":"medium.com"},{"n":4,"title":"arXiv 2607.16558: Near-optimal lower bounds for randomized algorithms (follow-up)","url":"https://arxiv.org/abs/2607.16558","type":"paper","group":"primary","domain":"arxiv.org"},{"n":5,"title":"temperature2: GPT-5.6 closes a second 30-year math gap without OpenAI","url":"https://temperature2.com/p/2026-07-19-gpt-5-6-second-math-proof-outside-openai/","type":"press","group":"press","domain":"temperature2.com"},{"n":6,"title":"AI Weekly: GPT-5.6 Sol Pro closes 30-year gap in zeroth-order convex optimization, Lean-verified","url":"https://aiweekly.co/node/6956","type":"press","group":"press","domain":"aiweekly.co"},{"n":7,"title":"Hacker News discussion (601 points)","url":"https://news.ycombinator.com/item?id=48957779","type":"discussion","group":"reactions","domain":"news.ycombinator.com"}],"official":4,"filed":"2026-10-02","updated":"2026-10-19","orgs":["UC Berkeley","OpenAI"],"title":"Berkeley's Phillip Kerger uses GPT-5.6 Sol and a 10-page prompt to close a 30-year gap in derivative-free convex optimization","summary":"In July 2026 UC Berkeley IEOR teaching professor Phillip Kerger posted a proof that deterministic optimization of a convex Lipschitz function over a d-dimensional ball with only exact function values needs Ω(d²/log(d+1)) queries. This nearly matches Protasov's 1996 ~d² algorithm and closes a gap that had stood since 1996 (the previous lower bound was ~d). Kerger says GPT-5.6 Sol produced the proof in one ~2.5-hour session from a 10-page prompt modelled on OpenAI's cycle-double-cover method. He verified the core lower bound in Lean. It was the first widely noticed outside replication of that \"long prompt\" method.","key_facts":["Paper: arXiv 2607.13335, 'Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values' (Phillip Kerger, submitted July 14, 2026, 36 pages); it also gives Õ(d²·2ⁿ) results for mixed-integer problems","Result: Ω(d²/log(d+1)) deterministic exact-value query lower bound vs O(d² log² d) upper bound from Protasov's 1996 method; the previously applicable lower bound was Ω(d)","AI role (Kerger's Medium post, as reported by temperature2 and AI Weekly): a ~10-page prompt with background, techniques and direction; the model produced a complete proof in ~2.5 hours without intervention. Kerger had worked on the gap for about a year. AI Weekly names the model 'GPT-5.6 Sol Pro'","Lean 4/mathlib companion repo (PhillipKerger/zero-order-bounds-lean-verification, created July 14) fully verifies the paper's deterministic d^(-1/2)-accuracy lower bound, including Brunn–Minkowski and Urysohn machinery; the upper-bound and transfer results are outside the formalization","The arXiv abstract itself does not mention AI. The AI-assistance claim rests on the author's own blog post","Attention: r/math post 'After OpenAI's CDC proof announcement, GPT-5.6 used a prompt to close a 30-year gap in convex optimization' reached the Hacker News front page (601 points, July 18)","Follow-up: Zhang, Zhang, Qi and Lin (arXiv 2607.16558, July 18) proved near-optimal lower bounds for randomized algorithms in the same exact-value setting (no AI mentioned)"],"key_numbers":[],"tags":["math","optimization","gpt-5-6","lean","proof","oracle-complexity"],"science":{"field":"mathematics","subfield":"optimization / oracle complexity","problem":"Query complexity of derivative-free (zeroth-order, exact-value) convex Lipschitz optimization: gap between Protasov's ~d² upper bound and the ~d lower bound","result":"Deterministic lower bound Ω(d²/log(d+1)), matching Protasov's 1996 upper bound up to polylogarithmic factors.","open_since":"1996","ai_system":["GPT-5.6 Sol"],"human_role":"AI-assisted: the researcher wrote a 10-page guiding prompt after a year on the problem; the model produced the proof; the human wrote the paper and checked it in Lean","verification":{"key":"preprint","label":"Preprint only","text":"Partial Lean: the core deterministic lower bound is formally verified in Lean 4 (public repo); the upper-bound and transfer results are not formalized; unrefereed single-author preprint"},"status":"pending","shock":"A single researcher replicated OpenAI's lab-scale proof recipe on a problem of his own choosing within days."},"body_md":"## What happened\n\nA few days after OpenAI's cycle double cover proof, Kerger applied the same kind of long, structured prompt to a problem he had worked\non for a year. The question is how many function evaluations a deterministic method needs to minimize a convex function when it sees\nonly exact values and no gradients. Protasov's 1996 method needs about d² evaluations, but the best lower bound was only about d. The\nmodel's argument establishes a near-quadratic lower bound. Kerger then had the core result machine-checked in Lean and published the\npaper, the Lean code and (reportedly) the prompt and chat logs.\n\n## Why it matters\n\nMost of the summer's AI-math headlines came from the labs themselves. This was an outside, single-author result with a formal proof,\non a well-defined classical gap, and it suggested the recipe transfers to other areas of mathematics. Caveat: the Medium post with\nthe step-by-step AI account could not be read directly here, because of a Cloudflare block. Details of the AI's role come from\nsecondary summaries of it.","disputed":[{"label":"Verification","text":"Partial Lean: the core deterministic lower bound is formally verified in Lean 4 (public repo); the upper-bound and transfer results are not formalized; unrefereed single-author preprint","sources":[]}],"related":[{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]},{"id":"2026-07-17-cycle-double-cover-conjecture-proved","url":"https://postcutoff.com/e/2026-07-17-cycle-double-cover-conjecture-proved/","date":"2026-07-17","date_precision":"day","short_title":"GPT-5.6 Sol Ultra proves the 50-year-old cycle double cover conjecture","deck":null,"takeaway":"Along with the Jacobian counterexample the same week, it marked the point where famous named conjectures, not just Erdős-list problems, began falling to AI.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":4,"official":3,"filed":"2026-09-29","updated":"2026-10-19","orgs":["OpenAI"]},{"id":"2026-07-09-gpt-5-6-sol-terra-luna","url":"https://postcutoff.com/e/2026-07-09-gpt-5-6-sol-terra-luna/","date":"2026-07-09","date_precision":"day","short_title":"OpenAI broadly releases GPT-5.6 after government-gated preview","deck":null,"takeaway":"First frontier model whose public release was explicitly gated by US government review, and the model family involved in the July 2026 sandbox-escape incident.","category":"model-release","category_label":"Model releases","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Confirmed"]},"sources":7,"official":3,"filed":"2026-09-29","updated":"2026-09-29","orgs":["OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-19","type":"edit","text":"Status confirmed → pending (only part of the paper is Lean-verified; the preprint is unrefereed)"},{"date":"2026-10-02","type":"filed","text":"Created (r/math / HN item)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-02","run":null,"sources_read":null,"updated":"2026-10-19","human_review":null,"version":{"date":"2026-10-19"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":44,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":14,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":105,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":44,"in_training_data":false}],"short_url":null}