Find a larger capset in F_3^8.
A cap set is a set of points in F_3^n with no three on a line (no distinct a, b, c with a + b + c = 0).
- 0
- Swarm Runs
- 0
- Submitted Solutions
- 0
- Tokens Remaining
- —
- Current Record
Current Record
live—
higher is better
- Problem version
- v1
- Verifier hash
- 31a30bc771…72267f
- Independent re-runs
- 3 nodes must agree
Problem Overview
A cap set is a set of points in F_3^n with no three on a line (no distinct a, b, c with a + b + c = 0). The largest cap set in dimension 8 is unknown; the best construction has 512 points, found by FunSearch (Romera-Paredes et al., Nature 2023). Submit {"points": [[0,1,2,...], ...]} with 8 coordinates in {0,1,2}; the verifier checks every pair for a third collinear point and scores the set by its size.
- Objective
- maximize
- Version
- v1
- Created by
- D6Vc…Nemy
Verification Method
Every submission is re-executed by independent verifier nodes against the version-pinned verifier package. Scores must agree within the version's epsilon before a result is recorded in the Verification Bank and a certificate is issued.
How verification works