@graphorin/memory 0.5.0

package/dist/consolidator/noise-filter.js

@@ -0,0 +1,173 @@
+//#region src/consolidator/noise-filter.ts
+const MIN_LENGTH_DEFAULT = 10;
+const MIN_LENGTH_MINIMAL = 4;
+const MAX_LENGTH = 1e4;
+const STOP_WORD_RATIO = .8;
+const STOP_WORDS = new Set([
+	"a",
+	"an",
+	"and",
+	"are",
+	"as",
+	"at",
+	"be",
+	"but",
+	"by",
+	"can",
+	"do",
+	"does",
+	"for",
+	"from",
+	"had",
+	"has",
+	"have",
+	"he",
+	"her",
+	"his",
+	"i",
+	"if",
+	"in",
+	"is",
+	"it",
+	"its",
+	"me",
+	"my",
+	"no",
+	"not",
+	"of",
+	"on",
+	"or",
+	"our",
+	"she",
+	"so",
+	"that",
+	"the",
+	"their",
+	"them",
+	"they",
+	"this",
+	"to",
+	"too",
+	"us",
+	"was",
+	"we",
+	"were",
+	"what",
+	"when",
+	"where",
+	"which",
+	"who",
+	"will",
+	"with",
+	"would",
+	"yes",
+	"you",
+	"your"
+]);
+/**
+* Run the configured filter chain against the supplied messages.
+* Filters short-circuit at the first hit so the cheapest checks
+* always run first.
+*
+* @stable
+*/
+function applyNoiseFilters(messages, presets = ["default"]) {
+	if (presets.length === 0 || presets.every((p) => p === "none")) return {
+		kept: messages,
+		droppedCount: 0,
+		droppedByReason: Object.freeze({})
+	};
+	const minimal = presets.includes("minimal") && !presets.includes("default");
+	const minLength = minimal ? MIN_LENGTH_MINIMAL : MIN_LENGTH_DEFAULT;
+	const droppedByReason = {};
+	const kept = [];
+	const recentTexts = [];
+	for (const record of messages) {
+		const reason = classify(record.message, recentTexts, minLength, minimal);
+		if (reason === null) {
+			kept.push(record);
+			const text = renderText(record.message);
+			if (text.length > 0) {
+				recentTexts.push(text);
+				if (recentTexts.length > 5) recentTexts.shift();
+			}
+		} else droppedByReason[reason] = (droppedByReason[reason] ?? 0) + 1;
+	}
+	return {
+		kept,
+		droppedCount: messages.length - kept.length,
+		droppedByReason: Object.freeze({ ...droppedByReason })
+	};
+}
+function classify(message, recentTexts, minLength, minimal) {
+	if (message.role === "system") return "role-system";
+	if (message.role === "tool" && minimal) return null;
+	const trimmed = renderText(message).trim();
+	if (trimmed.length === 0) return "empty";
+	if (trimmed.length < minLength) return "too-short";
+	if (trimmed.length > MAX_LENGTH) return "too-long";
+	if (looksLikeCodeOrJson(trimmed)) return "code-block";
+	if (!minimal && stopWordRatio(trimmed) > STOP_WORD_RATIO) return "stop-word-ratio";
+	if (!minimal && isNearDuplicate(trimmed, recentTexts)) return "near-duplicate";
+	return null;
+}
+/**
+* Render a message as a single text blob for the heuristic filters.
+*
+* @internal
+*/
+function renderText(message) {
+	if (message.role === "system") return message.content;
+	const c = message.content;
+	if (typeof c === "string") return c;
+	let out = "";
+	for (const part of c) if (part.type === "text" || part.type === "reasoning") out += `${part.text} `;
+	return out.trim();
+}
+function looksLikeCodeOrJson(text) {
+	if (text.startsWith("```")) return true;
+	const trimmed = text.trim();
+	if (trimmed.startsWith("{") && trimmed.endsWith("}") || trimmed.startsWith("[") && trimmed.endsWith("]")) try {
+		JSON.parse(trimmed);
+		return true;
+	} catch {}
+	return false;
+}
+function stopWordRatio(text) {
+	const tokens = text.toLowerCase().split(/[^a-z0-9]+/u).filter((t) => t.length > 0);
+	if (tokens.length === 0) return 0;
+	let stop = 0;
+	for (const t of tokens) if (STOP_WORDS.has(t)) stop += 1;
+	return stop / tokens.length;
+}
+function isNearDuplicate(text, recent) {
+	const normalised = text.replace(/\s+/gu, " ").toLowerCase().trim();
+	for (const prior of recent) {
+		const priorNorm = prior.replace(/\s+/gu, " ").toLowerCase().trim();
+		if (priorNorm.length === 0) continue;
+		if (priorNorm === normalised) return true;
+		if (trigramSimilarity(priorNorm, normalised) >= .9) return true;
+	}
+	return false;
+}
+function trigramSimilarity(a, b) {
+	const setA = trigramSet(a);
+	const setB = trigramSet(b);
+	if (setA.size === 0 || setB.size === 0) return 0;
+	let inter = 0;
+	for (const t of setA) if (setB.has(t)) inter += 1;
+	return inter / Math.max(setA.size, setB.size);
+}
+function trigramSet(text) {
+	const out = /* @__PURE__ */ new Set();
+	if (text.length < 3) {
+		out.add(text);
+		return out;
+	}
+	for (let i = 0; i < text.length - 2; i++) out.add(text.slice(i, i + 3));
+	return out;
+}
+
+//#endregion
+export { applyNoiseFilters, renderText };
+//# sourceMappingURL=noise-filter.js.map

