@atrib/recall 0.14.6 → 1.0.0

package/dist/trace-walk.js

@@ -0,0 +1,275 @@
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * Walk informed_by edges backward from the starting record.
+ *
+ * Behaviors:
+ *   - Cycle-safe: every record is visited at most once, even if multiple
+ *     parents reference it.
+ *   - Cap-safe: if maxNodes is hit mid-walk, returns partial result with
+ *     truncated_by_cap=true. Callers can re-run with a smaller depth or
+ *     start from a sub-tree if needed.
+ *   - Dangling-aware: informed_by entries pointing at records not in the
+ *     local mirror surface as `dangling`. Those entries do NOT advance the
+ *     walk (we have nothing to walk from).
+ */
+export function traceBackward(startHash, depth, index, options = {}) {
+    const maxNodes = options.maxNodes ?? 200;
+    const contextId = options.contextId;
+    const warnings = [];
+    const visited = new Map();
+    const dangling = new Set();
+    let truncatedByCap = false;
+    let truncatedByDepth = false;
+    let depthReached = 0;
+    const startIdx = index.get(startHash);
+    if (!startIdx) {
+        return {
+            start_hash: startHash,
+            direction: 'backward',
+            depth_requested: depth,
+            depth_reached: 0,
+            visited: [],
+            dangling: [startHash],
+            truncated_by_depth: false,
+            truncated_by_cap: false,
+            warnings: [`start_hash ${startHash} not in local mirror`],
+        };
+    }
+    // context_id scope check: when the caller pinned a context_id, the start
+    // record itself must already live within it. Reject explicitly rather than
+    // silently returning an empty walk; the caller likely wants to know they
+    // pointed trace at the wrong record for the requested scope.
+    if (contextId && startIdx.record.context_id !== contextId) {
+        return {
+            start_hash: startHash,
+            direction: 'backward',
+            depth_requested: depth,
+            depth_reached: 0,
+            visited: [],
+            dangling: [],
+            truncated_by_depth: false,
+            truncated_by_cap: false,
+            warnings: [
+                `start_hash ${startHash} lives in context_id ${startIdx.record.context_id} but trace was scoped to ${contextId} (set ATRIB_CONTEXT_ID to override or omit context_id to walk cross-context)`,
+            ],
+        };
+    }
+    const frontier = [{ hash: startHash, depth: 0, parent: null }];
+    while (frontier.length > 0) {
+        if (visited.size >= maxNodes) {
+            truncatedByCap = true;
+            break;
+        }
+        const current = frontier.shift();
+        if (current.depth > depth) {
+            truncatedByDepth = true;
+            continue;
+        }
+        depthReached = Math.max(depthReached, current.depth);
+        const idx = index.get(current.hash);
+        if (!idx) {
+            dangling.add(current.hash);
+            // Tag the parent so caller can see which walkable record had a
+            // dangling reference, but we don't visit further.
+            continue;
+        }
+        // context_id scope filter: an upstream record that lives in a different
+        // context_id is treated as dangling from this walk's perspective. The
+        // record itself exists, but it sits outside the requested scope. This
+        // keeps per-arm trace results clean when ATRIB_CONTEXT_ID is set per
+        // D072 (cross-arm informed_by edges, if any leaked, do not pollute
+        // the walk).
+        if (contextId && idx.record.context_id !== contextId) {
+            dangling.add(current.hash);
+            continue;
+        }
+        let v = visited.get(current.hash);
+        if (!v) {
+            const informedByEntries = Array.isArray(idx.record.informed_by)
+                ? idx.record.informed_by
+                : [];
+            v = {
+                depth: current.depth,
+                record_hash: current.hash,
+                parent_hashes: [],
+                record: idx.record,
+                source: idx.source,
+                next_informed_by: informedByEntries,
+            };
+            visited.set(current.hash, v);
+            // Schedule informed_by entries for visit at depth+1.
+            if (current.depth < depth) {
+                for (const upstream of informedByEntries) {
+                    frontier.push({ hash: upstream, depth: current.depth + 1, parent: current.hash });
+                }
+            }
+            else if (informedByEntries.length > 0) {
+                truncatedByDepth = true;
+            }
+        }
+        if (current.parent && !v.parent_hashes.includes(current.parent)) {
+            v.parent_hashes.push(current.parent);
+        }
+    }
+    return {
+        start_hash: startHash,
+        direction: 'backward',
+        depth_requested: depth,
+        depth_reached: depthReached,
+        visited: Array.from(visited.values()),
+        dangling: Array.from(dangling),
+        truncated_by_depth: truncatedByDepth,
+        truncated_by_cap: truncatedByCap,
+        warnings,
+    };
+}
+/**
+ * Build a reverse informed_by index: for each record_hash R, the list of
+ * record_hashes that cite R in their informed_by field. O(total
+ * informed_by entries) build; O(1) lookup per parent during walk.
+ *
+ * Exported so callers (or tests) can pre-build the index when running
+ * multiple traceForward calls against the same mirror.
+ */
+export function buildReverseInformedByIndex(index) {
+    const reverse = new Map();
+    for (const { record, record_hash } of index.values()) {
+        const ib = Array.isArray(record.informed_by) ? record.informed_by : [];
+        for (const upstream of ib) {
+            if (typeof upstream !== 'string')
+                continue;
+            const existing = reverse.get(upstream);
+            if (existing)
+                existing.push(record_hash);
+            else
+                reverse.set(upstream, [record_hash]);
+        }
+    }
+    return reverse;
+}
+/**
+ * Walk informed_by edges FORWARD from the starting record.
+ *
+ * Answers: "what records cited THIS record via informed_by?" — i.e. what
+ * decisions/observations followed from this one in the causal substrate.
+ * The dual of traceBackward. Useful for "I made decision X, what did I do
+ * because of it?" lookups.
+ *
+ * Same behaviors as traceBackward:
+ *   - Cycle-safe via visited-set
+ *   - Cap-safe via maxNodes
+ *   - context_id-scoped (if specified): edges into a different context_id
+ *     are treated as dangling
+ *   - Dangling: walking forward to a record present in the reverse index
+ *     but missing from the mirror surfaces it as dangling (defensive; in
+ *     practice the same mirror that built the reverse index has the
+ *     record itself)
+ */
+export function traceForward(startHash, depth, index, options = {}) {
+    const maxNodes = options.maxNodes ?? 200;
+    const contextId = options.contextId;
+    const warnings = [];
+    const visited = new Map();
+    const dangling = new Set();
+    let truncatedByCap = false;
+    let truncatedByDepth = false;
+    let depthReached = 0;
+    const startIdx = index.get(startHash);
+    if (!startIdx) {
+        return {
+            start_hash: startHash,
+            direction: 'forward',
+            depth_requested: depth,
+            depth_reached: 0,
+            visited: [],
+            dangling: [startHash],
+            truncated_by_depth: false,
+            truncated_by_cap: false,
+            warnings: [`start_hash ${startHash} not in local mirror`],
+        };
+    }
+    if (contextId && startIdx.record.context_id !== contextId) {
+        return {
+            start_hash: startHash,
+            direction: 'forward',
+            depth_requested: depth,
+            depth_reached: 0,
+            visited: [],
+            dangling: [],
+            truncated_by_depth: false,
+            truncated_by_cap: false,
+            warnings: [
+                `start_hash ${startHash} lives in context_id ${startIdx.record.context_id} but trace was scoped to ${contextId} (set ATRIB_CONTEXT_ID to override or omit context_id to walk cross-context)`,
+            ],
+        };
+    }
+    // Build the reverse index once per call. For Layer 1 corpus sizes
+    // (~14K records) the O(N) build is negligible; the saved per-hop O(1)
+    // child lookup is worth the linear scan.
+    const reverse = buildReverseInformedByIndex(index);
+    const frontier = [{ hash: startHash, depth: 0, parent: null }];
+    while (frontier.length > 0) {
+        if (visited.size >= maxNodes) {
+            truncatedByCap = true;
+            break;
+        }
+        const current = frontier.shift();
+        if (current.depth > depth) {
+            truncatedByDepth = true;
+            continue;
+        }
+        depthReached = Math.max(depthReached, current.depth);
+        const idx = index.get(current.hash);
+        if (!idx) {
+            // The reverse index pointed at a record not present in the mirror.
+            // Defensive case (the reverse index was built FROM the same mirror,
+            // so this branch is unreachable in practice). Treat as dangling.
+            dangling.add(current.hash);
+            continue;
+        }
+        if (contextId && idx.record.context_id !== contextId) {
+            dangling.add(current.hash);
+            continue;
+        }
+        let v = visited.get(current.hash);
+        if (!v) {
+            const children = reverse.get(current.hash) ?? [];
+            v = {
+                depth: current.depth,
+                record_hash: current.hash,
+                parent_hashes: [],
+                record: idx.record,
+                source: idx.source,
+                // `next_informed_by` reused here as "edges out of this node in
+                // the walk direction" — for forward walk that's the children
+                // (records citing this one), not this record's own informed_by.
+                // Field name kept for shape-compat with traceBackward.
+                next_informed_by: children,
+            };
+            visited.set(current.hash, v);
+            if (current.depth < depth) {
+                for (const child of children) {
+                    frontier.push({ hash: child, depth: current.depth + 1, parent: current.hash });
+                }
+            }
+            else if (children.length > 0) {
+                truncatedByDepth = true;
+            }
+        }
+        if (current.parent && !v.parent_hashes.includes(current.parent)) {
+            v.parent_hashes.push(current.parent);
+        }
+    }
+    return {
+        start_hash: startHash,
+        direction: 'forward',
+        depth_requested: depth,
+        depth_reached: depthReached,
+        visited: Array.from(visited.values()),
+        dangling: Array.from(dangling),
+        truncated_by_depth: truncatedByDepth,
+        truncated_by_cap: truncatedByCap,
+        warnings,
+    };
+}
+//# sourceMappingURL=trace-walk.js.map

