n
130
Issue #2992 asked for the halved CPM pair-partition codes of arXiv:2609.30069 (Definition 1 with the reversing fold of Proposition 4); its (4,10) family went onto the board on 2026-10-13 as [[90,21,10]], [[95,22,11]], [[140,31,14]], and [[200,43,19]]. This entry comes from the follow-on sweep of 2026-10-12 over the paper's (3,8), (3,10), (4,10), and (4,12) families at the lifts where the stabilizer board had no entry at all: the paper publishes no generators and its data repository (ultra-high-rate-qec/design-principles-data) was empty on 2026-10-11, so the families were searched directly over their exponent arrays. For the (4,10) family n = 5P and k = 1P + 3 for every accepted template, and the distance is whatever the search finds.
The parent is a pair-partition CPM code with J = 4 check blocks and L = 10 qubit blocks of size P = 26. X checks come from an exponent array E: row (j, s) has a 1 at qubit (l, s - E[j][l] mod P) for each l. Z checks come from D[j][l] = -E[j][l xor 1] mod P in the same way. E must satisfy the paper's pair-partition rule: each off-diagonal cell (i < j) carries a perfect matching M on the L block columns, edge-disjoint from the matchings already placed in its row and column, and E[i,u] + E[j,u xor 1] = E[i,v] + E[j,v xor 1] mod P for every matched pair {u, v}. The search draws M at random, solves the resulting homogeneous integer system for E with sympy, and reduces a random integer combination of the kernel basis mod P.
The reversing fold identifies qubit t of block l with qubit -t mod P of block l xor 1. Each parent X check then becomes one stabilizer generator on the 5P = 130 surviving qubits (blocks 0, 2, 4, 6, 8): an X leg on each surviving block's position and a Z leg on each partner position, with coinciding legs merging to Y. Every generator has weight at most 10. The 4P = 104 generators span a group of rank 4P - 3 = 101, hence k = 130 - 101 = 29.
A Perlmutter sweep over the (4,10), P = 26 template on 2026-10-12 (NERSC gen0030, job 59705375): 10 processes for 3.2 hours each, 223,445 accepted template records screened at 2,000 Pauli-weight RIS trials apiece, not deduplicated by E. The eight highest readings in the cell then went through the frame screen (12 random per-qubit symplectic frames x 1,000,000 gf2_fast trials per chunk on the symplectic doubling, jobs 59731365 to 59731368, 2026-10-13 to 14), 216 frames for this one, which came out best of the eight at 13. Staged and gated on 2026-10-14 (job 59777052), it then held 13 through 500 further frames x 1,000,000 trials with fresh seeds (job 59779389, 2026-10-14), where the lightest logical appeared 211 times and nothing lighter appeared; the job was killed by a node failure at about eight of its twelve hours, so the count is what had been written by then. The other seven templates in the cell are parameter twins and are not filed.
[79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103] (positions in both carry Y), stored in the JSON; it commutes with every generator and lies outside the stabilizer group, as the gate re-checks.
minimizes |x| + |z|, so a logical with Y legs looks heavier than its Pauli weight and can be missed. The frame screen draws a random single-qubit symplectic frame per qubit, runs the doubled search, maps each find back, and scores it by Pauli weight. On a (4,10), P = 40 code of this family, 12 frames x 500,000 trials found Pauli weight 15 where 100,000,000 unframed trials read 19, so unframed non-refutations of these codes are weak evidence, and every count above is framed.
verify/validate_candidate.py through research/kit/coordination.pyagainst main c17845a2, 2026-10-15): passed; advances the weight-9plus x unrestricted stabilizer board; literature novelty UNVERIFIED.
No board entry of any type at n <= 130 and k >= 29 reaches d >= 9; the best are [[96,30,8]], [[104,30,8]], [[112,40,8]]. On the stabilizer board the cell weight-9plus x unrestricted had nothing near this (n, k); the nearest stabilizer entries are [[133,25,6]], [[133,19,6]], [[140,31,14]].
The paper's Table VII lists [[130,29,14]] at this lift, as an exact value; this search did not reach 14, so the entry is 1 short of the published value.
it or its appendices, and the data repository is empty. Where this entry falls short of a published value, whether the gap is in the template search (the paper does not say how its E were chosen) or in our distance estimate (an upper bound) is open.
loosely; the ranking that fed the frame screen came from it, so better templates may have been screened out early.
Template search halved_pp.py and frame screen frame_screen.py (genesis campaign scripts; the reproduction below is self-contained), verify/heuristic_distance.py Pauli RIS, verify/gf2_fast on Perlmutter (NERSC gen0030), verify/validate_candidate.py. Claude Fable 5.1 (Claude Code) working for @vprusso.
import numpy as np
def halved_checks(P, E):
J, L = len(E), len(E[0])
HX = np.zeros((J * P, L * P), dtype=np.int8)
for j in range(J):
for l in range(L):
for s in range(P):
HX[j * P + s, l * P + (s - E[j][l]) % P] = 1
checks = []
for h in HX:
x, z = [], []
for ri, l in enumerate(range(0, L, 2)):
for t in range(P):
if h[l * P + t]:
x.append(ri * P + t)
if h[(l ^ 1) * P + (-t) % P]:
z.append(ri * P + t)
checks.append({"X": x, "Z": z})
return checks
E = [[18, 20, 22, 24, 1, 19, 3, 5, 14, 15], [1, 8, 6, 4, 8, 20, 25, 17, 5, 13], [20, 1, 13, 9, 21, 20, 0, 18, 4, 23], [2, 7, 17, 16, 6, 14, 17, 1, 23, 16]]
S = halved_checks(26, E) # the 4P generators of codes/130-29-13.json, in order