@remnic/core 9.44.0 → 9.45.1

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

@@ -1,4 +1,4 @@
-import { Q as QmdSearchResult, M as MemoryFile } from './types-CqWwMPr_.js';
+import { Q as QmdSearchResult, M as MemoryFile } from './types-rEwubvim.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';
 import './operator-doctor-types.js';

package/dist/recall-planner-llm.d.ts

@@ -1,4 +1,4 @@
-import { R as RecallPlanMode, P as PluginConfig } from './types-CqWwMPr_.js';
+import { R as RecallPlanMode, P as PluginConfig } from './types-rEwubvim.js';
 import { CapabilitySet } from './capabilities.js';
 import { FallbackLlmClient, FallbackLlmOptions } from './fallback-llm.js';
 import './message-parts/index.js';

package/dist/recall-state.d.ts

@@ -1,6 +1,6 @@
 import { HeldFileLockOptions } from './utils/serialize-mutations.js';
 import { SearchDegradation } from './search/port.js';
-import { R as RecallPlanMode, I as IdentityInjectionMode, c as RecallTierExplain } from './types-CqWwMPr_.js';
+import { R as RecallPlanMode, I as IdentityInjectionMode, c as RecallTierExplain } from './types-rEwubvim.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';
 import './operator-doctor-types.js';

package/dist/recall-tag-filter.d.ts

@@ -1,6 +1,6 @@
 import { RecallFilterTrace } from './recall-xray.js';
 import './memory-provenance.js';
-import './types-CqWwMPr_.js';
+import './types-rEwubvim.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';
 import './operator-doctor-types.js';

package/dist/recall-timings.d.ts

@@ -1,4 +1,4 @@
-import { P as PluginConfig } from './types-CqWwMPr_.js';
+import { P as PluginConfig } from './types-rEwubvim.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';
 import './operator-doctor-types.js';

package/dist/recall-xray-cli.d.ts

@@ -1,5 +1,5 @@
 import { RecallXrayFormat } from './recall-xray-renderer.js';
-import { b as RecallDisclosure } from './types-CqWwMPr_.js';
+import { b as RecallDisclosure } from './types-rEwubvim.js';
 import './recall-xray.js';
 import './memory-provenance.js';
 import './user-model.js';

package/dist/recall-xray-cli.js

@@ -2,11 +2,11 @@ import {
   parseXrayBudgetFlag,
   parseXrayCliOptions,
   parseXrayDisclosureFlag
-} from "./chunk-FXGLFGIG.js";
-import "./chunk-TXBU7YDV.js";
+} from "./chunk-TIHMZFIV.js";
+import "./chunk-3TBLDMJA.js";
 import "./chunk-SOBJ6NEY.js";
-import "./chunk-R4Q7CQGZ.js";
-import "./chunk-GSL47NPM.js";
+import "./chunk-TDHTVMPG.js";
+import "./chunk-J7VGGECD.js";
 import "./chunk-I4WBNM3M.js";
 import "./chunk-SOAU2OE2.js";
 import "./chunk-PZ5AY32C.js";

package/dist/recall-xray-renderer.d.ts

@@ -1,6 +1,6 @@
 import { RecallXraySnapshot } from './recall-xray.js';
 import './memory-provenance.js';
-import './types-CqWwMPr_.js';
+import './types-rEwubvim.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';
 import './operator-doctor-types.js';

package/dist/recall-xray-renderer.js

@@ -5,10 +5,10 @@ import {
   renderXrayJson,
   renderXrayMarkdown,
   renderXrayText
-} from "./chunk-TXBU7YDV.js";
+} from "./chunk-3TBLDMJA.js";
 import "./chunk-SOBJ6NEY.js";
-import "./chunk-R4Q7CQGZ.js";
-import "./chunk-GSL47NPM.js";
+import "./chunk-TDHTVMPG.js";
+import "./chunk-J7VGGECD.js";
 import "./chunk-I4WBNM3M.js";
 import "./chunk-SOAU2OE2.js";
 import "./chunk-PZ5AY32C.js";

package/dist/recall-xray.d.ts

@@ -1,5 +1,5 @@
 import { RetrievedMemoryProvenance } from './memory-provenance.js';
