@remnic/core 9.69.40 → 9.69.42

package/dist/chunk-WUUGE7QC.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/deep-recall.ts"],"sourcesContent":["/**\n * Budgeted deep-recall loop (issue #2332, harmonic series P4).\n *\n * REFINE / EXPAND / STOP retrieval over the abstraction-node + cue-anchor\n * graph built by issue #2329, blended with QMD search. This is the deep\n * surface ONLY — never wired into `before_prompt_build` or any recall\n * section (that latency disqualifies the hot path; see the issue).\n *\n * The loop is dependency-injected: seeding, graph loading, memory loading,\n * and the policy LLM call arrive as `DeepRecallDeps`, so the loop is\n * deterministic under a scripted fake policy (tests) and thin when the\n * access service wires real deps. Pure decision helpers are reused from\n * the `recall-deep-*` primitives — never re-implemented here.\n */\n\nimport { z } from \"zod\";\nimport type { AbstractionNode } from \"./abstraction-nodes.js\";\nimport type { CueAnchor } from \"./cue-anchors.js\";\nimport { compareDeterministicStrings } from \"./deterministic-order.js\";\nimport { abortError, isAbortError, raceAbort, throwIfAborted } from \"./abort-error.js\";\nimport { extractJsonCandidates, stripCodeFences } from \"./json-extract.js\";\nimport { rankDeepRecallFrontier } from \"./recall-deep-frontier.js\";\nimport { selectExpandNodeIds } from \"./recall-deep-expand-select.js\";\nimport { validateRefineRewrite } from \"./recall-deep-rewrite.js\";\nimport type { DeepRecallConfig } from \"./deep-recall-config.js\";\n\nexport type { DeepRecallConfig } from \"./deep-recall-config.js\";\n\nexport interface DeepRecallEntry {\n  memoryId: string;\n  /** Trimmed to 500 chars for state rendering; full content only in final output. */\n  content: string;\n  /** Seed similarity, or expansion inheritance (parent score * 0.8). */\n  score: number;\n  origin: \"seed\" | \"refine\" | \"expand\";\n  /** anchorValue that linked the entry, when origin === \"expand\". */\n  viaAnchor?: string;\n}\n\nexport interface DeepRecallFrontierItem {\n  nodeId: string;\n  title: string;\n  /** e.g. `shares anchor \"<anchorValue>\" with <memoryId>`. */\n  reason: string;\n  sharedAnchorCount: number;\n  /** Working-set memory the anchor was shared with; drives expansion scoring. */\n  parentMemoryId: string;\n  parentScore: number;\n  anchorValue: string;\n}\n\nexport interface DeepRecallTraceStep {\n  step: number;\n  action: \"REFINE\" | \"EXPAND\" | \"STOP\" | \"BUDGET_EXHAUSTED\";\n  /** Rewritten query, chosen nodeIds, or stop reason. */\n  detail: string;\n  workingSetSize: number;\n  frontierSize: number;\n  durationMs: number;\n}\n\nexport interface DeepRecallResult {\n  /** false only for backend failure — NEVER conflated with empty (§22). */\n  ok: boolean;\n  error?: \"backend_unavailable\" | \"timeout\" | \"disabled\";\n  entries: DeepRecallEntry[];\n  trace: DeepRecallTraceStep[];\n}\n\nexport interface DeepRecallGraphSnapshot {\n  nodes: AbstractionNode[];\n  anchors: CueAnchor[];\n}\n\nexport interface DeepRecallSeedHit {\n  memoryId: string;\n  score: number;\n}\n\nexport type DeepRecallSeedResult =\n  | { ok: true; results: DeepRecallSeedHit[] }\n  | { ok: false; error: \"backend_unavailable\" };\n\nexport interface DeepRecallMemoryView {\n  memoryId: string;\n  content: string;\n  active: boolean;\n}\n\nexport interface DeepRecallDeps {\n  config: DeepRecallConfig;\n  /** QMD (or equivalent) seed search. A thrown error means backend failure. */\n  searchSeed(query: string, limit: number): Promise<DeepRecallSeedHit[]>;\n  /** Nodes + anchors, loaded once per invocation. */\n  loadGraph(): Promise<DeepRecallGraphSnapshot>;\n  /** Namespace-scoped memory-by-id read; null when absent from the caller's namespace (§30). */\n  loadMemory(memoryId: string): Promise<DeepRecallMemoryView | null>;\n  /**\n   * Raw policy LLM output (JSON text); null when the call failed. The\n   * per-call timeout already spans both LLM legs (issue #2915).\n   */\n  callPolicy(statePrompt: string, timeoutMs: number): Promise<string | null>;\n  /**\n   * Cancellation from the transport (MCP tools/call cancelled, HTTP client\n   * disconnected — issue #2915). Checked before every step and raced against\n   * every dependency call; an abort surfaces as a standard AbortError, which\n   * both transports already translate (silently end the dead socket / rethrow\n   * the cancellation) instead of a partial `ok: true` result.\n   */\n  signal?: AbortSignal;\n  nowMs?(): number;\n}\n\nconst PolicyActionSchema = z.object({\n  action: z.enum([\"REFINE\", \"EXPAND\", \"STOP\"]),\n  refinedQuery: z.string().optional().nullable(),\n  expandNodeIds: z.array(z.string()).optional().nullable(),\n  reason: z.string(),\n});\n\ntype PolicyAction = z.infer<typeof PolicyActionSchema>;\n\nconst MAX_SOURCE_MEMORY_IDS_PER_NODE = 5;\nconst EXPAND_SCORE_INHERITANCE = 0.8;\nconst STATE_WORKING_SET_ENTRIES = 12;\nconst STATE_ENTRY_SNIPPET_CHARS = 200;\n\n/** Thrown when the shared whole-invocation deadline expires mid-await. */\nclass DeepRecallDeadlineExceeded extends Error {\n  constructor() {\n    super(\"deep recall total timeout reached\");\n  }\n}\n\n/**\n * Race one dependency call against the SHARED whole-invocation deadline AND\n * the transport cancellation signal — one helper, never two nested races\n * (issue #2915: an early abort return that abandons an already-started\n * deadline timer leaves its eventual rejection unhandled).\n *\n * `deadlineMs` is an absolute instant computed once per invocation, so every\n * await subtracts elapsed time instead of restarting the budget, and a stalled\n * seed search, graph load, or memory read can no longer outlive the documented\n * `totalTimeoutMs` just because the deadline is only *checked* between steps.\n * An infinite deadline (`totalTimeoutMs: 0`, a documented disable value) races\n * only the signal — no timer. The timer stays REFERENCED: it is the only thing\n * keeping the loop alive when the awaited dependency never settles. Every\n * arm is cleared in the `finally`, whichever wins.\n */\nasync function guardCall<T>(\n  work: Promise<T>,\n  deadlineMs: number,\n  signal: AbortSignal | undefined,\n  now: () => number,\n): Promise<T> {\n  if (signal?.aborted) throw abortError(\"deep recall aborted\");\n  if (!Number.isFinite(deadlineMs)) {\n    return await raceAbort(work, signal, \"deep recall aborted\");\n  }\n  const remaining = deadlineMs - now();\n  if (remaining <= 0) throw new DeepRecallDeadlineExceeded();\n  const expiry = Promise.withResolvers<never>();\n  const timer = setTimeout(() => expiry.reject(new DeepRecallDeadlineExceeded()), remaining);\n  let onAbort: (() => void) | undefined;\n  try {\n    const racers: Promise<T | never>[] = [work, expiry.promise];\n    if (signal) {\n      racers.push(\n        new Promise<never>((_resolve, reject) => {\n          onAbort = () => reject(abortError(\"deep recall aborted\"));\n          signal.addEventListener(\"abort\", onAbort, { once: true });\n        }),\n      );\n    }\n    return await Promise.race(racers);\n  } finally {\n    clearTimeout(timer);\n    if (signal && onAbort) signal.removeEventListener(\"abort\", onAbort);\n  }\n}\n\nfunction parsePolicyOutput(raw: string | null): PolicyAction | null {\n  if (raw === null) return null;\n  const candidates = [stripCodeFences(raw), ...extractJsonCandidates(raw)];\n  for (const candidate of candidates) {\n    if (candidate.trim().length === 0) continue;\n    try {\n      const parsed = PolicyActionSchema.safeParse(JSON.parse(candidate));\n      if (parsed.success) return parsed.data;\n    } catch {\n      // try the next candidate\n    }\n  }\n  return null;\n}\n\ninterface WorkingEntry extends DeepRecallEntry {\n  content: string;\n}\n\nfunction mergeIntoWorkingSet(\n  workingSet: Map<string, WorkingEntry>,\n  hits: readonly DeepRecallSeedHit[],\n  origin: \"seed\" | \"refine\",\n  contentFor: (memoryId: string) => string\n): void {\n  for (const hit of hits) {\n    if (typeof hit.memoryId !== \"string\" || hit.memoryId.length === 0) continue;\n    if (typeof hit.score !== \"number\" || !Number.isFinite(hit.score)) continue;\n    const existing = workingSet.get(hit.memoryId);\n    // Duplicates keep the higher score and the earlier origin (§13: one\n    // content form, one merge rule, everywhere).\n    if (existing && existing.score >= hit.score) continue;\n    workingSet.set(hit.memoryId, {\n      memoryId: hit.memoryId,\n      content: contentFor(hit.memoryId),\n      score: hit.score,\n      origin: existing ? existing.origin : origin,\n      ...(existing?.viaAnchor ? { viaAnchor: existing.viaAnchor } : {}),\n    });\n  }\n}\n\ninterface FrontierIndex {\n  memoryIdToNodeIds: Map<string, string[]>;\n  nodeIdToNode: Map<string, AbstractionNode>;\n  nodeIdToAnchorIds: Map<string, string[]>;\n  anchorIdToAnchor: Map<string, CueAnchor>;\n}\n\nfunction buildFrontierIndex(graph: DeepRecallGraphSnapshot): FrontierIndex {\n  const memoryIdToNodeIds = new Map<string, string[]>();\n  const nodeIdToNode = new Map<string, AbstractionNode>();\n  for (const node of graph.nodes) {\n    nodeIdToNode.set(node.nodeId, node);\n    for (const memoryId of node.sourceMemoryIds ?? []) {\n      const list = memoryIdToNodeIds.get(memoryId) ?? [];\n      list.push(node.nodeId);\n      memoryIdToNodeIds.set(memoryId, list);\n    }\n  }\n  const nodeIdToAnchorIds = new Map<string, string[]>();\n  const anchorIdToAnchor = new Map<string, CueAnchor>();\n  for (const anchor of graph.anchors) {\n    anchorIdToAnchor.set(anchor.anchorId, anchor);\n    for (const nodeRef of anchor.nodeRefs) {\n      const list = nodeIdToAnchorIds.get(nodeRef) ?? [];\n      list.push(anchor.anchorId);\n      nodeIdToAnchorIds.set(nodeRef, list);\n    }\n  }\n  return { memoryIdToNodeIds, nodeIdToNode, nodeIdToAnchorIds, anchorIdToAnchor };\n}\n\n/**\n * A candidate node adds nothing when every source memory the EXPAND path would\n * load is already in the working set (or when it has none): offering it as an\n * unretrieved candidate lets the policy burn steps re-expanding a node that can\n * only re-add what is already present.\n */\nfunction nodeAddsNothing(node: AbstractionNode, workingSet: ReadonlyMap<string, WorkingEntry>): boolean {\n  return (node.sourceMemoryIds ?? [])\n    .slice(0, MAX_SOURCE_MEMORY_IDS_PER_NODE)\n    .every((memoryId) => workingSet.has(memoryId));\n}\n\n/**\n * Frontier refresh (after every working-set change): for each working-set\n * memory, anchors whose nodeRefs include a node listing that memory make\n * every OTHER referenced node a frontier candidate. `sharedAnchorCount`\n * counts DISTINCT anchors (issue #2915): one anchor adds one no matter how\n * many working-set memories or nodes reach the candidate through it. Ranked\n * by the shared pure helper (shared-anchor count desc, nodeId asc — total\n * comparator).\n *\n * Nodes in `expandedNodeIds` are dropped: a node EXPAND already followed is\n * not an unretrieved candidate, even when some of its source memories never\n * entered the working set (an inactive or foreign read is skipped), so\n * re-offering it would let the policy spend every remaining step adding\n * nothing.\n */\nfunction refreshFrontier(\n  workingSet: ReadonlyMap<string, WorkingEntry>,\n  graph: FrontierGraph,\n  expandedNodeIds: ReadonlySet<string>\n): DeepRecallFrontierItem[] {\n  const index = graph.index;\n  interface Candidate {\n    nodeId: string;\n    // Distinct shared anchors ONLY (issue #2915): one anchor counts once no\n    // matter how many working-set memories reach the candidate through it,\n    // so a candidate sharing one anchor can never outrank one sharing two.\n    sharedAnchorIds: Set<string>;\n    parentMemoryId: string;\n    parentScore: number;\n    anchorValue: string;\n  }\n  const byNodeId = new Map<string, Candidate>();\n  for (const [memoryId, entry] of workingSet) {\n    for (const nodeId of index.memoryIdToNodeIds.get(memoryId) ?? []) {\n      for (const anchorId of index.nodeIdToAnchorIds.get(nodeId) ?? []) {\n        const anchor = index.anchorIdToAnchor.get(anchorId);\n        if (!anchor) continue;\n        for (const otherNodeRef of anchor.nodeRefs) {\n          if (otherNodeRef === nodeId) continue;\n          if (expandedNodeIds.has(otherNodeRef)) continue;\n          const otherNode = index.nodeIdToNode.get(otherNodeRef);\n          if (!otherNode || nodeAddsNothing(otherNode, workingSet)) continue;\n          const current = byNodeId.get(otherNodeRef);\n          if (current === undefined) {\n            byNodeId.set(otherNodeRef, {\n              nodeId: otherNodeRef,\n              sharedAnchorIds: new Set([anchorId]),\n              parentMemoryId: memoryId,\n              parentScore: entry.score,\n              anchorValue: anchor.anchorValue,\n            });\n          } else {\n            current.sharedAnchorIds.add(anchorId);\n            if (entry.score > current.parentScore) {\n              current.parentMemoryId = memoryId;\n              current.parentScore = entry.score;\n              current.anchorValue = anchor.anchorValue;\n            }\n          }\n        }\n      }\n    }\n  }\n  const ranked = rankDeepRecallFrontier(\n    [...byNodeId.values()].map((candidate) => ({\n      nodeId: candidate.nodeId,\n      sharedAnchorCount: candidate.sharedAnchorIds.size,\n    })),\n  );\n  return ranked.flatMap((rankedCandidate) => {\n    const candidate = byNodeId.get(rankedCandidate.nodeId);\n    const node = index.nodeIdToNode.get(rankedCandidate.nodeId);\n    if (!candidate || !node) return [];\n    return [\n      {\n        nodeId: candidate.nodeId,\n        title: node.title,\n        reason: `shares anchor \"${candidate.anchorValue}\" with ${candidate.parentMemoryId}`,\n        sharedAnchorCount: rankedCandidate.sharedAnchorCount,\n        parentMemoryId: candidate.parentMemoryId,\n        parentScore: candidate.parentScore,\n        anchorValue: candidate.anchorValue,\n      },\n    ];\n  });\n}\n\ninterface FrontierGraph {\n  index: FrontierIndex;\n}\n\n\nfunction renderStatePrompt(input: {\n  query: string;\n  workingSet: ReadonlyMap<string, WorkingEntry>;\n  frontier: readonly DeepRecallFrontierItem[];\n  stepsRemaining: number;\n}): string {\n  const lines: string[] = [\n    \"You are guiding a multi-hop memory retrieval loop. Pick exactly one action.\",\n    \"REFINE when the retrieved memories look misaligned with the question (return a rewritten query).\",\n    \"EXPAND to follow named frontier nodes that plausibly hold the answer (return their nodeIds).\",\n    \"STOP when the working set is sufficient to answer.\",\n    \"\",\n    `QUESTION: ${input.query}`,\n    `STEPS REMAINING: ${input.stepsRemaining}`,\n    \"\",\n    \"WORKING SET (retrieved memories):\",\n  ];\n  const entries = [...input.workingSet.values()]\n    .sort((a, b) => b.score - a.score || compareDeterministicStrings(a.memoryId, b.memoryId))\n    .slice(0, STATE_WORKING_SET_ENTRIES);\n  if (entries.length === 0) lines.push(\"(empty)\");\n  for (const entry of entries) {\n    const snippet = entry.content.slice(0, STATE_ENTRY_SNIPPET_CHARS).replace(/\\s+/g, \" \");\n    lines.push(`- ${entry.memoryId} (score=${entry.score.toFixed(3)}, origin=${entry.origin}): ${snippet}`);\n  }\n  lines.push(\"\", \"FRONTIER (anchor-linked candidates not yet retrieved):\");\n  if (input.frontier.length === 0) lines.push(\"(empty)\");\n  for (const item of input.frontier) {\n    lines.push(`- ${item.nodeId}: ${item.title} — ${item.reason}`);\n  }\n  lines.push(\n    \"\",\n    'Respond with JSON only: {\"action\":\"REFINE\",\"refinedQuery\":\"...\",\"reason\":\"...\"}',\n    'or {\"action\":\"EXPAND\",\"expandNodeIds\":[\"...\"],\"reason\":\"...\"}',\n    'or {\"action\":\"STOP\",\"reason\":\"...\"}',\n  );\n  return lines.join(\"\\n\");\n}\n\nfunction finalRank(entries: readonly DeepRecallEntry[]): DeepRecallEntry[] {\n  return [...entries].sort(\n    (a, b) => b.score - a.score || compareDeterministicStrings(a.memoryId, b.memoryId)\n  );\n}\n\n/**\n * The budgeted loop. Seed (QMD + graph) -> policy steps -> ranked, capped\n * output. Only a SEED backend failure returns `ok: false`; timeout and\n * budget exhaustion mid-loop return the partial working set with\n * `ok: true` and a BUDGET_EXHAUSTED trace tail.\n */\nexport async function runBudgetedDeepRecall(deps: DeepRecallDeps, query: string): Promise<DeepRecallResult> {\n  const cfg = deps.config;\n  const now = deps.nowMs ?? Date.now;\n  const startedMs = now();\n  const deadlineMs = cfg.totalTimeoutMs > 0 ? startedMs + cfg.totalTimeoutMs : Number.POSITIVE_INFINITY;\n  // Every dependency await races BOTH bounds: the shared whole-invocation\n  // deadline and the transport cancellation signal (issue #2915). An abort\n  // propagates as a standard AbortError — never as ok:false backend failure\n  // and never as a partial result — so each transport applies its own\n  // cancelled-response semantics.\n  const guarded = <T>(work: Promise<T>): Promise<T> =>\n    guardCall(work, deadlineMs, deps.signal, now);\n\n\n  const trace: DeepRecallTraceStep[] = [];\n  const contentCache = new Map<string, string>();\n  const contentFor = (memoryId: string): string => contentCache.get(memoryId) ?? \"\";\n  const workingSet = new Map<string, WorkingEntry>();\n  let graph: FrontierGraph = { index: buildFrontierIndex({ nodes: [], anchors: [] }) };\n  // Nodes already followed by EXPAND leave the frontier for good.\n  const expandedNodeIds = new Set<string>();\n  /**\n   * Hydrate one working-set entry from `loadMemory`, DROPPING it when the read\n   * is missing or reports a non-active memory: QMD can still index a memory\n   * whose governance status moved out of the active set, and hydrating it\n   * would surface content the active-set check excluded.\n   */\n  const hydrateOrDrop = async (memoryId: string): Promise<void> => {\n    const memory = await guarded(deps.loadMemory(memoryId));\n    if (!memory || !memory.active) {\n      workingSet.delete(memoryId);\n      contentCache.delete(memoryId);\n      return;\n    }\n    contentCache.set(memoryId, memory.content);\n    const entry = workingSet.get(memoryId);\n    if (entry) entry.content = memory.content;\n  };\n  // Pre-policy work (seed search, graph load, seed hydration) is bounded by the\n  // SAME deadline as the policy calls; exhausting it here yields the partial\n  // working set rather than blocking the later check from ever running.\n  let exhaustedDetail: string | null = null;\n  try {\n    throwIfAborted(deps.signal, \"deep recall aborted\");\n    const seedHits = await guarded(deps.searchSeed(query, cfg.maxResults));\n    mergeIntoWorkingSet(workingSet, seedHits, \"seed\", contentFor);\n  } catch (err) {\n    if (isAbortError(err)) throw err;\n    if (!(err instanceof DeepRecallDeadlineExceeded)) {\n      // Seed backend failure is the only ok:false path (§22: an empty index\n      // proceeds; a thrown search does not).\n      return { ok: false, error: \"backend_unavailable\", entries: [], trace: [] };\n    }\n    exhaustedDetail = \"total timeout reached during seed search\";\n  }\n  if (exhaustedDetail === null) {\n    try {\n      graph = { index: buildFrontierIndex(await guarded(deps.loadGraph())) };\n      // Seed hydration also enforces the active set: a stale or non-active\n      // QMD hit leaves the working set instead of being hydrated in place.\n      for (const memoryId of [...workingSet.keys()]) {\n        await hydrateOrDrop(memoryId);\n      }\n    } catch (err) {\n      if (isAbortError(err)) throw err;\n      if (!(err instanceof DeepRecallDeadlineExceeded)) throw err;\n      exhaustedDetail = \"total timeout reached loading the graph or hydrating seeds\";\n    }\n  }\n\n  let frontier = refreshFrontier(workingSet, graph, expandedNodeIds);\n  let currentQuery = query;\n  let refinesUsed = 0;\n\n  const pushStep = (step: number, action: DeepRecallTraceStep[\"action\"], detail: string, stepStartMs: number): void => {\n    trace.push({\n      step,\n      action,\n      detail,\n      workingSetSize: workingSet.size,\n      frontierSize: frontier.length,\n      durationMs: Math.max(0, now() - stepStartMs),\n    });\n  };\n\n  if (exhaustedDetail !== null) {\n    // Pre-policy work already spent the whole-invocation budget: report the\n    // partial working set (ok:true, §22) instead of starting a policy call\n    // that cannot finish inside the deadline.\n    pushStep(0, \"BUDGET_EXHAUSTED\", exhaustedDetail, startedMs);\n  } else if (cfg.maxSteps <= 0) {\n    // `maxSteps: 0` is a documented disable value (§33): seed-only retrieval,\n    // with no policy call at all. The zero check dominates the step threshold\n    // instead of relying on the loop condition falling through.\n    pushStep(0, \"STOP\", \"policy loop disabled (maxSteps=0)\", startedMs);\n  }\n  let step = 0;\n  try {\n    while (exhaustedDetail === null && cfg.maxSteps > 0 && step < cfg.maxSteps) {\n      const stepStartMs = now();\n      throwIfAborted(deps.signal, \"deep recall aborted\");\n      if (now() >= deadlineMs) {\n        pushStep(step, \"BUDGET_EXHAUSTED\", \"total timeout reached before policy call\", stepStartMs);\n        break;\n      }\n      // Two independent axes bound the policy call: its own per-step timeout and\n      // whatever is left of the shared deadline. `stepTimeoutMs: 0` disables only\n      // its own axis (§33) — a finite total budget still applies, so the call can\n      // never outlive `totalTimeoutMs`. `timeoutMs: 0` reaches the policy only\n      // when BOTH axes are disabled.\n      const stepBudgetMs = cfg.stepTimeoutMs > 0 ? cfg.stepTimeoutMs : Number.POSITIVE_INFINITY;\n      const effectiveBudgetMs = Math.min(stepBudgetMs, deadlineMs - now());\n      const timeoutMs = Number.isFinite(effectiveBudgetMs) ? Math.max(1, effectiveBudgetMs) : 0;\n      const raw = await guarded(\n        deps.callPolicy(\n          renderStatePrompt({ query: currentQuery, workingSet, frontier, stepsRemaining: cfg.maxSteps - step }),\n          timeoutMs\n        )\n      );\n      const parsed = parsePolicyOutput(raw);\n      if (parsed === null) {\n        pushStep(step, \"STOP\", \"invalid_policy_output\", stepStartMs);\n        break;\n      }\n      if (parsed.action === \"STOP\") {\n        pushStep(step, \"STOP\", parsed.reason || \"policy stop\", stepStartMs);\n        break;\n      }\n      if (parsed.action === \"REFINE\") {\n        const rewrite = validateRefineRewrite({\n          currentQuery,\n          refinedQuery: parsed.refinedQuery ?? null,\n          refinesUsed,\n        });\n        if (!rewrite.ok) {\n          pushStep(step, \"STOP\", rewrite.reason, stepStartMs);\n          break;\n        }\n        currentQuery = rewrite.refinedQuery;\n        refinesUsed += 1;\n        try {\n          const refinedHits = await guarded(deps.searchSeed(currentQuery, cfg.maxResults));\n          mergeIntoWorkingSet(workingSet, refinedHits, \"refine\", contentFor);\n          for (const hit of refinedHits) {\n            if (workingSet.has(hit.memoryId) && !contentCache.has(hit.memoryId)) {\n              await hydrateOrDrop(hit.memoryId);\n            }\n          }\n        } catch (err) {\n          // Re-search failure mid-loop is partial, not fatal (§22): the loop\n          // keeps what it has and the policy decides the next move. Deadline\n          // expiry and cancellation are NOT partial failures — they end the\n          // invocation.\n          if (err instanceof DeepRecallDeadlineExceeded || isAbortError(err)) throw err;\n        }\n        frontier = refreshFrontier(workingSet, graph, expandedNodeIds);\n        pushStep(step, \"REFINE\", currentQuery, stepStartMs);\n        step += 1;\n        continue;\n      }\n      // EXPAND. A configured ceiling of 0 is a documented no-op limit (§33):\n      // the action is honored but selects nothing.\n      const selection =\n        cfg.maxExpandPerStep <= 0\n          ? { ok: true as const, nodeIds: [] as string[], truncated: false }\n          : selectExpandNodeIds({\n              frontierIds: frontier.map((item) => item.nodeId),\n              requestedIds: parsed.expandNodeIds ?? [],\n              maxExpandPerStep: cfg.maxExpandPerStep,\n            });\n      if (!selection.ok) {\n        pushStep(step, \"STOP\", \"invalid_policy_output\", stepStartMs);\n        break;\n      }\n      const chosen = new Map(frontier.map((item) => [item.nodeId, item]));\n      for (const nodeId of selection.nodeIds) {\n        const item = chosen.get(nodeId);\n        const node = graph.index.nodeIdToNode.get(nodeId);\n        if (!item || !node) continue;\n        for (const memoryId of (node.sourceMemoryIds ?? []).slice(0, MAX_SOURCE_MEMORY_IDS_PER_NODE)) {\n          if (workingSet.has(memoryId)) continue;\n          const memory = await guarded(deps.loadMemory(memoryId));\n          // Only active memories enter the working set (§41); a null read\n          // (foreign namespace, §30) skips the same way.\n          if (!memory || !memory.active) continue;\n          workingSet.set(memoryId, {\n            memoryId,\n            content: memory.content,\n            score: item.parentScore * EXPAND_SCORE_INHERITANCE,\n            origin: \"expand\",\n            viaAnchor: item.anchorValue,\n          });\n          contentCache.set(memoryId, memory.content);\n        }\n        expandedNodeIds.add(nodeId);\n      }\n      frontier = refreshFrontier(workingSet, graph, expandedNodeIds);\n      pushStep(step, \"EXPAND\", selection.nodeIds.join(\", \"), stepStartMs);\n      step += 1;\n    }\n  } catch (err) {\n    if (!(err instanceof DeepRecallDeadlineExceeded)) throw err;\n    // A dependency call inside a step outran the shared deadline: the per-step\n    // timeout is not the wall clock, so record exhaustion and keep the partial\n    // working set. durationMs spans the whole invocation.\n    pushStep(step, \"BUDGET_EXHAUSTED\", \"total timeout reached mid-step\", startedMs);\n  }\n\n  if (cfg.maxSteps > 0 && step >= cfg.maxSteps && trace[trace.length - 1]?.action !== \"STOP\") {\n    pushStep(step, \"BUDGET_EXHAUSTED\", \"maxSteps policy calls reached\", startedMs);\n    // durationMs for the exhaustion marker is the whole invocation so far.\n    const marker = trace[trace.length - 1];\n    if (marker) marker.durationMs = Math.max(0, now() - startedMs);\n  }\n\n  // Final output carries full content; the 200-char trim is state rendering only.\n  const entries = finalRank([...workingSet.values()]).map((entry) => ({ ...entry }));\n  return {\n    ok: true,\n    entries: cfg.maxResults > 0 ? entries.slice(0, cfg.maxResults) : [],\n    trace,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAeA,SAAS,SAAS;AAkGlB,IAAM,qBAAqB,EAAE,OAAO;AAAA,EAClC,QAAQ,EAAE,KAAK,CAAC,UAAU,UAAU,MAAM,CAAC;AAAA,EAC3C,cAAc,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,EAC7C,eAAe,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,SAAS;AAAA,EACvD,QAAQ,EAAE,OAAO;AACnB,CAAC;AAID,IAAM,iCAAiC;AACvC,IAAM,2BAA2B;AACjC,IAAM,4BAA4B;AAClC,IAAM,4BAA4B;AAGlC,IAAM,6BAAN,cAAyC,MAAM;AAAA,EAC7C,cAAc;AACZ,UAAM,mCAAmC;AAAA,EAC3C;AACF;AAiBA,eAAe,UACb,MACA,YACA,QACA,KACY;AACZ,MAAI,QAAQ,QAAS,OAAM,WAAW,qBAAqB;AAC3D,MAAI,CAAC,OAAO,SAAS,UAAU,GAAG;AAChC,WAAO,MAAM,UAAU,MAAM,QAAQ,qBAAqB;AAAA,EAC5D;AACA,QAAM,YAAY,aAAa,IAAI;AACnC,MAAI,aAAa,EAAG,OAAM,IAAI,2BAA2B;AACzD,QAAM,SAAS,QAAQ,cAAqB;AAC5C,QAAM,QAAQ,WAAW,MAAM,OAAO,OAAO,IAAI,2BAA2B,CAAC,GAAG,SAAS;AACzF,MAAI;AACJ,MAAI;AACF,UAAM,SAA+B,CAAC,MAAM,OAAO,OAAO;AAC1D,QAAI,QAAQ;AACV,aAAO;AAAA,QACL,IAAI,QAAe,CAAC,UAAU,WAAW;AACvC,oBAAU,MAAM,OAAO,WAAW,qBAAqB,CAAC;AACxD,iBAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAAA,QAC1D,CAAC;AAAA,MACH;AAAA,IACF;AACA,WAAO,MAAM,QAAQ,KAAK,MAAM;AAAA,EAClC,UAAE;AACA,iBAAa,KAAK;AAClB,QAAI,UAAU,QAAS,QAAO,oBAAoB,SAAS,OAAO;AAAA,EACpE;AACF;AAEA,SAAS,kBAAkB,KAAyC;AAClE,MAAI,QAAQ,KAAM,QAAO;AACzB,QAAM,aAAa,CAAC,gBAAgB,GAAG,GAAG,GAAG,sBAAsB,GAAG,CAAC;AACvE,aAAW,aAAa,YAAY;AAClC,QAAI,UAAU,KAAK,EAAE,WAAW,EAAG;AACnC,QAAI;AACF,YAAM,SAAS,mBAAmB,UAAU,KAAK,MAAM,SAAS,CAAC;AACjE,UAAI,OAAO,QAAS,QAAO,OAAO;AAAA,IACpC,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAMA,SAAS,oBACP,YACA,MACA,QACA,YACM;AACN,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,IAAI,aAAa,YAAY,IAAI,SAAS,WAAW,EAAG;AACnE,QAAI,OAAO,IAAI,UAAU,YAAY,CAAC,OAAO,SAAS,IAAI,KAAK,EAAG;AAClE,UAAM,WAAW,WAAW,IAAI,IAAI,QAAQ;AAG5C,QAAI,YAAY,SAAS,SAAS,IAAI,MAAO;AAC7C,eAAW,IAAI,IAAI,UAAU;AAAA,MAC3B,UAAU,IAAI;AAAA,MACd,SAAS,WAAW,IAAI,QAAQ;AAAA,MAChC,OAAO,IAAI;AAAA,MACX,QAAQ,WAAW,SAAS,SAAS;AAAA,MACrC,GAAI,UAAU,YAAY,EAAE,WAAW,SAAS,UAAU,IAAI,CAAC;AAAA,IACjE,CAAC;AAAA,EACH;AACF;AASA,SAAS,mBAAmB,OAA+C;AACzE,QAAM,oBAAoB,oBAAI,IAAsB;AACpD,QAAM,eAAe,oBAAI,IAA6B;AACtD,aAAW,QAAQ,MAAM,OAAO;AAC9B,iBAAa,IAAI,KAAK,QAAQ,IAAI;AAClC,eAAW,YAAY,KAAK,mBAAmB,CAAC,GAAG;AACjD,YAAM,OAAO,kBAAkB,IAAI,QAAQ,KAAK,CAAC;AACjD,WAAK,KAAK,KAAK,MAAM;AACrB,wBAAkB,IAAI,UAAU,IAAI;AAAA,IACtC;AAAA,EACF;AACA,QAAM,oBAAoB,oBAAI,IAAsB;AACpD,QAAM,mBAAmB,oBAAI,IAAuB;AACpD,aAAW,UAAU,MAAM,SAAS;AAClC,qBAAiB,IAAI,OAAO,UAAU,MAAM;AAC5C,eAAW,WAAW,OAAO,UAAU;AACrC,YAAM,OAAO,kBAAkB,IAAI,OAAO,KAAK,CAAC;AAChD,WAAK,KAAK,OAAO,QAAQ;AACzB,wBAAkB,IAAI,SAAS,IAAI;AAAA,IACrC;AAAA,EACF;AACA,SAAO,EAAE,mBAAmB,cAAc,mBAAmB,iBAAiB;AAChF;AAQA,SAAS,gBAAgB,MAAuB,YAAwD;AACtG,UAAQ,KAAK,mBAAmB,CAAC,GAC9B,MAAM,GAAG,8BAA8B,EACvC,MAAM,CAAC,aAAa,WAAW,IAAI,QAAQ,CAAC;AACjD;AAiBA,SAAS,gBACP,YACA,OACA,iBAC0B;AAC1B,QAAM,QAAQ,MAAM;AAWpB,QAAM,WAAW,oBAAI,IAAuB;AAC5C,aAAW,CAAC,UAAU,KAAK,KAAK,YAAY;AAC1C,eAAW,UAAU,MAAM,kBAAkB,IAAI,QAAQ,KAAK,CAAC,GAAG;AAChE,iBAAW,YAAY,MAAM,kBAAkB,IAAI,MAAM,KAAK,CAAC,GAAG;AAChE,cAAM,SAAS,MAAM,iBAAiB,IAAI,QAAQ;AAClD,YAAI,CAAC,OAAQ;AACb,mBAAW,gBAAgB,OAAO,UAAU;AAC1C,cAAI,iBAAiB,OAAQ;AAC7B,cAAI,gBAAgB,IAAI,YAAY,EAAG;AACvC,gBAAM,YAAY,MAAM,aAAa,IAAI,YAAY;AACrD,cAAI,CAAC,aAAa,gBAAgB,WAAW,UAAU,EAAG;AAC1D,gBAAM,UAAU,SAAS,IAAI,YAAY;AACzC,cAAI,YAAY,QAAW;AACzB,qBAAS,IAAI,cAAc;AAAA,cACzB,QAAQ;AAAA,cACR,iBAAiB,oBAAI,IAAI,CAAC,QAAQ,CAAC;AAAA,cACnC,gBAAgB;AAAA,cAChB,aAAa,MAAM;AAAA,cACnB,aAAa,OAAO;AAAA,YACtB,CAAC;AAAA,UACH,OAAO;AACL,oBAAQ,gBAAgB,IAAI,QAAQ;AACpC,gBAAI,MAAM,QAAQ,QAAQ,aAAa;AACrC,sBAAQ,iBAAiB;AACzB,sBAAQ,cAAc,MAAM;AAC5B,sBAAQ,cAAc,OAAO;AAAA,YAC/B;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS;AAAA,IACb,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,eAAe;AAAA,MACzC,QAAQ,UAAU;AAAA,MAClB,mBAAmB,UAAU,gBAAgB;AAAA,IAC/C,EAAE;AAAA,EACJ;AACA,SAAO,OAAO,QAAQ,CAAC,oBAAoB;AACzC,UAAM,YAAY,SAAS,IAAI,gBAAgB,MAAM;AACrD,UAAM,OAAO,MAAM,aAAa,IAAI,gBAAgB,MAAM;AAC1D,QAAI,CAAC,aAAa,CAAC,KAAM,QAAO,CAAC;AACjC,WAAO;AAAA,MACL;AAAA,QACE,QAAQ,UAAU;AAAA,QAClB,OAAO,KAAK;AAAA,QACZ,QAAQ,kBAAkB,UAAU,WAAW,UAAU,UAAU,cAAc;AAAA,QACjF,mBAAmB,gBAAgB;AAAA,QACnC,gBAAgB,UAAU;AAAA,QAC1B,aAAa,UAAU;AAAA,QACvB,aAAa,UAAU;AAAA,MACzB;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAOA,SAAS,kBAAkB,OAKhB;AACT,QAAM,QAAkB;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,aAAa,MAAM,KAAK;AAAA,IACxB,oBAAoB,MAAM,cAAc;AAAA,IACxC;AAAA,IACA;AAAA,EACF;AACA,QAAM,UAAU,CAAC,GAAG,MAAM,WAAW,OAAO,CAAC,EAC1C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,4BAA4B,EAAE,UAAU,EAAE,QAAQ,CAAC,EACvF,MAAM,GAAG,yBAAyB;AACrC,MAAI,QAAQ,WAAW,EAAG,OAAM,KAAK,SAAS;AAC9C,aAAW,SAAS,SAAS;AAC3B,UAAM,UAAU,MAAM,QAAQ,MAAM,GAAG,yBAAyB,EAAE,QAAQ,QAAQ,GAAG;AACrF,UAAM,KAAK,KAAK,MAAM,QAAQ,WAAW,MAAM,MAAM,QAAQ,CAAC,CAAC,YAAY,MAAM,MAAM,MAAM,OAAO,EAAE;AAAA,EACxG;AACA,QAAM,KAAK,IAAI,wDAAwD;AACvE,MAAI,MAAM,SAAS,WAAW,EAAG,OAAM,KAAK,SAAS;AACrD,aAAW,QAAQ,MAAM,UAAU;AACjC,UAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,KAAK,WAAM,KAAK,MAAM,EAAE;AAAA,EAC/D;AACA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,UAAU,SAAwD;AACzE,SAAO,CAAC,GAAG,OAAO,EAAE;AAAA,IAClB,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,4BAA4B,EAAE,UAAU,EAAE,QAAQ;AAAA,EACnF;AACF;AAQA,eAAsB,sBAAsB,MAAsB,OAA0C;AAC1G,QAAM,MAAM,KAAK;AACjB,QAAM,MAAM,KAAK,SAAS,KAAK;AAC/B,QAAM,YAAY,IAAI;AACtB,QAAM,aAAa,IAAI,iBAAiB,IAAI,YAAY,IAAI,iBAAiB,OAAO;AAMpF,QAAM,UAAU,CAAI,SAClB,UAAU,MAAM,YAAY,KAAK,QAAQ,GAAG;AAG9C,QAAM,QAA+B,CAAC;AACtC,QAAM,eAAe,oBAAI,IAAoB;AAC7C,QAAM,aAAa,CAAC,aAA6B,aAAa,IAAI,QAAQ,KAAK;AAC/E,QAAM,aAAa,oBAAI,IAA0B;AACjD,MAAI,QAAuB,EAAE,OAAO,mBAAmB,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC,EAAE;AAEnF,QAAM,kBAAkB,oBAAI,IAAY;AAOxC,QAAM,gBAAgB,OAAO,aAAoC;AAC/D,UAAM,SAAS,MAAM,QAAQ,KAAK,WAAW,QAAQ,CAAC;AACtD,QAAI,CAAC,UAAU,CAAC,OAAO,QAAQ;AAC7B,iBAAW,OAAO,QAAQ;AAC1B,mBAAa,OAAO,QAAQ;AAC5B;AAAA,IACF;AACA,iBAAa,IAAI,UAAU,OAAO,OAAO;AACzC,UAAM,QAAQ,WAAW,IAAI,QAAQ;AACrC,QAAI,MAAO,OAAM,UAAU,OAAO;AAAA,EACpC;AAIA,MAAI,kBAAiC;AACrC,MAAI;AACF,mBAAe,KAAK,QAAQ,qBAAqB;AACjD,UAAM,WAAW,MAAM,QAAQ,KAAK,WAAW,OAAO,IAAI,UAAU,CAAC;AACrE,wBAAoB,YAAY,UAAU,QAAQ,UAAU;AAAA,EAC9D,SAAS,KAAK;AACZ,QAAI,aAAa,GAAG,EAAG,OAAM;AAC7B,QAAI,EAAE,eAAe,6BAA6B;AAGhD,aAAO,EAAE,IAAI,OAAO,OAAO,uBAAuB,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,IAC3E;AACA,sBAAkB;AAAA,EACpB;AACA,MAAI,oBAAoB,MAAM;AAC5B,QAAI;AACF,cAAQ,EAAE,OAAO,mBAAmB,MAAM,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE;AAGrE,iBAAW,YAAY,CAAC,GAAG,WAAW,KAAK,CAAC,GAAG;AAC7C,cAAM,cAAc,QAAQ;AAAA,MAC9B;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,aAAa,GAAG,EAAG,OAAM;AAC7B,UAAI,EAAE,eAAe,4BAA6B,OAAM;AACxD,wBAAkB;AAAA,IACpB;AAAA,EACF;AAEA,MAAI,WAAW,gBAAgB,YAAY,OAAO,eAAe;AACjE,MAAI,eAAe;AACnB,MAAI,cAAc;AAElB,QAAM,WAAW,CAACA,OAAc,QAAuC,QAAgB,gBAA8B;AACnH,UAAM,KAAK;AAAA,MACT,MAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA,gBAAgB,WAAW;AAAA,MAC3B,cAAc,SAAS;AAAA,MACvB,YAAY,KAAK,IAAI,GAAG,IAAI,IAAI,WAAW;AAAA,IAC7C,CAAC;AAAA,EACH;AAEA,MAAI,oBAAoB,MAAM;AAI5B,aAAS,GAAG,oBAAoB,iBAAiB,SAAS;AAAA,EAC5D,WAAW,IAAI,YAAY,GAAG;AAI5B,aAAS,GAAG,QAAQ,qCAAqC,SAAS;AAAA,EACpE;AACA,MAAI,OAAO;AACX,MAAI;AACF,WAAO,oBAAoB,QAAQ,IAAI,WAAW,KAAK,OAAO,IAAI,UAAU;AAC1E,YAAM,cAAc,IAAI;AACxB,qBAAe,KAAK,QAAQ,qBAAqB;AACjD,UAAI,IAAI,KAAK,YAAY;AACvB,iBAAS,MAAM,oBAAoB,4CAA4C,WAAW;AAC1F;AAAA,MACF;AAMA,YAAM,eAAe,IAAI,gBAAgB,IAAI,IAAI,gBAAgB,OAAO;AACxE,YAAM,oBAAoB,KAAK,IAAI,cAAc,aAAa,IAAI,CAAC;AACnE,YAAM,YAAY,OAAO,SAAS,iBAAiB,IAAI,KAAK,IAAI,GAAG,iBAAiB,IAAI;AACxF,YAAM,MAAM,MAAM;AAAA,QAChB,KAAK;AAAA,UACH,kBAAkB,EAAE,OAAO,cAAc,YAAY,UAAU,gBAAgB,IAAI,WAAW,KAAK,CAAC;AAAA,UACpG;AAAA,QACF;AAAA,MACF;AACA,YAAM,SAAS,kBAAkB,GAAG;AACpC,UAAI,WAAW,MAAM;AACnB,iBAAS,MAAM,QAAQ,yBAAyB,WAAW;AAC3D;AAAA,MACF;AACA,UAAI,OAAO,WAAW,QAAQ;AAC5B,iBAAS,MAAM,QAAQ,OAAO,UAAU,eAAe,WAAW;AAClE;AAAA,MACF;AACA,UAAI,OAAO,WAAW,UAAU;AAC9B,cAAM,UAAU,sBAAsB;AAAA,UACpC;AAAA,UACA,cAAc,OAAO,gBAAgB;AAAA,UACrC;AAAA,QACF,CAAC;AACD,YAAI,CAAC,QAAQ,IAAI;AACf,mBAAS,MAAM,QAAQ,QAAQ,QAAQ,WAAW;AAClD;AAAA,QACF;AACA,uBAAe,QAAQ;AACvB,uBAAe;AACf,YAAI;AACF,gBAAM,cAAc,MAAM,QAAQ,KAAK,WAAW,cAAc,IAAI,UAAU,CAAC;AAC/E,8BAAoB,YAAY,aAAa,UAAU,UAAU;AACjE,qBAAW,OAAO,aAAa;AAC7B,gBAAI,WAAW,IAAI,IAAI,QAAQ,KAAK,CAAC,aAAa,IAAI,IAAI,QAAQ,GAAG;AACnE,oBAAM,cAAc,IAAI,QAAQ;AAAA,YAClC;AAAA,UACF;AAAA,QACF,SAAS,KAAK;AAKZ,cAAI,eAAe,8BAA8B,aAAa,GAAG,EAAG,OAAM;AAAA,QAC5E;AACA,mBAAW,gBAAgB,YAAY,OAAO,eAAe;AAC7D,iBAAS,MAAM,UAAU,cAAc,WAAW;AAClD,gBAAQ;AACR;AAAA,MACF;AAGA,YAAM,YACJ,IAAI,oBAAoB,IACpB,EAAE,IAAI,MAAe,SAAS,CAAC,GAAe,WAAW,MAAM,IAC/D,oBAAoB;AAAA,QAClB,aAAa,SAAS,IAAI,CAAC,SAAS,KAAK,MAAM;AAAA,QAC/C,cAAc,OAAO,iBAAiB,CAAC;AAAA,QACvC,kBAAkB,IAAI;AAAA,MACxB,CAAC;AACP,UAAI,CAAC,UAAU,IAAI;AACjB,iBAAS,MAAM,QAAQ,yBAAyB,WAAW;AAC3D;AAAA,MACF;AACA,YAAM,SAAS,IAAI,IAAI,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAClE,iBAAW,UAAU,UAAU,SAAS;AACtC,cAAM,OAAO,OAAO,IAAI,MAAM;AAC9B,cAAM,OAAO,MAAM,MAAM,aAAa,IAAI,MAAM;AAChD,YAAI,CAAC,QAAQ,CAAC,KAAM;AACpB,mBAAW,aAAa,KAAK,mBAAmB,CAAC,GAAG,MAAM,GAAG,8BAA8B,GAAG;AAC5F,cAAI,WAAW,IAAI,QAAQ,EAAG;AAC9B,gBAAM,SAAS,MAAM,QAAQ,KAAK,WAAW,QAAQ,CAAC;AAGtD,cAAI,CAAC,UAAU,CAAC,OAAO,OAAQ;AAC/B,qBAAW,IAAI,UAAU;AAAA,YACvB;AAAA,YACA,SAAS,OAAO;AAAA,YAChB,OAAO,KAAK,cAAc;AAAA,YAC1B,QAAQ;AAAA,YACR,WAAW,KAAK;AAAA,UAClB,CAAC;AACD,uBAAa,IAAI,UAAU,OAAO,OAAO;AAAA,QAC3C;AACA,wBAAgB,IAAI,MAAM;AAAA,MAC5B;AACA,iBAAW,gBAAgB,YAAY,OAAO,eAAe;AAC7D,eAAS,MAAM,UAAU,UAAU,QAAQ,KAAK,IAAI,GAAG,WAAW;AAClE,cAAQ;AAAA,IACV;AAAA,EACF,SAAS,KAAK;AACZ,QAAI,EAAE,eAAe,4BAA6B,OAAM;AAIxD,aAAS,MAAM,oBAAoB,kCAAkC,SAAS;AAAA,EAChF;AAEA,MAAI,IAAI,WAAW,KAAK,QAAQ,IAAI,YAAY,MAAM,MAAM,SAAS,CAAC,GAAG,WAAW,QAAQ;AAC1F,aAAS,MAAM,oBAAoB,iCAAiC,SAAS;AAE7E,UAAM,SAAS,MAAM,MAAM,SAAS,CAAC;AACrC,QAAI,OAAQ,QAAO,aAAa,KAAK,IAAI,GAAG,IAAI,IAAI,SAAS;AAAA,EAC/D;AAGA,QAAM,UAAU,UAAU,CAAC,GAAG,WAAW,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,EAAE,GAAG,MAAM,EAAE;AACjF,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,SAAS,IAAI,aAAa,IAAI,QAAQ,MAAM,GAAG,IAAI,UAAU,IAAI,CAAC;AAAA,IAClE;AAAA,EACF;AACF;","names":["step"]}

