@remnic/core 9.7.14 → 9.8.0

package/dist/chunk-NUWYOKS6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/orchestration/maintenance.ts"],"sourcesContent":["/**\n * Maintenance scheduler — extracted from the orchestrator (issue #1526 PR1).\n *\n * Owns the WHEN of memory maintenance:\n *   - cron auto-registration (writes jobs.json entries the OpenClaw cron\n *     daemon picks up)\n *   - debounced + singleflight QMD index maintenance (re-index + embed\n *     after writes)\n *   - consolidation scheduling trigger (count + interval gated)\n *\n * Does NOT own the WHAT — the actual job runners (runSemanticConsolidation,\n * runPatternReinforcement, runDeepSleepGovernanceNow, runConsolidation)\n * remain on the orchestrator because they need the full LLM + extraction\n * dependency surface. The scheduler invokes consolidation through a\n * callback so the orchestrator stays the source of truth for that work.\n *\n * Behavior-preserving move from orchestrator.ts. No logic changes — the\n * orchestrator keeps thin delegating methods so existing tests that stub\n * `orchestrator.requestQmdMaintenance` etc. continue to work.\n */\n\nimport { resolveNamespaceCapabilities,\n  resolveQmdCapabilities,resolveConsolidationCapabilities, resolveRecallAuxiliaryCapabilities } from \"../capabilities.js\";\nimport { existsSync } from \"node:fs\";\nimport path from \"node:path\";\n\nimport type { PluginConfig } from \"../types.js\";\nimport type { SearchBackend } from \"../search/port.js\";\nimport {\n  NamespaceSearchRouter,\n  type NamespaceUpdateResult,\n} from \"../namespaces/search.js\";\nimport type { NamespaceCatalog } from \"../namespaces/catalog.js\";\nimport {\n  planNamespaceMaintenance,\n  runNamespaceMaintenanceBatchPlan,\n  type NamespaceMaintenancePlan,\n  type NamespaceMaintenanceSkipReason,\n} from \"../maintenance/namespace-planner.js\";\nimport {\n  ensureContradictionScanCron,\n  ensureDaySummaryCron,\n  ensureGraphEdgeDecayCron,\n  ensureNightlyGovernanceCron,\n  ensurePatternReinforcementCron,\n  ensureProceduralMiningCron,\n  graphEdgeDecayCadenceToCronExpr,\n} from \"../maintenance/memory-governance-cron.js\";\nimport { resolveHomeDir } from \"../runtime/env.js\";\nimport { log } from \"../logger.js\";\n\n/** Reason a QMD maintenance pass was skipped, used for status recording. */\nfunction qmdMaintenanceSkipReasonForError(\n  error: unknown,\n): NamespaceMaintenanceSkipReason | null {\n  const message = error instanceof Error ? error.message : String(error);\n  return /^QMD (?:update|embed) skipped by .*min-interval gate$/.test(message)\n    ? \"throttled\"\n    : null;\n}\n\n/** Dependencies injected by the orchestrator. All stable references. */\nexport interface MaintenanceSchedulerDeps {\n  config: PluginConfig;\n  /** Live accessor — the orchestrator can reassign its qmd backend after\n   *  construction (e.g. swap to NoopSearchBackend when the collection is\n   *  missing), and the scheduler must always observe the current backend. */\n  getQmd: () => SearchBackend;\n  namespaceSearchRouter: NamespaceSearchRouter;\n  namespaceCatalog: NamespaceCatalog;\n}\n\n/**\n * Schedules and debounces memory maintenance work. Owns the cadence +\n * singleflight state that previously lived as private orchestrator fields.\n *\n * The orchestrator constructs one instance in its constructor and delegates\n * the public scheduling entrypoints to it. Job execution stays on the\n * orchestrator (LLM-heavy) and is invoked through callbacks.\n */\nexport class MaintenanceScheduler {\n  // ── Consolidation scheduling state ──\n  private nonZeroExtractionsSinceConsolidation = 0;\n  private lastConsolidationRunAtMs = 0;\n  private consolidationInFlight = false;\n\n  // ── QMD maintenance scheduling state ──\n  private qmdMaintenanceTimer: NodeJS.Timeout | null = null;\n  private qmdMaintenancePending = false;\n  private qmdMaintenanceInFlight = false;\n  private lastQmdEmbedAtMs = 0;\n  private lastQmdEmbedAtMsByNamespace = new Map<string, number>();\n\n  constructor(private readonly deps: MaintenanceSchedulerDeps) {}\n\n  // ───────────────────────────────────────────────────────────────────────\n  // Cron auto-registration\n  // ───────────────────────────────────────────────────────────────────────\n\n  /**\n   * Register every cron job the daemon should run, gated by its config flag.\n   * Each registration is independent and non-fatal — a failure in one does\n   * not block the others (mirrors the orchestrator's prior sequential try/\n   * catch behavior exactly).\n   *\n   * Returns when all eligible registrations have completed so callers that\n   * `await deferredReady` can rely on jobs.json being current.\n   */\n  async autoRegisterCrons(_signal: AbortSignal): Promise<void> {\n    if (resolveRecallAuxiliaryCapabilities(this.deps.config).daySummary) {\n      try {\n        await this.autoRegisterDaySummaryCron();\n      } catch (err) {\n        log.debug(`day-summary cron auto-register failed (non-fatal): ${err}`);\n      }\n    }\n    if (this.deps.config.nightlyGovernanceCronAutoRegister) {\n      try {\n        await this.autoRegisterNightlyGovernanceCron();\n      } catch (err) {\n        log.debug(`nightly governance cron auto-register failed (non-fatal): ${err}`);\n      }\n    }\n    if (this.deps.config.procedural?.proceduralMiningCronAutoRegister) {\n      try {\n        await this.autoRegisterProceduralMiningCron();\n      } catch (err) {\n        log.debug(`procedural mining cron auto-register failed (non-fatal): ${err}`);\n      }\n    }\n    if (this.deps.config.contradictionScan?.enabled) {\n      try {\n        await this.autoRegisterContradictionScanCron();\n      } catch (err) {\n        log.debug(`contradiction scan cron auto-register failed (non-fatal): ${err}`);\n      }\n    }\n    if (resolveConsolidationCapabilities(this.deps.config).patternReinforcement) {\n      try {\n        await this.autoRegisterPatternReinforcementCron();\n      } catch (err) {\n        log.debug(`pattern reinforcement cron auto-register failed (non-fatal): ${err}`);\n      }\n    }\n    if (resolveConsolidationCapabilities(this.deps.config).graphEdgeDecay) {\n      try {\n        await this.autoRegisterGraphEdgeDecayCron();\n      } catch (err) {\n        log.debug(`graph edge decay cron auto-register failed (non-fatal): ${err}`);\n      }\n    }\n  }\n\n  async autoRegisterDaySummaryCron(): Promise<void> {\n    const home = resolveHomeDir();\n    const jobsPath = path.join(home, \".openclaw\", \"cron\", \"jobs.json\");\n\n    try {\n      if (!existsSync(jobsPath)) {\n        log.debug(\"day-summary cron: jobs.json not found, skipping auto-register\");\n        return;\n      }\n\n      // Resolve an OpenClaw cron-routing model only in gateway mode. In plugin\n      // mode, summaryModel is a direct-client model id for Remnic's own LLM\n      // calls and may be unroutable as an OpenClaw agentTurn model.\n      const rawSummaryModel = this.deps.config.summaryModel;\n      const taskPrimary = this.deps.config.taskModelChain?.primary;\n      const isGateway = this.deps.config.modelSource === \"gateway\";\n      const model = isGateway ? (rawSummaryModel || taskPrimary || undefined) : undefined;\n      // Attach task-chain fallbacks only when the model matches the task-chain\n      // primary. If summaryModel is a distinct override, its fallbacks would\n      // be unrelated to the task chain. Also append gateway default models as\n      // tail fallbacks (de-duped) so a task-chain outage doesn't stop the cron\n      // before reaching the gateway default chain. Mirrors hourly cron pattern.\n      const fallbacks: string[] = [];\n      if (model && taskPrimary && model === taskPrimary) {\n        const seen = new Set<string>(model ? [model] : []);\n        const addUnique = (value: string | undefined) => {\n          if (typeof value !== \"string\") return;\n          const trimmed = value.trim();\n          if (trimmed.length > 0 && !seen.has(trimmed)) {\n            seen.add(trimmed);\n            fallbacks.push(trimmed);\n          }\n        };\n        for (const fb of this.deps.config.taskModelChain?.fallbacks ?? []) addUnique(fb);\n        const gwDefaults = this.deps.config.gatewayConfig?.agents?.defaults?.model;\n        addUnique(gwDefaults?.primary);\n        if (Array.isArray(gwDefaults?.fallbacks)) {\n          for (const fb of gwDefaults.fallbacks) addUnique(fb);\n        }\n      }\n\n      const timezone =\n        this.deps.config.daySummaryTimezone ||\n        Intl.DateTimeFormat().resolvedOptions().timeZone;\n\n      const result = await ensureDaySummaryCron(jobsPath, {\n        timezone,\n        ...(model ? { model } : {}),\n        ...(fallbacks.length > 0 ? { fallbacks } : {}),\n      });\n      if (result.created) {\n        log.info(\n          `day-summary cron auto-registered (${result.jobId}, 23:47 ${timezone}${model ? `, model: ${model}` : \"\"})`,\n        );\n      } else if (result.updated) {\n        log.info(\n          `day-summary cron reconciled (${result.jobId}, timezone: ${timezone}${model ? `, model: ${model}` : \"\"})`,\n        );\n      } else {\n        log.debug(\"day-summary cron already up to date\");\n      }\n    } catch (err) {\n      log.debug(`day-summary cron auto-register error: ${err}`);\n    }\n  }\n\n  async autoRegisterNightlyGovernanceCron(): Promise<void> {\n    const home = resolveHomeDir();\n    const jobsPath = path.join(home, \".openclaw\", \"cron\", \"jobs.json\");\n\n    try {\n      if (!existsSync(jobsPath)) {\n        log.debug(\"nightly governance cron: jobs.json not found, skipping auto-register\");\n        return;\n      }\n\n      const created = await ensureNightlyGovernanceCron(jobsPath, {\n        timezone: Intl.DateTimeFormat().resolvedOptions().timeZone,\n      });\n      if (created.created) {\n        log.info(\n          `nightly governance cron auto-registered (${created.jobId}, 02:23 ${Intl.DateTimeFormat().resolvedOptions().timeZone})`,\n        );\n      } else {\n        log.debug(\"nightly governance cron already exists, skipping auto-register\");\n      }\n    } catch (err) {\n      log.debug(`nightly governance cron auto-register error: ${err}`);\n    }\n  }\n\n  async autoRegisterProceduralMiningCron(): Promise<void> {\n    const home = resolveHomeDir();\n    const jobsPath = path.join(home, \".openclaw\", \"cron\", \"jobs.json\");\n    try {\n      if (!existsSync(jobsPath)) {\n        log.debug(\"procedural mining cron: jobs.json not found, skipping auto-register\");\n        return;\n      }\n      const created = await ensureProceduralMiningCron(jobsPath, {\n        timezone: Intl.DateTimeFormat().resolvedOptions().timeZone,\n      });\n      if (created.created) {\n        log.info(`procedural mining cron auto-registered (${created.jobId})`);\n      } else {\n        log.debug(\"procedural mining cron already exists, skipping auto-register\");\n      }\n    } catch (err) {\n      log.debug(`procedural mining cron auto-register error: ${err}`);\n    }\n  }\n\n  async autoRegisterContradictionScanCron(): Promise<void> {\n    const home = resolveHomeDir();\n    const jobsPath = path.join(home, \".openclaw\", \"cron\", \"jobs.json\");\n    try {\n      if (!existsSync(jobsPath)) {\n        log.debug(\"contradiction scan cron: jobs.json not found, skipping auto-register\");\n        return;\n      }\n      const created = await ensureContradictionScanCron(jobsPath, {\n        timezone: Intl.DateTimeFormat().resolvedOptions().timeZone,\n      });\n      if (created.created) {\n        log.info(`contradiction scan cron auto-registered (${created.jobId})`);\n      } else {\n        log.debug(\"contradiction scan cron already exists, skipping auto-register\");\n      }\n    } catch (err) {\n      log.debug(`contradiction scan cron auto-register error: ${err}`);\n    }\n  }\n\n  async autoRegisterPatternReinforcementCron(): Promise<void> {\n    const home = resolveHomeDir();\n    const jobsPath = path.join(home, \".openclaw\", \"cron\", \"jobs.json\");\n    try {\n      if (!existsSync(jobsPath)) {\n        log.debug(\"pattern reinforcement cron: jobs.json not found, skipping auto-register\");\n        return;\n      }\n      const created = await ensurePatternReinforcementCron(jobsPath, {\n        timezone: Intl.DateTimeFormat().resolvedOptions().timeZone,\n      });\n      if (created.created) {\n        log.info(`pattern reinforcement cron auto-registered (${created.jobId})`);\n      } else {\n        log.debug(\"pattern reinforcement cron already exists, skipping auto-register\");\n      }\n    } catch (err) {\n      log.debug(`pattern reinforcement cron auto-register error: ${err}`);\n    }\n  }\n\n  async autoRegisterGraphEdgeDecayCron(): Promise<void> {\n    const home = resolveHomeDir();\n    const jobsPath = path.join(home, \".openclaw\", \"cron\", \"jobs.json\");\n    try {\n      if (!existsSync(jobsPath)) {\n        log.debug(\"graph edge decay cron: jobs.json not found, skipping auto-register\");\n        return;\n      }\n      const scheduleExpr = graphEdgeDecayCadenceToCronExpr(\n        this.deps.config.graphEdgeDecayCadenceMs,\n      );\n      const created = await ensureGraphEdgeDecayCron(jobsPath, {\n        timezone: Intl.DateTimeFormat().resolvedOptions().timeZone,\n        scheduleExpr,\n      });\n      if (created.created) {\n        log.info(`graph edge decay cron auto-registered (${created.jobId}, ${scheduleExpr})`);\n      } else {\n        log.debug(\"graph edge decay cron already exists, skipping auto-register\");\n      }\n    } catch (err) {\n      log.debug(`graph edge decay cron auto-register error: ${err}`);\n    }\n  }\n\n  // ───────────────────────────────────────────────────────────────────────\n  // Consolidation scheduling\n  // ───────────────────────────────────────────────────────────────────────\n\n  /**\n   * Maybe trigger a background consolidation pass after an extraction.\n   * Counted + interval gated so a burst of extractions does not fan into a\n   * burst of consolidation passes. The consolidation runner itself is\n   * passed in as a callback because it lives on the orchestrator (LLM +\n   * storage dependency surface) and is not owned by this module.\n   */\n  maybeScheduleConsolidation(\n    nonZeroExtraction: boolean,\n    runConsolidation: () => Promise<unknown>,\n  ): void {\n    if (nonZeroExtraction) this.nonZeroExtractionsSinceConsolidation += 1;\n    if (\n      this.deps.config.consolidationRequireNonZeroExtraction &&\n      !nonZeroExtraction\n    ) {\n      return;\n    }\n    if (\n      this.nonZeroExtractionsSinceConsolidation <\n      this.deps.config.consolidateEveryN\n    ) {\n      return;\n    }\n\n    const now = Date.now();\n    if (\n      now - this.lastConsolidationRunAtMs <\n      this.deps.config.consolidationMinIntervalMs\n    ) {\n      return;\n    }\n    if (this.consolidationInFlight) return;\n\n    this.consolidationInFlight = true;\n    this.lastConsolidationRunAtMs = now;\n    this.nonZeroExtractionsSinceConsolidation = 0;\n    runConsolidation()\n      .catch((err) => log.error(\"background consolidation failed\", err))\n      .finally(() => {\n        this.consolidationInFlight = false;\n      });\n  }\n\n  /** Whether a background consolidation pass is currently running. Exposed so\n   *  the orchestrator's waitForConsolidationIdle can poll idle state without\n   *  owning the cadence state (issue #1526 PR1). */\n  isConsolidationInFlight(): boolean {\n    return this.consolidationInFlight;\n  }\n\n  /** Whether a debounced QMD maintenance pass is armed and waiting for the\n   *  debounce timer. Exposed so drain/teardown diagnostics (e.g. the bench\n   *  adapter) can observe scheduler idle state after the #1526 PR1 extraction\n   *  moved this flag off the orchestrator. */\n  isQmdMaintenancePending(): boolean {\n    return this.qmdMaintenancePending;\n  }\n\n  /** Whether a QMD maintenance pass is currently running (singleflight guard).\n   *  Exposed for drain/teardown diagnostics (see isQmdMaintenancePending). */\n  isQmdMaintenanceInFlight(): boolean {\n    return this.qmdMaintenanceInFlight;\n  }\n  // ───────────────────────────────────────────────────────────────────────\n  // QMD maintenance scheduling (debounced + singleflight)\n  // ───────────────────────────────────────────────────────────────────────\n\n  /** Internal: queue a debounced QMD maintenance pass. */\n  private requestQmdMaintenance(): void {\n    if (!this.deps.getQmd().isAvailable()) return;\n    if (!resolveQmdCapabilities(this.deps.config).qmdMaintenance) return;\n\n    this.qmdMaintenancePending = true;\n    if (this.qmdMaintenanceTimer) return;\n\n    this.qmdMaintenanceTimer = setTimeout(() => {\n      this.qmdMaintenanceTimer = null;\n      this.runQmdMaintenance().catch((err) =>\n        log.debug(`background qmd maintenance failed: ${err}`),\n      );\n    }, this.deps.config.qmdMaintenanceDebounceMs);\n  }\n\n  /**\n   * Public entrypoint for tool-driven QMD maintenance requests.\n   * Routes through existing debounced/singleflight maintenance controls.\n   */\n  requestQmdMaintenanceForTool(reason: string): void {\n    try {\n      this.requestQmdMaintenance();\n    } catch (err) {\n      const msg = err instanceof Error ? err.message : String(err);\n      log.warn(`qmd maintenance request failed (${reason}): ${msg}`);\n    }\n  }\n\n  /** Internal: run a single QMD maintenance pass under singleflight guard. */\n  async runQmdMaintenance(): Promise<void> {\n    if (this.qmdMaintenanceInFlight) return;\n    if (!this.qmdMaintenancePending) return;\n    this.qmdMaintenanceInFlight = true;\n    this.qmdMaintenancePending = false;\n\n    try {\n      if (resolveNamespaceCapabilities(this.deps.config).namespaces) {\n        // Include cataloged dynamic namespaces, not just the configured set\n        // (NGnei), but run through the namespace-aware maintenance planner so\n        // each namespace is budgeted, lock-protected, and status-recorded\n        // independently (issue #1500).\n        const plan = await this.namespaceMaintenancePlan(\"qmd\");\n        const now = Date.now();\n        const lastEmbedAtByNamespace = this.lastQmdEmbedAtMsByNamespace;\n        const dueEmbedNamespaces = (namespaces: string[]): string[] => {\n          if (!resolveQmdCapabilities(this.deps.config).qmdAutoEmbed) return [];\n          return namespaces.filter(\n            (namespace) =>\n              now - (lastEmbedAtByNamespace.get(namespace) ?? 0) >=\n              this.deps.config.qmdEmbedMinIntervalMs,\n          );\n        };\n        const markEmbedded = (namespaces: string[]): void => {\n          if (namespaces.length === 0) return;\n          for (const namespace of namespaces) {\n            lastEmbedAtByNamespace.set(namespace, now);\n          }\n          this.lastQmdEmbedAtMs = now;\n        };\n        await runNamespaceMaintenanceBatchPlan(\n          this.deps.config,\n          plan,\n          async (candidates) => {\n            const namespaces = candidates.map((candidate) => candidate.namespace);\n            const embedNamespaces = dueEmbedNamespaces(namespaces);\n            let result: NamespaceUpdateResult;\n            try {\n              result = await this.deps.namespaceSearchRouter.updateNamespacesDetailed(\n                namespaces,\n                undefined,\n                { strict: true },\n              );\n            } catch (error) {\n              if (\n                embedNamespaces.length > 0 &&\n                qmdMaintenanceSkipReasonForError(error) === \"throttled\"\n              ) {\n                await this.deps.namespaceSearchRouter.embedNamespaces(embedNamespaces, {\n                  strict: true,\n                });\n                markEmbedded(embedNamespaces);\n              }\n              throw error;\n            }\n            if (result.backendCount <= 0) {\n              throw new Error(\"no eligible QMD backend for selected namespaces\");\n            }\n            if (result.eligibleNamespaces.length !== namespaces.length) {\n              const eligible = new Set(result.eligibleNamespaces);\n              const missing = namespaces.filter(\n                (namespace) => !eligible.has(namespace),\n              );\n              throw new Error(\n                `QMD backend ineligible for selected namespaces (${missing.length})`,\n              );\n            }\n            if (embedNamespaces.length > 0) {\n              await this.deps.namespaceSearchRouter.embedNamespaces(embedNamespaces, {\n                strict: true,\n              });\n              markEmbedded(embedNamespaces);\n            }\n            return { itemCount: result.backendCount };\n          },\n          this.deps.namespaceCatalog,\n          {\n            skipReasonForError: qmdMaintenanceSkipReasonForError,\n          },\n        );\n      } else {\n        await this.deps.getQmd().update();\n        const now = Date.now();\n        if (\n          resolveQmdCapabilities(this.deps.config).qmdAutoEmbed &&\n          now - this.lastQmdEmbedAtMs >= this.deps.config.qmdEmbedMinIntervalMs\n        ) {\n          await this.deps.getQmd().embed();\n          this.lastQmdEmbedAtMs = now;\n        }\n      }\n    } finally {\n      this.qmdMaintenanceInFlight = false;\n      if (this.qmdMaintenancePending) {\n        this.requestQmdMaintenance();\n      }\n    }\n  }\n\n  /** Build the namespace-aware maintenance plan for one job. */\n  private async namespaceMaintenancePlan(\n    jobName: string,\n  ): Promise<NamespaceMaintenancePlan> {\n    return planNamespaceMaintenance(this.deps.config, {\n      jobName,\n      catalog: this.deps.namespaceCatalog,\n    });\n  }\n\n  // ───────────────────────────────────────────────────────────────────────\n  // Lifecycle\n  // ───────────────────────────────────────────────────────────────────────\n\n  /**\n   * Clear any pending debounce timer. Called from the orchestrator's\n   * destroy() so a late tick does not fire on a torn-down instance.\n   */\n  dispose(): void {\n    if (this.qmdMaintenanceTimer) {\n      clearTimeout(this.qmdMaintenanceTimer);\n      this.qmdMaintenanceTimer = null;\n    }\n    this.qmdMaintenancePending = false;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAAS,kBAAkB;AAC3B,OAAO,UAAU;AA4BjB,SAAS,iCACP,OACuC;AACvC,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,SAAO,wDAAwD,KAAK,OAAO,IACvE,cACA;AACN;AAqBO,IAAM,uBAAN,MAA2B;AAAA,EAahC,YAA6B,MAAgC;AAAhC;AAAA,EAAiC;AAAA,EAAjC;AAAA;AAAA,EAXrB,uCAAuC;AAAA,EACvC,2BAA2B;AAAA,EAC3B,wBAAwB;AAAA;AAAA,EAGxB,sBAA6C;AAAA,EAC7C,wBAAwB;AAAA,EACxB,yBAAyB;AAAA,EACzB,mBAAmB;AAAA,EACnB,8BAA8B,oBAAI,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiB9D,MAAM,kBAAkB,SAAqC;AAC3D,QAAI,mCAAmC,KAAK,KAAK,MAAM,EAAE,YAAY;AACnE,UAAI;AACF,cAAM,KAAK,2BAA2B;AAAA,MACxC,SAAS,KAAK;AACZ,YAAI,MAAM,sDAAsD,GAAG,EAAE;AAAA,MACvE;AAAA,IACF;AACA,QAAI,KAAK,KAAK,OAAO,mCAAmC;AACtD,UAAI;AACF,cAAM,KAAK,kCAAkC;AAAA,MAC/C,SAAS,KAAK;AACZ,YAAI,MAAM,6DAA6D,GAAG,EAAE;AAAA,MAC9E;AAAA,IACF;AACA,QAAI,KAAK,KAAK,OAAO,YAAY,kCAAkC;AACjE,UAAI;AACF,cAAM,KAAK,iCAAiC;AAAA,MAC9C,SAAS,KAAK;AACZ,YAAI,MAAM,4DAA4D,GAAG,EAAE;AAAA,MAC7E;AAAA,IACF;AACA,QAAI,KAAK,KAAK,OAAO,mBAAmB,SAAS;AAC/C,UAAI;AACF,cAAM,KAAK,kCAAkC;AAAA,MAC/C,SAAS,KAAK;AACZ,YAAI,MAAM,6DAA6D,GAAG,EAAE;AAAA,MAC9E;AAAA,IACF;AACA,QAAI,iCAAiC,KAAK,KAAK,MAAM,EAAE,sBAAsB;AAC3E,UAAI;AACF,cAAM,KAAK,qCAAqC;AAAA,MAClD,SAAS,KAAK;AACZ,YAAI,MAAM,gEAAgE,GAAG,EAAE;AAAA,MACjF;AAAA,IACF;AACA,QAAI,iCAAiC,KAAK,KAAK,MAAM,EAAE,gBAAgB;AACrE,UAAI;AACF,cAAM,KAAK,+BAA+B;AAAA,MAC5C,SAAS,KAAK;AACZ,YAAI,MAAM,2DAA2D,GAAG,EAAE;AAAA,MAC5E;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,6BAA4C;AAChD,UAAM,OAAO,eAAe;AAC5B,UAAM,WAAW,KAAK,KAAK,MAAM,aAAa,QAAQ,WAAW;AAEjE,QAAI;AACF,UAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,YAAI,MAAM,+DAA+D;AACzE;AAAA,MACF;AAKA,YAAM,kBAAkB,KAAK,KAAK,OAAO;AACzC,YAAM,cAAc,KAAK,KAAK,OAAO,gBAAgB;AACrD,YAAM,YAAY,KAAK,KAAK,OAAO,gBAAgB;AACnD,YAAM,QAAQ,YAAa,mBAAmB,eAAe,SAAa;AAM1E,YAAM,YAAsB,CAAC;AAC7B,UAAI,SAAS,eAAe,UAAU,aAAa;AACjD,cAAM,OAAO,IAAI,IAAY,QAAQ,CAAC,KAAK,IAAI,CAAC,CAAC;AACjD,cAAM,YAAY,CAAC,UAA8B;AAC/C,cAAI,OAAO,UAAU,SAAU;AAC/B,gBAAM,UAAU,MAAM,KAAK;AAC3B,cAAI,QAAQ,SAAS,KAAK,CAAC,KAAK,IAAI,OAAO,GAAG;AAC5C,iBAAK,IAAI,OAAO;AAChB,sBAAU,KAAK,OAAO;AAAA,UACxB;AAAA,QACF;AACA,mBAAW,MAAM,KAAK,KAAK,OAAO,gBAAgB,aAAa,CAAC,EAAG,WAAU,EAAE;AAC/E,cAAM,aAAa,KAAK,KAAK,OAAO,eAAe,QAAQ,UAAU;AACrE,kBAAU,YAAY,OAAO;AAC7B,YAAI,MAAM,QAAQ,YAAY,SAAS,GAAG;AACxC,qBAAW,MAAM,WAAW,UAAW,WAAU,EAAE;AAAA,QACrD;AAAA,MACF;AAEA,YAAM,WACJ,KAAK,KAAK,OAAO,sBACjB,KAAK,eAAe,EAAE,gBAAgB,EAAE;AAE1C,YAAM,SAAS,MAAM,qBAAqB,UAAU;AAAA,QAClD;AAAA,QACA,GAAI,QAAQ,EAAE,MAAM,IAAI,CAAC;AAAA,QACzB,GAAI,UAAU,SAAS,IAAI,EAAE,UAAU,IAAI,CAAC;AAAA,MAC9C,CAAC;AACD,UAAI,OAAO,SAAS;AAClB,YAAI;AAAA,UACF,qCAAqC,OAAO,KAAK,WAAW,QAAQ,GAAG,QAAQ,YAAY,KAAK,KAAK,EAAE;AAAA,QACzG;AAAA,MACF,WAAW,OAAO,SAAS;AACzB,YAAI;AAAA,UACF,gCAAgC,OAAO,KAAK,eAAe,QAAQ,GAAG,QAAQ,YAAY,KAAK,KAAK,EAAE;AAAA,QACxG;AAAA,MACF,OAAO;AACL,YAAI,MAAM,qCAAqC;AAAA,MACjD;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,MAAM,yCAAyC,GAAG,EAAE;AAAA,IAC1D;AAAA,EACF;AAAA,EAEA,MAAM,oCAAmD;AACvD,UAAM,OAAO,eAAe;AAC5B,UAAM,WAAW,KAAK,KAAK,MAAM,aAAa,QAAQ,WAAW;AAEjE,QAAI;AACF,UAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,YAAI,MAAM,sEAAsE;AAChF;AAAA,MACF;AAEA,YAAM,UAAU,MAAM,4BAA4B,UAAU;AAAA,QAC1D,UAAU,KAAK,eAAe,EAAE,gBAAgB,EAAE;AAAA,MACpD,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,YAAI;AAAA,UACF,4CAA4C,QAAQ,KAAK,WAAW,KAAK,eAAe,EAAE,gBAAgB,EAAE,QAAQ;AAAA,QACtH;AAAA,MACF,OAAO;AACL,YAAI,MAAM,gEAAgE;AAAA,MAC5E;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,MAAM,gDAAgD,GAAG,EAAE;AAAA,IACjE;AAAA,EACF;AAAA,EAEA,MAAM,mCAAkD;AACtD,UAAM,OAAO,eAAe;AAC5B,UAAM,WAAW,KAAK,KAAK,MAAM,aAAa,QAAQ,WAAW;AACjE,QAAI;AACF,UAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,YAAI,MAAM,qEAAqE;AAC/E;AAAA,MACF;AACA,YAAM,UAAU,MAAM,2BAA2B,UAAU;AAAA,QACzD,UAAU,KAAK,eAAe,EAAE,gBAAgB,EAAE;AAAA,MACpD,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,YAAI,KAAK,2CAA2C,QAAQ,KAAK,GAAG;AAAA,MACtE,OAAO;AACL,YAAI,MAAM,+DAA+D;AAAA,MAC3E;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,MAAM,+CAA+C,GAAG,EAAE;AAAA,IAChE;AAAA,EACF;AAAA,EAEA,MAAM,oCAAmD;AACvD,UAAM,OAAO,eAAe;AAC5B,UAAM,WAAW,KAAK,KAAK,MAAM,aAAa,QAAQ,WAAW;AACjE,QAAI;AACF,UAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,YAAI,MAAM,sEAAsE;AAChF;AAAA,MACF;AACA,YAAM,UAAU,MAAM,4BAA4B,UAAU;AAAA,QAC1D,UAAU,KAAK,eAAe,EAAE,gBAAgB,EAAE;AAAA,MACpD,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,YAAI,KAAK,4CAA4C,QAAQ,KAAK,GAAG;AAAA,MACvE,OAAO;AACL,YAAI,MAAM,gEAAgE;AAAA,MAC5E;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,MAAM,gDAAgD,GAAG,EAAE;AAAA,IACjE;AAAA,EACF;AAAA,EAEA,MAAM,uCAAsD;AAC1D,UAAM,OAAO,eAAe;AAC5B,UAAM,WAAW,KAAK,KAAK,MAAM,aAAa,QAAQ,WAAW;AACjE,QAAI;AACF,UAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,YAAI,MAAM,yEAAyE;AACnF;AAAA,MACF;AACA,YAAM,UAAU,MAAM,+BAA+B,UAAU;AAAA,QAC7D,UAAU,KAAK,eAAe,EAAE,gBAAgB,EAAE;AAAA,MACpD,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,YAAI,KAAK,+CAA+C,QAAQ,KAAK,GAAG;AAAA,MAC1E,OAAO;AACL,YAAI,MAAM,mEAAmE;AAAA,MAC/E;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,MAAM,mDAAmD,GAAG,EAAE;AAAA,IACpE;AAAA,EACF;AAAA,EAEA,MAAM,iCAAgD;AACpD,UAAM,OAAO,eAAe;AAC5B,UAAM,WAAW,KAAK,KAAK,MAAM,aAAa,QAAQ,WAAW;AACjE,QAAI;AACF,UAAI,CAAC,WAAW,QAAQ,GAAG;AACzB,YAAI,MAAM,oEAAoE;AAC9E;AAAA,MACF;AACA,YAAM,eAAe;AAAA,QACnB,KAAK,KAAK,OAAO;AAAA,MACnB;AACA,YAAM,UAAU,MAAM,yBAAyB,UAAU;AAAA,QACvD,UAAU,KAAK,eAAe,EAAE,gBAAgB,EAAE;AAAA,QAClD;AAAA,MACF,CAAC;AACD,UAAI,QAAQ,SAAS;AACnB,YAAI,KAAK,0CAA0C,QAAQ,KAAK,KAAK,YAAY,GAAG;AAAA,MACtF,OAAO;AACL,YAAI,MAAM,8DAA8D;AAAA,MAC1E;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,MAAM,8CAA8C,GAAG,EAAE;AAAA,IAC/D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,2BACE,mBACA,kBACM;AACN,QAAI,kBAAmB,MAAK,wCAAwC;AACpE,QACE,KAAK,KAAK,OAAO,yCACjB,CAAC,mBACD;AACA;AAAA,IACF;AACA,QACE,KAAK,uCACL,KAAK,KAAK,OAAO,mBACjB;AACA;AAAA,IACF;AAEA,UAAM,MAAM,KAAK,IAAI;AACrB,QACE,MAAM,KAAK,2BACX,KAAK,KAAK,OAAO,4BACjB;AACA;AAAA,IACF;AACA,QAAI,KAAK,sBAAuB;AAEhC,SAAK,wBAAwB;AAC7B,SAAK,2BAA2B;AAChC,SAAK,uCAAuC;AAC5C,qBAAiB,EACd,MAAM,CAAC,QAAQ,IAAI,MAAM,mCAAmC,GAAG,CAAC,EAChE,QAAQ,MAAM;AACb,WAAK,wBAAwB;AAAA,IAC/B,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAKA,0BAAmC;AACjC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAAmC;AACjC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA,EAIA,2BAAoC;AAClC,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,wBAA8B;AACpC,QAAI,CAAC,KAAK,KAAK,OAAO,EAAE,YAAY,EAAG;AACvC,QAAI,CAAC,uBAAuB,KAAK,KAAK,MAAM,EAAE,eAAgB;AAE9D,SAAK,wBAAwB;AAC7B,QAAI,KAAK,oBAAqB;AAE9B,SAAK,sBAAsB,WAAW,MAAM;AAC1C,WAAK,sBAAsB;AAC3B,WAAK,kBAAkB,EAAE;AAAA,QAAM,CAAC,QAC9B,IAAI,MAAM,sCAAsC,GAAG,EAAE;AAAA,MACvD;AAAA,IACF,GAAG,KAAK,KAAK,OAAO,wBAAwB;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,6BAA6B,QAAsB;AACjD,QAAI;AACF,WAAK,sBAAsB;AAAA,IAC7B,SAAS,KAAK;AACZ,YAAM,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC3D,UAAI,KAAK,mCAAmC,MAAM,MAAM,GAAG,EAAE;AAAA,IAC/D;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,oBAAmC;AACvC,QAAI,KAAK,uBAAwB;AACjC,QAAI,CAAC,KAAK,sBAAuB;AACjC,SAAK,yBAAyB;AAC9B,SAAK,wBAAwB;AAE7B,QAAI;AACF,UAAI,6BAA6B,KAAK,KAAK,MAAM,EAAE,YAAY;AAK7D,cAAM,OAAO,MAAM,KAAK,yBAAyB,KAAK;AACtD,cAAM,MAAM,KAAK,IAAI;AACrB,cAAM,yBAAyB,KAAK;AACpC,cAAM,qBAAqB,CAAC,eAAmC;AAC7D,cAAI,CAAC,uBAAuB,KAAK,KAAK,MAAM,EAAE,aAAc,QAAO,CAAC;AACpE,iBAAO,WAAW;AAAA,YAChB,CAAC,cACC,OAAO,uBAAuB,IAAI,SAAS,KAAK,MAChD,KAAK,KAAK,OAAO;AAAA,UACrB;AAAA,QACF;AACA,cAAM,eAAe,CAAC,eAA+B;AACnD,cAAI,WAAW,WAAW,EAAG;AAC7B,qBAAW,aAAa,YAAY;AAClC,mCAAuB,IAAI,WAAW,GAAG;AAAA,UAC3C;AACA,eAAK,mBAAmB;AAAA,QAC1B;AACA,cAAM;AAAA,UACJ,KAAK,KAAK;AAAA,UACV;AAAA,UACA,OAAO,eAAe;AACpB,kBAAM,aAAa,WAAW,IAAI,CAAC,cAAc,UAAU,SAAS;AACpE,kBAAM,kBAAkB,mBAAmB,UAAU;AACrD,gBAAI;AACJ,gBAAI;AACF,uBAAS,MAAM,KAAK,KAAK,sBAAsB;AAAA,gBAC7C;AAAA,gBACA;AAAA,gBACA,EAAE,QAAQ,KAAK;AAAA,cACjB;AAAA,YACF,SAAS,OAAO;AACd,kBACE,gBAAgB,SAAS,KACzB,iCAAiC,KAAK,MAAM,aAC5C;AACA,sBAAM,KAAK,KAAK,sBAAsB,gBAAgB,iBAAiB;AAAA,kBACrE,QAAQ;AAAA,gBACV,CAAC;AACD,6BAAa,eAAe;AAAA,cAC9B;AACA,oBAAM;AAAA,YACR;AACA,gBAAI,OAAO,gBAAgB,GAAG;AAC5B,oBAAM,IAAI,MAAM,iDAAiD;AAAA,YACnE;AACA,gBAAI,OAAO,mBAAmB,WAAW,WAAW,QAAQ;AAC1D,oBAAM,WAAW,IAAI,IAAI,OAAO,kBAAkB;AAClD,oBAAM,UAAU,WAAW;AAAA,gBACzB,CAAC,cAAc,CAAC,SAAS,IAAI,SAAS;AAAA,cACxC;AACA,oBAAM,IAAI;AAAA,gBACR,mDAAmD,QAAQ,MAAM;AAAA,cACnE;AAAA,YACF;AACA,gBAAI,gBAAgB,SAAS,GAAG;AAC9B,oBAAM,KAAK,KAAK,sBAAsB,gBAAgB,iBAAiB;AAAA,gBACrE,QAAQ;AAAA,cACV,CAAC;AACD,2BAAa,eAAe;AAAA,YAC9B;AACA,mBAAO,EAAE,WAAW,OAAO,aAAa;AAAA,UAC1C;AAAA,UACA,KAAK,KAAK;AAAA,UACV;AAAA,YACE,oBAAoB;AAAA,UACtB;AAAA,QACF;AAAA,MACF,OAAO;AACL,cAAM,KAAK,KAAK,OAAO,EAAE,OAAO;AAChC,cAAM,MAAM,KAAK,IAAI;AACrB,YACE,uBAAuB,KAAK,KAAK,MAAM,EAAE,gBACzC,MAAM,KAAK,oBAAoB,KAAK,KAAK,OAAO,uBAChD;AACA,gBAAM,KAAK,KAAK,OAAO,EAAE,MAAM;AAC/B,eAAK,mBAAmB;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,UAAE;AACA,WAAK,yBAAyB;AAC9B,UAAI,KAAK,uBAAuB;AAC9B,aAAK,sBAAsB;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,yBACZ,SACmC;AACnC,WAAO,yBAAyB,KAAK,KAAK,QAAQ;AAAA,MAChD;AAAA,MACA,SAAS,KAAK,KAAK;AAAA,IACrB,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,UAAgB;AACd,QAAI,KAAK,qBAAqB;AAC5B,mBAAa,KAAK,mBAAmB;AACrC,WAAK,sBAAsB;AAAA,IAC7B;AACA,SAAK,wBAAwB;AAAA,EAC/B;AACF;","names":[]}