-import { c as RecallTierExplain, b as RecallDisclosure } from './types-CqWwMPr_.js';
+import { c as RecallTierExplain, b as RecallDisclosure } from './types-rEwubvim.js';
 import './user-model.js';
 import './message-parts/index.js';
 import './bounded-jsonl-state.js';

package/dist/recall-xray.js

@@ -5,8 +5,8 @@ import {
   estimateRecallTokens,
   isRecallXrayServedBy,
   summarizeDisclosureTokens
-} from "./chunk-R4Q7CQGZ.js";
-import "./chunk-GSL47NPM.js";
+} from "./chunk-TDHTVMPG.js";
+import "./chunk-J7VGGECD.js";
 import "./chunk-I4WBNM3M.js";
 import "./chunk-SOAU2OE2.js";
 import "./chunk-PZ5AY32C.js";

package/dist/reconcile/manifest.d.ts

@@ -0,0 +1,33 @@
+import { x as MemoryStatus } from '../types-rEwubvim.js';
+import { ReconcileFileState, ReconcilePlan } from './plan.js';
+import '../message-parts/index.js';
+import '../bounded-jsonl-state.js';
+import '../operator-doctor-types.js';
+import '../types-continuity.js';
+import '../offline-sync.js';
+
+declare const RECONCILE_MANIFEST_FORMAT = "remnic-reconcile-manifest";
+declare const RECONCILE_MANIFEST_SCHEMA_VERSION = 1;
+interface ReconcileMemoryIdentity {
+    id: string;
+    category: string;
+    contentHash: string;
+    status: MemoryStatus;
+}
+interface ReconcileManifestFile extends ReconcileFileState {
+    memory?: ReconcileMemoryIdentity;
+}
+interface ReconcileManifest {
+    format: typeof RECONCILE_MANIFEST_FORMAT;
+    schemaVersion: typeof RECONCILE_MANIFEST_SCHEMA_VERSION;
+    files: ReconcileManifestFile[];
+}
+interface BuildReconcileManifestOptions {
+    files: Iterable<ReconcileFileState>;
+    readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>;
+    cachedFiles?: Iterable<ReconcileManifestFile>;
+}
+declare function buildReconcileManifest(options: BuildReconcileManifestOptions): Promise<ReconcileManifest>;
+declare function collapseActiveFactDuplicates(plan: ReconcilePlan, localManifests: ReadonlyMap<string, ReconcileManifest>, peerManifests: ReadonlyMap<string, ReconcileManifest>): ReconcilePlan;
+
+export { type BuildReconcileManifestOptions, RECONCILE_MANIFEST_FORMAT, RECONCILE_MANIFEST_SCHEMA_VERSION, type ReconcileManifest, type ReconcileManifestFile, type ReconcileMemoryIdentity, buildReconcileManifest, collapseActiveFactDuplicates };

package/dist/reconcile/manifest.js

