@cavelang/cli 0.27.3 → 0.29.0

package/dist/internal/loop/reconstruct.js

@@ -0,0 +1,157 @@
+/**
+ * The reconstruction loop (spec §18, §11.3) — Ji et al.'s Algorithm 1
+ * (*Memory is Reconstructed, Not Retrieved*, 2026) as a functional loop
+ * over the CAVE graph:
+ *
+ * - **Cues** are entities used as query anchors;
+ * - **route**: expanding a cue collects its claims (content) and pushes
+ *   scored neighbors — forward edges, named inverse edges, and topic
+ *   containment in both directions (ϕτ→e and ϕv→(c,g)) — onto the
+ *   frontier;
+ * - **select / stop** are policy decisions, injected — the loop itself is
+ *   deliberately outside the language (spec §18).
+ *
+ * The loop comes in two shapes sharing one step core: `reconstruct` for
+ * synchronous policies (the deterministic heuristic), `reconstructAsync`
+ * for policies that await a model between steps (`llmPolicy`).
+ */
+import { Claim, Key } from '@cavelang/core';
+const loopOf = (seeds) => ({
+    state: {
+        frontier: seeds.map(entity => ({ entity, score: 1, depth: 0 })),
+        visited: new Set(),
+        collected: [],
+        steps: 0
+    },
+    seen: new Set(),
+    claims: [],
+    trace: []
+});
+/** Relational edges of a cue, both directions (spec §11.3 routing). */
+const edgesOf = (store, cue) => [...store.forward(cue.entity), ...store.reverse(cue.entity)];
+/**
+ * Applies one expansion: mark the cue visited, collect its claims, offer
+ * scored neighbors, merge them into the frontier. `scores[i]` belongs to
+ * `edges[i]` — computed by the caller, which is what lets the sync and
+ * async loops share this core.
+ */
+const applyStep = (store, loop, cue, edges, scores) => {
+    const visited = new Set(loop.state.visited);
+    visited.add(cue.entity);
+    let collected = 0;
+    for (const claim of store.claimsAbout(cue.entity)) {
+        const key = Key.of(claim);
+        if (!loop.seen.has(key)) {
+            loop.seen.add(key);
+            loop.claims.push(claim);
+            collected += 1;
+        }
+    }
+    const neighbors = new Map();
+    edges.forEach((edge, index) => {
+        if (visited.has(edge.to)) {
+            return;
+        }
+        const score = scores[index];
+        const existing = neighbors.get(edge.to);
+        if (existing === undefined || existing.score < score) {
+            neighbors.set(edge.to, { entity: edge.to, score, depth: cue.depth + 1 });
+        }
+    });
+    // Merge offers into the frontier keeping the maximum score per entity:
+    // a weaker path discovered later must never downgrade a pending cue,
+    // or adding knowledge could remove reachable claims.
+    const merged = [];
+    for (const entry of loop.state.frontier) {
+        if (entry.entity === cue.entity) {
+            continue;
+        }
+        const offered = neighbors.get(entry.entity);
+        if (offered !== undefined) {
+            merged.push(offered.score > entry.score ? offered : entry);
+            neighbors.delete(entry.entity);
+        }
+        else {
+            merged.push(entry);
+        }
+    }
+    merged.push(...neighbors.values());
+    loop.state = {
+        frontier: merged,
+        visited,
+        collected: loop.claims,
+        steps: loop.state.steps + 1
+    };
+    loop.trace.push({ step: loop.state.steps, cue, edges, collected });
+};
+const reconstructionOf = (loop) => ({ claims: loop.claims, trace: loop.trace, state: loop.state });
+/**
+ * Runs the loop from seed entities until the policy stops or the frontier
+ * empties. Pure given its inputs — same store + policy + seeds, same
+ * reconstruction.
+ */
+export const reconstruct = (store, policy, seeds) => {
+    const loop = loopOf(seeds);
+    while (!policy.done(loop.state)) {
+        const cue = policy.select(loop.state);
+        if (cue === undefined) {
+            break;
+        }
+        const edges = edgesOf(store, cue);
+        applyStep(store, loop, cue, edges, edges.map(edge => policy.score(edge, cue)));
+    }
+    return reconstructionOf(loop);
+};
+/**
+ * The async twin of `reconstruct`, for policies that await a model between
+ * steps (spec §18): same algorithm, same trace, decisions awaited.
+ */
+export const reconstructAsync = async (store, policy, seeds) => {
+    const loop = loopOf(seeds);
+    while (!(await policy.done(loop.state))) {
+        const cue = await policy.select(loop.state);
+        if (cue === undefined) {
+            break;
+        }
+        const edges = edgesOf(store, cue);
+        const scores = [];
+        for (const edge of edges) {
+            scores.push(await policy.score(edge, cue));
+        }
+        applyStep(store, loop, cue, edges, scores);
+    }
+    return reconstructionOf(loop);
+};
+/**
+ * Deterministic heuristic policy for dependency-free testing (spec §18):
+ * greedy best-first by score (FIFO tiebreak), score = parent score ×
+ * edge confidence × decay, hard budgets for steps and claims. Also the
+ * eval baseline the LLM policy is measured against (spec §18).
+ */
+export const heuristicPolicy = (options = {}) => {
+    const decay = options.decay ?? 0.8;
+    const maxSteps = options.maxSteps ?? 16;
+    const minScore = options.minScore ?? 0.05;
+    const maxClaims = options.maxClaims ?? Number.POSITIVE_INFINITY;
+    return {
+        select(state) {
+            let best;
+            for (const cue of state.frontier) {
+                if (cue.score < minScore) {
+                    continue;
+                }
+                if (best === undefined || cue.score > best.score) {
+                    best = cue;
+                }
+            }
+            return best;
+        },
+        score(edge, from) {
+            return from.score * edge.conf * decay;
+        },
+        done(state) {
+            return state.steps >= maxSteps || state.collected.length >= maxClaims;
+        }
+    };
+};
+//# sourceMappingURL=reconstruct.js.map