package/dist/{chunk-ZZUVBZL2.js → chunk-X2QPKLPL.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-PJKTFXE2.js";
 import {
   isSupportPassportPrivateMemory
-} from "./chunk-37CAEC7E.js";
+} from "./chunk-PWPIERBM.js";
 import {
   isHandleToken
 } from "./chunk-JAKIDQB2.js";
@@ -189,4 +189,4 @@ export {
   recallForActiveMemory,
   getMemoryForActiveMemory
 };
-//# sourceMappingURL=chunk-ZZUVBZL2.js.map
+//# sourceMappingURL=chunk-X2QPKLPL.js.map

package/dist/{chunk-RDLPFM7I.js → chunk-XJLTQTAO.js}

@@ -1,6 +1,6 @@
 import {
   parseEntityFile
-} from "./chunk-MVG3KXON.js";
+} from "./chunk-I65KB36L.js";
 import {
   inferMemoryStatus
 } from "./chunk-7RJUVTVF.js";
@@ -253,4 +253,4 @@ export {
   WHO_KNOWS_MCP_TOOLS,
   handleWhoKnowsHttpQuery
 };
-//# sourceMappingURL=chunk-RDLPFM7I.js.map
+//# sourceMappingURL=chunk-XJLTQTAO.js.map

package/dist/{chunk-ZRMMXWYI.js → chunk-YR5QT4SR.js}

@@ -1,6 +1,10 @@
 import {
   gatewayTaskChainOptions
-} from "./chunk-THTF2W7M.js";
+} from "./chunk-TRTLWUDD.js";
+import {
+  isAbortError,
+  throwIfAborted
+} from "./chunk-BTTPKDIL.js";
 
 // src/deep-recall-policy-llm.ts
 var DEEP_RECALL_POLICY_SYSTEM_PROMPT = "You are the retrieval policy for a long-term memory system. Given the question, the current working set of retrieved memories, and the frontier of anchor-linked candidates, choose exactly one action: REFINE (rewrite the query), EXPAND (follow named frontier nodes), or STOP. Respond with JSON only.";
