{
  "profile": "leetcode-python-byte256-v1",
  "profile_sha256": "015bfdf2865c4957cf63911fae7540992653ce95fda36fd93b1f2cd6d46c0fd0",
  "codebook_sha256": "bd665930e48d502fa89b245b5992f0ed43087df94569b6e1368e30cefb88326c",
  "entries": 256,
  "presses_per_entry": 8,
  "ascii_ids": [
    0,
    127
  ],
  "shortcut_ids": [
    128,
    250
  ],
  "command_ids": [
    251,
    255
  ],
  "escape_entries": 0,
  "scores": {
    "train": {
      "files": 1831,
      "ascii_presses": 6261059,
      "fixed8_presses": 3415344,
      "saving_fraction": 0.45451017152210194
    },
    "development": {
      "files": 466,
      "ascii_presses": 1570219,
      "fixed8_presses": 859040,
      "saving_fraction": 0.4529170771720378
    }
  },
  "source_rows_sha256": "d6fe6af554cbd17fbb54b2d3a850cce1c8c4509e69e98e91be7f306d9d986c1a",
  "source_receipt_sha256": "ae0a04d449965c8f3fd9ad97a8b9c74f8a5edb60ac6bc46a5f8ae2e0e4f43bdf",
  "script_sha256": "2c7c64728c715513a4a125cf0de797ec3a624b23092b7b5251eb5e0b10e184de",
  "method": "123 frequency-times-length shortcuts recurring in at least three training families; fixed eight-bit IDs; exact minimum-token segmentation for cost",
  "limits": "Reuses previously explored reference splits, not fresh confirmation. Ideal error-free encoding only; no human productivity, global vocabulary optimum, or solving correctness claim.",
  "source": {
    "profile": "leetcode-python-lexical122-v2",
    "profile_sha256": "c5ee7a392b7ca203bb59af755a1dee102e047ccf93b974c8c7a63d1531252bbb",
    "scores": {
      "train": {
        "files": 1831,
        "ascii_presses": 6261059,
        "huffman_presses": 2442441,
        "saving_fraction": 0.6098996990764661
      },
      "development": {
        "files": 466,
        "ascii_presses": 1570219,
        "huffman_presses": 610787,
        "saving_fraction": 0.6110179535466072
      }
    },
    "confirmation_sha256": "cada7afcf03ce947141312a11308681cacca12c1406d70055a86a81cf349585c",
    "source_rows_sha256": "bb13a14614ab3e5274fb69cce85ee8eda83538a3ee6f96aac6a34ff1a8a3e2b9",
    "script_sha256": "ad2a46ef5eb9a05459adc08dc5ac4802aced57f189285bf2d41fdf3027dfd248",
    "method": "122 frequency-times-length shortcuts; six training-only DP/refit iterations; minimum training cost chosen",
    "limits": "Error-free optimal segmentation for this fixed codebook only; no measured human effort or global optimum. Development is not protected solver confirmation.",
    "policy": "Existing research exclusions plus reserved/recognition sibling families; ASCII validated reference text only; no hidden outputs."
  }
}