← back to the board
[[132,4,17]] d =
n
132
k
4
d
17
kd²/n
8.75758
w
8
X/Z
1

Share this result

Distance

X/Z asymmetry 1 · d_X = 17, d_Z = 17 · 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 17 · witness weight 17 (claimed upper_bound)
witness found by @vprusso · verify/ris_gpu.py (Perlmutter A100) · found at 3×108 trials · survived 3×108 trials · 2026-10-30
witness operator (support, 17 qubits)
[1, 2, 20, 54, 67, 70, 75, 76, 80, 87, 94, 101, 102, 104, 113, 124, 126]
d_Z 17 · witness weight 17 (claimed upper_bound)
witness found by @vprusso · verify/ris_gpu.py (Perlmutter A100) · found at 3×108 trials · survived 3×108 trials · 2026-10-30
witness operator (support, 17 qubits)
[22, 31, 32, 35, 50, 57, 69, 70, 79, 92, 100, 101, 103, 105, 121, 125, 127]
certificate exact, d = 17 · 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 < 17 exists; Z: no logical < 17 exists

Recipe at other sizes

the stored construction recipe (bb.build_bb, rebuilds this entry at its own parameters) rebuilt at neighboring sizes (l +- 1, m +- 1, and each side halved or doubled, same monomials (reduced modulo the new torus)) and put through the verifier's cheap structural checks only: no distance at any size, no ranking, no tier. A recipe that holds up at other sizes is evidence of a construction rather than a tuned artifact; one that does not is a fact about the recipe, not about this entry.
passes at 7 of 7 sizes · own size [[132,4]] w=8

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 8 · H_Z 8
qubit degrees H_X 4 · H_Z 4
trapping sets H_X (1,4)×132 (2,6)×1848 (3,6)×1738 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,4): 132 (2,6): 1848 (3,6): 1738 (3,8): 33594 (3,10): 3696
trapping sets H_Z (1,4)×132 (2,6)×1848 (3,6)×1738 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,4): 132 (2,6): 1848 (3,6): 1738 (3,8): 33594 (3,10): 3696

Circuit tier

syndrome-extraction memory circuits committed under circuits/132-4-17/ · canonical noise recipe, 17 rounds, stim 1.16.0
d_circ ≤ 17 (min over bases; penalty-only, clamped to ≤ d)
d_circ^X 17 · fault-set witness of 17 mechanisms (claimed upper_bound)
witness fault set (mechanism indices in the committed .dem, 17)
[128447, 128449, 128451, 128457, 128464, 128508, 128514, 128516, 128518, 128522, 128530, 128531, 128533, 128539, 128558, 128560, 128565]
d_circ^Z 17 · fault-set witness of 17 mechanisms (claimed upper_bound)
witness fault set (mechanism indices in the committed .dem, 17)
[128315, 128323, 128359, 128365, 128377, 128378, 128390, 128394, 128418, 128444, 128495, 128518, 128520, 128524, 128531, 128534, 128552]
no measured logical error rate yet; d_circ is a floor, and the measured tier records the prefactor it cannot see

Construction & provenance