package/dist/consolidator/noise-filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"noise-filter.js","names":["droppedByReason: Record<string, number>","kept: SessionMessageRecord[]","recentTexts: string[]"],"sources":["../../src/consolidator/noise-filter.ts"],"sourcesContent":["/**\n * Built-in noise filter pipeline. Runs before LLM extraction in the\n * standard phase + every light-phase invocation. The defaults are\n * heuristic-only (no LLM); adapters may extend the pipeline through\n * `noiseFilters: [...customFilters]` once the public surface is wired\n * (post-MVP — DEC-134 carve-out).\n *\n * @packageDocumentation\n */\n\nimport type { Message } from '@graphorin/core';\nimport type { SessionMessageRecord } from '../internal/storage-adapter.js';\n\n/**\n * Bundle level surfaced by {@link applyNoiseFilters}. The runtime\n * uses these to log + report `noise_filtered_count` per phase.\n *\n * @stable\n */\nexport type NoiseFilterPreset = 'default' | 'minimal' | 'none';\n\nconst MIN_LENGTH_DEFAULT = 10;\nconst MIN_LENGTH_MINIMAL = 4;\nconst MAX_LENGTH = 10_000;\nconst STOP_WORD_RATIO = 0.8;\nconst STOP_WORDS = new Set([\n  'a',\n  'an',\n  'and',\n  'are',\n  'as',\n  'at',\n  'be',\n  'but',\n  'by',\n  'can',\n  'do',\n  'does',\n  'for',\n  'from',\n  'had',\n  'has',\n  'have',\n  'he',\n  'her',\n  'his',\n  'i',\n  'if',\n  'in',\n  'is',\n  'it',\n  'its',\n  'me',\n  'my',\n  'no',\n  'not',\n  'of',\n  'on',\n  'or',\n  'our',\n  'she',\n  'so',\n  'that',\n  'the',\n  'their',\n  'them',\n  'they',\n  'this',\n  'to',\n  'too',\n  'us',\n  'was',\n  'we',\n  'were',\n  'what',\n  'when',\n  'where',\n  'which',\n  'who',\n  'will',\n  'with',\n  'would',\n  'yes',\n  'you',\n  'your',\n]);\n\n/**\n * Result returned by {@link applyNoiseFilters}.\n *\n * @stable\n */\nexport interface NoiseFilterResult {\n  readonly kept: ReadonlyArray<SessionMessageRecord>;\n  readonly droppedCount: number;\n  readonly droppedByReason: Readonly<Record<string, number>>;\n}\n\n/**\n * Run the configured filter chain against the supplied messages.\n * Filters short-circuit at the first hit so the cheapest checks\n * always run first.\n *\n * @stable\n */\nexport function applyNoiseFilters(\n  messages: ReadonlyArray<SessionMessageRecord>,\n  presets: ReadonlyArray<NoiseFilterPreset> = ['default'],\n): NoiseFilterResult {\n  if (presets.length === 0 || presets.every((p) => p === 'none')) {\n    return { kept: messages, droppedCount: 0, droppedByReason: Object.freeze({}) };\n  }\n  const minimal = presets.includes('minimal') && !presets.includes('default');\n  const minLength = minimal ? MIN_LENGTH_MINIMAL : MIN_LENGTH_DEFAULT;\n  const droppedByReason: Record<string, number> = {};\n  const kept: SessionMessageRecord[] = [];\n  const recentTexts: string[] = [];\n\n  for (const record of messages) {\n    const reason = classify(record.message, recentTexts, minLength, minimal);\n    if (reason === null) {\n      kept.push(record);\n      const text = renderText(record.message);\n      if (text.length > 0) {\n        recentTexts.push(text);\n        if (recentTexts.length > 5) recentTexts.shift();\n      }\n    } else {\n      droppedByReason[reason] = (droppedByReason[reason] ?? 0) + 1;\n    }\n  }\n  return {\n    kept,\n    droppedCount: messages.length - kept.length,\n    droppedByReason: Object.freeze({ ...droppedByReason }),\n  };\n}\n\nfunction classify(\n  message: Message,\n  recentTexts: ReadonlyArray<string>,\n  minLength: number,\n  minimal: boolean,\n): string | null {\n  if (message.role === 'system') return 'role-system';\n  if (message.role === 'tool' && minimal) return null;\n  const text = renderText(message);\n  const trimmed = text.trim();\n  if (trimmed.length === 0) return 'empty';\n  if (trimmed.length < minLength) return 'too-short';\n  if (trimmed.length > MAX_LENGTH) return 'too-long';\n  if (looksLikeCodeOrJson(trimmed)) return 'code-block';\n  if (!minimal && stopWordRatio(trimmed) > STOP_WORD_RATIO) return 'stop-word-ratio';\n  if (!minimal && isNearDuplicate(trimmed, recentTexts)) return 'near-duplicate';\n  return null;\n}\n\n/**\n * Render a message as a single text blob for the heuristic filters.\n *\n * @internal\n */\nexport function renderText(message: Message): string {\n  if (message.role === 'system') return message.content;\n  const c = message.content;\n  if (typeof c === 'string') return c;\n  let out = '';\n  for (const part of c) {\n    if (part.type === 'text' || part.type === 'reasoning') {\n      out += `${part.text} `;\n    }\n  }\n  return out.trim();\n}\n\nfunction looksLikeCodeOrJson(text: string): boolean {\n  if (text.startsWith('```')) return true;\n  const trimmed = text.trim();\n  if (\n    (trimmed.startsWith('{') && trimmed.endsWith('}')) ||\n    (trimmed.startsWith('[') && trimmed.endsWith(']'))\n  ) {\n    try {\n      JSON.parse(trimmed);\n      return true;\n    } catch {\n      // Not actually JSON — fall through.\n    }\n  }\n  return false;\n}\n\nfunction stopWordRatio(text: string): number {\n  const tokens = text\n    .toLowerCase()\n    .split(/[^a-z0-9]+/u)\n    .filter((t) => t.length > 0);\n  if (tokens.length === 0) return 0;\n  let stop = 0;\n  for (const t of tokens) if (STOP_WORDS.has(t)) stop += 1;\n  return stop / tokens.length;\n}\n\nfunction isNearDuplicate(text: string, recent: ReadonlyArray<string>): boolean {\n  const normalised = text.replace(/\\s+/gu, ' ').toLowerCase().trim();\n  for (const prior of recent) {\n    const priorNorm = prior.replace(/\\s+/gu, ' ').toLowerCase().trim();\n    if (priorNorm.length === 0) continue;\n    if (priorNorm === normalised) return true;\n    const similarity = trigramSimilarity(priorNorm, normalised);\n    if (similarity >= 0.9) return true;\n  }\n  return false;\n}\n\nfunction trigramSimilarity(a: string, b: string): number {\n  const setA = trigramSet(a);\n  const setB = trigramSet(b);\n  if (setA.size === 0 || setB.size === 0) return 0;\n  let inter = 0;\n  for (const t of setA) if (setB.has(t)) inter += 1;\n  return inter / Math.max(setA.size, setB.size);\n}\n\nfunction trigramSet(text: string): Set<string> {\n  const out = new Set<string>();\n  if (text.length < 3) {\n    out.add(text);\n    return out;\n  }\n  for (let i = 0; i < text.length - 2; i++) {\n    out.add(text.slice(i, i + 3));\n  }\n  return out;\n}\n"],"mappings":";AAqBA,MAAM,qBAAqB;AAC3B,MAAM,qBAAqB;AAC3B,MAAM,aAAa;AACnB,MAAM,kBAAkB;AACxB,MAAM,aAAa,IAAI,IAAI;CACzB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACD,CAAC;;;;;;;;AAoBF,SAAgB,kBACd,UACA,UAA4C,CAAC,UAAU,EACpC;AACnB,KAAI,QAAQ,WAAW,KAAK,QAAQ,OAAO,MAAM,MAAM,OAAO,CAC5D,QAAO;EAAE,MAAM;EAAU,cAAc;EAAG,iBAAiB,OAAO,OAAO,EAAE,CAAC;EAAE;CAEhF,MAAM,UAAU,QAAQ,SAAS,UAAU,IAAI,CAAC,QAAQ,SAAS,UAAU;CAC3E,MAAM,YAAY,UAAU,qBAAqB;CACjD,MAAMA,kBAA0C,EAAE;CAClD,MAAMC,OAA+B,EAAE;CACvC,MAAMC,cAAwB,EAAE;AAEhC,MAAK,MAAM,UAAU,UAAU;EAC7B,MAAM,SAAS,SAAS,OAAO,SAAS,aAAa,WAAW,QAAQ;AACxE,MAAI,WAAW,MAAM;AACnB,QAAK,KAAK,OAAO;GACjB,MAAM,OAAO,WAAW,OAAO,QAAQ;AACvC,OAAI,KAAK,SAAS,GAAG;AACnB,gBAAY,KAAK,KAAK;AACtB,QAAI,YAAY,SAAS,EAAG,aAAY,OAAO;;QAGjD,iBAAgB,WAAW,gBAAgB,WAAW,KAAK;;AAG/D,QAAO;EACL;EACA,cAAc,SAAS,SAAS,KAAK;EACrC,iBAAiB,OAAO,OAAO,EAAE,GAAG,iBAAiB,CAAC;EACvD;;AAGH,SAAS,SACP,SACA,aACA,WACA,SACe;AACf,KAAI,QAAQ,SAAS,SAAU,QAAO;AACtC,KAAI,QAAQ,SAAS,UAAU,QAAS,QAAO;CAE/C,MAAM,UADO,WAAW,QAAQ,CACX,MAAM;AAC3B,KAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,KAAI,QAAQ,SAAS,UAAW,QAAO;AACvC,KAAI,QAAQ,SAAS,WAAY,QAAO;AACxC,KAAI,oBAAoB,QAAQ,CAAE,QAAO;AACzC,KAAI,CAAC,WAAW,cAAc,QAAQ,GAAG,gBAAiB,QAAO;AACjE,KAAI,CAAC,WAAW,gBAAgB,SAAS,YAAY,CAAE,QAAO;AAC9D,QAAO;;;;;;;AAQT,SAAgB,WAAW,SAA0B;AACnD,KAAI,QAAQ,SAAS,SAAU,QAAO,QAAQ;CAC9C,MAAM,IAAI,QAAQ;AAClB,KAAI,OAAO,MAAM,SAAU,QAAO;CAClC,IAAI,MAAM;AACV,MAAK,MAAM,QAAQ,EACjB,KAAI,KAAK,SAAS,UAAU,KAAK,SAAS,YACxC,QAAO,GAAG,KAAK,KAAK;AAGxB,QAAO,IAAI,MAAM;;AAGnB,SAAS,oBAAoB,MAAuB;AAClD,KAAI,KAAK,WAAW,MAAM,CAAE,QAAO;CACnC,MAAM,UAAU,KAAK,MAAM;AAC3B,KACG,QAAQ,WAAW,IAAI,IAAI,QAAQ,SAAS,IAAI,IAChD,QAAQ,WAAW,IAAI,IAAI,QAAQ,SAAS,IAAI,CAEjD,KAAI;AACF,OAAK,MAAM,QAAQ;AACnB,SAAO;SACD;AAIV,QAAO;;AAGT,SAAS,cAAc,MAAsB;CAC3C,MAAM,SAAS,KACZ,aAAa,CACb,MAAM,cAAc,CACpB,QAAQ,MAAM,EAAE,SAAS,EAAE;AAC9B,KAAI,OAAO,WAAW,EAAG,QAAO;CAChC,IAAI,OAAO;AACX,MAAK,MAAM,KAAK,OAAQ,KAAI,WAAW,IAAI,EAAE,CAAE,SAAQ;AACvD,QAAO,OAAO,OAAO;;AAGvB,SAAS,gBAAgB,MAAc,QAAwC;CAC7E,MAAM,aAAa,KAAK,QAAQ,SAAS,IAAI,CAAC,aAAa,CAAC,MAAM;AAClE,MAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,YAAY,MAAM,QAAQ,SAAS,IAAI,CAAC,aAAa,CAAC,MAAM;AAClE,MAAI,UAAU,WAAW,EAAG;AAC5B,MAAI,cAAc,WAAY,QAAO;AAErC,MADmB,kBAAkB,WAAW,WAAW,IACzC,GAAK,QAAO;;AAEhC,QAAO;;AAGT,SAAS,kBAAkB,GAAW,GAAmB;CACvD,MAAM,OAAO,WAAW,EAAE;CAC1B,MAAM,OAAO,WAAW,EAAE;AAC1B,KAAI,KAAK,SAAS,KAAK,KAAK,SAAS,EAAG,QAAO;CAC/C,IAAI,QAAQ;AACZ,MAAK,MAAM,KAAK,KAAM,KAAI,KAAK,IAAI,EAAE,CAAE,UAAS;AAChD,QAAO,QAAQ,KAAK,IAAI,KAAK,MAAM,KAAK,KAAK;;AAG/C,SAAS,WAAW,MAA2B;CAC7C,MAAM,sBAAM,IAAI,KAAa;AAC7B,KAAI,KAAK,SAAS,GAAG;AACnB,MAAI,IAAI,KAAK;AACb,SAAO;;AAET,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,IACnC,KAAI,IAAI,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC;AAE/B,QAAO"}

