{
  "scope": "Exact exploration of the abstract carry scheduler through the recorded finite traces, seeded random traces, bounded profile identities and eager witnesses. Not a pointer-local realization, undo implementation, scaffold, proof assistant proof or unbounded verification.",
  "exhaustive_forward": {
    "trace_depth": 13,
    "distinct_states": 16487,
    "transitions_checked": 24885,
    "maximum_simultaneous_pending_levels": 2,
    "deepest_pending_level": 3
  },
  "seeded_random_forward": {
    "seed": 20260930,
    "traces": 2000,
    "depth": 120,
    "transitions_checked": 240000,
    "deepest_pending_level": 4
  },
  "profile_identity_instances": 36846,
  "eager_power_of_two_family": [
    {
      "j": 0,
      "old_length": 1,
      "changed_nonconstant_levels": 1
    },
    {
      "j": 1,
      "old_length": 2,
      "changed_nonconstant_levels": 2
    },
    {
      "j": 2,
      "old_length": 4,
      "changed_nonconstant_levels": 3
    },
    {
      "j": 3,
      "old_length": 8,
      "changed_nonconstant_levels": 4
    },
    {
      "j": 4,
      "old_length": 16,
      "changed_nonconstant_levels": 5
    },
    {
      "j": 5,
      "old_length": 32,
      "changed_nonconstant_levels": 6
    },
    {
      "j": 6,
      "old_length": 64,
      "changed_nonconstant_levels": 7
    },
    {
      "j": 7,
      "old_length": 128,
      "changed_nonconstant_levels": 8
    },
    {
      "j": 8,
      "old_length": 256,
      "changed_nonconstant_levels": 9
    },
    {
      "j": 9,
      "old_length": 512,
      "changed_nonconstant_levels": 10
    },
    {
      "j": 10,
      "old_length": 1024,
      "changed_nonconstant_levels": 11
    },
    {
      "j": 11,
      "old_length": 2048,
      "changed_nonconstant_levels": 12
    },
    {
      "j": 12,
      "old_length": 4096,
      "changed_nonconstant_levels": 13
    }
  ],
  "proof_status": "The unbounded eager lower bound and forward deadline lemma are written proofs. Finite checks only corroborate them."
}