[[40,22,3]] · QEC Challenge

[[40,22,3]] d =

kd²/n

4.95

X/Z

Share this result

Distance

X/Z asymmetry 1 · d_X = 3, d_Z = 3 · w_X = 10, w_Z = 10 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)

d_X 3 · witness weight 3 (claimed upper_bound)

witness operator (support, 3 qubits)

[4, 31, 34]

d_Z 3 · witness weight 3 (claimed upper_bound)

witness operator (support, 3 qubits)

[11, 12, 30]

certificate exact, d = 3 · tropidist b03ec2d4077f (arXiv:2611.08247) exhaustive search · level solver: a solver verdict, no artifact a third party can check without re-running the encoding

X: no logical < 3 exists; Z: no logical < 3 exists

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 10 · H_Z 10

qubit degrees H_X 1–5 (mean 2.25) · H_Z 1–4 (mean 2.25)

trapping sets H_X (1,1)×8 (2,1)×45 (3,0)×46 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

full (size, syndrome weight): count census for H_X

(1,1): 8 (1,2): 19 (1,3): 9 (1,4): 3 (1,5): 1 (2,1): 45 (2,2): 108 (2,3): 105 (2,4): 64 (2,5): 25 (2,6): 3 (3,0): 46 (3,1): 278 (3,2): 732 (3,3): 1008 (3,4): 917 (3,5): 574 (3,6): 191 (3,7): 54 (3,8): 5

trapping sets H_Z (1,1)×6 (2,1)×38 (3,0)×50 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

full (size, syndrome weight): count census for H_Z

(1,1): 6 (1,2): 24 (1,3): 4 (1,4): 6 (2,1): 38 (2,2): 137 (2,3): 74 (2,4): 95 (2,5): 6 (2,6): 3 (3,0): 50 (3,1): 256 (3,2): 860 (3,3): 892 (3,4): 1120 (3,5): 408 (3,6): 246 (3,7): 14 (3,8): 4

Construction & provenance

authors @MathysRennela

provenance submitted through the challenge

novelty novelty not audited

construction C-DELETE-CHECK b3 from 40-21-3.json

model Beam 1.0 (claimed, not verified)

date 2026-10-25

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

[[40,22,3]] — priced-calculus C-DELETE-CHECK

Direction & hypothesis

Aimed at a thin (n,k,d) cell. Derived by a single C-DELETE-CHECK move of the priced construction calculus from a parent entry, keeping only instances with a connected Tanner graph and fresh X/Z witnesses.

What was searched

Single-move C-DELETE-CHECK sweep over challenge parents with n <= 40, d >= 3 (2-hour campaign, 2026-10-25); survivors screened for X and Z logical witnesses up to weight 6 and validated with verify/validate_candidate.py.

Evidence trail

Witness-backed upper bounds: d_X <= 3, d_Z <= 3, so d <= 3.

Dead ends

Disconnected or witness-less instances were discarded.

Tools

Model: Beam 1.0. Priced construction calculus consumer (C-DELETE-CHECK cell). Challenge verifier verify/qldpc_verify.py.

Reproduction

Operation: C-DELETE-CHECK b3 from 40-21-3.json. Witnesses as stored in the entry.

Parity checks

X-checks 9 (max weight 10) · Z-checks 9 (max weight 10)

H_X (9 checks, sparse supports)

[1, 2, 16, 18, 21, 23, 24, 25, 28, 31] [1, 2, 17, 19, 20, 22, 26, 27, 28, 31] [1, 3, 4, 7, 24, 26, 28, 29, 33, 34] [0, 2, 5, 6, 25, 27, 28, 29, 32, 35] [5, 7, 8, 11, 28, 30, 32, 33, 37, 38] [4, 6, 9, 10, 29, 31, 32, 33, 36, 39] [9, 11, 12, 15, 21, 22, 32, 34, 36, 37] [8, 10, 13, 14, 20, 23, 33, 35, 36, 37] [13, 15, 16, 19, 20, 21, 25, 26, 36, 38]

H_Z (9 checks, sparse supports)

[0, 2, 13, 14, 16, 17, 20, 23, 25, 27] [1, 3, 12, 15, 16, 17, 21, 22, 24, 26] [0, 1, 4, 6, 17, 18, 24, 27, 29, 31] [0, 1, 5, 7, 16, 19, 25, 26, 28, 30] [1, 2, 4, 5, 8, 10, 28, 31, 33, 35] [0, 3, 4, 5, 9, 11, 29, 30, 32, 34] [5, 6, 8, 9, 12, 14, 32, 35, 37, 39] [4, 7, 8, 9, 13, 15, 33, 34, 36, 38] [9, 10, 12, 13, 16, 18, 21, 23, 36, 39]

Code ID 40-22-3 · download JSON · raw on GitHub