@graphorin/memory 0.6.1 → 0.7.0

package/dist/tools/recall-tools.d.ts

@@ -1,200 +1,59 @@
 import { MemoryToolDeps } from "./types.js";
 import { Tool } from "@graphorin/core";
-import { z } from "zod";
 
 //#region src/tools/recall-tools.d.ts
-declare const recallEpisodesInputSchema: z.ZodObject<{
-  query: z.ZodString;
-  topK: z.ZodOptional<z.ZodNumber>;
-  dateRange: z.ZodOptional<z.ZodObject<{
-    from: z.ZodOptional<z.ZodString>;
-    to: z.ZodOptional<z.ZodString>;
-  }, "strip", z.ZodTypeAny, {
-    from?: string | undefined;
-    to?: string | undefined;
-  }, {
-    from?: string | undefined;
-    to?: string | undefined;
-  }>>;
-}, "strip", z.ZodTypeAny, {
+/** W-013: explicit interfaces (see fact-tools.ts) - no zod generics in d.ts. */
+interface RecallEpisodesInput {
   query: string;
   topK?: number | undefined;
   dateRange?: {
     from?: string | undefined;
     to?: string | undefined;
   } | undefined;
-}, {
+}
+interface RecallEpisodeHit {
+  episodeId: string;
+  summary: string;
+  score: number;
+  startedAt: string;
+  endedAt: string;
+  provenance?: string | undefined;
+}
+interface RecallEpisodesOutput {
+  episodes: RecallEpisodeHit[];
+}
+interface ConversationSearchInput {
   query: string;
   topK?: number | undefined;
-  dateRange?: {
-    from?: string | undefined;
-    to?: string | undefined;
-  } | undefined;
-}>;
-declare const recallEpisodesOutputSchema: z.ZodObject<{
-  episodes: z.ZodArray<z.ZodObject<{
-    episodeId: z.ZodString;
-    summary: z.ZodString;
-    score: z.ZodNumber;
-    startedAt: z.ZodString;
-    endedAt: z.ZodString;
-    /** Trust-provenance tag (MST-10) - synthesized episodes say so. */
-    provenance: z.ZodOptional<z.ZodString>;
-  }, "strip", z.ZodTypeAny, {
-    score: number;
-    episodeId: string;
-    summary: string;
-    startedAt: string;
-    endedAt: string;
-    provenance?: string | undefined;
-  }, {
-    score: number;
-    episodeId: string;
-    summary: string;
-    startedAt: string;
-    endedAt: string;
-    provenance?: string | undefined;
-  }>, "many">;
-}, "strip", z.ZodTypeAny, {
-  episodes: {
-    score: number;
-    episodeId: string;
-    summary: string;
-    startedAt: string;
-    endedAt: string;
-    provenance?: string | undefined;
-  }[];
-}, {
-  episodes: {
-    score: number;
-    episodeId: string;
-    summary: string;
-    startedAt: string;
-    endedAt: string;
-    provenance?: string | undefined;
-  }[];
-}>;
-type RecallEpisodesInput = z.infer<typeof recallEpisodesInputSchema>;
-type RecallEpisodesOutput = z.infer<typeof recallEpisodesOutputSchema>;
-declare const conversationSearchInputSchema: z.ZodObject<{
-  query: z.ZodString;
-  topK: z.ZodOptional<z.ZodNumber>;
-}, "strip", z.ZodTypeAny, {
-  query: string;
-  topK?: number | undefined;
-}, {
-  query: string;
-  topK?: number | undefined;
-}>;
-declare const conversationSearchOutputSchema: z.ZodObject<{
-  matches: z.ZodArray<z.ZodObject<{
-    messageId: z.ZodString;
-    score: z.ZodNumber;
-  }, "strip", z.ZodTypeAny, {
-    score: number;
+}
+interface ConversationSearchOutput {
+  matches: Array<{
     messageId: string;
-  }, {
     score: number;
-    messageId: string;
-  }>, "many">;
-}, "strip", z.ZodTypeAny, {
-  matches: {
-    score: number;
-    messageId: string;
-  }[];
-}, {
-  matches: {
-    score: number;
-    messageId: string;
-  }[];
-}>;
-type ConversationSearchInput = z.infer<typeof conversationSearchInputSchema>;
-type ConversationSearchOutput = z.infer<typeof conversationSearchOutputSchema>;
-declare const deepRecallInputSchema: z.ZodObject<{
-  query: z.ZodString;
-  topK: z.ZodOptional<z.ZodNumber>;
-  maxIterations: z.ZodOptional<z.ZodNumber>;
-  asOf: z.ZodOptional<z.ZodString>;
-}, "strip", z.ZodTypeAny, {
+  }>;
+}
+interface DeepRecallInput {
   query: string;
   topK?: number | undefined;
-  asOf?: string | undefined;
   maxIterations?: number | undefined;
-}, {
-  query: string;
-  topK?: number | undefined;
   asOf?: string | undefined;
-  maxIterations?: number | undefined;
-}>;
-declare const deepRecallOutputSchema: z.ZodObject<{
-  hits: z.ZodArray<z.ZodObject<{
-    factId: z.ZodString;
-    text: z.ZodString;
-    score: z.ZodNumber;
-    sensitivity: z.ZodEnum<["public", "internal", "secret"]>;
-    /** Trust-provenance tag (MST-10) - synthesized facts say so. */
-    provenance: z.ZodOptional<z.ZodString>;
-    /** Closed validity end (only surfaces on `asOf` reads). */
-    validTo: z.ZodOptional<z.ZodString>;
-    /** Id of the fact that superseded this one, when any. */
-    supersededBy: z.ZodOptional<z.ZodString>;
-  }, "strip", z.ZodTypeAny, {
-    text: string;
-    score: number;
-    sensitivity: "public" | "internal" | "secret";
-    factId: string;
-    validTo?: string | undefined;
-    provenance?: string | undefined;
-    supersededBy?: string | undefined;
-  }, {
-    text: string;
-    score: number;
-    sensitivity: "public" | "internal" | "secret";
-    factId: string;
-    validTo?: string | undefined;
-    provenance?: string | undefined;
-    supersededBy?: string | undefined;
-  }>, "many">;
-  sufficient: z.ZodBoolean;
-  abstained: z.ZodBoolean;
-  /**
-   * Whether the grader actually judged sufficiency
-   * (memory-retrieval-02). When `false`, `sufficient: true` is a
-   * default, not a verdict.
-   */
-  graded: z.ZodBoolean;
-  iterations: z.ZodNumber;
-}, "strip", z.ZodTypeAny, {
-  hits: {
-    text: string;
-    score: number;
-    sensitivity: "public" | "internal" | "secret";
-    factId: string;
-    validTo?: string | undefined;
-    provenance?: string | undefined;
-    supersededBy?: string | undefined;
-  }[];
-  sufficient: boolean;
-  abstained: boolean;
-  graded: boolean;
-  iterations: number;
-}, {
-  hits: {
-    text: string;
-    score: number;
-    sensitivity: "public" | "internal" | "secret";
-    factId: string;
-    validTo?: string | undefined;
-    provenance?: string | undefined;
-    supersededBy?: string | undefined;
-  }[];
+}
+interface DeepRecallHit {
+  factId: string;
+  text: string;
+  score: number;
+  sensitivity: 'public' | 'internal' | 'secret';
+  provenance?: string | undefined;
+  validTo?: string | undefined;
+  supersededBy?: string | undefined;
+}
+interface DeepRecallOutput {
+  hits: DeepRecallHit[];
   sufficient: boolean;
   abstained: boolean;
   graded: boolean;
   iterations: number;
-}>;
-type DeepRecallInput = z.infer<typeof deepRecallInputSchema>;
-type DeepRecallOutput = z.infer<typeof deepRecallOutputSchema>;
+}
 /**
  * `recall_episodes` - triple-signal episode retrieval (recency ×
  * relevance × importance).

package/dist/tools/recall-tools.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recall-tools.d.ts","names":[],"sources":["../../src/tools/recall-tools.ts"],"sourcesContent":[],"mappings":";;;;;cAMM,2BAAyB,CAAA,CAAA;;EAAzB,IAAA,eAAA,YASJ,CAAA;;;;;;;;;;;;EAT6B,KAAA,EAAA,MAAA;EAAA,IAAA,CAAA,EAAA,MAAA,GAAA,SAAA;EAUzB,SAAA,CAAA,EAAA;;;;;;;;;;;;cAAA,0BAA0B,EAAA,CAAA,CAAA,SAAA,CAAA;EAAA,QAAA,YAAA,YAAA,CAAA;IAc3B,SAAA,aAAmB;IACnB,OAAA,aAAoB;IAEnB,KAAA,aAAA;;;;;EAA6B,CAAA,EAAA,OAAA,cAAA,EAAA;IAAA,KAAA,EAAA,MAAA;IAI7B,SAAA,EAAA,MAAA;;;;;;;IAA8B,SAAA,EAAA,MAAA;IAAA,OAAA,EAAA,MAAA;IAS/B,SAAA,EAAA,MAAA;IACA,OAAA,EAAA,MAAA;IAGC,UAAA,CAAA,EAAA,MAAA,GAKJ,SAAA;;;;;;;;;IALyB,UAAA,CAAA,EAAA,MAAA,GAAA,SAAA;EAAA,CAAA,EAAA;AAAA,CAAA,EAAA;;;;;;;;;;KApBtB,mBAAA,GAAsB,CAAA,CAAE,aAAa;KACrC,oBAAA,GAAuB,CAAA,CAAE,aAAa;cAErC,+BAA6B,CAAA,CAAA;;;;;;;EAuBP,KAAA,EAAA,MAAA;EAAA,IAAA,CAAA,EAAA,MAAA,GAAA,SAAA;AAAA,CAAA,CAAA;AA0BE,cA7CxB,8BA8CiC,EA9CH,CAAA,CAAA,SA8CG,CAAA;EAQvB,OAAA,YAAA,YAAwB,CAAA;IAChC,SAAA,aAAA;IACA,KAAA,aAAA;EAAqB,CAAA,EAAA,OAAA,cAAA,EAAA;IAA1B,KAAA,EAAA,MAAA;IAAI,SAAA,EAAA,MAAA;EAqDS,CAAA,EAAA;IACR,KAAA,EAAA,MAAA;IACA,SAAA,EAAA,MAAA;EAAyB,CAAA,CAAA,EAAA,MAAA,CAAA;CAA9B,EAAA,OAAA,cAAA,EAAA;EAAI,OAAA,EAAA;IA0CS,KAAA,EAAA,MAAA;IACR,SAAA,EAAA,MAAA;EACA,CAAA,EAAA;CAAiB,EAAA;EAAtB,OAAA,EAAA;IAAI,KAAA,EAAA,MAAA;;;;KAlJF,uBAAA,GAA0B,CAAA,CAAE,aAAa;KACzC,wBAAA,GAA2B,CAAA,CAAE,aAAa;cAGzC,uBAAqB,CAAA,CAAA;;;;;;;;;;;;;;;;cAMrB,wBAAsB,CAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA0BvB,eAAA,GAAkB,CAAA,CAAE,aAAa;KACjC,gBAAA,GAAmB,CAAA,CAAE,aAAa;;;;;;;iBAQvB,wBAAA,OACR,iBACL,KAAK,qBAAqB;;;;;;;iBAqDb,4BAAA,OACR,iBACL,KAAK,yBAAyB;;;;;;;;;;;;;;;iBA0CjB,oBAAA,OACR,iBACL,KAAK,iBAAiB"}
+{"version":3,"file":"recall-tools.d.ts","names":[],"sources":["../../src/tools/recall-tools.ts"],"sourcesContent":[],"mappings":";;;;;UAgCiB,mBAAA;EAAA,KAAA,EAAA,MAAA;EAKA,IAAA,CAAA,EAAA,MAAA,GAAA,SAAgB;EAQhB,SAAA,CAAA,EAAA;IAiBA,IAAA,CAAA,EAAA,MAAA,GAAA,SAAuB;IAIvB,EAAA,CAAA,EAAA,MAAA,GAAA,SAAwB;EAqCxB,CAAA,GAAA,SAAA;AAMjB;AASiB,UAjFA,gBAAA,CAiFgB;EAkCjB,SAAA,EAAA,MAAA;EACR,OAAA,EAAA,MAAA;EACA,KAAA,EAAA,MAAA;EAAqB,SAAA,EAAA,MAAA;EAA1B,OAAA,EAAA,MAAA;EAAI,UAAA,CAAA,EAAA,MAAA,GAAA,SAAA;AAqDP;AACQ,UAnKS,oBAAA,CAmKT;EACA,QAAA,EAnKI,gBAmKJ,EAAA;;AAAL,UAnJc,uBAAA,CAmJd;EAAI,KAAA,EAAA,MAAA;EA0CS,IAAA,CAAA,EAAA,MAAA,GAAA,SAAoB;;AAE5B,UA3LS,wBAAA,CA2LT;EAAiB,OAAA,EA1Ld,KA0Lc,CAAA;IAAtB,SAAA,EAAA,MAAA;IAAI,KAAA,EAAA,MAAA;;;UAtJU,eAAA;;;;;;UAMA,aAAA;;;;;;;;;UASA,gBAAA;QACT;;;;;;;;;;;;iBAiCQ,wBAAA,OACR,iBACL,KAAK,qBAAqB;;;;;;;iBAqDb,4BAAA,OACR,iBACL,KAAK,yBAAyB;;;;;;;;;;;;;;;iBA0CjB,oBAAA,OACR,iBACL,KAAK,iBAAiB"}

package/dist/tools/recall-tools.js

@@ -1,4 +1,5 @@
 import { recallTaint } from "./taint.js";
+import { toolReturn } from "@graphorin/core";
 import { tool } from "@graphorin/tools";
 import { z } from "zod";
 
@@ -90,10 +91,10 @@ function createRecallEpisodesTool(deps) {
 				...hit.record.provenance !== void 0 ? { provenance: hit.record.provenance } : {}
 			})) };
 			const taint = recallTaint(hits.map((h) => h.record));
-			return taint === void 0 ? output : {
+			return taint === void 0 ? output : toolReturn({
 				output,
 				taint
-			};
+			});
 		}
 	});
 }
@@ -176,10 +177,10 @@ function createDeepRecallTool(deps) {
 				iterations: result.iterations
 			};
 			const taint = recallTaint(result.hits.map((h) => h.record));
-			return taint === void 0 ? output : {
+			return taint === void 0 ? output : toolReturn({
 				output,
 				taint
-			};
+			});
 		}
 	});
 }

package/dist/tools/recall-tools.js.map

@@ -1 +1 @@
-{"version":3,"file":"recall-tools.js","names":[],"sources":["../../src/tools/recall-tools.ts"],"sourcesContent":["import type { Tool } from '@graphorin/core';\nimport { tool } from '@graphorin/tools';\nimport { z } from 'zod';\nimport { recallTaint } from './taint.js';\nimport type { MemoryToolDeps } from './types.js';\n\nconst recallEpisodesInputSchema = z.object({\n  query: z.string().min(1).max(1024),\n  topK: z.number().int().positive().max(20).optional(),\n  dateRange: z\n    .object({\n      from: z.string().datetime().optional(),\n      to: z.string().datetime().optional(),\n    })\n    .optional(),\n});\nconst recallEpisodesOutputSchema = z.object({\n  episodes: z.array(\n    z.object({\n      episodeId: z.string(),\n      summary: z.string(),\n      score: z.number(),\n      startedAt: z.string(),\n      endedAt: z.string(),\n      /** Trust-provenance tag (MST-10) - synthesized episodes say so. */\n      provenance: z.string().optional(),\n    }),\n  ),\n});\n\ntype RecallEpisodesInput = z.infer<typeof recallEpisodesInputSchema>;\ntype RecallEpisodesOutput = z.infer<typeof recallEpisodesOutputSchema>;\n\nconst conversationSearchInputSchema = z.object({\n  query: z.string().min(1).max(1024),\n  topK: z.number().int().positive().max(20).optional(),\n});\nconst conversationSearchOutputSchema = z.object({\n  matches: z.array(\n    z.object({\n      messageId: z.string(),\n      score: z.number(),\n    }),\n  ),\n});\n\ntype ConversationSearchInput = z.infer<typeof conversationSearchInputSchema>;\ntype ConversationSearchOutput = z.infer<typeof conversationSearchOutputSchema>;\n\nconst deepRecallSensitivityEnum = z.enum(['public', 'internal', 'secret']);\nconst deepRecallInputSchema = z.object({\n  query: z.string().min(1).max(1024),\n  topK: z.number().int().positive().max(50).optional(),\n  maxIterations: z.number().int().min(1).max(5).optional(),\n  asOf: z.string().datetime().optional(),\n});\nconst deepRecallOutputSchema = z.object({\n  hits: z.array(\n    z.object({\n      factId: z.string(),\n      text: z.string(),\n      score: z.number(),\n      sensitivity: deepRecallSensitivityEnum,\n      /** Trust-provenance tag (MST-10) - synthesized facts say so. */\n      provenance: z.string().optional(),\n      /** Closed validity end (only surfaces on `asOf` reads). */\n      validTo: z.string().optional(),\n      /** Id of the fact that superseded this one, when any. */\n      supersededBy: z.string().optional(),\n    }),\n  ),\n  sufficient: z.boolean(),\n  abstained: z.boolean(),\n  /**\n   * Whether the grader actually judged sufficiency\n   * (memory-retrieval-02). When `false`, `sufficient: true` is a\n   * default, not a verdict.\n   */\n  graded: z.boolean(),\n  iterations: z.number().int(),\n});\n\ntype DeepRecallInput = z.infer<typeof deepRecallInputSchema>;\ntype DeepRecallOutput = z.infer<typeof deepRecallOutputSchema>;\n\n/**\n * `recall_episodes` - triple-signal episode retrieval (recency ×\n * relevance × importance).\n *\n * @stable\n */\nexport function createRecallEpisodesTool(\n  deps: MemoryToolDeps,\n): Tool<RecallEpisodesInput, RecallEpisodesOutput> {\n  return tool<RecallEpisodesInput, RecallEpisodesOutput>({\n    name: 'recall_episodes',\n    description:\n      \"Recall summarized episodes (multi-message stretches of past activity) matching a natural-language query. Combines vector relevance, time-decay recency, and the per-episode importance score. Use for long-horizon recall ('the last time we discussed X').\",\n    inputSchema: recallEpisodesInputSchema,\n    outputSchema: recallEpisodesOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'episodic'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const dateRange =\n        input.dateRange !== undefined\n          ? {\n              ...(input.dateRange.from !== undefined ? { from: input.dateRange.from } : {}),\n              ...(input.dateRange.to !== undefined ? { to: input.dateRange.to } : {}),\n            }\n          : undefined;\n      const hits = await deps.episodic.search(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n        ...(dateRange !== undefined ? { dateRange } : {}),\n        signal: ctx.signal,\n      });\n      const output = {\n        episodes: hits.map((hit) => ({\n          episodeId: hit.record.id,\n          summary: hit.record.summary,\n          score: hit.score,\n          startedAt: hit.record.startedAt,\n          endedAt: hit.record.endedAt,\n          // MST-10: surface origin so a consumer can tell a synthesized\n          // (consolidator-extracted) episode from a first-party record -\n          // recalled text re-enters the model as trusted tool output.\n          ...(hit.record.provenance !== undefined ? { provenance: hit.record.provenance } : {}),\n        })),\n      };\n      // C6: recalled foreign-provenance / quarantined episodes re-arm the\n      // taint ledger (the cross-session poisoning leg).\n      const taint = recallTaint(hits.map((h) => h.record));\n      return taint === undefined ? output : { output, taint };\n    },\n  });\n}\n\n/**\n * `conversation_search` - FTS5 search over the active session\n * messages.\n *\n * @stable\n */\nexport function createConversationSearchTool(\n  deps: MemoryToolDeps,\n): Tool<ConversationSearchInput, ConversationSearchOutput> {\n  return tool<ConversationSearchInput, ConversationSearchOutput>({\n    name: 'conversation_search',\n    description:\n      'Search the active session message log by natural-language query. Returns up to `topK` matched messages with their stable id and BM25 score.',\n    inputSchema: conversationSearchInputSchema,\n    outputSchema: conversationSearchOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'session'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const hits = await deps.session.search(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n        signal: ctx.signal,\n      });\n      return {\n        matches: hits.map((hit) => ({\n          messageId: hit.record.id,\n          score: hit.score,\n        })),\n      };\n    },\n  });\n}\n\n/**\n * `deep_recall` - gated, multi-pass (\"deep\") recall over the user's\n * factual memory for HARD questions (P2-4). A local difficulty gate keeps\n * simple lookups single-shot; only queries judged hard trigger a\n * grade-and-reformulate loop (bounded by `maxIterations`, hard-capped at\n * 5), widening to one-hop graph expansion on reformulation passes. The\n * output reports `abstained: true` when memory was insufficient even\n * after reformulating - the agent should then say it lacks the\n * information rather than guess. Registered only when the facade is\n * created with `iterativeRetrieval`; otherwise it degrades to a single\n * pass, so prefer the cheaper `fact_search` for ordinary lookups.\n *\n * @stable\n */\nexport function createDeepRecallTool(\n  deps: MemoryToolDeps,\n): Tool<DeepRecallInput, DeepRecallOutput> {\n  return tool<DeepRecallInput, DeepRecallOutput>({\n    name: 'deep_recall',\n    description:\n      \"Multi-pass ('deep') recall over the user's long-term factual memory for HARD multi-hop or temporal questions one search can't answer (e.g. 'who recommended the book the person I met in Tbilisi mentioned?'). A difficulty gate keeps simple lookups single-shot; hard questions trigger a bounded grade-and-reformulate loop. If `abstained` is true the memory was insufficient even after reformulating - tell the user you don't have enough stored to answer and DO NOT guess. Prefer the cheaper fact_search for ordinary lookups.\",\n    inputSchema: deepRecallInputSchema,\n    outputSchema: deepRecallOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'semantic'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const result = await deps.semantic.searchIterative(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n        ...(input.maxIterations !== undefined ? { maxIterations: input.maxIterations } : {}),\n        ...(input.asOf !== undefined ? { asOf: input.asOf } : {}),\n        // memory-retrieval-02: the model choosing deep_recall over\n        // fact_search IS the hardness signal - the local heuristic gate\n        // rejected the tool's own documented multi-hop examples\n        // (W_MULTI_HOP 0.4 < threshold 0.5) and is English-only. The\n        // cap + grader stop conditions still bound cost.\n        forceHard: true,\n        signal: ctx.signal,\n      });\n      const output = {\n        hits: result.hits.map((hit) => ({\n          factId: hit.record.id,\n          text: hit.record.text,\n          score: hit.score,\n          sensitivity: hit.record.sensitivity,\n          // MST-10: origin annotation, mirroring fact_search.\n          ...(hit.record.provenance !== undefined ? { provenance: hit.record.provenance } : {}),\n          ...(hit.record.validTo !== undefined ? { validTo: hit.record.validTo } : {}),\n          ...(hit.record.supersededBy !== undefined\n            ? { supersededBy: hit.record.supersededBy }\n            : {}),\n        })),\n        sufficient: result.sufficient,\n        abstained: result.abstained,\n        graded: result.graded,\n        iterations: result.iterations,\n      };\n      // C6: mirror fact_search - recalled poisoned content re-arms the ledger.\n      const taint = recallTaint(result.hits.map((h) => h.record));\n      return taint === undefined ? output : { output, taint };\n    },\n  });\n}\n"],"mappings":";;;;;AAMA,MAAM,4BAA4B,EAAE,OAAO;CACzC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK;CAClC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU;CACpD,WAAW,EACR,OAAO;EACN,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,UAAU;EACtC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,UAAU;EACrC,CAAC,CACD,UAAU;CACd,CAAC;AACF,MAAM,6BAA6B,EAAE,OAAO,EAC1C,UAAU,EAAE,MACV,EAAE,OAAO;CACP,WAAW,EAAE,QAAQ;CACrB,SAAS,EAAE,QAAQ;CACnB,OAAO,EAAE,QAAQ;CACjB,WAAW,EAAE,QAAQ;CACrB,SAAS,EAAE,QAAQ;CAEnB,YAAY,EAAE,QAAQ,CAAC,UAAU;CAClC,CAAC,CACH,EACF,CAAC;AAKF,MAAM,gCAAgC,EAAE,OAAO;CAC7C,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK;CAClC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU;CACrD,CAAC;AACF,MAAM,iCAAiC,EAAE,OAAO,EAC9C,SAAS,EAAE,MACT,EAAE,OAAO;CACP,WAAW,EAAE,QAAQ;CACrB,OAAO,EAAE,QAAQ;CAClB,CAAC,CACH,EACF,CAAC;AAKF,MAAM,4BAA4B,EAAE,KAAK;CAAC;CAAU;CAAY;CAAS,CAAC;AAC1E,MAAM,wBAAwB,EAAE,OAAO;CACrC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK;CAClC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU;CACpD,eAAe,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,UAAU;CACxD,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,UAAU;CACvC,CAAC;AACF,MAAM,yBAAyB,EAAE,OAAO;CACtC,MAAM,EAAE,MACN,EAAE,OAAO;EACP,QAAQ,EAAE,QAAQ;EAClB,MAAM,EAAE,QAAQ;EAChB,OAAO,EAAE,QAAQ;EACjB,aAAa;EAEb,YAAY,EAAE,QAAQ,CAAC,UAAU;EAEjC,SAAS,EAAE,QAAQ,CAAC,UAAU;EAE9B,cAAc,EAAE,QAAQ,CAAC,UAAU;EACpC,CAAC,CACH;CACD,YAAY,EAAE,SAAS;CACvB,WAAW,EAAE,SAAS;CAMtB,QAAQ,EAAE,SAAS;CACnB,YAAY,EAAE,QAAQ,CAAC,KAAK;CAC7B,CAAC;;;;;;;AAWF,SAAgB,yBACd,MACiD;AACjD,QAAO,KAAgD;EACrD,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,WAAW;EAC5B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;GAC1C,MAAM,YACJ,MAAM,cAAc,SAChB;IACE,GAAI,MAAM,UAAU,SAAS,SAAY,EAAE,MAAM,MAAM,UAAU,MAAM,GAAG,EAAE;IAC5E,GAAI,MAAM,UAAU,OAAO,SAAY,EAAE,IAAI,MAAM,UAAU,IAAI,GAAG,EAAE;IACvE,GACD;GACN,MAAM,OAAO,MAAM,KAAK,SAAS,OAAO,OAAO,MAAM,OAAO;IAC1D,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IACxD,GAAI,cAAc,SAAY,EAAE,WAAW,GAAG,EAAE;IAChD,QAAQ,IAAI;IACb,CAAC;GACF,MAAM,SAAS,EACb,UAAU,KAAK,KAAK,SAAS;IAC3B,WAAW,IAAI,OAAO;IACtB,SAAS,IAAI,OAAO;IACpB,OAAO,IAAI;IACX,WAAW,IAAI,OAAO;IACtB,SAAS,IAAI,OAAO;IAIpB,GAAI,IAAI,OAAO,eAAe,SAAY,EAAE,YAAY,IAAI,OAAO,YAAY,GAAG,EAAE;IACrF,EAAE,EACJ;GAGD,MAAM,QAAQ,YAAY,KAAK,KAAK,MAAM,EAAE,OAAO,CAAC;AACpD,UAAO,UAAU,SAAY,SAAS;IAAE;IAAQ;IAAO;;EAE1D,CAAC;;;;;;;;AASJ,SAAgB,6BACd,MACyD;AACzD,QAAO,KAAwD;EAC7D,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,UAAU;EAC3B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;AAK1C,UAAO,EACL,UALW,MAAM,KAAK,QAAQ,OAAO,OAAO,MAAM,OAAO;IACzD,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IACxD,QAAQ,IAAI;IACb,CAAC,EAEc,KAAK,SAAS;IAC1B,WAAW,IAAI,OAAO;IACtB,OAAO,IAAI;IACZ,EAAE,EACJ;;EAEJ,CAAC;;;;;;;;;;;;;;;;AAiBJ,SAAgB,qBACd,MACyC;AACzC,QAAO,KAAwC;EAC7C,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,WAAW;EAC5B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;GAC1C,MAAM,SAAS,MAAM,KAAK,SAAS,gBAAgB,OAAO,MAAM,OAAO;IACrE,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IACxD,GAAI,MAAM,kBAAkB,SAAY,EAAE,eAAe,MAAM,eAAe,GAAG,EAAE;IACnF,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IAMxD,WAAW;IACX,QAAQ,IAAI;IACb,CAAC;GACF,MAAM,SAAS;IACb,MAAM,OAAO,KAAK,KAAK,SAAS;KAC9B,QAAQ,IAAI,OAAO;KACnB,MAAM,IAAI,OAAO;KACjB,OAAO,IAAI;KACX,aAAa,IAAI,OAAO;KAExB,GAAI,IAAI,OAAO,eAAe,SAAY,EAAE,YAAY,IAAI,OAAO,YAAY,GAAG,EAAE;KACpF,GAAI,IAAI,OAAO,YAAY,SAAY,EAAE,SAAS,IAAI,OAAO,SAAS,GAAG,EAAE;KAC3E,GAAI,IAAI,OAAO,iBAAiB,SAC5B,EAAE,cAAc,IAAI,OAAO,cAAc,GACzC,EAAE;KACP,EAAE;IACH,YAAY,OAAO;IACnB,WAAW,OAAO;IAClB,QAAQ,OAAO;IACf,YAAY,OAAO;IACpB;GAED,MAAM,QAAQ,YAAY,OAAO,KAAK,KAAK,MAAM,EAAE,OAAO,CAAC;AAC3D,UAAO,UAAU,SAAY,SAAS;IAAE;IAAQ;IAAO;;EAE1D,CAAC"}
+{"version":3,"file":"recall-tools.js","names":[],"sources":["../../src/tools/recall-tools.ts"],"sourcesContent":["import type { Tool } from '@graphorin/core';\nimport { toolReturn } from '@graphorin/core';\nimport { tool } from '@graphorin/tools';\nimport { z } from 'zod';\nimport { recallTaint } from './taint.js';\nimport type { MemoryToolDeps } from './types.js';\n\nconst recallEpisodesInputSchema = z.object({\n  query: z.string().min(1).max(1024),\n  topK: z.number().int().positive().max(20).optional(),\n  dateRange: z\n    .object({\n      from: z.string().datetime().optional(),\n      to: z.string().datetime().optional(),\n    })\n    .optional(),\n});\nconst recallEpisodesOutputSchema = z.object({\n  episodes: z.array(\n    z.object({\n      episodeId: z.string(),\n      summary: z.string(),\n      score: z.number(),\n      startedAt: z.string(),\n      endedAt: z.string(),\n      /** Trust-provenance tag (MST-10) - synthesized episodes say so. */\n      provenance: z.string().optional(),\n    }),\n  ),\n});\n\n/** W-013: explicit interfaces (see fact-tools.ts) - no zod generics in d.ts. */\nexport interface RecallEpisodesInput {\n  query: string;\n  topK?: number | undefined;\n  dateRange?: { from?: string | undefined; to?: string | undefined } | undefined;\n}\nexport interface RecallEpisodeHit {\n  episodeId: string;\n  summary: string;\n  score: number;\n  startedAt: string;\n  endedAt: string;\n  provenance?: string | undefined;\n}\nexport interface RecallEpisodesOutput {\n  episodes: RecallEpisodeHit[];\n}\n\nconst conversationSearchInputSchema = z.object({\n  query: z.string().min(1).max(1024),\n  topK: z.number().int().positive().max(20).optional(),\n});\nconst conversationSearchOutputSchema = z.object({\n  matches: z.array(\n    z.object({\n      messageId: z.string(),\n      score: z.number(),\n    }),\n  ),\n});\n\nexport interface ConversationSearchInput {\n  query: string;\n  topK?: number | undefined;\n}\nexport interface ConversationSearchOutput {\n  matches: Array<{ messageId: string; score: number }>;\n}\n\nconst deepRecallSensitivityEnum = z.enum(['public', 'internal', 'secret']);\nconst deepRecallInputSchema = z.object({\n  query: z.string().min(1).max(1024),\n  topK: z.number().int().positive().max(50).optional(),\n  maxIterations: z.number().int().min(1).max(5).optional(),\n  asOf: z.string().datetime().optional(),\n});\nconst deepRecallOutputSchema = z.object({\n  hits: z.array(\n    z.object({\n      factId: z.string(),\n      text: z.string(),\n      score: z.number(),\n      sensitivity: deepRecallSensitivityEnum,\n      /** Trust-provenance tag (MST-10) - synthesized facts say so. */\n      provenance: z.string().optional(),\n      /** Closed validity end (only surfaces on `asOf` reads). */\n      validTo: z.string().optional(),\n      /** Id of the fact that superseded this one, when any. */\n      supersededBy: z.string().optional(),\n    }),\n  ),\n  sufficient: z.boolean(),\n  abstained: z.boolean(),\n  /**\n   * Whether the grader actually judged sufficiency\n   * (memory-retrieval-02). When `false`, `sufficient: true` is a\n   * default, not a verdict.\n   */\n  graded: z.boolean(),\n  iterations: z.number().int(),\n});\n\nexport interface DeepRecallInput {\n  query: string;\n  topK?: number | undefined;\n  maxIterations?: number | undefined;\n  asOf?: string | undefined;\n}\nexport interface DeepRecallHit {\n  factId: string;\n  text: string;\n  score: number;\n  sensitivity: 'public' | 'internal' | 'secret';\n  provenance?: string | undefined;\n  validTo?: string | undefined;\n  supersededBy?: string | undefined;\n}\nexport interface DeepRecallOutput {\n  hits: DeepRecallHit[];\n  sufficient: boolean;\n  abstained: boolean;\n  graded: boolean;\n  iterations: number;\n}\n\n// W-013 parity gate (compile-time only, erased from the build and the\n// d.ts): each explicit interface must stay MUTUALLY assignable with its\n// schema's inference - a drifted transcription fails `tsc` right here.\ntype W013Equals<A, B> = A extends B ? (B extends A ? true : false) : false;\ntype W013Assert<T extends true> = T;\ntype _W013Check1 = W013Assert<\n  W013Equals<RecallEpisodesInput, z.infer<typeof recallEpisodesInputSchema>>\n>;\ntype _W013Check2 = W013Assert<\n  W013Equals<RecallEpisodesOutput, z.infer<typeof recallEpisodesOutputSchema>>\n>;\ntype _W013Check3 = W013Assert<\n  W013Equals<ConversationSearchInput, z.infer<typeof conversationSearchInputSchema>>\n>;\ntype _W013Check4 = W013Assert<\n  W013Equals<ConversationSearchOutput, z.infer<typeof conversationSearchOutputSchema>>\n>;\ntype _W013Check5 = W013Assert<W013Equals<DeepRecallInput, z.infer<typeof deepRecallInputSchema>>>;\ntype _W013Check6 = W013Assert<W013Equals<DeepRecallOutput, z.infer<typeof deepRecallOutputSchema>>>;\n\n/**\n * `recall_episodes` - triple-signal episode retrieval (recency ×\n * relevance × importance).\n *\n * @stable\n */\nexport function createRecallEpisodesTool(\n  deps: MemoryToolDeps,\n): Tool<RecallEpisodesInput, RecallEpisodesOutput> {\n  return tool<RecallEpisodesInput, RecallEpisodesOutput>({\n    name: 'recall_episodes',\n    description:\n      \"Recall summarized episodes (multi-message stretches of past activity) matching a natural-language query. Combines vector relevance, time-decay recency, and the per-episode importance score. Use for long-horizon recall ('the last time we discussed X').\",\n    inputSchema: recallEpisodesInputSchema,\n    outputSchema: recallEpisodesOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'episodic'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const dateRange =\n        input.dateRange !== undefined\n          ? {\n              ...(input.dateRange.from !== undefined ? { from: input.dateRange.from } : {}),\n              ...(input.dateRange.to !== undefined ? { to: input.dateRange.to } : {}),\n            }\n          : undefined;\n      const hits = await deps.episodic.search(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n        ...(dateRange !== undefined ? { dateRange } : {}),\n        signal: ctx.signal,\n      });\n      const output = {\n        episodes: hits.map((hit) => ({\n          episodeId: hit.record.id,\n          summary: hit.record.summary,\n          score: hit.score,\n          startedAt: hit.record.startedAt,\n          endedAt: hit.record.endedAt,\n          // MST-10: surface origin so a consumer can tell a synthesized\n          // (consolidator-extracted) episode from a first-party record -\n          // recalled text re-enters the model as trusted tool output.\n          ...(hit.record.provenance !== undefined ? { provenance: hit.record.provenance } : {}),\n        })),\n      };\n      // C6: recalled foreign-provenance / quarantined episodes re-arm the\n      // taint ledger (the cross-session poisoning leg).\n      const taint = recallTaint(hits.map((h) => h.record));\n      return taint === undefined ? output : toolReturn({ output, taint });\n    },\n  });\n}\n\n/**\n * `conversation_search` - FTS5 search over the active session\n * messages.\n *\n * @stable\n */\nexport function createConversationSearchTool(\n  deps: MemoryToolDeps,\n): Tool<ConversationSearchInput, ConversationSearchOutput> {\n  return tool<ConversationSearchInput, ConversationSearchOutput>({\n    name: 'conversation_search',\n    description:\n      'Search the active session message log by natural-language query. Returns up to `topK` matched messages with their stable id and BM25 score.',\n    inputSchema: conversationSearchInputSchema,\n    outputSchema: conversationSearchOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'session'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const hits = await deps.session.search(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n        signal: ctx.signal,\n      });\n      return {\n        matches: hits.map((hit) => ({\n          messageId: hit.record.id,\n          score: hit.score,\n        })),\n      };\n    },\n  });\n}\n\n/**\n * `deep_recall` - gated, multi-pass (\"deep\") recall over the user's\n * factual memory for HARD questions (P2-4). A local difficulty gate keeps\n * simple lookups single-shot; only queries judged hard trigger a\n * grade-and-reformulate loop (bounded by `maxIterations`, hard-capped at\n * 5), widening to one-hop graph expansion on reformulation passes. The\n * output reports `abstained: true` when memory was insufficient even\n * after reformulating - the agent should then say it lacks the\n * information rather than guess. Registered only when the facade is\n * created with `iterativeRetrieval`; otherwise it degrades to a single\n * pass, so prefer the cheaper `fact_search` for ordinary lookups.\n *\n * @stable\n */\nexport function createDeepRecallTool(\n  deps: MemoryToolDeps,\n): Tool<DeepRecallInput, DeepRecallOutput> {\n  return tool<DeepRecallInput, DeepRecallOutput>({\n    name: 'deep_recall',\n    description:\n      \"Multi-pass ('deep') recall over the user's long-term factual memory for HARD multi-hop or temporal questions one search can't answer (e.g. 'who recommended the book the person I met in Tbilisi mentioned?'). A difficulty gate keeps simple lookups single-shot; hard questions trigger a bounded grade-and-reformulate loop. If `abstained` is true the memory was insufficient even after reformulating - tell the user you don't have enough stored to answer and DO NOT guess. Prefer the cheaper fact_search for ordinary lookups.\",\n    inputSchema: deepRecallInputSchema,\n    outputSchema: deepRecallOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'semantic'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const result = await deps.semantic.searchIterative(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n        ...(input.maxIterations !== undefined ? { maxIterations: input.maxIterations } : {}),\n        ...(input.asOf !== undefined ? { asOf: input.asOf } : {}),\n        // memory-retrieval-02: the model choosing deep_recall over\n        // fact_search IS the hardness signal - the local heuristic gate\n        // rejected the tool's own documented multi-hop examples\n        // (W_MULTI_HOP 0.4 < threshold 0.5) and is English-only. The\n        // cap + grader stop conditions still bound cost.\n        forceHard: true,\n        signal: ctx.signal,\n      });\n      const output = {\n        hits: result.hits.map((hit) => ({\n          factId: hit.record.id,\n          text: hit.record.text,\n          score: hit.score,\n          sensitivity: hit.record.sensitivity,\n          // MST-10: origin annotation, mirroring fact_search.\n          ...(hit.record.provenance !== undefined ? { provenance: hit.record.provenance } : {}),\n          ...(hit.record.validTo !== undefined ? { validTo: hit.record.validTo } : {}),\n          ...(hit.record.supersededBy !== undefined\n            ? { supersededBy: hit.record.supersededBy }\n            : {}),\n        })),\n        sufficient: result.sufficient,\n        abstained: result.abstained,\n        graded: result.graded,\n        iterations: result.iterations,\n      };\n      // C6: mirror fact_search - recalled poisoned content re-arms the ledger.\n      const taint = recallTaint(result.hits.map((h) => h.record));\n      return taint === undefined ? output : toolReturn({ output, taint });\n    },\n  });\n}\n"],"mappings":";;;;;;AAOA,MAAM,4BAA4B,EAAE,OAAO;CACzC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK;CAClC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU;CACpD,WAAW,EACR,OAAO;EACN,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,UAAU;EACtC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,UAAU;EACrC,CAAC,CACD,UAAU;CACd,CAAC;AACF,MAAM,6BAA6B,EAAE,OAAO,EAC1C,UAAU,EAAE,MACV,EAAE,OAAO;CACP,WAAW,EAAE,QAAQ;CACrB,SAAS,EAAE,QAAQ;CACnB,OAAO,EAAE,QAAQ;CACjB,WAAW,EAAE,QAAQ;CACrB,SAAS,EAAE,QAAQ;CAEnB,YAAY,EAAE,QAAQ,CAAC,UAAU;CAClC,CAAC,CACH,EACF,CAAC;AAoBF,MAAM,gCAAgC,EAAE,OAAO;CAC7C,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK;CAClC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU;CACrD,CAAC;AACF,MAAM,iCAAiC,EAAE,OAAO,EAC9C,SAAS,EAAE,MACT,EAAE,OAAO;CACP,WAAW,EAAE,QAAQ;CACrB,OAAO,EAAE,QAAQ;CAClB,CAAC,CACH,EACF,CAAC;AAUF,MAAM,4BAA4B,EAAE,KAAK;CAAC;CAAU;CAAY;CAAS,CAAC;AAC1E,MAAM,wBAAwB,EAAE,OAAO;CACrC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK;CAClC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU;CACpD,eAAe,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,UAAU;CACxD,MAAM,EAAE,QAAQ,CAAC,UAAU,CAAC,UAAU;CACvC,CAAC;AACF,MAAM,yBAAyB,EAAE,OAAO;CACtC,MAAM,EAAE,MACN,EAAE,OAAO;EACP,QAAQ,EAAE,QAAQ;EAClB,MAAM,EAAE,QAAQ;EAChB,OAAO,EAAE,QAAQ;EACjB,aAAa;EAEb,YAAY,EAAE,QAAQ,CAAC,UAAU;EAEjC,SAAS,EAAE,QAAQ,CAAC,UAAU;EAE9B,cAAc,EAAE,QAAQ,CAAC,UAAU;EACpC,CAAC,CACH;CACD,YAAY,EAAE,SAAS;CACvB,WAAW,EAAE,SAAS;CAMtB,QAAQ,EAAE,SAAS;CACnB,YAAY,EAAE,QAAQ,CAAC,KAAK;CAC7B,CAAC;;;;;;;AAmDF,SAAgB,yBACd,MACiD;AACjD,QAAO,KAAgD;EACrD,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,WAAW;EAC5B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;GAC1C,MAAM,YACJ,MAAM,cAAc,SAChB;IACE,GAAI,MAAM,UAAU,SAAS,SAAY,EAAE,MAAM,MAAM,UAAU,MAAM,GAAG,EAAE;IAC5E,GAAI,MAAM,UAAU,OAAO,SAAY,EAAE,IAAI,MAAM,UAAU,IAAI,GAAG,EAAE;IACvE,GACD;GACN,MAAM,OAAO,MAAM,KAAK,SAAS,OAAO,OAAO,MAAM,OAAO;IAC1D,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IACxD,GAAI,cAAc,SAAY,EAAE,WAAW,GAAG,EAAE;IAChD,QAAQ,IAAI;IACb,CAAC;GACF,MAAM,SAAS,EACb,UAAU,KAAK,KAAK,SAAS;IAC3B,WAAW,IAAI,OAAO;IACtB,SAAS,IAAI,OAAO;IACpB,OAAO,IAAI;IACX,WAAW,IAAI,OAAO;IACtB,SAAS,IAAI,OAAO;IAIpB,GAAI,IAAI,OAAO,eAAe,SAAY,EAAE,YAAY,IAAI,OAAO,YAAY,GAAG,EAAE;IACrF,EAAE,EACJ;GAGD,MAAM,QAAQ,YAAY,KAAK,KAAK,MAAM,EAAE,OAAO,CAAC;AACpD,UAAO,UAAU,SAAY,SAAS,WAAW;IAAE;IAAQ;IAAO,CAAC;;EAEtE,CAAC;;;;;;;;AASJ,SAAgB,6BACd,MACyD;AACzD,QAAO,KAAwD;EAC7D,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,UAAU;EAC3B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;AAK1C,UAAO,EACL,UALW,MAAM,KAAK,QAAQ,OAAO,OAAO,MAAM,OAAO;IACzD,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IACxD,QAAQ,IAAI;IACb,CAAC,EAEc,KAAK,SAAS;IAC1B,WAAW,IAAI,OAAO;IACtB,OAAO,IAAI;IACZ,EAAE,EACJ;;EAEJ,CAAC;;;;;;;;;;;;;;;;AAiBJ,SAAgB,qBACd,MACyC;AACzC,QAAO,KAAwC;EAC7C,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,WAAW;EAC5B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;GAC1C,MAAM,SAAS,MAAM,KAAK,SAAS,gBAAgB,OAAO,MAAM,OAAO;IACrE,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IACxD,GAAI,MAAM,kBAAkB,SAAY,EAAE,eAAe,MAAM,eAAe,GAAG,EAAE;IACnF,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE;IAMxD,WAAW;IACX,QAAQ,IAAI;IACb,CAAC;GACF,MAAM,SAAS;IACb,MAAM,OAAO,KAAK,KAAK,SAAS;KAC9B,QAAQ,IAAI,OAAO;KACnB,MAAM,IAAI,OAAO;KACjB,OAAO,IAAI;KACX,aAAa,IAAI,OAAO;KAExB,GAAI,IAAI,OAAO,eAAe,SAAY,EAAE,YAAY,IAAI,OAAO,YAAY,GAAG,EAAE;KACpF,GAAI,IAAI,OAAO,YAAY,SAAY,EAAE,SAAS,IAAI,OAAO,SAAS,GAAG,EAAE;KAC3E,GAAI,IAAI,OAAO,iBAAiB,SAC5B,EAAE,cAAc,IAAI,OAAO,cAAc,GACzC,EAAE;KACP,EAAE;IACH,YAAY,OAAO;IACnB,WAAW,OAAO;IAClB,QAAQ,OAAO;IACf,YAAY,OAAO;IACpB;GAED,MAAM,QAAQ,YAAY,OAAO,KAAK,KAAK,MAAM,EAAE,OAAO,CAAC;AAC3D,UAAO,UAAU,SAAY,SAAS,WAAW;IAAE;IAAQ;IAAO,CAAC;;EAEtE,CAAC"}

package/dist/tools/runbook-tools.d.ts

@@ -1,68 +1,25 @@
 import { MemoryToolDeps } from "./types.js";
 import { Tool } from "@graphorin/core";
-import { z } from "zod";
 
 //#region src/tools/runbook-tools.d.ts
 
-declare const runbookSearchInputSchema: z.ZodObject<{
-  query: z.ZodString;
-  topK: z.ZodOptional<z.ZodNumber>;
-}, "strip", z.ZodTypeAny, {
+/** W-013: explicit interfaces (see fact-tools.ts) - no zod generics in d.ts. */
+interface RunbookSearchInput {
   query: string;
   topK?: number | undefined;
-}, {
-  query: string;
-  topK?: number | undefined;
-}>;
-declare const runbookSearchOutputSchema: z.ZodObject<{
-  procedures: z.ZodArray<z.ZodObject<{
-    id: z.ZodString;
-    text: z.ZodString;
-    steps: z.ZodOptional<z.ZodArray<z.ZodString, "many">>;
-    variables: z.ZodOptional<z.ZodArray<z.ZodString, "many">>;
-    successCriteria: z.ZodOptional<z.ZodArray<z.ZodString, "many">>;
-    priority: z.ZodNumber;
-    score: z.ZodNumber;
-  }, "strip", z.ZodTypeAny, {
-    id: string;
-    text: string;
-    priority: number;
-    score: number;
-    steps?: string[] | undefined;
-    variables?: string[] | undefined;
-    successCriteria?: string[] | undefined;
-  }, {
-    id: string;
-    text: string;
-    priority: number;
-    score: number;
-    steps?: string[] | undefined;
-    variables?: string[] | undefined;
-    successCriteria?: string[] | undefined;
-  }>, "many">;
-}, "strip", z.ZodTypeAny, {
-  procedures: {
-    id: string;
-    text: string;
-    priority: number;
-    score: number;
-    steps?: string[] | undefined;
-    variables?: string[] | undefined;
-    successCriteria?: string[] | undefined;
-  }[];
-}, {
-  procedures: {
-    id: string;
-    text: string;
-    priority: number;
-    score: number;
-    steps?: string[] | undefined;
-    variables?: string[] | undefined;
-    successCriteria?: string[] | undefined;
-  }[];
-}>;
-type RunbookSearchInput = z.infer<typeof runbookSearchInputSchema>;
-type RunbookSearchOutput = z.infer<typeof runbookSearchOutputSchema>;
+}
+interface RunbookProcedureHit {
+  id: string;
+  text: string;
+  steps?: string[] | undefined;
+  variables?: string[] | undefined;
+  successCriteria?: string[] | undefined;
+  priority: number;
+  score: number;
+}
+interface RunbookSearchOutput {
+  procedures: RunbookProcedureHit[];
+}
 /**
  * `runbook_search` - find validated procedures matching a task
  * description. Quarantined (unvalidated induced) procedures never

package/dist/tools/runbook-tools.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"runbook-tools.d.ts","names":[],"sources":["../../src/tools/runbook-tools.ts"],"sourcesContent":[],"mappings":";;;;;;cAiBM,0BAAwB,CAAA,CAAA;;;;;;;;;;cAIxB,2BAAyB,CAAA,CAAA;;;;;;IAAA,eAAA,eAAA,WAAA,YAAA,EAAA,MAAA,CAAA,CAAA;IAAA,QAAA,aAAA;IAc1B,KAAA,aAAkB;EAClB,CAAA,EAAA,OAAA,cAAmB,EAAA;IASR,EAAA,EAAA,MAAA;IACR,IAAA,EAAA,MAAA;IACA,QAAA,EAAA,MAAA;IAAoB,KAAA,EAAA,MAAA;IAAzB,KAAA,CAAA,EAAA,MAAA,EAAA,GAAA,SAAA;IAAI,SAAA,CAAA,EAAA,MAAA,EAAA,GAAA,SAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAZF,kBAAA,GAAqB,CAAA,CAAE,aAAa;KACpC,mBAAA,GAAsB,CAAA,CAAE,aAAa;;;;;;;;iBAS1B,uBAAA,OACR,iBACL,KAAK,oBAAoB"}
+{"version":3,"file":"runbook-tools.d.ts","names":[],"sources":["../../src/tools/runbook-tools.ts"],"sourcesContent":[],"mappings":";;;;;;UAoCiB,kBAAA;;;;UAIA,mBAAA;;;;;;;;;UASA,mBAAA;cACH;;;;;;;;;iBAsBE,uBAAA,OACR,iBACL,KAAK,oBAAoB"}

package/dist/tools/runbook-tools.js.map

@@ -1 +1 @@
-{"version":3,"file":"runbook-tools.js","names":[],"sources":["../../src/tools/runbook-tools.ts"],"sourcesContent":["/**\n * Runbook tool (D3) - gated content recall over procedural memory.\n * `runbook_search` finds validated procedures whose text / steps match\n * a task description and returns them **whole** (title line, numbered\n * steps, variables, success criteria), so the model can follow a known\n * workflow file-style instead of re-deriving it. Registered only when\n * the facade opts in (`createMemory({ runbookSearch: true })`) - the\n * default tool surface is unchanged.\n *\n * @packageDocumentation\n */\n\nimport type { Tool } from '@graphorin/core';\nimport { tool } from '@graphorin/tools';\nimport { z } from 'zod';\nimport type { MemoryToolDeps } from './types.js';\n\nconst runbookSearchInputSchema = z.object({\n  query: z.string().min(1).max(512),\n  topK: z.number().int().min(1).max(20).optional(),\n});\nconst runbookSearchOutputSchema = z.object({\n  procedures: z.array(\n    z.object({\n      id: z.string(),\n      text: z.string(),\n      steps: z.array(z.string()).optional(),\n      variables: z.array(z.string()).optional(),\n      successCriteria: z.array(z.string()).optional(),\n      priority: z.number(),\n      score: z.number(),\n    }),\n  ),\n});\n\ntype RunbookSearchInput = z.infer<typeof runbookSearchInputSchema>;\ntype RunbookSearchOutput = z.infer<typeof runbookSearchOutputSchema>;\n\n/**\n * `runbook_search` - find validated procedures matching a task\n * description. Quarantined (unvalidated induced) procedures never\n * surface here: they must not drive actions until validated.\n *\n * @stable\n */\nexport function createRunbookSearchTool(\n  deps: MemoryToolDeps,\n): Tool<RunbookSearchInput, RunbookSearchOutput> {\n  return tool<RunbookSearchInput, RunbookSearchOutput>({\n    name: 'runbook_search',\n    description:\n      'Find a stored, validated procedure (\"runbook\") matching the task at hand - e.g. \"deploy the docs site\" or \"rotate the API key\". Returns whole procedures with their numbered steps, variables, and success criteria so you can follow a known-good workflow instead of improvising. Use BEFORE attempting a multi-step operational task the user may have done with you previously.',\n    inputSchema: runbookSearchInputSchema,\n    outputSchema: runbookSearchOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'procedural'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const hits = await deps.procedural.search(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n      });\n      return {\n        procedures: hits.map((hit) => ({\n          id: hit.record.id,\n          text: hit.record.text,\n          ...(hit.record.steps !== undefined ? { steps: [...hit.record.steps] } : {}),\n          ...(hit.record.variables !== undefined ? { variables: [...hit.record.variables] } : {}),\n          ...(hit.record.successCriteria !== undefined\n            ? { successCriteria: [...hit.record.successCriteria] }\n            : {}),\n          priority: hit.record.priority,\n          score: hit.score,\n        })),\n      };\n    },\n  });\n}\n"],"mappings":";;;;AAiBA,MAAM,2BAA2B,EAAE,OAAO;CACxC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI;CACjC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,UAAU;CACjD,CAAC;AACF,MAAM,4BAA4B,EAAE,OAAO,EACzC,YAAY,EAAE,MACZ,EAAE,OAAO;CACP,IAAI,EAAE,QAAQ;CACd,MAAM,EAAE,QAAQ;CAChB,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,UAAU;CACrC,WAAW,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,UAAU;CACzC,iBAAiB,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,UAAU;CAC/C,UAAU,EAAE,QAAQ;CACpB,OAAO,EAAE,QAAQ;CAClB,CAAC,CACH,EACF,CAAC;;;;;;;;AAYF,SAAgB,wBACd,MAC+C;AAC/C,QAAO,KAA8C;EACnD,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,aAAa;EAC9B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;AAI1C,UAAO,EACL,aAJW,MAAM,KAAK,WAAW,OAAO,OAAO,MAAM,OAAO,EAC5D,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE,EACzD,CAAC,EAEiB,KAAK,SAAS;IAC7B,IAAI,IAAI,OAAO;IACf,MAAM,IAAI,OAAO;IACjB,GAAI,IAAI,OAAO,UAAU,SAAY,EAAE,OAAO,CAAC,GAAG,IAAI,OAAO,MAAM,EAAE,GAAG,EAAE;IAC1E,GAAI,IAAI,OAAO,cAAc,SAAY,EAAE,WAAW,CAAC,GAAG,IAAI,OAAO,UAAU,EAAE,GAAG,EAAE;IACtF,GAAI,IAAI,OAAO,oBAAoB,SAC/B,EAAE,iBAAiB,CAAC,GAAG,IAAI,OAAO,gBAAgB,EAAE,GACpD,EAAE;IACN,UAAU,IAAI,OAAO;IACrB,OAAO,IAAI;IACZ,EAAE,EACJ;;EAEJ,CAAC"}
+{"version":3,"file":"runbook-tools.js","names":[],"sources":["../../src/tools/runbook-tools.ts"],"sourcesContent":["/**\n * Runbook tool (D3) - gated content recall over procedural memory.\n * `runbook_search` finds validated procedures whose text / steps match\n * a task description and returns them **whole** (title line, numbered\n * steps, variables, success criteria), so the model can follow a known\n * workflow file-style instead of re-deriving it. Registered only when\n * the facade opts in (`createMemory({ runbookSearch: true })`) - the\n * default tool surface is unchanged.\n *\n * @packageDocumentation\n */\n\nimport type { Tool } from '@graphorin/core';\nimport { tool } from '@graphorin/tools';\nimport { z } from 'zod';\nimport type { MemoryToolDeps } from './types.js';\n\nconst runbookSearchInputSchema = z.object({\n  query: z.string().min(1).max(512),\n  topK: z.number().int().min(1).max(20).optional(),\n});\nconst runbookSearchOutputSchema = z.object({\n  procedures: z.array(\n    z.object({\n      id: z.string(),\n      text: z.string(),\n      steps: z.array(z.string()).optional(),\n      variables: z.array(z.string()).optional(),\n      successCriteria: z.array(z.string()).optional(),\n      priority: z.number(),\n      score: z.number(),\n    }),\n  ),\n});\n\n/** W-013: explicit interfaces (see fact-tools.ts) - no zod generics in d.ts. */\nexport interface RunbookSearchInput {\n  query: string;\n  topK?: number | undefined;\n}\nexport interface RunbookProcedureHit {\n  id: string;\n  text: string;\n  steps?: string[] | undefined;\n  variables?: string[] | undefined;\n  successCriteria?: string[] | undefined;\n  priority: number;\n  score: number;\n}\nexport interface RunbookSearchOutput {\n  procedures: RunbookProcedureHit[];\n}\n\n// W-013 parity gate (compile-time only, erased from the build and the\n// d.ts): each explicit interface must stay MUTUALLY assignable with its\n// schema's inference - a drifted transcription fails `tsc` right here.\ntype W013Equals<A, B> = A extends B ? (B extends A ? true : false) : false;\ntype W013Assert<T extends true> = T;\ntype _W013Check1 = W013Assert<\n  W013Equals<RunbookSearchInput, z.infer<typeof runbookSearchInputSchema>>\n>;\ntype _W013Check2 = W013Assert<\n  W013Equals<RunbookSearchOutput, z.infer<typeof runbookSearchOutputSchema>>\n>;\n\n/**\n * `runbook_search` - find validated procedures matching a task\n * description. Quarantined (unvalidated induced) procedures never\n * surface here: they must not drive actions until validated.\n *\n * @stable\n */\nexport function createRunbookSearchTool(\n  deps: MemoryToolDeps,\n): Tool<RunbookSearchInput, RunbookSearchOutput> {\n  return tool<RunbookSearchInput, RunbookSearchOutput>({\n    name: 'runbook_search',\n    description:\n      'Find a stored, validated procedure (\"runbook\") matching the task at hand - e.g. \"deploy the docs site\" or \"rotate the API key\". Returns whole procedures with their numbered steps, variables, and success criteria so you can follow a known-good workflow instead of improvising. Use BEFORE attempting a multi-step operational task the user may have done with you previously.',\n    inputSchema: runbookSearchInputSchema,\n    outputSchema: runbookSearchOutputSchema,\n    sideEffectClass: 'read-only',\n    sandboxPolicy: 'none',\n    sensitivity: 'internal',\n    memoryGuardTier: 'pure',\n    tags: ['memory', 'procedural'],\n    async execute(input, ctx) {\n      const scope = await deps.resolveScope(ctx);\n      const hits = await deps.procedural.search(scope, input.query, {\n        ...(input.topK !== undefined ? { topK: input.topK } : {}),\n      });\n      return {\n        procedures: hits.map((hit) => ({\n          id: hit.record.id,\n          text: hit.record.text,\n          ...(hit.record.steps !== undefined ? { steps: [...hit.record.steps] } : {}),\n          ...(hit.record.variables !== undefined ? { variables: [...hit.record.variables] } : {}),\n          ...(hit.record.successCriteria !== undefined\n            ? { successCriteria: [...hit.record.successCriteria] }\n            : {}),\n          priority: hit.record.priority,\n          score: hit.score,\n        })),\n      };\n    },\n  });\n}\n"],"mappings":";;;;AAiBA,MAAM,2BAA2B,EAAE,OAAO;CACxC,OAAO,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI;CACjC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,UAAU;CACjD,CAAC;AACF,MAAM,4BAA4B,EAAE,OAAO,EACzC,YAAY,EAAE,MACZ,EAAE,OAAO;CACP,IAAI,EAAE,QAAQ;CACd,MAAM,EAAE,QAAQ;CAChB,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,UAAU;CACrC,WAAW,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,UAAU;CACzC,iBAAiB,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,UAAU;CAC/C,UAAU,EAAE,QAAQ;CACpB,OAAO,EAAE,QAAQ;CAClB,CAAC,CACH,EACF,CAAC;;;;;;;;AAuCF,SAAgB,wBACd,MAC+C;AAC/C,QAAO,KAA8C;EACnD,MAAM;EACN,aACE;EACF,aAAa;EACb,cAAc;EACd,iBAAiB;EACjB,eAAe;EACf,aAAa;EACb,iBAAiB;EACjB,MAAM,CAAC,UAAU,aAAa;EAC9B,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,QAAQ,MAAM,KAAK,aAAa,IAAI;AAI1C,UAAO,EACL,aAJW,MAAM,KAAK,WAAW,OAAO,OAAO,MAAM,OAAO,EAC5D,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,MAAM,GAAG,EAAE,EACzD,CAAC,EAEiB,KAAK,SAAS;IAC7B,IAAI,IAAI,OAAO;IACf,MAAM,IAAI,OAAO;IACjB,GAAI,IAAI,OAAO,UAAU,SAAY,EAAE,OAAO,CAAC,GAAG,IAAI,OAAO,MAAM,EAAE,GAAG,EAAE;IAC1E,GAAI,IAAI,OAAO,cAAc,SAAY,EAAE,WAAW,CAAC,GAAG,IAAI,OAAO,UAAU,EAAE,GAAG,EAAE;IACtF,GAAI,IAAI,OAAO,oBAAoB,SAC/B,EAAE,iBAAiB,CAAC,GAAG,IAAI,OAAO,gBAAgB,EAAE,GACpD,EAAE;IACN,UAAU,IAAI,OAAO;IACrB,OAAO,IAAI;IACZ,EAAE,EACJ;;EAEJ,CAAC"}

