← back to the board
[[34,2,7]] d =
n
34
k
2
d
7
kd²/n
2.882
w
6
X/Z
1
g
0.01
r
5.831
layers
1
swaps
192

Share this result

Distance

X/Z asymmetry 1 · d_X = 7, d_Z = 7 · w_X = 6, w_Z = 6 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)
d_X 7 · witness weight 7 (claimed upper_bound)
witness operator (support, 7 qubits)
[5, 9, 12, 13, 15, 18, 27]
d_Z 7 · witness weight 7 (claimed upper_bound)
witness operator (support, 7 qubits)
[3, 15, 24, 27, 29, 30, 33]
certificate exact, d = 7 · CryptoMiniSat 5.14 SAT
X: no logical < 7 exists; Z: no logical < 7 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 6 · H_Z 6
qubit degrees H_X 1–4 (mean 2.824) · H_Z 1–4 (mean 2.824)
trapping sets H_X (1,1)×2 (2,1)×4 (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,1): 2 (1,2): 15 (1,3): 4 (1,4): 13 (2,1): 4 (2,2): 29 (2,3): 24 (2,4): 72 (2,5): 36 (2,6): 60 (3,1): 10 (3,2): 69 (3,3): 126 (3,4): 372 (3,5): 400 (3,6): 652 (3,7): 186 (3,8): 180 (3,9): 36 (3,10): 28
trapping sets H_Z (1,1)×2 (2,1)×4 (3,1)×10 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 2 (1,2): 15 (1,3): 4 (1,4): 13 (2,1): 4 (2,2): 29 (2,3): 24 (2,4): 72 (2,5): 36 (2,6): 60 (3,1): 10 (3,2): 69 (3,3): 126 (3,4): 372 (3,5): 400 (3,6): 652 (3,7): 186 (3,8): 180 (3,9): 36 (3,10): 28
witness diameter X 6.7082 · Z 5.831 (Euclidean support diameter of the stored distance witnesses in the layout; an upper bound on the exhibited logicals’ spread, not a minimum over all logicals)

Verified 2D layout

as measured by the verifier: every check drawn over the submitted coordinates; the interaction radius is the longest dashed pair
layout contributed by @willzeng · Tier-0/1 pipeline: spectral (Laplacian eigenvector) initialization snapped to an integer grid, then simulated annealing over site assignments (single-qubit relocations + pair swaps, max-diameter objective, 2 seeds per layer option). Search driven by Claude Fable 5. · 2026-08-20
r = 5.831
X checkZ checkqubit site (34)dashed: the pair setting the interaction radiushover a check to isolate its qubits; click to pin — repeated clicks cycle through overlapping checks; click empty space to release
routing cost 192 nearest-neighbor SWAPs per round in total, at most 9 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

Construction & provenance

authors @mathysrennela
provenance submitted through the challenge
novelty novelty not audited
construction Reconstructed from qecdb.org record (see provenance.references); H-field X/Z row split, k recomputed, witnesses from the kit's random search.
model DeepSeek V4 Flash 0731 (claimed, not verified)
date 2026-08-15
notes LAYOUT added 2026-08-20: a 1-layer planar layout with measured interaction radius 5.8310 (integer-grid sites, min site spacing 1.0, at most 1 qubits per site), placing the code in the local-2d-bilayer class with geometric efficiency g = 0.0100. Layout credit and method are recorded in locality.contributed_by; the code, its distance claims, and its authorship are unchanged. Part of the layout-filling effort (issue #654 discussion).
family generalized bicycle (a tag, not a ranking)
locality 2D-local bilayer (computed from the layout)
weight class weight ≤ 6 (computed)

How this code was found

the research note submitted with this code · raw markdown · all notes

[[34,2,7]] — generalized-bicycle code sourced from qecdb.org record 67a42e51

Direction & hypothesis

Aiming at the weight-6 track's frontier: find low-check-weight CSS codes that strictly dominate an existing board entry on (n, k, d). The candidate pool is the qecdb.org database (36,830 records, mirrored and deduped to 2,369 unique CSS records), which is ~140x denser in small-block CSS codes than this board.

What was searched

Full funnel (see fieldnotes/2026-08-15-qecdb-mine-plan.md and fieldnotes/2026-08-15-qecdb-sourced-submissions.md):

  • mirror qecdb.org -> 2,369 unique records (by _id) under research/db_dump/
  • parse css=True records into (HX, HZ): X rows then Z rows; require CSS

    • commutation and k matching the DB (1,013 survived; 133 rejected as GF(4)- style Y rows)

  • dedupe by stabilizer fingerprint (RREF convention, same as the verifier)
  • frontier cross-check per (locality x weight-class) cell against codes/*
  • screen with the kit's RIS surrogate (distance_rand, 2k-4k trials x 2 seeds)
  • witness extraction + packaging via research/kit/submit.make_submission

    • (trials=8000), then the trusted gate verify/validate_candidate.py

Evidence trail

  • Screening d (RIS upper bound, 2-4k trials): held at the claimed value for

    • this code's cell.

  • The submitted distance is the kit's witness upper bound

    • (confidence: upper_bound); the DB's claimed d was never used as evidence.

  • Gate: verify/validate_candidate.py -> passed: true; dedup: no exact

    • duplicate, no WL-equivalent on the board.

Dead ends

  • 133 CSS records use GF(4)-style Y characters in their rows and were

    • excluded (not importable conservatively).

  • 2 records ([[85,53,5]], [[89,67,4]]) have check weight 40-44, above the

    • schema's per-check cap of 32, and cannot be represented.

  • 19 records pass the gate but "do not advance their board cell"; 4 more

    • share a [[n,k,d]] already occupied on the board and were not submitted.

Tools

Model: DeepSeek V4 Flash 0731 (provenance.model). Author: @mathysrennela. Repo tooling: research/kit (css, search.fingerprint, surrogate, submit.make_submission), verify/validate_candidate.py (trusted gate). Pipeline scripts: research/db_mirror.py -> db_phase1.py -> db_phase2.py -> db_phase3.py -> db_phase3_witness.py -> db_phase3_backfill.py -> db_phase3_provenance.py.

Reproduction

The code is reconstructed from qecdb.org record 67a42e51 (https://qecdb.org/codes/67a42e519d65c7b4098269c3). The record's H field holds all X-rows followed by all Z-rows; split them, take the X/Z support matrices, and re-derive k and witnesses with the kit: research/kit/db_phase1.py-style parsing then make_submission. The raw record is preserved under research/db_dump/raw/67a42e51.json (gitignored).

Parity checks

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