← back to the board
[[153,6,10]] d ≤
n
153
k
6
d
10
kd²/n
3.922
w
5
X/Z
1.1
g
0.003
r
6.0
layers
2
swaps
697

Share this result

Distance

X/Z asymmetry 1.1 · d_X ≤ 11, d_Z ≤ 10 · 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 11 · witness weight 11 (claimed upper_bound)
witness operator (support, 11 qubits)
[37, 82, 90, 98, 102, 106, 110, 114, 126, 142, 146]
d_Z 10 · witness weight 10 (claimed upper_bound)
witness operator (support, 10 qubits)
[7, 11, 27, 40, 44, 48, 52, 56, 64, 72]
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 6 · H_Z 6 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 5 · H_Z 4–5 (mean 4.961)
qubit degrees H_X 1–3 (mean 2.451) · H_Z 2–3 (mean 2.497)
trapping sets H_X (1,1)×2 (2,1)×2 (3,1)×2 (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): 80 (1,3): 71 (2,1): 2 (2,2): 103 (2,3): 444 (2,4): 201 (3,1): 2 (3,2): 162 (3,3): 1541 (3,4): 2292 (3,5): 828 (3,6): 408 (3,7): 63
trapping sets H_Z (1,2)×77 (2,2)×77 (3,2)×77 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,2): 77 (1,3): 76 (2,2): 77 (2,3): 456 (2,4): 225 (3,2): 77 (3,3): 1442 (3,4): 2475 (3,5): 894 (3,6): 450 (3,7): 74
witness diameter X 9.4868 · Z 9.8489 (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
r = 6
X checkZ checkqubit site (77)2 qubits stacked (2 layers)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 697 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 Check deletion + degree-one r=1 graft of the [[154,6,11]] generalized-bicycle code
model DeepSeek V4 Flash 0731 (claimed, not verified)
date 2026-09-17
notes Checked against the board: no exact-duplicate or WL-equivalent entry (trusted gate).
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

[[153,6,10]] — check-deletion + r=1 graft of the [[154,6,11]] generalized-bicycle code

Direction & hypothesis

Issue #1155 hackathon, 2D-local priority. Prior campaign notes (2026-09-08) established that plain check-deletion mostly dies in the weight-4/6/8 cells and that r=1 grafting alone yields light −2 qubit removals. This campaign tested the composition hypothesis: deleting a check (raising k) can create a degree-one qubit that a subsequent r=1 graft removes, producing a (n−1, k+Δk, d') point neither move reaches alone.

What was searched

Source: [[154,6,11]] (weight-5 cyclic generalized-bicycle code on Z_77, two-layer 2D-local layout, family generalized-bicycle). Move: delete one check, then one degree-one r=1 graft. Original column identities tracked so the source coordinates subset honestly (no fabricated layout); layers preserved.

Evidence trail

Trusted gate (verify/validate_candidate, refute=True): passed=true, board_advancing=true in the weight-6 × local-2d-bilayer cell, no exact duplicate / WL-equivalent board entry, no lighter logical in 8000 RIS trials (seed 168618203). Fresh witness search at submission: d ≤ 10 (d_X ≤ 11, d_Z ≤ 10), upper bound. Not an exact certificate; literature novelty unverified.

Dead ends

The [[154,6,11]] family also yields [[152,6,9]] (2 grafts) and [[151,6,8]] (3 grafts), submitted separately. Two high-k single-layer leads ([[453,8,18]], [[452,8,17]]) were refuted at the gate and excluded.

Tools

Model: DeepSeek V4 Flash 0731 (Zed agent). Repo tooling: research/kit (make_submission, css GF(2) exports), verify/validate_candidate (trusted gate), verify/qldpc_verify (structural screening + board reports). Local compute only.

Reproduction

Rebuild (H_X, H_Z) from the source [[154,6,11]] generalized-bicycle matrix: 1. Delete one check row (the deleted row is recorded in the submission's provenance trail; the move raises k by the rank loss). 2. Graft a degree-one qubit: pick a column q that participates in exactly one stabilizer of some Pauli type, remove that column and its unique same-side row, and truncate opposite-type rows containing q (commutation is preserved by construction). 3. Subset the source's 2D coordinates to the surviving columns (original identities, not guessed) and keep the two-layer layout.

The method is the r=1 lattice grafting of arXiv:2504.08887 Sec. III E combined with check deletion; the exact deleted row/column identities are deterministic from the source and the move order described above. The packaged JSON carries embedded witnesses and seed for the distance claim.

Parity checks

X-checks 75 (max weight 5) · Z-checks 77 (max weight 5)
H_X (75 checks, sparse supports)
[0, 57, 73, 77, 146] [1, 58, 74, 78, 147] [2, 59, 75, 79, 148] [3, 60, 76, 80, 149] [0, 4, 61, 81, 150] [1, 5, 62, 82, 151] [2, 6, 63, 83, 152] [3, 7, 64, 77, 84] [4, 8, 65, 78, 85] [5, 9, 66, 79, 86] [6, 10, 67, 80, 87] [7, 11, 68, 81, 88] [8, 12, 69, 82, 89] [9, 13, 70, 83, 90] [10, 14, 71, 84, 91] [11, 15, 72, 85, 92] [12, 16, 73, 86, 93] [13, 17, 74, 87, 94] [14, 18, 75, 88, 95] [15, 19, 76, 89, 96] [0, 16, 20, 90, 97] [1, 17, 21, 91, 98] [2, 18, 22, 92, 99] [3, 19, 23, 93, 100] [4, 20, 24, 94, 101] [5, 21, 25, 95, 102] [6, 22, 26, 96, 103] [7, 23, 27, 97, 104] [8, 24, 28, 98, 105] [9, 25, 29, 99, 106] [10, 26, 30, 100, 107] [11, 27, 31, 101, 108] [12, 28, 32, 102, 109] [13, 29, 33, 103, 110] [14, 30, 34, 104, 111] [15, 31, 35, 105, 112] [16, 32, 36, 106, 113] [17, 33, 37, 107, 114] [18, 34, 38, 108, 115] [19, 35, 39, 109, 116] [21, 37, 41, 111, 117] [22, 38, 42, 112, 118] [23, 39, 43, 113, 119] [24, 40, 44, 114, 120] [25, 41, 45, 115, 121] [26, 42, 46, 116, 122] [28, 44, 48, 117, 124] [29, 45, 49, 118, 125] [30, 46, 50, 119, 126] [31, 47, 51, 120, 127] [32, 48, 52, 121, 128] [33, 49, 53, 122, 129] [34, 50, 54, 123, 130] [35, 51, 55, 124, 131] [36, 52, 56, 125, 132] [37, 53, 57, 126, 133] [38, 54, 58, 127, 134] [39, 55, 59, 128, 135] [40, 56, 60, 129, 136] [41, 57, 61, 130, 137] [42, 58, 62, 131, 138] [43, 59, 63, 132, 139] [44, 60, 64, 133, 140] [45, 61, 65, 134, 141] [46, 62, 66, 135, 142] [47, 63, 67, 136, 143] [48, 64, 68, 137, 144] [49, 65, 69, 138, 145] [50, 66, 70, 139, 146] [51, 67, 71, 140, 147] [52, 68, 72, 141, 148] [53, 69, 73, 142, 149] [54, 70, 74, 143, 150] [55, 71, 75, 144, 151] [56, 72, 76, 145, 152]
H_Z (77 checks, sparse supports)
[0, 7, 77, 81, 97] [1, 8, 78, 82, 98] [2, 9, 79, 83, 99] [3, 10, 80, 84, 100] [4, 11, 81, 85, 101] [5, 12, 82, 86, 102] [6, 13, 83, 87, 103] [7, 14, 84, 88, 104] [8, 15, 85, 89, 105] [9, 16, 86, 90, 106] [10, 17, 87, 91, 107] [11, 18, 88, 92, 108] [12, 19, 89, 93, 109] [13, 20, 90, 94, 110] [14, 21, 91, 95, 111] [15, 22, 92, 96, 112] [16, 23, 93, 97, 113] [17, 24, 94, 98, 114] [18, 25, 95, 99, 115] [19, 26, 96, 100, 116] [20, 27, 97, 101] [21, 28, 98, 102, 117] [22, 29, 99, 103, 118] [23, 30, 100, 104, 119] [24, 31, 101, 105, 120] [25, 32, 102, 106, 121] [26, 33, 103, 107, 122] [27, 34, 104, 108, 123] [28, 35, 105, 109, 124] [29, 36, 106, 110, 125] [30, 37, 107, 111, 126] [31, 38, 108, 112, 127] [32, 39, 109, 113, 128] [33, 40, 110, 114, 129] [34, 41, 111, 115, 130] [35, 42, 112, 116, 131] [36, 43, 113, 132] [37, 44, 114, 117, 133] [38, 45, 115, 118, 134] [39, 46, 116, 119, 135] [40, 47, 120, 136] [41, 48, 117, 121, 137] [42, 49, 118, 122, 138] [43, 50, 119, 123, 139] [44, 51, 120, 124, 140] [45, 52, 121, 125, 141] [46, 53, 122, 126, 142] [47, 54, 123, 127, 143] [48, 55, 124, 128, 144] [49, 56, 125, 129, 145] [50, 57, 126, 130, 146] [51, 58, 127, 131, 147] [52, 59, 128, 132, 148] [53, 60, 129, 133, 149] [54, 61, 130, 134, 150] [55, 62, 131, 135, 151] [56, 63, 132, 136, 152] [57, 64, 77, 133, 137] [58, 65, 78, 134, 138] [59, 66, 79, 135, 139] [60, 67, 80, 136, 140] [61, 68, 81, 137, 141] [62, 69, 82, 138, 142] [63, 70, 83, 139, 143] [64, 71, 84, 140, 144] [65, 72, 85, 141, 145] [66, 73, 86, 142, 146] [67, 74, 87, 143, 147] [68, 75, 88, 144, 148] [69, 76, 89, 145, 149] [0, 70, 90, 146, 150] [1, 71, 91, 147, 151] [2, 72, 92, 148, 152] [3, 73, 77, 93, 149] [4, 74, 78, 94, 150] [5, 75, 79, 95, 151] [6, 76, 80, 96, 152]
Code ID 153-6-10 · download JSON · raw on GitHub