@remnic/core 9.50.0 → 9.50.2

package/dist/{chunk-NKL25FCF.js → chunk-4MBPIL4V.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-KSXJOC4F.js";
 import {
   StorageManager
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   isSafeRouteNamespace
 } from "./chunk-U3PN77QT.js";
@@ -134,4 +134,4 @@ export {
   runCodexMaterialize,
   runPostConsolidationMaterialize
 };
-//# sourceMappingURL=chunk-NKL25FCF.js.map
+//# sourceMappingURL=chunk-4MBPIL4V.js.map

package/dist/{chunk-PWIMF7LP.js → chunk-5C2HNJMO.js}

@@ -8,7 +8,7 @@ import {
 } from "./chunk-GDB4J2H3.js";
 import {
   importCapsule
-} from "./chunk-5XCN4XBU.js";
+} from "./chunk-ZQOCRIGA.js";
 import {
   WriteQuarantineStore
 } from "./chunk-PJSK6OJM.js";
@@ -45,7 +45,7 @@ import {
 } from "./chunk-AHVEHR6K.js";
 import {
   readAggregateExtractionWatermark
-} from "./chunk-FV7YQTN3.js";
+} from "./chunk-2S72LWKX.js";
 import {
   recordObjectiveStateSnapshotsFromObservedMessages
 } from "./chunk-2HIJHXB3.js";
@@ -69,10 +69,10 @@ import {
 } from "./chunk-EI6V5UXY.js";
 import {
   CONNECTOR_LABEL_MAX_LENGTH
-} from "./chunk-X4IDNPOS.js";
+} from "./chunk-HAEU3ZW7.js";
 import {
   isValidConnectorId
-} from "./chunk-PNRA7FAD.js";
+} from "./chunk-RZRUV6N2.js";
 import {
   formatProfileTraceAscii
 } from "./chunk-NLE6TSLG.js";
@@ -84,14 +84,14 @@ import {
   persistExplicitCapture,
   queueExplicitCaptureForReview,
   validateExplicitCaptureInput
-} from "./chunk-N3CXAYPJ.js";
+} from "./chunk-2HGUDBRJ.js";
 import {
   lcmEvidenceIdentity
 } from "./chunk-C37ZRXX7.js";
 import {
   CorpusWatermarkCache,
   computeServiceCorpusCensus
-} from "./chunk-ZN4EYMKJ.js";
+} from "./chunk-67QG75MJ.js";
 import {
   namespaceCollectionName
 } from "./chunk-KMWYZTIE.js";
@@ -106,7 +106,7 @@ import {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact,
   runMemoryGovernance
-} from "./chunk-WPZX7MEA.js";
+} from "./chunk-FXX6RQYC.js";
 import {
   defaultCapsulesDir
 } from "./chunk-ZY2MNJR6.js";
@@ -120,14 +120,14 @@ import {
   enqueuePassiveCorrectionNotification,
   parseBriefingFocus,
   parseBriefingWindow
-} from "./chunk-4S3ECH3U.js";
+} from "./chunk-VJXY5ZCT.js";
 import {
   parseEntityFile,
   parseFrontmatter,
   qmdCollectionPathParts,
   qmdResultPathCandidates,
   selfDeps
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   DEFAULT_RECALL_DISCLOSURE,
   isRecallDisclosure
@@ -153,10 +153,10 @@ import {
 } from "./chunk-R3DJVOSM.js";
 import {
   createVersion
-} from "./chunk-PWLB4TRK.js";
+} from "./chunk-OQAL6SIR.js";
 import {
   supersessionKeysForFact
-} from "./chunk-P26YHAQH.js";
+} from "./chunk-EWMTOVMY.js";
 import {
   ExtractionDeadlineError,
   isActivityDigestPath,
@@ -13523,4 +13523,4 @@ export {
   EngramAccessService,
   AccessAdminOpsSurface
 };
-//# sourceMappingURL=chunk-PWIMF7LP.js.map
+//# sourceMappingURL=chunk-5C2HNJMO.js.map

package/dist/{chunk-ZN4EYMKJ.js → chunk-67QG75MJ.js}

@@ -1,6 +1,6 @@
 import {
   listNamespaces
-} from "./chunk-GSEPRIZC.js";
+} from "./chunk-TS4AJ2GI.js";
 import {
   capabilityAllowsNamespace
 } from "./chunk-MZWSOLMT.js";
@@ -282,4 +282,4 @@ export {
   computeServiceCorpusWatermarks,
   computeServiceCorpusCensus
 };
-//# sourceMappingURL=chunk-ZN4EYMKJ.js.map
+//# sourceMappingURL=chunk-67QG75MJ.js.map

package/dist/{chunk-JI62YGPI.js → chunk-6QPHF6RR.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   keyring_exports,
   secureStoreDir
@@ -388,4 +388,4 @@ export {
   resolveNamespaceStorageRoot,
   NamespaceStorageRouter
 };
-//# sourceMappingURL=chunk-JI62YGPI.js.map
+//# sourceMappingURL=chunk-6QPHF6RR.js.map

package/dist/{chunk-4EABKPZS.js → chunk-75XOWNRS.js}

@@ -9,14 +9,14 @@ import {
 } from "./chunk-666A3MOW.js";
 import {
   rebuildMemoryLifecycleLedger
-} from "./chunk-S75UQ3T3.js";
+} from "./chunk-GDDGZVFI.js";
 import {
   planNamespaceMaintenance,
   runNamespaceMaintenanceBatchPlan
-} from "./chunk-O76MWTVS.js";
+} from "./chunk-7BAYBYY5.js";
 import {
   rebuildMemoryProjection
-} from "./chunk-LTOAJXZB.js";
+} from "./chunk-Z3RHPGSY.js";
 import {
   activityDayWindow,
   activityDigestPath,
@@ -1714,4 +1714,4 @@ export {
   ActivitySyncScheduler,
   MaintenanceScheduler
 };
-//# sourceMappingURL=chunk-4EABKPZS.js.map
+//# sourceMappingURL=chunk-75XOWNRS.js.map

package/dist/{chunk-O76MWTVS.js → chunk-7BAYBYY5.js}

@@ -1,7 +1,7 @@
 import {
   resolveDefaultNamespaceRoot,
   resolveNamespaceStorageRoot
-} from "./chunk-JI62YGPI.js";
+} from "./chunk-6QPHF6RR.js";
 import {
   getConfiguredNamespaces
 } from "./chunk-YN6ASZUG.js";
@@ -2204,4 +2204,4 @@ export {
   runNamespaceMaintenancePlan,
   runNamespaceMaintenanceBatchPlan
 };
-//# sourceMappingURL=chunk-O76MWTVS.js.map
+//# sourceMappingURL=chunk-7BAYBYY5.js.map

package/dist/{chunk-4JWJMRPJ.js → chunk-7PKFPLLZ.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-B7RWBZXW.js";
 import {
   StorageManager
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   getCachedEpisodeMap,
   setCachedEpisodeMap
@@ -109,4 +109,4 @@ export {
   compareVerifiedEpisodeResults,
   searchVerifiedEpisodes
 };
-//# sourceMappingURL=chunk-4JWJMRPJ.js.map
+//# sourceMappingURL=chunk-7PKFPLLZ.js.map

package/dist/{chunk-24BKGKGO.js → chunk-BOFVT6P3.js}

@@ -61,7 +61,7 @@ import {
   isQueuedReviewMemory,
   parseTombstoneBlockedOfflineSyncMemory,
   tombstoneBlocked
-} from "./chunk-GKEYXXKX.js";
+} from "./chunk-IXXABW5A.js";
 import {
   composeMemoryEnvelope,
   isSealedMemoryEnvelope,
@@ -83,7 +83,7 @@ import {
 } from "./chunk-G7D6GZ5J.js";
 import {
   createVersion
-} from "./chunk-PWLB4TRK.js";
+} from "./chunk-OQAL6SIR.js";
 import {
   attachInFlightReader,
   beginCoalescedScan,
@@ -105,12 +105,12 @@ import {
   requestEntityCanonicalIdReconcileSync,
   resolveHistoricalEntityCanonicalId,
   withEntityCanonicalMutationLock
-} from "./chunk-JDCQK3C5.js";
+} from "./chunk-M4A44LUA.js";
 import {
   computeSupersessionKey,
   normalizeSupersessionKey,
   supersessionKeysForFact
-} from "./chunk-P26YHAQH.js";
+} from "./chunk-EWMTOVMY.js";
 import {
   clearMemoryCache,
   getCachedEntities,
@@ -10850,4 +10850,4 @@ export {
   isValidBufferSurpriseEvent,
   StorageManager3 as StorageManager
 };
-//# sourceMappingURL=chunk-24BKGKGO.js.map
+//# sourceMappingURL=chunk-BOFVT6P3.js.map

package/dist/{chunk-SHYIMIX5.js → chunk-ESG7Z255.js}

@@ -4,7 +4,7 @@ import {
 import {
   computeCorpusWatermarks,
   resolveCorpusNamespaceRoots
-} from "./chunk-ZN4EYMKJ.js";
+} from "./chunk-67QG75MJ.js";
 
 // src/operator-doctor-corpus.ts
 var DIGEST_PREFIX_LENGTH = 12;
@@ -78,4 +78,4 @@ export {
   corpusWatermarksFromCheck,
   summarizeCorpusAndReplica
 };
-//# sourceMappingURL=chunk-SHYIMIX5.js.map
+//# sourceMappingURL=chunk-ESG7Z255.js.map

package/dist/{chunk-P26YHAQH.js → chunk-EWMTOVMY.js}

@@ -44,8 +44,8 @@ function findDependents(memories, oldMemory, linkTypes = ["supports", "follows"]
     return left < right ? -1 : left > right ? 1 : 0;
   });
 }