@@ -9,22 +13,37 @@ async function callDeepRecallPolicyLlm(input) {
     { role: "system", content: DEEP_RECALL_POLICY_SYSTEM_PROMPT },
     { role: "user", content: input.statePrompt }
   ];
-  const timeout = input.timeoutMs > 0 ? input.timeoutMs : void 0;
+  const startedAtMs = Date.now();
+  const remainingMs = () => input.timeoutMs > 0 ? input.timeoutMs - (Date.now() - startedAtMs) : void 0;
   const skipLocal = input.config.modelSource === "gateway";
   const gatewayChain = gatewayTaskChainOptions(input.config);
+  const abortMessage = "deep recall policy call aborted";
+  throwIfAborted(input.signal, abortMessage);
   if (input.localLlm && !skipLocal) {
+    const timeout = remainingMs();
+    if (timeout !== void 0 && timeout <= 0) {
+      return null;
+    }
     try {
       const result = await input.localLlm.chatCompletion(messages, {
         temperature: 0.1,
         maxTokens: 1024,
-        ...timeout ? { timeoutMs: timeout } : {},
+        ...timeout !== void 0 ? { timeoutMs: timeout } : {},
         responseFormat: { type: "json_object" },
-        operation: "deep-recall-policy"
+        operation: "deep-recall-policy",
+        ...input.signal ? { signal: input.signal } : {}
       });
       if (result?.content) return result.content;
-    } catch {
+    } catch (err) {
+      if (isAbortError(err)) throw err;
+      throwIfAborted(input.signal, abortMessage);
     }
   }
+  throwIfAborted(input.signal, abortMessage);
+  const remaining = remainingMs();
+  if (remaining !== void 0 && remaining <= 0) {
+    return null;
+  }
   if (input.fallbackLlm) {
     try {
       const result = await input.fallbackLlm.chatCompletion(
@@ -32,14 +51,18 @@ async function callDeepRecallPolicyLlm(input) {
         {
           temperature: 0.1,
           maxTokens: 1024,
-          ...timeout ? { timeoutMs: timeout } : {},
-          ...gatewayChain
+          ...remaining !== void 0 ? { timeoutMs: remaining } : {},
+          ...gatewayChain,
+          ...input.signal ? { signal: input.signal } : {}
         }
       );
       if (result?.content) return result.content;
-    } catch {
+    } catch (err) {
+      if (isAbortError(err)) throw err;
+      throwIfAborted(input.signal, abortMessage);
     }
   }
+  throwIfAborted(input.signal, abortMessage);
   return null;
 }
 
@@ -47,4 +70,4 @@ export {
   DEEP_RECALL_POLICY_SYSTEM_PROMPT,
   callDeepRecallPolicyLlm
 };
-//# sourceMappingURL=chunk-ZRMMXWYI.js.map
+//# sourceMappingURL=chunk-YR5QT4SR.js.map

package/dist/chunk-YR5QT4SR.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/deep-recall-policy-llm.ts"],"sourcesContent":["/**\n * Policy-call LLM routing for deep recall (issue #2332).\n *\n * Mirrors `extraction-judge.ts` `callJudgeLlm` exactly: local client first\n * (json_object response format) unless modelSource is \"gateway\", then the\n * fallback client with the shared background-task chain options. Never a\n * raw OpenAI client. Returns null when both legs fail — the loop treats\n * that as a stop, never a crash.\n *\n * One `timeoutMs` budget spans BOTH legs (issue #2915): the fallback leg\n * receives only what the local leg left on the clock, so a single policy\n * step can no longer outlive `stepTimeoutMs` by failing slowly locally and\n * restarting the full timeout remotely. A spent budget starts neither leg.\n * The transport cancellation signal is forwarded to both legs and checked\n * before each start and after each caught failure so an abort is never\n * converted to null.\n */\n\nimport { gatewayTaskChainOptions, type FallbackLlmClient } from \"./fallback-llm.js\";\nimport type { LocalLlmClient } from \"./local-llm.js\";\nimport type { PluginConfig } from \"./types.js\";\nimport { isAbortError, throwIfAborted } from \"./abort-error.js\";\n\nexport const DEEP_RECALL_POLICY_SYSTEM_PROMPT =\n  \"You are the retrieval policy for a long-term memory system. Given the question, the current working set of retrieved memories, and the frontier of anchor-linked candidates, choose exactly one action: REFINE (rewrite the query), EXPAND (follow named frontier nodes), or STOP. Respond with JSON only.\";\n\nexport async function callDeepRecallPolicyLlm(input: {\n  statePrompt: string;\n  config: PluginConfig;\n  localLlm: LocalLlmClient | null;\n  fallbackLlm: FallbackLlmClient | null;\n  timeoutMs: number;\n  /** Transport cancellation (issue #2915); forwarded to both LLM legs. */\n  signal?: AbortSignal;\n}): Promise<string | null> {\n  const messages: Array<{ role: \"system\" | \"user\"; content: string }> = [\n    { role: \"system\", content: DEEP_RECALL_POLICY_SYSTEM_PROMPT },\n    { role: \"user\", content: input.statePrompt },\n  ];\n  const startedAtMs = Date.now();\n  const remainingMs = (): number | undefined =>\n    input.timeoutMs > 0 ? input.timeoutMs - (Date.now() - startedAtMs) : undefined;\n  const skipLocal = input.config.modelSource === \"gateway\";\n  const gatewayChain = gatewayTaskChainOptions(input.config);\n  const abortMessage = \"deep recall policy call aborted\";\n\n  throwIfAborted(input.signal, abortMessage);\n\n  if (input.localLlm && !skipLocal) {\n    const timeout = remainingMs();\n    if (timeout !== undefined && timeout <= 0) {\n      return null;\n    }\n    try {\n      const result = await input.localLlm.chatCompletion(messages, {\n        temperature: 0.1,\n        maxTokens: 1024,\n        ...(timeout !== undefined ? { timeoutMs: timeout } : {}),\n        responseFormat: { type: \"json_object\" },\n        operation: \"deep-recall-policy\",\n        ...(input.signal ? { signal: input.signal } : {}),\n      });\n      if (result?.content) return result.content;\n    } catch (err) {\n      if (isAbortError(err)) throw err;\n      throwIfAborted(input.signal, abortMessage);\n    }\n  }\n\n  throwIfAborted(input.signal, abortMessage);\n  const remaining = remainingMs();\n  if (remaining !== undefined && remaining <= 0) {\n    return null;\n  }\n  if (input.fallbackLlm) {\n    try {\n      const result = await input.fallbackLlm.chatCompletion(\n        messages as Array<{ role: \"system\" | \"user\" | \"assistant\"; content: string }>,\n        {\n          temperature: 0.1,\n          maxTokens: 1024,\n          ...(remaining !== undefined ? { timeoutMs: remaining } : {}),\n          ...gatewayChain,\n          ...(input.signal ? { signal: input.signal } : {}),\n        },\n      );\n      if (result?.content) return result.content;\n    } catch (err) {\n      if (isAbortError(err)) throw err;\n      throwIfAborted(input.signal, abortMessage);\n    }\n  }\n  throwIfAborted(input.signal, abortMessage);\n  return null;\n}\n"],"mappings":";;;;;;;;;AAuBO,IAAM,mCACX;AAEF,eAAsB,wBAAwB,OAQnB;AACzB,QAAM,WAAgE;AAAA,IACpE,EAAE,MAAM,UAAU,SAAS,iCAAiC;AAAA,IAC5D,EAAE,MAAM,QAAQ,SAAS,MAAM,YAAY;AAAA,EAC7C;AACA,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,cAAc,MAClB,MAAM,YAAY,IAAI,MAAM,aAAa,KAAK,IAAI,IAAI,eAAe;AACvE,QAAM,YAAY,MAAM,OAAO,gBAAgB;AAC/C,QAAM,eAAe,wBAAwB,MAAM,MAAM;AACzD,QAAM,eAAe;AAErB,iBAAe,MAAM,QAAQ,YAAY;AAEzC,MAAI,MAAM,YAAY,CAAC,WAAW;AAChC,UAAM,UAAU,YAAY;AAC5B,QAAI,YAAY,UAAa,WAAW,GAAG;AACzC,aAAO;AAAA,IACT;AACA,QAAI;AACF,YAAM,SAAS,MAAM,MAAM,SAAS,eAAe,UAAU;AAAA,QAC3D,aAAa;AAAA,QACb,WAAW;AAAA,QACX,GAAI,YAAY,SAAY,EAAE,WAAW,QAAQ,IAAI,CAAC;AAAA,QACtD,gBAAgB,EAAE,MAAM,cAAc;AAAA,QACtC,WAAW;AAAA,QACX,GAAI,MAAM,SAAS,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;AAAA,MACjD,CAAC;AACD,UAAI,QAAQ,QAAS,QAAO,OAAO;AAAA,IACrC,SAAS,KAAK;AACZ,UAAI,aAAa,GAAG,EAAG,OAAM;AAC7B,qBAAe,MAAM,QAAQ,YAAY;AAAA,IAC3C;AAAA,EACF;AAEA,iBAAe,MAAM,QAAQ,YAAY;AACzC,QAAM,YAAY,YAAY;AAC9B,MAAI,cAAc,UAAa,aAAa,GAAG;AAC7C,WAAO;AAAA,EACT;AACA,MAAI,MAAM,aAAa;AACrB,QAAI;AACF,YAAM,SAAS,MAAM,MAAM,YAAY;AAAA,QACrC;AAAA,QACA;AAAA,UACE,aAAa;AAAA,UACb,WAAW;AAAA,UACX,GAAI,cAAc,SAAY,EAAE,WAAW,UAAU,IAAI,CAAC;AAAA,UAC1D,GAAG;AAAA,UACH,GAAI,MAAM,SAAS,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;AAAA,QACjD;AAAA,MACF;AACA,UAAI,QAAQ,QAAS,QAAO,OAAO;AAAA,IACrC,SAAS,KAAK;AACZ,UAAI,aAAa,GAAG,EAAG,OAAM;AAC7B,qBAAe,MAAM,QAAQ,YAAY;AAAA,IAC3C;AAAA,EACF;AACA,iBAAe,MAAM,QAAQ,YAAY;AACzC,SAAO;AACT;","names":[]}

package/dist/{chunk-CARRTDKC.js → chunk-Z22M4JCY.js}

@@ -4,7 +4,7 @@ import {
   envelopeToFrontmatterLines,
   resolveReadAuthority,
   resolveWriteOrigin
-} from "./chunk-CC37E3QM.js";
+} from "./chunk-QKCXRS5A.js";
 import {
   resolveConversationContextCapabilities
 } from "./chunk-JUOZ62Y7.js";
@@ -459,7 +459,8 @@ var SharedContextManager = class {
       authority: opts.authority,
       expiresAt: opts.expiresAt,
       supersedes: opts.supersedes,
-      allowBinding: this.allowBindingAuthority
+      allowBinding: this.allowBindingAuthority,
+      nowMs: createdAt.getTime()
     });
     const dir = path.join(this.outputsDir, agentPathSegment, date);
     await mkdir(dir, { recursive: true });
@@ -754,4 +755,4 @@ export {
   resolveSharedContextDir,
   SharedContextManager
 };
-//# sourceMappingURL=chunk-CARRTDKC.js.map
+//# sourceMappingURL=chunk-Z22M4JCY.js.map

