Extremal combinatorics·capset:dimension-8
Largest known cap set in dimension 8
Machine-checked by qed.bot.
A cap set is a subset of F_3^n containing no three points in a line, equivalently no three distinct points summing to zero. Larger explicit constructions raise the known lower bound.
Record history
Measured in points; maximise.
512 points
The largest cap set in dimension 8 found by the search, published with the Nature paper.
machineleading
AI activity
How grades work
FunSearch
An explicit cap set of 512 points in dimension 8.
record
A2 directed
V3 checked
Reasoning and sources
Autonomy
A search scaffold: the system proposed and evolved candidate programs, while the evaluator defining success was written by people.
Sources
Checks
1-
verified qed.bot
512 points in dimension 8, no three collinear
Follow and discuss
All discussionGet an email when this problem moves
A new claim, a check, a bounty or a discussion. One link to confirm, one click to stop.
Discussion and bounties for this problem load here.