-function emptyResult(skipped) {
-  return { dependentsFound: 0, invalidated: 0, stillValid: 0, uncertain: 0, skipped };
+function emptyResult(skipped, durationMs, route = null, dependentsFound = 0) {
+  return { dependentsFound, invalidated: 0, stillValid: 0, uncertain: 0, skipped, route, durationMs };
 }
 function logResult(event, result) {
   const oldId = event.oldMemory.frontmatter.id;
@@ -57,7 +57,9 @@ function logResult(event, result) {
       invalidated: result.invalidated,
       stillValid: result.stillValid,
       uncertain: result.uncertain,
-      skipped: result.skipped
+      skipped: result.skipped,
+      route: result.route,
+      durationMs: result.durationMs
     })}`
   );
 }
@@ -71,15 +73,16 @@ function isTimeoutError(error, signal) {
   return signal.aborted || error instanceof PropagationTimeoutError || error instanceof Error && (error.name === "AbortError" || /timeout|timed out/i.test(error.message));
 }
 async function propagateInvalidation(deps, event) {
+  const startedAt = Date.now();
   const config = propagationConfig(deps.config);
   if (!isEnabled(config.enabled)) {
-    const result2 = emptyResult("disabled");
+    const result2 = emptyResult("disabled", Date.now() - startedAt);
     logResult(event, result2);
     return result2;
   }
   const maxDependents = config.maxDependents;
   if (maxDependents <= 0) {
-    const result2 = emptyResult("no_dependents");
+    const result2 = emptyResult("no_dependents", Date.now() - startedAt);
     logResult(event, result2);
     return result2;
   }
@@ -88,7 +91,7 @@ async function propagateInvalidation(deps, event) {
     memories = await deps.storage.readAllMemories();
   } catch (error) {
     log.warn(`dependency propagation discovery failed for ${event.oldMemory.frontmatter.id}: ${error}`);
-    const result2 = emptyResult("llm_error");
+    const result2 = emptyResult("llm_error", Date.now() - startedAt);
     logResult(event, result2);
     return result2;
   }
@@ -99,40 +102,59 @@ async function propagateInvalidation(deps, event) {
   ).filter((memory) => memory.frontmatter.id !== event.replacementId);
   const dependents = discovered.slice(0, Math.max(0, Math.floor(maxDependents)));
   if (dependents.length === 0) {
-    const result2 = emptyResult("no_dependents");
+    const result2 = emptyResult("no_dependents", Date.now() - startedAt);
     logResult(event, result2);
     return result2;
   }
   const controller = new AbortController();
   const timeoutMs = config.timeoutMs;
-  const timeout = Number.isFinite(timeoutMs) && timeoutMs > 0 ? setTimeout(() => controller.abort(new PropagationTimeoutError()), timeoutMs) : void 0;
+  let timedOut = false;
+  let timeout;
+  const deadline = Number.isFinite(timeoutMs) && timeoutMs > 0 ? new Promise((_, reject) => {
+    timeout = setTimeout(() => {
+      timedOut = true;
+      const error = new PropagationTimeoutError();
+      controller.abort(error);
+      reject(error);
+    }, timeoutMs);
+  }) : void 0;
+  const revalidation = Promise.resolve().then(() => deps.extraction.revalidateDependents(
+    { id: event.oldMemory.frontmatter.id, content: event.oldMemory.content },
+    event.replacementId && event.replacementContent !== null ? { id: event.replacementId, content: event.replacementContent } : null,
+    dependents.map((memory) => ({
+      id: memory.frontmatter.id,
+      category: memory.frontmatter.category,
+      content: memory.content
+    })),
+    controller.signal
+  ));
   let verdicts;
   try {
-    const response = await deps.extraction.revalidateDependents(
-      { id: event.oldMemory.frontmatter.id, content: event.oldMemory.content },
-      event.replacementId && event.replacementContent !== null ? { id: event.replacementId, content: event.replacementContent } : null,
-      dependents.map((memory) => ({
-        id: memory.frontmatter.id,
-        category: memory.frontmatter.category,
-        content: memory.content
-      })),
-      controller.signal
-    );
-    verdicts = response.verdicts;
-    if (controller.signal.aborted) {
-      if (timeout !== void 0) clearTimeout(timeout);
-      const result2 = emptyResult("timeout");
+    const response = deadline ? await Promise.race([revalidation, deadline]) : await revalidation;
+    if (timedOut || controller.signal.aborted) {
+      const result2 = emptyResult(
+        "timeout",
+        Date.now() - startedAt,
+        "fast-completion",
+        dependents.length
+      );
       logResult(event, result2);
       return result2;
     }
+    verdicts = response.verdicts;
   } catch (error) {
-    const result2 = emptyResult(isTimeoutError(error, controller.signal) ? "timeout" : "llm_error");
+    const result2 = emptyResult(
+      timedOut || isTimeoutError(error, controller.signal) ? "timeout" : "llm_error",
+      Date.now() - startedAt,
+      "fast-completion",
+      dependents.length
+    );
     log.warn(`dependency propagation revalidation failed for ${event.oldMemory.frontmatter.id}: ${error}`);
     logResult(event, result2);
-    if (timeout !== void 0) clearTimeout(timeout);
     return result2;
+  } finally {
+    clearTimeout(timeout);
   }
-  if (timeout !== void 0) clearTimeout(timeout);
   let invalidated = 0;
   let stillValid = 0;
   let uncertain = 0;
@@ -176,7 +198,9 @@ async function propagateInvalidation(deps, event) {
     invalidated,
     stillValid,
     uncertain,
-    skipped: null
+    skipped: null,
+    route: "fast-completion",
+    durationMs: Date.now() - startedAt
   };
   logResult(event, result);
   return result;
@@ -457,4 +481,4 @@ export {
   applyTemporalSupersession,
   shouldFilterSupersededFromRecall
 };
-//# sourceMappingURL=chunk-P26YHAQH.js.map
+//# sourceMappingURL=chunk-EWMTOVMY.js.map

package/dist/chunk-EWMTOVMY.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/orchestration/dependency-propagation.ts","../src/temporal-supersession.ts"],"sourcesContent":["/**\n * Bounded, one-hop invalidation propagation for linked memories.\n *\n * Propagation hooks stay at orchestration call sites. They never live inside\n * StorageManager, so propagation supersessions cannot recurse.\n */\nimport type { ExtractionEngine } from \"../extraction.js\";\nimport { log } from \"../logger.js\";\nimport type { StorageManager } from \"../index.js\";\nimport type {\n  DependencyPropagationConfig,\n  MemoryFile,\n  MemoryFrontmatter,\n  MemoryLinkType,\n  PluginConfig,\n} from \"../types.js\";\n\nexport interface PropagationEvent {\n  /** Snapshot captured before the primary supersession or deletion. */\n  oldMemory: { content: string; frontmatter: MemoryFrontmatter };\n  replacementId: string | null;\n  replacementContent: string | null;\n  cause:\n    | \"contradiction\"\n    | \"temporal_supersession\"\n    | \"consolidation_invalidate\"\n    | \"consolidation_merge\";\n  namespaceScope: string;\n}\n\nexport interface PropagationResult {\n  dependentsFound: number;\n  invalidated: number;\n  stillValid: number;\n  uncertain: number;\n  skipped: \"disabled\" | \"no_dependents\" | \"llm_error\" | \"timeout\" | null;\n  route: \"fast-completion\" | null;\n  durationMs: number;\n}\n\nfunction propagationConfig(config: PluginConfig): DependencyPropagationConfig {\n  return config.dependencyPropagation;\n}\n\nfunction isEnabled(value: unknown): boolean {\n  if (value === true) return true;\n  if (typeof value !== \"string\") return false;\n  return [\"true\", \"1\", \"yes\", \"on\"].includes(value.trim().toLowerCase());\n}\n\nconst ACTIVE_STATUS = \"active\";\n\n/**\n * Discover exactly one-hop dependents from a memory snapshot.\n *\n * A supports edge on the dying memory points forward to its dependent.\n * follows and configured references edges point back to the dying memory.\n */\nexport function findDependents(\n  memories: MemoryFile[],\n  oldMemory: Pick<PropagationEvent[\"oldMemory\"], \"frontmatter\">,\n  linkTypes: readonly MemoryLinkType[] = [\"supports\", \"follows\"],\n): MemoryFile[] {\n  const allowed = new Set(linkTypes);\n  const ids = new Set<string>();\n  const byId = new Map(memories.map((memory) => [memory.frontmatter.id, memory]));\n\n  // Forward: supports and references edges on the dying memory point to\n  // dependents that lose evidence or a referenced anchor.\n  for (const link of oldMemory.frontmatter.links ?? []) {\n    if (link.linkType !== \"supports\" && link.linkType !== \"references\") continue;\n    if (!allowed.has(link.linkType)) continue;\n    const dependent = byId.get(link.targetId);\n    if (dependent && (dependent.frontmatter.status ?? ACTIVE_STATUS) === ACTIVE_STATUS) {\n      ids.add(dependent.frontmatter.id);\n    }\n  }\n\n  const oldId = oldMemory.frontmatter.id;\n  for (const memory of memories) {\n    if ((memory.frontmatter.status ?? ACTIVE_STATUS) !== ACTIVE_STATUS) continue;\n    if (memory.frontmatter.id === oldId) continue;\n    for (const link of memory.frontmatter.links ?? []) {\n      if (link.targetId !== oldId) continue;\n      if (link.linkType !== \"follows\" && link.linkType !== \"references\") continue;\n      if (!allowed.has(link.linkType)) continue;\n      ids.add(memory.frontmatter.id);\n    }\n  }\n\n  return Array.from(ids)\n    .map((id) => byId.get(id))\n    .filter((memory): memory is MemoryFile => memory !== undefined)\n    .sort((a, b) => {\n      const left = a.frontmatter.id;\n      const right = b.frontmatter.id;\n      return left < right ? -1 : left > right ? 1 : 0;\n    });\n}\n\nfunction emptyResult(\n  skipped: PropagationResult[\"skipped\"],\n  durationMs: number,\n  route: PropagationResult[\"route\"] = null,\n  dependentsFound = 0,\n): PropagationResult {\n  return { dependentsFound, invalidated: 0, stillValid: 0, uncertain: 0, skipped, route, durationMs };\n}\n\nfunction logResult(event: PropagationEvent, result: PropagationResult): void {\n  const oldId = event.oldMemory.frontmatter.id;\n  log.info(\n    `dependency-propagation ${JSON.stringify({\n      cause: event.cause,\n      oldId,\n      dependentsFound: result.dependentsFound,\n      invalidated: result.invalidated,\n      stillValid: result.stillValid,\n      uncertain: result.uncertain,\n      skipped: result.skipped,\n      route: result.route,\n      durationMs: result.durationMs,\n    })}`,\n  );\n}\n\nclass PropagationTimeoutError extends Error {\n  constructor() {\n    super(\"dependency propagation timed out\");\n    this.name = \"PropagationTimeoutError\";\n  }\n}\n\nfunction isTimeoutError(error: unknown, signal: AbortSignal): boolean {\n  return signal.aborted || error instanceof PropagationTimeoutError ||\n    (error instanceof Error && (error.name === \"AbortError\" || /timeout|timed out/i.test(error.message)));\n}\n\n/**\n * Revalidate one-hop dependents after a successful primary operation.\n * The caller's storage is already namespace-scoped; this function never\n * constructs another storage or scans a different namespace.\n */\nexport async function propagateInvalidation(\n  deps: { storage: StorageManager; extraction: ExtractionEngine; config: PluginConfig },\n  event: PropagationEvent,\n): Promise<PropagationResult> {\n  const startedAt = Date.now();\n  const config = propagationConfig(deps.config);\n  if (!isEnabled(config.enabled)) {\n    const result = emptyResult(\"disabled\", Date.now() - startedAt);\n    logResult(event, result);\n    return result;\n  }\n\n  const maxDependents = config.maxDependents;\n  if (maxDependents <= 0) {\n    const result = emptyResult(\"no_dependents\", Date.now() - startedAt);\n    logResult(event, result);\n    return result;\n  }\n\n  let memories: MemoryFile[];\n  try {\n    memories = await deps.storage.readAllMemories();\n  } catch (error) {\n    log.warn(`dependency propagation discovery failed for ${event.oldMemory.frontmatter.id}: ${error}`);\n    const result = emptyResult(\"llm_error\", Date.now() - startedAt);\n    logResult(event, result);\n    return result;\n  }\n  // Cold-tier active dependents are not scanned in v1: the supersede and\n  // frontmatter write paths operate on hot storage. Cold discovery without\n  // cold write support would surface dependents it cannot act on.\n\n  const discovered = findDependents(\n    memories,\n    event.oldMemory,\n    config.linkTypes,\n  ).filter((memory) => memory.frontmatter.id !== event.replacementId);\n  const dependents = discovered.slice(0, Math.max(0, Math.floor(maxDependents)));\n\n  if (dependents.length === 0) {\n    const result = emptyResult(\"no_dependents\", Date.now() - startedAt);\n    logResult(event, result);\n    return result;\n  }\n\n  const controller = new AbortController();\n  const timeoutMs = config.timeoutMs;\n  let timedOut = false;\n  let timeout: ReturnType<typeof setTimeout> | undefined;\n  const deadline = Number.isFinite(timeoutMs) && timeoutMs > 0\n    ? new Promise<never>((_, reject) => {\n        timeout = setTimeout(() => {\n          timedOut = true;\n          const error = new PropagationTimeoutError();\n          controller.abort(error);\n          reject(error);\n        }, timeoutMs);\n      })\n    : undefined;\n  const revalidation = Promise.resolve().then(() => deps.extraction.revalidateDependents(\n    { id: event.oldMemory.frontmatter.id, content: event.oldMemory.content },\n    event.replacementId && event.replacementContent !== null\n      ? { id: event.replacementId, content: event.replacementContent }\n      : null,\n    dependents.map((memory) => ({\n      id: memory.frontmatter.id,\n      category: memory.frontmatter.category,\n      content: memory.content,\n    })),\n    controller.signal,\n  ));\n\n  let verdicts: Array<{ memoryId: string; verdict: \"still_valid\" | \"invalidated\" | \"uncertain\"; reason?: string }>;\n  try {\n    const response = deadline\n      ? await Promise.race([revalidation, deadline])\n      : await revalidation;\n    if (timedOut || controller.signal.aborted) {\n      const result = emptyResult(\n        \"timeout\",\n        Date.now() - startedAt,\n        \"fast-completion\",\n        dependents.length,\n      );\n      logResult(event, result);\n      return result;\n    }\n    verdicts = response.verdicts;\n  } catch (error) {\n    const result = emptyResult(\n      timedOut || isTimeoutError(error, controller.signal) ? \"timeout\" : \"llm_error\",\n      Date.now() - startedAt,\n      \"fast-completion\",\n      dependents.length,\n    );\n    log.warn(`dependency propagation revalidation failed for ${event.oldMemory.frontmatter.id}: ${error}`);\n    logResult(event, result);\n    return result;\n  } finally {\n    clearTimeout(timeout!);\n  }\n\n  let invalidated = 0;\n  let stillValid = 0;\n  let uncertain = 0;\n  for (const dependent of dependents) {\n    const verdict = verdicts.find((candidate) => candidate.memoryId === dependent.frontmatter.id);\n    if (verdict?.verdict === \"invalidated\") {\n      if (config.dryRun) {\n        invalidated += 1;\n        continue;\n      }\n      try {\n        const replacementId = event.replacementId ?? event.oldMemory.frontmatter.id;\n        const superseded = await deps.storage.supersedeMemory(\n          dependent.frontmatter.id,\n          replacementId,\n          `dependency_propagation:${event.cause}`,\n        );\n        if (!superseded) continue;\n        const current = await deps.storage.getMemoryById(dependent.frontmatter.id);\n        if (current) {\n          await deps.storage.writeMemoryFrontmatter(current, {\n            supersessionCause: \"dependency\",\n            invalidatedBy: event.oldMemory.frontmatter.id,\n          });\n        }\n        invalidated += 1;\n      } catch (error) {\n        log.warn(`dependency propagation write failed for ${dependent.frontmatter.id}: ${error}`);\n      }\n      continue;\n    }\n    if (verdict?.verdict === \"still_valid\") {\n      stillValid += 1;\n    } else {\n      uncertain += 1;\n      log.info(`dependency propagation uncertain for ${dependent.frontmatter.id}`);\n    }\n  }\n\n  const result: PropagationResult = {\n    dependentsFound: dependents.length,\n    invalidated,\n    stillValid,\n    uncertain,\n    skipped: null,\n    route: \"fast-completion\",\n    durationMs: Date.now() - startedAt,\n  };\n  logResult(event, result);\n  return result;\n}\n","/**\n * Temporal Supersession (issue #375)\n *\n * When a new fact lands with `structuredAttributes` keyed on a known\n * `entityRef`, any prior fact whose supersession key collides with the new\n * fact's key is marked `status: \"superseded\"` and linked via\n * `supersededBy` / `supersededAt`.  Recall filters those superseded memories\n * by default so agents see only the \"current\" value per entity attribute.\n *\n * The algorithm is intentionally O(N) over the memory corpus per write, but\n * skips cheaply when the new fact has no structuredAttributes.  It reuses the\n * cached `readAllMemories()` path so cost is amortized with the rest of the\n * write pipeline.\n */\nimport type { MemoryFile, MemoryFrontmatter, PluginConfig } from \"./types.js\";\nimport type { ExtractionEngine } from \"./extraction.js\";\nimport type { StorageManager } from \"./storage.js\";\nimport { log } from \"./logger.js\";\nimport { effectiveValidAt } from \"./temporal-validity.js\";\nimport { propagateInvalidation } from \"./orchestration/dependency-propagation.js\";\n\n/**\n * Shared normalization for supersession key components.\n *\n * Trims surrounding whitespace, lowercases, then collapses any run of\n * whitespace OR hyphens to a single hyphen, and strips any leading/trailing\n * hyphens that result.  Both `computeSupersessionKey` and\n * `lookupAttributeByNormalizedKey` must use this so that keys produced at\n * write time and keys used at lookup time are identical regardless of how\n * the LLM encoded whitespace, hyphens, or casing (Finding B fix).\n *\n * Symmetry guarantee: `\"foo bar\"`, `\"foo-bar\"`, `\"foo - bar\"`, and\n * `\"foo  bar\"` all canonicalize to `\"foo-bar\"`.\n *\n * Exported so external tests can verify the canonical form.\n */\nexport function normalizeSupersessionKey(raw: string): string {\n  return raw\n    .trim()\n    .toLowerCase()\n    .replace(/[\\s\\-]+/g, \"-\")\n    // The previous line already collapsed runs to single hyphens, so ^-|-$ is\n    // equivalent to ^-+|-+$ here and drops the anchored quantifier flagged by\n    // CodeQL js/polynomial-redos.\n    .replace(/^-|-$/g, \"\");\n}\n\n/**\n * Stable supersession key for an (entityRef, attributeName) pair.\n *\n * The algorithm is:\n *  - normalize the entityRef (trim, lower-case, collapse whitespace)\n *  - normalize the attributeName the same way\n *  - join with `::`\n *\n * Exported so tests and tools can recompute it without depending on storage.\n */\nexport function computeSupersessionKey(\n  entityRef: string | undefined,\n  attributeName: string,\n): string | null {\n  if (!entityRef || typeof entityRef !== \"string\") return null;\n  if (!attributeName || typeof attributeName !== \"string\") return null;\n  const entity = normalizeSupersessionKey(entityRef);\n  const attr = normalizeSupersessionKey(attributeName);\n  if (entity.length === 0 || attr.length === 0) return null;\n  return `${entity}::${attr}`;\n}\n\n/**\n * Compute the full set of supersession keys for a fact with structured\n * attributes.  Returns an empty array if no keys can be derived.\n */\nexport function supersessionKeysForFact(spec: {\n  entityRef?: string;\n  structuredAttributes?: Record<string, string>;\n}): string[] {\n  if (!spec.entityRef) return [];\n  if (!spec.structuredAttributes) return [];\n  const keys: string[] = [];\n  for (const attrName of Object.keys(spec.structuredAttributes)) {\n    const key = computeSupersessionKey(spec.entityRef, attrName);\n    if (key) keys.push(key);\n  }\n  return keys;\n}\n\n/**\n * Look up a structured-attribute value by a raw key, normalizing both sides\n * with `normalizeSupersessionKey` before comparing.  This ensures that keys\n * written by the LLM with mixed case, surrounding whitespace, or internal\n * whitespace (e.g. `\"City\"`, `\" city \"`, `\"job   title\"`, `\"job-title\"`)\n * are all matched against normalized keys produced by `computeSupersessionKey`\n * (Finding B fix — uses the same helper so both sides are identical).\n *\n * The storage format is NOT changed — we only normalize at lookup time.\n */\nexport function lookupAttributeByNormalizedKey(\n  attributes: Record<string, unknown>,\n  rawKey: string,\n): unknown {\n  const normalizedTarget = normalizeSupersessionKey(rawKey);\n  for (const [k, v] of Object.entries(attributes)) {\n    if (normalizeSupersessionKey(k) === normalizedTarget) return v;\n  }\n  return undefined;\n}\n\n/**\n * Decide whether an existing memory should be superseded by a newly-written\n * memory that carries the supplied supersession key set.\n *\n * Only memories that:\n *  - are currently `active`\n *  - share an `entityRef` with the new fact\n *  - share at least one supersession key with the new fact\n *  - are older than the new fact\n *  - have a conflicting value (different string) for the overlapping key\n * are eligible.  This keeps supersession local to the attribute that actually\n * changed — if fact A sets `{city: Austin, tool: vim}` and fact B sets\n * `{city: NYC}`, only the city attribute is superseded, not the tool.\n */\nexport function shouldSupersedeExisting(args: {\n  candidate: MemoryFrontmatter;\n  newEntityRef: string;\n  newAttributes: Record<string, string>;\n  newCreatedAt: string;\n  newMemoryId: string;\n}): { matchedKeys: string[] } | null {\n  const { candidate, newEntityRef, newAttributes, newCreatedAt, newMemoryId } = args;\n\n  if (candidate.id === newMemoryId) return null;\n  if (candidate.status && candidate.status !== \"active\") return null;\n  if (!candidate.entityRef) return null;\n  if (!candidate.structuredAttributes) return null;\n\n  // Reuse the shared `normalizeSupersessionKey` helper so this comparison\n  // cannot drift from the canonical form used to build supersession keys\n  // elsewhere in this file.\n  const candidateEntityNorm = normalizeSupersessionKey(candidate.entityRef);\n  const newEntityNorm = normalizeSupersessionKey(newEntityRef);\n  if (candidateEntityNorm !== newEntityNorm) return null;\n\n  // Must be older than the new fact's effective validity start — equal\n  // timestamps are ignored to avoid races within the same millisecond. When\n  // replay/import supplies source time, valid_at must drive ordering instead\n  // of wall-clock persistence time.\n  const candidateCreated = Date.parse(effectiveValidAt(candidate));\n  const newCreated = Date.parse(newCreatedAt);\n  if (!Number.isFinite(candidateCreated) || !Number.isFinite(newCreated)) return null;\n  if (candidateCreated >= newCreated) return null;\n\n  const matchedKeys: string[] = [];\n  for (const [attrName, newValue] of Object.entries(newAttributes)) {\n    // Use normalized key lookup so mixed-case or whitespace-padded keys\n    // stored by the LLM are matched correctly (Finding 2 fix).\n    const candidateValue = lookupAttributeByNormalizedKey(\n      candidate.structuredAttributes,\n      attrName,\n    );\n    if (candidateValue === undefined) continue;\n    // Only supersede on conflicting values — identical values are a no-op.\n    if (normalizeValue(String(candidateValue)) === normalizeValue(newValue)) continue;\n    const key = computeSupersessionKey(newEntityRef, attrName);\n    if (key) matchedKeys.push(key);\n  }\n\n  return matchedKeys.length > 0 ? { matchedKeys } : null;\n}\n\nfunction normalizeValue(v: string): string {\n  return v.trim().toLowerCase();\n}\n\nasync function expireChildChunksForSupersededParent(args: {\n  storage: StorageManager;\n  allCandidates: MemoryFile[];\n  parentId: string;\n  newMemoryId: string;\n  supersededAt: string;\n  invalidAt?: string;\n}): Promise<void> {\n  const processedChunkIds = new Set<string>();\n  const chunks = args.allCandidates.filter(\n    (candidate) => candidate.frontmatter.parentId === args.parentId,\n  );\n\n  for (const chunk of chunks) {\n    const chunkKey = chunk.frontmatter.id ?? chunk.path;\n    if (processedChunkIds.has(chunkKey)) continue;\n\n    try {\n      const freshChunk = await args.storage.readMemoryByPath(chunk.path);\n      if (!freshChunk) continue;\n      processedChunkIds.add(chunkKey);\n      const freshStatus = freshChunk.frontmatter.status ?? \"active\";\n      if (freshStatus !== \"active\" || freshChunk.frontmatter.supersededBy) continue;\n\n      await args.storage.writeMemoryFrontmatter(\n        freshChunk,\n        {\n          status: \"superseded\",\n          supersededBy: args.newMemoryId,\n          supersededAt: args.supersededAt,\n          updated: args.supersededAt,\n          ...(args.invalidAt && !freshChunk.frontmatter.invalid_at\n            ? { invalid_at: args.invalidAt }\n            : {}),\n        },\n        {\n          actor: \"temporal-supersession\",\n          reasonCode: \"structured-attribute-update-child-chunk\",\n          relatedMemoryIds: [args.newMemoryId, args.parentId],\n        },\n      );\n    } catch (err) {\n      log.warn(\n        `temporal-supersession: failed to expire child chunk ${chunk.frontmatter.id} for parent ${args.parentId}: ${err}`,\n      );\n    }\n  }\n}\n\nexport interface TemporalSupersessionResult {\n  supersededIds: string[];\n  matchedKeys: string[];\n}\n\n/**\n * Scan existing memories and mark any that are superseded by the\n * just-written memory.  Fails open on I/O errors — the new memory is already\n * on disk, and supersession is a best-effort hygiene step.\n */\nexport async function applyTemporalSupersession(args: {\n  storage: StorageManager;\n  newMemoryId: string;\n  entityRef?: string;\n  structuredAttributes?: Record<string, string>;\n  createdAt: string;\n  enabled: boolean;\n  /**\n   * When true, skip the persisted `frontmatter.created` lookup and use\n   * `args.createdAt` directly as the ordering anchor.  Set this on the\n   * hash-dedup short-circuit path where `newMemoryId` points to an existing\n   * OLD fact (no new file is written) and its persisted timestamp would be\n   * stale relative to the incoming promotion event (PR #402 Finding Uyui).\n   */\n  useCallerTimestamp?: boolean;\n  /** Optional orchestration dependencies for one-hop propagation. */\n  extraction?: ExtractionEngine;\n  config?: PluginConfig;\n  namespaceScope?: string;\n}): Promise<TemporalSupersessionResult> {\n  const empty: TemporalSupersessionResult = { supersededIds: [], matchedKeys: [] };\n  if (!args.enabled) return empty;\n  if (!args.entityRef) return empty;\n  if (!args.structuredAttributes) return empty;\n  if (Object.keys(args.structuredAttributes).length === 0) return empty;\n\n  const newKeys = supersessionKeysForFact({\n    entityRef: args.entityRef,\n    structuredAttributes: args.structuredAttributes,\n  });\n  if (newKeys.length === 0) return empty;\n\n  let hotMemories: MemoryFile[];\n  try {\n    hotMemories = await args.storage.readAllMemories();\n  } catch (err) {\n    log.warn(`temporal-supersession: readAllMemories failed: ${err}`);\n    return empty;\n  }\n\n  // Finding 1 fix: use the on-disk effective validity start of the\n  // newly-written memory rather than a wall-clock timestamp sampled after\n  // `writeMemory` returns.  In concurrent writers the two can differ by enough\n  // to cause wrong-direction supersession.  If source replay/import provided\n  // valid_at, it must drive ordering; otherwise created remains the legacy\n  // fallback.  If the memory is not yet visible in the cache (edge case during\n  // fast concurrent writes) fall back to args.createdAt.\n  //\n  // PR #402 round-12 (Finding Uyui): on the hash-dedup early-return path the\n  // caller supplies the OLD matching fact's id as `newMemoryId` (no new file is\n  // written).  That makes `newMemoryFile.frontmatter.created` an arbitrarily\n  // old timestamp.  When `args.useCallerTimestamp` is set the caller explicitly\n  // opts out of the persisted-timestamp lookup so `args.createdAt` (the\n  // incoming event time: source valid_at when present, otherwise wall-clock) is\n  // used directly, keeping ordering correct regardless of how old the matching\n  // fact is.\n  const newMemoryFile = hotMemories.find((m) => m.frontmatter.id === args.newMemoryId);\n  const persistedCreatedAt = args.useCallerTimestamp\n    ? args.createdAt\n    : (newMemoryFile ? effectiveValidAt(newMemoryFile.frontmatter) : args.createdAt);\n\n  const supersededIds: string[] = [];\n  const matchedKeys = new Set<string>();\n\n  // Process hot then cold.  Hot-then-cold ordering is safer because hot\n  // writes are more frequent and the CAS re-read guards against double-writes.\n  // A Set<string> of already-processed ids ensures that a memory visible in\n  // both tiers (same logical memory with different filesystem paths during a\n  // migration race) is processed at most once.  Keying on `frontmatter.id`\n  // is correct because the same logical memory has the same id regardless of\n  // which tier's directory it currently lives in (PR #402 Finding 1 fix).\n  // Fall back to path-based keying when id is absent (defensive).\n  const processedIds = new Set<string>();\n\n  // Finding UOGi fix (round-6): readAllColdMemories() performs a full uncached\n  // recursive directory scan of cold/.  After Finding UTsP broadened the scan\n  // to cover the entire cold root (not just facts/+corrections/), the per-call\n  // cost grows with the cold tree size.\n  //\n  // The fix is a TTL-based in-memory cache inside StorageManager\n  // (readAllColdMemories caches its result for COLD_SCAN_CACHE_TTL_MS) that is\n  // shared across consecutive supersession calls within the same write burst.\n  // The cache is invalidated automatically on any hot→cold demotion (which\n  // calls invalidateAllMemoriesCache, which also clears the cold cache) and\n  // expires after the TTL as a safety net.\n  //\n  // This means back-to-back structured-attribute writes in the same burst\n  // (e.g. batch extraction) pay the cold I/O cost at most once, not N times.\n  // Correctness is preserved because the cache TTL ensures eventual consistency\n  // and the invalidation hook covers the hot→cold path.\n\n  let coldMemories: MemoryFile[];\n  try {\n    coldMemories = await args.storage.readAllColdMemories();\n  } catch (err) {\n    log.warn(`temporal-supersession: readAllColdMemories failed: ${err}`);\n    coldMemories = [];\n  }\n\n  // Combine hot and cold memories into a single scan.  New memory itself is\n  // excluded inline.  We do NOT skip cold scan when hot produced zero\n  // supersessions — the P1 finding is precisely that stale cold facts leak\n  // when hot has no hits.\n  const allCandidates: MemoryFile[] = [...hotMemories, ...coldMemories];\n\n  for (const memory of allCandidates) {\n    if (memory.frontmatter.id === args.newMemoryId) continue;\n    const dedupeKey = memory.frontmatter.id ?? memory.path;\n    if (processedIds.has(dedupeKey)) continue;\n    const snapshotStatus = memory.frontmatter.status ?? \"active\";\n    if (snapshotStatus !== \"active\") {\n      // A stale non-active snapshot entry must not suppress an active copy of\n      // the same logical memory that appears later in another tier.  This can\n      // happen during hot/cold migration races where the hot snapshot is already\n      // superseded but the cold copy is still active and should be evaluated.\n      continue;\n    }\n    // NOTE: do NOT call processedIds.add(dedupeKey) here.  We defer marking\n    // the id as processed until AFTER the CAS re-read succeeds.  If we mark\n    // it here and the re-read fails (e.g. the hot entry has already been\n    // migrated to cold storage), the same logical id that appears later in\n    // the cold tier scan would be silently skipped, leaving a stale cold\n    // fact unsuperseded.  Deferring ensures that a failed primary-tier read\n    // grants the alternate tier a chance to process the same id (PR #402\n    // round-6 Finding 1 fix).\n\n    const decision = shouldSupersedeExisting({\n      candidate: memory.frontmatter,\n      newEntityRef: args.entityRef,\n      newAttributes: args.structuredAttributes,\n      newCreatedAt: persistedCreatedAt,\n      newMemoryId: args.newMemoryId,\n    });\n    if (!decision) {\n      // No supersession decision — safe to mark as processed now so the\n      // alternate tier doesn't re-evaluate an identical non-matching entry.\n      processedIds.add(dedupeKey);\n      continue;\n    }\n\n    try {\n      // CAS-style re-read immediately before the write.  `readAllMemories()`\n      // is a snapshot — with concurrent writers, another run may have already\n      // superseded this candidate since we loaded it.  If we blindly trust the\n      // snapshot we can clobber a newer `supersededBy` link with a stale one.\n      //\n      // File storage offers no true locking, so the best we can do is:\n      //   1. re-read the exact file we're about to mutate\n      //   2. verify status is still \"active\" and no `supersededBy` is set\n      //   3. only then issue the write\n      // If the re-read shows a newer concurrent writer beat us to it, skip.\n      // This CAS pattern applies equally to hot and cold tier candidates.\n      // Mark as processed AFTER confirming the candidate is readable so that\n      // a migration-race read failure on the hot entry does not silently\n      // prevent the cold entry from being evaluated (Finding 1, round 6).\n      const fresh = await args.storage.readMemoryByPath(memory.path);\n      if (!fresh) {\n        log.debug(\n          `[engram] temporal supersession skipped candidate ${memory.frontmatter.id}: no longer readable at ${memory.path} — leaving id available for alternate tier`,\n        );\n        // Do NOT add to processedIds — allow the cold-tier copy to be\n        // evaluated in the next iteration of the same scan.\n        continue;\n      }\n      // Candidate is readable — mark the id as processed now to prevent the\n      // alternate tier from double-writing.\n      processedIds.add(dedupeKey);\n      const freshStatus = fresh.frontmatter.status ?? \"active\";\n      if (freshStatus !== \"active\" || fresh.frontmatter.supersededBy) {\n        log.debug(\n          `[engram] temporal supersession skipped candidate ${memory.frontmatter.id}: already superseded by concurrent writer`,\n        );\n        continue;\n      }\n\n      // Finding 2 fix: the `supersededAt` / `updated` timestamps written to the\n      // old fact must never run backwards relative to its own persisted\n      // `created` timestamp.  If the caller-supplied `args.createdAt` (which\n      // represents \"when the new replacing fact was authored\") is earlier than\n      // either the new fact's persisted `created` (T_new) or the old fact's\n      // persisted `created` (T_old), we'd be writing a nonsensical\n      // `supersededAt` that precedes the old memory's own creation.  Clamp to\n      // the monotonic maximum so time only moves forward.\n      // This monotonic clamp is applied for both hot and cold tier writes.\n      const oldCreatedMs = new Date(fresh.frontmatter.created).getTime();\n      const newCreatedMs = new Date(persistedCreatedAt).getTime();\n      const argCreatedMs = new Date(args.createdAt).getTime();\n      const maxMs = Math.max(\n        Number.isFinite(oldCreatedMs) ? oldCreatedMs : 0,\n        Number.isFinite(newCreatedMs) ? newCreatedMs : 0,\n        Number.isFinite(argCreatedMs) ? argCreatedMs : 0,\n      );\n      const supersededAt = new Date(maxMs).toISOString();\n\n      // Issue #680 — explicit fact lifecycle.  When the new fact\n      // supersedes this one, set the predecessor's `invalid_at` to the\n      // successor's effective valid_at.  Skip when the predecessor\n      // already carries an `invalid_at` so manual / earlier values\n      // are preserved (idempotent).\n      //\n      // Codex P1 on PR #713: in the hash-dedup early-return path\n      // (`useCallerTimestamp: true`), `newMemoryFile` is actually the\n      // OLD matching fact — no new file was written — so its\n      // `valid_at` is the predecessor's own old timestamp, not the\n      // successor's effective time. Use `persistedCreatedAt`\n      // directly in that path so the predecessor's invalid_at lines\n      // up with the caller's wall-clock, not the matching fact's old\n      // valid_at. The non-dedup path keeps the previous behavior\n      // (prefer the new file's explicit valid_at, fall back to its\n      // persisted created).\n      let invalidAtPatch: string | undefined;\n      if (!fresh.frontmatter.invalid_at) {\n        if (args.useCallerTimestamp) {\n          invalidAtPatch = persistedCreatedAt;\n        } else {\n          const newValidAt = newMemoryFile?.frontmatter.valid_at?.trim();\n          invalidAtPatch =\n            newValidAt && newValidAt.length > 0 ? newValidAt : persistedCreatedAt;\n        }\n      }\n      const wrote = await args.storage.writeMemoryFrontmatter(\n        fresh,\n        {\n          status: \"superseded\",\n          supersededBy: args.newMemoryId,\n          supersededAt,\n          updated: supersededAt,\n          ...(invalidAtPatch ? { invalid_at: invalidAtPatch } : {}),\n        },\n        {\n          actor: \"temporal-supersession\",\n          reasonCode: \"structured-attribute-update\",\n          relatedMemoryIds: [args.newMemoryId],\n        },\n      );\n      if (wrote) {\n        supersededIds.push(memory.frontmatter.id);\n        for (const key of decision.matchedKeys) matchedKeys.add(key);\n        await expireChildChunksForSupersededParent({\n          storage: args.storage,\n          allCandidates,\n          parentId: fresh.frontmatter.id,\n          newMemoryId: args.newMemoryId,\n          supersededAt,\n          invalidAt: invalidAtPatch ?? fresh.frontmatter.invalid_at,\n        });\n        // Issue #1579 — emit a tombstone for the superseded memory so it\n        // cannot resurrect through re-extraction / import / consolidation /\n        // dreams / pattern-reinforcement. The supersession key is the first\n        // matched key (the write-time supersession identity). Best-effort:\n        // a tombstone append failure is logged but never fails supersession\n        // (gotcha #13).\n        // Issue #1579 thread ObteS: persist ALL matched supersession keys, not\n        // just the first. A later paraphrased re-observation may derive the\n        // same entity but place the tombstoned attribute at a different\n        // position in structuredAttributes; without an entry for every matched\n        // key, the keyed tier would miss and the fact could resurrect as\n        // active. Pass the canonical contentHash from the retired memory's\n        // frontmatter so the tombstone's exact tier matches re-extraction\n        // (review: citation-hash alignment). The rawContent is the stored body;\n        // the StorageManager.appendTombstone chokepoint strips citation\n        // annotations for the normalized-text tier.\n        const keysToTombstone =\n          decision.matchedKeys.length > 0 ? decision.matchedKeys : [undefined];\n        for (const key of keysToTombstone) {\n          try {\n            await args.storage.appendTombstone({\n              reason: \"supersession\",\n              createdBy: \"supersession\",\n              sourceMemoryId: fresh.frontmatter.id,\n              ...(fresh.frontmatter.contentHash\n                ? { contentHash: fresh.frontmatter.contentHash }\n                : {}),\n              rawContent: fresh.content,\n              ...(fresh.frontmatter.entityRef ? { entityRef: fresh.frontmatter.entityRef } : {}),\n              ...(key ? { supersessionKey: key } : {}),\n              createdAt: supersededAt,\n            });\n          } catch (tombErr) {\n            log.warn(\n              `temporal-supersession: tombstone emit failed for ${fresh.frontmatter.id}${key ? ` (key=${key})` : \"\"} : ${tombErr}`,\n            );\n          }\n        }\n        if (args.extraction && args.config && args.namespaceScope) {\n          try {\n            await propagateInvalidation(\n              {\n                storage: args.storage,\n                extraction: args.extraction,\n                config: args.config,\n              },\n              {\n                oldMemory: fresh,\n                replacementId: args.newMemoryId,\n                replacementContent: newMemoryFile?.content ?? null,\n                cause: \"temporal_supersession\",\n                namespaceScope: args.namespaceScope,\n              },\n            );\n          } catch (propagationErr) {\n            log.warn(\n              `temporal-supersession: dependency propagation failed for ${fresh.frontmatter.id}: ${propagationErr}`,\n            );\n          }\n        }\n      }\n    } catch (err) {\n      log.warn(\n        `temporal-supersession: failed to mark ${memory.frontmatter.id} superseded: ${err}`,\n      );\n    }\n  }\n\n  if (supersededIds.length > 0) {\n    log.debug(\n      `temporal-supersession: marked ${supersededIds.length} memories superseded by ${args.newMemoryId} (keys=${Array.from(matchedKeys).join(\",\")})`,\n    );\n  }\n\n  return { supersededIds, matchedKeys: Array.from(matchedKeys) };\n}\n\n/**\n * Recall-side filter: returns true when the candidate should be excluded\n * from recall because it has been temporally superseded.  When\n * `includeInRecall` is true, this always returns false (the fact is kept),\n * matching the audit/history opt-in described in the config.\n */\nexport function shouldFilterSupersededFromRecall(\n  frontmatter: MemoryFrontmatter,\n  options: { enabled: boolean; includeInRecall: boolean },\n): boolean {\n  if (!options.enabled) return false;\n  if (options.includeInRecall) return false;\n  return frontmatter.status === \"superseded\";\n}\n"],"mappings":";;;;;;;;AAwCA,SAAS,kBAAkB,QAAmD;AAC5E,SAAO,OAAO;AAChB;AAEA,SAAS,UAAU,OAAyB;AAC1C,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,SAAO,CAAC,QAAQ,KAAK,OAAO,IAAI,EAAE,SAAS,MAAM,KAAK,EAAE,YAAY,CAAC;AACvE;AAEA,IAAM,gBAAgB;AAQf,SAAS,eACd,UACA,WACA,YAAuC,CAAC,YAAY,SAAS,GAC/C;AACd,QAAM,UAAU,IAAI,IAAI,SAAS;AACjC,QAAM,MAAM,oBAAI,IAAY;AAC5B,QAAM,OAAO,IAAI,IAAI,SAAS,IAAI,CAAC,WAAW,CAAC,OAAO,YAAY,IAAI,MAAM,CAAC,CAAC;AAI9E,aAAW,QAAQ,UAAU,YAAY,SAAS,CAAC,GAAG;AACpD,QAAI,KAAK,aAAa,cAAc,KAAK,aAAa,aAAc;AACpE,QAAI,CAAC,QAAQ,IAAI,KAAK,QAAQ,EAAG;AACjC,UAAM,YAAY,KAAK,IAAI,KAAK,QAAQ;AACxC,QAAI,cAAc,UAAU,YAAY,UAAU,mBAAmB,eAAe;AAClF,UAAI,IAAI,UAAU,YAAY,EAAE;AAAA,IAClC;AAAA,EACF;AAEA,QAAM,QAAQ,UAAU,YAAY;AACpC,aAAW,UAAU,UAAU;AAC7B,SAAK,OAAO,YAAY,UAAU,mBAAmB,cAAe;AACpE,QAAI,OAAO,YAAY,OAAO,MAAO;AACrC,eAAW,QAAQ,OAAO,YAAY,SAAS,CAAC,GAAG;AACjD,UAAI,KAAK,aAAa,MAAO;AAC7B,UAAI,KAAK,aAAa,aAAa,KAAK,aAAa,aAAc;AACnE,UAAI,CAAC,QAAQ,IAAI,KAAK,QAAQ,EAAG;AACjC,UAAI,IAAI,OAAO,YAAY,EAAE;AAAA,IAC/B;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,GAAG,EAClB,IAAI,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC,EACxB,OAAO,CAAC,WAAiC,WAAW,MAAS,EAC7D,KAAK,CAAC,GAAG,MAAM;AACd,UAAM,OAAO,EAAE,YAAY;AAC3B,UAAM,QAAQ,EAAE,YAAY;AAC5B,WAAO,OAAO,QAAQ,KAAK,OAAO,QAAQ,IAAI;AAAA,EAChD,CAAC;AACL;AAEA,SAAS,YACP,SACA,YACA,QAAoC,MACpC,kBAAkB,GACC;AACnB,SAAO,EAAE,iBAAiB,aAAa,GAAG,YAAY,GAAG,WAAW,GAAG,SAAS,OAAO,WAAW;AACpG;AAEA,SAAS,UAAU,OAAyB,QAAiC;AAC3E,QAAM,QAAQ,MAAM,UAAU,YAAY;AAC1C,MAAI;AAAA,IACF,0BAA0B,KAAK,UAAU;AAAA,MACvC,OAAO,MAAM;AAAA,MACb;AAAA,MACA,iBAAiB,OAAO;AAAA,MACxB,aAAa,OAAO;AAAA,MACpB,YAAY,OAAO;AAAA,MACnB,WAAW,OAAO;AAAA,MAClB,SAAS,OAAO;AAAA,MAChB,OAAO,OAAO;AAAA,MACd,YAAY,OAAO;AAAA,IACrB,CAAC,CAAC;AAAA,EACJ;AACF;AAEA,IAAM,0BAAN,cAAsC,MAAM;AAAA,EAC1C,cAAc;AACZ,UAAM,kCAAkC;AACxC,SAAK,OAAO;AAAA,EACd;AACF;AAEA,SAAS,eAAe,OAAgB,QAA8B;AACpE,SAAO,OAAO,WAAW,iBAAiB,2BACvC,iBAAiB,UAAU,MAAM,SAAS,gBAAgB,qBAAqB,KAAK,MAAM,OAAO;AACtG;AAOA,eAAsB,sBACpB,MACA,OAC4B;AAC5B,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,SAAS,kBAAkB,KAAK,MAAM;AAC5C,MAAI,CAAC,UAAU,OAAO,OAAO,GAAG;AAC9B,UAAMA,UAAS,YAAY,YAAY,KAAK,IAAI,IAAI,SAAS;AAC7D,cAAU,OAAOA,OAAM;AACvB,WAAOA;AAAA,EACT;AAEA,QAAM,gBAAgB,OAAO;AAC7B,MAAI,iBAAiB,GAAG;AACtB,UAAMA,UAAS,YAAY,iBAAiB,KAAK,IAAI,IAAI,SAAS;AAClE,cAAU,OAAOA,OAAM;AACvB,WAAOA;AAAA,EACT;AAEA,MAAI;AACJ,MAAI;AACF,eAAW,MAAM,KAAK,QAAQ,gBAAgB;AAAA,EAChD,SAAS,OAAO;AACd,QAAI,KAAK,+CAA+C,MAAM,UAAU,YAAY,EAAE,KAAK,KAAK,EAAE;AAClG,UAAMA,UAAS,YAAY,aAAa,KAAK,IAAI,IAAI,SAAS;AAC9D,cAAU,OAAOA,OAAM;AACvB,WAAOA;AAAA,EACT;AAKA,QAAM,aAAa;AAAA,IACjB;AAAA,IACA,MAAM;AAAA,IACN,OAAO;AAAA,EACT,EAAE,OAAO,CAAC,WAAW,OAAO,YAAY,OAAO,MAAM,aAAa;AAClE,QAAM,aAAa,WAAW,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,MAAM,aAAa,CAAC,CAAC;AAE7E,MAAI,WAAW,WAAW,GAAG;AAC3B,UAAMA,UAAS,YAAY,iBAAiB,KAAK,IAAI,IAAI,SAAS;AAClE,cAAU,OAAOA,OAAM;AACvB,WAAOA;AAAA,EACT;AAEA,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,YAAY,OAAO;AACzB,MAAI,WAAW;AACf,MAAI;AACJ,QAAM,WAAW,OAAO,SAAS,SAAS,KAAK,YAAY,IACvD,IAAI,QAAe,CAAC,GAAG,WAAW;AAChC,cAAU,WAAW,MAAM;AACzB,iBAAW;AACX,YAAM,QAAQ,IAAI,wBAAwB;AAC1C,iBAAW,MAAM,KAAK;AACtB,aAAO,KAAK;AAAA,IACd,GAAG,SAAS;AAAA,EACd,CAAC,IACD;AACJ,QAAM,eAAe,QAAQ,QAAQ,EAAE,KAAK,MAAM,KAAK,WAAW;AAAA,IAChE,EAAE,IAAI,MAAM,UAAU,YAAY,IAAI,SAAS,MAAM,UAAU,QAAQ;AAAA,IACvE,MAAM,iBAAiB,MAAM,uBAAuB,OAChD,EAAE,IAAI,MAAM,eAAe,SAAS,MAAM,mBAAmB,IAC7D;AAAA,IACJ,WAAW,IAAI,CAAC,YAAY;AAAA,MAC1B,IAAI,OAAO,YAAY;AAAA,MACvB,UAAU,OAAO,YAAY;AAAA,MAC7B,SAAS,OAAO;AAAA,IAClB,EAAE;AAAA,IACF,WAAW;AAAA,EACb,CAAC;AAED,MAAI;AACJ,MAAI;AACF,UAAM,WAAW,WACb,MAAM,QAAQ,KAAK,CAAC,cAAc,QAAQ,CAAC,IAC3C,MAAM;AACV,QAAI,YAAY,WAAW,OAAO,SAAS;AACzC,YAAMA,UAAS;AAAA,QACb;AAAA,QACA,KAAK,IAAI,IAAI;AAAA,QACb;AAAA,QACA,WAAW;AAAA,MACb;AACA,gBAAU,OAAOA,OAAM;AACvB,aAAOA;AAAA,IACT;AACA,eAAW,SAAS;AAAA,EACtB,SAAS,OAAO;AACd,UAAMA,UAAS;AAAA,MACb,YAAY,eAAe,OAAO,WAAW,MAAM,IAAI,YAAY;AAAA,MACnE,KAAK,IAAI,IAAI;AAAA,MACb;AAAA,MACA,WAAW;AAAA,IACb;AACA,QAAI,KAAK,kDAAkD,MAAM,UAAU,YAAY,EAAE,KAAK,KAAK,EAAE;AACrG,cAAU,OAAOA,OAAM;AACvB,WAAOA;AAAA,EACT,UAAE;AACA,iBAAa,OAAQ;AAAA,EACvB;AAEA,MAAI,cAAc;AAClB,MAAI,aAAa;AACjB,MAAI,YAAY;AAChB,aAAW,aAAa,YAAY;AAClC,UAAM,UAAU,SAAS,KAAK,CAAC,cAAc,UAAU,aAAa,UAAU,YAAY,EAAE;AAC5F,QAAI,SAAS,YAAY,eAAe;AACtC,UAAI,OAAO,QAAQ;AACjB,uBAAe;AACf;AAAA,MACF;AACA,UAAI;AACF,cAAM,gBAAgB,MAAM,iBAAiB,MAAM,UAAU,YAAY;AACzE,cAAM,aAAa,MAAM,KAAK,QAAQ;AAAA,UACpC,UAAU,YAAY;AAAA,UACtB;AAAA,UACA,0BAA0B,MAAM,KAAK;AAAA,QACvC;AACA,YAAI,CAAC,WAAY;AACjB,cAAM,UAAU,MAAM,KAAK,QAAQ,cAAc,UAAU,YAAY,EAAE;AACzE,YAAI,SAAS;AACX,gBAAM,KAAK,QAAQ,uBAAuB,SAAS;AAAA,YACjD,mBAAmB;AAAA,YACnB,eAAe,MAAM,UAAU,YAAY;AAAA,UAC7C,CAAC;AAAA,QACH;AACA,uBAAe;AAAA,MACjB,SAAS,OAAO;AACd,YAAI,KAAK,2CAA2C,UAAU,YAAY,EAAE,KAAK,KAAK,EAAE;AAAA,MAC1F;AACA;AAAA,IACF;AACA,QAAI,SAAS,YAAY,eAAe;AACtC,oBAAc;AAAA,IAChB,OAAO;AACL,mBAAa;AACb,UAAI,KAAK,wCAAwC,UAAU,YAAY,EAAE,EAAE;AAAA,IAC7E;AAAA,EACF;AAEA,QAAM,SAA4B;AAAA,IAChC,iBAAiB,WAAW;AAAA,IAC5B;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS;AAAA,IACT,OAAO;AAAA,IACP,YAAY,KAAK,IAAI,IAAI;AAAA,EAC3B;AACA,YAAU,OAAO,MAAM;AACvB,SAAO;AACT;;;ACnQO,SAAS,yBAAyB,KAAqB;AAC5D,SAAO,IACJ,KAAK,EACL,YAAY,EACZ,QAAQ,YAAY,GAAG,EAIvB,QAAQ,UAAU,EAAE;AACzB;AAYO,SAAS,uBACd,WACA,eACe;AACf,MAAI,CAAC,aAAa,OAAO,cAAc,SAAU,QAAO;AACxD,MAAI,CAAC,iBAAiB,OAAO,kBAAkB,SAAU,QAAO;AAChE,QAAM,SAAS,yBAAyB,SAAS;AACjD,QAAM,OAAO,yBAAyB,aAAa;AACnD,MAAI,OAAO,WAAW,KAAK,KAAK,WAAW,EAAG,QAAO;AACrD,SAAO,GAAG,MAAM,KAAK,IAAI;AAC3B;AAMO,SAAS,wBAAwB,MAG3B;AACX,MAAI,CAAC,KAAK,UAAW,QAAO,CAAC;AAC7B,MAAI,CAAC,KAAK,qBAAsB,QAAO,CAAC;AACxC,QAAM,OAAiB,CAAC;AACxB,aAAW,YAAY,OAAO,KAAK,KAAK,oBAAoB,GAAG;AAC7D,UAAM,MAAM,uBAAuB,KAAK,WAAW,QAAQ;AAC3D,QAAI,IAAK,MAAK,KAAK,GAAG;AAAA,EACxB;AACA,SAAO;AACT;AAYO,SAAS,+BACd,YACA,QACS;AACT,QAAM,mBAAmB,yBAAyB,MAAM;AACxD,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,UAAU,GAAG;AAC/C,QAAI,yBAAyB,CAAC,MAAM,iBAAkB,QAAO;AAAA,EAC/D;AACA,SAAO;AACT;AAgBO,SAAS,wBAAwB,MAMH;AACnC,QAAM,EAAE,WAAW,cAAc,eAAe,cAAc,YAAY,IAAI;AAE9E,MAAI,UAAU,OAAO,YAAa,QAAO;AACzC,MAAI,UAAU,UAAU,UAAU,WAAW,SAAU,QAAO;AAC9D,MAAI,CAAC,UAAU,UAAW,QAAO;AACjC,MAAI,CAAC,UAAU,qBAAsB,QAAO;AAK5C,QAAM,sBAAsB,yBAAyB,UAAU,SAAS;AACxE,QAAM,gBAAgB,yBAAyB,YAAY;AAC3D,MAAI,wBAAwB,cAAe,QAAO;AAMlD,QAAM,mBAAmB,KAAK,MAAM,iBAAiB,SAAS,CAAC;AAC/D,QAAM,aAAa,KAAK,MAAM,YAAY;AAC1C,MAAI,CAAC,OAAO,SAAS,gBAAgB,KAAK,CAAC,OAAO,SAAS,UAAU,EAAG,QAAO;AAC/E,MAAI,oBAAoB,WAAY,QAAO;AAE3C,QAAM,cAAwB,CAAC;AAC/B,aAAW,CAAC,UAAU,QAAQ,KAAK,OAAO,QAAQ,aAAa,GAAG;AAGhE,UAAM,iBAAiB;AAAA,MACrB,UAAU;AAAA,MACV;AAAA,IACF;AACA,QAAI,mBAAmB,OAAW;AAElC,QAAI,eAAe,OAAO,cAAc,CAAC,MAAM,eAAe,QAAQ,EAAG;AACzE,UAAM,MAAM,uBAAuB,cAAc,QAAQ;AACzD,QAAI,IAAK,aAAY,KAAK,GAAG;AAAA,EAC/B;AAEA,SAAO,YAAY,SAAS,IAAI,EAAE,YAAY,IAAI;AACpD;AAEA,SAAS,eAAe,GAAmB;AACzC,SAAO,EAAE,KAAK,EAAE,YAAY;AAC9B;AAEA,eAAe,qCAAqC,MAOlC;AAChB,QAAM,oBAAoB,oBAAI,IAAY;AAC1C,QAAM,SAAS,KAAK,cAAc;AAAA,IAChC,CAAC,cAAc,UAAU,YAAY,aAAa,KAAK;AAAA,EACzD;AAEA,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,MAAM,YAAY,MAAM,MAAM;AAC/C,QAAI,kBAAkB,IAAI,QAAQ,EAAG;AAErC,QAAI;AACF,YAAM,aAAa,MAAM,KAAK,QAAQ,iBAAiB,MAAM,IAAI;AACjE,UAAI,CAAC,WAAY;AACjB,wBAAkB,IAAI,QAAQ;AAC9B,YAAM,cAAc,WAAW,YAAY,UAAU;AACrD,UAAI,gBAAgB,YAAY,WAAW,YAAY,aAAc;AAErE,YAAM,KAAK,QAAQ;AAAA,QACjB;AAAA,QACA;AAAA,UACE,QAAQ;AAAA,UACR,cAAc,KAAK;AAAA,UACnB,cAAc,KAAK;AAAA,UACnB,SAAS,KAAK;AAAA,UACd,GAAI,KAAK,aAAa,CAAC,WAAW,YAAY,aAC1C,EAAE,YAAY,KAAK,UAAU,IAC7B,CAAC;AAAA,QACP;AAAA,QACA;AAAA,UACE,OAAO;AAAA,UACP,YAAY;AAAA,UACZ,kBAAkB,CAAC,KAAK,aAAa,KAAK,QAAQ;AAAA,QACpD;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,uDAAuD,MAAM,YAAY,EAAE,eAAe,KAAK,QAAQ,KAAK,GAAG;AAAA,MACjH;AAAA,IACF;AAAA,EACF;AACF;AAYA,eAAsB,0BAA0B,MAmBR;AACtC,QAAM,QAAoC,EAAE,eAAe,CAAC,GAAG,aAAa,CAAC,EAAE;AAC/E,MAAI,CAAC,KAAK,QAAS,QAAO;AAC1B,MAAI,CAAC,KAAK,UAAW,QAAO;AAC5B,MAAI,CAAC,KAAK,qBAAsB,QAAO;AACvC,MAAI,OAAO,KAAK,KAAK,oBAAoB,EAAE,WAAW,EAAG,QAAO;AAEhE,QAAM,UAAU,wBAAwB;AAAA,IACtC,WAAW,KAAK;AAAA,IAChB,sBAAsB,KAAK;AAAA,EAC7B,CAAC;AACD,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,MAAI;AACJ,MAAI;AACF,kBAAc,MAAM,KAAK,QAAQ,gBAAgB;AAAA,EACnD,SAAS,KAAK;AACZ,QAAI,KAAK,kDAAkD,GAAG,EAAE;AAChE,WAAO;AAAA,EACT;AAkBA,QAAM,gBAAgB,YAAY,KAAK,CAAC,MAAM,EAAE,YAAY,OAAO,KAAK,WAAW;AACnF,QAAM,qBAAqB,KAAK,qBAC5B,KAAK,YACJ,gBAAgB,iBAAiB,cAAc,WAAW,IAAI,KAAK;AAExE,QAAM,gBAA0B,CAAC;AACjC,QAAM,cAAc,oBAAI,IAAY;AAUpC,QAAM,eAAe,oBAAI,IAAY;AAmBrC,MAAI;AACJ,MAAI;AACF,mBAAe,MAAM,KAAK,QAAQ,oBAAoB;AAAA,EACxD,SAAS,KAAK;AACZ,QAAI,KAAK,sDAAsD,GAAG,EAAE;AACpE,mBAAe,CAAC;AAAA,EAClB;AAMA,QAAM,gBAA8B,CAAC,GAAG,aAAa,GAAG,YAAY;AAEpE,aAAW,UAAU,eAAe;AAClC,QAAI,OAAO,YAAY,OAAO,KAAK,YAAa;AAChD,UAAM,YAAY,OAAO,YAAY,MAAM,OAAO;AAClD,QAAI,aAAa,IAAI,SAAS,EAAG;AACjC,UAAM,iBAAiB,OAAO,YAAY,UAAU;AACpD,QAAI,mBAAmB,UAAU;AAK/B;AAAA,IACF;AAUA,UAAM,WAAW,wBAAwB;AAAA,MACvC,WAAW,OAAO;AAAA,MAClB,cAAc,KAAK;AAAA,MACnB,eAAe,KAAK;AAAA,MACpB,cAAc;AAAA,MACd,aAAa,KAAK;AAAA,IACpB,CAAC;AACD,QAAI,CAAC,UAAU;AAGb,mBAAa,IAAI,SAAS;AAC1B;AAAA,IACF;AAEA,QAAI;AAeF,YAAM,QAAQ,MAAM,KAAK,QAAQ,iBAAiB,OAAO,IAAI;AAC7D,UAAI,CAAC,OAAO;AACV,YAAI;AAAA,UACF,oDAAoD,OAAO,YAAY,EAAE,2BAA2B,OAAO,IAAI;AAAA,QACjH;AAGA;AAAA,MACF;AAGA,mBAAa,IAAI,SAAS;AAC1B,YAAM,cAAc,MAAM,YAAY,UAAU;AAChD,UAAI,gBAAgB,YAAY,MAAM,YAAY,cAAc;AAC9D,YAAI;AAAA,UACF,oDAAoD,OAAO,YAAY,EAAE;AAAA,QAC3E;AACA;AAAA,MACF;AAWA,YAAM,eAAe,IAAI,KAAK,MAAM,YAAY,OAAO,EAAE,QAAQ;AACjE,YAAM,eAAe,IAAI,KAAK,kBAAkB,EAAE,QAAQ;AAC1D,YAAM,eAAe,IAAI,KAAK,KAAK,SAAS,EAAE,QAAQ;AACtD,YAAM,QAAQ,KAAK;AAAA,QACjB,OAAO,SAAS,YAAY,IAAI,eAAe;AAAA,QAC/C,OAAO,SAAS,YAAY,IAAI,eAAe;AAAA,QAC/C,OAAO,SAAS,YAAY,IAAI,eAAe;AAAA,MACjD;AACA,YAAM,eAAe,IAAI,KAAK,KAAK,EAAE,YAAY;AAkBjD,UAAI;AACJ,UAAI,CAAC,MAAM,YAAY,YAAY;AACjC,YAAI,KAAK,oBAAoB;AAC3B,2BAAiB;AAAA,QACnB,OAAO;AACL,gBAAM,aAAa,eAAe,YAAY,UAAU,KAAK;AAC7D,2BACE,cAAc,WAAW,SAAS,IAAI,aAAa;AAAA,QACvD;AAAA,MACF;AACA,YAAM,QAAQ,MAAM,KAAK,QAAQ;AAAA,QAC/B;AAAA,QACA;AAAA,UACE,QAAQ;AAAA,UACR,cAAc,KAAK;AAAA,UACnB;AAAA,UACA,SAAS;AAAA,UACT,GAAI,iBAAiB,EAAE,YAAY,eAAe,IAAI,CAAC;AAAA,QACzD;AAAA,QACA;AAAA,UACE,OAAO;AAAA,UACP,YAAY;AAAA,UACZ,kBAAkB,CAAC,KAAK,WAAW;AAAA,QACrC;AAAA,MACF;AACA,UAAI,OAAO;AACT,sBAAc,KAAK,OAAO,YAAY,EAAE;AACxC,mBAAW,OAAO,SAAS,YAAa,aAAY,IAAI,GAAG;AAC3D,cAAM,qCAAqC;AAAA,UACzC,SAAS,KAAK;AAAA,UACd;AAAA,UACA,UAAU,MAAM,YAAY;AAAA,UAC5B,aAAa,KAAK;AAAA,UAClB;AAAA,UACA,WAAW,kBAAkB,MAAM,YAAY;AAAA,QACjD,CAAC;AAiBD,cAAM,kBACJ,SAAS,YAAY,SAAS,IAAI,SAAS,cAAc,CAAC,MAAS;AACrE,mBAAW,OAAO,iBAAiB;AACjC,cAAI;AACF,kBAAM,KAAK,QAAQ,gBAAgB;AAAA,cACjC,QAAQ;AAAA,cACR,WAAW;AAAA,cACX,gBAAgB,MAAM,YAAY;AAAA,cAClC,GAAI,MAAM,YAAY,cAClB,EAAE,aAAa,MAAM,YAAY,YAAY,IAC7C,CAAC;AAAA,cACL,YAAY,MAAM;AAAA,cAClB,GAAI,MAAM,YAAY,YAAY,EAAE,WAAW,MAAM,YAAY,UAAU,IAAI,CAAC;AAAA,cAChF,GAAI,MAAM,EAAE,iBAAiB,IAAI,IAAI,CAAC;AAAA,cACtC,WAAW;AAAA,YACb,CAAC;AAAA,UACH,SAAS,SAAS;AAChB,gBAAI;AAAA,cACF,oDAAoD,MAAM,YAAY,EAAE,GAAG,MAAM,SAAS,GAAG,MAAM,EAAE,MAAM,OAAO;AAAA,YACpH;AAAA,UACF;AAAA,QACF;AACA,YAAI,KAAK,cAAc,KAAK,UAAU,KAAK,gBAAgB;AACzD,cAAI;AACF,kBAAM;AAAA,cACJ;AAAA,gBACE,SAAS,KAAK;AAAA,gBACd,YAAY,KAAK;AAAA,gBACjB,QAAQ,KAAK;AAAA,cACf;AAAA,cACA;AAAA,gBACE,WAAW;AAAA,gBACX,eAAe,KAAK;AAAA,gBACpB,oBAAoB,eAAe,WAAW;AAAA,gBAC9C,OAAO;AAAA,gBACP,gBAAgB,KAAK;AAAA,cACvB;AAAA,YACF;AAAA,UACF,SAAS,gBAAgB;AACvB,gBAAI;AAAA,cACF,4DAA4D,MAAM,YAAY,EAAE,KAAK,cAAc;AAAA,YACrG;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,yCAAyC,OAAO,YAAY,EAAE,gBAAgB,GAAG;AAAA,MACnF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,cAAc,SAAS,GAAG;AAC5B,QAAI;AAAA,MACF,iCAAiC,cAAc,MAAM,2BAA2B,KAAK,WAAW,UAAU,MAAM,KAAK,WAAW,EAAE,KAAK,GAAG,CAAC;AAAA,IAC7I;AAAA,EACF;AAEA,SAAO,EAAE,eAAe,aAAa,MAAM,KAAK,WAAW,EAAE;AAC/D;AAQO,SAAS,iCACd,aACA,SACS;AACT,MAAI,CAAC,QAAQ,QAAS,QAAO;AAC7B,MAAI,QAAQ,gBAAiB,QAAO;AACpC,SAAO,YAAY,WAAW;AAChC;","names":["result"]}

