@graphorin/memory 0.5.0

package/dist/conflict/pipeline.js

@@ -0,0 +1,257 @@
+import { enLocalePack } from "./locale-packs/en.js";
+import "./locale-packs/index.js";
+import { withMemorySpan } from "../internal/spans.js";
+import { stage1ExactDedup } from "./stages/stage1-exact-dedup.js";
+import { stage2EmbeddingThreeZone } from "./stages/stage2-embedding-three-zone.js";
+import { stage3HeuristicRegex } from "./stages/stage3-heuristic-regex.js";
+import { stage4SubjectPredicate } from "./stages/stage4-subject-predicate.js";
+import { stage5DeferToDeep } from "./stages/stage5-defer-to-deep.js";
+import { DEFAULT_CONFLICT_THRESHOLDS } from "./types.js";
+
+//#region src/conflict/pipeline.ts
+let bypassWarnedOnce = false;
+/**
+* Reset the one-shot bypass-warning flag. Test-only helper — production
+* callers never invoke this.
+*
+* @internal
+*/
+function _resetBypassWarningForTesting() {
+	bypassWarnedOnce = false;
+}
+/**
+* One-shot helper that mirrors RB-02 §8.1's `runConflictPipeline({...})`
+* spec — convenient for callers that do not need to pre-build + cache
+* the pipeline. Production wiring should still go through
+* {@link createConflictPipeline} (`SemanticMemory` re-uses the cached
+* instance per `Memory`).
+*
+* @stable
+*/
+async function runConflictPipeline(args) {
+	return createConflictPipeline(args.options ?? {}).run(args.deps, args.candidate);
+}
+/**
+* Returns a frozen pipeline handle wired with the supplied options.
+*
+* @stable
+*/
+function createConflictPipeline(options = {}) {
+	const mode = options.mode ?? "on";
+	const localePack = options.localePack ?? enLocalePack;
+	const thresholds = Object.freeze({
+		hot: options.thresholds?.hot ?? DEFAULT_CONFLICT_THRESHOLDS.hot,
+		nearDup: options.thresholds?.nearDup ?? DEFAULT_CONFLICT_THRESHOLDS.nearDup,
+		cold: options.thresholds?.cold ?? DEFAULT_CONFLICT_THRESHOLDS.cold
+	});
+	validateThresholds(thresholds);
+	const stage2TopK = options.stage2TopK ?? 5;
+	const now = options.now ?? (() => (/* @__PURE__ */ new Date()).toISOString());
+	async function run(deps, candidate) {
+		if (mode === "off") {
+			if (!bypassWarnedOnce) {
+				bypassWarnedOnce = true;
+				warnBypass();
+			}
+			return {
+				kind: "admit",
+				stage: "exact-dedup",
+				reason: "pipeline-mode-off"
+			};
+		}
+		checkAbort(deps.signal);
+		const conflictStore = options.conflictStore ?? deps.store.conflicts;
+		return withMemorySpan(deps.tracer, "memory.conflict", {
+			userId: candidate.userId,
+			...candidate.sessionId !== void 0 ? { sessionId: candidate.sessionId } : {},
+			...candidate.agentId !== void 0 ? { agentId: candidate.agentId } : {}
+		}, {
+			"memory.conflict.candidate_id": candidate.id,
+			"memory.conflict.locale_pack": localePack.id
+		}, async (span) => {
+			const existing = await collectVectorCandidates(deps, candidate, stage2TopK);
+			const decision = await orchestrate({
+				candidate,
+				existing,
+				localePack,
+				thresholds
+			});
+			await persistDecision(decision, candidate, conflictStore, now);
+			span.setAttributes({
+				"memory.conflict.stage": decision.stage,
+				"memory.conflict.decision": decision.kind,
+				"memory.conflict.candidate_count": existing.length,
+				...decision.kind === "dedup" && decision.similarity !== void 0 ? { "memory.conflict.similarity": decision.similarity } : {},
+				...decision.kind === "pending" && decision.similarity !== void 0 ? { "memory.conflict.similarity": decision.similarity } : {},
+				...decision.kind !== "admit" ? { "memory.conflict.reason": decision.reason ?? "unspecified" } : decision.reason !== void 0 ? { "memory.conflict.reason": decision.reason } : {}
+			});
+			return decision;
+		});
+	}
+	/**
+	* Visit the five stages in the order documented by RB-02 §8.1 and
+	* the conflict-resolution policy (DEC-117). Stage 1 short-circuits
+	* exact duplicates. Stage 2 always computes the zone but the
+	* orchestrator splits its decision in two halves: the HOT zone is
+	* the only zone that overrides Stage 3 / Stage 4 (semantic identity
+	* outranks any explicit user marker); every other zone runs Stages
+	* 3 and 4 first to give the heuristic markers a chance to supersede
+	* before falling back to Stage 2's default decision.
+	*
+	* Stage 3 is declared "orthogonal to Stage 2", which is why the
+	* heuristic stages run regardless of Stage 2's COLD / NEAR-DUP /
+	* CONFLICT-CHECK assignment as long as Stage 2 surfaced at least
+	* one candidate. The HOT-zone short-circuit preserves the dedup
+	* invariant for semantic identity.
+	*/
+	async function orchestrate(ctx) {
+		const stage1 = await stage1ExactDedup.evaluate(ctx);
+		if (stage1.kind !== "continue") return mapOutcomeToDecision("exact-dedup", stage1, ctx.candidate);
+		const stage2 = await stage2EmbeddingThreeZone.evaluate(ctx);
+		if (stage2.kind === "dedup" && stage2.reason === "embedding-hot-zone") return mapOutcomeToDecision("embedding-three-zone", stage2, ctx.candidate);
+		if (ctx.existing.length > 0) {
+			const stage3 = await stage3HeuristicRegex.evaluate(ctx);
+			if (stage3.kind !== "continue") return mapOutcomeToDecision("heuristic-regex", stage3, ctx.candidate);
+			const stage4 = await stage4SubjectPredicate.evaluate(ctx);
+			if (stage4.kind !== "continue") return mapOutcomeToDecision("subject-predicate", stage4, ctx.candidate);
+		}
+		if (stage2.kind === "dedup" || stage2.kind === "admit") return mapOutcomeToDecision("embedding-three-zone", stage2, ctx.candidate);
+		return mapOutcomeToDecision("defer-to-deep", await stage5DeferToDeep.evaluate(ctx), ctx.candidate);
+	}
+	return Object.freeze({
+		mode,
+		localePack,
+		thresholds,
+		run
+	});
+}
+function mapOutcomeToDecision(stage, outcome, candidate) {
+	switch (outcome.kind) {
+		case "continue": return {
+			kind: "admit",
+			stage,
+			reason: "continue-fallthrough"
+		};
+		case "admit": return {
+			kind: "admit",
+			stage,
+			...outcome.reason !== void 0 ? { reason: outcome.reason } : {}
+		};
+		case "dedup": return {
+			kind: "dedup",
+			stage,
+			existingId: outcome.existingId,
+			...outcome.similarity !== void 0 ? { similarity: outcome.similarity } : {},
+			...outcome.reason !== void 0 ? { reason: outcome.reason } : {}
+		};
+		case "supersede": return {
+			kind: "supersede",
+			stage,
+			existingId: outcome.existingId,
+			reason: outcome.reason
+		};
+		case "pending": return {
+			kind: "pending",
+			stage,
+			candidateId: candidate.id,
+			conflictingIds: outcome.conflictingIds,
+			...outcome.similarity !== void 0 ? { similarity: outcome.similarity } : {},
+			...outcome.reason !== void 0 ? { reason: outcome.reason } : {}
+		};
+	}
+}
+async function persistDecision(decision, candidate, conflictStore, now) {
+	if (conflictStore === void 0) return;
+	const scope = {
+		userId: candidate.userId,
+		...candidate.sessionId !== void 0 ? { sessionId: candidate.sessionId } : {},
+		...candidate.agentId !== void 0 ? { agentId: candidate.agentId } : {}
+	};
+	const detectionZone = decisionToZone(decision);
+	const auditInput = {
+		scope,
+		candidateId: candidate.id,
+		decision: decision.kind,
+		stage: decision.stage,
+		...detectionZone !== void 0 ? { detectionZone } : {},
+		...decision.kind === "dedup" && decision.existingId !== void 0 ? { existingId: decision.existingId } : {},
+		...decision.kind === "supersede" ? { existingId: decision.existingId } : {},
+		...decision.kind === "dedup" && decision.similarity !== void 0 ? { similarity: decision.similarity } : {},
+		...decision.kind === "pending" && decision.similarity !== void 0 ? { similarity: decision.similarity } : {},
+		...decision.kind !== "admit" && decision.reason !== void 0 ? { reason: decision.reason } : {},
+		...decision.kind === "admit" && decision.reason !== void 0 ? { reason: decision.reason } : {}
+	};
+	await conflictStore.recordDecision(auditInput);
+	if (decision.kind === "pending") await conflictStore.enqueuePending({
+		scope,
+		factId: candidate.id,
+		candidateText: candidate.text,
+		stage: decision.stage,
+		conflictingIds: decision.conflictingIds,
+		...decision.reason !== void 0 ? { reason: decision.reason } : {}
+	});
+}
+function decisionToZone(decision) {
+	switch (decision.kind) {
+		case "admit":
+			if (decision.reason === "embedding-cold-zone") return "cold";
+			return;
+		case "dedup":
+			if (decision.reason === "embedding-hot-zone") return "hot";
+			if (decision.reason === "embedding-near-dup-zone") return "near-dup";
+			if (decision.reason === "exact-hash-match") return "exact";
+			if (decision.reason === "subject-predicate-match-same-object") return "subject-predicate";
+			return;
+		case "supersede":
+			if (decision.reason.startsWith("regex-supersede-marker")) return "heuristic";
+			if (decision.reason.startsWith("regex-negation")) return "heuristic";
+			if (decision.reason.startsWith("subject-predicate-match")) return "subject-predicate";
+			return;
+		case "pending": return "conflict-check";
+	}
+}
+async function collectVectorCandidates(deps, candidate, topK) {
+	if (deps.embedder === null || deps.embedderId === null) return [];
+	const adapter = deps.store.semantic;
+	if (typeof adapter.searchVector !== "function") return [];
+	checkAbort(deps.signal);
+	const [vector] = await deps.embedder.embed([candidate.text], { taskType: "passage" });
+	if (vector === void 0) return [];
+	checkAbort(deps.signal);
+	const scope = {
+		userId: candidate.userId,
+		...candidate.sessionId !== void 0 ? { sessionId: candidate.sessionId } : {},
+		...candidate.agentId !== void 0 ? { agentId: candidate.agentId } : {}
+	};
+	let hits;
+	try {
+		hits = await adapter.searchVector(scope, vector, deps.embedderId, topK);
+	} catch (err) {
+		if (err instanceof Error && err.name === "AbortError") throw err;
+		return [];
+	}
+	return [...hits].filter((hit) => hit.record.id !== candidate.id);
+}
+function validateThresholds(thresholds) {
+	if (!(thresholds.hot >= thresholds.nearDup && thresholds.nearDup >= thresholds.cold && thresholds.hot <= 1 && thresholds.cold >= 0)) throw new TypeError(`[graphorin/memory] invalid conflict thresholds: expected 0 <= cold <= nearDup <= hot <= 1, got ${JSON.stringify(thresholds)}.`);
+}
+/**
+* Throw the canonical `AbortError` when the supplied signal is
+* already aborted. Safe to call with `undefined`.
+*
+* @internal
+*/
+function checkAbort(signal) {
+	if (signal === void 0) return;
+	if (signal.aborted) {
+		if (typeof signal.throwIfAborted === "function") signal.throwIfAborted();
+		throw new DOMException("The operation was aborted.", "AbortError");
+	}
+}
+function warnBypass() {
+	console.warn("[graphorin/memory] conflict pipeline disabled (mode: \"off\"). Semantic writes fall back to a straight-through path — bi-temporal supersede / dedup will not fire until you re-enable the pipeline.");
+}
+
+//#endregion
+export { _resetBypassWarningForTesting, createConflictPipeline, runConflictPipeline };
+//# sourceMappingURL=pipeline.js.map