authors @vprusso
provenance submitted through the challenge
novelty novelty not audited
construction Bivariate bicycle on Z_6 x Z_11 (n = 2lm = 132) with A = y5 + xy6 + xy + x4y5 and B = x2y3 + y + xy10 + x, H_X = [A | B], H_Z = [B^T | A^T]; built by research/kit/bb.build_bb(l=6, m=11, A_terms=[[0, 5], [1, 6], [1, 1], [4, 5]], B_terms=[[2, 3], [0, 1], [1, 10], [1, 0]]).
model Claude Claude Fable 5.1 (Claude Code) working for @vprusso (claimed, not verified)
builds on S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature 627, 778 (2024), arXiv:2308.07915
date 2026-10-25
notes Unattended loop run on Perlmutter, iteration 862, direction bb-w4-mid, seed 20261879. The deeper rungs recorded in notes/ agree with the gate's reading of d = 17.
family bivariate bicycle (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

[[132,4,17]] loop bivariate bicycle on Z_6 x Z_11

Direction & hypothesis

Random weight-8 bivariate-bicycle codes between n = 100 and n = 400 fill (n, k) cells where the board's weight-8 entries come from a few structured families; uniform sampling over the torus and the monomials tests whether those families are the best this weight allows.

What was searched

Direction bb-w4-mid of the loop samples bivariate-bicycle codes on Z_l x Z_m with l in [6, 16], m in [4, 12], four monomials per polynomial (check weight 8), and n in [100, 400]. Each iteration draws fresh candidates, screens them at 400 and then 20,000 RIS trials (gf2_fast), keeps the twelve best by kd^2/n that no board entry or earlier staged document dominates, and gates them with research/kit/submit.make_submission at 8,000 NumPy trials per side plus verify/validate_candidate.py. This code is iteration 862 (seed 20261879). By 29 October the direction had run 801 iterations over 106,817 candidates and staged 474; across all five directions the loop staged 1,383 documents in 390.6 CPU hours. The 26 October review kept 49 staged codes that neither the board nor another staged code dominated, and each of the 49 was re-searched on OLCF Lux (10,000,000 gf2_fast trials, two seeds) and on Perlmutter A100s (300,000,000 RIS trials per side, two seeds).

Evidence trail

Confirmation ladder for the submitted code, each rung a fresh seed unless marked otherwise, reading the lightest logical found:

| budget (trials/side) | lightest logical | | ---: | ---: | | 20,000 (loop screen, gf2_fast, both sides) | 17 | | 8,000 (loop gate, NumPy, per side) | 17 | | 10,000,000 (Lux gf2_fast, both sides, seed 11) | 17 | | 10,000,000 (Lux gf2_fast, both sides, seed 22) | 17 | | 300,000,000 (GPU RIS, 300M per side, seed 1) | 17 | | 300,000,000 (GPU RIS, 300M per side, seed 2) | 17 |

6 fresh-seed rung(s) agree at the best bound, the deepest of them at 300,000,000 trials per side. The submitted witness reproduces it: X: d <= 17 (upper_bound), Z: d <= 17 (upper_bound).

Trial counts are per side for the gate and the GPU rungs; the screen and the Lux rungs are gf2_fast budgets shared across both sides (the Lux rung also ran 2,000 NumPy RIS trials per side). Each rung's reading is the lightest logical its own witnesses reach after an independent GF(2) check. The orbit fold (verify/heuristic_distance, 1,000,000 trials per folded code, seeds 101, 202, and 303) found automorphism partitions on 3 of 3 runs and no lighter logical through them.

Dead ends

None recorded for this candidate.

Tools

Model: Claude Fable 5.1 (Claude Code) working for @vprusso (unattended loop orchestrator on Perlmutter over research/kit/search.screen_adaptive). Repo tooling: research/kit/search.py, research/kit/bb.py, research/kit/submit.py, verify/heuristic_distance.py, verify/ris_gpu.py. The local verdict is verify/validate_candidate.py; the bundle was assembled by research/kit/promote.py. Compute: Perlmutter CPU for the loop, one OLCF Lux node for the two 10M rungs, and one Perlmutter A100 for the two 300M rungs (about ten minutes per code).

Reproduction

`research/kit/bb.build_bb(l=6, m=11, A_terms=[[0, 5], [1, 6], [1, 1], [4, 5]], B_terms=[[2, 3], [0, 1], [1, 10], [1, 0]])` returns (H_X, H_Z); the repro manifest replays that call through research/kit/rebuild.py and compares fingerprints. The distance rungs are verify/heuristic_distance.estimate with --fast-trials 10000000 (seeds 11 and 22) and `verify/ris_gpu.py --trials 300000000` (seeds 1 and 2) on the staged document.

Parity checks

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