package/dist/{chunk-WPZX7MEA.js → chunk-FXX6RQYC.js}

@@ -1,12 +1,12 @@
 import {
   StorageManager
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   bumpMemoryCorpusVersionForDir
 } from "./chunk-KMAP7SNQ.js";
 import {
   requestEntityCanonicalIdReconcile
-} from "./chunk-JDCQK3C5.js";
+} from "./chunk-M4A44LUA.js";
 import {
   decideLifecycleTransition
 } from "./chunk-TBBDFYXW.js";
@@ -759,4 +759,4 @@ export {
   listMemoryGovernanceRuns,
   readMemoryGovernanceRunArtifact
 };
-//# sourceMappingURL=chunk-WPZX7MEA.js.map
+//# sourceMappingURL=chunk-FXX6RQYC.js.map

package/dist/{chunk-S75UQ3T3.js → chunk-GDDGZVFI.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-KJTKLXTH.js";
 import {
   StorageManager
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   copyExistingFileToBackup,
   writeFileAtomically
@@ -260,4 +260,4 @@ export {
   backupExistingLedger,
   rebuildMemoryLifecycleLedger
 };
-//# sourceMappingURL=chunk-S75UQ3T3.js.map
+//# sourceMappingURL=chunk-GDDGZVFI.js.map

package/dist/{chunk-S2SJEOTM.js → chunk-GFIKG4FR.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   getCachedRuleMemories,
   setCachedRuleMemories
@@ -119,4 +119,4 @@ export {
   compareVerifiedSemanticRuleResults,
   searchVerifiedSemanticRules
 };
-//# sourceMappingURL=chunk-S2SJEOTM.js.map
+//# sourceMappingURL=chunk-GFIKG4FR.js.map

package/dist/{chunk-7NDM2PNK.js → chunk-GZICBRWK.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-24BKGKGO.js";
+} from "./chunk-BOFVT6P3.js";
 import {
   composeMemoryEnvelope
 } from "./chunk-5V6IXHPI.js";
@@ -546,4 +546,4 @@ export {
   setSemanticRulePromotionTestHooks,
   promoteSemanticRuleFromMemory
 };
-//# sourceMappingURL=chunk-7NDM2PNK.js.map
+//# sourceMappingURL=chunk-GZICBRWK.js.map

package/dist/{chunk-X4IDNPOS.js → chunk-HAEU3ZW7.js}

@@ -1,7 +1,7 @@
 import {
   BUILTIN_CONNECTORS,
   loadRegistry
-} from "./chunk-PNRA7FAD.js";
+} from "./chunk-RZRUV6N2.js";
 
 // src/connectors/label.ts
 var CONNECTOR_LABEL_MAX_LENGTH = 64;
@@ -25,4 +25,4 @@ export {
   CONNECTOR_LABEL_MAX_LENGTH,
   knownConnectorIds
 };
-//# sourceMappingURL=chunk-X4IDNPOS.js.map
+//# sourceMappingURL=chunk-HAEU3ZW7.js.map