@remnic/core 9.62.1 → 9.63.0

package/dist/chunk-T3GIETKV.js

@@ -0,0 +1,152 @@
+// src/episodic-context.ts
+var TURN_FIELD_SEPARATOR = String.fromCharCode(1);
+function resolveProvenanceTurnIndex(turnId) {
+  if (typeof turnId !== "string" || turnId.length === 0) return null;
+  const lastField = turnId.includes(TURN_FIELD_SEPARATOR) ? turnId.split(TURN_FIELD_SEPARATOR).pop() : turnId;
+  if (!/^\d+$/.test(lastField)) return null;
+  const parsed = Number.parseInt(lastField, 10);
+  return Number.isSafeInteger(parsed) && parsed >= 0 ? parsed : null;
+}
+function windowForTurn(sessionKey, turn, rank, memoryId) {
+  const fromTurn = Math.max(0, turn - 1);
+  return {
+    sessionKey,
+    fromTurn,
+    toTurn: turn + 2,
+    factRank: rank,
+    bestTurn: turn,
+    memoryIds: /* @__PURE__ */ new Set([memoryId])
+  };
+}
+function mergeDrafts(drafts, maxTurnsPerEpisode) {
+  const bySession = /* @__PURE__ */ new Map();
+  for (const draft of drafts) {
+    const list = bySession.get(draft.sessionKey);
+    if (list) list.push(draft);
+    else bySession.set(draft.sessionKey, [draft]);
+  }
+  const windows = [];
+  for (const [, sessionDrafts] of bySession) {
+    sessionDrafts.sort(
+      (a, b) => a.fromTurn - b.fromTurn || a.toTurn - b.toTurn
+    );
+    let current = null;
+    const flush = () => {
+      if (!current) return;
+      windows.push(finalizeWindow(current, maxTurnsPerEpisode));
+      current = null;
+    };
+    for (const draft of sessionDrafts) {
+      if (current && draft.fromTurn <= current.toTurn) {
+        current.toTurn = Math.max(current.toTurn, draft.toTurn);
+        if (draft.factRank < current.factRank) {
+          current.factRank = draft.factRank;
+          current.bestTurn = draft.bestTurn;
+        }
+        for (const id of draft.memoryIds) current.memoryIds.add(id);
+      } else {
+        flush();
+        current = { ...draft, memoryIds: new Set(draft.memoryIds) };
+      }
+    }
+    flush();
+  }
+  return windows;
+}
+function finalizeWindow(draft, maxTurnsPerEpisode) {
+  let { fromTurn, toTurn } = draft;
+  const span = toTurn - fromTurn;
+  if (maxTurnsPerEpisode > 0 && span > maxTurnsPerEpisode) {
+    fromTurn = Math.min(
+      Math.max(draft.bestTurn - 1, draft.fromTurn),
+      draft.toTurn - maxTurnsPerEpisode
+    );
+    if (fromTurn + maxTurnsPerEpisode <= draft.bestTurn) {
+      fromTurn = Math.min(draft.bestTurn, draft.toTurn - maxTurnsPerEpisode);
+    }
+    toTurn = fromTurn + maxTurnsPerEpisode;
+  }
+  return {
+    sessionKey: draft.sessionKey,
+    fromTurn,
+    toTurn,
+    factRank: draft.factRank,
+    memoryIds: [...draft.memoryIds].sort()
+  };
+}
+function compareEpisodeWindows(left, right) {
+  const leftIds = left.memoryIds.join("\0");
+  const rightIds = right.memoryIds.join("\0");
+  return left.factRank - right.factRank || (left.sessionKey < right.sessionKey ? -1 : left.sessionKey > right.sessionKey ? 1 : 0) || left.fromTurn - right.fromTurn || left.toTurn - right.toTurn || (leftIds < rightIds ? -1 : leftIds > rightIds ? 1 : 0);
+}
+function planEpisodeWindows(options) {
+  if (options.maxEpisodes <= 0 || options.maxTurnsPerEpisode <= 0) return [];
+  const drafts = [];
+  for (const fact of options.recalledFacts) {
+    if (!fact || !Array.isArray(fact.sources)) continue;
+    for (const source of fact.sources) {
+      if (!source || typeof source.sessionKey !== "string" || source.sessionKey.length === 0) {
+        continue;
+      }
+      const turn = resolveProvenanceTurnIndex(source.turnId);
+      if (turn === null) continue;
+      drafts.push(
+        windowForTurn(source.sessionKey, turn, fact.rank, fact.memoryId)
+      );
+    }
+  }
+  if (drafts.length === 0) return [];
+  const windows = mergeDrafts(drafts, options.maxTurnsPerEpisode);
+  return windows.sort(compareEpisodeWindows).slice(0, options.maxEpisodes);
+}
+function factsNeedingQuoteFallback(recalledFacts) {
+  return recalledFacts.filter(
+    (fact) => fact && Array.isArray(fact.sources) && fact.sources.length > 0 && fact.sources.some((source) => typeof source?.quote === "string" && source.quote.length > 0) && !fact.sources.some((source) => resolveProvenanceTurnIndex(source?.turnId) !== null)
+  );
+}
+async function planEpisodeWindowsWithFallback(options) {
+  const facts = [...options.recalledFacts];
+  const locator = options.locateQuote;
+  if (locator && facts.length > 0) {
+    for (const fact of factsNeedingQuoteFallback(options.recalledFacts)) {
+      for (const source of fact.sources ?? []) {
+        if (typeof source?.quote !== "string" || source.quote.length === 0) continue;
+        if (typeof source.sessionKey !== "string" || source.sessionKey.length === 0) continue;
+        let turn = null;
+        try {
+          turn = await locator(source.quote, source.sessionKey);
+        } catch {
+          turn = null;
+        }
+        if (turn === null || !Number.isSafeInteger(turn) || turn < 0) continue;
+        facts.push({
+          memoryId: fact.memoryId,
+          rank: fact.rank,
+          sources: [
+            {
+              sessionKey: source.sessionKey,
+              turnId: String(turn),
+              observedAt: source.observedAt,
+              quote: source.quote
+            }
+          ]
+        });
+        break;
+      }
+    }
+  }
+  return planEpisodeWindows({
+    recalledFacts: facts,
+    maxEpisodes: options.maxEpisodes,
+    maxTurnsPerEpisode: options.maxTurnsPerEpisode
+  });
+}
+
+export {
+  resolveProvenanceTurnIndex,
+  compareEpisodeWindows,
+  planEpisodeWindows,
+  factsNeedingQuoteFallback,
+  planEpisodeWindowsWithFallback
+};
+//# sourceMappingURL=chunk-T3GIETKV.js.map

