GPT-5.5 Pro-assisted construction lowers the smallest known Borsuk counterexample dimension from 64 to 63
Result confirmed
The takeaway
In May 2026 Max Grinsztajn, assisted by OpenAI’s GPT-5.5 Pro, built a 321-point set in R^63 that cannot be split into 64 parts of smaller diameter, so Borsuk’s conjecture fails in dimension 63 (b(63) ≥ 65).
Status
- Claim
Result confirmed
- Our reporting
- Medium confidence
- Verification
- Unverified claim
- Importance
- 3 of 5
- Last verified
- 29 October 2026
Your AI and this story
- GPT-6.2 AstraIn its training data
- Claude Opus 5.5In its training data
- Gemini 4 HydrogenAfter its cutoff
- Grok 4.7In its training data
It is after the cutoff of Gemini 4 Hydrogen, and can be in the training data of GPT-6.2 Astra, Claude Opus 5.5 and Grok 4.7.
Key facts
- Construction: 320-point Jenrich–Brouwer core from the G2(4) strongly regular graph in a codimension-2 subspace of R^63, plus one projected and rescaled point
- Result: 321 points, any subset of smaller diameter has at most 5 points, so at least 65 parts are needed (b(63) ≥ 65)
- Open range for Borsuk’s conjecture moves from 4 ≤ n ≤ 63 to 4 ≤ n ≤ 62
- Repository README: ‘The construction and proof were obtained with assistance from GPT-5.5 Pro’; exact verification script plus Sage-checkable certificates (no Lean proof)
- Recorded in Tao’s optimization-constants table (constant 28a) as [Gri2026]
- arXiv 2608.12561 (Yibo Ji, 12 Aug 2026): same 321-point set ‘generated entirely by ChatGPT using GPT 5.6 Sol’; withdrawn 14 Aug 2026 because the construction had already been published
- Yibo Ji’s arXiv withdrawal comment (2608.12561v2): ‘Just found out that this counterexample had already been posted elsewhere: https://github.com/maaxgrin/borsuk-63-counterexample1 and https://nickk124.github.io/borsuk/'
What happened
Borsuk asked in 1933 whether every bounded set in R^n can be split into n+1 pieces of smaller diameter. Kahn and Kalai showed in 1993 that the answer is no in high dimensions, and later work pushed the smallest known failing dimension down to 64 (Jenrich, 2013, from Bondarenko’s construction). In May 2026 Max Grinsztajn, working with GPT-5.5 Pro, added one carefully projected point to the 320-point Jenrich–Brouwer set and got a 63-dimensional counterexample. His repository ships an exact verification script and certificates.
The exact day is not known. Wikipedia dates the result to May 2026. In August 2026 Yibo Ji posted the same kind of 321-point construction to arXiv, saying it was “generated entirely by ChatGPT using GPT 5.6 Sol”. He withdrew it two days later because the result was already published. Secondary sources also mention an independent find by “Konz”, which we have not verified.
Why it matters
It is a clean, checkable improvement to a well-known geometry record. Two separate human+model pairs reached it within a few months, which suggests these gaps are now within easy reach of frontier models.
Sources
5 sources from 4 sites. Numbers match the chips in the text.
5 sources: 3 primary, 2 reactions
Primary
- GitHub: maaxgrin/borsuk-63-counterexample (paper PDF + verifier)github.com, code
- Tao et al. optimization constants: constant 28a (Borsuk)teorth.github.io, docs
- arXiv 2608.12561: An AI Generated Counterexample to Borsuk Problem in Dimension 63 (withdrawn)arxiv.org, paper
Reactions
- Wikipedia: Borsuk’s conjectureen.wikipedia.org, discussion
- Wikipedia: List of mathematical discoveries by artificial intelligenceen.wikipedia.org, discussion
Changes
- Related: added Borsuk’s conjecture fails in dimension 9 (OpenAI claim, Lean-checked) (OpenAI’s claimed compact, infinite counterexample in dimension 9; for finite sets 63 remains the smallest known dimension)
- Verification made precise; added Ji’s withdrawal comment, which names a second earlier posting
- Filed. The tip had mixed up the model and date: the primary result is GPT-5.5 Pro (May 2026), and the August arXiv paper using GPT-5.6 Sol is a withdrawn independent rediscovery.