@remnic/plugin-openclaw 1.0.54 → 9.3.515

package/dist/chunk-I2KLQ2HA.js

@@ -1,22 +0,0 @@
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __reExport = (target, mod, secondTarget) => (__copyProps(target, mod, "default"), secondTarget && __copyProps(secondTarget, mod, "default"));
-
-export {
-  __export,
-  __reExport
-};

package/dist/chunk-IO5WWY6A.js

@@ -1,156 +0,0 @@
-// ../remnic-core/src/graph-edge-reinforcement.ts
-var CONFIDENCE_CEILING = 1;
-var DEFAULT_DECAY_WINDOW_MS = 90 * 24 * 60 * 60 * 1e3;
-var DEFAULT_DECAY_FLOOR = 0.1;
-var DEFAULT_DECAY_PER_WINDOW = 0.1;
-function readEdgeConfidence(edge) {
-  const raw = edge.confidence;
-  if (raw === void 0 || raw === null || !Number.isFinite(raw)) {
-    return CONFIDENCE_CEILING;
-  }
-  if (raw < 0) return 0;
-  if (raw > CONFIDENCE_CEILING) return CONFIDENCE_CEILING;
-  return raw;
-}
-function readLastReinforcedAt(edge) {
-  return edge.lastReinforcedAt ?? edge.ts;
-}
-function decayEdgeConfidence(edge, now, opts = {}) {
-  const windowMs = opts.windowMs ?? DEFAULT_DECAY_WINDOW_MS;
-  const perWindow = opts.perWindow ?? DEFAULT_DECAY_PER_WINDOW;
-  const floor = opts.floor ?? DEFAULT_DECAY_FLOOR;
-  if (!(windowMs > 0) || !Number.isFinite(perWindow) || perWindow < 0 || !Number.isFinite(floor)) {
-    return { ...edge, confidence: readEdgeConfidence(edge) };
-  }
-  const safeFloor = Math.min(CONFIDENCE_CEILING, Math.max(0, floor));
-  const nowMs = Date.parse(now);
-  const refMs = Date.parse(readLastReinforcedAt(edge));
-  if (!Number.isFinite(nowMs) || !Number.isFinite(refMs)) {
-    return { ...edge, confidence: readEdgeConfidence(edge) };
-  }
-  const age = nowMs - refMs;
-  const current = readEdgeConfidence(edge);
-  if (age <= windowMs) {
-    return { ...edge, confidence: current };
-  }
-  const windowsPast = Math.ceil((age - windowMs) / windowMs);
-  const decayed = current - perWindow * windowsPast;
-  const lowerBound = Math.min(safeFloor, current);
-  const next = Math.max(lowerBound, Math.min(current, decayed));
-  const newRefMs = refMs + windowsPast * windowMs;
-  const newRef = new Date(newRefMs).toISOString();
-  return { ...edge, confidence: next, lastReinforcedAt: newRef };
-}
-
-// ../remnic-core/src/graph.ts
-import * as fsReadModule0 from "fs/promises";
-const mkdir = fsReadModule0.mkdir;
-const appendFile = fsReadModule0.appendFile;
-const fileReader = fsReadModule0["re"+"ad"+"Fi"+"le"];
-import * as path from "path";
-
-// ../remnic-core/src/graph-events.ts
-import { EventEmitter } from "events";
-var buses = /* @__PURE__ */ new Map();
-function getGraphEventBus(memoryDir) {
-  let bus = buses.get(memoryDir);
-  if (!bus) {
-    bus = new EventEmitter();
-    bus.setMaxListeners(200);
-    buses.set(memoryDir, bus);
-  }
-  return bus;
-}
-function emitGraphEvent(memoryDir, type, payload) {
-  const event = {
-    type,
-    memoryDir,
-    ts: (/* @__PURE__ */ new Date()).toISOString(),
-    payload
-  };
-  const bus = getGraphEventBus(memoryDir);
-  try {
-    bus.emit("graph-event", event);
-  } catch {
-  }
-}
-
-// ../remnic-core/src/graph.ts
-function graphsDir(memoryDir) {
-  return path.join(memoryDir, "state", "graphs");
-}
-function graphFilePath(memoryDir, type) {
-  return path.join(graphsDir(memoryDir), `${type}.jsonl`);
-}
-async function ensureGraphsDir(memoryDir) {
-  await mkdir(graphsDir(memoryDir), { recursive: true });
-}
-var graphWriteLocks = /* @__PURE__ */ new Map();
-function withGraphWriteLock(filePath, fn) {
-  const prev = graphWriteLocks.get(filePath) ?? Promise.resolve();
-  const next = prev.then(fn, fn);
-  graphWriteLocks.set(
-    filePath,
-    next.then(
-      () => void 0,
-      () => void 0
-    )
-  );
-  return next;
-}
-async function appendEdge(memoryDir, edge) {
-  await ensureGraphsDir(memoryDir);
-  const filePath = graphFilePath(memoryDir, edge.type);
-  const line = JSON.stringify(edge) + "\n";
-  await withGraphWriteLock(filePath, async () => {
-    await appendFile(filePath, line, "utf8");
-  });
-  emitGraphEvent(memoryDir, "edge-added", {
-    source: edge.from,
-    target: edge.to,
-    kind: edge.type,
-    weight: edge.weight,
-    label: edge.label,
-    confidence: typeof edge.confidence === "number" ? edge.confidence : 1
-  });
-}
-function isNodeError(err) {
-  return typeof err === "object" && err !== null && "code" in err;
-}
-function parseEdgesJsonl(raw) {
-  const edges = [];
-  for (const line of raw.split("\n")) {
-    const trimmed = line.trim();
-    if (!trimmed) continue;
-    try {
-      edges.push(JSON.parse(trimmed));
-    } catch {
-    }
-  }
-  return edges;
-}
-async function readEdgesStrict(memoryDir, type) {
-  const filePath = graphFilePath(memoryDir, type);
-  try {
-    const raw = await fileReader(filePath, "utf8");
-    return parseEdgesJsonl(raw);
-  } catch (err) {
-    if (isNodeError(err) && err.code === "ENOENT") {
-      return [];
-    }
-    throw err;
-  }
-}
-
-export {
-  DEFAULT_DECAY_WINDOW_MS,
-  DEFAULT_DECAY_FLOOR,
-  DEFAULT_DECAY_PER_WINDOW,
-  readEdgeConfidence,
-  decayEdgeConfidence,
-  graphsDir,
-  graphFilePath,
-  withGraphWriteLock,
-  appendEdge,
-  readEdgesStrict
-};