package/dist/chunk-NWTGD4AN.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/local-llm.ts"],"sourcesContent":["import { log } from \"./logger.js\";\nimport type { PluginConfig } from \"./types.js\";\nimport fs from \"node:fs\";\nimport os from \"node:os\";\nimport type { ModelRegistry } from \"./model-registry.js\";\nimport { launchProcessSync } from \"./runtime/child-process.js\";\nimport { mergeEnv, readEnvVar } from \"./runtime/env.js\";\nimport { resolveLocalLlmCapabilities } from \"./capabilities.js\";\nimport { resolvePipelineProcessingCapabilities } from \"./capabilities.js\";\n\n/** Trim trailing slash characters without backtracking regex. */\nfunction trimTrailingSlashes(s: string): string {\n  let end = s.length;\n  while (end > 0 && s[end - 1] === \"/\") end--;\n  return s.substring(0, end);\n}\n\nfunction stripTrailingV1Path(s: string): string {\n  return s.endsWith(\"/v1\") ? s.slice(0, -3) : s;\n}\n\nfunction explicitPortFromUrl(s: string): number | null {\n  try {\n    const parsed = new URL(s);\n    if (!parsed.port) return null;\n    const port = Number(parsed.port);\n    return Number.isInteger(port) ? port : null;\n  } catch {\n    return null;\n  }\n}\n\nfunction isObjectRecord(value: unknown): value is Record<string, unknown> {\n  return typeof value === \"object\" && value !== null;\n}\n\nfunction isLlamaCppPropsResponse(value: unknown): boolean {\n  return (\n    isObjectRecord(value) &&\n    isObjectRecord(value.default_generation_settings) &&\n    typeof value.total_slots === \"number\" &&\n    (\n      typeof value.model_path === \"string\" ||\n      typeof value.chat_template === \"string\" ||\n      typeof value.build_info === \"string\"\n    )\n  );\n}\n\nfunction isLlamaCppModelsResponse(value: unknown): boolean {\n  if (!isObjectRecord(value) || !Array.isArray(value.data)) {\n    return false;\n  }\n  return value.data.some((entry) => {\n    if (!isObjectRecord(entry)) return false;\n    if (entry.owned_by === \"llamacpp\") return true;\n    if (typeof entry.id === \"string\" && entry.id.endsWith(\".gguf\")) return true;\n    const meta = entry.meta;\n    return (\n      isObjectRecord(meta) &&\n      (\"n_ctx_train\" in meta || \"n_params\" in meta || \"vocab_type\" in meta)\n    );\n  });\n}\n\nfunction isLmStudioApiV1ModelsResponse(value: unknown): boolean {\n  if (!isObjectRecord(value) || !Array.isArray(value.models)) {\n    return false;\n  }\n  return value.models.some((entry) => {\n    if (!isObjectRecord(entry)) return false;\n    return (\n      typeof entry.key === \"string\" &&\n      typeof entry.display_name === \"string\" &&\n      (\n        typeof entry.format === \"string\" ||\n        typeof entry.max_context_length === \"number\" ||\n        Array.isArray(entry.loaded_instances)\n      )\n    );\n  });\n}\n\nfunction isLmStudioApiV0ModelsResponse(value: unknown): boolean {\n  if (!isObjectRecord(value) || !Array.isArray(value.data)) {\n    return false;\n  }\n  return value.data.some((entry) => {\n    if (!isObjectRecord(entry)) return false;\n    return (\n      typeof entry.id === \"string\" &&\n      typeof entry.publisher === \"string\" &&\n      (\n        typeof entry.compatibility_type === \"string\" ||\n        typeof entry.max_context_length === \"number\" ||\n        typeof entry.state === \"string\"\n      )\n    );\n  });\n}\n\nfunction isLmStudioNativeModelsResponse(value: unknown): boolean {\n  return isLmStudioApiV1ModelsResponse(value) || isLmStudioApiV0ModelsResponse(value);\n}\n\n/**\n * Local LLM client for OpenAI-compatible endpoints (LM Studio, Ollama, MLX, etc.)\n *\n * Based on openclaw-tactician's provider detection patterns for consistency.\n * Provides privacy-preserving, cost-effective LLM operations with\n * graceful fallback to cloud providers when local LLM is unavailable.\n */\nexport type LocalLlmType = \"lmstudio\" | \"ollama\" | \"mlx\" | \"vllm\" | \"llamacpp\" | \"generic\";\n\n/**\n * Backends known to honor `chat_template_kwargs: { enable_thinking: false }`\n * on OpenAI-compatible `/v1/chat/completions`.  LM Studio, vLLM, and\n * llama.cpp forward this field to the jinja chat template, where thinking-capable\n * models (Qwen 3.5, Gemma 4, DeepSeek) suppress reasoning tokens.\n *\n * Strict OpenAI-compatible backends (standard OpenAI, Azure OpenAI, some\n * proxies) reject unknown request fields with 400 — which trips the\n * `localLlm400*` cooldown path.  `LocalLlmClient` therefore only injects\n * the kwarg when the detected backend is in this set; unknown / `generic`\n * / `ollama` / `mlx` fail open (no injection, no 400 risk).  Issue #548.\n */\nconst THINKING_COMPATIBLE_BACKENDS: ReadonlySet<LocalLlmType> = new Set([\n  \"lmstudio\",\n  \"vllm\",\n  \"llamacpp\",\n]);\n\nconst THINKING_SUPPRESSED_OPERATIONS: ReadonlySet<string> = new Set([\n  \"extraction\",\n  \"extraction-judge\",\n  \"extraction-faithfulness\",\n  \"contradiction-judge\",\n  \"contradiction_verification\",\n  \"link_suggestion\",\n  \"memory_summarization\",\n  \"proactive_extraction\",\n  \"lcm-summarize\",\n  \"day_summary\",\n  \"hourly_summary\",\n  \"hourly_summary_extended\",\n]);\n\ninterface LocalServerConfig {\n  type: LocalLlmType;\n  defaultPort: number;\n  healthEndpoint: string;\n  modelsEndpoint: string;\n  detectFn: (response: unknown) => boolean;\n}\n\nconst LOCAL_SERVERS: LocalServerConfig[] = [\n  {\n    type: \"ollama\",\n    defaultPort: 11434,\n    healthEndpoint: \"/\",\n    modelsEndpoint: \"/api/tags\",\n    detectFn: (resp) => typeof resp === \"string\" && resp.includes(\"Ollama\"),\n  },\n  {\n    type: \"llamacpp\",\n    defaultPort: 8080,\n    healthEndpoint: \"/health\",\n    modelsEndpoint: \"/v1/models\",\n    detectFn: (resp) => isObjectRecord(resp) && resp.status === \"ok\",\n  },\n  {\n    type: \"mlx\",\n    defaultPort: 8080,\n    healthEndpoint: \"/v1/models\",\n    modelsEndpoint: \"/v1/models\",\n    detectFn: (resp) => isObjectRecord(resp) && Array.isArray(resp.data),\n  },\n  {\n    type: \"lmstudio\",\n    defaultPort: 1234,\n    healthEndpoint: \"/v1/models\",\n    modelsEndpoint: \"/v1/models\",\n    detectFn: (resp) => isObjectRecord(resp) && Array.isArray(resp.data),\n  },\n  {\n    type: \"vllm\",\n    defaultPort: 8000,\n    healthEndpoint: \"/health\",\n    modelsEndpoint: \"/v1/models\",\n    detectFn: (resp) => resp === \"\" || (isObjectRecord(resp) && !(\"status\" in resp)),\n  },\n];\n\nfunction orderedLocalServers(configuredBaseUrl: string): LocalServerConfig[] {\n  const configuredPort = explicitPortFromUrl(configuredBaseUrl);\n  if (configuredPort === null) return LOCAL_SERVERS;\n  const matching = LOCAL_SERVERS.filter(\n    (serverConfig) => serverConfig.defaultPort === configuredPort,\n  );\n  if (matching.length === 0) return LOCAL_SERVERS;\n  const matchingTypes = new Set(matching.map((serverConfig) => serverConfig.type));\n  return [\n    ...matching,\n    ...LOCAL_SERVERS.filter((serverConfig) => !matchingTypes.has(serverConfig.type)),\n  ];\n}\n\nexport interface LocalModelInfo {\n  id: string;\n  contextWindow?: number;\n  maxTokens?: number;\n}\n\nexport type LocalLlmRequestPriority = \"recall-critical\" | \"background\";\n\ninterface LocalLlmChatCompletionOptions {\n  temperature?: number;\n  maxTokens?: number;\n  responseFormat?: { type: string };\n  timeoutMs?: number;\n  operation?: string;\n  forceDisableThinking?: boolean;\n  priority?: LocalLlmRequestPriority;\n}\n\ninterface LocalLlmQueuedRequest {\n  messages: Array<{ role: string; content: string }>;\n  options: LocalLlmChatCompletionOptions;\n  priority: LocalLlmRequestPriority;\n  enqueuedAtMs: number;\n  resolve: (value: LocalLlmChatCompletionResult | null) => void;\n}\n\ninterface LocalLlmChatCompletionResult {\n  content: string;\n  usage?: { promptTokens: number; completionTokens: number; totalTokens: number };\n}\n\nconst LOCAL_LLM_GLOBAL_BACKEND_STATE = \"__openclawEngramLocalLlmBackendState\";\n\ntype LocalLlmBackendState = {\n  untilMs: number;\n  reason: string;\n};\nexport class LocalLlmClient {\n  private config: PluginConfig;\n  private isAvailable: boolean | null = null;\n  private lastHealthCheck: number = 0;\n  private detectedType: LocalLlmType | null = null;\n  private cachedModelInfo: LocalModelInfo | null = null;\n  private cachedLmsContext: number | null = null;\n  private lastLmsCheck: number = 0;\n  private consecutive400s: number = 0;\n  private cooldownUntilMs: number = 0;\n  private modelRegistry?: ModelRegistry;\n  private _disableThinking: boolean = false;\n  private readonly requestQueues: Record<LocalLlmRequestPriority, LocalLlmQueuedRequest[]> = {\n    \"recall-critical\": [],\n    background: [],\n  };\n  private readonly queueProcessing = new Set<LocalLlmRequestPriority>();\n  private queueDrainScheduled: boolean = false;\n  private static readonly HEALTH_CHECK_INTERVAL_MS = 60000; // 1 minute\n  private static readonly LMS_CACHE_INTERVAL_MS = 30000; // 30 seconds\n\n  constructor(config: PluginConfig, modelRegistry?: ModelRegistry) {\n    this.config = config;\n    this.modelRegistry = modelRegistry;\n  }\n\n  /**\n   * Request thinking/reasoning suppression on the next chat completion.\n   *\n   * When `true`, the client will inject\n   * `chat_template_kwargs: { enable_thinking: false }` into the request\n   * body — **but only when the detected backend is known to support it**\n   * (LM Studio, vLLM; see `THINKING_COMPATIBLE_BACKENDS`).  Strict\n   * OpenAI-compat backends reject unknown fields with 400; on those the\n   * client fails open (thinking runs normally).  This is the safe\n   * default for Remnic extraction-style operations: measurable latency\n   * win on thinking-capable backends, zero risk on others. Consolidation\n   * operations keep thinking enabled unless explicitly added to\n   * `THINKING_SUPPRESSED_OPERATIONS`. Issues #548 and #979.\n   */\n  set disableThinking(value: boolean) {\n    this._disableThinking = value;\n  }\n\n  private resolveHomeDir(): string {\n    return this.config.localLlmHomeDir || readEnvVar(\"HOME\") || os.homedir();\n  }\n\n  private buildRequestHeaders(base: Record<string, string> = {}): Record<string, string> {\n    const headers: Record<string, string> = {\n      ...base,\n      ...(this.config.localLlmHeaders ?? {}),\n    };\n    if (this.config.localLlmApiKey && this.config.localLlmAuthHeader !== false) {\n      headers.Authorization = `Bearer ${this.config.localLlmApiKey}`;\n    }\n    return headers;\n  }\n\n  private isAbortError(err: unknown): boolean {\n    if (!err || typeof err !== \"object\") return false;\n    const maybe = err as { name?: string; message?: string };\n    return (\n      maybe.name === \"AbortError\" ||\n      maybe.message === \"This operation was aborted\" ||\n      maybe.message === \"The operation was aborted\"\n    );\n  }\n\n  /**\n   * Set the ModelRegistry for caching detected capabilities\n   */\n  setModelRegistry(registry: ModelRegistry): void {\n    this.modelRegistry = registry;\n  }\n\n  /**\n   * Get the detected server type (null if not detected)\n   */\n  getDetectedType(): LocalLlmType | null {\n    return this.detectedType;\n  }\n\n  private getBackendKey(): string {\n    return trimTrailingSlashes(\n      this.config.localLlmUrl.replace(\"localhost\", \"127.0.0.1\"),\n    ).replace(/\\/v1$/, \"\");\n  }\n\n  private getGlobalBackendState(): Map<string, LocalLlmBackendState> {\n    const globalAny = globalThis as typeof globalThis & {\n      [LOCAL_LLM_GLOBAL_BACKEND_STATE]?: Map<string, LocalLlmBackendState>;\n    };\n    if (!globalAny[LOCAL_LLM_GLOBAL_BACKEND_STATE]) {\n      globalAny[LOCAL_LLM_GLOBAL_BACKEND_STATE] = new Map();\n    }\n    return globalAny[LOCAL_LLM_GLOBAL_BACKEND_STATE];\n  }\n\n  private getTrippedBackendState(now: number): LocalLlmBackendState | null {\n    const state = this.getGlobalBackendState().get(this.getBackendKey()) ?? null;\n    if (!state) return null;\n    if (state.untilMs <= now) {\n      this.getGlobalBackendState().delete(this.getBackendKey());\n      this.lastHealthCheck = 0;\n      return null;\n    }\n    return state;\n  }\n\n  private markBackendUnavailable(reason: string, durationMs: number): void {\n    const normalizedReason = this.normalizeBackendTripReason(reason);\n    if (durationMs > 0) {\n      const untilMs = Date.now() + durationMs;\n      this.getGlobalBackendState().set(this.getBackendKey(), { untilMs, reason: normalizedReason });\n    } else {\n      this.getGlobalBackendState().delete(this.getBackendKey());\n    }\n    this.isAvailable = false;\n    this.lastHealthCheck = 0;\n    log.warn(\n      `local LLM backend unavailable for ${durationMs}ms: model=${this.config.localLlmModel} reason=${normalizedReason}`,\n    );\n  }\n\n  private extractNonRecoverableBackendReason(reason: string): string | null {\n    const match = reason.match(\n      /Failed to load model|Library not loaded|different Team IDs|code signature|llm_engine_mlx_amphibian/i,\n    );\n    return match?.[0] ?? null;\n  }\n\n  private extractNonRecoverableBackendReasonFromErrorText(errorText: string): string | null {\n    const directReason = this.extractNonRecoverableBackendReason(errorText);\n    if (directReason) return directReason;\n    try {\n      const parsed = JSON.parse(errorText) as { error?: { message?: string } };\n      return this.extractNonRecoverableBackendReason(parsed?.error?.message ?? \"\");\n    } catch {\n      return null;\n    }\n  }\n\n  private normalizeBackendTripReason(reason: string): string {\n    const cleaned = reason.replace(/\\s+/g, \" \").replace(/^[-:–—\\s]+/, \"\").trim();\n    if (!cleaned) return \"unknown local backend failure\";\n    return cleaned.length > 160 ? `${cleaned.slice(0, 157)}...` : cleaned;\n  }\n\n  /**\n   * Fetch with timeout for health checks\n   */\n  private async fetchWithTimeout(\n    url: string,\n    timeoutMs: number = 2000,\n    headers?: Record<string, string>,\n  ): Promise<{ ok: boolean; data: unknown; status: number | null }> {\n    const controller = new AbortController();\n    const timeout = setTimeout(() => controller.abort(), timeoutMs);\n\n    try {\n      const response = await fetch(url, {\n        signal: controller.signal,\n        headers: this.buildRequestHeaders({ Accept: \"application/json\", ...(headers ?? {}) }),\n      });\n      clearTimeout(timeout);\n\n      if (!response.ok) {\n        return { ok: false, data: null, status: response.status };\n      }\n\n      const contentType = response.headers.get(\"content-type\");\n      if (contentType?.includes(\"application/json\")) {\n        return { ok: true, data: await response.json(), status: response.status };\n      } else {\n        return { ok: true, data: await response.text(), status: response.status };\n      }\n    } catch (err) {\n      clearTimeout(timeout);\n      return { ok: false, data: null, status: null };\n    }\n  }\n\n  private async probeLmStudioNativeModels(\n    probeBaseUrl: string,\n  ): Promise<{ matched: boolean; unauthorized: boolean }> {\n    let unauthorized = false;\n    for (const endpoint of [\"/api/v1/models\", \"/api/v0/models\"]) {\n      const probe = await this.fetchWithTimeout(`${probeBaseUrl}${endpoint}`);\n      if (probe.ok && isLmStudioNativeModelsResponse(probe.data)) {\n        return { matched: true, unauthorized };\n      }\n      if (probe.status === 401 || probe.status === 403) {\n        unauthorized = true;\n      }\n    }\n    return { matched: false, unauthorized };\n  }\n\n  /**\n   * Check if local LLM is available\n   * Uses 127.0.0.1 instead of localhost to avoid DNS issues (consistent with tactician)\n   */\n  async checkAvailability(): Promise<boolean> {\n    // Cache health check results for 1 minute\n    const now = Date.now();\n    const trippedState = this.getTrippedBackendState(now);\n    if (trippedState) {\n      this.isAvailable = false;\n      this.lastHealthCheck = 0;\n      log.info(\n        `local LLM availability: backend circuit open for ${Math.max(0, trippedState.untilMs - now)}ms (${trippedState.reason})`,\n      );\n      return false;\n    }\n    if (this.isAvailable !== null && now - this.lastHealthCheck < LocalLlmClient.HEALTH_CHECK_INTERVAL_MS) {\n      return this.isAvailable;\n    }\n\n    // Normalize URL - replace localhost with 127.0.0.1, remove trailing slashes.\n    // Probe server-native endpoints from the server root even when users configure\n    // the OpenAI-compatible `/v1` base URL for chat completions.\n    const configuredBaseUrl = trimTrailingSlashes(\n      this.config.localLlmUrl.replace(\"localhost\", \"127.0.0.1\"),\n    );\n    const probeBaseUrl = stripTrailingV1Path(configuredBaseUrl);\n    let sawUnauthorizedProbe = false;\n\n    // Try to detect which server type is running\n    for (const serverConfig of orderedLocalServers(configuredBaseUrl)) {\n      const healthUrl = `${probeBaseUrl}${serverConfig.healthEndpoint}`;\n      log.debug(`checking ${serverConfig.type} at ${healthUrl}`);\n\n      const result = await this.fetchWithTimeout(healthUrl);\n      if (result.ok && serverConfig.detectFn(result.data)) {\n        if (serverConfig.type === \"mlx\") {\n          const lmStudioProbe = await this.probeLmStudioNativeModels(probeBaseUrl);\n          if (lmStudioProbe.unauthorized) {\n            sawUnauthorizedProbe = true;\n          }\n          if (lmStudioProbe.matched) {\n            this.isAvailable = true;\n            this.detectedType = \"lmstudio\";\n            this.lastHealthCheck = now;\n            log.info(`detected lmstudio at ${configuredBaseUrl}`);\n            return true;\n          }\n        }\n        if (serverConfig.type === \"llamacpp\") {\n          let sawLlamaCppSignal = false;\n          const propsProbe = await this.fetchWithTimeout(`${probeBaseUrl}/props`);\n          if (propsProbe.ok && isLlamaCppPropsResponse(propsProbe.data)) {\n            sawLlamaCppSignal = true;\n          }\n          if (propsProbe.status === 401 || propsProbe.status === 403) {\n            sawUnauthorizedProbe = true;\n          }\n\n          const modelsUrl = `${probeBaseUrl}${serverConfig.modelsEndpoint}`;\n          const modelsProbe = await this.fetchWithTimeout(modelsUrl);\n          if (modelsProbe.ok && isLlamaCppModelsResponse(modelsProbe.data)) {\n            sawLlamaCppSignal = true;\n          }\n          if (modelsProbe.status === 401 || modelsProbe.status === 403) {\n            sawUnauthorizedProbe = true;\n            continue;\n          }\n\n          const authConfigured =\n            Boolean(this.config.localLlmApiKey) &&\n            this.config.localLlmAuthHeader !== false;\n          if (!sawLlamaCppSignal || (authConfigured && !modelsProbe.ok)) {\n            continue;\n          }\n        }\n        this.isAvailable = true;\n        this.detectedType = serverConfig.type;\n        this.lastHealthCheck = now;\n        log.info(`detected ${serverConfig.type} at ${configuredBaseUrl}`);\n        return true;\n      }\n      if (result.status === 401 || result.status === 403) {\n        sawUnauthorizedProbe = true;\n      }\n    }\n\n    // Generic check if specific detection failed\n    try {\n      const modelsUrl = `${probeBaseUrl}/v1/models`;\n      const result = await this.fetchWithTimeout(modelsUrl);\n      if (result.ok) {\n        this.isAvailable = true;\n        this.detectedType = \"generic\";\n        this.lastHealthCheck = now;\n        log.info(`detected generic OpenAI-compatible server at ${configuredBaseUrl}`);\n        return true;\n      }\n      if (result.status === 401 || result.status === 403) {\n        sawUnauthorizedProbe = true;\n      }\n    } catch {\n      // Fall through to unavailable\n    }\n\n    this.isAvailable = false;\n    this.detectedType = null;\n    this.lastHealthCheck = now;\n    if (sawUnauthorizedProbe) {\n      log.warn(\n        `local LLM availability probe was unauthorized at ${configuredBaseUrl}; verify localLlmApiKey and localLlmAuthHeader settings`,\n      );\n    }\n    log.debug(\"local LLM not available at\", configuredBaseUrl);\n    return false;\n  }\n\n  /**\n   * Try to get context window from LM Studio settings.json as fallback.\n   * This reads the defaultContextLength setting which is what LM Studio uses\n   * when loading models without explicit context configuration.\n   */\n  private getContextFromLmStudioSettings(): number | null {\n    try {\n      const homeDir = this.resolveHomeDir();\n      const settingsPath = `${homeDir}/.cache/lm-studio/settings.json`;\n\n      if (!fs.existsSync(settingsPath)) {\n        log.debug(`LM Studio settings: file not found at ${settingsPath}`);\n        return null;\n      }\n\n      const content = fs.readFileSync(settingsPath, \"utf-8\");\n      const settings = JSON.parse(content) as {\n        defaultContextLength?: {\n          type?: string;\n          value?: number;\n        };\n      };\n\n      if (settings.defaultContextLength?.value) {\n        const contextWindow = settings.defaultContextLength.value;\n        log.debug(`LM Studio settings: found default context length: ${contextWindow}`);\n        return contextWindow;\n      }\n\n      return null;\n    } catch (err) {\n      const errorMsg = err instanceof Error ? err.message : String(err);\n      log.debug(`LM Studio settings: failed to read - ${errorMsg}`);\n      return null;\n    }\n  }\n\n  /**\n   * Try to get context window from LMS CLI (LM Studio specific).\n   * Uses --json flag for reliable parsing.\n   * Returns null if LMS CLI is not available or model not found.\n   */\n  private getContextFromLmsCli(modelId: string): number | null {\n    try {\n      // Check if lms CLI exists in common locations.\n      // HOME may be absent in launchd environments, so prefer the resolved helper.\n      const homeDir = this.resolveHomeDir();\n      const lmsPaths = [\n        this.config.localLmsCliPath || \"\",\n        `${homeDir}/.cache/lm-studio/bin/lms`,\n        \"/usr/local/bin/lms\",\n        \"/opt/homebrew/bin/lms\",\n      ];\n\n      const lmsPath = lmsPaths.find((p) => p.length > 0 && fs.existsSync(p));\n      if (!lmsPath) {\n        log.debug(`LMS CLI: not found in standard locations (checked: ${lmsPaths.join(\", \")})`);\n        return null;\n      }\n\n      // Run lms ps --json to get loaded models with context\n      // Use spawnSync with shell and explicit PATH to ensure lms can find its dependencies\n      log.debug(`LMS CLI: running: ${lmsPath} ps --json`);\n      const existingPath = readEnvVar(\"PATH\") || \"\";\n      const result = launchProcessSync(lmsPath, [\"ps\", \"--json\"], {\n        encoding: \"utf-8\",\n        timeout: 5000,\n        shell: false, // Don't use shell for JSON output - more reliable\n        env: mergeEnv({\n          PATH: `${this.config.localLmsBinDir || `${homeDir}/.cache/lm-studio/bin`}:/usr/local/bin:/opt/homebrew/bin:/usr/bin:/bin:${existingPath}`,\n          HOME: homeDir,\n        }),\n      });\n\n      if (result.error) {\n        log.debug(`LMS CLI: spawn error - ${result.error.message}`);\n        return null;\n      }\n\n      if (result.stderr && result.stderr.trim()) {\n        log.debug(`LMS CLI: stderr - ${result.stderr.slice(0, 200)}`);\n      }\n\n      const output = result.stdout || \"\";\n      if (!output.trim()) {\n        log.debug(\"LMS CLI: empty output - LM Studio may not be running or no models loaded\");\n        return null;\n      }\n\n      // Parse JSON output\n      let models: Array<{\n        identifier?: string;\n        modelKey?: string;\n        contextLength?: number;\n        maxContextLength?: number;\n      }>;\n\n      try {\n        models = JSON.parse(output) as typeof models;\n      } catch (parseErr) {\n        log.debug(`LMS CLI: JSON parse error - ${parseErr}`);\n        return null;\n      }\n\n      if (!Array.isArray(models) || models.length === 0) {\n        log.debug(\"LMS CLI: no models loaded\");\n        return null;\n      }\n\n      // Find the model matching our configured model ID\n      const model = models.find((m) =>\n        m.identifier === modelId ||\n        m.modelKey === modelId ||\n        (m.identifier?.includes(modelId.replace(/@\\d+bit$/, \"\")))\n      );\n\n      if (!model) {\n        log.debug(`LMS CLI: model \"${modelId}\" not found in loaded models: ${models.map(m => m.identifier).join(\", \")}`);\n        return null;\n      }\n\n      // Use contextLength (actual configured) or fall back to maxContextLength (model max)\n      const contextWindow = model.contextLength || model.maxContextLength;\n\n      if (contextWindow) {\n        log.info(`LMS CLI detected context window: ${contextWindow} for ${modelId} (max: ${model.maxContextLength})`);\n        return contextWindow;\n      }\n\n      return null;\n    } catch (err) {\n      // LMS CLI not available or failed\n      const errorMsg = err instanceof Error ? err.message : String(err);\n      log.debug(`LMS CLI: failed - ${errorMsg}`);\n      return null;\n    }\n  }\n\n  /**\n   * Get full model info from LMS CLI including context length and max context length.\n   * Returns null if LMS CLI is unavailable or model not found.\n   */\n  private getLmsModelInfo(modelId: string): { contextLength: number; maxContextLength: number; identifier: string } | null {\n    try {\n      const result = launchProcessSync(\"lms\", [\"ps\", \"--json\"], {\n        encoding: \"utf-8\",\n        timeout: 5000,\n        shell: false,\n      });\n\n      if (result.error) {\n        return null;\n      }\n\n      const output = result.stdout || \"\";\n      if (!output.trim()) {\n        return null;\n      }\n\n      let models: Array<{\n        identifier?: string;\n        modelKey?: string;\n        contextLength?: number;\n        maxContextLength?: number;\n      }>;\n\n      try {\n        models = JSON.parse(output) as typeof models;\n      } catch {\n        return null;\n      }\n\n      if (!Array.isArray(models) || models.length === 0) {\n        return null;\n      }\n\n      const model = models.find((m) =>\n        m.identifier === modelId ||\n        m.modelKey === modelId ||\n        (m.identifier?.includes(modelId.replace(/@\\d+bit$/, \"\")))\n      );\n\n      if (!model || !model.contextLength) {\n        return null;\n      }\n\n      return {\n        contextLength: model.contextLength,\n        maxContextLength: model.maxContextLength || model.contextLength,\n        identifier: model.identifier || modelId,\n      };\n    } catch {\n      return null;\n    }\n  }\n\n  /**\n   * Get context window for the configured model, using cache if available.\n   * This method caches the result to avoid repeated LMS CLI calls.\n   * Order: ModelRegistry (persistent) -> memory cache -> LMS CLI -> settings.json\n   */\n  getCachedContextWindow(modelId: string): number | null {\n    const now = Date.now();\n\n    // 1. Check ModelRegistry for persisted context window\n    if (this.modelRegistry) {\n      const caps = this.modelRegistry.getCapabilities(modelId);\n      if (caps.source === \"lmstudio\" && caps.contextWindow) {\n        log.debug(`ModelRegistry: using persisted LM Studio context: ${caps.contextWindow}`);\n        // Also update memory cache\n        this.cachedLmsContext = caps.contextWindow;\n        this.lastLmsCheck = now;\n        return caps.contextWindow;\n      }\n    }\n\n    // 2. Return in-memory cached value if still valid\n    if (this.cachedLmsContext && now - this.lastLmsCheck < LocalLlmClient.LMS_CACHE_INTERVAL_MS) {\n      log.debug(`LMS CLI: returning in-memory cached context: ${this.cachedLmsContext}`);\n      return this.cachedLmsContext;\n    }\n\n    // 3. Try LMS CLI (authoritative source)\n    const lmsInfo = this.getLmsModelInfo(modelId);\n    if (lmsInfo?.contextLength) {\n      this.cachedLmsContext = lmsInfo.contextLength;\n      this.lastLmsCheck = now;\n      // Calculate appropriate output tokens based on context size\n      // Use 12.5% of context window, capped at 16K (generous but safe)\n      const calculatedOutputTokens = Math.min(Math.floor(lmsInfo.contextLength / 8), 16384);\n      const outputTokens = Math.max(calculatedOutputTokens, 4096); // Minimum 4K\n      // Persist to ModelRegistry with detected capabilities\n      if (this.modelRegistry) {\n        this.modelRegistry.setCapabilities(modelId, {\n          maxPositionEmbeddings: lmsInfo.maxContextLength || lmsInfo.contextLength,\n          contextWindow: lmsInfo.contextLength,\n          supportsExtendedContext: (lmsInfo.maxContextLength || lmsInfo.contextLength) > 65536,\n          typicalOutputTokens: outputTokens,\n          source: \"lmstudio\",\n        });\n        log.info(`LMS CLI: Stored capabilities for ${modelId}: ${lmsInfo.contextLength} context, ${outputTokens} output tokens`);\n      }\n      return lmsInfo.contextLength;\n    }\n\n    // Legacy: Try LMS CLI context only (fallback)\n    const legacyContext = this.getContextFromLmsCli(modelId);\n    if (legacyContext) {\n      this.cachedLmsContext = legacyContext;\n      this.lastLmsCheck = now;\n      // Persist to ModelRegistry with calculated output tokens\n      if (this.modelRegistry) {\n        const calculatedOutputTokens = Math.min(Math.floor(legacyContext / 8), 16384);\n        const outputTokens = Math.max(calculatedOutputTokens, 4096);\n        this.modelRegistry.setCapabilities(modelId, {\n          maxPositionEmbeddings: legacyContext,\n          contextWindow: legacyContext,\n          supportsExtendedContext: false,\n          typicalOutputTokens: outputTokens,\n          source: \"lmstudio\",\n        });\n      }\n      return legacyContext;\n    }\n\n    // 4. Fall back to LM Studio settings.json\n    const settingsContext = this.getContextFromLmStudioSettings();\n    if (settingsContext) {\n      log.info(`LM Studio settings: using default context: ${settingsContext}`);\n      this.cachedLmsContext = settingsContext;\n      this.lastLmsCheck = now;\n      return settingsContext;\n    }\n\n    return null;\n  }\n\n  /**\n   * Clear the LMS context cache. Call this when the model changes.\n   */\n  clearContextCache(): void {\n    this.cachedLmsContext = null;\n    this.lastLmsCheck = 0;\n    log.debug(\"LMS CLI: context cache cleared\");\n  }\n\n  private remainingCooldownMs(now: number = Date.now()): number {\n    return Math.max(0, this.cooldownUntilMs - now);\n  }\n\n  private scheduleQueueDrain(): void {\n    if (this.queueDrainScheduled) return;\n    this.queueDrainScheduled = true;\n\n    queueMicrotask(() => {\n      this.queueDrainScheduled = false;\n      this.startAvailableQueuedRequests();\n    });\n  }\n\n  private hasQueuedRequests(): boolean {\n    return (\n      this.requestQueues[\"recall-critical\"].length > 0 ||\n      this.requestQueues.background.length > 0\n    );\n  }\n\n  private dequeueQueuedRequest(priority: LocalLlmRequestPriority): LocalLlmQueuedRequest | null {\n    const next = this.requestQueues[priority].shift();\n    return next ?? null;\n  }\n\n  private failOpenQueuedRequestsForCooldown(): number {\n    let dropped = 0;\n    for (const priority of [\"recall-critical\", \"background\"] as const) {\n      while (this.requestQueues[priority].length > 0) {\n        const queued = this.requestQueues[priority].shift();\n        queued?.resolve(null);\n        dropped += 1;\n      }\n    }\n    return dropped;\n  }\n\n  private startAvailableQueuedRequests(): void {\n    if (!this.queueProcessing.has(\"recall-critical\")) {\n      const nextCritical = this.dequeueQueuedRequest(\"recall-critical\");\n      if (nextCritical) {\n        this.queueProcessing.add(\"recall-critical\");\n        void this.runQueuedRequest(nextCritical);\n      }\n    }\n\n    if (!this.queueProcessing.has(\"background\")) {\n      const nextBackground = this.dequeueQueuedRequest(\"background\");\n      if (nextBackground) {\n        this.queueProcessing.add(\"background\");\n        void this.runQueuedRequest(nextBackground);\n      }\n    }\n  }\n\n  private async runQueuedRequest(next: LocalLlmQueuedRequest): Promise<void> {\n    try {\n      const remainingCooldownMs = this.remainingCooldownMs();\n      if (remainingCooldownMs > 0) {\n        const additionalDropped = this.failOpenQueuedRequestsForCooldown();\n        log.warn(\n          `local LLM: cooldown active (${remainingCooldownMs}ms remaining), dropping ${additionalDropped + 1} queued request(s) fail-open`,\n        );\n        next.resolve(null);\n        return;\n      }\n\n      let result: LocalLlmChatCompletionResult | null = null;\n      try {\n        result = await this.runChatCompletionRequest(next.messages, next.options, {\n          priority: next.priority,\n          enqueuedAtMs: next.enqueuedAtMs,\n        });\n      } catch (err) {\n        log.warn(`local LLM queue drain failed open: ${err instanceof Error ? err.message : String(err)}`);\n      }\n      next.resolve(result);\n    } finally {\n      this.queueProcessing.delete(next.priority);\n      if (this.hasQueuedRequests()) {\n        this.scheduleQueueDrain();\n      }\n    }\n  }\n\n  private async runChatCompletionRequest(\n    messages: Array<{ role: string; content: string }>,\n    options: LocalLlmChatCompletionOptions,\n    queueMeta?: { priority: LocalLlmRequestPriority; enqueuedAtMs: number },\n  ): Promise<LocalLlmChatCompletionResult | null> {\n    log.debug(\n      `local LLM chatCompletion: localLlmEnabled=${resolveLocalLlmCapabilities(this.config).localLlm}, model=${this.config.localLlmModel}`,\n    );\n\n    const operation = options.operation ?? \"unspecified\";\n    const startedAtMs = Date.now();\n    if (queueMeta) {\n        log.debug(\n          `local LLM queue start: priority=${queueMeta.priority} waitMs=${startedAtMs - queueMeta.enqueuedAtMs} op=${operation}`,\n        );\n    }\n\n    try {\n      const isAvailable = await this.checkAvailability();\n      if (!isAvailable) {\n        log.debug(\n          `local LLM: checkAvailability returned false for ${this.config.localLlmUrl}`,\n        );\n        return null;\n      }\n\n      const promptChars = messages.reduce((sum, m) => sum + (m.content?.length ?? 0), 0);\n      const requestBody: Record<string, unknown> = {\n        model: this.config.localLlmModel,\n        messages,\n        temperature: options.temperature ?? 0.7,\n        // Use max_tokens consistent with cloud models\n        max_tokens: options.maxTokens ?? 4096,\n      };\n\n      // Skip response_format for local LLMs - they don't support json_object type\n      // The prompts already instruct the model to output JSON\n      // Only send if it's json_schema type which some local LLMs support\n      if (options.responseFormat?.type === \"json_schema\") {\n        requestBody.response_format = options.responseFormat;\n      }\n\n      // Suppress thinking/reasoning for operations that benefit from terse,\n      // structured output. Thinking-capable models (Qwen 3.5, Gemma 4,\n      // DeepSeek) default to thinking-on via their chat template; sending\n      // `chat_template_kwargs: { enable_thinking: false }` tells the template\n      // to skip reasoning tokens. Consolidation operations on the main client\n      // intentionally keep thinking enabled so entity resolution and\n      // deduplication can use the model's reasoning path. Fast-tier callers can\n      // still force suppression per request to preserve their low-latency\n      // contract.\n      //\n      // Gate the injection on detected backend support (issue #548,\n      // Codex P1 on PR #550): `chat_template_kwargs` is an LM Studio /\n      // vLLM / llama.cpp extension, not part of standard OpenAI chat\n      // completions.  Strict OpenAI-compatible backends reject\n      // unknown fields with 400, which trips the 400-cooldown path and\n      // can effectively disable local extraction.  Fail open when the\n      // backend hasn't been positively identified as thinking-capable.\n      const shouldSuppressThinking =\n        options.forceDisableThinking === true ||\n        (this._disableThinking &&\n          THINKING_SUPPRESSED_OPERATIONS.has(operation));\n      if (\n        shouldSuppressThinking &&\n        this.detectedType !== null &&\n        THINKING_COMPATIBLE_BACKENDS.has(this.detectedType)\n      ) {\n        requestBody.chat_template_kwargs = { enable_thinking: false };\n      } else if (shouldSuppressThinking && this.detectedType === \"ollama\") {\n        // Ollama's /v1 endpoint silently drops `chat_template_kwargs` AND\n        // `enable_thinking` — the ONLY field it maps to think-off is\n        // `reasoning_effort` (\"none\" → ThinkValue{false} in openai.go;\n        // verified against Ollama 0.32.0 source and live probes,\n        // issue #1996). Without this, thinking-capable models (Gemma 4,\n        // Qwen 3.5+) burn 1,700-2,000 reasoning tokens per extraction on\n        // Ollama, exceed the client timeout, and retry forever. The effort\n        // is configurable via `localLlmReasoningEffort` (default \"none\");\n        // an empty value disables injection (pre-#1996 behavior).\n        const effort = this.config.localLlmReasoningEffort;\n        if (effort) {\n          requestBody.reasoning_effort = effort;\n        }\n      }\n\n      // Normalize URL (use 127.0.0.1 instead of localhost)\n      const baseUrl = trimTrailingSlashes(\n        this.config.localLlmUrl.replace(\"localhost\", \"127.0.0.1\"),\n      );\n      const chatUrl = baseUrl.endsWith(\"/v1\")\n        ? `${baseUrl}/chat/completions`\n        : `${baseUrl}/v1/chat/completions`;\n\n      const requestBodyJson = JSON.stringify(requestBody);\n      log.debug(\n        `local LLM: sending request to ${chatUrl} with model ${this.config.localLlmModel}`,\n      );\n      // Avoid logging request bodies by default (can contain sensitive user content).\n      log.debug(`local LLM: request body length=${requestBodyJson.length}`);\n\n      // Write request body to file for debugging\n      if (this.config.debug) {\n        try {\n          const { writeFileSync } = await import(\"node:fs\");\n          writeFileSync(\"/tmp/engram-last-request.json\", requestBodyJson);\n        } catch {\n          /* ignore */\n        }\n      }\n\n      const effectiveTimeoutMs =\n        typeof options.timeoutMs === \"number\"\n          ? Math.min(this.config.localLlmTimeoutMs, options.timeoutMs)\n          : this.config.localLlmTimeoutMs;\n      const maxAttempts = 1 + Math.max(0, this.config.localLlmRetry5xxCount);\n      let response: Response | null = null;\n      let lastAbortError: Error | null = null;\n      for (let attempt = 1; attempt <= maxAttempts; attempt += 1) {\n        const attemptAbort = new AbortController();\n        const attemptTimeout = setTimeout(() => attemptAbort.abort(), effectiveTimeoutMs);\n        try {\n          response = await fetch(chatUrl, {\n            method: \"POST\",\n            headers: this.buildRequestHeaders({\n              \"Content-Type\": \"application/json\",\n            }),\n            body: JSON.stringify(requestBody),\n            signal: attemptAbort.signal,\n          });\n        } catch (err) {\n          if (!this.isAbortError(err)) throw err;\n          lastAbortError = err instanceof Error ? err : new Error(String(err));\n          if (attempt < maxAttempts) {\n            const backoffMs = this.config.localLlmRetryBackoffMs * attempt;\n            log.warn(\n              `local LLM request aborted: op=${operation} attempt=${attempt}/${maxAttempts} timeoutMs=${effectiveTimeoutMs} model=${this.config.localLlmModel}; retrying after ${backoffMs}ms`,\n            );\n            await new Promise((resolve) => setTimeout(resolve, backoffMs));\n            continue;\n          }\n          break;\n        } finally {\n          clearTimeout(attemptTimeout);\n        }\n\n        if (response.ok) break;\n        if (response.status >= 500 && attempt < maxAttempts) {\n          try {\n            const errorText = await response.clone().text();\n            const nonRecoverableReason =\n              this.extractNonRecoverableBackendReasonFromErrorText(errorText);\n            if (nonRecoverableReason) {\n              this.markBackendUnavailable(\n                nonRecoverableReason,\n                this.config.localLlm400CooldownMs,\n              );\n              this.consecutive400s = 0;\n              return null;\n            }\n          } catch (e) {\n            log.debug(`local LLM failed to inspect retryable error body: ${e}`);\n          }\n        }\n        if (response.status < 500 || attempt >= maxAttempts) break;\n\n        const backoffMs = this.config.localLlmRetryBackoffMs * attempt;\n        log.warn(\n          `local LLM request got ${response.status}; retrying (attempt ${attempt + 1}/${maxAttempts}) after ${backoffMs}ms`,\n        );\n        await new Promise((resolve) => setTimeout(resolve, backoffMs));\n      }\n      log.debug(\n        `local LLM: received response, status=${response?.status}, ok=${response?.ok}`,\n      );\n\n      if (!response) {\n        if (lastAbortError) {\n          log.warn(\n            `local LLM request aborted after ${maxAttempts} attempt(s): op=${operation} timeoutMs=${effectiveTimeoutMs} model=${this.config.localLlmModel} promptChars=${promptChars} durationMs=${Date.now() - startedAtMs}`,\n          );\n        } else {\n          log.warn(\n            `local LLM request failed: no response object (op=${operation} model=${this.config.localLlmModel} durationMs=${Date.now() - startedAtMs})`,\n          );\n        }\n        return null;\n      }\n\n      if (!response.ok) {\n        let reason = \"\";\n        let errorText = \"\";\n        try {\n          errorText = await response.text();\n          // Try to extract a stable error message without logging content.\n          try {\n            const parsed = JSON.parse(errorText) as { error?: { message?: string } };\n            reason = parsed?.error?.message ? ` — ${parsed.error.message}` : \"\";\n          } catch {\n            // Keep a short preview in debug only.\n            log.debug(`local LLM error body: ${errorText.slice(0, 500)}`);\n          }\n        } catch (e) {\n          log.debug(`local LLM failed to read error body: ${e}`);\n        }\n        log.warn(\n          `local LLM request failed: ${response.status} ${response.statusText}${reason} ` +\n          `(op=${operation}, model=${this.config.localLlmModel}, url=${chatUrl}, promptChars=${promptChars}, maxTokens=${requestBody.max_tokens as number})`,\n        );\n        const nonRecoverableReason =\n          this.extractNonRecoverableBackendReason(reason) ??\n          this.extractNonRecoverableBackendReasonFromErrorText(errorText);\n        if (nonRecoverableReason) {\n          this.markBackendUnavailable(\n            nonRecoverableReason,\n            this.config.localLlm400CooldownMs,\n          );\n          this.consecutive400s = 0;\n          return null;\n        }\n        if (response.status === 400) {\n          this.consecutive400s += 1;\n          if (this.consecutive400s >= this.config.localLlm400TripThreshold) {\n            this.cooldownUntilMs = Date.now() + this.config.localLlm400CooldownMs;\n            log.warn(\n              `local LLM: entering cooldown for ${this.config.localLlm400CooldownMs}ms ` +\n                `after ${this.consecutive400s} consecutive 400 responses`,\n            );\n            this.consecutive400s = 0;\n          }\n        } else {\n          this.consecutive400s = 0;\n        }\n        return null;\n      }\n      this.consecutive400s = 0;\n\n      const data = (await response.json()) as {\n        choices?: Array<{\n          message?: { content?: string; reasoning_content?: string };\n        }>;\n        usage?: {\n          prompt_tokens?: number;\n          completion_tokens?: number;\n          total_tokens?: number;\n        };\n      };\n\n      log.debug(\n        `local LLM response: choices=${data.choices?.length}, usage=${JSON.stringify(data.usage)}`,\n      );\n\n      // Thinking models (e.g. Qwen 3.5) may put their response in\n      // `reasoning_content` and leave `content` empty. Fall back to\n      // reasoning_content so engram still gets a usable result.\n      const msg = data.choices?.[0]?.message;\n      const content = msg?.content || msg?.reasoning_content || \"\";\n      if (!content) {\n        log.warn(`local LLM returned empty content. choices=${JSON.stringify(data.choices)?.slice(0, 200)}`);\n        return null;\n      }\n\n      // Estimate tokens if not provided by local LLM\n      const usage = data.usage\n        ? {\n            promptTokens: data.usage.prompt_tokens ?? 0,\n            completionTokens: data.usage.completion_tokens ?? 0,\n            totalTokens: data.usage.total_tokens ?? 0,\n          }\n        : this.estimateTokens(messages, content);\n\n      const durationMs = Date.now() - startedAtMs;\n      if (resolvePipelineProcessingCapabilities(this.config).slowLog && durationMs >= this.config.slowLogThresholdMs) {\n        const promptChars = messages.reduce((sum, m) => sum + (m.content?.length ?? 0), 0);\n        const op = options.operation ? ` op=${options.operation}` : \"\";\n        log.warn(\n          `SLOW local LLM:${op} durationMs=${durationMs} model=${this.config.localLlmModel} url=${chatUrl} promptChars=${promptChars} outputTokens=${usage.completionTokens} totalTokens=${usage.totalTokens}`,\n        );\n      }\n\n      log.debug(\"local LLM: request succeeded, tokens:\", usage.totalTokens);\n      return { content, usage };\n    } catch (err) {\n      const errMsg = err instanceof Error ? err.message : String(err);\n      const durationMs = Date.now() - startedAtMs;\n      if (this.isAbortError(err)) {\n        log.warn(\n          `local LLM request aborted: op=${operation} timeoutMs=${options.timeoutMs ?? this.config.localLlmTimeoutMs} model=${this.config.localLlmModel} durationMs=${durationMs} error=${errMsg}`,\n        );\n        return null;\n      }\n      log.warn(`local LLM request error: op=${operation} error=${errMsg}`);\n      this.isAvailable = false; // Mark as unavailable on non-abort errors\n      const nonRecoverableReason = this.extractNonRecoverableBackendReason(errMsg);\n      if (nonRecoverableReason) {\n        this.markBackendUnavailable(\n          nonRecoverableReason,\n          this.config.localLlm400CooldownMs,\n        );\n      }\n      return null;\n    } finally {\n      if (queueMeta) {\n        const finishedAtMs = Date.now();\n        const waitMs = startedAtMs - queueMeta.enqueuedAtMs;\n        log.debug(\n          `local LLM queue finish: priority=${queueMeta.priority} waitMs=${waitMs} runMs=${finishedAtMs - startedAtMs} totalMs=${finishedAtMs - queueMeta.enqueuedAtMs} op=${operation}`,\n        );\n      }\n    }\n  }\n\n  /**\n   * Query the local LLM server for loaded model information.\n   * Returns null if unavailable or if the model is not found.\n   */\n  async getLoadedModelInfo(): Promise<LocalModelInfo | null> {\n    const baseUrl = trimTrailingSlashes(\n      this.config.localLlmUrl.replace(\"localhost\", \"127.0.0.1\"),\n    );\n\n    // Handle URL construction - localLlmUrl may already include /v1\n    const modelsUrl = baseUrl.endsWith(\"/v1\")\n      ? `${baseUrl}/models`\n      : `${baseUrl}/v1/models`;\n    log.debug(`Fetching model info from ${modelsUrl}`);\n\n    try {\n      const result = await this.fetchWithTimeout(modelsUrl, 3000);\n      if (!result.ok) {\n        if (result.status === 401 || result.status === 403) {\n          log.warn(\n            `Local LLM: unauthorized while fetching models from ${modelsUrl}; verify localLlmApiKey and localLlmAuthHeader settings`,\n          );\n        }\n        log.warn(`Local LLM: Failed to fetch models from ${modelsUrl} - server returned error`);\n        return null;\n      }\n      if (!result.data) {\n        log.warn(`Local LLM: No data returned from ${modelsUrl}`);\n        return null;\n      }\n\n      const data = result.data as {\n        data?: Array<{\n          id?: string;\n          object?: string;\n          owned_by?: string;\n          // LM Studio specific fields\n          max_context_length?: number;\n          max_tokens?: number;\n          // Ollama specific\n          name?: string;\n          details?: {\n            parameter_size?: string;\n            family?: string;\n          };\n        }>;\n      };\n\n      if (!Array.isArray(data.data) || data.data.length === 0) {\n        log.warn(\"Local LLM returned no models\");\n        return null;\n      }\n\n      // Verbose model listings are noisy on every gateway restart. Keep it debug-only.\n      const modelIds = data.data.map((m) => m.id).filter(Boolean);\n      log.debug(\n        `Local LLM: Found ${modelIds.length} model(s). First 10: ${modelIds.slice(0, 10).join(\", \")}`,\n      );\n\n      // Find the model matching our configured model ID\n      const configuredModel = this.config.localLlmModel;\n      let model = data.data.find((m) => m.id === configuredModel);\n\n      // If not found by exact match, try partial match (handle suffixes like @4bit)\n      if (!model) {\n        model = data.data.find((m) =>\n          configuredModel.includes(m.id || \"\") ||\n          (m.id || \"\").includes(configuredModel.replace(/@\\d+bit$/, \"\"))\n        );\n      }\n\n      // If still not found, use the first loaded model and warn\n      if (!model) {\n        model = data.data[0];\n        const availablePreview = data.data\n          .map((m) => m.id)\n          .filter(Boolean)\n          .slice(0, 10)\n          .join(\", \");\n        log.warn(\n          `Configured model \"${configuredModel}\" not found in local LLM. ` +\n          `Using \"${model.id}\" instead. Available (first 10): ${availablePreview}`\n        );\n      }\n\n      // Extract context window - try multiple field names\n      let contextWindow = model.max_context_length || model.max_tokens;\n\n      // If API doesn't report context window, try LMS CLI (LM Studio specific)\n      if (!contextWindow) {\n        log.info(\"Local LLM: API did not report context window, trying LMS CLI...\");\n        const lmsContext = this.getCachedContextWindow(model.id || \"\");\n        if (lmsContext) {\n          contextWindow = lmsContext;\n        }\n      }\n\n      this.cachedModelInfo = {\n        id: model.id || \"unknown\",\n        contextWindow: contextWindow,\n        maxTokens: model.max_tokens,\n      };\n\n      log.info(\n        `Local LLM model detected: ${this.cachedModelInfo.id}, ` +\n        `context window: ${contextWindow?.toLocaleString() || \"unknown (may use default)\"}`\n      );\n\n      return this.cachedModelInfo;\n    } catch (err) {\n      log.warn(`Failed to fetch model info: ${err}`);\n      return null;\n    }\n  }\n\n  /**\n   * Check if the configured model is available and get its actual context window.\n   * Warns if there's a mismatch between expected and actual context.\n   */\n  async validateModelConfig(expectedContextWindow?: number): Promise<{\n    available: boolean;\n    actualContextWindow?: number;\n    warnings: string[];\n  }> {\n    const warnings: string[] = [];\n\n    const modelInfo = await this.getLoadedModelInfo();\n    if (!modelInfo) {\n      return { available: false, warnings: [\"Could not query local LLM for model info\"] };\n    }\n\n    // If we have expected context and the server reports one, check for mismatch\n    if (expectedContextWindow && modelInfo.contextWindow) {\n      if (modelInfo.contextWindow < expectedContextWindow) {\n        warnings.push(\n          `Context window mismatch: Model ${modelInfo.id} supports ${modelInfo.contextWindow.toLocaleString()} tokens, ` +\n          `but engram is configured for ${expectedContextWindow.toLocaleString()}. ` +\n          `Set localLlmMaxContext: ${modelInfo.contextWindow} in config to avoid errors.`\n        );\n      }\n    }\n\n    // Warn if server doesn't report context window (common with some local LLM setups)\n    if (!modelInfo.contextWindow) {\n      warnings.push(\n        `Local LLM server did not report context window for ${modelInfo.id}. ` +\n        `If you get \"context length exceeded\" errors, set localLlmMaxContext in config.`\n      );\n    }\n\n    return {\n      available: true,\n      actualContextWindow: modelInfo.contextWindow,\n      warnings,\n    };\n  }\n\n  /**\n   * Make a chat completion request to local LLM\n   */\n  async chatCompletion(\n    messages: Array<{ role: string; content: string }>,\n    options: LocalLlmChatCompletionOptions = {},\n  ): Promise<LocalLlmChatCompletionResult | null> {\n    if (!resolveLocalLlmCapabilities(this.config).localLlm) {\n      log.debug(\"local LLM: disabled, returning null\");\n      return null;\n    }\n\n    const remainingMs = this.remainingCooldownMs();\n    if (remainingMs > 0) {\n      log.debug(`local LLM: cooldown active (${remainingMs}ms remaining), skipping request`);\n      return null;\n    }\n    if (options.priority) {\n      const priority = options.priority;\n      return await new Promise<LocalLlmChatCompletionResult | null>((resolve) => {\n        this.requestQueues[priority].push({\n          messages,\n          options,\n          priority,\n          enqueuedAtMs: Date.now(),\n          resolve,\n        });\n        this.scheduleQueueDrain();\n      });\n    }\n\n    return await this.runChatCompletionRequest(messages, options);\n  }\n\n  /**\n   * Estimate tokens when local LLM doesn't return usage stats\n   * Rough estimate: 1 token ≈ 4 characters\n   */\n  private estimateTokens(\n    messages: Array<{ role: string; content: string }>,\n    response: string\n  ): { promptTokens: number; completionTokens: number; totalTokens: number } {\n    const promptChars = messages.reduce((sum, m) => sum + m.content.length, 0);\n    const promptTokens = Math.ceil(promptChars / 4);\n    const completionTokens = Math.ceil(response.length / 4);\n\n    return {\n      promptTokens,\n      completionTokens,\n      totalTokens: promptTokens + completionTokens,\n    };\n  }\n\n  /**\n   * Try local LLM first, fallback to cloud provider if configured\n   */\n  async withFallback<T>(\n    localOperation: () => Promise<T | null>,\n    fallbackOperation: () => Promise<T>,\n    operationName: string\n  ): Promise<T> {\n    // Try local LLM first if enabled\n    if (resolveLocalLlmCapabilities(this.config).localLlm) {\n      const localResult = await localOperation();\n      if (localResult !== null) {\n        log.debug(`${operationName}: used local LLM`);\n        return localResult;\n      }\n\n      // Local failed or unavailable\n      if (this.config.localLlmFallback) {\n        log.info(`${operationName}: local LLM unavailable, falling back to cloud`);\n      } else {\n        throw new Error(`${operationName}: local LLM unavailable and fallback disabled`);\n      }\n    }\n\n    // Use fallback (cloud provider)\n    return fallbackOperation();\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAEA,OAAO,QAAQ;AACf,OAAO,QAAQ;AAQf,SAAS,oBAAoB,GAAmB;AAC9C,MAAI,MAAM,EAAE;AACZ,SAAO,MAAM,KAAK,EAAE,MAAM,CAAC,MAAM,IAAK;AACtC,SAAO,EAAE,UAAU,GAAG,GAAG;AAC3B;AAEA,SAAS,oBAAoB,GAAmB;AAC9C,SAAO,EAAE,SAAS,KAAK,IAAI,EAAE,MAAM,GAAG,EAAE,IAAI;AAC9C;AAEA,SAAS,oBAAoB,GAA0B;AACrD,MAAI;AACF,UAAM,SAAS,IAAI,IAAI,CAAC;AACxB,QAAI,CAAC,OAAO,KAAM,QAAO;AACzB,UAAM,OAAO,OAAO,OAAO,IAAI;AAC/B,WAAO,OAAO,UAAU,IAAI,IAAI,OAAO;AAAA,EACzC,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,eAAe,OAAkD;AACxE,SAAO,OAAO,UAAU,YAAY,UAAU;AAChD;AAEA,SAAS,wBAAwB,OAAyB;AACxD,SACE,eAAe,KAAK,KACpB,eAAe,MAAM,2BAA2B,KAChD,OAAO,MAAM,gBAAgB,aAE3B,OAAO,MAAM,eAAe,YAC5B,OAAO,MAAM,kBAAkB,YAC/B,OAAO,MAAM,eAAe;AAGlC;AAEA,SAAS,yBAAyB,OAAyB;AACzD,MAAI,CAAC,eAAe,KAAK,KAAK,CAAC,MAAM,QAAQ,MAAM,IAAI,GAAG;AACxD,WAAO;AAAA,EACT;AACA,SAAO,MAAM,KAAK,KAAK,CAAC,UAAU;AAChC,QAAI,CAAC,eAAe,KAAK,EAAG,QAAO;AACnC,QAAI,MAAM,aAAa,WAAY,QAAO;AAC1C,QAAI,OAAO,MAAM,OAAO,YAAY,MAAM,GAAG,SAAS,OAAO,EAAG,QAAO;AACvE,UAAM,OAAO,MAAM;AACnB,WACE,eAAe,IAAI,MAClB,iBAAiB,QAAQ,cAAc,QAAQ,gBAAgB;AAAA,EAEpE,CAAC;AACH;AAEA,SAAS,8BAA8B,OAAyB;AAC9D,MAAI,CAAC,eAAe,KAAK,KAAK,CAAC,MAAM,QAAQ,MAAM,MAAM,GAAG;AAC1D,WAAO;AAAA,EACT;AACA,SAAO,MAAM,OAAO,KAAK,CAAC,UAAU;AAClC,QAAI,CAAC,eAAe,KAAK,EAAG,QAAO;AACnC,WACE,OAAO,MAAM,QAAQ,YACrB,OAAO,MAAM,iBAAiB,aAE5B,OAAO,MAAM,WAAW,YACxB,OAAO,MAAM,uBAAuB,YACpC,MAAM,QAAQ,MAAM,gBAAgB;AAAA,EAG1C,CAAC;AACH;AAEA,SAAS,8BAA8B,OAAyB;AAC9D,MAAI,CAAC,eAAe,KAAK,KAAK,CAAC,MAAM,QAAQ,MAAM,IAAI,GAAG;AACxD,WAAO;AAAA,EACT;AACA,SAAO,MAAM,KAAK,KAAK,CAAC,UAAU;AAChC,QAAI,CAAC,eAAe,KAAK,EAAG,QAAO;AACnC,WACE,OAAO,MAAM,OAAO,YACpB,OAAO,MAAM,cAAc,aAEzB,OAAO,MAAM,uBAAuB,YACpC,OAAO,MAAM,uBAAuB,YACpC,OAAO,MAAM,UAAU;AAAA,EAG7B,CAAC;AACH;AAEA,SAAS,+BAA+B,OAAyB;AAC/D,SAAO,8BAA8B,KAAK,KAAK,8BAA8B,KAAK;AACpF;AAuBA,IAAM,+BAA0D,oBAAI,IAAI;AAAA,EACtE;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,iCAAsD,oBAAI,IAAI;AAAA,EAClE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAUD,IAAM,gBAAqC;AAAA,EACzC;AAAA,IACE,MAAM;AAAA,IACN,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,UAAU,CAAC,SAAS,OAAO,SAAS,YAAY,KAAK,SAAS,QAAQ;AAAA,EACxE;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,UAAU,CAAC,SAAS,eAAe,IAAI,KAAK,KAAK,WAAW;AAAA,EAC9D;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,UAAU,CAAC,SAAS,eAAe,IAAI,KAAK,MAAM,QAAQ,KAAK,IAAI;AAAA,EACrE;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,UAAU,CAAC,SAAS,eAAe,IAAI,KAAK,MAAM,QAAQ,KAAK,IAAI;AAAA,EACrE;AAAA,EACA;AAAA,IACE,MAAM;AAAA,IACN,aAAa;AAAA,IACb,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,UAAU,CAAC,SAAS,SAAS,MAAO,eAAe,IAAI,KAAK,EAAE,YAAY;AAAA,EAC5E;AACF;AAEA,SAAS,oBAAoB,mBAAgD;AAC3E,QAAM,iBAAiB,oBAAoB,iBAAiB;AAC5D,MAAI,mBAAmB,KAAM,QAAO;AACpC,QAAM,WAAW,cAAc;AAAA,IAC7B,CAAC,iBAAiB,aAAa,gBAAgB;AAAA,EACjD;AACA,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,gBAAgB,IAAI,IAAI,SAAS,IAAI,CAAC,iBAAiB,aAAa,IAAI,CAAC;AAC/E,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG,cAAc,OAAO,CAAC,iBAAiB,CAAC,cAAc,IAAI,aAAa,IAAI,CAAC;AAAA,EACjF;AACF;AAiCA,IAAM,iCAAiC;AAMhC,IAAM,iBAAN,MAAM,gBAAe;AAAA,EAClB;AAAA,EACA,cAA8B;AAAA,EAC9B,kBAA0B;AAAA,EAC1B,eAAoC;AAAA,EACpC,kBAAyC;AAAA,EACzC,mBAAkC;AAAA,EAClC,eAAuB;AAAA,EACvB,kBAA0B;AAAA,EAC1B,kBAA0B;AAAA,EAC1B;AAAA,EACA,mBAA4B;AAAA,EACnB,gBAA0E;AAAA,IACzF,mBAAmB,CAAC;AAAA,IACpB,YAAY,CAAC;AAAA,EACf;AAAA,EACiB,kBAAkB,oBAAI,IAA6B;AAAA,EAC5D,sBAA+B;AAAA,EACvC,OAAwB,2BAA2B;AAAA;AAAA,EACnD,OAAwB,wBAAwB;AAAA;AAAA,EAEhD,YAAY,QAAsB,eAA+B;AAC/D,SAAK,SAAS;AACd,SAAK,gBAAgB;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,IAAI,gBAAgB,OAAgB;AAClC,SAAK,mBAAmB;AAAA,EAC1B;AAAA,EAEQ,iBAAyB;AAC/B,WAAO,KAAK,OAAO,mBAAmB,WAAW,MAAM,KAAK,GAAG,QAAQ;AAAA,EACzE;AAAA,EAEQ,oBAAoB,OAA+B,CAAC,GAA2B;AACrF,UAAM,UAAkC;AAAA,MACtC,GAAG;AAAA,MACH,GAAI,KAAK,OAAO,mBAAmB,CAAC;AAAA,IACtC;AACA,QAAI,KAAK,OAAO,kBAAkB,KAAK,OAAO,uBAAuB,OAAO;AAC1E,cAAQ,gBAAgB,UAAU,KAAK,OAAO,cAAc;AAAA,IAC9D;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,aAAa,KAAuB;AAC1C,QAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,UAAM,QAAQ;AACd,WACE,MAAM,SAAS,gBACf,MAAM,YAAY,gCAClB,MAAM,YAAY;AAAA,EAEtB;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,UAA+B;AAC9C,SAAK,gBAAgB;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,kBAAuC;AACrC,WAAO,KAAK;AAAA,EACd;AAAA,EAEQ,gBAAwB;AAC9B,WAAO;AAAA,MACL,KAAK,OAAO,YAAY,QAAQ,aAAa,WAAW;AAAA,IAC1D,EAAE,QAAQ,SAAS,EAAE;AAAA,EACvB;AAAA,EAEQ,wBAA2D;AACjE,UAAM,YAAY;AAGlB,QAAI,CAAC,UAAU,8BAA8B,GAAG;AAC9C,gBAAU,8BAA8B,IAAI,oBAAI,IAAI;AAAA,IACtD;AACA,WAAO,UAAU,8BAA8B;AAAA,EACjD;AAAA,EAEQ,uBAAuB,KAA0C;AACvE,UAAM,QAAQ,KAAK,sBAAsB,EAAE,IAAI,KAAK,cAAc,CAAC,KAAK;AACxE,QAAI,CAAC,MAAO,QAAO;AACnB,QAAI,MAAM,WAAW,KAAK;AACxB,WAAK,sBAAsB,EAAE,OAAO,KAAK,cAAc,CAAC;AACxD,WAAK,kBAAkB;AACvB,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,uBAAuB,QAAgB,YAA0B;AACvE,UAAM,mBAAmB,KAAK,2BAA2B,MAAM;AAC/D,QAAI,aAAa,GAAG;AAClB,YAAM,UAAU,KAAK,IAAI,IAAI;AAC7B,WAAK,sBAAsB,EAAE,IAAI,KAAK,cAAc,GAAG,EAAE,SAAS,QAAQ,iBAAiB,CAAC;AAAA,IAC9F,OAAO;AACL,WAAK,sBAAsB,EAAE,OAAO,KAAK,cAAc,CAAC;AAAA,IAC1D;AACA,SAAK,cAAc;AACnB,SAAK,kBAAkB;AACvB,QAAI;AAAA,MACF,qCAAqC,UAAU,aAAa,KAAK,OAAO,aAAa,WAAW,gBAAgB;AAAA,IAClH;AAAA,EACF;AAAA,EAEQ,mCAAmC,QAA+B;AACxE,UAAM,QAAQ,OAAO;AAAA,MACnB;AAAA,IACF;AACA,WAAO,QAAQ,CAAC,KAAK;AAAA,EACvB;AAAA,EAEQ,gDAAgD,WAAkC;AACxF,UAAM,eAAe,KAAK,mCAAmC,SAAS;AACtE,QAAI,aAAc,QAAO;AACzB,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,SAAS;AACnC,aAAO,KAAK,mCAAmC,QAAQ,OAAO,WAAW,EAAE;AAAA,IAC7E,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEQ,2BAA2B,QAAwB;AACzD,UAAM,UAAU,OAAO,QAAQ,QAAQ,GAAG,EAAE,QAAQ,cAAc,EAAE,EAAE,KAAK;AAC3E,QAAI,CAAC,QAAS,QAAO;AACrB,WAAO,QAAQ,SAAS,MAAM,GAAG,QAAQ,MAAM,GAAG,GAAG,CAAC,QAAQ;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,iBACZ,KACA,YAAoB,KACpB,SACgE;AAChE,UAAM,aAAa,IAAI,gBAAgB;AACvC,UAAM,UAAU,WAAW,MAAM,WAAW,MAAM,GAAG,SAAS;AAE9D,QAAI;AACF,YAAM,WAAW,MAAM,MAAM,KAAK;AAAA,QAChC,QAAQ,WAAW;AAAA,QACnB,SAAS,KAAK,oBAAoB,EAAE,QAAQ,oBAAoB,GAAI,WAAW,CAAC,EAAG,CAAC;AAAA,MACtF,CAAC;AACD,mBAAa,OAAO;AAEpB,UAAI,CAAC,SAAS,IAAI;AAChB,eAAO,EAAE,IAAI,OAAO,MAAM,MAAM,QAAQ,SAAS,OAAO;AAAA,MAC1D;AAEA,YAAM,cAAc,SAAS,QAAQ,IAAI,cAAc;AACvD,UAAI,aAAa,SAAS,kBAAkB,GAAG;AAC7C,eAAO,EAAE,IAAI,MAAM,MAAM,MAAM,SAAS,KAAK,GAAG,QAAQ,SAAS,OAAO;AAAA,MAC1E,OAAO;AACL,eAAO,EAAE,IAAI,MAAM,MAAM,MAAM,SAAS,KAAK,GAAG,QAAQ,SAAS,OAAO;AAAA,MAC1E;AAAA,IACF,SAAS,KAAK;AACZ,mBAAa,OAAO;AACpB,aAAO,EAAE,IAAI,OAAO,MAAM,MAAM,QAAQ,KAAK;AAAA,IAC/C;AAAA,EACF;AAAA,EAEA,MAAc,0BACZ,cACsD;AACtD,QAAI,eAAe;AACnB,eAAW,YAAY,CAAC,kBAAkB,gBAAgB,GAAG;AAC3D,YAAM,QAAQ,MAAM,KAAK,iBAAiB,GAAG,YAAY,GAAG,QAAQ,EAAE;AACtE,UAAI,MAAM,MAAM,+BAA+B,MAAM,IAAI,GAAG;AAC1D,eAAO,EAAE,SAAS,MAAM,aAAa;AAAA,MACvC;AACA,UAAI,MAAM,WAAW,OAAO,MAAM,WAAW,KAAK;AAChD,uBAAe;AAAA,MACjB;AAAA,IACF;AACA,WAAO,EAAE,SAAS,OAAO,aAAa;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,oBAAsC;AAE1C,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,eAAe,KAAK,uBAAuB,GAAG;AACpD,QAAI,cAAc;AAChB,WAAK,cAAc;AACnB,WAAK,kBAAkB;AACvB,UAAI;AAAA,QACF,oDAAoD,KAAK,IAAI,GAAG,aAAa,UAAU,GAAG,CAAC,OAAO,aAAa,MAAM;AAAA,MACvH;AACA,aAAO;AAAA,IACT;AACA,QAAI,KAAK,gBAAgB,QAAQ,MAAM,KAAK,kBAAkB,gBAAe,0BAA0B;AACrG,aAAO,KAAK;AAAA,IACd;AAKA,UAAM,oBAAoB;AAAA,MACxB,KAAK,OAAO,YAAY,QAAQ,aAAa,WAAW;AAAA,IAC1D;AACA,UAAM,eAAe,oBAAoB,iBAAiB;AAC1D,QAAI,uBAAuB;AAG3B,eAAW,gBAAgB,oBAAoB,iBAAiB,GAAG;AACjE,YAAM,YAAY,GAAG,YAAY,GAAG,aAAa,cAAc;AAC/D,UAAI,MAAM,YAAY,aAAa,IAAI,OAAO,SAAS,EAAE;AAEzD,YAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,UAAI,OAAO,MAAM,aAAa,SAAS,OAAO,IAAI,GAAG;AACnD,YAAI,aAAa,SAAS,OAAO;AAC/B,gBAAM,gBAAgB,MAAM,KAAK,0BAA0B,YAAY;AACvE,cAAI,cAAc,cAAc;AAC9B,mCAAuB;AAAA,UACzB;AACA,cAAI,cAAc,SAAS;AACzB,iBAAK,cAAc;AACnB,iBAAK,eAAe;AACpB,iBAAK,kBAAkB;AACvB,gBAAI,KAAK,wBAAwB,iBAAiB,EAAE;AACpD,mBAAO;AAAA,UACT;AAAA,QACF;AACA,YAAI,aAAa,SAAS,YAAY;AACpC,cAAI,oBAAoB;AACxB,gBAAM,aAAa,MAAM,KAAK,iBAAiB,GAAG,YAAY,QAAQ;AACtE,cAAI,WAAW,MAAM,wBAAwB,WAAW,IAAI,GAAG;AAC7D,gCAAoB;AAAA,UACtB;AACA,cAAI,WAAW,WAAW,OAAO,WAAW,WAAW,KAAK;AAC1D,mCAAuB;AAAA,UACzB;AAEA,gBAAM,YAAY,GAAG,YAAY,GAAG,aAAa,cAAc;AAC/D,gBAAM,cAAc,MAAM,KAAK,iBAAiB,SAAS;AACzD,cAAI,YAAY,MAAM,yBAAyB,YAAY,IAAI,GAAG;AAChE,gCAAoB;AAAA,UACtB;AACA,cAAI,YAAY,WAAW,OAAO,YAAY,WAAW,KAAK;AAC5D,mCAAuB;AACvB;AAAA,UACF;AAEA,gBAAM,iBACJ,QAAQ,KAAK,OAAO,cAAc,KAClC,KAAK,OAAO,uBAAuB;AACrC,cAAI,CAAC,qBAAsB,kBAAkB,CAAC,YAAY,IAAK;AAC7D;AAAA,UACF;AAAA,QACF;AACA,aAAK,cAAc;AACnB,aAAK,eAAe,aAAa;AACjC,aAAK,kBAAkB;AACvB,YAAI,KAAK,YAAY,aAAa,IAAI,OAAO,iBAAiB,EAAE;AAChE,eAAO;AAAA,MACT;AACA,UAAI,OAAO,WAAW,OAAO,OAAO,WAAW,KAAK;AAClD,+BAAuB;AAAA,MACzB;AAAA,IACF;AAGA,QAAI;AACF,YAAM,YAAY,GAAG,YAAY;AACjC,YAAM,SAAS,MAAM,KAAK,iBAAiB,SAAS;AACpD,UAAI,OAAO,IAAI;AACb,aAAK,cAAc;AACnB,aAAK,eAAe;AACpB,aAAK,kBAAkB;AACvB,YAAI,KAAK,gDAAgD,iBAAiB,EAAE;AAC5E,eAAO;AAAA,MACT;AACA,UAAI,OAAO,WAAW,OAAO,OAAO,WAAW,KAAK;AAClD,+BAAuB;AAAA,MACzB;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,SAAK,cAAc;AACnB,SAAK,eAAe;AACpB,SAAK,kBAAkB;AACvB,QAAI,sBAAsB;AACxB,UAAI;AAAA,QACF,oDAAoD,iBAAiB;AAAA,MACvE;AAAA,IACF;AACA,QAAI,MAAM,8BAA8B,iBAAiB;AACzD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,iCAAgD;AACtD,QAAI;AACF,YAAM,UAAU,KAAK,eAAe;AACpC,YAAM,eAAe,GAAG,OAAO;AAE/B,UAAI,CAAC,GAAG,WAAW,YAAY,GAAG;AAChC,YAAI,MAAM,yCAAyC,YAAY,EAAE;AACjE,eAAO;AAAA,MACT;AAEA,YAAM,UAAU,GAAG,aAAa,cAAc,OAAO;AACrD,YAAM,WAAW,KAAK,MAAM,OAAO;AAOnC,UAAI,SAAS,sBAAsB,OAAO;AACxC,cAAM,gBAAgB,SAAS,qBAAqB;AACpD,YAAI,MAAM,qDAAqD,aAAa,EAAE;AAC9E,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,YAAM,WAAW,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAChE,UAAI,MAAM,wCAAwC,QAAQ,EAAE;AAC5D,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,qBAAqB,SAAgC;AAC3D,QAAI;AAGF,YAAM,UAAU,KAAK,eAAe;AACpC,YAAM,WAAW;AAAA,QACf,KAAK,OAAO,mBAAmB;AAAA,QAC/B,GAAG,OAAO;AAAA,QACV;AAAA,QACA;AAAA,MACF;AAEA,YAAM,UAAU,SAAS,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,GAAG,WAAW,CAAC,CAAC;AACrE,UAAI,CAAC,SAAS;AACZ,YAAI,MAAM,sDAAsD,SAAS,KAAK,IAAI,CAAC,GAAG;AACtF,eAAO;AAAA,MACT;AAIA,UAAI,MAAM,qBAAqB,OAAO,YAAY;AAClD,YAAM,eAAe,WAAW,MAAM,KAAK;AAC3C,YAAM,SAAS,kBAAkB,SAAS,CAAC,MAAM,QAAQ,GAAG;AAAA,QAC1D,UAAU;AAAA,QACV,SAAS;AAAA,QACT,OAAO;AAAA;AAAA,QACP,KAAK,SAAS;AAAA,UACZ,MAAM,GAAG,KAAK,OAAO,kBAAkB,GAAG,OAAO,uBAAuB,mDAAmD,YAAY;AAAA,UACvI,MAAM;AAAA,QACR,CAAC;AAAA,MACH,CAAC;AAED,UAAI,OAAO,OAAO;AAChB,YAAI,MAAM,0BAA0B,OAAO,MAAM,OAAO,EAAE;AAC1D,eAAO;AAAA,MACT;AAEA,UAAI,OAAO,UAAU,OAAO,OAAO,KAAK,GAAG;AACzC,YAAI,MAAM,qBAAqB,OAAO,OAAO,MAAM,GAAG,GAAG,CAAC,EAAE;AAAA,MAC9D;AAEA,YAAM,SAAS,OAAO,UAAU;AAChC,UAAI,CAAC,OAAO,KAAK,GAAG;AAClB,YAAI,MAAM,0EAA0E;AACpF,eAAO;AAAA,MACT;AAGA,UAAI;AAOJ,UAAI;AACF,iBAAS,KAAK,MAAM,MAAM;AAAA,MAC5B,SAAS,UAAU;AACjB,YAAI,MAAM,+BAA+B,QAAQ,EAAE;AACnD,eAAO;AAAA,MACT;AAEA,UAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,GAAG;AACjD,YAAI,MAAM,2BAA2B;AACrC,eAAO;AAAA,MACT;AAGA,YAAM,QAAQ,OAAO;AAAA,QAAK,CAAC,MACzB,EAAE,eAAe,WACjB,EAAE,aAAa,WACd,EAAE,YAAY,SAAS,QAAQ,QAAQ,YAAY,EAAE,CAAC;AAAA,MACzD;AAEA,UAAI,CAAC,OAAO;AACV,YAAI,MAAM,mBAAmB,OAAO,iCAAiC,OAAO,IAAI,OAAK,EAAE,UAAU,EAAE,KAAK,IAAI,CAAC,EAAE;AAC/G,eAAO;AAAA,MACT;AAGA,YAAM,gBAAgB,MAAM,iBAAiB,MAAM;AAEnD,UAAI,eAAe;AACjB,YAAI,KAAK,oCAAoC,aAAa,QAAQ,OAAO,UAAU,MAAM,gBAAgB,GAAG;AAC5G,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,IACT,SAAS,KAAK;AAEZ,YAAM,WAAW,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAChE,UAAI,MAAM,qBAAqB,QAAQ,EAAE;AACzC,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,gBAAgB,SAAiG;AACvH,QAAI;AACF,YAAM,SAAS,kBAAkB,OAAO,CAAC,MAAM,QAAQ,GAAG;AAAA,QACxD,UAAU;AAAA,QACV,SAAS;AAAA,QACT,OAAO;AAAA,MACT,CAAC;AAED,UAAI,OAAO,OAAO;AAChB,eAAO;AAAA,MACT;AAEA,YAAM,SAAS,OAAO,UAAU;AAChC,UAAI,CAAC,OAAO,KAAK,GAAG;AAClB,eAAO;AAAA,MACT;AAEA,UAAI;AAOJ,UAAI;AACF,iBAAS,KAAK,MAAM,MAAM;AAAA,MAC5B,QAAQ;AACN,eAAO;AAAA,MACT;AAEA,UAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,GAAG;AACjD,eAAO;AAAA,MACT;AAEA,YAAM,QAAQ,OAAO;AAAA,QAAK,CAAC,MACzB,EAAE,eAAe,WACjB,EAAE,aAAa,WACd,EAAE,YAAY,SAAS,QAAQ,QAAQ,YAAY,EAAE,CAAC;AAAA,MACzD;AAEA,UAAI,CAAC,SAAS,CAAC,MAAM,eAAe;AAClC,eAAO;AAAA,MACT;AAEA,aAAO;AAAA,QACL,eAAe,MAAM;AAAA,QACrB,kBAAkB,MAAM,oBAAoB,MAAM;AAAA,QAClD,YAAY,MAAM,cAAc;AAAA,MAClC;AAAA,IACF,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,uBAAuB,SAAgC;AACrD,UAAM,MAAM,KAAK,IAAI;AAGrB,QAAI,KAAK,eAAe;AACtB,YAAM,OAAO,KAAK,cAAc,gBAAgB,OAAO;AACvD,UAAI,KAAK,WAAW,cAAc,KAAK,eAAe;AACpD,YAAI,MAAM,qDAAqD,KAAK,aAAa,EAAE;AAEnF,aAAK,mBAAmB,KAAK;AAC7B,aAAK,eAAe;AACpB,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAGA,QAAI,KAAK,oBAAoB,MAAM,KAAK,eAAe,gBAAe,uBAAuB;AAC3F,UAAI,MAAM,gDAAgD,KAAK,gBAAgB,EAAE;AACjF,aAAO,KAAK;AAAA,IACd;AAGA,UAAM,UAAU,KAAK,gBAAgB,OAAO;AAC5C,QAAI,SAAS,eAAe;AAC1B,WAAK,mBAAmB,QAAQ;AAChC,WAAK,eAAe;AAGpB,YAAM,yBAAyB,KAAK,IAAI,KAAK,MAAM,QAAQ,gBAAgB,CAAC,GAAG,KAAK;AACpF,YAAM,eAAe,KAAK,IAAI,wBAAwB,IAAI;AAE1D,UAAI,KAAK,eAAe;AACtB,aAAK,cAAc,gBAAgB,SAAS;AAAA,UAC1C,uBAAuB,QAAQ,oBAAoB,QAAQ;AAAA,UAC3D,eAAe,QAAQ;AAAA,UACvB,0BAA0B,QAAQ,oBAAoB,QAAQ,iBAAiB;AAAA,UAC/E,qBAAqB;AAAA,UACrB,QAAQ;AAAA,QACV,CAAC;AACD,YAAI,KAAK,oCAAoC,OAAO,KAAK,QAAQ,aAAa,aAAa,YAAY,gBAAgB;AAAA,MACzH;AACA,aAAO,QAAQ;AAAA,IACjB;AAGA,UAAM,gBAAgB,KAAK,qBAAqB,OAAO;AACvD,QAAI,eAAe;AACjB,WAAK,mBAAmB;AACxB,WAAK,eAAe;AAEpB,UAAI,KAAK,eAAe;AACtB,cAAM,yBAAyB,KAAK,IAAI,KAAK,MAAM,gBAAgB,CAAC,GAAG,KAAK;AAC5E,cAAM,eAAe,KAAK,IAAI,wBAAwB,IAAI;AAC1D,aAAK,cAAc,gBAAgB,SAAS;AAAA,UAC1C,uBAAuB;AAAA,UACvB,eAAe;AAAA,UACf,yBAAyB;AAAA,UACzB,qBAAqB;AAAA,UACrB,QAAQ;AAAA,QACV,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT;AAGA,UAAM,kBAAkB,KAAK,+BAA+B;AAC5D,QAAI,iBAAiB;AACnB,UAAI,KAAK,8CAA8C,eAAe,EAAE;AACxE,WAAK,mBAAmB;AACxB,WAAK,eAAe;AACpB,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,oBAA0B;AACxB,SAAK,mBAAmB;AACxB,SAAK,eAAe;AACpB,QAAI,MAAM,gCAAgC;AAAA,EAC5C;AAAA,EAEQ,oBAAoB,MAAc,KAAK,IAAI,GAAW;AAC5D,WAAO,KAAK,IAAI,GAAG,KAAK,kBAAkB,GAAG;AAAA,EAC/C;AAAA,EAEQ,qBAA2B;AACjC,QAAI,KAAK,oBAAqB;AAC9B,SAAK,sBAAsB;AAE3B,mBAAe,MAAM;AACnB,WAAK,sBAAsB;AAC3B,WAAK,6BAA6B;AAAA,IACpC,CAAC;AAAA,EACH;AAAA,EAEQ,oBAA6B;AACnC,WACE,KAAK,cAAc,iBAAiB,EAAE,SAAS,KAC/C,KAAK,cAAc,WAAW,SAAS;AAAA,EAE3C;AAAA,EAEQ,qBAAqB,UAAiE;AAC5F,UAAM,OAAO,KAAK,cAAc,QAAQ,EAAE,MAAM;AAChD,WAAO,QAAQ;AAAA,EACjB;AAAA,EAEQ,oCAA4C;AAClD,QAAI,UAAU;AACd,eAAW,YAAY,CAAC,mBAAmB,YAAY,GAAY;AACjE,aAAO,KAAK,cAAc,QAAQ,EAAE,SAAS,GAAG;AAC9C,cAAM,SAAS,KAAK,cAAc,QAAQ,EAAE,MAAM;AAClD,gBAAQ,QAAQ,IAAI;AACpB,mBAAW;AAAA,MACb;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,+BAAqC;AAC3C,QAAI,CAAC,KAAK,gBAAgB,IAAI,iBAAiB,GAAG;AAChD,YAAM,eAAe,KAAK,qBAAqB,iBAAiB;AAChE,UAAI,cAAc;AAChB,aAAK,gBAAgB,IAAI,iBAAiB;AAC1C,aAAK,KAAK,iBAAiB,YAAY;AAAA,MACzC;AAAA,IACF;AAEA,QAAI,CAAC,KAAK,gBAAgB,IAAI,YAAY,GAAG;AAC3C,YAAM,iBAAiB,KAAK,qBAAqB,YAAY;AAC7D,UAAI,gBAAgB;AAClB,aAAK,gBAAgB,IAAI,YAAY;AACrC,aAAK,KAAK,iBAAiB,cAAc;AAAA,MAC3C;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,iBAAiB,MAA4C;AACzE,QAAI;AACF,YAAM,sBAAsB,KAAK,oBAAoB;AACrD,UAAI,sBAAsB,GAAG;AAC3B,cAAM,oBAAoB,KAAK,kCAAkC;AACjE,YAAI;AAAA,UACF,+BAA+B,mBAAmB,2BAA2B,oBAAoB,CAAC;AAAA,QACpG;AACA,aAAK,QAAQ,IAAI;AACjB;AAAA,MACF;AAEA,UAAI,SAA8C;AAClD,UAAI;AACF,iBAAS,MAAM,KAAK,yBAAyB,KAAK,UAAU,KAAK,SAAS;AAAA,UACxE,UAAU,KAAK;AAAA,UACf,cAAc,KAAK;AAAA,QACrB,CAAC;AAAA,MACH,SAAS,KAAK;AACZ,YAAI,KAAK,sCAAsC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC,EAAE;AAAA,MACnG;AACA,WAAK,QAAQ,MAAM;AAAA,IACrB,UAAE;AACA,WAAK,gBAAgB,OAAO,KAAK,QAAQ;AACzC,UAAI,KAAK,kBAAkB,GAAG;AAC5B,aAAK,mBAAmB;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,yBACZ,UACA,SACA,WAC8C;AAC9C,QAAI;AAAA,MACF,6CAA6C,4BAA4B,KAAK,MAAM,EAAE,QAAQ,WAAW,KAAK,OAAO,aAAa;AAAA,IACpI;AAEA,UAAM,YAAY,QAAQ,aAAa;AACvC,UAAM,cAAc,KAAK,IAAI;AAC7B,QAAI,WAAW;AACX,UAAI;AAAA,QACF,mCAAmC,UAAU,QAAQ,WAAW,cAAc,UAAU,YAAY,OAAO,SAAS;AAAA,MACtH;AAAA,IACJ;AAEA,QAAI;AACF,YAAM,cAAc,MAAM,KAAK,kBAAkB;AACjD,UAAI,CAAC,aAAa;AAChB,YAAI;AAAA,UACF,mDAAmD,KAAK,OAAO,WAAW;AAAA,QAC5E;AACA,eAAO;AAAA,MACT;AAEA,YAAM,cAAc,SAAS,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,SAAS,UAAU,IAAI,CAAC;AACjF,YAAM,cAAuC;AAAA,QAC3C,OAAO,KAAK,OAAO;AAAA,QACnB;AAAA,QACA,aAAa,QAAQ,eAAe;AAAA;AAAA,QAEpC,YAAY,QAAQ,aAAa;AAAA,MACnC;AAKA,UAAI,QAAQ,gBAAgB,SAAS,eAAe;AAClD,oBAAY,kBAAkB,QAAQ;AAAA,MACxC;AAmBA,YAAM,yBACJ,QAAQ,yBAAyB,QAChC,KAAK,oBACJ,+BAA+B,IAAI,SAAS;AAChD,UACE,0BACA,KAAK,iBAAiB,QACtB,6BAA6B,IAAI,KAAK,YAAY,GAClD;AACA,oBAAY,uBAAuB,EAAE,iBAAiB,MAAM;AAAA,MAC9D,WAAW,0BAA0B,KAAK,iBAAiB,UAAU;AAUnE,cAAM,SAAS,KAAK,OAAO;AAC3B,YAAI,QAAQ;AACV,sBAAY,mBAAmB;AAAA,QACjC;AAAA,MACF;AAGA,YAAM,UAAU;AAAA,QACd,KAAK,OAAO,YAAY,QAAQ,aAAa,WAAW;AAAA,MAC1D;AACA,YAAM,UAAU,QAAQ,SAAS,KAAK,IAClC,GAAG,OAAO,sBACV,GAAG,OAAO;AAEd,YAAM,kBAAkB,KAAK,UAAU,WAAW;AAClD,UAAI;AAAA,QACF,iCAAiC,OAAO,eAAe,KAAK,OAAO,aAAa;AAAA,MAClF;AAEA,UAAI,MAAM,kCAAkC,gBAAgB,MAAM,EAAE;AAGpE,UAAI,KAAK,OAAO,OAAO;AACrB,YAAI;AACF,gBAAM,EAAE,cAAc,IAAI,MAAM,OAAO,IAAS;AAChD,wBAAc,iCAAiC,eAAe;AAAA,QAChE,QAAQ;AAAA,QAER;AAAA,MACF;AAEA,YAAM,qBACJ,OAAO,QAAQ,cAAc,WACzB,KAAK,IAAI,KAAK,OAAO,mBAAmB,QAAQ,SAAS,IACzD,KAAK,OAAO;AAClB,YAAM,cAAc,IAAI,KAAK,IAAI,GAAG,KAAK,OAAO,qBAAqB;AACrE,UAAI,WAA4B;AAChC,UAAI,iBAA+B;AACnC,eAAS,UAAU,GAAG,WAAW,aAAa,WAAW,GAAG;AAC1D,cAAM,eAAe,IAAI,gBAAgB;AACzC,cAAM,iBAAiB,WAAW,MAAM,aAAa,MAAM,GAAG,kBAAkB;AAChF,YAAI;AACF,qBAAW,MAAM,MAAM,SAAS;AAAA,YAC9B,QAAQ;AAAA,YACR,SAAS,KAAK,oBAAoB;AAAA,cAChC,gBAAgB;AAAA,YAClB,CAAC;AAAA,YACD,MAAM,KAAK,UAAU,WAAW;AAAA,YAChC,QAAQ,aAAa;AAAA,UACvB,CAAC;AAAA,QACH,SAAS,KAAK;AACZ,cAAI,CAAC,KAAK,aAAa,GAAG,EAAG,OAAM;AACnC,2BAAiB,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC;AACnE,cAAI,UAAU,aAAa;AACzB,kBAAMA,aAAY,KAAK,OAAO,yBAAyB;AACvD,gBAAI;AAAA,cACF,iCAAiC,SAAS,YAAY,OAAO,IAAI,WAAW,cAAc,kBAAkB,UAAU,KAAK,OAAO,aAAa,oBAAoBA,UAAS;AAAA,YAC9K;AACA,kBAAM,IAAI,QAAQ,CAAC,YAAY,WAAW,SAASA,UAAS,CAAC;AAC7D;AAAA,UACF;AACA;AAAA,QACF,UAAE;AACA,uBAAa,cAAc;AAAA,QAC7B;AAEA,YAAI,SAAS,GAAI;AACjB,YAAI,SAAS,UAAU,OAAO,UAAU,aAAa;AACnD,cAAI;AACF,kBAAM,YAAY,MAAM,SAAS,MAAM,EAAE,KAAK;AAC9C,kBAAM,uBACJ,KAAK,gDAAgD,SAAS;AAChE,gBAAI,sBAAsB;AACxB,mBAAK;AAAA,gBACH;AAAA,gBACA,KAAK,OAAO;AAAA,cACd;AACA,mBAAK,kBAAkB;AACvB,qBAAO;AAAA,YACT;AAAA,UACF,SAAS,GAAG;AACV,gBAAI,MAAM,qDAAqD,CAAC,EAAE;AAAA,UACpE;AAAA,QACF;AACA,YAAI,SAAS,SAAS,OAAO,WAAW,YAAa;AAErD,cAAM,YAAY,KAAK,OAAO,yBAAyB;AACvD,YAAI;AAAA,UACF,yBAAyB,SAAS,MAAM,uBAAuB,UAAU,CAAC,IAAI,WAAW,WAAW,SAAS;AAAA,QAC/G;AACA,cAAM,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,SAAS,CAAC;AAAA,MAC/D;AACA,UAAI;AAAA,QACF,wCAAwC,UAAU,MAAM,QAAQ,UAAU,EAAE;AAAA,MAC9E;AAEA,UAAI,CAAC,UAAU;AACb,YAAI,gBAAgB;AAClB,cAAI;AAAA,YACF,mCAAmC,WAAW,mBAAmB,SAAS,cAAc,kBAAkB,UAAU,KAAK,OAAO,aAAa,gBAAgB,WAAW,eAAe,KAAK,IAAI,IAAI,WAAW;AAAA,UACjN;AAAA,QACF,OAAO;AACL,cAAI;AAAA,YACF,oDAAoD,SAAS,UAAU,KAAK,OAAO,aAAa,eAAe,KAAK,IAAI,IAAI,WAAW;AAAA,UACzI;AAAA,QACF;AACA,eAAO;AAAA,MACT;AAEA,UAAI,CAAC,SAAS,IAAI;AAChB,YAAI,SAAS;AACb,YAAI,YAAY;AAChB,YAAI;AACF,sBAAY,MAAM,SAAS,KAAK;AAEhC,cAAI;AACF,kBAAM,SAAS,KAAK,MAAM,SAAS;AACnC,qBAAS,QAAQ,OAAO,UAAU,WAAM,OAAO,MAAM,OAAO,KAAK;AAAA,UACnE,QAAQ;AAEN,gBAAI,MAAM,yBAAyB,UAAU,MAAM,GAAG,GAAG,CAAC,EAAE;AAAA,UAC9D;AAAA,QACF,SAAS,GAAG;AACV,cAAI,MAAM,wCAAwC,CAAC,EAAE;AAAA,QACvD;AACA,YAAI;AAAA,UACF,6BAA6B,SAAS,MAAM,IAAI,SAAS,UAAU,GAAG,MAAM,QACrE,SAAS,WAAW,KAAK,OAAO,aAAa,SAAS,OAAO,iBAAiB,WAAW,eAAe,YAAY,UAAoB;AAAA,QACjJ;AACA,cAAM,uBACJ,KAAK,mCAAmC,MAAM,KAC9C,KAAK,gDAAgD,SAAS;AAChE,YAAI,sBAAsB;AACxB,eAAK;AAAA,YACH;AAAA,YACA,KAAK,OAAO;AAAA,UACd;AACA,eAAK,kBAAkB;AACvB,iBAAO;AAAA,QACT;AACA,YAAI,SAAS,WAAW,KAAK;AAC3B,eAAK,mBAAmB;AACxB,cAAI,KAAK,mBAAmB,KAAK,OAAO,0BAA0B;AAChE,iBAAK,kBAAkB,KAAK,IAAI,IAAI,KAAK,OAAO;AAChD,gBAAI;AAAA,cACF,oCAAoC,KAAK,OAAO,qBAAqB,YAC1D,KAAK,eAAe;AAAA,YACjC;AACA,iBAAK,kBAAkB;AAAA,UACzB;AAAA,QACF,OAAO;AACL,eAAK,kBAAkB;AAAA,QACzB;AACA,eAAO;AAAA,MACT;AACA,WAAK,kBAAkB;AAEvB,YAAM,OAAQ,MAAM,SAAS,KAAK;AAWlC,UAAI;AAAA,QACF,+BAA+B,KAAK,SAAS,MAAM,WAAW,KAAK,UAAU,KAAK,KAAK,CAAC;AAAA,MAC1F;AAKA,YAAM,MAAM,KAAK,UAAU,CAAC,GAAG;AAC/B,YAAM,UAAU,KAAK,WAAW,KAAK,qBAAqB;AAC1D,UAAI,CAAC,SAAS;AACZ,YAAI,KAAK,6CAA6C,KAAK,UAAU,KAAK,OAAO,GAAG,MAAM,GAAG,GAAG,CAAC,EAAE;AACnG,eAAO;AAAA,MACT;AAGA,YAAM,QAAQ,KAAK,QACf;AAAA,QACE,cAAc,KAAK,MAAM,iBAAiB;AAAA,QAC1C,kBAAkB,KAAK,MAAM,qBAAqB;AAAA,QAClD,aAAa,KAAK,MAAM,gBAAgB;AAAA,MAC1C,IACA,KAAK,eAAe,UAAU,OAAO;AAEzC,YAAM,aAAa,KAAK,IAAI,IAAI;AAChC,UAAI,sCAAsC,KAAK,MAAM,EAAE,WAAW,cAAc,KAAK,OAAO,oBAAoB;AAC9G,cAAMC,eAAc,SAAS,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,SAAS,UAAU,IAAI,CAAC;AACjF,cAAM,KAAK,QAAQ,YAAY,OAAO,QAAQ,SAAS,KAAK;AAC5D,YAAI;AAAA,UACF,kBAAkB,EAAE,eAAe,UAAU,UAAU,KAAK,OAAO,aAAa,QAAQ,OAAO,gBAAgBA,YAAW,iBAAiB,MAAM,gBAAgB,gBAAgB,MAAM,WAAW;AAAA,QACpM;AAAA,MACF;AAEA,UAAI,MAAM,yCAAyC,MAAM,WAAW;AACpE,aAAO,EAAE,SAAS,MAAM;AAAA,IAC1B,SAAS,KAAK;AACZ,YAAM,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC9D,YAAM,aAAa,KAAK,IAAI,IAAI;AAChC,UAAI,KAAK,aAAa,GAAG,GAAG;AAC1B,YAAI;AAAA,UACF,iCAAiC,SAAS,cAAc,QAAQ,aAAa,KAAK,OAAO,iBAAiB,UAAU,KAAK,OAAO,aAAa,eAAe,UAAU,UAAU,MAAM;AAAA,QACxL;AACA,eAAO;AAAA,MACT;AACA,UAAI,KAAK,+BAA+B,SAAS,UAAU,MAAM,EAAE;AACnE,WAAK,cAAc;AACnB,YAAM,uBAAuB,KAAK,mCAAmC,MAAM;AAC3E,UAAI,sBAAsB;AACxB,aAAK;AAAA,UACH;AAAA,UACA,KAAK,OAAO;AAAA,QACd;AAAA,MACF;AACA,aAAO;AAAA,IACT,UAAE;AACA,UAAI,WAAW;AACb,cAAM,eAAe,KAAK,IAAI;AAC9B,cAAM,SAAS,cAAc,UAAU;AACvC,YAAI;AAAA,UACF,oCAAoC,UAAU,QAAQ,WAAW,MAAM,UAAU,eAAe,WAAW,YAAY,eAAe,UAAU,YAAY,OAAO,SAAS;AAAA,QAC9K;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,qBAAqD;AACzD,UAAM,UAAU;AAAA,MACd,KAAK,OAAO,YAAY,QAAQ,aAAa,WAAW;AAAA,IAC1D;AAGA,UAAM,YAAY,QAAQ,SAAS,KAAK,IACpC,GAAG,OAAO,YACV,GAAG,OAAO;AACd,QAAI,MAAM,4BAA4B,SAAS,EAAE;AAEjD,QAAI;AACF,YAAM,SAAS,MAAM,KAAK,iBAAiB,WAAW,GAAI;AAC1D,UAAI,CAAC,OAAO,IAAI;AACd,YAAI,OAAO,WAAW,OAAO,OAAO,WAAW,KAAK;AAClD,cAAI;AAAA,YACF,sDAAsD,SAAS;AAAA,UACjE;AAAA,QACF;AACA,YAAI,KAAK,0CAA0C,SAAS,0BAA0B;AACtF,eAAO;AAAA,MACT;AACA,UAAI,CAAC,OAAO,MAAM;AAChB,YAAI,KAAK,oCAAoC,SAAS,EAAE;AACxD,eAAO;AAAA,MACT;AAEA,YAAM,OAAO,OAAO;AAiBpB,UAAI,CAAC,MAAM,QAAQ,KAAK,IAAI,KAAK,KAAK,KAAK,WAAW,GAAG;AACvD,YAAI,KAAK,8BAA8B;AACvC,eAAO;AAAA,MACT;AAGA,YAAM,WAAW,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,OAAO,OAAO;AAC1D,UAAI;AAAA,QACF,oBAAoB,SAAS,MAAM,wBAAwB,SAAS,MAAM,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC;AAAA,MAC7F;AAGA,YAAM,kBAAkB,KAAK,OAAO;AACpC,UAAI,QAAQ,KAAK,KAAK,KAAK,CAAC,MAAM,EAAE,OAAO,eAAe;AAG1D,UAAI,CAAC,OAAO;AACV,gBAAQ,KAAK,KAAK;AAAA,UAAK,CAAC,MACtB,gBAAgB,SAAS,EAAE,MAAM,EAAE,MAClC,EAAE,MAAM,IAAI,SAAS,gBAAgB,QAAQ,YAAY,EAAE,CAAC;AAAA,QAC/D;AAAA,MACF;AAGA,UAAI,CAAC,OAAO;AACV,gBAAQ,KAAK,KAAK,CAAC;AACnB,cAAM,mBAAmB,KAAK,KAC3B,IAAI,CAAC,MAAM,EAAE,EAAE,EACf,OAAO,OAAO,EACd,MAAM,GAAG,EAAE,EACX,KAAK,IAAI;AACZ,YAAI;AAAA,UACF,qBAAqB,eAAe,oCAC1B,MAAM,EAAE,oCAAoC,gBAAgB;AAAA,QACxE;AAAA,MACF;AAGA,UAAI,gBAAgB,MAAM,sBAAsB,MAAM;AAGtD,UAAI,CAAC,eAAe;AAClB,YAAI,KAAK,iEAAiE;AAC1E,cAAM,aAAa,KAAK,uBAAuB,MAAM,MAAM,EAAE;AAC7D,YAAI,YAAY;AACd,0BAAgB;AAAA,QAClB;AAAA,MACF;AAEA,WAAK,kBAAkB;AAAA,QACrB,IAAI,MAAM,MAAM;AAAA,QAChB;AAAA,QACA,WAAW,MAAM;AAAA,MACnB;AAEA,UAAI;AAAA,QACF,6BAA6B,KAAK,gBAAgB,EAAE,qBACjC,eAAe,eAAe,KAAK,2BAA2B;AAAA,MACnF;AAEA,aAAO,KAAK;AAAA,IACd,SAAS,KAAK;AACZ,UAAI,KAAK,+BAA+B,GAAG,EAAE;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,oBAAoB,uBAIvB;AACD,UAAM,WAAqB,CAAC;AAE5B,UAAM,YAAY,MAAM,KAAK,mBAAmB;AAChD,QAAI,CAAC,WAAW;AACd,aAAO,EAAE,WAAW,OAAO,UAAU,CAAC,0CAA0C,EAAE;AAAA,IACpF;AAGA,QAAI,yBAAyB,UAAU,eAAe;AACpD,UAAI,UAAU,gBAAgB,uBAAuB;AACnD,iBAAS;AAAA,UACP,kCAAkC,UAAU,EAAE,aAAa,UAAU,cAAc,eAAe,CAAC,yCACnE,sBAAsB,eAAe,CAAC,6BAC3C,UAAU,aAAa;AAAA,QACpD;AAAA,MACF;AAAA,IACF;AAGA,QAAI,CAAC,UAAU,eAAe;AAC5B,eAAS;AAAA,QACP,sDAAsD,UAAU,EAAE;AAAA,MAEpE;AAAA,IACF;AAEA,WAAO;AAAA,MACL,WAAW;AAAA,MACX,qBAAqB,UAAU;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,eACJ,UACA,UAAyC,CAAC,GACI;AAC9C,QAAI,CAAC,4BAA4B,KAAK,MAAM,EAAE,UAAU;AACtD,UAAI,MAAM,qCAAqC;AAC/C,aAAO;AAAA,IACT;AAEA,UAAM,cAAc,KAAK,oBAAoB;AAC7C,QAAI,cAAc,GAAG;AACnB,UAAI,MAAM,+BAA+B,WAAW,iCAAiC;AACrF,aAAO;AAAA,IACT;AACA,QAAI,QAAQ,UAAU;AACpB,YAAM,WAAW,QAAQ;AACzB,aAAO,MAAM,IAAI,QAA6C,CAAC,YAAY;AACzE,aAAK,cAAc,QAAQ,EAAE,KAAK;AAAA,UAChC;AAAA,UACA;AAAA,UACA;AAAA,UACA,cAAc,KAAK,IAAI;AAAA,UACvB;AAAA,QACF,CAAC;AACD,aAAK,mBAAmB;AAAA,MAC1B,CAAC;AAAA,IACH;AAEA,WAAO,MAAM,KAAK,yBAAyB,UAAU,OAAO;AAAA,EAC9D;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,eACN,UACA,UACyE;AACzE,UAAM,cAAc,SAAS,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,QAAQ,CAAC;AACzE,UAAM,eAAe,KAAK,KAAK,cAAc,CAAC;AAC9C,UAAM,mBAAmB,KAAK,KAAK,SAAS,SAAS,CAAC;AAEtD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,aAAa,eAAe;AAAA,IAC9B;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,aACJ,gBACA,mBACA,eACY;AAEZ,QAAI,4BAA4B,KAAK,MAAM,EAAE,UAAU;AACrD,YAAM,cAAc,MAAM,eAAe;AACzC,UAAI,gBAAgB,MAAM;AACxB,YAAI,MAAM,GAAG,aAAa,kBAAkB;AAC5C,eAAO;AAAA,MACT;AAGA,UAAI,KAAK,OAAO,kBAAkB;AAChC,YAAI,KAAK,GAAG,aAAa,gDAAgD;AAAA,MAC3E,OAAO;AACL,cAAM,IAAI,MAAM,GAAG,aAAa,+CAA+C;AAAA,MACjF;AAAA,IACF;AAGA,WAAO,kBAAkB;AAAA,EAC3B;AACF;","names":["backoffMs","promptChars"]}

