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.

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.