@remnic/core 9.54.4 → 9.54.5

package/dist/{chunk-HWRD23DW.js → chunk-LVKYLMSM.js}

@@ -3,14 +3,14 @@ import {
 } from "./chunk-KJTKLXTH.js";
 import {
   StorageManager
-} from "./chunk-6R4G7N4S.js";
+} from "./chunk-QQXWFDRD.js";
 import {
   copyExistingFileToBackup,
   writeFileAtomically
 } from "./chunk-AW4QUFQF.js";
 import {
   assertInjectedStorageRooted
-} from "./chunk-7FGL6CGA.js";
+} from "./chunk-DVYRD4HY.js";
 import {
   MEMORY_LIFECYCLE_LEDGER_LOCK_STALE_MS,
   buildLifecycleEventsForMemory,
@@ -260,4 +260,4 @@ export {
   backupExistingLedger,
   rebuildMemoryLifecycleLedger
 };
-//# sourceMappingURL=chunk-HWRD23DW.js.map
+//# sourceMappingURL=chunk-LVKYLMSM.js.map

package/dist/{chunk-RUMNY5DT.js → chunk-MRGJZ75M.js}

@@ -2,11 +2,14 @@ import {
   buildExplicitCaptureDedupKey,
   isTombstoneBlockedCaptureWriteLockBusy,
   normalizeExplicitCaptureContent
-} from "./chunk-K4QS7LXU.js";
+} from "./chunk-WZWZRZ2V.js";
 import {
   TAG_LIMITS,
   composeMemoryEnvelope
 } from "./chunk-NSVDUN76.js";
+import {
+  isSupportPassportPrivateMemory
+} from "./chunk-HNDIND7P.js";
 import {
   sanitizeMemoryContent
 } from "./chunk-5GKPFL3S.js";