package/dist/internal/loop/reconstruct.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reconstruct.js","sourceRoot":"","sources":["../../src/reconstruct.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,gBAAgB,CAAA;AAwD3C,MAAM,MAAM,GAAG,CAAC,KAAwB,EAAQ,EAAE,CAAC,CAAC;IAClD,KAAK,EAAE;QACL,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/D,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,SAAS,EAAE,EAAE;QACb,KAAK,EAAE,CAAC;KACT;IACD,IAAI,EAAE,IAAI,GAAG,EAAE;IACf,MAAM,EAAE,EAAE;IACV,KAAK,EAAE,EAAE;CACV,CAAC,CAAA;AAEF,uEAAuE;AACvE,MAAM,OAAO,GAAG,CAAC,KAAgB,EAAE,GAAQ,EAAU,EAAE,CACrD,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;AAE9D;;;;;GAKG;AACH,MAAM,SAAS,GAAG,CAChB,KAAgB,EAChB,IAAU,EACV,GAAQ,EACR,KAAsB,EACtB,MAAyB,EACnB,EAAE;IACR,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IAC3C,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IACvB,IAAI,SAAS,GAAG,CAAC,CAAA;IACjB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAClD,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;QACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YAClB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACvB,SAAS,IAAI,CAAC,CAAA;QAChB,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAe,CAAA;IACxC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QAC5B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,OAAM;QACR,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAE,CAAA;QAC5B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACvC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YACrD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAA;QAC1E,CAAC;IACH,CAAC,CAAC,CAAA;IACF,uEAAuE;IACvE,qEAAqE;IACrE,qDAAqD;IACrD,MAAM,MAAM,GAAU,EAAE,CAAA;IACxB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;YAChC,SAAQ;QACV,CAAC;QACD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QAC3C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;YAC1D,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;QAChC,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACpB,CAAC;IACH,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAA;IAClC,IAAI,CAAC,KAAK,GAAG;QACX,QAAQ,EAAE,MAAM;QAChB,OAAO;QACP,SAAS,EAAE,IAAI,CAAC,MAAM;QACtB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC;KAC5B,CAAA;IACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAA;AACpE,CAAC,CAAA;AAED,MAAM,gBAAgB,GAAG,CAAC,IAAU,EAAkB,EAAE,CACtD,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAA;AAEjE;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAgB,EAAE,MAAc,EAAE,KAAwB,EAAkB,EAAE;IACxG,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;IAC1B,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACrC,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAK;QACP,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QACjC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAA;IAChF,CAAC;IACD,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,KAAK,EACnC,KAAgB,EAChB,MAAmB,EACnB,KAAwB,EACC,EAAE;IAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;IAC1B,OAAO,CAAC,CAAC,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC3C,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAK;QACP,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QACjC,MAAM,MAAM,GAAa,EAAE,CAAA;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,MAAM,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAA;QAC5C,CAAC;QACD,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAA;IAC5C,CAAC;IACD,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC,CAAA;AAaD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,UAA4B,EAAE,EAAU,EAAE;IACxE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,GAAG,CAAA;IAClC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAA;IACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAA;IACzC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,MAAM,CAAC,iBAAiB,CAAA;IAC/D,OAAO;QACL,MAAM,CAAC,KAAK;YACV,IAAI,IAAqB,CAAA;YACzB,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACjC,IAAI,GAAG,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACzB,SAAQ;gBACV,CAAC;gBACD,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;oBACjD,IAAI,GAAG,GAAG,CAAA;gBACZ,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;QACD,KAAK,CAAC,IAAI,EAAE,IAAI;YACd,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;QACvC,CAAC;QACD,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC,KAAK,IAAI,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,IAAI,SAAS,CAAA;QACvE,CAAC;KACF,CAAA;AACH,CAAC,CAAA"}

