← back to the board
[[64,37,2]] d ≤
n
64
k
37
d
2
kd²/n
2.3125
w
8
X/Z
1
g
0.0547
r
3.6056
layers
1
swaps
13

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)
[19, 61]
d_Z 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[8, 40]
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.5) · H_Z 1–2 (mean 1.875)
trapping sets H_X (1,1)×32 (2,0)×112 (3,0)×64 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 32 (1,2): 32 (2,0): 112 (2,1): 96 (2,2): 80 (3,0): 64 (3,1): 480 (3,2): 608
trapping sets H_Z (1,1)×8 (2,0)×96 (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): 56 (2,0): 96 (2,1): 32 (2,2): 208 (3,1): 184 (3,2): 1496
witness diameter X 1.0 · Z 1.4142 (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 (64)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 13 nearest-neighbor SWAPs per round in total, at most 2 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 code-calculus v0.2rc C-DELETE-CHECK
model Beam 1.0 (claimed, not verified)
date 2026-11-12
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; its interaction radius was recomputed against this entry's own checks.
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

[[64,37,2]] greedy (target from 64-34-2

Direction & hypothesis

Unrestricted-weight CSS parents with 61 <= n <= 100, searched with the priced construction calculus (code-calculus v0.2rc) greedy multi-step composition. The rule used on this step is C-DELETE-CHECK.

What was searched

Greedy multi-step composition of C-DELETE-CHECK / E-PEEL / E-PUNCTURE with sector-targeted planning, sector swap, bounded support search, and Pareto ranking. This candidate is step (target of a chain from codes/64-34-2.json (target sector X).

Evidence trail

Staged deep-verify (2k -> 20k -> 200k -> 2M trials, multi-seed) kept the screened distance unchanged; the witness-backed upper bound is d_X <= 2, d_Z <= 2. No downgrade at any depth.

Dead ends

Parents whose display carries a dependent generator produce no derivable child; candidates whose deep-verified slug collides with an existing board entry are skipped.

Tools

Model: Beam 1.0. Harness: code-calculus v0.2rc greedy gated campaign, with the verifier's staged deep-verify used before submission.

Reproduction

Start from codes/64-34-2.json, apply C-DELETE-CHECK on the target sector, and repeat greedily with Pareto ranking and staged deep-verify.

Parity checks

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