GPT-5.6
A family is a named generation or product line. Scores below are the sum of its named releases and any documented internal systems in the same line.
Benefit
+2.62
Harm
0.00
Net Good
2.62
Releases
- GPT-5.6Version unspecified
Leaderboard
| Rank | Model | Organization | Benefit | Harm | Net | Events | Last impact |
|---|---|---|---|---|---|---|---|
| 28 | GPT-5.6 Sol | OpenAI | +1.48 | 0.00 | 1.48 | 4 | 8 Sep 2026 |
| 41 | GPT-5.6 GPT-5.6 · version unspecified | OpenAI | +0.66 | 0.00 | 0.66 | 1 | 31 Aug 2026 |
| 47 | GPT-5.6 Pro | OpenAI | +0.48 | 0.00 | 0.48 | 2 | 30 Jul 2026 |
Timeline
Events
Buckmaster and Alpöge, using Sol and Claude, prove smooth-forced blowup for Euler, IPM, and Boussinesq
On 8–11 September 2026 Tristan Buckmaster and Levent Alpöge released Lean-backed finite-time blowup results with smooth forcing for incompressible porous media, 2D Boussinesq, and 3D Euler, crediting Anthropic’s Claude and especially OpenAI’s GPT-5.6 Sol. Astra was used only for writeups and auditing.
Freitag and Mutchnik, using ChatGPT 5.6, counterexample the stable forking conjecture
On 31 August 2026 James Freitag and Scott Mutchnik posted arXiv:2609.00436, a counterexample to the 1996 Hart–Kim–Pillay stable forking conjecture, found using ChatGPT 5.6.
Liu, Luo, and Xie post a complete proof of the Tu–Deng conjecture
On 30 July 2026 Renzhang Liu, Hengyi Luo, and Tianyuan Xie posted a complete proof of the Tu–Deng combinatorial conjecture on Hamming weights modulo 2^k−1 (arXiv:2608.05187). A compiled dataset records ChatGPT 5.6 Pro assistance; the arXiv abstract does not name a model or split of labor.
GPT-5.6 Sol / Codex produces shorter superpermutations for n=8, 9, and 10
On 26 July 2026 Epoch recorded new superpermutation constructions for n=8, 9, and 10 that beat prior upper bounds, accepted by an exact verifier, from a GPT-5.6 Sol / Codex session.
Rybin, using GPT-5.6 Pro, counters the Dinitz–Garg–Goemans unsplittable-flow cost conjecture
On 22 July 2026 Dmitry Rybin announced an explicit 7-vertex graph in which a feasible fractional unsplittable-flow costs 58 while every congestion-legal unsplittable flow costs at least 60, disproving Goemans’ cost-preserving rounding conjecture. He attributes the construction to GPT-5.6 Pro. An Isabelle Archive of Formal Proofs entry later checks the finite instance.
GPT-5.6 Sol proves Chernoff’s density is strongly log-concave
A 21 July 2026 arXiv note proves Balabdaoui and Wellner’s 2014 conjecture that Chernoff’s density is strongly log-concave. The authors state the proof was generated in its entirety by GPT-5.6 Sol and then checked and revised by them.
Long, using Sol Pro and Fable 5, posts low-degree Gaussian Moments counterexamples
On 20 July 2026 Christopher D. Long posted explicit polynomials showing the Gaussian Moments conjecture fails in every dimension n≥3: a cubic in four variables found by GPT-5.6 Sol Pro, then a quartic in three variables found by Claude Fable 5. This is not a Jacobian-conjecture score and not a Clay problem.