package/dist/internal/loop/sqlite.d.ts

@@ -0,0 +1,13 @@
+/**
+ * The §18 store contract over `@cavelang/store`'s SQLite store — one
+ * adapter shared by the MCP `cave_reconstruct` tool and the CLI
+ * `cave reconstruct` command.
+ *
+ * Reads are current-belief only, and negated / retracted rows are not
+ * edges — the store's own traversal defaults, matching `memoryStore`.
+ */
+import type { Store } from '@cavelang/store';
+import type { CaveStore } from './store.ts';
+/** `@cavelang/cli/loop` store contract over an open SQLite store (spec §18). */
+export declare const sqliteStore: (store: Store) => CaveStore;
+//# sourceMappingURL=sqlite.d.ts.map

package/dist/internal/loop/sqlite.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite.d.ts","sourceRoot":"","sources":["../../src/sqlite.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAA;AAC5C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAA;AAE3C,4EAA4E;AAC5E,eAAO,MAAM,WAAW,GAAI,OAAO,KAAK,KAAG,SAyBzC,CAAA"}

package/dist/internal/loop/sqlite.js

@@ -0,0 +1,33 @@
+/**
+ * The §18 store contract over `@cavelang/store`'s SQLite store — one
+ * adapter shared by the MCP `cave_reconstruct` tool and the CLI
+ * `cave reconstruct` command.
+ *
+ * Reads are current-belief only, and negated / retracted rows are not
+ * edges — the store's own traversal defaults, matching `memoryStore`.
+ */
+/** `@cavelang/cli/loop` store contract over an open SQLite store (spec §18). */
+export const sqliteStore = (store) => ({
+    forward: entity => store.forward(entity).map(fact => ({
+        from: entity,
+        to: fact.target,
+        verb: fact.verb,
+        rel: fact.verb,
+        conf: fact.row.conf,
+        claim: store.toClaim(fact.row)
+    })),
+    reverse: entity => store.reverse(entity).map(fact => ({
+        from: entity,
+        to: fact.source,
+        verb: fact.verb,
+        ...fact.rel === undefined ? {} : { rel: fact.rel },
+        conf: fact.row.conf,
+        claim: store.toClaim(fact.row)
+    })),
+    claimsAbout: entity => store.currentBeliefs()
+        .filter(row => row.subject === entity || row.object === entity)
+        .map(row => store.toClaim(row)),
+    expandTopic: topic => store.topicMembers(topic),
+    topicsOf: entity => store.topicsOf(entity)
+});
+//# sourceMappingURL=sqlite.js.map