@@ -0,0 +1,249 @@
+import {
+  summarizeReconcilePlan
+} from "../chunk-K442KOID.js";
+import "../chunk-HBVPYRDW.js";
+import "../chunk-EGGE52UU.js";
+import {
+  inferMemoryStatus
+} from "../chunk-7RJUVTVF.js";
+import {
+  ContentHashIndex
+} from "../chunk-S5SLVSVY.js";
+import "../chunk-W5H6ZRPT.js";
+import "../chunk-FFAZ2XFU.js";
+import "../chunk-7XC2HX75.js";
+import "../chunk-UI3NYK34.js";
+import "../chunk-GCGJW34D.js";
+import "../chunk-AREGMX2J.js";
+import "../chunk-P7FMDTKL.js";
+import "../chunk-5TFP4CUL.js";
+import "../chunk-A6XUJE5D.js";
+import "../chunk-5UZXUTVO.js";
+import {
+  RECALL_FALLBACK_DIRS
+} from "../chunk-VS2IYZRU.js";
+import "../chunk-3WCASNQZ.js";
+import "../chunk-PZ5AY32C.js";
+
+// src/reconcile/manifest.ts
+import { createHash } from "crypto";
+var RECONCILE_MANIFEST_FORMAT = "remnic-reconcile-manifest";
+var RECONCILE_MANIFEST_SCHEMA_VERSION = 1;
+var SHA256_PATTERN = /^[a-f0-9]{64}$/i;
+var MEMORY_DIRS = new Set(RECALL_FALLBACK_DIRS);
+function isMemoryPath(filePath) {
+  if (!filePath.endsWith(".md")) return false;
+  const segments = filePath.split("/");
+  let index = 0;
+  if (segments[index] === "cold" || segments[index] === "archive") index += 1;
+  return MEMORY_DIRS.has(segments[index] ?? "");
+}
+function parseScalar(value) {
+  if (value === void 0) return void 0;
+  const trimmed = value.trim();
+  if (trimmed.length === 0) return void 0;
+  if (trimmed.startsWith('"') && trimmed.endsWith('"')) {
+    try {
+      const parsed = JSON.parse(trimmed);
+      return typeof parsed === "string" ? parsed : trimmed;
+    } catch {
+      return trimmed.slice(1, -1).replace(/\\"/g, '"');
+    }
+  }
+  if (trimmed.startsWith("'") && trimmed.endsWith("'")) {
+    return trimmed.slice(1, -1).replace(/''/g, "'");
+  }
+  return trimmed;
+}
+function parsedMemoryIdentity(filePath, raw) {
+  if (!isMemoryPath(filePath)) return void 0;
+  const match = (Buffer.isBuffer(raw) ? raw.toString("utf8") : raw).match(/^---\n([\s\S]*?)\n---\n?([\s\S]*)$/);
+  if (!match) return void 0;
+  const fields = /* @__PURE__ */ new Map();
+  for (const line of match[1].split("\n")) {
+    const separator = line.indexOf(":");
+    if (separator > 0) fields.set(line.slice(0, separator).trim(), line.slice(separator + 1).trim());
+  }
+  const id = parseScalar(fields.get("id"));
+  if (!id) return void 0;
+  const category = parseScalar(fields.get("category")) ?? "fact";
+  const storedHash = parseScalar(fields.get("contentHash"));
+  const contentHash = storedHash && SHA256_PATTERN.test(storedHash) ? storedHash.toLowerCase() : ContentHashIndex.computeHash(match[2].trim());
+  const status = inferMemoryStatus(
+    {
+      status: parseScalar(fields.get("status")),
+      archivedAt: parseScalar(fields.get("archivedAt"))
+    },
+    filePath
+  );
+  return { id, category, contentHash, status };
+}
+async function buildReconcileManifest(options) {
+  const cachedByPath = /* @__PURE__ */ new Map();
+  for (const cached of options.cachedFiles ?? []) {
+    cachedByPath.set(cached.path, cached);
+  }
+  const files = [];
+  for (const file of options.files) {
+    const cached = cachedByPath.get(file.path);
+    if (cached?.sha256.toLowerCase() === file.sha256.toLowerCase()) {
+      files.push({ ...file, ...cached.memory ? { memory: cached.memory } : {} });
+      continue;
+    }
+    let raw = null;
+    if (isMemoryPath(file.path)) {
+      try {
+        raw = await options.readFile(file);
+      } catch {
+        raw = null;
+      }
+    }
+    if (raw !== null && createHash("sha256").update(raw).digest("hex") !== file.sha256.toLowerCase()) {
+      raw = null;
+    }
+    const memory = raw === null ? void 0 : parsedMemoryIdentity(file.path, raw);
+    files.push({ ...file, ...memory ? { memory } : {} });
+  }
+  files.sort((left, right) => left.path < right.path ? -1 : left.path > right.path ? 1 : 0);
+  return {
+    format: RECONCILE_MANIFEST_FORMAT,
+    schemaVersion: RECONCILE_MANIFEST_SCHEMA_VERSION,
+    files
+  };
+}
+function activeFactByPath(manifest) {
+  const result = /* @__PURE__ */ new Map();
+  for (const file of manifest?.files ?? []) {
+    if (file.memory?.category === "fact" && file.memory.status === "active") {
+      result.set(file.path, file);
+    }
+  }
+  return result;
+}
+function contentHashRows(files) {
+  const rows = [];
+  for (const file of files) {
+    rows.push({ path: file.path, contentHash: file.memory.contentHash });
+  }
+  return rows;
+}
+function comparePlanEntries(left, right) {
+  if (left.namespace !== right.namespace) return left.namespace < right.namespace ? -1 : 1;
+  return left.path < right.path ? -1 : left.path > right.path ? 1 : 0;
+}
+function collapseActiveFactDuplicates(plan, localManifests, peerManifests) {
+  const entriesByNamespace = /* @__PURE__ */ new Map();
+  for (const entry of plan.entries) {
+    const entries2 = entriesByNamespace.get(entry.namespace) ?? [];
+    entries2.push({ ...entry });
+    entriesByNamespace.set(entry.namespace, entries2);
+  }
+  let changed = false;
+  for (const namespace of /* @__PURE__ */ new Set([...localManifests.keys(), ...peerManifests.keys()])) {
+    const entries2 = entriesByNamespace.get(namespace) ?? [];
+    const localManifest = localManifests.get(namespace);
+    const peerManifest = peerManifests.get(namespace);
+    const localByPath = activeFactByPath(localManifest);
+    const peerByPath = activeFactByPath(peerManifest);
+    const localFilesByPath = new Map((localManifest?.files ?? []).map((file) => [file.path, file]));
+    const peerFilesByPath = new Map((peerManifest?.files ?? []).map((file) => [file.path, file]));
+    const localByHash = /* @__PURE__ */ new Map();
+    const peerByHash = /* @__PURE__ */ new Map();
+    for (const file of localByPath.values()) {
+      const hash = file.memory.contentHash;
+      const bucket = localByHash.get(hash) ?? [];
+      bucket.push(file);
+      localByHash.set(hash, bucket);
+    }
+    for (const file of peerByPath.values()) {
+      const hash = file.memory.contentHash;
+      const bucket = peerByHash.get(hash) ?? [];
+      bucket.push(file);
+      peerByHash.set(hash, bucket);
+    }
+    const removed = /* @__PURE__ */ new Set();
+    const replacements = [];
+    for (const hash of /* @__PURE__ */ new Set([...localByHash.keys(), ...peerByHash.keys()])) {
+      const localCandidates = (localByHash.get(hash) ?? []).filter((file) => {
+        const opposite = peerFilesByPath.get(file.path);
+        const activeOpposite = peerByPath.get(file.path);
+        return opposite === void 0 || activeOpposite?.memory.contentHash === hash;
+      });
+      const peerCandidates = (peerByHash.get(hash) ?? []).filter((file) => {
+        const opposite = localFilesByPath.get(file.path);
+        const activeOpposite = localByPath.get(file.path);
+        return opposite === void 0 || activeOpposite?.memory.contentHash === hash;
+      });
+      const localPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(localCandidates));
+      const peerPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(peerCandidates));
+      if (localPath && peerPath && localPath !== peerPath) {
+        const localFile = localByPath.get(localPath);
+        const peerFile = peerByPath.get(peerPath);
+        if (!localFile || !peerFile) continue;
+        const duplicatePaths = /* @__PURE__ */ new Set([
+          ...localCandidates.map((file) => file.path),
+          ...peerCandidates.map((file) => file.path)
+        ]);
+        const unsafeEntry = entries2.some(
+          (entry) => duplicatePaths.has(entry.path) && (entry.action === "suppress" || entry.action === "conflict")
+        );
+        if (unsafeEntry) continue;
+        for (const entry of entries2) {
+          if (duplicatePaths.has(entry.path) && (entry.action === "pull" || entry.action === "push" || entry.action === "identical")) {
+            removed.add(entry);
+          }
+        }
+        replacements.push({
+          path: localPath < peerPath ? localPath : peerPath,
+          namespace,
+          action: "identical",
+          reason: "semantic_duplicate",
+          localSha256: localFile.sha256,
+          peerSha256: peerFile.sha256
+        });
+        changed = true;
+        continue;
+      }
+      const sameSideEntries = entries2.filter((entry) => {
+        if (localPath && entry.reason === "local_only") {
+          return localCandidates.some((file) => file.path === entry.path);
+        }
+        if (peerPath && entry.reason === "peer_only") {
+          return peerCandidates.some((file) => file.path === entry.path);
+        }
+        return false;
+      });
+      const canonicalPath = localPath ?? peerPath;
+      const hasSharedCanonical = localPath !== void 0 && localPath === peerPath;
+      if (!canonicalPath || sameSideEntries.length === 0 || !hasSharedCanonical && sameSideEntries.length < 2) {
+        continue;
+      }
+      for (const entry of sameSideEntries) {
+        if (entry.path !== canonicalPath) {
+          removed.add(entry);
+          changed = true;
+        }
+      }
+    }
+    if (removed.size > 0 || replacements.length > 0) {
+      entriesByNamespace.set(
+        namespace,
+        [...entries2.filter((entry) => !removed.has(entry)), ...replacements].sort(comparePlanEntries)
+      );
+    }
+  }
+  if (!changed) return plan;
+  const entries = [...entriesByNamespace.values()].flat().sort(comparePlanEntries);
+  return {
+    entries,
+    byNamespace: summarizeReconcilePlan(entries),
+    converged: entries.every((entry) => entry.action === "identical")
+  };
+}
+export {
+  RECONCILE_MANIFEST_FORMAT,
+  RECONCILE_MANIFEST_SCHEMA_VERSION,
+  buildReconcileManifest,
+  collapseActiveFactDuplicates
+};
+//# sourceMappingURL=manifest.js.map