package/dist/chunk-T3GIETKV.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/episodic-context.ts"],"sourcesContent":["/**\n * Episodic context planning (issue #2331, harmonic-memory P3).\n *\n * Turns the structured `sources` provenance on recalled facts into episode\n * windows over the LCM archive: resolve each source's turn, group overlapping\n * turn ranges within a session into merged episodes, and cap the episode\n * count/span. Pure planning — no archive access — plus an async wrapper that\n * applies the single documented fallback (quote lookup) through an injected\n * locator so the planner stays testable without SQLite.\n *\n * Window bounds are `[start, end)` throughout (`toTurn` exclusive); the\n * archive's `getMessages` bounds are inclusive, so the fetch site passes\n * `toTurn - 1`.\n */\n\nimport type { ProvenanceSource } from \"./types.js\";\n\n/** One fact contributing to episodic planning, with its final recall rank. */\nexport interface EpisodicFactInput {\n  memoryId: string;\n  /** Final recall rank of the fact (0 = best). Lower wins. */\n  rank: number;\n  sources?: ProvenanceSource[];\n}\n\n/** A merged, fetch-ready episode window. */\nexport interface EpisodeWindow {\n  sessionKey: string;\n  /** Inclusive first turn. */\n  fromTurn: number;\n  /** EXCLUSIVE end turn (`[start, end)` semantics). */\n  toTurn: number;\n  /** Best (lowest) rank among contributing facts — drives ordering. */\n  factRank: number;\n  /** Sorted, deduplicated contributing memory ids (citation line). */\n  memoryIds: string[];\n}\n\n/** Locates a quote's turn index within a session, or null on a miss. */\nexport type QuoteLocator = (\n  quote: string,\n  sessionKey: string,\n) => Promise<number | null>;\n\nconst TURN_FIELD_SEPARATOR = String.fromCharCode(1);\n\n/**\n * Resolve a provenance `turnId` to a numeric LCM turn index, or null.\n *\n * Extraction writes `turnId` as the host turn fingerprint\n * (`buildTurnFingerprint`: `role␁content␁thread␁turnIndex`), so the numeric\n * LCM turn index is the LAST `␁`-separated field. A bare integer string is\n * also accepted. Anything else is unresolvable — skip, never guess.\n */\nexport function resolveProvenanceTurnIndex(turnId: unknown): number | null {\n  if (typeof turnId !== \"string\" || turnId.length === 0) return null;\n  const lastField = turnId.includes(TURN_FIELD_SEPARATOR)\n    ? turnId.split(TURN_FIELD_SEPARATOR).pop()!\n    : turnId;\n  if (!/^\\d+$/.test(lastField)) return null;\n  const parsed = Number.parseInt(lastField, 10);\n  return Number.isSafeInteger(parsed) && parsed >= 0 ? parsed : null;\n}\n\ninterface DraftWindow {\n  sessionKey: string;\n  fromTurn: number;\n  toTurn: number;\n  factRank: number;\n  bestTurn: number;\n  memoryIds: Set<string>;\n}\n\nfunction windowForTurn(\n  sessionKey: string,\n  turn: number,\n  rank: number,\n  memoryId: string,\n): DraftWindow {\n  const fromTurn = Math.max(0, turn - 1);\n  return {\n    sessionKey,\n    fromTurn,\n    toTurn: turn + 2,\n    factRank: rank,\n    bestTurn: turn,\n    memoryIds: new Set([memoryId]),\n  };\n}\n\nfunction mergeDrafts(drafts: DraftWindow[], maxTurnsPerEpisode: number): EpisodeWindow[] {\n  const bySession = new Map<string, DraftWindow[]>();\n  for (const draft of drafts) {\n    const list = bySession.get(draft.sessionKey);\n    if (list) list.push(draft);\n    else bySession.set(draft.sessionKey, [draft]);\n  }\n\n  const windows: EpisodeWindow[] = [];\n  for (const [, sessionDrafts] of bySession) {\n    // Sort by fromTurn, then toTurn, so a shuffle cannot change merge results.\n    sessionDrafts.sort(\n      (a, b) => a.fromTurn - b.fromTurn || a.toTurn - b.toTurn,\n    );\n    let current: DraftWindow | null = null;\n    const flush = () => {\n      if (!current) return;\n      windows.push(finalizeWindow(current, maxTurnsPerEpisode));\n      current = null;\n    };\n    for (const draft of sessionDrafts) {\n      if (current && draft.fromTurn <= current.toTurn) {\n        // Overlapping or adjacent ([a,b) + [b,c) share no turn but read as one\n        // continuous episode): merge. Merged bounds stay [start, end).\n        current.toTurn = Math.max(current.toTurn, draft.toTurn);\n        if (draft.factRank < current.factRank) {\n          current.factRank = draft.factRank;\n          current.bestTurn = draft.bestTurn;\n        }\n        for (const id of draft.memoryIds) current.memoryIds.add(id);\n      } else {\n        flush();\n        current = { ...draft, memoryIds: new Set(draft.memoryIds) };\n      }\n    }\n    flush();\n  }\n  return windows;\n}\n\nfunction finalizeWindow(draft: DraftWindow, maxTurnsPerEpisode: number): EpisodeWindow {\n  let { fromTurn, toTurn } = draft;\n  const span = toTurn - fromTurn;\n  if (maxTurnsPerEpisode > 0 && span > maxTurnsPerEpisode) {\n    // Trim the tail but keep the highest-ranked fact's turn inside: anchor one\n    // turn of leading context on the best turn, clamped to the merged range.\n    fromTurn = Math.min(\n      Math.max(draft.bestTurn - 1, draft.fromTurn),\n      draft.toTurn - maxTurnsPerEpisode,\n    );\n    // maxTurnsPerEpisode === 1 (or a clamp collision) can push the anchor\n    // above the best turn; slide back down so the best turn stays included.\n    if (fromTurn + maxTurnsPerEpisode <= draft.bestTurn) {\n      fromTurn = Math.min(draft.bestTurn, draft.toTurn - maxTurnsPerEpisode);\n    }\n    toTurn = fromTurn + maxTurnsPerEpisode;\n  }\n  return {\n    sessionKey: draft.sessionKey,\n    fromTurn,\n    toTurn,\n    factRank: draft.factRank,\n    memoryIds: [...draft.memoryIds].sort(),\n  };\n}\n\n/** Total, stable ordering: rank asc, sessionKey asc, fromTurn asc, then residual identity. */\nexport function compareEpisodeWindows(\n  left: EpisodeWindow,\n  right: EpisodeWindow,\n): number {\n  const leftIds = left.memoryIds.join(\"\\u{0}\");\n  const rightIds = right.memoryIds.join(\"\\u{0}\");\n  return (\n    left.factRank - right.factRank ||\n    (left.sessionKey < right.sessionKey ? -1 : left.sessionKey > right.sessionKey ? 1 : 0) ||\n    left.fromTurn - right.fromTurn ||\n    left.toTurn - right.toTurn ||\n    (leftIds < rightIds ? -1 : leftIds > rightIds ? 1 : 0)\n  );\n}\n\n/**\n * Plan episode windows from recalled facts' structured provenance.\n *\n * Pure: no archive access. Facts without a structured `sources` array are\n * skipped (no legacy scalar `source` parsing). Sources whose `turnId` does\n * not resolve to a number are skipped — the caller decides whether to attempt\n * the quote fallback for facts that lost every source.\n *\n * `maxEpisodes` or `maxTurnsPerEpisode` of 0 disables the section: returns\n * `[]` before any work (zero semantics, checklist item 33).\n */\nexport function planEpisodeWindows(options: {\n  recalledFacts: ReadonlyArray<EpisodicFactInput>;\n  maxEpisodes: number;\n  maxTurnsPerEpisode: number;\n}): EpisodeWindow[] {\n  if (options.maxEpisodes <= 0 || options.maxTurnsPerEpisode <= 0) return [];\n  const drafts: DraftWindow[] = [];\n  for (const fact of options.recalledFacts) {\n    if (!fact || !Array.isArray(fact.sources)) continue;\n    for (const source of fact.sources) {\n      if (!source || typeof source.sessionKey !== \"string\" || source.sessionKey.length === 0) {\n        continue;\n      }\n      const turn = resolveProvenanceTurnIndex(source.turnId);\n      if (turn === null) continue;\n      drafts.push(\n        windowForTurn(source.sessionKey, turn, fact.rank, fact.memoryId),\n      );\n    }\n  }\n  if (drafts.length === 0) return [];\n  const windows = mergeDrafts(drafts, options.maxTurnsPerEpisode);\n  return windows.sort(compareEpisodeWindows).slice(0, options.maxEpisodes);\n}\n\n/**\n * Facts whose sources all failed turn resolution but that carry a quote.\n * These are the ONLY candidates for the quote-lookup fallback.\n */\nexport function factsNeedingQuoteFallback(\n  recalledFacts: ReadonlyArray<EpisodicFactInput>,\n): EpisodicFactInput[] {\n  return recalledFacts.filter(\n    (fact) =>\n      fact &&\n      Array.isArray(fact.sources) &&\n      fact.sources.length > 0 &&\n      fact.sources.some((source) => typeof source?.quote === \"string\" && source.quote.length > 0) &&\n      !fact.sources.some((source) => resolveProvenanceTurnIndex(source?.turnId) !== null),\n  );\n}\n\n/**\n * Plan episode windows, applying the single documented fallback: for a fact\n * whose turnIds ALL failed resolution but that has a quote, locate the quote\n * in the archive and window around the located turn. A locator miss means the\n * fact contributes no episode. Falls back to the pure plan when no locator is\n * supplied.\n */\nexport async function planEpisodeWindowsWithFallback(options: {\n  recalledFacts: ReadonlyArray<EpisodicFactInput>;\n  maxEpisodes: number;\n  maxTurnsPerEpisode: number;\n  locateQuote?: QuoteLocator;\n}): Promise<EpisodeWindow[]> {\n  const facts = [...options.recalledFacts];\n  const locator = options.locateQuote;\n  if (locator && facts.length > 0) {\n    for (const fact of factsNeedingQuoteFallback(options.recalledFacts)) {\n      for (const source of fact.sources ?? []) {\n        if (typeof source?.quote !== \"string\" || source.quote.length === 0) continue;\n        if (typeof source.sessionKey !== \"string\" || source.sessionKey.length === 0) continue;\n        let turn: number | null = null;\n        try {\n          turn = await locator(source.quote, source.sessionKey);\n        } catch {\n          turn = null;\n        }\n        if (turn === null || !Number.isSafeInteger(turn) || turn < 0) continue;\n        facts.push({\n          memoryId: fact.memoryId,\n          rank: fact.rank,\n          sources: [\n            {\n              sessionKey: source.sessionKey,\n              turnId: String(turn),\n              observedAt: source.observedAt,\n              quote: source.quote,\n            },\n          ],\n        });\n        break; // one located quote per fact is enough to window it\n      }\n    }\n  }\n  return planEpisodeWindows({\n    recalledFacts: facts,\n    maxEpisodes: options.maxEpisodes,\n    maxTurnsPerEpisode: options.maxTurnsPerEpisode,\n  });\n}\n"],"mappings":";AA4CA,IAAM,uBAAuB,OAAO,aAAa,CAAC;AAU3C,SAAS,2BAA2B,QAAgC;AACzE,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,EAAG,QAAO;AAC9D,QAAM,YAAY,OAAO,SAAS,oBAAoB,IAClD,OAAO,MAAM,oBAAoB,EAAE,IAAI,IACvC;AACJ,MAAI,CAAC,QAAQ,KAAK,SAAS,EAAG,QAAO;AACrC,QAAM,SAAS,OAAO,SAAS,WAAW,EAAE;AAC5C,SAAO,OAAO,cAAc,MAAM,KAAK,UAAU,IAAI,SAAS;AAChE;AAWA,SAAS,cACP,YACA,MACA,MACA,UACa;AACb,QAAM,WAAW,KAAK,IAAI,GAAG,OAAO,CAAC;AACrC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,QAAQ,OAAO;AAAA,IACf,UAAU;AAAA,IACV,UAAU;AAAA,IACV,WAAW,oBAAI,IAAI,CAAC,QAAQ,CAAC;AAAA,EAC/B;AACF;AAEA,SAAS,YAAY,QAAuB,oBAA6C;AACvF,QAAM,YAAY,oBAAI,IAA2B;AACjD,aAAW,SAAS,QAAQ;AAC1B,UAAM,OAAO,UAAU,IAAI,MAAM,UAAU;AAC3C,QAAI,KAAM,MAAK,KAAK,KAAK;AAAA,QACpB,WAAU,IAAI,MAAM,YAAY,CAAC,KAAK,CAAC;AAAA,EAC9C;AAEA,QAAM,UAA2B,CAAC;AAClC,aAAW,CAAC,EAAE,aAAa,KAAK,WAAW;AAEzC,kBAAc;AAAA,MACZ,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,SAAS,EAAE;AAAA,IACpD;AACA,QAAI,UAA8B;AAClC,UAAM,QAAQ,MAAM;AAClB,UAAI,CAAC,QAAS;AACd,cAAQ,KAAK,eAAe,SAAS,kBAAkB,CAAC;AACxD,gBAAU;AAAA,IACZ;AACA,eAAW,SAAS,eAAe;AACjC,UAAI,WAAW,MAAM,YAAY,QAAQ,QAAQ;AAG/C,gBAAQ,SAAS,KAAK,IAAI,QAAQ,QAAQ,MAAM,MAAM;AACtD,YAAI,MAAM,WAAW,QAAQ,UAAU;AACrC,kBAAQ,WAAW,MAAM;AACzB,kBAAQ,WAAW,MAAM;AAAA,QAC3B;AACA,mBAAW,MAAM,MAAM,UAAW,SAAQ,UAAU,IAAI,EAAE;AAAA,MAC5D,OAAO;AACL,cAAM;AACN,kBAAU,EAAE,GAAG,OAAO,WAAW,IAAI,IAAI,MAAM,SAAS,EAAE;AAAA,MAC5D;AAAA,IACF;AACA,UAAM;AAAA,EACR;AACA,SAAO;AACT;AAEA,SAAS,eAAe,OAAoB,oBAA2C;AACrF,MAAI,EAAE,UAAU,OAAO,IAAI;AAC3B,QAAM,OAAO,SAAS;AACtB,MAAI,qBAAqB,KAAK,OAAO,oBAAoB;AAGvD,eAAW,KAAK;AAAA,MACd,KAAK,IAAI,MAAM,WAAW,GAAG,MAAM,QAAQ;AAAA,MAC3C,MAAM,SAAS;AAAA,IACjB;AAGA,QAAI,WAAW,sBAAsB,MAAM,UAAU;AACnD,iBAAW,KAAK,IAAI,MAAM,UAAU,MAAM,SAAS,kBAAkB;AAAA,IACvE;AACA,aAAS,WAAW;AAAA,EACtB;AACA,SAAO;AAAA,IACL,YAAY,MAAM;AAAA,IAClB;AAAA,IACA;AAAA,IACA,UAAU,MAAM;AAAA,IAChB,WAAW,CAAC,GAAG,MAAM,SAAS,EAAE,KAAK;AAAA,EACvC;AACF;AAGO,SAAS,sBACd,MACA,OACQ;AACR,QAAM,UAAU,KAAK,UAAU,KAAK,IAAO;AAC3C,QAAM,WAAW,MAAM,UAAU,KAAK,IAAO;AAC7C,SACE,KAAK,WAAW,MAAM,aACrB,KAAK,aAAa,MAAM,aAAa,KAAK,KAAK,aAAa,MAAM,aAAa,IAAI,MACpF,KAAK,WAAW,MAAM,YACtB,KAAK,SAAS,MAAM,WACnB,UAAU,WAAW,KAAK,UAAU,WAAW,IAAI;AAExD;AAaO,SAAS,mBAAmB,SAIf;AAClB,MAAI,QAAQ,eAAe,KAAK,QAAQ,sBAAsB,EAAG,QAAO,CAAC;AACzE,QAAM,SAAwB,CAAC;AAC/B,aAAW,QAAQ,QAAQ,eAAe;AACxC,QAAI,CAAC,QAAQ,CAAC,MAAM,QAAQ,KAAK,OAAO,EAAG;AAC3C,eAAW,UAAU,KAAK,SAAS;AACjC,UAAI,CAAC,UAAU,OAAO,OAAO,eAAe,YAAY,OAAO,WAAW,WAAW,GAAG;AACtF;AAAA,MACF;AACA,YAAM,OAAO,2BAA2B,OAAO,MAAM;AACrD,UAAI,SAAS,KAAM;AACnB,aAAO;AAAA,QACL,cAAc,OAAO,YAAY,MAAM,KAAK,MAAM,KAAK,QAAQ;AAAA,MACjE;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,QAAM,UAAU,YAAY,QAAQ,QAAQ,kBAAkB;AAC9D,SAAO,QAAQ,KAAK,qBAAqB,EAAE,MAAM,GAAG,QAAQ,WAAW;AACzE;AAMO,SAAS,0BACd,eACqB;AACrB,SAAO,cAAc;AAAA,IACnB,CAAC,SACC,QACA,MAAM,QAAQ,KAAK,OAAO,KAC1B,KAAK,QAAQ,SAAS,KACtB,KAAK,QAAQ,KAAK,CAAC,WAAW,OAAO,QAAQ,UAAU,YAAY,OAAO,MAAM,SAAS,CAAC,KAC1F,CAAC,KAAK,QAAQ,KAAK,CAAC,WAAW,2BAA2B,QAAQ,MAAM,MAAM,IAAI;AAAA,EACtF;AACF;AASA,eAAsB,+BAA+B,SAKxB;AAC3B,QAAM,QAAQ,CAAC,GAAG,QAAQ,aAAa;AACvC,QAAM,UAAU,QAAQ;AACxB,MAAI,WAAW,MAAM,SAAS,GAAG;AAC/B,eAAW,QAAQ,0BAA0B,QAAQ,aAAa,GAAG;AACnE,iBAAW,UAAU,KAAK,WAAW,CAAC,GAAG;AACvC,YAAI,OAAO,QAAQ,UAAU,YAAY,OAAO,MAAM,WAAW,EAAG;AACpE,YAAI,OAAO,OAAO,eAAe,YAAY,OAAO,WAAW,WAAW,EAAG;AAC7E,YAAI,OAAsB;AAC1B,YAAI;AACF,iBAAO,MAAM,QAAQ,OAAO,OAAO,OAAO,UAAU;AAAA,QACtD,QAAQ;AACN,iBAAO;AAAA,QACT;AACA,YAAI,SAAS,QAAQ,CAAC,OAAO,cAAc,IAAI,KAAK,OAAO,EAAG;AAC9D,cAAM,KAAK;AAAA,UACT,UAAU,KAAK;AAAA,UACf,MAAM,KAAK;AAAA,UACX,SAAS;AAAA,YACP;AAAA,cACE,YAAY,OAAO;AAAA,cACnB,QAAQ,OAAO,IAAI;AAAA,cACnB,YAAY,OAAO;AAAA,cACnB,OAAO,OAAO;AAAA,YAChB;AAAA,UACF;AAAA,QACF,CAAC;AACD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,mBAAmB;AAAA,IACxB,eAAe;AAAA,IACf,aAAa,QAAQ;AAAA,IACrB,oBAAoB,QAAQ;AAAA,EAC9B,CAAC;AACH;","names":[]}