package/dist/internal/loop/sqlite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite.js","sourceRoot":"","sources":["../../src/sqlite.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAKH,4EAA4E;AAC5E,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAY,EAAa,EAAE,CAAC,CAAC;IACvD,OAAO,EAAE,MAAM,CAAC,EAAE,CAChB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,EAAE,MAAM;QACZ,EAAE,EAAE,IAAI,CAAC,MAAM;QACf,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,GAAG,EAAE,IAAI,CAAC,IAAI;QACd,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI;QACnB,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;KAC/B,CAAC,CAAC;IACL,OAAO,EAAE,MAAM,CAAC,EAAE,CAChB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,EAAE,MAAM;QACZ,EAAE,EAAE,IAAI,CAAC,MAAM;QACf,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,GAAG,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;QAClD,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI;QACnB,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC;KAC/B,CAAC,CAAC;IACL,WAAW,EAAE,MAAM,CAAC,EAAE,CACpB,KAAK,CAAC,cAAc,EAAE;SACnB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,KAAK,MAAM,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC;SAC9D,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACnC,WAAW,EAAE,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC;IAC/C,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;CAC3C,CAAC,CAAA"}

package/dist/internal/loop/store.d.ts

@@ -0,0 +1,50 @@
+/**
+ * The store contract the language guarantees the agent (spec §18), plus a
+ * dependency-free in-memory implementation.
+ *
+ * The contract: forward reads via the subject index, named inverse reads
+ * via the object index plus `inverse_of()`, current-belief resolution via
+ * claim keys, and topic expansion via `CONTAINS` in both directions.
+ * `@cavelang/store`'s SQLite store satisfies the same shape; the in-memory
+ * store keeps the loop testable without I/O.
+ */
+import { Claim } from '@cavelang/core';
+import { Registry } from '@cavelang/canonical';
+/** A traversable edge, read from one endpoint. */
+export type Edge = {
+    readonly from: string;
+    readonly to: string;
+    /** Canonical (primary) verb of the underlying fact. */
+    readonly verb: string;
+    /**
+     * Relation name in the direction of traversal: the verb itself going
+     * forward, the declared inverse going backward — `undefined` when no
+     * inverse is declared (the un-named fallback, spec §5.5).
+     */
+    readonly rel?: string;
+    readonly conf: number;
+    readonly claim: Claim.t;
+};
+/** Injectable store interface for the reconstruction loop (spec §18). */
+export type CaveStore = {
+    /** Current relational facts with `entity` as subject. */
+    forward(entity: string): Edge[];
+    /** Current relational facts with `entity` as object, inverse-named. */
+    reverse(entity: string): Edge[];
+    /** Current claims about `entity` (either endpoint, any payload). */
+    claimsAbout(entity: string): Claim.t[];
+    /** Members of a topic — forward `CONTAINS` (spec §11.2). */
+    expandTopic(topic: string): string[];
+    /** Containers of an entity — inverse `CONTAINS` (spec §11.2). */
+    topicsOf(entity: string): string[];
+};
+/**
+ * In-memory `CaveStore` over canonical claims. Claim order is transaction
+ * order — for duplicated claim keys the last one wins (current belief,
+ * spec §9.1). Negated and retracted (`@ 0%`) facts are excluded from
+ * traversal, matching `@cavelang/store` defaults.
+ */
+export declare const memoryStore: (claims: readonly Claim.t[], registry?: Registry.t) => CaveStore;
+/** Convenience: in-memory store straight from CAVE text. */
+export declare const memoryStoreOfText: (text: string, registry?: Registry.t) => CaveStore;
+//# sourceMappingURL=store.d.ts.map

