diff --git a/CHANGELOG.md b/CHANGELOG.md
index 88f96016..5705097f 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -5,6 +5,36 @@
 
 ## Unreleased
 
+### Fixed (CI)
+
+- **Evidence Derivation:** Replaced artifact-directory-presence check for `DET-001` with
+  structured parsing and validation of `static-inspection.json`; `FAILED` static inspections
+  now correctly yield `UNVERIFIED` evidence instead of relying solely on artifact existence.
+  Adds `source_file`, `source_status`, and optional `error` fields to DET-001 evidence.
+- **Evidence Script Hardening:** Added TypeError guard on `generateEvidence` input,
+  try/catch with `process.exit(1)` in CLI mode, truncated log interpolations to
+  200 chars in `checkStaticInspection`, harmonized parameter naming, and tightened
+  JSDoc return types to `'VERIFIED'|'UNVERIFIED'` union.
+
+### Fixed (Docs)
+
+- **Docs Build:** Rewrote `ADR-0007-impl.md` from a 3185-line raw conversation
+  transcript into a proper 13-section ADR document. The Vue template compiler
+  was crashing on bare Rust generics (`BTreeMap<NodeId, NodeRecord>`, etc.)
+  outside fenced code blocks. The new document preserves all architectural
+  knowledge as a structured implementation companion to ADR-0007.
+- **Stale Hash Domain:** Updated three stale `DIND_STATE_HASH_V2` references in
+  `graph.rs` doc comment and `ADR-0007-impl.md` §2.1/§7 to match the actual
+  domain prefix `echo:state_root:v1` defined in `domain.rs`. Renamed the
+  adjacent `V2 Changes` subsection to `Layout Notes` to remove versioning
+  ambiguity.
+- **Module Count:** Fixed off-by-one module count in `ADR-0007-impl.md` metadata
+  and §1 prose (36 → 37) and added qualifier noting tables cover key modules only.
+- **Stale Design Doc:** Deleted `docs/WARP-GRAPH.md` (1,219-line chat transcript
+  fully superseded by `ADR-0007-impl.md` and `crates/warp-core/src/wsc/`).
+  Extracted all-zero-key caveat into ADR §9.6 and `save_wsc()` convenience
+  wrapper gap into `TASKS-DAG.md` backlog before removal.
+
 ## [0.1.3] — 2026-02-21
 
 ### Fixed (Sprint S1)
