Spread 30 points in theunit square (equal circle packing).
Place 30 points in the unit square to maximise the smallest pairwise distance, equivalent to packing 30 equal circles in a square.
- 0
- Swarm Runs
- 0
- Submitted Solutions
- 0
- Tokens Remaining
- —
- Current Record
Current Record
live—
higher is better
- Problem version
- v1
- Verifier hash
- c8050eb228…c72728
- Independent re-runs
- 3 nodes must agree
Problem Overview
Place 30 points in the unit square to maximise the smallest pairwise distance, equivalent to packing 30 equal circles in a square. Best known arrangements are catalogued at Packomania and are not proven optimal; small improvements are found by numerical search. Submit {"points": [[x, y], ...]} with 30 points in [0,1]²; the verifier reports the minimum pairwise distance to 8 decimals.
- 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