package/dist/internal/loop/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../../src/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,EAAO,MAAM,gBAAgB,CAAA;AAC3C,OAAO,EAAE,QAAQ,EAAsC,MAAM,qBAAqB,CAAA;AAElF,kDAAkD;AAClD,MAAM,MAAM,IAAI,GAAG;IACjB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,uDAAuD;IACvD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB;;;;OAIG;IACH,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;CACxB,CAAA;AAED,yEAAyE;AACzE,MAAM,MAAM,SAAS,GAAG;IACtB,yDAAyD;IACzD,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,CAAA;IAC/B,uEAAuE;IACvE,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,CAAA;IAC/B,oEAAoE;IACpE,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,EAAE,CAAA;IACtC,4DAA4D;IAC5D,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAAA;IACpC,iEAAiE;IACjE,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAAA;CACnC,CAAA;AAQD;;;;;GAKG;AACH,eAAO,MAAM,WAAW,GAAI,QAAQ,SAAS,KAAK,CAAC,CAAC,EAAE,EAAE,WAAU,QAAQ,CAAC,CAAoB,KAAG,SA0EjG,CAAA;AAED,4DAA4D;AAC5D,eAAO,MAAM,iBAAiB,GAAI,MAAM,MAAM,EAAE,WAAU,QAAQ,CAAC,CAAoB,KAAG,SAGzF,CAAA"}

package/dist/internal/loop/store.js

@@ -0,0 +1,100 @@
+/**
+ * The store contract the language guarantees the agent (spec §18), plus a
+ * dependency-free in-memory implementation.
+ *
+ * The contract: forward reads via the subject index, named inverse reads
+ * via the object index plus `inverse_of()`, current-belief resolution via
+ * claim keys, and topic expansion via `CONTAINS` in both directions.
+ * `@cavelang/store`'s SQLite store satisfies the same shape; the in-memory
+ * store keeps the loop testable without I/O.
+ */
+import { Claim, Key } from '@cavelang/core';
+import { Registry, canonicalizeText, standardRegistry } from '@cavelang/canonical';
+const subjectText = (claim) => Claim.formatTerm(claim.subject);
+const objectText = (claim) => claim.payload.kind === 'relation' ? Claim.formatTerm(claim.payload.object) : undefined;
+/**
+ * In-memory `CaveStore` over canonical claims. Claim order is transaction
+ * order — for duplicated claim keys the last one wins (current belief,
+ * spec §9.1). Negated and retracted (`@ 0%`) facts are excluded from
+ * traversal, matching `@cavelang/store` defaults.
+ */
+export const memoryStore = (claims, registry = standardRegistry) => {
+    const current = new Map();
+    for (const claim of claims) {
+        current.set(Key.of(claim), claim);
+    }
+    const bySubject = new Map();
+    const byObject = new Map();
+    const push = (map, key, claim) => {
+        const existing = map.get(key);
+        if (existing === undefined) {
+            map.set(key, [claim]);
+        }
+        else {
+            existing.push(claim);
+        }
+    };
+    for (const claim of current.values()) {
+        push(bySubject, subjectText(claim), claim);
+        const object = objectText(claim);
+        if (object !== undefined) {
+            push(byObject, object, claim);
+        }
+    }
+    const traversable = (claim) => !claim.negated && claim.conf > 0;
+    return {
+        forward(entity) {
+            return (bySubject.get(entity) ?? [])
+                .filter(claim => traversable(claim) && objectText(claim) !== undefined)
+                .map(claim => ({
+                from: entity,
+                to: objectText(claim),
+                verb: claim.verb,
+                rel: claim.verb,
+                conf: claim.conf,
+                claim
+            }));
+        },
+        reverse(entity) {
+            return (byObject.get(entity) ?? [])
+                .filter(traversable)
+                .map(claim => {
+                const rel = Registry.inverseOf(registry, claim.verb);
+                return {
+                    from: entity,
+                    to: subjectText(claim),
+                    verb: claim.verb,
+                    ...rel === undefined ? {} : { rel },
+                    conf: claim.conf,
+                    claim
+                };
+            });
+        },
+        claimsAbout(entity) {
+            const about = [
+                ...bySubject.get(entity) ?? [],
+                ...(byObject.get(entity) ?? []).filter(claim => subjectText(claim) !== entity)
+            ];
+            return about;
+        },
+        expandTopic(topic) {
+            return (bySubject.get(topic) ?? [])
+                .filter(claim => traversable(claim) && claim.verb === 'CONTAINS')
+                .flatMap(claim => {
+                const object = objectText(claim);
+                return object === undefined ? [] : [object];
+            });
+        },
+        topicsOf(entity) {
+            return (byObject.get(entity) ?? [])
+                .filter(claim => traversable(claim) && claim.verb === 'CONTAINS')
+                .map(subjectText);
+        }
+    };
+};
+/** Convenience: in-memory store straight from CAVE text. */
+export const memoryStoreOfText = (text, registry = standardRegistry) => {
+    const result = canonicalizeText(text, registry);
+    return memoryStore(result.claims.map(entry => entry.claim), result.registry);
+};
+//# sourceMappingURL=store.js.map