package/dist/chunk-OBMR4VIX.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/graph.ts"],"sourcesContent":["/**\n * Multi-Graph Memory (MAGMA/SYNAPSE-inspired, v8.2)\n *\n * Maintains three typed edge graphs:\n *   entity.jsonl  — memories sharing a named entity (entityRef)\n *   time.jsonl    — consecutive memories in the same thread/session\n *   causal.jsonl  — memories linked by causal language heuristics\n *\n * Stored under `<memoryDir>/state/graphs/`.\n * All writes are fail-open: errors are caught/logged, never thrown.\n */\n\nimport { appendFile, mkdir, readFile } from \"node:fs/promises\";\nimport * as path from \"node:path\";\n\nimport { readEdgeConfidence } from \"./graph-edge-reinforcement.js\";\nimport { emitGraphEvent } from \"./graph-events.js\";\nimport type { GraphConstructionCapabilitySet } from \"./capabilities.js\";\n\nexport type GraphType = \"entity\" | \"time\" | \"causal\";\n\nexport interface GraphEdge {\n  from: string; // relative memory path (e.g. \"facts/2026-02-22/abc.md\")\n  to: string; // relative memory path\n  type: GraphType;\n  weight: number; // 1.0 default, decay applied during traversal\n  label: string; // entity name, threadId, or matched causal phrase\n  ts: string; // ISO timestamp of edge creation\n\n  // Issue #681 — edge confidence + reinforcement (PR 1/3: schema + primitive only).\n  // Both fields are optional so existing edges without confidence still validate.\n  // Treat a missing `confidence` as 1.0 (legacy behavior) at read sites.\n  // PR 2/3 wires the maintenance decay job; PR 3/3 weights PageRank traversal by confidence.\n  confidence?: number; // [0, 1]; missing = 1.0\n  lastReinforcedAt?: string; // ISO timestamp of most recent reinforcement\n}\n\nexport interface GraphConfig {\n  multiGraphMemoryEnabled: boolean;\n  entityGraphEnabled: boolean;\n  timeGraphEnabled: boolean;\n  causalGraphEnabled: boolean;\n  maxGraphTraversalSteps: number;\n  graphActivationDecay: number;\n  maxEntityGraphEdgesPerMemory: number;\n  graphLateralInhibitionEnabled: boolean;\n  graphLateralInhibitionBeta: number;\n  graphLateralInhibitionTopM: number;\n  /**\n   * Issue #681 PR 3/3 — minimum edge confidence required for traversal.\n   * Edges with confidence below this floor are pruned. Legacy edges\n   * (no `confidence` field) are treated as 1.0 and always pass.\n   * Range `[0, 1]`. Default 0.2.\n   */\n  graphTraversalConfidenceFloor: number;\n  /**\n   * Issue #681 PR 3/3 — number of PageRank-style refinement iterations\n   * applied on top of BFS activation. Set to 0 to disable refinement\n   * and return raw BFS scores. Default 8.\n   */\n  graphTraversalPageRankIterations: number;\n}\n\n/** Default minimum edge confidence required for traversal (issue #681 PR 3/3). */\nexport const DEFAULT_GRAPH_TRAVERSAL_CONFIDENCE_FLOOR = 0.2;\n/** Default PageRank-style refinement iteration count (issue #681 PR 3/3). */\nexport const DEFAULT_GRAPH_TRAVERSAL_PAGERANK_ITERATIONS = 8;\n\n// Causal signal phrases — order matters (most specific first)\nexport const CAUSAL_PHRASES = [\"as a result\", \"led to\", \"because of\", \"therefore\", \"caused\", \"because\"];\n\nexport function graphsDir(memoryDir: string): string {\n  return path.join(memoryDir, \"state\", \"graphs\");\n}\n\nexport function graphFilePath(memoryDir: string, type: GraphType): string {\n  return path.join(graphsDir(memoryDir), `${type}.jsonl`);\n}\n\nexport async function ensureGraphsDir(memoryDir: string): Promise<void> {\n  await mkdir(graphsDir(memoryDir), { recursive: true });\n}\n\n// ---------------------------------------------------------------------------\n// Per-graph-file write lock (gotcha #40 promise-chain pattern).\n//\n// Both the append path (`appendEdge`) and the rewrite path used by the\n// decay maintenance job must serialize on the same lock keyed by the\n// JSONL file path. Without this, an extraction can append a new edge\n// between the decay job's read-snapshot and rewrite, silently dropping\n// the appended edge during active traffic (issue #729 / Codex P1).\n// ---------------------------------------------------------------------------\nconst graphWriteLocks = new Map<string, Promise<void>>();\n\n/**\n * Run `fn` while holding the write lock for the given graph JSONL file.\n *\n * The lock is keyed by absolute file path so concurrent writes to\n * different graph types proceed independently. The chain recovers from\n * rejection (gotcha #40) so a single I/O failure does not poison all\n * future writers, but the original error is still surfaced to the\n * caller of `withGraphWriteLock`.\n */\nexport function withGraphWriteLock<T>(filePath: string, fn: () => Promise<T>): Promise<T> {\n  const prev = graphWriteLocks.get(filePath) ?? Promise.resolve();\n  const next = prev.then(fn, fn);\n  graphWriteLocks.set(\n    filePath,\n    next.then(\n      () => undefined,\n      () => undefined\n    )\n  );\n  return next;\n}\n\nexport async function appendEdge(memoryDir: string, edge: GraphEdge): Promise<void> {\n  await ensureGraphsDir(memoryDir);\n  const filePath = graphFilePath(memoryDir, edge.type);\n  const line = `${JSON.stringify(edge)}\\n`;\n  await withGraphWriteLock(filePath, async () => {\n    await appendFile(filePath, line, \"utf8\");\n  });\n  // Emit edge-added event for SSE subscribers (issue #691 PR 5/5).\n  // Fail-open: emitGraphEvent catches listener errors so a bad SSE client\n  // can never surface into the extraction pipeline.\n  emitGraphEvent(memoryDir, \"edge-added\", {\n    source: edge.from,\n    target: edge.to,\n    kind: edge.type,\n    weight: edge.weight,\n    label: edge.label,\n    confidence: typeof edge.confidence === \"number\" ? edge.confidence : 1.0,\n  });\n}\n\nfunction isNodeError(err: unknown): err is NodeJS.ErrnoException {\n  return typeof err === \"object\" && err !== null && \"code\" in err;\n}\n\nfunction parseEdgesJsonl(raw: string, expectedType: GraphType): GraphEdge[] {\n  const edges: GraphEdge[] = [];\n  for (const line of raw.split(\"\\n\")) {\n    const trimmed = line.trim();\n    if (!trimmed) continue;\n    try {\n      const parsed = JSON.parse(trimmed) as unknown;\n      if (isValidGraphEdge(parsed, expectedType)) {\n        edges.push(parsed);\n      }\n    } catch {\n      // skip corrupt lines — fail-open for partial JSONL recovery\n    }\n  }\n  return edges;\n}\n\n/**\n * Read all edges of a given type from the JSONL file.\n * Returns [] if the file doesn't exist or any read error occurs (fail-open).\n *\n * Production traversal callers (recall/PageRank) depend on this fail-open\n * posture so a temporarily missing or unreadable graph file never blocks\n * a recall. Maintenance jobs that need to distinguish ENOENT from real\n * I/O failures must use {@link readEdgesStrict} instead.\n */\nexport async function readEdges(memoryDir: string, type: GraphType): Promise<GraphEdge[]> {\n  const filePath = graphFilePath(memoryDir, type);\n  try {\n    const raw = await readFile(filePath, \"utf8\");\n    return parseEdgesJsonl(raw, type);\n  } catch {\n    return [];\n  }\n}\n\n/**\n * Same as {@link readEdges} but only swallows `ENOENT`; all other read\n * errors (`EACCES`, `EIO`, …) are propagated. Used by the graph-edge\n * decay maintenance job so I/O outages surface as a failed run instead\n * of being silently reported as \"no edges to decay\" (issue #729 /\n * Codex P1, line 120).\n */\nexport async function readEdgesStrict(memoryDir: string, type: GraphType): Promise<GraphEdge[]> {\n  const filePath = graphFilePath(memoryDir, type);\n  try {\n    const raw = await readFile(filePath, \"utf8\");\n    return parseEdgesJsonl(raw, type);\n  } catch (err) {\n    if (isNodeError(err) && err.code === \"ENOENT\") {\n      return [];\n    }\n    throw err;\n  }\n}\n\n/**\n * Read edges from all enabled graph types.\n */\nexport async function readAllEdges(\n  memoryDir: string,\n  graphCaps: Pick<GraphConstructionCapabilitySet, \"entityGraph\" | \"timeGraph\" | \"causalGraph\">,\n): Promise<GraphEdge[]> {\n  const parts: GraphEdge[][] = await Promise.all([\n    graphCaps.entityGraph ? readEdges(memoryDir, \"entity\") : Promise.resolve([]),\n    graphCaps.timeGraph ? readEdges(memoryDir, \"time\") : Promise.resolve([]),\n    graphCaps.causalGraph ? readEdges(memoryDir, \"causal\") : Promise.resolve([]),\n  ]);\n  return parts.flat();\n}\n\nexport interface GraphHealthFileStats {\n  type: GraphType;\n  filePath: string;\n  exists: boolean;\n  totalLines: number;\n  validEdges: number;\n  corruptLines: number;\n  uniqueNodes: number;\n}\n\nexport interface GraphHealthReport {\n  generatedAt: string;\n  enabledTypes: GraphType[];\n  totals: {\n    totalLines: number;\n    validEdges: number;\n    corruptLines: number;\n    uniqueNodes: number;\n  };\n  files: GraphHealthFileStats[];\n  repairGuidance?: string[];\n}\n\nfunction isValidGraphEdge(raw: unknown, expectedType: GraphType): raw is GraphEdge {\n  if (!raw || typeof raw !== \"object\") return false;\n  const edge = raw as Record<string, unknown>;\n  return (\n    edge.type === expectedType &&\n    typeof edge.from === \"string\" &&\n    edge.from.length > 0 &&\n    typeof edge.to === \"string\" &&\n    edge.to.length > 0 &&\n    typeof edge.weight === \"number\" &&\n    Number.isFinite(edge.weight) &&\n    typeof edge.label === \"string\" &&\n    typeof edge.ts === \"string\"\n  );\n}\n\nexport async function analyzeGraphHealth(\n  memoryDir: string,\n  options?: {\n    entityGraphEnabled?: boolean;\n    timeGraphEnabled?: boolean;\n    causalGraphEnabled?: boolean;\n    includeRepairGuidance?: boolean;\n  }\n): Promise<GraphHealthReport> {\n  const enabledTypes: GraphType[] = [];\n  if (options?.entityGraphEnabled !== false) enabledTypes.push(\"entity\");\n  if (options?.timeGraphEnabled !== false) enabledTypes.push(\"time\");\n  if (options?.causalGraphEnabled !== false) enabledTypes.push(\"causal\");\n\n  const files: GraphHealthFileStats[] = [];\n  const globalNodes = new Set<string>();\n\n  for (const type of enabledTypes) {\n    const filePath = graphFilePath(memoryDir, type);\n    let exists = true;\n    let totalLines = 0;\n    let validEdges = 0;\n    let corruptLines = 0;\n    const nodes = new Set<string>();\n\n    try {\n      const raw = await readFile(filePath, \"utf8\");\n      for (const line of raw.split(\"\\n\")) {\n        const trimmed = line.trim();\n        if (!trimmed) continue;\n        totalLines += 1;\n        try {\n          const parsed = JSON.parse(trimmed) as unknown;\n          if (!isValidGraphEdge(parsed, type)) {\n            corruptLines += 1;\n            continue;\n          }\n          validEdges += 1;\n          nodes.add(parsed.from);\n          nodes.add(parsed.to);\n          globalNodes.add(parsed.from);\n          globalNodes.add(parsed.to);\n        } catch {\n          corruptLines += 1;\n        }\n      }\n    } catch {\n      exists = false;\n    }\n\n    files.push({\n      type,\n      filePath,\n      exists,\n      totalLines,\n      validEdges,\n      corruptLines,\n      uniqueNodes: nodes.size,\n    });\n  }\n\n  const totals = files.reduce(\n    (acc, item) => {\n      acc.totalLines += item.totalLines;\n      acc.validEdges += item.validEdges;\n      acc.corruptLines += item.corruptLines;\n      return acc;\n    },\n    {\n      totalLines: 0,\n      validEdges: 0,\n      corruptLines: 0,\n      uniqueNodes: globalNodes.size,\n    }\n  );\n  totals.uniqueNodes = globalNodes.size;\n\n  const report: GraphHealthReport = {\n    generatedAt: new Date().toISOString(),\n    enabledTypes,\n    totals,\n    files,\n  };\n\n  if (options?.includeRepairGuidance === true) {\n    const guidance: string[] = [];\n    if (totals.corruptLines > 0) {\n      guidance.push(\n        \"Corrupt graph lines detected: back up memory/state/graphs, then rebuild graphs from clean memory replay/extraction runs.\"\n      );\n    }\n    if (totals.validEdges === 0) {\n      guidance.push(\n        \"No valid edges detected yet: run normal extraction traffic (or replay ingestion) to seed graph files.\"\n      );\n    }\n    if (guidance.length > 0) report.repairGuidance = guidance;\n  }\n\n  return report;\n}\n\n/**\n * Detect causal signal phrases in text. Returns the first matched phrase, or null.\n */\nexport function detectCausalPhrase(text: string): string | null {\n  const lower = text.toLowerCase();\n  for (const phrase of CAUSAL_PHRASES) {\n    if (lower.includes(phrase)) return phrase;\n  }\n  return null;\n}\n\n/**\n * GraphIndex — builds and updates the three memory graphs.\n *\n * Usage (orchestrator):\n *   this.graphIndex = new GraphIndex(config.memoryDir, config);\n *\n *   // After each memory write:\n *   await this.graphIndex.onMemoryWritten(memoryPath, frontmatter, threadId, recentInThread);\n */\nexport class GraphIndex {\n  private readonly memoryDir: string;\n  private readonly cfg: GraphConfig;\n\n  // Cache for readAllEdges() result.  With 30k+ entity edges (6 MB JSONL) the\n  // file read + JSON parse takes 2-4 s per call.  This instance-level cache\n  // eliminates that overhead on every spreadingActivation() call; it is\n  // invalidated (set to null) in onMemoryWritten() so new edges appear promptly.\n  private edgeCache: { allEdges: GraphEdge[]; loadedAt: number } | null = null;\n  private static readonly EDGE_CACHE_TTL_MS = 300_000; // 5 minutes\n\n  constructor(memoryDir: string, cfg: GraphConfig) {\n    this.memoryDir = memoryDir;\n    this.cfg = cfg;\n  }\n\n  /** Clear the edge cache so the next spreadingActivation() re-reads from disk.\n   *  Call after any code path that appends edges outside of onMemoryWritten(). */\n  invalidateEdgeCache(): void {\n    this.edgeCache = null;\n  }\n\n  private async loadEdgesCached(): Promise<GraphEdge[]> {\n    if (this.edgeCache && Date.now() - this.edgeCache.loadedAt < GraphIndex.EDGE_CACHE_TTL_MS) {\n      return this.edgeCache.allEdges;\n    }\n    const allEdges = await readAllEdges(this.memoryDir, {\n      entityGraph: this.cfg.entityGraphEnabled,\n      timeGraph: this.cfg.timeGraphEnabled,\n      causalGraph: this.cfg.causalGraphEnabled,\n    });\n    this.edgeCache = { allEdges, loadedAt: Date.now() };\n    return allEdges;\n  }\n\n  /**\n   * Called after a memory is written to disk.\n   *\n   * @param memoryPath - relative path from memoryDir (e.g. \"facts/2026-02-22/abc.md\")\n   * @param entityRef  - entityRef frontmatter field (if any)\n   * @param content    - full memory text (for causal detection)\n   * @param created    - ISO timestamp of this memory\n   * @param threadId   - current thread ID (for time graph)\n   * @param recentInThread - paths of the N most-recent memories in this thread (for time graph)\n   * @param entitySiblings - paths of other memories that share the same entityRef (for entity graph)\n   */\n  async onMemoryWritten(opts: {\n    memoryPath: string;\n    entityRef?: string;\n    content: string;\n    created: string;\n    threadId?: string;\n    recentInThread?: string[];\n    entitySiblings?: string[];\n    causalPredecessor?: string;\n    /**\n     * Optional frozen gate overrides (from GraphConstructionCapabilitySet).\n     * When provided, these take precedence over `this.cfg` so the caller's\n     * operation-scoped snapshot is the single source of truth (#1566).\n     */\n    graphCapsOverride?: {\n      entityGraph: boolean;\n      timeGraph: boolean;\n      causalGraph: boolean;\n      multiGraphMemory: boolean;\n    };\n  }): Promise<void> {\n    const g = opts.graphCapsOverride;\n    const multiGraphOn = g ? g.multiGraphMemory : this.cfg.multiGraphMemoryEnabled;\n    if (!multiGraphOn) return;\n    const entityOn = g ? g.entityGraph : this.cfg.entityGraphEnabled;\n    const timeOn = g ? g.timeGraph : this.cfg.timeGraphEnabled;\n    const causalOn = g ? g.causalGraph : this.cfg.causalGraphEnabled;\n    const ts = new Date().toISOString();\n\n    try {\n      // Entity graph\n      if (entityOn && opts.entityRef && opts.entitySiblings?.length) {\n        const siblings = opts.entitySiblings.slice(0, this.cfg.maxEntityGraphEdgesPerMemory);\n        for (const sibling of siblings) {\n          await appendEdge(this.memoryDir, {\n            from: opts.memoryPath,\n            to: sibling,\n            type: \"entity\",\n            weight: 1.0,\n            label: opts.entityRef,\n            ts,\n          });\n        }\n      }\n\n      // Time graph — link to most recent memory in same thread\n      if (timeOn && opts.threadId && opts.recentInThread?.length) {\n        const predecessor = opts.recentInThread[opts.recentInThread.length - 1];\n        if (predecessor && predecessor !== opts.memoryPath) {\n          await appendEdge(this.memoryDir, {\n            from: predecessor,\n            to: opts.memoryPath,\n            type: \"time\",\n            weight: 1.0,\n            label: opts.threadId,\n            ts,\n          });\n        }\n      }\n\n      // Causal graph\n      if (causalOn && opts.causalPredecessor) {\n        const phrase = detectCausalPhrase(opts.content);\n        if (phrase) {\n          await appendEdge(this.memoryDir, {\n            from: opts.causalPredecessor,\n            to: opts.memoryPath,\n            type: \"causal\",\n            weight: 1.0,\n            label: phrase,\n            ts,\n          });\n        }\n      }\n    } catch (err) {\n      // Fail-open: graph write errors must never surface to caller\n      const { log } = await import(\"./logger.js\");\n      log.warn(`[graph] onMemoryWritten error: ${err}`);\n    } finally {\n      // Invalidate edge cache so spreadingActivation() picks up new edges.\n      // In `finally` so the cache is cleared even on partial write failure.\n      this.edgeCache = null;\n    }\n  }\n\n  /**\n   * Spreading activation BFS (SYNAPSE-inspired).\n   *\n   * Starting from `seeds`, traverse the combined graph for up to `maxSteps` hops.\n   * Each candidate gets an activation score = edge.weight × edgeConfidence × decay^hop.\n   *\n   * Issue #681 PR 3/3 — confidence-aware traversal:\n   *   - Each edge's `weight` is multiplied by its `confidence` (legacy edges\n   *     missing `confidence` are treated as 1.0, preserving prior behavior).\n   *   - Edges with `confidence < graphTraversalConfidenceFloor` are pruned and\n   *     contribute neither activation nor downstream neighbors.\n   *   - When `graphTraversalPageRankIterations > 0`, an additional PageRank-\n   *     style refinement pass redistributes activation along confidence-weighted\n   *     edges, sharpening the ranking among multi-hop candidates.\n   *   - Per-result provenance includes the highest-confidence edge that landed\n   *     on each candidate, so the X-ray surface can attribute pruning and\n   *     ranking decisions back to specific edges.\n   *\n   * @param seeds    - initial memory paths to expand from (e.g. QMD top results)\n   * @param maxSteps - max BFS hops (from config: maxGraphTraversalSteps)\n   * @returns Array of {path, score, edgeConfidence, ...} sorted descending, not including seed paths\n   */\n  async spreadingActivation(\n    seeds: string[],\n    maxSteps?: number,\n    opts?: {\n      /**\n       * Issue #681 — when `true`, bypasses the configured\n       * `graphTraversalConfidenceFloor` and includes low-confidence\n       * edges in traversal.  Equivalent to forcing the floor to `0`.\n       * Default `false` (floor from config is applied).\n       */\n      includeLowConfidence?: boolean;\n      /** Absolute deadline in ms-since-epoch for post-retrieval assembly. */\n      deadlineAtMs?: number;\n    }\n  ): Promise<\n    Array<{\n      path: string;\n      score: number;\n      seed: string;\n      hopDepth: number;\n      decayedWeight: number;\n      graphType: \"entity\" | \"time\" | \"causal\";\n      /**\n       * Confidence of the edge that produced this candidate's recorded\n       * provenance (the strongest edge along the chosen entry path).\n       * In `[0, 1]`. Legacy edges without `confidence` surface as 1.0.\n       */\n      edgeConfidence: number;\n    }>\n  > {\n    if (!this.cfg.multiGraphMemoryEnabled) return [];\n    const steps = maxSteps ?? this.cfg.maxGraphTraversalSteps;\n    const decay = this.cfg.graphActivationDecay;\n    // When `includeLowConfidence` is set, use floor=0 so all edges\n    // participate in traversal regardless of their decay state.\n    // Otherwise clamp the configured floor into [0, 1] so misconfiguration\n    // cannot (a) admit edges with negative confidence or (b) reject every\n    // edge.\n    const floor =\n      opts?.includeLowConfidence === true ? 0 : clampConfidenceFloor(this.cfg.graphTraversalConfidenceFloor);\n    const iterations = clampPageRankIterations(this.cfg.graphTraversalPageRankIterations);\n    const deadlineAtMs = opts?.deadlineAtMs;\n    const deadlineExpired = (): boolean =>\n      typeof deadlineAtMs === \"number\" && Date.now() >= deadlineAtMs;\n\n    try {\n      if (deadlineExpired()) return [];\n      const allEdges = await this.loadEdgesCached();\n      if (deadlineExpired()) return [];\n\n      // Build adjacency index: from → edges, to → edges (bidirectional for entity/time, directional for causal).\n      // Edges below the confidence floor are pruned at index time so neither\n      // direct activation nor downstream BFS expansion can re-introduce them.\n      const adj = new Map<string, GraphEdge[]>();\n      for (let i = 0; i < allEdges.length; i += 1) {\n        if ((i & 1023) === 0 && deadlineExpired()) return [];\n        const edge = allEdges[i];\n        const conf = readEdgeConfidence(edge);\n        if (conf < floor) continue;\n        if (!adj.has(edge.from)) adj.set(edge.from, []);\n        adj.get(edge.from)!.push(edge);\n        // Entity and time edges are bidirectional\n        if (edge.type !== \"causal\") {\n          if (!adj.has(edge.to)) adj.set(edge.to, []);\n          adj.get(edge.to)!.push({ ...edge, from: edge.to, to: edge.from });\n        }\n      }\n\n      const seedSet = new Set(seeds);\n      const scores = new Map<string, number>(); // candidate path → accumulated activation score\n      const provenance = new Map<\n        string,\n        {\n          seed: string;\n          hopDepth: number;\n          decayedWeight: number;\n          graphType: \"entity\" | \"time\" | \"causal\";\n          edgeConfidence: number;\n        }\n      >();\n      let frontier = new Map<string, { node: string; seed: string; activation: number }>();\n      const reachedBySeed = new Map<string, Set<string>>();\n      for (const seed of seeds) {\n        frontier.set(`${seed}\\0${seed}`, { node: seed, seed, activation: 1 });\n        reachedBySeed.set(seed, new Set([seed]));\n      }\n      const finalizeScores = () =>\n        Array.from(scores.entries())\n          .map(([p, score]) => ({\n            path: p,\n            score,\n            seed: provenance.get(p)?.seed ?? \"\",\n            hopDepth: provenance.get(p)?.hopDepth ?? 0,\n            decayedWeight: provenance.get(p)?.decayedWeight ?? 0,\n            graphType: provenance.get(p)?.graphType ?? \"entity\",\n            edgeConfidence: provenance.get(p)?.edgeConfidence ?? 1,\n          }))\n          .sort((a, b) => b.score - a.score);\n\n      for (let hop = 0; hop < steps && frontier.size > 0; hop++) {\n        if (deadlineExpired()) return finalizeScores();\n        const nextFrontier = new Map<string, { node: string; seed: string; activation: number }>();\n\n        for (const { node, seed: sourceSeed, activation } of frontier.values()) {\n          const edges = adj.get(node) ?? [];\n          for (let i = 0; i < edges.length; i += 1) {\n            if ((i & 1023) === 0 && deadlineExpired()) return finalizeScores();\n            const edge = edges[i];\n            const neighbor = edge.to === node ? edge.from : edge.to;\n            const conf = readEdgeConfidence(edge);\n            // Defense in depth: the adjacency build already drops sub-floor\n            // edges, but if a synthesized reverse edge ever bypassed that\n            // path, this guard keeps spreading activation honest.\n            if (conf < floor) continue;\n            const score = activation * edge.weight * conf * decay;\n            const reachedForSeed = reachedBySeed.get(sourceSeed);\n            if (reachedForSeed?.has(neighbor)) {\n              continue;\n            }\n\n            if (!seedSet.has(neighbor)) {\n              const existing = scores.get(neighbor) ?? 0;\n              scores.set(neighbor, existing + score);\n\n              const prev = provenance.get(neighbor);\n              if (!prev || hop + 1 < prev.hopDepth || (hop + 1 === prev.hopDepth && score > prev.decayedWeight)) {\n                provenance.set(neighbor, {\n                  seed: sourceSeed,\n                  hopDepth: hop + 1,\n                  decayedWeight: score,\n                  graphType: edge.type,\n                  edgeConfidence: conf,\n                });\n              }\n\n              if (hop + 1 < steps) {\n                const frontierKey = `${sourceSeed}\\0${neighbor}`;\n                const existingFrontier = nextFrontier.get(frontierKey);\n                if (existingFrontier) {\n                  existingFrontier.activation += score;\n                } else {\n                  nextFrontier.set(frontierKey, {\n                    node: neighbor,\n                    seed: sourceSeed,\n                    activation: score,\n                  });\n                }\n              }\n            }\n          }\n        }\n\n        for (const { node, seed } of nextFrontier.values()) {\n          reachedBySeed.get(seed)?.add(node);\n        }\n        frontier = nextFrontier;\n      }\n\n      // Issue #681 PR 3/3 — optional PageRank-style refinement.\n      // Redistributes a node's accumulated activation along its outgoing\n      // edges, weighted by edge confidence. Damping is fixed at the\n      // canonical 0.85 so the ranking stays comparable across queries;\n      // the `iterations` knob bounds compute, not behavior shape.\n      if (!deadlineExpired() && iterations > 0 && scores.size > 1) {\n        applyPageRankRefinement(scores, adj, {\n          iterations,\n          floor,\n          damping: 0.85,\n          deadlineAtMs,\n        });\n      }\n\n      // Apply lateral inhibition if enabled (Synapse-inspired competitive suppression)\n      if (deadlineExpired()) return finalizeScores();\n      if (this.cfg.graphLateralInhibitionEnabled && scores.size > 1) {\n        const inhibited = applyLateralInhibition(scores, {\n          beta: this.cfg.graphLateralInhibitionBeta,\n          topM: this.cfg.graphLateralInhibitionTopM,\n        });\n        for (const [k, v] of inhibited) {\n          scores.set(k, v);\n        }\n      }\n\n      return finalizeScores();\n    } catch (err) {\n      const { log } = await import(\"./logger.js\");\n      log.warn(`[graph] spreadingActivation error: ${err}`);\n      return [];\n    }\n  }\n}\n\n/**\n * Clamp `graphTraversalConfidenceFloor` into the legal range `[0, 1]`.\n * Non-finite or non-numeric values fall back to the documented default\n * so misconfiguration cannot silently disable the floor or reject every edge.\n *\n * Exported for tests; call sites in `spreadingActivation` use it to make\n * the contract explicit at every boundary.\n */\nexport function clampConfidenceFloor(raw: unknown): number {\n  if (typeof raw !== \"number\" || !Number.isFinite(raw)) {\n    return DEFAULT_GRAPH_TRAVERSAL_CONFIDENCE_FLOOR;\n  }\n  if (raw < 0) return 0;\n  if (raw > 1) return 1;\n  return raw;\n}\n\n/**\n * Clamp `graphTraversalPageRankIterations` into a non-negative integer.\n * Negative or non-finite values fall back to 0 (disable refinement) so\n * misconfiguration cannot stall recall in an unbounded loop.\n */\nexport function clampPageRankIterations(raw: unknown): number {\n  if (typeof raw !== \"number\" || !Number.isFinite(raw)) return 0;\n  if (raw <= 0) return 0;\n  return Math.floor(raw);\n}\n\n/**\n * PageRank-style refinement on top of the BFS activation map.\n *\n * Each iteration redistributes a fraction of every node's score along\n * its outgoing edges, scaled by edge confidence. Confidence below\n * `floor` is filtered out before redistribution, mirroring the BFS\n * pruning rule. Mutates `scores` in place.\n *\n * Exported for tests; in production, call sites pass the same adjacency\n * map already used by BFS so behavior stays consistent.\n */\nexport function applyPageRankRefinement(\n  scores: Map<string, number>,\n  adj: Map<string, GraphEdge[]>,\n  opts: { iterations: number; floor: number; damping: number; deadlineAtMs?: number }\n): void {\n  const { iterations, floor, damping, deadlineAtMs } = opts;\n  if (iterations <= 0 || scores.size === 0) return;\n  const safeDamping = Math.min(1, Math.max(0, damping));\n  const deadlineExpired = (): boolean =>\n    typeof deadlineAtMs === \"number\" && Date.now() >= deadlineAtMs;\n\n  // Pre-compute confidence-weighted out-edge totals for normalization.\n  // Done once per refinement, not per iteration, since adjacency is\n  // immutable inside the loop.\n  //\n  // Codex P1 (#735): the denominator MUST be computed over the same\n  // eligible-neighbor set the iteration redistributes into — i.e.\n  // edges whose neighbor is in `scores`. Counting edges-to-seeds (or\n  // edges-to-unseen-nodes) in the denominator while dropping their\n  // flow during iteration leaks `safeDamping × score` every pass and\n  // collapses leaf candidates' scores instead of just re-ranking them.\n  const eligible = (edge: GraphEdge, fromNode: string): boolean => {\n    if (readEdgeConfidence(edge) < floor) return false;\n    const neighbor = edge.to === fromNode ? edge.from : edge.to;\n    return scores.has(neighbor);\n  };\n  const outboundTotal = new Map<string, number>();\n  for (const [node, edges] of adj.entries()) {\n    if (deadlineExpired()) return;\n    if (!scores.has(node)) continue; // only candidate nodes redistribute\n    let sum = 0;\n    for (const edge of edges) {\n      if (!eligible(edge, node)) continue;\n      sum += readEdgeConfidence(edge) * edge.weight;\n    }\n    if (sum > 0) outboundTotal.set(node, sum);\n  }\n\n  for (let i = 0; i < iterations; i += 1) {\n    if (deadlineExpired()) return;\n    const next = new Map<string, number>();\n    // Teleport / damping floor: every node retains `(1 - damping) * score`\n    // of its current activation so dangling nodes do not bleed to zero.\n    for (const [node, score] of scores) {\n      next.set(node, (1 - safeDamping) * score);\n    }\n    for (const [node, score] of scores) {\n      const outEdges = adj.get(node);\n      const total = outboundTotal.get(node);\n      // Dangling-node fallback: when a candidate has zero eligible\n      // outflow (no in-scores neighbors above the floor), the\n      // `safeDamping × score` portion would otherwise evaporate. Keep\n      // it on `node` so total mass is conserved and the score reflects\n      // the candidate's standing rather than its in-degree topology.\n      if (!outEdges || outEdges.length === 0 || !total || total <= 0) {\n        next.set(node, (next.get(node) ?? 0) + safeDamping * score);\n        continue;\n      }\n      for (let edgeIndex = 0; edgeIndex < outEdges.length; edgeIndex += 1) {\n        if ((edgeIndex & 1023) === 0 && deadlineExpired()) return;\n        const edge = outEdges[edgeIndex];\n        if (!eligible(edge, node)) continue;\n        const conf = readEdgeConfidence(edge);\n        const neighbor = edge.to === node ? edge.from : edge.to;\n        const flow = safeDamping * score * ((conf * edge.weight) / total);\n        next.set(neighbor, (next.get(neighbor) ?? 0) + flow);\n      }\n    }\n    for (const [node, score] of next) {\n      scores.set(node, score);\n    }\n  }\n}\n\n/**\n * Lateral inhibition (Synapse-inspired).\n *\n * For each node, the top-M higher-activation competitors exert inhibition\n * proportional to their activation difference. Output is clamped to [0, ∞).\n *\n * No sigmoid is applied here — downstream `normalizeGraphActivationScore`\n * already applies x/(1+x) soft squash, so adding a sigmoid would double-\n * normalize and cap graph influence at ~50%.\n *\n * Formula: u_hat_i = max(0, u_i - beta * sum_{k in top-M where u_k > u_i}(u_k - u_i))\n *\n * When beta=0 or topM=0, returns original scores unchanged (no-op).\n */\nexport function applyLateralInhibition(\n  scores: Map<string, number>,\n  opts: { beta: number; topM: number }\n): Map<string, number> {\n  const { beta, topM } = opts;\n  if (beta === 0 || topM === 0) return new Map(scores);\n\n  const sorted = Array.from(scores.entries()).sort((a, b) => b[1] - a[1]);\n  const topCompetitors = sorted.slice(0, topM);\n\n  const result = new Map<string, number>();\n  for (const [node, u] of scores) {\n    let inhibition = 0;\n    for (const [, uK] of topCompetitors) {\n      if (uK > u) {\n        inhibition += uK - u;\n      }\n    }\n    result.set(node, Math.max(0, u - beta * inhibition));\n  }\n\n  return result;\n}\n"],"mappings":";;;;;;;;AAYA,SAAS,YAAY,OAAO,gBAAgB;AAC5C,YAAY,UAAU;AAmDf,IAAM,2CAA2C;AAEjD,IAAM,8CAA8C;AAGpD,IAAM,iBAAiB,CAAC,eAAe,UAAU,cAAc,aAAa,UAAU,SAAS;AAE/F,SAAS,UAAU,WAA2B;AACnD,SAAY,UAAK,WAAW,SAAS,QAAQ;AAC/C;AAEO,SAAS,cAAc,WAAmB,MAAyB;AACxE,SAAY,UAAK,UAAU,SAAS,GAAG,GAAG,IAAI,QAAQ;AACxD;AAEA,eAAsB,gBAAgB,WAAkC;AACtE,QAAM,MAAM,UAAU,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACvD;AAWA,IAAM,kBAAkB,oBAAI,IAA2B;AAWhD,SAAS,mBAAsB,UAAkB,IAAkC;AACxF,QAAM,OAAO,gBAAgB,IAAI,QAAQ,KAAK,QAAQ,QAAQ;AAC9D,QAAM,OAAO,KAAK,KAAK,IAAI,EAAE;AAC7B,kBAAgB;AAAA,IACd;AAAA,IACA,KAAK;AAAA,MACH,MAAM;AAAA,MACN,MAAM;AAAA,IACR;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,WAAW,WAAmB,MAAgC;AAClF,QAAM,gBAAgB,SAAS;AAC/B,QAAM,WAAW,cAAc,WAAW,KAAK,IAAI;AACnD,QAAM,OAAO,GAAG,KAAK,UAAU,IAAI,CAAC;AAAA;AACpC,QAAM,mBAAmB,UAAU,YAAY;AAC7C,UAAM,WAAW,UAAU,MAAM,MAAM;AAAA,EACzC,CAAC;AAID,iBAAe,WAAW,cAAc;AAAA,IACtC,QAAQ,KAAK;AAAA,IACb,QAAQ,KAAK;AAAA,IACb,MAAM,KAAK;AAAA,IACX,QAAQ,KAAK;AAAA,IACb,OAAO,KAAK;AAAA,IACZ,YAAY,OAAO,KAAK,eAAe,WAAW,KAAK,aAAa;AAAA,EACtE,CAAC;AACH;AAEA,SAAS,YAAY,KAA4C;AAC/D,SAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,UAAU;AAC9D;AAEA,SAAS,gBAAgB,KAAa,cAAsC;AAC1E,QAAM,QAAqB,CAAC;AAC5B,aAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,CAAC,QAAS;AACd,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,OAAO;AACjC,UAAI,iBAAiB,QAAQ,YAAY,GAAG;AAC1C,cAAM,KAAK,MAAM;AAAA,MACnB;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAWA,eAAsB,UAAU,WAAmB,MAAuC;AACxF,QAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,MAAI;AACF,UAAM,MAAM,MAAM,SAAS,UAAU,MAAM;AAC3C,WAAO,gBAAgB,KAAK,IAAI;AAAA,EAClC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AASA,eAAsB,gBAAgB,WAAmB,MAAuC;AAC9F,QAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,MAAI;AACF,UAAM,MAAM,MAAM,SAAS,UAAU,MAAM;AAC3C,WAAO,gBAAgB,KAAK,IAAI;AAAA,EAClC,SAAS,KAAK;AACZ,QAAI,YAAY,GAAG,KAAK,IAAI,SAAS,UAAU;AAC7C,aAAO,CAAC;AAAA,IACV;AACA,UAAM;AAAA,EACR;AACF;AAKA,eAAsB,aACpB,WACA,WACsB;AACtB,QAAM,QAAuB,MAAM,QAAQ,IAAI;AAAA,IAC7C,UAAU,cAAc,UAAU,WAAW,QAAQ,IAAI,QAAQ,QAAQ,CAAC,CAAC;AAAA,IAC3E,UAAU,YAAY,UAAU,WAAW,MAAM,IAAI,QAAQ,QAAQ,CAAC,CAAC;AAAA,IACvE,UAAU,cAAc,UAAU,WAAW,QAAQ,IAAI,QAAQ,QAAQ,CAAC,CAAC;AAAA,EAC7E,CAAC;AACD,SAAO,MAAM,KAAK;AACpB;AAyBA,SAAS,iBAAiB,KAAc,cAA2C;AACjF,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,QAAM,OAAO;AACb,SACE,KAAK,SAAS,gBACd,OAAO,KAAK,SAAS,YACrB,KAAK,KAAK,SAAS,KACnB,OAAO,KAAK,OAAO,YACnB,KAAK,GAAG,SAAS,KACjB,OAAO,KAAK,WAAW,YACvB,OAAO,SAAS,KAAK,MAAM,KAC3B,OAAO,KAAK,UAAU,YACtB,OAAO,KAAK,OAAO;AAEvB;AAEA,eAAsB,mBACpB,WACA,SAM4B;AAC5B,QAAM,eAA4B,CAAC;AACnC,MAAI,SAAS,uBAAuB,MAAO,cAAa,KAAK,QAAQ;AACrE,MAAI,SAAS,qBAAqB,MAAO,cAAa,KAAK,MAAM;AACjE,MAAI,SAAS,uBAAuB,MAAO,cAAa,KAAK,QAAQ;AAErE,QAAM,QAAgC,CAAC;AACvC,QAAM,cAAc,oBAAI,IAAY;AAEpC,aAAW,QAAQ,cAAc;AAC/B,UAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,QAAI,SAAS;AACb,QAAI,aAAa;AACjB,QAAI,aAAa;AACjB,QAAI,eAAe;AACnB,UAAM,QAAQ,oBAAI,IAAY;AAE9B,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,UAAU,MAAM;AAC3C,iBAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,cAAM,UAAU,KAAK,KAAK;AAC1B,YAAI,CAAC,QAAS;AACd,sBAAc;AACd,YAAI;AACF,gBAAM,SAAS,KAAK,MAAM,OAAO;AACjC,cAAI,CAAC,iBAAiB,QAAQ,IAAI,GAAG;AACnC,4BAAgB;AAChB;AAAA,UACF;AACA,wBAAc;AACd,gBAAM,IAAI,OAAO,IAAI;AACrB,gBAAM,IAAI,OAAO,EAAE;AACnB,sBAAY,IAAI,OAAO,IAAI;AAC3B,sBAAY,IAAI,OAAO,EAAE;AAAA,QAC3B,QAAQ;AACN,0BAAgB;AAAA,QAClB;AAAA,MACF;AAAA,IACF,QAAQ;AACN,eAAS;AAAA,IACX;AAEA,UAAM,KAAK;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa,MAAM;AAAA,IACrB,CAAC;AAAA,EACH;AAEA,QAAM,SAAS,MAAM;AAAA,IACnB,CAAC,KAAK,SAAS;AACb,UAAI,cAAc,KAAK;AACvB,UAAI,cAAc,KAAK;AACvB,UAAI,gBAAgB,KAAK;AACzB,aAAO;AAAA,IACT;AAAA,IACA;AAAA,MACE,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,aAAa,YAAY;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,cAAc,YAAY;AAEjC,QAAM,SAA4B;AAAA,IAChC,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACpC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,SAAS,0BAA0B,MAAM;AAC3C,UAAM,WAAqB,CAAC;AAC5B,QAAI,OAAO,eAAe,GAAG;AAC3B,eAAS;AAAA,QACP;AAAA,MACF;AAAA,IACF;AACA,QAAI,OAAO,eAAe,GAAG;AAC3B,eAAS;AAAA,QACP;AAAA,MACF;AAAA,IACF;AACA,QAAI,SAAS,SAAS,EAAG,QAAO,iBAAiB;AAAA,EACnD;AAEA,SAAO;AACT;AAKO,SAAS,mBAAmB,MAA6B;AAC9D,QAAM,QAAQ,KAAK,YAAY;AAC/B,aAAW,UAAU,gBAAgB;AACnC,QAAI,MAAM,SAAS,MAAM,EAAG,QAAO;AAAA,EACrC;AACA,SAAO;AACT;AAWO,IAAM,aAAN,MAAM,YAAW;AAAA,EACL;AAAA,EACA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMT,YAAgE;AAAA,EACxE,OAAwB,oBAAoB;AAAA;AAAA,EAE5C,YAAY,WAAmB,KAAkB;AAC/C,SAAK,YAAY;AACjB,SAAK,MAAM;AAAA,EACb;AAAA;AAAA;AAAA,EAIA,sBAA4B;AAC1B,SAAK,YAAY;AAAA,EACnB;AAAA,EAEA,MAAc,kBAAwC;AACpD,QAAI,KAAK,aAAa,KAAK,IAAI,IAAI,KAAK,UAAU,WAAW,YAAW,mBAAmB;AACzF,aAAO,KAAK,UAAU;AAAA,IACxB;AACA,UAAM,WAAW,MAAM,aAAa,KAAK,WAAW;AAAA,MAClD,aAAa,KAAK,IAAI;AAAA,MACtB,WAAW,KAAK,IAAI;AAAA,MACpB,aAAa,KAAK,IAAI;AAAA,IACxB,CAAC;AACD,SAAK,YAAY,EAAE,UAAU,UAAU,KAAK,IAAI,EAAE;AAClD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,gBAAgB,MAoBJ;AAChB,UAAM,IAAI,KAAK;AACf,UAAM,eAAe,IAAI,EAAE,mBAAmB,KAAK,IAAI;AACvD,QAAI,CAAC,aAAc;AACnB,UAAM,WAAW,IAAI,EAAE,cAAc,KAAK,IAAI;AAC9C,UAAM,SAAS,IAAI,EAAE,YAAY,KAAK,IAAI;AAC1C,UAAM,WAAW,IAAI,EAAE,cAAc,KAAK,IAAI;AAC9C,UAAM,MAAK,oBAAI,KAAK,GAAE,YAAY;AAElC,QAAI;AAEF,UAAI,YAAY,KAAK,aAAa,KAAK,gBAAgB,QAAQ;AAC7D,cAAM,WAAW,KAAK,eAAe,MAAM,GAAG,KAAK,IAAI,4BAA4B;AACnF,mBAAW,WAAW,UAAU;AAC9B,gBAAM,WAAW,KAAK,WAAW;AAAA,YAC/B,MAAM,KAAK;AAAA,YACX,IAAI;AAAA,YACJ,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,OAAO,KAAK;AAAA,YACZ;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAGA,UAAI,UAAU,KAAK,YAAY,KAAK,gBAAgB,QAAQ;AAC1D,cAAM,cAAc,KAAK,eAAe,KAAK,eAAe,SAAS,CAAC;AACtE,YAAI,eAAe,gBAAgB,KAAK,YAAY;AAClD,gBAAM,WAAW,KAAK,WAAW;AAAA,YAC/B,MAAM;AAAA,YACN,IAAI,KAAK;AAAA,YACT,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,OAAO,KAAK;AAAA,YACZ;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAGA,UAAI,YAAY,KAAK,mBAAmB;AACtC,cAAM,SAAS,mBAAmB,KAAK,OAAO;AAC9C,YAAI,QAAQ;AACV,gBAAM,WAAW,KAAK,WAAW;AAAA,YAC/B,MAAM,KAAK;AAAA,YACX,IAAI,KAAK;AAAA,YACT,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,OAAO;AAAA,YACP;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF,SAAS,KAAK;AAEZ,YAAM,EAAE,IAAI,IAAI,MAAM,OAAO,aAAa;AAC1C,UAAI,KAAK,kCAAkC,GAAG,EAAE;AAAA,IAClD,UAAE;AAGA,WAAK,YAAY;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwBA,MAAM,oBACJ,OACA,UACA,MA0BA;AACA,QAAI,CAAC,KAAK,IAAI,wBAAyB,QAAO,CAAC;AAC/C,UAAM,QAAQ,YAAY,KAAK,IAAI;AACnC,UAAM,QAAQ,KAAK,IAAI;AAMvB,UAAM,QACJ,MAAM,yBAAyB,OAAO,IAAI,qBAAqB,KAAK,IAAI,6BAA6B;AACvG,UAAM,aAAa,wBAAwB,KAAK,IAAI,gCAAgC;AACpF,UAAM,eAAe,MAAM;AAC3B,UAAM,kBAAkB,MACtB,OAAO,iBAAiB,YAAY,KAAK,IAAI,KAAK;AAEpD,QAAI;AACF,UAAI,gBAAgB,EAAG,QAAO,CAAC;AAC/B,YAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,UAAI,gBAAgB,EAAG,QAAO,CAAC;AAK/B,YAAM,MAAM,oBAAI,IAAyB;AACzC,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,GAAG;AAC3C,aAAK,IAAI,UAAU,KAAK,gBAAgB,EAAG,QAAO,CAAC;AACnD,cAAM,OAAO,SAAS,CAAC;AACvB,cAAM,OAAO,mBAAmB,IAAI;AACpC,YAAI,OAAO,MAAO;AAClB,YAAI,CAAC,IAAI,IAAI,KAAK,IAAI,EAAG,KAAI,IAAI,KAAK,MAAM,CAAC,CAAC;AAC9C,YAAI,IAAI,KAAK,IAAI,EAAG,KAAK,IAAI;AAE7B,YAAI,KAAK,SAAS,UAAU;AAC1B,cAAI,CAAC,IAAI,IAAI,KAAK,EAAE,EAAG,KAAI,IAAI,KAAK,IAAI,CAAC,CAAC;AAC1C,cAAI,IAAI,KAAK,EAAE,EAAG,KAAK,EAAE,GAAG,MAAM,MAAM,KAAK,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,QAClE;AAAA,MACF;AAEA,YAAM,UAAU,IAAI,IAAI,KAAK;AAC7B,YAAM,SAAS,oBAAI,IAAoB;AACvC,YAAM,aAAa,oBAAI,IASrB;AACF,UAAI,WAAW,oBAAI,IAAgE;AACnF,YAAM,gBAAgB,oBAAI,IAAyB;AACnD,iBAAW,QAAQ,OAAO;AACxB,iBAAS,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI,EAAE,MAAM,MAAM,MAAM,YAAY,EAAE,CAAC;AACpE,sBAAc,IAAI,MAAM,oBAAI,IAAI,CAAC,IAAI,CAAC,CAAC;AAAA,MACzC;AACA,YAAM,iBAAiB,MACrB,MAAM,KAAK,OAAO,QAAQ,CAAC,EACxB,IAAI,CAAC,CAAC,GAAG,KAAK,OAAO;AAAA,QACpB,MAAM;AAAA,QACN;AAAA,QACA,MAAM,WAAW,IAAI,CAAC,GAAG,QAAQ;AAAA,QACjC,UAAU,WAAW,IAAI,CAAC,GAAG,YAAY;AAAA,QACzC,eAAe,WAAW,IAAI,CAAC,GAAG,iBAAiB;AAAA,QACnD,WAAW,WAAW,IAAI,CAAC,GAAG,aAAa;AAAA,QAC3C,gBAAgB,WAAW,IAAI,CAAC,GAAG,kBAAkB;AAAA,MACvD,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAErC,eAAS,MAAM,GAAG,MAAM,SAAS,SAAS,OAAO,GAAG,OAAO;AACzD,YAAI,gBAAgB,EAAG,QAAO,eAAe;AAC7C,cAAM,eAAe,oBAAI,IAAgE;AAEzF,mBAAW,EAAE,MAAM,MAAM,YAAY,WAAW,KAAK,SAAS,OAAO,GAAG;AACtE,gBAAM,QAAQ,IAAI,IAAI,IAAI,KAAK,CAAC;AAChC,mBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACxC,iBAAK,IAAI,UAAU,KAAK,gBAAgB,EAAG,QAAO,eAAe;AACjE,kBAAM,OAAO,MAAM,CAAC;AACpB,kBAAM,WAAW,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK;AACrD,kBAAM,OAAO,mBAAmB,IAAI;AAIpC,gBAAI,OAAO,MAAO;AAClB,kBAAM,QAAQ,aAAa,KAAK,SAAS,OAAO;AAChD,kBAAM,iBAAiB,cAAc,IAAI,UAAU;AACnD,gBAAI,gBAAgB,IAAI,QAAQ,GAAG;AACjC;AAAA,YACF;AAEA,gBAAI,CAAC,QAAQ,IAAI,QAAQ,GAAG;AAC1B,oBAAM,WAAW,OAAO,IAAI,QAAQ,KAAK;AACzC,qBAAO,IAAI,UAAU,WAAW,KAAK;AAErC,oBAAM,OAAO,WAAW,IAAI,QAAQ;AACpC,kBAAI,CAAC,QAAQ,MAAM,IAAI,KAAK,YAAa,MAAM,MAAM,KAAK,YAAY,QAAQ,KAAK,eAAgB;AACjG,2BAAW,IAAI,UAAU;AAAA,kBACvB,MAAM;AAAA,kBACN,UAAU,MAAM;AAAA,kBAChB,eAAe;AAAA,kBACf,WAAW,KAAK;AAAA,kBAChB,gBAAgB;AAAA,gBAClB,CAAC;AAAA,cACH;AAEA,kBAAI,MAAM,IAAI,OAAO;AACnB,sBAAM,cAAc,GAAG,UAAU,KAAK,QAAQ;AAC9C,sBAAM,mBAAmB,aAAa,IAAI,WAAW;AACrD,oBAAI,kBAAkB;AACpB,mCAAiB,cAAc;AAAA,gBACjC,OAAO;AACL,+BAAa,IAAI,aAAa;AAAA,oBAC5B,MAAM;AAAA,oBACN,MAAM;AAAA,oBACN,YAAY;AAAA,kBACd,CAAC;AAAA,gBACH;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAEA,mBAAW,EAAE,MAAM,KAAK,KAAK,aAAa,OAAO,GAAG;AAClD,wBAAc,IAAI,IAAI,GAAG,IAAI,IAAI;AAAA,QACnC;AACA,mBAAW;AAAA,MACb;AAOA,UAAI,CAAC,gBAAgB,KAAK,aAAa,KAAK,OAAO,OAAO,GAAG;AAC3D,gCAAwB,QAAQ,KAAK;AAAA,UACnC;AAAA,UACA;AAAA,UACA,SAAS;AAAA,UACT;AAAA,QACF,CAAC;AAAA,MACH;AAGA,UAAI,gBAAgB,EAAG,QAAO,eAAe;AAC7C,UAAI,KAAK,IAAI,iCAAiC,OAAO,OAAO,GAAG;AAC7D,cAAM,YAAY,uBAAuB,QAAQ;AAAA,UAC/C,MAAM,KAAK,IAAI;AAAA,UACf,MAAM,KAAK,IAAI;AAAA,QACjB,CAAC;AACD,mBAAW,CAAC,GAAG,CAAC,KAAK,WAAW;AAC9B,iBAAO,IAAI,GAAG,CAAC;AAAA,QACjB;AAAA,MACF;AAEA,aAAO,eAAe;AAAA,IACxB,SAAS,KAAK;AACZ,YAAM,EAAE,IAAI,IAAI,MAAM,OAAO,aAAa;AAC1C,UAAI,KAAK,sCAAsC,GAAG,EAAE;AACpD,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACF;AAUO,SAAS,qBAAqB,KAAsB;AACzD,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,GAAG,GAAG;AACpD,WAAO;AAAA,EACT;AACA,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM,EAAG,QAAO;AACpB,SAAO;AACT;AAOO,SAAS,wBAAwB,KAAsB;AAC5D,MAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,GAAG,EAAG,QAAO;AAC7D,MAAI,OAAO,EAAG,QAAO;AACrB,SAAO,KAAK,MAAM,GAAG;AACvB;AAaO,SAAS,wBACd,QACA,KACA,MACM;AACN,QAAM,EAAE,YAAY,OAAO,SAAS,aAAa,IAAI;AACrD,MAAI,cAAc,KAAK,OAAO,SAAS,EAAG;AAC1C,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,OAAO,CAAC;AACpD,QAAM,kBAAkB,MACtB,OAAO,iBAAiB,YAAY,KAAK,IAAI,KAAK;AAYpD,QAAM,WAAW,CAAC,MAAiB,aAA8B;AAC/D,QAAI,mBAAmB,IAAI,IAAI,MAAO,QAAO;AAC7C,UAAM,WAAW,KAAK,OAAO,WAAW,KAAK,OAAO,KAAK;AACzD,WAAO,OAAO,IAAI,QAAQ;AAAA,EAC5B;AACA,QAAM,gBAAgB,oBAAI,IAAoB;AAC9C,aAAW,CAAC,MAAM,KAAK,KAAK,IAAI,QAAQ,GAAG;AACzC,QAAI,gBAAgB,EAAG;AACvB,QAAI,CAAC,OAAO,IAAI,IAAI,EAAG;AACvB,QAAI,MAAM;AACV,eAAW,QAAQ,OAAO;AACxB,UAAI,CAAC,SAAS,MAAM,IAAI,EAAG;AAC3B,aAAO,mBAAmB,IAAI,IAAI,KAAK;AAAA,IACzC;AACA,QAAI,MAAM,EAAG,eAAc,IAAI,MAAM,GAAG;AAAA,EAC1C;AAEA,WAAS,IAAI,GAAG,IAAI,YAAY,KAAK,GAAG;AACtC,QAAI,gBAAgB,EAAG;AACvB,UAAM,OAAO,oBAAI,IAAoB;AAGrC,eAAW,CAAC,MAAM,KAAK,KAAK,QAAQ;AAClC,WAAK,IAAI,OAAO,IAAI,eAAe,KAAK;AAAA,IAC1C;AACA,eAAW,CAAC,MAAM,KAAK,KAAK,QAAQ;AAClC,YAAM,WAAW,IAAI,IAAI,IAAI;AAC7B,YAAM,QAAQ,cAAc,IAAI,IAAI;AAMpC,UAAI,CAAC,YAAY,SAAS,WAAW,KAAK,CAAC,SAAS,SAAS,GAAG;AAC9D,aAAK,IAAI,OAAO,KAAK,IAAI,IAAI,KAAK,KAAK,cAAc,KAAK;AAC1D;AAAA,MACF;AACA,eAAS,YAAY,GAAG,YAAY,SAAS,QAAQ,aAAa,GAAG;AACnE,aAAK,YAAY,UAAU,KAAK,gBAAgB,EAAG;AACnD,cAAM,OAAO,SAAS,SAAS;AAC/B,YAAI,CAAC,SAAS,MAAM,IAAI,EAAG;AAC3B,cAAM,OAAO,mBAAmB,IAAI;AACpC,cAAM,WAAW,KAAK,OAAO,OAAO,KAAK,OAAO,KAAK;AACrD,cAAM,OAAO,cAAc,SAAU,OAAO,KAAK,SAAU;AAC3D,aAAK,IAAI,WAAW,KAAK,IAAI,QAAQ,KAAK,KAAK,IAAI;AAAA,MACrD;AAAA,IACF;AACA,eAAW,CAAC,MAAM,KAAK,KAAK,MAAM;AAChC,aAAO,IAAI,MAAM,KAAK;AAAA,IACxB;AAAA,EACF;AACF;AAgBO,SAAS,uBACd,QACA,MACqB;AACrB,QAAM,EAAE,MAAM,KAAK,IAAI;AACvB,MAAI,SAAS,KAAK,SAAS,EAAG,QAAO,IAAI,IAAI,MAAM;AAEnD,QAAM,SAAS,MAAM,KAAK,OAAO,QAAQ,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACtE,QAAM,iBAAiB,OAAO,MAAM,GAAG,IAAI;AAE3C,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,CAAC,MAAM,CAAC,KAAK,QAAQ;AAC9B,QAAI,aAAa;AACjB,eAAW,CAAC,EAAE,EAAE,KAAK,gBAAgB;AACnC,UAAI,KAAK,GAAG;AACV,sBAAc,KAAK;AAAA,MACrB;AAAA,IACF;AACA,WAAO,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,OAAO,UAAU,CAAC;AAAA,EACrD;AAEA,SAAO;AACT;","names":[]}