package/dist/reconcile/manifest.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/reconcile/manifest.ts"],"sourcesContent":["import { createHash } from \"node:crypto\";\nimport { inferMemoryStatus } from \"../memory-lifecycle-ledger-utils.js\";\nimport { ContentHashIndex, type ContentHashPathEntry } from \"../storage/content-hash-index.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  summarizeReconcilePlan,\n} from \"./plan.js\";\n\nexport const RECONCILE_MANIFEST_FORMAT = \"remnic-reconcile-manifest\";\nexport const RECONCILE_MANIFEST_SCHEMA_VERSION = 1;\n\nexport interface ReconcileMemoryIdentity {\n  id: string;\n  category: string;\n  contentHash: string;\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 interface BuildReconcileManifestOptions {\n  files: Iterable<ReconcileFileState>;\n  readFile: (file: ReconcileFileState) => Promise<Buffer | string | null>;\n  cachedFiles?: Iterable<ReconcileManifestFile>;\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\nfunction parseScalar(value: string | undefined): string | undefined {\n  if (value === undefined) return undefined;\n  const trimmed = value.trim();\n  if (trimmed.length === 0) return undefined;\n  if (trimmed.startsWith('\"') && trimmed.endsWith('\"')) {\n    try {\n      const parsed = JSON.parse(trimmed) as unknown;\n      return typeof parsed === \"string\" ? parsed : trimmed;\n    } catch {\n      return trimmed.slice(1, -1).replace(/\\\\\"/g, '\"');\n    }\n  }\n  if (trimmed.startsWith(\"'\") && trimmed.endsWith(\"'\")) {\n    return trimmed.slice(1, -1).replace(/''/g, \"'\");\n  }\n  return trimmed;\n}\n\nfunction parsedMemoryIdentity(filePath: string, raw: Buffer | string): ReconcileMemoryIdentity | undefined {\n  if (!isMemoryPath(filePath)) return undefined;\n  const match = (Buffer.isBuffer(raw) ? raw.toString(\"utf8\") : raw).match(/^---\\n([\\s\\S]*?)\\n---\\n?([\\s\\S]*)$/);\n  if (!match) return undefined;\n  const fields = new Map<string, string>();\n  for (const line of match[1].split(\"\\n\")) {\n    const separator = line.indexOf(\":\");\n    if (separator > 0) fields.set(line.slice(0, separator).trim(), line.slice(separator + 1).trim());\n  }\n  const id = parseScalar(fields.get(\"id\"));\n  if (!id) return undefined;\n  const category = parseScalar(fields.get(\"category\")) ?? \"fact\";\n  const storedHash = parseScalar(fields.get(\"contentHash\"));\n  const contentHash =\n    storedHash && SHA256_PATTERN.test(storedHash)\n      ? storedHash.toLowerCase()\n      : ContentHashIndex.computeHash(match[2].trim());\n  const status = inferMemoryStatus(\n    {\n      status: parseScalar(fields.get(\"status\")) as MemoryStatus | undefined,\n      archivedAt: parseScalar(fields.get(\"archivedAt\")),\n    } as MemoryFrontmatter,\n    filePath\n  );\n  return { id, category, contentHash, status };\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 (cached?.sha256.toLowerCase() === file.sha256.toLowerCase()) {\n      files.push({ ...file, ...(cached.memory ? { memory: cached.memory } : {}) });\n      continue;\n    }\n\n    let raw: Buffer | string | null = null;\n    if (isMemoryPath(file.path)) {\n      try {\n        raw = await options.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);\n    files.push({ ...file, ...(memory ? { memory } : {}) });\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 contentHashRows(files: Iterable<ActiveFactManifestFile>): ContentHashPathEntry[] {\n  const rows: ContentHashPathEntry[] = [];\n  for (const file of files) {\n    rows.push({ path: file.path, contentHash: file.memory.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\nexport function collapseActiveFactDuplicates(\n  plan: ReconcilePlan,\n  localManifests: ReadonlyMap<string, ReconcileManifest>,\n  peerManifests: ReadonlyMap<string, ReconcileManifest>\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 localByHash = new Map<string, ActiveFactManifestFile[]>();\n    const peerByHash = new Map<string, ActiveFactManifestFile[]>();\n\n    for (const file of localByPath.values()) {\n      const hash = file.memory.contentHash;\n      const bucket = localByHash.get(hash) ?? [];\n      bucket.push(file);\n      localByHash.set(hash, bucket);\n    }\n    for (const file of peerByPath.values()) {\n      const hash = file.memory.contentHash;\n      const bucket = peerByHash.get(hash) ?? [];\n      bucket.push(file);\n      peerByHash.set(hash, bucket);\n    }\n\n    const removed = new Set<ReconcilePlanEntry>();\n    const replacements: ReconcilePlanEntry[] = [];\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 || activeOpposite?.memory.contentHash === hash;\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 || activeOpposite?.memory.contentHash === hash;\n      });\n      const localPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(localCandidates));\n      const peerPath = ContentHashIndex.resolvePathByHash(hash, contentHashRows(peerCandidates));\n\n      if (localPath && peerPath && localPath !== peerPath) {\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 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        replacements.push({\n          path: localPath < peerPath ? localPath : peerPath,\n          namespace,\n          action: \"identical\",\n          reason: \"semantic_duplicate\",\n          localSha256: localFile.sha256,\n          peerSha256: peerFile.sha256,\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;AAYpB,IAAM,4BAA4B;AAClC,IAAM,oCAAoC;AA2BjD,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;AAEA,SAAS,YAAY,OAA+C;AAClE,MAAI,UAAU,OAAW,QAAO;AAChC,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,MAAI,QAAQ,WAAW,GAAG,KAAK,QAAQ,SAAS,GAAG,GAAG;AACpD,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,OAAO;AACjC,aAAO,OAAO,WAAW,WAAW,SAAS;AAAA,IAC/C,QAAQ;AACN,aAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,QAAQ,QAAQ,GAAG;AAAA,IACjD;AAAA,EACF;AACA,MAAI,QAAQ,WAAW,GAAG,KAAK,QAAQ,SAAS,GAAG,GAAG;AACpD,WAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,QAAQ,OAAO,GAAG;AAAA,EAChD;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,UAAkB,KAA2D;AACzG,MAAI,CAAC,aAAa,QAAQ,EAAG,QAAO;AACpC,QAAM,SAAS,OAAO,SAAS,GAAG,IAAI,IAAI,SAAS,MAAM,IAAI,KAAK,MAAM,oCAAoC;AAC5G,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,QAAQ,MAAM,CAAC,EAAE,MAAM,IAAI,GAAG;AACvC,UAAM,YAAY,KAAK,QAAQ,GAAG;AAClC,QAAI,YAAY,EAAG,QAAO,IAAI,KAAK,MAAM,GAAG,SAAS,EAAE,KAAK,GAAG,KAAK,MAAM,YAAY,CAAC,EAAE,KAAK,CAAC;AAAA,EACjG;AACA,QAAM,KAAK,YAAY,OAAO,IAAI,IAAI,CAAC;AACvC,MAAI,CAAC,GAAI,QAAO;AAChB,QAAM,WAAW,YAAY,OAAO,IAAI,UAAU,CAAC,KAAK;AACxD,QAAM,aAAa,YAAY,OAAO,IAAI,aAAa,CAAC;AACxD,QAAM,cACJ,cAAc,eAAe,KAAK,UAAU,IACxC,WAAW,YAAY,IACvB,iBAAiB,YAAY,MAAM,CAAC,EAAE,KAAK,CAAC;AAClD,QAAM,SAAS;AAAA,IACb;AAAA,MACE,QAAQ,YAAY,OAAO,IAAI,QAAQ,CAAC;AAAA,MACxC,YAAY,YAAY,OAAO,IAAI,YAAY,CAAC;AAAA,IAClD;AAAA,IACA;AAAA,EACF;AACA,SAAO,EAAE,IAAI,UAAU,aAAa,OAAO;AAC7C;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,QAAI,QAAQ,OAAO,YAAY,MAAM,KAAK,OAAO,YAAY,GAAG;AAC9D,YAAM,KAAK,EAAE,GAAG,MAAM,GAAI,OAAO,SAAS,EAAE,QAAQ,OAAO,OAAO,IAAI,CAAC,EAAG,CAAC;AAC3E;AAAA,IACF;AAEA,QAAI,MAA8B;AAClC,QAAI,aAAa,KAAK,IAAI,GAAG;AAC3B,UAAI;AACF,cAAM,MAAM,QAAQ,SAAS,IAAI;AAAA,MACnC,QAAQ;AACN,cAAM;AAAA,MACR;AAAA,IACF;AACA,QAAI,QAAQ,QAAQ,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE,OAAO,KAAK,MAAM,KAAK,OAAO,YAAY,GAAG;AAChG,YAAM;AAAA,IACR;AACA,UAAM,SAAS,QAAQ,OAAO,SAAY,qBAAqB,KAAK,MAAM,GAAG;AAC7E,UAAM,KAAK,EAAE,GAAG,MAAM,GAAI,SAAS,EAAE,OAAO,IAAI,CAAC,EAAG,CAAC;AAAA,EACvD;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,gBAAgB,OAAiE;AACxF,QAAM,OAA+B,CAAC;AACtC,aAAW,QAAQ,OAAO;AACxB,SAAK,KAAK,EAAE,MAAM,KAAK,MAAM,aAAa,KAAK,OAAO,YAAY,CAAC;AAAA,EACrE;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;AAEO,SAAS,6BACd,MACA,gBACA,eACe;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,cAAc,oBAAI,IAAsC;AAC9D,UAAM,aAAa,oBAAI,IAAsC;AAE7D,eAAW,QAAQ,YAAY,OAAO,GAAG;AACvC,YAAM,OAAO,KAAK,OAAO;AACzB,YAAM,SAAS,YAAY,IAAI,IAAI,KAAK,CAAC;AACzC,aAAO,KAAK,IAAI;AAChB,kBAAY,IAAI,MAAM,MAAM;AAAA,IAC9B;AACA,eAAW,QAAQ,WAAW,OAAO,GAAG;AACtC,YAAM,OAAO,KAAK,OAAO;AACzB,YAAM,SAAS,WAAW,IAAI,IAAI,KAAK,CAAC;AACxC,aAAO,KAAK,IAAI;AAChB,iBAAW,IAAI,MAAM,MAAM;AAAA,IAC7B;AAEA,UAAM,UAAU,oBAAI,IAAwB;AAC5C,UAAM,eAAqC,CAAC;AAC5C,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,UAAa,gBAAgB,OAAO,gBAAgB;AAAA,MAC1E,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,UAAa,gBAAgB,OAAO,gBAAgB;AAAA,MAC1E,CAAC;AACD,YAAM,YAAY,iBAAiB,kBAAkB,MAAM,gBAAgB,eAAe,CAAC;AAC3F,YAAM,WAAW,iBAAiB,kBAAkB,MAAM,gBAAgB,cAAc,CAAC;AAEzF,UAAI,aAAa,YAAY,cAAc,UAAU;AACnD,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,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,qBAAa,KAAK;AAAA,UAChB,MAAM,YAAY,WAAW,YAAY;AAAA,UACzC;AAAA,UACA,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,aAAa,UAAU;AAAA,UACvB,YAAY,SAAS;AAAA,QACvB,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/reconcile/plan.d.ts