package/dist/chunk-Z22M4JCY.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/shared-context/manager.ts"],"sourcesContent":["import { randomUUID } from \"node:crypto\";\nimport { mkdir, readFile, readdir, appendFile, writeFile, stat, rename, rm } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { z } from \"zod\";\nimport { log } from \"../logger.js\";\nimport type { PluginConfig } from \"../types.js\";\nimport { expandTildePath } from \"../utils/path.js\";\nimport { resolveConversationContextCapabilities } from \"../capabilities.js\";\nimport { throwIfAborted } from \"../abort-error.js\";\nimport {\n  composeWriteEnvelope,\n  envelopeFromScalars,\n  envelopeToFrontmatterLines,\n  resolveReadAuthority,\n  resolveWriteOrigin,\n} from \"./envelope-io.js\";\nimport type { SharedAuthority, SharedEnvelope } from \"./governance.js\";\n\nexport const SharedFeedbackEntrySchema = z.object({\n  agent: z.string().min(1),\n  decision: z.enum([\"approved\", \"approved_with_feedback\", \"rejected\"]),\n  reason: z.string().min(1),\n  date: z.string().min(8), // ISO-ish; keep loose\n  learning: z.string().optional(),\n  outcome: z.string().optional(),\n  severity: z.enum([\"low\", \"medium\", \"high\"]).optional(),\n  confidence: z.number().min(0).max(1).optional(),\n  workflow: z.string().min(1).optional(),\n  tags: z.array(z.string().min(1)).optional(),\n  evidenceWindowStart: z.string().min(8).optional(),\n  evidenceWindowEnd: z.string().min(8).optional(),\n  refs: z.array(z.string()).optional(),\n});\n\nexport type SharedFeedbackEntry = z.infer<typeof SharedFeedbackEntrySchema>;\n\nfunction safeSlug(s: string): string {\n  let slug = s.toLowerCase().replace(/[^a-z0-9]+/g, \"-\");\n  // Trim leading/trailing dashes without ReDoS-prone anchored quantifiers\n  let start = 0;\n  while (start < slug.length && slug[start] === \"-\") start++;\n  let end = slug.length;\n  while (end > start && slug[end - 1] === \"-\") end--;\n  return slug.slice(start, end).slice(0, 80) || \"output\";\n}\n\nfunction safePathSegment(s: string, label: string): string {\n  if (s.length === 0) throw new Error(`${label} must not be empty`);\n  if (/[\\r\\n]/.test(s)) throw new Error(`${label} must not contain line breaks`);\n  const encoded = encodeURIComponent(s);\n  if (encoded === \".\" || encoded === \"..\") {\n    return encoded.replace(/\\./g, \"%2E\");\n  }\n  return encoded;\n}\n\nfunction safeDecodePathSegment(s: string): string {\n  try {\n    return decodeURIComponent(s);\n  } catch {\n    return s;\n  }\n}\n\nfunction normalizeFrontmatterScalar(value: string): string {\n  if (value.length >= 2 && value.startsWith('\"') && value.endsWith('\"')) {\n    try {\n      const parsed = JSON.parse(value);\n      if (typeof parsed === \"string\") return parsed;\n    } catch {\n      // Fall through to the legacy partial unescape below.\n    }\n    return value.slice(1, -1).replace(/\\\\\"/g, '\"').replace(/\\\\\\\\/g, \"\\\\\");\n  }\n  if (value.length >= 2 && value.startsWith(\"'\") && value.endsWith(\"'\")) {\n    return value.slice(1, -1).replace(/''/g, \"'\");\n  }\n  return value;\n}\n\nfunction formatFrontmatterScalar(value: string): string {\n  return JSON.stringify(value);\n}\n\nfunction readFrontmatterScalar(raw: string, key: string): string | null {\n  const frontmatter = raw.match(/^---\\r?\\n([\\s\\S]*?)\\r?\\n---(?:\\r?\\n|$)/)?.[1];\n  if (!frontmatter) return null;\n  for (const line of frontmatter.split(/\\r?\\n/)) {\n    if (!line.startsWith(`${key}:`)) continue;\n    const value = line.slice(key.length + 1).trim();\n    return value ? normalizeFrontmatterScalar(value) : null;\n  }\n  return null;\n}\n\nfunction ymd(d: Date): string {\n  return d.toISOString().slice(0, 10);\n}\n\nfunction safeDateSegment(date: string): string {\n  if (!/^\\d{4}-\\d{2}-\\d{2}$/.test(date)) {\n    throw new Error(`Invalid shared-context date: ${JSON.stringify(date)}; expected YYYY-MM-DD`);\n  }\n  const parsed = new Date(`${date}T00:00:00.000Z`);\n  if (!Number.isFinite(parsed.getTime()) || parsed.toISOString().slice(0, 10) !== date) {\n    throw new Error(`Invalid shared-context date: ${JSON.stringify(date)}; expected a real calendar date`);\n  }\n  return date;\n}\n\nconst CROSS_SIGNAL_STOPWORDS = new Set([\n  \"a\",\n  \"an\",\n  \"and\",\n  \"are\",\n  \"as\",\n  \"at\",\n  \"be\",\n  \"by\",\n  \"for\",\n  \"from\",\n  \"has\",\n  \"have\",\n  \"in\",\n  \"is\",\n  \"it\",\n  \"of\",\n  \"on\",\n  \"or\",\n  \"that\",\n  \"the\",\n  \"this\",\n  \"to\",\n  \"was\",\n  \"were\",\n  \"with\",\n  \"agent\",\n  \"output\",\n  \"today\",\n  \"daily\",\n  \"notes\",\n  \"note\",\n  \"summary\",\n]);\n\nfunction extractTopicTokens(text: string, maxTokens: number = 12): string[] {\n  const seen = new Set<string>();\n  const out: string[] = [];\n  const tokens = text\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s]/g, \" \")\n    .split(/\\s+/)\n    .map((token) => token.trim())\n    .filter((token) => token.length >= 4)\n    .filter((token) => !CROSS_SIGNAL_STOPWORDS.has(token));\n\n  for (const token of tokens) {\n    if (seen.has(token)) continue;\n    seen.add(token);\n    out.push(token);\n    if (out.length >= maxTokens) break;\n  }\n  return out;\n}\n\nfunction stripYamlFrontmatter(text: string): string {\n  if (!text.startsWith(\"---\\n\")) return text;\n  const closing = text.indexOf(\"\\n---\\n\", 4);\n  if (closing === -1) return text;\n  return text.slice(closing + 5);\n}\n\nfunction semanticRoot(token: string): string {\n  let root = token.toLowerCase();\n  if (root.endsWith(\"izations\") && root.length > 9) {\n    root = `${root.slice(0, -8)}ize`;\n  }\n  else if (root.endsWith(\"ization\") && root.length > 8) {\n    root = `${root.slice(0, -7)}ize`;\n  } else if (root.endsWith(\"isations\") && root.length > 9) {\n    root = `${root.slice(0, -8)}ise`;\n  } else if (root.endsWith(\"isation\") && root.length > 8) {\n    root = `${root.slice(0, -7)}ise`;\n  } else {\n    const suffixes = [\n      \"ations\",\n      \"ation\",\n      \"ments\",\n      \"ment\",\n      \"ingly\",\n      \"edly\",\n      \"ings\",\n      \"ing\",\n      \"ers\",\n      \"er\",\n      \"ies\",\n      \"ied\",\n      \"ions\",\n      \"ion\",\n      \"es\",\n      \"ed\",\n      \"s\",\n    ];\n    for (const suffix of suffixes) {\n      if (root.length > suffix.length + 3 && root.endsWith(suffix)) {\n        root = root.slice(0, -suffix.length);\n        break;\n      }\n    }\n  }\n  if (root.length > 4 && root.endsWith(\"e\")) {\n    root = root.slice(0, -1);\n  }\n  return root;\n}\n\nfunction mergeOverlaps(\n  base: SharedCrossSignalOverlap[],\n  extra: SharedCrossSignalOverlap[],\n): SharedCrossSignalOverlap[] {\n  const merged = new Map<string, { agents: Set<string>; sourcePaths: Set<string> }>();\n  for (const entry of [...base, ...extra]) {\n    const existing = merged.get(entry.token);\n    if (existing) {\n      for (const agent of entry.agents) existing.agents.add(agent);\n      for (const sourcePath of entry.sourcePaths) existing.sourcePaths.add(sourcePath);\n    } else {\n      merged.set(entry.token, {\n        agents: new Set(entry.agents),\n        sourcePaths: new Set(entry.sourcePaths),\n      });\n    }\n  }\n  return [...merged.entries()]\n    .map(([token, value]) => ({\n      token,\n      agents: [...value.agents].sort(),\n      sourcePaths: [...value.sourcePaths].sort(),\n      agentCount: value.agents.size,\n    }))\n    .filter((entry) => entry.agentCount >= 2)\n    .sort((a, b) => b.agentCount - a.agentCount || a.token.localeCompare(b.token));\n}\n\nasync function computeSemanticOverlapCandidates(\n  sources: SharedCrossSignalSource[],\n  maxCandidates: number,\n  timeoutAtMs: number,\n): Promise<{ overlaps: SharedCrossSignalOverlap[]; candidateCount: number; timedOut: boolean }> {\n  const tokenRows: Array<{ token: string; agent: string; path: string }> = [];\n  for (const source of sources) {\n    for (const token of source.topics) {\n      if (Date.now() >= timeoutAtMs) return { overlaps: [], candidateCount: tokenRows.length, timedOut: true };\n      await new Promise<void>((resolve) => setImmediate(resolve));\n      tokenRows.push({ token, agent: source.agent, path: source.path });\n      if (tokenRows.length >= maxCandidates) break;\n    }\n    if (tokenRows.length >= maxCandidates) break;\n  }\n\n  const byRoot = new Map<string, Map<string, { agents: Set<string>; paths: Set<string> }>>();\n  for (const row of tokenRows) {\n    if (Date.now() >= timeoutAtMs) return { overlaps: [], candidateCount: tokenRows.length, timedOut: true };\n    await new Promise<void>((resolve) => setImmediate(resolve));\n    const root = semanticRoot(row.token);\n    if (root.length < 4) continue;\n    const rootGroup = byRoot.get(root) ?? new Map<string, { agents: Set<string>; paths: Set<string> }>();\n    const tokenGroup = rootGroup.get(row.token) ?? { agents: new Set<string>(), paths: new Set<string>() };\n    tokenGroup.agents.add(row.agent);\n    tokenGroup.paths.add(row.path);\n    rootGroup.set(row.token, tokenGroup);\n    byRoot.set(root, rootGroup);\n  }\n\n  const overlaps: SharedCrossSignalOverlap[] = [];\n  for (const [root, tokenMap] of byRoot.entries()) {\n    if (Date.now() >= timeoutAtMs) return { overlaps: [], candidateCount: tokenRows.length, timedOut: true };\n    await new Promise<void>((resolve) => setImmediate(resolve));\n    if (tokenMap.size < 2) continue;\n    const agents = new Set<string>();\n    const sourcePaths = new Set<string>();\n    for (const value of tokenMap.values()) {\n      for (const agent of value.agents) agents.add(agent);\n      for (const sourcePath of value.paths) sourcePaths.add(sourcePath);\n    }\n    if (agents.size < 2) continue;\n    overlaps.push({\n      token: `semantic:${root}`,\n      agents: [...agents].sort(),\n      sourcePaths: [...sourcePaths].sort(),\n      agentCount: agents.size,\n    });\n  }\n\n  overlaps.sort((a, b) => b.agentCount - a.agentCount || a.token.localeCompare(b.token));\n  return {\n    overlaps,\n    candidateCount: tokenRows.length,\n    timedOut: false,\n  };\n}\n\nasync function computeSemanticOverlapsWithTimeout(\n  sources: SharedCrossSignalSource[],\n  timeoutMs: number,\n  maxCandidates: number,\n): Promise<{ overlaps: SharedCrossSignalOverlap[]; candidateCount: number; timedOut: boolean }> {\n  const safeTimeoutMs = Math.max(1, Math.floor(timeoutMs));\n  const safeMaxCandidates = Math.max(0, Math.floor(maxCandidates));\n  if (safeMaxCandidates === 0 || sources.length === 0) {\n    return { overlaps: [], candidateCount: 0, timedOut: false };\n  }\n  const timeoutAtMs = Date.now() + safeTimeoutMs;\n  return computeSemanticOverlapCandidates(sources, safeMaxCandidates, timeoutAtMs);\n}\n\ninterface SharedCrossSignalSource {\n  agent: string;\n  path: string;\n  title: string;\n  topics: string[];\n  /** Resolved least-privilege authority from the item's envelope (issue #1957). */\n  authority: SharedAuthority;\n  /** Envelope origin agent id; legacy items fall back to the agent field. */\n  sharedBy: string;\n}\n\ninterface SharedCrossSignalOverlap {\n  token: string;\n  agents: string[];\n  sourcePaths: string[];\n  agentCount: number;\n}\n\ninterface SharedCrossSignalReport {\n  date: string;\n  generatedAt: string;\n  sourceCount: number;\n  feedbackCount: number;\n  feedbackByDecision: Record<\"approved\" | \"approved_with_feedback\" | \"rejected\", number>;\n  feedbackEntries: SharedFeedbackEntry[];\n  sources: SharedCrossSignalSource[];\n  overlaps: SharedCrossSignalOverlap[];\n  semantic: {\n    enabled: boolean;\n    applied: boolean;\n    timedOut: boolean;\n    candidateCount: number;\n    maxCandidates: number;\n    addedOverlapCount: number;\n  };\n}\n\nexport interface SharedCrossSignalSynthesisResult {\n  date: string;\n  crossSignalsPath: string;\n  crossSignalsMarkdownPath: string;\n  overlapCount: number;\n  report: SharedCrossSignalReport;\n}\n\nexport interface SharedDailyCurationResult {\n  date: string;\n  roundtablePath: string;\n  crossSignalsPath: string;\n  crossSignalsMarkdownPath: string;\n  overlapCount: number;\n}\n\nfunction feedbackDecisionPriority(decision: SharedFeedbackEntry[\"decision\"]): number {\n  switch (decision) {\n    case \"rejected\":\n      return 3;\n    case \"approved_with_feedback\":\n      return 2;\n    case \"approved\":\n      return 1;\n  }\n}\n\nfunction feedbackSeverityPriority(severity: SharedFeedbackEntry[\"severity\"]): number {\n  switch (severity) {\n    case \"high\":\n      return 3;\n    case \"medium\":\n      return 2;\n    case \"low\":\n      return 1;\n    default:\n      return 0;\n  }\n}\n\nfunction compareFeedbackPriority(a: SharedFeedbackEntry, b: SharedFeedbackEntry): number {\n  return (\n    feedbackDecisionPriority(b.decision) - feedbackDecisionPriority(a.decision)\n    || feedbackSeverityPriority(b.severity) - feedbackSeverityPriority(a.severity)\n    || a.date.localeCompare(b.date)\n  );\n}\n\nfunction markdownLineText(value: string): string {\n  return value.replace(/[\\r\\n]+/g, \" \").replace(/\\s+/g, \" \").trim();\n}\n\nfunction markdownLineList(values: readonly string[]): string {\n  return values.map(markdownLineText).filter(Boolean).join(\", \");\n}\n\nfunction formatFeedbackLine(entry: SharedFeedbackEntry): string {\n  const extras: string[] = [`feedback: ${markdownLineText(entry.date)}`];\n  if (entry.severity) extras.push(`severity: ${markdownLineText(entry.severity)}`);\n  if (entry.refs?.length) extras.push(`refs: ${markdownLineList(entry.refs)}`);\n  return `- [${markdownLineText(entry.agent)}] ${entry.decision}: ${markdownLineText(entry.reason)} [${extras.join(\"; \")}]`;\n}\n\nfunction formatOverlapLine(entry: SharedCrossSignalOverlap): string {\n  return `- \\`${entry.token}\\` (${entry.agentCount} agents: ${markdownLineList(entry.agents)}) [sources: ${markdownLineList(entry.sourcePaths)}]`;\n}\n\nasync function writeFileAtomic(filePath: string, content: string): Promise<void> {\n  await mkdir(path.dirname(filePath), { recursive: true });\n  const tempPath = path.join(\n    path.dirname(filePath),\n    `.${path.basename(filePath)}.${process.pid}.${randomUUID()}.tmp`,\n  );\n  try {\n    await writeFile(tempPath, content, { encoding: \"utf-8\", flag: \"wx\" });\n    await rename(tempPath, filePath);\n  } catch (error) {\n    await rm(tempPath, { force: true }).catch(() => undefined);\n    throw error;\n  }\n}\n\nexport function resolveSharedContextDir(config: PluginConfig): string {\n  return typeof config.sharedContextDir === \"string\" && config.sharedContextDir.length > 0\n    ? expandTildePath(config.sharedContextDir)\n    : path.join(expandTildePath(config.workspaceDir), \"shared-context\");\n}\n\nexport class SharedContextManager {\n  readonly dir: string;\n  private readonly prioritiesPath: string;\n  private readonly prioritiesInboxPath: string;\n  private readonly outputsDir: string;\n  private readonly roundtableDir: string;\n  private readonly feedbackDir: string;\n  private readonly feedbackInboxPath: string;\n  private readonly crossSignalsDir: string;\n  private readonly allowBindingAuthority: boolean;\n  private readonly dailySynthesisChains = new Map<string, Promise<void>>();\n\n  constructor(private readonly config: PluginConfig) {\n    const base = resolveSharedContextDir(config);\n\n    this.dir = base;\n    this.prioritiesPath = path.join(base, \"priorities.md\");\n    this.prioritiesInboxPath = path.join(base, \"priorities.inbox.md\");\n    this.outputsDir = path.join(base, \"agent-outputs\");\n    this.roundtableDir = path.join(base, \"roundtable\");\n    this.feedbackDir = path.join(base, \"feedback\");\n    this.feedbackInboxPath = path.join(this.feedbackDir, \"inbox.jsonl\");\n    this.crossSignalsDir = path.join(base, \"cross-signals\");\n    this.allowBindingAuthority = config.sharedContextAllowBindingAuthority === true;\n  }\n\n  async ensureStructure(): Promise<void> {\n    await mkdir(this.dir, { recursive: true });\n    await mkdir(this.outputsDir, { recursive: true });\n    await mkdir(this.roundtableDir, { recursive: true });\n    await mkdir(this.feedbackDir, { recursive: true });\n    await mkdir(this.crossSignalsDir, { recursive: true });\n    await mkdir(path.join(this.dir, \"staging\"), { recursive: true });\n    await mkdir(path.join(this.dir, \"kpis\"), { recursive: true });\n    await mkdir(path.join(this.dir, \"calendar\"), { recursive: true });\n    await mkdir(path.join(this.dir, \"content-calendar\"), { recursive: true });\n\n    // Bootstrap files if missing.\n    await this.ensureFile(\n      this.prioritiesPath,\n      [\n        \"# Priorities\",\n        \"\",\n        \"This is the shared priority stack. Agents should read this before acting.\",\n        \"\",\n        \"## Current\",\n        \"- (empty)\",\n        \"\",\n        \"## Notes\",\n        \"- (empty)\",\n        \"\",\n      ].join(\"\\n\"),\n    );\n    await this.ensureFile(\n      this.prioritiesInboxPath,\n      [\n        \"# Priorities Inbox\",\n        \"\",\n        \"Append-only inbox. Curator merges into priorities.md.\",\n        \"\",\n      ].join(\"\\n\"),\n    );\n    await this.ensureFile(this.feedbackInboxPath, \"\");\n  }\n\n  private async ensureFile(fp: string, content: string): Promise<void> {\n    try {\n      await stat(fp);\n    } catch {\n      await writeFile(fp, content, \"utf-8\");\n    }\n  }\n\n  async readPriorities(signal?: AbortSignal): Promise<string> {\n    throwIfAborted(signal, \"shared context priorities read aborted\");\n    try {\n      const content = await readFile(this.prioritiesPath, { encoding: \"utf-8\", signal });\n      throwIfAborted(signal, \"shared context priorities read aborted\");\n      return content;\n    } catch {\n      throwIfAborted(signal, \"shared context priorities read aborted\");\n      return \"\";\n    }\n  }\n\n  async readLatestRoundtable(signal?: AbortSignal): Promise<string> {\n    throwIfAborted(signal, \"shared context roundtable read aborted\");\n    try {\n      const files = (await readdir(this.roundtableDir))\n        .filter((f) => f.endsWith(\".md\"))\n        .sort()\n        .reverse();\n      throwIfAborted(signal, \"shared context roundtable read aborted\");\n      const fp = files[0] ? path.join(this.roundtableDir, files[0]) : null;\n      if (!fp) return \"\";\n      const content = await readFile(fp, { encoding: \"utf-8\", signal });\n      throwIfAborted(signal, \"shared context roundtable read aborted\");\n      return content;\n    } catch {\n      throwIfAborted(signal, \"shared context roundtable read aborted\");\n      return \"\";\n    }\n  }\n\n  async readLatestCrossSignals(signal?: AbortSignal): Promise<string> {\n    throwIfAborted(signal, \"shared context cross-signals read aborted\");\n    try {\n      const files = (await readdir(this.crossSignalsDir))\n        .filter((f) => f.endsWith(\".md\"))\n        .sort()\n        .reverse();\n      throwIfAborted(signal, \"shared context cross-signals read aborted\");\n      const fp = files[0] ? path.join(this.crossSignalsDir, files[0]) : null;\n      if (!fp) return \"\";\n      const content = await readFile(fp, { encoding: \"utf-8\", signal });\n      throwIfAborted(signal, \"shared context cross-signals read aborted\");\n      return content;\n    } catch {\n      throwIfAborted(signal, \"shared context cross-signals read aborted\");\n      return \"\";\n    }\n  }\n\n  async writeAgentOutput(opts: {\n    agentId: string;\n    title: string;\n    content: string;\n    createdAt?: Date;\n    /** Envelope authority class (issue #1957). Unrecognized values throw. */\n    authority?: string;\n    /** Optional ISO-8601 expiry stamped on the item. */\n    expiresAt?: string;\n    /** Optional id of the shared item this output supersedes. */\n    supersedes?: string;\n    /**\n     * Server-resolved identity of the caller, supplied by the access\n     * surface (issue #1957 review). When present it IS both the producer\n     * and the envelope origin; a disagreeing caller-supplied `agentId` is\n     * rejected so no caller can publish as another agent.\n     */\n    authenticatedIdentity?: string;\n    /**\n     * Server-owned origin token for a write that crosses an external\n     * boundary but resolved no identity (issue #1957 review round 4).\n     * Stamped as the envelope origin (`sharedBy`); the caller label stays\n     * the producer so grouping never collapses.\n     */\n    unattributedOrigin?: string;\n  }): Promise<string> {\n    const identity = resolveWriteOrigin({\n      agentId: opts.agentId,\n      authenticatedIdentity: opts.authenticatedIdentity,\n      unattributedOrigin: opts.unattributedOrigin,\n    });\n    const createdAt = opts.createdAt ?? new Date();\n    const date = ymd(createdAt);\n    const time = createdAt.toISOString().slice(11, 19).replace(/:/g, \"\");\n    const slug = safeSlug(opts.title);\n    const agentPathSegment = safePathSegment(identity.agent, \"agentId\");\n\n    const envelope = composeWriteEnvelope({\n      origin: identity.origin,\n      authority: opts.authority,\n      expiresAt: opts.expiresAt,\n      supersedes: opts.supersedes,\n      allowBinding: this.allowBindingAuthority,\n      nowMs: createdAt.getTime(),\n    });\n\n    const dir = path.join(this.outputsDir, agentPathSegment, date);\n    await mkdir(dir, { recursive: true });\n\n    const body = [\n      \"---\",\n      \"kind: agent_output\",\n      `agent: ${formatFrontmatterScalar(identity.agent)}`,\n      `createdAt: ${createdAt.toISOString()}`,\n      `title: ${formatFrontmatterScalar(opts.title.replace(/\\n/g, \" \").slice(0, 200))}`,\n      ...envelopeToFrontmatterLines(envelope),\n      \"---\",\n      \"\",\n      opts.content.trimEnd(),\n      \"\",\n    ].join(\"\\n\");\n\n    for (let attempt = 0; attempt < 100; attempt++) {\n      const suffix = attempt === 0 ? \"\" : `-${attempt + 1}`;\n      const fp = path.join(dir, `${time}-${slug}${suffix}.md`);\n      try {\n        await writeFile(fp, body, { encoding: \"utf-8\", flag: \"wx\" });\n        return fp;\n      } catch (error) {\n        if (error instanceof Error && \"code\" in error && error.code === \"EEXIST\") continue;\n        throw error;\n      }\n    }\n\n    throw new Error(`Unable to allocate unique shared-context output path for ${identity.agent}`);\n  }\n\n  async appendFeedback(entry: SharedFeedbackEntry): Promise<void> {\n    const parsed = SharedFeedbackEntrySchema.parse(entry);\n    await appendFile(this.feedbackInboxPath, JSON.stringify(parsed) + \"\\n\", \"utf-8\");\n  }\n\n  async appendPrioritiesInbox(opts: { agentId: string; text: string }): Promise<void> {\n    const stamp = new Date().toISOString();\n    const lines = [\n      \"\",\n      `## ${stamp} (${opts.agentId})`,\n      \"\",\n      opts.text.trimEnd(),\n      \"\",\n    ].join(\"\\n\");\n    await appendFile(this.prioritiesInboxPath, lines, \"utf-8\");\n  }\n\n  private async withDailySynthesisLock<T>(date: string, fn: () => Promise<T>): Promise<T> {\n    const previous = this.dailySynthesisChains.get(date) ?? Promise.resolve();\n    let releaseCurrent!: () => void;\n    const current = new Promise<void>((resolve) => {\n      releaseCurrent = resolve;\n    });\n    const queued = previous.catch(() => undefined).then(() => current);\n    this.dailySynthesisChains.set(date, queued);\n    await previous.catch(() => undefined);\n    try {\n      return await fn();\n    } finally {\n      releaseCurrent();\n      if (this.dailySynthesisChains.get(date) === queued) {\n        this.dailySynthesisChains.delete(date);\n      }\n    }\n  }\n\n  async synthesizeCrossSignals(opts: {\n    date?: string;\n    maxSummaryItems?: number;\n  }): Promise<SharedCrossSignalSynthesisResult> {\n    const date = safeDateSegment(opts.date ?? ymd(new Date()));\n    return this.withDailySynthesisLock(date, () => this.synthesizeCrossSignalsUnlocked({\n      date,\n      maxSummaryItems: opts.maxSummaryItems,\n    }));\n  }\n\n  private async synthesizeCrossSignalsUnlocked(opts: {\n    date: string;\n    maxSummaryItems?: number;\n  }): Promise<SharedCrossSignalSynthesisResult> {\n    const date = opts.date;\n    const maxSummaryItems = Math.max(1, opts.maxSummaryItems ?? 8);\n\n    // Collect outputs for the day (best-effort).\n    const outputs: Array<{ agent: string; path: string; title: string; raw: string; envelope: SharedEnvelope }> = [];\n    try {\n      const agents = (await readdir(this.outputsDir, { withFileTypes: true }))\n        .sort((a, b) => a.name.localeCompare(b.name));\n      for (const a of agents) {\n        if (!a.isDirectory()) continue;\n        const dayDir = path.join(this.outputsDir, a.name, date);\n        try {\n          const files = (await readdir(dayDir)).filter((f) => f.endsWith(\".md\")).sort();\n          for (const f of files) {\n            const p = path.join(dayDir, f);\n            const raw = await readFile(p, \"utf-8\");\n            const title = readFrontmatterScalar(raw, \"title\") ?? f;\n            const agent = readFrontmatterScalar(raw, \"agent\") ?? safeDecodePathSegment(a.name);\n            const envelope = envelopeFromScalars({\n              sharedBy: readFrontmatterScalar(raw, \"sharedBy\"),\n              authority: readFrontmatterScalar(raw, \"authority\"),\n              expiresAt: readFrontmatterScalar(raw, \"expiresAt\"),\n              supersedes: readFrontmatterScalar(raw, \"supersedes\"),\n            });\n            outputs.push({ agent, path: p, title, raw, envelope });\n          }\n        } catch {\n          // no outputs for this agent/date\n        }\n      }\n    } catch {\n      // ignore\n    }\n    outputs.sort(\n      (a, b) =>\n        a.agent.localeCompare(b.agent)\n        || a.path.localeCompare(b.path)\n        || a.title.localeCompare(b.title),\n    );\n\n    // Collect feedback entries for the day.\n    const feedback: SharedFeedbackEntry[] = [];\n    try {\n      const raw = await readFile(this.feedbackInboxPath, \"utf-8\");\n      for (const line of raw.split(\"\\n\")) {\n        if (!line.trim()) continue;\n        try {\n          const obj = JSON.parse(line);\n          const parsed = SharedFeedbackEntrySchema.safeParse(obj);\n          if (!parsed.success) continue;\n          if (String(parsed.data.date).startsWith(date)) feedback.push(parsed.data);\n        } catch {\n          // ignore\n        }\n      }\n    } catch {\n      // ignore\n    }\n\n    const sources: SharedCrossSignalSource[] = outputs.map((output) => {\n      const body = stripYamlFrontmatter(output.raw);\n      return {\n        agent: output.agent,\n        path: output.path,\n        title: output.title,\n        topics: extractTopicTokens(`${output.title}\\n${body}`),\n        authority: resolveReadAuthority(output.envelope, this.allowBindingAuthority),\n        sharedBy: output.envelope.sharedBy ?? output.agent,\n      };\n    });\n\n    const overlapMap = new Map<string, { agents: Set<string>; sourcePaths: Set<string> }>();\n    for (const source of sources) {\n      for (const token of source.topics) {\n        const existing = overlapMap.get(token);\n        if (existing) {\n          existing.agents.add(source.agent);\n          existing.sourcePaths.add(source.path);\n        } else {\n          overlapMap.set(token, {\n            agents: new Set([source.agent]),\n            sourcePaths: new Set([source.path]),\n          });\n        }\n      }\n    }\n\n    const overlaps: SharedCrossSignalOverlap[] = [...overlapMap.entries()]\n      .map(([token, v]) => ({\n        token,\n        agents: [...v.agents].sort(),\n        sourcePaths: [...v.sourcePaths].sort(),\n        agentCount: v.agents.size,\n      }))\n      .filter((entry) => entry.agentCount >= 2)\n      .sort((a, b) => b.agentCount - a.agentCount || a.token.localeCompare(b.token));\n\n    const semanticEnabled =\n      resolveConversationContextCapabilities(this.config).sharedCrossSignalSemantic === true\n      || resolveConversationContextCapabilities(this.config).crossSignalsSemantic === true;\n    const semanticTimeoutMs =\n      this.config.sharedCrossSignalSemanticTimeoutMs\n      ?? this.config.crossSignalsSemanticTimeoutMs\n      ?? 4000;\n    const semanticMaxCandidates = this.config.sharedCrossSignalSemanticMaxCandidates ?? 120;\n    let semanticApplied = false;\n    let semanticTimedOut = false;\n    let semanticCandidateCount = 0;\n    let semanticAddedOverlapCount = 0;\n    let mergedOverlaps = overlaps;\n    if (semanticEnabled) {\n      try {\n        const semanticResult = await computeSemanticOverlapsWithTimeout(\n          sources,\n          semanticTimeoutMs,\n          semanticMaxCandidates,\n        );\n        semanticTimedOut = semanticResult.timedOut;\n        semanticCandidateCount = semanticResult.candidateCount;\n        if (!semanticResult.timedOut && semanticResult.overlaps.length > 0) {\n          mergedOverlaps = mergeOverlaps(overlaps, semanticResult.overlaps);\n          semanticAddedOverlapCount = Math.max(0, mergedOverlaps.length - overlaps.length);\n          semanticApplied = semanticAddedOverlapCount > 0;\n        }\n      } catch (err) {\n        log.warn(`shared-context semantic cross-signals failed; fail-open to deterministic output: ${err}`);\n      }\n    }\n\n    const feedbackByDecision: SharedCrossSignalReport[\"feedbackByDecision\"] = {\n      approved: 0,\n      approved_with_feedback: 0,\n      rejected: 0,\n    };\n    for (const entry of feedback) {\n      feedbackByDecision[entry.decision] += 1;\n    }\n\n    const report: SharedCrossSignalReport = {\n      date,\n      generatedAt: new Date().toISOString(),\n      sourceCount: sources.length,\n      feedbackCount: feedback.length,\n      feedbackByDecision,\n      feedbackEntries: [...feedback].sort(compareFeedbackPriority),\n      sources,\n      overlaps: mergedOverlaps,\n      semantic: {\n        enabled: semanticEnabled,\n        applied: semanticApplied,\n        timedOut: semanticTimedOut,\n        candidateCount: semanticCandidateCount,\n        maxCandidates: Math.max(0, Math.floor(semanticMaxCandidates)),\n        addedOverlapCount: semanticAddedOverlapCount,\n      },\n    };\n\n    const crossSignalsPath = path.join(this.crossSignalsDir, `${date}.json`);\n    await writeFileAtomic(crossSignalsPath, `${JSON.stringify(report, null, 2)}\\n`);\n\n    const recurringThemeLines = mergedOverlaps.length === 0\n      ? [\"- No multi-agent topic overlap detected.\"]\n      : mergedOverlaps.slice(0, maxSummaryItems).map((entry) => formatOverlapLine(entry));\n    const riskSignals = [...feedback]\n      .filter((entry) => entry.decision !== \"approved\" || entry.severity === \"high\" || entry.severity === \"medium\")\n      .sort(compareFeedbackPriority)\n      .slice(0, maxSummaryItems);\n    const riskLines = riskSignals.length === 0\n      ? [\"- No explicit blockers or elevated review risks recorded.\"]\n      : riskSignals.map((entry) => formatFeedbackLine(entry));\n    const promotionCandidates = mergedOverlaps\n      .filter((entry) => entry.agentCount >= 3)\n      .slice(0, maxSummaryItems);\n    const promotionLines = promotionCandidates.length === 0\n      ? [\"- No promotion candidates yet.\"]\n      : promotionCandidates.map((entry) =>\n          `- Consider promoting \\`${entry.token}\\` into priorities or operating rules [sources: ${markdownLineList(entry.sourcePaths)}]`\n        );\n\n    const crossSignalsMarkdown = [\n      `# Cross-Signals — ${date}`,\n      \"\",\n      \"## Overview\",\n      `- Source outputs analyzed: ${sources.length}`,\n      `- Feedback entries analyzed: ${feedback.length}`,\n      `- Decision totals: approved=${feedbackByDecision.approved}, approved_with_feedback=${feedbackByDecision.approved_with_feedback}, rejected=${feedbackByDecision.rejected}`,\n      `- Semantic enhancer: ${semanticEnabled ? (semanticTimedOut ? \"enabled (timed out, fail-open)\" : semanticApplied ? \"enabled (applied)\" : \"enabled (no additional overlaps)\") : \"disabled\"}`,\n      `- JSON report: ${crossSignalsPath}`,\n      \"\",\n      \"## Recurring Themes\",\n      ...recurringThemeLines,\n      \"\",\n      \"## Risks And Blockers\",\n      ...riskLines,\n      \"\",\n      \"## Potential Promotions\",\n      ...promotionLines,\n      \"\",\n      \"## Sources\",\n      ...(sources.length === 0 ? [\"- (none)\"] : sources.map((source) =>\n        `- [${markdownLineText(source.agent)}] ${markdownLineText(source.title)} (${markdownLineText(source.path)}) [authority: ${source.authority}; sharedBy: ${markdownLineText(source.sharedBy)}]`\n      )),\n      \"\",\n    ].join(\"\\n\");\n\n    const crossSignalsMarkdownPath = path.join(this.crossSignalsDir, `${date}.md`);\n    await writeFileAtomic(crossSignalsMarkdownPath, crossSignalsMarkdown);\n\n    return {\n      date,\n      crossSignalsPath,\n      crossSignalsMarkdownPath,\n      overlapCount: mergedOverlaps.length,\n      report,\n    };\n  }\n\n  async curateDaily(opts: { date?: string; maxChars?: number }): Promise<SharedDailyCurationResult> {\n    const date = safeDateSegment(opts.date ?? ymd(new Date()));\n    return this.withDailySynthesisLock(date, () => this.curateDailyUnlocked({ ...opts, date }));\n  }\n\n  private async curateDailyUnlocked(opts: { date: string; maxChars?: number }): Promise<SharedDailyCurationResult> {\n    const date = opts.date;\n    const maxChars = Math.max(2_000, opts.maxChars ?? 20_000);\n    const crossSignals = await this.synthesizeCrossSignalsUnlocked({ date });\n    const feedbackLines = crossSignals.report.feedbackEntries.length === 0\n      ? [\"- (none)\"]\n      : crossSignals.report.feedbackEntries.map((entry) => formatFeedbackLine(entry));\n    const overlapBullets = crossSignals.report.overlaps.length === 0\n      ? [\"- No multi-agent topic overlap detected.\"]\n      : crossSignals.report.overlaps.slice(0, 8).map((entry) => formatOverlapLine(entry));\n\n    const md: string[] = [\n      `# Roundtable — ${date}`,\n      \"\",\n      \"## Notable Agent Outputs\",\n      ...(crossSignals.report.sources.length === 0\n        ? [\"- (none)\"]\n        : crossSignals.report.sources.map((source) =>\n            `- ${markdownLineText(source.title)} (${markdownLineText(source.path)}) [authority: ${source.authority}; sharedBy: ${markdownLineText(source.sharedBy)}]`)),\n      \"\",\n      \"## Feedback (Approve/Reject)\",\n      ...feedbackLines,\n      \"\",\n      \"## Cross-Signals\",\n      `- Source outputs analyzed: ${crossSignals.report.sourceCount}`,\n      `- Feedback entries analyzed: ${crossSignals.report.feedbackCount}`,\n      `- Decision totals: approved=${crossSignals.report.feedbackByDecision.approved}, approved_with_feedback=${crossSignals.report.feedbackByDecision.approved_with_feedback}, rejected=${crossSignals.report.feedbackByDecision.rejected}`,\n      `- Semantic enhancer: ${crossSignals.report.semantic.enabled ? (crossSignals.report.semantic.timedOut ? \"enabled (timed out, fail-open)\" : crossSignals.report.semantic.applied ? \"enabled (applied)\" : \"enabled (no additional overlaps)\") : \"disabled\"}`,\n      `- Cross-signals JSON: ${crossSignals.crossSignalsPath}`,\n      `- Cross-signals markdown: ${crossSignals.crossSignalsMarkdownPath}`,\n      ...overlapBullets,\n      \"\",\n    ];\n\n    const out = md.join(\"\\n\");\n    const trimmed = out.length > maxChars ? out.slice(0, maxChars) + \"\\n\\n...(trimmed)\\n\" : out;\n\n    const roundtablePath = path.join(this.roundtableDir, `${date}.md`);\n    await writeFileAtomic(roundtablePath, trimmed);\n\n    log.info(`shared-context curated daily roundtable: ${roundtablePath}`);\n    return {\n      date,\n      roundtablePath,\n      crossSignalsPath: crossSignals.crossSignalsPath,\n      crossSignalsMarkdownPath: crossSignals.crossSignalsMarkdownPath,\n      overlapCount: crossSignals.overlapCount,\n    };\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,kBAAkB;AAC3B,SAAS,OAAO,UAAU,SAAS,YAAY,WAAW,MAAM,QAAQ,UAAU;AAClF,OAAO,UAAU;AACjB,SAAS,SAAS;AAeX,IAAM,4BAA4B,EAAE,OAAO;AAAA,EAChD,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACvB,UAAU,EAAE,KAAK,CAAC,YAAY,0BAA0B,UAAU,CAAC;AAAA,EACnE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACxB,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA;AAAA,EACtB,UAAU,EAAE,OAAO,EAAE,SAAS;AAAA,EAC9B,SAAS,EAAE,OAAO,EAAE,SAAS;AAAA,EAC7B,UAAU,EAAE,KAAK,CAAC,OAAO,UAAU,MAAM,CAAC,EAAE,SAAS;AAAA,EACrD,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC9C,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EACrC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,EAAE,SAAS;AAAA,EAC1C,qBAAqB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAChD,mBAAmB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EAC9C,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS;AACrC,CAAC;AAID,SAAS,SAAS,GAAmB;AACnC,MAAI,OAAO,EAAE,YAAY,EAAE,QAAQ,eAAe,GAAG;AAErD,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,UAAU,KAAK,KAAK,MAAM,IAAK;AACnD,MAAI,MAAM,KAAK;AACf,SAAO,MAAM,SAAS,KAAK,MAAM,CAAC,MAAM,IAAK;AAC7C,SAAO,KAAK,MAAM,OAAO,GAAG,EAAE,MAAM,GAAG,EAAE,KAAK;AAChD;AAEA,SAAS,gBAAgB,GAAW,OAAuB;AACzD,MAAI,EAAE,WAAW,EAAG,OAAM,IAAI,MAAM,GAAG,KAAK,oBAAoB;AAChE,MAAI,SAAS,KAAK,CAAC,EAAG,OAAM,IAAI,MAAM,GAAG,KAAK,+BAA+B;AAC7E,QAAM,UAAU,mBAAmB,CAAC;AACpC,MAAI,YAAY,OAAO,YAAY,MAAM;AACvC,WAAO,QAAQ,QAAQ,OAAO,KAAK;AAAA,EACrC;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,GAAmB;AAChD,MAAI;AACF,WAAO,mBAAmB,CAAC;AAAA,EAC7B,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,2BAA2B,OAAuB;AACzD,MAAI,MAAM,UAAU,KAAK,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAAG;AACrE,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,UAAI,OAAO,WAAW,SAAU,QAAO;AAAA,IACzC,QAAQ;AAAA,IAER;AACA,WAAO,MAAM,MAAM,GAAG,EAAE,EAAE,QAAQ,QAAQ,GAAG,EAAE,QAAQ,SAAS,IAAI;AAAA,EACtE;AACA,MAAI,MAAM,UAAU,KAAK,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAAG;AACrE,WAAO,MAAM,MAAM,GAAG,EAAE,EAAE,QAAQ,OAAO,GAAG;AAAA,EAC9C;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,OAAuB;AACtD,SAAO,KAAK,UAAU,KAAK;AAC7B;AAEA,SAAS,sBAAsB,KAAa,KAA4B;AACtE,QAAM,cAAc,IAAI,MAAM,wCAAwC,IAAI,CAAC;AAC3E,MAAI,CAAC,YAAa,QAAO;AACzB,aAAW,QAAQ,YAAY,MAAM,OAAO,GAAG;AAC7C,QAAI,CAAC,KAAK,WAAW,GAAG,GAAG,GAAG,EAAG;AACjC,UAAM,QAAQ,KAAK,MAAM,IAAI,SAAS,CAAC,EAAE,KAAK;AAC9C,WAAO,QAAQ,2BAA2B,KAAK,IAAI;AAAA,EACrD;AACA,SAAO;AACT;AAEA,SAAS,IAAI,GAAiB;AAC5B,SAAO,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE;AACpC;AAEA,SAAS,gBAAgB,MAAsB;AAC7C,MAAI,CAAC,sBAAsB,KAAK,IAAI,GAAG;AACrC,UAAM,IAAI,MAAM,gCAAgC,KAAK,UAAU,IAAI,CAAC,uBAAuB;AAAA,EAC7F;AACA,QAAM,SAAS,oBAAI,KAAK,GAAG,IAAI,gBAAgB;AAC/C,MAAI,CAAC,OAAO,SAAS,OAAO,QAAQ,CAAC,KAAK,OAAO,YAAY,EAAE,MAAM,GAAG,EAAE,MAAM,MAAM;AACpF,UAAM,IAAI,MAAM,gCAAgC,KAAK,UAAU,IAAI,CAAC,iCAAiC;AAAA,EACvG;AACA,SAAO;AACT;AAEA,IAAM,yBAAyB,oBAAI,IAAI;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,mBAAmB,MAAc,YAAoB,IAAc;AAC1E,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,MAAgB,CAAC;AACvB,QAAM,SAAS,KACZ,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,MAAM,KAAK,EACX,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAC3B,OAAO,CAAC,UAAU,MAAM,UAAU,CAAC,EACnC,OAAO,CAAC,UAAU,CAAC,uBAAuB,IAAI,KAAK,CAAC;AAEvD,aAAW,SAAS,QAAQ;AAC1B,QAAI,KAAK,IAAI,KAAK,EAAG;AACrB,SAAK,IAAI,KAAK;AACd,QAAI,KAAK,KAAK;AACd,QAAI,IAAI,UAAU,UAAW;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,MAAsB;AAClD,MAAI,CAAC,KAAK,WAAW,OAAO,EAAG,QAAO;AACtC,QAAM,UAAU,KAAK,QAAQ,WAAW,CAAC;AACzC,MAAI,YAAY,GAAI,QAAO;AAC3B,SAAO,KAAK,MAAM,UAAU,CAAC;AAC/B;AAEA,SAAS,aAAa,OAAuB;AAC3C,MAAI,OAAO,MAAM,YAAY;AAC7B,MAAI,KAAK,SAAS,UAAU,KAAK,KAAK,SAAS,GAAG;AAChD,WAAO,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,EAC7B,WACS,KAAK,SAAS,SAAS,KAAK,KAAK,SAAS,GAAG;AACpD,WAAO,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,EAC7B,WAAW,KAAK,SAAS,UAAU,KAAK,KAAK,SAAS,GAAG;AACvD,WAAO,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,EAC7B,WAAW,KAAK,SAAS,SAAS,KAAK,KAAK,SAAS,GAAG;AACtD,WAAO,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,EAC7B,OAAO;AACL,UAAM,WAAW;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,eAAW,UAAU,UAAU;AAC7B,UAAI,KAAK,SAAS,OAAO,SAAS,KAAK,KAAK,SAAS,MAAM,GAAG;AAC5D,eAAO,KAAK,MAAM,GAAG,CAAC,OAAO,MAAM;AACnC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,KAAK,SAAS,KAAK,KAAK,SAAS,GAAG,GAAG;AACzC,WAAO,KAAK,MAAM,GAAG,EAAE;AAAA,EACzB;AACA,SAAO;AACT;AAEA,SAAS,cACP,MACA,OAC4B;AAC5B,QAAM,SAAS,oBAAI,IAA+D;AAClF,aAAW,SAAS,CAAC,GAAG,MAAM,GAAG,KAAK,GAAG;AACvC,UAAM,WAAW,OAAO,IAAI,MAAM,KAAK;AACvC,QAAI,UAAU;AACZ,iBAAW,SAAS,MAAM,OAAQ,UAAS,OAAO,IAAI,KAAK;AAC3D,iBAAW,cAAc,MAAM,YAAa,UAAS,YAAY,IAAI,UAAU;AAAA,IACjF,OAAO;AACL,aAAO,IAAI,MAAM,OAAO;AAAA,QACtB,QAAQ,IAAI,IAAI,MAAM,MAAM;AAAA,QAC5B,aAAa,IAAI,IAAI,MAAM,WAAW;AAAA,MACxC,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,EACxB,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO;AAAA,IACxB;AAAA,IACA,QAAQ,CAAC,GAAG,MAAM,MAAM,EAAE,KAAK;AAAA,IAC/B,aAAa,CAAC,GAAG,MAAM,WAAW,EAAE,KAAK;AAAA,IACzC,YAAY,MAAM,OAAO;AAAA,EAC3B,EAAE,EACD,OAAO,CAAC,UAAU,MAAM,cAAc,CAAC,EACvC,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AACjF;AAEA,eAAe,iCACb,SACA,eACA,aAC8F;AAC9F,QAAM,YAAmE,CAAC;AAC1E,aAAW,UAAU,SAAS;AAC5B,eAAW,SAAS,OAAO,QAAQ;AACjC,UAAI,KAAK,IAAI,KAAK,YAAa,QAAO,EAAE,UAAU,CAAC,GAAG,gBAAgB,UAAU,QAAQ,UAAU,KAAK;AACvG,YAAM,IAAI,QAAc,CAAC,YAAY,aAAa,OAAO,CAAC;AAC1D,gBAAU,KAAK,EAAE,OAAO,OAAO,OAAO,OAAO,MAAM,OAAO,KAAK,CAAC;AAChE,UAAI,UAAU,UAAU,cAAe;AAAA,IACzC;AACA,QAAI,UAAU,UAAU,cAAe;AAAA,EACzC;AAEA,QAAM,SAAS,oBAAI,IAAsE;AACzF,aAAW,OAAO,WAAW;AAC3B,QAAI,KAAK,IAAI,KAAK,YAAa,QAAO,EAAE,UAAU,CAAC,GAAG,gBAAgB,UAAU,QAAQ,UAAU,KAAK;AACvG,UAAM,IAAI,QAAc,CAAC,YAAY,aAAa,OAAO,CAAC;AAC1D,UAAM,OAAO,aAAa,IAAI,KAAK;AACnC,QAAI,KAAK,SAAS,EAAG;AACrB,UAAM,YAAY,OAAO,IAAI,IAAI,KAAK,oBAAI,IAAyD;AACnG,UAAM,aAAa,UAAU,IAAI,IAAI,KAAK,KAAK,EAAE,QAAQ,oBAAI,IAAY,GAAG,OAAO,oBAAI,IAAY,EAAE;AACrG,eAAW,OAAO,IAAI,IAAI,KAAK;AAC/B,eAAW,MAAM,IAAI,IAAI,IAAI;AAC7B,cAAU,IAAI,IAAI,OAAO,UAAU;AACnC,WAAO,IAAI,MAAM,SAAS;AAAA,EAC5B;AAEA,QAAM,WAAuC,CAAC;AAC9C,aAAW,CAAC,MAAM,QAAQ,KAAK,OAAO,QAAQ,GAAG;AAC/C,QAAI,KAAK,IAAI,KAAK,YAAa,QAAO,EAAE,UAAU,CAAC,GAAG,gBAAgB,UAAU,QAAQ,UAAU,KAAK;AACvG,UAAM,IAAI,QAAc,CAAC,YAAY,aAAa,OAAO,CAAC;AAC1D,QAAI,SAAS,OAAO,EAAG;AACvB,UAAM,SAAS,oBAAI,IAAY;AAC/B,UAAM,cAAc,oBAAI,IAAY;AACpC,eAAW,SAAS,SAAS,OAAO,GAAG;AACrC,iBAAW,SAAS,MAAM,OAAQ,QAAO,IAAI,KAAK;AAClD,iBAAW,cAAc,MAAM,MAAO,aAAY,IAAI,UAAU;AAAA,IAClE;AACA,QAAI,OAAO,OAAO,EAAG;AACrB,aAAS,KAAK;AAAA,MACZ,OAAO,YAAY,IAAI;AAAA,MACvB,QAAQ,CAAC,GAAG,MAAM,EAAE,KAAK;AAAA,MACzB,aAAa,CAAC,GAAG,WAAW,EAAE,KAAK;AAAA,MACnC,YAAY,OAAO;AAAA,IACrB,CAAC;AAAA,EACH;AAEA,WAAS,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AACrF,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB,UAAU;AAAA,IAC1B,UAAU;AAAA,EACZ;AACF;AAEA,eAAe,mCACb,SACA,WACA,eAC8F;AAC9F,QAAM,gBAAgB,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,CAAC;AACvD,QAAM,oBAAoB,KAAK,IAAI,GAAG,KAAK,MAAM,aAAa,CAAC;AAC/D,MAAI,sBAAsB,KAAK,QAAQ,WAAW,GAAG;AACnD,WAAO,EAAE,UAAU,CAAC,GAAG,gBAAgB,GAAG,UAAU,MAAM;AAAA,EAC5D;AACA,QAAM,cAAc,KAAK,IAAI,IAAI;AACjC,SAAO,iCAAiC,SAAS,mBAAmB,WAAW;AACjF;AAuDA,SAAS,yBAAyB,UAAmD;AACnF,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,EACX;AACF;AAEA,SAAS,yBAAyB,UAAmD;AACnF,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAEA,SAAS,wBAAwB,GAAwB,GAAgC;AACvF,SACE,yBAAyB,EAAE,QAAQ,IAAI,yBAAyB,EAAE,QAAQ,KACvE,yBAAyB,EAAE,QAAQ,IAAI,yBAAyB,EAAE,QAAQ,KAC1E,EAAE,KAAK,cAAc,EAAE,IAAI;AAElC;AAEA,SAAS,iBAAiB,OAAuB;AAC/C,SAAO,MAAM,QAAQ,YAAY,GAAG,EAAE,QAAQ,QAAQ,GAAG,EAAE,KAAK;AAClE;AAEA,SAAS,iBAAiB,QAAmC;AAC3D,SAAO,OAAO,IAAI,gBAAgB,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI;AAC/D;AAEA,SAAS,mBAAmB,OAAoC;AAC9D,QAAM,SAAmB,CAAC,aAAa,iBAAiB,MAAM,IAAI,CAAC,EAAE;AACrE,MAAI,MAAM,SAAU,QAAO,KAAK,aAAa,iBAAiB,MAAM,QAAQ,CAAC,EAAE;AAC/E,MAAI,MAAM,MAAM,OAAQ,QAAO,KAAK,SAAS,iBAAiB,MAAM,IAAI,CAAC,EAAE;AAC3E,SAAO,MAAM,iBAAiB,MAAM,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,iBAAiB,MAAM,MAAM,CAAC,KAAK,OAAO,KAAK,IAAI,CAAC;AACxH;AAEA,SAAS,kBAAkB,OAAyC;AAClE,SAAO,OAAO,MAAM,KAAK,OAAO,MAAM,UAAU,YAAY,iBAAiB,MAAM,MAAM,CAAC,eAAe,iBAAiB,MAAM,WAAW,CAAC;AAC9I;AAEA,eAAe,gBAAgB,UAAkB,SAAgC;AAC/E,QAAM,MAAM,KAAK,QAAQ,QAAQ,GAAG,EAAE,WAAW,KAAK,CAAC;AACvD,QAAM,WAAW,KAAK;AAAA,IACpB,KAAK,QAAQ,QAAQ;AAAA,IACrB,IAAI,KAAK,SAAS,QAAQ,CAAC,IAAI,QAAQ,GAAG,IAAI,WAAW,CAAC;AAAA,EAC5D;AACA,MAAI;AACF,UAAM,UAAU,UAAU,SAAS,EAAE,UAAU,SAAS,MAAM,KAAK,CAAC;AACpE,UAAM,OAAO,UAAU,QAAQ;AAAA,EACjC,SAAS,OAAO;AACd,UAAM,GAAG,UAAU,EAAE,OAAO,KAAK,CAAC,EAAE,MAAM,MAAM,MAAS;AACzD,UAAM;AAAA,EACR;AACF;AAEO,SAAS,wBAAwB,QAA8B;AACpE,SAAO,OAAO,OAAO,qBAAqB,YAAY,OAAO,iBAAiB,SAAS,IACnF,gBAAgB,OAAO,gBAAgB,IACvC,KAAK,KAAK,gBAAgB,OAAO,YAAY,GAAG,gBAAgB;AACtE;AAEO,IAAM,uBAAN,MAA2B;AAAA,EAYhC,YAA6B,QAAsB;AAAtB;AAC3B,UAAM,OAAO,wBAAwB,MAAM;AAE3C,SAAK,MAAM;AACX,SAAK,iBAAiB,KAAK,KAAK,MAAM,eAAe;AACrD,SAAK,sBAAsB,KAAK,KAAK,MAAM,qBAAqB;AAChE,SAAK,aAAa,KAAK,KAAK,MAAM,eAAe;AACjD,SAAK,gBAAgB,KAAK,KAAK,MAAM,YAAY;AACjD,SAAK,cAAc,KAAK,KAAK,MAAM,UAAU;AAC7C,SAAK,oBAAoB,KAAK,KAAK,KAAK,aAAa,aAAa;AAClE,SAAK,kBAAkB,KAAK,KAAK,MAAM,eAAe;AACtD,SAAK,wBAAwB,OAAO,uCAAuC;AAAA,EAC7E;AAAA,EAZ6B;AAAA,EAXpB;AAAA,EACQ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,uBAAuB,oBAAI,IAA2B;AAAA,EAgBvE,MAAM,kBAAiC;AACrC,UAAM,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;AACzC,UAAM,MAAM,KAAK,YAAY,EAAE,WAAW,KAAK,CAAC;AAChD,UAAM,MAAM,KAAK,eAAe,EAAE,WAAW,KAAK,CAAC;AACnD,UAAM,MAAM,KAAK,aAAa,EAAE,WAAW,KAAK,CAAC;AACjD,UAAM,MAAM,KAAK,iBAAiB,EAAE,WAAW,KAAK,CAAC;AACrD,UAAM,MAAM,KAAK,KAAK,KAAK,KAAK,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAC/D,UAAM,MAAM,KAAK,KAAK,KAAK,KAAK,MAAM,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5D,UAAM,MAAM,KAAK,KAAK,KAAK,KAAK,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AAChE,UAAM,MAAM,KAAK,KAAK,KAAK,KAAK,kBAAkB,GAAG,EAAE,WAAW,KAAK,CAAC;AAGxE,UAAM,KAAK;AAAA,MACT,KAAK;AAAA,MACL;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,KAAK,IAAI;AAAA,IACb;AACA,UAAM,KAAK;AAAA,MACT,KAAK;AAAA,MACL;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,EAAE,KAAK,IAAI;AAAA,IACb;AACA,UAAM,KAAK,WAAW,KAAK,mBAAmB,EAAE;AAAA,EAClD;AAAA,EAEA,MAAc,WAAW,IAAY,SAAgC;AACnE,QAAI;AACF,YAAM,KAAK,EAAE;AAAA,IACf,QAAQ;AACN,YAAM,UAAU,IAAI,SAAS,OAAO;AAAA,IACtC;AAAA,EACF;AAAA,EAEA,MAAM,eAAe,QAAuC;AAC1D,mBAAe,QAAQ,wCAAwC;AAC/D,QAAI;AACF,YAAM,UAAU,MAAM,SAAS,KAAK,gBAAgB,EAAE,UAAU,SAAS,OAAO,CAAC;AACjF,qBAAe,QAAQ,wCAAwC;AAC/D,aAAO;AAAA,IACT,QAAQ;AACN,qBAAe,QAAQ,wCAAwC;AAC/D,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,qBAAqB,QAAuC;AAChE,mBAAe,QAAQ,wCAAwC;AAC/D,QAAI;AACF,YAAM,SAAS,MAAM,QAAQ,KAAK,aAAa,GAC5C,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAC/B,KAAK,EACL,QAAQ;AACX,qBAAe,QAAQ,wCAAwC;AAC/D,YAAM,KAAK,MAAM,CAAC,IAAI,KAAK,KAAK,KAAK,eAAe,MAAM,CAAC,CAAC,IAAI;AAChE,UAAI,CAAC,GAAI,QAAO;AAChB,YAAM,UAAU,MAAM,SAAS,IAAI,EAAE,UAAU,SAAS,OAAO,CAAC;AAChE,qBAAe,QAAQ,wCAAwC;AAC/D,aAAO;AAAA,IACT,QAAQ;AACN,qBAAe,QAAQ,wCAAwC;AAC/D,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,uBAAuB,QAAuC;AAClE,mBAAe,QAAQ,2CAA2C;AAClE,QAAI;AACF,YAAM,SAAS,MAAM,QAAQ,KAAK,eAAe,GAC9C,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAC/B,KAAK,EACL,QAAQ;AACX,qBAAe,QAAQ,2CAA2C;AAClE,YAAM,KAAK,MAAM,CAAC,IAAI,KAAK,KAAK,KAAK,iBAAiB,MAAM,CAAC,CAAC,IAAI;AAClE,UAAI,CAAC,GAAI,QAAO;AAChB,YAAM,UAAU,MAAM,SAAS,IAAI,EAAE,UAAU,SAAS,OAAO,CAAC;AAChE,qBAAe,QAAQ,2CAA2C;AAClE,aAAO;AAAA,IACT,QAAQ;AACN,qBAAe,QAAQ,2CAA2C;AAClE,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,iBAAiB,MAyBH;AAClB,UAAM,WAAW,mBAAmB;AAAA,MAClC,SAAS,KAAK;AAAA,MACd,uBAAuB,KAAK;AAAA,MAC5B,oBAAoB,KAAK;AAAA,IAC3B,CAAC;AACD,UAAM,YAAY,KAAK,aAAa,oBAAI,KAAK;AAC7C,UAAM,OAAO,IAAI,SAAS;AAC1B,UAAM,OAAO,UAAU,YAAY,EAAE,MAAM,IAAI,EAAE,EAAE,QAAQ,MAAM,EAAE;AACnE,UAAM,OAAO,SAAS,KAAK,KAAK;AAChC,UAAM,mBAAmB,gBAAgB,SAAS,OAAO,SAAS;AAElE,UAAM,WAAW,qBAAqB;AAAA,MACpC,QAAQ,SAAS;AAAA,MACjB,WAAW,KAAK;AAAA,MAChB,WAAW,KAAK;AAAA,MAChB,YAAY,KAAK;AAAA,MACjB,cAAc,KAAK;AAAA,MACnB,OAAO,UAAU,QAAQ;AAAA,IAC3B,CAAC;AAED,UAAM,MAAM,KAAK,KAAK,KAAK,YAAY,kBAAkB,IAAI;AAC7D,UAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AAEpC,UAAM,OAAO;AAAA,MACX;AAAA,MACA;AAAA,MACA,UAAU,wBAAwB,SAAS,KAAK,CAAC;AAAA,MACjD,cAAc,UAAU,YAAY,CAAC;AAAA,MACrC,UAAU,wBAAwB,KAAK,MAAM,QAAQ,OAAO,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,CAAC;AAAA,MAC/E,GAAG,2BAA2B,QAAQ;AAAA,MACtC;AAAA,MACA;AAAA,MACA,KAAK,QAAQ,QAAQ;AAAA,MACrB;AAAA,IACF,EAAE,KAAK,IAAI;AAEX,aAAS,UAAU,GAAG,UAAU,KAAK,WAAW;AAC9C,YAAM,SAAS,YAAY,IAAI,KAAK,IAAI,UAAU,CAAC;AACnD,YAAM,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI,IAAI,GAAG,MAAM,KAAK;AACvD,UAAI;AACF,cAAM,UAAU,IAAI,MAAM,EAAE,UAAU,SAAS,MAAM,KAAK,CAAC;AAC3D,eAAO;AAAA,MACT,SAAS,OAAO;AACd,YAAI,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS,SAAU;AAC1E,cAAM;AAAA,MACR;AAAA,IACF;AAEA,UAAM,IAAI,MAAM,4DAA4D,SAAS,KAAK,EAAE;AAAA,EAC9F;AAAA,EAEA,MAAM,eAAe,OAA2C;AAC9D,UAAM,SAAS,0BAA0B,MAAM,KAAK;AACpD,UAAM,WAAW,KAAK,mBAAmB,KAAK,UAAU,MAAM,IAAI,MAAM,OAAO;AAAA,EACjF;AAAA,EAEA,MAAM,sBAAsB,MAAwD;AAClF,UAAM,SAAQ,oBAAI,KAAK,GAAE,YAAY;AACrC,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA,MAAM,KAAK,KAAK,KAAK,OAAO;AAAA,MAC5B;AAAA,MACA,KAAK,KAAK,QAAQ;AAAA,MAClB;AAAA,IACF,EAAE,KAAK,IAAI;AACX,UAAM,WAAW,KAAK,qBAAqB,OAAO,OAAO;AAAA,EAC3D;AAAA,EAEA,MAAc,uBAA0B,MAAc,IAAkC;AACtF,UAAM,WAAW,KAAK,qBAAqB,IAAI,IAAI,KAAK,QAAQ,QAAQ;AACxE,QAAI;AACJ,UAAM,UAAU,IAAI,QAAc,CAAC,YAAY;AAC7C,uBAAiB;AAAA,IACnB,CAAC;AACD,UAAM,SAAS,SAAS,MAAM,MAAM,MAAS,EAAE,KAAK,MAAM,OAAO;AACjE,SAAK,qBAAqB,IAAI,MAAM,MAAM;AAC1C,UAAM,SAAS,MAAM,MAAM,MAAS;AACpC,QAAI;AACF,aAAO,MAAM,GAAG;AAAA,IAClB,UAAE;AACA,qBAAe;AACf,UAAI,KAAK,qBAAqB,IAAI,IAAI,MAAM,QAAQ;AAClD,aAAK,qBAAqB,OAAO,IAAI;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,uBAAuB,MAGiB;AAC5C,UAAM,OAAO,gBAAgB,KAAK,QAAQ,IAAI,oBAAI,KAAK,CAAC,CAAC;AACzD,WAAO,KAAK,uBAAuB,MAAM,MAAM,KAAK,+BAA+B;AAAA,MACjF;AAAA,MACA,iBAAiB,KAAK;AAAA,IACxB,CAAC,CAAC;AAAA,EACJ;AAAA,EAEA,MAAc,+BAA+B,MAGC;AAC5C,UAAM,OAAO,KAAK;AAClB,UAAM,kBAAkB,KAAK,IAAI,GAAG,KAAK,mBAAmB,CAAC;AAG7D,UAAM,UAAwG,CAAC;AAC/G,QAAI;AACF,YAAM,UAAU,MAAM,QAAQ,KAAK,YAAY,EAAE,eAAe,KAAK,CAAC,GACnE,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAC9C,iBAAW,KAAK,QAAQ;AACtB,YAAI,CAAC,EAAE,YAAY,EAAG;AACtB,cAAM,SAAS,KAAK,KAAK,KAAK,YAAY,EAAE,MAAM,IAAI;AACtD,YAAI;AACF,gBAAM,SAAS,MAAM,QAAQ,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,EAAE,KAAK;AAC5E,qBAAW,KAAK,OAAO;AACrB,kBAAM,IAAI,KAAK,KAAK,QAAQ,CAAC;AAC7B,kBAAM,MAAM,MAAM,SAAS,GAAG,OAAO;AACrC,kBAAM,QAAQ,sBAAsB,KAAK,OAAO,KAAK;AACrD,kBAAM,QAAQ,sBAAsB,KAAK,OAAO,KAAK,sBAAsB,EAAE,IAAI;AACjF,kBAAM,WAAW,oBAAoB;AAAA,cACnC,UAAU,sBAAsB,KAAK,UAAU;AAAA,cAC/C,WAAW,sBAAsB,KAAK,WAAW;AAAA,cACjD,WAAW,sBAAsB,KAAK,WAAW;AAAA,cACjD,YAAY,sBAAsB,KAAK,YAAY;AAAA,YACrD,CAAC;AACD,oBAAQ,KAAK,EAAE,OAAO,MAAM,GAAG,OAAO,KAAK,SAAS,CAAC;AAAA,UACvD;AAAA,QACF,QAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AACA,YAAQ;AAAA,MACN,CAAC,GAAG,MACF,EAAE,MAAM,cAAc,EAAE,KAAK,KAC1B,EAAE,KAAK,cAAc,EAAE,IAAI,KAC3B,EAAE,MAAM,cAAc,EAAE,KAAK;AAAA,IACpC;AAGA,UAAM,WAAkC,CAAC;AACzC,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,mBAAmB,OAAO;AAC1D,iBAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,YAAI,CAAC,KAAK,KAAK,EAAG;AAClB,YAAI;AACF,gBAAM,MAAM,KAAK,MAAM,IAAI;AAC3B,gBAAM,SAAS,0BAA0B,UAAU,GAAG;AACtD,cAAI,CAAC,OAAO,QAAS;AACrB,cAAI,OAAO,OAAO,KAAK,IAAI,EAAE,WAAW,IAAI,EAAG,UAAS,KAAK,OAAO,IAAI;AAAA,QAC1E,QAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,UAAM,UAAqC,QAAQ,IAAI,CAAC,WAAW;AACjE,YAAM,OAAO,qBAAqB,OAAO,GAAG;AAC5C,aAAO;AAAA,QACL,OAAO,OAAO;AAAA,QACd,MAAM,OAAO;AAAA,QACb,OAAO,OAAO;AAAA,QACd,QAAQ,mBAAmB,GAAG,OAAO,KAAK;AAAA,EAAK,IAAI,EAAE;AAAA,QACrD,WAAW,qBAAqB,OAAO,UAAU,KAAK,qBAAqB;AAAA,QAC3E,UAAU,OAAO,SAAS,YAAY,OAAO;AAAA,MAC/C;AAAA,IACF,CAAC;AAED,UAAM,aAAa,oBAAI,IAA+D;AACtF,eAAW,UAAU,SAAS;AAC5B,iBAAW,SAAS,OAAO,QAAQ;AACjC,cAAM,WAAW,WAAW,IAAI,KAAK;AACrC,YAAI,UAAU;AACZ,mBAAS,OAAO,IAAI,OAAO,KAAK;AAChC,mBAAS,YAAY,IAAI,OAAO,IAAI;AAAA,QACtC,OAAO;AACL,qBAAW,IAAI,OAAO;AAAA,YACpB,QAAQ,oBAAI,IAAI,CAAC,OAAO,KAAK,CAAC;AAAA,YAC9B,aAAa,oBAAI,IAAI,CAAC,OAAO,IAAI,CAAC;AAAA,UACpC,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAEA,UAAM,WAAuC,CAAC,GAAG,WAAW,QAAQ,CAAC,EAClE,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO;AAAA,MACpB;AAAA,MACA,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK;AAAA,MAC3B,aAAa,CAAC,GAAG,EAAE,WAAW,EAAE,KAAK;AAAA,MACrC,YAAY,EAAE,OAAO;AAAA,IACvB,EAAE,EACD,OAAO,CAAC,UAAU,MAAM,cAAc,CAAC,EACvC,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AAE/E,UAAM,kBACJ,uCAAuC,KAAK,MAAM,EAAE,8BAA8B,QAC/E,uCAAuC,KAAK,MAAM,EAAE,yBAAyB;AAClF,UAAM,oBACJ,KAAK,OAAO,sCACT,KAAK,OAAO,iCACZ;AACL,UAAM,wBAAwB,KAAK,OAAO,0CAA0C;AACpF,QAAI,kBAAkB;AACtB,QAAI,mBAAmB;AACvB,QAAI,yBAAyB;AAC7B,QAAI,4BAA4B;AAChC,QAAI,iBAAiB;AACrB,QAAI,iBAAiB;AACnB,UAAI;AACF,cAAM,iBAAiB,MAAM;AAAA,UAC3B;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,2BAAmB,eAAe;AAClC,iCAAyB,eAAe;AACxC,YAAI,CAAC,eAAe,YAAY,eAAe,SAAS,SAAS,GAAG;AAClE,2BAAiB,cAAc,UAAU,eAAe,QAAQ;AAChE,sCAA4B,KAAK,IAAI,GAAG,eAAe,SAAS,SAAS,MAAM;AAC/E,4BAAkB,4BAA4B;AAAA,QAChD;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,KAAK,oFAAoF,GAAG,EAAE;AAAA,MACpG;AAAA,IACF;AAEA,UAAM,qBAAoE;AAAA,MACxE,UAAU;AAAA,MACV,wBAAwB;AAAA,MACxB,UAAU;AAAA,IACZ;AACA,eAAW,SAAS,UAAU;AAC5B,yBAAmB,MAAM,QAAQ,KAAK;AAAA,IACxC;AAEA,UAAM,SAAkC;AAAA,MACtC;AAAA,MACA,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC,aAAa,QAAQ;AAAA,MACrB,eAAe,SAAS;AAAA,MACxB;AAAA,MACA,iBAAiB,CAAC,GAAG,QAAQ,EAAE,KAAK,uBAAuB;AAAA,MAC3D;AAAA,MACA,UAAU;AAAA,MACV,UAAU;AAAA,QACR,SAAS;AAAA,QACT,SAAS;AAAA,QACT,UAAU;AAAA,QACV,gBAAgB;AAAA,QAChB,eAAe,KAAK,IAAI,GAAG,KAAK,MAAM,qBAAqB,CAAC;AAAA,QAC5D,mBAAmB;AAAA,MACrB;AAAA,IACF;AAEA,UAAM,mBAAmB,KAAK,KAAK,KAAK,iBAAiB,GAAG,IAAI,OAAO;AACvE,UAAM,gBAAgB,kBAAkB,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,CAAC;AAAA,CAAI;AAE9E,UAAM,sBAAsB,eAAe,WAAW,IAClD,CAAC,0CAA0C,IAC3C,eAAe,MAAM,GAAG,eAAe,EAAE,IAAI,CAAC,UAAU,kBAAkB,KAAK,CAAC;AACpF,UAAM,cAAc,CAAC,GAAG,QAAQ,EAC7B,OAAO,CAAC,UAAU,MAAM,aAAa,cAAc,MAAM,aAAa,UAAU,MAAM,aAAa,QAAQ,EAC3G,KAAK,uBAAuB,EAC5B,MAAM,GAAG,eAAe;AAC3B,UAAM,YAAY,YAAY,WAAW,IACrC,CAAC,2DAA2D,IAC5D,YAAY,IAAI,CAAC,UAAU,mBAAmB,KAAK,CAAC;AACxD,UAAM,sBAAsB,eACzB,OAAO,CAAC,UAAU,MAAM,cAAc,CAAC,EACvC,MAAM,GAAG,eAAe;AAC3B,UAAM,iBAAiB,oBAAoB,WAAW,IAClD,CAAC,gCAAgC,IACjC,oBAAoB;AAAA,MAAI,CAAC,UACvB,0BAA0B,MAAM,KAAK,mDAAmD,iBAAiB,MAAM,WAAW,CAAC;AAAA,IAC7H;AAEJ,UAAM,uBAAuB;AAAA,MAC3B,0BAAqB,IAAI;AAAA,MACzB;AAAA,MACA;AAAA,MACA,8BAA8B,QAAQ,MAAM;AAAA,MAC5C,gCAAgC,SAAS,MAAM;AAAA,MAC/C,+BAA+B,mBAAmB,QAAQ,4BAA4B,mBAAmB,sBAAsB,cAAc,mBAAmB,QAAQ;AAAA,MACxK,wBAAwB,kBAAmB,mBAAmB,mCAAmC,kBAAkB,sBAAsB,qCAAsC,UAAU;AAAA,MACzL,kBAAkB,gBAAgB;AAAA,MAClC;AAAA,MACA;AAAA,MACA,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,GAAI,QAAQ,WAAW,IAAI,CAAC,UAAU,IAAI,QAAQ;AAAA,QAAI,CAAC,WACrD,MAAM,iBAAiB,OAAO,KAAK,CAAC,KAAK,iBAAiB,OAAO,KAAK,CAAC,KAAK,iBAAiB,OAAO,IAAI,CAAC,iBAAiB,OAAO,SAAS,eAAe,iBAAiB,OAAO,QAAQ,CAAC;AAAA,MAC5L;AAAA,MACA;AAAA,IACF,EAAE,KAAK,IAAI;AAEX,UAAM,2BAA2B,KAAK,KAAK,KAAK,iBAAiB,GAAG,IAAI,KAAK;AAC7E,UAAM,gBAAgB,0BAA0B,oBAAoB;AAEpE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,cAAc,eAAe;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,YAAY,MAAgF;AAChG,UAAM,OAAO,gBAAgB,KAAK,QAAQ,IAAI,oBAAI,KAAK,CAAC,CAAC;AACzD,WAAO,KAAK,uBAAuB,MAAM,MAAM,KAAK,oBAAoB,EAAE,GAAG,MAAM,KAAK,CAAC,CAAC;AAAA,EAC5F;AAAA,EAEA,MAAc,oBAAoB,MAA+E;AAC/G,UAAM,OAAO,KAAK;AAClB,UAAM,WAAW,KAAK,IAAI,KAAO,KAAK,YAAY,GAAM;AACxD,UAAM,eAAe,MAAM,KAAK,+BAA+B,EAAE,KAAK,CAAC;AACvE,UAAM,gBAAgB,aAAa,OAAO,gBAAgB,WAAW,IACjE,CAAC,UAAU,IACX,aAAa,OAAO,gBAAgB,IAAI,CAAC,UAAU,mBAAmB,KAAK,CAAC;AAChF,UAAM,iBAAiB,aAAa,OAAO,SAAS,WAAW,IAC3D,CAAC,0CAA0C,IAC3C,aAAa,OAAO,SAAS,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,UAAU,kBAAkB,KAAK,CAAC;AAEpF,UAAM,KAAe;AAAA,MACnB,uBAAkB,IAAI;AAAA,MACtB;AAAA,MACA;AAAA,MACA,GAAI,aAAa,OAAO,QAAQ,WAAW,IACvC,CAAC,UAAU,IACX,aAAa,OAAO,QAAQ,IAAI,CAAC,WAC/B,KAAK,iBAAiB,OAAO,KAAK,CAAC,KAAK,iBAAiB,OAAO,IAAI,CAAC,iBAAiB,OAAO,SAAS,eAAe,iBAAiB,OAAO,QAAQ,CAAC,GAAG;AAAA,MAC/J;AAAA,MACA;AAAA,MACA,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,8BAA8B,aAAa,OAAO,WAAW;AAAA,MAC7D,gCAAgC,aAAa,OAAO,aAAa;AAAA,MACjE,+BAA+B,aAAa,OAAO,mBAAmB,QAAQ,4BAA4B,aAAa,OAAO,mBAAmB,sBAAsB,cAAc,aAAa,OAAO,mBAAmB,QAAQ;AAAA,MACpO,wBAAwB,aAAa,OAAO,SAAS,UAAW,aAAa,OAAO,SAAS,WAAW,mCAAmC,aAAa,OAAO,SAAS,UAAU,sBAAsB,qCAAsC,UAAU;AAAA,MACxP,yBAAyB,aAAa,gBAAgB;AAAA,MACtD,6BAA6B,aAAa,wBAAwB;AAAA,MAClE,GAAG;AAAA,MACH;AAAA,IACF;AAEA,UAAM,MAAM,GAAG,KAAK,IAAI;AACxB,UAAM,UAAU,IAAI,SAAS,WAAW,IAAI,MAAM,GAAG,QAAQ,IAAI,uBAAuB;AAExF,UAAM,iBAAiB,KAAK,KAAK,KAAK,eAAe,GAAG,IAAI,KAAK;AACjE,UAAM,gBAAgB,gBAAgB,OAAO;AAE7C,QAAI,KAAK,4CAA4C,cAAc,EAAE;AACrE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,kBAAkB,aAAa;AAAA,MAC/B,0BAA0B,aAAa;AAAA,MACvC,cAAc,aAAa;AAAA,IAC7B;AAAA,EACF;AACF;","names":[]}