package/dist/tools/types.d.ts

@@ -20,7 +20,7 @@ import { SessionScope } from "@graphorin/core";
 type ScopeResolver = (ctx: _graphorin_core0.ToolExecutionContext<unknown>) => SessionScope | Promise<SessionScope>;
 /**
  * Dependency bundle threaded into every memory tool. Exposed
- * separately from the {@link Tool} surface so the executor can scope
+ * separately from the `Tool` surface so the executor can scope
  * the dependencies per call without leaking the wider memory facade
  * into the tool author surface.
  *

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphorin/memory",
-  "version": "0.6.1",
+  "version": "0.7.0",
   "description": "Six-tier memory system for the Graphorin framework: createMemory() facade with working / session / episodic / semantic / procedural / shared sub-modules, eleven memory tools wired into @graphorin/tools, hybrid vector + FTS5 search composed through Reciprocal Rank Fusion (k=60 default) with a pluggable reranker hook, a multi-stage conflict resolution pipeline (exact dedup → embedding three-zone → heuristic regex → subject/predicate → defer-to-deep) with an English locale pack default + plug-in locales, an embedder migration runner with three coexistence policies (lock-on-first / multi-active / auto-migrate), per-record embedder_id enforcement, multi-agent attribution, append-only writes with soft-delete + supersede semantics, default-on bi-temporal storage, provenance + quarantine safety gate for synthesized memory, AISpan emission for every operation, and tier-aware memory-modification guard wiring.",
   "license": "MIT",
   "author": "Oleksiy Stepurenko",
@@ -35,8 +35,9 @@
     "multi-agent"
   ],
   "type": "module",
+  "sideEffects": false,
   "engines": {
-    "node": ">=22.0.0"
+    "node": ">=22.12.0"
   },
   "main": "./dist/index.js",
   "module": "./dist/index.js",
@@ -44,49 +45,50 @@
   "exports": {
     ".": {
       "types": "./dist/index.d.ts",
-      "import": "./dist/index.js"
+      "default": "./dist/index.js"
     },
     "./facade": {
       "types": "./dist/facade.d.ts",
-      "import": "./dist/facade.js"
+      "default": "./dist/facade.js"
     },
     "./tiers": {
       "types": "./dist/tiers/index.d.ts",
-      "import": "./dist/tiers/index.js"
+      "default": "./dist/tiers/index.js"
     },
     "./tools": {
       "types": "./dist/tools/index.d.ts",
-      "import": "./dist/tools/index.js"
+      "default": "./dist/tools/index.js"
     },
     "./search": {
       "types": "./dist/search/index.d.ts",
-      "import": "./dist/search/index.js"
+      "default": "./dist/search/index.js"
     },
     "./conflict": {
       "types": "./dist/conflict/index.d.ts",
-      "import": "./dist/conflict/index.js"
+      "default": "./dist/conflict/index.js"
     },
     "./migration": {
       "types": "./dist/migration/index.d.ts",
-      "import": "./dist/migration/index.js"
+      "default": "./dist/migration/index.js"
     },
     "./errors": {
       "types": "./dist/errors/index.d.ts",
-      "import": "./dist/errors/index.js"
+      "default": "./dist/errors/index.js"
     },
     "./package.json": "./package.json"
   },
   "files": [
     "dist",
+    "src",
     "README.md",
     "CHANGELOG.md",
     "LICENSE"
   ],
   "dependencies": {
-    "@graphorin/core": "0.6.1",
-    "@graphorin/observability": "0.6.1",
-    "@graphorin/security": "0.6.1",
-    "@graphorin/tools": "0.6.1"
+    "@graphorin/core": "0.7.0",
+    "@graphorin/observability": "0.7.0",
+    "@graphorin/security": "0.7.0",
+    "@graphorin/tools": "0.7.0"
   },
   "peerDependencies": {
     "zod": "^3.23.0 || ^4.0.0"
@@ -105,9 +107,8 @@
     "better-sqlite3": "^12.9.0",
     "fast-check": "^3.23.0",
     "zod": "^3.25.0",
-    "@graphorin/store-sqlite": "0.6.1",
-    "@graphorin/embedder-transformersjs": "0.6.1",
-    "@graphorin/triggers": "0.6.1"
+    "@graphorin/store-sqlite": "0.7.0",
+    "@graphorin/triggers": "0.7.0"
   },
   "scripts": {
     "build": "tsdown",

package/src/conflict/index.ts

@@ -0,0 +1,29 @@
+/**
+ * Public surface of the multi-stage conflict resolution pipeline
+ * shipped in `@graphorin/memory` Phase 10b (DEC-117 / ADR-018 ext /
+ * RB-02).
+ *
+ * @packageDocumentation
+ */
+
+export * from './locale-packs/index.js';
+export {
+  _resetBypassWarningForTesting,
+  createConflictPipeline,
+  runConflictPipeline,
+} from './pipeline.js';
+export {
+  type ConflictDecision,
+  type ConflictPipeline,
+  type ConflictPipelineDeps,
+  type ConflictPipelineOptions,
+  type ConflictStage,
+  type ConflictThresholds,
+  DEFAULT_CONFLICT_THRESHOLDS,
+  type PipelineStage,
+  type ReconcileAction,
+  type ReconcileDecision,
+  reconcileToConflictDecision,
+  type StageContext,
+  type StageOutcome,
+} from './types.js';