package/dist/chunk-ODPLEWB6.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/cross-namespace-budget.ts"],"sourcesContent":["/**\n * Per-principal cross-namespace query-budget limiter (issue #565 PR 4/5).\n *\n * Detects and throttles bursts of recall-type operations that a principal\n * issues against namespaces *other than their own*. Thresholds come from the\n * memory-extraction threat model (`docs/security/memory-extraction-threat-model.md`\n * §6.2) and the ADAM baseline report (`docs/security/adam-baseline-2026-04.md`):\n * a T2-class same-namespace attacker plateaus at 61 queries in the published\n * baseline, so the default window is set well below that to force any\n * adaptive loop to noticeably slow down.\n *\n * Shape:\n * - Pure, in-process, per-principal sliding window. No persistence.\n * - Only cross-namespace reads count: a principal hitting only their own\n *   namespace is never throttled.\n * - The limiter is behind the `recallCrossNamespaceBudgetEnabled` feature\n *   flag (defaults to `false`) and is a no-op when disabled. This mirrors\n *   the canonical \"new filter/transform needs an enabled check\" pattern\n *   (see CLAUDE.md gotcha #30).\n *\n * The module has no side effects beyond incrementing its own counters, and\n * it does NOT take a clock dependency — callers pass the current epoch ms\n * (or let the default `Date.now()` do it) so tests can step time\n * deterministically.\n */\n\nexport interface CrossNamespaceBudgetConfig {\n  /** Feature flag. Defaults to false — a disabled limiter is always allow. */\n  enabled?: boolean;\n  /**\n   * Rolling window size in milliseconds. Counts decay out of the window\n   * as the clock advances. Default: 60_000 (1 minute).\n   */\n  windowMs?: number;\n  /**\n   * Soft cap. Once a principal has `softLimit` cross-namespace reads in the\n   * window, the limiter *records* a warning on the decision but still\n   * allows the call. Used by PR 5's anomaly detector to surface flags\n   * without blocking. Default: 10.\n   */\n  softLimit?: number;\n  /**\n   * Hard cap. Once `hardLimit` is reached, the limiter denies the call.\n   * Default: 30 — picked to be well below the T2 baseline of ~60 queries\n   * at half-plateau, so an ADAM-style adaptive loop is throttled before it\n   * meaningfully leaks.\n   */\n  hardLimit?: number;\n}\n\nexport const DEFAULT_CROSS_NAMESPACE_BUDGET: Required<CrossNamespaceBudgetConfig> =\n  Object.freeze({\n    enabled: false,\n    windowMs: 60_000,\n    softLimit: 10,\n    hardLimit: 30,\n  });\n\n/**\n * Why a call was denied / warned. Stable strings so callers can key log\n * lines and metrics on them.\n */\nexport type BudgetDecisionReason =\n  | \"allowed-same-namespace\"\n  | \"allowed-no-limit\"\n  | \"allowed-under-soft\"\n  | \"warn-over-soft\"\n  | \"deny-over-hard\";\n\nexport interface BudgetDecision {\n  allowed: boolean;\n  reason: BudgetDecisionReason;\n  /** Cross-namespace reads by this principal currently in the window. */\n  count: number;\n  /** Active config snapshot at decision time. */\n  limit: {\n    softLimit: number;\n    hardLimit: number;\n    windowMs: number;\n  };\n}\n\ninterface PrincipalBucket {\n  /** Epoch-ms timestamps of cross-namespace reads in the active window. */\n  timestamps: number[];\n}\n\n/**\n * Normalize the provided config against the defaults and reject clearly\n * invalid shapes (non-positive windows, inverted limits). Never throws —\n * returns a safe effective config the limiter can use.\n */\nfunction effectiveConfig(\n  raw: CrossNamespaceBudgetConfig | undefined,\n): Required<CrossNamespaceBudgetConfig> {\n  const base = { ...DEFAULT_CROSS_NAMESPACE_BUDGET };\n  if (!raw) return base;\n  const out = { ...base };\n  if (typeof raw.enabled === \"boolean\") out.enabled = raw.enabled;\n  if (\n    typeof raw.windowMs === \"number\" &&\n    Number.isFinite(raw.windowMs) &&\n    raw.windowMs > 0\n  ) {\n    out.windowMs = raw.windowMs;\n  }\n  if (\n    typeof raw.softLimit === \"number\" &&\n    Number.isFinite(raw.softLimit) &&\n    raw.softLimit >= 0\n  ) {\n    out.softLimit = Math.floor(raw.softLimit);\n  }\n  if (\n    typeof raw.hardLimit === \"number\" &&\n    Number.isFinite(raw.hardLimit) &&\n    raw.hardLimit >= 1\n  ) {\n    // Floor the value, then defensively require the floored result is\n    // still >= 1. `raw.hardLimit = 0.5` previously passed the `> 0`\n    // gate and floored to 0, turning a minor misconfiguration into a\n    // full denial of cross-namespace reads. Now we fall back to the\n    // default instead.\n    const floored = Math.floor(raw.hardLimit);\n    if (floored >= 1) out.hardLimit = floored;\n  }\n  if (out.softLimit > out.hardLimit) {\n    // Inverted limits -> treat soft = hard so we never warn past the deny\n    // threshold. Defensive, should never happen with well-formed config.\n    out.softLimit = out.hardLimit;\n  }\n  return out;\n}\n\nfunction normalizeClock(now: number | undefined): number {\n  if (now === undefined) return Date.now();\n  if (Number.isFinite(now)) return Math.floor(now);\n  return 0;\n}\n\n/**\n * In-process cross-namespace budget limiter. Instantiate once per\n * orchestrator / access-service.\n *\n * Threadsafe-by-construction: Node.js is single-threaded per process for\n * application code, and the limiter never awaits between read-modify-write\n * operations on its internal state.\n */\nexport class CrossNamespaceBudget {\n  private readonly config: Required<CrossNamespaceBudgetConfig>;\n  private readonly buckets = new Map<string, PrincipalBucket>();\n\n  constructor(config?: CrossNamespaceBudgetConfig) {\n    this.config = effectiveConfig(config);\n  }\n\n  /** Exposed for tests / audit surfaces. Never mutate the returned value. */\n  getConfig(): Required<CrossNamespaceBudgetConfig> {\n    return this.config;\n  }\n\n  /**\n   * Check whether `principal` is allowed to issue another cross-namespace\n   * read. Call site is expected to compare `principalNamespace` against\n   * `queryNamespace` and only pass through reads where they differ — the\n   * limiter treats every call as a cross-namespace event.\n   *\n   * @param principal Stable identifier for the calling principal (token\n   *   subject, session principal, etc.). Must be non-empty.\n   * @param now Epoch-ms clock read. Defaults to `Date.now()`; tests pass a\n   *   fixed value to step time deterministically.\n   */\n  record(principal: string, now?: number): BudgetDecision {\n    const normalizedNow = normalizeClock(now);\n    const { enabled, windowMs, softLimit, hardLimit } = this.config;\n    const limit = { softLimit, hardLimit, windowMs };\n\n    if (!enabled) {\n      return {\n        allowed: true,\n        reason: \"allowed-no-limit\",\n        count: 0,\n        limit,\n      };\n    }\n\n    if (typeof principal !== \"string\" || principal.length === 0) {\n      // A missing principal means \"we can't attribute this call\". Rather\n      // than fail open, treat it as a cross-namespace event against a\n      // shared bucket — denial-of-service risk is bounded because the\n      // bucket is scoped per-process.\n      principal = \"__anonymous__\";\n    }\n\n    const bucket = this.buckets.get(principal) ?? { timestamps: [] };\n    const cutoff = normalizedNow - windowMs;\n    // Drop timestamps that slid out of the window.\n    while (bucket.timestamps.length > 0 && bucket.timestamps[0]! < cutoff) {\n      bucket.timestamps.shift();\n    }\n\n    // Count the current call against the window BEFORE deciding — a call\n    // that crosses the deny threshold should itself be denied, not the\n    // next one. This is what the threat model calls \"fail at the Nth,\n    // not the (N+1)th\".\n    bucket.timestamps.push(normalizedNow);\n    this.buckets.set(principal, bucket);\n    const count = bucket.timestamps.length;\n\n    if (count >= hardLimit) {\n      // Denied: roll back the timestamp we just added so a repeated denied\n      // call does not push the bucket further into the future. This keeps\n      // the limiter stateless with respect to denied attempts.\n      bucket.timestamps.pop();\n      // Evict empty buckets (e.g. the first record after a long idle\n      // rolled the only timestamp out, then got denied and rolled back).\n      // Prevents unbounded map growth across many transient principals.\n      if (bucket.timestamps.length === 0) {\n        this.buckets.delete(principal);\n      }\n      return {\n        allowed: false,\n        reason: \"deny-over-hard\",\n        count: bucket.timestamps.length,\n        limit,\n      };\n    }\n\n    if (count > softLimit) {\n      return {\n        allowed: true,\n        reason: \"warn-over-soft\",\n        count,\n        limit,\n      };\n    }\n\n    return {\n      allowed: true,\n      reason: \"allowed-under-soft\",\n      count,\n      limit,\n    };\n  }\n\n  /**\n   * Read-only peek at whether a call would be allowed, WITHOUT recording a\n   * timestamp. Useful when the caller must inspect multiple namespaces before\n   * deciding to record a single event. The returned `count` reflects the\n   * current window state at call time.\n   */\n  peek(args: {\n    principal: string;\n    principalNamespace: string;\n    queryNamespace: string;\n    now?: number;\n  }): BudgetDecision {\n    const pn = args.principalNamespace;\n    const qn = args.queryNamespace;\n    const bothPresent =\n      typeof pn === \"string\" && pn.length > 0 &&\n      typeof qn === \"string\" && qn.length > 0;\n    if (bothPresent && pn === qn) {\n      return {\n        allowed: true,\n        reason: \"allowed-same-namespace\",\n        count: 0,\n        limit: {\n          softLimit: this.config.softLimit,\n          hardLimit: this.config.hardLimit,\n          windowMs: this.config.windowMs,\n        },\n      };\n    }\n    // Cross-namespace: simulate what record() would do without the push.\n    const { enabled, windowMs, softLimit, hardLimit } = this.config;\n    const limit = { softLimit, hardLimit, windowMs };\n    if (!enabled) {\n      return { allowed: true, reason: \"allowed-no-limit\", count: 0, limit };\n    }\n    let principal = args.principal;\n    if (typeof principal !== \"string\" || principal.length === 0) {\n      principal = \"__anonymous__\";\n    }\n    const now = normalizeClock(args.now);\n    const bucket = this.buckets.get(principal) ?? { timestamps: [] };\n    const cutoff = now - windowMs;\n    let liveCount = 0;\n    for (const ts of bucket.timestamps) {\n      if (ts >= cutoff) liveCount++;\n    }\n    const projected = liveCount + 1; // +1 for the current call\n    if (projected >= hardLimit) {\n      return { allowed: false, reason: \"deny-over-hard\", count: liveCount, limit };\n    }\n    if (projected > softLimit) {\n      return { allowed: true, reason: \"warn-over-soft\", count: projected, limit };\n    }\n    return { allowed: true, reason: \"allowed-under-soft\", count: projected, limit };\n  }\n\n  /**\n   * Convenience guard that also skips the limiter when `principalNamespace`\n   * equals `queryNamespace` (same-namespace is never cross-namespace).\n   * Returns an `allowed-same-namespace` decision in that case.\n   */\n  check(args: {\n    principal: string;\n    principalNamespace: string;\n    queryNamespace: string;\n    now?: number;\n  }): BudgetDecision {\n    // Same-namespace short-circuit requires BOTH namespaces to be\n    // non-empty strings. Two empty/undefined namespaces at runtime\n    // would otherwise compare equal and fail-open — a critical bypass\n    // in a security-critical module. Force the limiter to engage when\n    // either side is missing so we never silently skip enforcement.\n    const pn = args.principalNamespace;\n    const qn = args.queryNamespace;\n    const bothPresent =\n      typeof pn === \"string\" && pn.length > 0 &&\n      typeof qn === \"string\" && qn.length > 0;\n    if (bothPresent && pn === qn) {\n      return {\n        allowed: true,\n        reason: \"allowed-same-namespace\",\n        count: 0,\n        limit: {\n          softLimit: this.config.softLimit,\n          hardLimit: this.config.hardLimit,\n          windowMs: this.config.windowMs,\n        },\n      };\n    }\n    return this.record(args.principal, args.now);\n  }\n\n  /**\n   * Clear all state. Intended for tests and for the orchestrator's\n   * lifecycle `before_reset` hook.\n   */\n  reset(): void {\n    this.buckets.clear();\n  }\n\n  /**\n   * Evict buckets whose entire timestamp list has slid out of the\n   * active window by `now`. Intended to be called periodically by a\n   * long-lived host process (e.g. from a maintenance cron) that sees\n   * many transient principals. Safe to call at any time; returns the\n   * number of buckets evicted.\n   */\n  gc(now?: number): number {\n    const normalizedNow = normalizeClock(now);\n    const cutoff = normalizedNow - this.config.windowMs;\n    let evicted = 0;\n    for (const [principal, bucket] of this.buckets.entries()) {\n      while (bucket.timestamps.length > 0 && bucket.timestamps[0]! < cutoff) {\n        bucket.timestamps.shift();\n      }\n      if (bucket.timestamps.length === 0) {\n        this.buckets.delete(principal);\n        evicted++;\n      }\n    }\n    return evicted;\n  }\n\n  /** For tests: current number of live buckets. */\n  bucketCount(): number {\n    return this.buckets.size;\n  }\n}\n"],"mappings":";AAkDO,IAAM,iCACX,OAAO,OAAO;AAAA,EACZ,SAAS;AAAA,EACT,UAAU;AAAA,EACV,WAAW;AAAA,EACX,WAAW;AACb,CAAC;AAoCH,SAAS,gBACP,KACsC;AACtC,QAAM,OAAO,EAAE,GAAG,+BAA+B;AACjD,MAAI,CAAC,IAAK,QAAO;AACjB,QAAM,MAAM,EAAE,GAAG,KAAK;AACtB,MAAI,OAAO,IAAI,YAAY,UAAW,KAAI,UAAU,IAAI;AACxD,MACE,OAAO,IAAI,aAAa,YACxB,OAAO,SAAS,IAAI,QAAQ,KAC5B,IAAI,WAAW,GACf;AACA,QAAI,WAAW,IAAI;AAAA,EACrB;AACA,MACE,OAAO,IAAI,cAAc,YACzB,OAAO,SAAS,IAAI,SAAS,KAC7B,IAAI,aAAa,GACjB;AACA,QAAI,YAAY,KAAK,MAAM,IAAI,SAAS;AAAA,EAC1C;AACA,MACE,OAAO,IAAI,cAAc,YACzB,OAAO,SAAS,IAAI,SAAS,KAC7B,IAAI,aAAa,GACjB;AAMA,UAAM,UAAU,KAAK,MAAM,IAAI,SAAS;AACxC,QAAI,WAAW,EAAG,KAAI,YAAY;AAAA,EACpC;AACA,MAAI,IAAI,YAAY,IAAI,WAAW;AAGjC,QAAI,YAAY,IAAI;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAiC;AACvD,MAAI,QAAQ,OAAW,QAAO,KAAK,IAAI;AACvC,MAAI,OAAO,SAAS,GAAG,EAAG,QAAO,KAAK,MAAM,GAAG;AAC/C,SAAO;AACT;AAUO,IAAM,uBAAN,MAA2B;AAAA,EACf;AAAA,EACA,UAAU,oBAAI,IAA6B;AAAA,EAE5D,YAAY,QAAqC;AAC/C,SAAK,SAAS,gBAAgB,MAAM;AAAA,EACtC;AAAA;AAAA,EAGA,YAAkD;AAChD,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,OAAO,WAAmB,KAA8B;AACtD,UAAM,gBAAgB,eAAe,GAAG;AACxC,UAAM,EAAE,SAAS,UAAU,WAAW,UAAU,IAAI,KAAK;AACzD,UAAM,QAAQ,EAAE,WAAW,WAAW,SAAS;AAE/C,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,OAAO;AAAA,QACP;AAAA,MACF;AAAA,IACF;AAEA,QAAI,OAAO,cAAc,YAAY,UAAU,WAAW,GAAG;AAK3D,kBAAY;AAAA,IACd;AAEA,UAAM,SAAS,KAAK,QAAQ,IAAI,SAAS,KAAK,EAAE,YAAY,CAAC,EAAE;AAC/D,UAAM,SAAS,gBAAgB;AAE/B,WAAO,OAAO,WAAW,SAAS,KAAK,OAAO,WAAW,CAAC,IAAK,QAAQ;AACrE,aAAO,WAAW,MAAM;AAAA,IAC1B;AAMA,WAAO,WAAW,KAAK,aAAa;AACpC,SAAK,QAAQ,IAAI,WAAW,MAAM;AAClC,UAAM,QAAQ,OAAO,WAAW;AAEhC,QAAI,SAAS,WAAW;AAItB,aAAO,WAAW,IAAI;AAItB,UAAI,OAAO,WAAW,WAAW,GAAG;AAClC,aAAK,QAAQ,OAAO,SAAS;AAAA,MAC/B;AACA,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,OAAO,OAAO,WAAW;AAAA,QACzB;AAAA,MACF;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW;AACrB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAK,MAKc;AACjB,UAAM,KAAK,KAAK;AAChB,UAAM,KAAK,KAAK;AAChB,UAAM,cACJ,OAAO,OAAO,YAAY,GAAG,SAAS,KACtC,OAAO,OAAO,YAAY,GAAG,SAAS;AACxC,QAAI,eAAe,OAAO,IAAI;AAC5B,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,OAAO;AAAA,UACL,WAAW,KAAK,OAAO;AAAA,UACvB,WAAW,KAAK,OAAO;AAAA,UACvB,UAAU,KAAK,OAAO;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AAEA,UAAM,EAAE,SAAS,UAAU,WAAW,UAAU,IAAI,KAAK;AACzD,UAAM,QAAQ,EAAE,WAAW,WAAW,SAAS;AAC/C,QAAI,CAAC,SAAS;AACZ,aAAO,EAAE,SAAS,MAAM,QAAQ,oBAAoB,OAAO,GAAG,MAAM;AAAA,IACtE;AACA,QAAI,YAAY,KAAK;AACrB,QAAI,OAAO,cAAc,YAAY,UAAU,WAAW,GAAG;AAC3D,kBAAY;AAAA,IACd;AACA,UAAM,MAAM,eAAe,KAAK,GAAG;AACnC,UAAM,SAAS,KAAK,QAAQ,IAAI,SAAS,KAAK,EAAE,YAAY,CAAC,EAAE;AAC/D,UAAM,SAAS,MAAM;AACrB,QAAI,YAAY;AAChB,eAAW,MAAM,OAAO,YAAY;AAClC,UAAI,MAAM,OAAQ;AAAA,IACpB;AACA,UAAM,YAAY,YAAY;AAC9B,QAAI,aAAa,WAAW;AAC1B,aAAO,EAAE,SAAS,OAAO,QAAQ,kBAAkB,OAAO,WAAW,MAAM;AAAA,IAC7E;AACA,QAAI,YAAY,WAAW;AACzB,aAAO,EAAE,SAAS,MAAM,QAAQ,kBAAkB,OAAO,WAAW,MAAM;AAAA,IAC5E;AACA,WAAO,EAAE,SAAS,MAAM,QAAQ,sBAAsB,OAAO,WAAW,MAAM;AAAA,EAChF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,MAKa;AAMjB,UAAM,KAAK,KAAK;AAChB,UAAM,KAAK,KAAK;AAChB,UAAM,cACJ,OAAO,OAAO,YAAY,GAAG,SAAS,KACtC,OAAO,OAAO,YAAY,GAAG,SAAS;AACxC,QAAI,eAAe,OAAO,IAAI;AAC5B,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,OAAO;AAAA,QACP,OAAO;AAAA,UACL,WAAW,KAAK,OAAO;AAAA,UACvB,WAAW,KAAK,OAAO;AAAA,UACvB,UAAU,KAAK,OAAO;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AACA,WAAO,KAAK,OAAO,KAAK,WAAW,KAAK,GAAG;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAc;AACZ,SAAK,QAAQ,MAAM;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,GAAG,KAAsB;AACvB,UAAM,gBAAgB,eAAe,GAAG;AACxC,UAAM,SAAS,gBAAgB,KAAK,OAAO;AAC3C,QAAI,UAAU;AACd,eAAW,CAAC,WAAW,MAAM,KAAK,KAAK,QAAQ,QAAQ,GAAG;AACxD,aAAO,OAAO,WAAW,SAAS,KAAK,OAAO,WAAW,CAAC,IAAK,QAAQ;AACrE,eAAO,WAAW,MAAM;AAAA,MAC1B;AACA,UAAI,OAAO,WAAW,WAAW,GAAG;AAClC,aAAK,QAAQ,OAAO,SAAS;AAC7B;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,cAAsB;AACpB,WAAO,KAAK,QAAQ;AAAA,EACtB;AACF;","names":[]}

