P62 · Extremal configurations · Formed here · Applied frontier

A sampling design uniform in every pair of columns

x1 × x2
x1 × x3
x1 × x4WORST
x2 × x3
x2 × x4
x3 × x4
VERIFIED CONSTRUCTIONworst: columns 1 and 4 · L2-star discrepancy 0.025935937157
d = 4, n = 16Current record · open

Submit an n-row, d-column sampling table. Pick any two columns and plot each row's two entries as a point in the unit square. The site checks all C(d,2) such scatter plots; the least uniform one determines the final score. Make that worst score as small as possible.

Formal definition

  • ContainerAn n-row, d-column sampling table, equivalently n points in [0,1]ᵈ
  • SubmissionExactly n rows and d columns; every entry lies in the closed interval [0,1], and identical rows are allowed
  • Projection discrepancyPᵣ,ₛ is the two-dimensional point set obtained by keeping only columns r and s. The indicator 𝟙 is 1 when a point lies in the origin-anchored rectangle [0,u] × [0,v], and 0 otherwiseD2∗(Pr,s)2=∫01∫01(1n∑i=1n𝟙[xir≤u,xis≤v]−uv)2dudv
  • ScoreCompute the L2-star discrepancy of all C(d,2) column pairs; the largest one is the submission's scorescore(P)=max1≤r<s≤dD2∗(Pr,s)
  • ObjectiveMake this worst-pair score as small as possible. The verifier computes the squared discrepancy exactly and displays it rounded up at the twelfth decimalminP∈([0,1]d)nscore(P)

Getting a feel for it

Think of it as an experiment plan

Think of each row as one simulation or rendering run, and each column as a parameter such as light angle, material roughness, or time. If the points in two columns cluster along a diagonal, you cannot separate their individual and joint effects.

Every plot shares the same table

Moving a coordinate to improve the column 1–2 scatter plot simultaneously alters the plots for columns 1–3 and 2–4. Because all C(d,2) scatter plots read from the same table, a single matrix of numbers has to keep every pair of columns uniform at once.

Where the frontier is

Low-dimensional projection uniformity is a central topic in experimental design, but for fixed (n, d) there is no published table of optimal configurations for this worst-pair continuous L2-star objective. Every sub-problem is open.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each parameter n is an independently scored sub-problem. Select any card to inspect the current record construction or submit a stronger solution.

Discussion (0) ↓
Instanced = 4, n = 16
CURRENT RECORD0.025935937157
Hard
x1 × x2
x1 × x3
x1 × x4WORST
x2 × x3
x2 × x4
x3 × x4
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 4, n = 24
CURRENT RECORD0.017943197477
Hard
x1 × x2
x1 × x3
x1 × x4WORST
x2 × x3
x2 × x4
x3 × x4
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 4, n = 32
CURRENT RECORD0.013890754713
Hard
x1 × x2
x1 × x3
x1 × x4WORST
x2 × x3
x2 × x4
x3 × x4
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 6, n = 16
CURRENT RECORD0.027928492346
Hard
x1 × x2
x1 × x3
x1 × x4
x1 × x5
x1 × x6
x2 × x3
x2 × x4
x2 × x5WORST
x2 × x6
x3 × x4
x3 × x5
x3 × x6
x4 × x5
x4 × x6
x5 × x6
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 6, n = 24
CURRENT RECORD0.019512950797
Hard
x1 × x2
x1 × x3
x1 × x4
x1 × x5
x1 × x6
x2 × x3
x2 × x4
x2 × x5
x2 × x6
x3 × x4
x3 × x5
x3 × x6
x4 × x5
x4 × x6WORST
x5 × x6
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 6, n = 32
CURRENT RECORD0.015173875807
Hard
x1 × x2
x1 × x3
x1 × x4
x1 × x5
x1 × x6
x2 × x3
x2 × x4
x2 × x5
x2 × x6
x3 × x4
x3 × x5WORST
x3 × x6
x4 × x5
x4 × x6
x5 × x6
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 8, n = 16
CURRENT RECORD0.029755001064
Hard
x1 × x2
x1 × x3
x1 × x4
x1 × x5
x1 × x6
x1 × x7
x1 × x8
x2 × x3
x2 × x4
x2 × x5
x2 × x6
x2 × x7
x2 × x8
x3 × x4
x3 × x5
x3 × x6
x3 × x7
x3 × x8
x4 × x5
x4 × x6
x4 × x7
x4 × x8
x5 × x6
x5 × x7WORST
x5 × x8
x6 × x7
x6 × x8
x7 × x8
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 8, n = 24
CURRENT RECORD0.020993502457
Hard
x1 × x2
x1 × x3
x1 × x4
x1 × x5
x1 × x6
x1 × x7
x1 × x8
x2 × x3
x2 × x4
x2 × x5
x2 × x6
x2 × x7
x2 × x8
x3 × x4
x3 × x5
x3 × x6
x3 × x7WORST
x3 × x8
x4 × x5
x4 × x6
x4 × x7
x4 × x8
x5 × x6
x5 × x7
x5 × x8
x6 × x7
x6 × x8
x7 × x8
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Instanced = 8, n = 32
CURRENT RECORD0.016433902477
Hard
x1 × x2
x1 × x3
x1 × x4
x1 × x5
x1 × x6
x1 × x7
x1 × x8
x2 × x3
x2 × x4
x2 × x5
x2 × x6
x2 × x7
x2 × x8
x3 × x4
x3 × x5
x3 × x6
x3 × x7
x3 × x8
x4 × x5
x4 × x6
x4 × x7
x4 × x8
x5 × x6
x5 × x7
x5 × x8
x6 × x7
x6 × x8
x7 × x8WORST
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra

Data and citation

All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.

GET https://minmaxarena.com/data/worst-projection.json

Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.

GET https://minmaxarena.com/data/editions/2026-10/worst-projection.json
BibTeX (click to copy)
@misc{minmaxarena-worst-projection-2026-10,
  title  = {{A sampling design uniform in every pair of columns} (P62)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/worst-projection.json},
  license = {CC BY 4.0}
}
DISCUSSION

Discussion

Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.

No threads yet. Start the first discussion.