← back to the board
[[35,8,5]] d ≤
n
35
k
8
d
5
kd²/n
5.71429
w
8
X/Z
1.2
g
0.0085
r
5.099
layers
2
swaps
55

Share this result

Distance

X/Z asymmetry 1.2 · d_X ≤ 6, d_Z ≤ 5 · 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 6 · witness weight 6 (claimed upper_bound)
witness operator (support, 6 qubits)
[7, 23, 24, 26, 31, 32]
d_Z 5 · witness weight 5 (claimed upper_bound)
witness found by @mathysrennela · gf2_fast · found at 2×105 trials · 2026-11-13
witness operator (support, 5 qubits)
[17, 19, 25, 28, 34]
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 7–8 (mean 7.786)
qubit degrees H_X 1–5 (mean 2.971) · H_Z 1–5 (mean 3.114)
trapping sets H_X (1,1)×2 (2,1)×10 (3,1)×28 (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): 11 (1,3): 10 (1,4): 10 (1,5): 2 (2,1): 10 (2,2): 24 (2,3): 51 (2,4): 86 (2,5): 93 (2,6): 41 (2,7): 13 (3,1): 28 (3,2): 106 (3,3): 330 (3,4): 645 (3,5): 881 (3,6): 711 (3,7): 459 (3,8): 186 (3,9): 58 (3,10): 14 (3,11): 2
trapping sets H_Z (1,1)×2 (2,1)×7 (3,1)×15 (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): 9 (1,3): 12 (1,4): 7 (1,5): 5 (2,1): 7 (2,2): 21 (2,3): 43 (2,4): 68 (2,5): 98 (2,6): 60 (2,7): 20 (2,8): 5 (3,1): 15 (3,2): 85 (3,3): 240 (3,4): 513 (3,5): 800 (3,6): 813 (3,7): 581 (3,8): 306 (3,9): 103 (3,10): 36 (3,11): 6 (3,12): 2
witness diameter X 4.4721 · Z 4.1231 (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 = 5.099
X checkZ checkqubit site (18)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 55 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-13
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 ≤ 8 (computed)

How this code was found

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

[[35,8,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 13 (max weight 8) · Z-checks 14 (max weight 8)
H_X (13 checks, sparse supports)
[1, 8, 16, 17, 18, 25, 28, 34] [0, 7, 10, 17, 18, 19, 24, 27] [4, 11, 15, 19, 21, 28, 32, 33] [10, 13, 15, 20, 27, 30, 31, 33] [1, 3, 6, 18, 20, 22, 23, 27] [0, 5, 15, 17, 22, 23, 33, 34] [2, 6, 8, 19, 23, 24, 25, 33] [5, 7, 11, 20, 22, 24, 25, 28] [4, 7, 13, 21, 23, 24, 26, 30] [2, 14, 16, 19, 21, 27, 31, 34] [2, 3, 9, 19, 20, 26, 28, 30] [1, 9, 14, 18, 24, 26, 29, 31] [0, 4, 12, 17, 21, 25, 29, 31]
H_Z (14 checks, sparse supports)
[0, 1, 6, 13, 14, 18, 23, 31] [0, 1, 5, 12, 17, 22, 29] [1, 2, 7, 10, 11, 24, 27, 28] [3, 5, 8, 11, 15, 22, 28, 33] [2, 4, 9, 10, 14, 19, 26, 31] [4, 5, 6, 8, 23, 25, 32] [5, 6, 7, 9, 13, 22, 24, 30] [1, 7, 8, 9, 12, 18, 25, 26] [0, 4, 7, 8, 14, 17, 21, 24] [4, 9, 11, 12, 16, 21, 28, 29] [1, 3, 5, 10, 16, 18, 20, 34] [0, 2, 8, 11, 16, 19, 25, 34] [12, 14, 15, 16, 31, 32, 34] [3, 10, 12, 13, 14, 27, 29, 30]
Code ID 35-8-5-b · download JSON · raw on GitHub