← back to the board
[[300,8,13]] d =
n
300
k
8
d
13
kd²/n
4.507
w
6
X/Z
1
g
0.0704
r
4.0
layers
1
swaps
1965

Share this result

Distance

X/Z asymmetry 1 · d_X = 13, d_Z = 13 · w_X = 6, w_Z = 6 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)
d_X 13 · witness weight 13 (claimed upper_bound)
witness found by @dorakingx · gf2_fast RIS ladder (verify/gf2_fast.cpp), both sides searched jointly · found at 2×104 trials · survived 2×107 trials · 2026-09-11
witness operator (support, 13 qubits)
[35, 62, 63, 99, 124, 144, 150, 160, 235, 237, 248, 261, 273]
d_Z 13 · witness weight 13 (claimed upper_bound)
witness found by @dorakingx · gf2_fast RIS in the packaging search; the ladder searched both sides jointly · found at 4000 trials · survived 2×107 trials · 2026-09-11
witness operator (support, 13 qubits)
[117, 124, 126, 135, 143, 146, 269, 276, 277, 281, 290, 294, 297]
certificate exact, d = 13 · CryptoMiniSat 5.14.7 SAT
X: no logical < 13 exists; Z: no logical < 13 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 6 · H_Z 6 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 2–6 (mean 5.17) · H_Z 2–6 (mean 5.234)
qubit degrees H_X 1–3 (mean 2.533) · H_Z 1–3 (mean 2.53)
trapping sets H_X (1,1)×43 (2,0)×8 (3,0)×19 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 43 (1,2): 54 (1,3): 203 (2,0): 8 (2,1): 59 (2,2): 185 (2,3): 277 (2,4): 1188 (3,0): 19 (3,1): 121 (3,2): 504 (3,3): 1477 (3,4): 2485 (3,5): 9362 (3,6): 282 (3,7): 1365
trapping sets H_Z (1,1)×45 (2,0)×11 (3,0)×19 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 45 (1,2): 51 (1,3): 204 (2,0): 11 (2,1): 64 (2,2): 191 (2,3): 268 (2,4): 1191 (3,0): 19 (3,1): 138 (3,2): 500 (3,3): 1527 (3,4): 2407 (3,5): 9429 (3,6): 265 (3,7): 1359
witness diameter X 18.0278 · Z 16.1245 (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 = 4
X checkZ checkqubit site (300)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 1965 nearest-neighbor SWAPs per round in total, at most 8 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 @dorakingx
provenance submitted through the challenge
novelty novelty not audited
construction Open-boundary planar bivariate-bicycle code (Liang, Eberhardt, Chen, arXiv:2504.08887, Sec. II and Table V) with f = x + x2 + y2 and g = 1 + x2 y + x2 y2 on a 13 x 13 grid (research/local2d/planar.py build_open_directional(13, 13), n = 2*132 = 338, k = 8), then reduced to n = 300 by 38 qubit removals of three kinds. (22) Restricted r=1 lattice grafting (Sec. III E): a qubit lying in exactly one stabilizer of some type is removed together with that stabilizer; accepted only if k stayed 8 and a bit-packed RIS search found nothing lighter than 13, screened at 20000 trials with a FIXED seed and then confirmed at a deeper rung, a qubit failing the confirm rung being blacklisted. Those in-loop rungs are a filter, not the evidence -- on other members of this family they let a unit of distance through -- so the claim below rests on the separate fresh-seed ladder. Its upper bound for this code equals the unreduced L = 13 code's own ladder bound, which is consistent with the reduction having lost nothing at this size but does not prove it: both are upper bounds and no lower bound exists for either. (13) Weight-1 stabilizer cleanup, which runs no distance search at all because it needs none (Sec. III D step 4, research/local2d/boundary_engine.py _cleanup): a qubit carrying a weight-1 stabilizer cannot appear in any opposite-type check, so multiplying that row into the same-type rows containing it and deleting the qubit preserves k and the distance exactly; the elimination cascades until no weight-1 or zero-degree qubit is left. (3) Capped merge-graft, a new step, searched at r <= 3: when a qubit lies in exactly r stabilizers of one type, pick a pivot row R_p and replace every other R_i by R_p + R_i. Those are row operations on the stabilizer generators and so change no code, only the generating set, and they leave that qubit in R_p alone, where the r=1 graft above applies; every choice of pivot is tried, since each gives a different resulting code. Each merged row is taken only if it still has weight at most 6 and its support still has maximum pairwise distance at most 4 in the layout below -- exactly the quantity the verifier measures as the interaction radius -- so the weight class and the 2D-local single-layer class are preserved by construction; the resulting graft is then accepted under the same k check and the same screen and confirm rungs, and the whole layout radius is recomputed after every accepted move. The first two moves cannot enlarge a check support -- grafting deletes, and the cleanup XOR removes exactly the one fixed qubit from a row -- while the third genuinely can: the merged row may be heavier and wider than either of the two it replaces. The caps bound that growth rather than forbidding it, and the whole layout is re-measured after every accepted move, which is why the code below still has max check weight 6 and radius exactly 4. SINGLE-LAYER integer layout: a surviving qubit whose index in the unreduced code is q = c*169 + i*13 + j (block c in {0,1}, site (i,j)) sits at (i + j, j - i + c), the unit square lattice rotated 45 degrees with the two blocks on its two sublattices; one qubit per site, minimum spacing exactly 1, maximum check diameter exactly 4. The reduction is a randomised search, so the surviving qubit set is recorded by the coordinates in this file rather than re-derived.
model Claude Claude Opus 5 (Claude Code) (claimed, not verified)
builds on arXiv:2504.08887, arXiv:2308.07915
date 2026-09-11
notes Checked, not equivalent to any board entry: the gate reports no exact duplicate and no WL-equivalent entry. The board entries with n = 300 are [[300,4,27]] (no 2D layout), [[300,60,14]] (no 2D layout); all differ in k or d. It dominates no board entry on all four axes. No board entry has the unreduced size n = 338 at k = 8. The construction and both published reduction moves are from arXiv:2504.08887 (Sec. II, Sec. III D step 4 and Sec. III E; this repository's own research/local2d modules cite Table V of that paper for the family's ungrafted distances and Tables II-IV for its qubit-removal layouts such as [[188,8,9]], which come out of the cleanup rather than the graft), but this parameter set, the capped r=2 merge-graft step and this single-layer layout are not, so novelty is left unknown and literature novelty is unverified.
family bivariate bicycle (a tag, not a ranking)
locality 2D-local single (computed from the layout)
weight class weight ≤ 6 (computed)

How this code was found

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

[[300,8,13]] — reduced single-layer planar bivariate-bicycle code

Direction & hypothesis

Target cell: 2D-local single-layer × weight-6, whose kd²/n leader is my own [[454,8,17]] at 5.093. This code is not a leader — at 4.507 it is fifth — and it dominates nothing. What it does is extend the cell's Pareto frontier **downward in n**: it is the smallest code in that cell with k = 8 and d ≥ 13, where the previous smallest was my [[373,8,15]] at n = 373. Nothing in the cell dominates it.

It is the L = 13 member of the reduction line that produced [[373,8,15]] (#944), [[410,8,16]] (#943), [[454,8,17]] (#935) and [[457,8,17]] (#925), and it is the last one worth filing: this note records why the line stops here.

What was reduced, and how

Base: the open-boundary planar BB family, f = x + x² + y², g = 1 + x²y + x²y², from research/local2d/planar.py (build_open_directional(13, 13)), [[338,8,≤13]]. Reduced to 300 qubits by 38 removals of three kinds, applied to fixpoint:

1. Graft (arXiv:2504.08887 Sec. III E), 22 qubits, 338 → 316. 2. Weight-1 cleanup (Sec. III D step 4, boundary_engine._cleanup), 13 qubits, 316 → 303. Preserves k and d exactly by the CSS argument, so it runs no distance search. 3. Capped merge-graft (mine, introduced with [[454,8,17]]), searched at r ≤ 3 with every pivot choice, 3 qubits, 303 → 300. All three accepted moves were r = 2.

Layout unchanged from the family: a surviving qubit of unreduced index q = c·169 + i·13 + j sits at (i + j, j − i + c). Measured interaction radius exactly 4.0, spacing exactly 1.0, one qubit per site, max check weight 6.

Why this line stops here

Two results settle the construction, and they are the reason this is the last submission from it.

k ≤ 8 is forced, at every check weight. The layout map (i,j,c) → (i+j, j−i+c) scales distances by √2, so an interaction radius of 4 confines every check's support to a diameter-2.83 disc in exponent space. Enumerating every monomial pair inside that constraint — 3+3 (193,200 ordered pairs), 4+4 (11,504), 3+5 (10,988), 5+3 (6,132), and the weight-7 splits — the Newton mixed volume never exceeds 8 and no split reaches k ≥ 10 at all. Since kd²/n = 8d²/n here, the cell reduces to maximising d/L, which this family caps near 1.07.

The polynomial pair is unique up to symmetry. Of those pairs, exactly 22 give a weight-6, radius-4 code once built with the general boundary engine and weight-reduced; the best realised distance slope among them is 1.500, attained by six pairs whose measured efficiencies at L = 8, 10, 12 are identical to this family's. They are its symmetry orbit. A common translation of both supports is a symmetry too, so the search space is exactly what the radius filter covers.

A high *bulk* slope is not enough, which is the interesting part: the transfer graph does find pairs with slope 2.0, but their boundary gauge operators are not truncated bulk stabilizers, so the general engine emits weight-14..26 generators at radius 9..18 and they realise 0.67.

The reduced family

Every distance is a fresh-seed RIS upper bound measured on the *saved* code, never the floor the reduction was driven with:

| L | unreduced | reduced | kd²/n | filed | |---|---|---|---|---| | 13 | [[338,8,≤13]] | [[300,8,≤13]] | 4.507 | here | | 14 | [[392,8,≤15]] | [[373,8,≤15]] | 4.826 | #944 | | 15 | [[450,8,≤16]] | [[410,8,≤16]] | 4.995 | #943 | | 16 | [[512,8,≤17]] | [[454,8,≤17]] | 5.093 | #935 | | 17 | [[578,8,≤18]] | [[537,8,≤17]] | 4.305 | — | | 18 | [[648,8,≤19]] | [[599,8,≤18]] | 4.327 | — |

Rows 17 and 18 are the warning: there the reduction lost a unit of distance against the floor it was driven with, and pushing L = 18 further to n = 551 loses another. That is why every row is re-measured rather than inherited.

Evidence trail

Fresh-seed bit-packed RIS ladder on the final code: **13 @20k → 13 @200k → 13 @1M → 13 @5M → 13 @20M**, seeds 91001, 91138, 91275, 91412 and 995001, no drop at any rung, every rung searching both sides jointly. Both weight-13 witnesses are re-verified by the GF(2) stack. Claim: d ≤ 13, an upper bound.

The ladder goes to 20M because 5M is demonstrably not enough in my work: a k = 10 candidate from a sibling search held its value under three fresh seeds to 5M and then fell at 20M (correction PR #981). All six of my merged entries have since been re-measured to 20M and all held.

Gate verdict (verify/validate_candidate.py): passed; not refuted; no exact duplicate, no WL-equivalent entry.

Caveats:

  • It dominates nothing and is not the cell leader; it extends the frontier at

    • low n only.

  • The claim is a single-layer one. Twelve merged entries dominate it in the

    • unrestricted cell, where it is not on the frontier.

  • Geometric efficiency g = 4kd²/(nρ²r⁴) = 0.0704 (ρ = 1, r = 4).
  • The reduction is a randomised search, not an optimum.

Tools

Claude Opus 5 (Claude Code) as the agent. Construction and cleanup come from the repository itself; the graft and merge-graft driver is mine, because graft_r1 returns (H_X, H_Z, n_removed) — a count, with no map from surviving columns back to original qubit indices, which is what the layout needs. Every RIS search used gf2_fast (make fast); verify/validate_candidate.py was the only gate.

Reproduction

The reduction is a randomised search, so the surviving qubit set is recorded by the coordinates in the submitted JSON rather than re-derived. Rebuild the base with

import sys; sys.path.insert(0, "research/local2d")
from planar import build_open_directional
from boundary_engine import _cleanup
HX, HZ = build_open_directional(13, 13)   # [[338,8,<=13]], k = 8, max check weight 6

then carry orig = list(range(338)) alongside the matrices and repeat until nothing fires: (1) graft — pick a qubit q of column weight 1 in H_X or H_Z, delete that row, that column and that entry of orig, keeping the removal only if compute_k is still 8 and a RIS search finds nothing lighter than 13; (2) cleanup — call _cleanup(HX, HZ) and compose its returned index array into orig; (3) merge-graft — pick a qubit q of column weight r ≤ 3 in one matrix, pick a pivot row R_p among the r rows containing it, replace every other R_i by R_p + R_i, and if every merged row still has weight ≤ 6 and maximum pairwise distance ≤ 4, graft q as in (1) plus a full recomputation of the layout radius. Then measure the result with fresh seeds to 20M — the in-loop rungs are a filter, not evidence.

The layout is (i + j, j - i + c) for each surviving q = c*169 + i*13 + j.

Parity checks

X-checks 147 (max weight 6) · Z-checks 145 (max weight 6)
H_X (147 checks, sparse supports)
[0, 148, 149] [1, 149, 150] [2, 150, 151] [3, 151, 152] [4, 152, 153] [5, 153, 154] [6, 154, 155] [7, 155, 156] [8, 156] [0, 10, 158, 159] [1, 11, 159, 160] [2, 12, 160, 161] [3, 13, 161, 162] [4, 14, 162, 163] [5, 15, 163, 164] [6, 16, 164, 165] [7, 17, 165, 166] [8, 18, 166, 167] [19, 167, 168] [9, 20, 168, 169] [2, 10, 21, 147, 171, 172] [3, 11, 22, 148, 172, 173] [4, 12, 23, 149, 173, 174] [5, 13, 24, 150, 174, 175] [6, 14, 25, 151, 175, 176] [7, 15, 26, 152, 176, 177] [8, 16, 27, 153, 177, 178] [17, 28, 154, 178, 179] [9, 18, 29, 155, 179, 180] [19, 30, 156, 180, 181] [12, 21, 32, 157, 183, 184] [13, 22, 33, 158, 184, 185] [14, 23, 34, 159, 185, 186] [15, 24, 35, 160, 186, 187] [16, 25, 36, 161, 187, 188] [17, 26, 37, 162, 188, 189] [18, 27, 38, 163, 189, 190] [19, 28, 39, 164, 190, 191] [20, 29, 40, 165, 191, 192] [30, 41, 166, 192, 193] [23, 32, 45, 170, 195, 196] [24, 33, 46, 171, 196, 197] [25, 34, 47, 172, 197, 198] [26, 35, 48, 173, 198, 199] [27, 36, 49, 174, 199, 200] [28, 37, 50, 175, 200, 201] [29, 38, 51, 176, 201, 202] [30, 39, 52, 177, 202, 203] [31, 40, 53, 178, 203, 204] [41, 54, 179, 204, 205] [34, 45, 58, 182, 207, 208] [35, 46, 59, 183, 208, 209] [36, 47, 60, 184, 209, 210] [37, 48, 61, 185, 210, 211] [38, 49, 62, 186, 211, 212] [39, 50, 63, 187, 212, 213] [40, 51, 64, 188, 213, 214] [41, 52, 65, 189, 214, 215] [42, 53, 66, 190, 215, 216] [43, 54, 67, 191, 216, 217] [44, 55, 68, 192, 217, 218] [47, 58, 71, 194, 220, 221] [48, 59, 72, 195, 221, 222] [49, 60, 73, 196, 222, 223] [50, 61, 74, 197, 223, 224] [51, 62, 75, 198, 224, 225] [52, 63, 76, 199, 225, 226] [53, 64, 77, 200, 226, 227] [54, 65, 78, 201, 227, 228] [55, 66, 79, 202, 228, 229] [56, 67, 80, 203, 229, 230] [57, 68, 81, 204, 230, 231] [60, 71, 84, 206, 233, 234] [61, 72, 85, 207, 234, 235] [62, 73, 86, 208, 235, 236] [63, 74, 87, 209, 236, 237] [64, 75, 88, 210, 237, 238] [65, 76, 89, 211, 238, 239] [66, 77, 90, 212, 239, 240] [67, 78, 91, 213, 240, 241] [68, 79, 92, 214, 241, 242] [69, 80, 93, 215, 242, 243] [70, 81, 94, 216, 243, 244] [73, 84, 96, 219, 246, 247] [74, 85, 97, 220, 247, 248] [75, 86, 98, 221, 248, 249] [76, 87, 99, 222, 249, 250] [77, 88, 100, 223, 250, 251] [78, 89, 101, 224, 251, 252] [79, 90, 102, 225, 252, 253] [80, 91, 103, 226, 253, 254] [81, 92, 104, 227, 254, 255] [82, 93, 105, 228, 255, 256] [83, 94, 106, 229, 256, 257] [86, 96, 108, 232, 259, 260] [87, 97, 109, 233, 260, 261] [88, 98, 110, 234, 261, 262] [89, 99, 111, 235, 262, 263] [90, 100, 112, 236, 263, 264] [91, 101, 113, 237, 264, 265] [92, 102, 114, 238, 265, 266] [93, 103, 115, 239, 266, 267] [94, 104, 116, 240, 267, 268] [95, 105, 117, 241, 268, 269] [98, 108, 120, 245, 271, 272] [99, 109, 121, 246, 272, 273] [100, 110, 122, 247, 273, 274] [101, 111, 123, 248, 274, 275] [102, 112, 124, 249, 275, 276] [103, 113, 125, 250, 276, 277] [104, 114, 126, 251, 277, 278] [105, 115, 127, 252, 278, 279] [106, 116, 128, 253, 279, 280] [107, 117, 129, 254, 280, 281] [110, 120, 258, 283, 284] [111, 121, 132, 259, 284, 285] [112, 122, 133, 260, 285, 286] [113, 123, 134, 261, 286, 287] [114, 124, 135, 262, 287, 288] [115, 125, 136, 263, 288, 289] [116, 126, 137, 264, 289, 290] [117, 127, 138, 265, 290, 291] [118, 128, 139, 266, 291, 292] [119, 129, 140, 267, 292, 293] [122, 270] [123, 132, 142, 271] [124, 133, 143, 272, 295] [125, 134, 273, 295, 296] [126, 135, 274, 296] [127, 136, 275] [128, 137, 144, 276, 297] [129, 138, 145, 277, 297, 298] [130, 139, 278, 298] [131, 140, 279, 299] [133, 282] [134, 142, 283] [135, 143, 284] [136, 285] [137, 286] [138, 287] [139, 144, 288] [140, 145, 289] [141, 291] [143, 294] [144, 295] [145, 296] [146, 297]
H_Z (145 checks, sparse supports)
[21, 147, 157] [0, 22, 148, 158] [0, 1, 23, 149, 159, 170] [1, 2, 24, 150, 160, 171] [2, 3, 25, 151, 161, 172] [3, 4, 26, 152, 162, 173] [4, 5, 27, 153, 163, 174] [5, 6, 28, 154, 164, 175] [6, 7, 29, 155, 165, 176] [7, 8, 30, 156, 166, 177] [9, 169, 180, 181] [32, 157, 170] [10, 33, 158, 171] [10, 11, 34, 159, 172, 182] [11, 12, 35, 160, 173, 183] [12, 13, 36, 161, 174, 184] [13, 14, 37, 162, 175, 185] [14, 15, 38, 163, 176, 186] [15, 16, 39, 164, 177, 187] [16, 17, 40, 165, 178, 188] [17, 18, 41, 166, 179, 189] [18, 19, 42, 167, 180, 190] [19, 20, 43, 168, 181, 191] [20, 44, 169, 192, 193] [45, 170, 182] [21, 46, 171, 183] [21, 22, 47, 172, 184, 194] [22, 23, 48, 173, 185, 195] [23, 24, 49, 174, 186, 196] [24, 25, 50, 175, 187, 197] [25, 26, 51, 176, 188, 198] [26, 27, 52, 177, 189, 199] [27, 28, 53, 178, 190, 200] [28, 29, 54, 179, 191, 201] [29, 30, 55, 180, 192, 202] [30, 31, 56, 181, 193, 203] [31, 57, 204, 205] [58, 182, 194] [32, 59, 183, 195] [32, 33, 60, 184, 196, 206] [33, 34, 61, 185, 197, 207] [34, 35, 62, 186, 198, 208] [35, 36, 63, 187, 199, 209] [36, 37, 64, 188, 200, 210] [37, 38, 65, 189, 201, 211] [38, 39, 66, 190, 202, 212] [39, 40, 67, 191, 203, 213] [40, 41, 68, 192, 204, 214] [41, 42, 69, 193, 205, 215] [42, 43, 70, 216] [43, 44, 217] [44, 218] [71, 194, 206] [45, 72, 195, 207] [45, 46, 73, 196, 208, 219] [46, 47, 74, 197, 209, 220] [47, 48, 75, 198, 210, 221] [48, 49, 76, 199, 211, 222] [49, 50, 77, 200, 212, 223] [50, 51, 78, 201, 213, 224] [51, 52, 79, 202, 214, 225] [52, 53, 80, 203, 215, 226] [53, 54, 81, 204, 216, 227] [54, 55, 82, 205, 217, 228] [55, 56, 83, 218, 229] [56, 57, 230] [57, 231] [84, 206, 219] [58, 85, 207, 220] [58, 59, 86, 208, 221, 232] [59, 60, 87, 209, 222, 233] [60, 61, 88, 210, 223, 234] [61, 62, 89, 211, 224, 235] [62, 63, 90, 212, 225, 236] [63, 64, 91, 213, 226, 237] [64, 65, 92, 214, 227, 238] [65, 66, 93, 215, 228, 239] [66, 67, 94, 216, 229, 240] [67, 68, 95, 217, 230, 241] [68, 69, 218, 231, 242] [69, 70, 243] [70, 244] [96, 219, 232] [71, 97, 220, 233] [71, 72, 98, 221, 234, 245] [72, 73, 99, 222, 235, 246] [73, 74, 100, 223, 236, 247] [74, 75, 101, 224, 237, 248] [75, 76, 102, 225, 238, 249] [76, 77, 103, 226, 239, 250] [77, 78, 104, 227, 240, 251] [78, 79, 105, 228, 241, 252] [79, 80, 106, 229, 242, 253] [80, 81, 107, 230, 243, 254] [81, 82, 231, 244, 255] [82, 83, 256] [83, 257] [108, 232, 245] [84, 109, 233, 246] [84, 85, 110, 234, 247, 258] [85, 86, 111, 235, 248, 259] [86, 87, 112, 236, 249, 260] [87, 88, 113, 237, 250, 261] [88, 89, 114, 238, 251, 262] [89, 90, 115, 239, 252, 263] [90, 91, 116, 240, 253, 264] [91, 92, 117, 241, 254, 265] [92, 93, 118, 242, 255, 266] [93, 94, 119, 243, 256, 267] [94, 95, 244, 257, 268] [95, 269] [120, 245, 258] [96, 121, 246, 259] [96, 97, 122, 247, 260, 270] [97, 98, 123, 248, 261, 271] [98, 99, 124, 249, 262, 272] [99, 100, 125, 250, 263, 273] [100, 101, 126, 251, 264, 274] [101, 102, 127, 252, 265, 275] [102, 103, 128, 253, 266, 276] [103, 104, 129, 254, 267, 277] [104, 105, 130, 255, 268, 278] [105, 106, 131, 256, 269, 279] [106, 107, 257, 280] [107, 281] [108, 132, 259, 271] [108, 109, 133, 260, 272, 282] [109, 110, 134, 261, 273, 283] [110, 111, 135, 262, 274, 284] [111, 112, 136, 263, 275, 285] [112, 113, 137, 264, 276, 286] [113, 114, 138, 265, 277, 287] [114, 115, 139, 266, 278, 288] [115, 116, 140, 267, 279, 289] [116, 117, 268, 280, 290] [117, 118, 141, 269, 281, 291] [118, 119, 292] [119, 293] [120, 142, 271, 283] [120, 121, 143, 272, 284, 294] [124, 125, 144, 276, 288, 295] [125, 126, 145, 277, 289, 296] [128, 129, 146, 280, 292, 297] [129, 130, 281, 293, 298] [131, 299]
Code ID 300-8-13 · download JSON · raw on GitHub