← back to the board
[[9,6,1]] d ≤
Distance
X/Z asymmetry 1 · d_X ≤ 1, d_Z ≤ 1 · w_X = 5, w_Z = 5 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)
d_X 1 · witness weight 1 (claimed upper_bound)
witness operator (support, 1 qubits)
[6]
d_Z 1 · witness weight 1 (claimed upper_bound)
witness operator (support, 1 qubits)
[0]
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 acyclic · H_Z acyclic (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 5 · H_Z 3–5 (mean 4.0)
qubit degrees H_X 0–1 (mean 0.556) · H_Z 0–1 (mean 0.889)
trapping sets H_X (1,0)×4 (2,0)×10 (3,1)×10 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,0): 4
(1,1): 5
(2,0): 10
(3,1): 10
trapping sets H_Z (1,0)×1 (2,0)×13 (3,1)×11 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,0): 1
(1,1): 8
(2,0): 13
(3,1): 11
Construction & provenance
provenance submitted through the challenge
novelty novelty not audited
construction code-calculus 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.
family other (a tag, not a ranking)
locality unrestricted (computed from the layout)
weight class weight ≤ 6 (computed)
How this code was found
no research note was staged with this submission — notes are requested for new submissions (
notes/README.md)
Parity checks
X-checks 1 (max weight 5) · Z-checks 2 (max weight 5)
H_X (1 checks, sparse supports)
[2, 3, 4, 6, 7]
H_Z (2 checks, sparse supports)
[0, 1, 3, 4, 5]
[2, 7, 8]