package/dist/internal/loop/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../src/store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAA;AAgClF,MAAM,WAAW,GAAG,CAAC,KAAc,EAAU,EAAE,CAC7C,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;AAEjC,MAAM,UAAU,GAAG,CAAC,KAAc,EAAsB,EAAE,CACxD,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;AAExF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAA0B,EAAE,WAAuB,gBAAgB,EAAa,EAAE;IAC5G,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAA;IACnC,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAA;IAC7C,MAAM,IAAI,GAAG,CAAC,GAA2B,EAAE,GAAW,EAAE,KAAc,EAAQ,EAAE;QAC9E,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAC7B,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;QACvB,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACtB,CAAC;IACH,CAAC,CAAA;IACD,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAA;QAC1C,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;QAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IACD,MAAM,WAAW,GAAG,CAAC,KAAc,EAAW,EAAE,CAC9C,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,CAAA;IAElC,OAAO;QACL,OAAO,CAAC,MAAM;YACZ,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;iBACjC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,SAAS,CAAC;iBACtE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACb,IAAI,EAAE,MAAM;gBACZ,EAAE,EAAE,UAAU,CAAC,KAAK,CAAE;gBACtB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,GAAG,EAAE,KAAK,CAAC,IAAI;gBACf,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,KAAK;aACN,CAAC,CAAC,CAAA;QACP,CAAC;QACD,OAAO,CAAC,MAAM;YACZ,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;iBAChC,MAAM,CAAC,WAAW,CAAC;iBACnB,GAAG,CAAC,KAAK,CAAC,EAAE;gBACX,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;gBACpD,OAAO;oBACL,IAAI,EAAE,MAAM;oBACZ,EAAE,EAAE,WAAW,CAAC,KAAK,CAAC;oBACtB,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE;oBACnC,IAAI,EAAE,KAAK,CAAC,IAAI;oBAChB,KAAK;iBACN,CAAA;YACH,CAAC,CAAC,CAAA;QACN,CAAC;QACD,WAAW,CAAC,MAAM;YAChB,MAAM,KAAK,GAAG;gBACZ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;gBAC9B,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC;aAC/E,CAAA;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,WAAW,CAAC,KAAK;YACf,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;iBAChC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC;iBAChE,OAAO,CAAC,KAAK,CAAC,EAAE;gBACf,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;gBAChC,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;YAC7C,CAAC,CAAC,CAAA;QACN,CAAC;QACD,QAAQ,CAAC,MAAM;YACb,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;iBAChC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC;iBAChE,GAAG,CAAC,WAAW,CAAC,CAAA;QACrB,CAAC;KACF,CAAA;AACH,CAAC,CAAA;AAED,4DAA4D;AAC5D,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,IAAY,EAAE,WAAuB,gBAAgB,EAAa,EAAE;IACpG,MAAM,MAAM,GAAG,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IAC/C,OAAO,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;AAC9E,CAAC,CAAA"}

package/dist/internal/mcp/bin.d.ts

@@ -0,0 +1,7 @@
+#!/usr/bin/env node
+/**
+ * Standalone `cave mcp` entry — lets other packages (and MCP client
+ * configurations) point at the server without going through `@cavelang/cli`.
+ */
+export {};
+//# sourceMappingURL=bin.d.ts.map

package/dist/internal/mcp/bin.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.d.ts","sourceRoot":"","sources":["../../src/bin.ts"],"names":[],"mappings":";AACA;;;GAGG"}

package/dist/internal/mcp/bin.js

@@ -0,0 +1,8 @@
+#!/usr/bin/env node
+/**
+ * Standalone `cave mcp` entry — lets other packages (and MCP client
+ * configurations) point at the server without going through `@cavelang/cli`.
+ */
+import { runMcp } from "./main.js";
+process.exitCode = await runMcp(process.argv.slice(2));
+//# sourceMappingURL=bin.js.map

