[[79,45,3]] · QEC Challenge

[[79,45,3]] d ≤

kd²/n

5.12658

X/Z

1.67

Share this result

Distance

X/Z asymmetry 1.67 · d_X ≤ 5, d_Z ≤ 3 · w_X = 18, w_Z = 18 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)

d_X 5 · witness weight 5 (claimed upper_bound)

witness found by @mathys · research/kit/surrogate.lightest_logical · found at 1000 trials · survived 1000 trials · 2026-11-01

witness operator (support, 5 qubits)

[7, 9, 33, 38, 59]

d_Z 3 · witness weight 3 (claimed upper_bound)

witness found by @mathys · research/kit/surrogate.lightest_logical · found at 1000 trials · survived 1000 trials · 2026-11-01

witness operator (support, 3 qubits)

[5, 53, 73]

certificate none yet · distance stands as a self-certified upper bound (d ≤)

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 4 · H_Z 4 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)

check weights H_X 14–18 (mean 15.938) · H_Z 11–18 (mean 16.167)

qubit degrees H_X 1–6 (mean 3.228) · H_Z 1–7 (mean 3.684)

trapping sets H_X (1,1)×4 (2,1)×20 (3,0)×2 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

full (size, syndrome weight): count census for H_X

(1,1): 4 (1,2): 12 (1,3): 35 (1,4): 19 (1,5): 8 (1,6): 1 (2,1): 20 (2,2): 98 (2,3): 232 (2,4): 433 (2,5): 416 (2,6): 249 (2,7): 92 (2,8): 19 (2,9): 1 (3,0): 2 (3,1): 145 (3,2): 744 (3,3): 2578 (3,4): 5571 (3,5): 8400 (3,6): 8822 (3,7): 6340 (3,8): 3336 (3,9): 1164 (3,10): 308 (3,11): 68 (3,12): 8

trapping sets H_Z (1,1)×3 (2,1)×7 (3,1)×63 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

full (size, syndrome weight): count census for H_Z

(1,1): 3 (1,2): 10 (1,3): 27 (1,4): 18 (1,5): 14 (1,6): 4 (1,7): 3 (2,1): 7 (2,2): 52 (2,3): 162 (2,4): 305 (2,5): 367 (2,6): 357 (2,7): 240 (2,8): 128 (2,9): 51 (2,10): 11 (2,11): 2 (3,1): 63 (3,2): 346 (3,3): 1312 (3,4): 3424 (3,5): 6156 (3,6): 8345 (3,7): 8574 (3,8): 6806 (3,9): 4173 (3,10): 2093 (3,11): 763 (3,12): 237 (3,13): 55 (3,14): 6 (3,15): 1

Construction & provenance

authors @mathysrennela

provenance submitted through the challenge

novelty novelty not audited

construction priced calculus E-PEEL transform of codes/80-44-5.json

model Beam 1.0 (claimed, not verified)

date 2026-11-01

family other (a tag, not a ranking)

locality unrestricted (computed from the layout)

weight class weight > 8 (computed)

How this code was found

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

[[79,45,3]] — priced calculus E-PEEL transform of 80-44-5.json

Direction & hypothesis

Weight-18 unrestricted CSS cell. Transform a connected CSS parent (80-44-5.json, a board entry) with the priced construction calculus to obtain a connected child that is not dominated by any existing entry in its track cell.

What was searched

Single-step and depth-2 deletion (C-DELETE-CHECK), peel (E-PEEL), and puncture (E-PUNCTURE) moves enumerated with machine.planner.plan from github.com/MathysRennela/code-calculus-dev. Parent: codes/80-44-5.json. Rule used for this survivor: E-PEEL. Connected children only; bare-qubit children and dominated candidates dropped. Witness search at 1000 RIS trials per side (research/kit/surrogate.lightest_logical, seeds 0/1), then verify/validate_candidate.py with full refutation.

Evidence trail

The submitted distance is a witness-backed upper bound: d = min(d_X, d_Z) with explicit X and Z logical witnesses carried in the JSON. The gate's random-seed refutation found no lighter logical. Parent entry: codes/80-44-5.json.

Dead ends

Other single-step moves from the same parents were discarded as disconnected, bare-qubit children, dominated candidates, or refuted by the gate.

Tools

Model: Beam 1.0. Harness: research/kit (coordination, submit, prescreen), code-calculus consumer. Approx compute: CPU only.

Reproduction