package/dist/{chunk-DYDACAK2.js → chunk-TGSMU3F2.js}

@@ -5,14 +5,14 @@ import {
 } from "./chunk-5JMAGU26.js";
 import {
   runPostConsolidationMaterialize
-} from "./chunk-PBH2Z2NY.js";
+} from "./chunk-DTLF2SLZ.js";
 import {
   isSemanticConsolidationLlmOperator
 } from "./chunk-G7D6GZ5J.js";
 import {
   countRecallTokenOverlap,
   normalizeRecallTokens
-} from "./chunk-ZBJMUXZH.js";
+} from "./chunk-DJ7HMNSL.js";
 import {
   resolvePipelineProcessingCapabilities
 } from "./chunk-JUOZ62Y7.js";
@@ -220,4 +220,4 @@ export {
   buildExtensionsBlockForConsolidation,
   materializeAfterSemanticConsolidation
 };
-//# sourceMappingURL=chunk-DYDACAK2.js.map
+//# sourceMappingURL=chunk-TGSMU3F2.js.map

package/dist/{chunk-MJFDJTDC.js → chunk-TIRJV2LW.js}

@@ -3,7 +3,7 @@ import {
 } from "./chunk-KJTKLXTH.js";
 import {
   StorageManager
-} from "./chunk-ZJKLGS76.js";
+} from "./chunk-CALURYWR.js";
 import {
   copyExistingFileToBackup,
   writeFileAtomically
@@ -260,4 +260,4 @@ export {
   backupExistingLedger,
   rebuildMemoryLifecycleLedger
 };
-//# sourceMappingURL=chunk-MJFDJTDC.js.map
+//# sourceMappingURL=chunk-TIRJV2LW.js.map

package/dist/{chunk-QRA3XVJX.js → chunk-UDTME32W.js}

@@ -19,7 +19,7 @@ import {
 } from "./chunk-7ZNJN5WZ.js";
 import {
   compareEntityTimestamps
-} from "./chunk-ZJKLGS76.js";
+} from "./chunk-CALURYWR.js";
 import {
   normalizeEntityName
 } from "./chunk-YXZG5TVN.js";
@@ -929,4 +929,4 @@ export {
   entityIndexVersion,
   entityRecentTranscriptLookbackHours
 };
-//# sourceMappingURL=chunk-QRA3XVJX.js.map
+//# sourceMappingURL=chunk-UDTME32W.js.map

package/dist/{chunk-LAM6UDFV.js → chunk-WMOJIOIG.js}

@@ -1,6 +1,6 @@
 import {
   resolveCorpusNamespaceRoots
-} from "./chunk-7JAXC526.js";
+} from "./chunk-EFWHCTYJ.js";
 import {
   capabilityAllowsNamespace
 } from "./chunk-MZWSOLMT.js";