package/dist/{chunk-XM46Y66S.js → chunk-ZFU6QNRN.js}

@@ -3,14 +3,10 @@ import {
 } from "./chunk-KJTKLXTH.js";
 import {
   StorageManager
-} from "./chunk-MVG3KXON.js";
-import {
-  copyExistingFileToBackup,
-  writeFileAtomically
-} from "./chunk-AW4QUFQF.js";
+} from "./chunk-I65KB36L.js";
 import {
   assertInjectedStorageRooted
-} from "./chunk-TBXAY2SS.js";
+} from "./chunk-SGHGCFVV.js";
 import {
   displayErrorDetail
 } from "./chunk-RL6NEVXT.js";
@@ -23,6 +19,10 @@ import {
   memoryLifecycleLedgerLockPath,
   sortMemoryLifecycleEvents
 } from "./chunk-7RJUVTVF.js";
+import {
+  copyExistingFileToBackup,
+  writeFileAtomically
+} from "./chunk-AW4QUFQF.js";
 import {
   withHeldFileLock
 } from "./chunk-FFAZ2XFU.js";
@@ -260,4 +260,4 @@ export {
   backupExistingLedger,
   rebuildMemoryLifecycleLedger
 };
-//# sourceMappingURL=chunk-XM46Y66S.js.map
+//# sourceMappingURL=chunk-ZFU6QNRN.js.map

