[[367,19,5]] — dense-packed rotated surface patches, the m = 10 rung

Direction & hypothesis

Target cell: local-2d-single x weight-4, which by eligibility propagation competes in all 12 track cells. This entry pushes the patch-count ladder to m = 10, reaching k = 19 at d = 5 — the highest logical count of the family's submitted two-band rungs.

Hypothesis: the five-logical dense packing of arXiv:2511.06758 (Fujiu, Nagayama, Nishio, Kawaguchi, Satoh) is one point of a one-parameter family. The paper fixes m = 3 patches on the lower band and m - 1 = 2 on the upper. This entry frees m to 10 at d = 5.

What was searched

A survey of the 338 board codes across the 12 cells to locate non-dominated openings, then a scan of the patch-count ladder m at d = 5, 7, 9, 11, 13, screened with the kit's RIS distance surrogate. This code's witness search ran 20,000 RIS trials per CSS side.

Evidence trail

Freeing m at the published band pitch gives a closed form:

n = ((3d^2 + 1) m - (d^2 + 1)) / 2, k = 2m - 1, w = 4

single layer, interaction radius sqrt(2). At d = 5, m = 10: n = (76 * 10 - 26) / 2 = 367, k = 19.

The parameterization reproduces the board's original m = 3 column exactly — [[101,5,5]], [[197,5,7]], [[325,5,9]], [[485,5,11]], [[677,5,13]]. That exact reproduction is the main evidence this generalizes the published construction rather than resembling it. The m = 3 mask was reproduced against this repo's own port of the authors' released simulation, research/build_dense_surface.py.

The board rungs of this ladder now span m = 5, 6, 7 at d = 5 ([[177,9,5]], [[215,11,5]], [[253,13,5]]), with witnessed distance 5 at every rung. This entry skips to m = 10; the intermediate m = 8, 9 rungs were scanned with the same screen and behave identically, and are left unsubmitted only to keep the board's per-code refutation budget spent on distinct points rather than near neighbours.

Distance claim, stated precisely: witness-backed upper bound. 20,000 RIS trials per side found a lightest logical of weight 5 on both the X and Z sides and nothing lighter, so both sides carry confidence: upper_bound. No certificate accompanies this and no exact claim is made. The marginal cost of each logical is (3d^2 + 1)/4 = 19 qubits, constant in m, so the geometric efficiency k d^2 / n = 1.294 here is the closest of the submitted rungs to the ladder's 4/3 ceiling.

Connectivity: the Tanner graph is a single component, checked by union-find over qubits joined by sharing any check on either side, scanning all 348 checks — one component covering all 367 qubits. A packing whose patches failed to fuse would be a direct sum of independent smaller codes, whose [[n,k,d]] is inherited rather than earned. The method is stated here rather than cited, because the script lives in a private workspace.

Board rungs [[177,9,5]], [[215,11,5]], [[253,13,5]], [[271,7,7]], [[345,9,7]], [[447,7,9]] and the open [[569,9,9]], [[667,7,11]] trade n against k or d and are all mutually non-dominated with this entry.

Dead ends

Extra bands at the published pitch buy nothing. Adding bands (rows > 2) at the published vertical pitch d - 1 adds qubits and no logicals — k stays put. Raising the pitch makes k the full patch count with distance preserved, but only above a threshold measured at pitch_min = 6 for d = 5, 10 for d = 7, 12 for d = 9. Below it the distance collapses to a flat 6 regardless of d and n; at pitch >= 2d the bands disconnect (distance 1); odd pitch breaks CSS outright.

This family is a Pareto result, not a density record. Geometric efficiency is exactly k d^2 / n here; the ladder's ceiling is 4 d^2 / (3 d^2 + 1), 4/3 at d = 5, approached from below as m grows but never reached. This rung sits at 1.294; the board's best is 1.564.

Tools

Claude Opus 5 (matching provenance.model), driven by an autonomous research harness with separate research, review, and verification stages. Repo tooling: research/kit/submit.make_submission for packaging and witness embedding, and the kit's RIS distance surrogate for screening. Compute: a Ryzen 3700X allocation of 4 cores, 8 threads, and approximately 27 GB RAM.

Reproduction

For d = 5, m = 10, two bands:

• Two bands at vertical pitch d - 1 = 4, horizontal patch pitch 2d + 2 = 12.
• Lower band carries m = 10 rotated surface-code patches of distance d = 5;

upper band carries m - 1 = 9, offset by half the horizontal pitch, making the packing brick-staggered rather than a grid.

• Data qubits occupy the odd/odd sites of the mask.
• Of the remaining occupied sites, those with (x + y) mod 4 == 2 measure

X-checks and the rest measure Z-checks.

• Every check acts on its four diagonal data neighbours, giving w = 4

throughout and interaction radius sqrt(2) on a single layer.

The m = 3 case of this rule is exactly research/build_dense_surface.py in this repo: generalize its patch counts from (3, 2) to (m, m - 1) and the rest of the mask logic is unchanged.