package/dist/consolidator/phases/deep.d.ts

@@ -0,0 +1,4 @@
+import "../../internal/storage-adapter.js";
+import "../types.js";
+import "../budget.js";
+import { Provider, SessionScope, Tracer } from "@graphorin/core";

package/dist/consolidator/phases/deep.js

@@ -0,0 +1,198 @@
+import { withMemorySpan } from "../../internal/spans.js";
+
+//#region src/consolidator/phases/deep.ts
+const JUDGE_PROMPT = [
+	"You are a conflict-resolution judge for a long-running personal-assistant memory.",
+	"Decide whether a candidate fact contradicts, dedups, or is unrelated to an existing fact.",
+	"Return strictly JSON: { \"decision\": \"supersede\" | \"dedup\" | \"admit\", \"reason\": string }.",
+	"Use \"supersede\" only when the candidate clearly replaces the older fact.",
+	"Use \"dedup\" when both convey the same information.",
+	"Use \"admit\" when the facts are independent or you are unsure."
+].join(" ");
+/** Run the deep phase. */
+async function runDeepPhase(deps) {
+	return withMemorySpan(deps.tracer, "memory.consolidate.deep", deps.scope, {
+		"consolidator.phase": "deep",
+		"consolidator.tier": deps.tier,
+		"consolidator.deep_model": deps.deepModel ?? deps.provider.modelId
+	}, async (span) => {
+		const startedAt = (typeof deps.now === "function" ? deps.now : Date.now)();
+		const conflicts = deps.store.conflicts;
+		if (conflicts === void 0) {
+			span.setAttributes({
+				"consolidator.deep.skipped": "no-conflict-store",
+				"consolidator.duration_ms": Math.max(0, (typeof deps.now === "function" ? deps.now : Date.now)() - startedAt),
+				"consolidator.facts_extracted": 0,
+				"consolidator.budget_used_usd": 0
+			});
+			return makeOutcome("completed", { conflictsResolved: 0 });
+		}
+		const semantic = deps.store.semantic;
+		const pending = await conflicts.listPending(deps.scope, deps.maxConflictsPerRun);
+		span.setAttributes({ "consolidator.deep.pending_count": pending.length });
+		if (pending.length === 0) {
+			span.setAttributes({
+				"consolidator.duration_ms": Math.max(0, (typeof deps.now === "function" ? deps.now : Date.now)() - startedAt),
+				"consolidator.facts_extracted": 0,
+				"consolidator.budget_used_usd": 0
+			});
+			return makeOutcome("completed", { conflictsResolved: 0 });
+		}
+		let resolved = 0;
+		let factsUpdated = 0;
+		let totalTokens = 0;
+		let totalCost = 0;
+		const recordJudgeFailure = async (r) => {
+			if (r.attemptedAt !== null) await conflicts.markResolved(r.id, "judge-unparseable");
+			else if (typeof conflicts.markAttempted === "function") await conflicts.markAttempted(r.id);
+		};
+		for (const row of pending) {
+			if (deps.budget.snapshot().paused) break;
+			const candidateText = row.candidateText;
+			const conflictingId = row.conflictingIds[0] ?? null;
+			let existingText = null;
+			if (conflictingId !== null && typeof semantic.get === "function") existingText = (await semantic.get(conflictingId))?.text ?? null;
+			const request = buildJudgeRequest(deps, candidateText, existingText);
+			let response;
+			try {
+				response = await deps.provider.generate(request);
+			} catch (err) {
+				span.recordException(err);
+				await recordJudgeFailure(row);
+				continue;
+			}
+			const usage = response.usage;
+			const tokens = (usage.promptTokens ?? 0) + (usage.completionTokens ?? 0) + (usage.reasoningTokens ?? 0);
+			const cost = deps.priceUsage?.({
+				promptTokens: usage.promptTokens,
+				completionTokens: usage.completionTokens
+			}) ?? 0;
+			totalTokens += tokens;
+			totalCost += cost;
+			deps.budget.record({
+				phase: "deep",
+				tokens,
+				costUsd: cost
+			});
+			const judge = parseJudge(response.text);
+			if (judge === null) {
+				await recordJudgeFailure(row);
+				continue;
+			}
+			if (judge.decision === "supersede" && conflictingId !== null) {
+				if (typeof semantic.get === "function") {
+					const candidateFact = await semantic.get(row.factId);
+					if (candidateFact !== null) {
+						await semantic.supersede(conflictingId, candidateFact, judge.reason);
+						factsUpdated += 1;
+					}
+				}
+				await conflicts.markResolved(row.id, "supersede");
+			} else if (judge.decision === "dedup" && conflictingId !== null) {
+				if (typeof semantic.purge === "function") await semantic.purge(row.factId, judge.reason);
+				else if (typeof semantic.forget === "function") await semantic.forget(row.factId, judge.reason);
+				factsUpdated += 1;
+				await conflicts.markResolved(row.id, "dedup");
+			} else await conflicts.markResolved(row.id, "admit");
+			resolved += 1;
+		}
+		const snapshot = deps.budget.snapshot();
+		span.setAttributes({
+			"consolidator.duration_ms": Math.max(0, (typeof deps.now === "function" ? deps.now : Date.now)() - startedAt),
+			"consolidator.facts_extracted": factsUpdated,
+			"consolidator.budget_used_usd": totalCost,
+			"consolidator.deep.resolved": resolved,
+			"consolidator.deep.facts_updated": factsUpdated,
+			"consolidator.deep.tokens.total": totalTokens,
+			"consolidator.deep.cost.estimate.usd": totalCost,
+			"consolidator.budget.remaining.tokens": snapshot.tokensRemaining,
+			"consolidator.budget.remaining.usd": snapshot.costRemaining
+		});
+		return {
+			phase: "deep",
+			status: "completed",
+			factsCreated: 0,
+			factsUpdated,
+			conflictsResolved: resolved,
+			episodesFormed: 0,
+			insightsCreated: 0,
+			noiseFilteredCount: 0,
+			emptyExtractions: 0,
+			llmTokensUsed: totalTokens,
+			llmCostUsd: totalCost,
+			errorMessage: null
+		};
+	});
+}
+function buildJudgeRequest(deps, candidateText, existingText) {
+	return {
+		messages: [{
+			role: "user",
+			content: [`Candidate fact: ${candidateText}`, existingText !== null ? `Existing fact: ${existingText}` : "Existing fact: (unknown)"].join("\n")
+		}],
+		systemMessage: JUDGE_PROMPT,
+		temperature: 0,
+		maxTokens: 256,
+		metadata: {
+			userId: deps.scope.userId,
+			...deps.scope.sessionId !== void 0 ? { sessionId: deps.scope.sessionId } : {},
+			...deps.scope.agentId !== void 0 ? { agentId: deps.scope.agentId } : {}
+		},
+		outputType: { kind: "structured" }
+	};
+}
+function parseJudge(text) {
+	if (text === void 0 || text.length === 0) return null;
+	const candidate = stripFence(text).trim();
+	if (candidate.length === 0) return null;
+	let parsed;
+	try {
+		parsed = JSON.parse(candidate);
+	} catch {
+		const slice = sliceJsonObject(candidate);
+		if (slice === null) return null;
+		try {
+			parsed = JSON.parse(slice);
+		} catch {
+			return null;
+		}
+	}
+	if (parsed === null || typeof parsed !== "object") return null;
+	const obj = parsed;
+	const decision = obj.decision;
+	if (decision !== "supersede" && decision !== "dedup" && decision !== "admit") return null;
+	return {
+		decision,
+		reason: typeof obj.reason === "string" ? obj.reason : "unspecified"
+	};
+}
+function stripFence(text) {
+	return /^```[^\n]*\n([\s\S]*?)\n```/u.exec(text.trim())?.[1] ?? text;
+}
+function sliceJsonObject(text) {
+	const start = text.indexOf("{");
+	const end = text.lastIndexOf("}");
+	if (start < 0 || end < start) return null;
+	return text.slice(start, end + 1);
+}
+function makeOutcome(status, overrides) {
+	return {
+		phase: "deep",
+		status,
+		factsCreated: 0,
+		factsUpdated: 0,
+		conflictsResolved: 0,
+		episodesFormed: 0,
+		insightsCreated: 0,
+		noiseFilteredCount: 0,
+		emptyExtractions: 0,
+		llmTokensUsed: 0,
+		llmCostUsd: null,
+		errorMessage: null,
+		...overrides
+	};
+}
+
+//#endregion
+export { runDeepPhase };
+//# sourceMappingURL=deep.js.map

