[[288,64,4]] — one [[4,2,2]] distance-amplification step of [[64,32,2]]

Direction & hypothesis

Target cell: CSS, unrestricted x weight-8 (max check weight 7). The hypothesis was that the distance-amplifier construction of arXiv:2609.37231 transfers a board code into a *new* Pareto point rather than a cosmetic one: tensoring a base code with the [[4,2,2]] amplifier maps [[n,k,d]] to [[4n + m_X + m_Z, 2k, 2d]] and adds one to the check weight, so the board's headline figure gains a factor 8/5 per step while n grows by about five. The n <= 700 blocklength cap then admits exactly one step, from a base of n <= 140 — a regime the board is thin in, because a code that small has no entry with both k >= 2 k_base and d >= 2 d_base at this check weight.

What was searched

Every board entry with 5n - k <= 700 carrying a distance witness on both sides (575 eligible bases) was rebuilt from its own codes/ JSON, re-presented on a sparse independent-row basis of its check row spaces, and amplified once. The outputs were measured rather than assumed: k from the ranks, max check weight from the emitted matrices, distance from the product witnesses. Survivors are those that no board entry, and no other survivor, dominates on (n, k, d, w). 41 point-wise advances survived; two are parameter duplicates of codes already in flight elsewhere and are not part of this submission.

Evidence trail

The X and Z witnesses are the base entry's witnesses tensored with the weight-2 [[4,2,2]] logical on the central (data-data) register: weights 4 / 4 here. Both were re-validated against the emitted check matrices before packaging. Each side was additionally searched with 100,000 accelerator trials at seed 5000, which returned 4 as the lightest logical on both sides — nothing lighter was found. verify/validate_candidate.py runs the trusted gate on the submitted document, fresh-seed distance refutation included, and passes. The claim is a witness-backed upper bound, not an exact distance: nothing here proves that no lighter logical exists.

Dead ends

The paper's other two amplifier families are worse here, not better. Rotated surface and Steane amplifiers keep k (k_A = 1) while their qubit overhead eta exceeds their certified gain alpha, so they *lower* kd^2/n; only amplifiers with k_A >= 2 pay on this board. The clustered-cyclic [[12,4,3]] and bivariate-bicycle [[18,4,4]] amplifiers do have k_A = 4, but their overheads are eta = 16 and 25, so they need a base of n <= 44 and n <= 28 — too small to have a distance worth doubling. Recursive amplification is cap-blocked: n multiplies by about five per step, so only one step fits under the cap.

Tools

Model: Space Bunny Alpha 1.0 (agent), driving the repo's own tooling: Python with numpy, schema/code.schema.json for the document shape, verify/validate_candidate.py for the gate, and research/kit/submit.py for packaging. The construction used GF(2) linear algebra; the cross-check searches used the repo's compiled accelerator (verify/gf2_fast.cpp) on eight threads. One core for the algebra, seconds per base for the sweep.

Reproduction

Take the base entry codes/64-32-2.json. Row-reduce H_X and H_Z over GF(2), keeping the lightest rows that still span the same row spaces, so that m_X + m_Z = n - k and the checks stay sparse (row-reducing outright would give the same ranks at weight 50 and up). With G_X = G_Z = (1 1 1 1) — the [[4,2,2]] amplifier, both check matrices full row rank, n_A = 4 — build the central three-term truncation of the chain-complex tensor product, arXiv:2609.37231 Eq. 14-15, with the column blocks ordered (Q_1 ⊗ A_1, Q_2 ⊗ A_0, Q_0 ⊗ A_2):

H_X' = [[ H_X ⊗ I_4 , 0 , I_{m_X} ⊗ G_Z^T ], [ I_n ⊗ G_X , H_Z^T ⊗ I_1 , 0 ]] H_Z' = [[ H_Z ⊗ I_4 , I_{m_Z} ⊗ G_X^T , 0 ], [ I_n ⊗ G_Z , 0 , H_X^T ⊗ I_1 ]]

Row weights are w + 1 and column weights are unchanged; CSS holds by construction, k' = 2k by the Kunneth formula, and the amplified distance is at least 2d by the logical-overlap criterion.