package/dist/{chunk-SUEOG2S4.js → chunk-ZGXHTV5Y.js}

@@ -1,7 +1,7 @@
 import {
   SupportPassportError,
   getOperation
-} from "./chunk-SFHLQPBF.js";
+} from "./chunk-IUTYNDFS.js";
 import {
   abortError,
   isAbortError
@@ -499,4 +499,4 @@ export {
   buildSupportPassportPublicRequestHandler,
   composeSupportPassportExternalRequestHandlers
 };
-//# sourceMappingURL=chunk-SUEOG2S4.js.map
+//# sourceMappingURL=chunk-ZGXHTV5Y.js.map

package/dist/{chunk-ZX3AYNNV.js → chunk-ZOGKZ2XT.js}

@@ -1,6 +1,6 @@
 import {
   isValidCapsuleSince
-} from "./chunk-KQAFEZQX.js";
+} from "./chunk-VDX2J7OX.js";
 import {
   CAPSULE_ID_PATTERN
 } from "./chunk-WEHSQBFR.js";
@@ -356,6 +356,7 @@ var lcmCompactionRecordRequestSchema = z.object({
 });
 var daySummaryRequestSchema = z.object({
   memories: z.string().max(1e5).optional(),
+  includeLocation: z.boolean().optional(),
   sessionKey: sessionKeySchema,
   namespace: namespaceSchema,
   timeZone: timeZoneSchema.optional()
@@ -558,4 +559,4 @@ export {
   actionConfidenceRequestSchema,
   validateRequest
 };
-//# sourceMappingURL=chunk-ZX3AYNNV.js.map
+//# sourceMappingURL=chunk-ZOGKZ2XT.js.map

package/dist/chunk-ZOGKZ2XT.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/access-schema.ts"],"sourcesContent":["// Request/response schema validation for the Remnic HTTP API.\n// Uses zod for runtime validation — returns structured 400 errors with\n// field-level detail so consumers get clear feedback on malformed requests.\n\nimport { z } from \"zod\";\n\nimport type { MemoryCategory } from \"./types.js\";\nimport {\n  ACTION_CONFIDENCE_CONTEXT_READINESS,\n  ACTION_CONFIDENCE_RISK_CATEGORIES,\n  ACTION_CONFIDENCE_RULE_KINDS,\n} from \"./action-confidence.js\";\nimport { isValidCapsuleSince } from \"./transfer/capsule-export.js\";\nimport { validateArchiveRelativePath } from \"./transfer/fs-utils.js\";\nimport { CAPSULE_ID_PATTERN } from \"./transfer/types.js\";\nimport {\n  OFFLINE_SYNC_FILE_CONTENT_MAX_CHUNK_BYTES,\n  OFFLINE_SYNC_MAX_MTIME_MS,\n} from \"./offline-sync.js\";\n\n// ---------------------------------------------------------------------------\n// Error formatting\n// ---------------------------------------------------------------------------\n\nexport interface SchemaValidationError {\n  error: string;\n  code: \"validation_error\";\n  details: Array<{ field: string; message: string }>;\n}\n\nexport function formatZodError(error: z.ZodError): SchemaValidationError {\n  return {\n    error: \"request validation failed\",\n    code: \"validation_error\",\n    details: error.issues.map((issue) => ({\n      field: issue.path.join(\".\") || \"(root)\",\n      message: issue.message,\n    })),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Shared fields\n// ---------------------------------------------------------------------------\n\nconst namespaceSchema = z.string().trim().max(256).optional();\nconst sessionKeySchema = z.string().trim().min(1).max(512).optional();\nconst idempotencyKeySchema = z.string().trim().min(1).max(256).optional();\nconst cwdSchema = z.string().trim().min(1, \"cwd must be non-empty when provided\").max(2048).optional();\nconst projectTagSchema = z\n  .string()\n  .trim()\n  .min(1, \"projectTag must be non-empty when provided\")\n  .max(256)\n  .optional();\nconst deadlineMsSchema = z.number().finite().min(0).max(Number.MAX_SAFE_INTEGER).optional();\nconst dryRunSchema = z.boolean().optional();\nconst schemaVersionSchema = z.number().int().optional();\nconst timeZoneSchema = z\n  .string()\n  .trim()\n  .min(1)\n  .max(128)\n  .refine((value) => {\n    try {\n      Intl.DateTimeFormat(undefined, { timeZone: value });\n      return true;\n    } catch {\n      return false;\n    }\n  }, \"must be a valid IANA timezone\");\n\n// ---------------------------------------------------------------------------\n// Recall\n// ---------------------------------------------------------------------------\n\n/**\n * Coding-agent context (issue #569). Optional payload that connectors may\n * ship with a recall request so the project/branch namespace overlay\n * applies to that recall. All fields are validated per CLAUDE.md #51 —\n * empty-string projectId / rootPath is rejected, not silently accepted.\n */\nexport const codingContextSchema = z\n  .object({\n    projectId: z.string().trim().min(1, \"codingContext.projectId is required\").max(128),\n    branch: z.string().trim().max(256).nullable(),\n    rootPath: z.string().trim().min(1, \"codingContext.rootPath is required\").max(1024),\n    defaultBranch: z.string().trim().max(256).nullable(),\n  })\n  .nullable();\n\n/**\n * Recall disclosure depth (issue #677).  Mirrors the `RecallDisclosure`\n * type in `types.ts` — keep these in sync.  Default-application happens\n * inside `EngramAccessService.recall()`; the schema only accepts/rejects.\n * Invalid values throw a structured 400 instead of silently defaulting,\n * per CLAUDE.md rule 51.\n */\nexport const recallDisclosureSchema = z.enum([\"chunk\", \"section\", \"raw\"]);\n\n/**\n * Tag-match semantics (issue #689). `any` (default when `tags` is provided\n * and `tagMatch` is omitted) admits a result when it carries at least one\n * of the filter tags. `all` requires every filter tag to be present.\n * Schema rejects unknown values up front — never silently defaults\n * (CLAUDE.md rule 51).\n */\nexport const tagMatchSchema = z.enum([\"any\", \"all\"]);\n\nexport const recallRequestSchema = z.object({\n  query: z.string().min(1, \"query is required\"),\n  sessionKey: sessionKeySchema,\n  namespace: namespaceSchema,\n  topK: z.number().int().min(0).max(200).optional(),\n  mode: z.enum([\"auto\", \"no_recall\", \"minimal\", \"full\", \"graph_mode\"]).optional(),\n  includeDebug: z.boolean().optional(),\n  idempotencyKey: idempotencyKeySchema,\n  disclosure: recallDisclosureSchema.optional(),\n  codingContext: codingContextSchema.optional(),\n  /** Working directory for auto git-context resolution (issue #569). */\n  cwd: cwdSchema,\n  /**\n   * Arbitrary project tag for non-git-based project scoping (issue #569).\n   * Creates a coding context with `projectId: \"tag:<projectTag>\"`.\n   */\n  projectTag: projectTagSchema,\n  /**\n   * Historical recall pin (issue #680).  ISO 8601 timestamp.  The\n   * schema only enforces the basic shape; the access service runs\n   * `Date.parse` and emits a structured 400 on malformed input\n   * (CLAUDE.md rule 51).\n   */\n  asOf: z.string().trim().min(1, \"asOf must be a non-empty ISO 8601 timestamp\").max(64).optional(),\n  /**\n   * Free-form recall tag filter (issue #689). When provided, recall results\n   * whose frontmatter `tags` do not match the filter are removed before the\n   * response is returned. Comparison is case-sensitive exact match.\n   */\n  tags: z.array(z.string().trim().min(1).max(256)).max(50).optional(),\n  /**\n   * Match mode for `tags` (issue #689). Defaults to `\"any\"` when `tags` is\n   * provided and `tagMatch` is omitted. Ignored when `tags` is absent.\n   */\n  tagMatch: tagMatchSchema.optional(),\n  /**\n   * Include graph edges below `graphTraversalConfidenceFloor` for diagnostic\n   * recall traversal (issue #681). Defaults to false.\n   */\n  includeLowConfidence: z.boolean().optional(),\n  /**\n   * #1952 — per-call opt-in to state-aware recall views for this recall.\n   * ORs with the `recallStateViews` config flag; a change-intent query\n   * (e.g. \"when did\", \"used to\", \"switched\") is still required for any\n   * effect, so this can never perturb ordinary recalls.\n   */\n  stateView: z.boolean().optional(),\n});\n\nexport const recallExplainRequestSchema = z.object({\n  sessionKey: sessionKeySchema,\n  namespace: namespaceSchema,\n});\n\n/**\n * Standalone \"set coding context\" request. Used by the HTTP endpoint\n * `POST /engram/v1/coding-context` and the MCP `remnic.set_coding_context`\n * tool (PR 7). `codingContext: null` clears the attached context.\n */\nexport const setCodingContextRequestSchema = z\n  .object({\n    sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n    codingContext: codingContextSchema.optional(),\n    /**\n     * Project tag shorthand for non-git-based project scoping. When\n     * `codingContext` is omitted, this becomes\n     * `{ projectId: \"tag:<projectTag>\", branch: null, rootPath: \"tag:<projectTag>\", defaultBranch: null }`.\n     */\n    projectTag: z.string().trim().min(1, \"projectTag must be non-empty when provided\").max(256).optional(),\n  })\n  .superRefine((value, ctx) => {\n    if (value.codingContext === undefined && value.projectTag === undefined) {\n      ctx.addIssue({\n        code: z.ZodIssueCode.custom,\n        message: \"codingContext or projectTag is required\",\n        path: [\"codingContext\"],\n      });\n    }\n  });\n\n// ---------------------------------------------------------------------------\n// Observe\n// ---------------------------------------------------------------------------\n\nconst messageSchema = z.object({\n  role: z.enum([\"user\", \"assistant\"]),\n  content: z.string().min(1, \"message content must be non-empty\"),\n  sourceFormat: z\n    .enum([\"openai\", \"anthropic\", \"openclaw\", \"pi\", \"lossless-claw\", \"remnic\"])\n    .nullable()\n    .optional(),\n  rawContent: z.unknown().nullable().optional(),\n  parts: z\n    .array(\n      z.object({\n        ordinal: z.number().int().min(0).nullable().optional(),\n        kind: z.enum([\n          \"text\",\n          \"tool_call\",\n          \"tool_result\",\n          \"patch\",\n          \"file_read\",\n          \"file_write\",\n          \"step_start\",\n          \"step_finish\",\n          \"snapshot\",\n          \"retry\",\n        ]),\n        payload: z.record(z.string(), z.unknown()),\n        toolName: z.string().nullable().optional(),\n        tool_name: z.string().nullable().optional(),\n        filePath: z.string().nullable().optional(),\n        file_path: z.string().nullable().optional(),\n        createdAt: z.string().nullable().optional(),\n        created_at: z.string().nullable().optional(),\n      }),\n    )\n    .nullable()\n    .optional(),\n});\n\nexport const observeRequestSchema = z.object({\n  sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n  messages: z.array(messageSchema).min(1, \"messages must be a non-empty array\"),\n  namespace: namespaceSchema,\n  skipExtraction: z.boolean().optional(),\n  /**\n   * Optional idempotency key for server-side dedup of retried observe POSTs\n   * (issue #1649). A retry that reaches the daemon after the first attempt\n   * already processed is replayed from cache instead of re-ingested. When the\n   * key is reused with a DIFFERENT payload the request is rejected as a\n   * conflict (same contract as memory_store/suggestion_submit).\n   */\n  idempotencyKey: idempotencyKeySchema,\n  /** Working directory for auto git-context resolution (issue #569). */\n  cwd: cwdSchema,\n  /**\n   * Arbitrary project tag for non-git-based project scoping (issue #569).\n   * Creates a coding context with `projectId: \"tag:<projectTag>\"`.\n   */\n  projectTag: projectTagSchema,\n});\n\n// ---------------------------------------------------------------------------\n// Deep recall (issue #2332)\n// ---------------------------------------------------------------------------\n\nexport const deepRecallRequestSchema = z.object({\n  query: z.string().trim().min(1, \"query is required\").max(2000),\n  /** Optional policy-step ceiling; validated against the configured maximum in the service. */\n  maxSteps: z.union([z.number().int().min(0), z.string()]).optional(),\n  namespace: namespaceSchema,\n  sessionKey: z.string().optional(),\n});\n\n// ---------------------------------------------------------------------------\n// Memory store / suggestion submit\n// ---------------------------------------------------------------------------\n\nconst writeContentSchema = z.string().min(1, \"content is required\").max(50000);\n// ---------------------------------------------------------------------------\n// Category wire contract (issue #2829): truthful input/output modeling.\n// ---------------------------------------------------------------------------\n\n/** Canonical input spellings — exactly the `MemoryCategory` union. */\nconst MEMORY_CATEGORY_CANONICAL_INPUT = [\n  \"fact\", \"preference\", \"correction\", \"entity\", \"decision\",\n  \"relationship\", \"principle\", \"commitment\", \"moment\", \"skill\", \"rule\", \"procedure\",\n  \"reasoning_trace\",\n] as const satisfies readonly MemoryCategory[];\n\n/**\n * Compatibility alias spellings admitted on input. The four project-shaped\n * categories fleet telemetry actually shows do not exist in the taxonomy;\n * they parse to the canonical \"fact\". Exact match only — no trimming, no\n * case folding, so near-misses like `projection` or `Project_State` reject\n * like any other invalid category, with the full valid list in the error.\n */\nconst MEMORY_CATEGORY_ALIAS_INPUT = [\n  \"project\",\n  \"project_state\",\n  \"project-state\",\n  \"project_update\",\n] as const;\n\nexport type MemoryCategoryAlias = (typeof MEMORY_CATEGORY_ALIAS_INPUT)[number];\n\nconst MEMORY_CATEGORY_ALIAS_TO_CANONICAL: Readonly<\n  Record<MemoryCategoryAlias, Extract<MemoryCategory, \"fact\">>\n> = {\n  project: \"fact\",\n  project_state: \"fact\",\n  \"project-state\": \"fact\",\n  project_update: \"fact\",\n};\n\nexport function isMemoryCategoryAlias(value: string): value is MemoryCategoryAlias {\n  return Object.prototype.hasOwnProperty.call(MEMORY_CATEGORY_ALIAS_TO_CANONICAL, value);\n}\n\n/** Coercion diagnostic for a write whose input category was a compat alias. */\nexport interface CategoryAliasCoercion {\n  from: MemoryCategoryAlias;\n  to: \"fact\";\n}\n\n/** Boundary-derived coercion note for a retained raw spelling. */\nexport function categoryAliasCoercion(rawCategory: string | undefined): CategoryAliasCoercion | undefined {\n  return rawCategory !== undefined && isMemoryCategoryAlias(rawCategory)\n    ? { from: rawCategory, to: \"fact\" }\n    : undefined;\n}\n\n/**\n * Recover the retained alias spelling from a pre-parse raw envelope: the\n * `rawCategory` minted by a previous parse of the same schema (the HTTP/MCP\n * validate-then-dispatch double pass), or — for single-parse callers like the\n * CLI store command — the as-yet-untransformed alias still sitting on\n * `category` (issue #2889). A minted `rawCategory` always wins: it names the\n * spelling the transform actually canonicalized.\n */\nexport function retainedCategoryAlias(rawInput: unknown): MemoryCategoryAlias | undefined {\n  if (!rawInput || typeof rawInput !== \"object\") return undefined;\n  const envelope = rawInput as Record<string, unknown>;\n  const minted = envelope.rawCategory;\n  if (typeof minted === \"string\" && isMemoryCategoryAlias(minted)) return minted;\n  const category = envelope.category;\n  return typeof category === \"string\" && isMemoryCategoryAlias(category) ? category : undefined;\n}\n\n/**\n * An idempotent replay returns the FIRST request's stored response, whose\n * coercion note names that request's spelling. Rewrite the note from the\n * CURRENT request's retained spelling so every response identifies what its\n * caller actually sent; the stored idempotent result is reused untouched.\n */\nexport function reapplyCategoryCoercion<T extends object>(\n  response: T,\n  categoryCoercion: CategoryAliasCoercion | undefined,\n): T & { categoryCoercion?: CategoryAliasCoercion } {\n  const restamped: T & { categoryCoercion?: CategoryAliasCoercion } = { ...response };\n  if (categoryCoercion !== undefined) {\n    restamped.categoryCoercion = categoryCoercion;\n  } else {\n    delete restamped.categoryCoercion;\n  }\n  return restamped;\n}\n\nconst categoryWireSchema = z.enum(\n  [...MEMORY_CATEGORY_CANONICAL_INPUT, ...MEMORY_CATEGORY_ALIAS_INPUT],\n  {\n    errorMap: () => ({\n      message:\n        `category must be one of: ${[...MEMORY_CATEGORY_CANONICAL_INPUT, ...MEMORY_CATEGORY_ALIAS_INPUT].join(\", \")}; ` +\n        'for project state/facts use \"fact\"',\n    }),\n  },\n);\n\nconst confidenceSchema = z.number().min(0).max(1).optional();\nconst tagsSchema = z.array(z.string().max(256)).max(50).optional();\nconst entityRefSchema = z.string().trim().max(512).optional();\nconst ttlSchema = z.string().trim().max(128).optional();\nconst sourceReasonSchema = z.string().trim().max(2000).optional();\n\nconst memoryStoreRequestShape = z.object({\n  schemaVersion: schemaVersionSchema,\n  idempotencyKey: idempotencyKeySchema,\n  dryRun: dryRunSchema,\n  sessionKey: sessionKeySchema,\n  content: writeContentSchema,\n  category: categoryWireSchema.optional(),\n  confidence: confidenceSchema,\n  namespace: namespaceSchema,\n  tags: tagsSchema,\n  entityRef: entityRefSchema,\n  ttl: ttlSchema,\n  sourceReason: sourceReasonSchema,\n  // Git/project context for project-scoped writes (#1434). When no explicit\n  // `namespace` is given, these route the write to the same project namespace\n  // recall/observe resolve from `cwd`/`projectTag` (issue #569, rule 42). Also\n  // lets MCP clients that auto-inject `cwd` (e.g. Pi MCPorter) call write tools.\n  cwd: cwdSchema,\n  projectTag: projectTagSchema,\n});\n\n/**\n * Parsed memory-store request (issue #2829): the category transform maps\n * compat aliases to the canonical \"fact\" DURING parsing, so the output type\n * stays the finite `MemoryCategory` union — never an alias spelling. The raw\n * spelling travels separately on `rawCategory`, minted only by the transform\n * (zod strips it from client bodies), for the write surface's coercion note\n * and idempotent-replay rebuild.\n */\nexport type MemoryStoreParsedRequest = Omit<z.infer<typeof memoryStoreRequestShape>, \"category\"> & {\n  category?: MemoryCategory;\n  rawCategory?: MemoryCategoryAlias;\n};\n\nexport const memoryStoreRequestSchema = memoryStoreRequestShape.transform(\n  (request): MemoryStoreParsedRequest => {\n    if (request.category === undefined || !isMemoryCategoryAlias(request.category)) {\n      // Spread so the narrowed canonical category, not the wide wire union,\n      // becomes the output type.\n      return { ...request, category: request.category };\n    }\n    return {\n      ...request,\n      category: MEMORY_CATEGORY_ALIAS_TO_CANONICAL[request.category],\n      rawCategory: request.category,\n    };\n  },\n);\n\nexport const suggestionSubmitRequestSchema = memoryStoreRequestSchema;\n\n// ---------------------------------------------------------------------------\n// Review disposition\n// ---------------------------------------------------------------------------\n\nexport const reviewDispositionRequestSchema = z.object({\n  memoryId: z.string().trim().min(1, \"memoryId is required\"),\n  status: z.enum([\n    \"active\", \"pending_review\", \"quarantined\", \"rejected\", \"superseded\", \"archived\",\n  ]),\n  reasonCode: z.string().trim().min(1, \"reasonCode is required\"),\n  namespace: namespaceSchema,\n});\n\n// ---------------------------------------------------------------------------\n// Trust-zone promote\n// ---------------------------------------------------------------------------\n\nexport const trustZonePromoteRequestSchema = z.object({\n  recordId: z.string().trim().min(1, \"recordId is required\"),\n  targetZone: z.enum([\"working\", \"trusted\"], {\n    errorMap: () => ({ message: \"targetZone must be 'working' or 'trusted'\" }),\n  }),\n  promotionReason: z.string().trim().min(1, \"promotionReason is required\"),\n  recordedAt: z.string().trim().optional(),\n  summary: z.string().trim().max(5000).optional(),\n  dryRun: dryRunSchema,\n  namespace: namespaceSchema,\n});\n\n// ---------------------------------------------------------------------------\n// Trust-zone demo-seed\n// ---------------------------------------------------------------------------\n\nexport const trustZoneDemoSeedRequestSchema = z.object({\n  scenario: z.string().trim().max(256).optional(),\n  recordedAt: z.string().trim().optional(),\n  dryRun: dryRunSchema,\n  namespace: namespaceSchema,\n});\n\n// ---------------------------------------------------------------------------\n// LCM search\n// ---------------------------------------------------------------------------\n\nexport const lcmSearchRequestSchema = z.object({\n  query: z.string().min(1, \"query is required\"),\n  sessionKey: sessionKeySchema,\n  sessionPrefix: z.string().trim().min(1).max(512).optional(),\n  namespace: namespaceSchema,\n  limit: z.number().int().min(1).max(100).optional(),\n});\n\nexport const lcmCompactionFlushRequestSchema = z\n  .object({\n    sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n    namespace: namespaceSchema,\n    cwd: cwdSchema,\n    projectTag: projectTagSchema,\n    /**\n     * Optional multi-namespace flush used by delegate lifecycle replay. The\n     * server handles the whole list as one quota-counted write.\n     */\n    namespaces: z.array(z.string().trim().max(256)).min(1).max(64).optional(),\n  })\n  .superRefine((value, ctx) => {\n    if (value.namespace !== undefined && value.namespaces !== undefined) {\n      ctx.addIssue({\n        code: z.ZodIssueCode.custom,\n        message: \"namespace and namespaces are mutually exclusive\",\n        path: [\"namespaces\"],\n      });\n    }\n    if (\n      value.namespaces !== undefined &&\n      new Set(value.namespaces).size !== value.namespaces.length\n    ) {\n      ctx.addIssue({\n        code: z.ZodIssueCode.custom,\n        message: \"namespaces must not contain duplicates\",\n        path: [\"namespaces\"],\n      });\n    }\n  });\n\nexport const extractionForceFlushRequestSchema = z.object({\n  sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n  namespace: namespaceSchema,\n  cwd: cwdSchema,\n  projectTag: projectTagSchema,\n  deadlineMs: deadlineMsSchema,\n});\n\nexport const lcmCompactionRecordRequestSchema = z.object({\n  sessionKey: z.string().trim().min(1, \"sessionKey is required\").max(512),\n  namespace: namespaceSchema,\n  tokensBefore: z.number().int().min(0, \"tokensBefore must be a non-negative integer\"),\n  tokensAfter: z.number().int().min(0, \"tokensAfter must be a non-negative integer\"),\n});\n\n// ---------------------------------------------------------------------------\n// Day summary\n// ---------------------------------------------------------------------------\n\nexport const daySummaryRequestSchema = z.object({\n  memories: z.string().max(100000).optional(),\n  includeLocation: z.boolean().optional(),\n  sessionKey: sessionKeySchema,\n  namespace: namespaceSchema,\n  timeZone: timeZoneSchema.optional(),\n});\n\n// ---------------------------------------------------------------------------\n// Capsule export\n// ---------------------------------------------------------------------------\n\nconst capsuleTopLevelSegmentSchema = z\n  .string()\n  .trim()\n  .min(1)\n  .max(128)\n  .refine(\n    (value) => !value.includes(\"/\") && !value.includes(\"\\\\\"),\n    \"must be a top-level directory name without path separators\",\n  );\n\nconst capsulePeerIdSchema = z\n  .string()\n  .trim()\n  .min(1)\n  .max(256)\n  .refine(\n    (value) => value !== \".\" && value !== \"..\" && !value.includes(\"/\") && !value.includes(\"\\\\\"),\n    \"must be a plain peer id without path separators\",\n  );\n\nconst capsuleIsoSinceSchema = z\n  .string()\n  .trim()\n  .min(1, \"since must be a non-empty ISO 8601 timestamp\")\n  .max(128)\n  .refine(\n    isValidCapsuleSince,\n    \"since must be a valid ISO 8601 timestamp with no calendar overflow\",\n  );\n\nexport const capsuleExportRequestSchema = z\n  .object({\n    name: z\n      .string()\n      .trim()\n      .min(1, \"name is required\")\n      .max(64, \"name must be 64 characters or fewer\")\n      .regex(\n        CAPSULE_ID_PATTERN,\n        \"name must be alphanumeric with single dashes (no spaces, no leading/trailing dashes)\",\n      ),\n    namespace: namespaceSchema,\n    since: capsuleIsoSinceSchema.optional(),\n    includeKinds: z.array(capsuleTopLevelSegmentSchema).max(50).optional(),\n    peerIds: z.array(capsulePeerIdSchema).max(100).optional(),\n    includeTranscripts: z.boolean().optional(),\n    encrypt: z.boolean().optional(),\n  });\n\nexport const capsuleImportRequestSchema = z\n  .object({\n    archivePath: z.string().trim().min(1, \"archivePath is required\").max(4096),\n    namespace: namespaceSchema,\n    mode: z.enum([\"skip\", \"overwrite\", \"fork\"]).optional(),\n    passphrase: z.string().min(1, \"passphrase must not be empty\").max(4096).optional(),\n  });\n\nexport const capsuleListRequestSchema = z\n  .object({\n    namespace: namespaceSchema,\n    sessionKey: sessionKeySchema,\n  });\n\n// ---------------------------------------------------------------------------\n// Offline sync\n// ---------------------------------------------------------------------------\n\nfunction isValidOfflineSyncPath(value: string): boolean {\n  try {\n    validateArchiveRelativePath(value, \"path\");\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nconst offlineSyncPathSchema = z\n  .string()\n  .trim()\n  .min(1, \"path must be non-empty\")\n  .max(4096)\n  .refine(\n    isValidOfflineSyncPath,\n    \"path must be a POSIX relative path without unsafe segments\",\n  );\n\nconst offlineSyncFileStateSchema = z.object({\n  path: offlineSyncPathSchema,\n  sha256: z.string().regex(/^[a-f0-9]{64}$/i, \"sha256 must be a 64-character hex digest\"),\n  bytes: z.number().int().min(0),\n  mtimeMs: z.number().finite().min(0).max(OFFLINE_SYNC_MAX_MTIME_MS),\n});\n\nconst offlineSyncBaseCapturedAtSchema = z\n  .string()\n  .trim()\n  .min(1, \"baseCapturedAt must be non-empty when provided\")\n  .max(64)\n  .refine((value) => Number.isFinite(Date.parse(value)), {\n    message: \"baseCapturedAt must be a valid ISO 8601 timestamp\",\n  });\n\nexport const offlineSyncSnapshotRequestSchema = z.object({\n  namespace: namespaceSchema,\n  includeTranscripts: z.boolean().optional(),\n  includeContent: z.boolean().optional(),\n  baseCapturedAt: offlineSyncBaseCapturedAtSchema.optional(),\n  baseFiles: z\n    .array(offlineSyncFileStateSchema)\n    .max(300_000, \"baseFiles must contain 300000 or fewer entries\")\n    .optional(),\n});\n\nexport const offlineSyncApplyRequestSchema = z\n  .object({\n    namespace: namespaceSchema,\n    changeset: z.unknown(),\n    returnCurrentFiles: z.boolean().optional(),\n  })\n  .refine((value) => value.changeset !== undefined && value.changeset !== null, {\n    message: \"changeset is required\",\n    path: [\"changeset\"],\n  });\n\nexport const offlineSyncFilesRequestSchema = z.object({\n  namespace: namespaceSchema,\n  includeTranscripts: z.boolean().optional(),\n  paths: z\n    .array(offlineSyncPathSchema)\n    .max(5000, \"paths must contain 5000 or fewer entries\"),\n});\n\nexport const offlineSyncFileContentRequestSchema = z.object({\n  namespace: namespaceSchema,\n  includeTranscripts: z.boolean().optional(),\n  path: offlineSyncPathSchema,\n  offset: z.number().int().min(0).optional(),\n  length: z.number().int().min(1).max(OFFLINE_SYNC_FILE_CONTENT_MAX_CHUNK_BYTES).optional(),\n});\n\n// ---------------------------------------------------------------------------\n// Action confidence\n// ---------------------------------------------------------------------------\n\nconst nullableOptional = <T extends z.ZodTypeAny>(schema: T) =>\n  schema.optional().nullable().transform((value) => value ?? undefined);\n\nconst actionConfidenceRuleSchema = z\n  .object({\n    kind: z.enum(ACTION_CONFIDENCE_RULE_KINDS),\n    description: nullableOptional(z.string().trim().min(1).max(2000)),\n    matched: nullableOptional(z.boolean()),\n  })\n  .strict();\n\nconst actionConfidenceMemorySchema = z\n  .object({\n    source: nullableOptional(z.string().trim().min(1).max(256)),\n    created: nullableOptional(z.string().trim().min(1).max(128)),\n    updated: nullableOptional(z.string().trim().min(1).max(128)),\n    scope: nullableOptional(z.string().trim().min(1).max(512)),\n    userContextScopes: nullableOptional(z.array(z.string().trim().min(1).max(128)).max(50)),\n    retrievalReason: nullableOptional(z.string().trim().min(1).max(2000)),\n    confidence: nullableOptional(z.number().min(0).max(1)),\n    stale: nullableOptional(z.boolean()),\n    corrected: nullableOptional(z.boolean()),\n    correctionState: nullableOptional(z.enum([\"none\", \"correction\", \"superseded\", \"disputed\", \"forgotten\"])),\n    safeToUse: nullableOptional(z.boolean()),\n    safety: nullableOptional(z.enum([\"safe\", \"requires-review\", \"blocked\"])),\n    safetyReasons: nullableOptional(z.array(z.string().trim().min(1).max(1000)).max(50)),\n  })\n  .strict();\n\nexport const actionConfidenceRequestSchema = z\n  .object({\n    intendedAction: nullableOptional(z.string().trim().min(1).max(1000)),\n    confidence: nullableOptional(z.number().min(0).max(1)),\n    risk: nullableOptional(z.enum(ACTION_CONFIDENCE_RISK_CATEGORIES)),\n    contextReadiness: nullableOptional(z.enum(ACTION_CONFIDENCE_CONTEXT_READINESS)),\n    currentContextScopes: nullableOptional(z.array(z.string().trim().min(1).max(128)).max(50)),\n    userRules: nullableOptional(z.array(actionConfidenceRuleSchema).max(100)),\n    retrievedMemories: nullableOptional(z.array(actionConfidenceMemorySchema).max(200)),\n  })\n  .strict();\n\n// ---------------------------------------------------------------------------\n// Inferred types\n// ---------------------------------------------------------------------------\n\nexport type RecallRequest = z.infer<typeof recallRequestSchema>;\nexport type RecallExplainRequest = z.infer<typeof recallExplainRequestSchema>;\nexport type SetCodingContextRequest = z.infer<typeof setCodingContextRequestSchema>;\nexport type ObserveRequest = z.infer<typeof observeRequestSchema>;\nexport type MemoryStoreRequest = z.infer<typeof memoryStoreRequestSchema>;\nexport type SuggestionSubmitRequest = z.infer<typeof suggestionSubmitRequestSchema>;\nexport type ReviewDispositionRequest = z.infer<typeof reviewDispositionRequestSchema>;\nexport type TrustZonePromoteRequest = z.infer<typeof trustZonePromoteRequestSchema>;\nexport type TrustZoneDemoSeedRequest = z.infer<typeof trustZoneDemoSeedRequestSchema>;\nexport type LcmSearchRequest = z.infer<typeof lcmSearchRequestSchema>;\nexport type LcmCompactionFlushRequest = z.infer<typeof lcmCompactionFlushRequestSchema>;\nexport type ExtractionForceFlushRequest = z.infer<typeof extractionForceFlushRequestSchema>;\nexport type LcmCompactionRecordRequest = z.infer<typeof lcmCompactionRecordRequestSchema>;\nexport type DaySummaryRequest = z.infer<typeof daySummaryRequestSchema>;\nexport type CapsuleExportRequest = z.infer<typeof capsuleExportRequestSchema>;\nexport type CapsuleImportRequest = z.infer<typeof capsuleImportRequestSchema>;\nexport type CapsuleListRequest = z.infer<typeof capsuleListRequestSchema>;\nexport type OfflineSyncApplyRequest = z.infer<typeof offlineSyncApplyRequestSchema>;\nexport type OfflineSyncSnapshotRequest = z.infer<typeof offlineSyncSnapshotRequestSchema>;\nexport type OfflineSyncFilesRequest = z.infer<typeof offlineSyncFilesRequestSchema>;\nexport type OfflineSyncFileContentRequest = z.infer<typeof offlineSyncFileContentRequestSchema>;\nexport type ActionConfidenceRequest = z.infer<typeof actionConfidenceRequestSchema>;\n\n// ---------------------------------------------------------------------------\n// Validation helper\n// ---------------------------------------------------------------------------\n\nexport type SchemaName =\n  | \"recall\"\n  | \"recallExplain\"\n  | \"setCodingContext\"\n  | \"observe\"\n  | \"memoryStore\"\n  | \"suggestionSubmit\"\n  | \"reviewDisposition\"\n  | \"trustZonePromote\"\n  | \"trustZoneDemoSeed\"\n  | \"lcmSearch\"\n  | \"lcmCompactionFlush\"\n  | \"extractionForceFlush\"\n  | \"lcmCompactionRecord\"\n  | \"daySummary\"\n  | \"capsuleExport\"\n  | \"capsuleImport\"\n  | \"capsuleList\"\n  | \"offlineSyncSnapshot\"\n  | \"offlineSyncFiles\"\n  | \"offlineSyncFileContent\"\n  | \"offlineSyncApply\"\n  | \"actionConfidence\";\n\nexport type SchemaTypeFor<N extends SchemaName> =\n  N extends \"recall\" ? RecallRequest\n  : N extends \"recallExplain\" ? RecallExplainRequest\n  : N extends \"setCodingContext\" ? SetCodingContextRequest\n  : N extends \"observe\" ? ObserveRequest\n  : N extends \"memoryStore\" ? MemoryStoreRequest\n  : N extends \"suggestionSubmit\" ? SuggestionSubmitRequest\n  : N extends \"reviewDisposition\" ? ReviewDispositionRequest\n  : N extends \"trustZonePromote\" ? TrustZonePromoteRequest\n  : N extends \"trustZoneDemoSeed\" ? TrustZoneDemoSeedRequest\n  : N extends \"lcmSearch\" ? LcmSearchRequest\n  : N extends \"lcmCompactionFlush\" ? LcmCompactionFlushRequest\n  : N extends \"extractionForceFlush\" ? ExtractionForceFlushRequest\n  : N extends \"lcmCompactionRecord\" ? LcmCompactionRecordRequest\n  : N extends \"daySummary\" ? DaySummaryRequest\n  : N extends \"capsuleExport\" ? CapsuleExportRequest\n  : N extends \"capsuleImport\" ? CapsuleImportRequest\n  : N extends \"capsuleList\" ? CapsuleListRequest\n  : N extends \"offlineSyncSnapshot\" ? OfflineSyncSnapshotRequest\n  : N extends \"offlineSyncFiles\" ? OfflineSyncFilesRequest\n  : N extends \"offlineSyncFileContent\" ? OfflineSyncFileContentRequest\n  : N extends \"offlineSyncApply\" ? OfflineSyncApplyRequest\n  : N extends \"actionConfidence\" ? ActionConfidenceRequest\n  : never;\n\nconst schemas: Record<SchemaName, z.ZodTypeAny> = {\n  recall: recallRequestSchema,\n  recallExplain: recallExplainRequestSchema,\n  setCodingContext: setCodingContextRequestSchema,\n  observe: observeRequestSchema,\n  memoryStore: memoryStoreRequestSchema,\n  suggestionSubmit: suggestionSubmitRequestSchema,\n  reviewDisposition: reviewDispositionRequestSchema,\n  trustZonePromote: trustZonePromoteRequestSchema,\n  trustZoneDemoSeed: trustZoneDemoSeedRequestSchema,\n  lcmSearch: lcmSearchRequestSchema,\n  lcmCompactionFlush: lcmCompactionFlushRequestSchema,\n  extractionForceFlush: extractionForceFlushRequestSchema,\n  lcmCompactionRecord: lcmCompactionRecordRequestSchema,\n  daySummary: daySummaryRequestSchema,\n  capsuleExport: capsuleExportRequestSchema,\n  capsuleImport: capsuleImportRequestSchema,\n  capsuleList: capsuleListRequestSchema,\n  offlineSyncSnapshot: offlineSyncSnapshotRequestSchema,\n  offlineSyncFiles: offlineSyncFilesRequestSchema,\n  offlineSyncFileContent: offlineSyncFileContentRequestSchema,\n  offlineSyncApply: offlineSyncApplyRequestSchema,\n  actionConfidence: actionConfidenceRequestSchema,\n};\n\n/**\n * Validate a request body against the named schema.\n * Returns `{ success: true, data }` on pass or\n * `{ success: false, error }` on failure with field-level detail.\n */\nexport function validateRequest<T = unknown>(\n  schemaName: SchemaName,\n  body: unknown,\n): { success: true; data: T } | { success: false; error: SchemaValidationError } {\n  const schema = schemas[schemaName];\n  if (!schema) {\n    return {\n      success: false,\n      error: {\n        error: `unknown schema: ${schemaName}`,\n        code: \"validation_error\",\n        details: [],\n      },\n    };\n  }\n  const result = schema.safeParse(stripNullsExceptCodingContext(body));\n  if (result.success) {\n    return { success: true, data: result.data as T };\n  }\n  return { success: false, error: formatZodError(result.error) };\n}\n\nfunction stripNullsExceptCodingContext(data: unknown): unknown {\n  if (!data || typeof data !== \"object\" || Array.isArray(data)) return data;\n  const cleaned: Record<string, unknown> = {};\n  for (const [key, value] of Object.entries(data as Record<string, unknown>)) {\n    if (value === null && key !== \"codingContext\") continue;\n    cleaned[key] = value;\n  }\n  return cleaned;\n}\n\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAIA,SAAS,SAAS;AA0BX,SAAS,eAAe,OAA0C;AACvE,SAAO;AAAA,IACL,OAAO;AAAA,IACP,MAAM;AAAA,IACN,SAAS,MAAM,OAAO,IAAI,CAAC,WAAW;AAAA,MACpC,OAAO,MAAM,KAAK,KAAK,GAAG,KAAK;AAAA,MAC/B,SAAS,MAAM;AAAA,IACjB,EAAE;AAAA,EACJ;AACF;AAMA,IAAM,kBAAkB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAC5D,IAAM,mBAAmB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AACpE,IAAM,uBAAuB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AACxE,IAAM,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,qCAAqC,EAAE,IAAI,IAAI,EAAE,SAAS;AACrG,IAAM,mBAAmB,EACtB,OAAO,EACP,KAAK,EACL,IAAI,GAAG,4CAA4C,EACnD,IAAI,GAAG,EACP,SAAS;AACZ,IAAM,mBAAmB,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,OAAO,gBAAgB,EAAE,SAAS;AAC1F,IAAM,eAAe,EAAE,QAAQ,EAAE,SAAS;AAC1C,IAAM,sBAAsB,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AACtD,IAAM,iBAAiB,EACpB,OAAO,EACP,KAAK,EACL,IAAI,CAAC,EACL,IAAI,GAAG,EACP,OAAO,CAAC,UAAU;AACjB,MAAI;AACF,SAAK,eAAe,QAAW,EAAE,UAAU,MAAM,CAAC;AAClD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF,GAAG,+BAA+B;AAY7B,IAAM,sBAAsB,EAChC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,qCAAqC,EAAE,IAAI,GAAG;AAAA,EAClF,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAC5C,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,oCAAoC,EAAE,IAAI,IAAI;AAAA,EACjF,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AACrD,CAAC,EACA,SAAS;AASL,IAAM,yBAAyB,EAAE,KAAK,CAAC,SAAS,WAAW,KAAK,CAAC;AASjE,IAAM,iBAAiB,EAAE,KAAK,CAAC,OAAO,KAAK,CAAC;AAE5C,IAAM,sBAAsB,EAAE,OAAO;AAAA,EAC1C,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,mBAAmB;AAAA,EAC5C,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAChD,MAAM,EAAE,KAAK,CAAC,QAAQ,aAAa,WAAW,QAAQ,YAAY,CAAC,EAAE,SAAS;AAAA,EAC9E,cAAc,EAAE,QAAQ,EAAE,SAAS;AAAA,EACnC,gBAAgB;AAAA,EAChB,YAAY,uBAAuB,SAAS;AAAA,EAC5C,eAAe,oBAAoB,SAAS;AAAA;AAAA,EAE5C,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA,EAKL,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOZ,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,6CAA6C,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM/F,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAKlE,UAAU,eAAe,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAKlC,sBAAsB,EAAE,QAAQ,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAO3C,WAAW,EAAE,QAAQ,EAAE,SAAS;AAClC,CAAC;AAEM,IAAM,6BAA6B,EAAE,OAAO;AAAA,EACjD,YAAY;AAAA,EACZ,WAAW;AACb,CAAC;AAOM,IAAM,gCAAgC,EAC1C,OAAO;AAAA,EACN,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,eAAe,oBAAoB,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM5C,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,4CAA4C,EAAE,IAAI,GAAG,EAAE,SAAS;AACvG,CAAC,EACA,YAAY,CAAC,OAAO,QAAQ;AAC3B,MAAI,MAAM,kBAAkB,UAAa,MAAM,eAAe,QAAW;AACvE,QAAI,SAAS;AAAA,MACX,MAAM,EAAE,aAAa;AAAA,MACrB,SAAS;AAAA,MACT,MAAM,CAAC,eAAe;AAAA,IACxB,CAAC;AAAA,EACH;AACF,CAAC;AAMH,IAAM,gBAAgB,EAAE,OAAO;AAAA,EAC7B,MAAM,EAAE,KAAK,CAAC,QAAQ,WAAW,CAAC;AAAA,EAClC,SAAS,EAAE,OAAO,EAAE,IAAI,GAAG,mCAAmC;AAAA,EAC9D,cAAc,EACX,KAAK,CAAC,UAAU,aAAa,YAAY,MAAM,iBAAiB,QAAQ,CAAC,EACzE,SAAS,EACT,SAAS;AAAA,EACZ,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS;AAAA,EAC5C,OAAO,EACJ;AAAA,IACC,EAAE,OAAO;AAAA,MACP,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,SAAS,EAAE,SAAS;AAAA,MACrD,MAAM,EAAE,KAAK;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,MACD,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC;AAAA,MACzC,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MACzC,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MAC1C,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MACzC,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MAC1C,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,MAC1C,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,IAC7C,CAAC;AAAA,EACH,EACC,SAAS,EACT,SAAS;AACd,CAAC;AAEM,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,UAAU,EAAE,MAAM,aAAa,EAAE,IAAI,GAAG,oCAAoC;AAAA,EAC5E,WAAW;AAAA,EACX,gBAAgB,EAAE,QAAQ,EAAE,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQrC,gBAAgB;AAAA;AAAA,EAEhB,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA,EAKL,YAAY;AACd,CAAC;AAMM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,mBAAmB,EAAE,IAAI,GAAI;AAAA;AAAA,EAE7D,UAAU,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,EAAE,SAAS;AAAA,EAClE,WAAW;AAAA,EACX,YAAY,EAAE,OAAO,EAAE,SAAS;AAClC,CAAC;AAMD,IAAM,qBAAqB,EAAE,OAAO,EAAE,IAAI,GAAG,qBAAqB,EAAE,IAAI,GAAK;AAM7E,IAAM,kCAAkC;AAAA,EACtC;AAAA,EAAQ;AAAA,EAAc;AAAA,EAAc;AAAA,EAAU;AAAA,EAC9C;AAAA,EAAgB;AAAA,EAAa;AAAA,EAAc;AAAA,EAAU;AAAA,EAAS;AAAA,EAAQ;AAAA,EACtE;AACF;AASA,IAAM,8BAA8B;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAIA,IAAM,qCAEF;AAAA,EACF,SAAS;AAAA,EACT,eAAe;AAAA,EACf,iBAAiB;AAAA,EACjB,gBAAgB;AAClB;AAEO,SAAS,sBAAsB,OAA6C;AACjF,SAAO,OAAO,UAAU,eAAe,KAAK,oCAAoC,KAAK;AACvF;AASO,SAAS,sBAAsB,aAAoE;AACxG,SAAO,gBAAgB,UAAa,sBAAsB,WAAW,IACjE,EAAE,MAAM,aAAa,IAAI,OAAO,IAChC;AACN;AAUO,SAAS,sBAAsB,UAAoD;AACxF,MAAI,CAAC,YAAY,OAAO,aAAa,SAAU,QAAO;AACtD,QAAM,WAAW;AACjB,QAAM,SAAS,SAAS;AACxB,MAAI,OAAO,WAAW,YAAY,sBAAsB,MAAM,EAAG,QAAO;AACxE,QAAM,WAAW,SAAS;AAC1B,SAAO,OAAO,aAAa,YAAY,sBAAsB,QAAQ,IAAI,WAAW;AACtF;AAQO,SAAS,wBACd,UACA,kBACkD;AAClD,QAAM,YAA8D,EAAE,GAAG,SAAS;AAClF,MAAI,qBAAqB,QAAW;AAClC,cAAU,mBAAmB;AAAA,EAC/B,OAAO;AACL,WAAO,UAAU;AAAA,EACnB;AACA,SAAO;AACT;AAEA,IAAM,qBAAqB,EAAE;AAAA,EAC3B,CAAC,GAAG,iCAAiC,GAAG,2BAA2B;AAAA,EACnE;AAAA,IACE,UAAU,OAAO;AAAA,MACf,SACE,4BAA4B,CAAC,GAAG,iCAAiC,GAAG,2BAA2B,EAAE,KAAK,IAAI,CAAC;AAAA,IAE/G;AAAA,EACF;AACF;AAEA,IAAM,mBAAmB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,SAAS;AAC3D,IAAM,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS;AACjE,IAAM,kBAAkB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAC5D,IAAM,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AACtD,IAAM,qBAAqB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAI,EAAE,SAAS;AAEhE,IAAM,0BAA0B,EAAE,OAAO;AAAA,EACvC,eAAe;AAAA,EACf,gBAAgB;AAAA,EAChB,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,SAAS;AAAA,EACT,UAAU,mBAAmB,SAAS;AAAA,EACtC,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,MAAM;AAAA,EACN,WAAW;AAAA,EACX,KAAK;AAAA,EACL,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA,EAKd,KAAK;AAAA,EACL,YAAY;AACd,CAAC;AAeM,IAAM,2BAA2B,wBAAwB;AAAA,EAC9D,CAAC,YAAsC;AACrC,QAAI,QAAQ,aAAa,UAAa,CAAC,sBAAsB,QAAQ,QAAQ,GAAG;AAG9E,aAAO,EAAE,GAAG,SAAS,UAAU,QAAQ,SAAS;AAAA,IAClD;AACA,WAAO;AAAA,MACL,GAAG;AAAA,MACH,UAAU,mCAAmC,QAAQ,QAAQ;AAAA,MAC7D,aAAa,QAAQ;AAAA,IACvB;AAAA,EACF;AACF;AAEO,IAAM,gCAAgC;AAMtC,IAAM,iCAAiC,EAAE,OAAO;AAAA,EACrD,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,sBAAsB;AAAA,EACzD,QAAQ,EAAE,KAAK;AAAA,IACb;AAAA,IAAU;AAAA,IAAkB;AAAA,IAAe;AAAA,IAAY;AAAA,IAAc;AAAA,EACvE,CAAC;AAAA,EACD,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB;AAAA,EAC7D,WAAW;AACb,CAAC;AAMM,IAAM,gCAAgC,EAAE,OAAO;AAAA,EACpD,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,sBAAsB;AAAA,EACzD,YAAY,EAAE,KAAK,CAAC,WAAW,SAAS,GAAG;AAAA,IACzC,UAAU,OAAO,EAAE,SAAS,4CAA4C;AAAA,EAC1E,CAAC;AAAA,EACD,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,6BAA6B;AAAA,EACvE,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS;AAAA,EACvC,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAI,EAAE,SAAS;AAAA,EAC9C,QAAQ;AAAA,EACR,WAAW;AACb,CAAC;AAMM,IAAM,iCAAiC,EAAE,OAAO;AAAA,EACrD,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAC9C,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS;AAAA,EACvC,QAAQ;AAAA,EACR,WAAW;AACb,CAAC;AAMM,IAAM,yBAAyB,EAAE,OAAO;AAAA,EAC7C,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,mBAAmB;AAAA,EAC5C,YAAY;AAAA,EACZ,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EAC1D,WAAW;AAAA,EACX,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,EAAE,SAAS;AACnD,CAAC;AAEM,IAAM,kCAAkC,EAC5C,OAAO;AAAA,EACN,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,WAAW;AAAA,EACX,KAAK;AAAA,EACL,YAAY;AAAA;AAAA;AAAA;AAAA;AAAA,EAKZ,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS;AAC1E,CAAC,EACA,YAAY,CAAC,OAAO,QAAQ;AAC3B,MAAI,MAAM,cAAc,UAAa,MAAM,eAAe,QAAW;AACnE,QAAI,SAAS;AAAA,MACX,MAAM,EAAE,aAAa;AAAA,MACrB,SAAS;AAAA,MACT,MAAM,CAAC,YAAY;AAAA,IACrB,CAAC;AAAA,EACH;AACA,MACE,MAAM,eAAe,UACrB,IAAI,IAAI,MAAM,UAAU,EAAE,SAAS,MAAM,WAAW,QACpD;AACA,QAAI,SAAS;AAAA,MACX,MAAM,EAAE,aAAa;AAAA,MACrB,SAAS;AAAA,MACT,MAAM,CAAC,YAAY;AAAA,IACrB,CAAC;AAAA,EACH;AACF,CAAC;AAEI,IAAM,oCAAoC,EAAE,OAAO;AAAA,EACxD,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,WAAW;AAAA,EACX,KAAK;AAAA,EACL,YAAY;AAAA,EACZ,YAAY;AACd,CAAC;AAEM,IAAM,mCAAmC,EAAE,OAAO;AAAA,EACvD,YAAY,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,wBAAwB,EAAE,IAAI,GAAG;AAAA,EACtE,WAAW;AAAA,EACX,cAAc,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,6CAA6C;AAAA,EACnF,aAAa,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,4CAA4C;AACnF,CAAC;AAMM,IAAM,0BAA0B,EAAE,OAAO;AAAA,EAC9C,UAAU,EAAE,OAAO,EAAE,IAAI,GAAM,EAAE,SAAS;AAAA,EAC1C,iBAAiB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACtC,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,UAAU,eAAe,SAAS;AACpC,CAAC;AAMD,IAAM,+BAA+B,EAClC,OAAO,EACP,KAAK,EACL,IAAI,CAAC,EACL,IAAI,GAAG,EACP;AAAA,EACC,CAAC,UAAU,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AAAA,EACvD;AACF;AAEF,IAAM,sBAAsB,EACzB,OAAO,EACP,KAAK,EACL,IAAI,CAAC,EACL,IAAI,GAAG,EACP;AAAA,EACC,CAAC,UAAU,UAAU,OAAO,UAAU,QAAQ,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AAAA,EAC1F;AACF;AAEF,IAAM,wBAAwB,EAC3B,OAAO,EACP,KAAK,EACL,IAAI,GAAG,8CAA8C,EACrD,IAAI,GAAG,EACP;AAAA,EACC;AAAA,EACA;AACF;AAEK,IAAM,6BAA6B,EACvC,OAAO;AAAA,EACN,MAAM,EACH,OAAO,EACP,KAAK,EACL,IAAI,GAAG,kBAAkB,EACzB,IAAI,IAAI,qCAAqC,EAC7C;AAAA,IACC;AAAA,IACA;AAAA,EACF;AAAA,EACF,WAAW;AAAA,EACX,OAAO,sBAAsB,SAAS;AAAA,EACtC,cAAc,EAAE,MAAM,4BAA4B,EAAE,IAAI,EAAE,EAAE,SAAS;AAAA,EACrE,SAAS,EAAE,MAAM,mBAAmB,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,EACxD,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,SAAS,EAAE,QAAQ,EAAE,SAAS;AAChC,CAAC;AAEI,IAAM,6BAA6B,EACvC,OAAO;AAAA,EACN,aAAa,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,yBAAyB,EAAE,IAAI,IAAI;AAAA,EACzE,WAAW;AAAA,EACX,MAAM,EAAE,KAAK,CAAC,QAAQ,aAAa,MAAM,CAAC,EAAE,SAAS;AAAA,EACrD,YAAY,EAAE,OAAO,EAAE,IAAI,GAAG,8BAA8B,EAAE,IAAI,IAAI,EAAE,SAAS;AACnF,CAAC;AAEI,IAAM,2BAA2B,EACrC,OAAO;AAAA,EACN,WAAW;AAAA,EACX,YAAY;AACd,CAAC;AAMH,SAAS,uBAAuB,OAAwB;AACtD,MAAI;AACF,gCAA4B,OAAO,MAAM;AACzC,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,wBAAwB,EAC3B,OAAO,EACP,KAAK,EACL,IAAI,GAAG,wBAAwB,EAC/B,IAAI,IAAI,EACR;AAAA,EACC;AAAA,EACA;AACF;AAEF,IAAM,6BAA6B,EAAE,OAAO;AAAA,EAC1C,MAAM;AAAA,EACN,QAAQ,EAAE,OAAO,EAAE,MAAM,mBAAmB,0CAA0C;AAAA,EACtF,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC;AAAA,EAC7B,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,yBAAyB;AACnE,CAAC;AAED,IAAM,kCAAkC,EACrC,OAAO,EACP,KAAK,EACL,IAAI,GAAG,gDAAgD,EACvD,IAAI,EAAE,EACN,OAAO,CAAC,UAAU,OAAO,SAAS,KAAK,MAAM,KAAK,CAAC,GAAG;AAAA,EACrD,SAAS;AACX,CAAC;AAEI,IAAM,mCAAmC,EAAE,OAAO;AAAA,EACvD,WAAW;AAAA,EACX,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,gBAAgB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACrC,gBAAgB,gCAAgC,SAAS;AAAA,EACzD,WAAW,EACR,MAAM,0BAA0B,EAChC,IAAI,KAAS,gDAAgD,EAC7D,SAAS;AACd,CAAC;AAEM,IAAM,gCAAgC,EAC1C,OAAO;AAAA,EACN,WAAW;AAAA,EACX,WAAW,EAAE,QAAQ;AAAA,EACrB,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAC3C,CAAC,EACA,OAAO,CAAC,UAAU,MAAM,cAAc,UAAa,MAAM,cAAc,MAAM;AAAA,EAC5E,SAAS;AAAA,EACT,MAAM,CAAC,WAAW;AACpB,CAAC;AAEI,IAAM,gCAAgC,EAAE,OAAO;AAAA,EACpD,WAAW;AAAA,EACX,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,OAAO,EACJ,MAAM,qBAAqB,EAC3B,IAAI,KAAM,0CAA0C;AACzD,CAAC;AAEM,IAAM,sCAAsC,EAAE,OAAO;AAAA,EAC1D,WAAW;AAAA,EACX,oBAAoB,EAAE,QAAQ,EAAE,SAAS;AAAA,EACzC,MAAM;AAAA,EACN,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EACzC,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,yCAAyC,EAAE,SAAS;AAC1F,CAAC;AAMD,IAAM,mBAAmB,CAAyB,WAChD,OAAO,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,UAAU,SAAS,MAAS;AAEtE,IAAM,6BAA6B,EAChC,OAAO;AAAA,EACN,MAAM,EAAE,KAAK,4BAA4B;AAAA,EACzC,aAAa,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC;AAAA,EAChE,SAAS,iBAAiB,EAAE,QAAQ,CAAC;AACvC,CAAC,EACA,OAAO;AAEV,IAAM,+BAA+B,EAClC,OAAO;AAAA,EACN,QAAQ,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EAC1D,SAAS,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EAC3D,SAAS,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EAC3D,OAAO,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC;AAAA,EACzD,mBAAmB,iBAAiB,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;AAAA,EACtF,iBAAiB,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC;AAAA,EACpE,YAAY,iBAAiB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAAA,EACrD,OAAO,iBAAiB,EAAE,QAAQ,CAAC;AAAA,EACnC,WAAW,iBAAiB,EAAE,QAAQ,CAAC;AAAA,EACvC,iBAAiB,iBAAiB,EAAE,KAAK,CAAC,QAAQ,cAAc,cAAc,YAAY,WAAW,CAAC,CAAC;AAAA,EACvG,WAAW,iBAAiB,EAAE,QAAQ,CAAC;AAAA,EACvC,QAAQ,iBAAiB,EAAE,KAAK,CAAC,QAAQ,mBAAmB,SAAS,CAAC,CAAC;AAAA,EACvE,eAAe,iBAAiB,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC,EAAE,IAAI,EAAE,CAAC;AACrF,CAAC,EACA,OAAO;AAEH,IAAM,gCAAgC,EAC1C,OAAO;AAAA,EACN,gBAAgB,iBAAiB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAI,CAAC;AAAA,EACnE,YAAY,iBAAiB,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAAA,EACrD,MAAM,iBAAiB,EAAE,KAAK,iCAAiC,CAAC;AAAA,EAChE,kBAAkB,iBAAiB,EAAE,KAAK,mCAAmC,CAAC;AAAA,EAC9E,sBAAsB,iBAAiB,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC;AAAA,EACzF,WAAW,iBAAiB,EAAE,MAAM,0BAA0B,EAAE,IAAI,GAAG,CAAC;AAAA,EACxE,mBAAmB,iBAAiB,EAAE,MAAM,4BAA4B,EAAE,IAAI,GAAG,CAAC;AACpF,CAAC,EACA,OAAO;AAkFV,IAAM,UAA4C;AAAA,EAChD,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,kBAAkB;AAAA,EAClB,SAAS;AAAA,EACT,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,WAAW;AAAA,EACX,oBAAoB;AAAA,EACpB,sBAAsB;AAAA,EACtB,qBAAqB;AAAA,EACrB,YAAY;AAAA,EACZ,eAAe;AAAA,EACf,eAAe;AAAA,EACf,aAAa;AAAA,EACb,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,wBAAwB;AAAA,EACxB,kBAAkB;AAAA,EAClB,kBAAkB;AACpB;AAOO,SAAS,gBACd,YACA,MAC+E;AAC/E,QAAM,SAAS,QAAQ,UAAU;AACjC,MAAI,CAAC,QAAQ;AACX,WAAO;AAAA,MACL,SAAS;AAAA,MACT,OAAO;AAAA,QACL,OAAO,mBAAmB,UAAU;AAAA,QACpC,MAAM;AAAA,QACN,SAAS,CAAC;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAAS,OAAO,UAAU,8BAA8B,IAAI,CAAC;AACnE,MAAI,OAAO,SAAS;AAClB,WAAO,EAAE,SAAS,MAAM,MAAM,OAAO,KAAU;AAAA,EACjD;AACA,SAAO,EAAE,SAAS,OAAO,OAAO,eAAe,OAAO,KAAK,EAAE;AAC/D;AAEA,SAAS,8BAA8B,MAAwB;AAC7D,MAAI,CAAC,QAAQ,OAAO,SAAS,YAAY,MAAM,QAAQ,IAAI,EAAG,QAAO;AACrE,QAAM,UAAmC,CAAC;AAC1C,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAA+B,GAAG;AAC1E,QAAI,UAAU,QAAQ,QAAQ,gBAAiB;AAC/C,YAAQ,GAAG,IAAI;AAAA,EACjB;AACA,SAAO;AACT;","names":[]}

package/dist/{chunk-46Z3VGWF.js → chunk-ZYRAY5FL.js}

@@ -1,13 +1,13 @@
 import {
   SharedFeedbackEntrySchema,
   resolveSharedContextDir
-} from "./chunk-CARRTDKC.js";
+} from "./chunk-Z22M4JCY.js";
 import {
   composeSalvagedEnvelope
 } from "./chunk-6ET2VII7.js";
 import {
   StorageManager
-} from "./chunk-MVG3KXON.js";
+} from "./chunk-I65KB36L.js";
 import {
   parseContinuityImprovementLoops
 } from "./chunk-LDXUBPMO.js";
@@ -1283,4 +1283,4 @@ export {
   defaultTierMigrationCycleBudget,
   CompoundingEngine
 };
-//# sourceMappingURL=chunk-46Z3VGWF.js.map
+//# sourceMappingURL=chunk-ZYRAY5FL.js.map

package/dist/{chunk-3XPN7AVY.js → chunk-ZYSOT6HD.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-AAD2ZS6P.js";
 import {
   gatewayTaskChainOptions
-} from "./chunk-THTF2W7M.js";
+} from "./chunk-TRTLWUDD.js";
 import {
   extractJsonCandidates
 } from "./chunk-RGMVMVMF.js";
@@ -685,4 +685,4 @@ export {
   serializeFaithfulnessFields,
   parseFaithfulnessField
 };
-//# sourceMappingURL=chunk-3XPN7AVY.js.map
+//# sourceMappingURL=chunk-ZYSOT6HD.js.map