{
  "protocol": "fprd-matrix-storage-sewing-audit.v1",
  "reviewed_at": "2026-09-01",
  "selected_records": [
    "MMR-023",
    "MMR-024",
    "MMR-025",
    "MMR-029",
    "MMR-030",
    "MMR-031",
    "MMR-036",
    "MMR-039",
    "MMR-042",
    "MRF-025"
  ],
  "checker_hashes": {
    "matrix_realization_run3_check.py": "0b4f24f972fc54f8060ba95a60269a0098a922a787318b40f68089f8a38fb2ae",
    "matrix_realization_run4_product_check.py": "c41a31e0d3139d8e204d91cbf30ce594772e615566741f2510c713cc1002c11a",
    "matrix_realization_run5_bisimulation_check.py": "a283c1c7615cf27a4c247483bc8ca876677b1b4e32d297cb6d72623c226a72ec",
    "matrix_realization_run6_stutter_check.py": "0e0e60b4302f88d85e0edb20ef2acf891f67cc94c384d0f83a5276f448351e3b"
  },
  "reproduced_results": {
    "separator": {
      "standalone_peaks": [3, 3],
      "composed_peaks": [2, 3]
    },
    "boundary_ideal_product": {
      "G_R_product_and_monolithic_peak": [2, 2],
      "G_P_product_and_monolithic_peak": [3, 3]
    },
    "bisimulation": {
      "naive_2x2_ideals": 625,
      "naive_2x2_classes": 256,
      "same_label_remaining_peaks": [2, 3]
    },
    "stutter_trace": {
      "strong_bisimilar": false,
      "completed_trace_languages_equal": true,
      "enumerated_productive_contexts": 118,
      "all_enumerated_peaks_equal": true
    }
  },
  "analytic_scope": "Fixed finite acyclic arithmetic DAGs; transparent downstream-only one-shot sewing; no recomputation; unit scalar storage; unbounded free reads.",
  "review_2026_09_01": {
    "archived_proofs_reconstructed": [
      "boundary-ideal exact sewing",
      "strong-bisimulation quotient sufficiency",
      "completed contracted trace sufficiency",
      "untrimmed dead-gate strictness witness"
    ],
    "checker_replay": "All four retained checkers passed and reproduced the recorded hashes and outputs.",
    "mathematical_correction": "The public explanation now distinguishes gadget-internal pending bits from context-supplied external pending bits.",
    "scope_confirmation": "Completed trace equality is sufficient, not claimed necessary or coarsest; the strictness witness is untrimmed and disappears under dead-code elimination.",
    "primary_sources_verified": [
      "Ce Jin et al., New Tools for Peak Memory Scheduling, arXiv:2312.13526",
      "Robert Paige and Robert E. Tarjan, Three Partition Refinement Algorithms, DOI 10.1137/0216062",
      "Jan Friso Groote and Frits W. Vaandrager, An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence, DOI 10.1007/BFb0032063",
      "Rob J. van Glabbeek, The Linear Time-Branching Time Spectrum, DOI 10.1007/BFb0039066"
    ]
  },
  "excluded_claims": [
    "No communication or I/O lower bound.",
    "No minimality theorem for the complete boundary receipt, bisimulation quotient, or stutter-trace receipt.",
    "The strictness witness does not satisfy the trimmed-DAG condition.",
    "Finite corroboration is not the proof of the universal sewing theorems."
  ],
  "status": "pass"
}