← back to the board
[[34,9,2]] d ≤
n
34
k
9
d
2
kd²/n
1.05882
w
4
X/Z
3

Share this result

Distance

X/Z asymmetry 3 · d_X ≤ 2, d_Z ≤ 6 · w_X = 4, w_Z = 4 (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 found by @mathysrennela · gf2_fast · found at 2×105 trials · 2026-11-13
witness operator (support, 2 qubits)
[6, 12]
d_Z 6 · witness weight 6 (claimed upper_bound)
witness operator (support, 6 qubits)
[0, 6, 13, 19, 26, 33]
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 12 · H_Z 8 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 4 · H_Z 4
qubit degrees H_X 1–2 (mean 1.412) · H_Z 1–2 (mean 1.529)
trapping sets H_X (1,1)×20 (2,0)×8 (3,0)×34 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 20 (1,2): 14 (2,0): 8 (2,1): 44 (2,2): 20 (3,0): 34 (3,1): 64 (3,2): 44 (3,3): 28 (3,4): 4
trapping sets H_Z (1,1)×16 (2,0)×6 (3,0)×18 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 16 (1,2): 18 (2,0): 6 (2,1): 36 (2,2): 36 (3,0): 18 (3,1): 72 (3,2): 84 (3,3): 24 (3,4): 16

Construction & provenance

provenance submitted through the challenge
novelty known parameter set; see provenance notes
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.
family other (a tag, not a ranking)
locality unrestricted (computed from the layout)
weight class weight ≤ 4 (computed)

How this code was found

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

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