Covering designs
C(66,12,2) ≤ 38
The smallest known (66,12,2) covering design uses 38 blocks, one fewer than the 39 known before. Quantavane published it on 22 October 2026. The Schönheim bound shows that at least 33 blocks are needed, so C(66,12,2) lies between 33 and 38.
Franco Atzeni reached the same size independently and uploaded it to coveringrepository.com first, on 24 October 2026, so the table lists that upload.
The record
| Ours | 38 blocks |
|---|---|
| Previous best | 39 blocks |
| Previous source | the La Jolla Covering Repository's final data (Daniel M. Gordon, CC BY 4.0), from a general construction |
| Published | 22 October 2026 |
| Status | Franco Atzeni reached the same size independently and uploaded it to coveringrepository.com first, on 24 October 2026, so the table lists that upload. |
| Check | Checked exhaustively by three independent programs; verify.py in the public repository checks it again with plain Python. |
Every pair of the 66 points lies in at least one of the 38 blocks of 12 points.
How it was found and checked
Found by a compiled local search that alternates simulated annealing with breakout weighting. Checked exhaustively by three independent programs; verify.py in the public repository checks it again with plain Python.
git clone https://github.com/arhancanli/quantavane-covering-records
cd quantavane-covering-records
python3 verify.pyTake v points and blocks of k points each. A (v,k,t) covering design is a set of blocks such that every group of t points sits inside at least one block. C(v,k,t) is the fewest blocks that can do it. For most sizes no one knows the exact answer, so public tables keep the best covering anyone has found. Beating an entry means building a valid covering with fewer blocks.
Questions
What is C(66,12,2)?
The fewest blocks of 12 points, drawn from 66 points, such that every pair of points lies in some block.
Is 38 the smallest possible?
Not known. The Schönheim bound gives at least 33; 38 is the smallest covering found so far.
What was the best known before?
39 blocks: the La Jolla Covering Repository's final data (Daniel M. Gordon, CC BY 4.0), from a general construction.