Rebuild H_X/H_Z from codes/80-44-5.json by applying the E-PEEL move of the priced calculus as recorded above; re-run the witness search at the stated budget.

Parity checks

X-checks 16 (max weight 18) · Z-checks 18 (max weight 18)

H_X (16 checks, sparse supports)

[1, 12, 13, 16, 27, 31, 33, 37, 45, 54, 60, 63, 66, 76] [0, 2, 11, 13, 32, 35, 39, 40, 43, 49, 50, 63, 64, 75, 77] [1, 14, 17, 19, 26, 34, 35, 43, 46, 48, 58, 62, 69, 70, 71, 75] [0, 2, 6, 15, 16, 18, 27, 29, 33, 56, 59, 68, 71, 78] [3, 4, 15, 16, 19, 20, 29, 35, 36, 37, 39, 40, 45, 62, 64, 68, 72] [1, 3, 9, 22, 25, 32, 46, 47, 49, 57, 59, 67, 70, 72] [5, 6, 20, 22, 25, 33, 34, 42, 44, 49, 51, 53, 64, 65, 68, 76] [2, 7, 12, 17, 19, 21, 25, 39, 40, 46, 48, 58, 67, 71, 76] [3, 5, 9, 10, 24, 26, 35, 38, 48, 52, 55, 56, 66, 69, 73, 76] [0, 4, 19, 20, 22, 23, 24, 28, 38, 40, 42, 43, 50, 69, 74, 77] [2, 3, 6, 7, 12, 14, 28, 30, 31, 34, 40, 41, 48, 52, 55, 56, 75, 77] [10, 12, 16, 17, 19, 27, 28, 36, 42, 44, 51, 55, 61, 72, 76, 78] [8, 10, 14, 16, 31, 36, 41, 43, 45, 57, 61, 65, 66, 74, 77, 78] [4, 8, 11, 13, 14, 15, 18, 24, 29, 37, 38, 51, 52, 59, 60, 62, 66, 74] [3, 7, 11, 16, 29, 32, 35, 41, 46, 47, 56, 61, 64, 66, 70, 71, 74] [0, 7, 8, 11, 17, 18, 21, 23, 24, 31, 33, 49, 56, 58, 63, 72, 74]

H_Z (18 checks, sparse supports)

[8, 15, 20, 26, 32, 34, 57, 58, 69, 71, 75] [0, 1, 5, 6, 19, 34, 36, 39, 45, 46, 49, 64, 68, 70, 71, 73] [2, 12, 15, 27, 29, 31, 34, 36, 44, 53, 54, 56, 68, 73, 75] [2, 6, 13, 14, 16, 25, 28, 29, 42, 48, 51, 52, 54, 60, 67] [5, 8, 10, 18, 26, 33, 37, 40, 44, 46, 50, 53, 56, 59] [0, 2, 4, 17, 18, 22, 26, 27, 46, 54, 55, 60, 65, 66, 67, 69, 72] [2, 9, 11, 15, 18, 21, 24, 29, 33, 40, 55, 65, 66, 71, 72, 75] [19, 21, 35, 41, 43, 44, 49, 51, 58, 61, 65, 67, 73, 74, 77] [3, 4, 10, 11, 13, 17, 18, 22, 30, 32, 49, 51, 52, 54, 55, 65, 71] [2, 5, 7, 8, 12, 15, 18, 24, 31, 34, 35, 46, 47, 48, 59, 61, 67, 74] [7, 9, 19, 25, 28, 30, 31, 35, 45, 48, 51, 57, 61, 62, 70, 73, 75] [0, 11, 13, 18, 22, 23, 34, 35, 39, 43, 50, 55, 57, 63, 71, 74, 78] [12, 17, 18, 22, 24, 34, 39, 40, 47, 49, 63, 64, 72, 73, 77, 78] [3, 7, 9, 16, 17, 27, 35, 36, 37, 43, 45, 60, 62, 63, 64, 65, 73, 74] [4, 24, 25, 31, 38, 45, 48, 49, 50, 59, 62, 65, 68, 69, 70, 74] [3, 14, 15, 16, 28, 34, 36, 42, 45, 46, 49, 54, 57, 60, 61, 62, 63, 76] [1, 4, 5, 8, 10, 13, 28, 47, 50, 55, 56, 57, 58, 62, 64, 71, 72, 77] [0, 1, 6, 11, 20, 24, 31, 41, 42, 48, 51, 52, 55, 65, 67, 68, 78]

Code ID 79-45-3 · download JSON · raw on GitHub