@@ -371,6 +374,7 @@ async function findDuplicateExplicitCapture(orchestrator, resolvedNamespace, can
   const existing = [...hotMemories, ...coldMemories];
   const normalizedCandidate = normalizeExplicitCaptureContent(candidate.content);
   const match = existing.find((memory) => {
+    if (isSupportPassportPrivateMemory(memory)) return false;
     const status = memory.frontmatter.status ?? "active";
     if (status !== "active" && (status !== "pending_review" || !memory.frontmatter.blockedBy)) {
       return false;
@@ -783,4 +787,4 @@ export {
   shouldProcessInlineExplicitCapture,
   InlineExplicitCaptureProcessor
 };
-//# sourceMappingURL=chunk-RUMNY5DT.js.map
+//# sourceMappingURL=chunk-MRGJZ75M.js.map

package/dist/chunk-MRGJZ75M.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/explicit-capture.ts"],"sourcesContent":["import { composeMemoryEnvelope, TAG_LIMITS } from \"./write-envelope.js\";\nimport { resolveNamespaceCapabilities } from \"./capabilities.js\";\nimport { createHash, randomUUID } from \"node:crypto\";\nimport type { Orchestrator } from \"./orchestrator.js\";\nimport { log } from \"./logger.js\";\nimport { isSafeRouteNamespace } from \"./routing/engine.js\";\nimport { sanitizeMemoryContent } from \"./sanitize.js\";\nimport type { CaptureMode, MemoryCategory, MemoryLifecycleEvent, PluginConfig } from \"./types.js\";\nimport {\n  buildExplicitCaptureDedupKey,\n  isTombstoneBlockedCaptureWriteLockBusy,\n  normalizeExplicitCaptureContent,\n} from \"./storage/tombstone-blocked-capture-index.js\";\nimport type { StorageManager } from \"./storage.js\";\nimport { isSupportPassportPrivateMemory } from \"./support-passport/card-projection.js\";\n\nexport type ExplicitCaptureInput = {\n  content: string;\n  category?: string;\n  confidence?: number;\n  namespace?: string;\n  tags?: string[];\n  entityRef?: string;\n  sourceConnector?: string;\n  ttl?: string;\n  sourceReason?: string;\n};\n\nexport type ValidExplicitCapture = {\n  content: string;\n  category: MemoryCategory;\n  confidence: number;\n  namespace?: string;\n  tags: string[];\n  entityRef?: string;\n  sourceConnector?: string;\n  expiresAt?: string;\n  sourceReason?: string;\n  /**\n   * When true, `namespace` was already resolved AND authorized by the caller\n   * (the access service's `resolveCodingScopedWriteNamespace`, which auth-checks\n   * the base and derives a session-owned `project-*` overlay). The persist /\n   * queue layer then routes to it directly instead of re-validating against the\n   * static policy allow-list — which would otherwise reject legitimately-derived\n   * dynamic project namespaces (#1434). Callers that do NOT pre-authorize the\n   * namespace must leave this unset so the allow-list guard still applies.\n   */\n  namespacePreResolved?: boolean;\n};\n\nexport type ExplicitCaptureSource = \"memory_store\" | \"memory_capture\" | \"suggestion_submit\" | \"inline\";\ntype ExplicitCaptureValidationMode = \"legacy_tool\" | \"strict_explicit\";\n\n// Bounded body {0,100000} instead of an unbounded lazy *? so scanning for the\n// closing tag cannot backtrack polynomially on unterminated <memory_note>\n// markup in hostile turn text (CodeQL js/polynomial-redos). 100 000 chars far\n// exceeds any real inline note, so matching is behavior-preserving; the outer\n// \\s* groups were also dropped (body absorbs whitespace; captures are trimmed).\nconst INLINE_NOTE_RE = /<memory_note>([\\s\\S]{0,100000}?)<\\/memory_note>/gi;\nconst INLINE_NOTE_MARKUP_RE = /<memory_note>[\\s\\S]{0,100000}?<\\/memory_note>/i;\nconst INLINE_ALLOWED_CATEGORIES = new Set<MemoryCategory>([\n  \"fact\",\n  \"preference\",\n  \"correction\",\n  \"entity\",\n  \"decision\",\n  \"relationship\",\n  \"principle\",\n  \"commitment\",\n  \"moment\",\n  \"skill\",\n  \"rule\",\n  \"procedure\",\n  \"reasoning_trace\",\n]);\n\nconst SECRET_PATTERNS: RegExp[] = [\n  /\\bsk-[A-Za-z0-9]{16,}\\b/,\n  /\\bAKIA[0-9A-Z]{16}\\b/,\n  /\\bBearer\\s+[A-Za-z0-9._-]{16,}\\b/i,\n  /\\b(?:api[_-]?key|secret|token|password|passwd)\\s*[:=]\\s*[^\\s]{8,}\\b/i,\n  /\\b(?:authorization)\\s*:\\s*[^\\s]{8,}\\b/i,\n];\nconst SECRET_REDACTION_PATTERNS: Array<{ pattern: RegExp; replacement: string }> = [\n  { pattern: /\\bsk-[A-Za-z0-9]{16,}\\b/g, replacement: \"[redacted openai key]\" },\n  { pattern: /\\bAKIA[0-9A-Z]{16}\\b/g, replacement: \"[redacted aws key]\" },\n  { pattern: /\\bBearer\\s+[A-Za-z0-9._-]{16,}\\b/gi, replacement: \"Bearer [redacted token]\" },\n  {\n    pattern: /\\b(?:api[_-]?key|secret|token|password|passwd)\\s*[:=]\\s*[^\\s]{8,}\\b/gi,\n    replacement: \"[redacted credential]\",\n  },\n  {\n    pattern: /\\b(?:authorization)\\s*:\\s*[^\\s]{8,}\\b/gi,\n    replacement: \"authorization: [redacted credential]\",\n  },\n];\nconst EXPLICIT_CAPTURE_REVIEW_TAGS = [\"explicit-capture\", \"queued-review\"];\n\nfunction explicitCaptureActor(source: ExplicitCaptureSource): string {\n  switch (source) {\n    case \"inline\":\n      return \"inline.memory_note\";\n    case \"memory_store\":\n      return \"tool.memory_store\";\n    case \"suggestion_submit\":\n      return \"tool.suggestion_submit\";\n    default:\n      return \"tool.memory_capture\";\n  }\n}\n\nfunction asTrimmed(value: string | undefined): string | undefined {\n  const trimmed = value?.trim();\n  return trimmed && trimmed.length > 0 ? trimmed : undefined;\n}\n\nfunction redactSecrets(value: string): string {\n  let redacted = value;\n  for (const { pattern, replacement } of SECRET_REDACTION_PATTERNS) {\n    redacted = redacted.replace(pattern, replacement);\n  }\n  return redacted;\n}\n\nfunction containsSecretLikeValue(value: string): boolean {\n  return SECRET_PATTERNS.some((pattern) => pattern.test(value));\n}\n\nfunction assertNoSecretLikeMetadata(field: string, value: string | undefined): void {\n  const trimmed = asTrimmed(value);\n  if (trimmed && containsSecretLikeValue(trimmed)) {\n    throw new Error(`${field} appears to contain a secret or credential`);\n  }\n}\n\nfunction assertNoSecretLikeMetadataList(field: string, values: string[] | undefined): void {\n  for (const value of values ?? []) {\n    assertNoSecretLikeMetadata(field, value);\n  }\n}\n\nfunction sanitizeReviewText(value: string | undefined, fallback: string): string {\n  const redacted = redactSecrets(asTrimmed(value) ?? fallback);\n  const sanitized = sanitizeMemoryContent(redacted);\n  const safe = sanitized.text.trim();\n  return safe.length > 0 ? safe : fallback;\n}\n\nfunction sanitizeReviewMetadata(value: string | undefined): string | undefined {\n  const trimmed = asTrimmed(value);\n  if (!trimmed) return undefined;\n  return sanitizeReviewText(trimmed, \"[redacted]\");\n}\n\nfunction sanitizeReviewTags(tags: string[] | undefined): string[] {\n  return Array.from(\n    new Set(\n      (tags ?? [])\n        .map((tag) => sanitizeReviewMetadata(tag))\n        .filter((tag): tag is string => typeof tag === \"string\" && tag.length > 0)\n    )\n  );\n}\n\nfunction normalizeExplicitCaptureError(error: unknown): string {\n  if (error instanceof Error && error.message.trim().length > 0) return error.message.trim();\n  const rendered = String(error).trim();\n  return rendered.length > 0 ? rendered : \"explicit capture failed\";\n}\n\nfunction isUnsupportedExplicitCaptureNamespaceError(error: unknown): boolean {\n  return normalizeExplicitCaptureError(error).startsWith(\"unsupported namespace:\");\n}\n\nfunction resolveExplicitCaptureReviewNamespace(\n  orchestrator: Orchestrator,\n  namespace: string | undefined\n): string | undefined {\n  const normalized = asTrimmed(namespace);\n  if (!normalized) return undefined;\n  return resolveExplicitCaptureNamespace(orchestrator, normalized);\n}\n\nfunction resolveExplicitCaptureNamespace(\n  orchestrator: Orchestrator,\n  namespace: string | undefined\n): string | undefined {\n  const normalized = asTrimmed(namespace);\n  if (!normalized) return undefined;\n  if (!resolveNamespaceCapabilities(orchestrator.config).namespaces) {\n    if (normalized !== orchestrator.config.defaultNamespace) {\n      throw new Error(`unsupported namespace: ${normalized}`);\n    }\n    return normalized;\n  }\n  const allowed = new Set(\n    [\n      orchestrator.config.defaultNamespace,\n      orchestrator.config.sharedNamespace,\n      ...orchestrator.config.namespacePolicies.map((policy) => policy.name),\n    ]\n      .map((value) => value.trim())\n      .filter(Boolean)\n  );\n  if (!allowed.has(normalized)) {\n    throw new Error(`unsupported namespace: ${normalized}`);\n  }\n  return normalized;\n}\n\nfunction parseExplicitCaptureTtl(ttl: string | undefined): string | undefined {\n  const raw = asTrimmed(ttl);\n  if (!raw) return undefined;\n\n  const absoluteMs = Date.parse(raw);\n  if (Number.isFinite(absoluteMs)) {\n    return new Date(absoluteMs).toISOString();\n  }\n\n  const relative = raw.match(/^(\\d+)\\s*([mhdw])$/i);\n  if (!relative) {\n    throw new Error(\"ttl must be an ISO-8601 timestamp or relative duration like 30m, 12h, 7d, or 2w\");\n  }\n\n  const amount = Number.parseInt(relative[1] ?? \"\", 10);\n  const unit = (relative[2] ?? \"\").toLowerCase();\n  if (!Number.isFinite(amount) || amount <= 0) {\n    throw new Error(\"ttl duration must be a positive integer\");\n  }\n\n  const multiplier =\n    unit === \"m\" ? 60_000 : unit === \"h\" ? 60 * 60_000 : unit === \"d\" ? 24 * 60 * 60_000 : 7 * 24 * 60 * 60_000;\n  return new Date(Date.now() + amount * multiplier).toISOString();\n}\n\nfunction parseInlineConfidence(value: string): number {\n  const trimmed = value.trim();\n  if (!/^[+-]?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i.test(trimmed)) {\n    return Number.NaN;\n  }\n  const parsed = Number(trimmed);\n  return Number.isFinite(parsed) ? parsed : Number.NaN;\n}\n\nfunction parseInlineNote(block: string): ExplicitCaptureInput {\n  const lines = block.replace(/\\r/g, \"\").split(\"\\n\");\n  const note: Partial<ExplicitCaptureInput> = {};\n  let idx = 0;\n\n  while (idx < lines.length) {\n    const rawLine = lines[idx] ?? \"\";\n    const line = rawLine.trim();\n    idx += 1;\n    if (line.length === 0) continue;\n    const colonIdx = line.indexOf(\":\");\n    if (colonIdx < 0) continue;\n    const key = line.slice(0, colonIdx).trim();\n    const value = line.slice(colonIdx + 1).trim();\n\n    if (key === \"content\" && value === \"|\") {\n      const contentLines: string[] = [];\n      while (idx < lines.length) {\n        const next = lines[idx] ?? \"\";\n        if (next.startsWith(\"  \") || next.startsWith(\"\\t\")) {\n          contentLines.push(next.replace(/^(  |\\t)/, \"\"));\n          idx += 1;\n          continue;\n        }\n        if (next.trim().length === 0) {\n          contentLines.push(\"\");\n          idx += 1;\n          continue;\n        }\n        break;\n      }\n      note.content = contentLines.join(\"\\n\").trim();\n      continue;\n    }\n\n    switch (key) {\n      case \"content\":\n        note.content = value;\n        break;\n      case \"category\":\n        note.category = value;\n        break;\n      case \"confidence\":\n        note.confidence = parseInlineConfidence(value);\n        break;\n      case \"namespace\":\n        note.namespace = value;\n        break;\n      case \"tags\":\n        note.tags = value\n          .split(\",\")\n          .map((entry) => entry.trim())\n          .filter(Boolean);\n        break;\n      case \"entityRef\":\n        note.entityRef = value;\n        break;\n      case \"ttl\":\n        note.ttl = value;\n        break;\n      case \"sourceReason\":\n        note.sourceReason = value;\n        break;\n      default:\n        break;\n    }\n  }\n\n  return { content: \"\", ...note };\n}\n\nfunction parseInlineExplicitCaptureCandidates(text: string): ExplicitCaptureInput[] {\n  const notes: ExplicitCaptureInput[] = [];\n  for (const match of text.matchAll(INLINE_NOTE_RE)) {\n    notes.push(parseInlineNote(match[1] ?? \"\"));\n  }\n  return notes;\n}\n\nexport function parseInlineExplicitCaptureNotes(text: string): ExplicitCaptureInput[] {\n  return parseInlineExplicitCaptureCandidates(text).filter((note) => asTrimmed(note.content));\n}\n\nexport function hasInlineExplicitCaptureMarkup(text: string): boolean {\n  return INLINE_NOTE_MARKUP_RE.test(text);\n}\n\nexport function stripInlineExplicitCaptureNotes(text: string): string {\n  return text.replace(INLINE_NOTE_RE, \"\").trim();\n}\n\nexport function validateExplicitCaptureInput(\n  input: ExplicitCaptureInput,\n  mode: ExplicitCaptureValidationMode = \"strict_explicit\"\n): ValidExplicitCapture {\n  const content = asTrimmed(input.content);\n  if (!content) throw new Error(\"content is required\");\n  if (mode === \"strict_explicit\") {\n    if (content.length < 10) throw new Error(\"content must be at least 10 characters\");\n    if (content.length > 4000) throw new Error(\"content must be 4000 characters or fewer\");\n  }\n  if (/<memory_note>/i.test(content) || /<\\/memory_note>/i.test(content)) {\n    throw new Error(\"nested memory_note blocks are not allowed\");\n  }\n\n  const category = (asTrimmed(input.category) ?? \"fact\") as MemoryCategory;\n  if (!INLINE_ALLOWED_CATEGORIES.has(category)) {\n    throw new Error(`unsupported category: ${input.category ?? category}`);\n  }\n\n  const sanitized = sanitizeMemoryContent(content);\n  if (!sanitized.clean) {\n    throw new Error(\"content failed memory sanitization\");\n  }\n  for (const pattern of SECRET_PATTERNS) {\n    if (pattern.test(content)) {\n      throw new Error(\"content appears to contain a secret or credential\");\n    }\n  }\n  assertNoSecretLikeMetadata(\"sourceReason\", input.sourceReason);\n  assertNoSecretLikeMetadata(\"entityRef\", input.entityRef);\n  assertNoSecretLikeMetadata(\"ttl\", input.ttl);\n  assertNoSecretLikeMetadataList(\"tags\", input.tags);\n\n  if (input.confidence !== undefined && !Number.isFinite(input.confidence)) {\n    throw new Error(\"confidence must be a finite number\");\n  }\n  const confidence = input.confidence === undefined ? 0.95 : Number(input.confidence);\n  if (confidence < 0 || confidence > 1) {\n    throw new Error(\"confidence must be between 0 and 1\");\n  }\n  const requestedNamespace = asTrimmed(input.namespace);\n  if (requestedNamespace && !isSafeRouteNamespace(requestedNamespace)) {\n    throw new Error(`unsafe namespace: ${requestedNamespace}`);\n  }\n  const expiresAt = parseExplicitCaptureTtl(input.ttl);\n\n  // #2014 review round: enforce the composer's tag contract HERE so a capture\n  // that passes validation can never fail later at strict compose time\n  // (validated-then-thrown was a broken contract). Same limits as TAG_LIMITS.\n  const dedupedTags = Array.from(new Set((input.tags ?? []).map((tag) => tag.trim()).filter(Boolean)));\n  if (dedupedTags.length > TAG_LIMITS.maxTags) {\n    throw new Error(`too many tags: ${dedupedTags.length} exceeds the ${TAG_LIMITS.maxTags}-tag limit`);\n  }\n  for (const tag of dedupedTags) {\n    if (tag.length > TAG_LIMITS.maxTagLength) {\n      throw new Error(`tag exceeds ${TAG_LIMITS.maxTagLength} characters: ${JSON.stringify(tag.slice(0, 40))}…`);\n    }\n  }\n\n  return {\n    content,\n    category,\n    confidence,\n    namespace: asTrimmed(input.namespace),\n    tags: dedupedTags,\n    entityRef: asTrimmed(input.entityRef),\n    sourceReason: asTrimmed(input.sourceReason),\n    // Trimmed like the other optional metadata (#2017 review round): a\n    // whitespace-only connector previously passed validation and then blew\n    // up at strict compose time - validated input must always compose.\n    sourceConnector: asTrimmed(input.sourceConnector),\n    expiresAt,\n  };\n}\n\nasync function findDuplicateExplicitCapture(\n  orchestrator: Orchestrator,\n  resolvedNamespace: string | undefined,\n  candidate: ValidExplicitCapture,\n  storageOverride?: StorageManager\n): Promise<{ id: string; tombstoneBlocked: boolean } | null> {\n  const storage = storageOverride ?? (await orchestrator.getStorage(resolvedNamespace));\n  // Tombstone-blocked rows are absent from the active fact hash index. An\n  // authoritative miss can therefore skip the corpus scan only after the\n  // targeted blocked-row index reports a miss and remains authoritative.\n  let authoritativeFactHashMiss = false;\n  if (candidate.category === \"fact\" && typeof storage.hasFactContentHash === \"function\") {\n    try {\n      const hasHash = await storage.hasFactContentHash(candidate.content);\n      if (!hasHash) {\n        const authoritative =\n          typeof storage.isFactContentHashAuthoritative === \"function\"\n            ? await storage.isFactContentHashAuthoritative()\n            : false;\n        authoritativeFactHashMiss = authoritative;\n      }\n    } catch (err) {\n      // Fail open: hash indexes are only an optimization, so fall back to the\n      // full corpus scan when either index cannot answer.\n      void err;\n    }\n  }\n  if (authoritativeFactHashMiss) {\n    const checkBlockedIndex = storage.checkTombstoneBlockedExplicitCapture;\n    if (typeof checkBlockedIndex === \"function\") {\n      try {\n        const result = await checkBlockedIndex.call(\n          storage,\n          candidate.content,\n          candidate.category,\n          candidate.sourceConnector\n        );\n        if (!result.has && result.authoritative) return null;\n      } catch (err) {\n        // Fail open: an unavailable targeted index must not hide a durable\n        // pending-review duplicate.\n        void err;\n      }\n    } else {\n      const hasBlockedIndex = storage.hasTombstoneBlockedExplicitCapture;\n      if (typeof hasBlockedIndex === \"function\") {\n        try {\n          const hasBlocked = await hasBlockedIndex.call(\n            storage,\n            candidate.content,\n            candidate.category,\n            candidate.sourceConnector\n          );\n          if (!hasBlocked) {\n            const isIndexAuthoritative =\n              typeof storage.isTombstoneBlockedExplicitCaptureIndexAuthoritative === \"function\"\n                ? await storage.isTombstoneBlockedExplicitCaptureIndexAuthoritative()\n                : false;\n            if (isIndexAuthoritative) return null;\n          }\n        } catch (err) {\n          // Fail open: an unavailable targeted index must not hide a durable\n          // pending-review duplicate.\n          void err;\n        }\n      }\n    }\n  }\n  const hotMemories = await storage.readAllMemories();\n  const coldMemories = typeof storage.readAllColdMemories === \"function\" ? await storage.readAllColdMemories() : [];\n  const existing = [...hotMemories, ...coldMemories];\n  const normalizedCandidate = normalizeExplicitCaptureContent(candidate.content);\n  const match = existing.find((memory) => {\n    if (isSupportPassportPrivateMemory(memory)) return false;\n    const status = memory.frontmatter.status ?? \"active\";\n    if (status !== \"active\" && (status !== \"pending_review\" || !memory.frontmatter.blockedBy)) {\n      return false;\n    }\n    if (memory.frontmatter.category !== candidate.category) return false;\n    if (normalizeExplicitCaptureContent(memory.content) !== normalizedCandidate) return false;\n    // Connector-aware dedup: same content from different connectors is NOT\n    // a duplicate. Operator (undefined) and connector-tagged memories are\n    // always distinct. Normalize empty strings to undefined.\n    const existingConnector = memory.frontmatter.sourceConnector?.trim() || undefined;\n    const newConnector = candidate.sourceConnector?.trim() || undefined;\n    if (existingConnector !== newConnector) return false;\n    return true;\n  });\n  return match\n    ? {\n        id: match.frontmatter.id,\n        tombstoneBlocked: match.frontmatter.status === \"pending_review\" && Boolean(match.frontmatter.blockedBy),\n      }\n    : null;\n}\nasync function persistExplicitCaptureUnlocked(\n  orchestrator: Orchestrator,\n  candidate: ValidExplicitCapture,\n  source: ExplicitCaptureSource,\n  resolvedNamespace: string | undefined,\n  storage: StorageManager\n): Promise<{ id: string; duplicateOf?: string; tombstoneBlocked?: boolean }> {\n  const duplicate = await findDuplicateExplicitCapture(orchestrator, resolvedNamespace, candidate, storage);\n  if (duplicate) {\n    return duplicate.tombstoneBlocked\n      ? { id: duplicate.id, duplicateOf: duplicate.id, tombstoneBlocked: true }\n      : { id: duplicate.id, duplicateOf: duplicate.id };\n  }\n\n  // #1645 (review thread yG-): surface the tombstone block so callers\n  // (memory_store tool, access-service HTTP/MCP) can report the capture as\n  // queued for review instead of a successfully stored active memory.\n  // Sealed-envelope write (issue #1989 PR2).\n  const captureEnvelope = composeMemoryEnvelope(\n    {\n      content: candidate.content,\n      category: candidate.category,\n      confidence: candidate.confidence,\n      tags: candidate.tags,\n      ...(candidate.entityRef ? { entityRef: candidate.entityRef } : {}),\n      ...(candidate.expiresAt ? { ttl: candidate.expiresAt } : {}),\n      ...(candidate.sourceConnector ? { sourceConnector: candidate.sourceConnector } : {}),\n      ...(candidate.sourceReason ? { sourceReason: candidate.sourceReason } : {}),\n    },\n    { source: source === \"inline\" ? \"explicit-inline\" : \"explicit\" }\n  );\n  const { id, duplicateOf, tombstoneBlocked } = await storage.writeSealedMemory(captureEnvelope);\n  if (duplicateOf) return { id, duplicateOf, tombstoneBlocked };\n  // #1522: catalog touch handled at the storage chokepoint — the StorageManager's\n  // post-write hook records the namespace touch automatically.\n\n  const created = new Date().toISOString();\n  const event: MemoryLifecycleEvent = {\n    eventId: `mle-${randomUUID()}`,\n    memoryId: id,\n    eventType: tombstoneBlocked ? \"explicit_capture_queued\" : \"explicit_capture_accepted\",\n    timestamp: created,\n    actor: explicitCaptureActor(source),\n    reasonCode: candidate.sourceReason,\n    ruleVersion: \"explicit-capture.v1\",\n  };\n  await storage.appendMemoryLifecycleEvents([event]);\n\n  return { id, duplicateOf, tombstoneBlocked };\n}\n\nexport async function persistExplicitCapture(\n  orchestrator: Orchestrator,\n  candidate: ValidExplicitCapture,\n  source: ExplicitCaptureSource\n): Promise<{ id: string; duplicateOf?: string; tombstoneBlocked?: boolean }> {\n  const resolvedNamespace = candidate.namespacePreResolved\n    ? asTrimmed(candidate.namespace)\n    : resolveExplicitCaptureNamespace(orchestrator, candidate.namespace);\n  const storage = await orchestrator.getStorage(resolvedNamespace);\n  const persist = () => persistExplicitCaptureUnlocked(orchestrator, candidate, source, resolvedNamespace, storage);\n  if (typeof storage.withTombstoneBlockedCaptureWriteLock !== \"function\") return await persist();\n  const lockIdentity = buildExplicitCaptureDedupKey(candidate.content, candidate.category, candidate.sourceConnector);\n  return await storage.withTombstoneBlockedCaptureWriteLock(persist, lockIdentity);\n}\n\nfunction buildExplicitCaptureReviewContent(input: ExplicitCaptureInput, reason: string): string {\n  const requestedContent = asTrimmed(input.content);\n  const safeContent = sanitizeReviewText(requestedContent, \"[empty explicit capture]\");\n  const safeCategory = sanitizeReviewMetadata(input.category);\n  const safeNamespace = sanitizeReviewMetadata(input.namespace);\n  const safeEntityRef = sanitizeReviewMetadata(input.entityRef);\n  const safeTtl = sanitizeReviewMetadata(input.ttl);\n  const safeSourceReason = sanitizeReviewMetadata(input.sourceReason);\n  const safeTags = sanitizeReviewTags(input.tags);\n  const lines = [\"Explicit capture queued for review.\", \"\", `Reason: ${reason}`, \"\", \"Submitted content:\", safeContent];\n  const metadata = [\n    safeCategory ? `Requested category: ${safeCategory}` : undefined,\n    safeNamespace ? `Requested namespace: ${safeNamespace}` : undefined,\n    safeEntityRef ? `Requested entityRef: ${safeEntityRef}` : undefined,\n    safeTtl ? `Requested ttl: ${safeTtl}` : undefined,\n    safeSourceReason ? `Requested sourceReason: ${safeSourceReason}` : undefined,\n    safeTags.length > 0 ? `Requested tags: ${safeTags.join(\", \")}` : undefined,\n  ].filter((entry): entry is string => typeof entry === \"string\" && entry.length > 0);\n  if (metadata.length > 0) {\n    lines.push(\"\", ...metadata);\n  }\n  return lines.join(\"\\n\");\n}\n\nfunction explicitCaptureReviewNamespaces(\n  orchestrator: Orchestrator,\n  queueNamespace: string | undefined\n): Array<string | undefined> {\n  const config = orchestrator.config;\n  return [asTrimmed(queueNamespace) ?? asTrimmed(config?.defaultNamespace)];\n}\n\nasync function findQueuedExplicitCaptureDuplicate(\n  orchestrator: Orchestrator,\n  namespace: string | undefined,\n  content: string,\n  sourceConnector?: string\n): Promise<string | null> {\n  const storages = Array.from(\n    new Set(\n      await Promise.all(\n        explicitCaptureReviewNamespaces(orchestrator, namespace).map((reviewNamespace) =>\n          orchestrator.getStorage(reviewNamespace)\n        )\n      )\n    )\n  );\n  const memorySets = await Promise.all(\n    storages.map(async (storage) => {\n      const hotMemories = await storage.readAllMemories();\n      const coldMemories = typeof storage.readAllColdMemories === \"function\" ? await storage.readAllColdMemories() : [];\n      return [...hotMemories, ...coldMemories];\n    })\n  );\n  const existing = memorySets.flat();\n  const normalized = normalizeExplicitCaptureContent(content);\n  const match = existing.find((memory) => {\n    const status = memory.frontmatter.status ?? \"active\";\n    if (status !== \"pending_review\") return false;\n    if (!(memory.frontmatter.tags ?? []).includes(\"queued-review\")) return false;\n    if (normalizeExplicitCaptureContent(memory.content) !== normalized) return false;\n    const existingConnector = memory.frontmatter.sourceConnector?.trim() || undefined;\n    const newConnector = sourceConnector?.trim() || undefined;\n    if (existingConnector !== newConnector) return false;\n    return true;\n  });\n  return match?.frontmatter.id ?? null;\n}\n\nexport type ExplicitCaptureReviewQueueOptions = {\n  /** A server-authorized namespace resolved from the authenticated session. */\n  resolvedNamespace?: string;\n};\n\nexport async function queueExplicitCaptureForReview(\n  orchestrator: Orchestrator,\n  input: ExplicitCaptureInput,\n  source: ExplicitCaptureSource,\n  error: unknown,\n  options: ExplicitCaptureReviewQueueOptions = {}\n): Promise<{ id: string; duplicateOf?: string }> {\n  const reason = sanitizeReviewText(normalizeExplicitCaptureError(error), \"explicit capture failed\");\n  const requestedNamespace = asTrimmed(input.namespace);\n  const resolvedNamespace = asTrimmed(options.resolvedNamespace);\n  // A caller-pre-authorized namespace (e.g. a session-owned project overlay\n  // from the access service) routes directly; otherwise apply the static\n  // policy allow-list guard (#1434).\n  const queueNamespace =\n    resolvedNamespace ??\n    ((input as { namespacePreResolved?: boolean }).namespacePreResolved\n      ? requestedNamespace\n      : resolveExplicitCaptureReviewNamespace(orchestrator, requestedNamespace));\n  const content = buildExplicitCaptureReviewContent(input, reason);\n  const requestedCategory = asTrimmed(input.category);\n  const reviewCategory =\n    requestedCategory && INLINE_ALLOWED_CATEGORIES.has(requestedCategory as MemoryCategory)\n      ? (requestedCategory as MemoryCategory)\n      : \"fact\";\n  const requestedTags = sanitizeReviewTags(input.tags);\n  const storage = await orchestrator.getStorage(queueNamespace);\n  const lockIdentity = buildExplicitCaptureDedupKey(content, reviewCategory, input.sourceConnector);\n  const queue = async (): Promise<{ id: string; duplicateOf?: string }> => {\n    const duplicateOf = await findQueuedExplicitCaptureDuplicate(\n      orchestrator,\n      queueNamespace,\n      content,\n      input.sourceConnector\n    );\n    if (duplicateOf) {\n      return { id: duplicateOf, duplicateOf };\n    }\n\n    const reviewEnvelope = composeMemoryEnvelope(\n      {\n        content,\n        category: reviewCategory,\n        confidence: 0.2,\n        tags: Array.from(new Set([...EXPLICIT_CAPTURE_REVIEW_TAGS, ...requestedTags])),\n        ...(sanitizeReviewMetadata(input.entityRef) ? { entityRef: sanitizeReviewMetadata(input.entityRef) } : {}),\n        ...(input.sourceConnector ? { sourceConnector: input.sourceConnector } : {}),\n      },\n      { source: source === \"inline\" ? \"explicit-inline-review\" : \"explicit-review\" },\n      // The review queue is the FALLBACK for a capture that already failed\n      // primary validation — it must never be un-queueable. The tag list is\n      // machine-assembled (requested tags + the two fixed review tags), so 49+\n      // requested tags would push past the 50-tag limit and strict compose\n      // would throw, losing the capture (#2014 review round). Salvage clamps\n      // instead; the fixed review tags sort first in the assembly above, so\n      // they always survive the clamp.\n      { salvage: true }\n    );\n    const { id } = await storage.writeSealedMemory(reviewEnvelope);\n    try {\n      const created = await storage.getMemoryById(id);\n      if (created) {\n        await storage.writeMemoryFrontmatter(\n          created,\n          {\n            status: \"pending_review\",\n            updated: new Date().toISOString(),\n          },\n          {\n            actor: explicitCaptureActor(source),\n            reasonCode: reason,\n            ruleVersion: \"explicit-capture.v1\",\n          }\n        );\n      }\n    } finally {\n      // Record the catalog write touch (issue #1499, round 5/6 codex P2; NIhUg).\n      // A queued review capture writes memory to the namespace's root (the DEFAULT\n      // root when undefined), so its `lastWriteAt` must reflect the write once\n      // `writeMemory` returns an id. If the later pending-review frontmatter update\n      // fails, the memory file is still durable and must not disappear from\n      // writtenSince/maintenance scheduling. Guarded optional hook (rule #33).\n      // #1522: catalog touch handled at the storage chokepoint.\n    }\n    const event: MemoryLifecycleEvent = {\n      eventId: `mle-${randomUUID()}`,\n      memoryId: id,\n      eventType: \"explicit_capture_queued\",\n      timestamp: new Date().toISOString(),\n      actor: explicitCaptureActor(source),\n      reasonCode: reason,\n      ruleVersion: \"explicit-capture.v1\",\n    };\n    await storage.appendMemoryLifecycleEvents([event]);\n    return { id };\n  };\n  if (typeof storage.withTombstoneBlockedCaptureWriteLock !== \"function\") return await queue();\n  return await storage.withTombstoneBlockedCaptureWriteLock(queue, lockIdentity);\n}\n\nexport function shouldSkipImplicitExtraction(cfg: Pick<PluginConfig, \"captureMode\">): boolean {\n  return cfg.captureMode === \"explicit\";\n}\n\nexport function shouldProcessInlineExplicitCapture(cfg: Pick<PluginConfig, \"captureMode\">): boolean {\n  return cfg.captureMode !== \"implicit\";\n}\n\nexport interface InlineExplicitCaptureProcessRequest {\n  content: string;\n  captureMode: CaptureMode;\n  dedupeKeys?: readonly string[];\n  namespace?: string;\n  namespacePreResolved?: boolean;\n  reviewNamespace?: string;\n  reviewNamespacePreResolved?: boolean;\n  sourceConnector?: string;\n}\n\nexport interface InlineExplicitCaptureProcessResult {\n  content: string;\n  processed: number;\n  accepted: number;\n  queued: number;\n  duplicates: number;\n  failed: number;\n}\n\nexport interface InlineExplicitCaptureProcessorOptions {\n  sourceConnector?: string;\n  maxDedupeKeys?: number;\n}\n\nconst DEFAULT_INLINE_CAPTURE_DEDUPE_KEY_LIMIT = 1024;\n\nexport class InlineExplicitCaptureProcessor {\n  private readonly observedKeys = new Set<string>();\n  private readonly observedKeyOrder: string[] = [];\n  private readonly maxDedupeKeys: number;\n  private readonly processingTails = new Map<string, Promise<void>>();\n\n  constructor(\n    private readonly orchestrator: Orchestrator,\n    private readonly options: InlineExplicitCaptureProcessorOptions = {}\n  ) {\n    const requestedLimit = options.maxDedupeKeys ?? DEFAULT_INLINE_CAPTURE_DEDUPE_KEY_LIMIT;\n    this.maxDedupeKeys =\n      Number.isFinite(requestedLimit) && requestedLimit > 0\n        ? Math.max(1, Math.floor(requestedLimit))\n        : DEFAULT_INLINE_CAPTURE_DEDUPE_KEY_LIMIT;\n  }\n\n  private enqueue<T>(key: string, operation: () => Promise<T>): Promise<T> {\n    const previous = this.processingTails.get(key) ?? Promise.resolve();\n    let release!: () => void;\n    const current = new Promise<void>((resolve) => {\n      release = resolve;\n    });\n    this.processingTails.set(key, current);\n    return previous.then(operation).finally(() => {\n      if (this.processingTails.get(key) === current) this.processingTails.delete(key);\n      release();\n    });\n  }\n\n  private buildDedupeKeys(\n    dedupeKeys: readonly string[] | undefined,\n    input: ExplicitCaptureInput,\n    namespacePreResolved: boolean,\n    fallbackReviewNamespace?: string\n  ): { replayKeys: string[]; validationFailureKey: string } {\n    let fallbackNamespace: string | undefined;\n    let effectiveNamespace = asTrimmed(input.namespace);\n    if (!namespacePreResolved) {\n      try {\n        effectiveNamespace = resolveExplicitCaptureNamespace(this.orchestrator, effectiveNamespace);\n      } catch {\n        fallbackNamespace = asTrimmed(fallbackReviewNamespace) ?? this.orchestrator.config.defaultNamespace;\n        effectiveNamespace = fallbackNamespace;\n      }\n    }\n    const requestedNamespace = asTrimmed(input.namespace);\n    const namespaceScope =\n      fallbackNamespace === undefined\n        ? effectiveNamespace ?? this.orchestrator.config.defaultNamespace\n        : `${fallbackNamespace}\\u0000requested:${requestedNamespace ?? \"\"}`;\n    const sourceConnectorScope = asTrimmed(input.sourceConnector) ?? \"\";\n    const deliveryKeys = Array.from(\n      new Set((dedupeKeys ?? []).map((key) => asTrimmed(key)).filter((key): key is string => key !== undefined))\n    ).sort();\n    const noteHash = createHash(\"sha256\")\n      .update(\n        JSON.stringify({\n          content: normalizeExplicitCaptureContent(input.content),\n          category: asTrimmed(input.category) ?? \"fact\",\n        })\n      )\n      .digest(\"hex\");\n    const validationTags = Array.from(\n      new Set((input.tags ?? []).map((tag) => asTrimmed(tag)).filter((tag): tag is string => tag !== undefined))\n    ).sort();\n    const validationHash = createHash(\"sha256\")\n      .update(\n        JSON.stringify({\n          content: asTrimmed(input.content) ?? \"\",\n          category: asTrimmed(input.category) ?? \"fact\",\n          confidence:\n            input.confidence === undefined\n              ? \"default\"\n              : Number.isFinite(input.confidence)\n                ? input.confidence\n                : \"invalid\",\n          namespace: asTrimmed(input.namespace),\n          tags: validationTags,\n          entityRef: asTrimmed(input.entityRef),\n          sourceReason: asTrimmed(input.sourceReason),\n          ttl: asTrimmed(input.ttl),\n          deliveryKeys,\n        })\n      )\n      .digest(\"hex\");\n    const identityPrefix = `${namespaceScope}\\u0000${sourceConnectorScope}\\u0000`;\n    const fallbackKey = `${identityPrefix}fallback:inline-memory-note:${noteHash}`;\n    return {\n      replayKeys:\n        deliveryKeys.length > 0\n          ? deliveryKeys.map((key) => `${identityPrefix}${key}:inline-memory-note:${noteHash}`)\n          : [fallbackKey],\n      validationFailureKey: `${identityPrefix}validation:inline-memory-note:${validationHash}`,\n    };\n  }\n\n  private isNamespacePolicyAuthorized(namespace: string | undefined): boolean {\n    try {\n      resolveExplicitCaptureNamespace(this.orchestrator, namespace);\n      return true;\n    } catch {\n      return false;\n    }\n  }\n\n  private resolveReviewFallbackNamespace(\n    request: InlineExplicitCaptureProcessRequest,\n    input: ExplicitCaptureInput\n  ): string | undefined {\n    if (request.namespacePreResolved === true || this.isNamespacePolicyAuthorized(input.namespace)) return undefined;\n    return request.reviewNamespacePreResolved === true\n      ? asTrimmed(request.reviewNamespace)\n      : this.orchestrator.config.defaultNamespace;\n  }\n\n\n  private remember(keys: readonly string[]): void {\n    for (const key of keys) {\n      if (this.observedKeys.has(key)) continue;\n      this.observedKeys.add(key);\n      this.observedKeyOrder.push(key);\n    }\n    while (this.observedKeyOrder.length > this.maxDedupeKeys) {\n      const expired = this.observedKeyOrder.shift();\n      if (expired) this.observedKeys.delete(expired);\n    }\n  }\n\n  private async processNote(\n    request: InlineExplicitCaptureProcessRequest,\n    input: ExplicitCaptureInput,\n    replayKeys: readonly string[],\n    validationFailureKey: string\n  ): Promise<Pick<InlineExplicitCaptureProcessResult, \"processed\" | \"accepted\" | \"queued\" | \"duplicates\" | \"failed\">> {\n    const serializationKey = replayKeys.at(-1) ?? validationFailureKey;\n    return this.enqueue(serializationKey, async () => {\n      if (replayKeys.some((key) => this.observedKeys.has(key)) || this.observedKeys.has(validationFailureKey)) {\n        return { processed: 0, accepted: 0, queued: 0, duplicates: 1, failed: 0 };\n      }\n\n      const classifyPersisted = (\n        persisted: Awaited<ReturnType<typeof persistExplicitCapture>>\n      ): Pick<InlineExplicitCaptureProcessResult, \"processed\" | \"accepted\" | \"queued\" | \"duplicates\" | \"failed\"> => {\n        this.remember(replayKeys);\n        if (persisted.duplicateOf) {\n          return { processed: 1, accepted: 0, queued: 0, duplicates: 1, failed: 0 };\n        }\n        if (persisted.tombstoneBlocked) {\n          this.orchestrator.requestQmdMaintenanceForTool(\"inline.memory_note.review\");\n          return { processed: 1, accepted: 0, queued: 1, duplicates: 0, failed: 0 };\n        }\n        this.orchestrator.requestQmdMaintenanceForTool(\"inline.memory_note\");\n        return { processed: 1, accepted: 1, queued: 0, duplicates: 0, failed: 0 };\n      };\n      const persistCandidate = async (candidate: ValidExplicitCapture) =>\n        classifyPersisted(await persistExplicitCapture(this.orchestrator, candidate, \"inline\"));\n\n      let validationSucceeded = false;\n      let candidate: ValidExplicitCapture | undefined;\n      try {\n        candidate = validateExplicitCaptureInput(input);\n        if (request.namespacePreResolved === true) candidate.namespacePreResolved = true;\n        validationSucceeded = true;\n        return await persistCandidate(candidate);\n      } catch (error) {\n        let captureError: unknown = error;\n        if (validationSucceeded && candidate && isTombstoneBlockedCaptureWriteLockBusy(error)) {\n          try {\n            return await persistCandidate(candidate);\n          } catch (retryError) {\n            if (isTombstoneBlockedCaptureWriteLockBusy(retryError)) {\n              log.warn(\n                `explicit inline capture deferred after tombstone write lock contention: ${normalizeExplicitCaptureError(retryError)}`\n              );\n              return { processed: 0, accepted: 0, queued: 0, duplicates: 0, failed: 1 };\n            }\n            captureError = retryError;\n          }\n        }\n        if (validationSucceeded && !isUnsupportedExplicitCaptureNamespaceError(captureError)) {\n          log.warn(`explicit inline capture persistence failed: ${normalizeExplicitCaptureError(captureError)}`);\n          return { processed: 0, accepted: 0, queued: 0, duplicates: 0, failed: 1 };\n        }\n\n        const queueInput = request.namespacePreResolved === true ? { ...input, namespacePreResolved: true } : input;\n        const reviewNamespace = this.resolveReviewFallbackNamespace(request, input);\n        try {\n          const review = await queueExplicitCaptureForReview(\n            this.orchestrator,\n            queueInput,\n            \"inline\",\n            captureError,\n            reviewNamespace ? { resolvedNamespace: reviewNamespace } : undefined\n          );\n          this.remember(validationSucceeded ? replayKeys : [validationFailureKey]);\n          if (review.duplicateOf) {\n            return { processed: 1, accepted: 0, queued: 0, duplicates: 1, failed: 0 };\n          }\n          this.orchestrator.requestQmdMaintenanceForTool(\"inline.memory_note.review\");\n          return { processed: 1, accepted: 0, queued: 1, duplicates: 0, failed: 0 };\n        } catch (queueError) {\n          log.warn(\n            `explicit inline capture rejected: ${normalizeExplicitCaptureError(captureError)}; review queue fallback failed: ${normalizeExplicitCaptureError(queueError)}`\n          );\n          return { processed: 0, accepted: 0, queued: 0, duplicates: 0, failed: 1 };\n        }\n      }\n    });\n  }\n\n  async process(request: InlineExplicitCaptureProcessRequest): Promise<InlineExplicitCaptureProcessResult> {\n    if (!shouldProcessInlineExplicitCapture({ captureMode: request.captureMode })) {\n      return { content: request.content, processed: 0, accepted: 0, queued: 0, duplicates: 0, failed: 0 };\n    }\n    if (request.namespacePreResolved === true && !asTrimmed(request.namespace)) {\n      throw new Error(\"namespacePreResolved requires a resolved namespace\");\n    }\n    if (request.reviewNamespacePreResolved === true && !asTrimmed(request.reviewNamespace)) {\n      throw new Error(\"reviewNamespacePreResolved requires a resolved namespace\");\n    }\n\n    const notes = parseInlineExplicitCaptureCandidates(request.content);\n    const content = hasInlineExplicitCaptureMarkup(request.content)\n      ? stripInlineExplicitCaptureNotes(request.content)\n      : request.content;\n    const sourceConnector = asTrimmed(request.sourceConnector) ?? asTrimmed(this.options.sourceConnector);\n    let processed = 0;\n    let accepted = 0;\n    let queued = 0;\n    let duplicates = 0;\n    let failed = 0;\n\n    for (const note of notes) {\n      const input: ExplicitCaptureInput = {\n        ...note,\n        ...(request.namespace !== undefined ? { namespace: request.namespace } : {}),\n        ...(sourceConnector ? { sourceConnector } : {}),\n      };\n      const { replayKeys, validationFailureKey } = this.buildDedupeKeys(\n        request.dedupeKeys,\n        input,\n        request.namespacePreResolved === true,\n        this.resolveReviewFallbackNamespace(request, input)\n      );\n      const result = await this.processNote(request, input, replayKeys, validationFailureKey);\n      processed += result.processed;\n      accepted += result.accepted;\n      queued += result.queued;\n      duplicates += result.duplicates;\n      failed += result.failed;\n    }\n\n    return { content, processed, accepted, queued, duplicates, failed };\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,SAAS,YAAY,kBAAkB;AAwDvC,IAAM,iBAAiB;AACvB,IAAM,wBAAwB;AAC9B,IAAM,4BAA4B,oBAAI,IAAoB;AAAA,EACxD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,kBAA4B;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAM,4BAA6E;AAAA,EACjF,EAAE,SAAS,4BAA4B,aAAa,wBAAwB;AAAA,EAC5E,EAAE,SAAS,yBAAyB,aAAa,qBAAqB;AAAA,EACtE,EAAE,SAAS,sCAAsC,aAAa,0BAA0B;AAAA,EACxF;AAAA,IACE,SAAS;AAAA,IACT,aAAa;AAAA,EACf;AAAA,EACA;AAAA,IACE,SAAS;AAAA,IACT,aAAa;AAAA,EACf;AACF;AACA,IAAM,+BAA+B,CAAC,oBAAoB,eAAe;AAEzE,SAAS,qBAAqB,QAAuC;AACnE,UAAQ,QAAQ;AAAA,IACd,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAEA,SAAS,UAAU,OAA+C;AAChE,QAAM,UAAU,OAAO,KAAK;AAC5B,SAAO,WAAW,QAAQ,SAAS,IAAI,UAAU;AACnD;AAEA,SAAS,cAAc,OAAuB;AAC5C,MAAI,WAAW;AACf,aAAW,EAAE,SAAS,YAAY,KAAK,2BAA2B;AAChE,eAAW,SAAS,QAAQ,SAAS,WAAW;AAAA,EAClD;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,OAAwB;AACvD,SAAO,gBAAgB,KAAK,CAAC,YAAY,QAAQ,KAAK,KAAK,CAAC;AAC9D;AAEA,SAAS,2BAA2B,OAAe,OAAiC;AAClF,QAAM,UAAU,UAAU,KAAK;AAC/B,MAAI,WAAW,wBAAwB,OAAO,GAAG;AAC/C,UAAM,IAAI,MAAM,GAAG,KAAK,4CAA4C;AAAA,EACtE;AACF;AAEA,SAAS,+BAA+B,OAAe,QAAoC;AACzF,aAAW,SAAS,UAAU,CAAC,GAAG;AAChC,+BAA2B,OAAO,KAAK;AAAA,EACzC;AACF;AAEA,SAAS,mBAAmB,OAA2B,UAA0B;AAC/E,QAAM,WAAW,cAAc,UAAU,KAAK,KAAK,QAAQ;AAC3D,QAAM,YAAY,sBAAsB,QAAQ;AAChD,QAAM,OAAO,UAAU,KAAK,KAAK;AACjC,SAAO,KAAK,SAAS,IAAI,OAAO;AAClC;AAEA,SAAS,uBAAuB,OAA+C;AAC7E,QAAM,UAAU,UAAU,KAAK;AAC/B,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO,mBAAmB,SAAS,YAAY;AACjD;AAEA,SAAS,mBAAmB,MAAsC;AAChE,SAAO,MAAM;AAAA,IACX,IAAI;AAAA,OACD,QAAQ,CAAC,GACP,IAAI,CAAC,QAAQ,uBAAuB,GAAG,CAAC,EACxC,OAAO,CAAC,QAAuB,OAAO,QAAQ,YAAY,IAAI,SAAS,CAAC;AAAA,IAC7E;AAAA,EACF;AACF;AAEA,SAAS,8BAA8B,OAAwB;AAC7D,MAAI,iBAAiB,SAAS,MAAM,QAAQ,KAAK,EAAE,SAAS,EAAG,QAAO,MAAM,QAAQ,KAAK;AACzF,QAAM,WAAW,OAAO,KAAK,EAAE,KAAK;AACpC,SAAO,SAAS,SAAS,IAAI,WAAW;AAC1C;AAEA,SAAS,2CAA2C,OAAyB;AAC3E,SAAO,8BAA8B,KAAK,EAAE,WAAW,wBAAwB;AACjF;AAEA,SAAS,sCACP,cACA,WACoB;AACpB,QAAM,aAAa,UAAU,SAAS;AACtC,MAAI,CAAC,WAAY,QAAO;AACxB,SAAO,gCAAgC,cAAc,UAAU;AACjE;AAEA,SAAS,gCACP,cACA,WACoB;AACpB,QAAM,aAAa,UAAU,SAAS;AACtC,MAAI,CAAC,WAAY,QAAO;AACxB,MAAI,CAAC,6BAA6B,aAAa,MAAM,EAAE,YAAY;AACjE,QAAI,eAAe,aAAa,OAAO,kBAAkB;AACvD,YAAM,IAAI,MAAM,0BAA0B,UAAU,EAAE;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AACA,QAAM,UAAU,IAAI;AAAA,IAClB;AAAA,MACE,aAAa,OAAO;AAAA,MACpB,aAAa,OAAO;AAAA,MACpB,GAAG,aAAa,OAAO,kBAAkB,IAAI,CAAC,WAAW,OAAO,IAAI;AAAA,IACtE,EACG,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAC3B,OAAO,OAAO;AAAA,EACnB;AACA,MAAI,CAAC,QAAQ,IAAI,UAAU,GAAG;AAC5B,UAAM,IAAI,MAAM,0BAA0B,UAAU,EAAE;AAAA,EACxD;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,KAA6C;AAC5E,QAAM,MAAM,UAAU,GAAG;AACzB,MAAI,CAAC,IAAK,QAAO;AAEjB,QAAM,aAAa,KAAK,MAAM,GAAG;AACjC,MAAI,OAAO,SAAS,UAAU,GAAG;AAC/B,WAAO,IAAI,KAAK,UAAU,EAAE,YAAY;AAAA,EAC1C;AAEA,QAAM,WAAW,IAAI,MAAM,qBAAqB;AAChD,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,iFAAiF;AAAA,EACnG;AAEA,QAAM,SAAS,OAAO,SAAS,SAAS,CAAC,KAAK,IAAI,EAAE;AACpD,QAAM,QAAQ,SAAS,CAAC,KAAK,IAAI,YAAY;AAC7C,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,GAAG;AAC3C,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AAEA,QAAM,aACJ,SAAS,MAAM,MAAS,SAAS,MAAM,KAAK,MAAS,SAAS,MAAM,KAAK,KAAK,MAAS,IAAI,KAAK,KAAK;AACvG,SAAO,IAAI,KAAK,KAAK,IAAI,IAAI,SAAS,UAAU,EAAE,YAAY;AAChE;AAEA,SAAS,sBAAsB,OAAuB;AACpD,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,gDAAgD,KAAK,OAAO,GAAG;AAClE,WAAO,OAAO;AAAA,EAChB;AACA,QAAM,SAAS,OAAO,OAAO;AAC7B,SAAO,OAAO,SAAS,MAAM,IAAI,SAAS,OAAO;AACnD;AAEA,SAAS,gBAAgB,OAAqC;AAC5D,QAAM,QAAQ,MAAM,QAAQ,OAAO,EAAE,EAAE,MAAM,IAAI;AACjD,QAAM,OAAsC,CAAC;AAC7C,MAAI,MAAM;AAEV,SAAO,MAAM,MAAM,QAAQ;AACzB,UAAM,UAAU,MAAM,GAAG,KAAK;AAC9B,UAAM,OAAO,QAAQ,KAAK;AAC1B,WAAO;AACP,QAAI,KAAK,WAAW,EAAG;AACvB,UAAM,WAAW,KAAK,QAAQ,GAAG;AACjC,QAAI,WAAW,EAAG;AAClB,UAAM,MAAM,KAAK,MAAM,GAAG,QAAQ,EAAE,KAAK;AACzC,UAAM,QAAQ,KAAK,MAAM,WAAW,CAAC,EAAE,KAAK;AAE5C,QAAI,QAAQ,aAAa,UAAU,KAAK;AACtC,YAAM,eAAyB,CAAC;AAChC,aAAO,MAAM,MAAM,QAAQ;AACzB,cAAM,OAAO,MAAM,GAAG,KAAK;AAC3B,YAAI,KAAK,WAAW,IAAI,KAAK,KAAK,WAAW,GAAI,GAAG;AAClD,uBAAa,KAAK,KAAK,QAAQ,YAAY,EAAE,CAAC;AAC9C,iBAAO;AACP;AAAA,QACF;AACA,YAAI,KAAK,KAAK,EAAE,WAAW,GAAG;AAC5B,uBAAa,KAAK,EAAE;AACpB,iBAAO;AACP;AAAA,QACF;AACA;AAAA,MACF;AACA,WAAK,UAAU,aAAa,KAAK,IAAI,EAAE,KAAK;AAC5C;AAAA,IACF;AAEA,YAAQ,KAAK;AAAA,MACX,KAAK;AACH,aAAK,UAAU;AACf;AAAA,MACF,KAAK;AACH,aAAK,WAAW;AAChB;AAAA,MACF,KAAK;AACH,aAAK,aAAa,sBAAsB,KAAK;AAC7C;AAAA,MACF,KAAK;AACH,aAAK,YAAY;AACjB;AAAA,MACF,KAAK;AACH,aAAK,OAAO,MACT,MAAM,GAAG,EACT,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAC3B,OAAO,OAAO;AACjB;AAAA,MACF,KAAK;AACH,aAAK,YAAY;AACjB;AAAA,MACF,KAAK;AACH,aAAK,MAAM;AACX;AAAA,MACF,KAAK;AACH,aAAK,eAAe;AACpB;AAAA,MACF;AACE;AAAA,IACJ;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,IAAI,GAAG,KAAK;AAChC;AAEA,SAAS,qCAAqC,MAAsC;AAClF,QAAM,QAAgC,CAAC;AACvC,aAAW,SAAS,KAAK,SAAS,cAAc,GAAG;AACjD,UAAM,KAAK,gBAAgB,MAAM,CAAC,KAAK,EAAE,CAAC;AAAA,EAC5C;AACA,SAAO;AACT;AAEO,SAAS,gCAAgC,MAAsC;AACpF,SAAO,qCAAqC,IAAI,EAAE,OAAO,CAAC,SAAS,UAAU,KAAK,OAAO,CAAC;AAC5F;AAEO,SAAS,+BAA+B,MAAuB;AACpE,SAAO,sBAAsB,KAAK,IAAI;AACxC;AAEO,SAAS,gCAAgC,MAAsB;AACpE,SAAO,KAAK,QAAQ,gBAAgB,EAAE,EAAE,KAAK;AAC/C;AAEO,SAAS,6BACd,OACA,OAAsC,mBAChB;AACtB,QAAM,UAAU,UAAU,MAAM,OAAO;AACvC,MAAI,CAAC,QAAS,OAAM,IAAI,MAAM,qBAAqB;AACnD,MAAI,SAAS,mBAAmB;AAC9B,QAAI,QAAQ,SAAS,GAAI,OAAM,IAAI,MAAM,wCAAwC;AACjF,QAAI,QAAQ,SAAS,IAAM,OAAM,IAAI,MAAM,0CAA0C;AAAA,EACvF;AACA,MAAI,iBAAiB,KAAK,OAAO,KAAK,mBAAmB,KAAK,OAAO,GAAG;AACtE,UAAM,IAAI,MAAM,2CAA2C;AAAA,EAC7D;AAEA,QAAM,WAAY,UAAU,MAAM,QAAQ,KAAK;AAC/C,MAAI,CAAC,0BAA0B,IAAI,QAAQ,GAAG;AAC5C,UAAM,IAAI,MAAM,yBAAyB,MAAM,YAAY,QAAQ,EAAE;AAAA,EACvE;AAEA,QAAM,YAAY,sBAAsB,OAAO;AAC/C,MAAI,CAAC,UAAU,OAAO;AACpB,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AACA,aAAW,WAAW,iBAAiB;AACrC,QAAI,QAAQ,KAAK,OAAO,GAAG;AACzB,YAAM,IAAI,MAAM,mDAAmD;AAAA,IACrE;AAAA,EACF;AACA,6BAA2B,gBAAgB,MAAM,YAAY;AAC7D,6BAA2B,aAAa,MAAM,SAAS;AACvD,6BAA2B,OAAO,MAAM,GAAG;AAC3C,iCAA+B,QAAQ,MAAM,IAAI;AAEjD,MAAI,MAAM,eAAe,UAAa,CAAC,OAAO,SAAS,MAAM,UAAU,GAAG;AACxE,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AACA,QAAM,aAAa,MAAM,eAAe,SAAY,OAAO,OAAO,MAAM,UAAU;AAClF,MAAI,aAAa,KAAK,aAAa,GAAG;AACpC,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AACA,QAAM,qBAAqB,UAAU,MAAM,SAAS;AACpD,MAAI,sBAAsB,CAAC,qBAAqB,kBAAkB,GAAG;AACnE,UAAM,IAAI,MAAM,qBAAqB,kBAAkB,EAAE;AAAA,EAC3D;AACA,QAAM,YAAY,wBAAwB,MAAM,GAAG;AAKnD,QAAM,cAAc,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,EAAE,OAAO,OAAO,CAAC,CAAC;AACnG,MAAI,YAAY,SAAS,WAAW,SAAS;AAC3C,UAAM,IAAI,MAAM,kBAAkB,YAAY,MAAM,gBAAgB,WAAW,OAAO,YAAY;AAAA,EACpG;AACA,aAAW,OAAO,aAAa;AAC7B,QAAI,IAAI,SAAS,WAAW,cAAc;AACxC,YAAM,IAAI,MAAM,eAAe,WAAW,YAAY,gBAAgB,KAAK,UAAU,IAAI,MAAM,GAAG,EAAE,CAAC,CAAC,QAAG;AAAA,IAC3G;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW,UAAU,MAAM,SAAS;AAAA,IACpC,MAAM;AAAA,IACN,WAAW,UAAU,MAAM,SAAS;AAAA,IACpC,cAAc,UAAU,MAAM,YAAY;AAAA;AAAA;AAAA;AAAA,IAI1C,iBAAiB,UAAU,MAAM,eAAe;AAAA,IAChD;AAAA,EACF;AACF;AAEA,eAAe,6BACb,cACA,mBACA,WACA,iBAC2D;AAC3D,QAAM,UAAU,mBAAoB,MAAM,aAAa,WAAW,iBAAiB;AAInF,MAAI,4BAA4B;AAChC,MAAI,UAAU,aAAa,UAAU,OAAO,QAAQ,uBAAuB,YAAY;AACrF,QAAI;AACF,YAAM,UAAU,MAAM,QAAQ,mBAAmB,UAAU,OAAO;AAClE,UAAI,CAAC,SAAS;AACZ,cAAM,gBACJ,OAAO,QAAQ,mCAAmC,aAC9C,MAAM,QAAQ,+BAA+B,IAC7C;AACN,oCAA4B;AAAA,MAC9B;AAAA,IACF,SAAS,KAAK;AAGZ,WAAK;AAAA,IACP;AAAA,EACF;AACA,MAAI,2BAA2B;AAC7B,UAAM,oBAAoB,QAAQ;AAClC,QAAI,OAAO,sBAAsB,YAAY;AAC3C,UAAI;AACF,cAAM,SAAS,MAAM,kBAAkB;AAAA,UACrC;AAAA,UACA,UAAU;AAAA,UACV,UAAU;AAAA,UACV,UAAU;AAAA,QACZ;AACA,YAAI,CAAC,OAAO,OAAO,OAAO,cAAe,QAAO;AAAA,MAClD,SAAS,KAAK;AAGZ,aAAK;AAAA,MACP;AAAA,IACF,OAAO;AACL,YAAM,kBAAkB,QAAQ;AAChC,UAAI,OAAO,oBAAoB,YAAY;AACzC,YAAI;AACF,gBAAM,aAAa,MAAM,gBAAgB;AAAA,YACvC;AAAA,YACA,UAAU;AAAA,YACV,UAAU;AAAA,YACV,UAAU;AAAA,UACZ;AACA,cAAI,CAAC,YAAY;AACf,kBAAM,uBACJ,OAAO,QAAQ,wDAAwD,aACnE,MAAM,QAAQ,oDAAoD,IAClE;AACN,gBAAI,qBAAsB,QAAO;AAAA,UACnC;AAAA,QACF,SAAS,KAAK;AAGZ,eAAK;AAAA,QACP;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,cAAc,MAAM,QAAQ,gBAAgB;AAClD,QAAM,eAAe,OAAO,QAAQ,wBAAwB,aAAa,MAAM,QAAQ,oBAAoB,IAAI,CAAC;AAChH,QAAM,WAAW,CAAC,GAAG,aAAa,GAAG,YAAY;AACjD,QAAM,sBAAsB,gCAAgC,UAAU,OAAO;AAC7E,QAAM,QAAQ,SAAS,KAAK,CAAC,WAAW;AACtC,QAAI,+BAA+B,MAAM,EAAG,QAAO;AACnD,UAAM,SAAS,OAAO,YAAY,UAAU;AAC5C,QAAI,WAAW,aAAa,WAAW,oBAAoB,CAAC,OAAO,YAAY,YAAY;AACzF,aAAO;AAAA,IACT;AACA,QAAI,OAAO,YAAY,aAAa,UAAU,SAAU,QAAO;AAC/D,QAAI,gCAAgC,OAAO,OAAO,MAAM,oBAAqB,QAAO;AAIpF,UAAM,oBAAoB,OAAO,YAAY,iBAAiB,KAAK,KAAK;AACxE,UAAM,eAAe,UAAU,iBAAiB,KAAK,KAAK;AAC1D,QAAI,sBAAsB,aAAc,QAAO;AAC/C,WAAO;AAAA,EACT,CAAC;AACD,SAAO,QACH;AAAA,IACE,IAAI,MAAM,YAAY;AAAA,IACtB,kBAAkB,MAAM,YAAY,WAAW,oBAAoB,QAAQ,MAAM,YAAY,SAAS;AAAA,EACxG,IACA;AACN;AACA,eAAe,+BACb,cACA,WACA,QACA,mBACA,SAC2E;AAC3E,QAAM,YAAY,MAAM,6BAA6B,cAAc,mBAAmB,WAAW,OAAO;AACxG,MAAI,WAAW;AACb,WAAO,UAAU,mBACb,EAAE,IAAI,UAAU,IAAI,aAAa,UAAU,IAAI,kBAAkB,KAAK,IACtE,EAAE,IAAI,UAAU,IAAI,aAAa,UAAU,GAAG;AAAA,EACpD;AAMA,QAAM,kBAAkB;AAAA,IACtB;AAAA,MACE,SAAS,UAAU;AAAA,MACnB,UAAU,UAAU;AAAA,MACpB,YAAY,UAAU;AAAA,MACtB,MAAM,UAAU;AAAA,MAChB,GAAI,UAAU,YAAY,EAAE,WAAW,UAAU,UAAU,IAAI,CAAC;AAAA,MAChE,GAAI,UAAU,YAAY,EAAE,KAAK,UAAU,UAAU,IAAI,CAAC;AAAA,MAC1D,GAAI,UAAU,kBAAkB,EAAE,iBAAiB,UAAU,gBAAgB,IAAI,CAAC;AAAA,MAClF,GAAI,UAAU,eAAe,EAAE,cAAc,UAAU,aAAa,IAAI,CAAC;AAAA,IAC3E;AAAA,IACA,EAAE,QAAQ,WAAW,WAAW,oBAAoB,WAAW;AAAA,EACjE;AACA,QAAM,EAAE,IAAI,aAAa,iBAAiB,IAAI,MAAM,QAAQ,kBAAkB,eAAe;AAC7F,MAAI,YAAa,QAAO,EAAE,IAAI,aAAa,iBAAiB;AAI5D,QAAM,WAAU,oBAAI,KAAK,GAAE,YAAY;AACvC,QAAM,QAA8B;AAAA,IAClC,SAAS,OAAO,WAAW,CAAC;AAAA,IAC5B,UAAU;AAAA,IACV,WAAW,mBAAmB,4BAA4B;AAAA,IAC1D,WAAW;AAAA,IACX,OAAO,qBAAqB,MAAM;AAAA,IAClC,YAAY,UAAU;AAAA,IACtB,aAAa;AAAA,EACf;AACA,QAAM,QAAQ,4BAA4B,CAAC,KAAK,CAAC;AAEjD,SAAO,EAAE,IAAI,aAAa,iBAAiB;AAC7C;AAEA,eAAsB,uBACpB,cACA,WACA,QAC2E;AAC3E,QAAM,oBAAoB,UAAU,uBAChC,UAAU,UAAU,SAAS,IAC7B,gCAAgC,cAAc,UAAU,SAAS;AACrE,QAAM,UAAU,MAAM,aAAa,WAAW,iBAAiB;AAC/D,QAAM,UAAU,MAAM,+BAA+B,cAAc,WAAW,QAAQ,mBAAmB,OAAO;AAChH,MAAI,OAAO,QAAQ,yCAAyC,WAAY,QAAO,MAAM,QAAQ;AAC7F,QAAM,eAAe,6BAA6B,UAAU,SAAS,UAAU,UAAU,UAAU,eAAe;AAClH,SAAO,MAAM,QAAQ,qCAAqC,SAAS,YAAY;AACjF;AAEA,SAAS,kCAAkC,OAA6B,QAAwB;AAC9F,QAAM,mBAAmB,UAAU,MAAM,OAAO;AAChD,QAAM,cAAc,mBAAmB,kBAAkB,0BAA0B;AACnF,QAAM,eAAe,uBAAuB,MAAM,QAAQ;AAC1D,QAAM,gBAAgB,uBAAuB,MAAM,SAAS;AAC5D,QAAM,gBAAgB,uBAAuB,MAAM,SAAS;AAC5D,QAAM,UAAU,uBAAuB,MAAM,GAAG;AAChD,QAAM,mBAAmB,uBAAuB,MAAM,YAAY;AAClE,QAAM,WAAW,mBAAmB,MAAM,IAAI;AAC9C,QAAM,QAAQ,CAAC,uCAAuC,IAAI,WAAW,MAAM,IAAI,IAAI,sBAAsB,WAAW;AACpH,QAAM,WAAW;AAAA,IACf,eAAe,uBAAuB,YAAY,KAAK;AAAA,IACvD,gBAAgB,wBAAwB,aAAa,KAAK;AAAA,IAC1D,gBAAgB,wBAAwB,aAAa,KAAK;AAAA,IAC1D,UAAU,kBAAkB,OAAO,KAAK;AAAA,IACxC,mBAAmB,2BAA2B,gBAAgB,KAAK;AAAA,IACnE,SAAS,SAAS,IAAI,mBAAmB,SAAS,KAAK,IAAI,CAAC,KAAK;AAAA,EACnE,EAAE,OAAO,CAAC,UAA2B,OAAO,UAAU,YAAY,MAAM,SAAS,CAAC;AAClF,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,KAAK,IAAI,GAAG,QAAQ;AAAA,EAC5B;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,gCACP,cACA,gBAC2B;AAC3B,QAAM,SAAS,aAAa;AAC5B,SAAO,CAAC,UAAU,cAAc,KAAK,UAAU,QAAQ,gBAAgB,CAAC;AAC1E;AAEA,eAAe,mCACb,cACA,WACA,SACA,iBACwB;AACxB,QAAM,WAAW,MAAM;AAAA,IACrB,IAAI;AAAA,MACF,MAAM,QAAQ;AAAA,QACZ,gCAAgC,cAAc,SAAS,EAAE;AAAA,UAAI,CAAC,oBAC5D,aAAa,WAAW,eAAe;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,aAAa,MAAM,QAAQ;AAAA,IAC/B,SAAS,IAAI,OAAO,YAAY;AAC9B,YAAM,cAAc,MAAM,QAAQ,gBAAgB;AAClD,YAAM,eAAe,OAAO,QAAQ,wBAAwB,aAAa,MAAM,QAAQ,oBAAoB,IAAI,CAAC;AAChH,aAAO,CAAC,GAAG,aAAa,GAAG,YAAY;AAAA,IACzC,CAAC;AAAA,EACH;AACA,QAAM,WAAW,WAAW,KAAK;AACjC,QAAM,aAAa,gCAAgC,OAAO;AAC1D,QAAM,QAAQ,SAAS,KAAK,CAAC,WAAW;AACtC,UAAM,SAAS,OAAO,YAAY,UAAU;AAC5C,QAAI,WAAW,iBAAkB,QAAO;AACxC,QAAI,EAAE,OAAO,YAAY,QAAQ,CAAC,GAAG,SAAS,eAAe,EAAG,QAAO;AACvE,QAAI,gCAAgC,OAAO,OAAO,MAAM,WAAY,QAAO;AAC3E,UAAM,oBAAoB,OAAO,YAAY,iBAAiB,KAAK,KAAK;AACxE,UAAM,eAAe,iBAAiB,KAAK,KAAK;AAChD,QAAI,sBAAsB,aAAc,QAAO;AAC/C,WAAO;AAAA,EACT,CAAC;AACD,SAAO,OAAO,YAAY,MAAM;AAClC;AAOA,eAAsB,8BACpB,cACA,OACA,QACA,OACA,UAA6C,CAAC,GACC;AAC/C,QAAM,SAAS,mBAAmB,8BAA8B,KAAK,GAAG,yBAAyB;AACjG,QAAM,qBAAqB,UAAU,MAAM,SAAS;AACpD,QAAM,oBAAoB,UAAU,QAAQ,iBAAiB;AAI7D,QAAM,iBACJ,sBACE,MAA6C,uBAC3C,qBACA,sCAAsC,cAAc,kBAAkB;AAC5E,QAAM,UAAU,kCAAkC,OAAO,MAAM;AAC/D,QAAM,oBAAoB,UAAU,MAAM,QAAQ;AAClD,QAAM,iBACJ,qBAAqB,0BAA0B,IAAI,iBAAmC,IACjF,oBACD;AACN,QAAM,gBAAgB,mBAAmB,MAAM,IAAI;AACnD,QAAM,UAAU,MAAM,aAAa,WAAW,cAAc;AAC5D,QAAM,eAAe,6BAA6B,SAAS,gBAAgB,MAAM,eAAe;AAChG,QAAM,QAAQ,YAA2D;AACvE,UAAM,cAAc,MAAM;AAAA,MACxB;AAAA,MACA;AAAA,MACA;AAAA,MACA,MAAM;AAAA,IACR;AACA,QAAI,aAAa;AACf,aAAO,EAAE,IAAI,aAAa,YAAY;AAAA,IACxC;AAEA,UAAM,iBAAiB;AAAA,MACrB;AAAA,QACE;AAAA,QACA,UAAU;AAAA,QACV,YAAY;AAAA,QACZ,MAAM,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAG,8BAA8B,GAAG,aAAa,CAAC,CAAC;AAAA,QAC7E,GAAI,uBAAuB,MAAM,SAAS,IAAI,EAAE,WAAW,uBAAuB,MAAM,SAAS,EAAE,IAAI,CAAC;AAAA,QACxG,GAAI,MAAM,kBAAkB,EAAE,iBAAiB,MAAM,gBAAgB,IAAI,CAAC;AAAA,MAC5E;AAAA,MACA,EAAE,QAAQ,WAAW,WAAW,2BAA2B,kBAAkB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAQ7E,EAAE,SAAS,KAAK;AAAA,IAClB;AACA,UAAM,EAAE,GAAG,IAAI,MAAM,QAAQ,kBAAkB,cAAc;AAC7D,QAAI;AACF,YAAM,UAAU,MAAM,QAAQ,cAAc,EAAE;AAC9C,UAAI,SAAS;AACX,cAAM,QAAQ;AAAA,UACZ;AAAA,UACA;AAAA,YACE,QAAQ;AAAA,YACR,UAAS,oBAAI,KAAK,GAAE,YAAY;AAAA,UAClC;AAAA,UACA;AAAA,YACE,OAAO,qBAAqB,MAAM;AAAA,YAClC,YAAY;AAAA,YACZ,aAAa;AAAA,UACf;AAAA,QACF;AAAA,MACF;AAAA,IACF,UAAE;AAAA,IAQF;AACA,UAAM,QAA8B;AAAA,MAClC,SAAS,OAAO,WAAW,CAAC;AAAA,MAC5B,UAAU;AAAA,MACV,WAAW;AAAA,MACX,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MAClC,OAAO,qBAAqB,MAAM;AAAA,MAClC,YAAY;AAAA,MACZ,aAAa;AAAA,IACf;AACA,UAAM,QAAQ,4BAA4B,CAAC,KAAK,CAAC;AACjD,WAAO,EAAE,GAAG;AAAA,EACd;AACA,MAAI,OAAO,QAAQ,yCAAyC,WAAY,QAAO,MAAM,MAAM;AAC3F,SAAO,MAAM,QAAQ,qCAAqC,OAAO,YAAY;AAC/E;AAEO,SAAS,6BAA6B,KAAiD;AAC5F,SAAO,IAAI,gBAAgB;AAC7B;AAEO,SAAS,mCAAmC,KAAiD;AAClG,SAAO,IAAI,gBAAgB;AAC7B;AA2BA,IAAM,0CAA0C;AAEzC,IAAM,iCAAN,MAAqC;AAAA,EAM1C,YACmB,cACA,UAAiD,CAAC,GACnE;AAFiB;AACA;AAEjB,UAAM,iBAAiB,QAAQ,iBAAiB;AAChD,SAAK,gBACH,OAAO,SAAS,cAAc,KAAK,iBAAiB,IAChD,KAAK,IAAI,GAAG,KAAK,MAAM,cAAc,CAAC,IACtC;AAAA,EACR;AAAA,EARmB;AAAA,EACA;AAAA,EAPF,eAAe,oBAAI,IAAY;AAAA,EAC/B,mBAA6B,CAAC;AAAA,EAC9B;AAAA,EACA,kBAAkB,oBAAI,IAA2B;AAAA,EAa1D,QAAW,KAAa,WAAyC;AACvE,UAAM,WAAW,KAAK,gBAAgB,IAAI,GAAG,KAAK,QAAQ,QAAQ;AAClE,QAAI;AACJ,UAAM,UAAU,IAAI,QAAc,CAAC,YAAY;AAC7C,gBAAU;AAAA,IACZ,CAAC;AACD,SAAK,gBAAgB,IAAI,KAAK,OAAO;AACrC,WAAO,SAAS,KAAK,SAAS,EAAE,QAAQ,MAAM;AAC5C,UAAI,KAAK,gBAAgB,IAAI,GAAG,MAAM,QAAS,MAAK,gBAAgB,OAAO,GAAG;AAC9E,cAAQ;AAAA,IACV,CAAC;AAAA,EACH;AAAA,EAEQ,gBACN,YACA,OACA,sBACA,yBACwD;AACxD,QAAI;AACJ,QAAI,qBAAqB,UAAU,MAAM,SAAS;AAClD,QAAI,CAAC,sBAAsB;AACzB,UAAI;AACF,6BAAqB,gCAAgC,KAAK,cAAc,kBAAkB;AAAA,MAC5F,QAAQ;AACN,4BAAoB,UAAU,uBAAuB,KAAK,KAAK,aAAa,OAAO;AACnF,6BAAqB;AAAA,MACvB;AAAA,IACF;AACA,UAAM,qBAAqB,UAAU,MAAM,SAAS;AACpD,UAAM,iBACJ,sBAAsB,SAClB,sBAAsB,KAAK,aAAa,OAAO,mBAC/C,GAAG,iBAAiB,eAAmB,sBAAsB,EAAE;AACrE,UAAM,uBAAuB,UAAU,MAAM,eAAe,KAAK;AACjE,UAAM,eAAe,MAAM;AAAA,MACzB,IAAI,KAAK,cAAc,CAAC,GAAG,IAAI,CAAC,QAAQ,UAAU,GAAG,CAAC,EAAE,OAAO,CAAC,QAAuB,QAAQ,MAAS,CAAC;AAAA,IAC3G,EAAE,KAAK;AACP,UAAM,WAAW,WAAW,QAAQ,EACjC;AAAA,MACC,KAAK,UAAU;AAAA,QACb,SAAS,gCAAgC,MAAM,OAAO;AAAA,QACtD,UAAU,UAAU,MAAM,QAAQ,KAAK;AAAA,MACzC,CAAC;AAAA,IACH,EACC,OAAO,KAAK;AACf,UAAM,iBAAiB,MAAM;AAAA,MAC3B,IAAI,KAAK,MAAM,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,UAAU,GAAG,CAAC,EAAE,OAAO,CAAC,QAAuB,QAAQ,MAAS,CAAC;AAAA,IAC3G,EAAE,KAAK;AACP,UAAM,iBAAiB,WAAW,QAAQ,EACvC;AAAA,MACC,KAAK,UAAU;AAAA,QACb,SAAS,UAAU,MAAM,OAAO,KAAK;AAAA,QACrC,UAAU,UAAU,MAAM,QAAQ,KAAK;AAAA,QACvC,YACE,MAAM,eAAe,SACjB,YACA,OAAO,SAAS,MAAM,UAAU,IAC9B,MAAM,aACN;AAAA,QACR,WAAW,UAAU,MAAM,SAAS;AAAA,QACpC,MAAM;AAAA,QACN,WAAW,UAAU,MAAM,SAAS;AAAA,QACpC,cAAc,UAAU,MAAM,YAAY;AAAA,QAC1C,KAAK,UAAU,MAAM,GAAG;AAAA,QACxB;AAAA,MACF,CAAC;AAAA,IACH,EACC,OAAO,KAAK;AACf,UAAM,iBAAiB,GAAG,cAAc,KAAS,oBAAoB;AACrE,UAAM,cAAc,GAAG,cAAc,+BAA+B,QAAQ;AAC5E,WAAO;AAAA,MACL,YACE,aAAa,SAAS,IAClB,aAAa,IAAI,CAAC,QAAQ,GAAG,cAAc,GAAG,GAAG,uBAAuB,QAAQ,EAAE,IAClF,CAAC,WAAW;AAAA,MAClB,sBAAsB,GAAG,cAAc,iCAAiC,cAAc;AAAA,IACxF;AAAA,EACF;AAAA,EAEQ,4BAA4B,WAAwC;AAC1E,QAAI;AACF,sCAAgC,KAAK,cAAc,SAAS;AAC5D,aAAO;AAAA,IACT,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEQ,+BACN,SACA,OACoB;AACpB,QAAI,QAAQ,yBAAyB,QAAQ,KAAK,4BAA4B,MAAM,SAAS,EAAG,QAAO;AACvG,WAAO,QAAQ,+BAA+B,OAC1C,UAAU,QAAQ,eAAe,IACjC,KAAK,aAAa,OAAO;AAAA,EAC/B;AAAA,EAGQ,SAAS,MAA+B;AAC9C,eAAW,OAAO,MAAM;AACtB,UAAI,KAAK,aAAa,IAAI,GAAG,EAAG;AAChC,WAAK,aAAa,IAAI,GAAG;AACzB,WAAK,iBAAiB,KAAK,GAAG;AAAA,IAChC;AACA,WAAO,KAAK,iBAAiB,SAAS,KAAK,eAAe;AACxD,YAAM,UAAU,KAAK,iBAAiB,MAAM;AAC5C,UAAI,QAAS,MAAK,aAAa,OAAO,OAAO;AAAA,IAC/C;AAAA,EACF;AAAA,EAEA,MAAc,YACZ,SACA,OACA,YACA,sBACkH;AAClH,UAAM,mBAAmB,WAAW,GAAG,EAAE,KAAK;AAC9C,WAAO,KAAK,QAAQ,kBAAkB,YAAY;AAChD,UAAI,WAAW,KAAK,CAAC,QAAQ,KAAK,aAAa,IAAI,GAAG,CAAC,KAAK,KAAK,aAAa,IAAI,oBAAoB,GAAG;AACvG,eAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,MAC1E;AAEA,YAAM,oBAAoB,CACxB,cAC4G;AAC5G,aAAK,SAAS,UAAU;AACxB,YAAI,UAAU,aAAa;AACzB,iBAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,QAC1E;AACA,YAAI,UAAU,kBAAkB;AAC9B,eAAK,aAAa,6BAA6B,2BAA2B;AAC1E,iBAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,QAC1E;AACA,aAAK,aAAa,6BAA6B,oBAAoB;AACnE,eAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,MAC1E;AACA,YAAM,mBAAmB,OAAOA,eAC9B,kBAAkB,MAAM,uBAAuB,KAAK,cAAcA,YAAW,QAAQ,CAAC;AAExF,UAAI,sBAAsB;AAC1B,UAAI;AACJ,UAAI;AACF,oBAAY,6BAA6B,KAAK;AAC9C,YAAI,QAAQ,yBAAyB,KAAM,WAAU,uBAAuB;AAC5E,8BAAsB;AACtB,eAAO,MAAM,iBAAiB,SAAS;AAAA,MACzC,SAAS,OAAO;AACd,YAAI,eAAwB;AAC5B,YAAI,uBAAuB,aAAa,uCAAuC,KAAK,GAAG;AACrF,cAAI;AACF,mBAAO,MAAM,iBAAiB,SAAS;AAAA,UACzC,SAAS,YAAY;AACnB,gBAAI,uCAAuC,UAAU,GAAG;AACtD,kBAAI;AAAA,gBACF,2EAA2E,8BAA8B,UAAU,CAAC;AAAA,cACtH;AACA,qBAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,YAC1E;AACA,2BAAe;AAAA,UACjB;AAAA,QACF;AACA,YAAI,uBAAuB,CAAC,2CAA2C,YAAY,GAAG;AACpF,cAAI,KAAK,+CAA+C,8BAA8B,YAAY,CAAC,EAAE;AACrG,iBAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,QAC1E;AAEA,cAAM,aAAa,QAAQ,yBAAyB,OAAO,EAAE,GAAG,OAAO,sBAAsB,KAAK,IAAI;AACtG,cAAM,kBAAkB,KAAK,+BAA+B,SAAS,KAAK;AAC1E,YAAI;AACF,gBAAM,SAAS,MAAM;AAAA,YACnB,KAAK;AAAA,YACL;AAAA,YACA;AAAA,YACA;AAAA,YACA,kBAAkB,EAAE,mBAAmB,gBAAgB,IAAI;AAAA,UAC7D;AACA,eAAK,SAAS,sBAAsB,aAAa,CAAC,oBAAoB,CAAC;AACvE,cAAI,OAAO,aAAa;AACtB,mBAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,UAC1E;AACA,eAAK,aAAa,6BAA6B,2BAA2B;AAC1E,iBAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,QAC1E,SAAS,YAAY;AACnB,cAAI;AAAA,YACF,qCAAqC,8BAA8B,YAAY,CAAC,mCAAmC,8BAA8B,UAAU,CAAC;AAAA,UAC9J;AACA,iBAAO,EAAE,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,QAC1E;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,QAAQ,SAA2F;AACvG,QAAI,CAAC,mCAAmC,EAAE,aAAa,QAAQ,YAAY,CAAC,GAAG;AAC7E,aAAO,EAAE,SAAS,QAAQ,SAAS,WAAW,GAAG,UAAU,GAAG,QAAQ,GAAG,YAAY,GAAG,QAAQ,EAAE;AAAA,IACpG;AACA,QAAI,QAAQ,yBAAyB,QAAQ,CAAC,UAAU,QAAQ,SAAS,GAAG;AAC1E,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,QAAI,QAAQ,+BAA+B,QAAQ,CAAC,UAAU,QAAQ,eAAe,GAAG;AACtF,YAAM,IAAI,MAAM,0DAA0D;AAAA,IAC5E;AAEA,UAAM,QAAQ,qCAAqC,QAAQ,OAAO;AAClE,UAAM,UAAU,+BAA+B,QAAQ,OAAO,IAC1D,gCAAgC,QAAQ,OAAO,IAC/C,QAAQ;AACZ,UAAM,kBAAkB,UAAU,QAAQ,eAAe,KAAK,UAAU,KAAK,QAAQ,eAAe;AACpG,QAAI,YAAY;AAChB,QAAI,WAAW;AACf,QAAI,SAAS;AACb,QAAI,aAAa;AACjB,QAAI,SAAS;AAEb,eAAW,QAAQ,OAAO;AACxB,YAAM,QAA8B;AAAA,QAClC,GAAG;AAAA,QACH,GAAI,QAAQ,cAAc,SAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAAA,QAC1E,GAAI,kBAAkB,EAAE,gBAAgB,IAAI,CAAC;AAAA,MAC/C;AACA,YAAM,EAAE,YAAY,qBAAqB,IAAI,KAAK;AAAA,QAChD,QAAQ;AAAA,QACR;AAAA,QACA,QAAQ,yBAAyB;AAAA,QACjC,KAAK,+BAA+B,SAAS,KAAK;AAAA,MACpD;AACA,YAAM,SAAS,MAAM,KAAK,YAAY,SAAS,OAAO,YAAY,oBAAoB;AACtF,mBAAa,OAAO;AACpB,kBAAY,OAAO;AACnB,gBAAU,OAAO;AACjB,oBAAc,OAAO;AACrB,gBAAU,OAAO;AAAA,IACnB;AAEA,WAAO,EAAE,SAAS,WAAW,UAAU,QAAQ,YAAY,OAAO;AAAA,EACpE;AACF;","names":["candidate"]}

package/dist/{chunk-ZMYDYNI4.js → chunk-N7CXQ5TA.js}

@@ -2,12 +2,12 @@ import {
   hasBroadGraphIntent,
   planRecallMode
 } from "./chunk-PD6O7AXF.js";
-import {
-  parseQmdExplain
-} from "./chunk-QCECHYZL.js";
 import {
   buildCompressionGuidelinesMarkdown
 } from "./chunk-OD4FM2U7.js";
+import {
+  parseQmdExplain
+} from "./chunk-QCECHYZL.js";
 import {
   resolveLifecycleState
 } from "./chunk-TBBDFYXW.js";
@@ -1654,4 +1654,4 @@ export {
   ExtractionDeadlineError,
   ExtractionRunCoordinator
 };
-//# sourceMappingURL=chunk-ZMYDYNI4.js.map
+//# sourceMappingURL=chunk-N7CXQ5TA.js.map

package/dist/{chunk-3JLPGJ43.js → chunk-NGT35IGQ.js}

@@ -1,9 +1,9 @@
-import {
-  namespaceCollectionName
-} from "./chunk-VMMQDEN5.js";
 import {
   NamespaceStorageRouter
-} from "./chunk-WDBX6VER.js";
+} from "./chunk-VZRFGJCH.js";
+import {
+  namespaceCollectionName
+} from "./chunk-DN2IDKI5.js";
 import {
   namespaceIdentityFromToken,
   namespaceIdentityToken
@@ -213,4 +213,4 @@ export {
   verifyNamespaces,
   runNamespaceMigration
 };
-//# sourceMappingURL=chunk-3JLPGJ43.js.map
+//# sourceMappingURL=chunk-NGT35IGQ.js.map

package/dist/{chunk-GUKBW4HL.js → chunk-NQMSEB5D.js}

@@ -1,16 +1,13 @@
 import {
   getConfiguredNamespaces
-} from "./chunk-YN6ASZUG.js";
+} from "./chunk-6QPI2ITJ.js";
 import {
   writeFileAtomically
 } from "./chunk-AW4QUFQF.js";
 import {
   drainPendingLifecycleForSyncOrThrow,
   drainPendingLifecycleLedgerForSync
-} from "./chunk-7FGL6CGA.js";
-import {
-  namespaceIdentityFromToken
-} from "./chunk-EGGE52UU.js";
+} from "./chunk-DVYRD4HY.js";
 import {
   assertPathInsideRoot,
   pathIsInside
@@ -18,6 +15,9 @@ import {
 import {
   displayErrorDetail
 } from "./chunk-RL6NEVXT.js";
+import {
+  namespaceIdentityFromToken
+} from "./chunk-EGGE52UU.js";
 import {
   isSafeRouteNamespace
 } from "./chunk-U3PN77QT.js";
@@ -181,4 +181,4 @@ export {
   offlineSyncStorageForSnapshot,
   drainPendingLifecycleForOfflineSync
 };
-//# sourceMappingURL=chunk-GUKBW4HL.js.map
+//# sourceMappingURL=chunk-NQMSEB5D.js.map

package/dist/{chunk-WRJVB3C2.js → chunk-PO7NXBG2.js}

@@ -4,7 +4,7 @@ import {
 import {
   getMemoryProjectionPath,
   initializeMemoryProjectionDb
-} from "./chunk-3CSX3ETE.js";
+} from "./chunk-2LWQSV6A.js";
 import {
   openBetterSqlite3
 } from "./chunk-RL6NEVXT.js";
@@ -115,4 +115,4 @@ export {
   rewriteProjectedMemoryEntityReference,
   rewriteProjectedEntityReferences
 };
-//# sourceMappingURL=chunk-WRJVB3C2.js.map
+//# sourceMappingURL=chunk-PO7NXBG2.js.map

package/dist/{chunk-WM65LU67.js → chunk-QOQQMVR2.js}

@@ -5,7 +5,7 @@ import {
 } from "./chunk-JLNBQWZ2.js";
 import {
   runPostConsolidationMaterialize
-} from "./chunk-NH5IR2WM.js";
+} from "./chunk-YR65W7BV.js";
 import {
   isSemanticConsolidationLlmOperator
 } from "./chunk-G7D6GZ5J.js";
@@ -220,4 +220,4 @@ export {
   buildExtensionsBlockForConsolidation,
   materializeAfterSemanticConsolidation
 };
-//# sourceMappingURL=chunk-WM65LU67.js.map
+//# sourceMappingURL=chunk-QOQQMVR2.js.map

package/dist/{chunk-QHFV6VNU.js → chunk-QPAQSG3F.js}

@@ -1,6 +1,6 @@
 import {
   isRecallDisclosure
-} from "./chunk-UU3G6GUP.js";
+} from "./chunk-BIF4SHMD.js";
 import {
   normalizeRetrievedMemoryProvenance
 } from "./chunk-I4WBNM3M.js";
@@ -301,4 +301,4 @@ export {
   RecallXrayBuilder,
   summarizeDisclosureTokens
 };
-//# sourceMappingURL=chunk-QHFV6VNU.js.map
+//# sourceMappingURL=chunk-QPAQSG3F.js.map

package/dist/{chunk-UTRO5UJU.js → chunk-QPW3PAIH.js}

@@ -10,6 +10,9 @@ import {
 import {
   extractJsonCandidates
 } from "./chunk-RGMVMVMF.js";
+import {
+  isSupportPassportPrivateMemory
+} from "./chunk-HNDIND7P.js";
 import {
   resolveNamespaceCapabilities
 } from "./chunk-2XRE6FLM.js";
@@ -491,6 +494,7 @@ async function loadEligibleMemories(storage) {
   }
   return all.filter((mem) => {
     const fm = mem.frontmatter;
+    if (isSupportPassportPrivateMemory(mem)) return false;
     const status = fm.status ?? "active";
     if (!ACTIVE_STATUSES.has(status)) return false;
     const category = fm.category;
@@ -546,4 +550,4 @@ export {
   ACTIVE_STATUSES,
   runContradictionScan
 };
-//# sourceMappingURL=chunk-UTRO5UJU.js.map
+//# sourceMappingURL=chunk-QPW3PAIH.js.map

package/dist/chunk-QPW3PAIH.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/contradiction/contradiction-judge.ts","../src/contradiction/contradiction-scan.ts"],"sourcesContent":["/**\n * Contradiction Judge — LLM-as-judge for semantic contradiction detection (issue #520).\n *\n * Pairs semantically-similar memories and classifies their relationship.\n * Reuses the extraction-judge adapter pattern but with a contradiction-specific\n * prompt and verdict taxonomy.\n *\n * Design constraints:\n *   - Default verdict on any failure is \"needs-user\" (rule 48: least-privileged default).\n *   - Never auto-resolve; all verdicts enter the review queue.\n *   - Content-hash caching avoids redundant LLM calls across runs.\n */\n\nimport { createHash } from \"node:crypto\";\nimport { log } from \"../logger.js\";\nimport type { PluginConfig } from \"../types.js\";\nimport type { LocalLlmClient } from \"../local-llm.js\";\nimport type { FallbackLlmClient } from \"../fallback-llm.js\";\nimport { extractJsonCandidates } from \"../json-extract.js\";\n\n// ── Types ──────────────────────────────────────────────────────────────────────\n\nexport type ContradictionVerdict =\n  | \"contradicts\"\n  | \"independent\"\n  | \"duplicates\"\n  | \"needs-user\";\n\nexport interface ContradictionJudgeInput {\n  /** Memory ID of the first fact. */\n  memoryIdA: string;\n  /** Memory ID of the second fact. */\n  memoryIdB: string;\n  /** Content text of the first fact. */\n  textA: string;\n  /** Content text of the second fact. */\n  textB: string;\n  /** Category of the first fact (optional context). */\n  categoryA?: string;\n  /** Category of the second fact (optional context). */\n  categoryB?: string;\n}\n\nexport interface ContradictionJudgeResult {\n  /** Memory IDs of the pair. */\n  memoryIdA: string;\n  memoryIdB: string;\n  /** Verdict from the judge. */\n  verdict: ContradictionVerdict;\n  /** Human-readable rationale. */\n  rationale: string;\n  /** Confidence in [0, 1]. */\n  confidence: number;\n}\n\nexport interface ContradictionJudgeBatchResult {\n  /** Results keyed by pair key (\"idA:idB\"). */\n  results: Map<string, ContradictionJudgeResult>;\n  /** Number served from cache. */\n  cached: number;\n  /** Number produced by LLM call. */\n  judged: number;\n  /** Total wall-clock time in ms. */\n  elapsed: number;\n}\n\n// ── Prompt ─────────────────────────────────────────────────────────────────────\n\nconst CONTRADICTION_JUDGE_PROMPT = `You are a memory contradiction classifier. You will receive pairs of stored memories and must classify their semantic relationship.\n\nFor each pair, respond with a JSON array where each element has:\n- \"pairKey\": the pairKey provided in the input\n- \"verdict\": one of \"contradicts\", \"independent\", \"duplicates\", \"needs-user\"\n- \"rationale\": one sentence explaining why\n- \"confidence\": number between 0 and 1\n\nVERDICT DEFINITIONS:\n- \"contradicts\": The two memories make claims that cannot both be true. One must be wrong or outdated.\n- \"duplicates\": The two memories convey essentially the same information (near-paraphrase).\n- \"independent\": The memories are topically similar but do not conflict or duplicate.\n- \"needs-user\": Cannot determine with sufficient confidence; requires human review.\n\nIMPORTANT:\n- Be conservative. When in doubt, prefer \"needs-user\" over a wrong classification.\n- Two memories about the same entity/topic are NOT necessarily contradictory.\n- Temporal changes (\"Joshua uses pnpm\" vs \"Joshua switched to npm\") ARE contradictions.\n- Different aspects of the same entity (\"Joshua uses pnpm\" vs \"Joshua works on Remnic\") are \"independent\".`;\n\n// ── Cache ──────────────────────────────────────────────────────────────────────\n\n/** Module-level fallback cache — only used when caller does not supply one. */\nlet defaultVerdictCache: Map<string, ContradictionJudgeResult> = new Map();\nconst CACHE_MAX = 10_000;\n\nfunction pairKey(idA: string, idB: string): string {\n  const sorted = [idA, idB].sort();\n  return `${sorted[0]}:${sorted[1]}`;\n}\n\nfunction contentHash(a: ContradictionJudgeInput): string {\n  // Sort each side pair to be order-independent (matching pairKey behavior)\n  const sides = [\n    { text: a.textA.trim(), category: (a.categoryA ?? \"\").trim() },\n    { text: a.textB.trim(), category: (a.categoryB ?? \"\").trim() },\n  ].sort((left, right) => {\n    const leftKey = JSON.stringify(left);\n    const rightKey = JSON.stringify(right);\n    return leftKey.localeCompare(rightKey);\n  });\n  const normalized = JSON.stringify(sides);\n  return createHash(\"sha256\").update(normalized).digest(\"hex\").slice(0, 16);\n}\n\nexport function createVerdictCache(): Map<string, ContradictionJudgeResult> {\n  return new Map();\n}\n\nexport function clearVerdictCache(): void {\n  defaultVerdictCache.clear();\n}\n\nexport function verdictCacheSize(): number {\n  return defaultVerdictCache.size;\n}\n\n// ── Public API ──────────────────────────────────────────────────────────────────\n\n/**\n * Judge a batch of memory pairs for contradiction.\n *\n * Uses content-hash caching to skip pairs already judged in a prior run.\n * On any LLM failure, all unresolved pairs default to \"needs-user\".\n */\nexport async function judgeContradictionPairs(\n  pairs: ContradictionJudgeInput[],\n  config: PluginConfig,\n  localLlm: LocalLlmClient | null,\n  fallbackLlm: FallbackLlmClient | null,\n  cache?: Map<string, ContradictionJudgeResult>,\n): Promise<ContradictionJudgeBatchResult> {\n  const startTime = Date.now();\n  const results = new Map<string, ContradictionJudgeResult>();\n  const activeCache = cache ?? defaultVerdictCache;\n  let cached = 0;\n  let judged = 0;\n\n  // Partition into cached vs needs-judging\n  const toJudge: ContradictionJudgeInput[] = [];\n  for (const pair of pairs) {\n    const key = pairKey(pair.memoryIdA, pair.memoryIdB);\n    const hash = contentHash(pair);\n    const cachedResult = activeCache.get(hash);\n    if (cachedResult) {\n      results.set(key, { ...cachedResult, memoryIdA: pair.memoryIdA, memoryIdB: pair.memoryIdB });\n      cached++;\n    } else {\n      toJudge.push(pair);\n    }\n  }\n\n  if (toJudge.length === 0) {\n    return { results, cached, judged, elapsed: Date.now() - startTime };\n  }\n\n  // Build the prompt with all pairs\n  const pairDescriptions = toJudge.map((p, i) => {\n    const pk = pairKey(p.memoryIdA, p.memoryIdB);\n    const catA = p.categoryA ? ` [${p.categoryA}]` : \"\";\n    const catB = p.categoryB ? ` [${p.categoryB}]` : \"\";\n    return `Pair ${i + 1} (pairKey: \"${pk}\"):${catA} \"${p.textA}\"${catB} \"${p.textB}\"`;\n  });\n\n  const userMessage = `Classify these ${toJudge.length} memory pair(s):\\n\\n${pairDescriptions.join(\"\\n\\n\")}`;\n\n  // Try LLM call\n  let llmResponse: string | null = null;\n\n  if (localLlm) {\n    try {\n      llmResponse = await callLlm(localLlm, config, userMessage);\n    } catch (err) {\n      log.warn(\"[contradiction-judge] local LLM call failed: %s\", err instanceof Error ? err.message : err);\n    }\n  }\n\n  if (!llmResponse && fallbackLlm) {\n    try {\n      llmResponse = await callLlm(fallbackLlm, config, userMessage);\n    } catch (err) {\n      log.warn(\"[contradiction-judge] fallback LLM call failed: %s\", err instanceof Error ? err.message : err);\n    }\n  }\n\n  // Parse response or default to needs-user\n  if (llmResponse) {\n    const candidates = extractJsonCandidates(llmResponse);\n    const parsed = parseJudgeResponse(candidates, toJudge);\n\n    for (const result of parsed) {\n      const key = pairKey(result.memoryIdA, result.memoryIdB);\n      results.set(key, result);\n\n      // Update cache\n      const input = toJudge.find(\n        (p) => pairKey(p.memoryIdA, p.memoryIdB) === key,\n      );\n      if (input) {\n        const hash = contentHash(input);\n        if (activeCache.size >= CACHE_MAX) {\n          const firstKey = activeCache.keys().next().value;\n          if (firstKey !== undefined) activeCache.delete(firstKey);\n        }\n        activeCache.set(hash, result);\n      }\n      judged++;\n    }\n  } else {\n    // All unresolved → needs-user (rule 48)\n    for (const pair of toJudge) {\n      const key = pairKey(pair.memoryIdA, pair.memoryIdB);\n      const result: ContradictionJudgeResult = {\n        memoryIdA: pair.memoryIdA,\n        memoryIdB: pair.memoryIdB,\n        verdict: \"needs-user\",\n        rationale: \"LLM call failed; requires manual review\",\n        confidence: 0,\n      };\n      results.set(key, result);\n      judged++;\n    }\n  }\n\n  return { results, cached, judged, elapsed: Date.now() - startTime };\n}\n\n// ── Internals ──────────────────────────────────────────────────────────────────\n\nasync function callLlm(\n  client: LocalLlmClient | FallbackLlmClient,\n  config: PluginConfig,\n  userMessage: string,\n): Promise<string> {\n  const messages: Array<{ role: \"user\" | \"assistant\" | \"system\"; content: string }> = [\n    { role: \"system\", content: CONTRADICTION_JUDGE_PROMPT },\n    { role: \"user\", content: userMessage },\n  ];\n  if (\"chatCompletion\" in client && typeof client.chatCompletion === \"function\") {\n    const result = await client.chatCompletion(messages, {\n      temperature: 0.1,\n      maxTokens: 4096,\n      operation: \"contradiction-judge\",\n    });\n    return result?.content ?? \"\";\n  }\n  // FallbackLlmClient — try OpenAI-compatible chat completions\n  if (\"complete\" in client && typeof (client as Record<string, unknown>).complete === \"function\") {\n    const result = await (client as { complete: (msg: Array<{ role: string; content: string }>) => Promise<{ content: string }> }).complete(messages);\n    return result.content ?? \"\";\n  }\n  return \"\";\n}\n\nfunction parseJudgeResponse(\n  candidates: string[],\n  inputs: ContradictionJudgeInput[],\n): ContradictionJudgeResult[] {\n  const VALID_VERDICTS: ContradictionVerdict[] = [\"contradicts\", \"independent\", \"duplicates\", \"needs-user\"];\n  let conservativeFallback: ContradictionJudgeResult[] | null = null;\n\n  for (const candidate of candidates) {\n    try {\n      const parsed = JSON.parse(candidate);\n      const items = Array.isArray(parsed) ? parsed : [parsed];\n      const results: ContradictionJudgeResult[] = [];\n      const matchedKeys = new Set<string>();\n\n      for (const item of items) {\n        if (!item || typeof item !== \"object\") continue;\n\n        const verdict = typeof item.verdict === \"string\" && VALID_VERDICTS.includes(item.verdict as ContradictionVerdict)\n          ? (item.verdict as ContradictionVerdict)\n          : \"needs-user\";\n\n        const pairKeyVal = typeof item.pairKey === \"string\" && item.pairKey.length > 0\n          ? item.pairKey\n          : null;\n        const input = pairKeyVal\n          ? inputs.find((p) => pairKey(p.memoryIdA, p.memoryIdB) === pairKeyVal)\n          : null;\n\n        if (!input) continue;\n\n        matchedKeys.add(pairKey(input.memoryIdA, input.memoryIdB));\n\n        const confidence = typeof item.confidence === \"number\"\n          ? Math.min(1, Math.max(0, item.confidence))\n          : 0.5;\n\n        results.push({\n          memoryIdA: input.memoryIdA,\n          memoryIdB: input.memoryIdB,\n          verdict,\n          rationale: typeof item.rationale === \"string\" ? item.rationale : \"No rationale provided\",\n          confidence,\n        });\n      }\n\n      // Backfill any inputs the LLM omitted with needs-user\n      for (const inp of inputs) {\n        const key = pairKey(inp.memoryIdA, inp.memoryIdB);\n        if (!matchedKeys.has(key)) {\n          results.push({\n            memoryIdA: inp.memoryIdA,\n            memoryIdB: inp.memoryIdB,\n            verdict: \"needs-user\",\n            rationale: \"LLM response omitted this pair\",\n            confidence: 0,\n          });\n        }\n      }\n\n      if (matchedKeys.size > 0) return results;\n      if (results.length > 0 && conservativeFallback === null) {\n        conservativeFallback = results;\n      }\n    } catch {\n      continue;\n    }\n  }\n\n  if (conservativeFallback !== null) return conservativeFallback;\n\n  // All parse attempts failed → needs-user for every input\n  return inputs.map((p) => ({\n    memoryIdA: p.memoryIdA,\n    memoryIdB: p.memoryIdB,\n    verdict: \"needs-user\" as ContradictionVerdict,\n    rationale: \"Failed to parse judge response\",\n    confidence: 0,\n  }));\n}\n\nexport { pairKey as _pairKey, contentHash as _contentHash };\n","/**\n * Contradiction Scan — pair generator + scan driver (issue #520).\n *\n * Nightly cron that pairs semantically-similar active memories within\n * the same namespace, sends candidate pairs to the LLM-as-judge\n * contradiction classifier, and drops contradicting pairs into a\n * review queue for user resolution.\n *\n * Pair generation (cheap pre-filter):\n *   1. Find candidate peers via embedding cosine >= similarityFloor.\n *   2. Restrict to pairs sharing at least one entityRef OR overlapping\n *      topic tokens >= topicOverlapFloor.\n *   3. Skip pairs already judged independent/both-valid within cooldown.\n *   4. Cap per-run work at maxPairsPerRun.\n */\n\nimport { resolveNamespaceCapabilities } from \"../capabilities.js\";\nimport type { StorageManager } from \"../storage.js\";\nimport type { PluginConfig, MemoryFile, MemoryStatus } from \"../types.js\";\nimport type { SemanticDedupLookup } from \"../dedup/semantic.js\";\nimport { log } from \"../logger.js\";\nimport { judgeContradictionPairs, type ContradictionJudgeInput } from \"./contradiction-judge.js\";\nimport {\n  writePairs,\n  readPair,\n  isCoolingDown,\n  memoryHashesChanged,\n  computeMemoryContentHash,\n  computePairId,\n  migrateUnscopedPairsToNamespace,\n  type ContradictionPair,\n} from \"./contradiction-review.js\";\nimport type { LocalLlmClient } from \"../local-llm.js\";\nimport type { FallbackLlmClient } from \"../fallback-llm.js\";\nimport { isSupportPassportPrivateMemory } from \"../support-passport/card-projection.js\";\n\n// ── Types ──────────────────────────────────────────────────────────────────────\n\n/** The set of statuses that represent \"live\" memories eligible for scanning. */\nexport const ACTIVE_STATUSES: Set<MemoryStatus> = new Set([\"active\"]);\n\n/** High-value taxonomy buckets to scan. */\nconst SCAN_CATEGORIES = new Set([\n  \"decision\",\n  \"principle\",\n  \"rule\",\n  \"entity\",\n  \"fact\",\n  \"preference\",\n]);\n\nexport interface ScanResult {\n  /** Total active memories scanned. */\n  scanned: number;\n  /** Candidate pairs generated by the pre-filter. */\n  candidates: number;\n  /** Pairs sent to judge. */\n  judged: number;\n  /** Pairs written to review queue. */\n  queued: number;\n  /** Pairs skipped due to cooldown. */\n  cooledDown: number;\n  /** Total wall-clock time in ms. */\n  elapsedMs: number;\n}\n\nexport interface ScanStorageResolution {\n  storage: StorageManager;\n  namespace?: string;\n}\n\nexport interface ScanDependencies {\n  storage: StorageManager;\n  config: PluginConfig;\n  memoryDir: string;\n  /** Pre-built embedding lookup. When provided, used as-is for Strategy 3. */\n  embeddingLookup?: SemanticDedupLookup;\n  /**\n   * Factory to build a namespace-scoped embedding lookup.\n   * When provided, takes precedence over `embeddingLookup`.\n   * The scan driver passes its own `storage` so the lookup queries the correct index.\n   */\n  embeddingLookupFactory?: (storage: StorageManager) => SemanticDedupLookup | undefined;\n  /** Resolver for namespace-scoped storage. Required for scans when namespaces are enabled. */\n  storageForNamespace?: (\n    namespace: string | undefined,\n  ) => StorageManager | ScanStorageResolution | Promise<StorageManager | ScanStorageResolution>;\n  localLlm: LocalLlmClient | null;\n  fallbackLlm: FallbackLlmClient | null;\n  namespace?: string;\n}\n\n// ── Main scan driver ───────────────────────────────────────────────────────────\n\n/**\n * Run a contradiction scan over the memory corpus.\n *\n * This is the entry point called by the nightly cron and by the CLI.\n */\nexport async function runContradictionScan(deps: ScanDependencies): Promise<ScanResult> {\n  const startTime = Date.now();\n  const { config, memoryDir, embeddingLookup, embeddingLookupFactory, localLlm, fallbackLlm } = deps;\n  const requestedNamespace = normalizeScanNamespace(deps.namespace);\n  const scanConfig = config.contradictionScan;\n\n  if (!scanConfig.enabled) {\n    log.info(\"[contradiction-scan] disabled by config\");\n    return { scanned: 0, candidates: 0, judged: 0, queued: 0, cooledDown: 0, elapsedMs: 0 };\n  }\n\n  const { storage: scanStorage, namespace } = await resolveScanStorage(deps, requestedNamespace);\n  if (resolveNamespaceCapabilities(config).namespaces && namespace !== undefined && isDefaultNamespaceScan(config, requestedNamespace, namespace)) {\n    const migrated = migrateUnscopedPairsToNamespace(memoryDir, namespace, { cooldownDays: scanConfig.cooldownDays });\n    if (migrated > 0) {\n      log.info(\"[contradiction-scan] migrated %d legacy unscoped review pairs to namespace %s\", migrated, namespace);\n    }\n  }\n\n  // Prefer the factory (which uses the scan's own storage for correct namespace scoping)\n  // over a pre-built lookup (which may use default-namespace storage).\n  const scopedEmbeddingLookup = embeddingLookupFactory\n    ? embeddingLookupFactory(scanStorage)\n    : embeddingLookup;\n\n  // 1. Load active memories in scan categories\n  const memories = await loadEligibleMemories(scanStorage);\n  log.info(\"[contradiction-scan] loaded %d eligible memories\", memories.length);\n\n  if (memories.length < 2) {\n    return { scanned: memories.length, candidates: 0, judged: 0, queued: 0, cooledDown: 0, elapsedMs: Date.now() - startTime };\n  }\n\n  // 2. Prepare exact existing-pair lookup for cooldown checking.\n  // Pair IDs are deterministic, so lookup the candidate's file directly instead\n  // of paging through the review queue and risking a bounded-list miss.\n  const existingPairCache = new Map<string, ContradictionPair | undefined>();\n  const getExistingPair = (pairId: string): ContradictionPair | undefined => {\n    if (!existingPairCache.has(pairId)) {\n      existingPairCache.set(pairId, readPair(memoryDir, pairId) ?? undefined);\n    }\n    return existingPairCache.get(pairId);\n  };\n\n  // 3. Generate candidate pairs\n  const candidates = await generatePairs(memories, getExistingPair, scanConfig, namespace, scopedEmbeddingLookup);\n  const cooledDown = candidates.skipped;\n  log.info(\"[contradiction-scan] generated %d candidates (%d cooled down)\", candidates.pairs.length, cooledDown);\n\n  if (candidates.pairs.length === 0) {\n    return {\n      scanned: memories.length,\n      candidates: 0,\n      judged: 0,\n      queued: 0,\n      cooledDown,\n      elapsedMs: Date.now() - startTime,\n    };\n  }\n\n  // 4. Build judge inputs. Candidate generation already preserves strategy\n  // priority and caps work at maxPairsPerRun.\n  const judgeInputs: ContradictionJudgeInput[] = candidates.pairs.map((pair) => ({\n    memoryIdA: pair.idA,\n    memoryIdB: pair.idB,\n    textA: pair.textA,\n    textB: pair.textB,\n    categoryA: pair.categoryA,\n    categoryB: pair.categoryB,\n  }));\n\n  // 6. Send to judge (per-scan cache avoids module-level singleton leak)\n  const scanCache = new Map<string, import(\"./contradiction-judge.js\").ContradictionJudgeResult>();\n  const judgeResult = await judgeContradictionPairs(judgeInputs, config, localLlm, fallbackLlm, scanCache);\n  log.info(\"[contradiction-scan] judge completed: %d judged, %d cached in %dms\", judgeResult.judged, judgeResult.cached, judgeResult.elapsed);\n\n  // 7. Write to review queue\n  const queueEntries: Array<Omit<ContradictionPair, \"pairId\"> & { memoryIds: [string, string] }> = [];\n  const currentMemoryHashes = memoryContentHashMap(memories);\n  for (const [key, result] of judgeResult.results) {\n    queueEntries.push({\n      memoryIds: [result.memoryIdA, result.memoryIdB],\n      verdict: result.verdict,\n      rationale: result.rationale,\n      confidence: result.confidence,\n      detectedAt: new Date().toISOString(),\n      // Set lastReviewedAt for non-actionable verdicts so cooldown prevents re-judging\n      lastReviewedAt: result.verdict === \"independent\" ? new Date().toISOString() : undefined,\n      memoryContentHashes: pairMemoryContentHashes(result.memoryIdA, result.memoryIdB, currentMemoryHashes),\n      namespace,\n    });\n  }\n\n  const written = writePairs(memoryDir, queueEntries, { cooldownDays: scanConfig.cooldownDays });\n  const elapsed = Date.now() - startTime;\n  log.info(\"[contradiction-scan] complete: %d queued in %dms\", written.length, elapsed);\n\n  return {\n    scanned: memories.length,\n    candidates: candidates.pairs.length,\n    judged: judgeResult.judged,\n    queued: written.length,\n    cooledDown,\n    elapsedMs: elapsed,\n  };\n}\n\n// ── Pair generation ────────────────────────────────────────────────────────────\n\ninterface CandidatePair {\n  idA: string;\n  idB: string;\n  textA: string;\n  textB: string;\n  categoryA?: string;\n  categoryB?: string;\n}\n\ninterface PairGenResult {\n  pairs: CandidatePair[];\n  skipped: number;\n}\n\nasync function generatePairs(\n  memories: MemoryFile[],\n  getExistingPair: (pairId: string) => ContradictionPair | undefined,\n  scanConfig: PluginConfig[\"contradictionScan\"],\n  namespace: string | undefined,\n  embeddingLookup?: SemanticDedupLookup,\n): Promise<PairGenResult> {\n  const pairs: CandidatePair[] = [];\n  let skipped = 0;\n  const seen = new Set<string>();\n  const maxPairs = Math.max(0, Math.floor(scanConfig.maxPairsPerRun));\n  if (maxPairs === 0) return { pairs, skipped };\n\n  const orderedMemories = [...memories].sort(compareMemoryId);\n  const currentMemoryHashes = memoryContentHashMap(orderedMemories);\n\n  const pushCandidate = (pair: CandidatePair): void => {\n    if (pairs.length < maxPairs) pairs.push(pair);\n  };\n\n  const hasCapacity = (): boolean => pairs.length < maxPairs;\n  const isSkippedByCooldown = (existing: ContradictionPair | undefined): boolean => {\n    if (!existing || !isCoolingDown(existing, scanConfig.cooldownDays)) return false;\n    return !memoryHashesChanged(\"\", existing, (memoryId) => currentMemoryHashes.get(memoryId) ?? null);\n  };\n\n  // Build index by entityRef for fast lookup\n  const byEntity = new Map<string, MemoryFile[]>();\n  for (const mem of orderedMemories) {\n    const entity = mem.frontmatter.entityRef;\n    if (entity) {\n      const existing = byEntity.get(entity) ?? [];\n      existing.push(mem);\n      byEntity.set(entity, existing);\n    }\n  }\n\n  // Strategy 1: Entity-ref based pairing (high precision)\n  entityPairs:\n  for (const entity of [...byEntity.keys()].sort()) {\n    const group = byEntity.get(entity) ?? [];\n    if (group.length < 2) continue;\n    for (let i = 0; i < group.length; i++) {\n      for (let j = i + 1; j < group.length; j++) {\n        if (!hasCapacity()) break entityPairs;\n        const a = group[i];\n        const b = group[j];\n        const pairId = computePairId(a.frontmatter.id!, b.frontmatter.id!, namespace);\n\n        if (seen.has(pairId)) continue;\n        seen.add(pairId);\n\n        // Check cooldown\n        const existing = getExistingPair(pairId);\n        if (isSkippedByCooldown(existing)) {\n          skipped++;\n          continue;\n        }\n\n        pushCandidate({\n          idA: a.frontmatter.id!,\n          idB: b.frontmatter.id!,\n          textA: a.content,\n          textB: b.content,\n          categoryA: a.frontmatter.category as string | undefined,\n          categoryB: b.frontmatter.category as string | undefined,\n        });\n      }\n    }\n  }\n\n  // Strategy 2: Tag/topic overlap for memories without a shared entityRef\n  topicPairs:\n  for (let i = 0; i < orderedMemories.length; i++) {\n    for (let j = i + 1; j < orderedMemories.length; j++) {\n      if (!hasCapacity()) break topicPairs;\n      const a = orderedMemories[i];\n      const b = orderedMemories[j];\n      if (shareEntityRef(a, b)) continue;\n      const overlap = jaccardOverlap(\n        (a.frontmatter.tags as string[]) ?? [],\n        (b.frontmatter.tags as string[]) ?? [],\n      );\n\n      if (overlap < scanConfig.topicOverlapFloor) continue;\n\n      const pairId = computePairId(a.frontmatter.id!, b.frontmatter.id!, namespace);\n      if (seen.has(pairId)) continue;\n      seen.add(pairId);\n\n      const existing = getExistingPair(pairId);\n      if (isSkippedByCooldown(existing)) {\n        skipped++;\n        continue;\n      }\n\n      pushCandidate({\n        idA: a.frontmatter.id!,\n        idB: b.frontmatter.id!,\n        textA: a.content,\n        textB: b.content,\n        categoryA: a.frontmatter.category as string | undefined,\n        categoryB: b.frontmatter.category as string | undefined,\n      });\n    }\n  }\n\n  // Strategy 3: Embedding cosine similarity (enforces similarityFloor config)\n  if (embeddingLookup && hasCapacity()) {\n    const memoryById = new Map(orderedMemories.map((m) => [m.frontmatter.id!, m]));\n    embeddingPairs:\n    for (const mem of orderedMemories) {\n      if (!hasCapacity()) break;\n      const id = mem.frontmatter.id!;\n      try {\n        const hits = (await embeddingLookup(mem.content, 20)).sort((a, b) =>\n          b.score - a.score || a.id.localeCompare(b.id),\n        );\n        for (const hit of hits) {\n          if (!hasCapacity()) break embeddingPairs;\n          if (hit.score < scanConfig.similarityFloor) continue;\n          if (hit.id === id) continue;\n          const peer = memoryById.get(hit.id);\n          if (!peer) continue;\n\n          const pairId = computePairId(id, hit.id, namespace);\n          if (seen.has(pairId)) continue;\n          seen.add(pairId);\n\n          const existing = getExistingPair(pairId);\n          if (isSkippedByCooldown(existing)) {\n            skipped++;\n            continue;\n          }\n\n          pushCandidate({\n            idA: id,\n            idB: hit.id,\n            textA: mem.content,\n            textB: peer.content,\n            categoryA: mem.frontmatter.category as string | undefined,\n            categoryB: peer.frontmatter.category as string | undefined,\n          });\n        }\n      } catch {\n        // Embedding backend unavailable — skip, entity-ref/tag strategies already covered\n      }\n    }\n  }\n\n  return { pairs, skipped };\n}\n\n// ── Helpers ────────────────────────────────────────────────────────────────────\n\nfunction normalizeScanNamespace(namespace: string | undefined): string | undefined {\n  const trimmed = namespace?.trim();\n  return trimmed ? trimmed : undefined;\n}\n\nasync function resolveScanStorage(\n  deps: ScanDependencies,\n  namespace: string | undefined,\n): Promise<ScanStorageResolution> {\n  if (!resolveNamespaceCapabilities(deps.config).namespaces) {\n    const defaultNamespace = normalizeScanNamespace(deps.config.defaultNamespace);\n    if (namespace && namespace !== defaultNamespace) {\n      throw new Error(`unsupported namespace: ${namespace}`);\n    }\n    return { storage: deps.storage, namespace: undefined };\n  }\n\n  if (deps.storageForNamespace) {\n    const resolved = await deps.storageForNamespace(namespace);\n    if (isScanStorageResolution(resolved)) {\n      return {\n        storage: resolved.storage,\n        namespace: normalizeScanNamespace(resolved.namespace) ?? fallbackResolvedNamespace(deps, namespace),\n      };\n    }\n    if (!isStorageManagerLike(resolved)) {\n      throw new Error(\"storageForNamespace must return a StorageManager or { storage: StorageManager, namespace?: string }\");\n    }\n    return {\n      storage: resolved,\n      namespace: fallbackResolvedNamespace(deps, namespace),\n    };\n  }\n\n  throw new Error(\n    \"contradiction scans require storageForNamespace when namespaces are enabled so callers can enforce namespace access\",\n  );\n}\n\nfunction isScanStorageResolution(value: StorageManager | ScanStorageResolution): value is ScanStorageResolution {\n  if (isStorageManagerLike(value)) return false;\n  if (typeof value !== \"object\" || value === null) return false;\n  const candidate = value as { storage?: unknown };\n  return isStorageManagerLike(candidate.storage);\n}\n\nfunction isStorageManagerLike(value: unknown): value is StorageManager {\n  if (typeof value !== \"object\" || value === null) return false;\n  const candidate = value as { readAllMemories?: unknown };\n  return typeof candidate.readAllMemories === \"function\";\n}\n\nfunction fallbackResolvedNamespace(deps: ScanDependencies, namespace: string | undefined): string | undefined {\n  if (namespace) return namespace;\n  return resolveNamespaceCapabilities(deps.config).namespaces ? deps.config.defaultNamespace : undefined;\n}\n\nfunction isDefaultNamespaceScan(\n  config: PluginConfig,\n  requestedNamespace: string | undefined,\n  resolvedNamespace: string,\n): boolean {\n  if (requestedNamespace === undefined) return true;\n  return requestedNamespace === config.defaultNamespace || resolvedNamespace === config.defaultNamespace;\n}\n\nasync function loadEligibleMemories(storage: StorageManager): Promise<MemoryFile[]> {\n  let all: MemoryFile[];\n  try {\n    all = await storage.readAllMemories();\n  } catch {\n    return [];\n  }\n\n  return all.filter((mem) => {\n    const fm = mem.frontmatter;\n    if (isSupportPassportPrivateMemory(mem)) return false;\n    // Only active memories (rule 53: explicit ACTIVE_STATUSES set)\n    const status = (fm.status as MemoryStatus) ?? \"active\";\n    if (!ACTIVE_STATUSES.has(status)) return false;\n\n    // Only scan high-value categories\n    const category = fm.category as string | undefined;\n    if (category && !SCAN_CATEGORIES.has(category)) return false;\n\n    // Must have content\n    if (!mem.content || mem.content.trim().length === 0) return false;\n\n    // Must have an ID\n    if (!fm.id) return false;\n\n    return true;\n  });\n}\n\nfunction jaccardOverlap(a: string[], b: string[]): number {\n  if (a.length === 0 && b.length === 0) return 0;\n  const setA = new Set(a.map((t) => t.toLowerCase()));\n  const setB = new Set(b.map((t) => t.toLowerCase()));\n  let intersection = 0;\n  for (const item of setA) {\n    if (setB.has(item)) intersection++;\n  }\n  const union = setA.size + setB.size - intersection;\n  return union === 0 ? 0 : intersection / union;\n}\n\nfunction shareEntityRef(a: MemoryFile, b: MemoryFile): boolean {\n  const entityA = a.frontmatter.entityRef?.trim();\n  const entityB = b.frontmatter.entityRef?.trim();\n  return Boolean(entityA && entityB && entityA === entityB);\n}\n\nfunction compareMemoryId(a: MemoryFile, b: MemoryFile): number {\n  return (a.frontmatter.id ?? \"\").localeCompare(b.frontmatter.id ?? \"\");\n}\n\nfunction memoryContentHashMap(memories: MemoryFile[]): Map<string, string> {\n  const hashes = new Map<string, string>();\n  for (const memory of memories) {\n    const id = memory.frontmatter.id;\n    if (!id) continue;\n    hashes.set(id, computeMemoryContentHash(memory.content, memory.frontmatter.category as string | undefined));\n  }\n  return hashes;\n}\n\nfunction pairMemoryContentHashes(\n  memoryIdA: string,\n  memoryIdB: string,\n  currentMemoryHashes: Map<string, string>,\n): Record<string, string> | undefined {\n  const hashA = currentMemoryHashes.get(memoryIdA);\n  const hashB = currentMemoryHashes.get(memoryIdB);\n  if (!hashA || !hashB) return undefined;\n  return {\n    [memoryIdA]: hashA,\n    [memoryIdB]: hashB,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAaA,SAAS,kBAAkB;AAuD3B,IAAM,6BAA6B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAuBnC,IAAI,sBAA6D,oBAAI,IAAI;AACzE,IAAM,YAAY;AAElB,SAAS,QAAQ,KAAa,KAAqB;AACjD,QAAM,SAAS,CAAC,KAAK,GAAG,EAAE,KAAK;AAC/B,SAAO,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC;AAClC;AAEA,SAAS,YAAY,GAAoC;AAEvD,QAAM,QAAQ;AAAA,IACZ,EAAE,MAAM,EAAE,MAAM,KAAK,GAAG,WAAW,EAAE,aAAa,IAAI,KAAK,EAAE;AAAA,IAC7D,EAAE,MAAM,EAAE,MAAM,KAAK,GAAG,WAAW,EAAE,aAAa,IAAI,KAAK,EAAE;AAAA,EAC/D,EAAE,KAAK,CAAC,MAAM,UAAU;AACtB,UAAM,UAAU,KAAK,UAAU,IAAI;AACnC,UAAM,WAAW,KAAK,UAAU,KAAK;AACrC,WAAO,QAAQ,cAAc,QAAQ;AAAA,EACvC,CAAC;AACD,QAAM,aAAa,KAAK,UAAU,KAAK;AACvC,SAAO,WAAW,QAAQ,EAAE,OAAO,UAAU,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AAC1E;AAEO,SAAS,qBAA4D;AAC1E,SAAO,oBAAI,IAAI;AACjB;AAEO,SAAS,oBAA0B;AACxC,sBAAoB,MAAM;AAC5B;AAEO,SAAS,mBAA2B;AACzC,SAAO,oBAAoB;AAC7B;AAUA,eAAsB,wBACpB,OACA,QACA,UACA,aACA,OACwC;AACxC,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,UAAU,oBAAI,IAAsC;AAC1D,QAAM,cAAc,SAAS;AAC7B,MAAI,SAAS;AACb,MAAI,SAAS;AAGb,QAAM,UAAqC,CAAC;AAC5C,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,QAAQ,KAAK,WAAW,KAAK,SAAS;AAClD,UAAM,OAAO,YAAY,IAAI;AAC7B,UAAM,eAAe,YAAY,IAAI,IAAI;AACzC,QAAI,cAAc;AAChB,cAAQ,IAAI,KAAK,EAAE,GAAG,cAAc,WAAW,KAAK,WAAW,WAAW,KAAK,UAAU,CAAC;AAC1F;AAAA,IACF,OAAO;AACL,cAAQ,KAAK,IAAI;AAAA,IACnB;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO,EAAE,SAAS,QAAQ,QAAQ,SAAS,KAAK,IAAI,IAAI,UAAU;AAAA,EACpE;AAGA,QAAM,mBAAmB,QAAQ,IAAI,CAAC,GAAG,MAAM;AAC7C,UAAM,KAAK,QAAQ,EAAE,WAAW,EAAE,SAAS;AAC3C,UAAM,OAAO,EAAE,YAAY,KAAK,EAAE,SAAS,MAAM;AACjD,UAAM,OAAO,EAAE,YAAY,KAAK,EAAE,SAAS,MAAM;AACjD,WAAO,QAAQ,IAAI,CAAC,eAAe,EAAE,MAAM,IAAI,KAAK,EAAE,KAAK,IAAI,IAAI,KAAK,EAAE,KAAK;AAAA,EACjF,CAAC;AAED,QAAM,cAAc,kBAAkB,QAAQ,MAAM;AAAA;AAAA,EAAuB,iBAAiB,KAAK,MAAM,CAAC;AAGxG,MAAI,cAA6B;AAEjC,MAAI,UAAU;AACZ,QAAI;AACF,oBAAc,MAAM,QAAQ,UAAU,QAAQ,WAAW;AAAA,IAC3D,SAAS,KAAK;AACZ,UAAI,KAAK,mDAAmD,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IACtG;AAAA,EACF;AAEA,MAAI,CAAC,eAAe,aAAa;AAC/B,QAAI;AACF,oBAAc,MAAM,QAAQ,aAAa,QAAQ,WAAW;AAAA,IAC9D,SAAS,KAAK;AACZ,UAAI,KAAK,sDAAsD,eAAe,QAAQ,IAAI,UAAU,GAAG;AAAA,IACzG;AAAA,EACF;AAGA,MAAI,aAAa;AACf,UAAM,aAAa,sBAAsB,WAAW;AACpD,UAAM,SAAS,mBAAmB,YAAY,OAAO;AAErD,eAAW,UAAU,QAAQ;AAC3B,YAAM,MAAM,QAAQ,OAAO,WAAW,OAAO,SAAS;AACtD,cAAQ,IAAI,KAAK,MAAM;AAGvB,YAAM,QAAQ,QAAQ;AAAA,QACpB,CAAC,MAAM,QAAQ,EAAE,WAAW,EAAE,SAAS,MAAM;AAAA,MAC/C;AACA,UAAI,OAAO;AACT,cAAM,OAAO,YAAY,KAAK;AAC9B,YAAI,YAAY,QAAQ,WAAW;AACjC,gBAAM,WAAW,YAAY,KAAK,EAAE,KAAK,EAAE;AAC3C,cAAI,aAAa,OAAW,aAAY,OAAO,QAAQ;AAAA,QACzD;AACA,oBAAY,IAAI,MAAM,MAAM;AAAA,MAC9B;AACA;AAAA,IACF;AAAA,EACF,OAAO;AAEL,eAAW,QAAQ,SAAS;AAC1B,YAAM,MAAM,QAAQ,KAAK,WAAW,KAAK,SAAS;AAClD,YAAM,SAAmC;AAAA,QACvC,WAAW,KAAK;AAAA,QAChB,WAAW,KAAK;AAAA,QAChB,SAAS;AAAA,QACT,WAAW;AAAA,QACX,YAAY;AAAA,MACd;AACA,cAAQ,IAAI,KAAK,MAAM;AACvB;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,QAAQ,QAAQ,SAAS,KAAK,IAAI,IAAI,UAAU;AACpE;AAIA,eAAe,QACb,QACA,QACA,aACiB;AACjB,QAAM,WAA8E;AAAA,IAClF,EAAE,MAAM,UAAU,SAAS,2BAA2B;AAAA,IACtD,EAAE,MAAM,QAAQ,SAAS,YAAY;AAAA,EACvC;AACA,MAAI,oBAAoB,UAAU,OAAO,OAAO,mBAAmB,YAAY;AAC7E,UAAM,SAAS,MAAM,OAAO,eAAe,UAAU;AAAA,MACnD,aAAa;AAAA,MACb,WAAW;AAAA,MACX,WAAW;AAAA,IACb,CAAC;AACD,WAAO,QAAQ,WAAW;AAAA,EAC5B;AAEA,MAAI,cAAc,UAAU,OAAQ,OAAmC,aAAa,YAAY;AAC9F,UAAM,SAAS,MAAO,OAAyG,SAAS,QAAQ;AAChJ,WAAO,OAAO,WAAW;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,SAAS,mBACP,YACA,QAC4B;AAC5B,QAAM,iBAAyC,CAAC,eAAe,eAAe,cAAc,YAAY;AACxG,MAAI,uBAA0D;AAE9D,aAAW,aAAa,YAAY;AAClC,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,SAAS;AACnC,YAAM,QAAQ,MAAM,QAAQ,MAAM,IAAI,SAAS,CAAC,MAAM;AACtD,YAAM,UAAsC,CAAC;AAC7C,YAAM,cAAc,oBAAI,IAAY;AAEpC,iBAAW,QAAQ,OAAO;AACxB,YAAI,CAAC,QAAQ,OAAO,SAAS,SAAU;AAEvC,cAAM,UAAU,OAAO,KAAK,YAAY,YAAY,eAAe,SAAS,KAAK,OAA+B,IAC3G,KAAK,UACN;AAEJ,cAAM,aAAa,OAAO,KAAK,YAAY,YAAY,KAAK,QAAQ,SAAS,IACzE,KAAK,UACL;AACJ,cAAM,QAAQ,aACV,OAAO,KAAK,CAAC,MAAM,QAAQ,EAAE,WAAW,EAAE,SAAS,MAAM,UAAU,IACnE;AAEJ,YAAI,CAAC,MAAO;AAEZ,oBAAY,IAAI,QAAQ,MAAM,WAAW,MAAM,SAAS,CAAC;AAEzD,cAAM,aAAa,OAAO,KAAK,eAAe,WAC1C,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC,IACxC;AAEJ,gBAAQ,KAAK;AAAA,UACX,WAAW,MAAM;AAAA,UACjB,WAAW,MAAM;AAAA,UACjB;AAAA,UACA,WAAW,OAAO,KAAK,cAAc,WAAW,KAAK,YAAY;AAAA,UACjE;AAAA,QACF,CAAC;AAAA,MACH;AAGA,iBAAW,OAAO,QAAQ;AACxB,cAAM,MAAM,QAAQ,IAAI,WAAW,IAAI,SAAS;AAChD,YAAI,CAAC,YAAY,IAAI,GAAG,GAAG;AACzB,kBAAQ,KAAK;AAAA,YACX,WAAW,IAAI;AAAA,YACf,WAAW,IAAI;AAAA,YACf,SAAS;AAAA,YACT,WAAW;AAAA,YACX,YAAY;AAAA,UACd,CAAC;AAAA,QACH;AAAA,MACF;AAEA,UAAI,YAAY,OAAO,EAAG,QAAO;AACjC,UAAI,QAAQ,SAAS,KAAK,yBAAyB,MAAM;AACvD,+BAAuB;AAAA,MACzB;AAAA,IACF,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AAEA,MAAI,yBAAyB,KAAM,QAAO;AAG1C,SAAO,OAAO,IAAI,CAAC,OAAO;AAAA,IACxB,WAAW,EAAE;AAAA,IACb,WAAW,EAAE;AAAA,IACb,SAAS;AAAA,IACT,WAAW;AAAA,IACX,YAAY;AAAA,EACd,EAAE;AACJ;;;AC7SO,IAAM,kBAAqC,oBAAI,IAAI,CAAC,QAAQ,CAAC;AAGpE,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAkDD,eAAsB,qBAAqB,MAA6C;AACtF,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,EAAE,QAAQ,WAAW,iBAAiB,wBAAwB,UAAU,YAAY,IAAI;AAC9F,QAAM,qBAAqB,uBAAuB,KAAK,SAAS;AAChE,QAAM,aAAa,OAAO;AAE1B,MAAI,CAAC,WAAW,SAAS;AACvB,QAAI,KAAK,yCAAyC;AAClD,WAAO,EAAE,SAAS,GAAG,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,YAAY,GAAG,WAAW,EAAE;AAAA,EACxF;AAEA,QAAM,EAAE,SAAS,aAAa,UAAU,IAAI,MAAM,mBAAmB,MAAM,kBAAkB;AAC7F,MAAI,6BAA6B,MAAM,EAAE,cAAc,cAAc,UAAa,uBAAuB,QAAQ,oBAAoB,SAAS,GAAG;AAC/I,UAAM,WAAW,gCAAgC,WAAW,WAAW,EAAE,cAAc,WAAW,aAAa,CAAC;AAChH,QAAI,WAAW,GAAG;AAChB,UAAI,KAAK,iFAAiF,UAAU,SAAS;AAAA,IAC/G;AAAA,EACF;AAIA,QAAM,wBAAwB,yBAC1B,uBAAuB,WAAW,IAClC;AAGJ,QAAM,WAAW,MAAM,qBAAqB,WAAW;AACvD,MAAI,KAAK,oDAAoD,SAAS,MAAM;AAE5E,MAAI,SAAS,SAAS,GAAG;AACvB,WAAO,EAAE,SAAS,SAAS,QAAQ,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,YAAY,GAAG,WAAW,KAAK,IAAI,IAAI,UAAU;AAAA,EAC3H;AAKA,QAAM,oBAAoB,oBAAI,IAA2C;AACzE,QAAM,kBAAkB,CAAC,WAAkD;AACzE,QAAI,CAAC,kBAAkB,IAAI,MAAM,GAAG;AAClC,wBAAkB,IAAI,QAAQ,SAAS,WAAW,MAAM,KAAK,MAAS;AAAA,IACxE;AACA,WAAO,kBAAkB,IAAI,MAAM;AAAA,EACrC;AAGA,QAAM,aAAa,MAAM,cAAc,UAAU,iBAAiB,YAAY,WAAW,qBAAqB;AAC9G,QAAM,aAAa,WAAW;AAC9B,MAAI,KAAK,iEAAiE,WAAW,MAAM,QAAQ,UAAU;AAE7G,MAAI,WAAW,MAAM,WAAW,GAAG;AACjC,WAAO;AAAA,MACL,SAAS,SAAS;AAAA,MAClB,YAAY;AAAA,MACZ,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR;AAAA,MACA,WAAW,KAAK,IAAI,IAAI;AAAA,IAC1B;AAAA,EACF;AAIA,QAAM,cAAyC,WAAW,MAAM,IAAI,CAAC,UAAU;AAAA,IAC7E,WAAW,KAAK;AAAA,IAChB,WAAW,KAAK;AAAA,IAChB,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK;AAAA,IACZ,WAAW,KAAK;AAAA,IAChB,WAAW,KAAK;AAAA,EAClB,EAAE;AAGF,QAAM,YAAY,oBAAI,IAAyE;AAC/F,QAAM,cAAc,MAAM,wBAAwB,aAAa,QAAQ,UAAU,aAAa,SAAS;AACvG,MAAI,KAAK,sEAAsE,YAAY,QAAQ,YAAY,QAAQ,YAAY,OAAO;AAG1I,QAAM,eAA2F,CAAC;AAClG,QAAM,sBAAsB,qBAAqB,QAAQ;AACzD,aAAW,CAAC,KAAK,MAAM,KAAK,YAAY,SAAS;AAC/C,iBAAa,KAAK;AAAA,MAChB,WAAW,CAAC,OAAO,WAAW,OAAO,SAAS;AAAA,MAC9C,SAAS,OAAO;AAAA,MAChB,WAAW,OAAO;AAAA,MAClB,YAAY,OAAO;AAAA,MACnB,aAAY,oBAAI,KAAK,GAAE,YAAY;AAAA;AAAA,MAEnC,gBAAgB,OAAO,YAAY,iBAAgB,oBAAI,KAAK,GAAE,YAAY,IAAI;AAAA,MAC9E,qBAAqB,wBAAwB,OAAO,WAAW,OAAO,WAAW,mBAAmB;AAAA,MACpG;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,UAAU,WAAW,WAAW,cAAc,EAAE,cAAc,WAAW,aAAa,CAAC;AAC7F,QAAM,UAAU,KAAK,IAAI,IAAI;AAC7B,MAAI,KAAK,oDAAoD,QAAQ,QAAQ,OAAO;AAEpF,SAAO;AAAA,IACL,SAAS,SAAS;AAAA,IAClB,YAAY,WAAW,MAAM;AAAA,IAC7B,QAAQ,YAAY;AAAA,IACpB,QAAQ,QAAQ;AAAA,IAChB;AAAA,IACA,WAAW;AAAA,EACb;AACF;AAkBA,eAAe,cACb,UACA,iBACA,YACA,WACA,iBACwB;AACxB,QAAM,QAAyB,CAAC;AAChC,MAAI,UAAU;AACd,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,WAAW,KAAK,IAAI,GAAG,KAAK,MAAM,WAAW,cAAc,CAAC;AAClE,MAAI,aAAa,EAAG,QAAO,EAAE,OAAO,QAAQ;AAE5C,QAAM,kBAAkB,CAAC,GAAG,QAAQ,EAAE,KAAK,eAAe;AAC1D,QAAM,sBAAsB,qBAAqB,eAAe;AAEhE,QAAM,gBAAgB,CAAC,SAA8B;AACnD,QAAI,MAAM,SAAS,SAAU,OAAM,KAAK,IAAI;AAAA,EAC9C;AAEA,QAAM,cAAc,MAAe,MAAM,SAAS;AAClD,QAAM,sBAAsB,CAAC,aAAqD;AAChF,QAAI,CAAC,YAAY,CAAC,cAAc,UAAU,WAAW,YAAY,EAAG,QAAO;AAC3E,WAAO,CAAC,oBAAoB,IAAI,UAAU,CAAC,aAAa,oBAAoB,IAAI,QAAQ,KAAK,IAAI;AAAA,EACnG;AAGA,QAAM,WAAW,oBAAI,IAA0B;AAC/C,aAAW,OAAO,iBAAiB;AACjC,UAAM,SAAS,IAAI,YAAY;AAC/B,QAAI,QAAQ;AACV,YAAM,WAAW,SAAS,IAAI,MAAM,KAAK,CAAC;AAC1C,eAAS,KAAK,GAAG;AACjB,eAAS,IAAI,QAAQ,QAAQ;AAAA,IAC/B;AAAA,EACF;AAGA;AACA,eAAW,UAAU,CAAC,GAAG,SAAS,KAAK,CAAC,EAAE,KAAK,GAAG;AAChD,YAAM,QAAQ,SAAS,IAAI,MAAM,KAAK,CAAC;AACvC,UAAI,MAAM,SAAS,EAAG;AACtB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,iBAAS,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACzC,cAAI,CAAC,YAAY,EAAG,OAAM;AAC1B,gBAAM,IAAI,MAAM,CAAC;AACjB,gBAAM,IAAI,MAAM,CAAC;AACjB,gBAAM,SAAS,cAAc,EAAE,YAAY,IAAK,EAAE,YAAY,IAAK,SAAS;AAE5E,cAAI,KAAK,IAAI,MAAM,EAAG;AACtB,eAAK,IAAI,MAAM;AAGf,gBAAM,WAAW,gBAAgB,MAAM;AACvC,cAAI,oBAAoB,QAAQ,GAAG;AACjC;AACA;AAAA,UACF;AAEA,wBAAc;AAAA,YACZ,KAAK,EAAE,YAAY;AAAA,YACnB,KAAK,EAAE,YAAY;AAAA,YACnB,OAAO,EAAE;AAAA,YACT,OAAO,EAAE;AAAA,YACT,WAAW,EAAE,YAAY;AAAA,YACzB,WAAW,EAAE,YAAY;AAAA,UAC3B,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAGA;AACA,aAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AAC/C,eAAS,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AACnD,YAAI,CAAC,YAAY,EAAG,OAAM;AAC1B,cAAM,IAAI,gBAAgB,CAAC;AAC3B,cAAM,IAAI,gBAAgB,CAAC;AAC3B,YAAI,eAAe,GAAG,CAAC,EAAG;AAC1B,cAAM,UAAU;AAAA,UACb,EAAE,YAAY,QAAqB,CAAC;AAAA,UACpC,EAAE,YAAY,QAAqB,CAAC;AAAA,QACvC;AAEA,YAAI,UAAU,WAAW,kBAAmB;AAE5C,cAAM,SAAS,cAAc,EAAE,YAAY,IAAK,EAAE,YAAY,IAAK,SAAS;AAC5E,YAAI,KAAK,IAAI,MAAM,EAAG;AACtB,aAAK,IAAI,MAAM;AAEf,cAAM,WAAW,gBAAgB,MAAM;AACvC,YAAI,oBAAoB,QAAQ,GAAG;AACjC;AACA;AAAA,QACF;AAEA,sBAAc;AAAA,UACZ,KAAK,EAAE,YAAY;AAAA,UACnB,KAAK,EAAE,YAAY;AAAA,UACnB,OAAO,EAAE;AAAA,UACT,OAAO,EAAE;AAAA,UACT,WAAW,EAAE,YAAY;AAAA,UACzB,WAAW,EAAE,YAAY;AAAA,QAC3B,CAAC;AAAA,MACH;AAAA,IACF;AAGA,MAAI,mBAAmB,YAAY,GAAG;AACpC,UAAM,aAAa,IAAI,IAAI,gBAAgB,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,IAAK,CAAC,CAAC,CAAC;AAC7E;AACA,iBAAW,OAAO,iBAAiB;AACjC,YAAI,CAAC,YAAY,EAAG;AACpB,cAAM,KAAK,IAAI,YAAY;AAC3B,YAAI;AACF,gBAAM,QAAQ,MAAM,gBAAgB,IAAI,SAAS,EAAE,GAAG;AAAA,YAAK,CAAC,GAAG,MAC7D,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,cAAc,EAAE,EAAE;AAAA,UAC9C;AACA,qBAAW,OAAO,MAAM;AACtB,gBAAI,CAAC,YAAY,EAAG,OAAM;AAC1B,gBAAI,IAAI,QAAQ,WAAW,gBAAiB;AAC5C,gBAAI,IAAI,OAAO,GAAI;AACnB,kBAAM,OAAO,WAAW,IAAI,IAAI,EAAE;AAClC,gBAAI,CAAC,KAAM;AAEX,kBAAM,SAAS,cAAc,IAAI,IAAI,IAAI,SAAS;AAClD,gBAAI,KAAK,IAAI,MAAM,EAAG;AACtB,iBAAK,IAAI,MAAM;AAEf,kBAAM,WAAW,gBAAgB,MAAM;AACvC,gBAAI,oBAAoB,QAAQ,GAAG;AACjC;AACA;AAAA,YACF;AAEA,0BAAc;AAAA,cACZ,KAAK;AAAA,cACL,KAAK,IAAI;AAAA,cACT,OAAO,IAAI;AAAA,cACX,OAAO,KAAK;AAAA,cACZ,WAAW,IAAI,YAAY;AAAA,cAC3B,WAAW,KAAK,YAAY;AAAA,YAC9B,CAAC;AAAA,UACH;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,QAAQ;AAC1B;AAIA,SAAS,uBAAuB,WAAmD;AACjF,QAAM,UAAU,WAAW,KAAK;AAChC,SAAO,UAAU,UAAU;AAC7B;AAEA,eAAe,mBACb,MACA,WACgC;AAChC,MAAI,CAAC,6BAA6B,KAAK,MAAM,EAAE,YAAY;AACzD,UAAM,mBAAmB,uBAAuB,KAAK,OAAO,gBAAgB;AAC5E,QAAI,aAAa,cAAc,kBAAkB;AAC/C,YAAM,IAAI,MAAM,0BAA0B,SAAS,EAAE;AAAA,IACvD;AACA,WAAO,EAAE,SAAS,KAAK,SAAS,WAAW,OAAU;AAAA,EACvD;AAEA,MAAI,KAAK,qBAAqB;AAC5B,UAAM,WAAW,MAAM,KAAK,oBAAoB,SAAS;AACzD,QAAI,wBAAwB,QAAQ,GAAG;AACrC,aAAO;AAAA,QACL,SAAS,SAAS;AAAA,QAClB,WAAW,uBAAuB,SAAS,SAAS,KAAK,0BAA0B,MAAM,SAAS;AAAA,MACpG;AAAA,IACF;AACA,QAAI,CAAC,qBAAqB,QAAQ,GAAG;AACnC,YAAM,IAAI,MAAM,qGAAqG;AAAA,IACvH;AACA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,WAAW,0BAA0B,MAAM,SAAS;AAAA,IACtD;AAAA,EACF;AAEA,QAAM,IAAI;AAAA,IACR;AAAA,EACF;AACF;AAEA,SAAS,wBAAwB,OAA+E;AAC9G,MAAI,qBAAqB,KAAK,EAAG,QAAO;AACxC,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,YAAY;AAClB,SAAO,qBAAqB,UAAU,OAAO;AAC/C;AAEA,SAAS,qBAAqB,OAAyC;AACrE,MAAI,OAAO,UAAU,YAAY,UAAU,KAAM,QAAO;AACxD,QAAM,YAAY;AAClB,SAAO,OAAO,UAAU,oBAAoB;AAC9C;AAEA,SAAS,0BAA0B,MAAwB,WAAmD;AAC5G,MAAI,UAAW,QAAO;AACtB,SAAO,6BAA6B,KAAK,MAAM,EAAE,aAAa,KAAK,OAAO,mBAAmB;AAC/F;AAEA,SAAS,uBACP,QACA,oBACA,mBACS;AACT,MAAI,uBAAuB,OAAW,QAAO;AAC7C,SAAO,uBAAuB,OAAO,oBAAoB,sBAAsB,OAAO;AACxF;AAEA,eAAe,qBAAqB,SAAgD;AAClF,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,QAAQ,gBAAgB;AAAA,EACtC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AAEA,SAAO,IAAI,OAAO,CAAC,QAAQ;AACzB,UAAM,KAAK,IAAI;AACf,QAAI,+BAA+B,GAAG,EAAG,QAAO;AAEhD,UAAM,SAAU,GAAG,UAA2B;AAC9C,QAAI,CAAC,gBAAgB,IAAI,MAAM,EAAG,QAAO;AAGzC,UAAM,WAAW,GAAG;AACpB,QAAI,YAAY,CAAC,gBAAgB,IAAI,QAAQ,EAAG,QAAO;AAGvD,QAAI,CAAC,IAAI,WAAW,IAAI,QAAQ,KAAK,EAAE,WAAW,EAAG,QAAO;AAG5D,QAAI,CAAC,GAAG,GAAI,QAAO;AAEnB,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,eAAe,GAAa,GAAqB;AACxD,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO;AAC7C,QAAM,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AAClD,QAAM,OAAO,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;AAClD,MAAI,eAAe;AACnB,aAAW,QAAQ,MAAM;AACvB,QAAI,KAAK,IAAI,IAAI,EAAG;AAAA,EACtB;AACA,QAAM,QAAQ,KAAK,OAAO,KAAK,OAAO;AACtC,SAAO,UAAU,IAAI,IAAI,eAAe;AAC1C;AAEA,SAAS,eAAe,GAAe,GAAwB;AAC7D,QAAM,UAAU,EAAE,YAAY,WAAW,KAAK;AAC9C,QAAM,UAAU,EAAE,YAAY,WAAW,KAAK;AAC9C,SAAO,QAAQ,WAAW,WAAW,YAAY,OAAO;AAC1D;AAEA,SAAS,gBAAgB,GAAe,GAAuB;AAC7D,UAAQ,EAAE,YAAY,MAAM,IAAI,cAAc,EAAE,YAAY,MAAM,EAAE;AACtE;AAEA,SAAS,qBAAqB,UAA6C;AACzE,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,UAAU,UAAU;AAC7B,UAAM,KAAK,OAAO,YAAY;AAC9B,QAAI,CAAC,GAAI;AACT,WAAO,IAAI,IAAI,yBAAyB,OAAO,SAAS,OAAO,YAAY,QAA8B,CAAC;AAAA,EAC5G;AACA,SAAO;AACT;AAEA,SAAS,wBACP,WACA,WACA,qBACoC;AACpC,QAAM,QAAQ,oBAAoB,IAAI,SAAS;AAC/C,QAAM,QAAQ,oBAAoB,IAAI,SAAS;AAC/C,MAAI,CAAC,SAAS,CAAC,MAAO,QAAO;AAC7B,SAAO;AAAA,IACL,CAAC,SAAS,GAAG;AAAA,IACb,CAAC,SAAS,GAAG;AAAA,EACf;AACF;","names":[]}