diff --git a/TASKS-DAG.md b/TASKS-DAG.md
index fef994b1..0f4622d7 100644
--- a/TASKS-DAG.md
+++ b/TASKS-DAG.md
@@ -698,7 +698,7 @@ This living list documents open issues and the inferred dependencies contributor
 - Blocked by:
     - [#286: CI: Add unit tests for classify_changes.cjs and matches()](https://github.com/flyingrobots/echo/issues/286)
     - Confidence: medium
-    - Evidence: Both scripts now export their main functions (M1/M2 in det-hard). Edge cases to cover: 'local' sentinel, missing artifacts, malformed evidence JSON.
+    - Evidence: Both scripts now export their main functions (M1/M2 in det-hard). `checkStaticInspection` is now module-scoped and exported (PR #288), enabling direct unit tests for all 5 behavioral branches: file-not-found, invalid JSON, null/non-object parse, wrong structure, and PASSED/FAILED status. Edge cases to cover: 'local' sentinel, missing artifacts, malformed evidence JSON.
 
 ## Backlog: Simplify docs crate path list in det-policy.yaml
 
@@ -718,6 +718,48 @@ This living list documents open issues and the inferred dependencies contributor
 - Evidence: G3 (perf-regression) runs Criterion benchmarks and uploads `perf.log` but does not compare against a stored baseline. PRF-001 relies on Criterion's internal noise threshold. Adding `critcmp` or `bencher.dev` integration would enable regression detection across commits.
 - (No detected dependencies)
 
+## Backlog: CI workflow lint — verify referenced scripts exist in repo
+
+- Status: Open
+- Evidence: Commit `896c205` accidentally deleted `scripts/generate_evidence.cjs` while `det-gates.yml:304` still referenced it (`node scripts/generate_evidence.cjs gathered-artifacts`), breaking the Evidence schema job with `MODULE_NOT_FOUND`. A pre-commit hook or CI lint step that parses workflow YAML `run:` blocks for `node <script>` / `bash <script>` invocations and verifies the paths resolve to existing files would prevent recurrence.
+- (No detected dependencies)
+
+## Backlog: Add save_wsc() convenience wrapper in wsc module
+
+- Status: Open
+- Evidence: `wsc/build.rs` provides `build_one_warp_input()`, `wsc/write.rs` provides `write_wsc_one_warp()`, but there is no single-call convenience function combining build + write + `std::fs::write`. Users must chain three calls manually. A `save_wsc(store, root_node_id, schema_hash, tick, path)` wrapper would reduce boilerplate for tests and tooling. Low priority — the three-call chain works, but it's a quality-of-life gap. Originated from a design note in the now-deleted `docs/WARP-GRAPH.md`.
+- (No detected dependencies)
+
+## Backlog: Extract checkArtifact helper to module scope in generate_evidence.cjs
+
+- Status: Open
+- Evidence: `checkStaticInspection` was extracted to module scope and exported in PR #288, but `checkArtifact` remains a closure inside `generateEvidence`. For consistency and testability, it should follow the same pattern: top-level function declaration, added to `module.exports`.
+- (No detected dependencies)
+
+## Backlog: Add --dry-run mode to generate_evidence.cjs
+
+- Status: Open
+- Evidence: `generate_evidence.cjs` always writes `evidence.json` to disk. A `--dry-run` flag that validates artifact presence, runs `checkStaticInspection`, and prints the evidence JSON to stdout without writing would enable local pre-push validation and make unit test assertions simpler (no temp dir cleanup).
+- (No detected dependencies)
+
+## Backlog: Lint docs/ markdown for bare angle brackets (VitePress guard)
+
+- Status: Open
+- Evidence: ADR-0007-impl.md was a 3185-line transcript containing bare Rust generics (`BTreeMap<NodeId, NodeRecord>`) outside fenced code blocks, crashing the VitePress Vue template compiler. PR #288 rewrote the document, but no CI lint prevents recurrence. A markdownlint custom rule or shell script scanning `docs/**/*.md` for `<[A-Z]` outside backticks and code fences would catch this at pre-commit time.
+- (No detected dependencies)
+
+## Backlog: Clean up stale DIND_STATE_HASH_V2 in WARP-GRAPH.md references
+
+- Status: Completed
+- Evidence: `docs/WARP-GRAPH.md` was deleted in PR #288 (commit 80f0be8). The stale `DIND_STATE_HASH_V2` reference at line 791 was removed along with the entire file. Remaining `DIND_STATE_HASH_V2` references in `echo-dind-harness/src/dind.rs` and `testdata/dind/*.hashes.json` are intentional DIND test harness identifiers, not stale engine domain prefixes.
+- (No detected dependencies)
+
+## Backlog: Investigate CodeRabbit post-hoc verification false positives
+
+- Status: Open
+- Evidence: CodeRabbit's ASSERTIVE review mode ran `grep` and `git log` scripts on the current codebase to verify CHANGELOG claims, but the verification ran AFTER the fix deleted the evidence (replaced `DIND_STATE_HASH_V2` strings, rewrote 3,185-line file). This produced a Critical false positive claiming "fabricated" line counts and reference counts. Consider adding a `.coderabbitignore` pattern or CHANGELOG annotation convention that prevents post-hoc verification of claims about deleted/replaced content.
+- (No detected dependencies)
+
 ---
 
 Rendering note (2026-01-09):
diff --git a/crates/warp-core/src/graph.rs b/crates/warp-core/src/graph.rs
index fb6a6e5f..8b40a379 100644
--- a/crates/warp-core/src/graph.rs
+++ b/crates/warp-core/src/graph.rs
@@ -477,15 +477,15 @@ impl GraphStore {
     /// Computes a canonical hash of the entire graph state.
     ///
     /// This traversal is strictly deterministic:
-    /// 1. Header: `b"DIND_STATE_HASH_V2\0"`
+    /// 1. Header: `b"echo:state_root:v1\0"`
     /// 2. Node Count (u64 LE)
     /// 3. Nodes (sorted by `NodeId`): `b"N\0"` + `NodeId` + `TypeId` + Attachment(if any)
     /// 4. Edge Count (u64 LE)
     /// 5. Edges (sorted by `EdgeId`): `b"E\0"` + `EdgeId` + From + To + Type + Attachment(if any)
     ///
-    /// # V2 Changes
+    /// # Layout Notes
     ///
-    /// V2 uses `u64` for all counts and lengths (node count, edge count, blob length)
+    /// Uses `u64` for all counts and lengths (node count, edge count, blob length)
     /// to align with the WSC format and avoid truncation issues with large graphs.
     #[must_use]
     pub fn canonical_state_hash(&self) -> Hash {
@@ -536,7 +536,7 @@ impl GraphStore {
             AttachmentValue::Atom(atom) => {
                 hasher.update(b"ATOM"); // Tag
                 hasher.update(&atom.type_id.0);
-                // V2: u64 blob length
+                // u64 blob length (aligned with WSC format)
                 hasher.update(&(atom.bytes.len() as u64).to_le_bytes());
                 hasher.update(&atom.bytes);
             }
diff --git a/docs/WARP-GRAPH.md b/docs/WARP-GRAPH.md
deleted file mode 100644
index 6f543923..00000000
--- a/docs/WARP-GRAPH.md
+++ /dev/null
@@ -1,1219 +0,0 @@
-<!-- SPDX-License-Identifier: Apache-2.0 OR MIND-UCAL-1.0 -->
-<!-- © James Ross Ω FLYING•ROBOTS <https://github.com/flyingrobots> -->
-
-# WARP Graph Store
-
-> **Note:** This is a snapshot of `graph.rs`. For the authoritative version,
-> see `crates/warp-core/src/graph.rs`. Key change: `DeleteNode` now uses
-> `delete_node_isolated()` which rejects if edges exist—no more cascade.
-
-```rust
-//! Minimal in-memory graph store used by the rewrite executor and tests.
-use std::collections::BTreeMap;
-
-use crate::attachment::AttachmentValue;
-use crate::ident::{EdgeId, Hash, NodeId, WarpId};
-use crate::record::{EdgeRecord, NodeRecord};
-
-/// In-memory graph storage for the spike.
-///
-/// The production engine will eventually swap in a content-addressed store,
-/// but this structure keeps the motion rewrite spike self-contained.
-#[derive(Debug, Clone)]
-#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
-pub struct GraphStore {
-    /// Warp instance identifier for this store (Stage B1).
-    pub(crate) warp_id: WarpId,
-    /// Mapping from node identifiers to their materialised records.
-    pub(crate) nodes: BTreeMap<NodeId, NodeRecord>,
-    /// Mapping from source node to outbound edge records.
-    pub(crate) edges_from: BTreeMap<NodeId, Vec<EdgeRecord>>,
-    /// Reverse adjacency: mapping from destination node to inbound edge ids.
-    ///
-    /// This enables efficient edge queries and validation without scanning
-    /// every `edges_from` bucket (lookup becomes `O(inbound_edges)`).
-    pub(crate) edges_to: BTreeMap<NodeId, Vec<EdgeId>>,
-    /// Attachment plane payloads for nodes (Paper I `α` plane).
-    ///
-    /// Entries are present only when the attachment is `Some(...)`.
-    pub(crate) node_attachments: BTreeMap<NodeId, AttachmentValue>,
-    /// Attachment plane payloads for edges (Paper I `β` plane).
-    ///
-    /// Entries are present only when the attachment is `Some(...)`.
-    pub(crate) edge_attachments: BTreeMap<EdgeId, AttachmentValue>,
-    /// Reverse index of `EdgeId -> from NodeId`.
-    ///
-    /// This enables efficient edge migration/removal by id (used by tick patch replay),
-    /// avoiding `O(total_edges)` scans across all buckets.
-    pub(crate) edge_index: BTreeMap<EdgeId, NodeId>,
-    /// Reverse index of `EdgeId -> to NodeId`.
-    ///
-    /// This enables efficient maintenance of [`GraphStore::edges_to`] during
-    /// edge migration and deletion.
-    pub(crate) edge_to_index: BTreeMap<EdgeId, NodeId>,
-}
-
-impl Default for GraphStore {
-    fn default() -> Self {
-        Self::new(crate::ident::make_warp_id("root"))
-    }
-}
-
-impl GraphStore {
-    /// Creates an empty store for `warp_id`.
-    #[must_use]
-    pub fn new(warp_id: WarpId) -> Self {
-        Self {
-            warp_id,
-            nodes: BTreeMap::new(),
-            edges_from: BTreeMap::new(),
-            edges_to: BTreeMap::new(),
-            node_attachments: BTreeMap::new(),
-            edge_attachments: BTreeMap::new(),
-            edge_index: BTreeMap::new(),
-            edge_to_index: BTreeMap::new(),
-        }
-    }
-
-    /// Returns the warp instance identifier for this store.
-    #[must_use]
-    pub fn warp_id(&self) -> WarpId {
-        self.warp_id
-    }
-
-    /// Iterate over all nodes (id, record) in deterministic order.
-    pub fn iter_nodes(&self) -> impl Iterator<Item = (&NodeId, &NodeRecord)> {
-        self.nodes.iter()
-    }
-
-    /// Iterate over all outbound edge lists per source node.
-    pub fn iter_edges(&self) -> impl Iterator<Item = (&NodeId, &Vec<EdgeRecord>)> {
-        self.edges_from.iter()
-    }
-
-    /// Returns a shared reference to a node when it exists.
-    pub fn node(&self, id: &NodeId) -> Option<&NodeRecord> {
-        self.nodes.get(id)
-    }
-
-    /// Returns the node's attachment value (if any).
-    pub fn node_attachment(&self, id: &NodeId) -> Option<&AttachmentValue> {
-        self.node_attachments.get(id)
-    }
-
-    /// Iterate over all node attachment entries (id, value) in deterministic order.
-    ///
-    /// The attachment plane stores entries only when a value exists (`Some`);
-    /// this iterator yields those present values.
-    pub fn iter_node_attachments(&self) -> impl Iterator<Item = (&NodeId, &AttachmentValue)> {
-        self.node_attachments.iter()
-    }
-
-    /// Returns a mutable reference to the node's attachment value (if any).
-    pub fn node_attachment_mut(&mut self, id: &NodeId) -> Option<&mut AttachmentValue> {
-        self.node_attachments.get_mut(id)
-    }
-
-    /// Returns an iterator over edges that originate from the provided node.
-    ///
-    /// Edges are yielded in insertion order. For deterministic traversal
-    /// (e.g., snapshot hashing), callers must sort by `EdgeId`.
-    pub fn edges_from(&self, id: &NodeId) -> impl Iterator<Item = &EdgeRecord> {
-        self.edges_from.get(id).into_iter().flatten()
-    }
-
-    /// Returns a mutable reference to a node when it exists.
-    pub fn node_mut(&mut self, id: &NodeId) -> Option<&mut NodeRecord> {
-        self.nodes.get_mut(id)
-    }
-
-    /// Sets the node's attachment value.
-    ///
-    /// Passing `None` clears any existing attachment.
-    pub fn set_node_attachment(&mut self, id: NodeId, value: Option<AttachmentValue>) {
-        match value {
-            None => {
-                self.node_attachments.remove(&id);
-            }
-            Some(v) => {
-                self.node_attachments.insert(id, v);
-            }
-        }
-    }
-
-    /// Returns the edge's attachment value (if any).
-    pub fn edge_attachment(&self, id: &EdgeId) -> Option<&AttachmentValue> {
-        self.edge_attachments.get(id)
-    }
-
-    /// Iterate over all edge attachment entries (id, value) in deterministic order.
-    ///
-    /// The attachment plane stores entries only when a value exists (`Some`);
-    /// this iterator yields those present values.
-    pub fn iter_edge_attachments(&self) -> impl Iterator<Item = (&EdgeId, &AttachmentValue)> {
-        self.edge_attachments.iter()
-    }
-
-    /// Returns `true` if an edge with `edge_id` exists in the store.
-    #[must_use]
-    pub fn has_edge(&self, edge_id: &EdgeId) -> bool {
-        self.edge_index.contains_key(edge_id)
-    }
-
-    /// Returns a mutable reference to the edge's attachment value (if any).
-    pub fn edge_attachment_mut(&mut self, id: &EdgeId) -> Option<&mut AttachmentValue> {
-        self.edge_attachments.get_mut(id)
-    }
-
-    /// Sets the edge's attachment value.
-    ///
-    /// Passing `None` clears any existing attachment.
-    pub fn set_edge_attachment(&mut self, id: EdgeId, value: Option<AttachmentValue>) {
-        match value {
-            None => {
-                self.edge_attachments.remove(&id);
-            }
-            Some(v) => {
-                self.edge_attachments.insert(id, v);
-            }
-        }
-    }
-
-    /// Inserts or replaces a node in the store.
-    pub fn insert_node(&mut self, id: NodeId, record: NodeRecord) {
-        self.nodes.insert(id, record);
-    }
-
-    /// Inserts or replaces a directed edge in the store.
-    ///
-    /// If an edge with the same `EdgeId` already exists (in any bucket), the
-    /// old edge is removed before inserting the new one. This maintains `EdgeId`
-    /// uniqueness across the entire store.
-    ///
-    /// Ordering note: Edges within a bucket preserve insertion order. When
-    /// deterministic ordering is required (e.g., snapshot hashing), callers must
-    /// sort by `EdgeId` explicitly.
-    pub fn insert_edge(&mut self, from: NodeId, edge: EdgeRecord) {
-        self.upsert_edge_record(from, edge);
-    }
-
-    /// Inserts or replaces an edge record and maintains the reverse `EdgeId -> from` index.
-    ///
-    /// If an edge with the same id already exists (possibly in a different bucket),
-    /// this removes the old record first so that `EdgeId` remains unique across the store.
-    pub(crate) fn upsert_edge_record(&mut self, from: NodeId, mut edge: EdgeRecord) {
-        if edge.from != from {
-            debug_assert_eq!(
-                edge.from, from,
-                "edge.from must match the bucket key passed to insert_edge"
-            );
-            // Preserve store invariants even if the caller passed an inconsistent record.
-            edge.from = from;
-        }
-        let edge_id = edge.id;
-        let to = edge.to;
-        let prev_from = self.edge_index.insert(edge_id, from);
-        let prev_to = self.edge_to_index.insert(edge_id, to);
-        if let Some(prev_from) = prev_from {
-            let bucket_is_empty = self.edges_from.get_mut(&prev_from).map_or_else(
-                || {
-                    debug_assert!(
-                        false,
-                        "edge index referenced a missing bucket for edge id: {edge_id:?}"
-                    );
-                    false
-                },
-                |edges| {
-                    let before = edges.len();
-                    edges.retain(|e| e.id != edge_id);
-                    if edges.len() == before {
-                        debug_assert!(
-                            false,
-                            "edge index referenced an edge missing from its bucket: {edge_id:?}"
-                        );
-                    }
-                    edges.is_empty()
-                },
-            );
-            if bucket_is_empty {
-                self.edges_from.remove(&prev_from);
-            }
-        }
-        if let Some(prev_to) = prev_to {
-            let bucket_is_empty = self.edges_to.get_mut(&prev_to).map_or_else(
-                || {
-                    debug_assert!(
-                        false,
-                        "edge-to index referenced a missing bucket for edge id: {edge_id:?}"
-                    );
-                    false
-                },
-                |edges| {
-                    let before = edges.len();
-                    edges.retain(|id| *id != edge_id);
-                    if edges.len() == before {
-                        debug_assert!(
-                            false,
-                            "edge-to index referenced an edge missing from its bucket: {edge_id:?}"
-                        );
-                    }
-                    edges.is_empty()
-                },
-            );
-            if bucket_is_empty {
-                self.edges_to.remove(&prev_to);
-            }
-        }
-        self.edges_from.entry(from).or_default().push(edge);
-        self.edges_to.entry(to).or_default().push(edge_id);
-    }
-
-    /// Deletes a node and removes any attachments and incident edges.
-    ///
-    /// This is a cascading delete: all edges where this node is the source (`from`)
-    /// or target (`to`) are also removed, along with their attachments. Use this
-    /// when completely removing an entity from the graph.
-    ///
-    /// # Returns
-    ///
-    /// `true` if the node existed and was removed, `false` if the node was not found.
-    ///
-    /// # Note
-    ///
-    /// This operation is not transactional on its own. If used during a transaction,
-    /// the caller must ensure consistency with the transaction's isolation guarantees.
-    pub fn delete_node_cascade(&mut self, node: NodeId) -> bool {
-        if self.nodes.remove(&node).is_none() {
-            return false;
-        }
-        self.node_attachments.remove(&node);
-
-        // Remove outgoing edges (the bucket).
-        if let Some(out_edges) = self.edges_from.remove(&node) {
-            for e in out_edges {
-                self.edge_index.remove(&e.id);
-                self.edge_to_index.remove(&e.id);
-                let remove_bucket = self.edges_to.get_mut(&e.to).map_or_else(
-                    || {
-                        debug_assert!(
-                            false,
-                            "edge-to index missing inbound bucket for edge id: {:?}",
-                            e.id
-                        );
-                        false
-                    },
-                    |edges| {
-                        edges.retain(|id| *id != e.id);
-                        edges.is_empty()
-                    },
-                );
-                if remove_bucket {
-                    self.edges_to.remove(&e.to);
-                }
-                self.edge_attachments.remove(&e.id);
-            }
-        }
-
-        // Remove inbound edges (reverse adjacency).
-        if let Some(inbound) = self.edges_to.remove(&node) {
-            for edge_id in inbound {
-                let Some(from) = self.edge_index.remove(&edge_id) else {
-                    debug_assert!(
-                        false,
-                        "edge index missing inbound edge id during delete_node_cascade: {edge_id:?}"
-                    );
-                    continue;
-                };
-                let Some(to) = self.edge_to_index.remove(&edge_id) else {
-                    debug_assert!(
-                        false,
-                        "edge-to index missing inbound edge id during delete_node_cascade: {edge_id:?}"
-                    );
-                    continue;
-                };
-                debug_assert_eq!(
-                    to, node,
-                    "inbound edge-to index desynced for edge id: {edge_id:?}"
-                );
-                let Some(edges) = self.edges_from.get_mut(&from) else {
-                    debug_assert!(
-                        false,
-                        "edge index referenced a missing bucket for inbound edge id: {edge_id:?}"
-                    );
-                    continue;
-                };
-                let before = edges.len();
-                edges.retain(|e| e.id != edge_id);
-                if edges.len() == before {
-                    debug_assert!(
-                        false,
-                        "edge index referenced an inbound edge missing from its bucket: {edge_id:?}"
-                    );
-                    continue;
-                }
-                let bucket_is_empty = edges.is_empty();
-                if bucket_is_empty {
-                    self.edges_from.remove(&from);
-                }
-                self.edge_attachments.remove(&edge_id);
-            }
-        }
-        true
-    }
-
-    /// Deletes an edge from the specified bucket if it exists and matches the reverse index.
-    ///
-    /// Returns `true` if an edge was removed; returns `false` if the edge did not exist or
-    /// if the reverse index indicates the edge belongs to a different bucket.
-    pub fn delete_edge_exact(&mut self, from: NodeId, edge_id: EdgeId) -> bool {
-        match self.edge_index.get(&edge_id) {
-            Some(current_from) if *current_from == from => {}
-            _ => return false,
-        }
-        let Some(to) = self.edge_to_index.get(&edge_id).copied() else {
-            debug_assert!(
-                false,
-                "edge-to index missing edge id referenced by edge_index: {edge_id:?}"
-            );
-            return false;
-        };
-        let Some(edges) = self.edges_from.get_mut(&from) else {
-            debug_assert!(
-                false,
-                "edge index referenced a missing bucket for edge id: {edge_id:?}"
-            );
-            return false;
-        };
-        let before = edges.len();
-        edges.retain(|e| e.id != edge_id);
-        if edges.len() == before {
-            debug_assert!(
-                false,
-                "edge index referenced an edge missing from its bucket: {edge_id:?}"
-            );
-            return false;
-        }
-        let bucket_is_empty = edges.is_empty();
-        self.edge_index.remove(&edge_id);
-        self.edge_to_index.remove(&edge_id);
-        if bucket_is_empty {
-            self.edges_from.remove(&from);
-        }
-        let remove_bucket = self.edges_to.get_mut(&to).map_or_else(
-            || {
-                debug_assert!(
-                    false,
-                    "edge-to index referenced a missing bucket for edge id: {edge_id:?}"
-                );
-                false
-            },
-            |edges| {
-                edges.retain(|id| *id != edge_id);
-                edges.is_empty()
-            },
-        );
-        if remove_bucket {
-            self.edges_to.remove(&to);
-        }
-        self.edge_attachments.remove(&edge_id);
-        true
-    }
-
-    /// Computes a canonical hash of the entire graph state.
-    ///
-    /// This traversal is strictly deterministic:
-    /// 1. Header: `b"DIND_STATE_HASH_V1\0"`
-    /// 2. Node Count (u32 LE)
-    /// 3. Nodes (sorted by NodeId): `b"N\0"` + `NodeId` + `TypeId` + Attachment(if any)
-    /// 4. Edge Count (u32 LE)
-    /// 5. Edges (sorted by EdgeId): `b"E\0"` + `EdgeId` + From + To + Type + Attachment(if any)
-    #[allow(clippy::cast_possible_truncation)]
-    pub fn canonical_state_hash(&self) -> Hash {
-        let mut hasher = blake3::Hasher::new();
-        hasher.update(b"DIND_STATE_HASH_V1\0");
-
-        // 1. Nodes
-        hasher.update(&(self.nodes.len() as u32).to_le_bytes());
-        for (node_id, record) in &self.nodes {
-            hasher.update(b"N\0");
-            hasher.update(&node_id.0);
-            hasher.update(&record.ty.0);
-
-            if let Some(att) = self.node_attachments.get(node_id) {
-                hasher.update(b"\x01"); // Has attachment
-                Self::hash_attachment(&mut hasher, att);
-            } else {
-                hasher.update(b"\x00"); // No attachment
-            }
-        }
-
-        // 2. Edges (Global sort by EdgeId)
-        // We collect all edges first to sort them definitively.
-        let mut all_edges: Vec<&EdgeRecord> = self.edges_from.values().flatten().collect();
-        all_edges.sort_by_key(|e| e.id);
-
-        hasher.update(&(all_edges.len() as u32).to_le_bytes());
-        for edge in all_edges {
-            hasher.update(b"E\0");
-            hasher.update(&edge.id.0);
-            hasher.update(&edge.from.0);
-            hasher.update(&edge.to.0);
-            hasher.update(&edge.ty.0);
-
-            if let Some(att) = self.edge_attachments.get(&edge.id) {
-                hasher.update(b"\x01"); // Has attachment
-                Self::hash_attachment(&mut hasher, att);
-            } else {
-                hasher.update(b"\x00"); // No attachment
-            }
-        }
-
-        *hasher.finalize().as_bytes()
-    }
-
-    #[allow(clippy::cast_possible_truncation)]
-    fn hash_attachment(hasher: &mut blake3::Hasher, val: &AttachmentValue) {
-        match val {
-            AttachmentValue::Atom(atom) => {
-                hasher.update(b"ATOM"); // Tag
-                hasher.update(&atom.type_id.0);
-                hasher.update(&(atom.bytes.len() as u32).to_le_bytes());
-                hasher.update(&atom.bytes);
-            }
-            AttachmentValue::Descend(warp_id) => {
-                hasher.update(b"DESC"); // Tag
-                hasher.update(&warp_id.0);
-            }
-        }
-    }
-}
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-    use crate::ident::{make_edge_id, make_node_id, make_type_id};
-
-    #[test]
-    fn delete_node_cascade_updates_reverse_indexes() {
-        let mut store = GraphStore::default();
-        let node_ty = make_type_id("node");
-        let edge_ty = make_type_id("edge");
-
-        let a = make_node_id("a");
-        let b = make_node_id("b");
-        let c = make_node_id("c");
-        store.insert_node(a, NodeRecord { ty: node_ty });
-        store.insert_node(b, NodeRecord { ty: node_ty });
-        store.insert_node(c, NodeRecord { ty: node_ty });
-
-        let e1 = make_edge_id("a->b");
-        let e2 = make_edge_id("c->b");
-        let e3 = make_edge_id("b->a");
-        let e4 = make_edge_id("a->c");
-        store.insert_edge(
-            a,
-            EdgeRecord {
-                id: e1,
-                from: a,
-                to: b,
-                ty: edge_ty,
-            },
-        );
-        store.insert_edge(
-            c,
-            EdgeRecord {
-                id: e2,
-                from: c,
-                to: b,
-                ty: edge_ty,
-            },
-        );
-        store.insert_edge(
-            b,
-            EdgeRecord {
-                id: e3,
-                from: b,
-                to: a,
-                ty: edge_ty,
-            },
-        );
-        store.insert_edge(
-            a,
-            EdgeRecord {
-                id: e4,
-                from: a,
-                to: c,
-                ty: edge_ty,
-            },
-        );
-
-        assert!(store.delete_node_cascade(b));
-        assert!(store.node(&b).is_none());
-
-        assert!(!store.has_edge(&e1));
-        assert!(!store.has_edge(&e2));
-        assert!(!store.has_edge(&e3));
-        assert!(store.has_edge(&e4));
-
-        assert!(!store.edge_index.contains_key(&e1));
-        assert!(!store.edge_to_index.contains_key(&e1));
-        assert!(!store.edge_index.contains_key(&e2));
-        assert!(!store.edge_to_index.contains_key(&e2));
-        assert!(!store.edge_index.contains_key(&e3));
-        assert!(!store.edge_to_index.contains_key(&e3));
-        assert_eq!(store.edge_index.get(&e4), Some(&a));
-        assert_eq!(store.edge_to_index.get(&e4), Some(&c));
-
-        assert!(!store.edges_to.contains_key(&b));
-        assert!(!store.edges_to.contains_key(&a));
-        assert_eq!(store.edges_to.get(&c), Some(&vec![e4]));
-    }
-}
-```
-
----
-
-Yep — your ident newtypes and GraphStore are compatible with the WSC design. We do not need to blow them up.
-
-There are only three changes I'd push, and they're all sane:
-
-1. Add #[repr(transparent)] to NodeId/EdgeId/TypeId/WarpId (so you can safely treat them as "just bytes" everywhere). **Done**: All ID types now have `#[repr(transparent)]`.
-2. Add as_bytes() for all IDs (you only have it on NodeId/WarpId right now). **Partial**: `as_bytes()` is available on NodeId and WarpId; EdgeId/TypeId use inner Hash which has `as_bytes()`.
-3. For hashing + snapshots: stop truncating lengths/counts to u32 (use u64), or create a \*\_V2 hash. **Done**: V2 hash variants (`state_root_v2`, etc.) now use u64 lengths/counts. The V1 variants remain for backwards compatibility but V2 is the current implementation.
-
-Everything else can remain as-is.
-
-⸻
-
-Minimal ident tweaks (recommended)
-
-```rust
-#[repr(transparent)]
-#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
-pub struct TypeId(pub Hash);
-
-impl TypeId {
-  #[must_use] pub fn as_bytes(&self) -> &Hash { &self.0 }
-}
-
-// Do the same for EdgeId too:
-#[repr(transparent)]
-pub struct EdgeId(pub Hash);
-impl EdgeId { pub fn as_bytes(&self) -> &Hash { &self.0 } }
-```
-
-That's it.
-
-⸻
-
-Build WSC tables from your GraphStore (the missing piece)
-
-Below is the concrete build_one_warp_input() that turns your in-memory GraphStore into the canonical slab tables my writer expects.
-
-Notes:
-
-- I'm not serializing edges_to, edge_index, edge_to_index. They're indexes, not state. We rebuild them during load/overlay anyway.
-- GraphStore doesn't store root_node_id, so this takes it as a parameter (you should store that at the "WarpInstance" layer, not inside GraphStore).
-- This supports your current "single attachment per node/edge" model (range 0/1). The format supports multiple later.
-
-```rust
-use std::collections::BTreeMap;
-
-use crate::attachment::AttachmentValue;
-use crate::ident::{EdgeId, NodeId, WarpId};
-use crate::record::{EdgeRecord, NodeRecord};
-
-// These are the WSC row types from the snapshot module:
-use warp_snapshot::wsc::types::{NodeRow, EdgeRow, Range, OutEdgeRef, AttRow};
-use warp_snapshot::wsc::write::OneWarpInput;
-
-pub fn build_one_warp_input(store: &crate::graph::GraphStore, root_node_id: NodeId) -> OneWarpInput<'static> {
-    // 1) NODES: already sorted by NodeId because BTreeMap
-    let nodes: Vec<(NodeId, NodeRecord)> = store
-        .nodes
-        .iter()
-        .map(|(id, rec)| (*id, rec.clone()))
-        .collect();
-
-    let node_rows: Vec<NodeRow> = nodes
-        .iter()
-        .map(|(id, rec)| NodeRow {
-            node_id: id.0,
-            node_type: rec.ty.0,
-        })
-        .collect();
-
-    // 2) EDGES: collect globally + sort by EdgeId (canonical)
-    let mut edges_all: Vec<EdgeRecord> = store.edges_from.values().flatten().cloned().collect();
-    edges_all.sort_by_key(|e| e.id);
-
-    let edge_rows: Vec<EdgeRow> = edges_all
-        .iter()
-        .map(|e| EdgeRow {
-            edge_id: e.id.0,
-            from_node_id: e.from.0,
-            to_node_id: e.to.0,
-            edge_type: e.ty.0,
-        })
-        .collect();
-
-    // Build EdgeId -> edge_ix map (deterministic builder uses BTreeMap)
-    let mut edge_ix: BTreeMap<EdgeId, u64> = BTreeMap::new();
-    for (ix, e) in edges_all.iter().enumerate() {
-        edge_ix.insert(e.id, ix as u64);
-    }
-
-    // 3) OUT_INDEX + OUT_EDGES (group by node order; within group sort by EdgeId)
-    let mut out_index: Vec<Range> = Vec::with_capacity(node_rows.len());
-    let mut out_edges: Vec<OutEdgeRef> = Vec::new();
-
-    for (node_id, _rec) in &nodes {
-        let start = out_edges.len() as u64;
-
-        // Pull this node's outgoing edges (in insertion order), then sort canonically by EdgeId.
-        let mut bucket: Vec<&EdgeRecord> = store.edges_from.get(node_id).map(|v| v.iter().collect()).unwrap_or_default();
-        bucket.sort_by_key(|e| e.id);
-
-        for e in bucket {
-            let ix = *edge_ix.get(&e.id).expect("edge_ix missing for edge in bucket");
-            out_edges.push(OutEdgeRef {
-                edge_ix_le: ix.to_le(),
-                edge_id: e.id.0,
-            });
-        }
-
-        let len = (out_edges.len() as u64) - start;
-        out_index.push(Range {
-            start_le: start.to_le(),
-            len_le: len.to_le(),
-        });
-    }
-
-    // 4) Attachments + blobs
-    let mut blobs: Vec<u8> = Vec::new();
-
-    let mut node_atts_index: Vec<Range> = Vec::with_capacity(node_rows.len());
-    let mut node_atts: Vec<AttRow> = Vec::new();
-
-    for (node_id, _rec) in &nodes {
-        let start = node_atts.len() as u64;
-
-        if let Some(att) = store.node_attachments.get(node_id) {
-            node_atts.push(att_to_row(att, &mut blobs));
-        }
-
-        let len = (node_atts.len() as u64) - start;
-        node_atts_index.push(Range { start_le: start.to_le(), len_le: len.to_le() });
-    }
-
-    let mut edge_atts_index: Vec<Range> = Vec::with_capacity(edge_rows.len());
-    let mut edge_atts: Vec<AttRow> = Vec::new();
-
-    for e in &edges_all {
-        let start = edge_atts.len() as u64;
-
-        if let Some(att) = store.edge_attachments.get(&e.id) {
-            edge_atts.push(att_to_row(att, &mut blobs));
-        }
-
-        let len = (edge_atts.len() as u64) - start;
-        edge_atts_index.push(Range { start_le: start.to_le(), len_le: len.to_le() });
-    }
-
-    OneWarpInput {
-        warp_id: store.warp_id.0,
-        root_node_id: root_node_id.0,
-
-        nodes: node_rows,
-        edges: edge_rows,
-
-        out_index,
-        out_edges,
-
-        node_atts_index,
-        node_atts,
-
-        edge_atts_index,
-        edge_atts,
-
-        blobs,
-    }
-}
-
-fn att_to_row(att: &AttachmentValue, blobs: &mut Vec<u8>) -> AttRow {
-    match att {
-        AttachmentValue::Atom(atom) => {
-            // 8-byte align blob starts (good for mmap + SIMD-y consumers)
-            align8(blobs);
-            let off = blobs.len() as u64;
-            let bytes: &[u8] = atom.bytes.as_ref();
-            blobs.extend_from_slice(bytes);
-            let len = bytes.len() as u64;
-
-            AttRow {
-                tag: 1,
-                reserved0: [0u8; 7],
-                type_or_warp: atom.type_id.0,
-                blob_off_le: off.to_le(),
-                blob_len_le: len.to_le(),
-            }
-        }
-        AttachmentValue::Descend(warp_id) => AttRow {
-            tag: 2,
-            reserved0: [0u8; 7],
-            type_or_warp: warp_id.0,
-            blob_off_le: 0u64.to_le(),
-            blob_len_le: 0u64.to_le(),
-        },
-    }
-}
-
-fn align8(v: &mut Vec<u8>) {
-    while v.len() % 8 != 0 {
-        v.push(0);
-    }
-}
-```
-
-That function is the bridge between your current spike store and the final WSC snapshot format.
-
-⸻
-
-Fix your canonical hash now (or version it)
-
-Right now you hash:
-
-- node/edge counts as u32
-- atom byte length as u32
-
-That’s fine for today, but it’s an unforced footgun. I’d do a v2:
-
-hasher.update(b"DIND_STATE_HASH_V2\0");
-hasher.update(&(self.nodes.len() as u64).to_le_bytes());
-// ...
-hasher.update(&(atom.bytes.len() as u64).to_le_bytes());
-
-If you keep V1 for compatibility, great — just add V2 and move forward.
-
-⸻
-
-One more important note: ID-index sections
-
-Earlier I mentioned optional NODE_ID_INDEX / EDGE_ID_INDEX. With your IDs being BLAKE3 outputs, an all-zero key is theoretically possible (astronomically unlikely, but still). If you ever add open-addressing indexes-on-disk, don’t use “all zeros = empty slot” unless you also include an occupancy bitmap. For v1: skip the on-disk hash index and just binary search the sorted tables (fast enough and 100% clean).
-
-⸻
-
-If you want, I can now stitch this into the writer I gave you earlier so you can do:
-
-let input = build_one_warp_input(&store, root_node_id);
-let bytes = write_wsc_one_warp(input, schema_hash, tick)?;
-std::fs::write("state.wsc", bytes)?;
-let file = WscFile::open("state.wsc")?;
-let view = file.warp_view(0)?;
-
-…and then we add a “golden determinism” test that asserts the byte output is stable across permutations.
-
----
-
-Awesome. Here’s the fully stitched path so you can go from your current GraphStore to a WSC file on disk and back to a zero-copy mmap view, plus tests that prove determinism.
-
-I'm going to make one simplification that helps a lot:
-
-- OneWarpInput should own its vectors (no lifetimes). That keeps the writer clean and avoids 'static hacks.
-
-⸻
-
-1. Minimal ident.rs upgrades (recommended)
-
-Do this so all IDs are "byte clean" everywhere:
-
-```rust
-#[repr(transparent)]
-#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
-pub struct NodeId(pub Hash);
-impl NodeId { pub fn as_bytes(&self) -> &Hash { &self.0 } }
-
-#[repr(transparent)]
-#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
-pub struct EdgeId(pub Hash);
-impl EdgeId { pub fn as_bytes(&self) -> &Hash { &self.0 } }
-
-#[repr(transparent)]
-#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
-pub struct TypeId(pub Hash);
-impl TypeId { pub fn as_bytes(&self) -> &Hash { &self.0 } }
-
-#[repr(transparent)]
-#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
-pub struct WarpId(pub Hash);
-impl WarpId { pub fn as_bytes(&self) -> &Hash { &self.0 } }
-```
-
-No behavior changes, just safer ABI expectations.
-
-⸻
-
-1. Add a wsc module (where it belongs)
-
-Put this in warp-core (or whatever crate defines GraphStore/AttachmentValue), e.g.
-
-```text
-crates/warp-core/src/wsc/
-  mod.rs
-  types.rs
-  read.rs
-  view.rs
-  validate.rs
-  write.rs
-  build.rs
-```
-
-wsc/mod.rs:
-
-```rust
-pub mod types;
-pub mod read;
-pub mod view;
-pub mod validate;
-pub mod write;
-pub mod build;
-
-pub use view::{WscFile, WarpView, AttachmentRef};
-pub use read::ReadError;
-```
-
-⸻
-
-1. Make OneWarpInput owned (fix the writer interface)
-
-In your wsc/write.rs, define:
-
-```rust
-use super::types::*;
-
-pub struct OneWarpInput {
-    pub warp_id: [u8; 32],
-    pub root_node_id: [u8; 32],
-
-    pub nodes: Vec<NodeRow>,
-    pub edges: Vec<EdgeRow>,
-
-    pub out_index: Vec<Range>,
-    pub out_edges: Vec<OutEdgeRef>,
-
-    pub node_atts_index: Vec<Range>,
-    pub node_atts: Vec<AttRow>,
-
-    pub edge_atts_index: Vec<Range>,
-    pub edge_atts: Vec<AttRow>,
-
-    pub blobs: Vec<u8>,
-}
-```
-
-Then write_wsc_one_warp(input: OneWarpInput, ...) stays the same, just without lifetimes.
-
-⸻
-
-1. The bridge: build_one_warp_input(&GraphStore, root_node_id)
-
-Put this in wsc/build.rs. This is the "money function" that turns your pointer-jungle into canonical slabs.
-
-```rust
-use std::collections::BTreeMap;
-
-use crate::attachment::AttachmentValue;
-use crate::graph::GraphStore;
-use crate::ident::{EdgeId, NodeId};
-use crate::record::EdgeRecord;
-
-use super::types::{AttRow, EdgeRow, NodeRow, OutEdgeRef, Range};
-use super::write::OneWarpInput;
-
-pub fn build_one_warp_input(store: &GraphStore, root_node_id: NodeId) -> OneWarpInput {
-    // NODES (already sorted)
-    let nodes: Vec<(NodeId, crate::record::NodeRecord)> =
-        store.nodes.iter().map(|(id, rec)| (*id, rec.clone())).collect();
-
-    let node_rows: Vec<NodeRow> = nodes
-        .iter()
-        .map(|(id, rec)| NodeRow {
-            node_id: id.0,
-            node_type: rec.ty.0,
-        })
-        .collect();
-
-    // EDGES (collect global, sort by EdgeId)
-    let mut edges_all: Vec<EdgeRecord> = store.edges_from.values().flatten().cloned().collect();
-    edges_all.sort_by_key(|e| e.id);
-
-    let edge_rows: Vec<EdgeRow> = edges_all
-        .iter()
-        .map(|e| EdgeRow {
-            edge_id: e.id.0,
-            from_node_id: e.from.0,
-            to_node_id: e.to.0,
-            edge_type: e.ty.0,
-        })
-        .collect();
-
-    // EdgeId -> edge_ix
-    let mut edge_ix: BTreeMap<EdgeId, u64> = BTreeMap::new();
-    for (ix, e) in edges_all.iter().enumerate() {
-        edge_ix.insert(e.id, ix as u64);
-    }
-
-    // OUT_INDEX / OUT_EDGES (node_ix order; bucket sorted by EdgeId)
-    let mut out_index: Vec<Range> = Vec::with_capacity(node_rows.len());
-    let mut out_edges: Vec<OutEdgeRef> = Vec::new();
-
-    for (node_id, _) in &nodes {
-        let start = out_edges.len() as u64;
-
-        let mut bucket: Vec<&EdgeRecord> = store
-            .edges_from
-            .get(node_id)
-            .map(|v| v.iter().collect())
-            .unwrap_or_default();
-
-        bucket.sort_by_key(|e| e.id);
-
-        for e in bucket {
-            let ix = *edge_ix.get(&e.id).expect("edge_ix missing for edge");
-            out_edges.push(OutEdgeRef {
-                edge_ix_le: ix.to_le(),
-                edge_id: e.id.0,
-            });
-        }
-
-        let len = (out_edges.len() as u64) - start;
-        out_index.push(Range {
-            start_le: start.to_le(),
-            len_le: len.to_le(),
-        });
-    }
-
-    // Attachments + blobs
-    let mut blobs: Vec<u8> = Vec::new();
-
-    let mut node_atts_index: Vec<Range> = Vec::with_capacity(node_rows.len());
-    let mut node_atts: Vec<AttRow> = Vec::new();
-
-    for (node_id, _) in &nodes {
-        let start = node_atts.len() as u64;
-
-        if let Some(att) = store.node_attachments.get(node_id) {
-            node_atts.push(att_to_row(att, &mut blobs));
-        }
-
-        let len = (node_atts.len() as u64) - start;
-        node_atts_index.push(Range {
-            start_le: start.to_le(),
-            len_le: len.to_le(),
-        });
-    }
-
-    let mut edge_atts_index: Vec<Range> = Vec::with_capacity(edge_rows.len());
-    let mut edge_atts: Vec<AttRow> = Vec::new();
-
-    for e in &edges_all {
-        let start = edge_atts.len() as u64;
-
-        if let Some(att) = store.edge_attachments.get(&e.id) {
-            edge_atts.push(att_to_row(att, &mut blobs));
-        }
-
-        let len = (edge_atts.len() as u64) - start;
-        edge_atts_index.push(Range {
-            start_le: start.to_le(),
-            len_le: len.to_le(),
-        });
-    }
-
-    OneWarpInput {
-        warp_id: store.warp_id.0,
-        root_node_id: root_node_id.0,
-
-        nodes: node_rows,
-        edges: edge_rows,
-
-        out_index,
-        out_edges,
-
-        node_atts_index,
-        node_atts,
-
-        edge_atts_index,
-        edge_atts,
-
-        blobs,
-    }
-}
-
-fn att_to_row(att: &AttachmentValue, blobs: &mut Vec<u8>) -> AttRow {
-    match att {
-        AttachmentValue::Atom(atom) => {
-            align8(blobs);
-            let off = blobs.len() as u64;
-            let bytes: &[u8] = atom.bytes.as_ref();
-            blobs.extend_from_slice(bytes);
-            let len = bytes.len() as u64;
-
-            AttRow {
-                tag: 1,
-                reserved0: [0u8; 7],
-                type_or_warp: atom.type_id.0,
-                blob_off_le: off.to_le(),
-                blob_len_le: len.to_le(),
-            }
-        }
-        AttachmentValue::Descend(warp_id) => AttRow {
-            tag: 2,
-            reserved0: [0u8; 7],
-            type_or_warp: warp_id.0,
-            blob_off_le: 0u64.to_le(),
-            blob_len_le: 0u64.to_le(),
-        },
-    }
-}
-
-fn align8(v: &mut Vec<u8>) {
-    while v.len() % 8 != 0 {
-        v.push(0);
-    }
-}
-```
-
-⸻
-
-1. One-liner convenience API
-
-Add this helper (e.g. wsc/mod.rs or wsc/write.rs):
-
-```rust
-use std::io;
-use std::path::Path;
-
-use crate::graph::GraphStore;
-use crate::ident::NodeId;
-
-use super::build::build_one_warp_input;
-use super::write::write_wsc_one_warp;
-
-pub fn save_wsc(
-    path: impl AsRef<Path>,
-    store: &GraphStore,
-    root_node_id: NodeId,
-    schema_hash: [u8; 32],
-    tick: u64,
-) -> io::Result<()> {
-    let input = build_one_warp_input(store, root_node_id);
-    let bytes = write_wsc_one_warp(input, schema_hash, tick)?;
-    std::fs::write(path, bytes)
-}
-```
-
-Now you can call:
-
-```rust
-save_wsc("state.wsc", &store, root_node_id, schema_hash, tick)?;
-```
-
-⸻
-
-1. Determinism tests (this is the “don’t lie to yourself” suite)
-
-5.1 Snapshot bytes identical across insertion order
-
-```rust
-#[test]
-fn wsc_bytes_stable_across_edge_insertion_order() {
-    use crate::ident::{make_edge_id, make_node_id, make_type_id, make_warp_id};
-    use crate::record::{EdgeRecord, NodeRecord};
-
-    let node_ty = make_type_id("node");
-    let edge_ty = make_type_id("edge");
-    let warp = make_warp_id("root");
-
-    let a = make_node_id("a");
-    let b = make_node_id("b");
-    let c = make_node_id("c");
-
-    let e1 = make_edge_id("a->b");
-    let e2 = make_edge_id("a->c");
-    let e3 = make_edge_id("c->b");
-
-    let mut s1 = crate::graph::GraphStore::new(warp);
-    for n in [a,b,c] { s1.insert_node(n, NodeRecord { ty: node_ty }); }
-    // insert edges in one order
-    s1.insert_edge(a, EdgeRecord { id: e1, from: a, to: b, ty: edge_ty });
-    s1.insert_edge(a, EdgeRecord { id: e2, from: a, to: c, ty: edge_ty });
-    s1.insert_edge(c, EdgeRecord { id: e3, from: c, to: b, ty: edge_ty });
-
-    let mut s2 = crate::graph::GraphStore::new(warp);
-    for n in [a,b,c] { s2.insert_node(n, NodeRecord { ty: node_ty }); }
-    // insert edges in a different order
-    s2.insert_edge(c, EdgeRecord { id: e3, from: c, to: b, ty: edge_ty });
-    s2.insert_edge(a, EdgeRecord { id: e2, from: a, to: c, ty: edge_ty });
-    s2.insert_edge(a, EdgeRecord { id: e1, from: a, to: b, ty: edge_ty });
-
-    let schema_hash = [0u8; 32];
-    let tick = 0;
-
-    let bytes1 = crate::wsc::write::write_wsc_one_warp(
-        crate::wsc::build::build_one_warp_input(&s1, a),
-        schema_hash,
-        tick,
-    ).unwrap();
-
-    let bytes2 = crate::wsc::write::write_wsc_one_warp(
-        crate::wsc::build::build_one_warp_input(&s2, a),
-        schema_hash,
-        tick,
-    ).unwrap();
-
-    assert_eq!(bytes1, bytes2, "WSC bytes must be canonical");
-}
-```
-
-5.2 Roundtrip: reopen via mmap and validate invariants
-
-This assumes you've wired up WscFile::open() + validate_wsc() (from earlier).
-
-```rust
-#[test]
-fn wsc_roundtrip_open_and_validate() {
-    use crate::ident::{make_node_id, make_type_id, make_warp_id};
-    use crate::record::NodeRecord;
-
-    let warp = make_warp_id("root");
-    let node_ty = make_type_id("node");
-
-    let a = make_node_id("a");
-    let mut store = crate::graph::GraphStore::new(warp);
-    store.insert_node(a, NodeRecord { ty: node_ty });
-
-    let schema_hash = [0u8; 32];
-    let bytes = crate::wsc::write::write_wsc_one_warp(
-        crate::wsc::build::build_one_warp_input(&store, a),
-        schema_hash,
-        0,
-    ).unwrap();
-
-    let path = std::env::temp_dir().join("test_state.wsc");
-    std::fs::write(&path, &bytes).unwrap();
-
-    let file = crate::wsc::WscFile::open(&path).unwrap();
-    let view = file.warp_view(0).unwrap();
-
-    // Basic sanity
-    assert_eq!(view.nodes().len(), 1);
-    assert!(view.node_ix(&a.0).is_some());
-}
-```
-
-⸻
-
-1. (Strongly recommended) Version your canonical hash
-
-Keep DIND_STATE_HASH_V1 but add V2 using u64 counts/lengths. That way your “snapshot hash” and “state hash” won’t diverge later for stupid reasons.
diff --git a/docs/adr/ADR-0007-impl.md b/docs/adr/ADR-0007-impl.md
index 3c7db14e..72a876ad 100644
--- a/docs/adr/ADR-0007-impl.md
+++ b/docs/adr/ADR-0007-impl.md
@@ -1,3185 +1,814 @@
 <!-- SPDX-License-Identifier: Apache-2.0 OR MIND-UCAL-1.0 -->
 <!-- © James Ross Ω FLYING•ROBOTS <https://github.com/flyingrobots> -->
-<!-- markdownlint-disable MD007 MD029 MD033 MD046 -->
-
-Perfect! Now I have a comprehensive understanding. Let me create a summary document for you.
-
-       Summary: warp-core Module Organization & Architecture
-
-       Based on my thorough exploration of /Users/james/git/echo/crates/warp-core/src, here's a detailed breakdown of
-       the module structure, key components, and their responsibilities.
-
-       ---
-       1. OVERALL MODULE ORGANIZATION
-
-       The crate is organized into several architectural layers:
-
-       Core Modules (42 Rust files total)
-
-       Public API Modules:
-       - math/ - Deterministic math subsystem (Vec3, Mat4, Quat, PRNG, trigonometry)
-       - wsc/ - Write-Streaming Columnar snapshot format
-       - inbox/ - Canonical inbox management for deterministic intent sequencing
-       - materialization/ - Channel-based output subsystem
-       - fixed/ - Q32.32 fixed-point helpers
-
-       Private Infrastructure Modules:
-       - engine_impl.rs (1806 lines) - Core rewrite engine
-       - scheduler.rs (1304 lines) - Deterministic radix-sort scheduler
-       - tick_patch.rs (1694 lines) - Delta boundary artifacts (Paper III)
-       - graph.rs (568 lines) - In-memory graph store
-       - snapshot.rs (350 lines) - State snapshots and hash computation
-       - receipt.rs (241 lines) - Tick receipts (accepted/rejected rewrites)
-       - footprint.rs (250 lines) - Independence checks and read/write tracking
-       - rule.rs (84 lines) - Rewrite rule definitions
-       - attachment.rs (403 lines) - Polymorphic payload system
-       - payload.rs (304 lines) - Motion atom encoding/decoding
-       - warp_state.rs (116 lines) - Multi-instance WARP state (Stage B1)
-
-       Supporting Modules:
-       - ident.rs (162 lines) - Identifier types and hashing
-       - record.rs - Node/edge record definitions
-       - tx.rs - Transaction identifiers
-       - telemetry.rs - Observability hooks
-       - sandbox.rs - Testing harness
-       - serializable.rs - Serde support (feature-gated)
-       - constants.rs - Constants and policy IDs
-
-       ---
-       2. GRAPHSTORE DEFINITION & USAGE
-
-       Location: /Users/james/git/echo/crates/warp-core/src/graph.rs
-
-       Purpose: In-memory graph storage for the rewrite executor and tests. The production engine will eventually swap
-       in a content-addressed store, but this structure keeps the spike self-contained.
-
-       Key Structure:
-       pub struct GraphStore {
-           pub(crate) warp_id: WarpId,
-           pub(crate) nodes: BTreeMap<NodeId, NodeRecord>,
-           pub(crate) edges_from: BTreeMap<NodeId, Vec<EdgeRecord>>,  // Source → edges
-           pub(crate) edges_to: BTreeMap<NodeId, Vec<EdgeId>>,        // Reverse: target ← edge ids
-           pub(crate) node_attachments: BTreeMap<NodeId, AttachmentValue>,
-           pub(crate) edge_attachments: BTreeMap<EdgeId, AttachmentValue>,
-           pub(crate) edge_index: BTreeMap<EdgeId, NodeId>,           // Reverse lookup: edge → from
-           pub(crate) edge_to_index: BTreeMap<EdgeId, NodeId>,        // Reverse lookup: edge → to
-       }
-
-       Key API Operations:
-       - insert_node(id, record) - Add/replace node
-       - insert_edge(from, edge) - Add/replace directed edge with upsert semantics
-       - delete_node_isolated(node) - Remove isolated node (rejects if edges exist)
-       - delete_node_cascade(node) - [INTERNAL] Remove node and all incident edges
-       - delete_edge_exact(from, edge_id) - Remove specific edge
-       - canonical_state_hash() - Deterministic BLAKE3 digest over full graph (V2 format)
-       - Iteration: iter_nodes(), iter_edges(), iter_node_attachments(), iter_edge_attachments()
-
-       Determinism Contract:
-       - All maps use BTreeMap for stable iteration order
-       - Edge hashing sorts all edges by EdgeId before encoding
-       - Attachment hashing includes type_id + u64 LE length + bytes
-       - Node count and edge count encoded as u64 LE for WSC alignment
-
-       Usage in Engine:
-       - Wrapped in WarpState for multi-instance support (Stage B1)
-       - Modified during rewrite execution via rule's ExecuteFn
-       - Snapshotted after tick commit to verify determinism
-       - Replayed via TickPatch for delta reconstruction
-
-       ---
-       3. EXECUTOR/REWRITE PIPELINE CODE
-
-       Main Engine: /Users/james/git/echo/crates/warp-core/src/engine_impl.rs (1806 lines)
-
-       High-Level Pipeline:
-
-       ┌──────────────────────────────────────┐
-       │  EngineBuilder (fluent constructor)  │
-       └──────────────┬──────────────────────┘
-                      │
-                      ▼
-                ┌─────────────┐
-                │   Engine    │  Owns:
-                └─────────────┘  - WarpState (graph stores)
-                      │         - Registered RewriteRules
-                      │         - DeterministicScheduler
-                      │         - TickHistory
-                      │         - MaterializationBus
-                      │
-            ┌─────────┼─────────┐
-            │         │         │
-            ▼         ▼         ▼
-       ┌─────────┐ ┌──────────┐ ┌────────────────┐
-       │ Ingest  │ │ Dispatch │ │  Tick Commit   │
-       │ Intent  │ │  Intent  │ │  + Finalize    │
-       └─────────┘ └──────────┘ └────────────────┘
-            │         │              │
-            └─────────┼──────────────┘
-                      │
-                      ▼
-                ┌─────────────────────┐
-                │ Rewrite Execution   │
-                │ (Matching & Apply)  │
-                └─────────────────────┘
-
-       Core Types:
-
-       RewriteRule (/Users/james/git/echo/crates/warp-core/src/rule.rs):
-       pub struct RewriteRule {
-           pub id: Hash,                              // Deterministic rule ID
-           pub name: &'static str,                    // Human-readable name
-           pub left: PatternGraph,                    // Pattern metadata
-           pub matcher: MatchFn,                      // fn(&GraphView, &NodeId) -> bool
-           pub executor: ExecuteFn,                   // fn(&GraphView, &mut TickDelta, &NodeId) [Phase 5]
-           pub compute_footprint: FootprintFn,        // fn(&GraphView, &NodeId) -> Footprint
-           pub factor_mask: u64,                      // O(1) spatial prefilter
-           pub conflict_policy: ConflictPolicy,       // Abort, Retry, or Join
-           pub join_fn: Option<JoinFn>,              // Optional join strategy
-       }
-
-       PendingRewrite (scheduler):
-       pub(crate) struct PendingRewrite {
-           pub rule_id: Hash,
-           pub compact_rule: CompactRuleId,           // Hot-path handle
-           pub scope_hash: Hash,                      // Deterministic ordering key
-           pub scope: NodeKey,                        // Scope node reference
-           pub footprint: Footprint,                  // Read/write sets
-           pub phase: RewritePhase,                   // Matched → Reserved → Committed/Aborted
-       }
-
-       Execution Flow:
-
-       1. Registration (register_rule):
-         - Validate rule uniqueness
-         - Assign compact rule ID
-         - Store in lookup maps
-       2. Enqueueing (apply):
-         - Match rule against scope
-         - Compute footprint
-         - Enqueue PendingRewrite with last-wins semantics on (scope_hash, compact_rule)
-       3. Scheduling (radix drain):
-         - Extract pending rewrites in deterministic order: (scope_hash, rule_id, nonce)
-         - Stable LSD radix sort (20 passes: 2 nonce + 2 rule + 16 scope) with 16-bit digits
-         - O(n) complexity, zero comparisons
-       4. Independence Checks:
-         - Check footprint against ActiveFootprints (generation-stamped sets)
-         - O(1) conflict detection via GenSet lookups
-         - Apply conflict policy: Abort, Retry, or Join
-       5. Execution:
-         - Invoke rule's executor callback with mutable GraphStore
-         - Create ScopedEmitter for materialization
-         - Collect emissions in order-independent BTreeMap<EmitKey, Vec<u8>>
-       6. Commit:
-         - Snapshot graph state
-         - Compute state root hash
-         - Finalize materialization channels
-         - Record (Snapshot, TickReceipt, TickPatch) in tick history
-
-       ---
-       4. DELTA/TICK INFRASTRUCTURE
-
-       Location: /Users/james/git/echo/crates/warp-core/src/tick_patch.rs (1694 lines)
-
-       Purpose:
-
-       Tick patches are prescriptive boundary records for one worldline step—sufficient to deterministically replay the
-       tick as a pure delta without re-running rule matching or scheduling.
-
-       Key Types:
-
-       TickCommitStatus:
-       pub enum TickCommitStatus {
-           Committed,  // Successful commit
-           Aborted,    // Reserved for future transactional semantics
-       }
-
-       SlotId (unversioned slot identifiers):
-       pub enum SlotId {
-           Node(NodeKey),           // Full node record (instance-scoped skeleton)
-           Edge(EdgeKey),           // Full edge record (instance-scoped skeleton)
-           Attachment(AttachmentKey), // Node/edge plane payload + Descend links
-           Port(PortKey),           // Boundary port value (opaque key)
-       }
-
-       WarpOp (canonical delta operations):
-       pub enum WarpOp {
-           PortalInit { ... },      // Open descended attachment atomically (Stage B1.1)
-           UpsertNode { ... },      // Insert/replace node record
-           DeleteNode { ... },      // Delete node (cascade edges)
-           UpsertEdge { ... },      // Insert/replace edge record
-           DeleteEdge { ... },      // Delete specific edge
-           SetAttachment { ... },   // Set/clear attachment value
-           // ... more operations
-       }
-
-       WarpTickPatchV1 (minimal intentional format):
-       pub struct WarpTickPatchV1 {
-           pub commit_status: TickCommitStatus,
-           pub ops: Vec<WarpOp>,           // Canonical graph edits
-           pub in_slots: Vec<SlotId>,      // Unversioned input slots
-           pub out_slots: Vec<SlotId>,     // Unversioned output slots
-           pub patch_digest: Hash,         // BLAKE3 digest of patch bytes
-       }
-
-       Determinism Properties:
-
-       - Ops are prescriptive: execute without re-matching
-       - in_slots/out_slots are unversioned (Paper III-compatible)
-       - Value versioning recovered via (slot_id, tick_index) interpretation
-       - Patch digest committed to snapshot for boundary verification
-
-       Usage in Engine:
-
-       - diff_state() computes patch after commit
-       - Tick history stores: Vec<(Snapshot, TickReceipt, WarpTickPatchV1)>
-       - Used by jump_to_tick(index) for deterministic replay
-       - Future: replayed to recover intermediate state without re-running rules
-
-       ---
-       5. SCHEDULER & INDEPENDENCE CHECKING
-
-       Location: /Users/james/git/echo/crates/warp-core/src/scheduler.rs (1304 lines)
-
-       RadixScheduler:
-
-       pub(crate) struct RadixScheduler {
-           pending: HashMap<TxId, PendingTx<PendingRewrite>>,
-           pub(crate) active: HashMap<TxId, ActiveFootprints>,
-       }
-
-       ActiveFootprints (generation-stamped conflict detection):
-
-       pub(crate) struct ActiveFootprints {
-           nodes_written: GenSet<NodeKey>,
-           nodes_read: GenSet<NodeKey>,
-           edges_written: GenSet<EdgeKey>,
-           edges_read: GenSet<EdgeKey>,
-           attachments_written: GenSet<AttachmentKey>,
-           attachments_read: GenSet<AttachmentKey>,
-           ports: GenSet<PortKey>,
-       }
-
-       Key Operations:
-
-       - enqueue(tx, rewrite) - Last-wins on (scope_hash, compact_rule)
-       - drain_for_tx(tx) - Returns pending rewrites in deterministic order
-       - try_reserve(rewrite) - O(m) footprint independence check via GenSet
-
-       Deterministic Ordering:
-
-       Lexicographic order: (scope_hash, rule_id, nonce)
-       - scope_hash: Full 32-byte node hash
-       - rule_id: Compact rule identifier
-       - nonce: Insertion order tiebreaker
-
-       ---
-       6. MATERIALIZATION SUBSYSTEM
-
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/
-
-       Architecture:
-
-       External World
-            │
-            ▲ (ViewOps frames)
-            │
-       ┌────┴──────────────┐
-       │ MaterializationPort │  ← Boundary API
-       └────┬──────────────┘
-            │
-       ┌────┴──────────────┐
-       │ MaterializationBus  │  ← Internal Runtime
-       └────┬──────────────┘
-            │
-       ┌────┴──────────────┐
-       │      Engine        │  commit → finalize
-       └───────────────────┘
-
-       Key Components:
-
-       ChannelId (256-bit hash from domain-separated label):
-       pub fn make_channel_id(label: &str) -> ChannelId
-
-       ChannelPolicy (finalization strategies):
-       pub enum ChannelPolicy {
-           Log,              // All emissions in EmitKey order (default, confluence-safe)
-           StrictSingle,     // Error if >1 emission (single-writer enforcement)
-           Reduce(ReduceOp), // Merge via commutative operation (Sum, First, etc.)
-       }
-
-       EmitKey (order-independent emission identifiers):
-       pub struct EmitKey {
-           pub scope_hash: Hash,      // Hash of scope node
-           pub rule_id: u32,          // Compact rule ID
-           pub subkey: u32,           // Optional differentiator (default 0)
-       }
-       Lexicographic ordering ensures deterministic finalization regardless of rule execution order.
-
-       ScopedEmitter (context-aware emission adapter):
-       pub struct ScopedEmitter<'a> {
-           bus: &'a MaterializationBus,
-           scope_hash: Hash,          // Auto-filled from execution context
-           rule_id: u32,              // Prevents rule forgery
-       }
-       - emit(channel, data) - Emit with subkey 0
-       - emit_with_subkey(channel, subkey, data) - Multi-emission support
-
-       MaterializationBus (tick-scoped collection):
-       pub struct MaterializationBus {
-           pending: RefCell<BTreeMap<ChannelId, BTreeMap<EmitKey, Vec<u8>>>>,
-           policies: BTreeMap<ChannelId, ChannelPolicy>,
-       }
-       - Collects emissions during tick execution
-       - Finalizes post-commit according to policies
-       - Not thread-safe by design (single-threaded tick execution)
-
-       MaterializationPort (external subscription interface):
-       pub struct MaterializationPort {
-           subscriptions: BTreeSet<ChannelId>,
-           replay_cache: BTreeMap<ChannelId, Vec<u8>>,     // Replay(1) semantics
-           pending_frames: Vec<MaterializationFrame>,
-       }
-       - Subscribe to channels
-       - Receive cached values (late-joiner support)
-       - Drain pending frames for transport
-
-       Confluence Safety:
-
-       - EmitKey ordering derived from scheduler's canonical order
-       - All policies preserve confluence (no silent "winner picks")
-       - Duplicate emissions rejected (catches non-deterministic iteration)
-
-       ---
-       7. TICK RECEIPTS & SNAPSHOTS
-
-       TickReceipt (/Users/james/git/echo/crates/warp-core/src/receipt.rs):
-       pub struct TickReceipt {
-           tx: TxId,
-           entries: Vec<TickReceiptEntry>,    // Per-candidate outcomes
-           blocked_by: Vec<Vec<u32>>,         // Blocking causality poset
-           digest: Hash,                       // Canonical commitment
-       }
-       - Records accepted vs rejected rewrites
-       - Captures blocking causality (which accepted rewrites blocked rejections)
-       - Digest commits to decision outcomes
-
-       Snapshot (/Users/james/git/echo/crates/warp-core/src/snapshot.rs):
-       pub struct Snapshot {
-           pub root: NodeKey,
-           pub hash: Hash,                    // Commit ID (v2)
-           pub parents: Vec<Hash>,            // Parent snapshot hashes
-           pub plan_digest: Hash,             // Candidate set + ordering
-           pub decision_digest: Hash,         // Tick receipt outcomes
-           pub rewrites_digest: Hash,         // Applied rewrites
-           pub patch_digest: Hash,            // Tick patch boundary
-           pub policy_id: u32,                // Aion policy version pin
-           pub tx: TxId,
-       }
-       - state_root: Graph-only BLAKE3 hash
-       - commit_id (v2): state_root + patch_digest + parents + policy_id
-       - Deterministic across node, edge, and attachment traversal
-
-       ---
-       8. KEY INVARIANTS & DETERMINISM
-
-       Ordering Guarantees:
-       - All maps use BTreeMap for stable iteration
-       - Rewrites execute in (scope_hash, rule_id, nonce) order (O(n) radix sort)
-       - Channel emissions finalized in (channel, scope_hash, rule_id, subkey) order
-
-       Determinism Boundaries:
-       - Wire Format: Canonical CBOR (via echo_wasm_abi)
-       - JSON: Forbidden for protocol; allowed only for debug/telemetry
-       - Float Math: Optimistic IEEE 754 by default; det_fixed feature for strict consensus
-       - Hashing: BLAKE3 with architecture-independent encoding (u64 LE lengths)
-
-       Footprint Independence:
-       - O(1) conflict detection via generation-stamped sets (GenSet)
-       - Checks: node read/write, edge read/write, attachment, ports
-       - O(m) reserve time where m = footprint size
-
-       ---
-       9. EXAMPLE WORKFLOW: FULL TICK EXECUTION
-
-       1. ingest_intent(payload) → IngestDisposition
-          ↓ (queued in inbox)
-
-       2. dispatch_next_intent() → DispatchDisposition
-          ↓ (pending edge consumed)
-
-       3. apply(rule, scope) → ApplyResult
-          ├─ matcher(store, scope) → bool
-          ├─ compute_footprint(store, scope) → Footprint
-          └─ enqueue PendingRewrite
-          ↓
-
-       4. commit_with_receipt() → (Snapshot, TickReceipt, Report)
-          ├─ drain_for_tx() in (scope_hash, rule_id, nonce) order
-          ├─ For each rewrite:
-          │  ├─ try_reserve(footprint) → bool
-          │  ├─ executor(store, scope)  [calls emit() via ScopedEmitter]
-          │  └─ record outcome (Applied/Rejected)
-          │
-          ├─ Finalize MaterializationBus:
-          │  ├─ Group emissions by (channel, EmitKey)
-          │  ├─ Apply ChannelPolicy to each channel
-          │  └─ Produce FinalizeReport (channels + errors)
-          │
-          ├─ Snapshot graph:
-          │  ├─ canonical_state_hash()
-          │  ├─ Compute commit_id (v2)
-          │  └─ Store in tick_history
-          │
-          ├─ Compute tick patch:
-          │  ├─ diff_state() against previous
-          │  └─ Generate WarpTickPatchV1
-          │
-          └─ Return to caller
-          ↓
-
-       5. receive_finalized(channels) @ MaterializationPort
-          ├─ Update replay cache
-          └─ Queue frames for subscribed channels
-
-       ---
-       10. FILE SUMMARY TABLE
-
-       ┌──────────────────┬───────┬───────────────────────────────────────────────────┐
-       │       File       │ Lines │                      Purpose                      │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ engine_impl.rs   │ 1806  │ Core rewrite engine, builder, tick execution      │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ tick_patch.rs    │ 1694  │ Delta operations and patch types (Paper III)      │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ scheduler.rs     │ 1304  │ Radix scheduler + footprint independence checks   │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ graph.rs         │ 568   │ In-memory graph store (nodes, edges, attachments) │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ snapshot.rs      │ 350   │ State snapshots and hash computation              │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ attachment.rs    │ 403   │ Polymorphic payload system (Atom, Descend)        │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ payload.rs       │ 304   │ Motion atom encoding/decoding                     │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ receipt.rs       │ 241   │ Tick receipts (accepted/rejected outcomes)        │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ footprint.rs     │ 250   │ Footprints and independence tracking              │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ inbox.rs         │ 210   │ Inbox management and intent queuing               │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ materialization/ │ ~60   │ Channel emissions, ports, frames                  │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ warp_state.rs    │ 116   │ Multi-instance WARP state (Stage B1)              │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ rule.rs          │ 84    │ Rewrite rule definitions                          │
-       ├──────────────────┼───────┼───────────────────────────────────────────────────┤
-       │ ident.rs         │ 162   │ Identifier types and hashing                      │
-       └──────────────────┴───────┴───────────────────────────────────────────────────┘
-       ---
-       This is a sophisticated, determinism-first engine architecture with clear separation between execution (rules +
-       scheduler), storage (GraphStore), and output (materialization). The key innovation is the order-independent
-       materialization system backed by deterministic ordering of emissions.
-
-⎿  Done (23 tool uses · 85.5k tokens · 1m 21s)
-
-⏺ Explore(Explore WSC implementation)
-⎿  Prompt:
-Explore the WSC (WARP Snapshot Container) implementation in the codebase. Look for: 1. WscFile, WarpView, or similar snapshot-related code 2. How snapshots are read/written 3. Any existing zero-copy or mmap infrastructure 4. Segment or blob arena handling
-
-       Search in crates/warp-core and any related locations. This is research only - do not modify any code.
-
-⎿  ❯ Explore the WSC (WARP Snapshot Container) implementation in the codebase. Look for: 1. WscFile, WarpView, or similar snapshot-related code 2. How snapshots are read/written 3. Any existing zero-copy or mmap infrastructure 4. Segment or blob arena handling
-
-       Search in crates/warp-core and any related locations. This is research only - do not modify any code.
-
-⎿  Search(pattern: "**/warp-core/**/\*.rs")
-
-⎿  Search(pattern: "WscFile|WarpView|snapshot", type: "rs")
-
-⎿  Search(pattern: "zero.copy|mmap|MemoryMap", type: "rs")
-
-⎿  Search(pattern: "\*\*/warp-core/Cargo.toml")
-
-⎿    ⎿  Found 0 files
-
-⎿    ⎿  Found 0 files
-
-⎿    ⎿  Found 1 file
-/Users/james/git/echo/crates/warp-core/Cargo.toml
-⎿    ⎿  Found 81 files
-/Users/james/git/echo/crates/warp-core/build.rs
-/Users/james/git/echo/crates/warp-core/src/footprint.rs
-/Users/james/git/echo/crates/warp-core/src/rule.rs
-/Users/james/git/echo/crates/warp-core/src/sandbox.rs
-/Users/james/git/echo/crates/warp-core/tests/atom_payload_digest_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/footprint_independence_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/mat4_mul_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_additional_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_convenience_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/nan_exhaustive_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/snapshot_reachability_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/vec3_ops_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_rotation_tests.rs
-/Users/james/git/echo/crates/warp-core/src/math/mat4.rs
-/Users/james/git/echo/crates/warp-core/src/math/trig_lut.rs
-/Users/james/git/echo/crates/warp-core/src/attachment.rs
-/Users/james/git/echo/crates/warp-core/src/cmd.rs
-/Users/james/git/echo/crates/warp-core/src/record.rs
-/Users/james/git/echo/crates/warp-core/src/serializable.rs
-/Users/james/git/echo/crates/warp-core/src/snapshot.rs
-/Users/james/git/echo/crates/warp-core/src/tx.rs
-/Users/james/git/echo/crates/warp-core/src/warp_state.rs
-/Users/james/git/echo/crates/warp-core/tests/determinism_audit.rs
-/Users/james/git/echo/crates/warp-core/tests/ledger_tests.rs
-/Users/james/git/echo/crates/warp-core/src/bin/gen_sin_qtr_lut.rs
-/Users/james/git/echo/crates/warp-core/src/constants.rs
-/Users/james/git/echo/crates/warp-core/src/inbox.rs
-/Users/james/git/echo/crates/warp-core/src/math/fixed_q32_32.rs
-/Users/james/git/echo/crates/warp-core/src/math/mod.rs
-/Users/james/git/echo/crates/warp-core/src/math/prng.rs
-/Users/james/git/echo/crates/warp-core/src/math/quat.rs
-/Users/james/git/echo/crates/warp-core/src/math/scalar.rs
-/Users/james/git/echo/crates/warp-core/src/math/trig.rs
-/Users/james/git/echo/crates/warp-core/src/math/vec3.rs
-/Users/james/git/echo/crates/warp-core/src/payload.rs
-/Users/james/git/echo/crates/warp-core/src/receipt.rs
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs
-/Users/james/git/echo/crates/warp-core/src/telemetry.rs
-/Users/james/git/echo/crates/warp-core/src/tick_patch.rs
-/Users/james/git/echo/crates/warp-core/tests/determinism_policy_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/deterministic_sin_cos_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/dfix64_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/dispatch_inbox.rs
-/Users/james/git/echo/crates/warp-core/tests/dpo_concurrency_litmus.rs
-/Users/james/git/echo/crates/warp-core/tests/duplicate_rule_registration_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/engine_motion_negative_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/engine_motion_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/inbox.rs
-/Users/james/git/echo/crates/warp-core/tests/math_scalar_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_validation.rs
-/Users/james/git/echo/crates/warp-core/tests/permutation_commute_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/property_commute_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/proptest_seed_pinning.rs
-/Users/james/git/echo/crates/warp-core/tests/reserve_gate_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/tick_receipt_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/tx_lifecycle_tests.rs
-/Users/james/git/echo/crates/warp-core/src/fixed.rs
-/Users/james/git/echo/crates/warp-core/src/graph.rs
-/Users/james/git/echo/crates/warp-core/src/ident.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/build.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/mod.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/read.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/types.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/view.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/write.rs
-/Users/james/git/echo/crates/warp-core/src/lib.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/emit_key.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/port.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/emission_port.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/channel.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/reduce_op.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/scoped_emitter.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_engine_integration.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/mod.rs
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/bus.rs
-/Users/james/git/echo/crates/warp-core/tests/common/mod.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_spec_police.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_determinism.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/frame.rs
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc/mod.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc/types.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc/view.rs)
-
-⎿  Error: EISDIR: illegal operation on a directory, read
-
-⎿  Read 63 lines
-
-⎿  Read 301 lines
-
-⎿  Read 499 lines
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc/read.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc/write.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc/build.rs)
-
-⎿  Read 312 lines
-
-⎿  Read 302 lines
-
-⎿  Read 581 lines
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/snapshot_reachability_tests.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/Cargo.toml)
-
-⎿  Read 656 lines
-
-⎿  Read 72 lines
-
-⎿  Read 53 lines
-
-⎿  Search(pattern: "blob|arena|segment", path: "/Users/james/git/echo/crates/warp-core/src", type: "rs")
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/attachment.rs · lines 1-200)
-
-⎿  Search(pattern: "mmap|MemoryMap|memory.map", path: "/Users/james/git/echo/crates", type: "rs")
-
-⎿  Read 200 lines
-
-⎿    ⎿  Found 0 files
-
-⎿    ⎿  Found 0 files
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/graph.rs · lines 1-250)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/snapshot.rs · lines 1-150)
-
-⎿  Bash(grep -r "WscFile\|WarpView" /Users/james/git/echo/crates/warp-core --include="\*.rs" | head -20)
-Waiting…
-⎿  Read 250 lines
-
-⎿  Read 150 lines
-
-⎿  /Users/james/git/echo/crates/warp-core/src/wsc/mod.rs://! use warp*core::wsc::{WscFile, validate_wsc};
-/Users/james/git/echo/crates/warp-core/src/wsc/mod.rs://! let file = WscFile::open("state.wsc")?;
-/Users/james/git/echo/crates/warp-core/src/wsc/mod.rs:pub use view::{AttachmentRef, WarpView, WscFile};
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs:use super::view::WscFile;
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs:pub fn validate_wsc(file: &WscFile) -> Result<(), ReadError>
-{
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs:fn validate_warp_view(view: &super::view::WarpView<'*>) ->
-Result<(), ReadError> {
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs: let file = WscFile::from_bytes(bytes).unwrap();
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/frame.rs · lines 1-300)
-
-⎿  Bash(head -100 /Users/james/git/echo/crates/warp-core/src/materialization/bus.rs)
-Waiting…
-⎿  Read 255 lines
-
-⎿  // SPDX-License-Identifier: Apache-2.0
-// © James Ross Ω FLYING•ROBOTS <https://github.com/flyingrobots>
-//! Internal materialization bus for tick-scoped channel emissions.
-//!
-//! The [`MaterializationBus`] collects emissions from rewrite rules during a tick.
-//! Emissions are stored in an order-independent manner (keyed by [`EmitKey`]),
-//! then finalized post-commit according to each channel's policy.
-//!
-//! # Order Independence
-//!
-//! The bus uses `BTreeMap<ChannelId, BTreeMap<EmitKey, Vec<u8>>>` internally.
-//! This ensures that:
-//! 1. Insertion order doesn't affect the final result
-//! 2. Finalization iterates in deterministic (canonical) order
-//! 3. Confluence is preserved regardless of rewrite execution order
-//!
-//! # Usage
-//!
-//! Rules emit via `bus.emit(channel, emit_key, data)`. After commit, the engine
-//! calls `bus.finalize()` to resolve each channel according to its policy and
-//! produce the final output.
-
-     use std::cell::RefCell;
-     use std::collections::btree_map::Entry;
-     use std::collections::BTreeMap;
-
-     use super::channel::{ChannelConflict, ChannelId, ChannelPolicy, MaterializationErrorKind};
-     use super::emit_key::EmitKey;
-
-     /// Error returned when the same `(channel, EmitKey)` pair is emitted twice.
-     ///
-     /// This is a structural invariant: even if the payloads are identical, duplicate
-     /// emissions indicate a bug in the rule (e.g., iterating a non-deterministic source
-     /// like an unordered container without proper subkey differentiation).
-     ///
-     /// # Why Reject Identical Payloads?
-     ///
-     /// Allowing "identical payload = OK" encourages sloppy code that emits redundantly.
-     /// Then someone changes a field and tests fail mysteriously. Rejecting always forces
-     /// rule authors to think: "Am I iterating deterministically? Do I need unique subkeys?"
-     #[derive(Debug, Clone, PartialEq, Eq)]
-     pub struct DuplicateEmission {
-         /// The channel that received the duplicate.
-         pub channel: ChannelId,
-         /// The key that was duplicated.
-         pub key: EmitKey,
-     }
-
-     impl core::fmt::Display for DuplicateEmission {
-         fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
-             write!(
-                 f,
-                 "duplicate emission for channel {:?} key {:?}",
-                 self.channel, self.key
-             )
-         }
-     }
-
-     impl std::error::Error for DuplicateEmission {}
-
-     /// Internal materialization bus for collecting and finalizing channel emissions.
-     ///
-     /// This is tick-scoped: emissions accumulate during a tick, then `finalize()` is
-     /// called post-commit to produce output. The bus is cleared after finalization.
-     ///
-     /// # Thread Safety
-     ///
-     /// `MaterializationBus` uses [`RefCell`] for interior mutability and is intentionally
-     /// **not thread-safe** (`!Sync`). This is by design: emissions occur within a single
-     /// tick's execution context, which is single-threaded. The rewrite engine processes
-     /// rules sequentially within a tick, so no synchronization is needed.
-     ///
-     /// If parallel emission were ever required (e.g., concurrent rule execution), the
-     /// design would need to change to use `RwLock<BTreeMap<...>>` or similar.
-     #[derive(Debug, Default)]
-     pub struct MaterializationBus {
-         /// Pending emissions: `channel -> (emit_key -> data)`.
-         /// Uses `BTreeMap` for deterministic iteration order.
-         pending: RefCell<BTreeMap<ChannelId, BTreeMap<EmitKey, Vec<u8>>>>,
-
-         /// Channel policies (looked up during finalization).
-         policies: BTreeMap<ChannelId, ChannelPolicy>,
-     }
-
-     /// Result of finalizing a single channel.
-     #[derive(Debug, Clone)]
-     pub struct FinalizedChannel {
-         /// The channel that was finalized.
-         pub channel: ChannelId,
-         /// The finalized data (format depends on policy).
-         pub data: Vec<u8>,
-     }
-
-     /// Report from finalizing all channels.
-     ///
-     /// Unlike a `Result`, this type always succeeds. Channels that finalize
-     /// successfully appear in `channels`; channels that fail (e.g., `StrictSingle`
-     /// conflicts) appear in `errors`. This design ensures:
-     ///
-     /// 1. **No data loss**: A failing channel doesn't erase other channels' outputs
-
-⎿  Read(/Users/james/git/echo/docs/adr/ADR-0007-BOAW-Storage.md)
-
-⎿  Read 1129 lines
-
-⎿  Response:
-Perfect! Now I have a comprehensive understanding. Let me create the final research report:
-
-       WSC (WARP Snapshot Container) Implementation Research Report
-
-       Executive Summary
-
-       The codebase contains a mature, production-ready WSC (Write-Streaming Columnar) snapshot format implementation
-       located in /Users/james/git/echo/crates/warp-core/src/wsc/. The system is designed for deterministic
-       serialization and zero-copy deserialization of immutable WARP graph state with explicit infrastructure for
-       memory-mapped file access and columnar data organization.
-
-       ---
-       1. WSC Format Architecture
-
-       File Structure (128-byte header + directory + sections)
-
-       Location: /Users/james/git/echo/crates/warp-core/src/wsc/types.rs
-
-       The format is built on fixed-size, repr(C) rows using bytemuck::Pod for zero-copy transmutation:
-       ┌──────────────┬───────────┬──────────────────────────────────────────────────────────────────────────────┐
-       │  Component   │   Size    │                                   Purpose                                    │
-       ├──────────────┼───────────┼──────────────────────────────────────────────────────────────────────────────┤
-       │ WscHeader    │ 128 bytes │ Magic (v1), schema hash, tick, warp count, directory offset                  │
-       ├──────────────┼───────────┼──────────────────────────────────────────────────────────────────────────────┤
-       │ NodeRow      │ 64 bytes  │ Fixed-size node: node_id (32B) + node_type (32B)                             │
-       ├──────────────┼───────────┼──────────────────────────────────────────────────────────────────────────────┤
-       │ EdgeRow      │ 128 bytes │ Fixed-size edge: edge_id + from_node_id + to_node_id + edge_type             │
-       ├──────────────┼───────────┼──────────────────────────────────────────────────────────────────────────────┤
-       │ Range        │ 16 bytes  │ Index descriptor: start_le + len_le (u64 each)                               │
-       ├──────────────┼───────────┼──────────────────────────────────────────────────────────────────────────────┤
-       │ OutEdgeRef   │ 40 bytes  │ Outbound edge reference: edge_ix_le + edge_id                                │
-       ├──────────────┼───────────┼──────────────────────────────────────────────────────────────────────────────┤
-       │ AttRow       │ 56 bytes  │ Attachment row: tag (1B) + reserved (7B) + type/warp (32B) + blob offset/len │
-       ├──────────────┼───────────┼──────────────────────────────────────────────────────────────────────────────┤
-       │ WarpDirEntry │ 184 bytes │ Directory entry per WARP instance with all section offsets                   │
-       └──────────────┴───────────┴──────────────────────────────────────────────────────────────────────────────┘
-       Key design properties:
-       - All fields use little-endian byte order for cross-platform determinism
-       - All sections are 8-byte aligned for SIMD-friendly access
-       - Blobs are stored contiguously in an arena with (offset, length) references
-       - Index tables use Range structures to slice into data tables without copying
-
-       Attachment Types (Tagged Union)
-
-       Two attachment types via AttRow.tag:
-       - TAG_ATOM (1): Typed payload (type_id + blob location)
-       - TAG_DESCEND (2): Child WARP reference (WarpId, blob fields unused)
-
-       ---
-       2. Zero-Copy Read/Write Infrastructure
-
-       Writing: write_wsc_one_warp (deterministic serialization)
-
-       Location: /Users/james/git/echo/crates/warp-core/src/wsc/write.rs
-
-       Input: OneWarpInput struct containing:
-       - Pre-sorted nodes/edges (canonical order)
-       - Index tables (out_index, node_atts_index, edge_atts_index)
-       - Blob arena (8-byte aligned)
-
-       Process:
-       1. Pre-calculate all section sizes and offsets
-       2. Allocate buffer with capacity
-       3. Write header with magic + metadata
-       4. Write WARP directory entry with all offsets
-       5. Sequentially write each section with padding to 8-byte boundaries
-       6. Blobs written at end as concatenated arena
-
-       Determinism guarantees:
-       - Input ordering is canonical (nodes by NodeId, edges by EdgeId, out_edges sorted per node)
-       - Little-endian encoding is architecture-independent
-       - Identical input produces identical bytes every run
-
-       Reading: WscFile & WarpView (zero-copy views)
-
-       Location: /Users/james/git/echo/crates/warp-core/src/wsc/view.rs
-
-       pub struct WscFile {
-           data: Vec<u8>,  // Entire file in memory (mmap not yet implemented)
-       }
-
-       pub struct WarpView<'a> {
-           data: &'a [u8],
-           entry: &'a WarpDirEntry,
-           nodes: &'a [NodeRow],      // Direct slice - no copy
-           edges: &'a [EdgeRow],      // Direct slice - no copy
-           out_index: &'a [Range],    // Index table
-           out_edges: &'a [OutEdgeRef], // Concatenated edge references
-           node_atts_index: &'a [Range],
-           node_atts: &'a [AttRow],
-           edge_atts_index: &'a [Range],
-           edge_atts: &'a [AttRow],
-           blobs: &'a [u8],           // Blob arena
-       }
-
-       Key features:
-       - No copying: Uses bytemuck::try_cast_slice() for safe type punning
-       - Lifetime-bound: Borrows prevent data invalidation
-       - Binary search indexing: node_ix() and edge_ix() use binary search on sorted tables
-       - Range-based access: Out-edges and attachments accessed via Range slices
-
-       Public API:
-       impl<'a> WarpView<'a> {
-           pub fn out_edges_for_node(&self, node_ix: usize) -> &[OutEdgeRef]
-           pub fn node_attachments(&self, node_ix: usize) -> &[AttRow]
-           pub fn edge_attachments(&self, edge_ix: usize) -> &[AttRow]
-           pub fn blob_for_attachment(&self, att: &AttRow) -> Option<&[u8]>
-       }
-
-       Reading Infrastructure: read.rs
-
-       Location: /Users/james/git/echo/crates/warp-core/src/wsc/read.rs
-
-       Error types:
-       pub enum ReadError {
-           Io(io::Error),
-           FileTooSmall { size, minimum },
-           InvalidMagic { expected, actual },
-           SectionOutOfBounds { name, offset, length, file_size },
-           WarpIndexOutOfBounds { index, count },
-           AlignmentViolation { name, offset, alignment },
-           IndexRangeOutOfBounds { ... },  // Critical: catches corrupted index tables
-           InvalidAttachmentTag { tag, index },
-           BlobOutOfBounds { offset, length, blob_size },
-           OrderingViolation { kind, index },  // Nodes/edges must be sorted
-           NonZeroReservedBytes { field, index },
-           NonAtomHasBlobFields { index, blob_off, blob_len },
-           MissingRoot { root },  // Root must exist in nodes array
-       }
-
-       Key functions:
-       pub fn validate_header(data: &[u8]) -> Result<&WscHeader, ReadError>
-       pub fn read_slice<'a, T: Pod>(data: &'a [u8], offset: u64, count: u64, name: &'static str)
-           -> Result<&'a [T], ReadError>
-       pub fn read_bytes<'a>(data: &'a [u8], offset: u64, length: u64, name: &'static str)
-           -> Result<&'a [u8], ReadError>
-
-       ---
-       3. Validation & Integrity
-
-       Location: /Users/james/git/echo/crates/warp-core/src/wsc/validate.rs
-
-       The validate_wsc() function performs comprehensive structural validation:
-
-       1. Index bounds checking: All Range references stay within data table boundaries
-       2. Ordering validation: Nodes and edges must be sorted by ID
-       3. Attachment validation: Tags must be ATOM (1) or DESCEND (2)
-       4. Root node validation: root_node_id must exist in nodes array (or be zero for empty)
-       5. Blob bounds: All blob references within the arena
-       6. Reserved bytes: Ensure all reserved fields are zero
-       7. Out-edge references: Verify all edge indices point to valid edges
-
-       Critical safeguard: The validation catches corrupted index tables that accessors would otherwise mask with
-       empty slices.
-
-       ---
-       4. Build Infrastructure: GraphStore → WSC
-
-       Location: /Users/james/git/echo/crates/warp-core/src/wsc/build.rs
-
-       The build_one_warp_input() function converts in-memory GraphStore to OneWarpInput in canonical order:
-
-       Canonical ordering rules:
-       - Nodes: BTreeMap iteration (already sorted by NodeId)
-       - Edges: Globally sorted by EdgeId (via explicit sort)
-       - Outbound edges: Sorted by EdgeId within each node's bucket
-       - Attachments: Follow same ordering as their owners
-
-       Determinism tests included:
-       - "Repeated serialization produces identical bytes" (100x runs)
-       - "Different insertion orders produce identical bytes" (proves canonicalization)
-       - "Attachments serialized deterministically" regardless of build order
-
-       Blob handling:
-       - Attachments are collected with 8-byte alignment (align8_vec())
-       - Blobs stored as contiguous arena in order of collection
-       - Offset/length references stored in AttRow
-
-       ---
-       5. Existing Infrastructure for Zero-Copy/mmap
-
-       Current State
-
-       - No explicit mmap implementation yet
-       - Code comments state: "For very large files, consider using memory-mapped IO instead (not yet implemented)"
-       - File data currently read entirely into Vec<u8>
-
-       Future-Ready Design
-
-       The architecture is explicitly designed for mmap:
-
-       1. Alignment guarantees: All sections are 8-byte aligned
-       2. Pod types: All row types are bytemuck::Pod (byte-identical layout)
-       3. Lifetime bounds: WarpView<'a> borrows don't hold file handles
-       4. No mutation: Snapshot is immutable by design
-       5. Path independence: Reader doesn't care if data comes from memory or mmap
-
-       Path to mmap:
-       // Pseudo-code: straightforward substitution
-       pub fn open_mmap(path: impl AsRef<Path>) -> Result<Self, ReadError> {
-           let file = std::fs::File::open(path)?;
-           let mmap = unsafe { Mmap::map(&file)? };  // or memmap crate
-           Self::from_bytes(mmap.to_vec())  // or bind to mmap lifetime
-       }
-
-       ---
-       6. Blob Arena Handling
-
-       Design:
-       - Single contiguous blob section at end of file
-       - Attachments reference via (offset: u64, length: u64) in AttRow
-       - Multiple attachments can share blob data if ranges don't overlap
-       - Blobs are 8-byte aligned for SIMD
-
-       Access pattern:
-       pub fn blob_for_attachment(&self, att: &AttRow) -> Option<&[u8]> {
-           if !att.is_atom() { return None; }
-           let off = att.blob_off() as usize;
-           let len = att.blob_len() as usize;
-           self.blobs.get(off..off + len)
-       }
-
-       Future enhancement (from ADR): Segment-level chunking for COW/structural sharing:
-       - Individual blob segments become content-addressed
-       - Commit builder references only changed segments
-       - Massive savings for append-only workloads
-
-       ---
-       7. Related Snapshot Infrastructure
-
-       Snapshot Hash Computation
-
-       Location: /Users/james/git/echo/crates/warp-core/src/snapshot.rs
-
-       The system computes deterministic state_root hash via BLAKE3:
-
-       1. Performs reachability BFS (following skeleton edges + Descend attachments)
-       2. Encodes reachable state in canonical order (by WarpId, then nodes by NodeId)
-       3. For each node: encode ID, type, then sorted outbound edges
-       4. Include attachment values (presence tag + type + length + bytes)
-       5. Hash the canonical byte stream
-
-       Includes: Snapshot struct with commit hash, parents, plan/decision/patch digests
-
-       Materialization Infrastructure
-
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/frame.rs
-
-       Parallel binary frame format ("MBUS"):
-       - Magic: "MBUS" (4 bytes)
-       - Version: v1 (2 bytes LE)
-       - Payload length (4 bytes LE)
-       - Channel ID (32 bytes) + data
-
-       Uses similar design principles: deterministic, binary, length-prefixed.
-
-       ---
-       8. BOAW Architecture (ADR-0007)
-
-       Location: /Users/james/git/echo/docs/adr/ADR-0007-BOAW-Storage.md
-
-       The accepted architecture road map includes:
-
-       1. Immutable Base: WSC-backed snapshots remain the canonical format
-       2. TickDelta Overlay: Rewrites emit ops into thread-local deltas (no shared mutation)
-       3. Deterministic Admission: Only independent rewrites admitted per tick
-       4. Lockless Parallel Execute: Workers execute against read-only snapshot
-       5. Deterministic Merge: Thread-local deltas canonically merged
-       6. Canonical Commit: Apply patch → new snapshot → compute hashes
-       7. Collapse/Merge: Multi-parent merges with typed rules
-       8. Privacy: Mind mode forbids sensitive atoms in ledger
-
-       Segment-level COW (Section 5.5):
-       - Snapshots stored as content-addressed segments (1–4MB blocks)
-       - Commit references segment hashes for: nodes, edges, indices, attachments, blobs
-       - Only changed segments written; unchanged segments reused
-
-       ---
-       9. Test Coverage
-
-       Snapshot & reachability tests:
-       - /Users/james/git/echo/crates/warp-core/tests/snapshot_reachability_tests.rs
-         - Unreachable nodes don't affect hash
-         - Reachable edges do affect hash
-
-       WSC format tests (integrated into modules):
-       - Header validation
-       - Magic number checks
-       - Alignment violations
-       - Index range bounds
-       - Ordering violations
-       - Attachment tag validation
-       - Blob reference validation
-       - Root node validation
-       - Roundtrip (write → read → verify)
-
-       ---
-       10. File Manifest
-       ┌─────────────────────┬───────┬─────────────────────────────────────┐
-       │        File         │ Lines │               Purpose               │
-       ├─────────────────────┼───────┼─────────────────────────────────────┤
-       │ src/wsc/mod.rs      │ 63    │ Module docs + re-exports            │
-       ├─────────────────────┼───────┼─────────────────────────────────────┤
-       │ src/wsc/types.rs    │ 301   │ Row type definitions (Pod)          │
-       ├─────────────────────┼───────┼─────────────────────────────────────┤
-       │ src/wsc/view.rs     │ 499   │ WscFile, WarpView zero-copy readers │
-       ├─────────────────────┼───────┼─────────────────────────────────────┤
-       │ src/wsc/read.rs     │ 312   │ Low-level read primitives + errors  │
-       ├─────────────────────┼───────┼─────────────────────────────────────┤
-       │ src/wsc/write.rs    │ 302   │ Deterministic serialization         │
-       ├─────────────────────┼───────┼─────────────────────────────────────┤
-       │ src/wsc/build.rs    │ 581   │ GraphStore → OneWarpInput builder   │
-       ├─────────────────────┼───────┼─────────────────────────────────────┤
-       │ src/wsc/validate.rs │ 656   │ Comprehensive file validation       │
-       └─────────────────────┴───────┴─────────────────────────────────────┘
-       ---
-       Key Takeaways
-
-       Strengths
-
-       1. Deterministic by design: Input order doesn't matter; output bytes are identical
-       2. Zero-copy ready: Bytemuck Pod types enable safe pointer casting
-       3. Validation-first: Catches corruption before use (not in accessors)
-       4. Columnar + blob arena: SIMD-friendly, natural for batch operations
-       5. Alignment aware: Explicit 8-byte boundaries throughout
-       6. Immutable semantics: Snapshot ownership prevents accidental mutation
-       7. Well-architected: Clear separation of read/write/validate/build concerns
-
-       Future Work
-
-       1. mmap integration: Straightforward given Pod guarantees
-       2. Segment sharing: ADR-0007 envisions content-addressed segments
-       3. TickDelta overlay: Complement snapshots with deterministic delta merging
-       4. Collapse/merge: Type-driven multi-parent reconciliation
-       5. Privacy enforcement: Mind mode gates and claim records
-
-       ---
-       Conclusion
-
-       The WSC implementation is production-ready for deterministic snapshot I/O with explicit infrastructure for
-       zero-copy access and future memory-mapping. The columnar design with blob arena, combined with comprehensive
-       validation and deterministic ordering, makes it ideal for both research (proving determinism) and production
-       (high-performance state materialization). ADR-0007 charts a clear path to leveraging this foundation for
-       lockless parallel execution via thread-local deltas and canonical commits.
-
-⎿  Done (23 tool uses · 109.3k tokens · 1m 11s)
-
-⏺ Explore(Explore footprint infrastructure)
-⎿  Prompt:
-Search for any existing footprint, independence checking, or scheduling infrastructure in the codebase. Look
-for: 1. Footprint struct or similar conflict detection code 2. Any sharding or virtual shard logic 3. Admission control or dependency checking 4. Worker queue or parallel execution infrastructure
-
-       Search across all crates. This is research only - do not modify any code.
-
-⎿  ❯ Search for any existing footprint, independence checking, or scheduling infrastructure in the codebase. Look for: 1. Footprint struct or similar conflict detection code 2. Any sharding or virtual shard logic 3. Admission control or dependency checking 4. Worker queue or parallel execution infrastructure
-
-       Search across all crates. This is research only - do not modify any code.
-
-⎿  Search(pattern: "footprint|Footprint", glob: "\*_/_.rs")
-
-⎿  Search(pattern: "shard|Shard|virtual._shard|sharding", glob: "\*\*/_.rs")
-
-⎿  Search(pattern: "admission|dependency.*check|conflict.*detect", glob: "\*_/_.rs")
-
-⎿  Search(pattern: "\*\*/src/lib.rs")
-
-⎿    ⎿  Found 1 file
-crates/warp-benches/src/bin/sim\*sharded_store.rs
-⎿    ⎿  Found 5 files
-crates/warp-core/src/telemetry.rs
-crates/warp-core/src/scheduler.rs
-crates/warp-core/src/inbox.rs
-crates/warp-core/tests/footprint_independence_tests.rs
-crates/warp-core/src/rule.rs
-⎿    ⎿  Found 18 files
-crates/warp-core/src/engine_impl.rs
-crates/warp-core/src/materialization/channel.rs
-crates/warp-core/src/lib.rs
-crates/echo-dind-tests/src/rules.rs
-crates/warp-core/tests/tick_receipt_tests.rs
-crates/warp-core/tests/dpo_concurrency_litmus.rs
-crates/warp-core/tests/duplicate_rule_registration_tests.rs
-crates/warp-core/src/tick_patch.rs
-crates/warp-core/src/receipt.rs
-crates/warp-core/src/scheduler.rs
-crates/warp-core/src/inbox.rs
-crates/warp-benches/benches/scheduler_drain.rs
-crates/echo-dry-tests/src/demo_rules.rs
-crates/echo-dry-tests/src/rules.rs
-crates/warp-core/src/attachment.rs
-crates/warp-core/tests/footprint_independence_tests.rs
-crates/warp-core/src/rule.rs
-crates/warp-core/src/footprint.rs
-⎿    ⎿  Found 16 files
-/Users/james/git/echo/crates/echo-app-core/src/lib.rs
-/Users/james/git/echo/crates/echo-config-fs/src/lib.rs
-/Users/james/git/echo/crates/echo-graph/src/lib.rs
-/Users/james/git/echo/crates/echo-session-client/src/lib.rs
-/Users/james/git/echo/crates/echo-session-proto/src/lib.rs
-/Users/james/git/echo/crates/warp-geom/src/lib.rs
-/Users/james/git/echo/specs/spec-000-rewrite/src/lib.rs
-/Users/james/git/echo/crates/echo-registry-api/src/lib.rs
-/Users/james/git/echo/crates/echo-wasm-bindings/src/lib.rs
-/Users/james/git/echo/crates/echo-dind-harness/src/lib.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/lib.rs
-/Users/james/git/echo/crates/warp-ffi/src/lib.rs
-/Users/james/git/echo/crates/warp-wasm/src/lib.rs
-/Users/james/git/echo/crates/echo-dind-tests/src/lib.rs
-/Users/james/git/echo/crates/echo-wasm-abi/src/lib.rs
-/Users/james/git/echo/crates/warp-core/src/lib.rs
-⎿  Search(pattern: "worker|Worker|queue|Queue|executor|Executor", glob: "\*\*/\_.rs", head_limit: 30)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/footprint.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/footprint_independence_tests.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/scheduler.rs)
-
-⎿  Read 251 lines
-
-⎿  Read 99 lines
-
-⎿  Read 1305 lines
-
-⎿    ⎿  Found 30 files
-crates/warp-benches/src/bin/sim_sharded_store.rs
-crates/warp-benches/src/bin/sim_parallel_executor.rs
-crates/warp-core/tests/materialization_determinism.rs
-crates/warp-core/tests/materialization_spec_police.rs
-crates/warp-core/src/engine_impl.rs
-crates/warp-core/src/materialization/emission_port.rs
-crates/warp-core/src/materialization/port.rs
-crates/warp-core/src/materialization/emit_key.rs
-crates/warp-core/src/lib.rs
-crates/warp-core/src/graph.rs
-crates/echo-dind-tests/src/rules.rs
-crates/echo-dind-harness/src/dind.rs
-crates/warp-wasm/src/lib.rs
-crates/warp-core/tests/reserve_gate_tests.rs
-crates/warp-core/tests/tick_receipt_tests.rs
-crates/warp-core/tests/permutation_commute_tests.rs
-crates/warp-core/tests/property_commute_tests.rs
-crates/warp-core/tests/dpo_concurrency_litmus.rs
-crates/warp-core/tests/duplicate_rule_registration_tests.rs
-crates/warp-core/tests/engine_motion_negative_tests.rs
-crates/warp-core/tests/dispatch_inbox.rs
-crates/warp-core/src/scheduler.rs
-crates/warp-core/src/inbox.rs
-crates/warp-benches/benches/scheduler_drain.rs
-crates/echo-dry-tests/src/demo_rules.rs
-crates/echo-dry-tests/src/lib.rs
-crates/echo-dry-tests/src/rules.rs
-crates/warp-core/src/snapshot.rs
-crates/warp-core/src/attachment.rs
-crates/warp-viewer/src/gpu.rs
-⎿  Read(/Users/james/git/echo/crates/warp-benches/src/bin/sim_sharded_store.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-benches/src/bin/sim_parallel_executor.rs)
-
-⎿  Search(pattern: "parallel|Parallel|concurrent|Concurrent|thread|Thread", glob: "\*_/_.rs", head_limit: 20)
-
-⎿  Read 103 lines
-
-⎿  Read 83 lines
-
-⎿    ⎿  Found 12 files
-crates/warp-benches/src/bin/sim_sharded_store.rs
-crates/warp-benches/src/bin/sim_parallel_executor.rs
-crates/warp-core/src/materialization/bus.rs
-crates/warp-core/src/materialization/mod.rs
-crates/warp-core/src/materialization/emit_key.rs
-crates/warp-core/src/wsc/write.rs
-crates/warp-core/src/receipt.rs
-crates/echo-session-client/examples/publish_pulse.rs
-crates/warp-viewer/src/ui_effects.rs
-crates/warp-core/src/sandbox.rs
-crates/warp-benches/benches/scheduler_adversarial.rs
-crates/echo-session-client/src/lib.rs
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/inbox.rs · lines 1-100)
-
-⎿  Search(pattern: "pending.*queue|work.*queue|task._queue|dispatch", glob: "\*\*/_.rs", head_limit: 15)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/lib.rs · lines 1-150)
-
-⎿  Read 100 lines
-
-⎿  Read 141 lines
-
-⎿    ⎿  Found 10 files
-crates/warp-core/src/engine_impl.rs
-crates/warp-core/src/materialization/port.rs
-crates/echo-dind-tests/src/lib.rs
-crates/echo-dind-harness/src/dind.rs
-crates/warp-wasm/src/lib.rs
-crates/warp-core/tests/dispatch_inbox.rs
-crates/warp-core/src/payload.rs
-crates/warp-core/src/scheduler.rs
-crates/warp-core/src/inbox.rs
-crates/echo-dry-tests/src/engine.rs
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/engine_impl.rs · lines 1-200)
-
-⎿  Search(pattern: "GenSet|ActiveFootprint|RadixScheduler|LegacyScheduler", glob: "\*_/_.rs")
-
-⎿  Read 200 lines
-
-⎿    ⎿  Found 2 files
-crates/warp-core/src/engine\*impl.rs
-crates/warp-core/src/scheduler.rs
-⎿  Search(pattern: "\*\*/materialization/\_.rs")
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/mod.rs · lines 1-150)
-
-⎿  Read 65 lines
-
-⎿    ⎿  Found 9 files
-/Users/james/git/echo/crates/warp-core/src/materialization/emit_key.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/port.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/emission_port.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/channel.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/reduce_op.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/scoped_emitter.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/mod.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/bus.rs
-/Users/james/git/echo/crates/warp-core/src/materialization/frame.rs
-⎿  Bash(find /Users/james/git/echo -name "\*.rs" -type f | xargs grep -l "reserve\|conflict\|dispatch" | head -20)
-Waiting…
-⎿  Read(/Users/james/git/echo/crates/warp-benches/benches/scheduler_drain.rs · lines 1-100)
-
-⎿  Read 100 lines
-
-⎿  /Users/james/git/echo/crates/echo-session-ws-gateway/src/main.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/rules.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/demo_rules.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/engine.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_spec_police.rs
-/Users/james/git/echo/crates/warp-core/tests/reserve_gate_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/tick_receipt_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/duplicate_rule_registration_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_determinism.rs
-/Users/james/git/echo/crates/warp-core/tests/footprint_independence_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/dispatch_inbox.rs
-/Users/james/git/echo/crates/warp-core/tests/nan_exhaustive_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/dpo_concurrency_litmus.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_engine_integration.rs
-/Users/james/git/echo/crates/warp-core/src/telemetry.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/types.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/write.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/build.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/read.rs
-/Users/james/git/echo/crates/warp-core/src/wsc/validate.rs
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/reserve_gate_tests.rs · lines 1-150)
-
-⎿  Bash(grep -r "DeterministicScheduler\|RadixScheduler\|ActiveFootprint" /Users/james/git/echo/crates/warp-core/src
---include="\*.rs" -n | head -30)
-
-     Waiting…
-
-⎿  Read 41 lines
-
-⎿  /Users/james/git/echo/crates/warp-core/src/scheduler.rs:26:pub(crate) struct ActiveFootprints {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:43:impl ActiveFootprints {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:59:pub(crate) struct RadixScheduler {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:64: pub(crate) active: HashMap<TxId, ActiveFootprints>,
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:100:impl RadixScheduler {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:135: let active =
-self.active.entry(tx).or_insert_with(ActiveFootprints::new);
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:158: fn has_conflict(active: &ActiveFootprints, pr:
-&PendingRewrite) -> bool {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:239: fn mark_all(active: &mut ActiveFootprints, pr:
-&PendingRewrite) {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:610:pub(crate) struct DeterministicScheduler {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:617:impl std::fmt::Debug for DeterministicScheduler {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:619: f.debug_struct("DeterministicScheduler")
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:628: Radix(RadixScheduler),
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:632:impl Default for DeterministicScheduler {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:641:impl DeterministicScheduler {
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:644: SchedulerKind::Radix =>
-SchedulerImpl::Radix(RadixScheduler::default()),
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:754: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:785: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:842: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:894: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:946: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:996: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:1049: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:1107: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:1178: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/scheduler.rs:1265: let mut sched = RadixScheduler::default();
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs:19:use crate::scheduler::{DeterministicScheduler,
-PendingRewrite, RewritePhase, SchedulerKind};
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs:316: scheduler: DeterministicScheduler,
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs:477: scheduler: DeterministicScheduler::new(kind,
-telemetry),
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs:623: scheduler: DeterministicScheduler::new(kind,
-telemetry),
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs:1464: // predicate (`RadixScheduler::has_conflict` in
-`scheduler.rs`). If one
-
-⎿  Response:
-Perfect! Now let me create a comprehensive summary based on my research.
-
-       Summary of Existing Footprint, Independence Checking, and Scheduling Infrastructure
-
-       Based on my thorough search of the Echo codebase, here is what I found:
-
-       1. Footprint Struct and Conflict Detection
-
-       Location: /Users/james/git/echo/crates/warp-core/src/footprint.rs
-
-       A comprehensive footprint infrastructure exists:
-
-       - Footprint struct (lines 131-152): Captures read/write sets for rewrites across:
-         - Nodes (read: n_read, write: n_write)
-         - Edges (read: e_read, write: e_write)
-         - Attachment slots (read: a_read, write: a_write)
-         - Boundary ports (input: b_in, output: b_out)
-         - Coarse factor_mask (u64) for O(1) prefiltering
-       - Set data structures:
-         - IdSet (lines 31-63): BTreeSet-backed ordered sets for nodes/edges with deterministic iteration
-         - PortSet (lines 65-97): BTreeSet-backed set for boundary port keys
-         - AttachmentSet (lines 99-129): BTreeSet-backed set for attachment slots
-       - Independence checking Footprint::independent() (lines 161-191):
-         - Fast path: checks disjoint factor_mask first
-         - Then checks boundary port intersections
-         - Then checks edge conflicts (write-write and write-read)
-         - Finally checks attachment and node conflicts (write-write and write-read)
-         - Symmetric conflict detection with early exits
-       - Port key packing (lines 206-214): Helper function pack_port_key() to create 64-bit stable port identifiers
-
-       2. Admission Control and Dependency Checking
-
-       Location: /Users/james/git/echo/crates/warp-core/src/scheduler.rs
-
-       Advanced scheduling infrastructure with two implementations:
-
-       RadixScheduler (Primary)
-
-       - PendingRewrite struct (lines 68-82): Represents pending rewrites with:
-         - Rule ID, compact rule handle
-         - Scope hash and scope node key
-         - Footprint for conflict checking
-         - RewritePhase state machine
-       - ActiveFootprints struct (lines 26-55): Generation-stamped sets for O(1) conflict detection:
-         - Separate tracking: nodes_written, nodes_read, edges_written, edges_read
-         - attachments_written, attachments_read, ports
-         - All use GenSet<K> for O(1) lookups
-       - RadixScheduler struct (lines 59-65):
-         - pending: HashMap<TxId, PendingTx> for O(1) enqueue, O(n) drain
-         - active: HashMap<TxId, ActiveFootprints> for O(m) independence checking
-       - Reserve method (lines 134-143):
-         - has_conflict() (lines 158-236): Checks full footprint independence
-             - Node write conflicts with prior writes OR reads
-           - Node read conflicts only with prior writes
-           - Same logic for edges and attachments
-           - Port conflicts: ANY intersection fails
-         - mark_all() (lines 239-278): Atomically marks all resources when reserved
-         - Returns bool: true=reserved, false=aborted on conflict
-         - No partial marking on conflict (atomic semantics)
-
-       LegacyScheduler (Comparison)
-
-       - Uses BTreeMap for pending queues
-       - Uses Vec<Footprint> for active frontier
-       - O(k) scan over reserved footprints using Footprint::independent()
-
-       DeterministicScheduler wrapper (lines 610-712)
-
-       - Swappable implementation (Radix vs Legacy via SchedulerKind enum)
-       - Telemetry integration with counters for reserved/conflict tracking
-       - Methods: enqueue(), drain_for_tx(), reserve(), finalize_tx()
-
-       GenSet (lines 510-535)
-
-       - Generation-stamped set for O(1) conflict detection without clearing
-       - Each transaction gets a new generation
-       - Tracks which generation last saw each key
 
-       3. Deterministic Ordering/Scheduling
+# ADR-0007-impl: warp-core Implementation of BOAW Storage + Parallel Execution
+
+- **Status:** Accepted
+- **Date:** 2026-01-19
+- **Parent:** ADR-0007 (BOAW Storage + Execution + Merge + Privacy)
+- **Crate:** `crates/warp-core` (37 key source modules across five layers)
+
+---
 
-       Location: /Users/james/git/echo/crates/warp-core/src/scheduler.rs (lines 287-480)
-
-       High-performance O(n) radix-based scheduler:
-
-       - PendingTx<P> struct (lines 301-327):
-         - index: FxHashMap for O(1) last-wins deduplication
-         - thin: Vec with (scope_be32, rule_id, nonce, handle)
-         - fat: Vec<Option> for payload storage
-         - scratch and counts16: Reusable buffers for radix sort
-       - Deterministic ordering (lines 469-479):
-         - Lexicographic order: (scope_hash, rule_id, nonce)
-         - 20-pass LSD radix sort with 16-bit digits (O(n) complexity)
-         - Byte-lexicographic order over full 32-byte scope hash preserved exactly
-       - Radix sort (lines 360-413):
-         - 2 passes for nonce, 2 for rule_id, 16 for scope pairs
-         - Stable sorting preserves determinism
-         - Small-batch optimization (comparison sort for <1024 items)
-
-       4. Worker Queue and Parallel Execution Simulation
-
-       Location: /Users/james/git/echo/crates/warp-benches/src/bin/
-
-       Two benchmark simulators (research tools, not production):
-
-       sim_sharded_store.rs
-
-       - Simulates sharded graph store with per-shard mutation
-       - Thread spawning for parallel execution (one thread per shard)
-       - No locks on shards - spatial partitioning enables parallelism
-       - 1M entities distributed round-robin to shards
-       - Demonstrates queue-per-CPU architectural idea
-
-       sim_parallel_executor.rs
-
-       - Uses Rayon thread pool for data-parallel execution
-       - Simulates motion update kernel across 1M entities
-       - Compares serial vs. parallel performance to measure overhead
-       - Demonstrates ideal parallel executor baseline
-
-       5. Inbox/Queue Infrastructure
-
-       Location: /Users/james/git/echo/crates/warp-core/src/inbox.rs
-
-       Event-queue ledger system:
-
-       - Deterministic inbox rules:
-         - sys/dispatch_inbox: Drains all pending edges from inbox
-         - sys/ack_pending: Consumes single pending edge
-       - Event nodes treated as immutable ledger (append-only)
-       - Pending tracked via edge:pending edges (not node deletion)
-       - Queue maintenance = edge deletion (ledger preservation)
-
-       6. Materialization Bus
-
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/mod.rs
-
-       Deterministic output infrastructure:
-
-       - MaterializationBus: Collects emissions in order-independent manner
-       - EmitKey: Derived from (scope_hash, rule_id, nonce) - scheduler's canonical ordering
-       - Channel policies: Log (all preserved), StrictSingle (one max), Reduce (merge)
-       - Finalized post-commit for confluence-safe parallel rewriting
-
-       7. Integration in Engine
-
-       Location: /Users/james/git/echo/crates/warp-core/src/engine_impl.rs
-
-       - Engine holds DeterministicScheduler instance
-       - EngineBuilder allows scheduler selection (Radix/Legacy)
-       - Telemetry support for tracking reserved/conflict metrics
-       - Test coverage: 30+ tests validating independence checking, determinism, atomicity, and conflict detection
-
-       Key Test Files
-
-       - /Users/james/git/echo/crates/warp-core/tests/footprint_independence_tests.rs - Footprint independence tests
-       - /Users/james/git/echo/crates/warp-core/tests/reserve_gate_tests.rs - Reserve gate admission control
-       - /Users/james/git/echo/crates/warp-core/tests/scheduler_adversarial.rs - Scheduler stress tests
-       - /Users/james/git/echo/crates/warp-benches/benches/scheduler_drain.rs - Performance benchmarks
-
-       This is a sophisticated, production-ready infrastructure for conflict-free, deterministic concurrent rewriting
-       with O(1) admission control and O(n) radix-based scheduling.
-
-⎿  Done (22 tool uses · 78.4k tokens · 53s)
-
-⏺ Explore(Explore existing test structure)
-⎿  Prompt:
-Explore the current test structure in the repository, focusing on: 1. Where tests are located (tests/ directories, inline tests) 2. Any existing test harness or common utilities 3. Current testing patterns used in warp-core 4. Any benchmarking infrastructure (especially in crates/warp-benches)
-
-       This is research only - do not modify any code.
-
-⎿  ❯ Explore the current test structure in the repository, focusing on: 1. Where tests are located (tests/ directories, inline tests) 2. Any existing test harness or common utilities 3. Current testing patterns used in warp-core 4. Any benchmarking infrastructure (especially in crates/warp-benches)
-
-       This is research only - do not modify any code.
-
-⎿  Search(pattern: "**/tests/**/\*.rs")
-
-⎿  Search(pattern: "**/benches/**/\*.rs")
-
-⎿  Bash(find /Users/james/git/echo -type d -name "tests" -o -type d -name "benches" | head -20)
-Waiting…
-⎿  Read(/Users/james/git/echo)
-
-⎿  Error: EISDIR: illegal operation on a directory, read
-
-⎿    ⎿  Found 41 files
-/Users/james/git/echo/crates/echo-wasm-bindings/tests/api_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/atom_payload_digest_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/footprint_independence_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/mat4_mul_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_additional_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_convenience_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/nan_exhaustive_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/snapshot_reachability_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/vec3_ops_tests.rs
-/Users/james/git/echo/crates/warp-geom/tests/geom_broad_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_rotation_tests.rs
-/Users/james/git/echo/crates/echo-wasm-abi/tests/non_canonical_floats.rs
-/Users/james/git/echo/crates/warp-core/tests/determinism_audit.rs
-/Users/james/git/echo/crates/warp-core/tests/ledger_tests.rs
-/Users/james/git/echo/crates/echo-dind-harness/tests/coverage.rs
-/Users/james/git/echo/crates/echo-dind-harness/tests/permutation_invariance.rs
-/Users/james/git/echo/crates/echo-wasm-abi/tests/canonical_vectors.rs
-/Users/james/git/echo/crates/echo-wasm-abi/tests/fuzz_wire.rs
-/Users/james/git/echo/crates/echo-wesley-gen/tests/generation.rs
-/Users/james/git/echo/crates/warp-core/tests/determinism_policy_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/deterministic_sin_cos_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/dfix64_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/dispatch_inbox.rs
-/Users/james/git/echo/crates/warp-core/tests/dpo_concurrency_litmus.rs
-/Users/james/git/echo/crates/warp-core/tests/duplicate_rule_registration_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/engine_motion_negative_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/engine_motion_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/inbox.rs
-/Users/james/git/echo/crates/warp-core/tests/math_scalar_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/math_validation.rs
-/Users/james/git/echo/crates/warp-core/tests/permutation_commute_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/property_commute_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/proptest_seed_pinning.rs
-/Users/james/git/echo/crates/warp-core/tests/reserve_gate_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/tick_receipt_tests.rs
-/Users/james/git/echo/crates/warp-core/tests/tx_lifecycle_tests.rs
-/Users/james/git/echo/crates/echo-wasm-abi/tests/codec.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_engine_integration.rs
-/Users/james/git/echo/crates/warp-core/tests/common/mod.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_spec_police.rs
-/Users/james/git/echo/crates/warp-core/tests/materialization_determinism.rs
-⎿    ⎿  Found 4 files
-/Users/james/git/echo/crates/warp-benches/benches/scheduler_adversarial.rs
-/Users/james/git/echo/crates/warp-benches/benches/snapshot_hash.rs
-/Users/james/git/echo/crates/warp-benches/benches/motion_throughput.rs
-/Users/james/git/echo/crates/warp-benches/benches/scheduler_drain.rs
-⎿  /Users/james/git/echo/crates/echo-wasm-bindings/tests
-/Users/james/git/echo/crates/warp-core/tests
-/Users/james/git/echo/crates/warp-benches/benches
-/Users/james/git/echo/crates/echo-dind-harness/tests
-/Users/james/git/echo/crates/warp-geom/tests
-/Users/james/git/echo/crates/echo-wesley-gen/tests
-/Users/james/git/echo/crates/echo-wasm-abi/tests
-/Users/james/git/echo/node_modules/domutils/test/tests
-/Users/james/git/echo/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/mpl_toolkits/axes_grid1/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/mpl_toolkits/mplot3d/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/mpl_toolkits/axisartist/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/linalg/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/ma/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/\_core/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/\_pyinstaller/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/typing/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/f2py/tests
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/numpy/testing/tests
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/common/mod.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-benches/Cargo.toml)
-
-⎿  Bash(ls -la /Users/james/git/echo/crates/warp-benches/)
-Waiting…
-⎿  Bash(ls -la /Users/james/git/echo/crates/warp-core/tests/)
-Waiting…
-⎿  Read 75 lines
-
-⎿  Read 42 lines
-
-⎿  drwxr-xr-x@ - james 17 Jan 05:28 benches
-drwxr-xr-x - james 17 Jan 20:44 src
-.rw-r--r--@ 6.1k james 30 Dec 2025 .DS_Store
-.rw-r--r--@ 1.1k james 17 Jan 20:53 Cargo.toml
-.rw-r--r--@ 726 james 30 Dec 2025 README.md
-⎿  drwxr-xr-x@ - james 17 Jan 15:49 common
-drwxr-xr-x@ - james 17 Jan 05:28 fixtures
-.rw-r--r--@ 3.4k james 30 Dec 2025 atom_payload_digest_tests.rs
-.rw-r--r--@ 4.2k james 16 Jan 16:36 determinism_audit.rs
-.rw-r--r--@ 3.5k james 17 Jan 05:28 determinism_policy_tests.rs
-.rw-r--r--@ 11k james 17 Jan 05:28 deterministic_sin_cos_tests.rs
-.rw-r--r--@ 1.8k james 17 Jan 05:28 dfix64_tests.rs
-.rw-r--r--@ 5.1k james 17 Jan 05:28 dispatch_inbox.rs
-.rw-r--r--@ 11k james 17 Jan 05:28 dpo_concurrency_litmus.rs
-.rw-r--r--@ 2.3k james 17 Jan 05:28 duplicate_rule_registration_tests.rs
-.rw-r--r--@ 5.5k james 17 Jan 05:28 engine_motion_negative_tests.rs
-.rw-r--r--@ 5.3k james 17 Jan 05:28 engine_motion_tests.rs
-.rw-r--r--@ 2.3k james 30 Dec 2025 footprint_independence_tests.rs
-.rw-r--r--@ 4.9k james 17 Jan 05:28 inbox.rs
-.rw-r--r--@ 1.1k james 16 Jan 16:36 ledger_tests.rs
-.rw-r--r--@ 6.6k james 30 Dec 2025 mat4_mul_tests.rs
-.rw-r--r--@ 25k james 17 Jan 15:50 materialization_determinism.rs
-.rw-r--r--@ 21k james 17 Jan 14:56 materialization_engine_integration.rs
-.rw-r--r--@ 30k james 17 Jan 15:49 materialization_spec_police.rs
-.rw-r--r--@ 1.0k james 30 Dec 2025 math_additional_tests.rs
-.rw-r--r--@ 1.7k james 30 Dec 2025 math_convenience_tests.rs
-.rw-r--r--@ 2.4k james 1 Jan 10:03 math_rotation_tests.rs
-.rw-r--r--@ 2.2k james 17 Jan 05:28 math_scalar_tests.rs
-.rw-r--r--@ 14k james 17 Jan 05:28 math_validation.rs
-.rw-r--r--@ 4.4k james 30 Dec 2025 nan_exhaustive_tests.rs
-.rw-r--r--@ 2.6k james 17 Jan 05:28 permutation_commute_tests.rs
-.rw-r--r--@ 2.3k james 17 Jan 05:28 property_commute_tests.rs
-.rw-r--r--@ 4.0k james 17 Jan 05:28 proptest_seed_pinning.rs
-.rw-r--r--@ 1.5k james 17 Jan 05:28 reserve_gate_tests.rs
-.rw-r--r--@ 2.2k james 30 Dec 2025 snapshot_reachability_tests.rs
-.rw-r--r--@ 9.9k james 17 Jan 05:28 tick_receipt_tests.rs
-.rw-r--r--@ 1.3k james 17 Jan 05:28 tx_lifecycle_tests.rs
-.rw-r--r--@ 985 james 30 Dec 2025 vec3_ops_tests.rs
-⎿  Read(/Users/james/git/echo/crates/warp-benches/benches/motion_throughput.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-benches/benches/snapshot_hash.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/materialization_engine_integration.rs · lines 1-100)
-
-⎿  Read 116 lines
-
-⎿  Read 89 lines
-
-⎿  Read 100 lines
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/determinism_audit.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/permutation_commute_tests.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/proptest_seed_pinning.rs)
-
-⎿  Read 127 lines
-
-⎿  Read 73 lines
-
-⎿  Read 93 lines
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/materialization_spec_police.rs · lines 1-80)
-
-⎿  Bash(grep -l "^\s*#\[test\]" /Users/james/git/echo/crates/warp-core/src/*.rs 2>/dev/null | head -5)
-Waiting…
-⎿  Bash(grep -l "^\s*#\[cfg(test)\]" /Users/james/git/echo/crates/warp-core/src/*.rs 2>/dev/null | head -5)
-Waiting…
-⎿  Read 80 lines
-
-⎿  /Users/james/git/echo/crates/warp-core/src/attachment.rs
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs
-/Users/james/git/echo/crates/warp-core/src/footprint.rs
-/Users/james/git/echo/crates/warp-core/src/graph.rs
-/Users/james/git/echo/crates/warp-core/src/ident.rs
-⎿  /Users/james/git/echo/crates/warp-core/src/attachment.rs
-/Users/james/git/echo/crates/warp-core/src/engine_impl.rs
-/Users/james/git/echo/crates/warp-core/src/footprint.rs
-/Users/james/git/echo/crates/warp-core/src/graph.rs
-/Users/james/git/echo/crates/warp-core/src/ident.rs
-⎿  Read(/Users/james/git/echo/crates/warp-core/Cargo.toml)
-
-⎿  Bash(grep -A 10 "^\s\*#\[cfg(test)\]" /Users/james/git/echo/crates/warp-core/src/attachment.rs | head -20)
-Waiting…
-⎿  Bash(ls -la /Users/james/git/echo/crates/warp-benches/src/)
-Waiting…
-⎿  Read 53 lines
-
-⎿  drwxr-xr-x - james 17 Jan 20:53 bin
-
-⎿  #[cfg(test)] #[allow(clippy::expect_used, clippy::unwrap_used)]
-mod tests {
-use super::\*;
-
-         struct U8Codec;
-
-         impl Codec<u8> for U8Codec {
-             const TYPE_ID: TypeId = TypeId([0xA5; 32]);
-
-             fn encode_canon(value: &u8) -> Bytes {
-
-⎿  Bash(ls -la /Users/james/git/echo/crates/warp-benches/src/bin/)
-Waiting…
-⎿  Read(/Users/james/git/echo/crates/warp-benches/benches/scheduler_drain.rs · lines 1-80)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/engine_motion_tests.rs · lines 1-60)
-
-⎿  Read 80 lines
-
-⎿  .rw-r--r-- 3.0k james 17 Jan 20:49 sim_parallel_executor.rs
-.rw-r--r-- 3.5k james 17 Jan 20:53 sim_sharded_store.rs
-.rw-r--r-- 2.8k james 17 Jan 20:44 stress_throughput.rs
-⎿  Read 60 lines
-
-⎿  Bash(find /Users/james/git/echo/crates/echo-dry-tests -type f -name "\*.rs" | head -10)
-Waiting…
-⎿  Read(/Users/james/git/echo/crates/echo-dry-tests/src/lib.rs · lines 1-100)
-
-⎿  Read(/Users/james/git/echo/crates/warp-benches/src/bin/stress_throughput.rs · lines 1-60)
-
-⎿  Read 37 lines
-
-⎿  Read 60 lines
-
-⎿  /Users/james/git/echo/crates/echo-dry-tests/src/rules.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/demo_rules.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/config.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/lib.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/hashes.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/frames.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/engine.rs
-/Users/james/git/echo/crates/echo-dry-tests/src/motion.rs
-⎿  Read(/Users/james/git/echo/crates/warp-benches/README.md)
-
-⎿  Bash(head -50 /Users/james/git/echo/crates/warp-benches/benches/scheduler_adversarial.rs)
-Waiting…
-⎿  Read(/Users/james/git/echo/crates/warp-core/tests/materialization_determinism.rs · lines 1-80)
-
-⎿  Read 22 lines
-
-⎿  // SPDX-License-Identifier: Apache-2.0
-// © James Ross Ω FLYING•ROBOTS <https://github.com/flyingrobots> #![allow(missing_docs)]
-
-     use criterion::{black_box, criterion_group, criterion_main, BatchSize, Criterion};
-     use rand::Rng;
-     use rustc_hash::FxHashMap;
-
-     /// Key type that forces all entries into the same hash bucket (constant hash).
-     #[derive(Clone, Copy, PartialEq, Eq, Hash)]
-     struct Colliding(u64);
-
-     fn bench_fxhash_collision(c: &mut Criterion) {
-         let mut group = c.benchmark_group("scheduler_adversarial/colliding");
-         for &n in &[1_000u64, 5_000, 10_000] {
-             group.bench_function(format!("insert_and_probe/{n}"), |b| {
-                 b.iter_batched(
-                     || {
-                         let mut map: FxHashMap<Colliding, u64> = FxHashMap::default();
-                         // pre-seed with colliding keys
-                         for i in 0..n {
-                             map.insert(Colliding(i), i);
-                         }
-                         map
-                     },
-                     |mut map| {
-                         // probe and insert another colliding key
-                         let key = Colliding(n + 1);
-                         let _ = map.get(&key);
-                         map.insert(key, n + 1);
-                         black_box(map);
-                     },
-                     BatchSize::SmallInput,
-                 );
-             });
-         }
-         group.finish();
-     }
-
-     fn bench_fxhash_random(c: &mut Criterion) {
-         let mut group = c.benchmark_group("scheduler_adversarial/random");
-         for &n in &[1_000u64, 5_000, 10_000] {
-             group.bench_function(format!("insert_and_probe/{n}"), |b| {
-                 b.iter_batched(
-                     || {
-                         let mut rng = rand::thread_rng();
-                         let mut map: FxHashMap<u64, u64> = FxHashMap::default();
-                         for _ in 0..n {
-                             let k = rng.gen::<u64>();
-                             map.insert(k, k);
-
-⎿  Read 80 lines
-
-⎿  Bash(grep -n "^\s\*#\[test\]" /Users/james/git/echo/crates/warp-core/src/attachment.rs | head -5)
-Waiting…
-⎿  Bash(wc -l /Users/james/git/echo/crates/warp-core/src/attachment.rs)
-Waiting…
-⎿  Bash(sed -n '300,400p' /Users/james/git/echo/crates/warp-core/src/attachment.rs)
-Waiting…
-⎿   403 /Users/james/git/echo/crates/warp-core/src/attachment.rs
-
-⎿  #[derive(Debug, Error)]
-pub enum RegistryError {
-/// Attempted to register two codecs for the same `TypeId`. #[error("duplicate codec registration for type id: {0:?}")]
-DuplicateTypeId(TypeId),
+## 0) Scope
+
+ADR-0007 defines **what** the BOAW architecture is and **why** it exists:
+immutable snapshots, COW overlays, lockless parallel execution, deterministic
+commits, typed merge/collapse, and privacy-safe provenance.
+
+This companion ADR documents **how** and **where** those decisions are
+realized in `crates/warp-core`. It maps every ADR-0007 section to concrete
+modules, data structures, and algorithms so that anyone implementing or
+maintaining warp-core can find the canonical reference in one place.
+
+Anything not yet implemented (collapse/merge with typed registry, privacy
+enforcement, segment-level COW) is called out explicitly in §11.
+
+---
+
+## 1) Module Organization
+
+The crate contains 37 key source modules organized into five architectural layers.
+The tables below cover architecturally significant modules; utility modules
+(`mod.rs`, `lib.rs`) and `math/` internals are omitted.
+Line counts are as of 2026-01-19.
+
+### Core execution
+
+| Module           |  LOC | Responsibility                                                   |
+| ---------------- | ---: | ---------------------------------------------------------------- |
+| `engine_impl.rs` | 2472 | Tick pipeline orchestration, rule registration, intent lifecycle |
+| `scheduler.rs`   | 1427 | Radix-sort admission, `GenSet` conflict detection, `PendingTx`   |
+| `tick_patch.rs`  | 1768 | `WarpOp` enum, `WarpTickPatchV1`, delta encoding/digest          |
+| `tick_delta.rs`  |    — | Thread-local `TickDelta` (append-only op buffer)                 |
+
+### Graph storage
+
+| Module              |  LOC | Responsibility                                          |
+| ------------------- | ---: | ------------------------------------------------------- |
+| `graph.rs`          |  631 | `GraphStore` — BTreeMap-based in-memory store           |
+| `graph_view.rs`     |    — | `GraphView` — compile-time read-only projection         |
+| `snapshot.rs`       | 1216 | `Snapshot`, state-root hashing, commit-hash computation |
+| `snapshot_accum.rs` |    — | Accumulator for building snapshots across instances     |
+| `warp_state.rs`     |    — | Per-warp instance state tracking                        |
+
+### BOAW parallel execution
+
+| Module          | LOC | Responsibility                                                 |
+| --------------- | --: | -------------------------------------------------------------- |
+| `boaw/exec.rs`  | 526 | `ExecItem`, serial/parallel/sharded execution, `PoisonedDelta` |
+| `boaw/merge.rs` | 244 | Canonical delta merge, `MergeError`, `MergeConflict`           |
+| `boaw/shard.rs` | 265 | Virtual shard routing (`NUM_SHARDS = 256`), `shard_of()`       |
+
+### WSC format (Write-Streaming Columnar)
+
+| Module            | LOC | Responsibility                                                             |
+| ----------------- | --: | -------------------------------------------------------------------------- |
+| `wsc/types.rs`    | 300 | Fixed-size row types (`repr(C)`, `Pod`): `WscHeader`, `NodeRow`, `EdgeRow` |
+| `wsc/build.rs`    | 580 | `GraphStore` → `OneWarpInput` bridge, canonical ordering                   |
+| `wsc/view.rs`     | 503 | `WscFile`, `WarpView` — zero-copy read via `bytemuck`                      |
+| `wsc/write.rs`    | 301 | Binary serialization of `OneWarpInput` → WSC bytes                         |
+| `wsc/read.rs`     | 311 | Low-level read primitives, `ReadError` enum                                |
+| `wsc/validate.rs` | 655 | Structural validation (ordering, alignment, bounds, tags)                  |
+
+### Materialization
+
+| Module                              | LOC | Responsibility                                             |
+| ----------------------------------- | --: | ---------------------------------------------------------- |
+| `materialization/bus.rs`            | 490 | `MaterializationBus` — order-independent output collection |
+| `materialization/emit_key.rs`       | 164 | `EmitKey` — lexicographic `(scope_hash, rule_id, subkey)`  |
+| `materialization/scoped_emitter.rs` | 207 | `ScopedEmitter` — key-forgery-proof emission handle        |
+
+### Supporting modules
+
+| Module                | LOC | Responsibility                                                          |
+| --------------------- | --: | ----------------------------------------------------------------------- |
+| `ident.rs`            | 197 | `Hash`, `NodeId`, `EdgeId`, `WarpId`, `TypeId`, domain-separated BLAKE3 |
+| `record.rs`           |  50 | `NodeRecord`, `EdgeRecord` (skeleton-plane only)                        |
+| `rule.rs`             | 108 | `RewriteRule`, `MatchFn`, `ExecuteFn`, `FootprintFn`, `ConflictPolicy`  |
+| `footprint.rs`        | 495 | `Footprint` — warp-scoped read/write sets with `factor_mask`            |
+| `footprint_guard.rs`  | 537 | `FootprintGuard`, `ViolationKind` — runtime enforcement                 |
+| `attachment.rs`       | 457 | `AttachmentPlane`, `AttachmentOwner`, `AttachmentKey`                   |
+| `receipt.rs`          | 241 | `TickReceipt` — causality poset witness per tick                        |
+| `inbox.rs`            |   — | Canonical inbox management for deterministic intent sequencing          |
+| `playback.rs`         |   — | Cursor-based playback and seek                                          |
+| `retention.rs`        |   — | Snapshot retention policies                                             |
+| `domain.rs`           |   — | Domain types for cross-crate API                                        |
+| `cmd.rs`              |   — | Command types                                                           |
+| `payload.rs`          |   — | Typed payload encoding                                                  |
+| `tx.rs`               |   — | Transaction identity (`TxId`)                                           |
+| `provenance_store.rs` |   — | Provenance tracking                                                     |
+| `telemetry.rs`        |   — | Internal telemetry hooks                                                |
+
+---
+
+## 2) Key Data Structures
+
+### 2.1 GraphStore (`src/graph.rs`)
+
+BTreeMap-based in-memory graph with reverse edge indices. BTreeMap provides
+deterministic iteration order at the cost of ~2x lookup vs HashMap (see §9.1).
+
+```rust
+pub struct GraphStore {
+    pub(crate) warp_id: WarpId,
+    pub(crate) nodes: BTreeMap<NodeId, NodeRecord>,
+    pub(crate) edges_from: BTreeMap<NodeId, Vec<EdgeRecord>>,
+    pub(crate) edges_to: BTreeMap<NodeId, Vec<EdgeId>>,
+    pub(crate) node_attachments: BTreeMap<NodeId, AttachmentValue>,
+    pub(crate) edge_attachments: BTreeMap<EdgeId, AttachmentValue>,
+    pub(crate) edge_index: BTreeMap<EdgeId, NodeId>,       // edge → source
+    pub(crate) edge_to_index: BTreeMap<EdgeId, NodeId>,    // edge → target
 }
+```
+
+The `canonical_state_hash()` method computes a BLAKE3 digest over a
+deterministic byte stream (V2 format):
+
+- Header: `b"echo:state_root:v1\0"`
+- Node count as `u64`, then nodes in ascending `NodeId` order
+- Edge count as `u64`, then edges in ascending `EdgeId` order
+- Attachments: ATOM → `(type_id, blob_len as u64, bytes)`, DESC → `(warp_id)`
+
+### 2.2 Footprint (`src/footprint.rs`)
+
+Warp-scoped read/write sets with a `u64` coarse prefilter. All resource
+identifiers are `(WarpId, LocalId)` tuples, preventing false conflicts when
+different warps touch resources with identical local IDs.
+
+```rust
+pub struct Footprint {
+    pub n_read:  NodeSet,        // warp-scoped node reads
+    pub n_write: NodeSet,        // warp-scoped node writes
+    pub e_read:  EdgeSet,        // warp-scoped edge reads
+    pub e_write: EdgeSet,        // warp-scoped edge writes
+    pub a_read:  AttachmentSet,  // attachment reads
+    pub a_write: AttachmentSet,  // attachment writes
+    pub b_in:    PortSet,        // boundary input ports
+    pub b_out:   PortSet,        // boundary output ports
+    pub factor_mask: u64,        // coarse partition prefilter
+}
+```
 
-     impl CodecRegistry {
-         /// Creates an empty registry.
-         #[must_use]
-         pub fn new() -> Self {
-             Self::default()
-         }
-
-         /// Registers codec `C` for payload type `T`.
-         ///
-         /// `type_name` is a human-readable identifier for debugging/tooling.
-         ///
-         /// # Errors
-         /// Returns [`RegistryError::DuplicateTypeId`] if a codec is already registered
-         /// for the same `TypeId`.
-         pub fn register<T, C>(&mut self, type_name: &'static str) -> Result<(), RegistryError>
-         where
-             T: Any + Send + Sync,
-             C: Codec<T> + Send + Sync + 'static,
-         {
-             let type_id = C::TYPE_ID;
-             if self.codecs.contains_key(&type_id) {
-                 return Err(RegistryError::DuplicateTypeId(type_id));
-             }
-             self.codecs
-                 .insert(type_id, Box::new(ErasedCodecImpl::<T, C>::new(type_name)));
-             Ok(())
-         }
-
-         /// Returns the codec registered for `type_id` (if any).
-         #[must_use]
-         pub fn get(&self, type_id: &TypeId) -> Option<&dyn ErasedCodec> {
-             self.codecs.get(type_id).map(std::convert::AsRef::as_ref)
-         }
-
-         /// Decodes a typed atom payload using the codec registered for its `type_id`.
-         ///
-         /// # Errors
-         /// Returns [`DecodeError::TypeMismatch`] if the payload `type_id` is not
-         /// registered.
-         pub fn decode_atom(&self, payload: &AtomPayload) -> Result<Box<dyn Any>, DecodeError> {
-             let Some(codec) = self.get(&payload.type_id) else {
-                 return Err(DecodeError::UnknownTypeId(payload.type_id));
-             };
-             codec.decode_any(&payload.bytes)
-         }
-     }
-
-     #[cfg(test)]
-     #[allow(clippy::expect_used, clippy::unwrap_used)]
-     mod tests {
-         use super::*;
-
-         struct U8Codec;
-
-         impl Codec<u8> for U8Codec {
-             const TYPE_ID: TypeId = TypeId([0xA5; 32]);
-
-             fn encode_canon(value: &u8) -> Bytes {
-                 Bytes::from(vec![*value])
-             }
-
-             fn decode_strict(bytes: &Bytes) -> Result<u8, DecodeError> {
-                 if bytes.len() != 1 {
-                     return Err(DecodeError::InvalidBytes);
-                 }
-                 Ok(*bytes.first().ok_or(DecodeError::InvalidBytes)?)
-             }
-         }
-
-         #[test]
-         fn atom_decode_with_enforces_type_id() {
-             let payload = AtomPayload::new(U8Codec::TYPE_ID, U8Codec::encode_canon(&7u8));
-             assert_eq!(payload.decode_with::<U8Codec, u8>().unwrap(), 7u8);
-
-             let wrong = AtomPayload::new(TypeId([0x5A; 32]), U8Codec::encode_canon(&7u8));
-             assert!(
-                 matches!(
-                     wrong.decode_with::<U8Codec, u8>(),
-                     Err(DecodeError::TypeMismatch { .. })
-                 ),
-     "type mismatch must be reported deterministically"
-             );
-         }
-
-         #[test]
-         fn atom_decode_for_match_is_deterministic_and_conservative() {
-             // v0 semantics: any decode failure -> rule does not apply (None).
-             let good = AtomPayload::new(U8Codec::TYPE_ID, U8Codec::encode_canon(&9u8));
-             assert_eq!(good.decode_for_match::<U8Codec, u8>(), Some(9u8));
-
-             let wrong_type = AtomPayload::new(TypeId([0x00; 32]), U8Codec::encode_canon(&9u8));
-             assert_eq!(wrong_type.decode_for_match::<U8Codec, u8>(), None);
-
-             let bad_bytes = AtomPayload::new(U8Codec::TYPE_ID, Bytes::from_static(&[]));
-
-⎿  376: #[test]
-391: #[test]
-⎿  Bash(ls -la /Users/james/git/echo/crates/warp-core/tests/fixtures/ 2>/dev/null | head -20)
-Waiting…
-⎿  Bash(find /Users/james/git/echo/crates/warp-core/tests -type f | grep -v "\.rs$" | head -10)
-Waiting…
-⎿  .rw-r--r--@ 1.4k james 17 Jan 05:28 math-fixtures.cbor
-.rw-r--r--@ 3.7k james 30 Dec 2025 math-fixtures.json
-⎿  /Users/james/git/echo/crates/warp-core/tests/fixtures/math-fixtures.json
-/Users/james/git/echo/crates/warp-core/tests/fixtures/math-fixtures.cbor
-⎿  Response:
-Excellent! Now I have comprehensive information. Let me create a detailed report of my findings.
-
-       Test Structure Exploration Report
-
-       Based on my thorough exploration of the repository, here's a comprehensive overview of the test infrastructure
-       in the Echo project:
-
-       1. TEST LOCATIONS
-
-       Integration Tests (Separate Test Crates)
-
-       Located in /Users/james/git/echo/crates/warp-core/tests/:
-
-       Core Integration Test Files (40+ test files):
-       - Materialization Bus Tests: materialization_engine_integration.rs, materialization_spec_police.rs,
-       materialization_determinism.rs
-       - Physics & Motion: engine_motion_tests.rs, engine_motion_negative_tests.rs, permutation_commute_tests.rs
-       - Determinism Audits: determinism_audit.rs, determinism_policy_tests.rs
-       - Math & Validation: math_validation.rs, math_scalar_tests.rs, math_rotation_tests.rs,
-       math_convenience_tests.rs, math_additional_tests.rs, deterministic_sin_cos_tests.rs, nan_exhaustive_tests.rs,
-       dfix64_tests.rs, mat4_mul_tests.rs, vec3_ops_tests.rs
-       - Graph Operations: dpo_concurrency_litmus.rs, dispatch_inbox.rs, inbox.rs, snapshot_reachability_tests.rs
-       - Engine Lifecycle: tx_lifecycle_tests.rs, tick_receipt_tests.rs, ledger_tests.rs
-       - Property-Based Testing: proptest_seed_pinning.rs, property_commute_tests.rs
-       - Payload & Encoding: atom_payload_digest_tests.rs, footprint_independence_tests.rs,
-       duplicate_rule_registration_tests.rs, reserve_gate_tests.rs
-
-       Test Utilities:
-       - Common module at /Users/james/git/echo/crates/warp-core/tests/common/mod.rs providing shared helpers
-       - Test fixture data in /Users/james/git/echo/crates/warp-core/tests/fixtures/ (math-fixtures.cbor,
-       math-fixtures.json)
-
-       Inline Tests (In Source Code)
-
-       Found in multiple source files, including:
-       - /Users/james/git/echo/crates/warp-core/src/attachment.rs (2+ inline test functions)
-       - /Users/james/git/echo/crates/warp-core/src/engine_impl.rs
-       - /Users/james/git/echo/crates/warp-core/src/footprint.rs
-       - /Users/james/git/echo/crates/warp-core/src/graph.rs
-       - /Users/james/git/echo/crates/warp-core/src/ident.rs
-
-       Other Test Crates
-
-       - echo-wasm-bindings: /Users/james/git/echo/crates/echo-wasm-bindings/tests/api_tests.rs
-       - echo-wasm-abi: Multiple tests including canonical_vectors.rs, codec.rs, fuzz_wire.rs, non_canonical_floats.rs
-       - warp-geom: geom_broad_tests.rs
-       - echo-wesley-gen: generation.rs
-       - echo-dind-harness: coverage.rs, permutation_invariance.rs
-
-       ---
-       2. TEST HARNESS & COMMON UTILITIES
-
-       Primary Test Support Crate: echo-dry-tests
-
-       Location: /Users/james/git/echo/crates/echo-dry-tests/src/
-
-       Modules and Exports:
-       - demo_rules: Pre-built rule fixtures (motion_rule(), port_rule() with constants MOTION_RULE_NAME,
-       PORT_RULE_NAME)
-       - engine: Engine builders (build_engine_with_root(), build_engine_with_typed_root(), EngineTestBuilder)
-       - motion: Motion payload construction (MotionPayloadBuilder, DEFAULT_MOTION_POSITION, DEFAULT_MOTION_VELOCITY)
-       - rules: Synthetic rule builders (NoOpRule, SyntheticRuleBuilder)
-       - frames: Snapshot and diff builders (SnapshotBuilder, DiffBuilder)
-       - hashes: Hash generation helpers (make_intent_id(), make_rule_id())
-       - config: In-memory config store fake for testing
-
-       Common Module in warp-core Tests
-
-       Location: /Users/james/git/echo/crates/warp-core/tests/common/mod.rs
-
-       Key Utilities:
-       // Snapshot hashing
-       snapshot_hash_of(store: GraphStore, root: NodeId) -> [u8; 32]
-
-       // Materialization test utilities
-       h(n: u8) -> [u8; 32]  // Deterministic test hashes
-       key(scope: u8, rule: u32) -> EmitKey
-       key_sub(scope: u8, rule: u32, subkey: u32) -> EmitKey
-
-       // Permutation testing
-       for_each_permutation<T>(items: &mut [T], f: impl FnMut(&[T]))
-       // Uses Heap's algorithm for deterministic permutation generation
-
-       ---
-       3. TESTING PATTERNS IN WARP-CORE
-
-       Pattern 1: Determinism Testing
-
-       Tests verify byte-identical output regardless of execution order:
-       - File: permutation_commute_tests.rs
-       - Approach: Apply rules in different permutations, compare snapshot hashes
-       - Example: Tests n=3,4 entity permutations with unique velocities
-
-       Pattern 2: Exhaustive Permutation Testing with Byte Diffing
-
-       - File: materialization_spec_police.rs
-       - Approach: Heap's algorithm for all N! permutations, byte-for-byte comparison
-       - Pattern: Custom assert_bytes_eq() helper showing context around divergence points
-       - Scope: Tests for N ≤ 6 to keep runtime reasonable
-
-       Pattern 3: Property-Based Testing with Pinned Seeds
-
-       - File: proptest_seed_pinning.rs
-       - Framework: proptest with deterministic TestRng::from_seed()
-       - Pattern: Pin SEED_BYTES for CI reproducibility
-       - Example:
-       const SEED_BYTES: [u8; 32] = [0x42, 0, 0, 0, ...];
-       let rng = TestRng::from_seed(RngAlgorithm::ChaCha, &SEED_BYTES);
-       let mut runner = TestRunner::new_with_rng(PropConfig::default(), rng);
-
-       Pattern 4: Float Sensitivity Auditing
-
-       - File: determinism_audit.rs
-       - Approach: Test that 1 ULP float changes affect hash output
-       - Versions: Tests both V0 (raw f32) and V2 (Q32.32 fixed-point) encodings
-       - Assertions: Verify sensitivity and repeatability across 100 iterations
-
-       Pattern 5: Engine Lifecycle Testing
-
-       - File: engine_motion_tests.rs
-       - Pattern: Create engine, register rule, apply rule, verify state mutations
-       - Structure: Uses GraphStore → Engine → begin() → apply() → commit()
-       - Verification: Decode payloads and assert expected transformations
-
-       Pattern 6: Integration Testing with Fixtures
-
-       - Files: materialization_engine_integration.rs
-       - Pattern: Simulate rule execution context (SimulatedRuleExec), use ScopedEmitter, test finalization
-       - Architecture: Tests the full bus path: apply_reserved_rewrites() → finalize() → receive
-
-       Pattern 7: Error and Edge Case Testing
-
-       - Files: engine_motion_negative_tests.rs, duplicate_rule_registration_tests.rs
-       - Pattern: Test expected failures and error conditions
-       - Example: Verify that registering duplicate rule names fails
-
-       ---
-       4. BENCHMARKING INFRASTRUCTURE (warp-benches)
-
-       Framework: Criterion.rs
-
-       - Version: 0.5 with HTML reports feature
-       - Location: /Users/james/git/echo/crates/warp-benches/
-       - Configuration in Cargo.toml:
-       [dev-dependencies]
-       criterion = { version = "0.5", default-features = false, features = ["html_reports"] }
-
-       Benchmark Structure
-
-       4 criterion-based benchmarks, each with harness = false:
-
-       1. Snapshot Hash Benchmark (snapshot_hash.rs)
-
-       - Measures: Hash computation over linear chain graphs
-       - Graph Shape: Root node → chain of n entities
-       - Sizes: 10, 100, 1,000, 3,000, 10,000, 30,000 nodes
-       - Pattern: Uses iter_batched() with BatchSize::PerIteration to exclude setup
-       - Configuration:
-         - Warm-up: 3 seconds
-         - Measurement: 10 seconds
-         - Sample size: 80
-       - Throughput: Elements (nodes in reachable set)
-
-       2. Motion Throughput Benchmark (motion_throughput.rs)
-
-       - Measures: Engine construction + node inserts (build-only) vs apply+commit
-       - Two Groups:
-         - motion_build_only: Node insertion performance
-         - motion_apply_commit: Rule application and commit performance
-       - Sizes: 1, 10, 100, 1,000 entities
-       - Configuration:
-         - Sample size: 50
-         - Warm-up: 3 seconds
-         - Measurement: 6 seconds
-         - Noise threshold: 0.02 (2%)
-
-       3. Scheduler Drain Benchmark (scheduler_drain.rs)
-
-       - Measures: Scheduler overhead with a no-op rule
-       - Approach: Measures applying trivial rule to n entities (excludes executor work)
-       - Helper: Custom bench_noop_rule() function
-       - Purpose: Isolate scheduler overhead from executor performance
-
-       4. Scheduler Adversarial Benchmark (scheduler_adversarial.rs)
+Port keys are packed into 64 bits for efficient set operations:
 
-       - Measures: Hash table collision performance under worst-case scenarios
-       - Benches:
-         - scheduler_adversarial/colliding: All keys hash to same bucket
-         - scheduler_adversarial/random: Random key distribution
-       - Framework: Uses rustc-hash::FxHashMap
-       - Sizes: 1,000, 5,000, 10,000 entries
+```text
+bits 63..32: lower 32 bits of node_id[0..8] as LE u64
+bits 31..2:  port_id (u30)
+bit 1:       reserved (0)
+bit 0:       direction (1=input, 0=output)
+```
 
-       Binary Tools in /Users/james/git/echo/crates/warp-benches/src/bin/
-
-       - stress_throughput.rs: "Let 'er rip" stress test
-         - Configurable duration (default 10s) and entity count (default 10,000)
-         - Continuous apply → commit loop measuring throughput
-         - Prints ticks/sec and total updates
-
-       Report Generation
-
-       - HTML Reports: Criterion generates HTML reports automatically
-       - Location: Reports in target/criterion/
-       - Documentation: Referenced in docs/benchmarks/ and repository README
-
-       ---
-       5. TEST DEPENDENCIES & FEATURES
-
-       Core Test Dependencies (in warp-core/Cargo.toml)
-
-       [dev-dependencies]
-       proptest = { version = "1.5" }
-       echo-dry-tests = { workspace = true }
-       echo-wasm-abi = { workspace = true }
-       serde = { version = "1.0", features = ["derive"] }
-
-       Bench Dependencies (in warp-benches/Cargo.toml)
-
-       [dev-dependencies]
-       criterion = { version = "0.5", default-features = false, features = ["html_reports"] }
-       blake3 = { version = "~1.8.2", default-features = false, features = ["std"] }
-       rustc-hash = "2.1.1"
-       rand = "0.8"
-
-       Feature Flags
-
-       - golden_prng: Optional regression check for PRNG sequences (off by default)
-       - trig_audit_print: Extra diagnostic printing in deterministic trig tests
-       - det_float: Default float32-backed lane with F32Scalar
-       - det_fixed: Experimental fixed-point Q32.32 lane (test-only)
-
-       ---
-       6. KEY PATTERNS & BEST PRACTICES OBSERVED
-
-       1. Deterministic Test Seeds: All property-based tests use pinned seeds for reproducibility
-       2. Permutation Testing: Exhaustive permutation coverage (Heap's algorithm) for small N
-       3. Byte-Identical Assertions: Tests use byte comparison for serialized outputs with contextual diffs
-       4. Batched Benchmarks: Criterion iter_batched() separates setup from measurement
-       5. Float Precision Auditing: Explicit 1 ULP sensitivity testing for floating-point code
-       6. Shared Fixtures: echo-dry-tests crate centralizes test doubles (demo rules, builders)
-       7. Inline + Integration Mix: Both module-level #[cfg(test)] blocks and separate test files
-       8. Custom Helpers: Utility modules like common/mod.rs for test infrastructure
-
-       ---
-       Summary Statistics
-       ┌────────────────────────────────────┬────────────────────┐
-       │              Category              │       Count        │
-       ├────────────────────────────────────┼────────────────────┤
-       │ Integration test files (warp-core) │ 40+                │
-       ├────────────────────────────────────┼────────────────────┤
-       │ Test functions (integration)       │ 100+               │
-       ├────────────────────────────────────┼────────────────────┤
-       │ Inline test modules (source files) │ 5+                 │
-       ├────────────────────────────────────┼────────────────────┤
-       │ Benchmark suites                   │ 4                  │
-       ├────────────────────────────────────┼────────────────────┤
-       │ Test utility crates                │ 1 (echo-dry-tests) │
-       ├────────────────────────────────────┼────────────────────┤
-       │ Test fixture files                 │ 2 (math-fixtures)  │
-       ├────────────────────────────────────┼────────────────────┤
-       │ Binary stress tools                │ 1                  │
-       └────────────────────────────────────┴────────────────────┘
-       This comprehensive test infrastructure supports Echo's critical requirement for determinism across the graph
-       rewriting engine, materialization bus, and physics simulation components.
-
-⎿  Done (34 tool uses · 67.9k tokens · 1m 17s)
-
-⏺ Explore(Explore materialization bus)
-⎿  Prompt:
-Search for "materialization" or "bus" related code in the codebase. The AGENTS.md mentions a "materialization
-bus" in warp-core. Find: 1. Any MaterializationBus or similar infrastructure 2. How graph state is currently materialized 3. Any commit/hash computation logic 4. State root or patch digest computation if it exists
-
-       This is research only - do not modify any code.
-
-⎿  ❯ Search for "materialization" or "bus" related code in the codebase. The AGENTS.md mentions a "materialization bus" in
-warp-core. Find: 1. Any MaterializationBus or similar infrastructure 2. How graph state is currently materialized 3. Any commit/hash computation logic 4. State root or patch digest computation if it exists
-
-       This is research only - do not modify any code.
-
-⎿  Search(pattern: "materialization|MaterializationBus")
-
-⎿  Search(pattern: "bus|Bus", glob: "\*_/_.rs", head_limit: 30)
-
-⎿  Search(pattern: "state.*root|patch.*digest|commit._hash", glob: "\*\*/_.rs")
-
-⎿  Search(pattern: "\*_/materialization_")
-
-⎿  Search(pattern: "\**/*bus\*")
-
-⎿    ⎿  Found 14 files
-crates/warp-core/src/engine_impl.rs
-crates/echo-dind-tests/src/lib.rs
-crates/echo-dind-harness/src/dind.rs
-crates/warp-wasm/src/lib.rs
-crates/warp-core/tests/tick_receipt_tests.rs
-crates/warp-core/tests/dpo_concurrency_litmus.rs
-crates/warp-core/src/tick_patch.rs
-crates/warp-core/src/receipt.rs
-crates/warp-core/src/constants.rs
-crates/warp-core/tests/determinism_audit.rs
-crates/warp-core/src/snapshot.rs
-crates/warp-core/src/serializable.rs
-crates/warp-core/tests/atom_payload_digest_tests.rs
-crates/warp-benches/benches/snapshot_hash.rs
-⎿    ⎿  Found 31 files
-crates/warp-core/src/materialization/frame.rs
-crates/warp-core/tests/materialization_determinism.rs
-crates/warp-core/tests/materialization_spec_police.rs
-crates/warp-core/tests/common/mod.rs
-crates/warp-core/src/materialization/bus.rs
-.github/workflows/determinism.yml
-crates/warp-core/src/engine_impl.rs
-docs/rfc/mat-bus-finish.md
-docs/architecture-outline.md
-AGENTS.md
-crates/warp-core/src/materialization/mod.rs
-docs/adr/ADR-0003-Materialization-Bus.md
-CHANGELOG.md
-crates/warp-core/tests/materialization_engine_integration.rs
-crates/warp-core/src/materialization/scoped_emitter.rs
-crates/warp-core/src/materialization/channel.rs
-crates/warp-core/src/materialization/emission_port.rs
-crates/warp-core/src/materialization/port.rs
-crates/warp-core/src/lib.rs
-docs/spec-canonical-inbox-sequencing.md
-docs/diagrams.md
-docs/book/echo/sections/02-high-level-architecture.tex
-docs/book/echo/sections/05-game-loop.tex
-docs/adr/ADR-0004-No-Global-State.md
-docs/adr/ADR-0005-Physics.md
-ECHO_ROADMAP.md
-ADR-0003-Materialization-Bus.md
-ADR-0004-No-Global-State.md
-ADR-0005-Physics.md
-specs/spec-000-rewrite/spec.md
-docs/jitos/spec-0000.md
-⎿    ⎿  Found 14 files
-crates/warp-core/tests/materialization_determinism.rs
-crates/warp-core/tests/materialization_spec_police.rs
-crates/warp-core/src/materialization/bus.rs
-crates/warp-core/src/engine_impl.rs
-crates/warp-core/src/materialization/mod.rs
-crates/warp-core/tests/materialization_engine_integration.rs
-crates/warp-core/src/materialization/reduce_op.rs
-crates/warp-core/src/materialization/scoped_emitter.rs
-crates/warp-core/src/materialization/channel.rs
-crates/warp-core/src/materialization/emission_port.rs
-crates/warp-core/src/materialization/port.rs
-crates/echo-wasm-abi/tests/fuzz_wire.rs
-crates/echo-session-ws-gateway/src/main.rs
-crates/echo-session-proto/src/lib.rs
-⎿    ⎿  Found 91 files
-/Users/james/git/echo/node_modules/caniuse-lite/data/features/webusb.js
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.1sexrj8.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.1r817m6.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.1angc7c.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.0i713ur.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.11n0qwo.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.0i8sl4a.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.1nszx9e.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/tick_receipt_tests-39543b211e4d4255.4busktzzcy63cefdjoi4e2qv1.0c32ufk.rcg
-u.o
-/Users/james/git/echo/target/debug/deps/proptest_seed_pinning-3290e9553f67db96.edopj5bobustybpfmw8fuqp5x.11btdl8.
-rcgu.o
-/Users/james/git/echo/target/debug/deps/proptest_seed_pinning-3290e9553f67db96.edopj5bobustybpfmw8fuqp5x.0vajpoe.
-rcgu.o
-/Users/james/git/echo/target/debug/deps/proptest_seed_pinning-3290e9553f67db96.edopj5bobustybpfmw8fuqp5x.1ns4agz.
-rcgu.o
-/Users/james/git/echo/target/debug/deps/proptest_seed_pinning-3290e9553f67db96.edopj5bobustybpfmw8fuqp5x.1qe4gop.
-rcgu.o
-/Users/james/git/echo/target/debug/deps/xtask-bab4e62ad2822cb6.bnz4eu3milxbusdd79ekxkpk1.1bpnni2.rcgu.o
-/Users/james/git/echo/target/debug/deps/echo_wesley_gen-723da9b778112c31.bop21ayegbusye6lkkyvev5ea.033eybh.rcgu.o
-/Users/james/git/echo/target/debug/deps/warp_viewer-498a336359877566.b7g3r3oo1zbmxsfixz5s0busx.13iivtv.rcgu.o
-/Users/james/git/echo/target/debug/deps/echo_session_service-46acf066f0ffaefb.bus7far318jkmccszitcxc7bh.1bg35s7.r
-cgu.o
-/Users/james/git/echo/target/debug/deps/atom_payload_digest_tests-aa4965e76f0e2858.82u8n586bustdnlggsmyyemf3.1j7x
-36x.rcgu.o
-/Users/james/git/echo/target/debug/deps/atom_payload_digest_tests-aa4965e76f0e2858.82u8n586bustdnlggsmyyemf3.0by0
-oub.rcgu.o
-/Users/james/git/echo/target/debug/deps/atom_payload_digest_tests-aa4965e76f0e2858.82u8n586bustdnlggsmyyemf3.0uqy
-z8y.rcgu.o
-/Users/james/git/echo/target/debug/deps/atom_payload_digest_tests-aa4965e76f0e2858.82u8n586bustdnlggsmyyemf3.0sfy
-xxh.rcgu.o
-/Users/james/git/echo/target/debug/deps/warp_core-d87237a412a2c68f.a87ze4busok9irsb8p959hp34.0ir2rx5.rcgu.o
-/Users/james/git/echo/target/debug/deps/warp_core-d87237a412a2c68f.a87ze4busok9irsb8p959hp34.1a56pzh.rcgu.o
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_business_quarter.py
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_custom_business_month.
-py
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_business_day.py
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_custom_business_day.py
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_business_hour.py
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_custom_business_hour.p
-y
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_business_year.py
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/test_business_month.py
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_business_d
-ay.cpython-314.pyc
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_business_h
-our.cpython-314.pyc
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_business_m
-onth.cpython-314.pyc
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_business_q
-uarter.cpython-314.pyc
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_business_y
-ear.cpython-314.pyc
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_custom_bus
-iness_day.cpython-314.pyc
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_custom_bus
-iness_hour.cpython-314.pyc
-/Users/james/git/echo/.venv/lib/python3.14/site-packages/pandas/tests/tseries/offsets/**pycache**/test_custom_bus
-iness_month.cpython-314.pyc
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.11vuaxi.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0miia7n.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0mj36ps.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1qlllej.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1cr9dlk.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.09ugs3g.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0yvnnce.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1lwe92s.rcgu.o
-/Users/james/git/echo/target-clippy/debug/deps/libusvg-56c09378487b61e1.rmeta
-/Users/james/git/echo/target-test/debug/deps/libusvg-e365497d4e450faa.rmeta
-/Users/james/git/echo/target-test/debug/deps/libusvg-e365497d4e450faa.rlib
-/Users/james/git/echo/target-test/debug/incremental/echo_wasm_abi-16ox3qyzklihq/s-hey5mh83ss-19isaz6-8vcwqxf0q9as
-t9mxtmsjcmgwg/59womft9t83sbuse9a98d7hdj.o
-/Users/james/git/echo/target-test/debug/deps/echo_wasm_abi-3b5a24c1218ff99b.59womft9t83sbuse9a98d7hdj.1xjem33.rcg
-u.o
-/Users/james/git/echo/target-test/debug/deps/echo_wasm_abi-3b5a24c1218ff99b.59womft9t83sbuse9a98d7hdj.0qln340.rcg
-u.o
-/Users/james/git/echo/target-test/debug/deps/echo_wasm_abi-3b5a24c1218ff99b.59womft9t83sbuse9a98d7hdj.0n4b0wc.rcg
-u.o
-/Users/james/git/echo/target-test/debug/incremental/echo_session_proto-15c9hgpzknuyg/s-hexmd0tqpa-148oo1y-cqngx0p
-x6pp90xw8dr60wmpuk/2c76gsb0efj79x2xiczbusbpg.o
-/Users/james/git/echo/target-test/debug/deps/echo_session_proto-4345c03b4b2d3dd2.2c76gsb0efj79x2xiczbusbpg.08ow9f
-l.rcgu.o
-/Users/james/git/echo/target/debug/deps/libusvg-56c09378487b61e1.rmeta
-/Users/james/git/echo/target/debug/deps/libusvg-e365497d4e450faa.rmeta
-/Users/james/git/echo/target/debug/deps/libusvg-e365497d4e450faa.rlib
-/Users/james/git/echo/target/debug/incremental/echo_wasm_abi-16ox3qyzklihq/s-hey0hmxqb3-0tmprn8-4h2squ1s0kdabdqb6
-so6wrbph/59womft9t83sbuse9a98d7hdj.o
-/Users/james/git/echo/target/debug/deps/echo_wasm_abi-3b5a24c1218ff99b.59womft9t83sbuse9a98d7hdj.0jot3y7.rcgu.o
-/Users/james/git/echo/target/debug/deps/echo_wasm_abi-3b5a24c1218ff99b.59womft9t83sbuse9a98d7hdj.0gr8agf.rcgu.o
-/Users/james/git/echo/target/debug/incremental/echo_session_proto-15c9hgpzknuyg/s-hexmowcpzw-00z8cy4-4izq1prj46rq
-qepyfem91ad67/2c76gsb0efj79x2xiczbusbpg.o
-/Users/james/git/echo/target/debug/deps/echo_session_proto-4345c03b4b2d3dd2.2c76gsb0efj79x2xiczbusbpg.145450t.rcg
-u.o
-/Users/james/git/echo/target/debug/incremental/ledger_tests-3cr1zge85yfnj/s-hey58147lo-1kk7u0x-eupozq2hoa3rc89a41
-s9qhw3x/cobxgybuskq2v1p708by3jynh.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0ic3fem.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1k2o66w.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1q8i4ju.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1jxkgiw.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0xvrtpz.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0ykmq1l.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1k9k0vl.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1oil3i5.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1vkx5co.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0xnv2vt.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1y00ozh.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1x2vx71.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1n0bcq8.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.1nzunit.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.0ra8wep.rcgu.o
-/Users/james/git/echo/target/debug/deps/ledger_tests-6fb4459ad51559d5.cobxgybuskq2v1p708by3jynh.023ynya.rcgu.o
-/Users/james/git/echo/target-doc/doc/src/warp_core/materialization/bus.rs.html
-/Users/james/git/echo/docs/rfc/mat-bus-finish.md
-/Users/james/git/echo/crates/warp-core/src/materialization/bus.rs
-/Users/james/git/echo/.git/refs/heads/materialization-bus
-/Users/james/git/echo/.git/logs/refs/heads/materialization-bus
-/Users/james/git/echo/target/doc/src/warp_core/materialization/bus.rs.html
-/Users/james/git/echo/.git/refs/remotes/origin/materialization-bus
-/Users/james/git/echo/.git/logs/refs/remotes/origin/materialization-bus
-/Users/james/git/echo/target/release/deps/libusvg-ee7552b6ee3198dd.rmeta
-/Users/james/git/echo/target/release/deps/libusvg-ee7552b6ee3198dd.rlib
-⎿    ⎿  Found 100 files
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.06
-x6107.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.1c
-ut5l8.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.0p
-bjco0.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.1e
-raiy7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.18
-uyui9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.0b
-ce2b9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.1g
-d1srp.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.1r
-1fz76.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.1u
-xcmjw.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.0l
-ncwqm.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.19
-klqm3.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.1h
-bam4u.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.0n
-em2mg.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.458o3anq7v5ei1q8z20540fup.1x
-1wyfh.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.1g
-d1srp.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.0l
-ncwqm.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.1u
-xcmjw.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.1r
-1fz76.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.0n
-em2mg.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.19
-klqm3.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.1h
-bam4u.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.1x
-1wyfh.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.06
-x6107.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.1c
-ut5l8.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.18
-uyui9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.1e
-raiy7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.9sywwjg0h73tyozwu3lguqdr7.0b
-ce2b9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.06
-x6107.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.1c
-ut5l8.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.1e
-raiy7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.0p
-bjco0.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.18
-uyui9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.0b
-ce2b9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.1g
-d1srp.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.1u
-xcmjw.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.1r
-1fz76.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.0l
-ncwqm.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.19
-klqm3.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.1h
-bam4u.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.0n
-em2mg.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.0mwcd2xzxpyz143zpqb1b3ukp.1x
-1wyfh.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5ljy85n9s1fqeqxazu3at72hx.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5ljy85n9s1fqeqxazu3at72hx.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5ljy85n9s1fqeqxazu3at72hx.1x
-1wyfh.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5ljy85n9s1fqeqxazu3at72hx.1r
-1fz76.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.1g
-d1srp.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.1r
-1fz76.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.1u
-xcmjw.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.0l
-ncwqm.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.1h
-bam4u.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.19
-klqm3.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.0n
-em2mg.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.1x
-1wyfh.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.1c
-ut5l8.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.06
-x6107.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.0p
-bjco0.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.1e
-raiy7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.18
-uyui9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.5g738ui0p7faehn5splq2tldc.0b
-ce2b9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.2dx9lk4m6lxh7j4to31m8hz4z.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.8a85nivbd6thl615y0udnt1iu.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.0n
-em2mg.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.1h
-bam4u.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.19
-klqm3.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.1x
-1wyfh.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.1g
-d1srp.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.0l
-ncwqm.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.1r
-1fz76.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.1u
-xcmjw.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.0b
-ce2b9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.1c
-ut5l8.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.06
-x6107.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.18
-uyui9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.0p
-bjco0.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.f1nwe9ovq4s2jqnwet5x8y051.1e
-raiy7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.06mkffwp3ptvvuyqw4m5zi87w.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.06mkffwp3ptvvuyqw4m5zi87w.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.03
-1pzv7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.0b
-ce2b9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.1c
-ut5l8.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.06
-x6107.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.0n
-9nxey.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.18
-uyui9.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.1e
-raiy7.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.0p
-bjco0.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.0n
-em2mg.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.1h
-bam4u.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.19
-klqm3.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.1x
-1wyfh.rcgu.o
-/Users/james/git/echo/target/debug/deps/materialization_determinism-001ea16f8c1d82dc.1cxt0lzvzr446desi43238t6m.1g
-d1srp.rcgu.o
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/bus.rs)
-
-⎿  Read(/Users/james/git/echo/docs/adr/ADR-0003-Materialization-Bus.md)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/mod.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/frame.rs)
-
-⎿  Read 488 lines
-
-⎿  Read 126 lines
-
-⎿  Read 65 lines
-
-⎿  Read 255 lines
-
-⎿  Search(pattern: "state*root|patch.*digest|hash.\*state", glob: "\*\*/\_.rs", output_mode: "content", head_limit: 50)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/emit_key.rs)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/channel.rs)
-
-⎿  Read 165 lines
-
-⎿  Read 177 lines
-
-⎿    ⎿  Found 50 lines
-crates/warp-core/src/graph.rs:414: /// Computes a canonical hash of the entire graph state.
-crates/warp-core/src/constants.rs:8:/// This value is committed into both `patch_digest` (tick patches) and
-crates/warp-core/src/snapshot.rs:7://! definitions of `state_root` (graph-only hash) and `commit hash` (aka
-crates/warp-core/src/snapshot.rs:8://! `commit_id`: `state_root` + metadata + parents).
-crates/warp-core/src/snapshot.rs:11://! - The graph state hash (`state_root`) is a BLAKE3 digest over a canonical
-crates/warp-core/src/snapshot.rs:45:/// `state_root` (graph-only hash) and commit metadata (parents, digests,
-crates/warp-core/src/snapshot.rs:52: /// Canonical commit hash derived from `state_root` + metadata (see
-below).
-crates/warp-core/src/snapshot.rs:69: /// commit id commits to `state_root` and `patch_digest` (plus
-parents/policy),
-crates/warp-core/src/snapshot.rs:71: pub patch_digest: Hash,
-crates/warp-core/src/snapshot.rs:88:pub(crate) fn compute_state_root(state: &WarpState, root: &NodeKey) -> Hash {
-crates/warp-core/src/snapshot.rs:211:/// Computes the final commit hash from the state root and metadata digests.
-crates/warp-core/src/snapshot.rs:216: state_root: &Hash,
-crates/warp-core/src/snapshot.rs:232: h.update(state_root);
-crates/warp-core/src/snapshot.rs:242:/// Commit hash v2 commits only to the replay boundary artifact: `state_root`
-crates/warp-core/src/snapshot.rs:243:/// and the tick `patch_digest` (plus explicit parents and policy id).
-crates/warp-core/src/snapshot.rs:245: state_root: &Hash,
-crates/warp-core/src/snapshot.rs:247: patch_digest: &Hash,
-crates/warp-core/src/snapshot.rs:258: // State root + patch digest + policy id.
-crates/warp-core/src/snapshot.rs:259: h.update(state_root);
-crates/warp-core/src/snapshot.rs:260: h.update(patch_digest);
-crates/warp-core/src/tick_patch.rs:295:/// The patch digest commits to:
-crates/warp-core/src/tick_patch.rs:345: let digest = compute_patch_digest_v2(
-crates/warp-core/src/tick_patch.rs:414: let expected = compute_patch_digest_v2(
-crates/warp-core/src/tick_patch.rs:750: /// The patch digest did not match its contents.
-crates/warp-core/src/tick_patch.rs:751: #[error("patch digest mismatch")]
-crates/warp-core/src/tick_patch.rs:755:fn compute_patch_digest_v2(
-crates/warp-core/src/tick_patch.rs:802:/// Encodes ops into the patch digest stream.
-crates/warp-core/src/tick_patch.rs:805:/// stable, versioned encoding for hashing (`patch_digest`). They are
-crates/warp-core/src/tick_patch.rs:949:/// edits suitable for deterministic replay and hashing
-(`patch_digest`).
-crates/warp-core/src/tick_patch.rs:978:/// for both replay ordering and `patch_digest` hashing.
-crates/warp-core/tests/dpo_concurrency_litmus.rs:111: a.patch_digest, b.patch_digest,
-crates/warp-core/tests/dpo_concurrency_litmus.rs:112: "patch digest must be order-independent"
-crates/warp-core/src/engine_impl.rs:20:use crate::snapshot::{compute_commit_hash_v2, compute_state_root,
-Snapshot};
-crates/warp-core/src/engine_impl.rs:233: /// The policy ID is committed into `patch_digest` and `commit_id` v2.
-crates/warp-core/src/engine_impl.rs:317: /// Policy identifier committed into `patch_digest` (tick patches) and
-crates/warp-core/src/engine_impl.rs:378: /// `policy_id` is committed into both `patch_digest` (tick patches)
-and
-crates/warp-core/src/engine_impl.rs:395: /// - `policy_id`: Policy identifier committed into `patch_digest` and
-`commit_id` v2.
-crates/warp-core/src/engine_impl.rs:415: /// - `policy_id`: Policy identifier committed into `patch_digest` and
-`commit_id` v2.
-crates/warp-core/src/engine_impl.rs:444: /// - `policy_id`: Policy identifier committed into `patch_digest` and
-`commit_id` v2.
-crates/warp-core/src/engine_impl.rs:511: /// - `policy_id`: policy identifier committed into `patch_digest` and
-`commit_id` v2.
-crates/warp-core/src/engine_impl.rs:581: /// - `policy_id`: Policy identifier committed into `patch_digest` and
-`commit_id` v2.
-crates/warp-core/src/engine_impl.rs:843: let patch_digest = patch.digest();
-crates/warp-core/src/engine_impl.rs:845: let state_root = crate::snapshot::compute_state_root(&self.state,
-&self.current_root);
-crates/warp-core/src/engine_impl.rs:855: &state_root,
-crates/warp-core/src/engine_impl.rs:857: &patch_digest,
-crates/warp-core/src/engine_impl.rs:867: patch_digest,
-crates/warp-core/src/engine_impl.rs:1000: // same v2 commit hash shape (parents + state_root +
-patch_digest) but
-crates/warp-core/src/engine_impl.rs:1003: let state_root = compute_state_root(&self.state,
-&self.current_root);
-crates/warp-core/src/engine_impl.rs:1015: let patch_digest = WarpTickPatchV1::new(
-crates/warp-core/src/engine_impl.rs:1024: let hash = compute_commit_hash_v2(&state_root, &parents,
-&patch_digest, policy_id);
+### 2.3 ActiveFootprints + GenSet (`src/scheduler.rs`)
 
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/snapshot.rs · lines 1-150)
+`GenSet` provides O(1) per-key conflict tracking without clearing hash tables
+between transactions. A generation counter stamps each mark; `contains()` is
+a simple `seen[key] == gen` check.
 
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/tick_patch.rs · lines 1-150)
+```rust
+pub(crate) struct GenSet<K> {
+    gen: u32,
+    seen: FxHashMap<K, u32>,
+}
+```
+
+`PendingTx` holds candidates awaiting admission:
+
+```rust
+struct PendingTx<P> {
+    next_nonce: u32,
+    index: FxHashMap<([u8; 32], u32), usize>,  // last-wins dedupe
+    thin: Vec<RewriteThin>,     // 24B + 4B handle, radix-sortable
+    fat: Vec<Option<P>>,        // payload storage
+    scratch: Vec<RewriteThin>,  // radix sort double-buffer
+    counts16: Vec<u32>,         // 65536-bucket histogram
+}
+```
+
+### 2.4 WarpOp + WarpTickPatchV1 (`src/tick_patch.rs`)
+
+Eight operation variants define all state mutations:
+
+```rust
+pub enum WarpOp {
+    OpenPortal    { key, child_warp, child_root, init },
+    UpsertWarpInstance { instance },
+    DeleteWarpInstance { warp_id },
+    UpsertNode    { node, record },
+    DeleteNode    { node },
+    UpsertEdge    { warp_id, record },
+    DeleteEdge    { warp_id, from, edge_id },
+    SetAttachment { key, value },
+}
+```
 
-⎿  Read 150 lines
+Each op carries a `WarpOpKey` for canonical merge ordering.
 
-⎿  Read 150 lines
+```rust
+pub enum SlotId {
+    Node(NodeKey),
+    Edge(EdgeKey),
+    Attachment(AttachmentKey),
+    Port(WarpScopedPortKey),
+}
+```
 
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/tick_patch.rs · lines 290-439)
+### 2.5 MaterializationBus + EmitKey + ScopedEmitter (`src/materialization/`)
 
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/engine_impl.rs · lines 820-899)
+Order-independent output collection using BTreeMap for deterministic
+finalization. Duplicate detection rejects identical `(channel, EmitKey)` pairs.
+Thread-unsafe by design (single-threaded tick execution).
 
-⎿  Read 150 lines
+```rust
+pub struct MaterializationBus {
+    pending: RefCell<BTreeMap<ChannelId, BTreeMap<EmitKey, Vec<u8>>>>,
+    policies: BTreeMap<ChannelId, ChannelPolicy>,
+}
 
-⎿  Read 80 lines
+pub struct EmitKey {
+    pub scope_hash: Hash,   // content hash of scope node
+    pub rule_id: u32,       // compact rule ID
+    pub subkey: u32,        // multi-emission differentiator
+}
+```
 
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/tick_patch.rs · lines 750-849)
-
-⎿  Search(pattern: "fn compute\*patch_digest", glob: "\*\*/\_.rs", output_mode: "content", head_limit: 20)
-
-⎿  Read 100 lines
-
-⎿    ⎿  Found 1 line
-crates/warp-core/src/tick_patch.rs:755:fn compute_patch_digest_v2(
-⎿  Read(/Users/james/git/echo/docs/rfc/mat-bus-finish.md)
-
-⎿  Read(/Users/james/git/echo/crates/warp-core/src/materialization/reduce_op.rs)
-
-⎿  Read 661 lines
-
-⎿  Read 385 lines
-
-⎿  Response:
-Perfect! Now I have comprehensive information. Let me create a detailed research report.
-
-       Research Summary: Materialization Bus Infrastructure in WARP
-
-       Based on my thorough search of the warp-core codebase, here's what I found regarding materialization, the bus
-       infrastructure, and hash computation:
-
-       1. MaterializationBus Infrastructure
-
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/bus.rs
-
-       The MaterializationBus is a tick-scoped internal infrastructure that collects emissions from rewrite rules during
-        a tick:
-
-       - Core Data Structure: Uses BTreeMap<ChannelId, BTreeMap<EmitKey, Vec<u8>>> for order-independent storage
-       - Thread Safety: Intentionally not thread-safe (!Sync) using RefCell for interior mutability - by design, since
-       rewrite engine processes rules sequentially within a tick
-       - Key Methods:
-         - emit(channel, emit_key, data) - Collects emissions, rejects duplicate (channel, EmitKey) pairs
-         - finalize() - Post-commit resolution according to each channel's policy, returns FinalizeReport
-         - clear() - Clears pending emissions (for abort path)
+`ScopedEmitter` prevents key forgery: the engine fills `scope_hash` and
+`rule_id`; rules cannot construct `EmitKey` directly.
 
-       Order Independence (Confluence Safety): The BTreeMap ordering ensures finalization iterates in deterministic
-       (canonical) order regardless of rewrite execution order, preserving confluence.
+### 2.6 WSC Format Types (`src/wsc/types.rs`)
 
-       2. Graph State Materialization
+Fixed-size columnar rows, all `#[repr(C)]` + `Pod` + `Zeroable` for
+zero-copy access via `bytemuck::try_cast_slice()`.
 
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/mod.rs (architecture diagram)
+```rust
+#[repr(C)]
+pub struct WscHeader {       // 128 bytes
+    pub magic: [u8; 8],      // b"WSC\x00\x01\x00\x00\x00"
+    pub schema_hash: Hash,   // 32
+    pub tick_le: u64,
+    pub warp_count_le: u64,
+    pub warp_dir_off_le: u64,
+    pub reserved: [u8; 64],
+}
 
-       The materialization system follows a hexagonal architecture:
+#[repr(C)]
+pub struct NodeRow {         // 64 bytes
+    pub node_id: Hash,       // 32
+    pub node_type: Hash,     // 32
+}
 
-       External World (ViewOps frames)
-                ▲
-                │
-           MaterializationPort (Boundary API)
-                │
-           MaterializationBus (Internal Runtime)
-                │
-              Engine (commit → finalize)
+#[repr(C)]
+pub struct EdgeRow {         // 128 bytes
+    pub edge_id: Hash,       // 32
+    pub from_node_id: Hash,  // 32
+    pub to_node_id: Hash,    // 32
+    pub edge_type: Hash,     // 32
+}
 
-       Current Implementation:
-       - Emissions are stored in channels keyed by EmitKey
-       - Materialization frames are encoded as length-prefixed binary ("MBUS" format)
-       - Support for three channel policies: Log (default), StrictSingle, and Reduce(op)
+#[repr(C)]
+pub struct AttRow {          // 56 bytes
+    pub tag: u8,             // 1=Atom, 2=Descend
+    pub reserved0: [u8; 7],
+    pub type_or_warp: Hash,  // TypeId or WarpId
+    pub blob_off_le: u64,
+    pub blob_len_le: u64,
+}
+```
+
+### 2.7 Snapshot + TickReceipt (`src/snapshot.rs`, `src/receipt.rs`)
+
+```rust
+pub struct Snapshot {
+    pub root: NodeKey,
+    pub hash: Hash,
+    pub state_root: Hash,
+    pub parents: Vec<Hash>,
+    pub plan_digest: Hash,
+    pub decision_digest: Hash,
+    pub rewrites_digest: Hash,
+    pub patch_digest: Hash,
+    pub policy_id: u32,
+    pub tx: TxId,
+}
+```
 
-       3. EmitKey: Order-Independent Emission Identification
+`TickReceipt` records the causality poset witness for each tick:
 
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/emit_key.rs
+```rust
+pub struct TickReceipt {
+    tx: TxId,
+    entries: Vec<TickReceiptEntry>,  // canonical plan order
+    blocked_by: Vec<Vec<u32>>,      // causality poset witness
+    digest: Hash,                   // commits to entries only
+}
+```
 
-       The EmitKey ensures deterministic ordering:
+---
 
-       pub struct EmitKey {
-           pub scope_hash: Hash,           // Hash of scope node where rewrite applied
-           pub rule_id: u32,               // Compact rule identifier
-           pub subkey: u32,                // Differentiator for multiple emissions per rule
-       }
+## 3) Tick Execution Pipeline
 
-       Ordering: Lexicographic (scope_hash, rule_id, subkey) matching scheduler's canonical ordering
+The pipeline runs once per tick, transforming ingress into a committed
+snapshot.
 
-       Subkey Usage: For rules emitting multiple items (e.g., iterating children), use stable subkey derived from item
-       hash via EmitKey::subkey_from_hash(h: &Hash) -> u32
+```text
+  ┌──────────┐    ┌──────────┐    ┌──────────┐    ┌──────────┐
+  │ 1.Ingest │───►│ 2.Match  │───►│ 3.Radix  │───►│ 4.Reserve│
+  │ + Dispatch│    │ + Plan   │    │  Drain   │    │ (GenSet) │
+  └──────────┘    └──────────┘    └──────────┘    └──────────┘
+                                                       │
+  ┌──────────┐    ┌──────────┐                         ▼
+  │ 6.Commit │◄───│ 5.Execute│◄────────────────────────┘
+  │ + Hash   │    │ Parallel │
+  └──────────┘    └──────────┘
+```
 
-       4. Channel Policies and Reduce Operations
+**Step 1 — Ingest + Dispatch.** Intents arrive via the inbox subsystem.
+`ingest_inbox_event()` creates event nodes under the `sim/inbox` path and
+attaches pending edges from opaque intent bytes. `dispatch_inbox_rule()`
+drains pending intents and acks them.
 
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/channel.rs and
-       /Users/james/git/echo/crates/warp-core/src/materialization/reduce_op.rs
+**Step 2 — Rule Matching + Footprint.** For each candidate rule/scope pair,
+the engine calls `MatchFn` to test applicability and `FootprintFn` to compute
+the warp-scoped resource set. Each accepted match becomes a `PendingRewrite`
+with fields `(scope_hash, rule_id, compact_rule, footprint, origin)`.
 
-       Channel Policies:
+**Step 3 — Radix Drain.** `PendingTx::drain_in_order()` produces candidates
+in a canonical byte-lexicographic order. The ordering key is
+`(scope_hash[32B BE], rule_id[4B], nonce[4B])` — see §4 for algorithm details.
 
+**Step 4 — Independence Check + Reservation.** Candidates are tested against
+`ActiveFootprints` using `GenSet`-based O(1) conflict detection. Independent
+candidates are atomically reserved (mark-all-or-nothing). Conflicting
+candidates are deferred or rejected per `ConflictPolicy`.
 
-       ┌──────────────┬─────────────────────────────────────────────────┐
-       │    Policy    │                    Behavior                     │
-       ├──────────────┼─────────────────────────────────────────────────┤
-       │ Log          │ All emissions in EmitKey order, length-prefixed │
-       ├──────────────┼─────────────────────────────────────────────────┤
-       │ StrictSingle │ Error if >1 emission (catches bugs)             │
-       ├──────────────┼─────────────────────────────────────────────────┤
-       │ Reduce(op)   │ Merge via deterministic operation               │
-       └──────────────┴─────────────────────────────────────────────────┘
-       ReduceOp Variants:
+**Step 5 — Parallel Execution.** Admitted rewrites are dispatched to workers.
+Each worker receives a `GraphView` (read-only snapshot projection) and emits
+ops into a thread-local `&mut TickDelta`. There is no shared mutable state —
+determinism is enforced by the merge step, not execution order.
 
-       Commutative Monoids (permutation-invariant):
-       - Sum - u64 little-endian addition (empty→[0;8])
-       - Max, Min - lexicographic comparison
-       - BitOr, BitAnd - bitwise operations with padding/truncation
+**Step 6 — Canonical Merge + Commit.** Thread-local deltas are merged
+canonically (§6.3). The merged ops are applied to produce the next snapshot.
+The engine computes `state_root`, `patch_digest`, and `commit_hash`
+(§7), then stores the `Snapshot` and `TickReceipt`.
 
-       Order-Dependent (deterministic via EmitKey order, NOT commutative):
-       - First - take first by EmitKey order
-       - Last - take last by EmitKey order
-       - Concat - concatenate all in order
+---
 
-       All operations include is_commutative() method for runtime classification.
+## 4) Radix Scheduler Algorithm
 
-       5. State Root and Commit Hash Computation
+**Ref:** `src/scheduler.rs`
 
-       Location: /Users/james/git/echo/crates/warp-core/src/snapshot.rs
+The scheduler uses LSD (least-significant-digit) radix sort to produce a
+canonical ordering of pending rewrites. This is O(n) in the number of
+candidates with zero comparisons.
 
-       State Root (compute_state_root):
-       - BLAKE3 digest over canonical byte stream of entire reachable graph state
-       - Deterministic ordering: nodes visited in ascending NodeId order, edges sorted by EdgeId
-       - Includes reachability across instances via Descend attachments
-       - Fixed-size, architecture-independent encoding:
-         - 32-byte ids (NodeId, TypeId, EdgeId)
-         - 1 byte presence tag + 32 bytes type_id + 8-byte LE length + payload bytes
+### Sort Parameters
 
-       Commit Hash (v2): compute_commit_hash_v2(state_root, parents, patch_digest, policy_id)
-       - Commits to: state_root + explicit parents + patch_digest + policy_id
-       - Uses BLAKE3 hashing
+- **Key:** 40 bytes = `scope_hash[32B] || rule_id[4B] || nonce[4B]`
+- **20 LSD passes** with 16-bit digits (65,536 buckets per pass)
+- **Pass order:** nonce bytes [0,1], rule bytes [0,1], scope pairs [15..0]
+- **Result:** byte-lexicographic order `(scope_be32, rule_id, nonce)`
 
-       6. Tick Patch and Patch Digest Computation
+### Small-Batch Fallback
 
-       Location: /Users/james/git/echo/crates/warp-core/src/tick_patch.rs
+When the candidate count is below `SMALL_SORT_THRESHOLD = 1024`, the scheduler
+falls back to comparison sort, which is faster for small n due to lower
+constant factors.
 
-       WarpTickPatchV1: The boundary artifact for deterministic replay
+### Deduplication
 
-       Patch Digest (compute_patch_digest_v2): Commits to:
-       - Patch format version (v2)
-       - policy_id
-       - rule_pack_id
-       - commit_status (Committed/Aborted)
-       - in_slots / out_slots (sorted, deduped)
-       - ops (canonical delta operations)
+`PendingTx` uses an `FxHashMap` keyed on `(scope_hash, compact_rule)` with
+last-wins semantics. `FxHashMap` is safe here because it is internal to the
+scheduler and never crosses a determinism boundary — iteration order over
+the map is irrelevant since all entries are drained through the radix sort.
 
-       Digest Encoding: BLAKE3 of structured format:
-       - Version as u16 LE
-       - Policy ID as u32 LE
-       - Rule pack ID (32 bytes)
-       - Commit status code (1 byte)
-       - Encoded slots (tag + ids for Node/Edge/Attachment/Port)
-       - Encoded ops (tag + operation-specific fields)
+---
 
-       Operations (8 types):
-       - OpenPortal, UpsertWarpInstance, DeleteWarpInstance
-       - UpsertNode, DeleteNode
-       - UpsertEdge, DeleteEdge
-       - UpsertAttachment, DeleteAttachment
+## 5) Conflict Detection
 
-       7. Engine Integration
+**Ref:** `src/footprint.rs`, `src/scheduler.rs`, `src/footprint_guard.rs`
 
-       Location: /Users/james/git/echo/crates/warp-core/src/engine_impl.rs
+### Independence Check
 
-       Commit Flow:
-       1. engine_impl.rs:829-831 - Bus finalization: let mat_report = self.bus.finalize()
-       2. engine_impl.rs:834-843 - Tick patch creation with ops from state diff
-       3. engine_impl.rs:843-859 - Parallel computation:
-         - patch_digest = patch.digest()
-         - state_root = compute_state_root(&self.state, &self.current_root)
-         - hash = compute_commit_hash_v2(&state_root, &parents, &patch_digest, policy_id)
-       4. Creates Snapshot with all digests and transaction tracking
+`Footprint::independent()` performs 5 resource checks with early exit:
 
-       Abort Flow: engine_impl.rs:889-891
-       - bus.clear() - clears pending emissions
-       - last_materialization.clear() - invalidates stale cached state
+1. **Factor mask (O(1)):** `(self.factor_mask & other.factor_mask) == 0` →
+   independent, skip remaining checks
+2. **Boundary ports:** any `b_in`/`b_out` intersection → conflict
+3. **Edges:** `e_write ∩ e_write`, `e_write ∩ e_read`, or
+   reverse → conflict
+4. **Attachments:** `a_write ∩ a_write`, `a_write ∩ a_read`, or
+   reverse → conflict
+5. **Nodes:** `n_write ∩ n_write`, `n_write ∩ n_read`, or
+   reverse → conflict
 
-       8. Determinism Testing & Design Documents
+If all five checks pass, the rewrites are independent.
 
-       ADR-0003 (Determinism Philosophy): /Users/james/git/echo/docs/adr/ADR-0003-Materialization-Bus.md
-       - Establishes causality-first API (ingress-only writes)
-       - Bus-first UI via MaterializationPort
-       - Confluence-safe emission semantics with order-independent storage
-       - Rejects silent "winner picks" - requires explicit policy
+### GenSet Mechanism
 
-       RFC: MaterializationBus Completion: /Users/james/git/echo/docs/rfc/mat-bus-finish.md
-       - Specifies EmissionPort trait (hexagonal boundary)
-       - ScopedEmitter adapter (auto-fills EmitKey)
-       - Duplicate (channel, EmitKey) rejection policy
-       - Comprehensive cross-platform determinism test suite
+`GenSet` provides O(1) per-key conflict detection without clearing hash
+tables between transactions. Each `mark(key)` stamps the current generation;
+`contains(key)` checks `seen[key] == gen`. Calling `advance()` increments the
+generation counter, logically clearing all marks without touching the map.
 
-       9. Frame Encoding Format
+### Atomic Reservation
 
-       Location: /Users/james/git/echo/crates/warp-core/src/materialization/frame.rs
+Admission is all-or-nothing per candidate: all resource keys in the footprint
+are marked, or none are (if any conflict is found, the reservation is aborted).
 
-       Binary frame format ("MBUS"):
-       magic[4]    = "MBUS" (0x4D, 0x42, 0x55, 0x53)
-       version[2]  = 0x0001 (little-endian)
-       reserved[2] = 0x0000
-       length[4]   = payload byte length (LE)
-       payload[len] = channel_id[32] || data[len-32]
+### FootprintGuard (Runtime Enforcement)
 
-       All multi-byte integers are little-endian. Max payload ≈4GB (u32 limitation).
+`FootprintGuard` validates that executors stay within their declared footprint.
+Active in debug builds and when `footprint_enforce_release` feature is enabled
+(disabled by `unsafe_graph`). Violations produce a `FootprintViolation` with
+one of 9 `ViolationKind` variants:
 
-       ---
-       Key Insights:
+```rust
+pub enum ViolationKind {
+    NodeReadNotDeclared(NodeId),
+    EdgeReadNotDeclared(EdgeId),
+    AttachmentReadNotDeclared(AttachmentKey),
+    NodeWriteNotDeclared(NodeId),
+    EdgeWriteNotDeclared(EdgeId),
+    AttachmentWriteNotDeclared(AttachmentKey),
+    CrossWarpEmission { op_warp: WarpId },
+    UnauthorizedInstanceOp,
+    OpWarpUnknown,
+}
+```
 
-       1. No Hash Collision Risk at Materialization Level - EmitKey uses scope_hash + rule_id + subkey, making
-       collisions astronomically unlikely
-       2. Determinism by Construction - BTreeMaps enforce canonical ordering at every level; same emissions always
-       produce same bytes
-       3. Confluence-First Design - Silent data loss is prohibited; use explicit policies (Log/StrictSingle/Reduce)
-       4. Tick-Scoped Lifecycle - Bus is cleared after finalization, preventing cross-tick contamination
-       5. Paper III Integration - Tick patches are replayable delta artifacts sufficient for deterministic state
-       recovery
+---
 
-⎿  Done (20 tool uses · 94.3k tokens · 53s)
+## 6) BOAW Parallel Execution (Phase 6B)
 
-❯ please checkout a git branch called graph-boaw for this work and be sure to git -A and git commit before ending each
-of your turns
+**Ref:** `src/boaw/shard.rs`, `src/boaw/exec.rs`, `src/boaw/merge.rs`
 
-∴ Thinking…
+### 6.1 Virtual Shard Partitioning
 
-The user wants me to:
+```rust
+pub const NUM_SHARDS: usize = 256;
+const SHARD_MASK: u64 = 255;
 
-1. Create a new git branch called graph-boaw for the BOAW work
-2. Commit any changes before ending each turn
+pub fn shard_of(scope: &NodeId) -> usize {
+    let first_8 = &scope.0[0..8];
+    let val = u64::from_le_bytes(first_8.try_into().unwrap());
+    (val & SHARD_MASK) as usize
+}
+```
 
-Let me first create the branch and then continue with my analysis and implementation plan.
+`NUM_SHARDS = 256` is a **frozen protocol constant** — changing it requires a
+version bump. The formula takes the first 8 bytes of the NodeId's 32-byte hash,
+interprets them as a little-endian u64, and masks to 255. This provides:
 
-⏺ Let me create the branch for this work first.
+- **Load balance:** 256 virtual shards vs 8–64 typical workers
+- **Cache locality:** scope-adjacent rewrites land in the same shard
+- **Platform independence:** LE interpretation is explicit
 
-⏺ Bash(git checkout -b graph-boaw)
-⎿  Switched to a new branch 'graph-boaw'
+### 6.2 Worker Execution
 
-∴ Thinking…
+`execute_parallel_sharded()` dispatches `ExecItem` work units across workers.
+Workers atomically claim shards and execute all items within a claimed shard.
 
-Good, branch created. Now let me compile my analysis into a comprehensive implementation plan. I have a lot of context from
-the subagent explorations.
+```rust
+pub struct ExecItem {
+    pub exec: ExecuteFn,
+    pub scope: NodeId,
+    pub origin: OpOrigin,
+}
 
-Let me summarize what I've learned:
+pub enum WorkerResult {
+    Success(TickDelta),
+    Poisoned(PoisonedDelta),
+    MissingStore(WarpId),
+}
+```
 
-Current State
+If a rule panics during execution, `catch_unwind` captures the panic and wraps
+it as `PoisonedDelta`. The panic is surfaced at merge time as a typed error,
+not an uncontrolled crash.
 
-1. GraphStore (graph.rs, 568 lines): In-memory BTreeMap-based store with nodes, edges, attachments. Supports canonical
-   hashing via canonical_state_hash().
-2. WSC Format (wsc/): Mature zero-copy snapshot format with:
-    - WscFile / WarpView for reading
-    - write_wsc_one_warp for writing
-    - build_one_warp_input() for GraphStore → WSC conversion
-    - All Pod types, 8-byte aligned, ready for mmap
+When `footprint_enforce_release` is enabled, `GraphView::new_guarded(store, guard)`
+wraps reads, and `check_op()` validates each emitted op post-execution.
 
-3. Footprint Infrastructure (footprint.rs, 250 lines): Already has:
-    - Footprint struct with read/write sets for nodes, edges, attachments, ports
-    - factor_mask for O(1) prefiltering
-    - independent() method for conflict detection
+### 6.3 Canonical Merge
 
-4. Scheduler (scheduler.rs, 1304 lines): RadixScheduler with:
-    - PendingRewrite with footprint and phase tracking
-    - ActiveFootprints with GenSet for O(1) conflict detection
-    - O(n) radix sort for deterministic ordering
-    - try_reserve() for admission control
+The merge algorithm guarantees deterministic output regardless of worker count
+or execution order:
 
-5. TickPatch (tick_patch.rs, 1694 lines): Has:
-    - WarpOp enum (UpsertNode, DeleteNode, UpsertEdge, DeleteEdge, SetAttachment, etc.)
-    - WarpTickPatchV1 with ops, in_slots, out_slots, patch_digest
-    - **[Phase 5 Complete]**: Now used for execution emissions via TickDelta
+1. **Flatten:** Collect all ops from all worker deltas with their `OpOrigin`
+2. **Sort:** Order by `(WarpOpKey, OpOrigin)` for canonical ordering
+3. **Validate new warps:** Collect `OpenPortal` ops with `PortalInit::Empty`;
+   reject same-tick writes to newly created warps
+4. **Dedupe:** Identical ops from different origins are collapsed to one
+5. **Conflict detection:** Divergent ops on the same `WarpOpKey` →
+   `MergeConflict`
 
-6. Engine (engine_impl.rs, 1806 lines): **[Phase 5 Complete]**: Current flow:
-    - Executors receive `&GraphView` (read-only) and emit ops to `&mut TickDelta`
-    - No GraphStore mutation during execution
-    - State updated post-execution via `apply_to_state()`
+```rust
+pub enum MergeError {
+    Conflict(Box<MergeConflict>),
+    PoisonedDelta(PoisonedDelta),
+    WriteToNewWarp { warp_id: WarpId, op_origin: OpOrigin, op_kind: &'static str },
+}
+```
 
-7. Materialization (materialization/): Mature bus system for output emissions with deterministic ordering.
+**Policy:** Merge conflicts are bugs — they mean the footprint model lied.
+There is no recovery path; the tick is aborted.
 
-What ADR-0007 Requires
+---
 
-The ADR outlines a migration plan (status as of 2026-01-18):
+## 7) State Root Hashing
 
-1. Step 1: Introduce TickDelta + canonical merge alongside existing GraphStore **[COMPLETE]**
-2. Step 2: Change executors to emit ops into TickDelta (stop writing GraphStore) **[COMPLETE - Phase 5]**
-3. Step 3: Implement SnapshotBuilder that applies TickDelta to produce next snapshot **[COMPLETE - Phase 4]**
-4. Step 4: Wire WSC writer as canonical snapshot output **[COMPLETE]**
-5. Step 5: Read-only execution - GraphView instead of &mut GraphStore **[COMPLETE - Phase 5]**
-6. Step 6: Add collapse/merge phase with typed registry **[PENDING]**
-7. Step 7: Add mind/diagnostics enforcement gates **[PENDING]**
+**Ref:** `src/snapshot.rs`, `src/graph.rs`, `src/tick_patch.rs`
 
-My Implementation Plan
+All hashing uses BLAKE3.
 
-Based on the ADR's sequencing section (lines 1062-1105), here's what I'll propose:
+### State Root (`canonical_state_hash()`)
 
-Phase 1: ADR + Test Skeletons (First Commit)
+Deterministic BFS to collect the reachable graph across warp instances:
 
-- The ADR is already written - it's the file I read
-- Add the test skeletons from the ADR (lines 604-1043)
-- These tests will fail initially - that's intentional
+- Header: `b"echo:state_root:v1\0"`
+- Per-instance: `warp_id`, `root_node_id`, parent attachment key
+- Nodes in ascending `NodeId` order, each contributing `(node_id, type_id)`
+- Edges per source node, sorted by `EdgeId`, filtered to reachable targets
+- Attachments: ATOM → `(type_id, blob_len as u64, bytes)`, DESC → `(warp_id)`
 
-    Phase 2: Wire TestHarness (Second Commit)
+Node and edge counts are encoded as `u64` for version stability.
 
-- Implement TestHarness against the test structure, following the ADR's guidance on how tests should be organized and what
-  they should validate.
+### Commit Hash
 
-    The next phases build on this foundation: TickDelta collects operations during execution rather than mutating state
-    directly, then SnapshotBuilder applies those operations to generate the next snapshot and write WSC bytes. After that, I'll
-    add per-worker delta collection and prove the system produces consistent results regardless of worker count through
-    targeted tests.
-    Now let me synthesize all the exploration results into a comprehensive implementation plan.
+```rust
+pub fn compute_commit_hash_v2(
+    state_root: &Hash,
+    parents: &[Hash],
+    patch_digest: &Hash,
+    policy_id: u32,
+) -> Hash
+```
 
-    ***
+The commit hash is:
+`H(version_tag || parents_len || parents || state_root || patch_digest || policy_id)`
 
-    BOAW Implementation Plan
+This commits to the full causal chain: the prior state (parents), the
+resulting state (state_root), and the operations that produced it
+(patch_digest), under a specific policy.
 
-    ★ Insight ─────────────────────────────────────
-    Architecture Context: The codebase already has strong foundations for BOAW:
+### Patch Digest
 
-- GraphStore uses BTreeMaps for deterministic iteration
-- Footprint infrastructure already tracks read/write sets with factor_mask prefiltering
-- RadixScheduler provides O(n) deterministic ordering and O(1) conflict detection via GenSet
-- TickPatch has WarpOp enum for delta operations (now used for execution emissions via TickDelta)
-- WSC is production-ready with zero-copy Pod types, ready for mmap
+Computed from the versioned encoding of merged ops + slots + metadata in the
+`WarpTickPatchV1`. This is separate from `state_root` so that two commits
+can be compared either by "did they reach the same state?" or "did they apply
+the same operations?"
 
-    The key pivot was: move from "mutate GraphStore → diff after" to "emit ops into TickDelta → apply to snapshot" **[COMPLETE - Phase 5]**
-    ─────────────────────────────────────────────────
+---
 
-    ***
+## 8) WSC Build Process
 
-    Phase 1: Test Skeletons (This Commit)
+**Ref:** `src/wsc/build.rs`, `src/wsc/write.rs`, `src/wsc/view.rs`
 
-    Goal: Establish the contract + drill sergeant tests
+### Canonical Ordering
 
-    Create test files from ADR-0007 Section 14:
+The build process in `build_one_warp_input()` enforces strict ordering:
 
-- tests/common/mod.rs - XorShift64 RNG, TestHarness trait, Scenario enum
-- tests/boaw_end_to_end.rs - The "god test" for permutation invariance
-- tests/boaw_determinism.rs - Serial vs parallel equivalence
-- tests/boaw_cow.rs - Unlink semantics, overlay precedence
-- tests/boaw_footprints.rs - Independence checks, bucket enforcement
-- tests/boaw_merge.rs - Collapse/merge determinism
-- tests/boaw_privacy.rs - Mind mode enforcement
+1. **Nodes** — iterated from `GraphStore`'s `BTreeMap`, already sorted by
+   `NodeId`
+2. **Edges (global)** — all edges collected, then sorted by `EdgeId` via
+   `.sort_by_key(|e| e.id)`
+3. **Per-node outbound edges** — for each node (in `NodeId` order), outgoing
+   edges are sorted by `EdgeId` and appended with an index `Range { start, len }`
+4. **Attachments** — node attachments follow node order; edge attachments
+   follow global edge order
 
-    These tests will intentionally panic until we wire the BOAW APIs.
+### Blob Arena Alignment
 
-    ***
+All blob payloads are 8-byte aligned before appending: `(len + 7) & !7`.
+This prepares the blob section for mmap and SIMD consumers. All `Range`,
+`AttRow`, and index fields are stored little-endian.
 
-    Phase 2: Wire TestHarness to Current Engine
+### Zero-Copy Read
 
-    Goal: Tests compile and run against current pipeline
+`WscFile` owns the raw `Vec<u8>`. `WarpView<'a>` holds lifetime-bound
+slices directly into that buffer — no heap allocations at access time:
 
-    Implement TestHarness to:
+```rust
+pub struct WarpView<'a> {
+    pub nodes: &'a [NodeRow],
+    pub edges: &'a [EdgeRow],
+    pub out_index: &'a [Range],
+    pub out_edges: &'a [OutEdgeRef],
+    pub node_atts_index: &'a [Range],
+    pub node_atts: &'a [AttRow],
+    pub edge_atts_index: &'a [Range],
+    pub edge_atts: &'a [AttRow],
+    pub blobs: &'a [u8],
+}
+```
 
-- Build base snapshots from current GraphStore
-- Execute via current engine (both serial and parallel call serial for now)
-- Return real hashes so test runner is alive
+All slice casts use `bytemuck::try_cast_slice()`, which is a safe transmutation
+requiring `T: Pod`. Node/edge lookup is O(log n) via `binary_search_by_key`.
 
-    ***
+### Structural Validation (`src/wsc/validate.rs`)
 
-    Phase 3: TickDelta for Execution (The Real Pivot)
+`validate_wsc()` runs 6 checks per warp instance:
 
-    Goal: Executors emit ops instead of mutating shared state
+1. Index range bounds (all three index tables within data table bounds)
+2. Node ordering (strict ascending by `NodeId`)
+3. Edge ordering (strict ascending by `EdgeId`)
+4. Root node present (binary search; zero root OK when nodes is empty)
+5. Attachment validity (tag, reserved bytes, blob bounds, DESCEND invariants)
+6. Out-edge reference validity (edge index within bounds, safe u64→usize cast)
 
-    Key Changes:
-    1. Create TickDelta struct in src/tick_delta.rs:
-       pub struct TickDelta {
-       pub upsert_nodes: Vec<(NodeId, NodeRecord)>,
-       pub delete_nodes: Vec<NodeId>,
-       pub upsert_edges: Vec<(EdgeId, EdgeRecord)>,
-       pub delete_edges: Vec<EdgeId>,
-       pub set_attachments: Vec<(AttachmentKey, Option<AttachmentValue>)>,
-       }
-    2. Modify ExecuteFn signature to take:
-    - &GraphView (read-only snapshot view) instead of &mut GraphStore
-    - &mut TickDelta (append-only ops collector)
-    3. Implement canonical merge - sort ops by key for deterministic ordering
-    4. Add DeltaView - overlay that resolves reads from (snapshot + delta)
+---
 
-    **Status: COMPLETE** (2026-01-18)
+## 9) Design Decisions
 
-    ***
+Nine implementation-level decisions with rationale.
 
-    Phase 4: SnapshotBuilder
+### 9.1 BTreeMap Everywhere
 
-    Goal: Apply merged TickDelta to produce next WSC snapshot
-    1. SnapshotBuilder takes base snapshot + merged ops
-    2. Produces next reachable-only snapshot tables
-    3. Writes WSC bytes via existing write_wsc_one_warp
-    4. Computes state_root from materialized snapshot
+`GraphStore` uses `BTreeMap` for all collections. This gives deterministic
+iteration order at ~2x lookup cost vs `HashMap`. The trade-off is accepted
+because iteration order affects `canonical_state_hash()`, WSC build ordering,
+and snapshot construction. Using `HashMap` would require a separate sort pass
+at every materialization point.
 
-    **Status: COMPLETE** (2026-01-18) - See `docs/memorials/2026-01-18-phase4-rubicon.md`
+### 9.2 RefCell in MaterializationBus
 
-    ***
+`MaterializationBus` uses `RefCell<BTreeMap<...>>` for pending emissions.
+This is intentionally single-threaded: tick execution on a single warp is
+sequential by design, and `RefCell` makes the borrow rules visible at compile
+time without the overhead of `Mutex`.
 
-    Phase 5: Read-Only Execution
+### 9.3 Factor Mask as u64 Coarse Prefilter
 
-    Goal: Pure execution - executors read from snapshot, write to delta only
-    1. ExecuteFn signature changed: `fn(&GraphView, &mut TickDelta, &NodeId)`
-    2. No GraphStore mutations during execution - emit ops only
-    3. State updated after execution via `apply_to_state()`
-    4. Legacy `&mut GraphStore` path removed from executor signature
+`Footprint::factor_mask` is a 64-bit bloom-like field. One bitwise AND
+(`mask_a & mask_b == 0`) can short-circuit the entire independence check
+before examining per-resource sets. On workloads with many independent
+rewrites touching disjoint partitions, this eliminates >90% of set
+intersection work.
 
-    **Status: COMPLETE** (2026-01-18)
+### 9.4 FxHashMap in PendingTx
 
-    ***
+`PendingTx` uses Rustc's `FxHashMap` (non-deterministic iteration order) for
+deduplication. This is safe because the map is internal to the scheduler and
+all entries are drained through the radix sort before any
+determinism-sensitive operation. The map's iteration order is never observed.
 
-    Phase 6: Parallel Execution with Per-Worker Deltas
+### 9.5 20-Pass LSD Radix Sort
 
-    Goal: Lockless parallelism without compromising determinism
-    1. Per-worker TickDelta - each worker has thread-local delta
-    2. Canonical merge - concatenate then sort by (op_kind, key, tie_breaker)
-    3. Prove worker-count invariance - the "god test" passes for all worker counts
+A 40-byte key requires 20 passes with 16-bit digits (65,536 buckets). This
+is O(n) with zero comparisons, ideal for the scheduling workload where n can
+be large and keys are uniformly distributed (BLAKE3 hashes). The fallback to
+comparison sort below 1,024 items avoids the per-pass overhead for small
+batches.
 
-    ***
+### 9.6 Pod + bytemuck for WSC
 
-    Phase 7+ (Future)
+All WSC row types are `#[repr(C)]` + `Pod` + `Zeroable`. This allows
+zero-copy deserialization via `bytemuck::try_cast_slice()` — a safe
+transmutation that requires no `unsafe` in user code. The constraint is
+that all fields must be plain-old-data (no pointers, no padding with
+uninitialized bytes).
 
-- Segment-level structural sharing (content-addressed chunks)
-- Collapse/merge with typed registry
-- Privacy enforcement gates (mind vs diagnostics mode)
+**Caveat — all-zero keys:** Because IDs are BLAKE3 outputs, an all-zero
+key is astronomically unlikely but theoretically possible. The current
+implementation uses binary search over sorted tables (`O(log n)`) and is
+unaffected. If an on-disk open-addressed hash index is ever added, it
+must not use "all-zeros = empty slot" without an occupancy bitmap.
+
+### 9.7 Separate GraphView Type
+
+`GraphView` is a compile-time read-only projection of `GraphStore`. Executors
+receive `GraphView<'a>` instead of `&GraphStore`, preventing accidental
+writes. When `FootprintGuard` is active, `GraphView::new_guarded()` also
+validates reads against the declared footprint.
 
-    ***
+### 9.8 PoisonedDelta on Panic
 
-Files to Create/Modify
-┌──────────────────────────────────────────┬────────┬───────────────────────────────────┐
-│ Path │ Action │ Purpose │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/tests/boaw/mod.rs │ Create │ Test module organization │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/tests/boaw/common.rs │ Create │ XorShift64, TestHarness, Scenario │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/tests/boaw\_\*.rs │ Create │ 6 test files from ADR │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/src/tick_delta.rs │ Create │ TickDelta struct + merge │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/src/delta_view.rs │ Create │ Read-through overlay │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/src/snapshot_builder.rs │ Create │ Apply delta → next WSC │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/src/lib.rs │ Modify │ Export new modules │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/src/engine_impl.rs │ Modify │ New ExecuteFn signature │
-├──────────────────────────────────────────┼────────┼───────────────────────────────────┤
-│ crates/warp-core/src/rule.rs │ Modify │ Update ExecuteFn type │
-└──────────────────────────────────────────┴────────┴───────────────────────────────────┘
+When a rule panics during parallel execution, `catch_unwind` captures the
+panic payload and wraps it as `PoisonedDelta`. This ensures the panic is
+surfaced as a typed `MergeError::PoisonedDelta` at merge time rather than
+crashing the entire tick. The delta's ops are never applied.
+
+### 9.9 NUM_SHARDS = 256 Frozen Protocol Constant
+
+The shard count is a protocol constant, not a tuning knob. Changing it would
+alter `shard_of()` routing and break determinism for any graph built under the
+old constant. 256 provides a good balance: enough shards for load distribution
+across 8–64 workers, small enough that the shard metadata overhead is trivial.
+
+---
+
+## 10) Test Strategy
+
+### 10.1 Integration Test Categories
+
+warp-core has 50+ integration tests in `crates/warp-core/tests/`. Key
+categories:
+
+| Category           | Representative Files                                               | What They Validate                                                          |
+| ------------------ | ------------------------------------------------------------------ | --------------------------------------------------------------------------- |
+| Determinism        | `boaw_determinism.rs`, `boaw_end_to_end.rs`                        | Snapshot hash invariance under permutations, serial-vs-parallel equivalence |
+| Worker invariance  | `boaw_engine_worker_invariance.rs`                                 | Identical results for 1/2/4/8/16/32 workers                                 |
+| Parallel execution | `boaw_parallel_exec.rs`                                            | Sharded partitioning, canonical merge ordering                              |
+| Footprints         | `boaw_footprints.rs`, `boaw_footprint_warp_scoping.rs`             | Independence symmetry, warp-scoped conflict isolation                       |
+| Merge safety       | `boaw_merge_tripwire.rs`, `boaw_merge_warpopkey.rs`                | Footprint violations caught at merge, cross-warp key isolation              |
+| Portal rules       | `boaw_openportal_rules.rs`                                         | No same-tick writes to newly created warps                                  |
+| Materialization    | `materialization_determinism.rs`, `materialization_spec_police.rs` | Order-independence, permutation invariance, wire stability                  |
+| Snapshot           | `snapshot_reachability_tests.rs`                                   | Unreachable nodes excluded from hash                                        |
+| Slice theorem      | `slice_theorem_proof.rs`                                           | Seven-phase executable proof of parallel correctness                        |
+| Math determinism   | `deterministic_sin_cos_tests.rs`, `nan_exhaustive_tests.rs`        | ULP-budget trig, NaN canonicalization to `0x7fc00000`                       |
+| Playback           | `outputs_playback_tests.rs`, `playback_cursor_tests.rs`            | Cursor seek, corrupt-hash detection                                         |
+
+### 10.2 Testing Patterns
+
+- **Exhaustive permutation:** `materialization_spec_police.rs` uses Heap's
+  algorithm to test all N! orderings (N ≤ 6) and assert byte-identical output
+- **Pinned seeds:** Proptest with deterministic seeds for reproducible CI
+  (`proptest_seed_pinning.rs`)
+- **1-ULP float sensitivity:** `determinism_audit.rs` checks whether f32
+  bit-flips affect canonical hashes
+- **Serial-vs-parallel equivalence:** `boaw_determinism.rs` runs the same
+  workload with 1 worker and N workers, asserts identical `state_root`,
+  `patch_digest`, and `commit_hash`
+- **Worker-count invariance:** `boaw_engine_worker_invariance.rs` iterates
+  over `{1, 2, 4, 8, 16, 32}` workers on independent workloads
+- **Byte-identical assertion:** All hash comparisons use exact `[u8; 32]`
+  equality, not approximate matching
+
+### 10.3 Future Tests (Marked `#[ignore]`)
+
+Several test files contain `#[ignore]` tests for features not yet
+implemented:
+
+- `boaw_cow.rs` — COW overlay semantics (pending overlay implementation)
+- `boaw_merge.rs` — Multi-parent commutative merge (pending collapse/merge)
+- `boaw_privacy.rs` — Mind-mode enforcement (pending privacy implementation)
+
+---
+
+## 11) ADR-0007 Alignment
+
+Mapping from parent ADR sections to concrete implementation modules.
+
+| ADR-0007 Section                   | Implementation                                                          | Status                                                  |
+| ---------------------------------- | ----------------------------------------------------------------------- | ------------------------------------------------------- |
+| §3 Atom & Attachment policy        | `attachment.rs` — `AttachmentPlane`, `AttachmentOwner`, `AttachmentKey` | Partial — typed storage exists, no registry enforcement |
+| §4 WARP snapshots (reachable-only) | `snapshot.rs` — reachable BFS in state-root computation                 | Done                                                    |
+| §4.2 WSC zero-copy IO              | `wsc/` — full read/write/validate/view pipeline                         | Done                                                    |
+| §5 COW mechanics                   | `tick_delta.rs`, `graph_view.rs` — delta-based writes, read-only views  | Partial — no segment-level structural sharing           |
+| §6 Footprints & enforcement        | `footprint.rs`, `footprint_guard.rs` — warp-scoped sets + guard         | Done                                                    |
+| §7 Scheduling (virtual shards)     | `boaw/shard.rs`, `scheduler.rs` — `NUM_SHARDS=256`, radix sort          | Done                                                    |
+| §7.1 Shard routing (frozen)        | `boaw/shard.rs::shard_of()`                                             | Done — frozen protocol constant                         |
+| §8 Tick pipeline                   | `engine_impl.rs`, `scheduler.rs`, `boaw/exec.rs`, `boaw/merge.rs`       | Done                                                    |
+| §8.4 Parallel execute              | `boaw/exec.rs` — `execute_parallel_sharded()`                           | Done (Phase 6B)                                         |
+| §8.5 Merge deltas                  | `boaw/merge.rs` — canonical sort + conflict detection                   | Done                                                    |
+| §8.6 Commit                        | `snapshot.rs` — `compute_commit_hash_v2()`, `compute_state_root()`      | Done                                                    |
+| §9 Collapse/merge                  | —                                                                       | Not started — `boaw_merge.rs` tests are `#[ignore]`     |
+| §10 Privacy (mind/diagnostics)     | —                                                                       | Not started — `boaw_privacy.rs` tests are `#[ignore]`   |
+
+### Not Yet Implemented
+
+- **Collapse/merge with typed registry:** ADR-0007 §9 defines multi-parent
+  merge with typed merge rules (commutative, LWW, ConflictOnly). No merge
+  implementation exists beyond single-tick delta merge.
+- **Privacy enforcement:** ADR-0007 §10 defines mind mode (no secrets in
+  ledger) and diagnostics mode. The `ClaimRecord` type and enforcement gates
+  are not yet implemented.
+- **Segment-level COW:** ADR-0007 §5.5 defines segment-level structural
+  sharing for WSC snapshots. Current implementation rebuilds full snapshots
+  each tick.
+
+---
+
+## 12) Consequences
+
+### Benefits
+
+- **Lockless parallel execution** — workers emit to thread-local deltas;
+  no shared mutable state during execution
+- **Deterministic across platforms** — canonical ordering (radix sort),
+  fixed shard topology (256), explicit LE encoding, BLAKE3 hashing
+- **Zero-copy snapshots** — WSC format with `bytemuck` provides read access
+  without deserialization
+- **Typed conflict handling** — `PoisonedDelta`, `MergeConflict`, and
+  `FootprintViolation` surface errors as structured data, not panics
+- **Comprehensive test coverage** — 50+ integration tests including
+  exhaustive permutation, worker-count invariance, and executable proofs
+
+### Costs
+
+- **BTreeMap overhead** — ~2x lookup cost vs HashMap, accepted for
+  deterministic iteration
+- **Radix sort memory** — 65,536-bucket histogram + scratch buffer per sort
+  pass, amortized across ticks
+- **Full snapshot rebuild** — each tick rebuilds the entire snapshot (no
+  segment-level sharing yet)
+- **Feature-gated enforcement** — `FootprintGuard` is debug-only by default;
+  release enforcement requires opt-in feature flag
+
+### Open Items
+
+- Implement collapse/merge with typed registry (ADR-0007 §9)
+- Implement privacy enforcement / mind mode (ADR-0007 §10)
+- Add segment-level COW for snapshot structural sharing (ADR-0007 §5.5)
+- Migrate `GraphStore` from BTreeMap to immutable snapshot + overlay model
+- Add benchmark suites (snapshot hashing, motion throughput, scheduler drain)
diff --git a/docs/meta/docs-index.md b/docs/meta/docs-index.md
index 53016519..8d29f538 100644
--- a/docs/meta/docs-index.md
+++ b/docs/meta/docs-index.md
@@ -37,7 +37,7 @@ If you want the full inventory, use repo search (`rg`) and follow links outward
 | `architecture/TERMS_WARP_STATE_INSTANCES_PORTALS_WORMHOLES.md` | Canonical terminology: WarpState vs SkeletonGraph, instances/portals, and wormholes (reserved for history compression) |
 | `phase1-plan.md`                                               | Phase 1 implementation roadmap & demo targets                                                                          |
 | `spec-warp-core.md`                                            | WARP core format and runtime                                                                                           |
-| `WARP-GRAPH.md`                                                | WSC (Write-Streaming Columnar) snapshot format design spec                                                             |
+| ~~`WARP-GRAPH.md`~~                                            | **Deleted.** Superseded by `adr/ADR-0007-impl.md` §8 (WSC Build Process) and `crates/warp-core/src/wsc/`.              |
 | `scheduler.md`                                                 | Doc map: warp-core rewrite scheduler vs planned system scheduler                                                       |
 | `scheduler-warp-core.md`                                       | Canonical doc: warp-core rewrite scheduler (`reserve()` / drain)                                                       |
 | `scheduler-performance-warp-core.md`                           | Canonical doc: warp-core scheduler benchmarks                                                                          |
diff --git a/scripts/generate_evidence.cjs b/scripts/generate_evidence.cjs
index 685b7e74..ca03b772 100755
--- a/scripts/generate_evidence.cjs
+++ b/scripts/generate_evidence.cjs
@@ -2,13 +2,58 @@
 const fs = require('fs');
 const path = require('path');
 
+/**
+ * Parse static-inspection.json for DET-001 claim status.
+ * Returns VERIFIED only when the file exists, parses as valid JSON,
+ * contains claim_id "DET-001", and status "PASSED".
+ * All other conditions return UNVERIFIED with an error description.
+ *
+ * @param {string} gatheredArtifactsDir - Path to the gathered artifacts directory.
+ * @returns {{ status: 'VERIFIED'|'UNVERIFIED', source_status: string|null, error?: string }}
+ */
+function checkStaticInspection(gatheredArtifactsDir) {
+  const jsonPath = path.join(gatheredArtifactsDir, 'static-inspection', 'static-inspection.json');
+  let raw;
+  try {
+    raw = fs.readFileSync(jsonPath, 'utf8');
+  } catch (e) {
+    console.error(`DET-001: failed to read static-inspection.json at ${jsonPath}: ${e.message.slice(0, 200)}`);
+    return { status: 'UNVERIFIED', source_status: null, error: `read failed: ${e.message}` };
+  }
+
+  let parsed;
+  try {
+    parsed = JSON.parse(raw);
+  } catch (e) {
+    console.error(`DET-001: invalid JSON in static-inspection.json: ${e.message.slice(0, 200)}`);
+    return { status: 'UNVERIFIED', source_status: null, error: `invalid JSON: ${e.message}` };
+  }
+
+  if (parsed === null || typeof parsed !== 'object' || Array.isArray(parsed) ||
+      parsed.claim_id !== 'DET-001' || typeof parsed.status !== 'string') {
+    const preview = JSON.stringify(parsed).slice(0, 200);
+    console.error(`DET-001: unexpected structure in static-inspection.json: ${preview}`);
+    return { status: 'UNVERIFIED', source_status: null, error: 'missing or unexpected claim_id/status field' };
+  }
+
+  const verified = parsed.status === 'PASSED';
+  if (!verified) {
+    console.error(`DET-001: static inspection reported status "${String(parsed.status).slice(0, 200)}"`);
+  }
+  return { status: verified ? 'VERIFIED' : 'UNVERIFIED', source_status: parsed.status };
+}
+
 /**
  * Generates an evidence JSON pack for CI claims.
  * Maps specific claim IDs to immutable CI artifacts if they exist.
- * 
+ *
  * @param {string} gatheredArtifactsDir - Path to the directory where all artifacts were downloaded.
+ * @returns {void}
  */
 function generateEvidence(gatheredArtifactsDir) {
+  if (typeof gatheredArtifactsDir !== 'string') {
+    throw new TypeError(`gatheredArtifactsDir must be a string, got ${typeof gatheredArtifactsDir}`);
+  }
   const workflow = process.env.GITHUB_WORKFLOW || 'det-gates';
   const runId = process.env.GITHUB_RUN_ID || 'local';
   const commitSha = process.env.GITHUB_SHA || 'local';
@@ -22,11 +67,18 @@ function generateEvidence(gatheredArtifactsDir) {
     }
   };
 
+  const det001 = checkStaticInspection(gatheredArtifactsDir);
   const claims = [
     {
       id: 'DET-001',
-      status: checkArtifact('static-inspection') ? 'VERIFIED' : 'UNVERIFIED',
-      evidence: { workflow, run_id: runId, commit_sha: commitSha, artifact_name: 'static-inspection' }
+      status: det001.status,
+      evidence: {
+        workflow, run_id: runId, commit_sha: commitSha,
+        artifact_name: 'static-inspection',
+        source_file: 'static-inspection.json',
+        source_status: det001.source_status,
+        ...(det001.error ? { error: det001.error } : {})
+      }
     },
     {
       id: 'DET-002',
@@ -90,9 +142,14 @@ function generateEvidence(gatheredArtifactsDir) {
   console.log(`Generated evidence.json at ${outputPath}`);
 }
 
-module.exports = { generateEvidence };
+module.exports = { generateEvidence, checkStaticInspection };
 
 if (require.main === module) {
   const gatheredArtifactsDir = process.argv[2] || '.';
-  generateEvidence(gatheredArtifactsDir);
+  try {
+    generateEvidence(gatheredArtifactsDir);
+  } catch (err) {
+    console.error(err.message);
+    process.exit(1);
+  }
 }