@@ -200,4 +200,4 @@ async function readAggregateExtractionWatermark(options) {
 export {
   readAggregateExtractionWatermark
 };
-//# sourceMappingURL=chunk-LAM6UDFV.js.map
+//# sourceMappingURL=chunk-WMOJIOIG.js.map

package/dist/{chunk-LLLY5IBK.js → chunk-WR2YKUIW.js}

@@ -1,7 +1,7 @@
 import {
   SUPPORT_PASSPORT_DRAFT_MAX_CONTENT_CHARACTERS,
   SUPPORT_PASSPORT_DRAFT_MAX_MEMORIES
-} from "./chunk-HKYNBEL4.js";
+} from "./chunk-4FFROSFG.js";
 import {
   SUPPORT_PASSPORT_SOURCE_MEMORY_ID_MAX_LENGTH
 } from "./chunk-XDL5CYZN.js";
@@ -343,4 +343,4 @@ export {
   parseSupportPassportModelJob,
   SupportPassportModelBridge
 };
-//# sourceMappingURL=chunk-LLLY5IBK.js.map
+//# sourceMappingURL=chunk-WR2YKUIW.js.map

package/dist/{chunk-KYI3CM42.js → chunk-X6E7TT3A.js}

@@ -1,7 +1,7 @@
 import {
   SupportPassportCreateGrantRequestSchema,
   defineOperation
-} from "./chunk-HKYNBEL4.js";
+} from "./chunk-4FFROSFG.js";
 import {
   SupportPassportCardCategorySchema,
   SupportPassportMemoryIdSchema,
@@ -220,4 +220,4 @@ var supportPassportGrantAskOperation = defineOperation({
     result: await ctx.service.supportPassportAskGrant(grantId, secret, question, ctx.abortSignal)
   })
 });
-//# sourceMappingURL=chunk-KYI3CM42.js.map
+//# sourceMappingURL=chunk-X6E7TT3A.js.map

package/dist/{chunk-QN7XQEIT.js → chunk-YIIC5IDU.js}

@@ -16,7 +16,7 @@ import {
 import {
   countRecallTokenOverlap,
   normalizeRecallTokens
-} from "./chunk-ZBJMUXZH.js";
+} from "./chunk-DJ7HMNSL.js";
 import {
   inferMemoryStatus,
   toMemoryPathRel
@@ -296,4 +296,4 @@ async function searchHarmonicRetrieval(options) {
 export {
   searchHarmonicRetrieval
 };
-//# sourceMappingURL=chunk-QN7XQEIT.js.map
+//# sourceMappingURL=chunk-YIIC5IDU.js.map

package/dist/{chunk-JDJOAL4B.js → chunk-YSR3DXGC.js}

@@ -7,7 +7,7 @@ import {
 } from "./chunk-UYCIS6V5.js";
 import {
   StorageManager
-} from "./chunk-ZJKLGS76.js";
+} from "./chunk-CALURYWR.js";
 import {
   parseContinuityImprovementLoops
 } from "./chunk-LDXUBPMO.js";
@@ -1283,4 +1283,4 @@ export {
   defaultTierMigrationCycleBudget,
   CompoundingEngine
 };
-//# sourceMappingURL=chunk-JDJOAL4B.js.map
+//# sourceMappingURL=chunk-YSR3DXGC.js.map

package/dist/{chunk-LBJBNWS2.js → chunk-YTHQHH5U.js}

@@ -1,6 +1,6 @@
 import {
   normalizeRecallTokens
-} from "./chunk-ZBJMUXZH.js";
+} from "./chunk-DJ7HMNSL.js";
 
 // src/recall-query-policy.ts
 var DEFAULT_STOPWORDS = [
@@ -188,4 +188,4 @@ export {
   clampInstructionHeavyTokenCap,
   buildRecallQueryPolicy
 };
-//# sourceMappingURL=chunk-LBJBNWS2.js.map
+//# sourceMappingURL=chunk-YTHQHH5U.js.map

package/dist/{chunk-JF6YSHJM.js → chunk-ZPGHA7EO.js}

@@ -1,21 +1,21 @@
 import {
   WearablesInputError
 } from "./chunk-V7IZKJI3.js";
-import {
-  WriteRateLimiter
-} from "./chunk-TB6CBZ5V.js";
 import {
   AdapterRegistry
 } from "./chunk-JBPKEARU.js";
+import {
+  WriteRateLimiter
+} from "./chunk-TB6CBZ5V.js";
 import {
   serializeInlineScriptValue
 } from "./chunk-3HSRWJTC.js";
 import {
   handleSupportPassportOwnerHttp
-} from "./chunk-EU74U4GT.js";
+} from "./chunk-JDI7G6EA.js";
 import {
   buildSupportPassportPublicRequestHandler
-} from "./chunk-3G6YU5YD.js";
+} from "./chunk-PSNN25DW.js";
 import {
   nonEmptyQueryParam,
   optionalQueryString,
@@ -30,10 +30,10 @@ import {
   processChatMessage,
   sessionBelongsToPrincipal,
   subscribeChatTranscript
-} from "./chunk-ETCVSZLG.js";
+} from "./chunk-HSBQJRV2.js";
 import {
   RelayMissionStoreError
-} from "./chunk-YSUSUZR4.js";
+} from "./chunk-JCJGYNIS.js";
 import {
   validateRequest
 } from "./chunk-JKW663ZN.js";