package/dist/trace-walk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trace-walk.js","sourceRoot":"","sources":["../src/trace-walk.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAwEtC;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,aAAa,CAC3B,SAAiB,EACjB,KAAa,EACb,KAAiC,EACjC,UAAwB,EAAE;IAE1B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAA;IACxC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAA;IACnC,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAA;IAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,IAAI,cAAc,GAAG,KAAK,CAAA;IAC1B,IAAI,gBAAgB,GAAG,KAAK,CAAA;IAC5B,IAAI,YAAY,GAAG,CAAC,CAAA;IAEpB,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IACrC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO;YACL,UAAU,EAAE,SAAS;YACrB,SAAS,EAAE,UAAU;YACrB,eAAe,EAAE,KAAK;YACtB,aAAa,EAAE,CAAC;YAChB,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,CAAC,SAAS,CAAC;YACrB,kBAAkB,EAAE,KAAK;YACzB,gBAAgB,EAAE,KAAK;YACvB,QAAQ,EAAE,CAAC,cAAc,SAAS,sBAAsB,CAAC;SAC1D,CAAA;IACH,CAAC;IAED,yEAAyE;IACzE,2EAA2E;IAC3E,yEAAyE;IACzE,6DAA6D;IAC7D,IAAI,SAAS,IAAI,QAAQ,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;QAC1D,OAAO;YACL,UAAU,EAAE,SAAS;YACrB,SAAS,EAAE,UAAU;YACrB,eAAe,EAAE,KAAK;YACtB,aAAa,EAAE,CAAC;YAChB,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,EAAE;YACZ,kBAAkB,EAAE,KAAK;YACzB,gBAAgB,EAAE,KAAK;YACvB,QAAQ,EAAE;gBACR,cAAc,SAAS,wBAAwB,QAAQ,CAAC,MAAM,CAAC,UAAU,4BAA4B,SAAS,8EAA8E;aAC7L;SACF,CAAA;IACH,CAAC;IAID,MAAM,QAAQ,GAAe,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAA;IAE1E,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,cAAc,GAAG,IAAI,CAAA;YACrB,MAAK;QACP,CAAC;QACD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAG,CAAA;QACjC,IAAI,OAAO,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YAC1B,gBAAgB,GAAG,IAAI,CAAA;YACvB,SAAQ;QACV,CAAC;QACD,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;QAEpD,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACnC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC1B,+DAA+D;YAC/D,kDAAkD;YAClD,SAAQ;QACV,CAAC;QAED,wEAAwE;QACxE,sEAAsE;QACtE,sEAAsE;QACtE,qEAAqE;QACrE,mEAAmE;QACnE,aAAa;QACb,IAAI,SAAS,IAAI,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACrD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC1B,SAAQ;QACV,CAAC;QAED,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,iBAAiB,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC;gBAC7D,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW;gBACxB,CAAC,CAAC,EAAE,CAAA;YACN,CAAC,GAAG;gBACF,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,WAAW,EAAE,OAAO,CAAC,IAAI;gBACzB,aAAa,EAAE,EAAE;gBACjB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,gBAAgB,EAAE,iBAAiB;aACpC,CAAA;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YAE5B,qDAAqD;YACrD,IAAI,OAAO,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;gBAC1B,KAAK,MAAM,QAAQ,IAAI,iBAAiB,EAAE,CAAC;oBACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;gBACnF,CAAC;YACH,CAAC;iBAAM,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxC,gBAAgB,GAAG,IAAI,CAAA;YACzB,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAChE,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED,OAAO;QACL,UAAU,EAAE,SAAS;QACrB,SAAS,EAAE,UAAU;QACrB,eAAe,EAAE,KAAK;QACtB,aAAa,EAAE,YAAY;QAC3B,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACrC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;QAC9B,kBAAkB,EAAE,gBAAgB;QACpC,gBAAgB,EAAE,cAAc;QAChC,QAAQ;KACT,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAiC;IAEjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC3C,KAAK,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACrD,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAA;QACtE,KAAK,MAAM,QAAQ,IAAI,EAAE,EAAE,CAAC;YAC1B,IAAI,OAAO,QAAQ,KAAK,QAAQ;gBAAE,SAAQ;YAC1C,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACtC,IAAI,QAAQ;gBAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAA;;gBACnC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,WAAW,CAAC,CAAC,CAAA;QAC3C,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,YAAY,CAC1B,SAAiB,EACjB,KAAa,EACb,KAAiC,EACjC,UAAwB,EAAE;IAE1B,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAA;IACxC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAA;IACnC,MAAM,QAAQ,GAAa,EAAE,CAAA;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAA;IAC/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,IAAI,cAAc,GAAG,KAAK,CAAA;IAC1B,IAAI,gBAAgB,GAAG,KAAK,CAAA;IAC5B,IAAI,YAAY,GAAG,CAAC,CAAA;IAEpB,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IACrC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO;YACL,UAAU,EAAE,SAAS;YACrB,SAAS,EAAE,SAAS;YACpB,eAAe,EAAE,KAAK;YACtB,aAAa,EAAE,CAAC;YAChB,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,CAAC,SAAS,CAAC;YACrB,kBAAkB,EAAE,KAAK;YACzB,gBAAgB,EAAE,KAAK;YACvB,QAAQ,EAAE,CAAC,cAAc,SAAS,sBAAsB,CAAC;SAC1D,CAAA;IACH,CAAC;IAED,IAAI,SAAS,IAAI,QAAQ,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;QAC1D,OAAO;YACL,UAAU,EAAE,SAAS;YACrB,SAAS,EAAE,SAAS;YACpB,eAAe,EAAE,KAAK;YACtB,aAAa,EAAE,CAAC;YAChB,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,EAAE;YACZ,kBAAkB,EAAE,KAAK;YACzB,gBAAgB,EAAE,KAAK;YACvB,QAAQ,EAAE;gBACR,cAAc,SAAS,wBAAwB,QAAQ,CAAC,MAAM,CAAC,UAAU,4BAA4B,SAAS,8EAA8E;aAC7L;SACF,CAAA;IACH,CAAC;IAED,kEAAkE;IAClE,sEAAsE;IACtE,yCAAyC;IACzC,MAAM,OAAO,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAA;IAIlD,MAAM,QAAQ,GAAe,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAA;IAE1E,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,cAAc,GAAG,IAAI,CAAA;YACrB,MAAK;QACP,CAAC;QACD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAG,CAAA;QACjC,IAAI,OAAO,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YAC1B,gBAAgB,GAAG,IAAI,CAAA;YACvB,SAAQ;QACV,CAAC;QACD,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;QAEpD,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACnC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,mEAAmE;YACnE,oEAAoE;YACpE,iEAAiE;YACjE,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC1B,SAAQ;QACV,CAAC;QAED,IAAI,SAAS,IAAI,GAAG,CAAC,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACrD,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC1B,SAAQ;QACV,CAAC;QAED,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAA;YAChD,CAAC,GAAG;gBACF,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,WAAW,EAAE,OAAO,CAAC,IAAI;gBACzB,aAAa,EAAE,EAAE;gBACjB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,+DAA+D;gBAC/D,6DAA6D;gBAC7D,gEAAgE;gBAChE,uDAAuD;gBACvD,gBAAgB,EAAE,QAAQ;aAC3B,CAAA;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YAE5B,IAAI,OAAO,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;gBAC1B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;oBAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;gBAChF,CAAC;YACH,CAAC;iBAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,gBAAgB,GAAG,IAAI,CAAA;YACzB,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAChE,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED,OAAO;QACL,UAAU,EAAE,SAAS;QACrB,SAAS,EAAE,SAAS;QACpB,eAAe,EAAE,KAAK;QACtB,aAAa,EAAE,YAAY;QAC3B,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;QACrC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;QAC9B,kBAAkB,EAAE,gBAAgB;QACpC,gBAAgB,EAAE,cAAc;QAChC,QAAQ;KACT,CAAA;AACH,CAAC"}

