← back to the board
[[32,22,2]] d ≤
n
32
k
22
d
2
kd²/n
2.75
w
8
X/Z
1

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 2, d_Z ≤ 2 · 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 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[15, 31]
d_Z 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[15, 31]
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 8
qubit degrees H_X 1–2 (mean 1.25) · H_Z 1–2 (mean 1.25)
trapping sets H_X (1,1)×24 (2,0)×64 (3,0)×128 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 24 (1,2): 8 (2,0): 64 (2,1): 64 (3,0): 128 (3,1): 168 (3,2): 104
trapping sets H_Z (1,1)×24 (2,0)×64 (3,0)×128 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 24 (1,2): 8 (2,0): 64 (2,1): 64 (3,0): 128 (3,1): 168 (3,2): 104

Construction & provenance

authors @mathysrennela
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-12
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

[[32,22,2]] — code-calculus v0.2rc greedy gated

Direction & hypothesis

Frontier gaps in the CSS track via greedy multi-step composition of C-DELETE-CHECK, E-PEEL, and E-PUNCTURE (code-calculus v0.2rc).

What was searched

CSS parents from codes/ with n <= 10, up to 3 greedy steps, budget 16 RIS trials per candidate, sector swap enabled, domination pruning. See the greedy gated campaign (code-calculus v0.2rc).

Evidence trail

Witness-backed upper bound validated by verify/validate_candidate.py (passed: true). Model: Beam 1.0.

Dead ends

Sector-swap-only, strict C-ADD-CHECK addition, and E-GLUE produced no board-advancing codes in this campaign.

Tools

code-calculus-dev (latest), research/kit coordination.

Reproduction

Run the greedy gated campaign (code-calculus v0.2rc) at n<=10, 3 steps, budget 16.

Parity checks

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