@@ -60,21 +60,21 @@ import {
   authorizationProbeNamespaces,
   authorizationProbeRequiresPrincipalNamespace,
   probeOperationAuthorization
-} from "./chunk-75U2FR7U.js";
+} from "./chunk-QCI73Z7C.js";
 import {
   CorrectionContractError,
   getOperation,
   resolveQueryNamespaceWritablePreflight
-} from "./chunk-HKYNBEL4.js";
+} from "./chunk-4FFROSFG.js";
 import {
   isTrustZoneName
-} from "./chunk-KQS72GCR.js";
+} from "./chunk-LJOIZPJH.js";
 import {
   subscribeGraphEvents
 } from "./chunk-DEUNUKTD.js";
 import {
   isRecallDisclosure
-} from "./chunk-5WVUO6QT.js";
+} from "./chunk-AR253JBM.js";
 import {
   OFFLINE_SYNC_APPLY_MAX_BODY_BYTES,
   OFFLINE_SYNC_FILE_CONTENT_MAX_CHUNK_BYTES,
@@ -3397,4 +3397,4 @@ export {
   resolveDefaultAdminConsolePublicDir,
   EngramAccessHttpServer
 };
-//# sourceMappingURL=chunk-JF6YSHJM.js.map
+//# sourceMappingURL=chunk-ZPGHA7EO.js.map

package/dist/{chunk-VUDALPI5.js → chunk-ZQKXRKMR.js}

@@ -12,7 +12,8 @@ import {
   ContentHashIndex
 } from "./chunk-NRFU5MVH.js";
 import {
-  computeLegacyContentHash
+  computeLegacyContentHash,
+  normalizeLegacyContent
 } from "./chunk-5FVVY2EB.js";
 import {
   storedContentIdentityCandidates
@@ -26,6 +27,7 @@ import { createHash } from "crypto";
 var RECONCILE_MANIFEST_FORMAT = "remnic-reconcile-manifest";
 var RECONCILE_MANIFEST_SCHEMA_VERSION = 1;
 var CONTENT_HASH_NORMALIZER_VERSION = 4;
+var IDENTITY_RESOLUTION_VERSION = 2;
 var SHA256_PATTERN = /^[a-f0-9]{64}$/i;
 var MEMORY_DIRS = new Set(RECALL_FALLBACK_DIRS);
 function isMemoryPath(filePath) {
@@ -51,12 +53,24 @@ function parsedMemoryIdentity(filePath, raw, parseMemory, citationTemplate) {
   const legacyMatch = [...candidates].reverse().find(
     (content) => computeLegacyContentHash(content) === storedHash
   );
-  const contentHash = currentMatch ? ContentHashIndex.computeHash(currentMatch) : legacyMatch ? ContentHashIndex.computeHash(legacyMatch) : storedHash ?? bodyHash;
+  let contentHash;
+  let contentHashAliases;
+  if (currentMatch) {
+    contentHash = ContentHashIndex.computeHash(currentMatch);
+  } else if (legacyMatch && normalizeLegacyContent(legacyMatch).length > 0) {
+    contentHash = storedHash ?? bodyHash;
+    const recovered = ContentHashIndex.computeHash(legacyMatch);
+    if (recovered !== contentHash) contentHashAliases = [recovered];
+  } else {
+    contentHash = legacyMatch ? ContentHashIndex.computeHash(legacyMatch) : storedHash ?? bodyHash;
+  }
   return {
     id: parsed.frontmatter.id,
     category: parsed.frontmatter.category,
     contentHash,
+    ...contentHashAliases ? { contentHashAliases } : {},
     normalizerVersion: CONTENT_HASH_NORMALIZER_VERSION,
+    identityResolutionVersion: IDENTITY_RESOLUTION_VERSION,
     status: inferMemoryStatus(parsed.frontmatter, filePath)
   };
 }
@@ -83,7 +97,7 @@ async function buildReconcileManifest(options) {
   const files = [];
   for (const file of options.files) {
     const cached = cachedByPath.get(file.path);
-    if (cached?.sha256.toLowerCase() === file.sha256.toLowerCase() && (cached.memory === void 0 || cached.memory.normalizerVersion === CONTENT_HASH_NORMALIZER_VERSION)) {
+    if (cached?.sha256.toLowerCase() === file.sha256.toLowerCase() && (cached.memory === void 0 || cached.memory.normalizerVersion === CONTENT_HASH_NORMALIZER_VERSION && cached.memory.identityResolutionVersion === IDENTITY_RESOLUTION_VERSION)) {
       files.push({ ...file, ...cached.memory ? { memory: cached.memory } : {} });
       continue;
     }
@@ -111,7 +125,7 @@ function activeFactByPath(manifest) {
   return result;
 }
 function memoryIdentityHashes(memory) {
-  return [memory.contentHash];
+  return [memory.contentHash, ...memory.contentHashAliases ?? []];
 }
 function contentHashRows(files, contentHash) {
   const rows = [];
@@ -284,4 +298,4 @@ export {
   buildReconcileManifest,
   collapseActiveFactDuplicates
 };
-//# sourceMappingURL=chunk-VUDALPI5.js.map
+//# sourceMappingURL=chunk-ZQKXRKMR.js.map

package/dist/chunk-ZQKXRKMR.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/reconcile/manifest.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport { computeLegacyContentHash, normalizeLegacyContent } from \"../content-hash.js\";\nimport { inferMemoryStatus } from \"../memory-lifecycle-ledger-utils.js\";\nimport { ContentHashIndex, type ContentHashPathEntry } from \"../storage/content-hash-index.js\";\nimport { DEFAULT_CITATION_FORMAT, stripCitationForTemplate } from \"../source-attribution.js\";\nimport { storedContentIdentityCandidates } from \"../structured-attributes.js\";\nimport type { MemoryFrontmatter, MemoryStatus } from \"../types.js\";\nimport { RECALL_FALLBACK_DIRS } from \"../utils/category-dir.js\";\nimport {\n  type ReconcileFileState,\n  type ReconcilePlan,\n  type ReconcilePlanEntry,\n  type ReconcileSemanticAgreement,\n  type ReconcileSemanticChange,\n  summarizeReconcilePlan,\n} from \"./plan.js\";\n\nexport const RECONCILE_MANIFEST_FORMAT = \"remnic-reconcile-manifest\";\nexport const RECONCILE_MANIFEST_SCHEMA_VERSION = 1;\nconst CONTENT_HASH_NORMALIZER_VERSION = 4;\n/**\n * Version of the identity-resolution LOGIC (alias recovery, candidate\n * ordering), independent of the content normalizer: a cached manifest entry\n * written before an identity-resolution change carries an older value and is\n * reparsed even when its normalizerVersion still matches (issue #2367\n * review round 2). Bump when parsedMemoryIdentity's output shape or\n * semantics change.\n */\nconst IDENTITY_RESOLUTION_VERSION = 2;\n\nexport interface ReconcileMemoryIdentity {\n  id: string;\n  category: string;\n  contentHash: string;\n  /**\n   * Recovered current-normalizer identities for a record whose persisted hash\n   * is ambiguous under the legacy normalizer (issue #2367). The persisted\n   * hash stays primary; these participate in duplicate bucketing so a\n   * replica carrying the current form of the same fact still collapses.\n   */\n  contentHashAliases?: readonly string[];\n  /** See IDENTITY_RESOLUTION_VERSION; absent on pre-versioning cache entries. */\n  normalizerVersion?: number;\n  identityResolutionVersion?: number;\n  status: MemoryStatus;\n}\n\nexport interface ReconcileManifestFile extends ReconcileFileState {\n  memory?: ReconcileMemoryIdentity;\n}\n\ntype ActiveFactManifestFile = ReconcileManifestFile & { memory: ReconcileMemoryIdentity };\n\nexport interface ReconcileManifest {\n  format: typeof RECONCILE_MANIFEST_FORMAT;\n  schemaVersion: typeof RECONCILE_MANIFEST_SCHEMA_VERSION;\n  files: ReconcileManifestFile[];\n}\n\nexport type ReconcileMemoryParser = (\n  raw: string,\n) => { frontmatter: MemoryFrontmatter; content: string } | null;\n\nexport interface BuildReconcileManifestOptions {\n  files: Iterable<ReconcileFileState>;\n  readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>;\n  parseMemory: ReconcileMemoryParser;\n  cachedFiles?: Iterable<ReconcileManifestFile>;\n  citationTemplate?: string;\n}\n\nconst SHA256_PATTERN = /^[a-f0-9]{64}$/i;\nconst MEMORY_DIRS = new Set(RECALL_FALLBACK_DIRS);\n\nfunction isMemoryPath(filePath: string): boolean {\n  if (!filePath.endsWith(\".md\")) return false;\n  const segments = filePath.split(\"/\");\n  let index = 0;\n  if (segments[index] === \"cold\" || segments[index] === \"archive\") index += 1;\n  return MEMORY_DIRS.has(segments[index] ?? \"\");\n}\n\n\nfunction parsedMemoryIdentity(\n  filePath: string,\n  raw: Buffer | string,\n  parseMemory: ReconcileMemoryParser,\n  citationTemplate: string,\n): ReconcileMemoryIdentity | undefined {\n  if (!isMemoryPath(filePath)) return undefined;\n  const parsed = parseMemory(Buffer.isBuffer(raw) ? raw.toString(\"utf8\") : raw);\n  if (!parsed?.frontmatter.id) return undefined;\n\n  const storedHash =\n    parsed.frontmatter.contentHash &&\n    SHA256_PATTERN.test(parsed.frontmatter.contentHash)\n      ? parsed.frontmatter.contentHash.toLowerCase()\n      : undefined;\n  const candidates = storedContentIdentityCandidates(parsed.content, (content) =>\n    stripCitationForTemplate(content, citationTemplate)\n  );\n  const bodyHash = ContentHashIndex.computeHash(candidates[0] ?? \"\");\n  const currentMatch = candidates.find(\n    (content) => ContentHashIndex.computeHash(content) === storedHash\n  );\n  const legacyMatch = [...candidates].reverse().find(\n    (content) => computeLegacyContentHash(content) === storedHash\n  );\n  let contentHash: string;\n  let contentHashAliases: string[] | undefined;\n  if (currentMatch) {\n    contentHash = ContentHashIndex.computeHash(currentMatch);\n  } else if (legacyMatch && normalizeLegacyContent(legacyMatch).length > 0) {\n    // A non-empty legacy equality is ambiguous (issue #2367): the persisted\n    // hash may be an explicit contentHashSource identity that merely collides\n    // with the body's ASCII skeleton under the lossy legacy normalizer, and\n    // nothing in the record proves which it is. Keep the persisted hash as\n    // the primary identity and expose the recovered current identity as an\n    // alias so replicas carrying either form still collapse.\n    contentHash = storedHash ?? bodyHash;\n    const recovered = ContentHashIndex.computeHash(legacyMatch);\n    if (recovered !== contentHash) contentHashAliases = [recovered];\n  } else {\n    // An EMPTY legacy skeleton identifies nothing (every non-ASCII body maps\n    // to it), so preserving it would collapse unrelated records. Recovering\n    // the current identity here is repair, not replacement.\n    contentHash = legacyMatch ? ContentHashIndex.computeHash(legacyMatch) : storedHash ?? bodyHash;\n  }\n\n  return {\n    id: parsed.frontmatter.id,\n    category: parsed.frontmatter.category,\n    contentHash,\n    ...(contentHashAliases ? { contentHashAliases } : {}),\n    normalizerVersion: CONTENT_HASH_NORMALIZER_VERSION,\n    identityResolutionVersion: IDENTITY_RESOLUTION_VERSION,\n    status: inferMemoryStatus(parsed.frontmatter, filePath),\n  };\n}\n\nexport async function buildReconcileManifestFile(\n  file: ReconcileFileState,\n  readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>,\n  parseMemory: ReconcileMemoryParser,\n  citationTemplate = DEFAULT_CITATION_FORMAT,\n): Promise<ReconcileManifestFile> {\n  let raw: Buffer | string | null = null;\n  if (isMemoryPath(file.path)) {\n    try {\n      raw = await readFile(file);\n    } catch {\n      raw = null;\n    }\n  }\n  if (raw !== null && createHash(\"sha256\").update(raw).digest(\"hex\") !== file.sha256.toLowerCase()) {\n    raw = null;\n  }\n  const memory = raw === null ? undefined : parsedMemoryIdentity(file.path, raw, parseMemory, citationTemplate);\n  return { ...file, ...(memory ? { memory } : {}) };\n}\n\nexport async function buildReconcileManifest(options: BuildReconcileManifestOptions): Promise<ReconcileManifest> {\n  const cachedByPath = new Map<string, ReconcileManifestFile>();\n  for (const cached of options.cachedFiles ?? []) {\n    cachedByPath.set(cached.path, cached);\n  }\n\n  const files: ReconcileManifestFile[] = [];\n  for (const file of options.files) {\n    const cached = cachedByPath.get(file.path);\n    if (\n      cached?.sha256.toLowerCase() === file.sha256.toLowerCase() &&\n      (cached.memory === undefined ||\n        (cached.memory.normalizerVersion === CONTENT_HASH_NORMALIZER_VERSION &&\n          cached.memory.identityResolutionVersion === IDENTITY_RESOLUTION_VERSION))\n    ) {\n      files.push({ ...file, ...(cached.memory ? { memory: cached.memory } : {}) });\n      continue;\n    }\n\n    files.push(await buildReconcileManifestFile(\n      file,\n      options.readFile,\n      options.parseMemory,\n      options.citationTemplate,\n    ));\n  }\n  files.sort((left, right) => (left.path < right.path ? -1 : left.path > right.path ? 1 : 0));\n  return {\n    format: RECONCILE_MANIFEST_FORMAT,\n    schemaVersion: RECONCILE_MANIFEST_SCHEMA_VERSION,\n    files,\n  };\n}\n\nfunction activeFactByPath(manifest: ReconcileManifest | undefined): Map<string, ActiveFactManifestFile> {\n  const result = new Map<string, ActiveFactManifestFile>();\n  for (const file of manifest?.files ?? []) {\n    if (file.memory?.category === \"fact\" && file.memory.status === \"active\") {\n      result.set(file.path, file as ActiveFactManifestFile);\n    }\n  }\n  return result;\n}\n\nfunction memoryIdentityHashes(memory: ReconcileMemoryIdentity): string[] {\n  return [memory.contentHash, ...(memory.contentHashAliases ?? [])];\n}\n\nfunction contentHashRows(\n  files: Iterable<ActiveFactManifestFile>,\n  contentHash: string,\n): ContentHashPathEntry[] {\n  const rows: ContentHashPathEntry[] = [];\n  for (const file of files) {\n    rows.push({ path: file.path, contentHash });\n  }\n  return rows;\n}\n\nfunction comparePlanEntries(left: ReconcilePlanEntry, right: ReconcilePlanEntry): number {\n  if (left.namespace !== right.namespace) return left.namespace < right.namespace ? -1 : 1;\n  return left.path < right.path ? -1 : left.path > right.path ? 1 : 0;\n}\n\nfunction semanticAgreementKey(agreement: ReconcileSemanticAgreement): string {\n  return `${agreement.local.path}\\0${agreement.peer.path}`;\n}\n\nfunction classifySemanticChange(\n  current: ReconcileSemanticAgreement,\n  prior: ReconcileSemanticAgreement | undefined\n): ReconcileSemanticChange {\n  if (!prior) return \"unchanged\";\n  const localChanged = current.local.sha256 !== prior.local.sha256;\n  const peerChanged = current.peer.sha256 !== prior.peer.sha256;\n  if (localChanged && peerChanged) return \"both_modified\";\n  if (localChanged) return \"local_changed\";\n  if (peerChanged) return \"peer_changed\";\n  return \"unchanged\";\n}\n\nexport function collapseActiveFactDuplicates(\n  plan: ReconcilePlan,\n  localManifests: ReadonlyMap<string, ReconcileManifest>,\n  peerManifests: ReadonlyMap<string, ReconcileManifest>,\n  priorSemanticAgreements?: ReadonlyMap<string, readonly ReconcileSemanticAgreement[]>,\n): ReconcilePlan {\n  const entriesByNamespace = new Map<string, ReconcilePlanEntry[]>();\n  for (const entry of plan.entries) {\n    const entries = entriesByNamespace.get(entry.namespace) ?? [];\n    entries.push({ ...entry });\n    entriesByNamespace.set(entry.namespace, entries);\n  }\n\n  let changed = false;\n  for (const namespace of new Set([...localManifests.keys(), ...peerManifests.keys()])) {\n    const entries = entriesByNamespace.get(namespace) ?? [];\n    const localManifest = localManifests.get(namespace);\n    const peerManifest = peerManifests.get(namespace);\n    const localByPath = activeFactByPath(localManifest);\n    const peerByPath = activeFactByPath(peerManifest);\n    const localFilesByPath = new Map((localManifest?.files ?? []).map((file) => [file.path, file]));\n    const peerFilesByPath = new Map((peerManifest?.files ?? []).map((file) => [file.path, file]));\n    const priorSemanticByPathPair = new Map(\n      (priorSemanticAgreements?.get(namespace) ?? []).map((agreement) => [\n        semanticAgreementKey(agreement),\n        agreement,\n      ])\n    );\n    const localByHash = new Map<string, ActiveFactManifestFile[]>();\n    const peerByHash = new Map<string, ActiveFactManifestFile[]>();\n\n    for (const file of localByPath.values()) {\n      for (const hash of memoryIdentityHashes(file.memory)) {\n        const bucket = localByHash.get(hash) ?? [];\n        bucket.push(file);\n        localByHash.set(hash, bucket);\n      }\n    }\n    for (const file of peerByPath.values()) {\n      for (const hash of memoryIdentityHashes(file.memory)) {\n        const bucket = peerByHash.get(hash) ?? [];\n        bucket.push(file);\n        peerByHash.set(hash, bucket);\n      }\n    }\n\n    const removed = new Set<ReconcilePlanEntry>();\n    const replacements: ReconcilePlanEntry[] = [];\n    const processedPathPairs = new Set<string>();\n    for (const hash of new Set([...localByHash.keys(), ...peerByHash.keys()])) {\n      const localCandidates = (localByHash.get(hash) ?? []).filter((file) => {\n        const opposite = peerFilesByPath.get(file.path);\n        const activeOpposite = peerByPath.get(file.path);\n        return opposite === undefined || (\n          activeOpposite !== undefined &&\n          memoryIdentityHashes(activeOpposite.memory).includes(hash)\n        );\n      });\n      const peerCandidates = (peerByHash.get(hash) ?? []).filter((file) => {\n        const opposite = localFilesByPath.get(file.path);\n        const activeOpposite = localByPath.get(file.path);\n        return opposite === undefined || (\n          activeOpposite !== undefined &&\n          memoryIdentityHashes(activeOpposite.memory).includes(hash)\n        );\n      });\n      const localPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(localCandidates, hash));\n      const peerPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(peerCandidates, hash));\n\n      if (localPath && peerPath && localPath !== peerPath) {\n        const pathPair = `${localPath}\\0${peerPath}`;\n        if (processedPathPairs.has(pathPair)) continue;\n        processedPathPairs.add(pathPair);\n        const localFile = localByPath.get(localPath);\n        const peerFile = peerByPath.get(peerPath);\n        if (!localFile || !peerFile) continue;\n        const duplicatePaths = new Set([\n          ...localCandidates.map((file) => file.path),\n          ...peerCandidates.map((file) => file.path),\n        ]);\n        const authoritativeSamePathEntries = new Set(entries.filter(\n          (entry) =>\n            duplicatePaths.has(entry.path)\n            && localFilesByPath.has(entry.path)\n            && peerFilesByPath.has(entry.path)\n            && entry.action !== \"identical\"\n        ));\n        if (authoritativeSamePathEntries.size > 0) {\n          for (const entry of entries) {\n            if (\n              duplicatePaths.has(entry.path)\n              && !authoritativeSamePathEntries.has(entry)\n              && (entry.action === \"pull\" || entry.action === \"push\" || entry.action === \"identical\")\n            ) {\n              removed.add(entry);\n              changed = true;\n            }\n          }\n          continue;\n        }\n        const unsafeEntry = entries.some(\n          (entry) => duplicatePaths.has(entry.path) && (entry.action === \"suppress\" || entry.action === \"conflict\")\n        );\n        if (unsafeEntry) continue;\n        for (const entry of entries) {\n          if (\n            duplicatePaths.has(entry.path) &&\n            (entry.action === \"pull\" || entry.action === \"push\" || entry.action === \"identical\")\n          ) {\n            removed.add(entry);\n          }\n        }\n        const semanticAgreement: ReconcileSemanticAgreement = {\n          local: { path: localPath, sha256: localFile.sha256 },\n          peer: { path: peerPath, sha256: peerFile.sha256 },\n        };\n        replacements.push({\n          path: localPath < peerPath ? localPath : peerPath,\n          namespace,\n          action: \"identical\",\n          reason: \"semantic_duplicate\",\n          semanticAgreement,\n          semanticChange: classifySemanticChange(\n            semanticAgreement,\n            priorSemanticByPathPair.get(semanticAgreementKey(semanticAgreement))\n          ),\n        });\n        changed = true;\n        continue;\n      }\n\n      const sameSideEntries = entries.filter((entry) => {\n        if (localPath && entry.reason === \"local_only\") {\n          return localCandidates.some((file) => file.path === entry.path);\n        }\n        if (peerPath && entry.reason === \"peer_only\") {\n          return peerCandidates.some((file) => file.path === entry.path);\n        }\n        return false;\n      });\n      const canonicalPath = localPath ?? peerPath;\n      const hasSharedCanonical = localPath !== undefined && localPath === peerPath;\n      if (!canonicalPath || sameSideEntries.length === 0 || (!hasSharedCanonical && sameSideEntries.length < 2)) {\n        continue;\n      }\n      for (const entry of sameSideEntries) {\n        if (entry.path !== canonicalPath) {\n          removed.add(entry);\n          changed = true;\n        }\n      }\n    }\n\n    if (removed.size > 0 || replacements.length > 0) {\n      entriesByNamespace.set(\n        namespace,\n        [...entries.filter((entry) => !removed.has(entry)), ...replacements].sort(comparePlanEntries)\n      );\n    }\n  }\n\n  if (!changed) return plan;\n  const entries = [...entriesByNamespace.values()].flat().sort(comparePlanEntries);\n  return {\n    entries,\n    byNamespace: summarizeReconcilePlan(entries),\n    converged: entries.every((entry) => entry.action === \"identical\"),\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,kBAAkB;AAiBpB,IAAM,4BAA4B;AAClC,IAAM,oCAAoC;AACjD,IAAM,kCAAkC;AASxC,IAAM,8BAA8B;AA2CpC,IAAM,iBAAiB;AACvB,IAAM,cAAc,IAAI,IAAI,oBAAoB;AAEhD,SAAS,aAAa,UAA2B;AAC/C,MAAI,CAAC,SAAS,SAAS,KAAK,EAAG,QAAO;AACtC,QAAM,WAAW,SAAS,MAAM,GAAG;AACnC,MAAI,QAAQ;AACZ,MAAI,SAAS,KAAK,MAAM,UAAU,SAAS,KAAK,MAAM,UAAW,UAAS;AAC1E,SAAO,YAAY,IAAI,SAAS,KAAK,KAAK,EAAE;AAC9C;AAGA,SAAS,qBACP,UACA,KACA,aACA,kBACqC;AACrC,MAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AACpC,QAAM,SAAS,YAAY,OAAO,SAAS,GAAG,IAAI,IAAI,SAAS,MAAM,IAAI,GAAG;AAC5E,MAAI,CAAC,QAAQ,YAAY,GAAI,QAAO;AAEpC,QAAM,aACJ,OAAO,YAAY,eACnB,eAAe,KAAK,OAAO,YAAY,WAAW,IAC9C,OAAO,YAAY,YAAY,YAAY,IAC3C;AACN,QAAM,aAAa;AAAA,IAAgC,OAAO;AAAA,IAAS,CAAC,YAClE,yBAAyB,SAAS,gBAAgB;AAAA,EACpD;AACA,QAAM,WAAW,iBAAiB,YAAY,WAAW,CAAC,KAAK,EAAE;AACjE,QAAM,eAAe,WAAW;AAAA,IAC9B,CAAC,YAAY,iBAAiB,YAAY,OAAO,MAAM;AAAA,EACzD;AACA,QAAM,cAAc,CAAC,GAAG,UAAU,EAAE,QAAQ,EAAE;AAAA,IAC5C,CAAC,YAAY,yBAAyB,OAAO,MAAM;AAAA,EACrD;AACA,MAAI;AACJ,MAAI;AACJ,MAAI,cAAc;AAChB,kBAAc,iBAAiB,YAAY,YAAY;AAAA,EACzD,WAAW,eAAe,uBAAuB,WAAW,EAAE,SAAS,GAAG;AAOxE,kBAAc,cAAc;AAC5B,UAAM,YAAY,iBAAiB,YAAY,WAAW;AAC1D,QAAI,cAAc,YAAa,sBAAqB,CAAC,SAAS;AAAA,EAChE,OAAO;AAIL,kBAAc,cAAc,iBAAiB,YAAY,WAAW,IAAI,cAAc;AAAA,EACxF;AAEA,SAAO;AAAA,IACL,IAAI,OAAO,YAAY;AAAA,IACvB,UAAU,OAAO,YAAY;AAAA,IAC7B;AAAA,IACA,GAAI,qBAAqB,EAAE,mBAAmB,IAAI,CAAC;AAAA,IACnD,mBAAmB;AAAA,IACnB,2BAA2B;AAAA,IAC3B,QAAQ,kBAAkB,OAAO,aAAa,QAAQ;AAAA,EACxD;AACF;AAEA,eAAsB,2BACpB,MACA,UACA,aACA,mBAAmB,yBACa;AAChC,MAAI,MAA8B;AAClC,MAAI,aAAa,KAAK,IAAI,GAAG;AAC3B,QAAI;AACF,YAAM,MAAM,SAAS,IAAI;AAAA,IAC3B,QAAQ;AACN,YAAM;AAAA,IACR;AAAA,EACF;AACA,MAAI,QAAQ,QAAQ,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE,OAAO,KAAK,MAAM,KAAK,OAAO,YAAY,GAAG;AAChG,UAAM;AAAA,EACR;AACA,QAAM,SAAS,QAAQ,OAAO,SAAY,qBAAqB,KAAK,MAAM,KAAK,aAAa,gBAAgB;AAC5G,SAAO,EAAE,GAAG,MAAM,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG;AAClD;AAEA,eAAsB,uBAAuB,SAAoE;AAC/G,QAAM,eAAe,oBAAI,IAAmC;AAC5D,aAAW,UAAU,QAAQ,eAAe,CAAC,GAAG;AAC9C,iBAAa,IAAI,OAAO,MAAM,MAAM;AAAA,EACtC;AAEA,QAAM,QAAiC,CAAC;AACxC,aAAW,QAAQ,QAAQ,OAAO;AAChC,UAAM,SAAS,aAAa,IAAI,KAAK,IAAI;AACzC,QACE,QAAQ,OAAO,YAAY,MAAM,KAAK,OAAO,YAAY,MACxD,OAAO,WAAW,UAChB,OAAO,OAAO,sBAAsB,mCACnC,OAAO,OAAO,8BAA8B,8BAChD;AACA,YAAM,KAAK,EAAE,GAAG,MAAM,GAAI,OAAO,SAAS,EAAE,QAAQ,OAAO,OAAO,IAAI,CAAC,EAAG,CAAC;AAC3E;AAAA,IACF;AAEA,UAAM,KAAK,MAAM;AAAA,MACf;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IACV,CAAC;AAAA,EACH;AACA,QAAM,KAAK,CAAC,MAAM,UAAW,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI,CAAE;AAC1F,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,eAAe;AAAA,IACf;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,UAA8E;AACtG,QAAM,SAAS,oBAAI,IAAoC;AACvD,aAAW,QAAQ,UAAU,SAAS,CAAC,GAAG;AACxC,QAAI,KAAK,QAAQ,aAAa,UAAU,KAAK,OAAO,WAAW,UAAU;AACvE,aAAO,IAAI,KAAK,MAAM,IAA8B;AAAA,IACtD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,QAA2C;AACvE,SAAO,CAAC,OAAO,aAAa,GAAI,OAAO,sBAAsB,CAAC,CAAE;AAClE;AAEA,SAAS,gBACP,OACA,aACwB;AACxB,QAAM,OAA+B,CAAC;AACtC,aAAW,QAAQ,OAAO;AACxB,SAAK,KAAK,EAAE,MAAM,KAAK,MAAM,YAAY,CAAC;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAA0B,OAAmC;AACvF,MAAI,KAAK,cAAc,MAAM,UAAW,QAAO,KAAK,YAAY,MAAM,YAAY,KAAK;AACvF,SAAO,KAAK,OAAO,MAAM,OAAO,KAAK,KAAK,OAAO,MAAM,OAAO,IAAI;AACpE;AAEA,SAAS,qBAAqB,WAA+C;AAC3E,SAAO,GAAG,UAAU,MAAM,IAAI,KAAK,UAAU,KAAK,IAAI;AACxD;AAEA,SAAS,uBACP,SACA,OACyB;AACzB,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,eAAe,QAAQ,MAAM,WAAW,MAAM,MAAM;AAC1D,QAAM,cAAc,QAAQ,KAAK,WAAW,MAAM,KAAK;AACvD,MAAI,gBAAgB,YAAa,QAAO;AACxC,MAAI,aAAc,QAAO;AACzB,MAAI,YAAa,QAAO;AACxB,SAAO;AACT;AAEO,SAAS,6BACd,MACA,gBACA,eACA,yBACe;AACf,QAAM,qBAAqB,oBAAI,IAAkC;AACjE,aAAW,SAAS,KAAK,SAAS;AAChC,UAAMA,WAAU,mBAAmB,IAAI,MAAM,SAAS,KAAK,CAAC;AAC5D,IAAAA,SAAQ,KAAK,EAAE,GAAG,MAAM,CAAC;AACzB,uBAAmB,IAAI,MAAM,WAAWA,QAAO;AAAA,EACjD;AAEA,MAAI,UAAU;AACd,aAAW,aAAa,oBAAI,IAAI,CAAC,GAAG,eAAe,KAAK,GAAG,GAAG,cAAc,KAAK,CAAC,CAAC,GAAG;AACpF,UAAMA,WAAU,mBAAmB,IAAI,SAAS,KAAK,CAAC;AACtD,UAAM,gBAAgB,eAAe,IAAI,SAAS;AAClD,UAAM,eAAe,cAAc,IAAI,SAAS;AAChD,UAAM,cAAc,iBAAiB,aAAa;AAClD,UAAM,aAAa,iBAAiB,YAAY;AAChD,UAAM,mBAAmB,IAAI,KAAK,eAAe,SAAS,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;AAC9F,UAAM,kBAAkB,IAAI,KAAK,cAAc,SAAS,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC;AAC5F,UAAM,0BAA0B,IAAI;AAAA,OACjC,yBAAyB,IAAI,SAAS,KAAK,CAAC,GAAG,IAAI,CAAC,cAAc;AAAA,QACjE,qBAAqB,SAAS;AAAA,QAC9B;AAAA,MACF,CAAC;AAAA,IACH;AACA,UAAM,cAAc,oBAAI,IAAsC;AAC9D,UAAM,aAAa,oBAAI,IAAsC;AAE7D,eAAW,QAAQ,YAAY,OAAO,GAAG;AACvC,iBAAW,QAAQ,qBAAqB,KAAK,MAAM,GAAG;AACpD,cAAM,SAAS,YAAY,IAAI,IAAI,KAAK,CAAC;AACzC,eAAO,KAAK,IAAI;AAChB,oBAAY,IAAI,MAAM,MAAM;AAAA,MAC9B;AAAA,IACF;AACA,eAAW,QAAQ,WAAW,OAAO,GAAG;AACtC,iBAAW,QAAQ,qBAAqB,KAAK,MAAM,GAAG;AACpD,cAAM,SAAS,WAAW,IAAI,IAAI,KAAK,CAAC;AACxC,eAAO,KAAK,IAAI;AAChB,mBAAW,IAAI,MAAM,MAAM;AAAA,MAC7B;AAAA,IACF;AAEA,UAAM,UAAU,oBAAI,IAAwB;AAC5C,UAAM,eAAqC,CAAC;AAC5C,UAAM,qBAAqB,oBAAI,IAAY;AAC3C,eAAW,QAAQ,oBAAI,IAAI,CAAC,GAAG,YAAY,KAAK,GAAG,GAAG,WAAW,KAAK,CAAC,CAAC,GAAG;AACzE,YAAM,mBAAmB,YAAY,IAAI,IAAI,KAAK,CAAC,GAAG,OAAO,CAAC,SAAS;AACrE,cAAM,WAAW,gBAAgB,IAAI,KAAK,IAAI;AAC9C,cAAM,iBAAiB,WAAW,IAAI,KAAK,IAAI;AAC/C,eAAO,aAAa,UAClB,mBAAmB,UACnB,qBAAqB,eAAe,MAAM,EAAE,SAAS,IAAI;AAAA,MAE7D,CAAC;AACD,YAAM,kBAAkB,WAAW,IAAI,IAAI,KAAK,CAAC,GAAG,OAAO,CAAC,SAAS;AACnE,cAAM,WAAW,iBAAiB,IAAI,KAAK,IAAI;AAC/C,cAAM,iBAAiB,YAAY,IAAI,KAAK,IAAI;AAChD,eAAO,aAAa,UAClB,mBAAmB,UACnB,qBAAqB,eAAe,MAAM,EAAE,SAAS,IAAI;AAAA,MAE7D,CAAC;AACD,YAAM,YAAY,iBAAiB,kBAAkB,MAAM,gBAAgB,iBAAiB,IAAI,CAAC;AACjG,YAAM,WAAW,iBAAiB,kBAAkB,MAAM,gBAAgB,gBAAgB,IAAI,CAAC;AAE/F,UAAI,aAAa,YAAY,cAAc,UAAU;AACnD,cAAM,WAAW,GAAG,SAAS,KAAK,QAAQ;AAC1C,YAAI,mBAAmB,IAAI,QAAQ,EAAG;AACtC,2BAAmB,IAAI,QAAQ;AAC/B,cAAM,YAAY,YAAY,IAAI,SAAS;AAC3C,cAAM,WAAW,WAAW,IAAI,QAAQ;AACxC,YAAI,CAAC,aAAa,CAAC,SAAU;AAC7B,cAAM,iBAAiB,oBAAI,IAAI;AAAA,UAC7B,GAAG,gBAAgB,IAAI,CAAC,SAAS,KAAK,IAAI;AAAA,UAC1C,GAAG,eAAe,IAAI,CAAC,SAAS,KAAK,IAAI;AAAA,QAC3C,CAAC;AACD,cAAM,+BAA+B,IAAI,IAAIA,SAAQ;AAAA,UACnD,CAAC,UACC,eAAe,IAAI,MAAM,IAAI,KAC1B,iBAAiB,IAAI,MAAM,IAAI,KAC/B,gBAAgB,IAAI,MAAM,IAAI,KAC9B,MAAM,WAAW;AAAA,QACxB,CAAC;AACD,YAAI,6BAA6B,OAAO,GAAG;AACzC,qBAAW,SAASA,UAAS;AAC3B,gBACE,eAAe,IAAI,MAAM,IAAI,KAC1B,CAAC,6BAA6B,IAAI,KAAK,MACtC,MAAM,WAAW,UAAU,MAAM,WAAW,UAAU,MAAM,WAAW,cAC3E;AACA,sBAAQ,IAAI,KAAK;AACjB,wBAAU;AAAA,YACZ;AAAA,UACF;AACA;AAAA,QACF;AACA,cAAM,cAAcA,SAAQ;AAAA,UAC1B,CAAC,UAAU,eAAe,IAAI,MAAM,IAAI,MAAM,MAAM,WAAW,cAAc,MAAM,WAAW;AAAA,QAChG;AACA,YAAI,YAAa;AACjB,mBAAW,SAASA,UAAS;AAC3B,cACE,eAAe,IAAI,MAAM,IAAI,MAC5B,MAAM,WAAW,UAAU,MAAM,WAAW,UAAU,MAAM,WAAW,cACxE;AACA,oBAAQ,IAAI,KAAK;AAAA,UACnB;AAAA,QACF;AACA,cAAM,oBAAgD;AAAA,UACpD,OAAO,EAAE,MAAM,WAAW,QAAQ,UAAU,OAAO;AAAA,UACnD,MAAM,EAAE,MAAM,UAAU,QAAQ,SAAS,OAAO;AAAA,QAClD;AACA,qBAAa,KAAK;AAAA,UAChB,MAAM,YAAY,WAAW,YAAY;AAAA,UACzC;AAAA,UACA,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR;AAAA,UACA,gBAAgB;AAAA,YACd;AAAA,YACA,wBAAwB,IAAI,qBAAqB,iBAAiB,CAAC;AAAA,UACrE;AAAA,QACF,CAAC;AACD,kBAAU;AACV;AAAA,MACF;AAEA,YAAM,kBAAkBA,SAAQ,OAAO,CAAC,UAAU;AAChD,YAAI,aAAa,MAAM,WAAW,cAAc;AAC9C,iBAAO,gBAAgB,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,IAAI;AAAA,QAChE;AACA,YAAI,YAAY,MAAM,WAAW,aAAa;AAC5C,iBAAO,eAAe,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM,IAAI;AAAA,QAC/D;AACA,eAAO;AAAA,MACT,CAAC;AACD,YAAM,gBAAgB,aAAa;AACnC,YAAM,qBAAqB,cAAc,UAAa,cAAc;AACpE,UAAI,CAAC,iBAAiB,gBAAgB,WAAW,KAAM,CAAC,sBAAsB,gBAAgB,SAAS,GAAI;AACzG;AAAA,MACF;AACA,iBAAW,SAAS,iBAAiB;AACnC,YAAI,MAAM,SAAS,eAAe;AAChC,kBAAQ,IAAI,KAAK;AACjB,oBAAU;AAAA,QACZ;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,OAAO,KAAK,aAAa,SAAS,GAAG;AAC/C,yBAAmB;AAAA,QACjB;AAAA,QACA,CAAC,GAAGA,SAAQ,OAAO,CAAC,UAAU,CAAC,QAAQ,IAAI,KAAK,CAAC,GAAG,GAAG,YAAY,EAAE,KAAK,kBAAkB;AAAA,MAC9F;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,UAAU,CAAC,GAAG,mBAAmB,OAAO,CAAC,EAAE,KAAK,EAAE,KAAK,kBAAkB;AAC/E,SAAO;AAAA,IACL;AAAA,IACA,aAAa,uBAAuB,OAAO;AAAA,IAC3C,WAAW,QAAQ,MAAM,CAAC,UAAU,MAAM,WAAW,WAAW;AAAA,EAClE;AACF;","names":["entries"]}

package/dist/{chunk-YG56A6XY.js → chunk-ZS4JADYY.js}

@@ -1,7 +1,7 @@
 import {
   resolveWorkProductLedgerDir,
   validateWorkProductLedgerEntry
-} from "./chunk-WT6UL3UA.js";
+} from "./chunk-H7PRHUBD.js";
 import {
   TranscriptManager
 } from "./chunk-AM4T6CHX.js";
@@ -11,7 +11,7 @@ import {
 } from "./chunk-NOB2T2FC.js";
 import {
   parseConfig
-} from "./chunk-BHO3IVAN.js";
+} from "./chunk-RYST72N5.js";
 import {
   resolveObjectiveStateStoreDir,
   validateObjectiveStateSnapshot
@@ -268,4 +268,4 @@ export {
   recordResumeBundle,
   getResumeBundleStatus
 };
-//# sourceMappingURL=chunk-YG56A6XY.js.map
+//# sourceMappingURL=chunk-ZS4JADYY.js.map

package/dist/{cli-DB_uakTc.d.ts → cli-Bw9z-KqX.d.ts}

@@ -1,16 +1,16 @@
 import { CompoundingPromotionReport } from './compounding/engine.js';
 import { ConversationIndexBackendInspection } from './conversation-index/backend.js';
 import { MigrateObservationsResult } from './maintenance/migrate-observations.js';
-import { M as MemoryFile, l as MemoryFrontmatter, y as MemoryStatus, a6 as BehaviorSignalEvent, Q as QmdSearchResult, ab as BulkImportResult, ag as MemoryActionEvent, J as MemoryLifecycleEvent } from './types-BOANGhCJ.js';
-import { C as ConversationIndexCoordinator, T as TierMigrationCoordinator, O as Orchestrator } from './orchestrator-HPuY6I4i.js';
-import { S as StorageManager } from './storage-DS2O_6Qt.js';
+import { M as MemoryFile, l as MemoryFrontmatter, y as MemoryStatus, a6 as BehaviorSignalEvent, Q as QmdSearchResult, ab as BulkImportResult, ag as MemoryActionEvent, J as MemoryLifecycleEvent } from './types-DWHOxlZP.js';
+import { C as ConversationIndexCoordinator, T as TierMigrationCoordinator, O as Orchestrator } from './orchestrator-CFi-5JSR.js';
+import { S as StorageManager } from './storage-BVAVitkO.js';
 import { TrustZoneDemoSeedResult, TrustZoneName, TrustZonePromotionResult, TrustZoneStoreStatus } from './trust-zones.js';
-import { f as EngramAccessService } from './access-service-BeDYQQ62.js';
+import { f as EngramAccessService } from './access-service-M4LgO141.js';
 import { Writable, Readable } from 'node:stream';
 import { ResolveSecretRefFn } from './resolve-auth-token.js';
 import { CausalTrajectoryStoreStatus } from './causal-trajectory.js';
 import { C as ConnectorRunResult, a as ConnectorsOutputFormat } from './connectors-cli-2iaQ5tX2.js';
-import { P as ProcessBatchFn } from './pipeline-CvVe1Q2_.js';
+import { P as ProcessBatchFn } from './pipeline-BdF3ferY.js';
 import { MemoryGovernanceRunResult, MemoryGovernanceSummary, MemoryGovernanceMetrics, MemoryGovernanceQualityScore, MemoryGovernanceReviewQueueEntry, MemoryGovernanceAppliedAction, MemoryGovernanceTransitionReport, MemoryGovernanceManifest, MemoryGovernanceRestoreManifest, RestoreMemoryGovernanceRunResult } from './maintenance/memory-governance.js';
 import { RebuildMemoryProjectionResult, RepairMemoryProjectionResult, VerifyMemoryProjectionResult } from './maintenance/rebuild-memory-projection.js';
 import { RebuildObservationsResult } from './maintenance/rebuild-observations.js';