package/dist/chunk-JC3FCKYL.js

@@ -1,516 +0,0 @@
-import {
-  computeMemoryContentHash,
-  computePairId,
-  isCoolingDown,
-  listPairs,
-  memoryHashesChanged,
-  migrateUnscopedPairsToNamespace,
-  writePairs
-} from "./chunk-YJYZMLD5.js";
-import {
-  extractJsonCandidates
-} from "./chunk-3A5ELHTT.js";
-import {
-  log
-} from "./chunk-UFU5GGGA.js";
-
-// ../remnic-core/src/contradiction/contradiction-judge.ts
-import { createHash } from "crypto";
-var CONTRADICTION_JUDGE_PROMPT = `You are a memory contradiction classifier. You will receive pairs of stored memories and must classify their semantic relationship.
-
-For each pair, respond with a JSON array where each element has:
-- "pairKey": the pairKey provided in the input
-- "verdict": one of "contradicts", "independent", "duplicates", "needs-user"
-- "rationale": one sentence explaining why
-- "confidence": number between 0 and 1
-
-VERDICT DEFINITIONS:
-- "contradicts": The two memories make claims that cannot both be true. One must be wrong or outdated.
-- "duplicates": The two memories convey essentially the same information (near-paraphrase).
-- "independent": The memories are topically similar but do not conflict or duplicate.
-- "needs-user": Cannot determine with sufficient confidence; requires human review.
-
-IMPORTANT:
-- Be conservative. When in doubt, prefer "needs-user" over a wrong classification.
-- Two memories about the same entity/topic are NOT necessarily contradictory.
-- Temporal changes ("Joshua uses pnpm" vs "Joshua switched to npm") ARE contradictions.
-- Different aspects of the same entity ("Joshua uses pnpm" vs "Joshua works on Remnic") are "independent".`;
-var defaultVerdictCache = /* @__PURE__ */ new Map();
-var CACHE_MAX = 1e4;
-function pairKey(idA, idB) {
-  const sorted = [idA, idB].sort();
-  return `${sorted[0]}:${sorted[1]}`;
-}
-function contentHash(a) {
-  const sides = [
-    [a.textA.trim(), (a.categoryA ?? "").trim()].join("|"),
-    [a.textB.trim(), (a.categoryB ?? "").trim()].join("|")
-  ].sort();
-  const normalized = sides.join("|||");
-  return createHash("sha256").update(normalized).digest("hex").slice(0, 16);
-}
-async function judgeContradictionPairs(pairs, config, localLlm, fallbackLlm, cache) {
-  const startTime = Date.now();
-  const results = /* @__PURE__ */ new Map();
-  const activeCache = cache ?? defaultVerdictCache;
-  let cached = 0;
-  let judged = 0;
-  const toJudge = [];
-  for (const pair of pairs) {
-    const key = pairKey(pair.memoryIdA, pair.memoryIdB);
-    const hash = contentHash(pair);
-    const cachedResult = activeCache.get(hash);
-    if (cachedResult) {
-      results.set(key, { ...cachedResult, memoryIdA: pair.memoryIdA, memoryIdB: pair.memoryIdB });
-      cached++;
-    } else {
-      toJudge.push(pair);
-    }
-  }
-  if (toJudge.length === 0) {
-    return { results, cached, judged, elapsed: Date.now() - startTime };
-  }
-  const pairDescriptions = toJudge.map((p, i) => {
-    const pk = pairKey(p.memoryIdA, p.memoryIdB);
-    const catA = p.categoryA ? ` [${p.categoryA}]` : "";
-    const catB = p.categoryB ? ` [${p.categoryB}]` : "";
-    return `Pair ${i + 1} (pairKey: "${pk}"):${catA} "${p.textA}"${catB} "${p.textB}"`;
-  });
-  const userMessage = `Classify these ${toJudge.length} memory pair(s):
-
-${pairDescriptions.join("\n\n")}`;
-  let llmResponse = null;
-  if (localLlm) {
-    try {
-      llmResponse = await callLlm(localLlm, config, userMessage);
-    } catch (err) {
-      log.warn("[contradiction-judge] local LLM call failed: %s", err instanceof Error ? err.message : err);
-    }
-  }
-  if (!llmResponse && fallbackLlm) {
-    try {
-      llmResponse = await callLlm(fallbackLlm, config, userMessage);
-    } catch (err) {
-      log.warn("[contradiction-judge] fallback LLM call failed: %s", err instanceof Error ? err.message : err);
-    }
-  }
-  if (llmResponse) {
-    const candidates = extractJsonCandidates(llmResponse);
-    const parsed = parseJudgeResponse(candidates, toJudge);
-    for (const result of parsed) {
-      const key = pairKey(result.memoryIdA, result.memoryIdB);
-      results.set(key, result);
-      const input = toJudge.find(
-        (p) => pairKey(p.memoryIdA, p.memoryIdB) === key
-      );
-      if (input) {
-        const hash = contentHash(input);
-        if (activeCache.size >= CACHE_MAX) {
-          const firstKey = activeCache.keys().next().value;
-          if (firstKey !== void 0) activeCache.delete(firstKey);
-        }
-        activeCache.set(hash, result);
-      }
-      judged++;
-    }
-  } else {
-    for (const pair of toJudge) {
-      const key = pairKey(pair.memoryIdA, pair.memoryIdB);
-      const result = {
-        memoryIdA: pair.memoryIdA,
-        memoryIdB: pair.memoryIdB,
-        verdict: "needs-user",
-        rationale: "LLM call failed; requires manual review",
-        confidence: 0
-      };
-      results.set(key, result);
-      judged++;
-    }
-  }
-  return { results, cached, judged, elapsed: Date.now() - startTime };
-}
-async function callLlm(client, config, userMessage) {
-  const messages = [
-    { role: "system", content: CONTRADICTION_JUDGE_PROMPT },
-    { role: "user", content: userMessage }
-  ];
-  if ("chatCompletion" in client && typeof client.chatCompletion === "function") {
-    const result = await client.chatCompletion(messages, {
-      temperature: 0.1,
-      maxTokens: 4096,
-      operation: "contradiction-judge"
-    });
-    return result?.content ?? "";
-  }
-  if ("complete" in client && typeof client.complete === "function") {
-    const result = await client.complete(messages);
-    return result.content ?? "";
-  }
-  return "";
-}
-function parseJudgeResponse(candidates, inputs) {
-  const VALID_VERDICTS = ["contradicts", "independent", "duplicates", "needs-user"];
-  for (const candidate of candidates) {
-    try {
-      const parsed = JSON.parse(candidate);
-      const items = Array.isArray(parsed) ? parsed : [parsed];
-      const results = [];
-      const matchedKeys = /* @__PURE__ */ new Set();
-      for (const item of items) {
-        if (!item || typeof item !== "object") continue;
-        const verdict = typeof item.verdict === "string" && VALID_VERDICTS.includes(item.verdict) ? item.verdict : "needs-user";
-        const pairKeyVal = typeof item.pairKey === "string" && item.pairKey.length > 0 ? item.pairKey : null;
-        const input = pairKeyVal ? inputs.find((p) => pairKey(p.memoryIdA, p.memoryIdB) === pairKeyVal) : null;
-        if (!input) continue;
-        matchedKeys.add(pairKey(input.memoryIdA, input.memoryIdB));
-        const confidence = typeof item.confidence === "number" ? Math.min(1, Math.max(0, item.confidence)) : 0.5;
-        results.push({
-          memoryIdA: input.memoryIdA,
-          memoryIdB: input.memoryIdB,
-          verdict,
-          rationale: typeof item.rationale === "string" ? item.rationale : "No rationale provided",
-          confidence
-        });
-      }
-      for (const inp of inputs) {
-        const key = pairKey(inp.memoryIdA, inp.memoryIdB);
-        if (!matchedKeys.has(key)) {
-          results.push({
-            memoryIdA: inp.memoryIdA,
-            memoryIdB: inp.memoryIdB,
-            verdict: "needs-user",
-            rationale: "LLM response omitted this pair",
-            confidence: 0
-          });
-        }
-      }
-      if (results.length > 0) return results;
-    } catch {
-      continue;
-    }
-  }
-  return inputs.map((p) => ({
-    memoryIdA: p.memoryIdA,
-    memoryIdB: p.memoryIdB,
-    verdict: "needs-user",
-    rationale: "Failed to parse judge response",
-    confidence: 0
-  }));
-}
-
-// ../remnic-core/src/contradiction/contradiction-scan.ts
-var ACTIVE_STATUSES = /* @__PURE__ */ new Set(["active"]);
-var SCAN_CATEGORIES = /* @__PURE__ */ new Set([
-  "decision",
-  "principle",
-  "rule",
-  "entity",
-  "fact",
-  "preference"
-]);
-async function runContradictionScan(deps) {
-  const startTime = Date.now();
-  const { config, memoryDir, embeddingLookup, embeddingLookupFactory, localLlm, fallbackLlm } = deps;
-  const requestedNamespace = normalizeScanNamespace(deps.namespace);
-  const scanConfig = config.contradictionScan;
-  if (!scanConfig.enabled) {
-    log.info("[contradiction-scan] disabled by config");
-    return { scanned: 0, candidates: 0, judged: 0, queued: 0, cooledDown: 0, elapsedMs: 0 };
-  }
-  const { storage: scanStorage, namespace } = await resolveScanStorage(deps, requestedNamespace);
-  if (config.namespacesEnabled && namespace !== void 0 && isDefaultNamespaceScan(config, requestedNamespace, namespace)) {
-    const migrated = migrateUnscopedPairsToNamespace(memoryDir, namespace, { cooldownDays: scanConfig.cooldownDays });
-    if (migrated > 0) {
-      log.info("[contradiction-scan] migrated %d legacy unscoped review pairs to namespace %s", migrated, namespace);
-    }
-  }
-  const scopedEmbeddingLookup = embeddingLookupFactory ? embeddingLookupFactory(scanStorage) : embeddingLookup;
-  const memories = await loadEligibleMemories(scanStorage);
-  log.info("[contradiction-scan] loaded %d eligible memories", memories.length);
-  if (memories.length < 2) {
-    return { scanned: memories.length, candidates: 0, judged: 0, queued: 0, cooledDown: 0, elapsedMs: Date.now() - startTime };
-  }
-  const existingPairs = listPairs(memoryDir, { filter: "all", namespace, limit: 1e4 }).pairs;
-  const existingMap = /* @__PURE__ */ new Map();
-  for (const p of existingPairs) {
-    existingMap.set(p.pairId, p);
-  }
-  const candidates = await generatePairs(memories, existingMap, scanConfig, namespace, scopedEmbeddingLookup);
-  const cooledDown = candidates.skipped;
-  log.info("[contradiction-scan] generated %d candidates (%d cooled down)", candidates.pairs.length, cooledDown);
-  if (candidates.pairs.length === 0) {
-    return {
-      scanned: memories.length,
-      candidates: 0,
-      judged: 0,
-      queued: 0,
-      cooledDown,
-      elapsedMs: Date.now() - startTime
-    };
-  }
-  const judgeInputs = candidates.pairs.map((pair) => ({
-    memoryIdA: pair.idA,
-    memoryIdB: pair.idB,
-    textA: pair.textA,
-    textB: pair.textB,
-    categoryA: pair.categoryA,
-    categoryB: pair.categoryB
-  }));
-  const scanCache = /* @__PURE__ */ new Map();
-  const judgeResult = await judgeContradictionPairs(judgeInputs, config, localLlm, fallbackLlm, scanCache);
-  log.info("[contradiction-scan] judge completed: %d judged, %d cached in %dms", judgeResult.judged, judgeResult.cached, judgeResult.elapsed);
-  const queueEntries = [];
-  const currentMemoryHashes = memoryContentHashMap(memories);
-  for (const [key, result] of judgeResult.results) {
-    queueEntries.push({
-      memoryIds: [result.memoryIdA, result.memoryIdB],
-      verdict: result.verdict,
-      rationale: result.rationale,
-      confidence: result.confidence,
-      detectedAt: (/* @__PURE__ */ new Date()).toISOString(),
-      // Set lastReviewedAt for non-actionable verdicts so cooldown prevents re-judging
-      lastReviewedAt: result.verdict === "independent" ? (/* @__PURE__ */ new Date()).toISOString() : void 0,
-      memoryContentHashes: pairMemoryContentHashes(result.memoryIdA, result.memoryIdB, currentMemoryHashes),
-      namespace
-    });
-  }
-  const written = writePairs(memoryDir, queueEntries, { cooldownDays: scanConfig.cooldownDays });
-  const elapsed = Date.now() - startTime;
-  log.info("[contradiction-scan] complete: %d queued in %dms", written.length, elapsed);
-  return {
-    scanned: memories.length,
-    candidates: candidates.pairs.length,
-    judged: judgeResult.judged,
-    queued: written.length,
-    cooledDown,
-    elapsedMs: elapsed
-  };
-}
-async function generatePairs(memories, existingPairs, scanConfig, namespace, embeddingLookup) {
-  const pairs = [];
-  let skipped = 0;
-  const seen = /* @__PURE__ */ new Set();
-  const maxPairs = Math.max(0, Math.floor(scanConfig.maxPairsPerRun));
-  if (maxPairs === 0) return { pairs, skipped };
-  const orderedMemories = [...memories].sort(compareMemoryId);
-  const currentMemoryHashes = memoryContentHashMap(orderedMemories);
-  const pushCandidate = (pair) => {
-    if (pairs.length < maxPairs) pairs.push(pair);
-  };
-  const hasCapacity = () => pairs.length < maxPairs;
-  const isSkippedByCooldown = (existing) => {
-    if (!existing || !isCoolingDown(existing, scanConfig.cooldownDays)) return false;
-    return !memoryHashesChanged("", existing, (memoryId) => currentMemoryHashes.get(memoryId) ?? null);
-  };
-  const byEntity = /* @__PURE__ */ new Map();
-  for (const mem of orderedMemories) {
-    const entity = mem.frontmatter.entityRef;
-    if (entity) {
-      const existing = byEntity.get(entity) ?? [];
-      existing.push(mem);
-      byEntity.set(entity, existing);
-    }
-  }
-  entityPairs:
-    for (const entity of [...byEntity.keys()].sort()) {
-      const group = byEntity.get(entity) ?? [];
-      if (group.length < 2) continue;
-      for (let i = 0; i < group.length; i++) {
-        for (let j = i + 1; j < group.length; j++) {
-          if (!hasCapacity()) break entityPairs;
-          const a = group[i];
-          const b = group[j];
-          const pairId = computePairId(a.frontmatter.id, b.frontmatter.id, namespace);
-          if (seen.has(pairId)) continue;
-          seen.add(pairId);
-          const existing = existingPairs.get(pairId);
-          if (isSkippedByCooldown(existing)) {
-            skipped++;
-            continue;
-          }
-          pushCandidate({
-            idA: a.frontmatter.id,
-            idB: b.frontmatter.id,
-            textA: a.content,
-            textB: b.content,
-            categoryA: a.frontmatter.category,
-            categoryB: b.frontmatter.category
-          });
-        }
-      }
-    }
-  const noEntity = orderedMemories.filter((m) => !m.frontmatter.entityRef);
-  topicPairs:
-    for (let i = 0; i < noEntity.length; i++) {
-      for (let j = i + 1; j < noEntity.length; j++) {
-        if (!hasCapacity()) break topicPairs;
-        const a = noEntity[i];
-        const b = noEntity[j];
-        const overlap = jaccardOverlap(
-          a.frontmatter.tags ?? [],
-          b.frontmatter.tags ?? []
-        );
-        if (overlap < scanConfig.topicOverlapFloor) continue;
-        const pairId = computePairId(a.frontmatter.id, b.frontmatter.id, namespace);
-        if (seen.has(pairId)) continue;
-        seen.add(pairId);
-        const existing = existingPairs.get(pairId);
-        if (isSkippedByCooldown(existing)) {
-          skipped++;
-          continue;
-        }
-        pushCandidate({
-          idA: a.frontmatter.id,
-          idB: b.frontmatter.id,
-          textA: a.content,
-          textB: b.content,
-          categoryA: a.frontmatter.category,
-          categoryB: b.frontmatter.category
-        });
-      }
-    }
-  if (embeddingLookup && hasCapacity()) {
-    const memoryById = new Map(orderedMemories.map((m) => [m.frontmatter.id, m]));
-    embeddingPairs:
-      for (const mem of orderedMemories) {
-        if (!hasCapacity()) break;
-        const id = mem.frontmatter.id;
-        try {
-          const hits = (await embeddingLookup(mem.content, 20)).sort(
-            (a, b) => b.score - a.score || a.id.localeCompare(b.id)
-          );
-          for (const hit of hits) {
-            if (!hasCapacity()) break embeddingPairs;
-            if (hit.score < scanConfig.similarityFloor) continue;
-            if (hit.id === id) continue;
-            const peer = memoryById.get(hit.id);
-            if (!peer) continue;
-            const pairId = computePairId(id, hit.id, namespace);
-            if (seen.has(pairId)) continue;
-            seen.add(pairId);
-            const existing = existingPairs.get(pairId);
-            if (isSkippedByCooldown(existing)) {
-              skipped++;
-              continue;
-            }
-            pushCandidate({
-              idA: id,
-              idB: hit.id,
-              textA: mem.content,
-              textB: peer.content,
-              categoryA: mem.frontmatter.category,
-              categoryB: peer.frontmatter.category
-            });
-          }
-        } catch {
-        }
-      }
-  }
-  return { pairs, skipped };
-}
-function normalizeScanNamespace(namespace) {
-  const trimmed = namespace?.trim();
-  return trimmed ? trimmed : void 0;
-}
-async function resolveScanStorage(deps, namespace) {
-  if (!deps.config.namespacesEnabled) {
-    const defaultNamespace = normalizeScanNamespace(deps.config.defaultNamespace);
-    if (namespace && namespace !== defaultNamespace) {
-      throw new Error(`unsupported namespace: ${namespace}`);
-    }
-    return { storage: deps.storage, namespace: void 0 };
-  }
-  if (deps.storageForNamespace) {
-    const resolved = await deps.storageForNamespace(namespace);
-    if (isScanStorageResolution(resolved)) {
-      return {
-        storage: resolved.storage,
-        namespace: normalizeScanNamespace(resolved.namespace) ?? fallbackResolvedNamespace(deps, namespace)
-      };
-    }
-    if (!isStorageManagerLike(resolved)) {
-      throw new Error("storageForNamespace must return a StorageManager or { storage: StorageManager, namespace?: string }");
-    }
-    return {
-      storage: resolved,
-      namespace: fallbackResolvedNamespace(deps, namespace)
-    };
-  }
-  throw new Error(
-    "contradiction scans require storageForNamespace when namespaces are enabled so callers can enforce namespace access"
-  );
-}
-function isScanStorageResolution(value) {
-  if (isStorageManagerLike(value)) return false;
-  if (typeof value !== "object" || value === null) return false;
-  const candidate = value;
-  return isStorageManagerLike(candidate.storage);
-}
-function isStorageManagerLike(value) {
-  if (typeof value !== "object" || value === null) return false;
-  const candidate = value;
-  return typeof candidate.readAllMemories === "function";
-}
-function fallbackResolvedNamespace(deps, namespace) {
-  if (namespace) return namespace;
-  return deps.config.namespacesEnabled ? deps.config.defaultNamespace : void 0;
-}
-function isDefaultNamespaceScan(config, requestedNamespace, resolvedNamespace) {
-  if (requestedNamespace === void 0) return true;
-  return requestedNamespace === config.defaultNamespace || resolvedNamespace === config.defaultNamespace;
-}
-async function loadEligibleMemories(storage) {
-  let all;
-  try {
-    all = await storage.readAllMemories();
-  } catch {
-    return [];
-  }
-  return all.filter((mem) => {
-    const fm = mem.frontmatter;
-    const status = fm.status ?? "active";
-    if (!ACTIVE_STATUSES.has(status)) return false;
-    const category = fm.category;
-    if (category && !SCAN_CATEGORIES.has(category)) return false;
-    if (!mem.content || mem.content.trim().length === 0) return false;
-    if (!fm.id) return false;
-    return true;
-  });
-}
-function jaccardOverlap(a, b) {
-  if (a.length === 0 && b.length === 0) return 0;
-  const setA = new Set(a.map((t) => t.toLowerCase()));
-  const setB = new Set(b.map((t) => t.toLowerCase()));
-  let intersection = 0;
-  for (const item of setA) {
-    if (setB.has(item)) intersection++;
-  }
-  const union = setA.size + setB.size - intersection;
-  return union === 0 ? 0 : intersection / union;
-}
-function compareMemoryId(a, b) {
-  return (a.frontmatter.id ?? "").localeCompare(b.frontmatter.id ?? "");
-}
-function memoryContentHashMap(memories) {
-  const hashes = /* @__PURE__ */ new Map();
-  for (const memory of memories) {
-    const id = memory.frontmatter.id;
-    if (!id) continue;
-    hashes.set(id, computeMemoryContentHash(memory.content, memory.frontmatter.category));
-  }
-  return hashes;
-}
-function pairMemoryContentHashes(memoryIdA, memoryIdB, currentMemoryHashes) {
-  const hashA = currentMemoryHashes.get(memoryIdA);
-  const hashB = currentMemoryHashes.get(memoryIdB);
-  if (!hashA || !hashB) return void 0;
-  return {
-    [memoryIdA]: hashA,
-    [memoryIdB]: hashB
-  };
-}
-
-export {
-  ACTIVE_STATUSES,
-  runContradictionScan
-};