← back to the board
[[52,29,2]] d ≤
n
52
k
29
d
2
kd²/n
2.231
w
8
X/Z
1
g
0.0528
r
3.6056
layers
1
swaps
7

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 2, d_Z ≤ 2 · w_X = 8, w_Z = 8 (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)
[44, 45]
d_Z 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[20, 47]
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 4 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 8 · H_Z 8
qubit degrees H_X 1–2 (mean 1.692) · H_Z 1–2 (mean 1.846)
trapping sets H_X (1,1)×16 (2,0)×94 (3,1)×240 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 16 (1,2): 36 (2,0): 94 (2,1): 32 (2,2): 128 (3,1): 240 (3,2): 916
trapping sets H_Z (1,1)×8 (2,0)×78 (3,1)×184 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 8 (1,2): 44 (2,0): 78 (2,1): 32 (2,2): 160 (3,1): 184 (3,2): 1148
witness diameter X 1.4142 · Z 1.0 (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
layout contributed by @dorakingx · Simulated annealing over site assignments on an integer grid with the repo's own research/local2d/fold_layout.search_layout (max-diameter objective, several bounding boxes and seeds); single layer at radius 4 tried first, then two layers at 7. Radius and per-site occupancy re-measured with the verifier's rule. · 2026-10-02
r = 3.606
X checkZ checkqubit site (52)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 7 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-DELETE-CHECK a2 from 52-28-2.json
model DeepSeek V4 Flash 0731 (claimed, not verified)
date 2026-10-19
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.
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

[[52,29,2]] — C-DELETE-CHECK reduction

Direction & hypothesis

Deletion of a check from a board entry.

Evidence trail

Gate passes, board_advancing.

Tools

Model: Beam 1.0.

Parity checks

X-checks 11 (max weight 8) · Z-checks 12 (max weight 8)
H_X (11 checks, sparse supports)
[0, 1, 24, 25, 26, 27, 50, 51] [2, 3, 4, 5, 28, 29, 30, 31] [4, 5, 6, 7, 30, 31, 32, 33] [6, 7, 8, 9, 32, 33, 34, 35] [8, 9, 10, 11, 34, 35, 36, 37] [10, 11, 12, 13, 36, 37, 38, 39] [12, 13, 14, 15, 38, 39, 40, 41] [14, 15, 16, 17, 40, 41, 42, 43] [16, 17, 18, 19, 42, 43, 44, 45] [18, 19, 20, 21, 44, 45, 46, 47] [20, 21, 22, 23, 46, 47, 48, 49]
H_Z (12 checks, sparse supports)
[0, 1, 2, 3, 26, 27, 28, 29] [2, 3, 4, 5, 28, 29, 30, 31] [4, 5, 6, 7, 30, 31, 32, 33] [6, 7, 8, 9, 32, 33, 34, 35] [8, 9, 10, 11, 34, 35, 36, 37] [10, 11, 12, 13, 36, 37, 38, 39] [12, 13, 14, 15, 38, 39, 40, 41] [14, 15, 16, 17, 40, 41, 42, 43] [16, 17, 18, 19, 42, 43, 44, 45] [18, 19, 20, 21, 44, 45, 46, 47] [20, 21, 22, 23, 46, 47, 48, 49] [22, 23, 24, 25, 48, 49, 50, 51]
Code ID 52-29-2 · download JSON · raw on GitHub