{
 "what": "The einstein-arena pool of the hundred pre-registered machine claims (corpus/machine-claims-100.json, registered 2026-10-02 before any was decided), WAVE 1: the 10 rows a decider already existed for, decided by tools/run-mc100-einstein.js from the platform's bests of 2026-10-02 (corpus/einstein-arena), every number read as the decimal literal the file carries. The other 19 rows are listed in `undecided` with what they need; nothing is dropped. The claimant's code — and the platform's verifier — is never run; the definitions are read from the problem statements and the published verifiers: the Together repository's notebook (corpus/easota) and the platform's own sources, pinned with their dates in corpus/sources/easota-platform.",
 "pool": "einstein-arena",
 "wave": 1,
 "manifest": "corpus/machine-claims-100.json",
 "registered": "2026-10-02",
 "deciders": {
  "kissing": "instruments/kissing/kissing.js (certify; imported unchanged) + the full pass in this tool (every pair, the worst exactly, the penalty enclosed)",
  "easota": "instruments/easota/decide.js (overlap, autocorr, mindist, flat, edges, circles)"
 },
 "rules": {
  "certified": "every constraint holds exactly and the exact objective (or its rigorous enclosure) agrees with the printed score within the platform's resolution: its minImprovement when nonzero, else 1e-12 relative; printedSide records where the printed double falls",
  "repaired": "a constraint holds only up to a numerical tolerance or a normalisation, not exactly (whose, and since when, is named in the row from corpus/sources/easota-platform: the platform's overlap verifier rescales Σh to n/2 with no tolerance; the 1e-6 is the Together repository notebook's); the as-published value is compared with the printed score and an exact witness from the same bytes is certified next to it (kind tolerance-witness)",
  "refuted": "a printed score the exact value does not reproduce (kind not-from-the-published-data)",
  "openKissingRungs": "for a penalty-scored kissing rung, feasible = n nonzero vectors in R^d (what the platform scores); the score is Σ max(0, 2 − |c_i − c_j|) over pairs, c_i = 2x_i/|x_i| — inferred, and reproduced to every printed digit for all four kissing rows; a score above 0 is the platform's own statement that the object is not a kissing configuration, and the decision of that, pair by pair, is the row's content"
 },
 "literalReading": {
  "literals": 191965,
  "notShortestForm": 0
 },
 "rows": [
  {
   "id": "ea-best-erdos-min-overlap",
   "pool": "einstein-arena",
   "claimant": "CodexProLong (EinsteinArena, solution 2507, 2026-08-15)",
   "claim": "the object is a feasible solution of \"Erdős Minimum Overlap (Upper Bound)\" and the platform's score of it is 0.3808585748578584 (minimize)",
   "source": "corpus/einstein-arena/best-1.json",
   "sha256": "0c4c744e6ae714b488e931cb647dd6d47552c5dc7a131b2d5286742e7e8df2e6",
   "problem": "Erdős Minimum Overlap (Upper Bound)",
   "solution": 2507,
   "agent": "CodexProLong",
   "scoring": "minimize",
   "minImprovement": 1e-7,
   "verdict": "REPAIRED",
   "kind": "tolerance-witness",
   "scope": "as published, Σh − n/2 = 0.000000000000192824623888, not 0; the platform's verifier has no tolerance on the sum — in every public version (corpus/sources/easota-platform/erdos-min-overlap_9cd6fbfb.ts) it rescales h to Σh = n/2 in float64 before scoring, the repair below in floating point — and the 1e-6 is the Together repository notebook's np.isclose (corpus/easota), not the platform's. The printed 0.3808585748578584 agrees with the as-published bound 0.38085857485785828368… (above); the exact witness built from the same bytes (h scaled down to Σh = n/2) certifies C5 ≤ 0.38085857485785830932…, 0.000000000000000025639955 from the as-published value — at or below the printed 0.3808585748578584, so the printed upper bound itself is proved by the repaired witness",
   "decision": {
    "steps": 3584,
    "inRange": true,
    "sumMinusHalfN": "0.000000000000192824623888",
    "bound": "0.38085857485785828368",
    "lag": -192,
    "printedScore": "0.3808585748578584",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000000116311242",
     "tolerance": "0.0000001",
     "printedSide": "above",
     "rule": "the platform's minImprovement 1e-7"
    },
    "repair": {
     "how": "h scaled down to Σh = n/2",
     "bound": "0.38085857485785830932",
     "delta": "0.000000000000000025639955",
     "printedBoundProvedByRepair": true
    }
   },
   "ms": 890.3
  },
  {
   "id": "ea-best-first-autocorrelation-inequality",
   "pool": "einstein-arena",
   "claimant": "CodexProLong (EinsteinArena, solution 2504, 2026-08-14)",
   "claim": "the object is a feasible solution of \"First Autocorrelation Inequality (Upper Bound)\" and the platform's score of it is 1.5027436492326165 (minimize)",
   "source": "corpus/einstein-arena/best-2.json",
   "sha256": "50abacd697b1545a4c4723a66f164a445539472c7a7c33533685519f5313cd9e",
   "problem": "First Autocorrelation Inequality (Upper Bound)",
   "solution": 2504,
   "agent": "CodexProLong",
   "scoring": "minimize",
   "minImprovement": 1e-8,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "f ≥ 0 at all 65536 values, exactly: C1 ≤ 1.50274364923261637372… exactly (the maximum of the autoconvolution decided at 16684 candidate indexes the float screen could not separate; the printed 1.5027436492326165 agrees, above)",
   "decision": {
    "n": 65536,
    "C1": "1.50274364923261637372",
    "argmax": 24997,
    "floatArgmax": 24997,
    "candidatesDecidedExactly": 16684,
    "screenErrorBound": 5.820766091346741e-11,
    "printedScore": "1.5027436492326165",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000000126271352",
     "tolerance": "0.00000001",
     "printedSide": "above",
     "rule": "the platform's minImprovement 1e-8"
    }
   },
   "ms": 24410.9
  },
  {
   "id": "ea-best-min-distance-ratio-2d",
   "pool": "einstein-arena",
   "claimant": "Together-AI (EinsteinArena, solution 14, 2026-03-19)",
   "claim": "the object is a feasible solution of \"Minimizing Max/Min Distance Ratio (2D, n=16)\" and the platform's score of it is 12.889229907717521 (minimize)",
   "source": "corpus/einstein-arena/best-5.json",
   "sha256": "3954bce1147e175701bb56560b1795c08f7f711c7055aa17394a52489002bbed",
   "problem": "Minimizing Max/Min Distance Ratio (2D, n=16)",
   "solution": 14,
   "agent": "Together-AI",
   "scoring": "minimize",
   "minImprovement": 1e-7,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "16 distinct points: (max d / min d)² = 12.88922990771751730500… exactly (the printed 12.889229907717521 agrees, above) — the same object, number for number, as corpus/easota/min-distance-ratio-2d/ours_2026.json (the platform's repository copy), decided in the register as ea-mindist-ours_2026; counted there, once",
   "decision": {
    "n": 16,
    "ratioSquared": "12.88922990771751730500",
    "minPair": [
     5,
     7
    ],
    "maxPair": [
     2,
     15
    ],
    "printedScore": "12.889229907717521",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000003694992313",
     "tolerance": "0.0000001",
     "printedSide": "above",
     "rule": "the platform's minImprovement 1e-7"
    }
   },
   "ms": 3.7,
   "sameClaimAs": "ea-mindist-ours_2026"
  },
  {
   "id": "ea-best-kissing-number-d11",
   "pool": "einstein-arena",
   "claimant": "KawaiiCorgi (EinsteinArena, solution 1492, 2026-04-10)",
   "claim": "the object is a feasible solution of \"Kissing Number in Dimension 11 (n=594)\" and the platform's score of it is 0 (minimize)",
   "source": "corpus/einstein-arena/best-6.json",
   "sha256": "4ff52e989f3ef0b9c3f3d97ef078c6201eb4fda73eecc1bb09163094b43f27c0",
   "problem": "Kissing Number in Dimension 11 (n=594)",
   "solution": 1492,
   "agent": "KawaiiCorgi",
   "scoring": "minimize",
   "minImprovement": 0,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "a kissing configuration of 594 in R^11: every one of the 176,121 pairs at an angle of at least 60°, decided exactly in Q (17,088 exact contacts); the platform's score 0 is its exact penalty, 0 — the same object (solution #1492, the same 594 vectors literal for literal) the register decided 2026-09-07 as kiss-ea-594-winner; counted there, once",
   "decision": {
    "kissing": true,
    "n": 594,
    "dim": 11,
    "pairs": 176121,
    "violations": 0,
    "contacts": 17088,
    "coincident": 0,
    "penaltyEnclosure": [
     "0.000000000000000000000000000000",
     "0.000000000000000000000000000000"
    ],
    "printedScore": "0",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000000000000000",
     "tolerance": "0.000000000001",
     "printedSide": "inside",
     "rule": "1e-12 relative (minImprovement 0)"
    },
    "worst": null
   },
   "ms": 133.7,
   "sameClaimAs": "kiss-ea-594-winner"
  },
  {
   "id": "ea-best-flat-polynomials",
   "pool": "einstein-arena",
   "claimant": "white (EinsteinArena, solution 2475, 2026-08-10)",
   "claim": "the object is a feasible solution of \"Flat Polynomials (degree 69)\" and the platform's score of it is 1.2807274949642549 (minimize)",
   "source": "corpus/einstein-arena/best-12.json",
   "sha256": "772b895b2cb8b9511dc0b57f1508aeb7b66ce480b2a633bfe04140cd956793d2",
   "problem": "Flat Polynomials (degree 69)",
   "solution": 2475,
   "agent": "white",
   "scoring": "minimize",
   "minImprovement": 0.000001,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "70 coefficients ±1: C⁺ = max_{|z|=1}|g(z)|/√71 ∈ [1.28072749505304782858, 1.28072749505304790673], the supremum certified (the platform's 10⁶-point grid value 1.2807274949642549 is below it, within the platform's resolution)",
   "decision": {
    "N": 70,
    "CplusEnclosure": [
     "1.28072749505304782858",
     "1.28072749505304790673"
    ],
    "method": "chebyshev reduction → sturm isolation (grid+sturm-total) → interval-newton/bisection refinement → exact taylor value enclosures, outward-rounded",
    "printedScore": "1.2807274949642549",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000088792928580000",
     "tolerance": "0.000001",
     "printedSide": "below",
     "rule": "the platform's minImprovement 0.000001"
    },
    "note": "the platform evaluates |g| on 10^6 grid points — a lower bound of the supremum the definition names; the enclosure is the supremum itself (instruments/trigmin)"
   },
   "ms": 618.6
  },
  {
   "id": "ea-best-edges-vs-triangles",
   "pool": "einstein-arena",
   "claimant": "CHRONOS (EinsteinArena, solution 2367, 2026-06-27)",
   "claim": "the object is a feasible solution of \"Edges vs Triangles (Minimal Triangle Density)\" and the platform's score of it is -0.7117091757692579 (maximize)",
   "source": "corpus/einstein-arena/best-13.json",
   "sha256": "91be01ed42c02f5123af1c0c44831ad6c0dc2f030cf894feff2c46e6ed01aa7a",
   "problem": "Edges vs Triangles (Minimal Triangle Density)",
   "solution": 2367,
   "agent": "CHRONOS",
   "scoring": "maximize",
   "minImprovement": 0.000001,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "500 rows of 20 weights: the platform's envelope score −(area + 10·max gap) = -0.71170917576925610657… exactly (the printed -0.7117091757692579 agrees, below)",
   "decision": {
    "rows": 500,
    "distinctRho": 500,
    "negativeWeights": 0,
    "area": "0.21170917576925526855",
    "maxGap": "0.05000000000000008380",
    "score": "-0.71170917576925610657",
    "narrowSegmentsSkippedByPlatform": 0,
    "printedScore": "-0.7117091757692579",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000001793425133",
     "tolerance": "0.000001",
     "printedSide": "below",
     "rule": "the platform's minImprovement 0.000001"
    }
   },
   "ms": 47231.5
  },
  {
   "id": "ea-best-circles-rectangle",
   "pool": "einstein-arena",
   "claimant": "ExoMind-TTS (EinsteinArena, solution 2544, 2026-08-30)",
   "claim": "the object is a feasible solution of \"Circles in a Rectangle (n = 21)\" and the platform's score of it is 2.3658323759098576 (maximize)",
   "source": "corpus/einstein-arena/best-18.json",
   "sha256": "b38b661088eda8a1814771a780025dce3308cd9ff8b14c420068aedba09ef7e6",
   "problem": "Circles in a Rectangle (n = 21)",
   "solution": 2544,
   "agent": "ExoMind-TTS",
   "scoring": "maximize",
   "minImprovement": 1e-10,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "21 circles, no two overlapping and the bounding box at w + h ≤ 2, exactly: Σr = 2.36583237590985849000… (the printed 2.3658323759098576 agrees, below)",
   "decision": {
    "n": 21,
    "sumR": "2.36583237590985849000",
    "boxSlack": "0.000000000000690280000000",
    "overlappingPairs": 0,
    "worstPair": [
     10,
     20
    ],
    "worstPairSlackSquared": "0.000000000000000008239760",
    "printedScore": "2.3658323759098576",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000000890000000",
     "tolerance": "0.0000000001",
     "printedSide": "below",
     "rule": "the platform's minImprovement 1e-10"
    },
    "repair": null
   },
   "ms": 10.5
  },
  {
   "id": "ea-best-kissing-number-d12",
   "pool": "einstein-arena",
   "claimant": "CHRONOS (EinsteinArena, solution 2081, 2026-04-23)",
   "claim": "the object is a feasible solution of \"Kissing Number in Dimension 12 (n=841)\" and the platform's score of it is 2 (minimize)",
   "source": "corpus/einstein-arena/best-22.json",
   "sha256": "5d9d2124947a496e0581d344e738c4f4899c85bf036cbe151a4ce4ff5e8fe66f",
   "problem": "Kissing Number in Dimension 12 (n=841)",
   "solution": 2081,
   "agent": "CHRONOS",
   "scoring": "minimize",
   "minImprovement": 0,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "NOT a kissing configuration of 841: 1 pair (0 & 840) point in the same direction (cos = 1 exactly) and every other pair is at 60° or more, exactly — 840 distinct directions form a kissing configuration (40,992 exact contacts); the platform's score 2 is exactly the penalty of the repeat (2 per repeated pair)",
   "decision": {
    "kissing": false,
    "n": 841,
    "dim": 12,
    "pairs": 353220,
    "violations": 1,
    "contacts": 41128,
    "coincident": 1,
    "penaltyEnclosure": [
     "2.000000000000000000000000000000",
     "2.000000000000000000000000000000"
    ],
    "printedScore": "2",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000000000000000",
     "tolerance": "0.000000000002",
     "printedSide": "inside",
     "rule": "1e-12 relative (minImprovement 0)"
    },
    "worst": {
     "i": 0,
     "j": 840,
     "cos2Exact": "1/1",
     "cos2MinusQuarterExact": "3/4",
     "cosEnclosure": [
      "1.000000000000000000000000000000",
      "1.000000000000000000000000000000"
     ],
     "innerProductExcessEnclosure": [
      "0.500000000000000000000000000000",
      "0.500000000000000000000000000000"
     ],
     "angleDegApprox": 0,
     "angleDeficitDegApprox": 60,
     "cos2ExactShort": "1/1"
    },
    "withoutRepeats": {
     "dropped": [
      840
     ],
     "n": 840,
     "verdict": "CERTIFIED",
     "contacts": 40992
    }
   },
   "ms": 183.1
  },
  {
   "id": "ea-best-kissing-number-d11-605",
   "pool": "einstein-arena",
   "claimant": "ExoMind-TTS (EinsteinArena, solution 2560, 2026-09-05)",
   "claim": "the object is a feasible solution of \"Kissing Number in Dimension 11 (n=605)\" and the platform's score of it is 1.7102381876301676 (minimize)",
   "source": "corpus/einstein-arena/best-24.json",
   "sha256": "1bc113d0235788eaf7ec9951abe770b9c062bdcf6a2c2b49ae583f4096dad6ce",
   "problem": "Kissing Number in Dimension 11 (n=605)",
   "solution": 2560,
   "agent": "ExoMind-TTS",
   "scoring": "minimize",
   "minImprovement": 0,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "NOT a kissing configuration of 605 (as the platform's score itself says): 9,510 of 182,710 pairs are closer than 60°, decided exactly; the worst, vectors 601 and 604, has cos²θ = 1/4 + δ with δ = an exact rational (in the ledger), cos θ − 1/2 ∈ [0.26329908059535543918, 0.26329908059535543919] (θ ≈ 40.2441°, 19.7559° short of 60°); the platform's score 1.7102381876301676 is the overlap penalty Σ max(0, 2 − |c_i − c_j|), enclosed here in [1.71023818763016759486, 1.71023818763016759487]",
   "decision": {
    "kissing": false,
    "n": 605,
    "dim": 11,
    "pairs": 182710,
    "violations": 9510,
    "contacts": 0,
    "coincident": 0,
    "penaltyEnclosure": [
     "1.710238187630167594863255852706",
     "1.710238187630167594863255852706"
    ],
    "printedScore": "1.7102381876301676",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000000005136744",
     "tolerance": "0.00000000000171023818763",
     "printedSide": "above",
     "rule": "1e-12 relative (minImprovement 0)"
    },
    "worst": {
     "i": 601,
     "j": 604,
     "cos2Exact": "23305019457508596920321430457446419051299578213883170544138876317137929/40000000000000000318943705771862447137754700327997521738029696506035701",
     "cos2MinusQuarterExact": "53220077830034387362342016057923229067443612527535160438525808762516015/160000000000000001275774823087449788551018801311990086952118786024142804",
     "cosEnclosure": [
      "0.763299080595355439186412598209",
      "0.763299080595355439186412598210"
     ],
     "innerProductExcessEnclosure": [
      "0.263299080595355439186412598209",
      "0.263299080595355439186412598210"
     ],
     "angleDegApprox": 40.24409285062194,
     "angleDeficitDegApprox": 19.75590714937806,
     "cos2ExactShort": "233050194575085969203214304574464190512995782138831705441388…(143 chars)"
    }
   },
   "ms": 174
  },
  {
   "id": "ea-best-kissing-number-d12-842",
   "pool": "einstein-arena",
   "claimant": "ExoMind-TTS (EinsteinArena, solution 2561, 2026-09-05)",
   "claim": "the object is a feasible solution of \"Kissing Number in Dimension 12 (n=842)\" and the platform's score of it is 0.5469062458557645 (minimize)",
   "source": "corpus/einstein-arena/best-25.json",
   "sha256": "0a58d04ac86fcea33f5fafe0f618e18ef5ebd38d7d9f8cbe6d0159b6e7aca7b9",
   "problem": "Kissing Number in Dimension 12 (n=842)",
   "solution": 2561,
   "agent": "ExoMind-TTS",
   "scoring": "minimize",
   "minImprovement": 0,
   "verdict": "CERTIFIED",
   "kind": "none",
   "scope": "NOT a kissing configuration of 842 (as the platform's score itself says): 237 of 354,061 pairs are closer than 60°, decided exactly; the worst, vectors 510 and 547, has cos²θ = 1/4 + δ with δ = an exact rational (in the ledger), cos θ − 1/2 ∈ [0.04327239768587444034, 0.04327239768587444035] (θ ≈ 57.0933°, 2.9067° short of 60°); the platform's score 0.5469062458557645 is the overlap penalty Σ max(0, 2 − |c_i − c_j|), enclosed here in [0.54690624585576453779, 0.54690624585576453780]",
   "decision": {
    "kissing": false,
    "n": 842,
    "dim": 12,
    "pairs": 354061,
    "violations": 237,
    "contacts": 0,
    "coincident": 0,
    "penaltyEnclosure": [
     "0.546906245855764537798315422861",
     "0.546906245855764537798315422861"
    ],
    "printedScore": "0.5469062458557645",
    "agreement": {
     "agrees": true,
     "distance": "0.000000000000000037798315",
     "tolerance": "0.000000000001",
     "printedSide": "below",
     "rule": "1e-12 relative (minImprovement 0)"
    },
    "worst": {
     "i": 510,
     "j": 547,
     "cos2Exact": "118057959234943597540108180552366082799050943659949033572101489392561783489/400000000000000110976196723583575915637858027042868831114878623469166620710",
     "cos2MinusQuarterExact": "36115918469887139592117999312944207779172873798463651586763667050540256623/800000000000000221952393447167151831275716054085737662229757246938333241420",
     "cosEnclosure": [
      "0.543272397685874440345163554481",
      "0.543272397685874440345163554482"
     ],
     "innerProductExcessEnclosure": [
      "0.043272397685874440345163554481",
      "0.043272397685874440345163554482"
     ],
     "angleDegApprox": 57.0933157803056,
     "angleDeficitDegApprox": 2.906684219694398,
     "cos2ExactShort": "118057959234943597540108180552366082799050943659949033572101…(151 chars)"
    }
   },
   "ms": 207.1
  }
 ],
 "count": 10,
 "byVerdict": {
  "REPAIRED": 1,
  "CERTIFIED": 9
 },
 "byKind": {
  "tolerance-witness": 1,
  "none": 9
 },
 "undecided": [
  {
   "id": "ea-best-second-autocorrelation-inequality",
   "problem": "Second Autocorrelation Inequality (Lower Bound)",
   "needs": "a new exact scorer (the second autocorrelation ratio over 1,999,999 values)"
  },
  {
   "id": "ea-best-third-autocorrelation-inequality",
   "problem": "Third Autocorrelation Inequality (Upper Bound)",
   "needs": "a new exact scorer (signed f; the third autocorrelation ratio)"
  },
  {
   "id": "ea-best-prime-number-theorem",
   "problem": "The Prime Number Theorem",
   "needs": "not decidable as stated: the platform scores it by Monte Carlo sampling (the easota ledger's undecided row); a sampled score is not a claim about the construction"
  },
  {
   "id": "ea-best-uncertainty-principle",
   "problem": "Uncertainty Principle (Upper Bound)",
   "needs": "a new decider (Laguerre double roots and the sign pattern, exact)"
  },
  {
   "id": "ea-best-thomson-problem",
   "problem": "Thomson Problem (n = 282)",
   "needs": "a new decider (an energy enclosure; the claim is a value, not an optimum)"
  },
  {
   "id": "ea-best-tammes-problem",
   "problem": "Tammes Problem (n = 50)",
   "needs": "a new decider (the minimum angle of 50 points on S², exactly)"
  },
  {
   "id": "ea-best-circle-packing",
   "problem": "Circle Packing in a Square",
   "needs": "a new decider (circles in the unit square; easota decides the rectangle-of-perimeter-4 variant only)"
  },
  {
   "id": "ea-best-heilbronn-triangles",
   "problem": "Heilbronn Problem for Triangles (n = 11)",
   "needs": "a new decider (points in the equilateral triangle; Q(√3) arithmetic) — easota decides the convex-region variant only"
  },
  {
   "id": "ea-best-difference-bases",
   "problem": "Difference Bases",
   "needs": "a new finite exact check"
  },
  {
   "id": "ea-best-kakeya-needle-128",
   "problem": "Discretized Kakeya Needle (n = 128)",
   "needs": "a new exact scorer"
  },
  {
   "id": "ea-best-hadamard-det-51",
   "problem": "Hadamard Maximal Determinant (order 51)",
   "needs": "a new finite exact check (an integer determinant)"
  },
  {
   "id": "ea-best-sorting-network-16",
   "problem": "Sorting Network (16 inputs)",
   "needs": "a new finite exact check (the 0-1 principle)"
  },
  {
   "id": "ea-best-shannon-capacity-c7-5",
   "problem": "Shannon Capacity of the 7-Cycle (Fifth Power)",
   "needs": "a new finite exact check (an independent set in C7^⊠5)"
  },
  {
   "id": "ea-best-ring-loading-15",
   "problem": "Ring Loading Problem (15 pairs)",
   "needs": "a new finite exact check"
  },
  {
   "id": "ea-best-spencer-discrepancy",
   "problem": "Spencer Discrepancy Constant",
   "needs": "a new finite exact check"
  },
  {
   "id": "ea-best-sidon-45-set",
   "problem": "Sidon Subsets of (4,5)-Sets",
   "needs": "a new finite exact check"
  },
  {
   "id": "ea-best-no-three-in-line-75",
   "problem": "No-Three-in-Line (75 × 75 grid)",
   "needs": "a new finite exact check"
  },
  {
   "id": "ea-best-two-deletion-code-16",
   "problem": "Two-Deletion-Correcting Code (length 16)",
   "needs": "a new finite exact check"
  },
  {
   "id": "ea-best-snake-in-the-box-13",
   "problem": "Snake-in-the-Box (13-dimensional hypercube)",
   "needs": "a new finite exact check"
  }
 ],
 "timing": {
  "runMs": 74185.3,
  "rowMsTotal": 73863.4
 },
 "generated": "2026-10-06T03:36:58.398Z",
 "git": "a310e6e",
 "node": "v24.14.1"
}