Validate path-structured proof-plan DAGHEADmain

1 files changed, 8 insertions, 0 deletions

diff --git a/README.md b/README.md
index 090c297..b1a3f8c 100644
--- a/README.md
+++ b/README.md
@@ -43,6 +43,14 @@ The conceptual five stages are represented explicitly in saved artifacts.
 The original implementation batches stages 1–3 into Prompt-A and stages 4–5
 into Prompt-B; the wrapper does not change those prompts. See `STAGE_MAP.md`.
 
+Prompt-A's ordered core steps instantiate a path-structured proof-plan DAG:
+each step is a typed node and each edge records the dependency on the preceding
+step. `ProofPlanDAG` validates unique node IDs, known dependencies, acyclicity,
+connectivity to the terminal node, and the extracted order. This path structure
+is the precise graph induced by an ordered minimal proof chain. Judges receive
+the same method-label sequence with stable node IDs and must report a check for
+every node before their verdict is counted.
+
 ## Install and test
 
 ```bash