← back to the board
[[34,8,5]] d ≤
n
34
k
8
d
5
kd²/n
5.88235
w
8
X/Z
1.2

Share this result

Distance

X/Z asymmetry 1.2 · d_X ≤ 5, d_Z ≤ 6 · 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 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)
[10, 11, 19, 26, 27]
d_Z 6 · witness weight 6 (claimed upper_bound)
witness operator (support, 6 qubits)
[4, 12, 20, 25, 29, 30]
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 7–8 (mean 7.692) · H_Z 7–8 (mean 7.769)
qubit degrees H_X 1–5 (mean 2.941) · H_Z 1–5 (mean 2.971)
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): 9 (1,5): 2 (2,1): 10 (2,2): 23 (2,3): 49 (2,4): 78 (2,5): 88 (2,6): 36 (2,7): 11 (3,1): 28 (3,2): 99 (3,3): 302 (3,4): 582 (3,5): 799 (3,6): 630 (3,7): 398 (3,8): 159 (3,9): 47 (3,10): 11 (3,11): 2
trapping sets H_Z (1,1)×1 (2,1)×10 (3,1)×29 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 1 (1,2): 12 (1,3): 11 (1,4): 7 (1,5): 3 (2,1): 10 (2,2): 24 (2,3): 53 (2,4): 71 (2,5): 97 (2,6): 33 (2,7): 10 (2,8): 2 (3,1): 29 (3,2): 102 (3,3): 307 (3,4): 578 (3,5): 821 (3,6): 656 (3,7): 404 (3,8): 169 (3,9): 46 (3,10): 14 (3,11): 4

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.
family other (a tag, not a ranking)
locality unrestricted (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

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