package/dist/conflict/pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.js","names":["mode: 'on' | 'off'","localePack: LocalePack","thresholds: ConflictThresholds","auditInput: Parameters<NonNullable<typeof conflictStore>['recordDecision']>[0]","hits: ReadonlyArray<MemoryHit<Fact>>"],"sources":["../../src/conflict/pipeline.ts"],"sourcesContent":["/**\n * `runConflictPipeline` — orchestrator for the multi-stage conflict\n * resolution pipeline shipped in `@graphorin/memory` Phase 10b\n * (DEC-117 / ADR-018 ext / RB-02).\n *\n * @packageDocumentation\n */\n\nimport type { Fact, MemoryHit } from '@graphorin/core';\nimport { withMemorySpan } from '../internal/spans.js';\nimport { enLocalePack, type LocalePack } from './locale-packs/index.js';\nimport { stage1ExactDedup } from './stages/stage1-exact-dedup.js';\nimport { stage2EmbeddingThreeZone } from './stages/stage2-embedding-three-zone.js';\nimport { stage3HeuristicRegex } from './stages/stage3-heuristic-regex.js';\nimport { stage4SubjectPredicate } from './stages/stage4-subject-predicate.js';\nimport { stage5DeferToDeep } from './stages/stage5-defer-to-deep.js';\nimport {\n  type ConflictDecision,\n  type ConflictPipeline,\n  type ConflictPipelineDeps,\n  type ConflictPipelineOptions,\n  type ConflictStage,\n  type ConflictThresholds,\n  DEFAULT_CONFLICT_THRESHOLDS,\n  type StageContext,\n  type StageOutcome,\n} from './types.js';\n\nlet bypassWarnedOnce = false;\n\n/**\n * Reset the one-shot bypass-warning flag. Test-only helper — production\n * callers never invoke this.\n *\n * @internal\n */\nexport function _resetBypassWarningForTesting(): void {\n  bypassWarnedOnce = false;\n}\n\n/**\n * One-shot helper that mirrors RB-02 §8.1's `runConflictPipeline({...})`\n * spec — convenient for callers that do not need to pre-build + cache\n * the pipeline. Production wiring should still go through\n * {@link createConflictPipeline} (`SemanticMemory` re-uses the cached\n * instance per `Memory`).\n *\n * @stable\n */\nexport async function runConflictPipeline(args: {\n  readonly candidate: Fact;\n  readonly deps: ConflictPipelineDeps;\n  readonly options?: ConflictPipelineOptions;\n}): Promise<ConflictDecision> {\n  const pipeline = createConflictPipeline(args.options ?? {});\n  return pipeline.run(args.deps, args.candidate);\n}\n\n/**\n * Returns a frozen pipeline handle wired with the supplied options.\n *\n * @stable\n */\nexport function createConflictPipeline(options: ConflictPipelineOptions = {}): ConflictPipeline {\n  const mode: 'on' | 'off' = options.mode ?? 'on';\n  const localePack: LocalePack = options.localePack ?? enLocalePack;\n  const thresholds: ConflictThresholds = Object.freeze({\n    hot: options.thresholds?.hot ?? DEFAULT_CONFLICT_THRESHOLDS.hot,\n    nearDup: options.thresholds?.nearDup ?? DEFAULT_CONFLICT_THRESHOLDS.nearDup,\n    cold: options.thresholds?.cold ?? DEFAULT_CONFLICT_THRESHOLDS.cold,\n  });\n  validateThresholds(thresholds);\n  const stage2TopK = options.stage2TopK ?? 5;\n  const now = options.now ?? ((): string => new Date().toISOString());\n\n  async function run(deps: ConflictPipelineDeps, candidate: Fact): Promise<ConflictDecision> {\n    if (mode === 'off') {\n      if (!bypassWarnedOnce) {\n        bypassWarnedOnce = true;\n        warnBypass();\n      }\n      return { kind: 'admit', stage: 'exact-dedup', reason: 'pipeline-mode-off' };\n    }\n\n    checkAbort(deps.signal);\n    const conflictStore = options.conflictStore ?? deps.store.conflicts;\n\n    return withMemorySpan(\n      deps.tracer,\n      'memory.conflict',\n      {\n        userId: candidate.userId,\n        ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n        ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n      },\n      {\n        'memory.conflict.candidate_id': candidate.id,\n        'memory.conflict.locale_pack': localePack.id,\n      },\n      async (span) => {\n        const existing = await collectVectorCandidates(deps, candidate, stage2TopK);\n        const ctx: StageContext = {\n          candidate,\n          existing,\n          localePack,\n          thresholds,\n        };\n        const decision = await orchestrate(ctx);\n        await persistDecision(decision, candidate, conflictStore, now);\n        span.setAttributes({\n          'memory.conflict.stage': decision.stage,\n          'memory.conflict.decision': decision.kind,\n          'memory.conflict.candidate_count': existing.length,\n          ...(decision.kind === 'dedup' && decision.similarity !== undefined\n            ? { 'memory.conflict.similarity': decision.similarity }\n            : {}),\n          ...(decision.kind === 'pending' && decision.similarity !== undefined\n            ? { 'memory.conflict.similarity': decision.similarity }\n            : {}),\n          ...(decision.kind !== 'admit'\n            ? { 'memory.conflict.reason': decision.reason ?? 'unspecified' }\n            : decision.reason !== undefined\n              ? { 'memory.conflict.reason': decision.reason }\n              : {}),\n        });\n        return decision;\n      },\n    );\n  }\n\n  /**\n   * Visit the five stages in the order documented by RB-02 §8.1 and\n   * the conflict-resolution policy (DEC-117). Stage 1 short-circuits\n   * exact duplicates. Stage 2 always computes the zone but the\n   * orchestrator splits its decision in two halves: the HOT zone is\n   * the only zone that overrides Stage 3 / Stage 4 (semantic identity\n   * outranks any explicit user marker); every other zone runs Stages\n   * 3 and 4 first to give the heuristic markers a chance to supersede\n   * before falling back to Stage 2's default decision.\n   *\n   * Stage 3 is declared \"orthogonal to Stage 2\", which is why the\n   * heuristic stages run regardless of Stage 2's COLD / NEAR-DUP /\n   * CONFLICT-CHECK assignment as long as Stage 2 surfaced at least\n   * one candidate. The HOT-zone short-circuit preserves the dedup\n   * invariant for semantic identity.\n   */\n  async function orchestrate(ctx: StageContext): Promise<ConflictDecision> {\n    const stage1 = await stage1ExactDedup.evaluate(ctx);\n    if (stage1.kind !== 'continue') {\n      return mapOutcomeToDecision('exact-dedup', stage1, ctx.candidate);\n    }\n\n    const stage2 = await stage2EmbeddingThreeZone.evaluate(ctx);\n    if (stage2.kind === 'dedup' && stage2.reason === 'embedding-hot-zone') {\n      return mapOutcomeToDecision('embedding-three-zone', stage2, ctx.candidate);\n    }\n\n    if (ctx.existing.length > 0) {\n      const stage3 = await stage3HeuristicRegex.evaluate(ctx);\n      if (stage3.kind !== 'continue') {\n        return mapOutcomeToDecision('heuristic-regex', stage3, ctx.candidate);\n      }\n      const stage4 = await stage4SubjectPredicate.evaluate(ctx);\n      if (stage4.kind !== 'continue') {\n        return mapOutcomeToDecision('subject-predicate', stage4, ctx.candidate);\n      }\n    }\n\n    if (stage2.kind === 'dedup' || stage2.kind === 'admit') {\n      return mapOutcomeToDecision('embedding-three-zone', stage2, ctx.candidate);\n    }\n\n    const stage5 = await stage5DeferToDeep.evaluate(ctx);\n    return mapOutcomeToDecision('defer-to-deep', stage5, ctx.candidate);\n  }\n\n  return Object.freeze({\n    mode,\n    localePack,\n    thresholds,\n    run,\n  }) satisfies ConflictPipeline;\n}\n\nfunction mapOutcomeToDecision(\n  stage: ConflictStage,\n  outcome: StageOutcome,\n  candidate: Fact,\n): ConflictDecision {\n  switch (outcome.kind) {\n    case 'continue':\n      return { kind: 'admit', stage, reason: 'continue-fallthrough' };\n    case 'admit':\n      return {\n        kind: 'admit',\n        stage,\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n    case 'dedup':\n      return {\n        kind: 'dedup',\n        stage,\n        existingId: outcome.existingId,\n        ...(outcome.similarity !== undefined ? { similarity: outcome.similarity } : {}),\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n    case 'supersede':\n      return {\n        kind: 'supersede',\n        stage,\n        existingId: outcome.existingId,\n        reason: outcome.reason,\n      };\n    case 'pending':\n      return {\n        kind: 'pending',\n        stage,\n        candidateId: candidate.id,\n        conflictingIds: outcome.conflictingIds,\n        ...(outcome.similarity !== undefined ? { similarity: outcome.similarity } : {}),\n        ...(outcome.reason !== undefined ? { reason: outcome.reason } : {}),\n      };\n  }\n}\n\nasync function persistDecision(\n  decision: ConflictDecision,\n  candidate: Fact,\n  conflictStore: ConflictPipelineDeps['store']['conflicts'],\n  now: () => string,\n): Promise<void> {\n  if (conflictStore === undefined) return;\n  const scope = {\n    userId: candidate.userId,\n    ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n    ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n  };\n  const detectionZone = decisionToZone(decision);\n  const auditInput: Parameters<NonNullable<typeof conflictStore>['recordDecision']>[0] = {\n    scope,\n    candidateId: candidate.id,\n    decision: decision.kind,\n    stage: decision.stage,\n    ...(detectionZone !== undefined ? { detectionZone } : {}),\n    ...(decision.kind === 'dedup' && decision.existingId !== undefined\n      ? { existingId: decision.existingId }\n      : {}),\n    ...(decision.kind === 'supersede' ? { existingId: decision.existingId } : {}),\n    ...(decision.kind === 'dedup' && decision.similarity !== undefined\n      ? { similarity: decision.similarity }\n      : {}),\n    ...(decision.kind === 'pending' && decision.similarity !== undefined\n      ? { similarity: decision.similarity }\n      : {}),\n    ...(decision.kind !== 'admit' && decision.reason !== undefined\n      ? { reason: decision.reason }\n      : {}),\n    ...(decision.kind === 'admit' && decision.reason !== undefined\n      ? { reason: decision.reason }\n      : {}),\n  };\n  await conflictStore.recordDecision(auditInput);\n  if (decision.kind === 'pending') {\n    await conflictStore.enqueuePending({\n      scope,\n      factId: candidate.id,\n      candidateText: candidate.text,\n      stage: decision.stage,\n      conflictingIds: decision.conflictingIds,\n      ...(decision.reason !== undefined ? { reason: decision.reason } : {}),\n    });\n  }\n  void now;\n}\n\nfunction decisionToZone(decision: ConflictDecision): string | undefined {\n  switch (decision.kind) {\n    case 'admit':\n      if (decision.reason === 'embedding-cold-zone') return 'cold';\n      return undefined;\n    case 'dedup':\n      if (decision.reason === 'embedding-hot-zone') return 'hot';\n      if (decision.reason === 'embedding-near-dup-zone') return 'near-dup';\n      if (decision.reason === 'exact-hash-match') return 'exact';\n      if (decision.reason === 'subject-predicate-match-same-object') return 'subject-predicate';\n      return undefined;\n    case 'supersede':\n      if (decision.reason.startsWith('regex-supersede-marker')) return 'heuristic';\n      if (decision.reason.startsWith('regex-negation')) return 'heuristic';\n      if (decision.reason.startsWith('subject-predicate-match')) return 'subject-predicate';\n      return undefined;\n    case 'pending':\n      return 'conflict-check';\n  }\n}\n\nasync function collectVectorCandidates(\n  deps: ConflictPipelineDeps,\n  candidate: Fact,\n  topK: number,\n): Promise<ReadonlyArray<MemoryHit<Fact>>> {\n  if (deps.embedder === null || deps.embedderId === null) return [];\n  const adapter = deps.store.semantic;\n  if (typeof adapter.searchVector !== 'function') return [];\n  checkAbort(deps.signal);\n  // PS-10: the candidate is compared against stored facts, which are embedded\n  // as `passage` — keep it in the same space for the asymmetric (E5) embedder.\n  const [vector] = await deps.embedder.embed([candidate.text], { taskType: 'passage' });\n  if (vector === undefined) return [];\n  checkAbort(deps.signal);\n  const scope = {\n    userId: candidate.userId,\n    ...(candidate.sessionId !== undefined ? { sessionId: candidate.sessionId } : {}),\n    ...(candidate.agentId !== undefined ? { agentId: candidate.agentId } : {}),\n  };\n  // Vector search may throw when the storage layer's vector extension\n  // is missing or mis-configured (e.g. `sqlite-vec` not loaded). Fall\n  // back to \"no candidates\" so the conflict pipeline degrades to the\n  // 10a straight-through write rather than blocking the agent loop.\n  // AbortError is re-raised so cancellation propagates up.\n  let hits: ReadonlyArray<MemoryHit<Fact>>;\n  try {\n    hits = await adapter.searchVector(scope, vector, deps.embedderId, topK);\n  } catch (err) {\n    if (err instanceof Error && err.name === 'AbortError') throw err;\n    return [];\n  }\n  return [...hits].filter((hit) => hit.record.id !== candidate.id);\n}\n\nfunction validateThresholds(thresholds: ConflictThresholds): void {\n  if (\n    !(\n      thresholds.hot >= thresholds.nearDup &&\n      thresholds.nearDup >= thresholds.cold &&\n      thresholds.hot <= 1 &&\n      thresholds.cold >= 0\n    )\n  ) {\n    throw new TypeError(\n      `[graphorin/memory] invalid conflict thresholds: expected 0 <= cold <= nearDup <= hot <= 1, got ${JSON.stringify(thresholds)}.`,\n    );\n  }\n}\n\n/**\n * Throw the canonical `AbortError` when the supplied signal is\n * already aborted. Safe to call with `undefined`.\n *\n * @internal\n */\nfunction checkAbort(signal: AbortSignal | undefined): void {\n  if (signal === undefined) return;\n  if (signal.aborted) {\n    if (typeof signal.throwIfAborted === 'function') {\n      signal.throwIfAborted();\n    }\n    throw new DOMException('The operation was aborted.', 'AbortError');\n  }\n}\n\nfunction warnBypass(): void {\n  // Use the structured logger once it lands (Phase 04 follow-up). For\n  // now, surface a one-shot console.warn so operators notice the\n  // regression risk per the Phase 10b spec (\"WARN-once per process\").\n  console.warn(\n    '[graphorin/memory] conflict pipeline disabled (mode: \"off\"). ' +\n      'Semantic writes fall back to a straight-through path — bi-temporal supersede / dedup ' +\n      'will not fire until you re-enable the pipeline.',\n  );\n}\n"],"mappings":";;;;;;;;;;;AA4BA,IAAI,mBAAmB;;;;;;;AAQvB,SAAgB,gCAAsC;AACpD,oBAAmB;;;;;;;;;;;AAYrB,eAAsB,oBAAoB,MAIZ;AAE5B,QADiB,uBAAuB,KAAK,WAAW,EAAE,CAAC,CAC3C,IAAI,KAAK,MAAM,KAAK,UAAU;;;;;;;AAQhD,SAAgB,uBAAuB,UAAmC,EAAE,EAAoB;CAC9F,MAAMA,OAAqB,QAAQ,QAAQ;CAC3C,MAAMC,aAAyB,QAAQ,cAAc;CACrD,MAAMC,aAAiC,OAAO,OAAO;EACnD,KAAK,QAAQ,YAAY,OAAO,4BAA4B;EAC5D,SAAS,QAAQ,YAAY,WAAW,4BAA4B;EACpE,MAAM,QAAQ,YAAY,QAAQ,4BAA4B;EAC/D,CAAC;AACF,oBAAmB,WAAW;CAC9B,MAAM,aAAa,QAAQ,cAAc;CACzC,MAAM,MAAM,QAAQ,+BAAsB,IAAI,MAAM,EAAC,aAAa;CAElE,eAAe,IAAI,MAA4B,WAA4C;AACzF,MAAI,SAAS,OAAO;AAClB,OAAI,CAAC,kBAAkB;AACrB,uBAAmB;AACnB,gBAAY;;AAEd,UAAO;IAAE,MAAM;IAAS,OAAO;IAAe,QAAQ;IAAqB;;AAG7E,aAAW,KAAK,OAAO;EACvB,MAAM,gBAAgB,QAAQ,iBAAiB,KAAK,MAAM;AAE1D,SAAO,eACL,KAAK,QACL,mBACA;GACE,QAAQ,UAAU;GAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;GAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;GAC1E,EACD;GACE,gCAAgC,UAAU;GAC1C,+BAA+B,WAAW;GAC3C,EACD,OAAO,SAAS;GACd,MAAM,WAAW,MAAM,wBAAwB,MAAM,WAAW,WAAW;GAO3E,MAAM,WAAW,MAAM,YANG;IACxB;IACA;IACA;IACA;IACD,CACsC;AACvC,SAAM,gBAAgB,UAAU,WAAW,eAAe,IAAI;AAC9D,QAAK,cAAc;IACjB,yBAAyB,SAAS;IAClC,4BAA4B,SAAS;IACrC,mCAAmC,SAAS;IAC5C,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,8BAA8B,SAAS,YAAY,GACrD,EAAE;IACN,GAAI,SAAS,SAAS,aAAa,SAAS,eAAe,SACvD,EAAE,8BAA8B,SAAS,YAAY,GACrD,EAAE;IACN,GAAI,SAAS,SAAS,UAClB,EAAE,0BAA0B,SAAS,UAAU,eAAe,GAC9D,SAAS,WAAW,SAClB,EAAE,0BAA0B,SAAS,QAAQ,GAC7C,EAAE;IACT,CAAC;AACF,UAAO;IAEV;;;;;;;;;;;;;;;;;;CAmBH,eAAe,YAAY,KAA8C;EACvE,MAAM,SAAS,MAAM,iBAAiB,SAAS,IAAI;AACnD,MAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,eAAe,QAAQ,IAAI,UAAU;EAGnE,MAAM,SAAS,MAAM,yBAAyB,SAAS,IAAI;AAC3D,MAAI,OAAO,SAAS,WAAW,OAAO,WAAW,qBAC/C,QAAO,qBAAqB,wBAAwB,QAAQ,IAAI,UAAU;AAG5E,MAAI,IAAI,SAAS,SAAS,GAAG;GAC3B,MAAM,SAAS,MAAM,qBAAqB,SAAS,IAAI;AACvD,OAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,mBAAmB,QAAQ,IAAI,UAAU;GAEvE,MAAM,SAAS,MAAM,uBAAuB,SAAS,IAAI;AACzD,OAAI,OAAO,SAAS,WAClB,QAAO,qBAAqB,qBAAqB,QAAQ,IAAI,UAAU;;AAI3E,MAAI,OAAO,SAAS,WAAW,OAAO,SAAS,QAC7C,QAAO,qBAAqB,wBAAwB,QAAQ,IAAI,UAAU;AAI5E,SAAO,qBAAqB,iBADb,MAAM,kBAAkB,SAAS,IAAI,EACC,IAAI,UAAU;;AAGrE,QAAO,OAAO,OAAO;EACnB;EACA;EACA;EACA;EACD,CAAC;;AAGJ,SAAS,qBACP,OACA,SACA,WACkB;AAClB,SAAQ,QAAQ,MAAhB;EACE,KAAK,WACH,QAAO;GAAE,MAAM;GAAS;GAAO,QAAQ;GAAwB;EACjE,KAAK,QACH,QAAO;GACL,MAAM;GACN;GACA,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;EACH,KAAK,QACH,QAAO;GACL,MAAM;GACN;GACA,YAAY,QAAQ;GACpB,GAAI,QAAQ,eAAe,SAAY,EAAE,YAAY,QAAQ,YAAY,GAAG,EAAE;GAC9E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;EACH,KAAK,YACH,QAAO;GACL,MAAM;GACN;GACA,YAAY,QAAQ;GACpB,QAAQ,QAAQ;GACjB;EACH,KAAK,UACH,QAAO;GACL,MAAM;GACN;GACA,aAAa,UAAU;GACvB,gBAAgB,QAAQ;GACxB,GAAI,QAAQ,eAAe,SAAY,EAAE,YAAY,QAAQ,YAAY,GAAG,EAAE;GAC9E,GAAI,QAAQ,WAAW,SAAY,EAAE,QAAQ,QAAQ,QAAQ,GAAG,EAAE;GACnE;;;AAIP,eAAe,gBACb,UACA,WACA,eACA,KACe;AACf,KAAI,kBAAkB,OAAW;CACjC,MAAM,QAAQ;EACZ,QAAQ,UAAU;EAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;EAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;EAC1E;CACD,MAAM,gBAAgB,eAAe,SAAS;CAC9C,MAAMC,aAAiF;EACrF;EACA,aAAa,UAAU;EACvB,UAAU,SAAS;EACnB,OAAO,SAAS;EAChB,GAAI,kBAAkB,SAAY,EAAE,eAAe,GAAG,EAAE;EACxD,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,cAAc,EAAE,YAAY,SAAS,YAAY,GAAG,EAAE;EAC5E,GAAI,SAAS,SAAS,WAAW,SAAS,eAAe,SACrD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,aAAa,SAAS,eAAe,SACvD,EAAE,YAAY,SAAS,YAAY,GACnC,EAAE;EACN,GAAI,SAAS,SAAS,WAAW,SAAS,WAAW,SACjD,EAAE,QAAQ,SAAS,QAAQ,GAC3B,EAAE;EACN,GAAI,SAAS,SAAS,WAAW,SAAS,WAAW,SACjD,EAAE,QAAQ,SAAS,QAAQ,GAC3B,EAAE;EACP;AACD,OAAM,cAAc,eAAe,WAAW;AAC9C,KAAI,SAAS,SAAS,UACpB,OAAM,cAAc,eAAe;EACjC;EACA,QAAQ,UAAU;EAClB,eAAe,UAAU;EACzB,OAAO,SAAS;EAChB,gBAAgB,SAAS;EACzB,GAAI,SAAS,WAAW,SAAY,EAAE,QAAQ,SAAS,QAAQ,GAAG,EAAE;EACrE,CAAC;;AAKN,SAAS,eAAe,UAAgD;AACtE,SAAQ,SAAS,MAAjB;EACE,KAAK;AACH,OAAI,SAAS,WAAW,sBAAuB,QAAO;AACtD;EACF,KAAK;AACH,OAAI,SAAS,WAAW,qBAAsB,QAAO;AACrD,OAAI,SAAS,WAAW,0BAA2B,QAAO;AAC1D,OAAI,SAAS,WAAW,mBAAoB,QAAO;AACnD,OAAI,SAAS,WAAW,sCAAuC,QAAO;AACtE;EACF,KAAK;AACH,OAAI,SAAS,OAAO,WAAW,yBAAyB,CAAE,QAAO;AACjE,OAAI,SAAS,OAAO,WAAW,iBAAiB,CAAE,QAAO;AACzD,OAAI,SAAS,OAAO,WAAW,0BAA0B,CAAE,QAAO;AAClE;EACF,KAAK,UACH,QAAO;;;AAIb,eAAe,wBACb,MACA,WACA,MACyC;AACzC,KAAI,KAAK,aAAa,QAAQ,KAAK,eAAe,KAAM,QAAO,EAAE;CACjE,MAAM,UAAU,KAAK,MAAM;AAC3B,KAAI,OAAO,QAAQ,iBAAiB,WAAY,QAAO,EAAE;AACzD,YAAW,KAAK,OAAO;CAGvB,MAAM,CAAC,UAAU,MAAM,KAAK,SAAS,MAAM,CAAC,UAAU,KAAK,EAAE,EAAE,UAAU,WAAW,CAAC;AACrF,KAAI,WAAW,OAAW,QAAO,EAAE;AACnC,YAAW,KAAK,OAAO;CACvB,MAAM,QAAQ;EACZ,QAAQ,UAAU;EAClB,GAAI,UAAU,cAAc,SAAY,EAAE,WAAW,UAAU,WAAW,GAAG,EAAE;EAC/E,GAAI,UAAU,YAAY,SAAY,EAAE,SAAS,UAAU,SAAS,GAAG,EAAE;EAC1E;CAMD,IAAIC;AACJ,KAAI;AACF,SAAO,MAAM,QAAQ,aAAa,OAAO,QAAQ,KAAK,YAAY,KAAK;UAChE,KAAK;AACZ,MAAI,eAAe,SAAS,IAAI,SAAS,aAAc,OAAM;AAC7D,SAAO,EAAE;;AAEX,QAAO,CAAC,GAAG,KAAK,CAAC,QAAQ,QAAQ,IAAI,OAAO,OAAO,UAAU,GAAG;;AAGlE,SAAS,mBAAmB,YAAsC;AAChE,KACE,EACE,WAAW,OAAO,WAAW,WAC7B,WAAW,WAAW,WAAW,QACjC,WAAW,OAAO,KAClB,WAAW,QAAQ,GAGrB,OAAM,IAAI,UACR,kGAAkG,KAAK,UAAU,WAAW,CAAC,GAC9H;;;;;;;;AAUL,SAAS,WAAW,QAAuC;AACzD,KAAI,WAAW,OAAW;AAC1B,KAAI,OAAO,SAAS;AAClB,MAAI,OAAO,OAAO,mBAAmB,WACnC,QAAO,gBAAgB;AAEzB,QAAM,IAAI,aAAa,8BAA8B,aAAa;;;AAItE,SAAS,aAAmB;AAI1B,SAAQ,KACN,sMAGD"}

package/dist/conflict/stages/helpers.js

@@ -0,0 +1,66 @@
+import { md5 } from "@graphorin/core";
+
+//#region src/conflict/stages/helpers.ts
+/**
+* Internal helpers shared across the five pipeline stages.
+*
+* @packageDocumentation
+* @internal
+*/
+/**
+* Lowercase + collapse whitespace + trim. Used by Stage 1 (exact
+* dedup) to compute the canonical fact body that feeds the MD5
+* comparison.
+*/
+function canonicaliseFactBody(text) {
+	return text.replace(/\s+/g, " ").trim().toLowerCase();
+}
+/**
+* Stable hash for a canonical fact body. We re-use the framework's
+* MD5 helper to stay consistent with the storage layer's existing
+* dedup hash column (see `facts.hash`).
+*/
+function fastFactHash(text) {
+	return md5(text);
+}
+/** Strip leading articles + trim a candidate subject token. */
+function normaliseSubject(input, pack) {
+	const tokens = canonicaliseFactBody(input).split(" ");
+	const stop = new Set(pack.subjectStopWords.map((s) => s.toLowerCase()));
+	return tokens.filter((token) => token.length > 0 && !stop.has(token)).join(" ");
+}
+/**
+* Naive subject / predicate / object split. The locale pack supplies
+* the verb tokens used as predicate normalisers — the first matching
+* verb in the sentence becomes the predicate and splits the rest
+* into subject (left side) and object (right side). The split is
+* intentionally simple: anything more clever lives behind the entity-
+* linking layer (post-MVP).
+*/
+function splitSubjectPredicateObject(text, pack) {
+	const canonical = canonicaliseFactBody(text);
+	if (canonical.length === 0) return null;
+	const tokens = canonical.split(" ");
+	const verbs = new Set(pack.predicateNormalisers.map((v) => v.toLowerCase()));
+	for (let i = 0; i < tokens.length; i++) {
+		const token = tokens[i];
+		if (token === void 0) continue;
+		const stripped = token.replace(/[.,!?;:]/g, "");
+		if (verbs.has(stripped)) {
+			const subject = normaliseSubject(tokens.slice(0, i).join(" "), pack);
+			const predicate = stripped;
+			const object = canonicaliseFactBody(tokens.slice(i + 1).join(" "));
+			if (subject.length === 0 || object.length === 0) continue;
+			return {
+				subject,
+				predicate,
+				object
+			};
+		}
+	}
+	return null;
+}
+
+//#endregion
+export { canonicaliseFactBody, fastFactHash, splitSubjectPredicateObject };
+//# sourceMappingURL=helpers.js.map

package/dist/conflict/stages/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","names":[],"sources":["../../../src/conflict/stages/helpers.ts"],"sourcesContent":["/**\n * Internal helpers shared across the five pipeline stages.\n *\n * @packageDocumentation\n * @internal\n */\n\nimport { md5 } from '@graphorin/core';\nimport type { LocalePack } from '../locale-packs/index.js';\n\n/**\n * Lowercase + collapse whitespace + trim. Used by Stage 1 (exact\n * dedup) to compute the canonical fact body that feeds the MD5\n * comparison.\n */\nexport function canonicaliseFactBody(text: string): string {\n  return text.replace(/\\s+/g, ' ').trim().toLowerCase();\n}\n\n/**\n * Stable hash for a canonical fact body. We re-use the framework's\n * MD5 helper to stay consistent with the storage layer's existing\n * dedup hash column (see `facts.hash`).\n */\nexport function fastFactHash(text: string): string {\n  return md5(text);\n}\n\n/** Strip leading articles + trim a candidate subject token. */\nexport function normaliseSubject(input: string, pack: LocalePack): string {\n  const tokens = canonicaliseFactBody(input).split(' ');\n  const stop = new Set(pack.subjectStopWords.map((s) => s.toLowerCase()));\n  return tokens.filter((token) => token.length > 0 && !stop.has(token)).join(' ');\n}\n\n/**\n * Naive subject / predicate / object split. The locale pack supplies\n * the verb tokens used as predicate normalisers — the first matching\n * verb in the sentence becomes the predicate and splits the rest\n * into subject (left side) and object (right side). The split is\n * intentionally simple: anything more clever lives behind the entity-\n * linking layer (post-MVP).\n */\nexport function splitSubjectPredicateObject(\n  text: string,\n  pack: LocalePack,\n): { readonly subject: string; readonly predicate: string; readonly object: string } | null {\n  const canonical = canonicaliseFactBody(text);\n  if (canonical.length === 0) return null;\n  const tokens = canonical.split(' ');\n  const verbs = new Set(pack.predicateNormalisers.map((v) => v.toLowerCase()));\n  for (let i = 0; i < tokens.length; i++) {\n    const token = tokens[i];\n    if (token === undefined) continue;\n    const stripped = token.replace(/[.,!?;:]/g, '');\n    if (verbs.has(stripped)) {\n      const subject = normaliseSubject(tokens.slice(0, i).join(' '), pack);\n      const predicate = stripped;\n      const object = canonicaliseFactBody(tokens.slice(i + 1).join(' '));\n      if (subject.length === 0 || object.length === 0) continue;\n      return { subject, predicate, object };\n    }\n  }\n  return null;\n}\n"],"mappings":";;;;;;;;;;;;;;AAeA,SAAgB,qBAAqB,MAAsB;AACzD,QAAO,KAAK,QAAQ,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa;;;;;;;AAQvD,SAAgB,aAAa,MAAsB;AACjD,QAAO,IAAI,KAAK;;;AAIlB,SAAgB,iBAAiB,OAAe,MAA0B;CACxE,MAAM,SAAS,qBAAqB,MAAM,CAAC,MAAM,IAAI;CACrD,MAAM,OAAO,IAAI,IAAI,KAAK,iBAAiB,KAAK,MAAM,EAAE,aAAa,CAAC,CAAC;AACvE,QAAO,OAAO,QAAQ,UAAU,MAAM,SAAS,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,KAAK,IAAI;;;;;;;;;;AAWjF,SAAgB,4BACd,MACA,MAC0F;CAC1F,MAAM,YAAY,qBAAqB,KAAK;AAC5C,KAAI,UAAU,WAAW,EAAG,QAAO;CACnC,MAAM,SAAS,UAAU,MAAM,IAAI;CACnC,MAAM,QAAQ,IAAI,IAAI,KAAK,qBAAqB,KAAK,MAAM,EAAE,aAAa,CAAC,CAAC;AAC5E,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,MAAM,QAAQ,OAAO;AACrB,MAAI,UAAU,OAAW;EACzB,MAAM,WAAW,MAAM,QAAQ,aAAa,GAAG;AAC/C,MAAI,MAAM,IAAI,SAAS,EAAE;GACvB,MAAM,UAAU,iBAAiB,OAAO,MAAM,GAAG,EAAE,CAAC,KAAK,IAAI,EAAE,KAAK;GACpE,MAAM,YAAY;GAClB,MAAM,SAAS,qBAAqB,OAAO,MAAM,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC;AAClE,OAAI,QAAQ,WAAW,KAAK,OAAO,WAAW,EAAG;AACjD,UAAO;IAAE;IAAS;IAAW;IAAQ;;;AAGzC,QAAO"}

package/dist/conflict/stages/stage1-exact-dedup.js

@@ -0,0 +1,21 @@
+import { canonicaliseFactBody, fastFactHash } from "./helpers.js";
+
+//#region src/conflict/stages/stage1-exact-dedup.ts
+const stage1ExactDedup = {
+	id: "exact-dedup",
+	async evaluate(ctx) {
+		const candidateHash = fastFactHash(canonicaliseFactBody(ctx.candidate.text));
+		if (ctx.existing.length === 0) return { kind: "continue" };
+		for (const hit of ctx.existing) if (fastFactHash(canonicaliseFactBody(hit.record.text)) === candidateHash) return {
+			kind: "dedup",
+			existingId: hit.record.id,
+			similarity: 1,
+			reason: "exact-hash-match"
+		};
+		return { kind: "continue" };
+	}
+};
+
+//#endregion
+export { stage1ExactDedup };
+//# sourceMappingURL=stage1-exact-dedup.js.map

package/dist/conflict/stages/stage1-exact-dedup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stage1-exact-dedup.js","names":["stage1ExactDedup: PipelineStage"],"sources":["../../../src/conflict/stages/stage1-exact-dedup.ts"],"sourcesContent":["/**\n * Stage 1 — Exact dedup. Computes an MD5 hash on the canonical fact\n * body (lowercase + trimmed + collapsed whitespace) and short-circuits\n * to `dedup` when an existing fact in the supplied vector hit list\n * shares the same canonical form.\n *\n * Stage 1 only inspects `existing` when Stage 2 already populated it\n * for the orchestrator (re-using the embedding round-trip). When the\n * orchestrator calls Stage 1 with an empty list the stage falls\n * through to `'continue'` — Stage 2 will gather candidates and Stage 1\n * is folded into Stage 2's HOT zone via the same canonical-form\n * comparison.\n *\n * @packageDocumentation\n */\n\nimport type { PipelineStage } from '../types.js';\nimport { canonicaliseFactBody, fastFactHash } from './helpers.js';\n\nexport const stage1ExactDedup: PipelineStage = {\n  id: 'exact-dedup',\n  async evaluate(ctx) {\n    const candidateHash = fastFactHash(canonicaliseFactBody(ctx.candidate.text));\n    if (ctx.existing.length === 0) {\n      return { kind: 'continue' };\n    }\n    for (const hit of ctx.existing) {\n      const existingHash = fastFactHash(canonicaliseFactBody(hit.record.text));\n      if (existingHash === candidateHash) {\n        return {\n          kind: 'dedup',\n          existingId: hit.record.id,\n          similarity: 1,\n          reason: 'exact-hash-match',\n        };\n      }\n    }\n    return { kind: 'continue' };\n  },\n};\n"],"mappings":";;;AAmBA,MAAaA,mBAAkC;CAC7C,IAAI;CACJ,MAAM,SAAS,KAAK;EAClB,MAAM,gBAAgB,aAAa,qBAAqB,IAAI,UAAU,KAAK,CAAC;AAC5E,MAAI,IAAI,SAAS,WAAW,EAC1B,QAAO,EAAE,MAAM,YAAY;AAE7B,OAAK,MAAM,OAAO,IAAI,SAEpB,KADqB,aAAa,qBAAqB,IAAI,OAAO,KAAK,CAAC,KACnD,cACnB,QAAO;GACL,MAAM;GACN,YAAY,IAAI,OAAO;GACvB,YAAY;GACZ,QAAQ;GACT;AAGL,SAAO,EAAE,MAAM,YAAY;;CAE9B"}

package/dist/conflict/stages/stage2-embedding-three-zone.js

@@ -0,0 +1,37 @@
+//#region src/conflict/stages/stage2-embedding-three-zone.ts
+const stage2EmbeddingThreeZone = {
+	id: "embedding-three-zone",
+	async evaluate(ctx) {
+		if (ctx.existing.length === 0) return {
+			kind: "admit",
+			reason: "no-existing-candidates"
+		};
+		const top = ctx.existing[0];
+		if (top === void 0) return {
+			kind: "admit",
+			reason: "no-existing-candidates"
+		};
+		const similarity = top.score;
+		if (similarity >= ctx.thresholds.hot) return {
+			kind: "dedup",
+			existingId: top.record.id,
+			similarity,
+			reason: "embedding-hot-zone"
+		};
+		if (similarity >= ctx.thresholds.nearDup) return {
+			kind: "dedup",
+			existingId: top.record.id,
+			similarity,
+			reason: "embedding-near-dup-zone"
+		};
+		if (similarity > ctx.thresholds.cold) return { kind: "continue" };
+		return {
+			kind: "admit",
+			reason: "embedding-cold-zone"
+		};
+	}
+};
+
+//#endregion
+export { stage2EmbeddingThreeZone };
+//# sourceMappingURL=stage2-embedding-three-zone.js.map

package/dist/conflict/stages/stage2-embedding-three-zone.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stage2-embedding-three-zone.js","names":["stage2EmbeddingThreeZone: PipelineStage"],"sources":["../../../src/conflict/stages/stage2-embedding-three-zone.ts"],"sourcesContent":["/**\n * Stage 2 — Embedding three-zone classifier (RB-02 §8.1).\n *\n * Inspects the candidate similarity against the top-K nearest\n * neighbours surfaced by the semantic vector store and routes the\n * decision into one of four zones:\n *\n *  - HOT (`sim ≥ thresholds.hot`): silent dedup — the existing fact is\n *    semantically identical, no audit-worthy conflict.\n *  - NEAR-DUP (`thresholds.nearDup ≤ sim < thresholds.hot`): same\n *    fact phrased differently — dedup with `near-dup` zone label so\n *    operators can spot the case in `fact_conflicts`.\n *  - CONFLICT-CHECK (`thresholds.cold < sim < thresholds.nearDup`):\n *    candidate sounds related; defer decision to Stages 3 → 4 → 5.\n *  - COLD (`sim ≤ thresholds.cold`): no conflict — admit the candidate.\n *\n * @packageDocumentation\n */\n\nimport type { PipelineStage, StageOutcome } from '../types.js';\n\nexport const stage2EmbeddingThreeZone: PipelineStage = {\n  id: 'embedding-three-zone',\n  async evaluate(ctx): Promise<StageOutcome> {\n    if (ctx.existing.length === 0) {\n      return { kind: 'admit', reason: 'no-existing-candidates' };\n    }\n    const top = ctx.existing[0];\n    if (top === undefined) {\n      return { kind: 'admit', reason: 'no-existing-candidates' };\n    }\n    const similarity = top.score;\n    if (similarity >= ctx.thresholds.hot) {\n      return {\n        kind: 'dedup',\n        existingId: top.record.id,\n        similarity,\n        reason: 'embedding-hot-zone',\n      };\n    }\n    if (similarity >= ctx.thresholds.nearDup) {\n      return {\n        kind: 'dedup',\n        existingId: top.record.id,\n        similarity,\n        reason: 'embedding-near-dup-zone',\n      };\n    }\n    if (similarity > ctx.thresholds.cold) {\n      return { kind: 'continue' };\n    }\n    return { kind: 'admit', reason: 'embedding-cold-zone' };\n  },\n};\n"],"mappings":";AAqBA,MAAaA,2BAA0C;CACrD,IAAI;CACJ,MAAM,SAAS,KAA4B;AACzC,MAAI,IAAI,SAAS,WAAW,EAC1B,QAAO;GAAE,MAAM;GAAS,QAAQ;GAA0B;EAE5D,MAAM,MAAM,IAAI,SAAS;AACzB,MAAI,QAAQ,OACV,QAAO;GAAE,MAAM;GAAS,QAAQ;GAA0B;EAE5D,MAAM,aAAa,IAAI;AACvB,MAAI,cAAc,IAAI,WAAW,IAC/B,QAAO;GACL,MAAM;GACN,YAAY,IAAI,OAAO;GACvB;GACA,QAAQ;GACT;AAEH,MAAI,cAAc,IAAI,WAAW,QAC/B,QAAO;GACL,MAAM;GACN,YAAY,IAAI,OAAO;GACvB;GACA,QAAQ;GACT;AAEH,MAAI,aAAa,IAAI,WAAW,KAC9B,QAAO,EAAE,MAAM,YAAY;AAE7B,SAAO;GAAE,MAAM;GAAS,QAAQ;GAAuB;;CAE1D"}

package/dist/conflict/stages/stage3-heuristic-regex.js

@@ -0,0 +1,45 @@
+import { evaluateMarkers } from "../locale-packs/types.js";
+import "../locale-packs/index.js";
+
+//#region src/conflict/stages/stage3-heuristic-regex.ts
+/**
+* Stage 3 — Heuristic regex (per-locale, pluggable).
+*
+* Inspects the candidate fact body for explicit supersede or negation
+* markers from the active locale pack (English by default). When a
+* marker fires the stage emits a `supersede` outcome against the
+* highest-scoring CONFLICT-CHECK candidate from Stage 2.
+*
+* @packageDocumentation
+*/
+const stage3HeuristicRegex = {
+	id: "heuristic-regex",
+	async evaluate(ctx) {
+		const top = ctx.existing[0];
+		if (top === void 0) return { kind: "continue" };
+		const candidateText = ctx.candidate.text;
+		const supersede = evaluateMarkers(candidateText, ctx.localePack.supersedeMarkers);
+		if (supersede.matched) return {
+			kind: "supersede",
+			existingId: top.record.id,
+			reason: formatReason("regex-supersede-marker", supersede)
+		};
+		const negation = evaluateMarkers(candidateText, ctx.localePack.negationMarkers);
+		if (negation.matched) return {
+			kind: "supersede",
+			existingId: top.record.id,
+			reason: formatReason("regex-negation", negation)
+		};
+		return { kind: "continue" };
+	}
+};
+function formatReason(base, match) {
+	const parts = [base];
+	if (match.kind !== void 0) parts.push(`kind=${match.kind}`);
+	if (match.excerpt !== void 0) parts.push(`marker=${match.excerpt}`);
+	return parts.join("; ");
+}
+
+//#endregion
+export { stage3HeuristicRegex };
+//# sourceMappingURL=stage3-heuristic-regex.js.map

package/dist/conflict/stages/stage3-heuristic-regex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stage3-heuristic-regex.js","names":["stage3HeuristicRegex: PipelineStage"],"sources":["../../../src/conflict/stages/stage3-heuristic-regex.ts"],"sourcesContent":["/**\n * Stage 3 — Heuristic regex (per-locale, pluggable).\n *\n * Inspects the candidate fact body for explicit supersede or negation\n * markers from the active locale pack (English by default). When a\n * marker fires the stage emits a `supersede` outcome against the\n * highest-scoring CONFLICT-CHECK candidate from Stage 2.\n *\n * @packageDocumentation\n */\n\nimport { evaluateMarkers } from '../locale-packs/index.js';\nimport type { PipelineStage, StageOutcome } from '../types.js';\n\nexport const stage3HeuristicRegex: PipelineStage = {\n  id: 'heuristic-regex',\n  async evaluate(ctx): Promise<StageOutcome> {\n    const top = ctx.existing[0];\n    if (top === undefined) {\n      return { kind: 'continue' };\n    }\n    const candidateText = ctx.candidate.text;\n    const supersede = evaluateMarkers(candidateText, ctx.localePack.supersedeMarkers);\n    if (supersede.matched) {\n      return {\n        kind: 'supersede',\n        existingId: top.record.id,\n        reason: formatReason('regex-supersede-marker', supersede),\n      };\n    }\n    const negation = evaluateMarkers(candidateText, ctx.localePack.negationMarkers);\n    if (negation.matched) {\n      return {\n        kind: 'supersede',\n        existingId: top.record.id,\n        reason: formatReason('regex-negation', negation),\n      };\n    }\n    return { kind: 'continue' };\n  },\n};\n\nfunction formatReason(\n  base: string,\n  match: { kind?: string | undefined; excerpt?: string | undefined },\n): string {\n  const parts = [base];\n  if (match.kind !== undefined) parts.push(`kind=${match.kind}`);\n  if (match.excerpt !== undefined) parts.push(`marker=${match.excerpt}`);\n  return parts.join('; ');\n}\n"],"mappings":";;;;;;;;;;;;;;AAcA,MAAaA,uBAAsC;CACjD,IAAI;CACJ,MAAM,SAAS,KAA4B;EACzC,MAAM,MAAM,IAAI,SAAS;AACzB,MAAI,QAAQ,OACV,QAAO,EAAE,MAAM,YAAY;EAE7B,MAAM,gBAAgB,IAAI,UAAU;EACpC,MAAM,YAAY,gBAAgB,eAAe,IAAI,WAAW,iBAAiB;AACjF,MAAI,UAAU,QACZ,QAAO;GACL,MAAM;GACN,YAAY,IAAI,OAAO;GACvB,QAAQ,aAAa,0BAA0B,UAAU;GAC1D;EAEH,MAAM,WAAW,gBAAgB,eAAe,IAAI,WAAW,gBAAgB;AAC/E,MAAI,SAAS,QACX,QAAO;GACL,MAAM;GACN,YAAY,IAAI,OAAO;GACvB,QAAQ,aAAa,kBAAkB,SAAS;GACjD;AAEH,SAAO,EAAE,MAAM,YAAY;;CAE9B;AAED,SAAS,aACP,MACA,OACQ;CACR,MAAM,QAAQ,CAAC,KAAK;AACpB,KAAI,MAAM,SAAS,OAAW,OAAM,KAAK,QAAQ,MAAM,OAAO;AAC9D,KAAI,MAAM,YAAY,OAAW,OAAM,KAAK,UAAU,MAAM,UAAU;AACtE,QAAO,MAAM,KAAK,KAAK"}

package/dist/conflict/stages/stage4-subject-predicate.js

@@ -0,0 +1,31 @@
+import { splitSubjectPredicateObject } from "./helpers.js";
+
+//#region src/conflict/stages/stage4-subject-predicate.ts
+const stage4SubjectPredicate = {
+	id: "subject-predicate",
+	async evaluate(ctx) {
+		const candidateTriple = splitSubjectPredicateObject(ctx.candidate.text, ctx.localePack);
+		if (candidateTriple === null) return { kind: "continue" };
+		for (const hit of ctx.existing) {
+			const existingTriple = splitSubjectPredicateObject(hit.record.text, ctx.localePack);
+			if (existingTriple === null) continue;
+			if (candidateTriple.subject !== existingTriple.subject) continue;
+			if (candidateTriple.predicate !== existingTriple.predicate) continue;
+			if (candidateTriple.object === existingTriple.object) return {
+				kind: "dedup",
+				existingId: hit.record.id,
+				reason: "subject-predicate-match-same-object"
+			};
+			return {
+				kind: "supersede",
+				existingId: hit.record.id,
+				reason: `subject-predicate-match; subject=${candidateTriple.subject}; predicate=${candidateTriple.predicate}`
+			};
+		}
+		return { kind: "continue" };
+	}
+};
+
+//#endregion
+export { stage4SubjectPredicate };
+//# sourceMappingURL=stage4-subject-predicate.js.map

package/dist/conflict/stages/stage4-subject-predicate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stage4-subject-predicate.js","names":["stage4SubjectPredicate: PipelineStage"],"sources":["../../../src/conflict/stages/stage4-subject-predicate.ts"],"sourcesContent":["/**\n * Stage 4 — Subject / predicate match.\n *\n * Naively splits each fact body into `(subject, predicate, object)`\n * triples using the locale pack's predicate normalisers. When the\n * candidate and an existing CONFLICT-CHECK fact share the same\n * subject + predicate but differ on the object, Stage 4 marks the\n * existing fact as superseded.\n *\n * The split is intentionally simple: anything more sophisticated\n * (full entity linking) lives in the post-MVP knowledge-graph layer.\n *\n * @packageDocumentation\n */\n\nimport type { PipelineStage, StageOutcome } from '../types.js';\nimport { splitSubjectPredicateObject } from './helpers.js';\n\nexport const stage4SubjectPredicate: PipelineStage = {\n  id: 'subject-predicate',\n  async evaluate(ctx): Promise<StageOutcome> {\n    const candidateTriple = splitSubjectPredicateObject(ctx.candidate.text, ctx.localePack);\n    if (candidateTriple === null) {\n      return { kind: 'continue' };\n    }\n    for (const hit of ctx.existing) {\n      const existingTriple = splitSubjectPredicateObject(hit.record.text, ctx.localePack);\n      if (existingTriple === null) continue;\n      if (candidateTriple.subject !== existingTriple.subject) continue;\n      if (candidateTriple.predicate !== existingTriple.predicate) continue;\n      if (candidateTriple.object === existingTriple.object) {\n        return {\n          kind: 'dedup',\n          existingId: hit.record.id,\n          reason: 'subject-predicate-match-same-object',\n        };\n      }\n      return {\n        kind: 'supersede',\n        existingId: hit.record.id,\n        reason: `subject-predicate-match; subject=${candidateTriple.subject}; predicate=${candidateTriple.predicate}`,\n      };\n    }\n    return { kind: 'continue' };\n  },\n};\n"],"mappings":";;;AAkBA,MAAaA,yBAAwC;CACnD,IAAI;CACJ,MAAM,SAAS,KAA4B;EACzC,MAAM,kBAAkB,4BAA4B,IAAI,UAAU,MAAM,IAAI,WAAW;AACvF,MAAI,oBAAoB,KACtB,QAAO,EAAE,MAAM,YAAY;AAE7B,OAAK,MAAM,OAAO,IAAI,UAAU;GAC9B,MAAM,iBAAiB,4BAA4B,IAAI,OAAO,MAAM,IAAI,WAAW;AACnF,OAAI,mBAAmB,KAAM;AAC7B,OAAI,gBAAgB,YAAY,eAAe,QAAS;AACxD,OAAI,gBAAgB,cAAc,eAAe,UAAW;AAC5D,OAAI,gBAAgB,WAAW,eAAe,OAC5C,QAAO;IACL,MAAM;IACN,YAAY,IAAI,OAAO;IACvB,QAAQ;IACT;AAEH,UAAO;IACL,MAAM;IACN,YAAY,IAAI,OAAO;IACvB,QAAQ,oCAAoC,gBAAgB,QAAQ,cAAc,gBAAgB;IACnG;;AAEH,SAAO,EAAE,MAAM,YAAY;;CAE9B"}

package/dist/conflict/stages/stage5-defer-to-deep.js

@@ -0,0 +1,22 @@
+//#region src/conflict/stages/stage5-defer-to-deep.ts
+const stage5DeferToDeep = {
+	id: "defer-to-deep",
+	async evaluate(ctx) {
+		if (ctx.existing.length === 0) return {
+			kind: "admit",
+			reason: "stage5-no-candidates"
+		};
+		const conflictingIds = ctx.existing.map((hit) => hit.record.id);
+		const top = ctx.existing[0];
+		return {
+			kind: "pending",
+			conflictingIds,
+			...top !== void 0 ? { similarity: top.score } : {},
+			reason: "awaiting-deep-llm-judge"
+		};
+	}
+};
+
+//#endregion
+export { stage5DeferToDeep };
+//# sourceMappingURL=stage5-defer-to-deep.js.map

package/dist/conflict/stages/stage5-defer-to-deep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stage5-defer-to-deep.js","names":["stage5DeferToDeep: PipelineStage"],"sources":["../../../src/conflict/stages/stage5-defer-to-deep.ts"],"sourcesContent":["/**\n * Stage 5 — Defer to deep LLM judge.\n *\n * Reached only when Stages 1–4 left the decision unresolved. The\n * stage records every CONFLICT-CHECK candidate id surfaced by Stage 2\n * so the orchestrator can hand the queue write to the storage layer\n * (the actual `conflict_check_pending` insert is the orchestrator's\n * responsibility — Stage 5 only computes the payload).\n *\n * The candidate fact itself is admitted with a `pending` flag so it\n * remains searchable; the deep phase (Phase 10c) drains the queue and\n * applies the resolution later.\n *\n * @packageDocumentation\n */\n\nimport type { PipelineStage, StageOutcome } from '../types.js';\n\nexport const stage5DeferToDeep: PipelineStage = {\n  id: 'defer-to-deep',\n  async evaluate(ctx): Promise<StageOutcome> {\n    if (ctx.existing.length === 0) {\n      return { kind: 'admit', reason: 'stage5-no-candidates' };\n    }\n    const conflictingIds = ctx.existing.map((hit) => hit.record.id);\n    const top = ctx.existing[0];\n    return {\n      kind: 'pending',\n      conflictingIds,\n      ...(top !== undefined ? { similarity: top.score } : {}),\n      reason: 'awaiting-deep-llm-judge',\n    };\n  },\n};\n"],"mappings":";AAkBA,MAAaA,oBAAmC;CAC9C,IAAI;CACJ,MAAM,SAAS,KAA4B;AACzC,MAAI,IAAI,SAAS,WAAW,EAC1B,QAAO;GAAE,MAAM;GAAS,QAAQ;GAAwB;EAE1D,MAAM,iBAAiB,IAAI,SAAS,KAAK,QAAQ,IAAI,OAAO,GAAG;EAC/D,MAAM,MAAM,IAAI,SAAS;AACzB,SAAO;GACL,MAAM;GACN;GACA,GAAI,QAAQ,SAAY,EAAE,YAAY,IAAI,OAAO,GAAG,EAAE;GACtD,QAAQ;GACT;;CAEJ"}