package/dist/chunk-PHK3HARR.js

@@ -1,32 +0,0 @@
-// src/connectors/coerce.ts
-function coerceBool(value) {
-  if (typeof value === "boolean") return value;
-  if (typeof value === "string") {
-    const v = value.trim().toLowerCase();
-    if (["false", "0", "no", "off"].includes(v)) return false;
-    if (["true", "1", "yes", "on"].includes(v)) return true;
-  }
-  return void 0;
-}
-function coerceInstallExtension(value) {
-  return coerceBool(value);
-}
-function coerceNumber(value) {
-  if (typeof value === "number") {
-    return Number.isFinite(value) ? value : void 0;
-  }
-  if (typeof value === "string") {
-    const trimmed = value.trim();
-    if (trimmed.length === 0) return void 0;
-    const n = Number(trimmed);
-    return Number.isFinite(n) ? n : void 0;
-  }
-  return void 0;
-}
-
-export {
-  coerceBool,
-  coerceInstallExtension,
-  coerceNumber
-};
-//# sourceMappingURL=chunk-PHK3HARR.js.map

package/dist/chunk-PHK3HARR.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/connectors/coerce.ts"],"sourcesContent":["/**\n * Shared boolean coercion helpers.\n *\n * Extracted from connectors/index.ts so that both config.ts and\n * connectors/index.ts can import them without creating a circular dependency.\n */\n\n/**\n * Generic boolean coercion: converts string representations of booleans\n * (e.g. from CLI `--config someFlag=false`) to proper boolean values.\n * Accepts the same truthy/falsy strings that common shells and env vars use.\n *\n * Returns `undefined` when the value is neither a boolean nor a recognised\n * string, so callers can fall back to a default.\n *\n * CLAUDE.md gotcha #36: String \"false\" is truthy in JavaScript.\n * CLAUDE.md gotcha #28: Coerce CLI values to expected types at input boundaries.\n */\nexport function coerceBool(value: unknown): boolean | undefined {\n  if (typeof value === \"boolean\") return value;\n  if (typeof value === \"string\") {\n    const v = value.trim().toLowerCase();\n    if ([\"false\", \"0\", \"no\", \"off\"].includes(v)) return false;\n    if ([\"true\", \"1\", \"yes\", \"on\"].includes(v)) return true;\n  }\n  return undefined;\n}\n\n/**\n * Coerce the `installExtension` config value from a string (e.g. from CLI\n * `--config installExtension=false`) to a proper boolean.\n *\n * Delegates to the generic `coerceBool` helper. Kept for backward compatibility.\n */\nexport function coerceInstallExtension(value: unknown): boolean | undefined {\n  return coerceBool(value);\n}\n\n/**\n * Generic numeric coercion: accepts a finite number or a string that\n * parses cleanly to one. Returns `undefined` otherwise so callers can\n * fall back to a default.\n *\n * Rules:\n * - number: returned as-is only if finite (NaN / ±Infinity → undefined).\n * - string: trimmed, parsed with `Number()`. Returns `undefined` on\n *   empty, NaN, or Infinity.\n *\n * CLAUDE.md gotcha #28: Coerce CLI values to expected types at input boundaries.\n */\nexport function coerceNumber(value: unknown): number | undefined {\n  if (typeof value === \"number\") {\n    return Number.isFinite(value) ? value : undefined;\n  }\n  if (typeof value === \"string\") {\n    const trimmed = value.trim();\n    if (trimmed.length === 0) return undefined;\n    const n = Number(trimmed);\n    return Number.isFinite(n) ? n : undefined;\n  }\n  return undefined;\n}\n"],"mappings":";AAkBO,SAAS,WAAW,OAAqC;AAC9D,MAAI,OAAO,UAAU,UAAW,QAAO;AACvC,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI,MAAM,KAAK,EAAE,YAAY;AACnC,QAAI,CAAC,SAAS,KAAK,MAAM,KAAK,EAAE,SAAS,CAAC,EAAG,QAAO;AACpD,QAAI,CAAC,QAAQ,KAAK,OAAO,IAAI,EAAE,SAAS,CAAC,EAAG,QAAO;AAAA,EACrD;AACA,SAAO;AACT;AAQO,SAAS,uBAAuB,OAAqC;AAC1E,SAAO,WAAW,KAAK;AACzB;AAcO,SAAS,aAAa,OAAoC;AAC/D,MAAI,OAAO,UAAU,UAAU;AAC7B,WAAO,OAAO,SAAS,KAAK,IAAI,QAAQ;AAAA,EAC1C;AACA,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,UAAU,MAAM,KAAK;AAC3B,QAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,UAAM,IAAI,OAAO,OAAO;AACxB,WAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAAA,EAClC;AACA,SAAO;AACT;","names":[]}

