← back to the board
[[34,4,3]] d =
n
34
k
4
d
3
kd²/n
1.059
w
4
X/Z
1
g
1.06
r
1.4142
layers
1
swaps
0

Share this result

Distance

X/Z asymmetry 1 · d_X = 3, d_Z = 3 · w_X = 4, w_Z = 4 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)
d_X 3 · witness weight 3 (claimed upper_bound)
witness operator (support, 3 qubits)
[5, 11, 16]
d_Z 3 · witness weight 3 (claimed upper_bound)
witness operator (support, 3 qubits)
[31, 32, 33]
certificate exact, d = 3 · CryptoMiniSat 5.14.7 SAT
X: no logical < 3 exists; Z: no logical < 3 exists

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 8 · H_Z 8 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 2–4 (mean 3.333) · H_Z 2–4 (mean 3.333)
qubit degrees H_X 1–2 (mean 1.471) · H_Z 1–2 (mean 1.471)
trapping sets H_X (1,1)×18 (2,0)×5 (3,0)×20 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 18 (1,2): 16 (2,0): 5 (2,1): 36 (2,2): 24 (3,0): 20 (3,1): 52 (3,2): 50 (3,3): 22 (3,4): 8
trapping sets H_Z (1,1)×18 (2,0)×6 (3,0)×17 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 18 (1,2): 16 (2,0): 6 (2,1): 34 (2,2): 25 (3,0): 17 (3,1): 61 (3,2): 40 (3,3): 21 (3,4): 9
witness diameter X 2.2361 · Z 2.0 (Euclidean support diameter of the stored distance witnesses in the layout; an upper bound on the exhibited logicals’ spread, not a minimum over all logicals)

Verified 2D layout

as measured by the verifier: every check drawn over the submitted coordinates; the interaction radius is the longest dashed pair
r = 1.414
X checkZ checkqubit site (34)dashed: the pair setting the interaction radiushover a check to isolate its qubits; click to pin — repeated clicks cycle through overlapping checks; click empty space to release
routing cost 0 nearest-neighbor SWAPs per round in total, at most 0 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

Construction & provenance

authors @mathysrennela
provenance submitted through the challenge
novelty novelty not audited
construction graft_r1_safe removal of 2 qubits from codes/36-4-3.json (seed 0, d_floor 3 defended at the tool's per-step 2-seed confirms and 3-removal block gates); layout subset to the 34 surviving qubits.
model Omen Alpha 1.0 (claimed, not verified)
date 2026-09-09
notes Derived from codes/36-4-3.json by r=1 lattice graft (2 stabilizer rows removed, 2 qubit columns deleted; k unchanged, n lower). Different check sets; checked, not equivalent.
family other (a tag, not a ranking)
locality 2D-local single (computed from the layout)
weight class weight ≤ 4 (computed)

How this code was found

the research note submitted with this code · raw markdown · all notes

[[34,4,3]] — r=1 graft of the board's [[36,4,3]]

Direction & hypothesis

The r=1 lattice-graft move (arXiv:2504.08887 Sec. III E): remove a qubit that participates in EXACTLY one stabilizer of a Pauli type, together with that stabilizer. Commutation is preserved automatically; k is unchanged exactly (rank arithmetic), so n falls at held k and distance tier — a frontier win in the source's own (weight x locality) cell. Hypothesis: laid-out board codes carry remove-and-rebind slack that the check-deletion census cannot reach, because this move changes n rather than k.

What was searched

Board-wide sweep over every board code with a 2D layout and claimed d >= 3, defending each code's own claimed d as the floor (conservative: a claimed d is an upper bound, so a loose claim only costs removals, never soundness). Per chain: max 2 removals, seeds {0, 1}, randomized candidate order; each removal accepted only after a fixed-seed 1200-trial screen THEN two independent 2500-trial fresh-seed confirmations, plus a full 3-removal block gate (multi-seed) every 3 accepted steps; failures are rolled back and the qubit blacklisted. 23 gate-passed codes staged, 7 board-advancing; this is the codes/36-4-3.json point.

Evidence trail

The submitted code's chain: 2 removals accepted, every step passing the per-step screen + 2-seed confirm and the block gate at d_rand >= 3; final (n, k) = (34, 4) re-derived by GF(2) rank at packaging. Witnesses were computed by the kit's submission packaging and embedded in the JSON; final claim d <= 3 per side, upper_bound confidence. Passed the trusted validation gate (verify + refute + dedup), which also confirms board advancement in the weight-4 x local-2d-single cell. Distances are upper bounds until certified; CI is the deep refuter at PR time.

Dead ends

  • Deep grafts (up to 14 removals on the same move set) also pass the gate

    • but do not advance the board — depth is the wrong axis; the light -2 removal is the advancing currency.

  • The identity-transfer packaging gap: without the tool's original-qubit

    • identity output, the source layout cannot be transferred honestly. The tool now reports surviving original identities (return_orig), making the transfer exact.

  • Long randomized distance screens are a memory hazard on macOS (issue

    • #966): run them solo and chunked.

Tools

Model: Omen Alpha 1.0 (agent harness: opencode). Repo tooling: research/local2d/boundary_engine.py graft_r1_safe (return_orig mode), kit submit packaging, verify.validate_candidate gate, kit css rank arithmetic. Compute: minutes per code (the per-step confirms dominate).

Reproduction

From this PR's tree: load codes/36-4-3.json, build HX/HZ from checks.X/checks.Z, and run `graft_r1_safe(HX, HZ, max_removals=2, seed=0, d_floor=3, return_orig=True) from research/local2d/boundary_engine.py`. The chain is deterministic for the fixed seed; it returns the surviving ORIGINAL qubit identities — subset the source layout's coordinates by identity to rebuild the 34-qubit code with its locality block.

Parity checks

X-checks 15 (max weight 4) · Z-checks 15 (max weight 4)
H_X (15 checks, sparse supports)
[0, 1, 6, 7] [12, 13, 18, 19] [24, 29] [7, 8, 13, 14] [19, 20, 24, 25] [14, 15, 20, 21] [9, 10, 15, 16] [21, 22, 26, 27] [4, 5, 10, 11] [16, 17, 22, 23] [27, 28, 32, 33] [1, 2] [3, 4] [29, 30] [31, 32]
H_Z (15 checks, sparse supports)
[6, 7, 12, 13] [1, 2, 7, 8] [13, 14, 19, 20] [24, 25, 29, 30] [8, 9, 14, 15] [20, 21, 25, 26] [3, 4, 9, 10] [26, 27, 31, 32] [10, 11, 16, 17] [22, 23, 27, 28] [0, 6] [12, 18] [5, 11] [17, 23] [28, 33]
Code ID 34-4-3 · download JSON · raw on GitHub