[
  {
    "id": "SF-B17-LADDER",
    "manuscript": "Appendix J lines 62-87 and research/coupled_lab.py:disk_majorant",
    "component": "Exact first-small trace, terminal power identity, budget equivalence, fold/fuel equality and adequate-budget existence.",
    "status": "kernel_checked",
    "targets": [
      "ladder_terminal",
      "ladder_terminal_small",
      "ladder_adequate",
      "ladder_fold_eq",
      "build_ladder_ok",
      "build_ladder_of_trace",
      "build_ladder_ok_iff",
      "build_ladder_not_bits",
      "build_ladder_exists_of_adequate"
    ],
    "hypotheses": "Q,R rational; trace stops strictly below 1 and records radii >=1. No contraction needed for trace identities.",
    "boundary": "Exact Lean algorithm specification; no Python interpreter/Fraction/stdlib/dictionary refinement is asserted."
  },
  {
    "id": "SF-B17-FOLD",
    "manuscript": "Appendix J lines 62-87 and research/coupled_lab.py:disk_majorant",
    "component": "Reverse fold with a Boolean size predicate: exact successful value and bit-failure characterization.",
    "status": "kernel_checked",
    "targets": [
      "guarded_fold_not_steps",
      "guarded_fold_ok_iff",
      "guarded_fold_bits_iff"
    ],
    "hypotheses": "Size check follows every update; seed and empty ladder are unchecked.",
    "boundary": "Exact Lean algorithm specification; no Python interpreter/Fraction/stdlib/dictionary refinement is asserted."
  },
  {
    "id": "SF-B17-CORE",
    "manuscript": "Appendix J lines 62-87 and research/coupled_lab.py:disk_majorant",
    "component": "Successful guarded majorants refine the fuel certificate, with explicit resource failures and actual complex/real bounds.",
    "status": "kernel_checked",
    "targets": [
      "guarded_majorant_success",
      "guarded_majorant_small",
      "guarded_majorant_zero",
      "guarded_majorant_no_steps",
      "guarded_majorant_disk_bound",
      "guarded_majorant_endpoint_enclosure",
      "guarded_majorant_step_failure",
      "guarded_majorant_bit_failure"
    ],
    "hypotheses": "Analytic consequences require strict positive contractions, R>=0 and S>x>=0. A success hypothesis is mandatory.",
    "boundary": "Exact Lean algorithm specification; no Python interpreter/Fraction/stdlib/dictionary refinement is asserted."
  },
  {
    "id": "SF-B17-SIZE",
    "manuscript": "Appendix J lines 62-87 and research/coupled_lab.py:disk_majorant",
    "component": "Exact rational binary-width guard.",
    "status": "kernel_checked",
    "targets": [
      "size_fits_iff"
    ],
    "hypotheses": "Width is zero at integer zero and otherwise log2(n)+1. Numerator absolute value and positive denominator are measured.",
    "boundary": "Exact Lean algorithm specification; no Python interpreter/Fraction/stdlib/dictionary refinement is asserted."
  },
  {
    "id": "SF-B17-VALIDATION",
    "manuscript": "Appendix J lines 62-87 and research/coupled_lab.py:disk_majorant",
    "component": "Abstract input-validation order and checked endpoint interface.",
    "status": "kernel_checked",
    "targets": [
      "checked_invalid_scales",
      "checked_negative_radius",
      "checked_zero_before_resources",
      "checked_invalid_steps",
      "checked_invalid_bits",
      "checked_valid_inputs",
      "checked_small_seed_unchecked",
      "checked_success_core",
      "checked_endpoint_enclosure"
    ],
    "hypotheses": "Rational inputs; None tags invalid nonnegative-integer resources. Zero radius bypasses resource validation after scales/radius checks. Runtime Python type classification remains open.",
    "boundary": "Exact Lean algorithm specification; no Python interpreter/Fraction/stdlib/dictionary refinement is asserted."
  }
]