package/dist/chunk-RANHFI3P.js

@@ -1,8 +0,0 @@
-// src/access-errors.ts
-var EngramAccessForbiddenError = class extends Error {
-};
-
-export {
-  EngramAccessForbiddenError
-};
-//# sourceMappingURL=chunk-RANHFI3P.js.map

package/dist/chunk-RANHFI3P.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/access-errors.ts"],"sourcesContent":["/** Authenticated caller lacks the required authorization (HTTP 403). */\nexport class EngramAccessForbiddenError extends Error {}\n"],"mappings":";AACO,IAAM,6BAAN,cAAyC,MAAM;AAAC;","names":[]}

package/dist/chunk-RBQLJSJ7.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/namespaces/storage.ts"],"sourcesContent":["import { resolveNamespaceCapabilities } from \"../capabilities.js\";\nimport path from \"node:path\";\nimport { access, lstat, readdir } from \"node:fs/promises\";\nimport { isSafeRouteNamespace } from \"../routing/engine.js\";\nimport { StorageManager } from \"../storage.js\";\nimport type { PluginConfig } from \"../types.js\";\nimport { ALL_CATEGORY_DIRS } from \"../utils/category-dir.js\";\nimport { namespaceIdentityToken, normalizeNamespaceIdentity } from \"./identity.js\";\nimport type { NamespaceCatalog } from \"./catalog.js\";\nimport { MutationSerializer } from \"../utils/serialize-mutations.js\";\n\nasync function exists(p: string): Promise<boolean> {\n  try {\n    await access(p);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nasync function hasStoredEntries(p: string): Promise<boolean> {\n  try {\n    const entry = await lstat(p);\n    if (entry.isSymbolicLink()) return true;\n    if (!entry.isDirectory()) return true;\n    const children = await readdir(p, { withFileTypes: true });\n    for (const child of children) {\n      const childPath = path.join(p, child.name);\n      if (child.isSymbolicLink() || child.isFile()) return true;\n      if (child.isDirectory() && (await hasStoredEntries(childPath))) return true;\n    }\n    return false;\n  } catch {\n    return false;\n  }\n}\n\n// Build a per-namespace directory under `<memoryDir>/namespaces` and assert the\n// resolved path stays inside that base. Namespace identifiers can originate from\n// operator config (config.defaultNamespace) and request-derived routing, so this\n// containment check prevents directory traversal (CodeQL js/path-injection).\n// For safe segments this returns exactly `path.join(base, segment)`, so there is\n// no behavioral change for valid namespaces.\nfunction resolveNamespaceDir(memoryDir: string, segment: string): string {\n  // Mirror isSafeRouteNamespace's separator/parent-ref rejection (without its\n  // 64-char cap, so identity tokens still pass). Rejecting separators and \"..\"\n  // up front keeps the value a single contained child of <memoryDir>/namespaces.\n  if (\n    segment.length === 0 ||\n    segment.includes(\"/\") ||\n    segment.includes(\"\\\\\") ||\n    segment.includes(\"..\") ||\n    path.isAbsolute(segment)\n  ) {\n    throw new Error(`unsafe namespace path segment: ${segment}`);\n  }\n  return path.join(memoryDir, \"namespaces\", segment);\n}\n\nconst LEGACY_NAMESPACE_CONTENT_CHILDREN = [\n  ...ALL_CATEGORY_DIRS,\n  \"entities\",\n  \"artifacts\",\n  \"identity\",\n  \"config\",\n  \"summaries\",\n  \"profile.md\",\n] as const;\n\nconst LEGACY_NAMESPACE_RUNTIME_CHILDREN = [\"state\"] as const;\n\nasync function hasAnyLegacyData(\n  rootDir: string,\n  options: { includeRuntimeState?: boolean } = {},\n): Promise<boolean> {\n  const children = options.includeRuntimeState === true\n    ? [...LEGACY_NAMESPACE_CONTENT_CHILDREN, ...LEGACY_NAMESPACE_RUNTIME_CHILDREN]\n    : LEGACY_NAMESPACE_CONTENT_CHILDREN;\n  for (const child of children) {\n    if (await hasStoredEntries(path.join(rootDir, child))) return true;\n  }\n  return false;\n}\n\nasync function hasAnyNamespaceStorageMarker(\n  rootDir: string,\n  options: { includeRuntimeState?: boolean } = {},\n): Promise<boolean> {\n  const children = options.includeRuntimeState === true\n    ? [...LEGACY_NAMESPACE_CONTENT_CHILDREN, ...LEGACY_NAMESPACE_RUNTIME_CHILDREN]\n    : LEGACY_NAMESPACE_CONTENT_CHILDREN;\n  for (const child of children) {\n    if (await exists(path.join(rootDir, child))) return true;\n  }\n  return false;\n}\n\n/**\n * Storage routing for namespaces.\n *\n * Compatibility note:\n * - When namespaces are enabled, existing raw namespace roots are preserved.\n *   New namespace roots use tokenized names under `memoryDir/namespaces/<token>`.\n * - The default namespace continues to use the legacy `memoryDir` root unless the caller\n *   has created `memoryDir/namespaces/<defaultNamespace>` (in which case we use that).\n *\n * This avoids surprising \"lost memories\" when an install flips namespaces on without\n * migrating existing data.\n */\n/**\n * Optional hooks for the storage router. `onResolve` fires whenever a namespace's\n * storage is resolved/created, so a downstream consumer (e.g. the namespace\n * catalog, issue #1499) can register the namespace. The hook MUST NOT throw into\n * the router; the router invokes it defensively and a hook failure never affects\n * storage resolution.\n *\n * The hook MAY return (or resolve to) a boolean indicating whether the\n * registration actually PERSISTED (round 6, codex P2 — NEFoX). When it resolves\n * to `false` (a dropped/no-op registration), the router does NOT mark the\n * (namespace, storageDir) pair as notified, so the next resolve RETRIES it\n * instead of suppressing it forever. A `void`/`undefined` result is treated as\n * success (legacy hooks).\n */\nexport interface NamespaceStorageRouterHooks {\n  onResolve?: (\n    namespace: string,\n    storageDir: string,\n  ) => void | boolean | Promise<void | boolean>;\n}\n\n/**\n * Resolve the runtime storage root for the configured DEFAULT namespace.\n *\n * Shared between the live router (`NamespaceStorageRouter.defaultNamespaceRoot`)\n * and the rebuildable catalog (`NamespaceCatalog.rebuildFromDisk`) so the two\n * can never diverge (CLAUDE.md rule #22/#42 — read & write paths resolve through\n * the same logic). The contract is: while legacy memory data still lives\n * directly under `memoryDir`, the default root stays `memoryDir`; only once the\n * legacy root is empty and a `namespaces/<default|token>` dir holds data does\n * the default migrate into that tokenized/legacy-named dir.\n */\nexport async function resolveDefaultNamespaceRoot(config: PluginConfig): Promise<string> {\n  if (!resolveNamespaceCapabilities(config).namespaces) {\n    return config.memoryDir;\n  }\n\n  // Build the legacy default root from the NORMALIZED (trimmed) name so a\n  // whitespace-padded `defaultNamespace` still finds the live `namespaces/default`\n  // root (NIabe). `storageFor()` classifies the trimmed value as the default, and\n  // the on-disk legacy dir is created under the trimmed name; using the raw spaced\n  // name here would look for `namespaces/<spaced>` and miss the real root, falling\n  // back to memoryDir/tokenized. `namespaceIdentityToken` already normalizes\n  // internally, so the tokenized path is unaffected.\n  const defaultIdentity = normalizeNamespaceIdentity(config.defaultNamespace);\n  const legacyNsDir = resolveNamespaceDir(config.memoryDir, defaultIdentity);\n  const tokenizedNsDir = resolveNamespaceDir(\n    config.memoryDir,\n    namespaceIdentityToken(config.defaultNamespace),\n  );\n  const tokenizedHasData =\n    (await exists(tokenizedNsDir)) &&\n    (await hasAnyNamespaceStorageMarker(tokenizedNsDir, { includeRuntimeState: true }));\n  const nsDir = tokenizedHasData\n    ? tokenizedNsDir\n    : (await exists(legacyNsDir))\n      ? legacyNsDir\n      : tokenizedNsDir;\n  return (await exists(nsDir)) && !(await hasAnyLegacyData(config.memoryDir))\n    ? nsDir\n    : config.memoryDir;\n}\n\n/**\n * Resolve the runtime storage root for ANY namespace exactly as the live router\n * would (`NamespaceStorageRouter.namespaceRoot`). Shared so the rebuildable\n * catalog records the SAME on-disk root the router routes to — a recall/read\n * touch must not guess `namespaces/<token>` when the router actually serves a\n * legacy raw-name dir or a migrated default root (CLAUDE.md rule #22/#42; round\n * 4, cursor Medium). The default namespace delegates to `resolveDefaultNamespaceRoot`;\n * every other namespace prefers the tokenized root when it has a storage marker,\n * else a legacy raw-name dir when present, else the tokenized root.\n */\nexport async function resolveNamespaceStorageRoot(\n  config: PluginConfig,\n  namespace: string,\n): Promise<string> {\n  if (!resolveNamespaceCapabilities(config).namespaces) return config.memoryDir;\n  // Compare on NORMALIZED identity so a whitespace-padded configured default name\n  // still routes to the default root rather than a tokenized non-default dir\n  // (NH-FH). The catalog keys records by the same normalized identity.\n  if (normalizeNamespaceIdentity(namespace) === normalizeNamespaceIdentity(config.defaultNamespace)) {\n    return resolveDefaultNamespaceRoot(config);\n  }\n  const legacyRoot = resolveNamespaceDir(config.memoryDir, namespace);\n  const tokenizedRoot = resolveNamespaceDir(config.memoryDir, namespaceIdentityToken(namespace));\n  if (\n    (await exists(tokenizedRoot)) &&\n    (await hasAnyNamespaceStorageMarker(tokenizedRoot, { includeRuntimeState: true }))\n  ) {\n    return tokenizedRoot;\n  }\n  return (await exists(legacyRoot)) ? legacyRoot : tokenizedRoot;\n}\n\nexport class NamespaceStorageRouter {\n  private readonly cache = new Map<string, StorageManager>();\n  private defaultNsRootResolved: string | null = null;\n  // Dedup the resolve hook (round 6, cursor Medium — NCNL2). Recall/extraction\n  // call `storageFor` repeatedly; firing `onResolve` (→ catalog loadCompacted +\n  // append) on every cache hit grows `namespaces.jsonl` without bound between\n  // rebuilds. We fire the hook only when the (namespace, storageDir) pair is new\n  // or its dir changed, so a steady-state cache hit is a no-op for the catalog.\n  private readonly notifiedResolved = new Map<string, string>();\n  // Instance-scoped serializer for the resolve hook (issue #1524 adoption).\n  // Replaces the bespoke `inFlightResolved` marker-then-clear pattern: the\n  // serializer's per-key chain strictly orders concurrent notifications for the\n  // SAME namespace, and the task re-checks `notifiedResolved` once it runs, so a\n  // burst of cache hits before the first hook settles collapses to a single\n  // hook invocation (the once-per-namespace intent). Recovery is preserved —\n  // one rejected hook never poisons subsequent notifications for that key.\n  private readonly resolveSerializer = new MutationSerializer();\n  // (namespace, storageDir) pairs whose resolve hook is currently pending. Set SYNCHRONOUSLY in\n  // notifyResolved (before queueing) so a burst of concurrent storageFor()\n  // cache hits collapses onto the one in-flight hook instead of each enqueuing\n  // its own task. Cleared when the queued hook settles. Without this, a dropped\n  // hook (returns false on a rebuild-lock timeout) leaves notifiedResolved\n  // unset, so every queued sibling task would re-run the hook — N serial lock\n  // waits (cursor Medium 06f58a7c, codex P2).\n  private readonly inFlightResolveHooks = new Set<string>();\n  // Tracks every in-flight resolve-hook promise so callers can deterministically\n  // await the fire-and-forget registrations that `storageFor()` kicks off (see\n  // `whenResolveHooksSettled`). Entries are removed as each hook settles, so the\n  // set holds at most one promise per concurrently-resolving namespace.\n  private readonly pendingResolveHooks = new Set<Promise<unknown>>();\n  // Pending post-write catalog touch promises (#1522). Like pendingResolveHooks,\n  // lets tests await fire-and-forget write touches deterministically.\n  private readonly pendingWriteTouches = new Set<Promise<unknown>>();\n\n  // Normalized (trimmed) default namespace identity (NH-FH). `storageFor`\n  // normalizes its input, so default-namespace branches must compare against the\n  // normalized config default too — otherwise a whitespace-padded configured\n  // default name routes the default namespace to a tokenized non-default root.\n  private readonly defaultNamespaceIdentity: string;\n\n  constructor(\n    private readonly config: PluginConfig,\n    private readonly hooks: NamespaceStorageRouterHooks = {},\n    /** Catalog reference for post-write/read touches (issue #1522 chokepoint). */\n    private readonly catalog?: NamespaceCatalog,\n  ) {\n    this.defaultNamespaceIdentity = normalizeNamespaceIdentity(config.defaultNamespace);\n  }\n\n  private async defaultNamespaceRoot(): Promise<string> {\n    this.defaultNsRootResolved = await resolveDefaultNamespaceRoot(this.config);\n    return this.defaultNsRootResolved;\n  }\n\n  private async namespaceRoot(namespace: string): Promise<string> {\n    // NOTE: only used after defaultNamespaceRoot() resolution.\n    if (!resolveNamespaceCapabilities(this.config).namespaces) return this.config.memoryDir;\n    if (normalizeNamespaceIdentity(namespace) === this.defaultNamespaceIdentity) {\n      return this.defaultNsRootResolved ?? this.config.memoryDir;\n    }\n    return resolveNamespaceStorageRoot(this.config, namespace);\n  }\n\n  async storageFor(namespace: string): Promise<StorageManager> {\n    const ns = normalizeNamespaceIdentity(namespace || this.config.defaultNamespace);\n    if (ns !== this.defaultNamespaceIdentity && !isSafeRouteNamespace(ns)) {\n      throw new Error(`unsafe namespace: ${ns}`);\n    }\n    // Even when the default namespace is exempt from the check above, every\n    // on-disk path is built through resolveNamespaceDir(), which rejects\n    // traversal segments — so an unsafe configured default still cannot escape\n    // <memoryDir>/namespaces (CodeQL js/path-injection).\n\n    let root: string;\n    if (ns === this.defaultNamespaceIdentity) {\n      root = await this.defaultNamespaceRoot();\n      const cached = this.cache.get(ns);\n      if (cached && cached.dir === root) {\n        this.notifyResolved(ns, root);\n        return cached;\n      }\n    } else {\n      const cached = this.cache.get(ns);\n      root = await this.namespaceRoot(ns);\n      if (cached && cached.dir === root) {\n        this.notifyResolved(ns, root);\n        return cached;\n      }\n    }\n\n    // Pass the hot-memories cache gate explicitly (issue #1902, Codex P2): a\n    // per-namespace child root is never registered in the per-dir default map,\n    // so without this it would fall back to the process-wide default and ignore\n    // THIS daemon's hotMemoriesCacheEnabled config. Threading it from config\n    // keeps every namespace storage aligned with its owning orchestrator.\n    const sm = new StorageManager(\n      root,\n      this.config.entitySchemas,\n      this.config.hotMemoriesCacheEnabled,\n    );\n    // Register this child root's gate AND TTL in the per-dir maps (issue #1902,\n    // Codex P2). The constructor override above fixes the child's own gate, but\n    // its TTL is resolved via the per-dir map (hotCacheTtlMs); an unregistered\n    // child root would fall back to the last process-wide TTL and could inherit\n    // another daemon's value. Registering keyed by root keeps both per-dir.\n    StorageManager.setHotMemoriesCacheDefault(\n      root,\n      this.config.hotMemoriesCacheEnabled,\n      this.config.hotMemoriesCacheTtlMs,\n    );\n    // Propagate the inline-attribution template so that router-created storages\n    // (used by extraction and shared-promotion paths) strip citations consistently,\n    // matching the behaviour of the primary this.storage instance in the orchestrator.\n    sm.citationTemplate = this.config.inlineSourceAttributionFormat;\n    // #1522: install the post-write catalog touch at the chokepoint — every\n    // successful write on this StorageManager records the namespace touch.\n    this.bindCatalogWriteHook(sm, ns);\n    // #1579: apply the tombstone non-resurrection config so every namespace\n    // storage enforces the invariant at its own writeMemory chokepoint.\n    this.applyTombstonesConfig(sm, ns);\n    this.cache.set(ns, sm);\n    this.notifyResolved(ns, root);\n    return sm;\n  }\n\n  /**\n   * Fire the resolve hook defensively. A hook failure (e.g. a catalog write\n   * error) MUST NOT crash storage resolution — see CLAUDE.md gotcha #13.\n   *\n   * Issue #1524 adoption: hook invocations for the SAME namespace are now\n   * strictly ordered through the shared `MutationSerializer` rather than the\n   * bespoke `inFlightResolved` marker-then-clear pattern. The serializer\n   * guarantees one in-flight hook per namespace; a concurrent burst of\n   * `storageFor()` cache hits collapses to a single hook invocation because\n   * each queued task re-checks `notifiedResolved` before invoking the hook. A\n   * dropped (`false`) or rejected hook leaves `notifiedResolved` unset so the\n   * next `storageFor()` retries — the serializer recovers from the rejection,\n   * so a failed hook never poisons later notifications.\n   */\n  private notifyResolved(namespace: string, storageDir: string): void {\n    const hook = this.hooks.onResolve;\n    if (!hook) return;\n    // Permanent dedup: skip once we've SUCCESSFULLY notified this exact\n    // (namespace, storageDir). A changed dir (rare: migration/realignment)\n    // still re-fires once. The mark is set ONLY AFTER the hook succeeds, so a\n    // dropped registration (e.g. rebuild-lock timeout) is RETRIED on the next\n    // cache hit instead of being suppressed forever (round 6, cursor Medium —\n    // ND3EJ).\n    if (this.notifiedResolved.get(namespace) === storageDir) return;\n    // In-flight dedup (cursor Medium 06f58a7c, codex P2): if a hook for THIS\n    // namespace is already pending, collapse this call onto it instead of\n    // enqueueing another task. The serializer strictly orders queued tasks, but\n    // ordering alone is not enough — when the first hook returns `false`\n    // (dropped touch, e.g. rebuild-lock timeout), `notifiedResolved` stays\n    // unset, so each queued sibling task would pass its re-check and re-run the\n    // hook. With the real catalog hook each retry can spend the full lock wait,\n    // so N cache hits during a rebuild leave N serial background lock attempts.\n    // Collapsing here means at most ONE hook runs per in-flight registration;\n    // its result (set `notifiedResolved` on success, leave unset on drop)\n    // decides whether a LATER `storageFor()` retries — collapsing loses\n    // nothing because the drop is already retried on the next cache hit.\n    // Keyed by the composite (namespace, storageDir) so a CHANGED dir\n    // (migration/realignment) for the same namespace still gets its own hook —\n    // it is NOT collapsed onto the old dir's pending registration (cursor\n    // Medium, codex P2).\n    const inFlightKey = namespace + \"\\u0000\" + storageDir;\n    if (this.inFlightResolveHooks.has(inFlightKey)) return;\n    this.inFlightResolveHooks.add(inFlightKey);\n    // Queue through the serializer. Concurrent calls for the same namespace\n    // strictly order here; the 2nd call's task runs only after the 1st's hook\n    // settles, by which point `notifiedResolved` is either set (no-op) or still\n    // unset (retry). The returned promise is tracked for\n    // `whenResolveHooksSettled()`. Rejections from the task body are caught so\n    // they never reach the caller (best-effort hook contract); the serializer's\n    // recovered tail still lets subsequent notifications run.\n    const task = async (): Promise<void> => {\n      // Re-check after queueing: a prior task in this same chain may have just\n      // marked the pair as notified.\n      if (this.notifiedResolved.get(namespace) === storageDir) return;\n      try {\n        // Hook may be sync or async; Promise.resolve normalizes both. A result\n        // of `false` means the registration was dropped/no-op (e.g. rebuild-lock\n        // timeout) — leave notifiedResolved UNSET so the next storageFor retries\n        // (round 6, codex P2 — NEFoX). `void`/`undefined` is success for legacy\n        // hooks. A rejection leaves notifiedResolved unset for the same reason.\n        const persisted = await Promise.resolve(hook(namespace, storageDir));\n        if (persisted !== false) {\n          this.notifiedResolved.set(namespace, storageDir);\n        }\n      } catch {\n        // Best-effort: a hook failure MUST NOT crash storage resolution. Leave\n        // notifiedResolved unset so a later storageFor retries the registration.\n      }\n    };\n    const queued = this.resolveSerializer.serialize(namespace, task);\n    this.pendingResolveHooks.add(queued);\n    // Clear the in-flight marker when the hook settles so a subsequent\n    // storageFor() can retry after a drop, or short-circuit via notifiedResolved\n    // after a success.\n    const cleanup = (): void => {\n      this.inFlightResolveHooks.delete(inFlightKey);\n      this.pendingResolveHooks.delete(queued);\n    };\n    void queued.then(cleanup, cleanup);\n  }\n\n  /**\n   * Install the post-write catalog touch hook on an externally-constructed\n   * StorageManager (issue #1522). Used by the orchestrator for the legacy\n   * default-namespace storage (`this.storage`) that bypasses the router.\n   */\n  bindCatalogWriteHook(sm: StorageManager, namespace: string): void {\n    // Issue #1903: pure state-file writes only touch the catalog when explicitly\n    // opted in. Router-created storages (storageFor) and the legacy default\n    // storage both flow through here, so this is the single wiring point.\n    sm.touchStateWrites = this.config.namespacesCatalogTouchStateWrites === true;\n    sm.onCatalogWrite = () => this.touchCatalogWrite(namespace, sm.dir);\n  }\n\n  /**\n   * Install the tombstone config on an externally-constructed StorageManager\n   * (issue #1579). Mirrors `bindCatalogWriteHook` — used for the legacy\n   * default-namespace storage that bypasses the router. Router-created\n   * storages are wired inline in `storageFor()` via `applyTombstonesConfig`.\n   */\n  bindTombstonesConfig(\n    sm: StorageManager,\n    namespace: string,\n    config: { enabled: boolean; semanticMatch: boolean; semanticThreshold: number },\n  ): void {\n    this.tombstonesGlobalConfig = { ...config };\n    sm.setTombstonesConfig({ ...config, namespace });\n  }\n\n  private tombstonesGlobalConfig: {\n    enabled: boolean;\n    semanticMatch: boolean;\n    semanticThreshold: number;\n  } = { enabled: false, semanticMatch: false, semanticThreshold: 0.9 };\n\n  /**\n   * Apply the tombstone config to a router-created StorageManager. Called\n   * inline in `storageFor()` so every namespace storage enforces the\n   * non-resurrection invariant, namespace-scoped (rule 42).\n   */\n  private applyTombstonesConfig(sm: StorageManager, namespace: string): void {\n    sm.setTombstonesConfig({ ...this.tombstonesGlobalConfig, namespace });\n  }\n\n  /**\n   * Post-write catalog touch (issue #1522 chokepoint). Called by every\n   * StorageManager's post-write hook AFTER a successful write. Best-effort\n   * and failure-tolerant — a catalog error MUST NOT affect the primary write\n   * (gotcha #13, rule #40). Fire-and-forget by design.\n   */\n  private touchCatalogWrite(namespace: string, storageDir: string): void {\n    if (!this.catalog) return;\n    const touch = this.catalog\n      .markWrite(namespace, { discoveredBy: \"write\", storageDir })\n      .catch(() => undefined);\n    this.pendingWriteTouches.add(touch);\n    void touch.then(\n      () => { this.pendingWriteTouches.delete(touch); },\n      () => { this.pendingWriteTouches.delete(touch); },\n    );\n  }\n\n  /**\n   * Record a namespace read in the catalog (issue #1522 chokepoint move).\n   * Best-effort and failure-tolerant. Used by recall paths so the read touch\n   * lives in the storage layer, not at the caller.\n   */\n  recordRead(namespace: string, storageDir?: string): void {\n    if (!this.catalog) return;\n    const ns = normalizeNamespaceIdentity(namespace || this.config.defaultNamespace);\n    void this.catalog\n      .markRead(ns, { discoveredBy: \"read\", storageDir })\n      .catch(() => undefined);\n  }\n  /**\n   * Record a namespace write touch in the catalog (issue #1522). Best-effort\n   * and failure-tolerant. Used by consolidation/cleanup passes that may mutate\n   * the store via delete-only paths (e.g. entity-file merges, TTL cleanup) so\n   * the namespace's lastWriteAt stays fresh even when no explicit write went\n   * through the storage chokepoint. This is NOT a substitute for the chokepoint\n   * — it's a belt-and-suspenders for paths the chokepoint doesn't cover.\n   */\n  recordWrite(namespace: string, storageDir?: string): void {\n    if (!this.catalog) return;\n    const ns = normalizeNamespaceIdentity(namespace || this.config.defaultNamespace);\n    const touch = this.catalog\n      .markWrite(ns, { discoveredBy: \"write\", storageDir })\n      .catch(() => undefined);\n    this.pendingWriteTouches.add(touch);\n    void touch.then(\n      () => { this.pendingWriteTouches.delete(touch); },\n      () => { this.pendingWriteTouches.delete(touch); },\n    );\n  }\n\n  /**\n   * Resolve once every in-flight post-write catalog touch has settled (#1522).\n   * Mirrors `whenResolveHooksSettled()`: the StorageManager's post-write hook\n   * fires the catalog touch fire-and-forget, so tests asserting lastWriteAt\n   * moved should await this instead of racing a timer.\n   */\n  async whenWriteTouchesSettled(): Promise<void> {\n    // Flush any coalesced (buffered) touches first so their appends join the\n    // pending set below — otherwise this could resolve while a buffered touch's\n    // lastWriteAt is still unwritten on disk (#1903, Cursor). No-op when\n    // coalescing is disabled (window 0) or the catalog is inert.\n    await this.catalog?.flushPendingTouches().catch(() => undefined);\n    while (this.pendingWriteTouches.size > 0) {\n      await Promise.allSettled([...this.pendingWriteTouches]);\n    }\n  }\n\n  /**\n   * Resolve once every in-flight `onResolve` registration has settled.\n   *\n   * `storageFor()` fires the resolve hook fire-and-forget, so its catalog side\n   * effect (e.g. `registerResolved(...)`) is not observable the moment\n   * `storageFor()` returns. Callers that must act on that side effect — notably\n   * tests asserting the catalog was updated — should await this instead of\n   * racing a timer. Resolves immediately when no hook is registered or nothing\n   * is in flight. The loop re-checks because a settling hook could, in\n   * principle, trigger a follow-on resolution.\n   */\n  async whenResolveHooksSettled(): Promise<void> {\n    while (this.pendingResolveHooks.size > 0) {\n      await Promise.allSettled([...this.pendingResolveHooks]);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AACA,OAAO,UAAU;AACjB,SAAS,QAAQ,OAAO,eAAe;AASvC,eAAe,OAAO,GAA6B;AACjD,MAAI;AACF,UAAM,OAAO,CAAC;AACd,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,iBAAiB,GAA6B;AAC3D,MAAI;AACF,UAAM,QAAQ,MAAM,MAAM,CAAC;AAC3B,QAAI,MAAM,eAAe,EAAG,QAAO;AACnC,QAAI,CAAC,MAAM,YAAY,EAAG,QAAO;AACjC,UAAM,WAAW,MAAM,QAAQ,GAAG,EAAE,eAAe,KAAK,CAAC;AACzD,eAAW,SAAS,UAAU;AAC5B,YAAM,YAAY,KAAK,KAAK,GAAG,MAAM,IAAI;AACzC,UAAI,MAAM,eAAe,KAAK,MAAM,OAAO,EAAG,QAAO;AACrD,UAAI,MAAM,YAAY,KAAM,MAAM,iBAAiB,SAAS,EAAI,QAAO;AAAA,IACzE;AACA,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAQA,SAAS,oBAAoB,WAAmB,SAAyB;AAIvE,MACE,QAAQ,WAAW,KACnB,QAAQ,SAAS,GAAG,KACpB,QAAQ,SAAS,IAAI,KACrB,QAAQ,SAAS,IAAI,KACrB,KAAK,WAAW,OAAO,GACvB;AACA,UAAM,IAAI,MAAM,kCAAkC,OAAO,EAAE;AAAA,EAC7D;AACA,SAAO,KAAK,KAAK,WAAW,cAAc,OAAO;AACnD;AAEA,IAAM,oCAAoC;AAAA,EACxC,GAAG;AAAA,EACH;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,oCAAoC,CAAC,OAAO;AAElD,eAAe,iBACb,SACA,UAA6C,CAAC,GAC5B;AAClB,QAAM,WAAW,QAAQ,wBAAwB,OAC7C,CAAC,GAAG,mCAAmC,GAAG,iCAAiC,IAC3E;AACJ,aAAW,SAAS,UAAU;AAC5B,QAAI,MAAM,iBAAiB,KAAK,KAAK,SAAS,KAAK,CAAC,EAAG,QAAO;AAAA,EAChE;AACA,SAAO;AACT;AAEA,eAAe,6BACb,SACA,UAA6C,CAAC,GAC5B;AAClB,QAAM,WAAW,QAAQ,wBAAwB,OAC7C,CAAC,GAAG,mCAAmC,GAAG,iCAAiC,IAC3E;AACJ,aAAW,SAAS,UAAU;AAC5B,QAAI,MAAM,OAAO,KAAK,KAAK,SAAS,KAAK,CAAC,EAAG,QAAO;AAAA,EACtD;AACA,SAAO;AACT;AA8CA,eAAsB,4BAA4B,QAAuC;AACvF,MAAI,CAAC,6BAA6B,MAAM,EAAE,YAAY;AACpD,WAAO,OAAO;AAAA,EAChB;AASA,QAAM,kBAAkB,2BAA2B,OAAO,gBAAgB;AAC1E,QAAM,cAAc,oBAAoB,OAAO,WAAW,eAAe;AACzE,QAAM,iBAAiB;AAAA,IACrB,OAAO;AAAA,IACP,uBAAuB,OAAO,gBAAgB;AAAA,EAChD;AACA,QAAM,mBACH,MAAM,OAAO,cAAc,KAC3B,MAAM,6BAA6B,gBAAgB,EAAE,qBAAqB,KAAK,CAAC;AACnF,QAAM,QAAQ,mBACV,iBACC,MAAM,OAAO,WAAW,IACvB,cACA;AACN,SAAQ,MAAM,OAAO,KAAK,KAAM,CAAE,MAAM,iBAAiB,OAAO,SAAS,IACrE,QACA,OAAO;AACb;AAYA,eAAsB,4BACpB,QACA,WACiB;AACjB,MAAI,CAAC,6BAA6B,MAAM,EAAE,WAAY,QAAO,OAAO;AAIpE,MAAI,2BAA2B,SAAS,MAAM,2BAA2B,OAAO,gBAAgB,GAAG;AACjG,WAAO,4BAA4B,MAAM;AAAA,EAC3C;AACA,QAAM,aAAa,oBAAoB,OAAO,WAAW,SAAS;AAClE,QAAM,gBAAgB,oBAAoB,OAAO,WAAW,uBAAuB,SAAS,CAAC;AAC7F,MACG,MAAM,OAAO,aAAa,KAC1B,MAAM,6BAA6B,eAAe,EAAE,qBAAqB,KAAK,CAAC,GAChF;AACA,WAAO;AAAA,EACT;AACA,SAAQ,MAAM,OAAO,UAAU,IAAK,aAAa;AACnD;AAEO,IAAM,yBAAN,MAA6B;AAAA,EAwClC,YACmB,QACA,QAAqC,CAAC,GAEtC,SACjB;AAJiB;AACA;AAEA;AAEjB,SAAK,2BAA2B,2BAA2B,OAAO,gBAAgB;AAAA,EACpF;AAAA,EANmB;AAAA,EACA;AAAA,EAEA;AAAA,EA3CF,QAAQ,oBAAI,IAA4B;AAAA,EACjD,wBAAuC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM9B,mBAAmB,oBAAI,IAAoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3C,oBAAoB,IAAI,mBAAmB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQ3C,uBAAuB,oBAAI,IAAY;AAAA;AAAA;AAAA;AAAA;AAAA,EAKvC,sBAAsB,oBAAI,IAAsB;AAAA;AAAA;AAAA,EAGhD,sBAAsB,oBAAI,IAAsB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMhD;AAAA,EAWjB,MAAc,uBAAwC;AACpD,SAAK,wBAAwB,MAAM,4BAA4B,KAAK,MAAM;AAC1E,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAc,cAAc,WAAoC;AAE9D,QAAI,CAAC,6BAA6B,KAAK,MAAM,EAAE,WAAY,QAAO,KAAK,OAAO;AAC9E,QAAI,2BAA2B,SAAS,MAAM,KAAK,0BAA0B;AAC3E,aAAO,KAAK,yBAAyB,KAAK,OAAO;AAAA,IACnD;AACA,WAAO,4BAA4B,KAAK,QAAQ,SAAS;AAAA,EAC3D;AAAA,EAEA,MAAM,WAAW,WAA4C;AAC3D,UAAM,KAAK,2BAA2B,aAAa,KAAK,OAAO,gBAAgB;AAC/E,QAAI,OAAO,KAAK,4BAA4B,CAAC,qBAAqB,EAAE,GAAG;AACrE,YAAM,IAAI,MAAM,qBAAqB,EAAE,EAAE;AAAA,IAC3C;AAMA,QAAI;AACJ,QAAI,OAAO,KAAK,0BAA0B;AACxC,aAAO,MAAM,KAAK,qBAAqB;AACvC,YAAM,SAAS,KAAK,MAAM,IAAI,EAAE;AAChC,UAAI,UAAU,OAAO,QAAQ,MAAM;AACjC,aAAK,eAAe,IAAI,IAAI;AAC5B,eAAO;AAAA,MACT;AAAA,IACF,OAAO;AACL,YAAM,SAAS,KAAK,MAAM,IAAI,EAAE;AAChC,aAAO,MAAM,KAAK,cAAc,EAAE;AAClC,UAAI,UAAU,OAAO,QAAQ,MAAM;AACjC,aAAK,eAAe,IAAI,IAAI;AAC5B,eAAO;AAAA,MACT;AAAA,IACF;AAOA,UAAM,KAAK,IAAI;AAAA,MACb;AAAA,MACA,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AAMA,mBAAe;AAAA,MACb;AAAA,MACA,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AAIA,OAAG,mBAAmB,KAAK,OAAO;AAGlC,SAAK,qBAAqB,IAAI,EAAE;AAGhC,SAAK,sBAAsB,IAAI,EAAE;AACjC,SAAK,MAAM,IAAI,IAAI,EAAE;AACrB,SAAK,eAAe,IAAI,IAAI;AAC5B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBQ,eAAe,WAAmB,YAA0B;AAClE,UAAM,OAAO,KAAK,MAAM;AACxB,QAAI,CAAC,KAAM;AAOX,QAAI,KAAK,iBAAiB,IAAI,SAAS,MAAM,WAAY;AAiBzD,UAAM,cAAc,YAAY,OAAW;AAC3C,QAAI,KAAK,qBAAqB,IAAI,WAAW,EAAG;AAChD,SAAK,qBAAqB,IAAI,WAAW;AAQzC,UAAM,OAAO,YAA2B;AAGtC,UAAI,KAAK,iBAAiB,IAAI,SAAS,MAAM,WAAY;AACzD,UAAI;AAMF,cAAM,YAAY,MAAM,QAAQ,QAAQ,KAAK,WAAW,UAAU,CAAC;AACnE,YAAI,cAAc,OAAO;AACvB,eAAK,iBAAiB,IAAI,WAAW,UAAU;AAAA,QACjD;AAAA,MACF,QAAQ;AAAA,MAGR;AAAA,IACF;AACA,UAAM,SAAS,KAAK,kBAAkB,UAAU,WAAW,IAAI;AAC/D,SAAK,oBAAoB,IAAI,MAAM;AAInC,UAAM,UAAU,MAAY;AAC1B,WAAK,qBAAqB,OAAO,WAAW;AAC5C,WAAK,oBAAoB,OAAO,MAAM;AAAA,IACxC;AACA,SAAK,OAAO,KAAK,SAAS,OAAO;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,qBAAqB,IAAoB,WAAyB;AAIhE,OAAG,mBAAmB,KAAK,OAAO,sCAAsC;AACxE,OAAG,iBAAiB,MAAM,KAAK,kBAAkB,WAAW,GAAG,GAAG;AAAA,EACpE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,qBACE,IACA,WACA,QACM;AACN,SAAK,yBAAyB,EAAE,GAAG,OAAO;AAC1C,OAAG,oBAAoB,EAAE,GAAG,QAAQ,UAAU,CAAC;AAAA,EACjD;AAAA,EAEQ,yBAIJ,EAAE,SAAS,OAAO,eAAe,OAAO,mBAAmB,IAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAO3D,sBAAsB,IAAoB,WAAyB;AACzE,OAAG,oBAAoB,EAAE,GAAG,KAAK,wBAAwB,UAAU,CAAC;AAAA,EACtE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,kBAAkB,WAAmB,YAA0B;AACrE,QAAI,CAAC,KAAK,QAAS;AACnB,UAAM,QAAQ,KAAK,QAChB,UAAU,WAAW,EAAE,cAAc,SAAS,WAAW,CAAC,EAC1D,MAAM,MAAM,MAAS;AACxB,SAAK,oBAAoB,IAAI,KAAK;AAClC,SAAK,MAAM;AAAA,MACT,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,MAChD,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,IAClD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,WAAmB,YAA2B;AACvD,QAAI,CAAC,KAAK,QAAS;AACnB,UAAM,KAAK,2BAA2B,aAAa,KAAK,OAAO,gBAAgB;AAC/E,SAAK,KAAK,QACP,SAAS,IAAI,EAAE,cAAc,QAAQ,WAAW,CAAC,EACjD,MAAM,MAAM,MAAS;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY,WAAmB,YAA2B;AACxD,QAAI,CAAC,KAAK,QAAS;AACnB,UAAM,KAAK,2BAA2B,aAAa,KAAK,OAAO,gBAAgB;AAC/E,UAAM,QAAQ,KAAK,QAChB,UAAU,IAAI,EAAE,cAAc,SAAS,WAAW,CAAC,EACnD,MAAM,MAAM,MAAS;AACxB,SAAK,oBAAoB,IAAI,KAAK;AAClC,SAAK,MAAM;AAAA,MACT,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,MAChD,MAAM;AAAE,aAAK,oBAAoB,OAAO,KAAK;AAAA,MAAG;AAAA,IAClD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,0BAAyC;AAK7C,UAAM,KAAK,SAAS,oBAAoB,EAAE,MAAM,MAAM,MAAS;AAC/D,WAAO,KAAK,oBAAoB,OAAO,GAAG;AACxC,YAAM,QAAQ,WAAW,CAAC,GAAG,KAAK,mBAAmB,CAAC;AAAA,IACxD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,0BAAyC;AAC7C,WAAO,KAAK,oBAAoB,OAAO,GAAG;AACxC,YAAM,QAAQ,WAAW,CAAC,GAAG,KAAK,mBAAmB,CAAC;AAAA,IACxD;AAAA,EACF;AACF;","names":[]}

