← back to the board
[[23,2,5]] d ≤
n
23
k
2
d
5
kd²/n
2.17391
w
6
X/Z
1.2
g
0.0217
r
3.1623
layers
2
swaps
27

Share this result

Distance

X/Z asymmetry 1.2 · d_X ≤ 6, d_Z ≤ 5 · w_X = 6, w_Z = 6 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)
d_X 6 · witness weight 6 (claimed upper_bound)
witness operator (support, 6 qubits)
[0, 10, 12, 15, 17, 22]
d_Z 5 · witness weight 5 (claimed upper_bound)
witness found by @mathysrennela · gf2_fast · found at 2×104 trials · 2026-11-14
witness operator (support, 5 qubits)
[1, 12, 13, 16, 18]
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 6 · H_Z 5–6 (mean 5.727)
qubit degrees H_X 1–4 (mean 2.609) · H_Z 1–4 (mean 2.739)
trapping sets H_X (1,1)×2 (2,1)×6 (3,1)×26 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 2 (1,2): 10 (1,3): 6 (1,4): 5 (2,1): 6 (2,2): 22 (2,3): 38 (2,4): 41 (2,5): 16 (2,6): 6 (3,1): 26 (3,2): 83 (3,3): 185 (3,4): 237 (3,5): 180 (3,6): 109 (3,7): 35 (3,8): 5
trapping sets H_Z (1,1)×2 (2,1)×3 (3,1)×13 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 2 (1,2): 10 (1,3): 3 (1,4): 8 (2,1): 3 (2,2): 19 (2,3): 25 (2,4): 52 (2,5): 13 (2,6): 15 (3,1): 13 (3,2): 69 (3,3): 125 (3,4): 238 (3,5): 162 (3,6): 171 (3,7): 44 (3,8): 22
witness diameter X 3.6056 · Z 2.8284 (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.162
X checkZ checkqubit site (12)2 qubits stacked (2 layers)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 27 nearest-neighbor SWAPs per round in total, at most 4 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

Construction & provenance

provenance submitted through the challenge
novelty novelty not audited
construction code-calculus v0.2rc greedy gated
model Beam 1.0 (claimed, not verified)
date 2026-11-14
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 bilayer (computed from the layout)
weight class weight ≤ 6 (computed)

How this code was found

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

[[23,2,5]] code-calculus v0.2rc greedy gated

Code-calculus v0.2rc greedy gated campaign (cc-distance-raise). Witness-backed upper bound on distance.

Parity checks

X-checks 10 (max weight 6) · Z-checks 11 (max weight 6)
H_X (10 checks, sparse supports)
[0, 9, 11, 12, 17, 18] [1, 7, 11, 12, 19, 20] [1, 3, 11, 14, 16, 21] [4, 10, 13, 15, 16, 22] [0, 5, 12, 14, 16, 22] [4, 6, 13, 17, 18, 19] [5, 7, 13, 14, 18, 20] [2, 8, 15, 17, 19, 20] [3, 9, 15, 16, 18, 20] [8, 10, 11, 17, 21, 22]
H_Z (11 checks, sparse supports)
[0, 1, 3, 10, 11, 16] [0, 1, 5, 12, 14] [2, 4, 6, 7, 13, 19] [2, 3, 5, 7, 14, 20] [2, 4, 8, 9, 15, 17] [3, 4, 5, 9, 16, 18] [0, 6, 8, 10, 17, 22] [0, 6, 7, 9, 12, 18] [1, 6, 8, 19, 21] [1, 7, 8, 9, 11, 20] [2, 3, 10, 15, 21]
Code ID 23-2-5 · download JSON · raw on GitHub