← back to the board
[[33,8,2]] d ≤
n
33
k
8
d
2
kd²/n
0.969697
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)
[5, 11]
d_Z 6 · witness weight 6 (claimed upper_bound)
witness operator (support, 6 qubits)
[0, 5, 12, 18, 25, 32]
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 8 · H_Z 8 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 4 · H_Z 3–4 (mean 3.923)
qubit degrees H_X 1–2 (mean 1.455) · H_Z 1–2 (mean 1.545)
trapping sets H_X (1,1)×18 (2,0)×9 (3,0)×19 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 18 (1,2): 15 (2,0): 9 (2,1): 36 (2,2): 27 (3,0): 19 (3,1): 71 (3,2): 61 (3,3): 21 (3,4): 11
trapping sets H_Z (1,1)×15 (2,0)×5 (3,0)×16 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 15 (1,2): 18 (2,0): 5 (2,1): 34 (2,2): 36 (3,0): 16 (3,1): 68 (3,2): 82 (3,3): 23 (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

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