{
  "scope": "Finite length-state exploration through four fresh binary concatenations and heap examples n=0..16; not formal verification or an unbounded lower-bound proof.",
  "checker_sha256": "a91ada49329cc255e667a5859129bfc3e1033d0fb4fd2d2458d731c146125131",
  "addition_DAG_checks": [
    {
      "fresh_Cat_budget": 0,
      "distinct_available_length_sets": 1,
      "maximum_length": 1
    },
    {
      "fresh_Cat_budget": 1,
      "distinct_available_length_sets": 2,
      "maximum_length": 2
    },
    {
      "fresh_Cat_budget": 2,
      "distinct_available_length_sets": 4,
      "maximum_length": 4
    },
    {
      "fresh_Cat_budget": 3,
      "distinct_available_length_sets": 10,
      "maximum_length": 8
    },
    {
      "fresh_Cat_budget": 4,
      "distinct_available_length_sets": 35,
      "maximum_length": 16
    }
  ],
  "sharing_control": "Three fresh Cat(x,x) nodes represent b^8 from B; linear copying is not necessary.",
  "extra_old_root_control": "An old b^n raises M to at least n and permits zero-allocation return."
}