package/dist/consolidator/phases/deep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deep.js","names":["existingText: string | null","response: Awaited<ReturnType<Provider['generate']>>","parsed: unknown"],"sources":["../../../src/consolidator/phases/deep.ts"],"sourcesContent":["/**\n * Deep phase — minimum-viable drain of `conflict_check_pending`. The\n * MVP scope is exactly the RB-02 cross-cut: read every queued\n * candidate, ask the configured deep-tier provider to choose between\n * `dedup` / `supersede` / `admit`, apply the resolution, and clear\n * the row.\n *\n * Reflection / fact evolution / sleeptime updates are out of scope\n * (deferred per Phase 10c § Out of scope).\n *\n * @packageDocumentation\n */\n\nimport type { Provider, ProviderRequest, SessionScope, Tracer } from '@graphorin/core';\nimport { withMemorySpan } from '../../internal/spans.js';\nimport type {\n  ConsolidatorMemoryStoreExt,\n  MemoryStoreAdapter,\n} from '../../internal/storage-adapter.js';\nimport type { BudgetTracker } from '../budget.js';\nimport type { PhaseOutcome } from '../types.js';\n\n/** Inputs accepted by {@link runDeepPhase}. */\nexport interface DeepPhaseDeps {\n  readonly store: MemoryStoreAdapter;\n  readonly consolidatorStore: ConsolidatorMemoryStoreExt | null;\n  readonly provider: Provider;\n  readonly tracer: Tracer;\n  readonly scope: SessionScope;\n  readonly deepModel: string | null;\n  readonly maxConflictsPerRun: number;\n  readonly budget: BudgetTracker;\n  readonly priceUsage?: (usage: { promptTokens: number; completionTokens: number }) => number;\n  readonly tier: 'standard' | 'full' | 'custom';\n  /** Override the wall clock — used by tests + the runtime clock seam. */\n  readonly now?: () => number;\n}\n\nconst JUDGE_PROMPT = [\n  'You are a conflict-resolution judge for a long-running personal-assistant memory.',\n  'Decide whether a candidate fact contradicts, dedups, or is unrelated to an existing fact.',\n  'Return strictly JSON: { \"decision\": \"supersede\" | \"dedup\" | \"admit\", \"reason\": string }.',\n  'Use \"supersede\" only when the candidate clearly replaces the older fact.',\n  'Use \"dedup\" when both convey the same information.',\n  'Use \"admit\" when the facts are independent or you are unsure.',\n].join(' ');\n\ninterface JudgeOutcome {\n  readonly decision: 'supersede' | 'dedup' | 'admit';\n  readonly reason: string;\n}\n\n/** Run the deep phase. */\nexport async function runDeepPhase(deps: DeepPhaseDeps): Promise<PhaseOutcome> {\n  return withMemorySpan(\n    deps.tracer,\n    'memory.consolidate.deep',\n    deps.scope,\n    {\n      'consolidator.phase': 'deep',\n      'consolidator.tier': deps.tier,\n      'consolidator.deep_model': deps.deepModel ?? deps.provider.modelId,\n    },\n    async (span) => {\n      const startedAt = (typeof deps.now === 'function' ? deps.now : Date.now)();\n      const conflicts = deps.store.conflicts;\n      if (conflicts === undefined) {\n        span.setAttributes({\n          'consolidator.deep.skipped': 'no-conflict-store',\n          'consolidator.duration_ms': Math.max(\n            0,\n            (typeof deps.now === 'function' ? deps.now : Date.now)() - startedAt,\n          ),\n          'consolidator.facts_extracted': 0,\n          'consolidator.budget_used_usd': 0,\n        });\n        return makeOutcome('completed', { conflictsResolved: 0 });\n      }\n      const semantic = deps.store.semantic;\n      const pending = await conflicts.listPending(deps.scope, deps.maxConflictsPerRun);\n      span.setAttributes({ 'consolidator.deep.pending_count': pending.length });\n      if (pending.length === 0) {\n        span.setAttributes({\n          'consolidator.duration_ms': Math.max(\n            0,\n            (typeof deps.now === 'function' ? deps.now : Date.now)() - startedAt,\n          ),\n          'consolidator.facts_extracted': 0,\n          'consolidator.budget_used_usd': 0,\n        });\n        return makeOutcome('completed', { conflictsResolved: 0 });\n      }\n\n      let resolved = 0;\n      let factsUpdated = 0;\n      let totalTokens = 0;\n      let totalCost = 0;\n\n      // MCON-9: a judge call that throws or returns garbage must not be\n      // re-billed forever. First failure stamps `attemptedAt`; a failure\n      // on an already-attempted row closes it (`'judge-unparseable'`),\n      // so a poisoned row costs at most two calls across all runs.\n      const recordJudgeFailure = async (r: (typeof pending)[number]): Promise<void> => {\n        if (r.attemptedAt !== null) {\n          await conflicts.markResolved(r.id, 'judge-unparseable');\n        } else if (typeof conflicts.markAttempted === 'function') {\n          await conflicts.markAttempted(r.id);\n        }\n      };\n\n      for (const row of pending) {\n        // MCON-9: mirror the standard/reflect phases — once the budget\n        // pauses mid-run, stop spending instead of draining up to\n        // maxConflictsPerRun calls past the ceiling.\n        if (deps.budget.snapshot().paused) break;\n        const candidateText = row.candidateText;\n        const conflictingId = row.conflictingIds[0] ?? null;\n        let existingText: string | null = null;\n        if (conflictingId !== null && typeof semantic.get === 'function') {\n          const fact = await semantic.get(conflictingId);\n          existingText = fact?.text ?? null;\n        }\n        const request = buildJudgeRequest(deps, candidateText, existingText);\n        let response: Awaited<ReturnType<Provider['generate']>>;\n        try {\n          response = await deps.provider.generate(request);\n        } catch (err) {\n          span.recordException(err);\n          await recordJudgeFailure(row);\n          continue;\n        }\n        const usage = response.usage;\n        const tokens =\n          (usage.promptTokens ?? 0) + (usage.completionTokens ?? 0) + (usage.reasoningTokens ?? 0);\n        const cost =\n          deps.priceUsage?.({\n            promptTokens: usage.promptTokens,\n            completionTokens: usage.completionTokens,\n          }) ?? 0;\n        totalTokens += tokens;\n        totalCost += cost;\n        deps.budget.record({ phase: 'deep', tokens, costUsd: cost });\n\n        const judge = parseJudge(response.text);\n        if (judge === null) {\n          await recordJudgeFailure(row);\n          continue;\n        }\n\n        if (judge.decision === 'supersede' && conflictingId !== null) {\n          if (typeof semantic.get === 'function') {\n            const candidateFact = await semantic.get(row.factId);\n            if (candidateFact !== null) {\n              await semantic.supersede(conflictingId, candidateFact, judge.reason);\n              factsUpdated += 1;\n            }\n          }\n          await conflicts.markResolved(row.id, 'supersede');\n        } else if (judge.decision === 'dedup' && conflictingId !== null) {\n          if (typeof semantic.purge === 'function') {\n            await semantic.purge(row.factId, judge.reason);\n          } else if (typeof semantic.forget === 'function') {\n            await semantic.forget(row.factId, judge.reason);\n          }\n          factsUpdated += 1;\n          await conflicts.markResolved(row.id, 'dedup');\n        } else {\n          await conflicts.markResolved(row.id, 'admit');\n        }\n        resolved += 1;\n      }\n\n      const snapshot = deps.budget.snapshot();\n      span.setAttributes({\n        'consolidator.duration_ms': Math.max(\n          0,\n          (typeof deps.now === 'function' ? deps.now : Date.now)() - startedAt,\n        ),\n        'consolidator.facts_extracted': factsUpdated,\n        'consolidator.budget_used_usd': totalCost,\n        'consolidator.deep.resolved': resolved,\n        'consolidator.deep.facts_updated': factsUpdated,\n        'consolidator.deep.tokens.total': totalTokens,\n        'consolidator.deep.cost.estimate.usd': totalCost,\n        'consolidator.budget.remaining.tokens': snapshot.tokensRemaining,\n        'consolidator.budget.remaining.usd': snapshot.costRemaining,\n      });\n\n      return {\n        phase: 'deep',\n        status: 'completed',\n        factsCreated: 0,\n        factsUpdated,\n        conflictsResolved: resolved,\n        episodesFormed: 0,\n        insightsCreated: 0,\n        noiseFilteredCount: 0,\n        emptyExtractions: 0,\n        llmTokensUsed: totalTokens,\n        llmCostUsd: totalCost,\n        errorMessage: null,\n      };\n    },\n  );\n}\n\nfunction buildJudgeRequest(\n  deps: DeepPhaseDeps,\n  candidateText: string,\n  existingText: string | null,\n): ProviderRequest {\n  const userBlock = [\n    `Candidate fact: ${candidateText}`,\n    existingText !== null ? `Existing fact: ${existingText}` : 'Existing fact: (unknown)',\n  ].join('\\n');\n  return {\n    messages: [{ role: 'user', content: userBlock }],\n    systemMessage: JUDGE_PROMPT,\n    temperature: 0,\n    // MCON-14: per-call output cap — the verdict shape is tiny.\n    maxTokens: 256,\n    metadata: {\n      userId: deps.scope.userId,\n      ...(deps.scope.sessionId !== undefined ? { sessionId: deps.scope.sessionId } : {}),\n      ...(deps.scope.agentId !== undefined ? { agentId: deps.scope.agentId } : {}),\n    },\n    outputType: { kind: 'structured' },\n  };\n}\n\nfunction parseJudge(text: string | undefined): JudgeOutcome | null {\n  if (text === undefined || text.length === 0) return null;\n  const candidate = stripFence(text).trim();\n  if (candidate.length === 0) return null;\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(candidate);\n  } catch {\n    const slice = sliceJsonObject(candidate);\n    if (slice === null) return null;\n    try {\n      parsed = JSON.parse(slice);\n    } catch {\n      return null;\n    }\n  }\n  if (parsed === null || typeof parsed !== 'object') return null;\n  const obj = parsed as { decision?: unknown; reason?: unknown };\n  const decision = obj.decision;\n  if (decision !== 'supersede' && decision !== 'dedup' && decision !== 'admit') return null;\n  const reason = typeof obj.reason === 'string' ? obj.reason : 'unspecified';\n  return { decision, reason };\n}\n\nfunction stripFence(text: string): string {\n  const match = /^```[^\\n]*\\n([\\s\\S]*?)\\n```/u.exec(text.trim());\n  return match?.[1] ?? text;\n}\n\nfunction sliceJsonObject(text: string): string | null {\n  const start = text.indexOf('{');\n  const end = text.lastIndexOf('}');\n  if (start < 0 || end < start) return null;\n  return text.slice(start, end + 1);\n}\n\nfunction makeOutcome(\n  status: PhaseOutcome['status'],\n  overrides: Partial<PhaseOutcome>,\n): PhaseOutcome {\n  return {\n    phase: 'deep',\n    status,\n    factsCreated: 0,\n    factsUpdated: 0,\n    conflictsResolved: 0,\n    episodesFormed: 0,\n    insightsCreated: 0,\n    noiseFilteredCount: 0,\n    emptyExtractions: 0,\n    llmTokensUsed: 0,\n    llmCostUsd: null,\n    errorMessage: null,\n    ...overrides,\n  };\n}\n"],"mappings":";;;AAsCA,MAAM,eAAe;CACnB;CACA;CACA;CACA;CACA;CACA;CACD,CAAC,KAAK,IAAI;;AAQX,eAAsB,aAAa,MAA4C;AAC7E,QAAO,eACL,KAAK,QACL,2BACA,KAAK,OACL;EACE,sBAAsB;EACtB,qBAAqB,KAAK;EAC1B,2BAA2B,KAAK,aAAa,KAAK,SAAS;EAC5D,EACD,OAAO,SAAS;EACd,MAAM,aAAa,OAAO,KAAK,QAAQ,aAAa,KAAK,MAAM,KAAK,MAAM;EAC1E,MAAM,YAAY,KAAK,MAAM;AAC7B,MAAI,cAAc,QAAW;AAC3B,QAAK,cAAc;IACjB,6BAA6B;IAC7B,4BAA4B,KAAK,IAC/B,IACC,OAAO,KAAK,QAAQ,aAAa,KAAK,MAAM,KAAK,MAAM,GAAG,UAC5D;IACD,gCAAgC;IAChC,gCAAgC;IACjC,CAAC;AACF,UAAO,YAAY,aAAa,EAAE,mBAAmB,GAAG,CAAC;;EAE3D,MAAM,WAAW,KAAK,MAAM;EAC5B,MAAM,UAAU,MAAM,UAAU,YAAY,KAAK,OAAO,KAAK,mBAAmB;AAChF,OAAK,cAAc,EAAE,mCAAmC,QAAQ,QAAQ,CAAC;AACzE,MAAI,QAAQ,WAAW,GAAG;AACxB,QAAK,cAAc;IACjB,4BAA4B,KAAK,IAC/B,IACC,OAAO,KAAK,QAAQ,aAAa,KAAK,MAAM,KAAK,MAAM,GAAG,UAC5D;IACD,gCAAgC;IAChC,gCAAgC;IACjC,CAAC;AACF,UAAO,YAAY,aAAa,EAAE,mBAAmB,GAAG,CAAC;;EAG3D,IAAI,WAAW;EACf,IAAI,eAAe;EACnB,IAAI,cAAc;EAClB,IAAI,YAAY;EAMhB,MAAM,qBAAqB,OAAO,MAA+C;AAC/E,OAAI,EAAE,gBAAgB,KACpB,OAAM,UAAU,aAAa,EAAE,IAAI,oBAAoB;YAC9C,OAAO,UAAU,kBAAkB,WAC5C,OAAM,UAAU,cAAc,EAAE,GAAG;;AAIvC,OAAK,MAAM,OAAO,SAAS;AAIzB,OAAI,KAAK,OAAO,UAAU,CAAC,OAAQ;GACnC,MAAM,gBAAgB,IAAI;GAC1B,MAAM,gBAAgB,IAAI,eAAe,MAAM;GAC/C,IAAIA,eAA8B;AAClC,OAAI,kBAAkB,QAAQ,OAAO,SAAS,QAAQ,WAEpD,iBADa,MAAM,SAAS,IAAI,cAAc,GACzB,QAAQ;GAE/B,MAAM,UAAU,kBAAkB,MAAM,eAAe,aAAa;GACpE,IAAIC;AACJ,OAAI;AACF,eAAW,MAAM,KAAK,SAAS,SAAS,QAAQ;YACzC,KAAK;AACZ,SAAK,gBAAgB,IAAI;AACzB,UAAM,mBAAmB,IAAI;AAC7B;;GAEF,MAAM,QAAQ,SAAS;GACvB,MAAM,UACH,MAAM,gBAAgB,MAAM,MAAM,oBAAoB,MAAM,MAAM,mBAAmB;GACxF,MAAM,OACJ,KAAK,aAAa;IAChB,cAAc,MAAM;IACpB,kBAAkB,MAAM;IACzB,CAAC,IAAI;AACR,kBAAe;AACf,gBAAa;AACb,QAAK,OAAO,OAAO;IAAE,OAAO;IAAQ;IAAQ,SAAS;IAAM,CAAC;GAE5D,MAAM,QAAQ,WAAW,SAAS,KAAK;AACvC,OAAI,UAAU,MAAM;AAClB,UAAM,mBAAmB,IAAI;AAC7B;;AAGF,OAAI,MAAM,aAAa,eAAe,kBAAkB,MAAM;AAC5D,QAAI,OAAO,SAAS,QAAQ,YAAY;KACtC,MAAM,gBAAgB,MAAM,SAAS,IAAI,IAAI,OAAO;AACpD,SAAI,kBAAkB,MAAM;AAC1B,YAAM,SAAS,UAAU,eAAe,eAAe,MAAM,OAAO;AACpE,sBAAgB;;;AAGpB,UAAM,UAAU,aAAa,IAAI,IAAI,YAAY;cACxC,MAAM,aAAa,WAAW,kBAAkB,MAAM;AAC/D,QAAI,OAAO,SAAS,UAAU,WAC5B,OAAM,SAAS,MAAM,IAAI,QAAQ,MAAM,OAAO;aACrC,OAAO,SAAS,WAAW,WACpC,OAAM,SAAS,OAAO,IAAI,QAAQ,MAAM,OAAO;AAEjD,oBAAgB;AAChB,UAAM,UAAU,aAAa,IAAI,IAAI,QAAQ;SAE7C,OAAM,UAAU,aAAa,IAAI,IAAI,QAAQ;AAE/C,eAAY;;EAGd,MAAM,WAAW,KAAK,OAAO,UAAU;AACvC,OAAK,cAAc;GACjB,4BAA4B,KAAK,IAC/B,IACC,OAAO,KAAK,QAAQ,aAAa,KAAK,MAAM,KAAK,MAAM,GAAG,UAC5D;GACD,gCAAgC;GAChC,gCAAgC;GAChC,8BAA8B;GAC9B,mCAAmC;GACnC,kCAAkC;GAClC,uCAAuC;GACvC,wCAAwC,SAAS;GACjD,qCAAqC,SAAS;GAC/C,CAAC;AAEF,SAAO;GACL,OAAO;GACP,QAAQ;GACR,cAAc;GACd;GACA,mBAAmB;GACnB,gBAAgB;GAChB,iBAAiB;GACjB,oBAAoB;GACpB,kBAAkB;GAClB,eAAe;GACf,YAAY;GACZ,cAAc;GACf;GAEJ;;AAGH,SAAS,kBACP,MACA,eACA,cACiB;AAKjB,QAAO;EACL,UAAU,CAAC;GAAE,MAAM;GAAQ,SALX,CAChB,mBAAmB,iBACnB,iBAAiB,OAAO,kBAAkB,iBAAiB,2BAC5D,CAAC,KAAK,KAAK;GAEqC,CAAC;EAChD,eAAe;EACf,aAAa;EAEb,WAAW;EACX,UAAU;GACR,QAAQ,KAAK,MAAM;GACnB,GAAI,KAAK,MAAM,cAAc,SAAY,EAAE,WAAW,KAAK,MAAM,WAAW,GAAG,EAAE;GACjF,GAAI,KAAK,MAAM,YAAY,SAAY,EAAE,SAAS,KAAK,MAAM,SAAS,GAAG,EAAE;GAC5E;EACD,YAAY,EAAE,MAAM,cAAc;EACnC;;AAGH,SAAS,WAAW,MAA+C;AACjE,KAAI,SAAS,UAAa,KAAK,WAAW,EAAG,QAAO;CACpD,MAAM,YAAY,WAAW,KAAK,CAAC,MAAM;AACzC,KAAI,UAAU,WAAW,EAAG,QAAO;CACnC,IAAIC;AACJ,KAAI;AACF,WAAS,KAAK,MAAM,UAAU;SACxB;EACN,MAAM,QAAQ,gBAAgB,UAAU;AACxC,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI;AACF,YAAS,KAAK,MAAM,MAAM;UACpB;AACN,UAAO;;;AAGX,KAAI,WAAW,QAAQ,OAAO,WAAW,SAAU,QAAO;CAC1D,MAAM,MAAM;CACZ,MAAM,WAAW,IAAI;AACrB,KAAI,aAAa,eAAe,aAAa,WAAW,aAAa,QAAS,QAAO;AAErF,QAAO;EAAE;EAAU,QADJ,OAAO,IAAI,WAAW,WAAW,IAAI,SAAS;EAClC;;AAG7B,SAAS,WAAW,MAAsB;AAExC,QADc,+BAA+B,KAAK,KAAK,MAAM,CAAC,GAC/C,MAAM;;AAGvB,SAAS,gBAAgB,MAA6B;CACpD,MAAM,QAAQ,KAAK,QAAQ,IAAI;CAC/B,MAAM,MAAM,KAAK,YAAY,IAAI;AACjC,KAAI,QAAQ,KAAK,MAAM,MAAO,QAAO;AACrC,QAAO,KAAK,MAAM,OAAO,MAAM,EAAE;;AAGnC,SAAS,YACP,QACA,WACc;AACd,QAAO;EACL,OAAO;EACP;EACA,cAAc;EACd,cAAc;EACd,mBAAmB;EACnB,gBAAgB;EAChB,iBAAiB;EACjB,oBAAoB;EACpB,kBAAkB;EAClB,eAAe;EACf,YAAY;EACZ,cAAc;EACd,GAAG;EACJ"}

package/dist/consolidator/phases/induce.d.ts

@@ -0,0 +1,154 @@
+import { Provider, ProviderRequest, RunState } from "@graphorin/core";
+
+//#region src/consolidator/phases/induce.d.ts
+
+/** Output-token ceiling for one induction call. */
+declare const DEFAULT_INDUCTION_MAX_TOKENS = 512;
+/** Hard cap on steps in an induced procedure (defends against runaway output). */
+declare const MAX_PROCEDURE_STEPS = 50;
+/** Upper bound on trajectory steps rendered into the induction prompt. */
+declare const MAX_TRAJECTORY_STEPS_SHOWN = 60;
+/**
+ * One distilled step of an agent trajectory — model-agnostic, so the
+ * inducer never sees raw provider/tool wire formats.
+ *
+ * @stable
+ */
+interface TrajectoryStep {
+  /** Tool invoked at this step, when the step was a tool call. */
+  readonly tool?: string;
+  /** Concrete args / observation rendered to text (the value-abstraction source). */
+  readonly detail?: string;
+}
+/**
+ * The minimal trajectory an inducer needs: the goal, the ordered steps, and
+ * whether the run succeeded. Induction fires on **success only** (AWM online
+ * mode) — {@link runWorkflowInduction} returns `null` for a failed run.
+ *
+ * @stable
+ */
+interface Trajectory {
+  /** What the run set out to do (typically the first user message). */
+  readonly goal: string;
+  /** Ordered steps the agent took. */
+  readonly steps: ReadonlyArray<TrajectoryStep>;
+  /** Whether the run succeeded — the induction gate. */
+  readonly succeeded: boolean;
+}
+/**
+ * A reusable workflow distilled from a successful trajectory.
+ *
+ * @stable
+ */
+interface InducedProcedure {
+  /** Short imperative title / goal of the reusable workflow. */
+  readonly title: string;
+  /** Ordered, value-abstracted steps (`"search for {product}"`, …). */
+  readonly steps: ReadonlyArray<string>;
+  /** Variable names abstracted from concrete values (`"product"`, `"day"`). */
+  readonly variables: ReadonlyArray<string>;
+  /** Voyager-style verifiable success criteria for self-verification on reuse. */
+  readonly successCriteria: ReadonlyArray<string>;
+}
+/** Per-call options for an induction request. */
+interface WorkflowInductionOptions {
+  /** Output-token ceiling. Default {@link DEFAULT_INDUCTION_MAX_TOKENS}. */
+  readonly maxTokens?: number;
+  readonly signal?: AbortSignal;
+}
+/**
+ * Provider-agnostic seam: turn one successful trajectory into a procedure.
+ * Returns `null` when nothing inducible (degraded provider, empty output) —
+ * never throws.
+ *
+ * @stable
+ */
+interface WorkflowInducer {
+  induce(trajectory: Trajectory, options?: WorkflowInductionOptions): Promise<InducedProcedure | null>;
+}
+/** Result of self-verifying a reuse against an induced procedure's criteria. */
+interface VerificationResult {
+  /** True only when the procedure has criteria and every one is met. */
+  readonly verified: boolean;
+  /** Criteria not satisfied by the observed signals. */
+  readonly unmet: ReadonlyArray<string>;
+}
+declare const INDUCTION_SYSTEM_PROMPT: string;
+/**
+ * Build the (pure) induction request. Renders the trajectory as numbered
+ * steps; caps the rendered steps to keep the prompt bounded.
+ */
+declare function buildInductionRequest(trajectory: Trajectory, options?: WorkflowInductionOptions): ProviderRequest;
+/**
+ * Parse the induction response into an {@link InducedProcedure}, tolerating
+ * chatty / fenced output. Returns `null` when absent / unparseable / it
+ * yields no steps. **Never throws on model output** — only normalizes.
+ *
+ * The returned `variables` are reconciled with the steps: every `{name}`
+ * placeholder actually present in the steps is guaranteed to appear, so the
+ * abstraction is grounded in the procedure rather than in a model-declared
+ * list that may drift from it.
+ *
+ * @internal
+ */
+declare function parseInducedProcedure(text: string | undefined): InducedProcedure | null;
+/**
+ * Normalize a raw induced procedure: trim + drop empty entries, cap step
+ * count, and reconcile the variable list with the placeholders actually used
+ * in the steps. Returns `null` when no usable steps remain (nothing to
+ * induce).
+ *
+ * @internal
+ */
+declare function normalizeInducedProcedure(raw: {
+  title: string;
+  steps: ReadonlyArray<string>;
+  variables: ReadonlyArray<string>;
+  successCriteria: ReadonlyArray<string>;
+}): InducedProcedure | null;
+/**
+ * Resilient provider-backed inducer. A provider throw or unparseable output
+ * degrades to `null` (no procedure) — induction never breaks the write path.
+ */
+declare function createProviderWorkflowInducer(provider: Provider, options?: {
+  readonly maxTokens?: number;
+  /**
+   * Usage callback (MCON-15) — induction is the framework's highest
+   * poisoning-risk LLM spend and previously flowed past every budget
+   * envelope. `createMemory` wires this into the consolidator budget
+   * when one is enabled; standalone callers can record it themselves.
+   * Best-effort: a throwing callback never breaks induction.
+   */
+  readonly onUsage?: (usage: {
+    readonly promptTokens: number;
+    readonly completionTokens: number;
+  }) => void;
+}): WorkflowInducer;
+/**
+ * Pure orchestrator: induce a procedure from a trajectory.
+ *
+ * **Gate — successful trajectories only** (AWM online mode): a failed /
+ * aborted run, or one with no steps, yields `null` without calling the
+ * inducer. Otherwise the inducer runs and the result is normalized.
+ */
+declare function runWorkflowInduction(trajectory: Trajectory, inducer: WorkflowInducer, options?: WorkflowInductionOptions): Promise<InducedProcedure | null>;
+/**
+ * Distil a {@link RunState} into the minimal {@link Trajectory} the inducer
+ * needs. Pure — consumes the agent's already-emitted run state, so capturing
+ * a trajectory + its success signal needs no agent-loop change. The success
+ * signal is `status === 'completed'`.
+ */
+declare function trajectoryFromRunState(run: RunState): Trajectory;
+/**
+ * Self-verify a reuse against an induced procedure's success criteria. A
+ * criterion is met when any observed signal contains it (case-insensitive
+ * substring) — a deterministic, offline check the agent runtime can feed
+ * actual run observations into on reuse. With **no criteria**, the reuse
+ * cannot be self-verified, so `verified` is `false`.
+ */
+declare function checkSuccessCriteria(procedure: {
+  readonly successCriteria?: ReadonlyArray<string>;
+}, observed: ReadonlyArray<string>): VerificationResult;
+//#endregion
+export { DEFAULT_INDUCTION_MAX_TOKENS, INDUCTION_SYSTEM_PROMPT, InducedProcedure, MAX_PROCEDURE_STEPS, MAX_TRAJECTORY_STEPS_SHOWN, Trajectory, TrajectoryStep, VerificationResult, WorkflowInducer, WorkflowInductionOptions, buildInductionRequest, checkSuccessCriteria, createProviderWorkflowInducer, normalizeInducedProcedure, parseInducedProcedure, runWorkflowInduction, trajectoryFromRunState };
+//# sourceMappingURL=induce.d.ts.map

package/dist/consolidator/phases/induce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"induce.d.ts","names":[],"sources":["../../../src/consolidator/phases/induce.ts"],"sourcesContent":[],"mappings":";;;;;AAwMmB,cAvKN,4BAAA,GAuKM,GAAA;;AACC,cArKP,mBAAA,GAqKO,EAAA;AAwBpB;AAgDsB,cA1OT,0BAAA,GA0O6B,EAAA;;;;;;;AAuB1B,UAtPC,cAAA,CAsPqB;EAyBtB;EAC0B,SAAA,IAAA,CAAA,EAAA,MAAA;EAC9B;EACT,SAAA,MAAA,CAAA,EAAA,MAAA;;;;;;;;;UApQc,UAAA;;;;kBAIC,cAAc;;;;;;;;;UAUf,gBAAA;;;;kBAIC;;sBAEI;;4BAEM;;;UAIX,wBAAA;;;oBAGG;;;;;;;;;UAUH,eAAA;qBAED,sBACF,2BACT,QAAQ;;;UAII,kBAAA;;;;kBAIC;;cAGL;;;;;iBAeG,qBAAA,aACF,sBACH,2BACR;;;;;;;;;;;;;iBAwCa,qBAAA,4BAAiD;;;;;;;;;iBAoBjD,yBAAA;;SAEP;aACI;mBACM;IACf;;;;;iBAwBY,6BAAA,WACJ;;;;;;;;;;;;;IAeT;;;;;;;;iBAgCmB,oBAAA,aACR,qBACH,2BACA,2BACR,QAAQ;;;;;;;iBAmBK,sBAAA,MAA4B,WAAW;;;;;;;;iBAyBvC,oBAAA;6BAC0B;aAC9B,wBACT"}