{
  "step": "C446",
  "status": "completed",
  "title": "Finite Reachability Under the Four Fixed Reflections",
  "previous_certificate_sha256": "f2b13ccfa5933a70191a451f039a7b991ccee7dff8644c6a1c32da680797603f",
  "bindings": {
    "step": "STEP.json",
    "source_manifest": "SOURCE_MANIFEST.json",
    "report": "490d_C446_Complete_Finite_Reflection_Reachability_20260925.md",
    "checkpoint": "490d_Mirror_Checkpoint_After_C446_20260925.md",
    "data": "evidence/DATA.json",
    "results": "evidence/RESULTS.json",
    "calculation": "evidence/CALCULATION.py",
    "verifier": "evidence/check.py",
    "next_step_decision": "NEXT_STEP_DECISION.json",
    "replay": "REPLAY.json",
    "control_integrity": "CONTROL_INTEGRITY.json",
    "readme": "README.md"
  },
  "step_sha256": "1f465adf8e5fd9ee5afa28cc5fbf08cb907abdfa9ed13b2d27fc5c84a18204b7",
  "source_manifest_sha256": "510c415b1e1157df609506f2aa2a33c93a7238d91fc927cd2e6429d146dc6433",
  "report_sha256": "9a328d530e266393411a2a0ac4192aa53fc290a282e4fe3febab3328705e4691",
  "checkpoint_sha256": "44c8eb26932381dcec4940e82e489f366d3eb30eeee9862ba8b83db59d6d0df2",
  "data_sha256": "e177bbe8e124275d44be12e2ecca53e09c2646d1def4493919c4e90eca548ad1",
  "results_sha256": "f92c48763acb3eb5b547fdd2a493c7446dbf9a4e69f42a3400d6f64dce1b369d",
  "calculation_sha256": "b53e4bb593ab5aa3fc3a6e4f9560abed0f8c9e02cebd54cb9dea59c66c6ccf92",
  "verifier_sha256": "46964ade0128d97b589fb678853daf7b81ffff1d90eb1a99221031ba734b093f",
  "next_step_decision_sha256": "70db9c81142bf9622cff3f26386a066aed31e2e412ea9ff7dd1ba0255f94a6d4",
  "replay_sha256": "92fe1f3791dc5113547def2b962e0dc1422c7f9e4d0305256dcb0283b747c936",
  "control_integrity_sha256": "24e687bf3e03c7f16c3ca2aafe4c72e9aab25f03d55fa644c44a178e698ff3df",
  "readme_sha256": "db231a63d6108476b9756b87561fc9bf2a70b53ccdd6538d1245d145992382bd",
  "assertions_passed": 374,
  "source_checks_passed": 19,
  "main_result": "The four-reflection graph has 373 vertices, 106 edges including four loops, and 272 components. Its 152 active coordinates form 49 nontrivial components plus two loop-only singletons; 221 coordinates have no admitted reflection. The largest components have six coordinates and the maximum shortest-path distance is four.",
  "limits": "Graph connectivity expresses numerical accessibility through sourced coordinates. It does not assert common tradition, role, phase or chronological context along a path.",
  "canonical_or_graph_edits": false,
  "new_independent_agent_review": false,
  "next_step_executed": false,
  "next_proposed_step": "Test every reachable coordinate pair for nonzero multiples of 529 and locate the established E-path, loop and pivot coordinates in the complete reflection graph."
}