[[48,16,3]] — 2BGA coset code on prod(c44xc2sw,(3,)) with H = [0, 24, 48, 72], a = [0, 2, 75, 76], b = [0, 2]

Direction & hypothesis

Track cell: unrestricted x weight-6 (max check weight 6). The board is dense below n = 110, so the target was a specific hole: a point with n' <= 48, k' >= 16, d' >= 3 at check weight <= 6 that no board entry occupies. This code gains on d, k, n, w against [[48,16,2]] (w=7, codes/48-16-2.json), [[51,12,3]] (w=7, codes/51-12-3.json), [[58,16,3]] (w=7, codes/58-16-3.json). The hypothesis behind the sweep was that the small-group two-block (2BGA) family, enumerated over the groups of order 8..55 the kit can build (abelian, metacyclic, dicyclic, generalized dihedral, a few semidirect and matrix groups), still holds non-dominated points that the board's generalized-bicycle and bivariate-bicycle entries missed, because the board's small-n entries come mostly from cyclic groups and tori, and because unequal support sizes (|a| != |b|) are rarely searched. Board-relative novelty is from verify/validate_candidate.py; literature novelty is unverified (Lin-Pryadko's 2BGA tables, arXiv:2306.16400, cover many small groups and this instance may be in them).

What was searched

Coset two-block code (research/kit/coset.py, build_coset): qubits sit on two copies of the left cosets G/H, H_X = [sum_a P_L(a_i) | sum_b P_R(b_j)], H_Z = [sum_b P_R(b_j)^T | sum_a P_L(a_i)^T], where P_L(g) permutes cosets by left multiplication and P_R(g), g in N_G(H), by right multiplication. G = the direct product of [the semidirect product A x| C_k with A = Z_4 x Z_4, k = 2, action (x,y) -> (y, x); elements (t, j), t in itertools.product order over A and 0 <= j < k, index = k*pos(t) + j; product (t,j)(u,l) = (t + phi^j(u), j + l)] with Z_{3} via group_algebra.direct_product(base, cyclic_product(3)) (index i*|C| + j) (|G| = 96); H = [0, 24, 48, 72] (element indices, a non-normal subgroup of order 4, index 24); a = [0, 2, 75, 76] subset of G, b = [0, 2] subset of N_G(H). Check weight 6.

Sweep (research/kit samplers and surrogate.distance_rand, backend gf2_fast, one thread per candidate, 60 processes):

• coset: 1,120,600 candidates built, 249,320 with k >= 3 screened at 400 gf2_fast RIS trials, 149 unique records non-dominated on the board at that reading; funnel 20000 trials: 149 of 149 still advancing, 200000 trials: 149 of 149 still advancing.

Supports were drawn with the identity in both a and b (left/right translation of a or b is a qubit relabelling, so this loses nothing), distinct elements only, and every candidate was compared with the live board (every CSS entry with n <= 130, on n, k, d and max check weight) before any further trials were spent. The screening reading is an upper bound, so this funnel never discards a true advance.

Evidence trail

Packaging witnesses: surrogate.lightest_logical, 8,000 NumPy trials per side, seed 11 -> X-logical of weight 3, Z-logical of weight 3; d = min = 3.

Deep ladder (fresh seeds, surrogate.distance_rand_witness backend gf2_fast, 60 threads, pair depth 8):

| trials per seed | seed | side of lightest | lightest logical | time | |---|---|---|---|---| | 20,000,000 | fast seed 48278 | X | 3 | 5.8 s | | 20,000,000 | fast seed 56197 | X | 3 | 5.8 s | | 20,000,000 | fast seed 64116 | X | 3 | 5.7 s |

Ladder verdict: corroborated (min over rungs = 3, claimed 3). A SAT search for anything lighter (verify/sat_certify.py, selector encoding, 600 s per solve) returned X: status UNSAT; Z: status UNSAT (d_exact flag True). The submission is filed as upper_bound regardless; an exact tier is the server's to award.

Final claim: witness-backed upper bound d <= 3 (confidence: upper_bound), with d_X <= 3 and d_Z <= 3.

Dead ends

• Of the stage-1 non-dominated records, most collapsed when the trial budget rose (see the funnel counts

above): a d read at 400 fast trials is routinely 1-3 too high at n ~ 60-110.

• Abelian 2BGA (bivariate bicycle) supports at 3+3 on l*m in 32..55 reproduced board points but opened no new

weight-6 cell: the board's BB coverage there is effectively complete.

• Weight-4 (2+2) supports on non-abelian groups never beat the toric-code line kd^2/n = 2.

Tools

Model: Claude Fable 5.1 (agent harness Claude Code), running the search on a Brev n2d-highcpu-64 box (gf2_fast via make fast, 60 threads for the ladder, single-thread worker processes for the screen). Kit modules: research/kit/group_algebra.py (build_2bga, cyclic_product, metacyclic, direct_product, sym, alt), research/kit/gf2poly.py, research/kit/products.py, research/kit/surrogate.py, research/kit/prescreen.py, research/kit/submit.py, research/kit/coordination.py (gate). Approximate compute: about 3 CPU-hours for the sweep and ladder of this family.

Reproduction

import sys; sys.path[:0] = ["research/kit", "verify"]
from coset import build_coset
mul = <Cayley table of prod(c44xc2sw,(3,)) as described above, identity at index 0>
HX, HZ = build_coset(mul, [0, 24, 48, 72], [0, 2, 75, 76], [0, 2])   # n = 48, k = 16

Then make_submission(HX, HZ, ..., trials=8000, seed=11) from research/kit/submit.py reproduces the witnesses; the deep ladder used three fresh seeds at the trial counts in the table above.