{
  "schema": "fprd.c7-compiler-independent-review.v1",
  "reviewed_at": "2026-09-01",
  "review_units": [
    "table-free 367-word C7 base compiler",
    "200-dimensional Gao typed-language compiler"
  ],
  "base_compiler_rerun": {
    "status": "pass",
    "output_sha256": "2d22ecfd63bd4fb76eb3ed6baaddcafcdac9bfe736408b6ff054dbd2df809fbf",
    "code_sha256": "a8d96cb1593aa03058e781c819a5254895ccae4dfc05f35a4ef3e89e6566c9e4",
    "maximum_extension_size": 40,
    "maximum_extension_count": 8,
    "coordinate_order_profiles_checked": 960,
    "minimum_state_multiset": [128, 129, 129, 129, 130, 130, 130, 132],
    "published_code_profile": {
      "layer_counts": [1, 7, 49, 61, 9, 1],
      "states": 128,
      "transitions": 424
    }
  },
  "typed_language_compiler_rerun": {
    "status": "pass",
    "output_sha256": "90a3b7e639dd39b61b96224df0c1558a129075a1145b5659585929e9422fe889",
    "syntax_dag_nodes": 204,
    "dimension_200_states": 192771,
    "dimension_200_transitions": 618415,
    "gao_m40_matches": true
  },
  "independent_hostile_check": {
    "status": "pass_with_scope_correction",
    "maximum_clique_search_nodes": 383,
    "two_block_words": 134753,
    "two_block_canonical_syntax_compiler": {
      "layer_counts": [1, 7, 49, 300, 71, 9, 49, 176, 107, 10, 1],
      "states": 780,
      "transitions": 2395
    },
    "two_block_exact_left_quotient_automaton": {
      "layer_counts": [1, 7, 49, 300, 71, 9, 49, 176, 93, 10, 1],
      "states": 766,
      "transitions": 2367
    },
    "first_semantic_merging": {
      "depth": 8,
      "syntax_states": 107,
      "distinct_left_quotients": 93
    },
    "language_equality_at_first_divergence": true,
    "conclusion": "The published 192771 count is exact for the declared canonical syntax compiler, but it is not a count of distinct left quotients and remains only an upper bound on the minimal DFA."
  },
  "source_sha256": {
    "c7_base_compiler.py": "dd936aedbe4e37431c276b1e83669684aece2d5460332337f206efb2721a2bc4",
    "c7_typed_language_compiler.py": "8a5aa1abd01839002519384147c1ac673ba2b7f12971150fce58d4a33dbae637",
    "c7_independent_review.py": "211793d41e6374b6976e43c000e5c7a7da4a05871e2e664042e0ddef829d9be5"
  },
  "limitations": [
    "The independent review checks the finite base family and the complete two-block semantic boundary; it does not minimize the 200-dimensional automaton.",
    "Independence of Gao's recursively constructed code remains imported from Gao's product lemma."
  ]
}