@@ -1,4 +1,9 @@
 import { OfflineSyncFileState } from '../offline-sync.js';
+import { ai as ConvergeConflictPolicy } from '../types-rEwubvim.js';
+import '../message-parts/index.js';
+import '../bounded-jsonl-state.js';
+import '../operator-doctor-types.js';
+import '../types-continuity.js';
 
 /**
  * Bootstrap reconciliation planner for two peer daemons whose corpora have
@@ -19,20 +24,11 @@ import { OfflineSyncFileState } from '../offline-sync.js';
  */
 /** Which way a path must move for the two corpora to agree. */
 type ReconcileAction = "pull" | "push" | "identical" | "conflict" | "suppress";
-/**
- * How a path present on BOTH sides with different content is settled.
- *
- * `manual` is the safe default: on a bootstrap merge the two sides are equally
- * authoritative, so silently picking one is data loss with extra steps. An
- * operator opts into an automatic rule once they know the shape of their split.
- */
-type ReconcileConflictPolicy = "manual" | "newest-wins" | "keep-both";
 /**
  * What the planner decided for a conflicting path.
- *
- * `keep-both` never overwrites: the older side is retained and linked as
- * superseded by the newer one, which is the only resolution that cannot lose a
- * fact neither corpus has seen.
+ * `supersede-link` records that both revisions need durable preservation when
+ * timestamps cannot safely select a winner. Apply must stop until transport
+ * can assign distinct durable identities to both revisions.
  */
 type ReconcileResolution = "local-wins" | "peer-wins" | "supersede-link" | "unresolved";
 interface ReconcilePlanEntry {
@@ -54,19 +50,10 @@ interface ReconcilePlanEntry {
      * delete the live copy instead of the retracted one.
      */
     suppressSide?: "local" | "peer" | "both";
-    /**
-     * Which revision is newer, set only for a `supersede-link` resolution.
-     *
-     * The contract is that the older revision is linked as superseded by the
-     * newer one, so transport needs the direction. Absent when the timestamps
-     * cannot order the two - which is exactly when `newest-wins` degrades to
-     * `supersede-link` - and the link direction is then an operator decision.
-     */
-    newerSide?: "local" | "peer";
 }
 type ReconcileReason = "peer_only" | "local_only"
 /** Cursor showed only that side moved since agreement; both still hold the path. */
- | "peer_changed" | "local_changed" | "same_content" | "both_modified" | "peer_deleted" | "local_deleted"
+ | "peer_changed" | "local_changed" | "same_content" | "semantic_duplicate" | "both_modified" | "peer_deleted" | "local_deleted"
 /** Peer deleted it while this side edited it — the offline-sync delete/modify pair. */
  | "local_modified_peer_deleted" | "local_deleted_peer_modified" | "tombstoned";
 interface ReconcileNamespaceReport {
@@ -108,6 +95,14 @@ interface ReconcileNamespaceInput {
      * read as "never seen" rather than "deleted".
      */
     base?: Iterable<ReconcileFileState>;
+    /**
+     * Revision timestamps for paths deleted locally since the base cursor.
+     * A deletion is a revision and must carry a comparable time for
+     * `newest-wins`; absence alone has no timestamp.
+     */
+    localDeletionMtimeMs?: ReadonlyMap<string, number>;
+    /** Revision timestamps for paths deleted by the peer since the base cursor. */
+    peerDeletionMtimeMs?: ReadonlyMap<string, number>;
     /**
      * Digests of FILES this side has retracted, in the same form as
      * `ReconcileFileState.sha256` — a hash of the serialized file.
@@ -139,7 +134,7 @@ interface ReconcileNamespaceInput {
     peerTombstonedFileSha256?: Iterable<string>;
 }
 interface ReconcileOptions {
-    conflictPolicy?: ReconcileConflictPolicy;
+    conflictPolicy?: ConvergeConflictPolicy;
 }
 /**
  * A census the planner refuses to reason about.
@@ -172,4 +167,4 @@ declare function summarizeReconcilePlan(entries: readonly ReconcilePlanEntry[]):
  */
 declare function planReconciliation(namespaces: readonly ReconcileNamespaceInput[], options?: ReconcileOptions): ReconcilePlan;
 
-export { type ReconcileAction, type ReconcileConflictPolicy, type ReconcileFileState, type ReconcileNamespaceInput, type ReconcileNamespaceReport, type ReconcileOptions, type ReconcilePlan, type ReconcilePlanEntry, ReconcilePlanInputError, type ReconcileReason, type ReconcileResolution, planNamespaceReconciliation, planReconciliation, summarizeReconcilePlan };
+export { type ReconcileAction, type ReconcileFileState, type ReconcileNamespaceInput, type ReconcileNamespaceReport, type ReconcileOptions, type ReconcilePlan, type ReconcilePlanEntry, ReconcilePlanInputError, type ReconcileReason, type ReconcileResolution, planNamespaceReconciliation, planReconciliation, summarizeReconcilePlan };