package/dist/internal/mcp/bin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bin.js","sourceRoot":"","sources":["../../src/bin.ts"],"names":[],"mappings":";AACA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAA;AAElC,OAAO,CAAC,QAAQ,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA"}

package/dist/internal/mcp/index.d.ts

@@ -0,0 +1,25 @@
+/**
+ * `@cavelang/cli/mcp` — the CAVE engine as an MCP server.
+ *
+ * ```jsonc
+ * // client configuration
+ * { "command": "cave", "args": ["mcp", "--db", "knowledge.db"] }
+ * ```
+ *
+ * Tools: cave_add, cave_query, cave_fuse, cave_search, cave_about,
+ * cave_neighbors, cave_reconstruct, cave_derive, cave_export, cave_lint —
+ * plus one generated `act_<name>` tool per action declared in the store
+ * (spec §25.5), the governed write vocabulary. `cave_fuse` and
+ * `cave_derive` are named computation: agents delegate Bayesian fusion
+ * (spec §10.1) and rule derivation (spec §24) instead of doing the math
+ * in tokens. Server instructions carry the spec §22 compact card so
+ * connected models can write CAVE directly. `--read-only` /
+ * `--tools <list>` narrow the served surface — the minimum viable agent
+ * permission boundary.
+ */
+export { agentSource, createServer, serve, instructions, instructionsFor, protocolVersion, serverInfo, specCard } from './server.ts';
+export type { ServerOptions } from './server.ts';
+export { runMcp } from './main.ts';
+export { actionTools, actToolName, actToolPrefix, allowsActions, permissions, scopedActionTools, scopedTools, tools } from './tools.ts';
+export type { Permission, Scope, Tool, ToolContext } from './tools.ts';
+//# sourceMappingURL=index.d.ts.map

package/dist/internal/mcp/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,eAAe,EAAE,eAAe,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AACpI,YAAY,EAAE,aAAa,EAAE,MAAM,aAAa,CAAA;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAA;AAClC,OAAO,EACL,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,WAAW,EACnE,iBAAiB,EAAE,WAAW,EAAE,KAAK,EACtC,MAAM,YAAY,CAAA;AACnB,YAAY,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA"}

package/dist/internal/mcp/index.js

@@ -0,0 +1,23 @@
+/**
+ * `@cavelang/cli/mcp` — the CAVE engine as an MCP server.
+ *
+ * ```jsonc
+ * // client configuration
+ * { "command": "cave", "args": ["mcp", "--db", "knowledge.db"] }
+ * ```
+ *
+ * Tools: cave_add, cave_query, cave_fuse, cave_search, cave_about,
+ * cave_neighbors, cave_reconstruct, cave_derive, cave_export, cave_lint —
+ * plus one generated `act_<name>` tool per action declared in the store
+ * (spec §25.5), the governed write vocabulary. `cave_fuse` and
+ * `cave_derive` are named computation: agents delegate Bayesian fusion
+ * (spec §10.1) and rule derivation (spec §24) instead of doing the math
+ * in tokens. Server instructions carry the spec §22 compact card so
+ * connected models can write CAVE directly. `--read-only` /
+ * `--tools <list>` narrow the served surface — the minimum viable agent
+ * permission boundary.
+ */
+export { agentSource, createServer, serve, instructions, instructionsFor, protocolVersion, serverInfo, specCard } from "./server.js";
+export { runMcp } from "./main.js";
+export { actionTools, actToolName, actToolPrefix, allowsActions, permissions, scopedActionTools, scopedTools, tools } from "./tools.js";
+//# sourceMappingURL=index.js.map

package/dist/internal/mcp/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,eAAe,EAAE,eAAe,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAEpI,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAA;AAClC,OAAO,EACL,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,WAAW,EACnE,iBAAiB,EAAE,WAAW,EAAE,KAAK,EACtC,MAAM,YAAY,CAAA"}

package/dist/internal/mcp/main.d.ts

