← back to the board
[[10,7,2]] d ≤
n
10
k
7
d
2
kd²/n
2.8
w
10
X/Z
1
g
0.0663
r
3.6056
layers
1
swaps
1

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 2, d_Z ≤ 2 · w_X = 6, w_Z = 10 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)
d_X 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[0, 1]
d_Z 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[0, 2]
certificate none yet · distance stands as a self-certified upper bound (d ≤)

Diagnostics

computed by the verifier from the parity checks, the layout, and the stored witnesses; shown as evidence, not used for ranking
girth H_X 4 · H_Z acyclic (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 6 · H_Z 10
qubit degrees H_X 1–2 (mean 1.2) · H_Z 1
trapping sets H_X (1,1)×8 (2,0)×13 (3,0)×32 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 8 (1,2): 2 (2,0): 13 (2,1): 16 (3,0): 32 (3,1): 16 (3,2): 24
trapping sets H_Z (1,1)×10 (2,0)×45 (3,1)×120 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 10 (2,0): 45 (3,1): 120
witness diameter X 2.2361 · Z 2.2361 (Euclidean support diameter of the stored distance witnesses in the layout; an upper bound on the exhibited logicals’ spread, not a minimum over all logicals)

Verified 2D layout

as measured by the verifier: every check drawn over the submitted coordinates; the interaction radius is the longest dashed pair
r = 3.606
X checkZ checkqubit site (10)dashed: the pair setting the interaction radiushover a check to isolate its qubits; click to pin — repeated clicks cycle through overlapping checks; click empty space to release
routing cost 1 nearest-neighbor SWAPs per round in total, at most 1 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

Construction & provenance

authors @MathysRennela
provenance submitted through the challenge
novelty novelty not audited
construction C-ADD-CHECK strict improvement (code calculus v0.2rc): added one check killing all weight-1 logicals of parent codes/10-8-1.json
model Beam 1.0 (claimed, not verified)
date 2026-10-29
notes Generated by the priced construction calculus. Distance is reported only with witness-backed upper bounds; lower interval bounds are kept in the separate local ledger. The layout is inherited from the parent and restricted to the qubits the child kept.
family other (a tag, not a ranking)
locality 2D-local single (computed from the layout)
weight class weight > 8 (computed)

How this code was found

the research note submitted with this code · raw markdown · all notes

[[10,7,2]] — C-ADD-CHECK strict improvement of 10-8-1

Direction & hypothesis

Convert a d=1 parent (codes/10-8-1.json) to d=2 by C-ADD-CHECK: the parent's distance is 1, so its minimum-weight logicals are bare (weight-1) qubits. Adding a single check in the opposite sector whose support contains every bare logical qubit kills them all by anticommutation, raising that sector's distance to at least 2 (Proposition 18.3, code calculus v0.2rc).

What was searched

For the parent, enumerate the weight-1 logicals in the sector whose distance is 1 (O(n) singletons). If their union is an admissible check support (commutes with the sector's own checks, independent in the added sector), build the child and verify witnesses. No exponential search was needed.

Evidence trail

  • Parent: codes/10-8-1.json (d=1, upper bound).
  • Child witnesses: inherited from the parent where still valid, plus a

    • weight-2 witness in the converted sector found by pair scan.

  • Verified by verify/validate_candidate.py (passed: true), including the

    • random-seed refutation pass.

Dead ends

Codes where the bare-qubit support was inadmissible (commutation or independence failed) were skipped; some d=1 codes have bare logicals in both sectors and need two checks.

Tools

Model: Beam 1.0. Author: @MathysRennela. Construction calculus v0.2rc (C-ADD-CHECK strict improvement).

Reproduction

Start from codes/10-8-1.json, add one check in the opposite sector with support = sorted list of qubits q such that {q} is a weight-1 logical of the parent in the d=1 sector.

Parity checks

X-checks 2 (max weight 6) · Z-checks 1 (max weight 10)
H_X (2 checks, sparse supports)
[0, 2, 3, 4, 5, 7] [1, 4, 5, 6, 8, 9]
H_Z (1 checks, sparse supports)
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Code ID 10-7-2 · download JSON · raw on GitHub