package/dist/verification.d.ts

@@ -0,0 +1,108 @@
+/**
+ * The legacy `atrib-verify` tool and the `recall` verb's `verification`
+ * parameter: verify counterparty handoff evidence before the receiving
+ * agent signs a follow-up that cites it through informed_by. The surface
+ * is deliberately thin. @atrib/verify owns the actual cryptographic
+ * checks, packet extraction, and rejection reasons.
+ *
+ * Moved here from @atrib/verify-mcp per the attest/recall rename;
+ * @atrib/verify-mcp re-exports this module so existing imports keep
+ * working.
+ *
+ * Dependency posture: @atrib/verify is an OPTIONAL PEER of @atrib/recall,
+ * loaded lazily on first use. Its module closure transitively reaches the
+ * D090/D091 JOSE/SD-JWT evidence stack, which most reads never need;
+ * pulling it into every recall install would contradict the primitive's
+ * narrow framing. When the peer is unresolvable, the read itself still
+ * succeeds and verification degrades to a typed `verifier_unavailable`
+ * result per the §5.8 degradation contract. The daemon / primitives
+ * runtime and the @atrib/verify-mcp shim always bundle the verifier, so
+ * their behavior is unchanged.
+ */
+import { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import { z } from 'zod';
+import type { HandoffClaimVerification } from '@atrib/verify';
+type VerifyModule = typeof import('@atrib/verify');
+/**
+ * Resolve the optional @atrib/verify peer once per process. Unresolvable
+ * peers log one `atrib:`-prefixed diagnostic and degrade; they never throw
+ * into a read path.
+ */
+export declare function loadVerifyModule(): Promise<VerifyModule | null>;
+/** Test hook: reset the memoized peer resolution. */
+export declare function __resetVerifyModuleForTests(loader?: () => Promise<VerifyModule | null>): void;
+export declare const VerifyInput: z.ZodObject<{
+    packet: z.ZodOptional<z.ZodUnknown>;
+    records: z.ZodOptional<z.ZodArray<z.ZodUnknown>>;
+    claims: z.ZodOptional<z.ZodArray<z.ZodUnknown>>;
+    required_record_hashes: z.ZodOptional<z.ZodArray<z.ZodString>>;
+    trusted_creator_keys: z.ZodOptional<z.ZodArray<z.ZodString>>;
+    allowed_context_ids: z.ZodOptional<z.ZodArray<z.ZodString>>;
+    require_body: z.ZodOptional<z.ZodBoolean>;
+    require_body_commitment: z.ZodOptional<z.ZodBoolean>;
+    require_log_inclusion: z.ZodOptional<z.ZodBoolean>;
+    log_public_key_b64: z.ZodOptional<z.ZodString>;
+    now_ms: z.ZodOptional<z.ZodNumber>;
+    max_age_ms: z.ZodOptional<z.ZodNumber>;
+}, z.core.$strip>;
+export type AtribVerifyInput = z.infer<typeof VerifyInput>;
+export interface AtribVerifyServer {
+    mcp: McpServer;
+}
+export interface AtribVerifyOutput {
+    primitive: 'atrib-verify';
+    all_accepted: boolean;
+    accepted_record_hashes: string[];
+    accepted: CompactHandoffClaim[];
+    rejected: CompactHandoffClaim[];
+}
+/**
+ * The `verification` block attached to `recall` verb responses. Degraded
+ * verification never blocks a read: when the optional @atrib/verify peer
+ * is unresolvable the block carries status verifier_unavailable and the
+ * read result is unchanged.
+ */
+export type RecallVerificationBlock = {
+    status: 'ok';
+    result: AtribVerifyOutput;
+} | {
+    status: 'verifier_unavailable';
+    reason: string;
+};
+interface CompactHandoffClaim {
+    record_hash: string;
+    accepted: boolean;
+    rejection_reasons: string[];
+    warnings: string[];
+    signature_ok: boolean | null;
+    computed_record_hash: string | null;
+    signer_trusted: boolean | null;
+    context_allowed: boolean | null;
+    record_context_id?: string;
+    record_creator_key?: string;
+    record_timestamp?: number;
+    body?: HandoffClaimVerification['body'];
+    proof?: HandoffClaimVerification['proof'];
+}
+/**
+ * Run the Pattern 3 handoff-claim acceptance checks. Throws when the
+ * optional @atrib/verify peer is unresolvable (the @atrib/verify-mcp shim
+ * and the daemon topology always bundle it, so their behavior is
+ * unchanged); callers that must not fail use tryHandleAtribVerify.
+ */
+export declare function handleAtribVerify(input: AtribVerifyInput): Promise<AtribVerifyOutput>;
+/**
+ * Degradation-safe wrapper for the `recall` verb's `verification`
+ * parameter: unresolvable peer -> typed verifier_unavailable block, never
+ * a thrown error into the read path.
+ */
+export declare function tryHandleAtribVerify(input: AtribVerifyInput): Promise<RecallVerificationBlock>;
+/** Register the legacy `atrib-verify` tool on a server. */
+export declare function registerVerifyTool(mcp: McpServer): void;
+/**
+ * Wire up the legacy atrib-verify MCP server. Mounts `atrib-verify` plus
+ * the `recall` verb (alias-window rule W1). The @atrib/verify-mcp package
+ * re-exports this factory.
+ */
+export declare function createAtribVerifyServer(): Promise<AtribVerifyServer>;
+export {};

package/dist/verification.js

@@ -0,0 +1,223 @@
+// SPDX-License-Identifier: Apache-2.0
+/**
+ * The legacy `atrib-verify` tool and the `recall` verb's `verification`
+ * parameter: verify counterparty handoff evidence before the receiving
+ * agent signs a follow-up that cites it through informed_by. The surface
+ * is deliberately thin. @atrib/verify owns the actual cryptographic
+ * checks, packet extraction, and rejection reasons.
+ *
+ * Moved here from @atrib/verify-mcp per the attest/recall rename;
+ * @atrib/verify-mcp re-exports this module so existing imports keep
+ * working.
+ *
+ * Dependency posture: @atrib/verify is an OPTIONAL PEER of @atrib/recall,
+ * loaded lazily on first use. Its module closure transitively reaches the
+ * D090/D091 JOSE/SD-JWT evidence stack, which most reads never need;
+ * pulling it into every recall install would contradict the primitive's
+ * narrow framing. When the peer is unresolvable, the read itself still
+ * succeeds and verification degrades to a typed `verifier_unavailable`
+ * result per the §5.8 degradation contract. The daemon / primitives
+ * runtime and the @atrib/verify-mcp shim always bundle the verifier, so
+ * their behavior is unchanged.
+ */
+import { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import { z } from 'zod';
+import { extractRecordHashesFromMcpResult, logReadPrimitiveCall, SHA256_REF_PATTERN, } from '@atrib/mcp';
+const HEX_32_PATTERN = /^[0-9a-f]{32}$/;
+let verifyModulePromise = null;
+/**
+ * Resolve the optional @atrib/verify peer once per process. Unresolvable
+ * peers log one `atrib:`-prefixed diagnostic and degrade; they never throw
+ * into a read path.
+ */
+export function loadVerifyModule() {
+    verifyModulePromise ??= import('@atrib/verify').then((mod) => mod, (error) => {
+        try {
+            console.error('atrib: optional peer @atrib/verify is not installed; verification degrades to verifier_unavailable', error instanceof Error ? error.message : String(error));
+        }
+        catch {
+            // Diagnostics must never affect the read path.
+        }
+        return null;
+    });
+    return verifyModulePromise;
+}
+/** Test hook: reset the memoized peer resolution. */
+export function __resetVerifyModuleForTests(loader) {
+    verifyModulePromise = loader ? loader() : null;
+}
+export const VerifyInput = z.object({
+    packet: z
+        .unknown()
+        .optional()
+        .describe('Private continuation or handoff packet carrying records, proof bundles, local mirror sidecars, and optional trust policy.'),
+    records: z
+        .array(z.unknown())
+        .optional()
+        .describe('Evidence entries, usually parsed D062 local mirror envelopes or packet records. Used when packet is omitted.'),
+    claims: z
+        .array(z.unknown())
+        .optional()
+        .describe('Alias for records. Each entry can be a bare AtribRecord or an envelope with record, proof, and _local sidecar.'),
+    required_record_hashes: z
+        .array(z.string().regex(SHA256_REF_PATTERN))
+        .optional()
+        .describe('Record hashes the receiving agent expected. Missing entries are preserved as verifier rejections.'),
+    trusted_creator_keys: z
+        .array(z.string().min(1))
+        .optional()
+        .describe('Allowed creator_key values for upstream records. When set, records from other signers are rejected.'),
+    allowed_context_ids: z
+        .array(z.string().regex(HEX_32_PATTERN))
+        .optional()
+        .describe('Allowed upstream context_id values. When set, records from other contexts are rejected.'),
+    require_body: z
+        .boolean()
+        .optional()
+        .describe('Require private body material from body, args/result, or D062 _local content.'),
+    require_body_commitment: z
+        .boolean()
+        .optional()
+        .describe('Require args_hash or result_hash on the signed record so private body material can be checked.'),
+    require_log_inclusion: z
+        .boolean()
+        .optional()
+        .describe('Require a supplied proof bundle whose inclusion path verifies against the checkpoint root.'),
+    log_public_key_b64: z
+        .string()
+        .optional()
+        .describe('Optional trusted log Ed25519 public key, base64 or base64url encoded. When supplied, checkpoint signatures are verified.'),
+    now_ms: z
+        .number()
+        .optional()
+        .describe('Verifier wall-clock override in milliseconds. Mostly for deterministic tests.'),
+    max_age_ms: z
+        .number()
+        .optional()
+        .describe('Freshness window. Records older than this, or dated in the future, are rejected as stale.'),
+});
+function decodeLogPublicKey(value) {
+    if (!value)
+        return undefined;
+    const normalized = value.replace(/-/g, '+').replace(/_/g, '/');
+    const padded = normalized.padEnd(Math.ceil(normalized.length / 4) * 4, '=');
+    const decoded = new Uint8Array(Buffer.from(padded, 'base64'));
+    if (decoded.length !== 32) {
+        throw new Error(`log_public_key_b64 must decode to 32 bytes, got ${decoded.length}`);
+    }
+    return decoded;
+}
+function packetFromInput(input) {
+    if (input.packet !== undefined)
+        return input.packet;
+    return {
+        records: (input.records ?? input.claims ?? []),
+        required_record_hashes: input.required_record_hashes,
+        trusted_creator_keys: input.trusted_creator_keys,
+        allowed_context_ids: input.allowed_context_ids,
+        max_age_ms: input.max_age_ms,
+    };
+}
+function compactClaim(claim) {
+    const out = {
+        record_hash: claim.record_hash,
+        accepted: claim.accepted,
+        rejection_reasons: claim.rejection_reasons,
+        warnings: claim.warnings,
+        signature_ok: claim.signature_ok,
+        computed_record_hash: claim.computed_record_hash,
+        signer_trusted: claim.signer_trusted,
+        context_allowed: claim.context_allowed,
+    };
+    if (claim.record) {
+        out.record_context_id = claim.record.context_id;
+        out.record_creator_key = claim.record.creator_key;
+        out.record_timestamp = claim.record.timestamp;
+    }
+    if (claim.body)
+        out.body = claim.body;
+    if (claim.proof)
+        out.proof = claim.proof;
+    return out;
+}
+function compactResult(result) {
+    return {
+        primitive: 'atrib-verify',
+        all_accepted: result.all_accepted,
+        accepted_record_hashes: result.accepted_record_hashes,
+        accepted: result.accepted.map(compactClaim),
+        rejected: result.rejected.map(compactClaim),
+    };
+}
+/**
+ * Run the Pattern 3 handoff-claim acceptance checks. Throws when the
+ * optional @atrib/verify peer is unresolvable (the @atrib/verify-mcp shim
+ * and the daemon topology always bundle it, so their behavior is
+ * unchanged); callers that must not fail use tryHandleAtribVerify.
+ */
+export async function handleAtribVerify(input) {
+    const verify = await loadVerifyModule();
+    if (!verify) {
+        throw new Error('atrib: @atrib/verify is not installed; install it (optional peer of @atrib/recall) to run handoff verification');
+    }
+    const packet = packetFromInput(input);
+    const claims = verify.handoffClaimsFromEvidencePacket(packet, {
+        required_record_hashes: input.required_record_hashes,
+        trusted_creator_keys: input.trusted_creator_keys,
+        allowed_context_ids: input.allowed_context_ids,
+        max_age_ms: input.max_age_ms,
+    });
+    const result = await verify.verifyHandoffClaims(claims, {
+        trusted_creator_keys: input.trusted_creator_keys,
+        allowed_context_ids: input.allowed_context_ids,
+        require_body: input.require_body === true,
+        require_body_commitment: input.require_body_commitment === true,
+        require_log_inclusion: input.require_log_inclusion === true,
+        log_public_key: decodeLogPublicKey(input.log_public_key_b64),
+        now_ms: input.now_ms,
+        max_age_ms: input.max_age_ms,
+    });
+    return compactResult(result);
+}
+/**
+ * Degradation-safe wrapper for the `recall` verb's `verification`
+ * parameter: unresolvable peer -> typed verifier_unavailable block, never
+ * a thrown error into the read path.
+ */
+export async function tryHandleAtribVerify(input) {
+    const verify = await loadVerifyModule();
+    if (!verify) {
+        return {
+            status: 'verifier_unavailable',
+            reason: '@atrib/verify (optional peer of @atrib/recall) is not installed; the read result is unaffected',
+        };
+    }
+    return { status: 'ok', result: await handleAtribVerify(input) };
+}
+/** Register the legacy `atrib-verify` tool on a server. */
+export function registerVerifyTool(mcp) {
+    mcp.registerTool('atrib-verify', {
+        description: 'Verify counterparty handoff evidence before linking follow-up work through informed_by. ' +
+            "Legacy alias: new callers should prefer the `recall` tool's `verification` parameter.",
+        inputSchema: VerifyInput.shape,
+    }, async (rawInput) => logReadPrimitiveCall('atrib-verify', rawInput, async () => {
+        const input = VerifyInput.parse(rawInput);
+        const result = await handleAtribVerify(input);
+        return {
+            content: [{ type: 'text', text: JSON.stringify(result, null, 2) }],
+        };
+    }, extractRecordHashesFromMcpResult));
+}
+/**
+ * Wire up the legacy atrib-verify MCP server. Mounts `atrib-verify` plus
+ * the `recall` verb (alias-window rule W1). The @atrib/verify-mcp package
+ * re-exports this factory.
+ */
+export async function createAtribVerifyServer() {
+    const mcp = new McpServer({ name: 'atrib-verify', version: '0.1.0' });
+    registerVerifyTool(mcp);
+    const { registerRecallVerbTool } = await import('./recall-verb.js');
+    registerRecallVerbTool(mcp);
+    return { mcp };
+}
+//# sourceMappingURL=verification.js.map

package/dist/verification.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verification.js","sourceRoot":"","sources":["../src/verification.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAA;AACnE,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAA;AACvB,OAAO,EACL,gCAAgC,EAChC,oBAAoB,EACpB,kBAAkB,GACnB,MAAM,YAAY,CAAA;AAQnB,MAAM,cAAc,GAAG,gBAAgB,CAAA;AAIvC,IAAI,mBAAmB,GAAwC,IAAI,CAAA;AAEnE;;;;GAIG;AACH,MAAM,UAAU,gBAAgB;IAC9B,mBAAmB,KAAK,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAClD,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EACZ,CAAC,KAAc,EAAE,EAAE;QACjB,IAAI,CAAC;YACH,OAAO,CAAC,KAAK,CACX,oGAAoG,EACpG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CACvD,CAAA;QACH,CAAC;QAAC,MAAM,CAAC;YACP,+CAA+C;QACjD,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC,CACF,CAAA;IACD,OAAO,mBAAmB,CAAA;AAC5B,CAAC;AAED,qDAAqD;AACrD,MAAM,UAAU,2BAA2B,CAAC,MAA2C;IACrF,mBAAmB,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAA;AAChD,CAAC;AAED,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC;IAClC,MAAM,EAAE,CAAC;SACN,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CACP,2HAA2H,CAC5H;IACH,OAAO,EAAE,CAAC;SACP,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;SAClB,QAAQ,EAAE;SACV,QAAQ,CACP,8GAA8G,CAC/G;IACH,MAAM,EAAE,CAAC;SACN,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;SAClB,QAAQ,EAAE;SACV,QAAQ,CACP,gHAAgH,CACjH;IACH,sBAAsB,EAAE,CAAC;SACtB,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;SAC3C,QAAQ,EAAE;SACV,QAAQ,CACP,mGAAmG,CACpG;IACH,oBAAoB,EAAE,CAAC;SACpB,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACxB,QAAQ,EAAE;SACV,QAAQ,CACP,qGAAqG,CACtG;IACH,mBAAmB,EAAE,CAAC;SACnB,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;SACvC,QAAQ,EAAE;SACV,QAAQ,CACP,yFAAyF,CAC1F;IACH,YAAY,EAAE,CAAC;SACZ,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CAAC,+EAA+E,CAAC;IAC5F,uBAAuB,EAAE,CAAC;SACvB,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CACP,gGAAgG,CACjG;IACH,qBAAqB,EAAE,CAAC;SACrB,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,QAAQ,CACP,4FAA4F,CAC7F;IACH,kBAAkB,EAAE,CAAC;SAClB,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,0HAA0H,CAC3H;IACH,MAAM,EAAE,CAAC;SACN,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CAAC,+EAA+E,CAAC;IAC5F,UAAU,EAAE,CAAC;SACV,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,2FAA2F,CAC5F;CACJ,CAAC,CAAA;AA0CF,SAAS,kBAAkB,CAAC,KAAyB;IACnD,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAA;IAC5B,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IAC9D,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;IAC3E,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAA;IAC7D,IAAI,OAAO,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,mDAAmD,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;IACtF,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,SAAS,eAAe,CAAC,KAAuB;IAC9C,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,MAA+B,CAAA;IAC5E,OAAO;QACL,OAAO,EAAE,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE,CAA2B;QACxE,sBAAsB,EAAE,KAAK,CAAC,sBAAsB;QACpD,oBAAoB,EAAE,KAAK,CAAC,oBAAoB;QAChD,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;QAC9C,UAAU,EAAE,KAAK,CAAC,UAAU;KAC7B,CAAA;AACH,CAAC;AAED,SAAS,YAAY,CAAC,KAA+B;IACnD,MAAM,GAAG,GAAwB;QAC/B,WAAW,EAAE,KAAK,CAAC,WAAW;QAC9B,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,iBAAiB,EAAE,KAAK,CAAC,iBAAiB;QAC1C,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,YAAY,EAAE,KAAK,CAAC,YAAY;QAChC,oBAAoB,EAAE,KAAK,CAAC,oBAAoB;QAChD,cAAc,EAAE,KAAK,CAAC,cAAc;QACpC,eAAe,EAAE,KAAK,CAAC,eAAe;KACvC,CAAA;IACD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjB,GAAG,CAAC,iBAAiB,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAA;QAC/C,GAAG,CAAC,kBAAkB,GAAG,KAAK,CAAC,MAAM,CAAC,WAAW,CAAA;QACjD,GAAG,CAAC,gBAAgB,GAAG,KAAK,CAAC,MAAM,CAAC,SAAS,CAAA;IAC/C,CAAC;IACD,IAAI,KAAK,CAAC,IAAI;QAAE,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAA;IACrC,IAAI,KAAK,CAAC,KAAK;QAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACxC,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,aAAa,CAAC,MAAiC;IACtD,OAAO;QACL,SAAS,EAAE,cAAc;QACzB,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,sBAAsB,EAAE,MAAM,CAAC,sBAAsB;QACrD,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC;QAC3C,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC;KAC5C,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,KAAuB;IAC7D,MAAM,MAAM,GAAG,MAAM,gBAAgB,EAAE,CAAA;IACvC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CACb,gHAAgH,CACjH,CAAA;IACH,CAAC;IACD,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IACrC,MAAM,MAAM,GAAG,MAAM,CAAC,+BAA+B,CAAC,MAAM,EAAE;QAC5D,sBAAsB,EAAE,KAAK,CAAC,sBAAsB;QACpD,oBAAoB,EAAE,KAAK,CAAC,oBAAoB;QAChD,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;QAC9C,UAAU,EAAE,KAAK,CAAC,UAAU;KAC7B,CAAC,CAAA;IACF,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,mBAAmB,CAAC,MAAM,EAAE;QACtD,oBAAoB,EAAE,KAAK,CAAC,oBAAoB;QAChD,mBAAmB,EAAE,KAAK,CAAC,mBAAmB;QAC9C,YAAY,EAAE,KAAK,CAAC,YAAY,KAAK,IAAI;QACzC,uBAAuB,EAAE,KAAK,CAAC,uBAAuB,KAAK,IAAI;QAC/D,qBAAqB,EAAE,KAAK,CAAC,qBAAqB,KAAK,IAAI;QAC3D,cAAc,EAAE,kBAAkB,CAAC,KAAK,CAAC,kBAAkB,CAAC;QAC5D,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,UAAU,EAAE,KAAK,CAAC,UAAU;KAC7B,CAAC,CAAA;IACF,OAAO,aAAa,CAAC,MAAM,CAAC,CAAA;AAC9B,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,KAAuB;IAEvB,MAAM,MAAM,GAAG,MAAM,gBAAgB,EAAE,CAAA;IACvC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO;YACL,MAAM,EAAE,sBAAsB;YAC9B,MAAM,EACJ,gGAAgG;SACnG,CAAA;IACH,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAA;AACjE,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,kBAAkB,CAAC,GAAc;IAC/C,GAAG,CAAC,YAAY,CACd,cAAc,EACd;QACE,WAAW,EACT,0FAA0F;YAC1F,uFAAuF;QACzF,WAAW,EAAE,WAAW,CAAC,KAAK;KAC/B,EACD,KAAK,EAAE,QAAQ,EAAE,EAAE,CACjB,oBAAoB,CAClB,cAAc,EACd,QAAQ,EACR,KAAK,IAAI,EAAE;QACT,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QACzC,MAAM,MAAM,GAAG,MAAM,iBAAiB,CAAC,KAAK,CAAC,CAAA;QAC7C,OAAO;YACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;SACnE,CAAA;IACH,CAAC,EACD,gCAAgC,CACjC,CACJ,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB;IAC3C,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;IACrE,kBAAkB,CAAC,GAAG,CAAC,CAAA;IACvB,MAAM,EAAE,sBAAsB,EAAE,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAA;IACnE,sBAAsB,CAAC,GAAG,CAAC,CAAA;IAC3B,OAAO,EAAE,GAAG,EAAE,CAAA;AAChB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atrib/recall",
-  "version": "0.14.6",
+  "version": "1.0.0",
   "description": "MCP server for atrib's verifiable action layer. Lets agents query their own provable past from the local mirror.",
   "author": "atrib <hello@atrib.dev>",
   "keywords": [
@@ -24,12 +24,16 @@
   "dependencies": {
     "@modelcontextprotocol/sdk": "^1.12.1",
     "zod": "^4.3.6",
-    "@atrib/mcp": "0.20.0"
+    "@atrib/mcp": "0.21.0"
   },
   "devDependencies": {
+    "@noble/ed25519": "^3.1.0",
+    "@noble/hashes": "^2.2.0",
     "@types/node": "^25.9.3",
+    "canonicalize": "^3.0.0",
     "typescript": "^6.0.3",
-    "vitest": "^4.1.8"
+    "vitest": "^4.1.8",
+    "@atrib/verify": "0.9.0"
   },
   "license": "Apache-2.0",
   "files": [
@@ -43,6 +47,14 @@
     "url": "git+https://github.com/creatornader/atrib.git",
     "directory": "services/atrib-recall"
   },
+  "peerDependencies": {
+    "@atrib/verify": "^0.9.0"
+  },
+  "peerDependenciesMeta": {
+    "@atrib/verify": {
+      "optional": true
+    }
+  },
   "scripts": {
     "build": "tsc",
     "dev": "tsc --watch",