@@ -0,0 +1,23 @@
+/**
+ * `cave mcp` entry — opens the knowledge database and serves MCP on stdio
+ * until the client disconnects. Everything written to stdout is protocol;
+ * the startup banner goes to stderr.
+ */
+export declare const usage = "cave mcp \u2014 serve a CAVE knowledge database as an MCP server on stdio\n\nUsage:\n  cave mcp [--db <path>] [--no-prelude] [--read-only]\n           [--permissions <list>] [--tools <list>]\n           [--src <context>] [--no-src] [--hooks <file>]\n\nOptions:\n  --db <path>      database file (default: $CAVE_DB, or cave.db)\n  --no-prelude     open the store without the standard verb registry\n  --read-only      serve only tools that never write (drops cave_add,\n                   cave_derive and the generated act_<name> action tools)\n  --permissions    serve only operation classes from read,evaluate,record,\n                   action (comma-separated); evaluation is ephemeral,\n                   recording is durable, and action may execute effects\n  --tools <list>   serve only these tools (comma-separated); --read-only\n                   still drops writing tools from the list; act_<name>\n                   entries scope whichever actions exist at call time\n  --src <context>  provenance stamp for appends, without the src: prefix\n                   (default: agent/<client-name> from the MCP handshake)\n  --no-src         do not stamp actor provenance on appends\n  --hooks <file>   JSON file of out-of-band hook command templates for\n                   action tools, name \u2192 shell template (spec \u00A725.4);\n                   default: $CAVE_HOOKS\n\nAppended claims that carry no @src: context are stamped with the\nconnected client's source context (spec \u00A79.5). Actions declared in the\nstore are served as generated act_<name> tools (spec \u00A725.5) \u2014 the\ngoverned write vocabulary \u2014 recomputed per tools/list. Tools outside the\nserved scope are absent from tools/list and unknown to tools/call. Runs\nuntil the client disconnects; stdout is protocol, diagnostics go to\nstderr.\n\nExamples:\n  cave mcp --db k.db\n  cave mcp --db k.db --read-only\n  cave mcp --db k.db --permissions read,evaluate\n  cave mcp --db k.db --permissions action --tools act_mark-deployed\n  cave mcp --db k.db --tools cave_query,cave_about,cave_search\n  cave mcp --db k.db --tools cave_query,act_mark-deployed\n  cave mcp --db k.db --hooks hooks.json\n  cave mcp --db k.db --src pipeline/nightly\n  claude mcp add cave -- cave mcp --db k.db";
+/**
+ * Loads a hooks configuration file (spec §25.4): a JSON object mapping
+ * hook names to shell command templates. Throws on anything else — a
+ * misconfigured side-effect surface must not come up at all.
+ */
+export declare const readHooks: (path: string) => Record<string, string>;
+export type RunContext = {
+    readonly stdin?: NodeJS.ReadableStream;
+    readonly stdout?: NodeJS.WritableStream;
+    readonly stderr?: NodeJS.WritableStream;
+    readonly signal?: AbortSignal;
+};
+/** Validates the single accepted `--src` spelling: a non-empty context token without `src:`. */
+export declare const sourceFromOption: (value: undefined | string) => undefined | string;
+/** Runs the server; resolves with the process exit code. */
+export declare const runMcp: (argv: readonly string[], context?: RunContext) => Promise<number>;
+//# sourceMappingURL=main.d.ts.map

package/dist/internal/mcp/main.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"main.d.ts","sourceRoot":"","sources":["../../src/main.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AASH,eAAO,MAAM,KAAK,wuEA0C0B,CAAA;AAE5C;;;;GAIG;AACH,eAAO,MAAM,SAAS,GAAI,MAAM,MAAM,KAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAO7D,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,cAAc,CAAA;IACtC,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,cAAc,CAAA;IACvC,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,cAAc,CAAA;IACvC,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAA;CAC9B,CAAA;AAED,gGAAgG;AAChG,eAAO,MAAM,gBAAgB,GAAI,OAAO,SAAS,GAAG,MAAM,KAAG,SAAS,GAAG,MASxE,CAAA;AAED,4DAA4D;AAC5D,eAAO,MAAM,MAAM,GAAU,MAAM,SAAS,MAAM,EAAE,EAAE,UAAS,UAAe,KAAG,OAAO,CAAC,MAAM,CAuE9F,CAAA"}