package/dist/chunk-RULE4VG5.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/memory-lifecycle-ledger-utils.ts"],"sourcesContent":["import path from \"node:path\";\nimport type {\n  MemoryFile,\n  MemoryLifecycleEvent,\n  MemoryLifecycleEventType,\n  MemoryLifecycleStateSummary,\n  MemoryFrontmatter,\n  MemoryStatus,\n} from \"./types.js\";\n\nexport const MEMORY_LIFECYCLE_RULE_VERSION = \"memory-lifecycle-ledger.v1\";\n\nexport const MEMORY_LIFECYCLE_EVENT_SORT_ORDER: Record<MemoryLifecycleEventType, number> = {\n  created: 0,\n  updated: 1,\n  promoted: 2,\n  explicit_capture_accepted: 3,\n  explicit_capture_queued: 4,\n  imported: 5,\n  merged: 6,\n  restored: 7,\n  superseded: 8,\n  rejected: 9,\n  archived: 10,\n};\n\nexport function toMemoryPathRel(baseDir: string, filePath: string): string {\n  if (!baseDir) return filePath.split(path.sep).join(\"/\");\n  return path.relative(baseDir, filePath).split(path.sep).join(\"/\");\n}\n\nexport function isArchivedMemoryPath(pathRel: string): boolean {\n  return pathRel === \"archive\" || pathRel.startsWith(\"archive/\");\n}\n\nexport function inferMemoryStatus(\n  frontmatter: MemoryFrontmatter,\n  pathRel: string,\n  fallbackStatus: MemoryStatus = \"active\",\n): MemoryStatus {\n  if (frontmatter.status && frontmatter.status !== \"active\") return frontmatter.status;\n  if (frontmatter.archivedAt) return \"archived\";\n  if (isArchivedMemoryPath(pathRel)) return \"archived\";\n  if (frontmatter.status) return frontmatter.status;\n  return fallbackStatus;\n}\n\nexport function isActiveMemoryStatus(status: MemoryStatus | string | undefined): boolean {\n  return status === undefined || status === \"active\";\n}\n\nexport function summarizeMemoryLifecycleState(memory: MemoryFile): MemoryLifecycleStateSummary {\n  return {\n    category: memory.frontmatter.category,\n    path: memory.path,\n    status: memory.frontmatter.status ?? \"active\",\n    lifecycleState: memory.frontmatter.lifecycleState,\n  };\n}\n\nexport function makeRebuiltMemoryLifecycleEvent(\n  memory: MemoryFile,\n  eventType: MemoryLifecycleEventType,\n  timestamp: string,\n): MemoryLifecycleEvent {\n  return {\n    eventId: `rebuild-${memory.frontmatter.id}-${eventType}-${timestamp}`,\n    memoryId: memory.frontmatter.id,\n    eventType,\n    timestamp,\n    actor: \"maintenance.rebuildMemoryLifecycleLedger\",\n    ruleVersion: MEMORY_LIFECYCLE_RULE_VERSION,\n    after: summarizeMemoryLifecycleState(memory),\n    relatedMemoryIds: [\n      ...(memory.frontmatter.supersededBy ? [memory.frontmatter.supersededBy] : []),\n      ...(memory.frontmatter.supersedes ? [memory.frontmatter.supersedes] : []),\n      ...((memory.frontmatter.lineage ?? []).filter(Boolean)),\n    ],\n  };\n}\n\nexport function buildLifecycleEventsForMemory(memory: MemoryFile): MemoryLifecycleEvent[] {\n  const events: MemoryLifecycleEvent[] = [];\n  const created = memory.frontmatter.created;\n  const updated = memory.frontmatter.updated;\n  const archivedAt = memory.frontmatter.archivedAt;\n  const supersededAt = memory.frontmatter.supersededAt;\n  const effectiveArchivedAt =\n    archivedAt ?? (memory.frontmatter.status === \"archived\" && updated ? updated : undefined);\n\n  events.push(makeRebuiltMemoryLifecycleEvent(memory, \"created\", created));\n  if (\n    updated &&\n    updated !== created &&\n    updated !== effectiveArchivedAt &&\n    updated !== supersededAt\n  ) {\n    events.push(makeRebuiltMemoryLifecycleEvent(memory, \"updated\", updated));\n  }\n  if (supersededAt) {\n    events.push(makeRebuiltMemoryLifecycleEvent(memory, \"superseded\", supersededAt));\n  }\n  if (effectiveArchivedAt) {\n    events.push(makeRebuiltMemoryLifecycleEvent(memory, \"archived\", effectiveArchivedAt));\n  }\n\n  return events;\n}\n\nexport function sortMemoryLifecycleEvents(events: MemoryLifecycleEvent[]): MemoryLifecycleEvent[] {\n  return [...events].sort((a, b) => {\n    if (a.memoryId !== b.memoryId) return a.memoryId.localeCompare(b.memoryId);\n    if (a.timestamp !== b.timestamp) return a.timestamp.localeCompare(b.timestamp);\n    return MEMORY_LIFECYCLE_EVENT_SORT_ORDER[a.eventType] - MEMORY_LIFECYCLE_EVENT_SORT_ORDER[b.eventType];\n  });\n}\n"],"mappings":";AAAA,OAAO,UAAU;AAUV,IAAM,gCAAgC;AAEtC,IAAM,oCAA8E;AAAA,EACzF,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AAAA,EACV,2BAA2B;AAAA,EAC3B,yBAAyB;AAAA,EACzB,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,UAAU;AACZ;AAEO,SAAS,gBAAgB,SAAiB,UAA0B;AACzE,MAAI,CAAC,QAAS,QAAO,SAAS,MAAM,KAAK,GAAG,EAAE,KAAK,GAAG;AACtD,SAAO,KAAK,SAAS,SAAS,QAAQ,EAAE,MAAM,KAAK,GAAG,EAAE,KAAK,GAAG;AAClE;AAEO,SAAS,qBAAqB,SAA0B;AAC7D,SAAO,YAAY,aAAa,QAAQ,WAAW,UAAU;AAC/D;AAEO,SAAS,kBACd,aACA,SACA,iBAA+B,UACjB;AACd,MAAI,YAAY,UAAU,YAAY,WAAW,SAAU,QAAO,YAAY;AAC9E,MAAI,YAAY,WAAY,QAAO;AACnC,MAAI,qBAAqB,OAAO,EAAG,QAAO;AAC1C,MAAI,YAAY,OAAQ,QAAO,YAAY;AAC3C,SAAO;AACT;AAEO,SAAS,qBAAqB,QAAoD;AACvF,SAAO,WAAW,UAAa,WAAW;AAC5C;AAEO,SAAS,8BAA8B,QAAiD;AAC7F,SAAO;AAAA,IACL,UAAU,OAAO,YAAY;AAAA,IAC7B,MAAM,OAAO;AAAA,IACb,QAAQ,OAAO,YAAY,UAAU;AAAA,IACrC,gBAAgB,OAAO,YAAY;AAAA,EACrC;AACF;AAEO,SAAS,gCACd,QACA,WACA,WACsB;AACtB,SAAO;AAAA,IACL,SAAS,WAAW,OAAO,YAAY,EAAE,IAAI,SAAS,IAAI,SAAS;AAAA,IACnE,UAAU,OAAO,YAAY;AAAA,IAC7B;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,aAAa;AAAA,IACb,OAAO,8BAA8B,MAAM;AAAA,IAC3C,kBAAkB;AAAA,MAChB,GAAI,OAAO,YAAY,eAAe,CAAC,OAAO,YAAY,YAAY,IAAI,CAAC;AAAA,MAC3E,GAAI,OAAO,YAAY,aAAa,CAAC,OAAO,YAAY,UAAU,IAAI,CAAC;AAAA,MACvE,IAAK,OAAO,YAAY,WAAW,CAAC,GAAG,OAAO,OAAO;AAAA,IACvD;AAAA,EACF;AACF;AAEO,SAAS,8BAA8B,QAA4C;AACxF,QAAM,SAAiC,CAAC;AACxC,QAAM,UAAU,OAAO,YAAY;AACnC,QAAM,UAAU,OAAO,YAAY;AACnC,QAAM,aAAa,OAAO,YAAY;AACtC,QAAM,eAAe,OAAO,YAAY;AACxC,QAAM,sBACJ,eAAe,OAAO,YAAY,WAAW,cAAc,UAAU,UAAU;AAEjF,SAAO,KAAK,gCAAgC,QAAQ,WAAW,OAAO,CAAC;AACvE,MACE,WACA,YAAY,WACZ,YAAY,uBACZ,YAAY,cACZ;AACA,WAAO,KAAK,gCAAgC,QAAQ,WAAW,OAAO,CAAC;AAAA,EACzE;AACA,MAAI,cAAc;AAChB,WAAO,KAAK,gCAAgC,QAAQ,cAAc,YAAY,CAAC;AAAA,EACjF;AACA,MAAI,qBAAqB;AACvB,WAAO,KAAK,gCAAgC,QAAQ,YAAY,mBAAmB,CAAC;AAAA,EACtF;AAEA,SAAO;AACT;AAEO,SAAS,0BAA0B,QAAwD;AAChG,SAAO,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM;AAChC,QAAI,EAAE,aAAa,EAAE,SAAU,QAAO,EAAE,SAAS,cAAc,EAAE,QAAQ;AACzE,QAAI,EAAE,cAAc,EAAE,UAAW,QAAO,EAAE,UAAU,cAAc,EAAE,SAAS;AAC7E,WAAO,kCAAkC,EAAE,SAAS,IAAI,kCAAkC,EAAE,SAAS;AAAA,EACvG,CAAC;AACH;","names":[]}