Borsuk Conjecture lowest-ever counterexample (N=63)
Priority: the result was first obtained by Max Grinsztajn with GPT-5.5 Pro assistance, published 26 May 2026 and recorded as the current best bound on Tao's optimization-problems ledger. The same construction was found again independently in August 2026 by Nicholas Konz working with Claude, with a different derivation and a fuller AI disclosure; the two efforts were evidently unaware of each other, and the submitter of this entry surfaced the earlier work themselves after publication. Dimension 63 is the current record; whether Borsuk's conjecture fails for any dimension in 4..62 remains open.
Exact FrontierDelta
Scope and record
Occurred: May 26, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: site-confirmed. Publication: preprint. AI contribution: ai-assisted. Editorial metadata: CC BY 4.0; linked content retains its own rights.
Canonical aliases: Borsuk Conjecture lowest-ever counterexample (N=63) · Borsuk Counterexample N=63
Confidence: Not scored
Registry verification: site confirmed · preprint · partial
Attribution
VibeMathed
registry · event recorded by
Max Grinsztajn
human · human collaborator
GPT-5.5 Pro
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Max Grinsztajn
This event attributed to GPT-5.5 Pro
Priority: the result was first obtained by Max Grinsztajn with GPT-5.5 Pro assistance, published 26 May 2026 and recorded as the current best bound on Tao's optimization-problems ledger. The same construction was found again independently in August 2026 by Nicholas Konz working with Claude, with a different derivation and a fuller AI disclosure; the two efforts were evidently unaware of each other, and the submitter of this entry surfaced the earlier work themselves after publication. Dimension 63 is the current record; whether Borsuk's conjecture fails for any dimension in 4..62 remains open. parent of this event
Borsuk Conjecture lowest-ever counterexample (N=63) evidence for this event
Wikipedia: Borsuk's conjecture evidence for this event
VibeMathed record: Borsuk Conjecture lowest-ever counterexample (N=63) evidence for this event
Independent rediscovery by Konz + Claude, August 2026: write-up, coordinates and verifier evidence for this event
Tao's optimization-problems ledger, constant 28a - credits the 63 bound to Grinsztajn evidence for this event
Borsuk Conjecture lowest-ever counterexample (N=63) parent of this event
Act on this frontier