@tangle-network/agent-knowledge 3.1.0 → 3.2.1

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/web-research-worker.ts","../src/adaptive-driver.ts","../src/agent-candidate.ts","../src/kb-improvement.ts","../src/claim-grounding.ts","../src/rag-eval.ts","../src/research-loop.ts","../src/events.ts","../src/eval-readiness.ts","../src/readiness-helpers.ts","../src/rag-improvement-loop.ts","../src/changes.ts","../src/chunking.ts","../src/collection-research-driver.ts","../src/discovery.ts","../src/freshness.ts","../src/investment-thesis-set.ts","../src/investment-thesis-task.ts","../src/material-facts-metric.ts","../src/two-agent-research-loop.ts","../src/kb-store.ts","../src/propose-from-finding.ts","../src/readiness-check.ts","../src/release.ts","../src/research-driving-driver.ts"],"sourcesContent":["/**\n * Real web-research worker + verifying driver for `runVerifiedResearchLoop`.\n *\n * This is the GENERAL, any-topic implementation behind the two-agent research\n * loop's live arm. Given the open knowledge gaps the readiness gate surfaces,\n * the worker:\n *\n *   1. asks an LLM (glm-5.2 by default) to turn each gap into focused web\n *      search queries,\n *   2. runs a REAL web search over the Tangle router (`POST /v1/search` — the\n *      same endpoint `tcloud mcp`'s `web_search` tool forwards to), so there is\n *      no hardcoded corpus,\n *   3. fetches the top results with the repo's polite, cached `politeFetch` and\n *      reduces each page to text with `htmlToText`,\n *   4. proposes the readable, verifiable pages as `ResearchSourceProposal`s plus\n *      a `buildPages` that writes citing `knowledge/*.md` pages from the sources\n *      the driver accepts.\n *\n * The verifying DRIVER is the differentiated role from the two-agent loop: a\n * second LLM pass that judges each fetched source's on-topic relevance to the\n * goal + open gaps and rejects off-topic / spam / already-covered material. The\n * worker ADDS; the driver GATES. Together they build a cleaner knowledge base\n * than a single agent at the same compute budget.\n *\n * Dependency-free on purpose: it talks to the router over `fetch` directly with\n * the published OpenAI-compatible chat shape and the `/v1/search` shape, so it\n * works whether or not the `tcloud` CLI is installed. Point it at any router by\n * passing `baseUrl`; supply the key via `apiKey` or `TANGLE_API_KEY`.\n */\n\nimport { htmlToText } from './sources/html'\nimport { politeFetch } from './sources/http'\nimport type {\n  KnowledgeGap,\n  ResearchContribution,\n  ResearchDriver,\n  ResearchSourceProposal,\n  ResearchWorker,\n  SourceVerdict,\n  SourceVerificationContext,\n  WorkerResearchContext,\n} from './two-agent-research-loop'\nimport type { SourceRecord } from './types'\n\n/** Default router model. Plain id (no namespace) — see CLAUDE/creds notes. */\nconst DEFAULT_MODEL = 'glm-5.2'\n/** Default router base. */\nconst DEFAULT_BASE_URL = 'https://router.tangle.tools/v1'\n/**\n * glm-5.2 spends its first tokens on hidden `reasoning_content`; below ~1200\n * output tokens it returns EMPTY visible content. Floor every call so a\n * reasoning model never silently yields nothing. (Verified creds note.)\n */\nconst MIN_MAX_TOKENS = 1200\n\n/** One live web result, as the router's `/v1/search` returns it. */\nexport interface WebSearchHit {\n  title: string\n  url: string\n  snippet?: string\n}\n\n/**\n * The two router capabilities the worker/driver need. Injectable so tests can\n * stub the network; the default talks to the live Tangle router over `fetch`.\n */\nexport interface RouterClient {\n  /** Live web search — returns title/url/snippet hits. */\n  search(query: string, opts?: { maxResults?: number }): Promise<WebSearchHit[]>\n  /** Chat completion — returns the assistant message's visible text. */\n  chat(\n    messages: { role: 'system' | 'user'; content: string }[],\n    maxTokens?: number,\n  ): Promise<string>\n  /** Cumulative cost (chat + search) since this client was created. */\n  usage(): RouterUsage\n}\n\n/**\n * Cumulative router cost — the per-arm signal the A/B reports ALONGSIDE quality,\n * so \"2.3 fewer sources\" can be read against the token/$/latency it cost. A\n * two-agent round is one worker pass plus N `verifySource` LLM calls; counting\n * each call here is what surfaces that the two-agent loop spends more inference\n * than its \"equal passes\" budget implies.\n */\nexport interface RouterUsage {\n  chatCalls: number\n  searchCalls: number\n  promptTokens: number\n  completionTokens: number\n  usd: number\n  wallMs: number\n}\n\nexport interface TangleRouterOptions {\n  /** Router base URL. Defaults to `https://router.tangle.tools/v1`. */\n  baseUrl?: string\n  /** Bearer key. Defaults to `process.env.TANGLE_API_KEY`. */\n  apiKey?: string\n  /** Chat model id. Defaults to `glm-5.2`. */\n  model?: string\n  /** Optional preferred search provider (exa | you | perplexity | …). */\n  searchProvider?: string\n  /**\n   * Retries on a TRANSIENT upstream status (502/503/504/429) with exponential\n   * backoff. Default 4. A 4xx that isn't 429, and a 401, are NOT retried — those\n   * are not transient. After the budget is exhausted the call still fails loud\n   * with the original `RouterError`, so the fail-closed contract holds; this only\n   * stops a single upstream-capacity blip from voiding a whole multi-topic run.\n   */\n  maxRetries?: number\n  /** Base backoff in ms (doubled each retry, ±25% jitter). Default 1500. */\n  retryBaseMs?: number\n  signal?: AbortSignal\n}\n\n/** Transient upstream statuses worth a retry (capacity / rate-limit / gateway). */\nconst transientStatuses = new Set([429, 502, 503, 504])\n\n/**\n * POST with bounded exponential backoff on transient upstream statuses. Returns\n * the first `res.ok` response, or the LAST response (so the caller throws the\n * real status). A non-transient failure returns immediately — only 502/503/504/\n * 429 are retried. Aborts propagate at once.\n */\nasync function fetchWithRetry(\n  url: string,\n  init: RequestInit,\n  opts: { maxRetries: number; retryBaseMs: number; signal?: AbortSignal },\n): Promise<Response> {\n  let lastRes: Response | undefined\n  for (let attempt = 0; attempt <= opts.maxRetries; attempt += 1) {\n    if (opts.signal?.aborted) throw new RouterError(0, 'aborted')\n    const res = await fetch(url, init)\n    if (res.ok || !transientStatuses.has(res.status)) return res\n    lastRes = res\n    if (attempt === opts.maxRetries) break\n    // Drain the body so the socket frees before we wait.\n    await res.text().catch(() => '')\n    const backoff = opts.retryBaseMs * 2 ** attempt\n    const jitter = backoff * (0.75 + Math.random() * 0.5)\n    await new Promise((resolve) => setTimeout(resolve, jitter))\n  }\n  // Exhausted: hand back the last transient response so the caller fails loud\n  // with its real status.\n  if (lastRes) return lastRes\n  throw new RouterError(0, 'fetchWithRetry produced no response')\n}\n\n/** A small error so a failed router call fails loud rather than returning junk. */\nexport class RouterError extends Error {\n  constructor(\n    public readonly status: number,\n    message: string,\n  ) {\n    super(`router ${status}: ${message}`)\n    this.name = 'RouterError'\n  }\n}\n\n/**\n * Build a dependency-free Tangle router client over `fetch`. This is the same\n * wire surface the `tcloud` SDK + `tcloud mcp` use (`/v1/search` for web search,\n * `/v1/chat/completions` for chat) so it needs no CLI installed.\n */\nexport function createTangleRouterClient(options: TangleRouterOptions = {}): RouterClient {\n  const baseUrl = (options.baseUrl ?? DEFAULT_BASE_URL).replace(/\\/$/, '')\n  const apiKey = options.apiKey ?? process.env.TANGLE_API_KEY\n  if (!apiKey) {\n    throw new RouterError(401, 'no TANGLE_API_KEY (pass apiKey or set the env var)')\n  }\n  const model = options.model ?? DEFAULT_MODEL\n  const maxRetries = Math.max(0, options.maxRetries ?? 4)\n  const retryBaseMs = Math.max(1, options.retryBaseMs ?? 1500)\n  const headers = {\n    'Content-Type': 'application/json',\n    Authorization: `Bearer ${apiKey}`,\n  }\n\n  // glm-5.2 pricing (USD per token) + a cumulative accumulator. Read via usage().\n  const price = { prompt: 0.95 / 1_000_000, completion: 3.0 / 1_000_000 }\n  const acc: RouterUsage = {\n    chatCalls: 0,\n    searchCalls: 0,\n    promptTokens: 0,\n    completionTokens: 0,\n    usd: 0,\n    wallMs: 0,\n  }\n\n  return {\n    async search(query, opts) {\n      const t0 = Date.now()\n      const res = await fetchWithRetry(\n        `${baseUrl}/search`,\n        {\n          method: 'POST',\n          headers,\n          signal: options.signal,\n          body: JSON.stringify({\n            query,\n            ...(options.searchProvider ? { provider: options.searchProvider } : {}),\n            ...(opts?.maxResults != null ? { maxResults: opts.maxResults } : {}),\n          }),\n        },\n        { maxRetries, retryBaseMs, signal: options.signal },\n      )\n      acc.searchCalls += 1\n      acc.wallMs += Date.now() - t0\n      if (!res.ok) {\n        throw new RouterError(res.status, await res.text().catch(() => res.statusText))\n      }\n      const body = (await res.json()) as { data?: WebSearchHit[] }\n      return (body.data ?? [])\n        .filter((hit) => typeof hit?.url === 'string' && hit.url.length > 0)\n        .map((hit) => ({ title: hit.title ?? hit.url, url: hit.url, snippet: hit.snippet }))\n    },\n    async chat(messages, maxTokens) {\n      // Reasoning-model floor: never let glm-5.2 spend the whole budget on\n      // hidden reasoning and return empty visible content.\n      const max_tokens = Math.max(MIN_MAX_TOKENS, maxTokens ?? MIN_MAX_TOKENS)\n      const t0 = Date.now()\n      const res = await fetchWithRetry(\n        `${baseUrl}/chat/completions`,\n        {\n          method: 'POST',\n          headers,\n          signal: options.signal,\n          body: JSON.stringify({ model, messages, max_tokens, temperature: 0.2, stream: false }),\n        },\n        { maxRetries, retryBaseMs, signal: options.signal },\n      )\n      if (!res.ok) {\n        throw new RouterError(res.status, await res.text().catch(() => res.statusText))\n      }\n      const body = (await res.json()) as {\n        choices?: { message?: { content?: string } }[]\n        usage?: { prompt_tokens?: number; completion_tokens?: number }\n      }\n      const promptTokens = body.usage?.prompt_tokens ?? 0\n      const completionTokens = body.usage?.completion_tokens ?? 0\n      acc.chatCalls += 1\n      acc.promptTokens += promptTokens\n      acc.completionTokens += completionTokens\n      acc.usd += promptTokens * price.prompt + completionTokens * price.completion\n      acc.wallMs += Date.now() - t0\n      return body.choices?.[0]?.message?.content ?? ''\n    },\n    usage() {\n      return { ...acc }\n    },\n  }\n}\n\nexport interface WebResearchWorkerOptions {\n  /** Router client. Defaults to a live Tangle router client from env creds. */\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /** Max search queries the LLM may form per gap. Default 2. */\n  queriesPerGap?: number\n  /** Max web results fetched per query. Default 3. */\n  resultsPerQuery?: number\n  /** Hard cap on sources proposed per round (across all gaps). Default 6. */\n  maxSourcesPerRound?: number\n  /** Disk cache dir for `politeFetch`. Optional; speeds repeat runs. */\n  cacheDir?: string\n  /** Minimum readable text length to keep a fetched page. Default 200. */\n  minTextChars?: number\n  /** Max chars of page text stored per source (keeps pages bounded). Default 4000. */\n  maxTextChars?: number\n}\n\n/** Resolve the router client lazily so a worker with an injected client never reads env. */\nfunction resolveRouter(opts: {\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n}): RouterClient {\n  return opts.router ?? createTangleRouterClient(opts.router_options)\n}\n\n/**\n * The real web-research worker. Conforms to the loop's `ResearchWorker`\n * contract: given the open gaps, it returns the sources it found plus a\n * `buildPages` that emits citing pages from the sources the driver accepted.\n */\nexport function createWebResearchWorker(options: WebResearchWorkerOptions = {}): ResearchWorker {\n  const queriesPerGap = Math.max(1, options.queriesPerGap ?? 2)\n  const resultsPerQuery = Math.max(1, options.resultsPerQuery ?? 3)\n  const maxSourcesPerRound = Math.max(1, options.maxSourcesPerRound ?? 6)\n  const minTextChars = Math.max(1, options.minTextChars ?? 200)\n  const maxTextChars = Math.max(minTextChars, options.maxTextChars ?? 4000)\n\n  return async (ctx: WorkerResearchContext): Promise<ResearchContribution> => {\n    const router = resolveRouter(options)\n    // Target the BLOCKING gaps first; fall back to all gaps if none are blocking.\n    const targetGaps = ctx.gaps.filter((gap) => gap.blocking)\n    const gaps = targetGaps.length > 0 ? targetGaps : ctx.gaps\n    if (gaps.length === 0) {\n      return { sources: [], notes: 'no open gaps to research' }\n    }\n\n    const queries = await formSearchQueries(router, ctx, gaps, queriesPerGap)\n    const proposals: ResearchSourceProposal[] = []\n    const seenUris = new Set<string>()\n\n    for (const query of queries) {\n      if (proposals.length >= maxSourcesPerRound) break\n      if (ctx.signal?.aborted) break\n      let hits: WebSearchHit[]\n      try {\n        hits = await router.search(query, { maxResults: resultsPerQuery })\n      } catch (error) {\n        // A single failed query must not sink the round — record nothing, move on.\n        if ((error as { name?: string }).name === 'AbortError') break\n        continue\n      }\n      for (const hit of hits) {\n        if (proposals.length >= maxSourcesPerRound) break\n        if (seenUris.has(hit.url)) continue\n        const fetched = await politeFetch(hit.url, {\n          signal: ctx.signal,\n          cacheDir: options.cacheDir,\n        })\n        if (!fetched.verifiable) continue\n        const text = htmlToText(fetched.body).slice(0, maxTextChars)\n        if (text.length < minTextChars) continue\n        seenUris.add(hit.url)\n        proposals.push({\n          uri: hit.url,\n          title: hit.title || hit.url,\n          text,\n          // We just fetched + verified this page, so stamp `lastVerifiedAt` with\n          // fetch time. Do NOT set `validUntil`: a live page has no inherent\n          // future expiry, and the readiness freshness check treats any\n          // `validUntil <= now` as EXPIRED (score 0). The page's `Last-Modified`\n          // is a PAST date, so writing it here would mark every real source stale\n          // and zero out coverage. Record it as provenance metadata instead.\n          lastVerifiedAt: fetched.fetchedAt,\n          metadata: {\n            discoveredVia: query,\n            snippet: hit.snippet ?? '',\n            goal: ctx.goal,\n            sourceUpdatedAt: fetched.sourceUpdatedAt,\n          },\n        })\n      }\n    }\n\n    return {\n      sources: proposals,\n      buildPages: buildCitingPages(proposals),\n      notes: `web-research worker: ${queries.length} queries → ${proposals.length} fetched sources`,\n    }\n  }\n}\n\n/**\n * Ask the LLM to turn the open gaps into focused web search queries. Falls back\n * to the gap's own readiness query if the model returns nothing parseable, so a\n * model hiccup degrades to a sane search rather than an empty round.\n */\nasync function formSearchQueries(\n  router: RouterClient,\n  ctx: WorkerResearchContext,\n  gaps: KnowledgeGap[],\n  queriesPerGap: number,\n): Promise<string[]> {\n  const gapLines = gaps\n    .map((gap, i) => `${i + 1}. ${gap.description} (readiness query: \"${gap.query}\")`)\n    .join('\\n')\n  const want = gaps.length * queriesPerGap\n  const system =\n    'You are a research librarian. Turn knowledge gaps into precise web search queries that will ' +\n    'surface authoritative primary sources (papers, docs, standards, official pages). ' +\n    'Return ONLY a JSON array of query strings, no prose.'\n  const user = [\n    `Research goal: ${ctx.goal}`,\n    ctx.steer ? `Steer from the coordinator:\\n${ctx.steer}` : '',\n    `Open knowledge gaps:\\n${gapLines}`,\n    `Return up to ${want} search query strings as a JSON array (e.g. [\"query one\",\"query two\"]).`,\n  ]\n    .filter(Boolean)\n    .join('\\n\\n')\n\n  let raw = ''\n  try {\n    raw = await router.chat(\n      [\n        { role: 'system', content: system },\n        { role: 'user', content: user },\n      ],\n      MIN_MAX_TOKENS,\n    )\n  } catch {\n    raw = ''\n  }\n  const parsed = parseQueryList(raw)\n  const fromLlm = parsed.slice(0, want)\n  if (fromLlm.length > 0) return dedupeStrings(fromLlm)\n  // Degrade to the readiness queries themselves — still a real search.\n  return dedupeStrings(gaps.map((gap) => gap.query || gap.description))\n}\n\n/** Parse a JSON array of query strings, tolerant of code fences / surrounding prose. */\nfunction parseQueryList(raw: string): string[] {\n  const text = raw.trim()\n  if (!text) return []\n  const candidates: string[] = []\n  // Prefer a fenced or bare JSON array.\n  const arrayMatch = text.match(/\\[[\\s\\S]*\\]/)\n  if (arrayMatch) {\n    try {\n      const arr = JSON.parse(arrayMatch[0]) as unknown[]\n      for (const item of arr)\n        if (typeof item === 'string' && item.trim()) candidates.push(item.trim())\n    } catch {\n      /* fall through to line parsing */\n    }\n  }\n  if (candidates.length === 0) {\n    for (const line of text.split('\\n')) {\n      const cleaned = line\n        .replace(/^\\s*(?:[-*]|\\d+[.)])\\s*/, '')\n        .replace(/^[\"']|[\"']$/g, '')\n        .trim()\n      if (cleaned && cleaned.length > 2 && !cleaned.startsWith('{')) candidates.push(cleaned)\n    }\n  }\n  return candidates\n}\n\nfunction dedupeStrings(values: string[]): string[] {\n  const seen = new Set<string>()\n  const out: string[] = []\n  for (const value of values) {\n    const key = value.toLowerCase().trim()\n    if (key && !seen.has(key)) {\n      seen.add(key)\n      out.push(value.trim())\n    }\n  }\n  return out\n}\n\n/**\n * Build the curated `knowledge/*.md` pages from the sources the driver accepted.\n * Each page cites the registered source by its assigned `record.id` (matched back\n * to the proposal via `metadata.originalUri`, which `addSourceText` stashes).\n */\nfunction buildCitingPages(\n  proposals: ResearchSourceProposal[],\n): (acceptedSources: SourceRecord[]) => string | undefined {\n  return (acceptedSources) => {\n    if (acceptedSources.length === 0) return undefined\n    const blocks = acceptedSources.map((record) => {\n      const proposal = proposals.find((p) => p.uri === record.metadata?.originalUri)\n      const uri = proposal?.uri ?? record.id\n      const slug =\n        uri\n          .replace(/^https?:\\/\\//, '')\n          .replace(/[^a-z0-9]+/gi, '-')\n          .replace(/^-+|-+$/g, '')\n          .slice(0, 120) || record.id\n      const title = proposal?.title ?? record.id\n      const body = proposal?.text ?? ''\n      return [\n        `---FILE: knowledge/${slug}.md---`,\n        '---',\n        `title: ${escapeYaml(title)}`,\n        `sources: [\"${record.id}\"]`,\n        `source_url: ${uri}`,\n        '---',\n        `# ${title}`,\n        '',\n        body,\n        '',\n        `Source: ${uri}`,\n        '---END FILE---',\n      ].join('\\n')\n    })\n    return blocks.join('\\n')\n  }\n}\n\nfunction escapeYaml(value: string): string {\n  // Keep the frontmatter line single-valued and safe: collapse newlines, strip\n  // quotes that would break the scalar.\n  return value\n    .replace(/[\\r\\n]+/g, ' ')\n    .replace(/\"/g, \"'\")\n    .trim()\n}\n\nexport interface VerifyingDriverOptions {\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /**\n   * When the LLM verdict can't be parsed, default to REJECT (fail-closed) so a\n   * model hiccup never poisons the KB with an unverified source. Set `true` to\n   * accept-on-parse-failure only if you have a reason to. Default false.\n   */\n  acceptOnParseFailure?: boolean\n}\n\n/**\n * The verifying driver: a real LLM pass that judges each candidate source's\n * on-topic relevance to the goal + open gaps and whether it duplicates material\n * already accepted this round. This is the differentiated coordinator role — it\n * GATES the worker's additions; it adds nothing itself.\n *\n * The loop already dedups exact-uri duplicates and only calls this on genuinely\n * new candidates, so the verifier focuses on relevance + near-duplicate\n * judgement, not bookkeeping.\n */\nexport function createVerifyingResearchDriver(\n  options: VerifyingDriverOptions = {},\n): ResearchDriver {\n  const acceptOnParseFailure = options.acceptOnParseFailure ?? false\n  return {\n    async verifySource(\n      source: ResearchSourceProposal,\n      ctx: SourceVerificationContext,\n    ): Promise<SourceVerdict> {\n      const router = resolveRouter(options)\n      const gapLines = ctx.gaps\n        .map((gap) => `- ${gap.description} (query: \"${gap.query}\")`)\n        .join('\\n')\n      const acceptedTitles = ctx.acceptedThisRound\n        .map((accepted) => `- ${accepted.title ?? accepted.uri}`)\n        .join('\\n')\n      const excerpt = source.text.slice(0, 1500)\n      const system =\n        'You verify whether a fetched web source belongs in a curated knowledge base. ' +\n        'Accept a source ONLY if it is genuinely on-topic for the research goal and helps close ' +\n        'one of the open gaps, AND it is not a near-duplicate of an already-accepted source. ' +\n        'Reject spam, listicles, off-topic pages, marketing, and near-duplicates. ' +\n        'Respond with ONLY a JSON object: {\"accept\": true|false, \"reason\": \"<short reason>\"}.'\n      const user = [\n        `Research goal: ${ctx.goal}`,\n        `Open gaps:\\n${gapLines || '(none specified)'}`,\n        acceptedTitles\n          ? `Already accepted this round:\\n${acceptedTitles}`\n          : 'Nothing accepted yet this round.',\n        `Candidate source:\\nURL: ${source.uri}\\nTitle: ${source.title ?? '(none)'}\\nExcerpt:\\n${excerpt}`,\n        'Verdict as JSON {\"accept\": boolean, \"reason\": string}:',\n      ].join('\\n\\n')\n\n      let raw = ''\n      try {\n        raw = await router.chat(\n          [\n            { role: 'system', content: system },\n            { role: 'user', content: user },\n          ],\n          MIN_MAX_TOKENS,\n        )\n      } catch (error) {\n        if ((error as { name?: string }).name === 'AbortError') throw error\n        // Router failure: fail-closed (reject) so an unverified source can't slip in.\n        return acceptOnParseFailure\n          ? { accept: true }\n          : { accept: false, reason: `verifier unavailable: ${(error as Error).message}` }\n      }\n\n      const verdict = parseVerdict(raw)\n      if (verdict) return verdict\n      return acceptOnParseFailure\n        ? { accept: true }\n        : { accept: false, reason: 'verifier returned an unparseable verdict' }\n    },\n  }\n}\n\n/** Parse the verifier's `{accept, reason}` JSON, tolerant of fences / prose. */\nfunction parseVerdict(raw: string): SourceVerdict | null {\n  const text = raw.trim()\n  if (!text) return null\n  const objMatch = text.match(/\\{[\\s\\S]*\\}/)\n  if (!objMatch) return null\n  try {\n    const parsed = JSON.parse(objMatch[0]) as { accept?: unknown; reason?: unknown }\n    if (typeof parsed.accept !== 'boolean') return null\n    if (parsed.accept) return { accept: true }\n    return {\n      accept: false,\n      reason:\n        typeof parsed.reason === 'string' && parsed.reason.trim()\n          ? parsed.reason.trim()\n          : 'rejected by verifier',\n    }\n  } catch {\n    return null\n  }\n}\n","/**\n * Adaptive verifier mode for `runVerifiedResearchLoop`.\n *\n * The cost/quality A/B (`docs/results/cost-quality.md`) found the LLM relevance\n * verifier's cleanliness win is dominated by DE-DUPLICATION — which a\n * deterministic content-hash / canonical-URL check captures at ~none of the LLM\n * premium — and that an LLM check only earns its dollar on the off-scope tail.\n * The honest production move it names is: do the cheap deterministic work first,\n * spend the LLM only where it pays. This module is that driver.\n *\n * Per candidate source the adaptive driver runs THREE stages, cheapest first,\n * and stops at the first that decides:\n *\n *   1. DEDUP ($0, no LLM). Reject a source whose CONTENT (normalized-text hash)\n *      or whose CANONICAL URL matches one already accepted this round or already\n *      in the knowledge base. This is the de-dup the relevance judge was being\n *      paid to do; doing it deterministically is free and exact.\n *\n *   2. HEURISTIC TRIAGE ($0, no LLM). For a unique survivor, a cheap host /\n *      title / length signal classifies it as clearly-keep, clearly-drop, or\n *      AMBIGUOUS. Clear cases are resolved without a model: an authoritative host\n *      (arxiv, *.edu, *.gov, official docs) with a substantial readable body is\n *      kept; an obvious spam/listicle/marketing title or a too-thin body is\n *      dropped. Only genuinely ambiguous survivors fall through.\n *\n *   3. LLM ESCALATION ($, one call). ONLY the ambiguous survivors reach the LLM\n *      `verifySource` — the shipped `createVerifyingResearchDriver` relevance\n *      judge. This is where the verifier earns its premium: the off-scope tail a\n *      cheap rule can't adjudicate.\n *\n * The result is the cost/quality frontier point the doc predicted: most of the\n * cleanliness (dedup + clear drops) at a fraction of the LLM $/calls (only the\n * ambiguous tail pays). It is a real `ResearchDriver` — same contract the\n * two-agent loop already gates on — and reuses `sha256`, the relevance verifier,\n * and the index; it reinvents none of them.\n */\n\nimport { sha256 } from './ids'\nimport type {\n  ResearchSourceProposal,\n  SourceVerdict,\n  SourceVerificationContext,\n} from './two-agent-research-loop'\nimport {\n  createVerifyingResearchDriver,\n  type RouterClient,\n  type TangleRouterOptions,\n  type VerifyingDriverOptions,\n} from './web-research-worker'\n\n/**\n * Canonicalize a URL for duplicate detection: lowercase host, strip a leading\n * `www.`, drop the scheme, the fragment, a trailing slash, and tracking query\n * params (`utm_*`, `ref`, `fbclid`, `gclid`, …). Two URLs that differ only by\n * those decorations canonicalize to the same key, so the dedup stage treats them\n * as the same source. Falls back to the lowercased raw string when the input is\n * not a parseable absolute URL (so non-http identifiers still dedup by equality).\n */\nexport function canonicalizeUrl(uri: string): string {\n  const trimmed = uri.trim()\n  try {\n    const url = new URL(trimmed)\n    const host = url.hostname.toLowerCase().replace(/^www\\./, '')\n    // Keep only non-tracking query params, sorted for stable ordering.\n    const kept: [string, string][] = []\n    for (const [key, value] of url.searchParams) {\n      const lower = key.toLowerCase()\n      if (lower.startsWith('utm_')) continue\n      if (trackingParams.has(lower)) continue\n      kept.push([key, value])\n    }\n    kept.sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n    const query = kept.map(([k, v]) => `${k}=${v}`).join('&')\n    const path = url.pathname.replace(/\\/+$/, '') || '/'\n    return `${host}${path}${query ? `?${query}` : ''}`\n  } catch {\n    return trimmed.toLowerCase()\n  }\n}\n\n/** Tracking / referrer query params dropped during URL canonicalization. */\nconst trackingParams = new Set([\n  'ref',\n  'ref_src',\n  'source',\n  'fbclid',\n  'gclid',\n  'mc_cid',\n  'mc_eid',\n  'igshid',\n  'spm',\n  '_hsenc',\n  '_hsmi',\n])\n\n/**\n * A stable content key for a fetched page: the sha256 of its normalized text\n * (lowercased, punctuation/whitespace collapsed). Two pages whose readable body\n * is the same modulo formatting collide here, so the dedup stage rejects a\n * mirror/syndication of an already-accepted source even when the URL differs.\n */\nexport function contentKey(text: string): string {\n  const normalized = text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .replace(/\\s+/g, ' ')\n    .trim()\n  return sha256(normalized)\n}\n\n/** Why the deterministic dedup stage rejected a candidate (for audit/notes). */\nexport type DedupReason = 'duplicate-url' | 'duplicate-content'\n\n/** The cheap-triage classification of a unique survivor. */\nexport type TriageClass = 'keep' | 'drop' | 'ambiguous'\n\n/** One source's adaptive routing decision, for instrumentation and the doc. */\nexport interface AdaptiveDecision {\n  uri: string\n  /** The stage that decided this source: dedup | heuristic | llm. */\n  stage: 'dedup' | 'heuristic' | 'llm'\n  accepted: boolean\n  /** The triage class assigned (set once past dedup). */\n  triage?: TriageClass\n  reason?: string\n}\n\n/** Running tally of where the adaptive driver spent its decisions. */\nexport interface AdaptiveStats {\n  total: number\n  /** Rejected by deterministic dedup (URL or content). $0. */\n  dedupRejected: number\n  /** Kept by the cheap heuristic without an LLM call. $0. */\n  heuristicKept: number\n  /** Dropped by the cheap heuristic without an LLM call. $0. */\n  heuristicDropped: number\n  /** Escalated to the LLM relevance verifier ($ — the only paid stage). */\n  llmCalls: number\n  /** Of the escalations, how many the LLM accepted. */\n  llmAccepted: number\n  decisions: AdaptiveDecision[]\n}\n\nexport interface AdaptiveDriverOptions {\n  /** Router client for the LLM escalation. Defaults to a live client from env. */\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /** Passed through to the escalation relevance verifier. */\n  verifying?: Pick<VerifyingDriverOptions, 'acceptOnParseFailure'>\n  /**\n   * Hosts an authoritative source lives on. A unique survivor on one of these,\n   * with a substantial body, is KEPT deterministically (no LLM). Suffix-matched\n   * against the canonical host, so `arxiv.org` matches `export.arxiv.org`. The\n   * defaults cover papers, official docs, and standards bodies.\n   */\n  authoritativeHosts?: string[]\n  /**\n   * Title/snippet patterns that mark obvious spam / listicle / marketing — a\n   * unique survivor matching one is DROPPED deterministically (no LLM).\n   */\n  spamPatterns?: RegExp[]\n  /**\n   * Below this many readable chars a survivor is too thin to be a real reference\n   * and is dropped deterministically. Default 400.\n   */\n  minBodyChars?: number\n  /**\n   * A survivor whose body is at or above this many chars AND on an authoritative\n   * host is kept without an LLM call. Default 600.\n   */\n  substantialBodyChars?: number\n  /** Receives each routing decision as it is made (for live instrumentation). */\n  onDecision?: (decision: AdaptiveDecision) => void\n}\n\n/** Default authoritative host suffixes — papers, official docs, standards. */\nconst defaultAuthoritativeHosts = [\n  'arxiv.org',\n  'aclanthology.org',\n  'openreview.net',\n  'dl.acm.org',\n  'ieeexplore.ieee.org',\n  'nature.com',\n  'science.org',\n  'pubmed.ncbi.nlm.nih.gov',\n  'ncbi.nlm.nih.gov',\n  '.edu',\n  '.gov',\n  'docs.python.org',\n  'pytorch.org',\n  'tensorflow.org',\n  'huggingface.co',\n  'github.com',\n  'developer.mozilla.org',\n  'wikipedia.org',\n  'w3.org',\n  'ietf.org',\n  'rfc-editor.org',\n]\n\n/** Default spam/listicle/marketing title patterns. */\nconst defaultSpamPatterns = [\n  /\\bbuy\\b.*\\b(cheap|now|deal|sale|discount)\\b/i,\n  /\\b\\d+\\s+(things|ways|reasons|tips|tricks|secrets|hacks)\\b.*\\b(you|that|will)\\b/i,\n  /\\bshock(ing|ed)?\\b/i,\n  /\\bclickbait\\b/i,\n  /!!!|\\$\\$\\$/,\n  /\\b(coupon|promo code|affiliate|sponsored)\\b/i,\n  /\\bbest .* (of \\d{4}|in \\d{4})\\b/i,\n]\n\n/**\n * Classify a UNIQUE survivor (already past dedup) with cheap host/title/length\n * signals only — no LLM. Returns `keep`, `drop`, or `ambiguous`. `ambiguous` is\n * the residue the LLM is reserved for: on-topic-looking pages on unknown hosts\n * with a plausible body, which a host/title rule cannot adjudicate.\n */\nexport function triageSource(\n  source: ResearchSourceProposal,\n  options: {\n    authoritativeHosts: string[]\n    spamPatterns: RegExp[]\n    minBodyChars: number\n    substantialBodyChars: number\n  },\n): { triage: TriageClass; reason: string } {\n  const titleAndSnippet = `${source.title ?? ''} ${\n    typeof source.metadata?.snippet === 'string' ? source.metadata.snippet : ''\n  }`.trim()\n  const bodyLen = source.text.trim().length\n\n  // Clear DROP: obvious spam/listicle/marketing title, OR a too-thin body that\n  // can't be a real reference.\n  for (const pattern of options.spamPatterns) {\n    if (pattern.test(titleAndSnippet)) {\n      return { triage: 'drop', reason: `spam/listicle title (${pattern.source})` }\n    }\n  }\n  if (bodyLen < options.minBodyChars) {\n    return { triage: 'drop', reason: `thin body (${bodyLen} < ${options.minBodyChars} chars)` }\n  }\n\n  // Clear KEEP: an authoritative host with a substantial readable body. The host\n  // is a strong prior for a real reference; the length rules out a stub page.\n  const host = hostOf(source.uri)\n  const authoritative =\n    host.length > 0 && options.authoritativeHosts.some((suffix) => hostMatches(host, suffix))\n  if (authoritative && bodyLen >= options.substantialBodyChars) {\n    return { triage: 'keep', reason: `authoritative host ${host} + substantial body (${bodyLen})` }\n  }\n\n  // Everything else is AMBIGUOUS — an unknown host with a plausible body. This\n  // is exactly the off-scope tail the LLM relevance judge is reserved for.\n  return { triage: 'ambiguous', reason: `unknown host ${host || '(none)'}, body ${bodyLen} chars` }\n}\n\nfunction hostOf(uri: string): string {\n  try {\n    return new URL(uri.trim()).hostname.toLowerCase().replace(/^www\\./, '')\n  } catch {\n    return ''\n  }\n}\n\n/** Suffix host match: `.edu` matches `mit.edu`; `arxiv.org` matches `export.arxiv.org`. */\nfunction hostMatches(host: string, suffix: string): boolean {\n  if (suffix.startsWith('.')) return host.endsWith(suffix) || host === suffix.slice(1)\n  return host === suffix || host.endsWith(`.${suffix}`)\n}\n\nexport interface AdaptiveResearchDriver {\n  verifySource(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<SourceVerdict>\n  /** Live tally of where decisions were spent — the cost/quality instrumentation. */\n  stats(): AdaptiveStats\n}\n\n/**\n * Build the adaptive verifier. The deterministic stages (dedup + heuristic\n * triage) cost $0; only AMBIGUOUS survivors escalate to the LLM relevance\n * verifier. `stats()` exposes where every decision was spent so the A/B can read\n * the LLM $/calls the adaptive driver saved against the cleanliness it kept.\n *\n * Dedup state is kept on the driver instance: it tracks the canonical URLs and\n * content hashes it has ACCEPTED, plus those it sees in the verification\n * context's `acceptedThisRound` and the KB index. Use one driver per loop run.\n */\nexport function createAdaptiveResearchDriver(\n  options: AdaptiveDriverOptions = {},\n): AdaptiveResearchDriver {\n  const authoritativeHosts = options.authoritativeHosts ?? defaultAuthoritativeHosts\n  const spamPatterns = options.spamPatterns ?? defaultSpamPatterns\n  const minBodyChars = Math.max(1, options.minBodyChars ?? 400)\n  const substantialBodyChars = Math.max(minBodyChars, options.substantialBodyChars ?? 600)\n\n  // The shipped LLM relevance verifier — the ONLY paid stage, reused, not rebuilt.\n  const relevance = createVerifyingResearchDriver({\n    router: options.router,\n    router_options: options.router_options,\n    acceptOnParseFailure: options.verifying?.acceptOnParseFailure,\n  })\n\n  // Dedup memory across the run: every URL/content key this driver ACCEPTED.\n  const acceptedUrlKeys = new Set<string>()\n  const acceptedContentKeys = new Set<string>()\n\n  const stats: AdaptiveStats = {\n    total: 0,\n    dedupRejected: 0,\n    heuristicKept: 0,\n    heuristicDropped: 0,\n    llmCalls: 0,\n    llmAccepted: 0,\n    decisions: [],\n  }\n\n  function record(decision: AdaptiveDecision): void {\n    stats.decisions.push(decision)\n    options.onDecision?.(decision)\n  }\n\n  return {\n    async verifySource(source, ctx): Promise<SourceVerdict> {\n      stats.total += 1\n      const urlKey = canonicalizeUrl(source.uri)\n      const cKey = contentKey(source.text)\n\n      // ---- STAGE 1: DETERMINISTIC DEDUP ($0) ----------------------------------\n      // Seed the dup sets from what the loop already accepted this round AND from\n      // the KB index, so a duplicate of an existing source is caught even if this\n      // driver instance hasn't seen it yet.\n      const roundUrlKeys = new Set(\n        ctx.acceptedThisRound.map((accepted) => canonicalizeUrl(accepted.uri)),\n      )\n      const roundContentKeys = new Set(\n        ctx.acceptedThisRound.map((accepted) => contentKey(accepted.text)),\n      )\n      const indexUrlKeys = new Set(\n        ctx.index.sources.flatMap((indexed) =>\n          typeof indexed.metadata?.originalUri === 'string'\n            ? [canonicalizeUrl(indexed.metadata.originalUri)]\n            : [],\n        ),\n      )\n      const dupUrl =\n        acceptedUrlKeys.has(urlKey) || roundUrlKeys.has(urlKey) || indexUrlKeys.has(urlKey)\n      const dupContent = acceptedContentKeys.has(cKey) || roundContentKeys.has(cKey)\n      if (dupUrl || dupContent) {\n        stats.dedupRejected += 1\n        const reason: DedupReason = dupUrl ? 'duplicate-url' : 'duplicate-content'\n        record({ uri: source.uri, stage: 'dedup', accepted: false, reason })\n        return { accept: false, reason: `dedup: ${reason}` }\n      }\n\n      // ---- STAGE 2: CHEAP HEURISTIC TRIAGE ($0) -------------------------------\n      const { triage, reason } = triageSource(source, {\n        authoritativeHosts,\n        spamPatterns,\n        minBodyChars,\n        substantialBodyChars,\n      })\n      if (triage === 'keep') {\n        stats.heuristicKept += 1\n        acceptedUrlKeys.add(urlKey)\n        acceptedContentKeys.add(cKey)\n        record({ uri: source.uri, stage: 'heuristic', accepted: true, triage, reason })\n        return { accept: true }\n      }\n      if (triage === 'drop') {\n        stats.heuristicDropped += 1\n        record({ uri: source.uri, stage: 'heuristic', accepted: false, triage, reason })\n        return { accept: false, reason: `heuristic drop: ${reason}` }\n      }\n\n      // ---- STAGE 3: LLM ESCALATION ($ — ambiguous tail only) ------------------\n      stats.llmCalls += 1\n      const verdict = await relevance.verifySource(source, ctx)\n      if (verdict.accept) {\n        stats.llmAccepted += 1\n        acceptedUrlKeys.add(urlKey)\n        acceptedContentKeys.add(cKey)\n      }\n      record({\n        uri: source.uri,\n        stage: 'llm',\n        accepted: verdict.accept,\n        triage,\n        reason: verdict.accept ? 'llm accepted' : verdict.reason,\n      })\n      return verdict\n    },\n    stats(): AdaptiveStats {\n      return {\n        ...stats,\n        decisions: [...stats.decisions],\n      }\n    },\n  }\n}\n","import {\n  type AgentCandidateKnowledgeRef,\n  sha256DigestSchema,\n} from '@tangle-network/agent-interface'\n\nimport {\n  type KnowledgeImprovementCandidateRef,\n  KnowledgeImprovementCandidateRefSchema,\n} from './kb-improvement'\n\n/** Convert a measured knowledge candidate into the shared review and execution identity. */\nexport function toAgentCandidateKnowledgeRef(\n  candidate: KnowledgeImprovementCandidateRef,\n): AgentCandidateKnowledgeRef {\n  const parsed = KnowledgeImprovementCandidateRefSchema.parse(candidate)\n  return {\n    ...parsed,\n    goalHash: prefixedDigest(parsed.goalHash),\n    baseHash: prefixedDigest(parsed.baseHash),\n    candidateHash: prefixedDigest(parsed.candidateHash),\n    evidenceHash: prefixedDigest(parsed.evidenceHash),\n    promotionPlanHash: prefixedDigest(parsed.promotionPlanHash),\n  }\n}\n\n/** Recover agent-knowledge's candidate identity from the shared contract. */\nexport function fromAgentCandidateKnowledgeRef(\n  candidate: AgentCandidateKnowledgeRef,\n): KnowledgeImprovementCandidateRef {\n  return KnowledgeImprovementCandidateRefSchema.parse({\n    ...candidate,\n    goalHash: rawDigest(candidate.goalHash),\n    baseHash: rawDigest(candidate.baseHash),\n    candidateHash: rawDigest(candidate.candidateHash),\n    evidenceHash: rawDigest(candidate.evidenceHash),\n    promotionPlanHash: rawDigest(candidate.promotionPlanHash),\n  })\n}\n\nfunction prefixedDigest(value: string) {\n  return sha256DigestSchema.parse(`sha256:${value}`)\n}\n\nfunction rawDigest(value: string): string {\n  return sha256DigestSchema.parse(value).slice('sha256:'.length)\n}\n","import { createHash } from 'node:crypto'\nimport { cp, lstat, mkdir, mkdtemp, rm, stat } from 'node:fs/promises'\nimport { tmpdir } from 'node:os'\nimport { dirname, isAbsolute, join, relative, resolve, sep } from 'node:path'\nimport {\n  canonicalJson,\n  contentHash,\n  type RunRecord,\n  validateRunRecord,\n} from '@tangle-network/agent-eval'\nimport { z } from 'zod'\nimport {\n  isMissingFile,\n  listRegularFilesWithinRoot,\n  readRegularFileWithinRoot,\n  renameDurable,\n  withSafeDirectory,\n  writeJsonDurableWithinRoot,\n} from './durable-fs'\nimport type {\n  BuildEvalKnowledgeBundleOptions,\n  EvalKnowledgeBundleBuildResult,\n  KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport {\n  applyKnowledgeFileTransaction,\n  assertKnowledgeMutationPath,\n  finishKnowledgeFileTransaction,\n  type KnowledgeFileMutation,\n  type KnowledgeFileTransaction,\n  type KnowledgeFileTransactionPlanEntry,\n  knowledgeFileTransactionPlanHash,\n  prepareKnowledgeFileTransaction,\n  rollbackKnowledgeFileTransaction,\n} from './file-transaction'\nimport { sha256, slugify, stableId } from './ids'\nimport { buildKnowledgeIndex, writeKnowledgeIndex } from './indexer'\nimport { acquireDurableFileLock, withKnowledgeMutation, withKnowledgeRead } from './mutation-lock'\nimport {\n  type KnowledgeBaseQualityOptions,\n  type KnowledgeBaseQualityReport,\n  scoreKnowledgeBaseIndex,\n} from './rag-eval'\nimport {\n  type RagKnowledgeImprovementPhase,\n  type RagKnowledgeResearchOptions,\n  type RagKnowledgeUpdateInput,\n  type RagKnowledgeUpdateResult,\n  type RunRagKnowledgeImprovementLoopOptions,\n  type RunRagKnowledgeImprovementLoopResult,\n  runRagKnowledgeImprovementLoop,\n} from './rag-improvement-loop'\nimport { readinessFor } from './readiness-helpers'\nimport type { RunKnowledgeResearchLoopOptions } from './research-loop'\nimport type { RunRetrievalImprovementLoopOptions } from './retrieval-eval'\nimport { layoutFor } from './store'\nimport type { KnowledgeIndex } from './types'\nimport {\n  type ValidateKnowledgeOptions,\n  type ValidateKnowledgeResult,\n  validateKnowledgeIndex,\n} from './validate'\n\nexport type KnowledgeImprovementStatus =\n  | 'running'\n  | 'candidate-ready'\n  | 'promoted'\n  | 'rejected'\n  | 'blocked'\n\ninterface KnowledgeImprovementMetricProvenanceBase {\n  evaluator: string\n  version: string\n}\n\nexport type KnowledgeImprovementMetricProvenance =\n  | (KnowledgeImprovementMetricProvenanceBase & {\n      method: 'deterministic'\n    })\n  | (KnowledgeImprovementMetricProvenanceBase & {\n      method: 'sampled' | 'composite'\n      corpusHash: string\n      runRecords: RunRecord[]\n    })\n  | (KnowledgeImprovementMetricProvenanceBase & {\n      method: 'model'\n      model: string\n      corpusHash: string\n      runRecords: RunRecord[]\n    })\n\nexport interface KnowledgeImprovementMetric {\n  score: number\n  passed: boolean\n  dimensions?: Record<string, number>\n  notes?: string\n  provenance: KnowledgeImprovementMetricProvenance\n}\n\nexport interface KnowledgeImprovementEvaluationInput {\n  runId: string\n  iteration: number\n  root: string\n  baselineRoot: string\n  candidateRoot: string\n  baselineIndex: KnowledgeIndex\n  candidateIndex: KnowledgeIndex\n  baseHash: string\n  candidateHash: string\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  kbQuality: KnowledgeBaseQualityReport\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n  signal?: AbortSignal\n}\n\nexport type KnowledgeImprovementEvaluator = (\n  input: KnowledgeImprovementEvaluationInput,\n) => Promise<KnowledgeImprovementMetric> | KnowledgeImprovementMetric\n\nexport interface KnowledgeImprovementCandidateRecord {\n  iteration: number\n  candidateId: string\n  baseHash: string\n  candidateHash?: string\n  evidenceHash?: string\n  promotionPlanHash?: string\n  status: KnowledgeImprovementStatus\n  createdAt: string\n  updatedAt: string\n}\n\nexport interface KnowledgeImprovementRunState {\n  runId: string\n  root: string\n  goal: string\n  status: KnowledgeImprovementStatus\n  baseHash: string\n  createdAt: string\n  updatedAt: string\n  ownerId?: string\n  candidates: KnowledgeImprovementCandidateRecord[]\n  promotedCandidateId?: string\n  blockedReason?: string\n}\n\nexport interface KnowledgeImprovementResult {\n  runId: string\n  state: KnowledgeImprovementRunState\n  candidate?: KnowledgeImprovementCandidateRecord\n  evaluation?: KnowledgeImprovementMetric\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n  promoted: boolean\n  blocked: boolean\n}\n\nconst digestSchema = z.string().regex(/^[a-f0-9]{64}$/)\nconst runIdSchema = z.string().min(1).max(2_048)\nconst safePathSegmentSchema = z\n  .string()\n  .min(1)\n  .max(128)\n  .regex(/^[A-Za-z0-9][A-Za-z0-9._-]*$/)\nconst improvementStatusSchema = z.enum([\n  'running',\n  'candidate-ready',\n  'promoted',\n  'rejected',\n  'blocked',\n])\nconst runRecordSchema = z.custom<RunRecord>((value) => {\n  try {\n    validateRunRecord(value)\n    return true\n  } catch {\n    return false\n  }\n}, 'invalid agent-eval RunRecord')\nconst deterministicMetricProvenanceSchema = z\n  .object({\n    evaluator: z.string().min(1),\n    version: z.string().min(1),\n    method: z.literal('deterministic'),\n  })\n  .strict()\nconst measuredMetricProvenanceSchema = z\n  .object({\n    evaluator: z.string().min(1),\n    version: z.string().min(1),\n    method: z.enum(['sampled', 'composite']),\n    corpusHash: digestSchema,\n    runRecords: z.array(runRecordSchema).min(1),\n  })\n  .strict()\nconst modelMetricProvenanceSchema = z\n  .object({\n    evaluator: z.string().min(1),\n    version: z.string().min(1),\n    method: z.literal('model'),\n    model: z.string().min(1),\n    corpusHash: digestSchema,\n    runRecords: z.array(runRecordSchema).min(1),\n  })\n  .strict()\nconst improvementMetricSchema = z\n  .object({\n    score: z.number().finite().min(0).max(1),\n    passed: z.boolean(),\n    dimensions: z.record(z.string(), z.number().finite()).optional(),\n    notes: z.string().optional(),\n    provenance: z.discriminatedUnion('method', [\n      deterministicMetricProvenanceSchema,\n      measuredMetricProvenanceSchema,\n      modelMetricProvenanceSchema,\n    ]),\n  })\n  .strict()\n  .superRefine((metric, context) => {\n    if (metric.provenance.method === 'deterministic') return\n    const actualCorpusHash = contentHash(metric.provenance.runRecords)\n    if (actualCorpusHash !== metric.provenance.corpusHash) {\n      context.addIssue({\n        code: 'custom',\n        path: ['provenance', 'corpusHash'],\n        message: 'metric corpus hash must bind the complete RunRecord array',\n      })\n    }\n  })\nconst candidateRecordSchema = z\n  .object({\n    iteration: z.number().int().positive(),\n    candidateId: safePathSegmentSchema,\n    baseHash: digestSchema,\n    candidateHash: digestSchema.optional(),\n    evidenceHash: digestSchema.optional(),\n    promotionPlanHash: digestSchema.optional(),\n    status: improvementStatusSchema,\n    createdAt: z.iso.datetime(),\n    updatedAt: z.iso.datetime(),\n  })\n  .strict()\n\nexport const KnowledgeImprovementRunStateSchema = z\n  .object({\n    runId: runIdSchema,\n    root: z.string().min(1),\n    goal: z.string().min(1),\n    status: improvementStatusSchema,\n    baseHash: digestSchema,\n    createdAt: z.iso.datetime(),\n    updatedAt: z.iso.datetime(),\n    ownerId: z.string().min(1).optional(),\n    candidates: z.array(candidateRecordSchema),\n    promotedCandidateId: safePathSegmentSchema.optional(),\n    blockedReason: z.string().min(1).optional(),\n  })\n  .strict()\n  .superRefine((state, context) => {\n    const candidateIds = new Set<string>()\n    for (const [index, candidate] of state.candidates.entries()) {\n      if (candidateIds.has(candidate.candidateId)) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index, 'candidateId'],\n          message: 'candidate ids must be unique within an improvement run',\n        })\n      }\n      candidateIds.add(candidate.candidateId)\n      if (candidate.baseHash !== state.baseHash) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index, 'baseHash'],\n          message: 'candidate base hash must match its improvement run',\n        })\n      }\n      if (candidate.status === 'candidate-ready') {\n        if (!candidate.candidateHash || !candidate.evidenceHash || !candidate.promotionPlanHash) {\n          context.addIssue({\n            code: 'custom',\n            path: ['candidates', index],\n            message: 'ready candidates require content, evidence, and promotion-plan identities',\n          })\n        }\n      }\n      if (\n        candidate.status === 'promoted' &&\n        (!candidate.candidateHash || !candidate.evidenceHash || !candidate.promotionPlanHash)\n      ) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index],\n          message: 'promoted candidates require content, evidence, and promotion-plan identities',\n        })\n      }\n      if (\n        candidate.status === 'promoted' &&\n        Boolean(candidate.evidenceHash) !== Boolean(candidate.promotionPlanHash)\n      ) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index],\n          message: 'promoted candidate evidence and promotion-plan identities must appear together',\n        })\n      }\n      if (candidate.status === 'promoted' && state.status !== 'promoted') {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index, 'status'],\n          message: 'only a promoted run may contain a promoted candidate',\n        })\n      }\n    }\n    if (state.status === 'promoted') {\n      const promoted = state.candidates.filter(\n        (candidate) => candidate.candidateId === state.promotedCandidateId,\n      )\n      if (promoted.length !== 1 || promoted[0]?.status !== 'promoted') {\n        context.addIssue({\n          code: 'custom',\n          path: ['promotedCandidateId'],\n          message: 'promoted state must identify exactly one promoted candidate',\n        })\n      }\n    } else if (state.promotedCandidateId !== undefined) {\n      context.addIssue({\n        code: 'custom',\n        path: ['promotedCandidateId'],\n        message: 'only a promoted run may identify a promoted candidate',\n      })\n    }\n    if (\n      state.status === 'candidate-ready' &&\n      state.candidates.filter((candidate) => candidate.status === 'candidate-ready').length !== 1\n    ) {\n      context.addIssue({\n        code: 'custom',\n        path: ['status'],\n        message: 'candidate-ready state must contain exactly one ready candidate',\n      })\n    }\n    if (state.status === 'blocked' && state.blockedReason === undefined) {\n      context.addIssue({\n        code: 'custom',\n        path: ['blockedReason'],\n        message: 'blocked state must include a reason',\n      })\n    }\n  })\n\nexport const KnowledgeImprovementEvidenceSchema = z\n  .object({\n    kind: z.literal('knowledge-improvement-evidence'),\n    runId: runIdSchema,\n    candidateId: safePathSegmentSchema,\n    iteration: z.number().int().positive(),\n    goalHash: digestSchema,\n    baseHash: digestSchema,\n    candidateHash: digestSchema,\n    promotionPlanHash: digestSchema,\n    validation: z.unknown(),\n    readiness: z.unknown().nullable(),\n    kbQuality: z.unknown(),\n    evaluation: improvementMetricSchema,\n    lifecycle: z.unknown().nullable(),\n  })\n  .strict()\n\nexport type KnowledgeImprovementEvidence = z.infer<typeof KnowledgeImprovementEvidenceSchema>\n\n/** Portable identity of one measured candidate. Paths and mutable run state are deliberately excluded. */\nexport const KnowledgeImprovementCandidateRefSchema = z\n  .object({\n    kind: z.literal('knowledge-improvement-candidate'),\n    runId: runIdSchema,\n    candidateId: safePathSegmentSchema,\n    goalHash: digestSchema,\n    baseHash: digestSchema,\n    candidateHash: digestSchema,\n    evidenceHash: digestSchema,\n    promotionPlanHash: digestSchema,\n  })\n  .strict()\n\nexport type KnowledgeImprovementCandidateRef = z.infer<\n  typeof KnowledgeImprovementCandidateRefSchema\n>\n\nexport interface PromoteKnowledgeCandidateOptions {\n  root: string\n  candidate: KnowledgeImprovementCandidateRef\n  ownerId?: string\n  leaseTtlMs?: number\n  now?: () => Date\n  onState?: (state: KnowledgeImprovementRunState) => Promise<void> | void\n}\n\nexport type RestoreKnowledgeCandidateBaselineOptions = PromoteKnowledgeCandidateOptions\n\nexport interface UseKnowledgeImprovementCandidateOptions {\n  root: string\n  candidate: KnowledgeImprovementCandidateRef\n}\n\nexport interface ResolvedKnowledgeImprovementCandidate {\n  root: string\n  candidate: KnowledgeImprovementCandidateRef\n  evaluation: KnowledgeImprovementMetric\n}\n\nexport interface KnowledgeImprovementRetrievalOptions\n  extends Omit<RunRetrievalImprovementLoopOptions, 'index' | 'runDir'> {\n  runDir?: RunRetrievalImprovementLoopOptions['runDir']\n}\n\nexport interface KnowledgeImprovementUpdateInput extends RagKnowledgeUpdateInput {\n  runId: string\n  iteration: number\n  candidateId: string\n  root: string\n  baselineRoot: string\n  candidateRoot: string\n  baseHash: string\n}\n\nexport type KnowledgeImprovementUpdate = (\n  input: KnowledgeImprovementUpdateInput,\n) => Promise<RagKnowledgeUpdateResult> | RagKnowledgeUpdateResult\n\nexport interface KnowledgeImprovementOptions {\n  root: string\n  goal: string\n  runId?: string\n  ownerId?: string\n  leaseTtlMs?: number\n  resume?: boolean\n  maxCandidates?: number\n  candidateResearchIterations?: number\n  strict?: ValidateKnowledgeOptions['strict']\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  kbQuality?: KnowledgeBaseQualityOptions\n  step?: RunKnowledgeResearchLoopOptions['step']\n  knowledgeResearch?: Omit<RagKnowledgeResearchOptions, 'root'>\n  retrieval?: KnowledgeImprovementRetrievalOptions\n  diagnose?: NonNullable<RunRagKnowledgeImprovementLoopOptions['diagnose']>\n  acquireKnowledge?: NonNullable<RunRagKnowledgeImprovementLoopOptions['acquireKnowledge']>\n  updateKnowledge?: KnowledgeImprovementUpdate\n  evaluateAnswers?: NonNullable<RunRagKnowledgeImprovementLoopOptions['evaluateAnswers']>\n  decidePromotion?: NonNullable<RunRagKnowledgeImprovementLoopOptions['promote']>\n  enabledPhases?: readonly RagKnowledgeImprovementPhase[]\n  requiredPhases?: readonly RagKnowledgeImprovementPhase[]\n  evaluate?: KnowledgeImprovementEvaluator\n  signal?: AbortSignal\n  now?: () => Date\n  onState?: (state: KnowledgeImprovementRunState) => Promise<void> | void\n}\n\ninterface LeaseHandle {\n  ownerId: string\n  assertOwned(): void\n  release(): Promise<void>\n}\n\nconst DEFAULT_LEASE_TTL_MS = 15 * 60 * 1000\nconst UPDATE_PHASES: readonly RagKnowledgeImprovementPhase[] = [\n  'knowledge-acquisition',\n  'knowledge-update',\n]\nconst EVALUATION_PHASES: readonly RagKnowledgeImprovementPhase[] = [\n  'retrieval-tuning',\n  'gap-diagnosis',\n  'answer-quality',\n  'promotion',\n]\n\nexport function knowledgeImprovementRunId(root: string, goal: string): string {\n  return stableId('kimpr', `${root}:${goal}`)\n}\n\nexport function knowledgeImprovementRunDir(root: string, runId: string): string {\n  const parsedRunId = runIdSchema.parse(runId)\n  const safeRunId = safePathSegmentSchema.safeParse(parsedRunId)\n  const runSegment = safeRunId.success\n    ? safeRunId.data\n    : `${slugify(parsedRunId).slice(0, 72)}-${sha256(parsedRunId).slice(0, 16)}`\n  const improvementsDir = join(layoutFor(root).cacheDir, 'improvements')\n  const runDir = join(improvementsDir, runSegment)\n  const resolvedImprovementsDir = resolve(improvementsDir)\n  const resolvedRunDir = resolve(runDir)\n  if (!resolvedRunDir.startsWith(`${resolvedImprovementsDir}${sep}`)) {\n    throw new Error('knowledge improvement run directory escaped its root')\n  }\n  return runDir\n}\n\nasync function withKnowledgeImprovementRun<T>(\n  root: string,\n  runId: string,\n  create: boolean,\n  use: (runDir: string) => Promise<T> | T,\n): Promise<T> {\n  const runDir = knowledgeImprovementRunDir(root, runId)\n  const relativePath = descendantPath(root, runDir)\n  if (!relativePath) throw new Error('knowledge improvement run directory escaped its root')\n  return withSafeDirectory(root, relativePath, create, async (openedRunDir) => {\n    const result = await use(openedRunDir)\n    const openedIdentity = await stat(openedRunDir)\n    const currentIdentity = await withSafeDirectory(root, relativePath, false, (currentRunDir) =>\n      stat(currentRunDir),\n    )\n    if (openedIdentity.dev !== currentIdentity.dev || openedIdentity.ino !== currentIdentity.ino) {\n      throw new Error('knowledge improvement run directory changed during use')\n    }\n    return result\n  })\n}\n\nexport async function loadKnowledgeImprovementState(\n  root: string,\n  runId: string,\n): Promise<KnowledgeImprovementRunState | null> {\n  const expectedRunId = runIdSchema.parse(runId)\n  try {\n    return await withKnowledgeImprovementRun(root, expectedRunId, false, (runDir) =>\n      loadKnowledgeImprovementStateFromRun(root, expectedRunId, runDir),\n    )\n  } catch (error) {\n    if (isMissingFile(error)) return null\n    throw error\n  }\n}\n\nasync function loadKnowledgeImprovementStateFromRun(\n  root: string,\n  runId: string,\n  runDir: string,\n): Promise<KnowledgeImprovementRunState> {\n  const stateFile = await readRegularFileWithinRoot(runDir, 'state.json')\n  const raw = JSON.parse(stateFile.bytes.toString('utf8')) as unknown\n  const state = KnowledgeImprovementRunStateSchema.parse(raw) as KnowledgeImprovementRunState\n  if (state.runId !== runId) {\n    throw new Error('knowledge improvement state does not match the requested run')\n  }\n  if (resolve(state.root) !== resolve(root)) {\n    throw new Error('knowledge improvement state does not match the requested root')\n  }\n  for (const candidate of state.candidates) {\n    if (candidate.status === 'running') await assertCandidateWorkspace(runDir, candidate)\n  }\n  return state\n}\n\n/** Freeze the exact knowledge bytes and measured evidence a later approval may promote. */\nexport function knowledgeImprovementCandidateRef(\n  result: Pick<KnowledgeImprovementResult, 'runId' | 'state' | 'candidate'>,\n): KnowledgeImprovementCandidateRef {\n  if (!result.candidate) throw new Error('knowledge improvement result has no candidate')\n  return candidateRefFor(result.runId, result.state, result.candidate)\n}\n\n/** Use one measured snapshot while its directory identity remains open and stable. */\nexport async function withKnowledgeImprovementCandidate<T>(\n  options: UseKnowledgeImprovementCandidateOptions,\n  use: (candidate: ResolvedKnowledgeImprovementCandidate) => Promise<T> | T,\n): Promise<T> {\n  assertExactCandidatePlatform()\n  const candidateRef = KnowledgeImprovementCandidateRefSchema.parse(options.candidate)\n  return withKnowledgeImprovementRun(options.root, candidateRef.runId, false, async (runDir) => {\n    const state = await loadKnowledgeImprovementStateFromRun(\n      options.root,\n      candidateRef.runId,\n      runDir,\n    )\n    return withMeasuredCandidateSnapshot(options.root, runDir, state, candidateRef, (resolved) =>\n      withIsolatedCandidateCopy(resolved.root, candidateRef.candidateHash, (root) =>\n        use({\n          root,\n          candidate: candidateRef,\n          evaluation: resolved.evidence.evaluation,\n        }),\n      ),\n    )\n  })\n}\n\n/** Promote one previously measured candidate without rerunning research or evaluation. */\nexport async function promoteKnowledgeCandidate(\n  options: PromoteKnowledgeCandidateOptions,\n): Promise<KnowledgeImprovementResult> {\n  return transitionKnowledgeCandidate(options, 'candidate')\n}\n\n/** Restore the frozen baseline paired with one previously measured candidate. */\nexport async function restoreKnowledgeCandidateBaseline(\n  options: RestoreKnowledgeCandidateBaselineOptions,\n): Promise<KnowledgeImprovementResult> {\n  return transitionKnowledgeCandidate(options, 'baseline')\n}\n\ntype KnowledgeCandidateTarget = 'candidate' | 'baseline'\n\nasync function transitionKnowledgeCandidate(\n  options: PromoteKnowledgeCandidateOptions,\n  target: KnowledgeCandidateTarget,\n): Promise<KnowledgeImprovementResult> {\n  assertExactCandidatePlatform()\n  const candidateRef = Object.freeze(\n    KnowledgeImprovementCandidateRefSchema.parse(options.candidate),\n  )\n  const now = options.now ?? (() => new Date())\n  return withKnowledgeImprovementRun(options.root, candidateRef.runId, false, async (runDir) => {\n    const lease = await acquireRunLease(runDir, {\n      ownerId: options.ownerId ?? `pid-${process.pid}`,\n      ttlMs: options.leaseTtlMs ?? DEFAULT_LEASE_TTL_MS,\n    })\n    try {\n      lease.assertOwned()\n      const state = await loadKnowledgeImprovementStateFromRun(\n        options.root,\n        candidateRef.runId,\n        runDir,\n      )\n      return await applyKnowledgeCandidateTarget(\n        {\n          root: options.root,\n          runDir,\n          state,\n          candidateRef,\n          leaseTtlMs: options.leaseTtlMs ?? DEFAULT_LEASE_TTL_MS,\n          assertRunOwned: lease.assertOwned,\n          now,\n          onState: options.onState,\n        },\n        target,\n      )\n    } finally {\n      await lease.release()\n    }\n  })\n}\n\nexport async function improveKnowledgeBase(\n  options: KnowledgeImprovementOptions,\n): Promise<KnowledgeImprovementResult> {\n  assertExactCandidatePlatform()\n  assertKnowledgeImprovementOptions(options)\n  const now = options.now ?? (() => new Date())\n  const runId = runIdSchema.parse(\n    options.runId ?? knowledgeImprovementRunId(options.root, options.goal),\n  )\n  return withKnowledgeImprovementRun(options.root, runId, true, (runDir) =>\n    improveKnowledgeBaseInRun(options, runId, runDir, now),\n  )\n}\n\nasync function improveKnowledgeBaseInRun(\n  options: KnowledgeImprovementOptions,\n  runId: string,\n  runDir: string,\n  now: () => Date,\n): Promise<KnowledgeImprovementResult> {\n  const lease = await acquireRunLease(runDir, {\n    ownerId: options.ownerId ?? `pid-${process.pid}`,\n    ttlMs: options.leaseTtlMs ?? DEFAULT_LEASE_TTL_MS,\n  })\n\n  try {\n    lease.assertOwned()\n    let state =\n      options.resume === false\n        ? null\n        : await loadKnowledgeImprovementStateFromRun(options.root, runId, runDir).catch((error) => {\n            if (isMissingFile(error)) return null\n            throw error\n          })\n    if (!state) {\n      const baseHash = await hashKnowledgeBase(options.root)\n      await createBaselineSnapshot(runDir, options.root, baseHash)\n      state = {\n        runId,\n        root: options.root,\n        goal: options.goal,\n        status: 'running',\n        baseHash,\n        createdAt: now().toISOString(),\n        updatedAt: now().toISOString(),\n        ownerId: lease.ownerId,\n        candidates: [],\n      }\n      await saveState(runDir, state, options.onState)\n      await appendLedger(runDir, { type: 'run.created', runId, baseHash })\n    }\n    if (state.goal !== options.goal) {\n      throw new Error('knowledge improvement state does not match the requested goal')\n    }\n    const promotedCandidateId = state.promotedCandidateId\n    const promotedCandidate =\n      state.status === 'promoted'\n        ? state.candidates.find((candidate) => candidate.candidateId === promotedCandidateId)\n        : undefined\n    if (state.status === 'promoted' && !promotedCandidate) {\n      throw new Error('promoted knowledge state has no promoted candidate')\n    }\n    const resumablePromotion = state.candidates.find(\n      (candidate) =>\n        (candidate.status === 'candidate-ready' || candidate.status === 'promoted') &&\n        candidate.evidenceHash !== undefined &&\n        candidate.promotionPlanHash !== undefined,\n    )\n    const resumableCandidateRef = resumablePromotion\n      ? candidateRefFor(runId, state, resumablePromotion)\n      : undefined\n    await withKnowledgeMutation(options.root, () => undefined, {\n      resumeTransaction: resumableCandidateRef\n        ? {\n            purpose: knowledgeCandidateTransitionPurpose(resumableCandidateRef, 'candidate'),\n            validate: (transaction) =>\n              assertCandidateTransitionTransaction(transaction, resumableCandidateRef, 'candidate'),\n          }\n        : undefined,\n    })\n    await ensureBaselineSnapshot(runDir, options.root, state.baseHash)\n\n    if (state.status === 'promoted') {\n      const promoted = promotedCandidate!\n      return await applyKnowledgeCandidateTarget(\n        {\n          root: options.root,\n          runDir,\n          state,\n          candidateRef: candidateRefFor(runId, state, promoted),\n          leaseTtlMs: options.leaseTtlMs ?? DEFAULT_LEASE_TTL_MS,\n          assertRunOwned: lease.assertOwned,\n          now,\n          onState: options.onState,\n        },\n        'candidate',\n      )\n    }\n    if (state.status === 'blocked') {\n      return { runId, state, promoted: false, blocked: true }\n    }\n\n    const maxCandidates = Math.max(1, options.maxCandidates ?? 1)\n    let candidate = findActiveCandidate(state)\n    let lastRejectedCandidate: KnowledgeImprovementCandidateRecord | undefined\n    let lastRejectedEvaluation: KnowledgeImprovementMetric | undefined\n    let lifecycle: RunRagKnowledgeImprovementLoopResult | undefined\n\n    while (candidate || state.candidates.length < maxCandidates) {\n      if (!candidate) {\n        const currentHash = await hashKnowledgeBase(options.root)\n        if (currentHash !== state.baseHash) {\n          state = await blockRun(\n            runDir,\n            state,\n            `base changed before candidate creation: expected ${state.baseHash}, got ${currentHash}`,\n            options.onState,\n            now,\n          )\n          return { runId, state, promoted: false, blocked: true }\n        }\n        const activeState = state\n        candidate = await withBaselineSnapshot(runDir, activeState.baseHash, (baselineRoot) =>\n          createCandidateWorkspace(runDir, activeState, baselineRoot, now),\n        )\n        state.candidates.push(candidate)\n        state.status = 'running'\n        state.updatedAt = now().toISOString()\n        await saveState(runDir, state, options.onState)\n        await appendLedger(runDir, {\n          type: 'candidate.created',\n          runId,\n          candidateId: candidate.candidateId,\n          iteration: candidate.iteration,\n        })\n      }\n\n      const measured = await measureCandidate(runId, runDir, state, candidate, options, now)\n      candidate = measured.candidate\n      const evaluation = measured.evaluation\n      lifecycle = measured.lifecycle\n\n      if (evaluation.passed) {\n        candidate.status = 'candidate-ready'\n        candidate.updatedAt = now().toISOString()\n        state.status = 'candidate-ready'\n        state.updatedAt = now().toISOString()\n        await saveState(runDir, state, options.onState)\n        await appendLedger(runDir, {\n          type: 'candidate.ready',\n          runId,\n          candidateId: candidate.candidateId,\n        })\n        break\n      }\n\n      candidate.status = 'rejected'\n      state.status = 'running'\n      state.updatedAt = now().toISOString()\n      await saveState(runDir, state, options.onState)\n      await appendLedger(runDir, {\n        type: 'candidate.rejected',\n        runId,\n        candidateId: candidate.candidateId,\n      })\n      lastRejectedCandidate = candidate\n      lastRejectedEvaluation = evaluation\n      candidate = undefined\n    }\n\n    if (!candidate) {\n      state.status = 'rejected'\n      state.updatedAt = now().toISOString()\n      await saveState(runDir, state, options.onState)\n      return {\n        runId,\n        state,\n        candidate: lastRejectedCandidate,\n        ...(lastRejectedEvaluation ? { evaluation: lastRejectedEvaluation } : {}),\n        lifecycle,\n        promoted: false,\n        blocked: false,\n      }\n    }\n\n    const evidence = await assertCandidateEvidence(runDir, candidateRefFor(runId, state, candidate))\n    return {\n      runId,\n      state,\n      candidate,\n      evaluation: evidence.evaluation,\n      lifecycle,\n      promoted: false,\n      blocked: false,\n    }\n  } finally {\n    await lease.release()\n  }\n}\n\ninterface KnowledgeCandidateTransitionInput {\n  root: string\n  runDir: string\n  state: KnowledgeImprovementRunState\n  candidateRef: KnowledgeImprovementCandidateRef\n  leaseTtlMs: number\n  assertRunOwned(): void\n  now: () => Date\n  onState?: KnowledgeImprovementOptions['onState']\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n}\n\nasync function applyKnowledgeCandidateTarget(\n  input: KnowledgeCandidateTransitionInput,\n  target: KnowledgeCandidateTarget,\n): Promise<KnowledgeImprovementResult> {\n  const { candidateRef, runDir, state } = input\n  assertStateIdentity(input.root, candidateRef, state)\n  const candidate = state.candidates.find((entry) => entry.candidateId === candidateRef.candidateId)\n  if (\n    !candidate ||\n    canonicalJson(candidateRefFor(candidateRef.runId, state, candidate)) !==\n      canonicalJson(candidateRef)\n  ) {\n    throw new Error('knowledge candidate approval does not match the measured candidate')\n  }\n\n  const action = target === 'candidate' ? 'promotion' : 'restore'\n  const desiredHash = target === 'candidate' ? candidateRef.candidateHash : candidateRef.baseHash\n  const purpose = knowledgeCandidateTransitionPurpose(candidateRef, target)\n  return withKnowledgeMutation(\n    input.root,\n    async (mutationLock) => {\n      input.assertRunOwned()\n      const transactionRoot = mutationLock.transactionRoot\n      let pending: KnowledgeFileTransaction | null = null\n      const currentHash = await hashKnowledgeBase(input.root)\n      if (state.status === 'promoted' && state.promotedCandidateId !== candidate.candidateId) {\n        throw new Error(\n          `knowledge run already promoted '${state.promotedCandidateId ?? 'unknown'}'`,\n        )\n      }\n      if (\n        target === 'candidate' &&\n        state.status === 'promoted' &&\n        currentHash !== candidateRef.candidateHash\n      ) {\n        throw new Error(\n          `promoted knowledge base changed: expected ${candidateRef.candidateHash}, got ${currentHash}`,\n        )\n      }\n      if (state.status !== 'promoted' && state.status !== 'candidate-ready') {\n        throw new Error(\n          `knowledge candidate is not ready for ${action}: run=${state.status}, candidate=${candidate.status}`,\n        )\n      }\n      if (currentHash !== state.baseHash && currentHash !== candidateRef.candidateHash) {\n        const reason =\n          target === 'candidate'\n            ? `base changed before promotion: expected ${state.baseHash}, got ${currentHash}`\n            : `knowledge changed before restore: expected ${candidateRef.candidateHash}, got ${currentHash}`\n        return await blockCandidateTransition(input, candidate, target, reason)\n      }\n\n      if (currentHash !== desiredHash) {\n        pending = await withMeasuredCandidateSnapshot(\n          input.root,\n          runDir,\n          state,\n          candidateRef,\n          (resolved) =>\n            withBaselineSnapshot(runDir, state.baseHash, async (baselineRoot) => {\n              const sourceRoot = target === 'candidate' ? baselineRoot : resolved.root\n              const targetRoot = target === 'candidate' ? resolved.root : baselineRoot\n              const plan = await knowledgeFilePlanEntries(sourceRoot, targetRoot)\n              assertCandidateTransitionPlan(plan, candidateRef, target)\n              return prepareKnowledgeFileTransaction({\n                root: input.root,\n                transactionRoot,\n                purpose,\n                mutations: await knowledgePlanMutations(targetRoot, plan),\n                includeUnchanged: true,\n                now: input.now,\n              })\n            }),\n        )\n        if (!pending) {\n          throw new Error(`knowledge ${action} plan unexpectedly contained no file changes`)\n        }\n        try {\n          assertCandidateTransitionTransaction(pending, candidateRef, target)\n        } catch (error) {\n          try {\n            await rollbackKnowledgeFileTransaction({\n              root: input.root,\n              transactionRoot,\n              transaction: pending,\n              beforeCommit() {\n                mutationLock.assertOwned()\n                input.assertRunOwned()\n              },\n            })\n            await finishKnowledgeFileTransaction({\n              root: input.root,\n              transactionRoot,\n              transaction: pending,\n              assertOwned() {\n                mutationLock.assertOwned()\n                input.assertRunOwned()\n              },\n            })\n          } catch (cleanupError) {\n            throw new AggregateError(\n              [error, cleanupError],\n              `invalid knowledge ${action} transaction could not be removed`,\n            )\n          }\n          throw error\n        }\n      }\n      try {\n        if (pending) {\n          await applyKnowledgeFileTransaction({\n            root: input.root,\n            transactionRoot,\n            transaction: pending,\n            beforeCommit() {\n              mutationLock.assertOwned()\n              input.assertRunOwned()\n            },\n          })\n        }\n        mutationLock.assertOwned()\n        input.assertRunOwned()\n        if ((await hashKnowledgeBase(input.root)) !== desiredHash) {\n          throw new Error(`knowledge ${action} content does not match the approved target`)\n        }\n        await writeKnowledgeIndex(input.root)\n      } catch (error) {\n        if (!pending) throw error\n        try {\n          mutationLock.assertOwned()\n          input.assertRunOwned()\n        } catch (ownershipError) {\n          throw new AggregateError(\n            [error, ownershipError],\n            `knowledge ${action} lost its lock and left the transaction pending`,\n          )\n        }\n        try {\n          await rollbackKnowledgeFileTransaction({\n            root: input.root,\n            transactionRoot,\n            transaction: pending,\n            beforeCommit() {\n              mutationLock.assertOwned()\n              input.assertRunOwned()\n            },\n          })\n          await finishKnowledgeFileTransaction({\n            root: input.root,\n            transactionRoot,\n            transaction: pending,\n            assertOwned() {\n              mutationLock.assertOwned()\n              input.assertRunOwned()\n            },\n          })\n          await writeKnowledgeIndex(input.root)\n        } catch (rollbackError) {\n          throw new AggregateError(\n            [error, rollbackError],\n            `knowledge ${action} failed and could not restore the previous files`,\n          )\n        }\n        throw error\n      }\n      candidate.status = target === 'candidate' ? 'promoted' : 'candidate-ready'\n      candidate.updatedAt = input.now().toISOString()\n      state.status = candidate.status\n      if (target === 'candidate') state.promotedCandidateId = candidate.candidateId\n      else delete state.promotedCandidateId\n      delete state.blockedReason\n      state.updatedAt = input.now().toISOString()\n      await saveState(runDir, state, input.onState)\n      await ensureCandidateTransitionEvent(runDir, candidateRef, target)\n      if (pending) {\n        await finishKnowledgeFileTransaction({\n          root: input.root,\n          transactionRoot,\n          transaction: pending,\n          assertOwned() {\n            mutationLock.assertOwned()\n            input.assertRunOwned()\n          },\n        })\n      }\n      return candidateTransitionResult(input, candidate, target === 'candidate', false)\n    },\n    {\n      staleMs: input.leaseTtlMs,\n      resumeTransaction: {\n        purpose,\n        validate: (transaction) =>\n          assertCandidateTransitionTransaction(transaction, candidateRef, target),\n      },\n    },\n  )\n}\n\nasync function blockCandidateTransition(\n  input: KnowledgeCandidateTransitionInput,\n  candidate: KnowledgeImprovementCandidateRecord,\n  target: KnowledgeCandidateTarget,\n  reason: string,\n): Promise<KnowledgeImprovementResult> {\n  if (input.state.status === 'promoted') {\n    candidate.status = 'blocked'\n    candidate.updatedAt = input.now().toISOString()\n    delete input.state.promotedCandidateId\n  }\n  await blockRun(input.runDir, input.state, reason, input.onState, input.now)\n  await appendLedger(input.runDir, {\n    type: target === 'candidate' ? 'promotion.blocked' : 'restore.blocked',\n    runId: input.candidateRef.runId,\n    candidateId: candidate.candidateId,\n    reason,\n  })\n  return candidateTransitionResult(input, candidate, false, true)\n}\n\nfunction candidateTransitionResult(\n  input: KnowledgeCandidateTransitionInput,\n  candidate: KnowledgeImprovementCandidateRecord,\n  promoted: boolean,\n  blocked: boolean,\n): KnowledgeImprovementResult {\n  return {\n    runId: input.candidateRef.runId,\n    state: input.state,\n    candidate,\n    ...(input.lifecycle ? { lifecycle: input.lifecycle } : {}),\n    promoted,\n    blocked,\n  }\n}\n\nfunction candidateRefFor(\n  runId: string,\n  state: KnowledgeImprovementRunState,\n  candidate: KnowledgeImprovementCandidateRecord,\n): KnowledgeImprovementCandidateRef {\n  if (!candidate.candidateHash) {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' has no content hash`)\n  }\n  if (!candidate.evidenceHash) {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' has no evidence hash`)\n  }\n  if (!candidate.promotionPlanHash) {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' has no promotion plan hash`)\n  }\n  if (candidate.status !== 'candidate-ready' && candidate.status !== 'promoted') {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' is not ready`)\n  }\n  return Object.freeze({\n    kind: 'knowledge-improvement-candidate',\n    runId,\n    candidateId: candidate.candidateId,\n    goalHash: sha256(state.goal),\n    baseHash: candidate.baseHash,\n    candidateHash: candidate.candidateHash,\n    evidenceHash: candidate.evidenceHash,\n    promotionPlanHash: candidate.promotionPlanHash,\n  })\n}\n\nasync function withMeasuredCandidateSnapshot<T>(\n  liveRoot: string,\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  use: (snapshot: {\n    root: string\n    candidate: KnowledgeImprovementCandidateRecord\n    evidence: KnowledgeImprovementEvidence\n  }) => Promise<T> | T,\n): Promise<T> {\n  assertStateIdentity(liveRoot, candidateRef, state)\n  const candidate = state.candidates.find((entry) => entry.candidateId === candidateRef.candidateId)\n  if (!candidate) {\n    throw new Error(`knowledge candidate '${candidateRef.candidateId}' does not exist`)\n  }\n  const expectedRef = candidateRefFor(candidateRef.runId, state, candidate)\n  if (canonicalJson(expectedRef) !== canonicalJson(candidateRef)) {\n    throw new Error('knowledge candidate approval does not match the measured candidate')\n  }\n  const evidence = await assertCandidateEvidence(runDir, candidateRef)\n  const relativePath = join(\n    'candidates',\n    candidate.candidateId,\n    'snapshots',\n    candidateRef.candidateHash,\n  )\n  return withSafeDirectory(runDir, relativePath, false, async (root) => {\n    if ((await hashKnowledgeBase(root)) !== candidateRef.candidateHash) {\n      throw new Error('knowledge candidate snapshot changed after approval')\n    }\n    const result = await use({ root, candidate, evidence })\n    if ((await hashKnowledgeBase(root)) !== candidateRef.candidateHash) {\n      throw new Error('knowledge candidate snapshot changed during use')\n    }\n    return result\n  })\n}\n\nasync function withIsolatedCandidateCopy<T>(\n  sourceRoot: string,\n  expectedHash: string,\n  use: (root: string) => Promise<T> | T,\n): Promise<T> {\n  const isolationRoot = await mkdtemp(join(tmpdir(), 'agent-knowledge-candidate-'))\n  const candidateRoot = join(isolationRoot, 'candidate')\n  try {\n    await copyKnowledgeWorkspace(sourceRoot, candidateRoot)\n    if ((await hashKnowledgeBase(candidateRoot)) !== expectedHash) {\n      throw new Error('isolated knowledge candidate does not match its approved content')\n    }\n    const result = await use(candidateRoot)\n    if ((await hashKnowledgeBase(candidateRoot)) !== expectedHash) {\n      throw new Error('knowledge candidate snapshot changed during use')\n    }\n    return result\n  } finally {\n    await rm(isolationRoot, { recursive: true, force: true })\n  }\n}\n\nasync function assertCandidateEvidence(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRef,\n): Promise<KnowledgeImprovementEvidence> {\n  const evidence = KnowledgeImprovementEvidenceSchema.parse(\n    JSON.parse(\n      (\n        await readRegularFileWithinRoot(\n          runDir,\n          candidateEvidenceRelativePath(candidate.candidateId),\n        )\n      ).bytes.toString('utf8'),\n    ),\n  )\n  const actualHash = contentHash(evidence)\n  if (actualHash !== candidate.evidenceHash) {\n    throw new Error(\n      `knowledge candidate evidence changed after approval: expected ${candidate.evidenceHash}, got ${actualHash}`,\n    )\n  }\n  if (\n    evidence.runId !== candidate.runId ||\n    evidence.candidateId !== candidate.candidateId ||\n    evidence.goalHash !== candidate.goalHash ||\n    evidence.baseHash !== candidate.baseHash ||\n    evidence.candidateHash !== candidate.candidateHash ||\n    evidence.promotionPlanHash !== candidate.promotionPlanHash ||\n    evidence.evaluation.passed !== true\n  ) {\n    throw new Error('knowledge candidate evidence does not match the approved candidate')\n  }\n  return evidence\n}\n\nfunction assertStateIdentity(\n  root: string,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  state: KnowledgeImprovementRunState,\n): void {\n  if (state.runId !== candidateRef.runId) {\n    throw new Error('knowledge candidate run identity does not match persisted state')\n  }\n  if (resolve(state.root) !== resolve(root)) {\n    throw new Error('knowledge candidate root does not match persisted state')\n  }\n  if (sha256(state.goal) !== candidateRef.goalHash) {\n    throw new Error('knowledge candidate goal does not match persisted state')\n  }\n  if (state.baseHash !== candidateRef.baseHash) {\n    throw new Error('knowledge candidate base does not match persisted state')\n  }\n}\n\nasync function assertCandidateWorkspace(\n  runDir: string,\n  candidate: Pick<KnowledgeImprovementCandidateRecord, 'candidateId'>,\n): Promise<void> {\n  await withCandidateWorkspace(runDir, candidate, () => undefined)\n}\n\nasync function withCandidateWorkspace<T>(\n  runDir: string,\n  candidate: Pick<KnowledgeImprovementCandidateRecord, 'candidateId'>,\n  use: (candidateRoot: string) => Promise<T> | T,\n): Promise<T> {\n  return withSafeDirectory(\n    runDir,\n    join('candidates', safePathSegmentSchema.parse(candidate.candidateId), 'workspace'),\n    false,\n    use,\n  )\n}\n\nfunction assertKnowledgeImprovementOptions(options: KnowledgeImprovementOptions): void {\n  if (options.step && options.knowledgeResearch?.step) {\n    throw new Error('improveKnowledgeBase accepts either step or knowledgeResearch.step, not both')\n  }\n  const updateDrivers = [\n    Boolean(options.step ?? options.knowledgeResearch),\n    Boolean(options.updateKnowledge),\n  ].filter(Boolean).length\n  if (updateDrivers > 1) {\n    throw new Error(\n      'improveKnowledgeBase accepts only one knowledge-update driver: knowledgeResearch or updateKnowledge',\n    )\n  }\n}\n\nasync function measureCandidate(\n  runId: string,\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  candidate: KnowledgeImprovementCandidateRecord,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<{\n  candidate: KnowledgeImprovementCandidateRecord\n  evaluation: KnowledgeImprovementMetric\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n}> {\n  return withCandidateWorkspace(runDir, candidate, async (candidateRoot) => {\n    const currentCandidateHash = await hashKnowledgeBase(candidateRoot)\n    if (\n      candidate.status === 'candidate-ready' &&\n      candidate.candidateHash === currentCandidateHash &&\n      candidate.evidenceHash !== undefined &&\n      candidate.promotionPlanHash !== undefined\n    ) {\n      const evidence = await assertCandidateEvidence(\n        runDir,\n        candidateRefFor(runId, state, candidate),\n      )\n      return { candidate, evaluation: evidence.evaluation }\n    }\n\n    clearCandidateMeasurement(candidate)\n    const lifecycles: RunRagKnowledgeImprovementLoopResult[] = []\n    if (candidate.status === 'running') {\n      const updateLifecycle = await runCandidateUpdateLifecycle(\n        runId,\n        candidate,\n        candidateRoot,\n        options,\n        now,\n      )\n      if (updateLifecycle) lifecycles.push(updateLifecycle)\n    }\n    return withFrozenCandidateWorkspace(runDir, candidate, candidateRoot, async (snapshot) => {\n      const evaluationLifecycle = await runCandidateEvaluationLifecycle(\n        runDir,\n        candidate,\n        snapshot.root,\n        options,\n        now,\n      )\n      if (evaluationLifecycle) lifecycles.push(evaluationLifecycle)\n      const lifecycle = mergeLifecycleResults(options.goal, lifecycles)\n      const measured = await evaluateCandidate(\n        runDir,\n        state,\n        candidate,\n        snapshot,\n        lifecycle,\n        options,\n        now,\n      )\n      return { ...measured, ...(lifecycle ? { lifecycle } : {}) }\n    })\n  })\n}\n\nasync function runCandidateUpdateLifecycle(\n  runId: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<RunRagKnowledgeImprovementLoopResult | undefined> {\n  if (!shouldRunUpdateStage(options)) return undefined\n  const lifecycle = await runRagKnowledgeImprovementLoop({\n    goal: options.goal,\n    acquireKnowledge: options.acquireKnowledge,\n    knowledgeResearch: candidateKnowledgeResearchOptions(candidateRoot, options),\n    updateKnowledge: candidateUpdateHook(runId, candidate, candidateRoot, options),\n    enabledPhases: selectedStagePhases(options, UPDATE_PHASES),\n    requiredPhases: selectedStageRequiredPhases(options, UPDATE_PHASES),\n    signal: options.signal,\n    now,\n  })\n  return lifecycle\n}\n\nasync function runCandidateEvaluationLifecycle(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<RunRagKnowledgeImprovementLoopResult | undefined> {\n  if (!shouldRunEvaluationStage(options)) return undefined\n  const candidateIndex = await buildKnowledgeIndex(candidateRoot)\n  const lifecycle = await runRagKnowledgeImprovementLoop({\n    goal: options.goal,\n    retrieval: options.retrieval\n      ? {\n          ...options.retrieval,\n          index: candidateIndex,\n          runDir: options.retrieval.runDir ?? join(runDir, 'retrieval', candidate.candidateId),\n        }\n      : undefined,\n    diagnose: options.diagnose,\n    evaluateAnswers: options.evaluateAnswers,\n    promote: options.decidePromotion,\n    enabledPhases: selectedStagePhases(options, EVALUATION_PHASES),\n    requiredPhases: selectedStageRequiredPhases(options, EVALUATION_PHASES),\n    signal: options.signal,\n    now,\n  })\n  return lifecycle\n}\n\nfunction candidateKnowledgeResearchOptions(\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n): RagKnowledgeResearchOptions | undefined {\n  if (!options.step && !options.knowledgeResearch) return undefined\n  const { step: researchStep, ...rest } = options.knowledgeResearch ?? {}\n  const step = options.step ?? researchStep\n  return {\n    ...rest,\n    root: candidateRoot,\n    step,\n    maxIterations:\n      rest.maxIterations ?? (step ? (options.candidateResearchIterations ?? 3) : undefined),\n    strict: rest.strict ?? options.strict,\n    readinessSpecs: rest.readinessSpecs ?? options.readinessSpecs,\n    readinessTaskId: rest.readinessTaskId ?? options.readinessTaskId,\n    readiness: rest.readiness ?? options.readiness,\n  }\n}\n\nfunction candidateUpdateHook(\n  runId: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n): RunRagKnowledgeImprovementLoopOptions['updateKnowledge'] {\n  if (!options.updateKnowledge) return undefined\n  return (input) =>\n    options.updateKnowledge!({\n      ...input,\n      runId,\n      iteration: candidate.iteration,\n      candidateId: candidate.candidateId,\n      root: candidateRoot,\n      baselineRoot: options.root,\n      candidateRoot,\n      baseHash: candidate.baseHash,\n    })\n}\n\nfunction shouldRunUpdateStage(options: KnowledgeImprovementOptions): boolean {\n  const phases = selectedStagePhases(options, UPDATE_PHASES)\n  if (phases.length === 0) return false\n  return Boolean(\n    options.acquireKnowledge ||\n      options.step ||\n      options.knowledgeResearch ||\n      options.updateKnowledge ||\n      selectedStageRequiredPhases(options, UPDATE_PHASES).length > 0,\n  )\n}\n\nfunction shouldRunEvaluationStage(options: KnowledgeImprovementOptions): boolean {\n  const phases = selectedStagePhases(options, EVALUATION_PHASES)\n  if (phases.length === 0) return false\n  return Boolean(\n    options.retrieval ||\n      options.diagnose ||\n      options.evaluateAnswers ||\n      options.decidePromotion ||\n      selectedStageRequiredPhases(options, EVALUATION_PHASES).length > 0,\n  )\n}\n\nfunction selectedStagePhases(\n  options: Pick<KnowledgeImprovementOptions, 'enabledPhases'>,\n  stagePhases: readonly RagKnowledgeImprovementPhase[],\n): RagKnowledgeImprovementPhase[] {\n  const requested = options.enabledPhases ?? stagePhases\n  return requested.filter((phase) => stagePhases.includes(phase))\n}\n\nfunction selectedStageRequiredPhases(\n  options: Pick<KnowledgeImprovementOptions, 'requiredPhases'>,\n  stagePhases: readonly RagKnowledgeImprovementPhase[],\n): RagKnowledgeImprovementPhase[] {\n  return (options.requiredPhases ?? []).filter((phase) => stagePhases.includes(phase))\n}\n\nfunction mergeLifecycleResults(\n  goal: string,\n  lifecycles: readonly RunRagKnowledgeImprovementLoopResult[],\n): RunRagKnowledgeImprovementLoopResult | undefined {\n  if (lifecycles.length === 0) return undefined\n  return {\n    goal,\n    phases: lifecycles.flatMap((lifecycle) => lifecycle.phases),\n    retrieval: lastDefined(lifecycles.map((lifecycle) => lifecycle.retrieval)),\n    findings: lifecycles.flatMap((lifecycle) => lifecycle.findings),\n    acquisition: lastDefined(lifecycles.map((lifecycle) => lifecycle.acquisition)),\n    knowledgeUpdate: lastDefined(lifecycles.map((lifecycle) => lifecycle.knowledgeUpdate)),\n    answerQuality: lastDefined(lifecycles.map((lifecycle) => lifecycle.answerQuality)),\n    promotion: lastDefined(lifecycles.map((lifecycle) => lifecycle.promotion)),\n  }\n}\n\nfunction lastDefined<T>(values: readonly (T | undefined)[]): T | undefined {\n  for (let index = values.length - 1; index >= 0; index -= 1) {\n    if (values[index] !== undefined) return values[index]\n  }\n  return undefined\n}\n\nasync function evaluateCandidate(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  candidate: KnowledgeImprovementCandidateRecord,\n  snapshot: { root: string; hash: string },\n  lifecycle: RunRagKnowledgeImprovementLoopResult | undefined,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<{\n  candidate: KnowledgeImprovementCandidateRecord\n  evaluation: KnowledgeImprovementMetric\n}> {\n  return withBaselineSnapshot(runDir, state.baseHash, async (baselineRoot) => {\n    const [baselineIndex, candidateIndex] = await Promise.all([\n      buildKnowledgeIndex(baselineRoot),\n      buildKnowledgeIndex(snapshot.root),\n    ])\n    const validation = validateKnowledgeIndex(candidateIndex, { strict: options.strict })\n    const readiness = readinessFor(options, candidateIndex)\n    const kbQuality = scoreKnowledgeBaseIndex(candidateIndex, {\n      strict: options.strict,\n      ...options.kbQuality,\n    })\n    const candidateHash = snapshot.hash\n    const metric =\n      options.evaluate?.({\n        runId: state.runId,\n        iteration: candidate.iteration,\n        root: options.root,\n        baselineRoot,\n        candidateRoot: snapshot.root,\n        baselineIndex,\n        candidateIndex,\n        baseHash: state.baseHash,\n        candidateHash,\n        validation,\n        readiness,\n        kbQuality,\n        lifecycle,\n        signal: options.signal,\n      }) ??\n      defaultKnowledgeImprovementMetric(\n        validation,\n        readiness,\n        options.readinessSpecs,\n        kbQuality,\n        lifecycle,\n      )\n    const evaluation = applyLifecycleFailures(normalizeMetric(await metric), lifecycle)\n    const measuredHash = await hashKnowledgeBase(snapshot.root)\n    if (measuredHash !== candidateHash) {\n      throw new Error(\n        `knowledge candidate changed during evaluation: expected ${candidateHash}, got ${measuredHash}`,\n      )\n    }\n    candidate.candidateHash = candidateHash\n    candidate.promotionPlanHash = knowledgeFileTransactionPlanHash(\n      await knowledgeFilePlanEntries(baselineRoot, snapshot.root),\n    )\n    const evidence = KnowledgeImprovementEvidenceSchema.parse(\n      JSON.parse(\n        JSON.stringify({\n          kind: 'knowledge-improvement-evidence',\n          runId: state.runId,\n          candidateId: candidate.candidateId,\n          iteration: candidate.iteration,\n          goalHash: sha256(state.goal),\n          baseHash: candidate.baseHash,\n          candidateHash,\n          promotionPlanHash: candidate.promotionPlanHash,\n          validation,\n          readiness: readiness ?? null,\n          kbQuality,\n          evaluation,\n          lifecycle: lifecycle ?? null,\n        }),\n      ),\n    )\n    candidate.evidenceHash = contentHash(evidence)\n    candidate.updatedAt = now().toISOString()\n    await writeJsonDurableWithinRoot(\n      runDir,\n      candidateEvidenceRelativePath(candidate.candidateId),\n      evidence,\n    )\n    await appendLedger(runDir, {\n      type: 'candidate.evaluated',\n      runId: state.runId,\n      candidateId: candidate.candidateId,\n      score: evaluation.score,\n      passed: evaluation.passed,\n    })\n    return { candidate, evaluation }\n  })\n}\n\nfunction defaultKnowledgeImprovementMetric(\n  validation: ValidateKnowledgeResult,\n  readiness: EvalKnowledgeBundleBuildResult | undefined,\n  readinessSpecs: readonly KnowledgeReadinessSpec[] | undefined,\n  kbQuality: KnowledgeBaseQualityReport,\n  lifecycle: RunRagKnowledgeImprovementLoopResult | undefined,\n): KnowledgeImprovementMetric {\n  const blockingMissing = readiness?.report.blockingMissingRequirements.length ?? 0\n  const blockingTotal = readinessSpecs?.filter((spec) => spec.importance === 'blocking').length ?? 0\n  const blockingReadiness =\n    blockingTotal === 0 ? 1 : Math.max(0, blockingTotal - blockingMissing) / blockingTotal\n  const answerQuality = lifecycle?.answerQuality\n    ? average(Object.values(lifecycle.answerQuality.metrics).filter(Number.isFinite))\n    : 1\n  const promotionDecision = lifecycle?.promotion ? (lifecycle.promotion.promoted ? 1 : 0) : 1\n  const dimensions = {\n    validation: validation.ok ? 1 : 0,\n    kb_quality: kbQuality.ok ? 1 : 0,\n    blocking_readiness: blockingReadiness,\n    answer_quality: answerQuality,\n    promotion_decision: promotionDecision,\n  }\n  const failedReasons = [\n    validation.ok ? undefined : 'candidate validation failed',\n    kbQuality.ok ? undefined : 'candidate KB quality check failed',\n    blockingMissing === 0\n      ? undefined\n      : `${blockingMissing}/${blockingTotal} blocking knowledge requirements still missing`,\n  ].filter((reason): reason is string => Boolean(reason))\n  return {\n    score: average(Object.values(dimensions)),\n    passed: failedReasons.length === 0,\n    dimensions,\n    notes:\n      failedReasons.length === 0 ? 'candidate passed configured checks' : failedReasons.join('; '),\n    provenance: {\n      evaluator: '@tangle-network/agent-knowledge/default-knowledge-improvement-metric',\n      version: '1',\n      method: 'deterministic',\n    },\n  }\n}\n\nfunction applyLifecycleFailures(\n  metric: KnowledgeImprovementMetric,\n  lifecycle: RunRagKnowledgeImprovementLoopResult | undefined,\n): KnowledgeImprovementMetric {\n  const reasons = [\n    metric.notes,\n    lifecycle?.answerQuality && !lifecycle.answerQuality.passed\n      ? 'answer quality failed'\n      : undefined,\n    lifecycle?.promotion && !lifecycle.promotion.promoted\n      ? `promotion decision held: ${lifecycle.promotion.reason}`\n      : undefined,\n  ].filter((reason): reason is string => Boolean(reason))\n  const forcedFailure =\n    Boolean(lifecycle?.answerQuality && !lifecycle.answerQuality.passed) ||\n    Boolean(lifecycle?.promotion && !lifecycle.promotion.promoted)\n  return {\n    ...metric,\n    passed: metric.passed && !forcedFailure,\n    notes: reasons.length > 0 ? reasons.join('; ') : metric.notes,\n  }\n}\n\nfunction normalizeMetric(metric: KnowledgeImprovementMetric): KnowledgeImprovementMetric {\n  return improvementMetricSchema.parse(metric)\n}\n\nasync function createCandidateWorkspace(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  root: string,\n  now: () => Date,\n): Promise<KnowledgeImprovementCandidateRecord> {\n  const iteration = state.candidates.length + 1\n  const candidateId = stableId('kcand', `${state.runId}:${iteration}:${now().toISOString()}`)\n  const candidateRoot = candidateWorkspacePath(runDir, candidateId)\n  await copyKnowledgeWorkspace(root, candidateRoot)\n  const createdAt = now().toISOString()\n  return {\n    iteration,\n    candidateId,\n    baseHash: state.baseHash,\n    status: 'running',\n    createdAt,\n    updatedAt: createdAt,\n  }\n}\n\nfunction candidateWorkspacePath(runDir: string, candidateId: string): string {\n  return join(runDir, 'candidates', safePathSegmentSchema.parse(candidateId), 'workspace')\n}\n\nfunction baselineSnapshotPath(runDir: string): string {\n  return join(runDir, 'baseline')\n}\n\nasync function createBaselineSnapshot(\n  runDir: string,\n  root: string,\n  expectedHash: string,\n): Promise<void> {\n  const target = baselineSnapshotPath(runDir)\n  try {\n    await assertBaselineSnapshot(runDir, expectedHash)\n    return\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n  const preparation = await mkdtemp(join(runDir, 'baseline-prepare-'))\n  let activated = false\n  try {\n    await copyKnowledgeWorkspace(root, preparation)\n    const actualHash = await hashKnowledgeBase(preparation)\n    if (actualHash !== expectedHash) {\n      throw new Error(\n        `knowledge base changed while baseline was frozen: expected ${expectedHash}, got ${actualHash}`,\n      )\n    }\n    await renameDurable(preparation, target)\n    activated = true\n  } finally {\n    if (!activated) await rm(preparation, { recursive: true, force: true })\n  }\n}\n\nasync function ensureBaselineSnapshot(\n  runDir: string,\n  root: string,\n  expectedHash: string,\n): Promise<void> {\n  try {\n    await assertBaselineSnapshot(runDir, expectedHash)\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n    const liveHash = await hashKnowledgeBase(root)\n    if (liveHash !== expectedHash) {\n      throw new Error(\n        'knowledge improvement baseline snapshot is missing and cannot be reconstructed',\n      )\n    }\n    await createBaselineSnapshot(runDir, root, expectedHash)\n  }\n}\n\nasync function assertBaselineSnapshot(runDir: string, expectedHash: string): Promise<void> {\n  await withBaselineSnapshot(runDir, expectedHash, () => undefined)\n}\n\nasync function withBaselineSnapshot<T>(\n  runDir: string,\n  expectedHash: string,\n  use: (baselineRoot: string) => Promise<T> | T,\n): Promise<T> {\n  return withSafeDirectory(runDir, 'baseline', false, async (baselineRoot) => {\n    const actualHash = await hashKnowledgeBase(baselineRoot)\n    if (actualHash !== expectedHash) {\n      throw new Error(\n        `knowledge improvement baseline changed: expected ${expectedHash}, got ${actualHash}`,\n      )\n    }\n    return use(baselineRoot)\n  })\n}\n\nasync function withFrozenCandidateWorkspace<T>(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  use: (snapshot: { root: string; hash: string }) => Promise<T> | T,\n): Promise<T> {\n  const snapshotsPath = join(\n    'candidates',\n    safePathSegmentSchema.parse(candidate.candidateId),\n    'snapshots',\n  )\n  return withSafeDirectory(runDir, snapshotsPath, true, async (snapshotsDir) => {\n    const preparation = await mkdtemp(join(snapshotsDir, 'prepare-'))\n    let activated = false\n    try {\n      await copyKnowledgeWorkspace(candidateRoot, preparation)\n      const hash = await hashKnowledgeBase(preparation)\n      try {\n        const result = await withSafeDirectory(snapshotsDir, hash, false, async (existing) => {\n          if ((await hashKnowledgeBase(existing)) !== hash) {\n            throw new Error('knowledge candidate snapshot does not match its content identity')\n          }\n          return use({ root: existing, hash })\n        })\n        await rm(preparation, { recursive: true, force: true })\n        activated = true\n        return result\n      } catch (error) {\n        if (!isMissingFile(error)) throw error\n      }\n      await renameDurable(preparation, join(snapshotsDir, hash))\n      activated = true\n      return withSafeDirectory(snapshotsDir, hash, false, (root) => use({ root, hash }))\n    } finally {\n      if (!activated) await rm(preparation, { recursive: true, force: true })\n    }\n  })\n}\n\nfunction clearCandidateMeasurement(candidate: KnowledgeImprovementCandidateRecord): void {\n  delete candidate.candidateHash\n  delete candidate.evidenceHash\n  delete candidate.promotionPlanHash\n}\n\nfunction findActiveCandidate(\n  state: KnowledgeImprovementRunState,\n): KnowledgeImprovementCandidateRecord | undefined {\n  return [...state.candidates]\n    .reverse()\n    .find((candidate) => candidate.status === 'candidate-ready' || candidate.status === 'running')\n}\n\nasync function copyKnowledgeWorkspace(sourceRoot: string, targetRoot: string): Promise<void> {\n  await rm(targetRoot, { recursive: true, force: true })\n  await mkdir(join(targetRoot, 'knowledge'), { recursive: true })\n  await mkdir(join(targetRoot, 'raw', 'sources'), { recursive: true })\n  await copyIfExists(join(sourceRoot, 'knowledge'), join(targetRoot, 'knowledge'))\n  await copyIfExists(join(sourceRoot, 'raw'), join(targetRoot, 'raw'))\n  await copyIfExists(\n    join(layoutFor(sourceRoot).cacheDir, 'sources.json'),\n    join(layoutFor(targetRoot).cacheDir, 'sources.json'),\n  )\n  await writeKnowledgeIndex(targetRoot)\n}\n\nfunction knowledgeCandidateTransitionPurpose(\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeCandidateTarget,\n): string {\n  const action = target === 'candidate' ? 'promotion' : 'restore'\n  return `knowledge-${action}:${contentHash(candidate)}`\n}\n\nasync function knowledgeFilePlanEntries(\n  sourceRoot: string,\n  targetRoot: string,\n): Promise<KnowledgeFileTransactionPlanEntry[]> {\n  const [before, after] = await Promise.all([\n    knowledgeHashEntries(sourceRoot),\n    knowledgeHashEntries(targetRoot),\n  ])\n  const beforeByPath = new Map(before.map((entry) => [entry.path, entry]))\n  const afterByPath = new Map(after.map((entry) => [entry.path, entry]))\n  const paths = [\n    ...new Set([...before.map((entry) => entry.path), ...after.map((entry) => entry.path)]),\n  ].sort((left, right) => left.localeCompare(right))\n  return paths.map((path) => {\n    assertKnowledgeMutationPath(path)\n    const beforeEntry = beforeByPath.get(path)\n    const afterEntry = afterByPath.get(path)\n    return {\n      path,\n      beforeHash: beforeEntry?.transactionHash ?? null,\n      afterHash: afterEntry?.transactionHash ?? null,\n      ...(beforeEntry ? { beforeMode: beforeEntry.mode } : {}),\n      ...(afterEntry ? { afterMode: afterEntry.mode } : {}),\n    }\n  })\n}\n\nasync function knowledgePlanMutations(\n  targetRoot: string,\n  plan: readonly KnowledgeFileTransactionPlanEntry[],\n): Promise<KnowledgeFileMutation[]> {\n  return Promise.all(\n    plan.map(async (entry) => {\n      if (entry.afterHash === null) return { path: entry.path, content: null }\n      const file = await readRegularFileWithinRoot(targetRoot, entry.path)\n      const actualHash = createHash('sha256').update(file.bytes).digest('hex')\n      if (actualHash !== entry.afterHash || file.mode !== entry.afterMode) {\n        throw new Error(`knowledge target file changed before activation: ${entry.path}`)\n      }\n      return { path: entry.path, content: file.bytes, mode: file.mode }\n    }),\n  )\n}\n\nfunction assertCandidateTransitionPlan(\n  plan: readonly KnowledgeFileTransactionPlanEntry[],\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeCandidateTarget,\n): void {\n  const approvedDirection = target === 'candidate' ? plan : reverseKnowledgeFilePlan(plan)\n  const actualPlanHash = knowledgeFileTransactionPlanHash(approvedDirection)\n  if (actualPlanHash !== candidate.promotionPlanHash) {\n    throw new Error(\n      `knowledge candidate plan changed after approval: expected ${candidate.promotionPlanHash}, got ${actualPlanHash}`,\n    )\n  }\n}\n\nfunction assertCandidateTransitionTransaction(\n  transaction: KnowledgeFileTransaction,\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeCandidateTarget,\n): void {\n  assertCandidateTransitionPlan(transaction.entries, candidate, target)\n}\n\nfunction reverseKnowledgeFilePlan(\n  plan: readonly KnowledgeFileTransactionPlanEntry[],\n): KnowledgeFileTransactionPlanEntry[] {\n  return plan.map((entry) => ({\n    path: entry.path,\n    beforeHash: entry.afterHash,\n    afterHash: entry.beforeHash,\n    ...(entry.afterMode === undefined ? {} : { beforeMode: entry.afterMode }),\n    ...(entry.beforeMode === undefined ? {} : { afterMode: entry.beforeMode }),\n  }))\n}\n\nasync function ensureCandidateTransitionEvent(\n  runDir: string,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  target: KnowledgeCandidateTarget,\n): Promise<void> {\n  if (await hasCandidateTransitionEvent(runDir, candidateRef, target)) return\n  await appendLedger(runDir, {\n    type: target === 'candidate' ? 'candidate.promoted' : 'candidate.restored',\n    runId: candidateRef.runId,\n    candidateId: candidateRef.candidateId,\n    candidateHash: candidateRef.candidateHash,\n    evidenceHash: candidateRef.evidenceHash,\n    promotionPlanHash: candidateRef.promotionPlanHash,\n  })\n}\n\nasync function hasCandidateTransitionEvent(\n  runDir: string,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  target: KnowledgeCandidateTarget,\n): Promise<boolean> {\n  const eventType = target === 'candidate' ? 'candidate.promoted' : 'candidate.restored'\n  let matched = false\n  for (const row of await loadKnowledgeImprovementEventsFromRun(runDir)) {\n    if (row.type !== eventType || row.candidateId !== candidateRef.candidateId) continue\n    if (\n      row.runId !== candidateRef.runId ||\n      row.candidateHash !== candidateRef.candidateHash ||\n      row.evidenceHash !== candidateRef.evidenceHash ||\n      row.promotionPlanHash !== candidateRef.promotionPlanHash\n    ) {\n      throw new Error('persisted knowledge activation event conflicts with the approved candidate')\n    }\n    matched = true\n  }\n  return matched\n}\n\nexport interface KnowledgeImprovementEvent extends Record<string, unknown> {\n  at: string\n  type: string\n}\n\nexport async function loadKnowledgeImprovementEvents(\n  root: string,\n  runId: string,\n): Promise<KnowledgeImprovementEvent[]> {\n  const parsedRunId = runIdSchema.parse(runId)\n  try {\n    return await withKnowledgeImprovementRun(root, parsedRunId, false, (runDir) =>\n      loadKnowledgeImprovementEventsFromRun(runDir),\n    )\n  } catch (error) {\n    if (isMissingFile(error)) return []\n    throw error\n  }\n}\n\nasync function loadKnowledgeImprovementEventsFromRun(\n  runDir: string,\n): Promise<KnowledgeImprovementEvent[]> {\n  const events: KnowledgeImprovementEvent[] = []\n  try {\n    for (const file of await listRegularFilesWithinRoot(runDir, 'events')) {\n      const name = file.path.slice('events/'.length)\n      if (name.includes('/') || !name.endsWith('.json')) {\n        throw new Error(`knowledge event store contains an unsupported entry: ${name}`)\n      }\n      events.push(parseKnowledgeImprovementEvent(JSON.parse(file.bytes.toString('utf8'))))\n    }\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n\n  const unique = new Map<string, KnowledgeImprovementEvent>()\n  for (const event of events) {\n    const { at: _at, ...semantic } = event\n    unique.set(contentHash(semantic), event)\n  }\n  return [...unique.values()].sort((left, right) => left.at.localeCompare(right.at))\n}\n\nfunction parseKnowledgeImprovementEvent(value: unknown): KnowledgeImprovementEvent {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) {\n    throw new Error('knowledge improvement event is not an object')\n  }\n  const event = value as Record<string, unknown>\n  if (typeof event.at !== 'string' || typeof event.type !== 'string') {\n    throw new Error('knowledge improvement event is missing at or type')\n  }\n  return event as KnowledgeImprovementEvent\n}\n\nasync function copyIfExists(source: string, target: string): Promise<void> {\n  let sourceStat: Awaited<ReturnType<typeof lstat>>\n  try {\n    sourceStat = await lstat(source)\n  } catch (error) {\n    if (isMissingFile(error)) return\n    throw error\n  }\n  if (!sourceStat.isDirectory() && !sourceStat.isFile()) {\n    throw new Error(`knowledge surface contains an unsupported filesystem entry: ${source}`)\n  }\n  await mkdir(dirname(target), { recursive: true })\n  await cp(source, target, { recursive: sourceStat.isDirectory(), dereference: false })\n}\n\nexport async function hashKnowledgeBase(root: string): Promise<string> {\n  return withKnowledgeRead(root, () => hashKnowledgeBaseUnlocked(root))\n}\n\nasync function hashKnowledgeBaseUnlocked(root: string): Promise<string> {\n  const entries = await knowledgeHashEntries(root)\n  return sha256(JSON.stringify(entries.map(({ path, hash, mode }) => ({ path, hash, mode }))))\n}\n\ninterface KnowledgeFileIdentity {\n  path: string\n  hash: string\n  transactionHash: string\n  mode: number\n}\n\nasync function knowledgeHashEntries(root: string): Promise<KnowledgeFileIdentity[]> {\n  const entries: KnowledgeFileIdentity[] = []\n  for (const rel of ['knowledge', 'raw']) {\n    try {\n      for (const file of await listRegularFilesWithinRoot(root, rel)) {\n        entries.push(knowledgeFileIdentity(file.path, file.bytes, file.mode))\n      }\n    } catch (error) {\n      if (!isMissingFile(error)) throw error\n    }\n  }\n  const sourceRegistry = relative(root, layoutFor(root).sourceRegistryPath).replace(/\\\\/g, '/')\n  try {\n    const file = await readRegularFileWithinRoot(root, sourceRegistry)\n    entries.push(knowledgeFileIdentity(sourceRegistry, file.bytes, file.mode))\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n  entries.sort((a, b) => a.path.localeCompare(b.path))\n  return entries\n}\n\nfunction knowledgeFileIdentity(path: string, bytes: Buffer, mode: number): KnowledgeFileIdentity {\n  return {\n    path,\n    hash: sha256(bytes.toString('base64')),\n    transactionHash: createHash('sha256').update(bytes).digest('hex'),\n    mode,\n  }\n}\n\nasync function acquireRunLease(\n  runDir: string,\n  options: { ownerId: string; ttlMs: number },\n): Promise<LeaseHandle> {\n  const path = join(runDir, 'run.lock.durable')\n  const acquired = await acquireDurableFileLock(runDir, {\n    lockfilePath: path,\n    staleMs: options.ttlMs,\n  })\n  return {\n    ownerId: options.ownerId,\n    assertOwned: acquired.assertOwned,\n    release: acquired.release,\n  }\n}\n\nasync function blockRun(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  reason: string,\n  onState: KnowledgeImprovementOptions['onState'],\n  now: () => Date,\n): Promise<KnowledgeImprovementRunState> {\n  state.status = 'blocked'\n  state.blockedReason = reason\n  state.updatedAt = now().toISOString()\n  await saveState(runDir, state, onState)\n  return state\n}\n\nasync function saveState(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  onState?: KnowledgeImprovementOptions['onState'],\n): Promise<void> {\n  await writeJsonDurableWithinRoot(\n    runDir,\n    'state.json',\n    KnowledgeImprovementRunStateSchema.parse(state),\n  )\n  await onState?.(state)\n}\n\nasync function appendLedger(runDir: string, value: Record<string, unknown>): Promise<void> {\n  const type = value.type\n  if (typeof type !== 'string' || type.length === 0) {\n    throw new Error('knowledge improvement event requires a type')\n  }\n  const relativePath = join('events', `${contentHash(value)}.json`).replace(/\\\\/g, '/')\n  try {\n    const file = await readRegularFileWithinRoot(runDir, relativePath)\n    const existing = parseKnowledgeImprovementEvent(JSON.parse(file.bytes.toString('utf8')))\n    const { at: _at, ...semantic } = existing\n    if (canonicalJson(semantic) !== canonicalJson(value)) {\n      throw new Error('knowledge improvement event identity conflicts with durable content')\n    }\n    return\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n  await writeJsonDurableWithinRoot(runDir, relativePath, {\n    at: new Date().toISOString(),\n    ...value,\n  })\n}\n\nfunction candidateEvidenceRelativePath(candidateId: string): string {\n  return join('candidates', safePathSegmentSchema.parse(candidateId), 'evidence.json').replace(\n    /\\\\/g,\n    '/',\n  )\n}\n\nfunction descendantPath(root: string, path: string): string | undefined {\n  const value = relative(resolve(root), resolve(path)).replace(/\\\\/g, '/')\n  if (value === '' || value === '..' || value.startsWith('../') || isAbsolute(value))\n    return undefined\n  return value\n}\n\nfunction assertExactCandidatePlatform(): void {\n  if (process.platform !== 'linux') {\n    throw new Error('exact knowledge candidate workflows require Linux directory descriptors')\n  }\n}\n\nfunction average(values: readonly number[]): number {\n  const finite = values.filter(Number.isFinite)\n  if (finite.length === 0) return 0\n  return finite.reduce((sum, value) => sum + value, 0) / finite.length\n}\n","/**\n * Claim-grounding mode for `runVerifiedResearchLoop`.\n *\n * The two-agent loop's existing verifier judges a source's on-topic RELEVANCE\n * (is this page about the goal?). On the topic sets we have measured, its\n * cleanliness win is dominated by DE-DUPLICATION — which a deterministic\n * content-hash / canonical-URL check captures at ~none of the LLM premium (see\n * `docs/results/cost-quality.md`). That makes the LLM verifier look expensive\n * for what a cheap rule already does.\n *\n * Claim-grounding targets a DIFFERENT, harder error band: a citation that is\n * relevant and unique but **misattributed** — the page is on-topic, the URL is\n * real, yet the specific CLAIM the source is cited for does NOT actually appear\n * in the page. This is the citation-fabrication failure mode of LLM research:\n * the model writes a plausible sentence and hangs a real URL off it that never\n * says any such thing. Neither de-dup nor a relevance judge catches it (both can\n * pass a misattributed-but-on-topic page); only checking the claim against the\n * fetched text does.\n *\n * The check is EXECUTABLE GROUND TRUTH, not another LLM opinion: the worker\n * attaches the specific claim it is citing the source for, and the verifier\n * tests whether that claim is PRESENT (verbatim, normalized, or as a sufficient\n * content-word overlap / close paraphrase) in the `htmlToText` output of the\n * page the worker actually fetched. A claim that is not grounded is rejected as\n * misattributed. Because the oracle is deterministic text presence — not a model\n * call — it is a deployable, non-oracle verifier: it can run in production with\n * zero inference cost, OR be composed with the LLM relevance verifier so the\n * loop rejects BOTH off-topic AND misattributed sources.\n *\n * This module is content-free and any-topic: it adds (1) a way for a proposal to\n * carry the claim it is cited for, (2) the `groundClaimInText` oracle, and (3) a\n * `ResearchDriver` that gates on grounding. It composes the existing\n * `ResearchDriver` / `ResearchSourceProposal` contracts and the shipped\n * `htmlToText`; it reinvents none of them.\n */\n\nimport type {\n  ResearchSourceProposal,\n  SourceVerdict,\n  SourceVerificationContext,\n} from './two-agent-research-loop'\nimport {\n  createTangleRouterClient,\n  type RouterClient,\n  type TangleRouterOptions,\n} from './web-research-worker'\n\n/**\n * Metadata key under which a proposal carries the specific claim it is cited\n * for. The worker sets `metadata[citedClaimKey] = '<the claim>'`; the\n * claim-grounding driver reads it and checks it against the fetched page text.\n */\nexport const citedClaimKey = 'citedClaim'\n\n/** Read the cited claim a proposal carries, if any. */\nexport function citedClaimOf(source: ResearchSourceProposal): string | undefined {\n  const claim = source.metadata?.[citedClaimKey]\n  return typeof claim === 'string' && claim.trim() ? claim.trim() : undefined\n}\n\n/** Attach a cited claim to a proposal (immutably returns a new proposal). */\nexport function withCitedClaim(\n  source: ResearchSourceProposal,\n  claim: string,\n): ResearchSourceProposal {\n  return { ...source, metadata: { ...source.metadata, [citedClaimKey]: claim } }\n}\n\nexport interface GroundingResult {\n  /** True when the claim is sufficiently present in the page text. */\n  grounded: boolean\n  /** How the claim matched (or why it didn't). For audit/notes. */\n  mode: 'verbatim' | 'normalized' | 'overlap' | 'absent' | 'empty-claim' | 'empty-text'\n  /**\n   * Fraction of the claim's content words found in the page text. 1 for a\n   * verbatim/normalized hit; the measured overlap otherwise.\n   */\n  overlap: number\n  /** Content words present in the claim but NOT in the page text. */\n  missingWords: string[]\n}\n\nexport interface GroundClaimOptions {\n  /**\n   * Minimum fraction of the claim's content words that must appear in the page\n   * text to count as a close paraphrase when there is no verbatim/normalized\n   * hit. Default 0.7 — a high bar, because a misattribution is exactly a claim\n   * whose specific words the page does not contain.\n   */\n  minOverlap?: number\n  /**\n   * Content words shorter than this are ignored (drops \"the\", \"of\", \"is\", …)\n   * and never count toward overlap. Default 3.\n   */\n  minWordLength?: number\n}\n\n/**\n * Stopwords stripped before overlap scoring so the bar measures the claim's\n * SUBSTANTIVE words (the numbers, nouns, methods it asserts), not filler a\n * misattributed page would trivially share with the real one.\n */\nconst stopwords = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'but',\n  'of',\n  'to',\n  'in',\n  'on',\n  'for',\n  'with',\n  'as',\n  'by',\n  'at',\n  'from',\n  'that',\n  'this',\n  'these',\n  'those',\n  'it',\n  'its',\n  'is',\n  'are',\n  'was',\n  'were',\n  'be',\n  'been',\n  'being',\n  'has',\n  'have',\n  'had',\n  'can',\n  'will',\n  'would',\n  'should',\n  'may',\n  'might',\n  'not',\n  'no',\n  'than',\n  'then',\n  'over',\n  'under',\n  'about',\n  'into',\n  'their',\n  'they',\n  'them',\n])\n\n/** Normalize for presence checks: lowercase, collapse whitespace + punctuation. */\nfunction normalize(text: string): string {\n  return text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .replace(/\\s+/g, ' ')\n    .trim()\n}\n\n/** The claim's substantive content words (deduped, stopwords + short words removed). */\nfunction contentWords(claim: string, minWordLength: number): string[] {\n  const words = normalize(claim)\n    .split(' ')\n    .filter((word) => word.length >= minWordLength && !stopwords.has(word))\n  return [...new Set(words)]\n}\n\n/**\n * THE ORACLE. Is `claim` grounded in `pageText` (the `htmlToText` output of the\n * page the worker fetched)? Deterministic, no model call:\n *\n *   1. verbatim — the claim string appears as-is (case-insensitive).\n *   2. normalized — the claim appears after collapsing punctuation/whitespace\n *      on both sides (so \"5.4x\" vs \"5.4 x\", smart quotes, etc. still match).\n *   3. overlap — a close paraphrase: at least `minOverlap` of the claim's\n *      substantive content words appear in the page text. A misattributed page\n *      fails here because the SPECIFIC words the claim asserts are absent.\n *\n * Returns the match mode, the measured overlap, and the missing content words —\n * enough for the driver to give a precise rejection reason and for a test/doc to\n * audit WHY a claim grounded or didn't.\n */\nexport function groundClaimInText(\n  claim: string,\n  pageText: string,\n  options: GroundClaimOptions = {},\n): GroundingResult {\n  const minOverlap = options.minOverlap ?? 0.7\n  const minWordLength = Math.max(1, options.minWordLength ?? 3)\n\n  const claimTrimmed = claim.trim()\n  if (!claimTrimmed) return { grounded: false, mode: 'empty-claim', overlap: 0, missingWords: [] }\n  if (!pageText.trim()) return { grounded: false, mode: 'empty-text', overlap: 0, missingWords: [] }\n\n  const haystackLower = pageText.toLowerCase()\n  if (haystackLower.includes(claimTrimmed.toLowerCase())) {\n    return { grounded: true, mode: 'verbatim', overlap: 1, missingWords: [] }\n  }\n\n  const haystackNorm = normalize(pageText)\n  const claimNorm = normalize(claimTrimmed)\n  if (claimNorm && haystackNorm.includes(claimNorm)) {\n    return { grounded: true, mode: 'normalized', overlap: 1, missingWords: [] }\n  }\n\n  const words = contentWords(claimTrimmed, minWordLength)\n  if (words.length === 0) {\n    // The claim has no substantive content words (all stopwords/short). With no\n    // verbatim/normalized hit there is nothing to ground — treat as absent.\n    return { grounded: false, mode: 'absent', overlap: 0, missingWords: [] }\n  }\n  // Word-boundary presence so \"rotary\" does not match inside \"rotaryxyz\".\n  const present = words.filter((word) =>\n    new RegExp(`\\\\b${word.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')}\\\\b`).test(haystackNorm),\n  )\n  const missingWords = words.filter((word) => !present.includes(word))\n  const overlap = present.length / words.length\n  const grounded = overlap >= minOverlap\n  return { grounded, mode: grounded ? 'overlap' : 'absent', overlap, missingWords }\n}\n\nexport interface ClaimGroundingDriverOptions extends GroundClaimOptions {\n  /**\n   * Optional second verifier to compose AFTER grounding passes. When set, a\n   * source must BOTH ground its claim AND pass this verifier (e.g. the LLM\n   * relevance driver's `verifySource`). Lets the loop reject off-topic AND\n   * misattributed sources in one driver. Omit for the pure, zero-inference\n   * grounding gate.\n   */\n  relevanceVerifier?: (\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ) => Promise<SourceVerdict> | SourceVerdict\n  /**\n   * What to do when a proposal carries NO cited claim. `'reject'` (default) is\n   * fail-closed: in claim-grounding mode every source must declare what it is\n   * cited for, so an un-annotated source is treated as ungrounded. `'accept'`\n   * lets un-annotated sources through to the relevance verifier (if any) —\n   * useful when mixing annotated and legacy proposals.\n   */\n  onMissingClaim?: 'reject' | 'accept'\n}\n\n/**\n * A `ResearchDriver`-shaped verifier (just the `verifySource` arm) that gates on\n * CLAIM GROUNDING: it rejects a source whose cited claim is not present in its\n * fetched page text — a misattributed / fabricated citation — and (optionally)\n * composes a relevance verifier after grounding passes.\n *\n * The returned function matches `ResearchDriver['verifySource']`, so it drops\n * straight into `runVerifiedResearchLoop` as `{ verifySource: createClaimGroundingVerifier(...) }`.\n */\nexport function createClaimGroundingVerifier(options: ClaimGroundingDriverOptions = {}) {\n  const onMissingClaim = options.onMissingClaim ?? 'reject'\n  return async function verifySource(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<SourceVerdict> {\n    const claim = citedClaimOf(source)\n    if (!claim) {\n      if (onMissingClaim === 'reject') {\n        return {\n          accept: false,\n          reason: 'no cited claim: claim-grounding mode requires every source to declare its claim',\n        }\n      }\n      // accept-on-missing: fall through to the relevance verifier (or accept).\n      return options.relevanceVerifier ? options.relevanceVerifier(source, ctx) : { accept: true }\n    }\n\n    const grounding = groundClaimInText(claim, source.text, options)\n    if (!grounding.grounded) {\n      const detail =\n        grounding.mode === 'empty-text'\n          ? 'fetched page has no text'\n          : `claim not found in the fetched page (overlap ${(grounding.overlap * 100).toFixed(0)}%${\n              grounding.missingWords.length\n                ? `, missing: ${grounding.missingWords.slice(0, 6).join(', ')}`\n                : ''\n            })`\n      return {\n        accept: false,\n        reason: `misattributed citation: ${detail}`,\n      }\n    }\n\n    // Claim is grounded. Compose the relevance verifier if one was provided.\n    if (options.relevanceVerifier) return options.relevanceVerifier(source, ctx)\n    return { accept: true }\n  }\n}\n\nexport interface WorkerClaimDecorationOptions {\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /** Max output tokens for the claim-extraction call. Default 1200 (glm floor). */\n  maxTokens?: number\n}\n\n/**\n * Ask an LLM to state, for one source, the single specific factual claim a\n * researcher would cite THIS page for toward the goal. Used to DECORATE the\n * sources a relevance-only worker produced with the claim a citation would make,\n * so the claim-grounding verifier has something executable to check. The model\n * is told to ground the claim in the provided excerpt; the verifier then checks\n * it against the FULL page text independently — the model does not get to mark\n * its own homework.\n *\n * Returns the proposal annotated via `withCitedClaim`, or the original proposal\n * unchanged if the model returns nothing parseable (the verifier's\n * `onMissingClaim` policy then decides).\n */\nexport function createClaimDecorator(options: WorkerClaimDecorationOptions = {}) {\n  const maxTokens = options.maxTokens ?? 1200\n  return async function decorate(\n    source: ResearchSourceProposal,\n    goal: string,\n  ): Promise<ResearchSourceProposal> {\n    const router = options.router ?? createTangleRouterClient(options.router_options)\n    const excerpt = source.text.slice(0, 1500)\n    const system =\n      'You extract the single most important factual claim a researcher would cite a page for. ' +\n      \"State ONE concrete, checkable sentence using the page's own key terms and numbers. \" +\n      'Do NOT invent facts not in the excerpt. Respond with ONLY the claim sentence, no prose.'\n    const user = [\n      `Research goal: ${goal}`,\n      `Page title: ${source.title ?? '(none)'}`,\n      `Page excerpt:\\n${excerpt}`,\n      'The single claim this page should be cited for:',\n    ].join('\\n\\n')\n    let raw = ''\n    try {\n      raw = await router.chat(\n        [\n          { role: 'system', content: system },\n          { role: 'user', content: user },\n        ],\n        maxTokens,\n      )\n    } catch {\n      return source\n    }\n    const claim = raw.trim().split('\\n')[0]?.trim()\n    if (!claim) return source\n    return withCitedClaim(source, claim)\n  }\n}\n","import type { JsonValue, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'\nimport { groundClaimInText } from './claim-grounding'\nimport { lintKnowledgeIndex } from './lint'\nimport type { RagAnswerQualityResult, RagGapFinding } from './rag-improvement-loop'\nimport type { KnowledgeIndex } from './types'\nimport { validateKnowledgeIndex } from './validate'\n\nexport type RagEvalProvider =\n  | 'agent-knowledge'\n  | 'ragas'\n  | 'deepeval'\n  | 'trulens'\n  | 'ragchecker'\n  | 'custom'\n\nexport type RagEvalMetricKey =\n  | 'context_precision'\n  | 'context_recall'\n  | 'context_relevance'\n  | 'context_sufficiency'\n  | 'faithfulness'\n  | 'groundedness'\n  | 'answer_relevance'\n  | 'answer_correctness'\n  | 'citation_support'\n  | 'abstention'\n  | 'unsupported_answer_rate'\n\nexport type RagEvalSlice =\n  | 'known-answer'\n  | 'paraphrase'\n  | 'distractor'\n  | 'freshness'\n  | 'multi-source'\n  | 'unanswerable'\n  | 'long-tail'\n  | 'custom'\n\nexport interface RagEvalContext {\n  id: string\n  text: string\n  rank?: number\n  pageId?: string\n  sourceId?: string\n  anchorId?: string\n  stale?: boolean\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagEvalCitation {\n  id: string\n  claimId?: string\n  contextId?: string\n  pageId?: string\n  sourceId?: string\n  anchorId?: string\n  quote?: string\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagEvalClaim {\n  id: string\n  text: string\n  citationIds?: readonly string[]\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagRequiredContext {\n  id?: string\n  text?: string\n  pageId?: string\n  sourceId?: string\n  anchorId?: string\n}\n\nexport interface RagAnswerEvalScenario extends Scenario {\n  kind: 'rag-answer-eval'\n  query: string\n  referenceAnswer?: string\n  expectedClaims?: readonly string[]\n  forbiddenClaims?: readonly string[]\n  requiredContext?: readonly RagRequiredContext[]\n  unanswerable?: boolean\n  requireCitations?: boolean\n  slices?: readonly RagEvalSlice[]\n  thresholds?: Partial<Record<RagEvalMetricKey, number>>\n}\n\nexport interface ExternalRagEvalScore {\n  provider: RagEvalProvider | string\n  scores: Record<string, number>\n  reasons?: Record<string, string>\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagAnswerEvalArtifact {\n  query: string\n  answer: string\n  contexts: readonly RagEvalContext[]\n  claims?: readonly RagEvalClaim[]\n  citations?: readonly RagEvalCitation[]\n  abstained?: boolean\n  durationMs?: number\n  costUsd?: number\n  externalScores?: readonly ExternalRagEvalScore[]\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagAnswerMetricSummary {\n  metrics: Record<RagEvalMetricKey, number>\n  composite: number\n  passed: boolean\n  findings: readonly RagGapFinding[]\n  claimCount: number\n  supportedClaimCount: number\n  citedClaimCount: number\n  supportedCitationCount: number\n  matchedRequiredContextCount: number\n  requiredContextCount: number\n  providerScores: Record<string, Record<RagEvalMetricKey, number>>\n}\n\nexport interface RagAnswerQualityJudgeOptions {\n  name?: string\n  thresholds?: Partial<Record<RagEvalMetricKey, number>>\n  weights?: Partial<Record<RagEvalMetricKey, number>>\n  externalScorePolicy?: 'prefer-external' | 'deterministic-first'\n  minClaimSupport?: number\n}\n\nexport interface RagAnswerEvalCase {\n  scenario: RagAnswerEvalScenario\n  artifact: RagAnswerEvalArtifact\n}\n\nexport interface RagAnswerQualityHookOptions {\n  scenarios: readonly RagAnswerEvalScenario[]\n  run: (scenario: RagAnswerEvalScenario) => MaybePromise<RagAnswerEvalArtifact>\n  externalEvaluator?: (\n    item: RagAnswerEvalCase,\n  ) => MaybePromise<ExternalRagEvalScore | readonly ExternalRagEvalScore[] | undefined>\n  thresholds?: Partial<Record<RagEvalMetricKey, number>>\n  weights?: Partial<Record<RagEvalMetricKey, number>>\n}\n\nexport interface RagCalibrationOptions {\n  scenario: RagAnswerEvalScenario\n  strong: RagAnswerEvalArtifact\n  weak: RagAnswerEvalArtifact\n  judge?: JudgeConfig<RagAnswerEvalArtifact, RagAnswerEvalScenario>\n  minStrongScore?: number\n  maxWeakScore?: number\n  signal?: AbortSignal\n}\n\nexport interface RagCalibrationResult {\n  passed: boolean\n  strongScore: number\n  weakScore: number\n  gap: number\n}\n\nexport interface KnowledgeBaseQualityOptions {\n  now?: Date\n  strict?: boolean\n  minCitationRate?: number\n  maxStaleSourceRate?: number\n}\n\nexport interface KnowledgeBaseQualityReport {\n  ok: boolean\n  metrics: {\n    page_count: number\n    source_count: number\n    citation_rate: number\n    source_backed_page_rate: number\n    stale_source_rate: number\n    duplicate_source_hash_rate: number\n    lint_error_count: number\n    lint_warning_count: number\n  }\n  findings: readonly RagGapFinding[]\n}\n\ntype MaybePromise<T> = T | Promise<T>\n\nconst defaultThresholds: Partial<Record<RagEvalMetricKey, number>> = {\n  context_precision: 0.5,\n  context_recall: 0.8,\n  context_relevance: 0.5,\n  context_sufficiency: 0.8,\n  faithfulness: 0.9,\n  answer_relevance: 0.7,\n  citation_support: 0.9,\n  abstention: 1,\n  unsupported_answer_rate: 0,\n}\n\nconst defaultWeights: Partial<Record<RagEvalMetricKey, number>> = {\n  context_relevance: 1,\n  context_sufficiency: 1,\n  faithfulness: 2,\n  answer_relevance: 1,\n  citation_support: 1,\n  abstention: 1,\n}\n\nconst metricAliases: Record<string, RagEvalMetricKey> = {\n  answer_correctness: 'answer_correctness',\n  answer_relevance: 'answer_relevance',\n  answer_relevancy: 'answer_relevance',\n  answerrelevancy: 'answer_relevance',\n  context_precision: 'context_precision',\n  context_recall: 'context_recall',\n  context_relevance: 'context_relevance',\n  context_relevancy: 'context_relevance',\n  context_sufficiency: 'context_sufficiency',\n  contextual_precision: 'context_precision',\n  contextual_recall: 'context_recall',\n  contextual_relevancy: 'context_relevance',\n  faithfulness: 'faithfulness',\n  groundedness: 'groundedness',\n  claim_recall: 'context_recall',\n  claim_precision: 'faithfulness',\n  citation_support: 'citation_support',\n  abstention: 'abstention',\n  unsupported_answer_rate: 'unsupported_answer_rate',\n}\n\nexport function ragAnswerQualityJudge(\n  options: RagAnswerQualityJudgeOptions = {},\n): JudgeConfig<RagAnswerEvalArtifact, RagAnswerEvalScenario> {\n  return {\n    name: options.name ?? 'rag-answer-quality',\n    dimensions: [\n      { key: 'context_precision', description: 'share of retrieved context that is useful' },\n      { key: 'context_recall', description: 'share of required evidence present in context' },\n      { key: 'context_relevance', description: 'context relevance to the query and answer target' },\n      { key: 'context_sufficiency', description: 'whether context is enough to answer' },\n      { key: 'faithfulness', description: 'share of answer claims supported by retrieved context' },\n      { key: 'answer_relevance', description: 'answer addresses the user query' },\n      { key: 'answer_correctness', description: 'answer contains expected claims' },\n      { key: 'citation_support', description: 'citations support the claims they cite' },\n      { key: 'abstention', description: 'answer abstains exactly when the case is unanswerable' },\n    ],\n    appliesTo: (scenario) => scenario.kind === 'rag-answer-eval',\n    async score({ artifact, scenario }) {\n      const summary = scoreRagAnswerArtifact(artifact, scenario, options)\n      return {\n        dimensions: summary.metrics,\n        composite: summary.composite,\n        notes: summary.findings.map((finding) => finding.message).join('; '),\n      }\n    },\n  }\n}\n\nexport function scoreRagAnswerArtifact(\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  options: RagAnswerQualityJudgeOptions = {},\n): RagAnswerMetricSummary {\n  const claims = normalizeClaims(artifact)\n  const abstained = artifact.abstained ?? looksLikeAbstention(artifact.answer)\n  const requiredTargets = requiredContextTargets(scenario)\n  const matchedRequiredContextCount = requiredTargets.filter((target) =>\n    artifact.contexts.some((context) => contextMatchesTarget(context, target)),\n  ).length\n  const requiredContextCount = requiredTargets.length\n  const contextRecall =\n    requiredContextCount === 0\n      ? neutralScore(Boolean(scenario.unanswerable) || artifact.contexts.length > 0)\n      : matchedRequiredContextCount / requiredContextCount\n  const relevantContextCount = artifact.contexts.filter((context) =>\n    contextIsRelevant(context, scenario),\n  ).length\n  const contextPrecision =\n    artifact.contexts.length === 0\n      ? scenario.unanswerable\n        ? 1\n        : 0\n      : relevantContextCount / artifact.contexts.length\n  const contextRelevance =\n    artifact.contexts.length === 0\n      ? scenario.unanswerable\n        ? 1\n        : 0\n      : average(artifact.contexts.map((context) => contextRelevanceScore(context, scenario)))\n  const contextSufficiency = requiredContextCount === 0 ? contextRelevance : contextRecall\n  const support = claims.map((claim) => claimSupport(claim.text, artifact.contexts, options))\n  const supportedClaimCount = support.filter(Boolean).length\n  const faithfulness =\n    claims.length === 0 ? (abstained ? 1 : 0) : supportedClaimCount / Math.max(1, claims.length)\n  const citation = scoreCitations(claims, artifact, scenario, options)\n  const answerRelevance = scoreAnswerRelevance(artifact, scenario, abstained)\n  const answerCorrectness = scoreAnswerCorrectness(artifact, scenario, abstained)\n  const abstention = scenario.unanswerable ? (abstained ? 1 : 0) : abstained ? 0 : 1\n  const unsupportedAnswerRate =\n    claims.length === 0 ? (abstained ? 0 : 1) : 1 - supportedClaimCount / Math.max(1, claims.length)\n\n  const deterministicMetrics: Record<RagEvalMetricKey, number> = {\n    context_precision: clamp01(contextPrecision),\n    context_recall: clamp01(contextRecall),\n    context_relevance: clamp01(contextRelevance),\n    context_sufficiency: clamp01(contextSufficiency),\n    faithfulness: clamp01(faithfulness),\n    groundedness: clamp01(faithfulness),\n    answer_relevance: clamp01(answerRelevance),\n    answer_correctness: clamp01(answerCorrectness),\n    citation_support: clamp01(citation.support),\n    abstention: clamp01(abstention),\n    unsupported_answer_rate: clamp01(unsupportedAnswerRate),\n  }\n  const providerScores = normalizeExternalRagScores(artifact.externalScores ?? [])\n  const metrics = mergeMetrics(deterministicMetrics, providerScores, options.externalScorePolicy)\n  const thresholds = { ...defaultThresholds, ...scenario.thresholds, ...options.thresholds }\n  const findings = diagnoseRagAnswerFailure(metrics, scenario, thresholds)\n  const composite = weightedComposite(metrics, options.weights ?? defaultWeights)\n\n  return {\n    metrics,\n    composite,\n    passed: findings.every(\n      (finding) => finding.severity !== 'error' && finding.severity !== 'critical',\n    ),\n    findings,\n    claimCount: claims.length,\n    supportedClaimCount,\n    citedClaimCount: citation.citedClaimCount,\n    supportedCitationCount: citation.supportedCitationCount,\n    matchedRequiredContextCount,\n    requiredContextCount,\n    providerScores,\n  }\n}\n\nexport function diagnoseRagAnswerFailure(\n  metrics: Record<RagEvalMetricKey, number>,\n  scenario: RagAnswerEvalScenario,\n  thresholds: Partial<Record<RagEvalMetricKey, number>> = defaultThresholds,\n): RagGapFinding[] {\n  const findings: RagGapFinding[] = []\n  if (below(metrics.context_recall, thresholds.context_recall)) {\n    findings.push({\n      id: `${scenario.id}:context-recall`,\n      kind: scenario.slices?.includes('multi-source')\n        ? 'missing-multihop-evidence'\n        : 'retrieval-miss',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: 'Required evidence was not present in retrieved context.',\n      evidence: { context_recall: metrics.context_recall },\n    })\n  }\n  if (below(metrics.context_precision, thresholds.context_precision)) {\n    findings.push({\n      id: `${scenario.id}:context-precision`,\n      kind: 'retrieval-noise',\n      severity: 'warning',\n      scenarioId: scenario.id,\n      message: 'Retrieved context contains too much irrelevant material.',\n      evidence: { context_precision: metrics.context_precision },\n    })\n  }\n  if (below(metrics.faithfulness, thresholds.faithfulness)) {\n    findings.push({\n      id: `${scenario.id}:faithfulness`,\n      kind: 'generator-unsupported-claim',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: 'The answer contains claims not supported by retrieved context.',\n      evidence: { faithfulness: metrics.faithfulness },\n    })\n  }\n  if (below(metrics.citation_support, thresholds.citation_support)) {\n    findings.push({\n      id: `${scenario.id}:citation-support`,\n      kind: 'citation-mismatch',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: 'Citations do not support the claims they are attached to.',\n      evidence: { citation_support: metrics.citation_support },\n    })\n  }\n  if (below(metrics.abstention, thresholds.abstention)) {\n    findings.push({\n      id: `${scenario.id}:abstention`,\n      kind: 'incorrect-abstention',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: scenario.unanswerable\n        ? 'The system answered a case marked unanswerable.'\n        : 'The system abstained from an answerable case.',\n      evidence: { abstention: metrics.abstention },\n    })\n  }\n  return findings\n}\n\nexport function createRagAnswerQualityHook(\n  options: RagAnswerQualityHookOptions,\n): () => Promise<RagAnswerQualityResult> {\n  return async () => {\n    const summaries: RagAnswerMetricSummary[] = []\n    const findings: RagGapFinding[] = []\n    for (const scenario of options.scenarios) {\n      const initialArtifact = await options.run(scenario)\n      const external = await options.externalEvaluator?.({ scenario, artifact: initialArtifact })\n      const artifact = external\n        ? {\n            ...initialArtifact,\n            externalScores: [\n              ...(initialArtifact.externalScores ?? []),\n              ...(Array.isArray(external) ? external : [external]),\n            ],\n          }\n        : initialArtifact\n      const summary = scoreRagAnswerArtifact(artifact, scenario, {\n        thresholds: options.thresholds,\n        weights: options.weights,\n      })\n      summaries.push(summary)\n      findings.push(...summary.findings)\n    }\n    const metrics = aggregateRagAnswerMetrics(summaries)\n    return {\n      passed: findings.length === 0,\n      metrics,\n      findings,\n      metadata: { scenarioCount: options.scenarios.length },\n    }\n  }\n}\n\nexport async function calibrateRagAnswerJudge(\n  options: RagCalibrationOptions,\n): Promise<RagCalibrationResult> {\n  const judge = options.judge ?? ragAnswerQualityJudge()\n  const strong = await judge.score({\n    artifact: options.strong,\n    scenario: options.scenario,\n    signal: options.signal ?? new AbortController().signal,\n  })\n  const weak = await judge.score({\n    artifact: options.weak,\n    scenario: options.scenario,\n    signal: options.signal ?? new AbortController().signal,\n  })\n  const strongScore = strong.composite\n  const weakScore = weak.composite\n  const minStrongScore = options.minStrongScore ?? 0.7\n  const maxWeakScore = options.maxWeakScore ?? 0.3\n  return {\n    passed: strongScore >= minStrongScore && weakScore <= maxWeakScore,\n    strongScore,\n    weakScore,\n    gap: strongScore - weakScore,\n  }\n}\n\nexport function normalizeExternalRagScores(\n  scores: readonly ExternalRagEvalScore[],\n): Record<string, Record<RagEvalMetricKey, number>> {\n  const normalized: Record<string, Record<RagEvalMetricKey, number>> = {}\n  for (const item of scores) {\n    const provider = item.provider || 'custom'\n    const providerScores = (normalized[provider] ?? {}) as Record<RagEvalMetricKey, number>\n    for (const [key, value] of Object.entries(item.scores)) {\n      const canonical = metricAliases[normalizeMetricName(key)]\n      if (!canonical) continue\n      if (Number.isFinite(value)) providerScores[canonical] = clamp01(value)\n    }\n    normalized[provider] = providerScores\n  }\n  return normalized\n}\n\nexport function toRagasEvaluationRows(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    user_input: scenario.query,\n    response: artifact.answer,\n    retrieved_contexts: artifact.contexts.map((context) => context.text),\n    reference: scenario.referenceAnswer,\n    reference_contexts: requiredContextTexts(scenario),\n  }))\n}\n\nexport function toDeepEvalTestCases(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    input: scenario.query,\n    actual_output: artifact.answer,\n    expected_output: scenario.referenceAnswer,\n    retrieval_context: artifact.contexts.map((context) => context.text),\n    context: requiredContextTexts(scenario),\n  }))\n}\n\nexport function toTruLensRecords(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    input: scenario.query,\n    output: artifact.answer,\n    context: artifact.contexts.map((context) => context.text).join('\\n\\n'),\n  }))\n}\n\nexport function toRagCheckerRecords(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    query_id: scenario.id,\n    query: scenario.query,\n    gt_answer: scenario.referenceAnswer,\n    response: artifact.answer,\n    retrieved_context: artifact.contexts.map((context) => ({\n      doc_id: context.id,\n      text: context.text,\n    })),\n    claims: normalizeClaims(artifact).map((claim) => claim.text),\n  }))\n}\n\nexport function scoreKnowledgeBaseIndex(\n  index: KnowledgeIndex,\n  options: KnowledgeBaseQualityOptions = {},\n): KnowledgeBaseQualityReport {\n  const validation = validateKnowledgeIndex(index, { strict: options.strict })\n  const lintFindings = lintKnowledgeIndex(index)\n  const now = options.now ?? new Date()\n  const staleSourceCount = index.sources.filter((source) => {\n    return source.validUntil ? Date.parse(source.validUntil) < now.getTime() : false\n  }).length\n  const sourceHashCounts = new Map<string, number>()\n  for (const source of index.sources) {\n    sourceHashCounts.set(source.contentHash, (sourceHashCounts.get(source.contentHash) ?? 0) + 1)\n  }\n  const duplicateSourceHashCount = [...sourceHashCounts.values()].filter(\n    (count) => count > 1,\n  ).length\n  const pagesWithInlineCitations = index.pages.filter(\n    (page) => sourceRefs(page.text).length > 0,\n  ).length\n  const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length\n  const metrics = {\n    page_count: index.pages.length,\n    source_count: index.sources.length,\n    citation_rate: index.pages.length === 0 ? 1 : pagesWithInlineCitations / index.pages.length,\n    source_backed_page_rate: index.pages.length === 0 ? 1 : pagesWithSources / index.pages.length,\n    stale_source_rate: index.sources.length === 0 ? 0 : staleSourceCount / index.sources.length,\n    duplicate_source_hash_rate:\n      index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,\n    lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,\n    lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,\n  }\n  const findings: RagGapFinding[] = []\n  if (metrics.lint_error_count > 0) {\n    findings.push({\n      id: 'kb:lint-errors',\n      kind: 'unknown',\n      severity: 'critical',\n      message: `${metrics.lint_error_count} validation error(s) in the knowledge index.`,\n      evidence: { lint_error_count: metrics.lint_error_count },\n    })\n  }\n  if (metrics.citation_rate < (options.minCitationRate ?? 0)) {\n    findings.push({\n      id: 'kb:citation-rate',\n      kind: 'missing-source',\n      severity: 'error',\n      message: 'Inline citation coverage is below the configured minimum.',\n      evidence: { citation_rate: metrics.citation_rate },\n    })\n  }\n  if (metrics.stale_source_rate > (options.maxStaleSourceRate ?? 1)) {\n    findings.push({\n      id: 'kb:stale-source-rate',\n      kind: 'stale-source',\n      severity: 'error',\n      message: 'Stale source rate exceeds the configured maximum.',\n      evidence: { stale_source_rate: metrics.stale_source_rate },\n    })\n  }\n  return { ok: findings.length === 0, metrics, findings }\n}\n\nfunction requiredContextTargets(scenario: RagAnswerEvalScenario): RagRequiredContext[] {\n  if (scenario.requiredContext?.length) return [...scenario.requiredContext]\n  return (scenario.expectedClaims ?? []).map((text) => ({ text }))\n}\n\nfunction requiredContextTexts(scenario: RagAnswerEvalScenario): string[] {\n  return requiredContextTargets(scenario).flatMap((target) => (target.text ? [target.text] : []))\n}\n\nfunction contextMatchesTarget(context: RagEvalContext, target: RagRequiredContext): boolean {\n  if (target.id && context.id === target.id) return true\n  if (target.pageId && context.pageId === target.pageId) return true\n  if (target.sourceId && context.sourceId === target.sourceId) return true\n  if (target.anchorId && context.anchorId === target.anchorId) return true\n  if (target.text && textSupportScore(target.text, context.text) >= 0.7) return true\n  return false\n}\n\nfunction contextIsRelevant(context: RagEvalContext, scenario: RagAnswerEvalScenario): boolean {\n  return contextRelevanceScore(context, scenario) >= 0.3\n}\n\nfunction contextRelevanceScore(context: RagEvalContext, scenario: RagAnswerEvalScenario): number {\n  const targets = [\n    scenario.query,\n    scenario.referenceAnswer,\n    ...(scenario.expectedClaims ?? []),\n    ...requiredContextTexts(scenario),\n  ].filter((value): value is string => Boolean(value?.trim()))\n  if (targets.length === 0) return 1\n  return Math.max(...targets.map((target) => textSupportScore(target, context.text)))\n}\n\nfunction claimSupport(\n  claim: string,\n  contexts: readonly RagEvalContext[],\n  options: Pick<RagAnswerQualityJudgeOptions, 'minClaimSupport'>,\n): boolean {\n  if (contexts.length === 0) return false\n  const combined = contexts.map((context) => context.text).join('\\n\\n')\n  const deterministic = groundClaimInText(claim, combined, {\n    minOverlap: options.minClaimSupport ?? 0.7,\n  })\n  return (\n    deterministic.grounded || textSupportScore(claim, combined) >= (options.minClaimSupport ?? 0.7)\n  )\n}\n\nfunction scoreCitations(\n  claims: readonly RagEvalClaim[],\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  options: Pick<RagAnswerQualityJudgeOptions, 'minClaimSupport'>,\n): { support: number; citedClaimCount: number; supportedCitationCount: number } {\n  if (claims.length === 0)\n    return { support: scenario.unanswerable ? 1 : 0, citedClaimCount: 0, supportedCitationCount: 0 }\n  const citations = artifact.citations ?? []\n  const citedClaims = claims.filter((claim) => citationsForClaim(claim, citations).length > 0)\n  if (citedClaims.length === 0) {\n    return {\n      support: scenario.requireCitations ? 0 : 1,\n      citedClaimCount: 0,\n      supportedCitationCount: 0,\n    }\n  }\n  let supportedCitationCount = 0\n  for (const claim of citedClaims) {\n    const citedContexts = contextsForClaim(claim, citations, artifact.contexts)\n    if (claimSupport(claim.text, citedContexts, options)) supportedCitationCount += 1\n  }\n  return {\n    support: supportedCitationCount / citedClaims.length,\n    citedClaimCount: citedClaims.length,\n    supportedCitationCount,\n  }\n}\n\nfunction citationsForClaim(\n  claim: RagEvalClaim,\n  citations: readonly RagEvalCitation[],\n): RagEvalCitation[] {\n  const claimCitationIds = new Set(claim.citationIds ?? [])\n  return citations.filter((citation) => {\n    return citation.claimId === claim.id || (citation.id && claimCitationIds.has(citation.id))\n  })\n}\n\nfunction contextsForClaim(\n  claim: RagEvalClaim,\n  citations: readonly RagEvalCitation[],\n  contexts: readonly RagEvalContext[],\n): readonly RagEvalContext[] {\n  const matchedCitations = citationsForClaim(claim, citations)\n  const matchedContexts = contexts.filter((context) =>\n    matchedCitations.some((citation) => {\n      if (citation.contextId && citation.contextId === context.id) return true\n      if (citation.pageId && citation.pageId === context.pageId) return true\n      if (citation.sourceId && citation.sourceId === context.sourceId) return true\n      if (citation.anchorId && citation.anchorId === context.anchorId) return true\n      return false\n    }),\n  )\n  return matchedContexts.length > 0 ? matchedContexts : contexts\n}\n\nfunction scoreAnswerRelevance(\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  abstained: boolean,\n): number {\n  if (scenario.unanswerable) return abstained ? 1 : 0\n  if (abstained) return 0\n  const targets = [\n    scenario.referenceAnswer,\n    ...(scenario.expectedClaims ?? []),\n    scenario.query,\n  ].filter((value): value is string => Boolean(value?.trim()))\n  return Math.max(...targets.map((target) => textSupportScore(target, artifact.answer)))\n}\n\nfunction scoreAnswerCorrectness(\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  abstained: boolean,\n): number {\n  if (scenario.unanswerable) return abstained ? 1 : 0\n  const expected = scenario.expectedClaims ?? []\n  const forbidden = scenario.forbiddenClaims ?? []\n  const expectedScore =\n    expected.length === 0\n      ? scoreAnswerRelevance(artifact, scenario, abstained)\n      : average(expected.map((claim) => textSupportScore(claim, artifact.answer)))\n  const forbiddenPenalty =\n    forbidden.length === 0\n      ? 0\n      : forbidden.filter((claim) => textSupportScore(claim, artifact.answer) >= 0.7).length /\n        forbidden.length\n  return clamp01(expectedScore * (1 - forbiddenPenalty))\n}\n\nfunction normalizeClaims(artifact: RagAnswerEvalArtifact): RagEvalClaim[] {\n  if (artifact.claims?.length) return [...artifact.claims]\n  return splitSentences(artifact.answer).map((text, index) => ({ id: `claim-${index + 1}`, text }))\n}\n\nfunction splitSentences(text: string): string[] {\n  return text\n    .split(/(?<=[.!?])\\s+/)\n    .map((sentence) => sentence.trim())\n    .filter((sentence) => sentence.length > 0 && !looksLikeAbstention(sentence))\n}\n\nfunction looksLikeAbstention(answer: string): boolean {\n  const normalized = answer.toLowerCase()\n  return [\n    \"i don't know\",\n    'i do not know',\n    'not enough information',\n    'cannot answer',\n    \"can't answer\",\n    'insufficient information',\n    'no reliable answer',\n  ].some((phrase) => normalized.includes(phrase))\n}\n\nfunction mergeMetrics(\n  deterministic: Record<RagEvalMetricKey, number>,\n  providerScores: Record<string, Record<RagEvalMetricKey, number>>,\n  policy: RagAnswerQualityJudgeOptions['externalScorePolicy'] = 'prefer-external',\n): Record<RagEvalMetricKey, number> {\n  if (policy === 'deterministic-first') return deterministic\n  const merged = { ...deterministic }\n  for (const scores of Object.values(providerScores)) {\n    for (const [key, value] of Object.entries(scores) as Array<[RagEvalMetricKey, number]>) {\n      merged[key] = value\n      if (key === 'groundedness') merged.faithfulness = value\n      if (key === 'faithfulness') merged.groundedness = value\n    }\n  }\n  return merged\n}\n\nfunction aggregateRagAnswerMetrics(\n  summaries: readonly RagAnswerMetricSummary[],\n): Record<string, number> {\n  const keys = new Set<RagEvalMetricKey>()\n  for (const summary of summaries) {\n    for (const key of Object.keys(summary.metrics) as RagEvalMetricKey[]) keys.add(key)\n  }\n  const out: Record<string, number> = {}\n  for (const key of [...keys].sort()) {\n    out[key] = average(summaries.map((summary) => summary.metrics[key]))\n  }\n  out.composite = average(summaries.map((summary) => summary.composite))\n  return out\n}\n\nfunction weightedComposite(\n  metrics: Record<RagEvalMetricKey, number>,\n  weights: Partial<Record<RagEvalMetricKey, number>>,\n): number {\n  let weighted = 0\n  let total = 0\n  for (const [key, weight] of Object.entries(weights) as Array<[RagEvalMetricKey, number]>) {\n    if (!Number.isFinite(weight) || weight <= 0) continue\n    const metric = metrics[key]\n    if (!Number.isFinite(metric)) continue\n    const value = key === 'unsupported_answer_rate' ? 1 - metric : metric\n    weighted += value * weight\n    total += weight\n  }\n  return total === 0 ? 0 : weighted / total\n}\n\nfunction normalizeMetricName(metric: string): string {\n  return metric\n    .trim()\n    .toLowerCase()\n    .replace(/[@/.-]+/g, '_')\n    .replace(/\\s+/g, '_')\n}\n\nfunction textSupportScore(needle: string, haystack: string): number {\n  const needleWords = contentWords(needle)\n  if (needleWords.length === 0) return 0\n  const haystackWords = new Set(contentWords(haystack))\n  const present = needleWords.filter((word) => haystackWords.has(word))\n  return present.length / needleWords.length\n}\n\nfunction contentWords(text: string): string[] {\n  const normalized = text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .split(/\\s+/)\n    .map((word) => stem(word.trim()))\n    .filter((word) => (word.length >= 3 || /^\\d+$/.test(word)) && !stopwords.has(word))\n  return [...new Set(normalized)]\n}\n\nfunction stem(word: string): string {\n  if (word.endsWith('ies') && word.length > 4) return `${word.slice(0, -3)}y`\n  if (word.endsWith('ing') && word.length > 5) return word.slice(0, -3)\n  if (word.endsWith('ed') && word.length > 4) return word.slice(0, -2)\n  if (word.endsWith('s') && word.length > 3) return word.slice(0, -1)\n  return word\n}\n\nfunction sourceRefs(text: string): string[] {\n  const refs: string[] = []\n  const regex = /\\[\\^([A-Za-z0-9_-]+)(?:#([A-Za-z0-9_.:-]+))?\\]/g\n  let match = regex.exec(text)\n  while (match !== null) {\n    refs.push(match[0])\n    match = regex.exec(text)\n  }\n  return refs\n}\n\nfunction below(metric: number, threshold: number | undefined): boolean {\n  return threshold !== undefined && metric < threshold\n}\n\nfunction neutralScore(condition: boolean): number {\n  return condition ? 1 : 0\n}\n\nfunction average(values: readonly number[]): number {\n  const finite = values.filter(Number.isFinite)\n  return finite.length === 0 ? 0 : finite.reduce((sum, value) => sum + value, 0) / finite.length\n}\n\nfunction clamp01(value: number): number {\n  if (!Number.isFinite(value)) return 0\n  return Math.max(0, Math.min(1, value))\n}\n\nconst stopwords = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'but',\n  'of',\n  'to',\n  'in',\n  'on',\n  'for',\n  'with',\n  'as',\n  'by',\n  'at',\n  'from',\n  'that',\n  'this',\n  'these',\n  'those',\n  'it',\n  'its',\n  'is',\n  'are',\n  'was',\n  'were',\n  'be',\n  'been',\n  'being',\n  'has',\n  'have',\n  'had',\n  'can',\n  'will',\n  'would',\n  'should',\n  'may',\n  'might',\n  'not',\n  'no',\n  'than',\n  'then',\n  'over',\n  'under',\n  'about',\n  'into',\n  'their',\n  'they',\n  'them',\n  'what',\n  'when',\n  'where',\n  'who',\n  'why',\n  'how',\n])\n","import {\n  blockingKnowledgeEval,\n  type ControlEvalResult,\n  type ControlRuntimeConfig,\n  objectiveEval,\n} from '@tangle-network/agent-eval'\nimport type {\n  BuildEvalKnowledgeBundleOptions,\n  EvalKnowledgeBundleBuildResult,\n  KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport { createKnowledgeEvent } from './events'\nimport { buildKnowledgeIndex } from './indexer'\nimport { lintKnowledgeIndex } from './lint'\nimport { type ApplyWriteBlocksResult, applyKnowledgeWriteBlocks } from './proposals'\nimport { readinessFor } from './readiness-helpers'\nimport {\n  type AddSourceOptions,\n  type AddSourceTextInput,\n  addSourcePath,\n  addSourceText,\n} from './sources'\nimport { initKnowledgeBase } from './store'\nimport type { KnowledgeEvent, KnowledgeIndex, KnowledgeLintFinding, SourceRecord } from './types'\nimport {\n  type ValidateKnowledgeOptions,\n  type ValidateKnowledgeResult,\n  validateKnowledgeIndex,\n} from './validate'\n\nexport interface KnowledgeResearchLoopContext {\n  root: string\n  goal: string\n  iteration: number\n  index: KnowledgeIndex\n  lintFindings: KnowledgeLintFinding[]\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  previousSteps: KnowledgeResearchLoopStep[]\n  signal?: AbortSignal\n}\n\nexport interface KnowledgeResearchLoopDecision {\n  /**\n   * Free-form notes from the researcher. Keep this human-readable; products can\n   * store it as the research transcript.\n   */\n  notes?: string\n  /**\n   * Local files to register as immutable sources before applying proposals.\n   */\n  sourcePaths?: string[]\n  /**\n   * Textual source artifacts discovered by an agent, browser worker, connector,\n   * or deep-research process.\n   */\n  sourceTexts?: AddSourceTextInput[]\n  /**\n   * Safe write protocol text. The loop parses and applies only accepted\n   * `---FILE: knowledge/...---` blocks.\n   */\n  proposalText?: string\n  /**\n   * The researcher decides when the wiki is good enough. The loop deliberately\n   * does not encode a domain-specific definition of \"done\".\n   */\n  done?: boolean\n  metadata?: Record<string, unknown>\n}\n\nexport interface KnowledgeResearchLoopStep {\n  iteration: number\n  notes?: string\n  addedSources: SourceRecord[]\n  applied?: ApplyWriteBlocksResult\n  lintFindings: KnowledgeLintFinding[]\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  event: KnowledgeEvent\n  done: boolean\n  metadata?: Record<string, unknown>\n}\n\nexport interface RunKnowledgeResearchLoopOptions {\n  root: string\n  goal: string\n  maxIterations?: number\n  actor?: string\n  strict?: ValidateKnowledgeOptions['strict']\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  sourceOptions?: Pick<AddSourceOptions, 'adapters' | 'now'>\n  signal?: AbortSignal\n  step(\n    context: KnowledgeResearchLoopContext,\n  ): Promise<KnowledgeResearchLoopDecision> | KnowledgeResearchLoopDecision\n  onStep?: (step: KnowledgeResearchLoopStep) => Promise<void> | void\n}\n\nexport interface KnowledgeResearchLoopResult {\n  root: string\n  goal: string\n  iterations: number\n  done: boolean\n  index: KnowledgeIndex\n  lintFindings: KnowledgeLintFinding[]\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  steps: KnowledgeResearchLoopStep[]\n}\n\nexport type KnowledgeControlLoopState = KnowledgeResearchLoopContext\nexport type KnowledgeControlLoopAction = KnowledgeResearchLoopDecision\nexport type KnowledgeControlLoopActionResult = KnowledgeResearchLoopStep\n\nexport interface KnowledgeControlLoopAdapterOptions {\n  root: string\n  goal: string\n  actor?: string\n  strict?: ValidateKnowledgeOptions['strict']\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  sourceOptions?: Pick<AddSourceOptions, 'adapters' | 'now'>\n}\n\nexport type KnowledgeControlLoopAdapter = Pick<\n  ControlRuntimeConfig<\n    KnowledgeControlLoopState,\n    KnowledgeControlLoopAction,\n    KnowledgeControlLoopActionResult,\n    ControlEvalResult\n  >,\n  'intent' | 'observe' | 'validate' | 'act' | 'shouldStop'\n>\n\n/**\n * Adapter for running knowledge growth through `agent-eval`'s generic control\n * runtime. The caller still owns `decide`: that can be a proposer agent,\n * reviewer agent, deterministic policy, or a composition of all three.\n */\nexport function createKnowledgeControlLoopAdapter(\n  options: KnowledgeControlLoopAdapterOptions,\n): KnowledgeControlLoopAdapter {\n  let initialized = false\n  const appliedSteps: KnowledgeResearchLoopStep[] = []\n\n  return {\n    intent: options.goal,\n    async observe({ history, abortSignal }) {\n      if (abortSignal.aborted) throw new Error('Knowledge control loop aborted')\n      if (!initialized) {\n        await initKnowledgeBase(options.root)\n        initialized = true\n      }\n      const index = await buildKnowledgeIndex(options.root)\n      const validation = validateKnowledgeIndex(index, { strict: options.strict })\n      const lintFindings = lintKnowledgeIndex(index)\n      const readiness = readinessFor(options, index)\n      return {\n        root: options.root,\n        goal: options.goal,\n        iteration: history.length + 1,\n        index,\n        lintFindings,\n        validation,\n        readiness,\n        previousSteps: [...appliedSteps],\n        signal: abortSignal,\n      }\n    },\n    validate({ state }) {\n      const errorFindings = state.validation.findings.filter(\n        (finding) => finding.severity === 'error',\n      )\n      const evals: ControlEvalResult[] = [\n        objectiveEval({\n          id: 'knowledge-valid',\n          passed: state.validation.ok,\n          severity: 'critical',\n          detail: state.validation.ok\n            ? 'Knowledge index is valid.'\n            : 'Knowledge index has validation errors.',\n          metadata: { findings: state.validation.findings },\n        }),\n        objectiveEval({\n          id: 'knowledge-lint-errors',\n          passed: errorFindings.length === 0,\n          severity: 'error',\n          detail:\n            errorFindings.length === 0\n              ? 'No lint errors.'\n              : `${errorFindings.length} lint error(s).`,\n          metadata: { findings: errorFindings },\n        }),\n      ]\n      if (state.readiness) evals.push(blockingKnowledgeEval(state.readiness.report))\n      return evals\n    },\n    shouldStop() {\n      return { stop: false, pass: false, reason: 'knowledge driver owns stop decisions' }\n    },\n    async act(action, ctx) {\n      const step = await applyKnowledgeResearchDecision(options, action, ctx.state.iteration)\n      appliedSteps.push(step)\n      return step\n    },\n  }\n}\n\nexport async function runKnowledgeResearchLoop(\n  options: RunKnowledgeResearchLoopOptions,\n): Promise<KnowledgeResearchLoopResult> {\n  const maxIterations = Math.max(1, options.maxIterations ?? 3)\n  await initKnowledgeBase(options.root)\n  const steps: KnowledgeResearchLoopStep[] = []\n  let index = await buildKnowledgeIndex(options.root)\n  let validation = validateKnowledgeIndex(index, { strict: options.strict })\n  let lintFindings = lintKnowledgeIndex(index)\n  let readiness = readinessFor(options, index)\n  let done = false\n\n  for (let iteration = 1; iteration <= maxIterations; iteration++) {\n    if (options.signal?.aborted) throw new Error('Knowledge research loop aborted')\n    const decision = await options.step({\n      root: options.root,\n      goal: options.goal,\n      iteration,\n      index,\n      lintFindings,\n      validation,\n      readiness,\n      previousSteps: steps,\n      signal: options.signal,\n    })\n\n    done = Boolean(decision.done)\n    const step = await applyKnowledgeResearchDecision(options, decision, iteration)\n    index = await buildKnowledgeIndex(options.root)\n    validation = step.validation\n    lintFindings = step.lintFindings\n    readiness = step.readiness\n    steps.push(step)\n    await options.onStep?.(step)\n\n    if (done) break\n    if (!step.applied && step.addedSources.length === 0) break\n  }\n\n  return {\n    root: options.root,\n    goal: options.goal,\n    iterations: steps.length,\n    done,\n    index,\n    lintFindings,\n    validation,\n    readiness,\n    steps,\n  }\n}\n\nasync function applyKnowledgeResearchDecision(\n  options: KnowledgeControlLoopAdapterOptions,\n  decision: KnowledgeResearchLoopDecision,\n  iteration = 1,\n): Promise<KnowledgeResearchLoopStep> {\n  const addedSources: SourceRecord[] = []\n  for (const sourcePath of decision.sourcePaths ?? []) {\n    addedSources.push(...(await addSourcePath(options.root, sourcePath, options.sourceOptions)))\n  }\n  for (const sourceText of decision.sourceTexts ?? []) {\n    addedSources.push(await addSourceText(options.root, sourceText, options.sourceOptions))\n  }\n\n  const applied = decision.proposalText\n    ? await applyKnowledgeWriteBlocks(options.root, decision.proposalText)\n    : undefined\n\n  const index = await buildKnowledgeIndex(options.root)\n  const validation = validateKnowledgeIndex(index, { strict: options.strict })\n  const lintFindings = lintKnowledgeIndex(index)\n  const readiness = readinessFor(options, index)\n  const done = Boolean(decision.done)\n  const event = createKnowledgeEvent({\n    type: 'research.iteration',\n    actor: options.actor,\n    target: options.root,\n    metadata: {\n      goal: options.goal,\n      iteration,\n      done,\n      addedSourceCount: addedSources.length,\n      written: applied?.written,\n      warningCount: applied?.warnings.length ?? 0,\n      errorCount: validation.findings.filter((finding) => finding.severity === 'error').length,\n    },\n  })\n\n  return {\n    iteration,\n    notes: decision.notes,\n    addedSources,\n    applied,\n    lintFindings,\n    validation,\n    readiness,\n    event,\n    done,\n    metadata: decision.metadata,\n  }\n}\n","import { stableId } from './ids'\nimport type { KnowledgeEvent, KnowledgeEventType } from './types'\n\nexport interface KnowledgeEventQuery {\n  type?: KnowledgeEventType\n  target?: string\n  limit?: number\n}\n\nexport function createKnowledgeEvent(input: {\n  type: KnowledgeEventType\n  actor?: string\n  target?: string\n  metadata?: Record<string, unknown>\n  now?: () => Date\n}): KnowledgeEvent {\n  const createdAt = (input.now ?? (() => new Date()))().toISOString()\n  return {\n    id: stableId(\n      'evt',\n      `${input.type}:${input.target ?? ''}:${createdAt}:${JSON.stringify(input.metadata ?? {})}`,\n    ),\n    type: input.type,\n    createdAt,\n    actor: input.actor,\n    target: input.target,\n    metadata: input.metadata,\n  }\n}\n","import {\n  acquisitionPlansForKnowledgeGaps,\n  type DataAcquisitionPlan,\n  type KnowledgeAcquisitionMode,\n  type KnowledgeBundle,\n  type KnowledgeFreshness,\n  type KnowledgeImportance,\n  type KnowledgeReadinessReport,\n  type KnowledgeRequirement,\n  type KnowledgeRequirementCategory,\n  type KnowledgeSensitivity,\n  scoreKnowledgeReadiness,\n  type UserQuestion,\n  userQuestionsForKnowledgeGaps,\n} from '@tangle-network/agent-eval'\nimport { stringMetadata } from './metadata'\nimport { searchKnowledge } from './search'\nimport type { KnowledgeIndex, KnowledgeSearchResult } from './types'\n\nexport interface KnowledgeReadinessSpec {\n  id: string\n  description: string\n  query: string\n  requiredFor: string[]\n  category: KnowledgeRequirementCategory\n  acquisitionMode: KnowledgeAcquisitionMode\n  importance: KnowledgeImportance\n  freshness: KnowledgeFreshness\n  sensitivity: KnowledgeSensitivity\n  confidenceNeeded: number\n  fallbackPolicy?: KnowledgeRequirement['fallbackPolicy']\n  minSources?: number\n  minHits?: number\n  metadata?: Record<string, unknown>\n}\n\n/**\n * Defaults applied by `defineReadinessSpec` when the caller omits the field.\n *\n * These are deliberately conservative: a domain-specific topic that an agent\n * needs grounded to a high-confidence threshold from at least one authoritative\n * source. Override any field to specialise (e.g. `freshness: 'daily'` for a\n * topic that must reflect today's regulatory state).\n */\nexport const READINESS_SPEC_DEFAULTS = {\n  category: 'domain_specific',\n  acquisitionMode: 'search_web',\n  importance: 'high',\n  freshness: 'monthly',\n  sensitivity: 'public',\n  confidenceNeeded: 0.7,\n  minSources: 1,\n  minHits: 2,\n} as const satisfies Pick<\n  KnowledgeReadinessSpec,\n  | 'category'\n  | 'acquisitionMode'\n  | 'importance'\n  | 'freshness'\n  | 'sensitivity'\n  | 'confidenceNeeded'\n  | 'minSources'\n  | 'minHits'\n>\n\n/**\n * Inputs accepted by `defineReadinessSpec`. The four fields the caller cannot\n * sanely default (id, description, query, requiredFor) are required; everything\n * else is optional and pulls from `READINESS_SPEC_DEFAULTS`.\n */\nexport type DefineReadinessSpecInput = Pick<\n  KnowledgeReadinessSpec,\n  'id' | 'description' | 'query' | 'requiredFor'\n> &\n  Partial<Omit<KnowledgeReadinessSpec, 'id' | 'description' | 'query' | 'requiredFor'>>\n\n/**\n * Builder that returns a fully-typed `KnowledgeReadinessSpec` from a slim input.\n *\n * Motivation: `KnowledgeReadinessSpec` has eleven required fields. Most of them\n * (category, acquisition mode, importance, freshness, sensitivity, confidence\n * threshold, source/hit minima) have a clear default for domain-specific KB\n * topics — agents end up copy-pasting the same boilerplate across every spec.\n * This helper collapses that boilerplate while keeping every field overridable.\n *\n * @example\n * defineReadinessSpec({\n *   id: 'coop/intent-grounding',\n *   description: 'Required grounding for coop pack intent stage',\n *   query: 'flock size space ventilation predator',\n *   requiredFor: ['IntentIntakeAgent', 'requirements'],\n * })\n *\n * @example  // override defaults where the topic demands it\n * defineReadinessSpec({\n *   id: 'medical/dosing',\n *   description: 'Dosing guidance for compounding pharmacy',\n *   query: 'compounding dose schedule',\n *   requiredFor: ['DosingAgent'],\n *   importance: 'blocking',\n *   freshness: 'daily',\n *   sensitivity: 'private',\n *   confidenceNeeded: 0.95,\n *   minSources: 3,\n * })\n */\nexport function defineReadinessSpec(input: DefineReadinessSpecInput): KnowledgeReadinessSpec {\n  return {\n    ...READINESS_SPEC_DEFAULTS,\n    ...input,\n  }\n}\n\nexport interface BuildEvalKnowledgeBundleOptions {\n  taskId: string\n  index: KnowledgeIndex\n  specs: KnowledgeReadinessSpec[]\n  userAnswers?: Record<string, string>\n  searchLimit?: number\n  metadata?: Record<string, unknown>\n  now?: Date\n}\n\nexport interface EvalKnowledgeBundleBuildResult {\n  bundle: KnowledgeBundle\n  report: KnowledgeReadinessReport\n  requirements: KnowledgeRequirement[]\n  searchResultsByRequirement: Record<string, KnowledgeSearchResult[]>\n  questions: UserQuestion[]\n  acquisitionPlans: DataAcquisitionPlan[]\n}\n\nexport function buildEvalKnowledgeBundle(\n  options: BuildEvalKnowledgeBundleOptions,\n): EvalKnowledgeBundleBuildResult {\n  const searchLimit = options.searchLimit ?? 5\n  const now = options.now ?? new Date()\n  const searchResultsByRequirement: Record<string, KnowledgeSearchResult[]> = {}\n  const requirements = options.specs.map((spec) => {\n    const results = searchKnowledge(options.index, spec.query, searchLimit)\n    searchResultsByRequirement[spec.id] = results\n    return requirementFromSearch(options.index, spec, results, now)\n  })\n  const report = scoreKnowledgeReadiness({\n    taskId: options.taskId,\n    requirements,\n    userAnswers: options.userAnswers,\n    evidenceIds: requirements.flatMap((requirement) => requirement.evidenceIds),\n    claimIds: [],\n    wikiPageIds: unique(\n      requirements.flatMap((requirement) =>\n        pageIdsFromResults(searchResultsByRequirement[requirement.id] ?? []),\n      ),\n    ),\n    metadata: options.metadata,\n  })\n  const questions = userQuestionsForKnowledgeGaps(report.blockingMissingRequirements)\n  const acquisitionPlans = acquisitionPlansForKnowledgeGaps([\n    ...report.blockingMissingRequirements,\n    ...report.nonBlockingGaps,\n  ])\n\n  return {\n    bundle: report.bundle,\n    report,\n    requirements,\n    searchResultsByRequirement,\n    questions,\n    acquisitionPlans,\n  }\n}\n\nfunction requirementFromSearch(\n  index: KnowledgeIndex,\n  spec: KnowledgeReadinessSpec,\n  results: KnowledgeSearchResult[],\n  now: Date,\n): KnowledgeRequirement {\n  const hitCount = results.length\n  const sourceIds = unique(results.flatMap((result) => result.page.sourceIds))\n  const sources = index.sources.filter((source) => sourceIds.includes(source.id))\n  const bestScore = results[0]?.normalizedScore ?? 0\n  const sourceCoverage = spec.minSources\n    ? Math.min(1, sourceIds.length / spec.minSources)\n    : sourceIds.length > 0\n      ? 1\n      : 0\n  const hitCoverage = spec.minHits ? Math.min(1, hitCount / spec.minHits) : hitCount > 0 ? 1 : 0\n  const freshness = sourceFreshness(sources, now)\n  const currentConfidence = round(Math.min(bestScore, sourceCoverage, hitCoverage, freshness.score))\n\n  return {\n    id: spec.id,\n    description: spec.description,\n    requiredFor: spec.requiredFor,\n    category: spec.category,\n    acquisitionMode: spec.acquisitionMode,\n    importance: spec.importance,\n    freshness: spec.freshness,\n    sensitivity: spec.sensitivity,\n    confidenceNeeded: spec.confidenceNeeded,\n    currentConfidence,\n    evidenceIds: unique([\n      ...sourceIds.map((sourceId) => `source:${sourceId}`),\n      ...results.map((result) => `page:${result.page.id}`),\n    ]),\n    fallbackPolicy:\n      spec.fallbackPolicy ?? (spec.importance === 'blocking' ? 'block' : 'continue_with_caveat'),\n    metadata: {\n      ...spec.metadata,\n      query: spec.query,\n      hitCount,\n      sourceCount: sourceIds.length,\n      bestNormalizedScore: bestScore,\n      expiredSourceIds: freshness.expiredSourceIds,\n      freshnessScore: freshness.score,\n      validUntil: freshness.validUntil,\n      lastVerifiedAt: freshness.lastVerifiedAt,\n    },\n  }\n}\n\nfunction sourceFreshness(\n  sources: KnowledgeIndex['sources'],\n  now: Date,\n): { score: number; validUntil?: string; lastVerifiedAt?: string; expiredSourceIds: string[] } {\n  if (sources.length === 0) return { score: 0, expiredSourceIds: [] }\n  const validUntilValues = sources\n    .map(\n      (source) =>\n        source.validUntil ??\n        stringMetadata(source.metadata, 'validUntil') ??\n        stringMetadata(source.metadata, 'expiresAt'),\n    )\n    .filter(isIsoDate)\n  const lastVerifiedValues = sources\n    .map((source) => source.lastVerifiedAt ?? stringMetadata(source.metadata, 'lastVerifiedAt'))\n    .filter(isIsoDate)\n  const expiredSourceIds = sources\n    .filter((source) => {\n      const validUntil =\n        source.validUntil ??\n        stringMetadata(source.metadata, 'validUntil') ??\n        stringMetadata(source.metadata, 'expiresAt')\n      return validUntil ? Date.parse(validUntil) <= now.getTime() : false\n    })\n    .map((source) => source.id)\n  return {\n    score: expiredSourceIds.length > 0 ? 0 : 1,\n    validUntil: earliestIso(validUntilValues),\n    lastVerifiedAt: latestIso(lastVerifiedValues),\n    expiredSourceIds,\n  }\n}\n\nfunction isIsoDate(value: string | undefined): value is string {\n  return Boolean(value && Number.isFinite(Date.parse(value)))\n}\n\nfunction earliestIso(values: string[]): string | undefined {\n  return values.sort((a, b) => Date.parse(a) - Date.parse(b))[0]\n}\n\nfunction latestIso(values: string[]): string | undefined {\n  return values.sort((a, b) => Date.parse(b) - Date.parse(a))[0]\n}\n\nfunction pageIdsFromResults(results: KnowledgeSearchResult[]): string[] {\n  return results.map((result) => result.page.id)\n}\n\nfunction unique<T>(items: T[]): T[] {\n  return [...new Set(items)]\n}\n\nfunction round(value: number): number {\n  return Math.round(value * 1000) / 1000\n}\n","import {\n  type BuildEvalKnowledgeBundleOptions,\n  buildEvalKnowledgeBundle,\n  type EvalKnowledgeBundleBuildResult,\n  type KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport type { KnowledgeIndex } from './types'\n\n/**\n * The subset of a research-loop options object the readiness gate needs:\n * the goal (default task id), the readiness specs, an optional task-id\n * override, and the rest of the bundle options minus the fields this helper\n * supplies (`taskId`/`index`/`specs`).\n *\n * Both the single-agent (`research-loop`) and two-agent (`two-agent-research-loop`)\n * options shapes satisfy this structurally, so the gate is single-sourced.\n */\nexport interface ReadinessGateOptions {\n  goal: string\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n}\n\n/**\n * Build the readiness bundle for a loop run over the given index, or\n * `undefined` when no readiness specs are configured (no gate to report).\n */\nexport function readinessFor(\n  options: ReadinessGateOptions,\n  index: KnowledgeIndex,\n): EvalKnowledgeBundleBuildResult | undefined {\n  if (!options.readinessSpecs?.length) return undefined\n  return buildEvalKnowledgeBundle({\n    ...(options.readiness ?? {}),\n    taskId: options.readinessTaskId ?? options.goal,\n    index,\n    specs: options.readinessSpecs,\n  })\n}\n","import type { JsonValue } from '@tangle-network/agent-eval/campaign'\nimport {\n  type KnowledgeResearchLoopDecision,\n  type KnowledgeResearchLoopResult,\n  type RunKnowledgeResearchLoopOptions,\n  runKnowledgeResearchLoop,\n} from './research-loop'\nimport {\n  type RunRetrievalImprovementLoopOptions,\n  type RunRetrievalImprovementLoopResult,\n  runRetrievalImprovementLoop,\n} from './retrieval-eval'\n\nexport type RagKnowledgeImprovementPhase =\n  | 'retrieval-tuning'\n  | 'gap-diagnosis'\n  | 'knowledge-acquisition'\n  | 'knowledge-update'\n  | 'answer-quality'\n  | 'promotion'\n\nexport type RagKnowledgeImprovementPhaseStatus = 'completed' | 'skipped' | 'failed'\n\nexport type RagGapKind =\n  | 'missing-source'\n  | 'stale-source'\n  | 'retrieval-miss'\n  | 'retrieval-noise'\n  | 'chunking-mismatch'\n  | 'missing-multihop-evidence'\n  | 'generator-unsupported-claim'\n  | 'citation-mismatch'\n  | 'incorrect-abstention'\n  | 'unknown'\n\nexport type RagGapSeverity = 'info' | 'warning' | 'error' | 'critical'\n\nexport interface RagGapFinding {\n  id: string\n  kind: RagGapKind\n  severity: RagGapSeverity\n  message: string\n  scenarioId?: string\n  evidence?: Record<string, JsonValue>\n}\n\nexport interface RagKnowledgeImprovementPhaseResult {\n  phase: RagKnowledgeImprovementPhase\n  status: RagKnowledgeImprovementPhaseStatus\n  summary: string\n  startedAt: string\n  finishedAt: string\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagPhaseInputBase {\n  goal: string\n  phases: readonly RagKnowledgeImprovementPhaseResult[]\n  signal?: AbortSignal\n}\n\nexport interface RagDiagnosisInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n}\n\nexport interface RagKnowledgeAcquisitionInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n}\n\nexport interface RagKnowledgeUpdateInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n}\n\nexport interface RagKnowledgeUpdateResult {\n  applied: boolean\n  summary: string\n  research?: KnowledgeResearchLoopResult\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagAnswerQualityInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n  knowledgeUpdate?: RagKnowledgeUpdateResult\n}\n\nexport interface RagAnswerQualityResult {\n  passed: boolean\n  metrics: Record<string, number>\n  findings?: readonly RagGapFinding[]\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagPromotionInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n  knowledgeUpdate?: RagKnowledgeUpdateResult\n  answerQuality?: RagAnswerQualityResult\n}\n\nexport interface RagPromotionResult {\n  promoted: boolean\n  reason: string\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagKnowledgeResearchOptions\n  extends Omit<RunKnowledgeResearchLoopOptions, 'goal' | 'signal' | 'step'> {\n  goal?: string\n  step?: RunKnowledgeResearchLoopOptions['step']\n}\n\nexport interface RunRagKnowledgeImprovementLoopOptions {\n  goal: string\n  retrieval?: RunRetrievalImprovementLoopOptions\n  diagnose?: (input: RagDiagnosisInput) => MaybePromise<readonly RagGapFinding[]>\n  acquireKnowledge?: (\n    input: RagKnowledgeAcquisitionInput,\n  ) => MaybePromise<KnowledgeResearchLoopDecision>\n  knowledgeResearch?: RagKnowledgeResearchOptions\n  updateKnowledge?: (input: RagKnowledgeUpdateInput) => MaybePromise<RagKnowledgeUpdateResult>\n  evaluateAnswers?: (input: RagAnswerQualityInput) => MaybePromise<RagAnswerQualityResult>\n  promote?: (input: RagPromotionInput) => MaybePromise<RagPromotionResult>\n  enabledPhases?: readonly RagKnowledgeImprovementPhase[]\n  requiredPhases?: readonly RagKnowledgeImprovementPhase[]\n  signal?: AbortSignal\n  now?: () => Date\n}\n\nexport interface RunRagKnowledgeImprovementLoopResult {\n  goal: string\n  phases: readonly RagKnowledgeImprovementPhaseResult[]\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n  knowledgeUpdate?: RagKnowledgeUpdateResult\n  answerQuality?: RagAnswerQualityResult\n  promotion?: RagPromotionResult\n}\n\ntype MaybePromise<T> = T | Promise<T>\n\nexport async function runRagKnowledgeImprovementLoop(\n  options: RunRagKnowledgeImprovementLoopOptions,\n): Promise<RunRagKnowledgeImprovementLoopResult> {\n  assertConfiguredRequiredPhases(options)\n  const now = options.now ?? (() => new Date())\n  const phases: RagKnowledgeImprovementPhaseResult[] = []\n  let retrieval: RunRetrievalImprovementLoopResult | undefined\n  let findings: RagGapFinding[] = []\n  let acquisition: KnowledgeResearchLoopDecision | undefined\n  let knowledgeUpdate: RagKnowledgeUpdateResult | undefined\n  let answerQuality: RagAnswerQualityResult | undefined\n  let promotion: RagPromotionResult | undefined\n\n  if (phaseEnabled(options, 'retrieval-tuning')) {\n    if (options.retrieval) {\n      retrieval = await runPhase(\n        phases,\n        now,\n        'retrieval-tuning',\n        async () => {\n          assertNotAborted(options.signal)\n          return runRetrievalImprovementLoop(options.retrieval!)\n        },\n        summarizeRetrievalResult,\n      )\n    } else {\n      skipPhase(phases, now, 'retrieval-tuning', 'no retrieval options provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'gap-diagnosis')) {\n    if (options.diagnose) {\n      findings = [\n        ...(await runPhase(\n          phases,\n          now,\n          'gap-diagnosis',\n          async () => {\n            assertNotAborted(options.signal)\n            return options.diagnose!({\n              goal: options.goal,\n              phases,\n              signal: options.signal,\n              retrieval,\n            })\n          },\n          (diagnosed) => `${diagnosed.length} finding(s)`,\n        )),\n      ]\n    } else {\n      skipPhase(phases, now, 'gap-diagnosis', 'no diagnosis hook provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'knowledge-acquisition')) {\n    if (options.acquireKnowledge) {\n      acquisition = await runPhase(\n        phases,\n        now,\n        'knowledge-acquisition',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.acquireKnowledge!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n          })\n        },\n        summarizeAcquisitionDecision,\n      )\n    } else {\n      skipPhase(phases, now, 'knowledge-acquisition', 'no acquisition hook provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'knowledge-update')) {\n    if (options.updateKnowledge) {\n      knowledgeUpdate = await runPhase(\n        phases,\n        now,\n        'knowledge-update',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.updateKnowledge!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n            acquisition,\n          })\n        },\n        (result) => result.summary,\n      )\n    } else if (options.knowledgeResearch) {\n      knowledgeUpdate = await runPhase(\n        phases,\n        now,\n        'knowledge-update',\n        async () => {\n          assertNotAborted(options.signal)\n          return runKnowledgeResearchUpdate(options, acquisition)\n        },\n        (result) => result.summary,\n      )\n    } else {\n      skipPhase(phases, now, 'knowledge-update', 'no update hook or research loop provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'answer-quality')) {\n    if (options.evaluateAnswers) {\n      answerQuality = await runPhase(\n        phases,\n        now,\n        'answer-quality',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.evaluateAnswers!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n            acquisition,\n            knowledgeUpdate,\n          })\n        },\n        summarizeAnswerQuality,\n      )\n      findings = [...findings, ...(answerQuality.findings ?? [])]\n    } else {\n      skipPhase(phases, now, 'answer-quality', 'no answer-quality hook provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'promotion')) {\n    if (options.promote) {\n      promotion = await runPhase(\n        phases,\n        now,\n        'promotion',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.promote!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n            acquisition,\n            knowledgeUpdate,\n            answerQuality,\n          })\n        },\n        (result) => `${result.promoted ? 'promoted' : 'held'}: ${result.reason}`,\n      )\n    } else {\n      skipPhase(phases, now, 'promotion', 'no promotion hook provided')\n    }\n  }\n\n  return {\n    goal: options.goal,\n    phases,\n    retrieval,\n    findings,\n    acquisition,\n    knowledgeUpdate,\n    answerQuality,\n    promotion,\n  }\n}\n\nasync function runKnowledgeResearchUpdate(\n  options: RunRagKnowledgeImprovementLoopOptions,\n  acquisition: KnowledgeResearchLoopDecision | undefined,\n): Promise<RagKnowledgeUpdateResult> {\n  const research = options.knowledgeResearch\n  if (!research) {\n    throw new Error('knowledgeResearch options are required to run the knowledge update phase')\n  }\n  const { goal, step, ...rest } = research\n  const researchStep = step ?? acquisitionBackedResearchStep(acquisition)\n  const maxIterations = step ? rest.maxIterations : 1\n  const result = await runKnowledgeResearchLoop({\n    ...rest,\n    goal: goal ?? options.goal,\n    maxIterations,\n    signal: options.signal,\n    step: researchStep,\n  })\n  return {\n    applied: result.steps.some((stepResult) => {\n      return stepResult.addedSources.length > 0 || Boolean(stepResult.applied)\n    }),\n    summary: `${result.iterations} research iteration(s); done=${String(result.done)}`,\n    research: result,\n  }\n}\n\nfunction acquisitionBackedResearchStep(\n  acquisition: KnowledgeResearchLoopDecision | undefined,\n): RunKnowledgeResearchLoopOptions['step'] {\n  if (!acquisition) {\n    throw new Error(\n      'knowledgeResearch requires either a step hook or a knowledge-acquisition result to apply',\n    )\n  }\n  return () => ({ ...acquisition, done: acquisition.done ?? true })\n}\n\nasync function runPhase<T>(\n  phases: RagKnowledgeImprovementPhaseResult[],\n  now: () => Date,\n  phase: RagKnowledgeImprovementPhase,\n  action: () => MaybePromise<T>,\n  summarize: (result: T) => string,\n): Promise<T> {\n  const startedAt = now().toISOString()\n  try {\n    const result = await action()\n    phases.push({\n      phase,\n      status: 'completed',\n      summary: summarize(result),\n      startedAt,\n      finishedAt: now().toISOString(),\n    })\n    return result\n  } catch (error) {\n    phases.push({\n      phase,\n      status: 'failed',\n      summary: (error as Error).message,\n      startedAt,\n      finishedAt: now().toISOString(),\n    })\n    throw error\n  }\n}\n\nfunction skipPhase(\n  phases: RagKnowledgeImprovementPhaseResult[],\n  now: () => Date,\n  phase: RagKnowledgeImprovementPhase,\n  summary: string,\n): void {\n  const timestamp = now().toISOString()\n  phases.push({ phase, status: 'skipped', summary, startedAt: timestamp, finishedAt: timestamp })\n}\n\nfunction summarizeRetrievalResult(result: RunRetrievalImprovementLoopResult): string {\n  return `${result.candidates.length} candidate(s); winner=${JSON.stringify(result.winnerConfig)}`\n}\n\nfunction summarizeAcquisitionDecision(decision: KnowledgeResearchLoopDecision): string {\n  const sourcePathCount = decision.sourcePaths?.length ?? 0\n  const sourceTextCount = decision.sourceTexts?.length ?? 0\n  const proposal = decision.proposalText ? 'proposal' : 'no proposal'\n  return `${sourcePathCount} path source(s), ${sourceTextCount} text source(s), ${proposal}`\n}\n\nfunction summarizeAnswerQuality(result: RagAnswerQualityResult): string {\n  const metrics = Object.entries(result.metrics)\n    .sort(([a], [b]) => a.localeCompare(b))\n    .map(([key, value]) => `${key}=${formatMetric(value)}`)\n    .join(', ')\n  return `${result.passed ? 'passed' : 'failed'}${metrics ? `; ${metrics}` : ''}`\n}\n\nfunction formatMetric(value: number): string {\n  return Number.isFinite(value) ? value.toFixed(3) : String(value)\n}\n\nfunction phaseEnabled(\n  options: RunRagKnowledgeImprovementLoopOptions,\n  phase: RagKnowledgeImprovementPhase,\n): boolean {\n  return !options.enabledPhases || options.enabledPhases.includes(phase)\n}\n\nfunction assertConfiguredRequiredPhases(options: RunRagKnowledgeImprovementLoopOptions): void {\n  for (const phase of options.requiredPhases ?? []) {\n    if (!phaseEnabled(options, phase)) {\n      throw new Error(`required phase ${phase} is not enabled`)\n    }\n    if (!phaseConfigured(options, phase)) {\n      throw new Error(requiredPhaseMessage(phase))\n    }\n  }\n}\n\nfunction phaseConfigured(\n  options: RunRagKnowledgeImprovementLoopOptions,\n  phase: RagKnowledgeImprovementPhase,\n): boolean {\n  switch (phase) {\n    case 'retrieval-tuning':\n      return Boolean(options.retrieval)\n    case 'gap-diagnosis':\n      return Boolean(options.diagnose)\n    case 'knowledge-acquisition':\n      return Boolean(options.acquireKnowledge)\n    case 'knowledge-update':\n      return Boolean(options.updateKnowledge ?? options.knowledgeResearch)\n    case 'answer-quality':\n      return Boolean(options.evaluateAnswers)\n    case 'promotion':\n      return Boolean(options.promote)\n  }\n}\n\nfunction requiredPhaseMessage(phase: RagKnowledgeImprovementPhase): string {\n  switch (phase) {\n    case 'retrieval-tuning':\n      return 'required phase retrieval-tuning requires retrieval options'\n    case 'gap-diagnosis':\n      return 'required phase gap-diagnosis requires a diagnose hook'\n    case 'knowledge-acquisition':\n      return 'required phase knowledge-acquisition requires an acquireKnowledge hook'\n    case 'knowledge-update':\n      return 'required phase knowledge-update requires updateKnowledge or knowledgeResearch'\n    case 'answer-quality':\n      return 'required phase answer-quality requires an evaluateAnswers hook'\n    case 'promotion':\n      return 'required phase promotion requires a promote hook'\n  }\n}\n\nfunction assertNotAborted(signal: AbortSignal | undefined): void {\n  if (signal?.aborted) {\n    throw new Error('RAG knowledge improvement loop aborted')\n  }\n}\n","import type { KnowledgeFragment } from './sources/types'\n\n/**\n * Change detection across snapshots of one source's fragments.\n *\n * The output drives the continuous-ingestion loop: each `KnowledgeChange`\n * carries the eval dimensions affected (`affectedDimensions`), which an\n * agent-eval campaign scheduler consumes to decide which campaigns to\n * re-run. Three change kinds:\n *\n *   - `added` — fragment id appears in `next` but not `prev`.\n *   - `removed` — fragment id appears in `prev` but not `next`. Typical\n *     trigger: an authority retires a Wex slug, or a state SOS reorganises\n *     its forms catalogue.\n *   - `modified` — fragment id appears in both, body hash differs. This\n *     is the dominant change kind in practice — the Ryan-LLC v. FTC\n *     vacatur case manifests as a `modified` on the Wex non-compete\n *     fragment, NOT as a removed one.\n *\n * Unverifiable fragments are filtered out before diffing — comparing a\n * captcha-blocked snapshot against a real one would falsely fire every\n * fragment as removed. The caller can inspect the raw lists if they want\n * to surface block-page failures.\n *\n * Within-snapshot duplicate ids are an upstream bug; this function picks\n * the LAST one and emits a diagnostic via the `warnings` field.\n *\n * @stable\n */\n\nexport type KnowledgeChangeKind = 'added' | 'removed' | 'modified'\n\nexport interface KnowledgeChange {\n  /** Source-scoped id (matches `KnowledgeFragment.id`). */\n  fragmentId: string\n  kind: KnowledgeChangeKind\n  /**\n   * For `added`: full body of the new fragment.\n   * For `removed`: full body of the prior fragment.\n   * For `modified`: unified-diff-style payload `{ before, after }` body strings.\n   */\n  diff?: { before?: string; after?: string }\n  /**\n   * Eval dimensions to re-score. Computed as the union of both fragments'\n   * `dimensionHints`. The eval cron treats this as a set of campaign tags.\n   */\n  affectedDimensions: string[]\n  /** URL of the affected authority page (from whichever side has it). */\n  url?: string\n  /**\n   * Source-attested change time. For `modified`, takes the NEXT fragment's\n   * `sourceUpdatedAt`. For `removed`, takes the PRIOR fragment's\n   * `sourceUpdatedAt`. For `added`, takes the NEXT fragment's\n   * `sourceUpdatedAt`. Consumers index changes by this date.\n   */\n  detectedAt: string\n}\n\nexport interface DetectChangesResult {\n  changes: KnowledgeChange[]\n  /** Counts by kind — handy for dashboards. */\n  summary: { added: number; removed: number; modified: number }\n  /** Non-fatal diagnostics (duplicate ids, dropped unverifiable fragments). */\n  warnings: string[]\n}\n\nexport interface DetectChangesOptions {\n  /**\n   * When true (default), unverifiable fragments are dropped from both\n   * sides before comparison. Set false ONLY when debugging block-page\n   * issues — comparing against unverifiable content emits false\n   * `removed`/`modified` changes.\n   */\n  skipUnverifiable?: boolean\n  /**\n   * When provided, only changes whose `affectedDimensions` intersect this\n   * set are returned. Useful for cron loops that schedule per-dimension\n   * eval campaigns and only care about a subset.\n   */\n  filterDimensions?: string[]\n}\n\nexport function detectChanges(\n  prev: KnowledgeFragment[],\n  next: KnowledgeFragment[],\n  options: DetectChangesOptions = {},\n): DetectChangesResult {\n  const skipUnverifiable = options.skipUnverifiable ?? true\n  const warnings: string[] = []\n\n  const { map: prevMap, warnings: prevWarn } = indexFragments(prev, skipUnverifiable, 'prev')\n  const { map: nextMap, warnings: nextWarn } = indexFragments(next, skipUnverifiable, 'next')\n  warnings.push(...prevWarn, ...nextWarn)\n\n  const changes: KnowledgeChange[] = []\n  const seen = new Set<string>()\n\n  for (const [id, nextFragment] of nextMap) {\n    seen.add(id)\n    const prevFragment = prevMap.get(id)\n    if (!prevFragment) {\n      changes.push({\n        fragmentId: id,\n        kind: 'added',\n        diff: { after: nextFragment.body },\n        affectedDimensions: dedup(nextFragment.dimensionHints),\n        url: nextFragment.provenance.url,\n        detectedAt: nextFragment.provenance.sourceUpdatedAt,\n      })\n      continue\n    }\n    if (prevFragment.bodyHash !== nextFragment.bodyHash) {\n      changes.push({\n        fragmentId: id,\n        kind: 'modified',\n        diff: { before: prevFragment.body, after: nextFragment.body },\n        affectedDimensions: dedup([...prevFragment.dimensionHints, ...nextFragment.dimensionHints]),\n        url: nextFragment.provenance.url,\n        detectedAt: nextFragment.provenance.sourceUpdatedAt,\n      })\n    }\n  }\n\n  for (const [id, prevFragment] of prevMap) {\n    if (seen.has(id)) continue\n    changes.push({\n      fragmentId: id,\n      kind: 'removed',\n      diff: { before: prevFragment.body },\n      affectedDimensions: dedup(prevFragment.dimensionHints),\n      url: prevFragment.provenance.url,\n      detectedAt: prevFragment.provenance.sourceUpdatedAt,\n    })\n  }\n\n  const filtered = options.filterDimensions\n    ? changes.filter((c) => c.affectedDimensions.some((d) => options.filterDimensions?.includes(d)))\n    : changes\n\n  return {\n    changes: filtered,\n    summary: {\n      added: filtered.filter((c) => c.kind === 'added').length,\n      removed: filtered.filter((c) => c.kind === 'removed').length,\n      modified: filtered.filter((c) => c.kind === 'modified').length,\n    },\n    warnings,\n  }\n}\n\nfunction indexFragments(\n  fragments: KnowledgeFragment[],\n  skipUnverifiable: boolean,\n  side: string,\n): { map: Map<string, KnowledgeFragment>; warnings: string[] } {\n  const map = new Map<string, KnowledgeFragment>()\n  const warnings: string[] = []\n  let dropped = 0\n  for (const fragment of fragments) {\n    if (skipUnverifiable && !fragment.provenance.verifiable) {\n      dropped += 1\n      continue\n    }\n    if (map.has(fragment.id)) {\n      warnings.push(`${side}: duplicate fragment id ${fragment.id} — keeping last`)\n    }\n    map.set(fragment.id, fragment)\n  }\n  if (dropped > 0) {\n    warnings.push(`${side}: dropped ${dropped} unverifiable fragment(s) before diff`)\n  }\n  return { map, warnings }\n}\n\nfunction dedup<T>(items: T[]): T[] {\n  return [...new Set(items)]\n}\n","export interface ChunkingOptions {\n  targetChars: number\n  maxChars: number\n  minChars: number\n  overlapChars: number\n}\n\nexport interface KnowledgeChunk {\n  index: number\n  text: string\n  headingPath: string\n  charStart: number\n  charEnd: number\n  oversized: boolean\n}\n\nconst DEFAULT_OPTIONS: ChunkingOptions = {\n  targetChars: 1000,\n  maxChars: 1500,\n  minChars: 160,\n  overlapChars: 180,\n}\n\nexport function chunkMarkdown(\n  content: string,\n  options?: Partial<ChunkingOptions>,\n): KnowledgeChunk[] {\n  const opts = normalizeOptions({ ...DEFAULT_OPTIONS, ...(options ?? {}) })\n  const { body, bodyOffset } = stripFrontmatter(content)\n  if (body.trim() === '') return []\n\n  const sections = splitSections(body, bodyOffset)\n  const chunks: KnowledgeChunk[] = []\n  for (const section of sections) {\n    for (const part of chunkText(section.text, opts)) {\n      const start = section.start + part.start\n      chunks.push({\n        index: chunks.length,\n        text: part.text,\n        headingPath: section.headingPath,\n        charStart: start,\n        charEnd: start + part.text.length,\n        oversized: part.text.length > opts.maxChars,\n      })\n    }\n  }\n  return chunks\n}\n\nexport function stripFrontmatter(content: string): { body: string; bodyOffset: number } {\n  const normalized = content.replace(/\\r\\n/g, '\\n')\n  if (!normalized.startsWith('---\\n')) return { body: normalized, bodyOffset: 0 }\n  const match = /^---\\n[\\s\\S]*?\\n---\\s*\\n?/.exec(normalized)\n  if (!match) return { body: normalized, bodyOffset: 0 }\n  return { body: normalized.slice(match[0].length), bodyOffset: match[0].length }\n}\n\nfunction normalizeOptions(opts: ChunkingOptions): ChunkingOptions {\n  if (opts.maxChars < opts.targetChars) opts.maxChars = opts.targetChars\n  if (opts.overlapChars >= opts.targetChars) opts.overlapChars = Math.floor(opts.targetChars / 2)\n  return opts\n}\n\ninterface Section {\n  text: string\n  start: number\n  headingPath: string\n}\n\nfunction splitSections(body: string, bodyOffset: number): Section[] {\n  const lines = body.split('\\n')\n  const sections: Section[] = []\n  const headings: Record<number, string> = {}\n  let current: { lines: string[]; start: number; headingPath: string } = {\n    lines: [],\n    start: bodyOffset,\n    headingPath: '',\n  }\n  let cursor = bodyOffset\n  let fence: string | null = null\n\n  const flush = () => {\n    const text = current.lines.join('\\n')\n    if (text.trim() !== '')\n      sections.push({ text, start: current.start, headingPath: current.headingPath })\n  }\n\n  for (let i = 0; i < lines.length; i++) {\n    const line = lines[i]!\n    const lineLen = line.length + (i < lines.length - 1 ? 1 : 0)\n    const fenceMatch = /^(`{3,}|~{3,})/.exec(line)\n    if (fenceMatch) {\n      const marker = fenceMatch[1]!\n      fence = fence === null ? marker : line.startsWith(fence) ? null : fence\n      current.lines.push(line)\n      cursor += lineLen\n      continue\n    }\n    const heading = fence === null ? /^(#{1,6})\\s+(.+?)\\s*$/.exec(line) : null\n    if (heading) {\n      flush()\n      const level = heading[1]!.length\n      headings[level] = heading[2]!.trim()\n      for (let next = level + 1; next <= 6; next++) delete headings[next]\n      current = {\n        lines: [line],\n        start: cursor,\n        headingPath: Object.entries(headings)\n          .sort(([a], [b]) => Number(a) - Number(b))\n          .map(([levelText, title]) => `${'#'.repeat(Number(levelText))} ${title}`)\n          .join(' > '),\n      }\n      cursor += lineLen\n      continue\n    }\n    current.lines.push(line)\n    cursor += lineLen\n  }\n  flush()\n  return sections\n}\n\nfunction chunkText(text: string, opts: ChunkingOptions): Array<{ text: string; start: number }> {\n  if (text.length <= opts.targetChars) return [{ text, start: 0 }]\n  const atoms = splitAtoms(text)\n  const chunks: Array<{ text: string; start: number }> = []\n  let buffer = ''\n  let bufferStart = 0\n  for (const atom of atoms) {\n    if (buffer === '') bufferStart = atom.start\n    if (buffer.length > 0 && buffer.length + atom.text.length > opts.targetChars) {\n      chunks.push({ text: buffer.trimEnd(), start: bufferStart })\n      const overlap = buffer.slice(Math.max(0, buffer.length - opts.overlapChars))\n      buffer = overlap + atom.text\n      bufferStart = Math.max(bufferStart, atom.start - overlap.length)\n    } else {\n      buffer += atom.text\n    }\n  }\n  if (buffer.trim() !== '') chunks.push({ text: buffer.trimEnd(), start: bufferStart })\n  return mergeTinyChunks(chunks, opts)\n}\n\nfunction splitAtoms(text: string): Array<{ text: string; start: number }> {\n  const parts: Array<{ text: string; start: number }> = []\n  const paragraphs = text.split(/(\\n\\s*\\n)/)\n  let cursor = 0\n  for (let i = 0; i < paragraphs.length; i += 2) {\n    const paragraph = (paragraphs[i] ?? '') + (paragraphs[i + 1] ?? '')\n    if (paragraph === '') continue\n    parts.push({ text: paragraph, start: cursor })\n    cursor += paragraph.length\n  }\n  return parts\n}\n\nfunction mergeTinyChunks(\n  chunks: Array<{ text: string; start: number }>,\n  opts: ChunkingOptions,\n): Array<{ text: string; start: number }> {\n  const out: Array<{ text: string; start: number }> = []\n  for (const chunk of chunks) {\n    const prev = out[out.length - 1]\n    if (\n      prev &&\n      chunk.text.length < opts.minChars &&\n      prev.text.length + chunk.text.length <= opts.maxChars\n    ) {\n      prev.text = `${prev.text}\\n\\n${chunk.text}`\n    } else {\n      out.push({ ...chunk })\n    }\n  }\n  return out\n}\n","/**\n * The SINGLE-AGENT COLLECTION driver — the blind-collection baseline (Arm A).\n *\n * This is the honest null the depth A/B is measured against. The other drivers\n * spend extra inference to do something differentiated:\n *   - `createVerifyingResearchDriver` runs an LLM gate per source (Arm B),\n *   - `createResearchDrivingDriver` extracts claims, tracks corroboration, and\n *     synthesizes deep follow-up questions to drive depth (Arm C).\n *\n * This driver does NONE of that. It is a pass-through: it accepts every source\n * the worker proposes and contributes no research, no gating, and no steering of\n * its own. The loop still dedups exact-uri duplicates before calling\n * `verifySource` (that is the loop's job, not the driver's), and the default\n * `foldGaps` (a plain bulleted list of the still-open readiness gaps) still folds\n * the gaps into the worker's next prompt — so the worker keeps researching, but\n * NOTHING intelligent sits between the worker and the knowledge base.\n *\n * In other words: ONE agent (the worker) collects sources round after round, and\n * the \"driver\" is an inert rubber stamp. That is exactly what \"single-agent\n * collection\" means — the topology with zero coordinator intelligence — so its\n * material-facts score is the floor every other arm must beat to justify its\n * extra inference cost.\n *\n * It adds NO router calls of its own: `verifySource` is a synchronous accept and\n * `foldGaps` is omitted so the loop uses its built-in gap list. So Arm A's cost\n * is the worker's cost alone — the cleanest possible blind-collection baseline.\n */\n\nimport type {\n  ResearchDriver,\n  ResearchSourceProposal,\n  SourceVerdict,\n} from './two-agent-research-loop'\n\n/**\n * Build the single-agent collection driver. Accepts every source; never gates,\n * never researches, never steers beyond the loop's default open-gap list. The\n * worker is the only agent that thinks.\n */\nexport function createCollectionResearchDriver(): ResearchDriver {\n  return {\n    verifySource(_source: ResearchSourceProposal): SourceVerdict {\n      return { accept: true }\n    },\n  }\n}\n","import { isDeepStrictEqual } from 'node:util'\n\nexport interface DiscoveryTask {\n  id: string\n  goal: string\n  query?: string\n  sourceHints?: string[]\n  metadata?: Record<string, unknown>\n}\n\nexport interface DiscoveryResult {\n  taskId: string\n  summary: string\n  sourceUris?: string[]\n  claims?: Array<{ text: string; sourceUri?: string; confidence?: number }>\n  followUpTasks?: DiscoveryTask[]\n  metadata?: Record<string, unknown>\n}\n\nexport interface KnowledgeDiscoveryWorker {\n  run(task: DiscoveryTask, signal?: AbortSignal): Promise<DiscoveryResult> | DiscoveryResult\n}\n\nexport interface KnowledgeDiscoveryDispatcher {\n  dispatch(\n    tasks: DiscoveryTask[],\n    options?: {\n      concurrency?: number\n      signal?: AbortSignal\n    },\n  ): Promise<DiscoveryResult[]>\n}\n\nexport type DiscoveryLoopStopReason = 'complete' | 'max-rounds' | 'max-tasks' | 'aborted'\n\nexport interface DiscoveryLoopRound {\n  round: number\n  tasks: DiscoveryTask[]\n  results: DiscoveryResult[]\n  queuedFollowUps: DiscoveryTask[]\n}\n\nexport interface DiscoveryLoopResult {\n  stopReason: DiscoveryLoopStopReason\n  tasksDispatched: number\n  results: DiscoveryResult[]\n  rounds: DiscoveryLoopRound[]\n  /** Tasks retained, not dropped, when a configured limit stops the loop. */\n  pendingTasks: DiscoveryTask[]\n  /** Structurally identical task identities ignored to prevent cycles. */\n  duplicateTaskIds: string[]\n}\n\nexport interface RunDiscoveryLoopOptions {\n  dispatcher: KnowledgeDiscoveryDispatcher\n  initialTasks: readonly DiscoveryTask[]\n  /** Maximum follow-up depth including the initial dispatch. Default 3. */\n  maxRounds?: number\n  /** Maximum tasks dispatched across all rounds. Default 24. */\n  maxTasks?: number\n  /** Forwarded to the dispatcher. Default 4. */\n  concurrency?: number\n  signal?: AbortSignal\n  onRound?: (round: DiscoveryLoopRound) => Promise<void> | void\n}\n\n/**\n * Dispatch discovery tasks and recursively pursue worker-proposed follow-ups.\n *\n * The runner owns only bounded scheduling and accounting. Workers own search,\n * source verification, and domain-specific candidate shapes.\n */\nexport async function runDiscoveryLoop(\n  options: RunDiscoveryLoopOptions,\n): Promise<DiscoveryLoopResult> {\n  const maxRounds = positiveInteger(options.maxRounds ?? 3, 'maxRounds')\n  const maxTasks = positiveInteger(options.maxTasks ?? 24, 'maxTasks')\n  const concurrency = positiveInteger(options.concurrency ?? 4, 'concurrency')\n  const known = new Map<string, DiscoveryTask>()\n  const pending: DiscoveryTask[] = []\n  const duplicateTaskIds = new Set<string>()\n  enqueueTasks(options.initialTasks, known, pending, duplicateTaskIds)\n\n  const rounds: DiscoveryLoopRound[] = []\n  const results: DiscoveryResult[] = []\n  let tasksDispatched = 0\n  let aborted = false\n\n  while (pending.length > 0 && rounds.length < maxRounds && tasksDispatched < maxTasks) {\n    if (options.signal?.aborted) {\n      aborted = true\n      break\n    }\n    const capacity = maxTasks - tasksDispatched\n    const tasks = pending.splice(0, capacity)\n    let dispatched: DiscoveryResult[]\n    try {\n      dispatched = orderCompleteDispatch(\n        tasks,\n        await options.dispatcher.dispatch(tasks, {\n          concurrency,\n          signal: options.signal,\n        }),\n      )\n    } catch (cause) {\n      if (!options.signal?.aborted) throw cause\n      pending.unshift(...tasks)\n      aborted = true\n      break\n    }\n    tasksDispatched += tasks.length\n    results.push(...dispatched)\n\n    const queuedFollowUps: DiscoveryTask[] = []\n    for (const result of dispatched) {\n      enqueueTasks(result.followUpTasks ?? [], known, queuedFollowUps, duplicateTaskIds)\n    }\n    pending.push(...queuedFollowUps)\n    const round: DiscoveryLoopRound = {\n      round: rounds.length + 1,\n      tasks,\n      results: dispatched,\n      queuedFollowUps,\n    }\n    rounds.push(round)\n    await options.onRound?.(round)\n    if (options.signal?.aborted) {\n      aborted = true\n      break\n    }\n  }\n\n  const stopReason: DiscoveryLoopStopReason = aborted\n    ? 'aborted'\n    : pending.length === 0\n      ? 'complete'\n      : tasksDispatched >= maxTasks\n        ? 'max-tasks'\n        : 'max-rounds'\n  return {\n    stopReason,\n    tasksDispatched,\n    results,\n    rounds,\n    pendingTasks: pending,\n    duplicateTaskIds: [...duplicateTaskIds],\n  }\n}\n\nexport function createLocalDiscoveryDispatcher(\n  worker: KnowledgeDiscoveryWorker,\n): KnowledgeDiscoveryDispatcher {\n  return {\n    async dispatch(tasks, options = {}) {\n      const concurrency = Math.max(1, options.concurrency ?? 4)\n      const results: DiscoveryResult[] = []\n      let cursor = 0\n      async function runNext(): Promise<void> {\n        while (cursor < tasks.length) {\n          if (options.signal?.aborted) throw new Error('Discovery dispatch aborted')\n          const task = tasks[cursor++]!\n          results.push(await worker.run(task, options.signal))\n        }\n      }\n      await Promise.all(Array.from({ length: Math.min(concurrency, tasks.length) }, runNext))\n      return orderCompleteDispatch(tasks, results)\n    },\n  }\n}\n\nfunction enqueueTasks(\n  tasks: readonly DiscoveryTask[],\n  known: Map<string, DiscoveryTask>,\n  destination: DiscoveryTask[],\n  duplicateTaskIds: Set<string>,\n): void {\n  for (const task of tasks) {\n    assertTask(task)\n    const prior = known.get(task.id)\n    if (!prior) {\n      known.set(task.id, task)\n      destination.push(task)\n      continue\n    }\n    if (!isDeepStrictEqual(prior, task)) {\n      throw new Error(`Discovery task id '${task.id}' refers to conflicting tasks`)\n    }\n    duplicateTaskIds.add(task.id)\n  }\n}\n\nfunction assertTask(task: DiscoveryTask): void {\n  if (!task.id.trim()) throw new Error('Discovery task id must not be empty')\n  if (!task.goal.trim()) throw new Error(`Discovery task '${task.id}' goal must not be empty`)\n}\n\nfunction orderCompleteDispatch(\n  tasks: readonly DiscoveryTask[],\n  results: readonly DiscoveryResult[],\n): DiscoveryResult[] {\n  const order = new Map(tasks.map((task, index) => [task.id, index]))\n  const received = new Set<string>()\n  for (const result of results) {\n    if (!order.has(result.taskId)) {\n      throw new Error(`Discovery dispatcher returned unknown task '${result.taskId}'`)\n    }\n    if (received.has(result.taskId)) {\n      throw new Error(`Discovery dispatcher returned task '${result.taskId}' more than once`)\n    }\n    received.add(result.taskId)\n  }\n  const missing = tasks.filter((task) => !received.has(task.id)).map((task) => task.id)\n  if (missing.length > 0) {\n    throw new Error(`Discovery dispatcher omitted tasks: ${missing.join(', ')}`)\n  }\n  return [...results].sort(\n    (a, b) => (order.get(a.taskId) as number) - (order.get(b.taskId) as number),\n  )\n}\n\nfunction positiveInteger(value: number, name: string): number {\n  if (!Number.isInteger(value) || value < 1) {\n    throw new Error(`Discovery loop ${name} must be a positive integer`)\n  }\n  return value\n}\n","import { readFile } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport { z } from 'zod'\nimport { isMissingFile, writeJsonDurableWithinRoot } from './durable-fs'\nimport { withKnowledgeMutation, withKnowledgeRead } from './mutation-lock'\n\n/**\n * Knowledge freshness store: tracks when each `(workspaceId, sourceId)` pair\n * was last successfully refreshed, and reports staleness against a TTL.\n *\n * The contract is intentionally minimal — just enough to drive a cron loop:\n *\n *   ```ts\n *   const store = createFileSystemFreshnessStore({ root: '.agent-knowledge' })\n *   for (const source of sources) {\n *     if (await store.stale({ workspaceId, sourceId: source.id, ttlMs: DAY })) {\n *       const fragments = await source.fetch({ cacheDir })\n *       await persistFragments(fragments)\n *       await store.mark({ workspaceId, sourceId: source.id, when: new Date() })\n *     }\n *   }\n *   ```\n *\n * Per-tenant isolation is enforced by `workspaceId` keying — there is no\n * global mutable state across workspaces.\n *\n * Two adapters ship in-package:\n *\n *   - `createFileSystemFreshnessStore` — JSON file under the knowledge root,\n *     mirrors the layout convention already used by `sources.json`.\n *   - `createD1FreshnessStoreStub` — adapter scaffold for Cloudflare D1 /\n *     Postgres. Production consumers should implement the `D1Adapter`\n *     interface inside their own app; this stub exists to anchor the shape.\n *\n * @stable contract — interface is frozen at 0.x within this major.\n * @stable filesystem adapter\n * @experimental D1 stub — interface will evolve as real consumers wire it.\n */\n\n/** Identity for one freshness record. */\nexport interface FreshnessKey {\n  workspaceId: string\n  sourceId: string\n}\n\n/** TTL bound for staleness checks. */\nexport interface FreshnessTtl extends FreshnessKey {\n  /** Milliseconds — `Date.now() - last() > ttlMs` ⇒ stale. */\n  ttlMs: number\n  /** Injected clock for deterministic tests; defaults to system time. */\n  now?: Date\n}\n\n/** Mark argument. */\nexport interface FreshnessMark extends FreshnessKey {\n  when: Date\n  /** Optional content hash captured at refresh time; aids debugging. */\n  contentHash?: string\n}\n\nexport interface KnowledgeFreshnessStore {\n  /** Last refresh time, or null if never refreshed. */\n  last(key: FreshnessKey): Promise<Date | null>\n  /** Record a successful refresh. */\n  mark(input: FreshnessMark): Promise<void>\n  /** True iff `last(key)` is null or older than `ttlMs`. */\n  stale(input: FreshnessTtl): Promise<boolean>\n  /** All records for a workspace — useful for dashboards / debugging. */\n  list(workspaceId: string): Promise<FreshnessRecord[]>\n}\n\nexport interface FreshnessRecord {\n  workspaceId: string\n  sourceId: string\n  lastRefreshedAt: string\n  contentHash?: string\n}\n\nexport interface FileSystemFreshnessStoreOptions {\n  /**\n   * Knowledge root. The store writes to `<root>/.agent-knowledge/freshness.json`,\n   * mirroring the convention used by `sources.json`.\n   */\n  root: string\n}\n\nconst freshnessRecordSchema = z\n  .object({\n    workspaceId: z.string().min(1),\n    sourceId: z.string().min(1),\n    lastRefreshedAt: z.iso.datetime(),\n    contentHash: z.string().min(1).optional(),\n  })\n  .strict()\nconst freshnessFileSchema = z\n  .object({ records: z.record(z.string(), freshnessRecordSchema) })\n  .strict()\n\n/**\n * Filesystem-backed implementation. Single JSON file per knowledge root,\n * indexed by `${workspaceId}::${sourceId}`. Reads parse on every call —\n * cron tick rate is well below the cost of one JSON parse.\n *\n * Writes share the package-wide filesystem lock, so multiple workers cannot\n * overwrite one another or run through an interrupted knowledge promotion.\n */\nexport function createFileSystemFreshnessStore(\n  options: FileSystemFreshnessStoreOptions,\n): KnowledgeFreshnessStore {\n  const path = join(options.root, '.agent-knowledge', 'freshness.json')\n\n  const read = async (): Promise<Record<string, FreshnessRecord>> => {\n    return withKnowledgeRead(options.root, async () => {\n      try {\n        return freshnessFileSchema.parse(JSON.parse(await readFile(path, 'utf8'))).records\n      } catch (error) {\n        if (isMissingFile(error)) return {}\n        throw error\n      }\n    })\n  }\n\n  const write = async (records: Record<string, FreshnessRecord>): Promise<void> => {\n    await writeJsonDurableWithinRoot(\n      options.root,\n      '.agent-knowledge/freshness.json',\n      freshnessFileSchema.parse({ records }),\n    )\n  }\n\n  return {\n    async last(key) {\n      const records = await read()\n      const record = records[buildKey(key)]\n      return record ? new Date(record.lastRefreshedAt) : null\n    },\n    async mark(input) {\n      await withKnowledgeMutation(options.root, async () => {\n        const records = await read()\n        records[buildKey(input)] = {\n          workspaceId: input.workspaceId,\n          sourceId: input.sourceId,\n          lastRefreshedAt: input.when.toISOString(),\n          ...(input.contentHash === undefined ? {} : { contentHash: input.contentHash }),\n        }\n        await write(records)\n      })\n    },\n    async stale(input) {\n      const last = await this.last(input)\n      if (!last) return true\n      const now = input.now ?? new Date()\n      return now.getTime() - last.getTime() > input.ttlMs\n    },\n    async list(workspaceId) {\n      const records = await read()\n      return Object.values(records).filter((r) => r.workspaceId === workspaceId)\n    },\n  }\n}\n\n/**\n * D1 / Postgres adapter scaffold. Production consumers implement\n * `D1Adapter` against their own driver (better-sqlite3, postgres,\n * Cloudflare D1 binding, ...). This factory wires the adapter to the\n * `KnowledgeFreshnessStore` interface.\n *\n * The expected schema:\n *\n * ```sql\n * CREATE TABLE knowledge_freshness (\n *   workspace_id     TEXT NOT NULL,\n *   source_id        TEXT NOT NULL,\n *   last_refreshed_at TEXT NOT NULL,\n *   content_hash     TEXT,\n *   PRIMARY KEY (workspace_id, source_id)\n * );\n * ```\n */\nexport interface D1Adapter {\n  get(workspaceId: string, sourceId: string): Promise<FreshnessRecord | null>\n  upsert(record: FreshnessRecord): Promise<void>\n  listByWorkspace(workspaceId: string): Promise<FreshnessRecord[]>\n}\n\nexport function createD1FreshnessStoreStub(adapter: D1Adapter): KnowledgeFreshnessStore {\n  return {\n    async last(key) {\n      const record = await adapter.get(key.workspaceId, key.sourceId)\n      return record ? new Date(record.lastRefreshedAt) : null\n    },\n    async mark(input) {\n      await adapter.upsert({\n        workspaceId: input.workspaceId,\n        sourceId: input.sourceId,\n        lastRefreshedAt: input.when.toISOString(),\n        contentHash: input.contentHash,\n      })\n    },\n    async stale(input) {\n      const last = await this.last(input)\n      if (!last) return true\n      const now = input.now ?? new Date()\n      return now.getTime() - last.getTime() > input.ttlMs\n    },\n    async list(workspaceId) {\n      return adapter.listByWorkspace(workspaceId)\n    },\n  }\n}\n\nfunction buildKey(key: FreshnessKey): string {\n  return `${key.workspaceId}::${key.sourceId}`\n}\n","/**\n * HELD-OUT INVESTMENT-RESEARCH EVAL SET.\n *\n * The point of this file is the same FIREWALL the deep-question exam uses\n * (`tests/loops/held-out-exam.ts`): the material facts and their checkable\n * fragments are NEVER shown to a research loop. A loop is told only the company\n * + ticker + a research-as-of CUTOFF date, and asked to write an investment\n * thesis. AFTER it finishes, we grade the thesis it produced against THESE\n * facts — facts it never saw — so a high score is thesis QUALITY (it surfaced\n * the buried, material, non-obvious drivers) and not teaching-to-the-test.\n *\n * Each fact is a DEPTH fact by construction: a single ticker / company-name web\n * search does NOT surface it. They are the things buried in the filings or\n * knowable from then-available primary sources that a thorough analyst flags and\n * a one-shot search misses — customer/revenue/deposit concentration, a debt\n * maturity wall, a margin-trend reversal, a governance / related-party item, a\n * specific competitive or regulatory risk, an off-balance-sheet loss.\n *\n * THREE HARD RULES, enforced by how the data was gathered (see\n * docs/eval/investment-material-facts.md for the per-item provenance + the\n * curation-bias disclosure):\n *\n *   1. SPECIFIC + CHECKABLE. Each fact carries `expected` keyword groups — the\n *      specific number / name / phrase — so a deterministic, model-free\n *      substring grader (`gradeFactAgainstText`) can score \"did the thesis\n *      surface it\". $0, reproducible, and it cannot leak the answer key into a\n *      model the loop could observe.\n *\n *   2. DERIVED FROM REAL FETCHED EVIDENCE. Every fact records the primary source\n *      it came from (`sourceUrl`, an SEC EDGAR 10-K) and the literal `evidence`\n *      value read out of that document. Nothing here is invented; an item that\n *      could not be independently sourced was DROPPED, not guessed (the drop log\n *      is in the doc).\n *\n *   3. KNOWABLE AT THE CUTOFF. Every fact was disclosed in, or computable from, a\n *      document available on or before the company's `cutoff` date. Post-cutoff\n *      hindsight (the eventual bankruptcy / collapse) is NOT a checklist item —\n *      it is recorded separately as `knownOutcome`, purely for the reader, and is\n *      never graded.\n *\n * Grading mirrors the deep-question exam exactly: a fact is SURFACED when the\n * thesis text contains at least `minGroups` of its expected groups; a group is\n * satisfied when ANY of its `anyOf` fragments appears (case-insensitive\n * substring), so a faithful thesis phrased in its own words still grades as a\n * hit. `anyOf` groups model synonyms; the load-bearing tokens are the specific\n * numbers / names.\n */\n\n/** A required answer component: satisfied when any synonym fragment is present. */\nexport interface ExpectedGroup {\n  /** Human label for the component (for the doc / audit). */\n  label: string\n  /** Case-insensitive substring fragments; any one present satisfies the group. */\n  anyOf: string[]\n}\n\n/** Lens the fact belongs to — so a set can be checked for category coverage. */\nexport type MaterialFactLens =\n  | 'concentration' // customer / revenue / deposit concentration\n  | 'leverage' // debt load / maturity wall / interest burden\n  | 'margin-trend' // gross/operating margin reversal\n  | 'liquidity' // cash burn / negative operating cash flow\n  | 'capital-return' // buyback / dividend draining the balance sheet\n  | 'governance' // dual-class / related-party / control item\n  | 'off-balance-sheet' // unrealized losses not in earnings/equity\n  | 'regulatory' // a specific regulatory / legal / recall exposure\n\n/** One held-out material fact with a checkable expected answer + its provenance. */\nexport interface MaterialFact {\n  /** Stable id, `ticker/fN`. */\n  id: string\n  /** Which analyst lens this fact exercises. For coverage + the doc. */\n  lens: MaterialFactLens\n  /**\n   * The material fact, in plain words — for the doc/audit. NEVER shown to a loop.\n   * This is the thing a thorough analyst would flag and a ticker search misses.\n   */\n  fact: string\n  /**\n   * The checkable answer as required keyword GROUPS. The thesis text must contain\n   * at least `minGroups` of these groups (default: all). A group is satisfied\n   * when ANY of its `anyOf` fragments appears (case-insensitive substring).\n   */\n  expected: ExpectedGroup[]\n  /**\n   * Minimum number of `expected` groups the thesis must contain to count the\n   * fact SURFACED. Default = all groups (the strict bar). Lowered (and documented\n   * inline) only when the fact is genuinely satisfiable by a subset.\n   */\n  minGroups?: number\n  /**\n   * PROVENANCE. The primary source URL this fact was read from — an SEC EDGAR\n   * 10-K primary document, fetched live during curation.\n   */\n  sourceUrl: string\n  /**\n   * The literal value / phrase read out of `sourceUrl` that grounds the fact.\n   * This is the \"cite the actual filing + the value\" requirement — verbatim or\n   * near-verbatim from the filing, with the figure.\n   */\n  evidence: string\n}\n\n/** A company + the cutoff a loop researches as-of + its held-out material facts. */\nexport interface CompanyEvalCase {\n  /** Ticker as of the cutoff. */\n  ticker: string\n  /** Legal name as of the cutoff (what the loop is told to research). */\n  company: string\n  /** SEC Central Index Key (CIK), zero-stripped — the EDGAR filer id. */\n  cik: string\n  /**\n   * Research-as-of date (ISO). The loop must reason as if it is this date; every\n   * `evidence` value was knowable on or before it. >= 18 months before this set\n   * was curated, so the outcome is known but is NOT a checklist item.\n   */\n  cutoff: string\n  /** Sector, for coverage / the curation-bias disclosure. */\n  sector: string\n  /**\n   * The known POST-cutoff outcome — recorded for the reader ONLY, never graded.\n   * Keeping it out of `facts` is what makes the set hindsight-free.\n   */\n  knownOutcome: string\n  /** The held-out material facts for this company. */\n  facts: MaterialFact[]\n}\n\n/**\n * The eval set. 5 public companies, 5-8 held-out material facts each, every fact\n * grounded in a primary SEC EDGAR 10-K filed on or before the cutoff.\n *\n * CURATION-BIAS DISCLOSURE (full version in the doc): all five are companies\n * whose buried risks later materialized, because that is where the material-vs-\n * surface distinction is sharpest AND where the figures are easy to verify after\n * the fact. This biases the set toward downside risks (two of the eight lenses,\n * concentration + leverage, dominate) and toward distressed names. A production\n * eval would balance these with companies whose buried facts were POSITIVE\n * drivers and with survivors. This set is honest about that and reports the lens\n * distribution so the bias is measurable, not hidden.\n */\nexport const investmentThesisSet: CompanyEvalCase[] = [\n  {\n    ticker: 'SIVB',\n    company: 'SVB Financial Group',\n    cik: '719739',\n    cutoff: '2023-02-24',\n    sector: 'Banking',\n    knownOutcome:\n      'Failed in a deposit run and was placed in FDIC receivership on March 10, 2023; the holding company filed Chapter 11 on March 17, 2023.',\n    facts: [\n      {\n        id: 'SIVB/f1',\n        lens: 'off-balance-sheet',\n        fact: 'Held-to-maturity (HTM) securities carried at $91.3B amortized cost had a fair value of only $76.2B — a ~$15.1B unrealized loss that, because the portfolio is HTM, never touched earnings or equity and sat only in the footnotes.',\n        expected: [\n          {\n            label: 'HTM securities',\n            anyOf: ['held-to-maturity', 'held to maturity', 'htm'],\n          },\n          {\n            label: 'large unrealized loss (~$15B) / fair value gap',\n            anyOf: [\n              '15.1',\n              '15.2',\n              '$15 billion',\n              '15 billion',\n              '76,169',\n              '76.2 billion',\n              '91,321',\n              'unrealized loss',\n              'below amortized cost',\n              'fair value',\n            ],\n          },\n        ],\n        minGroups: 2,\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          'Balance sheet (Dec 31, 2022): \"Held-to-maturity securities, at amortized cost ... 91,321\" with parenthetical \"(fair value of $ 76,169 ...)\". The gap = $91,321M - $76,169M = ~$15,152M unrealized loss, disclosed only in the notes.',\n      },\n      {\n        id: 'SIVB/f2',\n        lens: 'off-balance-sheet',\n        fact: \"The HTM unrealized loss (~$15.1B) was roughly equal to the company's entire $16.0B total stockholders' equity — a mark-to-market wipeout hidden by HTM accounting.\",\n        expected: [\n          {\n            label: 'loss near/exceeds total equity',\n            anyOf: [\n              'equity',\n              'capital',\n              'insolvent',\n              'wipe out',\n              'exceeds',\n              'nearly all',\n              'tangible book',\n              '16,004',\n              '16 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"Total SVBFG stockholders\\' equity 16,004\" (Dec 31, 2022). The ~$15.15B HTM unrealized loss is ~95% of the $16.0B reported equity.',\n      },\n      {\n        id: 'SIVB/f3',\n        lens: 'concentration',\n        fact: 'Estimated uninsured deposits in U.S. offices were $151.5B at year-end 2022 — the run-prone funding base; a high share of total deposits exceeded the FDIC limit.',\n        expected: [\n          {\n            label: 'large uninsured deposit base',\n            anyOf: [\n              'uninsured deposit',\n              'above the fdic',\n              'exceed the fdic',\n              'exceeds the fdic',\n              '151.5',\n              '$151 billion',\n              'fdic insurance limit',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"As of December 31, 2022 ... the amount of estimated uninsured deposits in U.S. offices that exceed the FDIC insurance limit were $151.5 billion\".',\n      },\n      {\n        id: 'SIVB/f4',\n        lens: 'margin-trend',\n        fact: 'Cheap noninterest-bearing demand deposits fell 20 percentage points in one year — to 47% of total deposits from 67% — meaning funding costs were set to rise sharply as clients moved to interest-bearing accounts.',\n        expected: [\n          {\n            label: 'deposit mix shift to costlier funding',\n            anyOf: [\n              'noninterest-bearing',\n              'non-interest-bearing',\n              'noninterest bearing',\n              'deposit mix',\n              'funding cost',\n              'cost of deposits',\n              'interest-bearing',\n              '47 percent',\n              '20 percentage',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"Noninterest-bearing demand deposits to total deposits decreased by 20 percentage points to 47 percent as of December 31, 2022, compared to ... 2021.\"',\n      },\n      {\n        id: 'SIVB/f5',\n        lens: 'concentration',\n        fact: 'The deposit and loan base was concentrated in a single client type — the \"innovation economy\" (venture-backed technology and life-science startups) — so a downturn in venture funding would hit deposits and credit simultaneously.',\n        expected: [\n          {\n            label: 'concentration in tech / startups / innovation economy',\n            anyOf: [\n              'innovation economy',\n              'technology',\n              'life science',\n              'venture',\n              'startup',\n              'early-stage',\n              'concentrat',\n              'single industry',\n              'sector concentration',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          'The 10-K repeatedly frames the franchise around clients in \"the innovation economy\" (technology, life science / healthcare, and the venture firms that back them) — a single-sector deposit + credit concentration.',\n      },\n      {\n        id: 'SIVB/f6',\n        lens: 'off-balance-sheet',\n        fact: 'Available-for-sale (AFS) securities of $28.6B amortized cost were marked to a $26.1B fair value — a ~$2.5B loss that DID flow through equity (AOCI), the visible tip of a much larger unrealized-loss iceberg dominated by the footnote-only HTM book.',\n        expected: [\n          {\n            label: 'AFS unrealized loss / AOCI',\n            anyOf: [\n              'available-for-sale',\n              'available for sale',\n              'afs',\n              'aoci',\n              'accumulated other comprehensive',\n              '28,602',\n              '26,069',\n              '2.5 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"Available-for-sale securities, at fair value (cost of $ 28,602 ...) 26,069\" — a ~$2.5B AFS unrealized loss carried in AOCI, separate from and much smaller than the HTM gap.',\n      },\n    ],\n  },\n  {\n    ticker: 'BBBY',\n    company: 'Bed Bath & Beyond Inc.',\n    cik: '886158',\n    cutoff: '2022-04-21',\n    sector: 'Specialty retail',\n    knownOutcome: 'Filed for Chapter 11 bankruptcy on April 23, 2023; shareholders were wiped out.',\n    facts: [\n      {\n        id: 'BBBY/f1',\n        lens: 'capital-return',\n        fact: 'The company had repurchased ~$11.685B of its own stock since 2004 — including $574.9M in fiscal 2021 alone, \"two years ahead of schedule\" — draining the balance sheet of a business that was losing money.',\n        expected: [\n          {\n            label: 'massive buyback program',\n            anyOf: [\n              'repurchas',\n              'buyback',\n              'buy back',\n              'share repurchase',\n              '11.685',\n              '$11.7 billion',\n              '574.9',\n              '$575 million',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          '\"Since 2004 through the end of Fiscal 2021, we have repurchased approximately $11.685 billion of our common stock\"; FY2021 alone \"completed share repurchases of $574.9 million ... two years ahead of schedule.\"',\n      },\n      {\n        id: 'BBBY/f2',\n        lens: 'liquidity',\n        fact: 'Operating cash flow collapsed to just $17.9M in FY2021, down from $268.1M and $590.9M in the two prior years — a near-total loss of internally generated cash while it kept buying back stock.',\n        expected: [\n          {\n            label: 'operating cash flow collapse',\n            anyOf: [\n              'operating cash flow',\n              'cash from operations',\n              'cash provided by operating',\n              'cash flow from operations',\n              '17.9',\n              '17,854',\n              'declining cash flow',\n              'cash generation',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          'Statement of cash flows: \"Net cash provided by operating activities 17,854 268,108 590,941\" (FY2021 / FY2020 / FY2019, $ thousands).',\n      },\n      {\n        id: 'BBBY/f3',\n        lens: 'liquidity',\n        fact: \"Total shareholders' equity fell ~86% in one year — from $1.277B to $174.1M — as losses plus buybacks ate the equity cushion.\",\n        expected: [\n          {\n            label: 'equity erosion',\n            anyOf: [\n              'shareholders’ equity',\n              \"shareholders' equity\",\n              'stockholders equity',\n              'book value',\n              'equity',\n              'net worth',\n              '174.1',\n              '174,145',\n              'eroded',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          '\"Total shareholders\\' equity 174,145 1,276,936\" (FY2021 vs FY2020, $ thousands) — an ~86% decline in one year.',\n      },\n      {\n        id: 'BBBY/f4',\n        lens: 'liquidity',\n        fact: 'The company posted a $559.6M net loss in FY2021 — yet spent $574.9M on buybacks the same year, i.e. it returned more cash to shareholders than it had, let alone earned.',\n        expected: [\n          {\n            label: 'net loss FY2021',\n            anyOf: [\n              'net loss',\n              'unprofitable',\n              'lost money',\n              'losing money',\n              '559.6',\n              '559,623',\n              '$560 million',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence: '\"Net loss $ ( 559,623 )\" for fiscal 2021 ($ thousands).',\n      },\n      {\n        id: 'BBBY/f5',\n        lens: 'margin-trend',\n        fact: 'Merchandise inventories rose to $1.725B even as sales fell — inventory building into a demand decline, a classic markdown-risk and cash-trap signal.',\n        expected: [\n          {\n            label: 'inventory building into falling demand',\n            anyOf: [\n              'inventor',\n              'merchandise inventories',\n              'overstock',\n              'markdown',\n              '1,725',\n              '1.7 billion',\n              'stockpile',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          '\"Merchandise inventories 1,725,410 1,671,909\" ($ thousands) — inventory grew year over year while comparable sales declined.',\n      },\n    ],\n  },\n  {\n    ticker: 'CVNA',\n    company: 'Carvana Co.',\n    cik: '1690820',\n    cutoff: '2023-02-23',\n    sector: 'Auto e-commerce',\n    knownOutcome:\n      'The stock fell ~98% from its 2021 peak; the company narrowly avoided bankruptcy via a 2023 debt-exchange that cut and extended its obligations.',\n    facts: [\n      {\n        id: 'CVNA/f1',\n        lens: 'leverage',\n        fact: 'Total debt had grown to $8.39B by year-end 2022 (from $5.45B) — a debt load far larger than the equity base, built up funding growth and the ADESA deal.',\n        expected: [\n          {\n            label: 'large/growing debt load',\n            anyOf: [\n              'total debt',\n              'long-term debt',\n              'leverage',\n              'highly leveraged',\n              'debt load',\n              '8,391',\n              '8.4 billion',\n              '$8.4 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence: '\"Total debt 8,391 5,447\" (Dec 31, 2022 vs 2021, $ millions).',\n      },\n      {\n        id: 'CVNA/f2',\n        lens: 'leverage',\n        fact: 'Interest expense nearly tripled to $486M in 2022 (from $176M) — debt-service was consuming cash a still-unprofitable company did not have.',\n        expected: [\n          {\n            label: 'rising interest burden',\n            anyOf: [\n              'interest expense',\n              'interest cost',\n              'debt service',\n              'cost of debt',\n              '486',\n              'interest burden',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence: '\"Interest expense 486 176\" (FY2022 vs FY2021, $ millions).',\n      },\n      {\n        id: 'CVNA/f3',\n        lens: 'leverage',\n        fact: \"In May 2022 Carvana bought ADESA's U.S. physical auction business for ~$2.2B in cash — a debt-funded acquisition that stretched the balance sheet right as used-car demand turned.\",\n        expected: [\n          {\n            label: 'ADESA acquisition ~$2.2B',\n            anyOf: ['adesa', '2.2 billion', '$2.2 billion', 'physical auction', 'acquisition'],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence:\n          '\"physical auction business of ADESA US Auction, LLC for approximately $2.2 billion in cash (the \\'ADESA Acquisition\\')\", closed 2022-05-09.',\n      },\n      {\n        id: 'CVNA/f4',\n        lens: 'governance',\n        fact: 'Carvana leases hubs and properties from DriveTime — a company controlled by founder/CEO Ernest Garcia III and his father Ernest Garcia II — a recurring related-party arrangement with the controlling family.',\n        expected: [\n          {\n            label: 'related-party with founder family / DriveTime',\n            anyOf: [\n              'related party',\n              'related-party',\n              'drivetime',\n              'garcia',\n              'controlled by',\n              'affiliate of',\n              'conflict of interest',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence:\n          'Related Party Transactions note: lease agreements with \"DriveTime Automotive Group\", a related party \"due to Ernest Garcia II, Ernest Garcia III, and entities controlled by one or both of them\".',\n      },\n      {\n        id: 'CVNA/f5',\n        lens: 'liquidity',\n        fact: 'The 2022 net loss was $2.894B — a loss far wider than prior years, showing the unit economics had not turned even at scale.',\n        expected: [\n          {\n            label: 'large net loss FY2022',\n            anyOf: [\n              'net loss',\n              'unprofitable',\n              'losing money',\n              'cash burn',\n              '2,894',\n              '2.9 billion',\n              '$2.9 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence: '\"Net loss $ (2,894 ...\" for fiscal 2022 ($ millions).',\n      },\n    ],\n  },\n  {\n    ticker: 'PTON',\n    company: 'Peloton Interactive, Inc.',\n    cik: '1639825',\n    cutoff: '2022-09-07',\n    sector: 'Consumer fitness hardware',\n    knownOutcome:\n      'The stock fell ~95% from its 2021 peak; the founder-CEO departed, the company underwent mass layoffs and a multi-year turnaround through fiscal 2024.',\n    facts: [\n      {\n        id: 'PTON/f1',\n        lens: 'margin-trend',\n        fact: 'Connected Fitness (hardware) gross margin turned NEGATIVE — to (11)% in FY2022 — meaning Peloton lost money on every bike/tread it sold before any operating cost; revenue growth was masking a broken unit economics.',\n        expected: [\n          {\n            label: 'negative / collapsing hardware gross margin',\n            anyOf: [\n              'gross margin',\n              'negative margin',\n              'gross profit',\n              'margin compression',\n              'losing money on each',\n              'below cost',\n              '(11)',\n              '-11',\n              'negative gross',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          'MD&A \"Gross Profit, and Gross Margin\" table: Connected Fitness \"Gross Margin decreased to (11)\" percent in fiscal 2022 — a negative hardware gross margin.',\n      },\n      {\n        id: 'PTON/f2',\n        lens: 'liquidity',\n        fact: 'Inventories climbed to $1.105B as pandemic demand normalized — a glut of unsold equipment that tied up cash and risked markdowns.',\n        expected: [\n          {\n            label: 'inventory glut',\n            anyOf: [\n              'inventor',\n              'overstock',\n              'excess inventory',\n              'glut',\n              'markdown',\n              'unsold',\n              '1,104',\n              '1.1 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence: '\"Inventories, net 1,104.5 937\" (FY2022 vs FY2021, $ millions).',\n      },\n      {\n        id: 'PTON/f3',\n        lens: 'governance',\n        fact: \"A dual-class structure gives Class B holders 20 votes per share vs 1 for Class A — concentrating control with insiders/founders and limiting public shareholders' say.\",\n        expected: [\n          {\n            label: 'dual-class super-voting control',\n            anyOf: [\n              'dual-class',\n              'dual class',\n              'class b',\n              '20 votes',\n              'super-voting',\n              'supervoting',\n              'voting control',\n              'multiple votes per share',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          '\"Class B common stock has 20 votes per share and our Class A common stock has one vote per share.\"',\n      },\n      {\n        id: 'PTON/f4',\n        lens: 'liquidity',\n        fact: 'Peloton reported a $2.827B net loss in FY2022 — an order-of-magnitude wider loss than the prior year, signaling the demand normalization had broken the model, not just dented it.',\n        expected: [\n          {\n            label: 'large net loss FY2022',\n            anyOf: [\n              'net loss',\n              'unprofitable',\n              'losing money',\n              'cash burn',\n              '2,827',\n              '2.8 billion',\n              '$2.8 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence: '\"Net loss $ (2,827 ...\" for fiscal 2022 ($ millions).',\n      },\n      {\n        id: 'PTON/f5',\n        lens: 'regulatory',\n        fact: 'Peloton was running a CPSC recall of its Tread+ treadmill (tied to injuries and a child death) — an open product-safety and legal exposure beyond the demand story.',\n        expected: [\n          {\n            label: 'Tread+ / CPSC recall exposure',\n            anyOf: [\n              'recall',\n              'cpsc',\n              'consumer product safety',\n              'tread+',\n              'tread plus',\n              'product safety',\n              'injuries',\n              'safety',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          '\"recall on Tread+, which we are conducting in collaboration with the Consumer Product Safety Commission (\\'CPSC\\')\"; the Tread product recalls \"in the fourth quarter of fiscal 2021 continued to impact\" results.',\n      },\n      {\n        id: 'PTON/f6',\n        lens: 'leverage',\n        fact: 'Peloton was locked into ~$334M of manufacturing purchase commitments even as demand fell — contractual inventory it had to take on regardless of whether it could sell it.',\n        expected: [\n          {\n            label: 'locked-in purchase commitments',\n            anyOf: [\n              'purchase commitment',\n              'purchase obligation',\n              'minimum purchase',\n              'take-or-pay',\n              'committed to purchase',\n              '334',\n              'manufacturing commitment',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          '\"purchase commitments related to the manufacture of Peloton products were estimated to be approximately $334\" million.',\n      },\n    ],\n  },\n  {\n    ticker: 'SI',\n    company: 'Silvergate Capital Corporation',\n    cik: '1312109',\n    cutoff: '2022-02-28',\n    sector: 'Banking (digital-asset)',\n    knownOutcome:\n      'After the FTX collapse triggered a deposit run, Silvergate announced a voluntary wind-down of Silvergate Bank and liquidation in March 2023.',\n    facts: [\n      {\n        id: 'SI/f1',\n        lens: 'concentration',\n        fact: 'About 99.5% of total deposits were noninterest-bearing — essentially all funding was non-term money that could leave on demand, an extreme run-risk masked by very low funding cost.',\n        expected: [\n          {\n            label: 'almost all deposits noninterest-bearing / on-demand',\n            anyOf: [\n              'noninterest bearing',\n              'noninterest-bearing',\n              'non-interest-bearing',\n              'demand deposit',\n              'no term',\n              'on demand',\n              '99.5',\n              '99 percent',\n              'leave at any time',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          '\"noninterest bearing deposits as a percentage of total deposits was 99.5% as of December 31, 2021.\"',\n      },\n      {\n        id: 'SI/f2',\n        lens: 'concentration',\n        fact: 'Roughly 58% of deposits came from digital-currency EXCHANGES alone — a handful of correlated crypto counterparties whose own troubles would pull deposits out together.',\n        expected: [\n          {\n            label: 'deposits concentrated in crypto exchanges',\n            anyOf: [\n              'digital currency exchange',\n              'crypto exchange',\n              'exchanges represent',\n              'counterpart',\n              'concentrat',\n              '58%',\n              '58 percent',\n              'approximately 58',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          '\"Deposits from digital currency exchanges represent approximately 58%\" of deposits.',\n      },\n      {\n        id: 'SI/f3',\n        lens: 'concentration',\n        fact: 'The entire deposit franchise was tied to a single, volatile industry — digital-currency (crypto) customers — so a crypto downturn was a direct, undiversified funding shock.',\n        expected: [\n          {\n            // The buried, depth signal is the CONCENTRATION framing — that the\n            // whole deposit base is one undiversified industry bet — NOT the bare\n            // fact that it banks crypto (a one-line ticker summary has that). So\n            // bare \"crypto\" / \"digital asset\" are excluded; the load-bearing\n            // tokens are the concentration / single-industry / undiversified\n            // characterization or the filing's own \"digital currency customers\".\n            label: 'single-industry deposit CONCENTRATION (not just \"it banks crypto\")',\n            anyOf: [\n              'digital currency customers',\n              'single industry',\n              'one industry',\n              'single volatile industry',\n              'sector concentration',\n              'undiversified',\n              'concentrat',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          'The 10-K\\'s strategy and risk factors center the bank on \"digital currency customers\" and \"the concentration of our deposits\" in that single industry.',\n      },\n      {\n        id: 'SI/f4',\n        lens: 'liquidity',\n        fact: 'Total deposits had ballooned to $14.3B (from $10.4B) — fast, hot-money growth from the crypto boom that could reverse just as fast.',\n        expected: [\n          {\n            // The depth signal is the SIZE/character of the deposit base — the\n            // specific $14.3B figure or the explicit hot-money / volatile-deposit\n            // characterization — NOT bare \"total deposits\" / \"grew rapidly\", which\n            // any growth-story summary trips. Those generic phrases are excluded.\n            label: 'specific hot-money deposit base ($14.3B / volatile)',\n            anyOf: [\n              'hot money',\n              'hot-money',\n              'volatile deposit',\n              'could reverse',\n              '14.3 billion',\n              '14,290',\n              '$14.3b',\n              '$14 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence: '\"Total deposits $ 14,290,628\" ... prior year \"$ 10,411,278\" ($ thousands).',\n      },\n      {\n        id: 'SI/f5',\n        lens: 'concentration',\n        fact: 'The franchise hinged on a single proprietary product — the Silvergate Exchange Network (SEN), a payment network built exclusively for the digital-currency industry — so its competitive moat and its deposit base were the SAME crypto-dependent bet, not two diversified ones.',\n        expected: [\n          {\n            // The depth signal is naming the SPECIFIC proprietary product (the\n            // Silvergate Exchange Network / SEN) and that the moat and the deposit\n            // base are the same single bet — NOT bare \"proprietary\" / \"payment\n            // network\", which a generic crypto-bank summary mentions. Those bare\n            // terms are excluded; the SEN name or the single-product framing is\n            // load-bearing.\n            label: 'names the SEN single-product dependence (not generic \"payment network\")',\n            anyOf: [\n              'silvergate exchange network',\n              'the sen',\n              'sen)',\n              \"sen'\",\n              'single product',\n              'single-product',\n              'core product',\n              'one product',\n              'same bet',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          \"\\\"Silvergate Exchange Network ('SEN'), our proprietary, virtually instantaneous payment network for participants in the digital currency industry\\\" — the bank's differentiator and its deposit magnet are the same crypto-only product.\",\n      },\n    ],\n  },\n]\n\n/**\n * Grade ONE material fact against an investment thesis's full text. Returns\n * whether the thesis SURFACED it plus which expected groups were found. The\n * check is a deterministic case-insensitive substring scan — $0, model-free,\n * reproducible — so the eval never leaks into a model the loop could observe.\n */\nexport function gradeFactAgainstText(\n  fact: MaterialFact,\n  thesisText: string,\n): { surfaced: boolean; groupsFound: number; groupsTotal: number; foundLabels: string[] } {\n  const haystack = thesisText.toLowerCase()\n  const found = fact.expected.filter((group) =>\n    group.anyOf.some((fragment) => haystack.includes(fragment.toLowerCase())),\n  )\n  const minGroups = fact.minGroups ?? fact.expected.length\n  return {\n    surfaced: found.length >= minGroups,\n    groupsFound: found.length,\n    groupsTotal: fact.expected.length,\n    foundLabels: found.map((group) => group.label),\n  }\n}\n\n/** Grade a whole company's thesis text: how many of its held-out facts it surfaces. */\nexport function gradeCompanyAgainstText(\n  company: CompanyEvalCase,\n  thesisText: string,\n): { surfaced: number; total: number; perFact: ReturnType<typeof gradeFactAgainstText>[] } {\n  const perFact = company.facts.map((fact) => gradeFactAgainstText(fact, thesisText))\n  return {\n    surfaced: perFact.filter((result) => result.surfaced).length,\n    total: company.facts.length,\n    perFact,\n  }\n}\n\n/** Total held-out facts across the set (the denominator the doc reports). */\nexport function totalMaterialFacts(set: CompanyEvalCase[] = investmentThesisSet): number {\n  return set.reduce((sum, company) => sum + company.facts.length, 0)\n}\n\n/** Count facts per lens across the set — used to report (and bound) curation bias. */\nexport function lensDistribution(\n  set: CompanyEvalCase[] = investmentThesisSet,\n): Record<MaterialFactLens, number> {\n  const dist = {} as Record<MaterialFactLens, number>\n  for (const company of set) {\n    for (const fact of company.facts) {\n      dist[fact.lens] = (dist[fact.lens] ?? 0) + 1\n    }\n  }\n  return dist\n}\n","/**\n * The INVESTMENT-THESIS research task.\n *\n * Given `{ company, ticker, cik, cutoff }`, drive the SAME two-agent research\n * loop the ML deep-question A/B uses (`runVerifiedResearchLoop` + the real web\n * worker) to research the company AS OF the cutoff — web + SEC EDGAR, both public\n * — and produce an investment-thesis PAGE in the knowledge base: a judgment, the\n * drivers, and the risks, grounded in what it fetched.\n *\n * This file builds NOTHING new for the loop: it composes the existing worker +\n * driver + loop, supplies the readiness specs that steer the worker toward the\n * filing-level evidence (the analyst lenses), then writes a synthesis thesis page\n * the metric (`materialFactsSurfaced`) grades against the HELD-OUT checklist.\n *\n * THE FIREWALL: the task is told ONLY company + ticker + cutoff (+ the generic\n * analyst-lens readiness specs every company gets). It is NEVER shown the\n * checklist. The checklist is read only afterward, by the metric. So a high score\n * is research depth, not teaching-to-the-test.\n */\n\nimport { join } from 'node:path'\nimport { writeFileDurableWithinRoot } from './durable-fs'\nimport { defineReadinessSpec, type KnowledgeReadinessSpec } from './eval-readiness'\nimport { slugify } from './ids'\nimport { buildKnowledgeIndex } from './indexer'\nimport { kbIndexToText } from './material-facts-metric'\nimport { withKnowledgeMutation } from './mutation-lock'\nimport {\n  type ResearchDriver,\n  runVerifiedResearchLoop,\n  type VerifiedResearchLoopResult,\n} from './two-agent-research-loop'\nimport {\n  createWebResearchWorker,\n  type RouterClient,\n  type WebResearchWorkerOptions,\n} from './web-research-worker'\n\n/** The minimal brief a thesis run is given — the firewall boundary. */\nexport interface ThesisTaskInput {\n  /** Legal name as of the cutoff — what the loop researches. */\n  company: string\n  /** Ticker as of the cutoff. */\n  ticker: string\n  /** SEC Central Index Key (CIK), zero-stripped — the EDGAR filer id. */\n  cik: string\n  /** Research-as-of date (ISO). The loop must reason as if it is this date. */\n  cutoff: string\n  /** Sector, for the readiness query context (NOT a checklist hint). */\n  sector?: string\n}\n\n/**\n * The generic analyst-lens readiness specs every company gets. They are the ONLY\n * thing the loop is told about WHAT to look for, and they name the LENSES a\n * thorough analyst checks (balance-sheet risk, concentration, leverage, margins,\n * liquidity, governance, regulatory) and where they live (the latest SEC 10-K) —\n * NOT the answers. They steer the worker's web/EDGAR search toward the filing,\n * not toward the held-out facts (which the loop never sees).\n *\n * `minSources` is set above 1 so the readiness gate stays UNMET after a single\n * fetch and the loop runs multiple rounds — the depth-driving driver needs >1\n * round to steer, exactly as the ML-exam multi-round probe established.\n */\nexport function thesisReadinessSpecs(input: ThesisTaskInput): KnowledgeReadinessSpec[] {\n  const c = input.company\n  const t = input.ticker\n  const filing = `${c} ${t} SEC 10-K annual report SEC.gov EDGAR filing`\n  return [\n    defineReadinessSpec({\n      id: 'thesis/filing',\n      description: `the most recent SEC 10-K annual report for ${c} (${t}) filed on or before ${input.cutoff}, from SEC EDGAR`,\n      query: filing,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n    defineReadinessSpec({\n      id: 'thesis/balance-sheet',\n      description: `${c} balance-sheet risks: securities marked below cost, unrealized losses, leverage / total debt, debt maturities, interest expense`,\n      query: `${c} ${t} 10-K balance sheet total debt unrealized losses interest expense leverage`,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n    defineReadinessSpec({\n      id: 'thesis/concentration-liquidity',\n      description: `${c} concentration + liquidity: customer / deposit / revenue concentration, uninsured deposits, operating cash flow, net loss, inventory, equity erosion`,\n      query: `${c} ${t} 10-K customer deposit concentration operating cash flow net loss inventory`,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n    defineReadinessSpec({\n      id: 'thesis/governance-regulatory',\n      description: `${c} governance + regulatory: related-party transactions, dual-class / super-voting control, buybacks / dividends, recalls, regulatory or legal exposure, margin trends`,\n      query: `${c} ${t} 10-K related party dual class share repurchase recall regulatory gross margin`,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n  ]\n}\n\n/**\n * The thesis-writer prompt. After the loop has fetched + curated the filings, we\n * ask the model to SYNTHESIZE a thesis page from the curated KB text — a\n * judgment, the key drivers, and the material risks, grounded ONLY in the fetched\n * evidence. The held-out checklist is NOT in this prompt; the model writes from\n * what the loop actually pulled, so a fact only appears if the research surfaced\n * the underlying evidence.\n */\nfunction thesisSynthesisMessages(\n  input: ThesisTaskInput,\n  kbText: string,\n): { role: 'system' | 'user'; content: string }[] {\n  const system =\n    'You are a buy-side investment analyst writing a thesis memo. You are given ' +\n    'the raw research your team gathered from public filings (SEC 10-K) and the web. ' +\n    'Write a thesis that a thorough analyst would write: lead with your JUDGMENT, ' +\n    'then the KEY DRIVERS, then the MATERIAL RISKS. Be specific and quantitative — ' +\n    'name the actual figures, balance-sheet items, concentrations, leverage, ' +\n    'margin trends, governance items, and regulatory exposures that appear in the ' +\n    'research. Surface the buried, non-obvious drivers a one-line ticker summary ' +\n    'misses. Ground every claim in the research provided; do NOT invent figures. ' +\n    'If the research does not contain a figure, do not state it.'\n  const user = [\n    `Company: ${input.company} (${input.ticker})`,\n    `As-of date (reason as if it is this date): ${input.cutoff}`,\n    input.sector ? `Sector: ${input.sector}` : '',\n    '',\n    'Research gathered (filings + web excerpts):',\n    '\"\"\"',\n    kbText.slice(0, 24000),\n    '\"\"\"',\n    '',\n    'Write the investment thesis now. Structure:',\n    '## Judgment',\n    '## Key drivers',\n    '## Material risks',\n  ]\n    .filter(Boolean)\n    .join('\\n')\n  return [\n    { role: 'system', content: system },\n    { role: 'user', content: user },\n  ]\n}\n\n/** Write the synthesis thesis page into the KB so the index + metric pick it up. */\nasync function writeThesisPage(\n  root: string,\n  input: ThesisTaskInput,\n  thesis: string,\n): Promise<string> {\n  return withKnowledgeMutation(root, async () => {\n    const relativePath = `knowledge/thesis-${slugify(input.ticker)}.md`\n    const body = [\n      '---',\n      `title: Investment thesis — ${input.company} (${input.ticker})`,\n      `ticker: ${input.ticker}`,\n      `cutoff: ${input.cutoff}`,\n      'kind: investment-thesis',\n      '---',\n      `# Investment thesis — ${input.company} (${input.ticker}), as of ${input.cutoff}`,\n      '',\n      thesis.trim(),\n      '',\n    ].join('\\n')\n    await writeFileDurableWithinRoot(root, relativePath, body, { encoding: 'utf8' })\n    return join(root, relativePath)\n  })\n}\n\nexport interface ThesisRunOptions {\n  /** The KB root the loop writes into. */\n  root: string\n  /** Shared router client (web search + chat). Defaults to env creds. */\n  router: RouterClient\n  /** The driver — verify/dedup or research-driving. The loop's coordinator. */\n  driver: ResearchDriver\n  /** Round budget. Default 3 (the depth-driving driver needs >1). */\n  maxRounds?: number\n  /** Worker tuning forwarded to `createWebResearchWorker`. */\n  workerOptions?: Omit<WebResearchWorkerOptions, 'router'>\n  /** Max tokens for the synthesis pass. Default 1600 (above glm-5.2's reasoning floor). */\n  synthesisMaxTokens?: number\n  signal?: AbortSignal\n}\n\nexport interface ThesisRunResult {\n  loop: VerifiedResearchLoopResult\n  /** The synthesized thesis text. */\n  thesis: string\n  /** Path of the thesis page written into the KB. */\n  thesisPath: string\n}\n\n/**\n * Run the full thesis task: drive the two-agent loop to research the company AS\n * OF the cutoff, then synthesize + write the thesis page. Returns the loop result\n * + the thesis text + the page path. The caller grades the KB with\n * `materialFactsSurfaced(root, checklist)` — the checklist is never passed here.\n */\nexport async function runInvestmentThesisTask(\n  input: ThesisTaskInput,\n  options: ThesisRunOptions,\n): Promise<ThesisRunResult> {\n  const worker = createWebResearchWorker({ ...options.workerOptions, router: options.router })\n  const goal = `${input.company} (${input.ticker}) investment thesis as of ${input.cutoff}`\n\n  const loop = await runVerifiedResearchLoop({\n    root: options.root,\n    goal,\n    worker,\n    driver: options.driver,\n    readinessSpecs: thesisReadinessSpecs(input),\n    maxRounds: options.maxRounds ?? 3,\n    signal: options.signal,\n  })\n\n  // Synthesize the thesis from what the loop actually curated + fetched.\n  const index = await buildKnowledgeIndex(options.root)\n  const kbText = kbIndexToText(index)\n  const messages = thesisSynthesisMessages(input, kbText)\n  const thesis = await options.router.chat(messages, options.synthesisMaxTokens ?? 1600)\n\n  const thesisPath = await writeThesisPage(options.root, input, thesis)\n  return { loop, thesis, thesisPath }\n}\n","/**\n * `materialFactsSurfaced` — the held-out investment-research METRIC.\n *\n * Given a knowledge base a research loop built for a company and the company's\n * HELD-OUT material-fact checklist (`tests/eval/investment-thesis-set.ts`, never\n * shown to the loop), this returns the FRACTION of checklist items the KB's\n * pages surface + ground. The check is the same `$0`, model-free, deterministic\n * substring grader the loop's checklist already ships (`gradeFactAgainstText` /\n * `gradeCompanyAgainstText`) — so the answer key never reaches a model the loop\n * could observe, exactly the firewall the ML deep-question exam uses.\n *\n * The ONLY thing this file adds over the raw grader is the KB→text join: it reads\n * the curated pages (and the raw source text) the loop wrote and hands their\n * concatenation to the grader. That join mirrors `kbText` in the research-quality\n * A/B (research-driving-ab.test.ts) so the thesis metric and the ML-exam metric\n * read a KB the same way.\n *\n * WHY pages AND source text: an honest thesis surfaces a buried fact in its\n * curated thesis PAGE (the judgment), but a loop whose page is thin while its\n * fetched filings are rich should still get credit for what it actually pulled.\n * Grading the union is the faithful, not the lenient, choice — it rewards the\n * loop that REACHED the filing even if its synthesis was terse, and it cannot\n * manufacture a hit the underlying evidence does not contain.\n */\n\nimport { buildKnowledgeIndex } from './indexer'\nimport {\n  type CompanyEvalCase,\n  gradeCompanyAgainstText,\n  gradeFactAgainstText,\n} from './investment-thesis-set'\nimport type { KnowledgeIndex } from './types'\n\n/** Per-fact grade plus the fact's id/lens, for the audit trail. */\nexport interface FactResult {\n  id: string\n  lens: CompanyEvalCase['facts'][number]['lens']\n  surfaced: boolean\n  groupsFound: number\n  groupsTotal: number\n  foundLabels: string[]\n}\n\n/** The metric's result for one company: the surfaced fraction + the per-fact trail. */\nexport interface MaterialFactsResult {\n  ticker: string\n  company: string\n  /** Held-out facts the KB surfaced + grounded. */\n  surfaced: number\n  /** Total held-out facts for this company (the denominator). */\n  total: number\n  /** `surfaced / total` in [0, 1]. */\n  fraction: number\n  /** Per-fact grade, in checklist order, for the doc / audit. */\n  perFact: FactResult[]\n}\n\n/**\n * Join a KB index into the single text blob the grader scans: every curated PAGE\n * (title + body) followed by every raw SOURCE (title + fetched text). This is the\n * text read AFTER the loop finished — it is never handed to the loop. Identical\n * in spirit to `kbText` in the research-quality A/B so both metrics read a KB the\n * same way.\n */\nexport function kbIndexToText(index: KnowledgeIndex): string {\n  const pageText = index.pages.map((page) => `${page.title}\\n${page.text}`).join('\\n\\n')\n  const sourceText = index.sources\n    .map((source) => `${source.title ?? ''}\\n${source.text ?? ''}`)\n    .join('\\n\\n')\n  return `${pageText}\\n\\n${sourceText}`\n}\n\n/**\n * Grade one company's KB against its held-out material-fact checklist, given the\n * KB's already-joined text. The pure core — no I/O — so calibration can score a\n * hand-written shallow/deep thesis string directly and the live path can score a\n * real KB. Returns the surfaced FRACTION plus the per-fact audit trail.\n */\nexport function materialFactsSurfacedInText(\n  company: CompanyEvalCase,\n  kbText: string,\n): MaterialFactsResult {\n  const grade = gradeCompanyAgainstText(company, kbText)\n  const perFact: FactResult[] = company.facts.map((fact) => {\n    const r = gradeFactAgainstText(fact, kbText)\n    return {\n      id: fact.id,\n      lens: fact.lens,\n      surfaced: r.surfaced,\n      groupsFound: r.groupsFound,\n      groupsTotal: r.groupsTotal,\n      foundLabels: r.foundLabels,\n    }\n  })\n  return {\n    ticker: company.ticker,\n    company: company.company,\n    surfaced: grade.surfaced,\n    total: grade.total,\n    fraction: grade.total === 0 ? 0 : grade.surfaced / grade.total,\n    perFact,\n  }\n}\n\n/**\n * `materialFactsSurfaced(kb, checklist)` — the metric in its KB-reading form.\n *\n * `kb` is EITHER a knowledge-base root directory (the loop wrote pages there) or\n * an already-built `KnowledgeIndex`. `checklist` is the company's held-out\n * `CompanyEvalCase`. Returns the surfaced fraction + per-fact trail.\n *\n * The checklist is HELD OUT by construction: it lives in the test eval set, is\n * never passed to the loop, and is read only here, after the loop finished.\n */\nexport async function materialFactsSurfaced(\n  kb: string | KnowledgeIndex,\n  checklist: CompanyEvalCase,\n): Promise<MaterialFactsResult> {\n  const index = typeof kb === 'string' ? await buildKnowledgeIndex(kb) : kb\n  return materialFactsSurfacedInText(checklist, kbIndexToText(index))\n}\n","import type { KnowledgeReadinessReport } from '@tangle-network/agent-eval'\nimport {\n  type BuildEvalKnowledgeBundleOptions,\n  buildEvalKnowledgeBundle,\n  type EvalKnowledgeBundleBuildResult,\n  type KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport { createKnowledgeEvent } from './events'\nimport { buildKnowledgeIndex } from './indexer'\nimport { applyKnowledgeWriteBlocks } from './proposals'\nimport { readinessFor } from './readiness-helpers'\nimport { searchKnowledge } from './search'\nimport { type AddSourceOptions, type AddSourceTextInput, addSourceText } from './sources'\nimport { initKnowledgeBase } from './store'\nimport type { KnowledgeEvent, KnowledgeIndex, KnowledgeSearchResult, SourceRecord } from './types'\n\n/**\n * A knowledge gap the loop surfaces from `scoreKnowledgeReadiness`. The worker\n * targets these; the driver folds the unfilled remainder into the worker's next\n * prompt and runs its own gap-fill pass over them.\n */\nexport interface KnowledgeGap {\n  /** Readiness-spec id this gap belongs to. */\n  id: string\n  /** Human-readable description of what's missing. */\n  description: string\n  /** The search query the readiness check ran for this requirement. */\n  query: string\n  /** True when the gap blocks readiness (vs. a soft, non-blocking gap). */\n  blocking: boolean\n}\n\n/** A new source the worker (or driver) discovered and wants to add to the KB. */\nexport type ResearchSourceProposal = AddSourceTextInput\n\n/**\n * What a research agent contributes in one round. Both the worker and (when\n * `driverResearches` is on) the driver produce this shape — the worker ADDS\n * primary findings, the driver gap-FILLS the ones the worker missed.\n *\n * `proposalText` is the safe write-protocol text (`---FILE: knowledge/...---`\n * blocks). The loop only applies it AFTER the driver has verified the round's\n * sources, so a rejected source never reaches the curated pages.\n */\nexport interface ResearchContribution {\n  /** Immutable sources to register (the raw evidence). */\n  sources?: ResearchSourceProposal[]\n  /** Safe write-protocol text producing curated `knowledge/*.md` pages. */\n  proposalText?: string\n  /**\n   * Build the page write-protocol text FROM the sources the driver accepted —\n   * the curated, citing pages the readiness gate searches. Receives the\n   * registered `SourceRecord`s (with their assigned ids, so a page's frontmatter\n   * `sources:` can cite them). Returns `---FILE: knowledge/...---` block text or\n   * `undefined`. Runs after verification, so a page never cites a rejected\n   * source. Concatenated after any static `proposalText`.\n   */\n  buildPages?: (acceptedSources: SourceRecord[]) => string | undefined\n  /** Free-form research transcript — products can persist this. */\n  notes?: string\n  metadata?: Record<string, unknown>\n}\n\n/** Context handed to the worker each round. */\nexport interface WorkerResearchContext {\n  root: string\n  goal: string\n  round: number\n  index: KnowledgeIndex\n  /** Gaps the readiness gate currently reports — what the worker should close. */\n  gaps: KnowledgeGap[]\n  /** Steer text the driver folded in from the previous round's remaining gaps. */\n  steer?: string\n  readiness: EvalKnowledgeBundleBuildResult\n  signal?: AbortSignal\n}\n\n/** Context handed to the driver's verifier for one candidate source. */\nexport interface SourceVerificationContext {\n  root: string\n  goal: string\n  round: number\n  index: KnowledgeIndex\n  gaps: KnowledgeGap[]\n  /** Sources already accepted earlier THIS round (in-round dedup). */\n  acceptedThisRound: ResearchSourceProposal[]\n  signal?: AbortSignal\n}\n\n/** A single rejected source plus the reason the driver gave. */\nexport interface RejectedSource {\n  source: ResearchSourceProposal\n  reason: string\n}\n\n/** Context handed to the driver's gap-fill pass (only when `driverResearches`). */\nexport interface DriverResearchContext {\n  root: string\n  goal: string\n  round: number\n  index: KnowledgeIndex\n  /** Gaps STILL open after the worker's accepted contribution applied. */\n  remainingGaps: KnowledgeGap[]\n  readiness: EvalKnowledgeBundleBuildResult\n  signal?: AbortSignal\n}\n\n/**\n * The differentiated driver role.\n *\n * - `verifySource` — the gate the worker's additions pass before they commit.\n *   Return `{ accept: true }` to keep a source or `{ accept: false, reason }`\n *   to reject it (not real / not relevant / duplicate). The loop dedups exact\n *   duplicates (same `uri` already in the KB or accepted this round) BEFORE\n *   calling this, so the verifier only sees genuinely-new candidates.\n * - `research` — the driver's OWN gap-fill pass over the gaps the worker left\n *   open. Only invoked when `driverResearches` is true.\n * - `foldGaps` — turn the remaining gaps into a steer string for the worker's\n *   next prompt. Defaults to a compact bulleted list when omitted.\n */\nexport interface ResearchDriver {\n  verifySource(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<SourceVerdict> | SourceVerdict\n  research?(ctx: DriverResearchContext): Promise<ResearchContribution> | ResearchContribution\n  foldGaps?(gaps: KnowledgeGap[]): string\n}\n\nexport type SourceVerdict = { accept: true } | { accept: false; reason: string }\n\n/** The worker: primary research targeting the round's gaps. */\nexport type ResearchWorker = (\n  ctx: WorkerResearchContext,\n) => Promise<ResearchContribution> | ResearchContribution\n\nexport interface VerifiedResearchLoopOptions {\n  root: string\n  goal: string\n  worker: ResearchWorker\n  driver: ResearchDriver\n  /**\n   * When false (default), the driver ONLY verifies + gates — a pure coordinator\n   * that contributes no research of its own (the \"doesn't participate in the\n   * work\" mode). When true, the driver also runs its `research` gap-fill pass\n   * each round over the gaps the worker left open.\n   */\n  driverResearches?: boolean\n  maxRounds?: number\n  actor?: string\n  /** Readiness specs define the gate; an empty list means the loop never gates. */\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  sourceOptions?: Pick<AddSourceOptions, 'adapters' | 'now'>\n  signal?: AbortSignal\n  onRound?: (round: VerifiedResearchRound) => Promise<void> | void\n}\n\nexport interface VerifiedResearchRound {\n  round: number\n  /** Gaps reported at the START of the round (what the worker targeted). */\n  gaps: KnowledgeGap[]\n  /** Worker sources accepted by the driver and written to the KB. */\n  acceptedWorkerSources: SourceRecord[]\n  /** Worker sources the driver rejected (with reasons) — never written. */\n  rejectedWorkerSources: RejectedSource[]\n  /** Sources the driver itself added in its gap-fill pass. */\n  driverSources: SourceRecord[]\n  /** Curated pages written this round (worker proposal + driver proposal). */\n  writtenPages: string[]\n  readiness?: EvalKnowledgeBundleBuildResult\n  /** True once the readiness gate reports no blocking gaps. */\n  ready: boolean\n  event: KnowledgeEvent\n  notes: { worker?: string; driver?: string }\n}\n\nexport interface VerifiedResearchLoopResult {\n  root: string\n  goal: string\n  rounds: number\n  ready: boolean\n  index: KnowledgeIndex\n  readiness?: EvalKnowledgeBundleBuildResult\n  steps: VerifiedResearchRound[]\n}\n\n/**\n * Two-agent (driver + worker) sibling of `runKnowledgeResearchLoop`.\n *\n * Both agents research to grow ONE knowledge base. The roles are differentiated:\n *\n * - **WORKER** = primary research. Each round it reads the open gaps, discovers\n *   new sources, and proposes additions (`sources` + `proposalText`). It ADDS.\n * - **DRIVER** = the verifier / gap-filler / gate. It (1) VERIFIES the worker's\n *   sources before they commit — dedup against the KB, then `verifySource`\n *   rejects ones that aren't real/relevant; (2) GAP-FILLS the gaps the worker\n *   missed with its own research pass (when `driverResearches`); (3) folds the\n *   remaining gaps into the worker's next prompt; and (4) GATES on\n *   `scoreKnowledgeReadiness` — the loop stops as soon as there are no blocking\n *   gaps.\n *\n * Set `driverResearches: false` (default) for the pure-coordinator mode: the\n * driver only verifies + gates and contributes no research itself.\n *\n * Composes existing atoms — `initKnowledgeBase`, `addSourceText`,\n * `applyKnowledgeWriteBlocks`, `buildEvalKnowledgeBundle` (the readiness gate),\n * and `searchKnowledge` — and reinvents none of them.\n */\nexport async function runVerifiedResearchLoop(\n  options: VerifiedResearchLoopOptions,\n): Promise<VerifiedResearchLoopResult> {\n  const maxRounds = Math.max(1, options.maxRounds ?? 3)\n  await initKnowledgeBase(options.root)\n  const steps: VerifiedResearchRound[] = []\n  let index = await buildKnowledgeIndex(options.root)\n  let readiness = readinessFor(options, index)\n  let ready = isReady(readiness?.report)\n  let steer: string | undefined\n\n  for (let round = 1; round <= maxRounds && !ready; round++) {\n    if (options.signal?.aborted) throw new Error('Two-agent research loop aborted')\n\n    const gaps = gapsFromReadiness(readiness)\n\n    // 1. WORKER: primary research over the open gaps.\n    const workerContribution = await options.worker({\n      root: options.root,\n      goal: options.goal,\n      round,\n      index,\n      gaps,\n      steer,\n      readiness: requireReadiness(readiness, options),\n      signal: options.signal,\n    })\n\n    // 2. DRIVER VERIFIES the worker's sources before they commit.\n    const accepted: ResearchSourceProposal[] = []\n    const rejectedWorkerSources: RejectedSource[] = []\n    // Dedup against the ORIGINAL input uri. `addSourceText` rewrites `record.uri`\n    // to a slugified raw path and stashes the caller's uri under\n    // `metadata.originalUri`, so that — not the stored uri — is the round-to-round\n    // identity a verifier dedups against.\n    const existingUris = new Set(\n      index.sources.flatMap((source) =>\n        typeof source.metadata?.originalUri === 'string' ? [source.metadata.originalUri] : [],\n      ),\n    )\n    for (const source of workerContribution.sources ?? []) {\n      if (isDuplicate(source, existingUris, accepted)) {\n        rejectedWorkerSources.push({ source, reason: 'duplicate: already in the knowledge base' })\n        continue\n      }\n      const verdict = await options.driver.verifySource(source, {\n        root: options.root,\n        goal: options.goal,\n        round,\n        index,\n        gaps,\n        acceptedThisRound: accepted,\n        signal: options.signal,\n      })\n      if (verdict.accept) accepted.push(source)\n      else rejectedWorkerSources.push({ source, reason: verdict.reason })\n    }\n\n    // Register the accepted worker sources, then apply the worker's curated\n    // pages — but only when at least one source survived verification, so a\n    // page never cites a rejected source.\n    const acceptedWorkerSources = await registerSources(options, accepted)\n    const writtenPages: string[] = []\n    writtenPages.push(\n      ...(await applyPages(options.root, workerContribution, acceptedWorkerSources)),\n    )\n\n    // Re-index so the driver's gap-fill pass sees the worker's contribution.\n    index = await buildKnowledgeIndex(options.root)\n    readiness = readinessFor(options, index)\n\n    // 3. DRIVER GAP-FILLS the gaps the worker left open (opt-in).\n    let driverSources: SourceRecord[] = []\n    let driverNotes: string | undefined\n    if (options.driverResearches && options.driver.research) {\n      const remainingGaps = gapsFromReadiness(readiness)\n      const driverContribution = await options.driver.research({\n        root: options.root,\n        goal: options.goal,\n        round,\n        index,\n        remainingGaps,\n        readiness: requireReadiness(readiness, options),\n        signal: options.signal,\n      })\n      driverNotes = driverContribution.notes\n      driverSources = await registerSources(options, driverContribution.sources ?? [])\n      writtenPages.push(...(await applyPages(options.root, driverContribution, driverSources)))\n      index = await buildKnowledgeIndex(options.root)\n      readiness = readinessFor(options, index)\n    }\n\n    // 4. DRIVER GATES on readiness and folds the remainder into the next prompt.\n    ready = isReady(readiness?.report)\n    const remainingGaps = gapsFromReadiness(readiness)\n    steer = ready ? undefined : foldGaps(options.driver, remainingGaps)\n\n    const step: VerifiedResearchRound = {\n      round,\n      gaps,\n      acceptedWorkerSources,\n      rejectedWorkerSources,\n      driverSources,\n      writtenPages,\n      readiness,\n      ready,\n      event: createKnowledgeEvent({\n        type: 'research.iteration',\n        actor: options.actor,\n        target: options.root,\n        metadata: {\n          goal: options.goal,\n          round,\n          ready,\n          acceptedWorkerSourceCount: acceptedWorkerSources.length,\n          rejectedWorkerSourceCount: rejectedWorkerSources.length,\n          driverSourceCount: driverSources.length,\n          writtenPageCount: writtenPages.length,\n          remainingGapCount: remainingGaps.length,\n        },\n      }),\n      notes: { worker: workerContribution.notes, driver: driverNotes },\n    }\n    steps.push(step)\n    await options.onRound?.(step)\n  }\n\n  return {\n    root: options.root,\n    goal: options.goal,\n    rounds: steps.length,\n    ready,\n    index,\n    readiness,\n    steps,\n  }\n}\n\nfunction isReady(report: KnowledgeReadinessReport | undefined): boolean {\n  // No specs ⇒ no gate ⇒ the loop runs to `maxRounds`. With specs, the gate is\n  // \"no blocking gaps remain\".\n  if (!report) return false\n  return report.blockingMissingRequirements.length === 0\n}\n\nfunction gapsFromReadiness(readiness: EvalKnowledgeBundleBuildResult | undefined): KnowledgeGap[] {\n  if (!readiness) return []\n  const blocking = readiness.report.blockingMissingRequirements.map((requirement) =>\n    gapFor(requirement, readiness, true),\n  )\n  const nonBlocking = readiness.report.nonBlockingGaps.map((requirement) =>\n    gapFor(requirement, readiness, false),\n  )\n  return [...blocking, ...nonBlocking]\n}\n\nfunction gapFor(\n  requirement: { id: string; description: string; metadata?: Record<string, unknown> },\n  readiness: EvalKnowledgeBundleBuildResult,\n  blocking: boolean,\n): KnowledgeGap {\n  const spec = readiness.requirements.find((entry) => entry.id === requirement.id)\n  const query =\n    typeof spec?.metadata?.query === 'string' ? spec.metadata.query : requirement.description\n  return { id: requirement.id, description: requirement.description, query, blocking }\n}\n\nfunction foldGaps(driver: ResearchDriver, gaps: KnowledgeGap[]): string | undefined {\n  if (gaps.length === 0) return undefined\n  if (driver.foldGaps) return driver.foldGaps(gaps)\n  return [\n    'The knowledge base is still missing the following. Prioritise these next round:',\n    ...gaps.map(\n      (gap) => `- (${gap.blocking ? 'blocking' : 'soft'}) ${gap.description} [${gap.id}]`,\n    ),\n  ].join('\\n')\n}\n\nfunction isDuplicate(\n  source: ResearchSourceProposal,\n  existingUris: Set<string>,\n  accepted: ResearchSourceProposal[],\n): boolean {\n  return existingUris.has(source.uri) || accepted.some((candidate) => candidate.uri === source.uri)\n}\n\nasync function registerSources(\n  options: VerifiedResearchLoopOptions,\n  sources: ResearchSourceProposal[],\n): Promise<SourceRecord[]> {\n  const records: SourceRecord[] = []\n  for (const source of sources) {\n    records.push(await addSourceText(options.root, source, options.sourceOptions))\n  }\n  return records\n}\n\n/**\n * Apply a contribution's curated pages. Static `proposalText` plus a\n * `buildPages(acceptedSources)` result are concatenated and run through the safe\n * write protocol — but ONLY when at least one source survived verification, so a\n * page never cites a rejected (or absent) source.\n */\nasync function applyPages(\n  root: string,\n  contribution: ResearchContribution,\n  acceptedSources: SourceRecord[],\n): Promise<string[]> {\n  if (acceptedSources.length === 0) return []\n  const parts: string[] = []\n  if (contribution.proposalText) parts.push(contribution.proposalText)\n  const built = contribution.buildPages?.(acceptedSources)\n  if (built) parts.push(built)\n  if (parts.length === 0) return []\n  const applied = await applyKnowledgeWriteBlocks(root, parts.join('\\n'))\n  return applied.written\n}\n\nfunction requireReadiness(\n  readiness: EvalKnowledgeBundleBuildResult | undefined,\n  options: VerifiedResearchLoopOptions,\n): EvalKnowledgeBundleBuildResult {\n  if (readiness) return readiness\n  // The worker/driver contexts type `readiness` as required for ergonomics; when\n  // no specs are configured there is no gate to report, so synthesise an empty\n  // bundle rather than forcing every caller to handle `undefined`.\n  return buildEvalKnowledgeBundle({\n    ...(options.readiness ?? {}),\n    taskId: options.readinessTaskId ?? options.goal,\n    index: emptyIndex(options.root),\n    specs: [],\n  })\n}\n\nfunction emptyIndex(root: string): KnowledgeIndex {\n  return {\n    root,\n    generatedAt: new Date(0).toISOString(),\n    sources: [],\n    pages: [],\n    graph: { nodes: [], edges: [] },\n  }\n}\n\n/**\n * Helper for verifiers: does the candidate source's text/title overlap any page\n * the readiness search returns for a gap query? A cheap relevance heuristic the\n * driver can compose into `verifySource` (real verifiers can do more).\n */\nexport function sourceMatchesGaps(\n  source: ResearchSourceProposal,\n  index: KnowledgeIndex,\n  gaps: KnowledgeGap[],\n): KnowledgeSearchResult[] {\n  const haystack = `${source.title ?? ''}\\n${source.text}`.toLowerCase()\n  const hits: KnowledgeSearchResult[] = []\n  for (const gap of gaps) {\n    for (const token of gap.query.toLowerCase().split(/\\s+/).filter(Boolean)) {\n      if (haystack.includes(token)) {\n        hits.push(...searchKnowledge(index, gap.query, 1))\n        break\n      }\n    }\n  }\n  return hits\n}\n\n// ── Deprecated aliases ───────────────────────────────────────────────────────────\n// The old \"TwoAgent\" names described the MECHANISM (a proposer worker + a verifier driver)\n// instead of the VALUE (research whose sources are verified before admission). Kept as\n// aliases so existing importers do not break; prefer the `Verified*` names.\n\n/** @deprecated Renamed to {@link runVerifiedResearchLoop}. */\nexport const runTwoAgentResearchLoop = runVerifiedResearchLoop\n/** @deprecated Renamed to {@link VerifiedResearchLoopOptions}. */\nexport type TwoAgentResearchLoopOptions = VerifiedResearchLoopOptions\n/** @deprecated Renamed to {@link VerifiedResearchLoopResult}. */\nexport type TwoAgentResearchLoopResult = VerifiedResearchLoopResult\n/** @deprecated Renamed to {@link VerifiedResearchRound}. */\nexport type TwoAgentResearchRound = VerifiedResearchRound\n","import { z } from 'zod'\nimport { readRegularFileWithinRoot, writeJsonDurableWithinRoot } from './durable-fs'\nimport type { KnowledgeEventQuery } from './events'\nimport { buildKnowledgeGraph } from './graph'\nimport { withKnowledgeMutation, withKnowledgeRead } from './mutation-lock'\nimport {\n  KnowledgeEventSchema,\n  KnowledgeIndexSchema,\n  KnowledgePageSchema,\n  SourceRecordSchema,\n} from './schemas'\nimport type { KnowledgeEvent, KnowledgeIndex, KnowledgePage, SourceRecord } from './types'\n\nexport interface KbStore {\n  putSource(source: SourceRecord): Promise<void>\n  getSource(id: string): Promise<SourceRecord | null>\n  listSources(): Promise<SourceRecord[]>\n  putPage(page: KnowledgePage): Promise<void>\n  getPage(idOrPath: string): Promise<KnowledgePage | null>\n  listPages(): Promise<KnowledgePage[]>\n  putIndex(index: KnowledgeIndex): Promise<void>\n  getIndex(): Promise<KnowledgeIndex | null>\n  putEvent(event: KnowledgeEvent): Promise<void>\n  listEvents(query?: KnowledgeEventQuery): Promise<KnowledgeEvent[]>\n}\n\nexport class MemoryKbStore implements KbStore {\n  private readonly sources = new Map<string, SourceRecord>()\n  private readonly pages = new Map<string, KnowledgePage>()\n  private readonly events: KnowledgeEvent[] = []\n  private index: KnowledgeIndex | null = null\n\n  async putSource(source: SourceRecord): Promise<void> {\n    this.sources.set(source.id, clone(source))\n  }\n\n  async getSource(id: string): Promise<SourceRecord | null> {\n    return clone(this.sources.get(id) ?? null)\n  }\n\n  async listSources(): Promise<SourceRecord[]> {\n    return [...this.sources.values()].map(clone)\n  }\n\n  async putPage(page: KnowledgePage): Promise<void> {\n    this.pages.set(page.id, clone(page))\n  }\n\n  async getPage(idOrPath: string): Promise<KnowledgePage | null> {\n    return clone(\n      this.pages.get(idOrPath) ??\n        [...this.pages.values()].find((page) => page.path === idOrPath) ??\n        null,\n    )\n  }\n\n  async listPages(): Promise<KnowledgePage[]> {\n    return [...this.pages.values()].map(clone)\n  }\n\n  async putIndex(index: KnowledgeIndex): Promise<void> {\n    this.index = clone(index)\n  }\n\n  async getIndex(): Promise<KnowledgeIndex | null> {\n    if (this.index) return clone(this.index)\n    const pages = await this.listPages()\n    const sources = await this.listSources()\n    return {\n      root: 'memory',\n      generatedAt: new Date().toISOString(),\n      sources,\n      pages,\n      graph: buildKnowledgeGraph(pages),\n    }\n  }\n\n  async putEvent(event: KnowledgeEvent): Promise<void> {\n    this.events.push(clone(event))\n  }\n\n  async listEvents(query: KnowledgeEventQuery = {}): Promise<KnowledgeEvent[]> {\n    let out = this.events\n    if (query.type) out = out.filter((event) => event.type === query.type)\n    if (query.target) out = out.filter((event) => event.target === query.target)\n    out = [...out].sort((a, b) => a.createdAt.localeCompare(b.createdAt))\n    return out.slice(-(query.limit ?? out.length)).map(clone)\n  }\n}\n\nconst knowledgeEventsSchema = z.array(KnowledgeEventSchema)\n\nexport class FileSystemKbStore implements KbStore {\n  constructor(private readonly dir: string) {}\n\n  async putSource(source: SourceRecord): Promise<void> {\n    const parsed = SourceRecordSchema.parse(source) as SourceRecord\n    await this.updateIndex((index) => ({\n      ...index,\n      generatedAt: new Date().toISOString(),\n      sources: [parsed, ...index.sources.filter((entry) => entry.id !== parsed.id)],\n    }))\n  }\n\n  async getSource(id: string): Promise<SourceRecord | null> {\n    return withKnowledgeRead(this.dir, async () => {\n      const index = await this.readIndex()\n      return clone(index?.sources.find((source) => source.id === id) ?? null)\n    })\n  }\n\n  async listSources(): Promise<SourceRecord[]> {\n    return withKnowledgeRead(this.dir, async () => clone((await this.readIndex())?.sources ?? []))\n  }\n\n  async putPage(page: KnowledgePage): Promise<void> {\n    const parsed = KnowledgePageSchema.parse(page) as KnowledgePage\n    await this.updateIndex((index) => {\n      const pages = [parsed, ...index.pages.filter((entry) => entry.id !== parsed.id)]\n      return {\n        ...index,\n        generatedAt: new Date().toISOString(),\n        pages,\n        graph: buildKnowledgeGraph(pages),\n      }\n    })\n  }\n\n  async getPage(idOrPath: string): Promise<KnowledgePage | null> {\n    return withKnowledgeRead(this.dir, async () => {\n      const index = await this.readIndex()\n      return clone(\n        index?.pages.find((page) => page.id === idOrPath || page.path === idOrPath) ?? null,\n      )\n    })\n  }\n\n  async listPages(): Promise<KnowledgePage[]> {\n    return withKnowledgeRead(this.dir, async () => clone((await this.readIndex())?.pages ?? []))\n  }\n\n  async putIndex(index: KnowledgeIndex): Promise<void> {\n    const parsed = KnowledgeIndexSchema.parse(index) as KnowledgeIndex\n    await withKnowledgeMutation(this.dir, () =>\n      writeJsonDurableWithinRoot(this.dir, 'index.json', parsed),\n    )\n  }\n\n  async getIndex(): Promise<KnowledgeIndex | null> {\n    return withKnowledgeRead(this.dir, () => this.readIndex())\n  }\n\n  async putEvent(event: KnowledgeEvent): Promise<void> {\n    const parsed = KnowledgeEventSchema.parse(event) as KnowledgeEvent\n    await withKnowledgeMutation(this.dir, async () => {\n      const current = await this.readEvents()\n      const next = [...current.filter((entry) => entry.id !== parsed.id), parsed].sort((a, b) =>\n        a.createdAt.localeCompare(b.createdAt),\n      )\n      await writeJsonDurableWithinRoot(this.dir, 'events.json', next)\n    })\n  }\n\n  async listEvents(query: KnowledgeEventQuery = {}): Promise<KnowledgeEvent[]> {\n    return withKnowledgeRead(this.dir, async () => {\n      let events = await this.readEvents()\n      if (query.type) events = events.filter((event) => event.type === query.type)\n      if (query.target) events = events.filter((event) => event.target === query.target)\n      return clone(events.slice(-(query.limit ?? events.length)))\n    })\n  }\n\n  private async updateIndex(change: (index: KnowledgeIndex) => KnowledgeIndex): Promise<void> {\n    await withKnowledgeMutation(this.dir, async () => {\n      const current = (await this.readIndex()) ?? emptyIndex(this.dir)\n      const next = KnowledgeIndexSchema.parse(change(current)) as KnowledgeIndex\n      await writeJsonDurableWithinRoot(this.dir, 'index.json', next)\n    })\n  }\n\n  private async readIndex(): Promise<KnowledgeIndex | null> {\n    return readJsonFile(\n      this.dir,\n      'index.json',\n      KnowledgeIndexSchema,\n    ) as Promise<KnowledgeIndex | null>\n  }\n\n  private async readEvents(): Promise<KnowledgeEvent[]> {\n    return ((await readJsonFile(this.dir, 'events.json', knowledgeEventsSchema)) ??\n      []) as KnowledgeEvent[]\n  }\n}\n\nfunction emptyIndex(root: string): KnowledgeIndex {\n  return {\n    root,\n    generatedAt: new Date(0).toISOString(),\n    sources: [],\n    pages: [],\n    graph: { nodes: [], edges: [] },\n  }\n}\n\nasync function readJsonFile<T>(\n  root: string,\n  relativePath: string,\n  schema: z.ZodType<T>,\n): Promise<T | null> {\n  try {\n    const file = await readRegularFileWithinRoot(root, relativePath)\n    return schema.parse(JSON.parse(file.bytes.toString('utf8')))\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException | null)?.code === 'ENOENT') return null\n    throw error\n  }\n}\n\nfunction clone<T>(value: T): T {\n  return value == null ? value : (JSON.parse(JSON.stringify(value)) as T)\n}\n","/**\n * Bridge from `AnalystFinding` (agent-eval) to knowledge proposals.\n *\n * Closes the failure → wiki side of the recursive-self-improvement\n * loop: a knowledge-gap or knowledge-poisoning finding produced by an\n * analyst becomes a concrete proposal an operator (or auto-merge bot)\n * can review and apply. The bridge is intentionally lossless on the\n * fail-loud side — a finding the parser can't classify returns a\n * `KnowledgeProposalParseError` rather than a silent skip, so the\n * loop never accepts an underspecified edit.\n *\n * Subject grammar this bridge understands (analyst-side convention,\n * stamped in the kind prompts):\n *\n *   agent-knowledge:wiki:<page-slug>            create / update page\n *   agent-knowledge:wiki:<page-slug>#<heading>  insert section under page\n *   agent-knowledge:claim:<topic>               draft claim row\n *   agent-knowledge:raw:<source-id>             lift raw → curated\n *   agent-knowledge:stale:<page-slug>           mark page superseded\n *\n * Anything else (websearch:outdated:*, tool-doc:*, system-prompt:*,\n * memory:*) is NOT a knowledge-base concern and returns `null` so the\n * loop's improvement-applier handles it.\n */\n\nimport type { AnalystFinding, AnalystSeverity } from '@tangle-network/agent-eval'\nimport type { ClaimRef, KnowledgeClaim, KnowledgeWriteBlock } from './types'\n\nexport interface KnowledgeProposal {\n  /**\n   * Stable id derived from the finding so cross-run diffs share an\n   * identity. Re-proposing the same finding produces the same id.\n   */\n  id: string\n  /** The finding that generated this proposal — useful for audit + revert. */\n  sourceFindingId: string\n  /** What the proposal does. */\n  kind:\n    | 'create-page'\n    | 'update-page'\n    | 'append-section'\n    | 'create-claim'\n    | 'lift-raw'\n    | 'mark-stale'\n  /** Locus on disk (page slug or claim topic). */\n  locus: string\n  /**\n   * Page write blocks the standard `applyKnowledgeWriteBlocks` consumer\n   * accepts. Empty for proposals that don't change page text (e.g.\n   * `create-claim` produces a `claim` field instead).\n   */\n  writeBlocks: KnowledgeWriteBlock[]\n  /**\n   * Granular claim draft for proposals whose unit-of-change is a claim\n   * row rather than a whole page. `status: 'draft'` until reviewed.\n   */\n  claim?: KnowledgeClaim\n  /** Per-proposal metadata: severity, confidence, source span. */\n  metadata: {\n    severity: AnalystSeverity\n    confidence: number\n    evidence_uri?: string\n    analyst_id: string\n  }\n}\n\nexport class KnowledgeProposalParseError extends Error {\n  constructor(\n    public readonly findingId: string,\n    public readonly subject: string,\n    message: string,\n  ) {\n    super(`proposeFromFinding(${findingId}, subject=${subject}): ${message}`)\n    this.name = 'KnowledgeProposalParseError'\n  }\n}\n\n/**\n * Convert one `AnalystFinding` into a knowledge proposal. Returns\n * `null` when the finding's locus isn't a knowledge-base concern\n * (`websearch:outdated:*`, `tool-doc:*`, `system-prompt:*`,\n * `memory:*`, missing subject). Throws when the locus IS a\n * knowledge-base concern but is malformed — that's a bug in the\n * analyst prompt and should fail loud.\n *\n * Caller convention: feed the function the analyst's full findings\n * list and filter out the `null`s; the orchestrator passes the\n * remaining proposals to the existing review / apply pipeline.\n */\nexport function proposeFromFinding(finding: AnalystFinding): KnowledgeProposal | null {\n  if (!finding.subject) return null\n  if (!finding.subject.startsWith('agent-knowledge:')) return null\n\n  const rest = finding.subject.slice('agent-knowledge:'.length)\n  const [kindPart, ...locusParts] = rest.split(':')\n  const locus = locusParts.join(':')\n  if (!kindPart || !locus) {\n    throw new KnowledgeProposalParseError(\n      finding.finding_id,\n      finding.subject,\n      'expected `agent-knowledge:<kind>:<locus>` shape',\n    )\n  }\n\n  const baseMeta: KnowledgeProposal['metadata'] = {\n    severity: finding.severity,\n    confidence: finding.confidence,\n    evidence_uri: finding.evidence_refs[0]?.uri,\n    analyst_id: finding.analyst_id,\n  }\n\n  switch (kindPart) {\n    case 'wiki':\n      return wikiProposal(finding, locus, baseMeta)\n    case 'claim':\n      return claimProposal(finding, locus, baseMeta)\n    case 'raw':\n      return liftRawProposal(finding, locus, baseMeta)\n    case 'stale':\n      return markStaleProposal(finding, locus, baseMeta)\n    default:\n      throw new KnowledgeProposalParseError(\n        finding.finding_id,\n        finding.subject,\n        `unknown kind \"${kindPart}\" (expected one of: wiki | claim | raw | stale)`,\n      )\n  }\n}\n\nfunction wikiProposal(\n  finding: AnalystFinding,\n  locus: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const hashIdx = locus.indexOf('#')\n  const pageSlug = hashIdx >= 0 ? locus.slice(0, hashIdx) : locus\n  const heading = hashIdx >= 0 ? locus.slice(hashIdx + 1) : null\n  const path = `knowledge/${ensureSlug(pageSlug)}.md`\n\n  const body = renderWikiBody(finding, pageSlug, heading)\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: heading ? 'append-section' : 'create-page',\n    locus: pageSlug,\n    writeBlocks: [{ path, content: body }],\n    metadata,\n  }\n}\n\nfunction claimProposal(\n  finding: AnalystFinding,\n  locus: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const refs: ClaimRef[] = finding.evidence_refs\n    .filter((r) => r.uri)\n    .map((r) => ({\n      sourceId: `analyst-finding:${finding.finding_id}`,\n      anchorId: r.uri,\n      quote: r.excerpt,\n    }))\n  const claim: KnowledgeClaim = {\n    id: `claim-${finding.finding_id}`,\n    text: finding.recommended_action ?? finding.claim,\n    refs,\n    confidence: finding.confidence,\n    status: 'draft',\n    metadata: {\n      analyst_id: finding.analyst_id,\n      source_finding_id: finding.finding_id,\n      topic: locus,\n    },\n  }\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: 'create-claim',\n    locus,\n    writeBlocks: [],\n    claim,\n    metadata,\n  }\n}\n\nfunction liftRawProposal(\n  finding: AnalystFinding,\n  sourceId: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const path = `knowledge/${ensureSlug(sourceId)}.md`\n  const body = [\n    '---',\n    `title: ${sourceId}`,\n    `source: ${sourceId}`,\n    `status: draft`,\n    `lifted_from_finding: ${finding.finding_id}`,\n    '---',\n    '',\n    '## Why this page exists',\n    '',\n    finding.claim,\n    '',\n    ...(finding.rationale ? ['## Rationale', '', finding.rationale, ''] : []),\n    ...(finding.recommended_action\n      ? ['## Recommended action', '', finding.recommended_action, '']\n      : []),\n  ].join('\\n')\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: 'lift-raw',\n    locus: sourceId,\n    writeBlocks: [{ path, content: body }],\n    metadata,\n  }\n}\n\nfunction markStaleProposal(\n  finding: AnalystFinding,\n  pageSlug: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const path = `knowledge/${ensureSlug(pageSlug)}.stale.md`\n  const body = [\n    '---',\n    `title: ${pageSlug} (marked stale)`,\n    `status: superseded`,\n    `superseded_by_finding: ${finding.finding_id}`,\n    `confidence: ${finding.confidence}`,\n    '---',\n    '',\n    '## Why marked stale',\n    '',\n    finding.claim,\n    '',\n    ...(finding.rationale ? ['## Evidence', '', finding.rationale, ''] : []),\n    ...(finding.recommended_action ? ['## Action', '', finding.recommended_action, ''] : []),\n  ].join('\\n')\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: 'mark-stale',\n    locus: pageSlug,\n    writeBlocks: [{ path, content: body }],\n    metadata,\n  }\n}\n\n/**\n * Plural convenience: filter + map across an entire findings batch\n * with one call. Parse errors collect into `errors[]`; the loop\n * decides per-error whether to abort or continue.\n */\nexport interface ProposeFromFindingsResult {\n  proposals: KnowledgeProposal[]\n  skipped: number\n  errors: KnowledgeProposalParseError[]\n}\n\nexport function proposeFromFindings(\n  findings: ReadonlyArray<AnalystFinding>,\n): ProposeFromFindingsResult {\n  const proposals: KnowledgeProposal[] = []\n  const errors: KnowledgeProposalParseError[] = []\n  let skipped = 0\n  for (const f of findings) {\n    try {\n      const p = proposeFromFinding(f)\n      if (p) proposals.push(p)\n      else skipped += 1\n    } catch (err) {\n      if (err instanceof KnowledgeProposalParseError) errors.push(err)\n      else throw err\n    }\n  }\n  return { proposals, skipped, errors }\n}\n\nfunction ensureSlug(s: string): string {\n  return (\n    s\n      .toLowerCase()\n      .replace(/[^a-z0-9-]+/g, '-')\n      .replace(/^-+|-+$/g, '')\n      .slice(0, 200) || 'untitled'\n  )\n}\n\nfunction renderWikiBody(finding: AnalystFinding, slug: string, heading: string | null): string {\n  const title = humanize(slug)\n  if (heading) {\n    return [\n      `## ${heading}`,\n      '',\n      finding.claim,\n      '',\n      ...(finding.rationale ? ['### Rationale', '', finding.rationale, ''] : []),\n      ...(finding.recommended_action ? ['### Action', '', finding.recommended_action, ''] : []),\n      `_Drafted from finding ${finding.finding_id} (confidence ${finding.confidence.toFixed(2)})._`,\n    ].join('\\n')\n  }\n  return [\n    '---',\n    `title: ${title}`,\n    `status: draft`,\n    `drafted_from_finding: ${finding.finding_id}`,\n    `confidence: ${finding.confidence}`,\n    '---',\n    '',\n    `# ${title}`,\n    '',\n    finding.claim,\n    '',\n    ...(finding.rationale ? ['## Rationale', '', finding.rationale, ''] : []),\n    ...(finding.recommended_action\n      ? ['## Recommended action', '', finding.recommended_action, '']\n      : []),\n  ].join('\\n')\n}\n\nfunction humanize(slug: string): string {\n  return (\n    slug\n      .split('-')\n      .filter(Boolean)\n      .map((w) => w[0]?.toUpperCase() + w.slice(1))\n      .join(' ') || slug\n  )\n}\n","import type {\n  BuildEvalKnowledgeBundleOptions,\n  EvalKnowledgeBundleBuildResult,\n  KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport { buildKnowledgeIndex } from './indexer'\nimport {\n  type KnowledgeBaseQualityOptions,\n  type KnowledgeBaseQualityReport,\n  scoreKnowledgeBaseIndex,\n} from './rag-eval'\nimport { readinessFor } from './readiness-helpers'\nimport type { KnowledgeIndex } from './types'\nimport {\n  type ValidateKnowledgeOptions,\n  type ValidateKnowledgeResult,\n  validateKnowledgeIndex,\n} from './validate'\n\nexport interface EvaluateKnowledgeBaseReadinessOptions {\n  root: string\n  goal: string\n  readinessSpecs?: readonly KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  strict?: ValidateKnowledgeOptions['strict']\n  kbQuality?: KnowledgeBaseQualityOptions\n}\n\nexport interface KnowledgeBaseReadinessEvaluation {\n  ready: boolean\n  summary: string\n  index: KnowledgeIndex\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  kbQuality: KnowledgeBaseQualityReport\n  dimensions: {\n    validation: number\n    kb_quality: number\n    blocking_readiness: number\n  }\n}\n\nexport async function evaluateKnowledgeBaseReadiness(\n  options: EvaluateKnowledgeBaseReadinessOptions,\n): Promise<KnowledgeBaseReadinessEvaluation> {\n  const index = await buildKnowledgeIndex(options.root)\n  const validation = validateKnowledgeIndex(index, { strict: options.strict })\n  const readiness = readinessFor(\n    {\n      ...options,\n      readinessSpecs: options.readinessSpecs ? [...options.readinessSpecs] : undefined,\n    },\n    index,\n  )\n  const kbQuality = scoreKnowledgeBaseIndex(index, {\n    strict: options.strict,\n    ...options.kbQuality,\n  })\n  const blockingMissing = readiness?.report.blockingMissingRequirements.length ?? 0\n  const blockingTotal =\n    options.readinessSpecs?.filter((spec) => spec.importance === 'blocking').length ?? 0\n  const blockingReadiness =\n    blockingTotal === 0 ? 1 : Math.max(0, blockingTotal - blockingMissing) / blockingTotal\n  const ready = validation.ok && kbQuality.ok && blockingMissing === 0\n  const failures = [\n    validation.ok ? undefined : `${validation.findings.length} validation finding(s)`,\n    kbQuality.ok ? undefined : `${kbQuality.findings.length} KB quality finding(s)`,\n    blockingMissing === 0\n      ? undefined\n      : `${blockingMissing}/${blockingTotal} blocking readiness requirement(s) missing`,\n  ].filter((failure): failure is string => Boolean(failure))\n\n  return {\n    ready,\n    summary: ready ? 'knowledge base passed readiness checks' : failures.join('; '),\n    index,\n    validation,\n    readiness,\n    kbQuality,\n    dimensions: {\n      validation: validation.ok ? 1 : 0,\n      kb_quality: kbQuality.ok ? 1 : 0,\n      blocking_readiness: blockingReadiness,\n    },\n  }\n}\n","import {\n  evaluateReleaseConfidence,\n  type GateDecision,\n  type ReleaseConfidenceScorecard,\n  type ReleaseTraceEvidence,\n  type RunRecord,\n  validateRunRecord,\n} from '@tangle-network/agent-eval'\nimport { stableId } from './ids'\nimport type { KnowledgeRelease } from './types'\n\nexport interface KnowledgeReleaseReport {\n  release: KnowledgeRelease\n  scorecard: ReleaseConfidenceScorecard\n  candidateRuns: RunRecord[]\n  baselineRuns: RunRecord[]\n}\n\n/**\n * Campaign-native release report. The caller (a consumer's KB self-improvement\n * loop) supplies the candidate/baseline `RunRecord[]` (e.g. via\n * `campaignToRunRecords`) + optional per-instance `ReleaseTraceEvidence` + the\n * gate decision; this folds them into a `ReleaseConfidenceScorecard` + a\n * `KnowledgeRelease`. Release confidence is computed from run records + traces,\n * independent of any optimizer result shape.\n */\nexport interface KnowledgeReleaseInput {\n  candidateId: string\n  baselineId?: string\n  candidateRuns: RunRecord[]\n  baselineRuns?: RunRecord[]\n  traces?: ReleaseTraceEvidence[]\n  gateDecision?: GateDecision | null\n  /**\n   * True when a held-out split was evaluated (drives the holdout threshold).\n   *\n   * Constraint: the substrate gate keys the holdout requirement off a scenario\n   * corpus, which this run-only report does not carry. With `hasHoldout: true`\n   * the gate fails closed (`missing_holdout_split`) even when holdout RunRecords\n   * are supplied. Callers that gate on a real held-out split should drive\n   * `evaluateReleaseConfidence` directly with a dataset/scenarios.\n   */\n  hasHoldout?: boolean\n  /** Candidate is the search-best variant — a promotion precondition. Default true. */\n  promotedIsBest?: boolean\n  createdAt?: string\n  minScore?: number\n}\n\nexport function knowledgeReleaseReport(input: KnowledgeReleaseInput): KnowledgeReleaseReport {\n  const baselineRuns = input.baselineRuns ?? []\n  const runRecords = [...input.candidateRuns, ...baselineRuns].map(validateRunRecord)\n  const scorecard = evaluateReleaseConfidence({\n    target: 'agent-knowledge-base',\n    candidateId: input.candidateId,\n    baselineId: input.baselineId ?? 'baseline',\n    traces: input.traces ?? [],\n    runs: runRecords,\n    gateDecision: input.gateDecision ?? null,\n    thresholds: {\n      requireCorpus: false,\n      // The report gates on RunRecord-level outcomes, not on a separate scenario\n      // corpus (KnowledgeReleaseInput carries no dataset/scenarios). The scenario\n      // floor must therefore be 0 — otherwise the corpus axis fails closed on a\n      // dimension the report has no way to satisfy, masking the run-based gate.\n      minScenarioCount: 0,\n      requireHoldout: input.hasHoldout ?? false,\n      minHoldoutRuns: input.hasHoldout ? 1 : 0,\n      minSearchRuns: 1,\n      minMeanScore: input.minScore ?? 0.7,\n    },\n  })\n  const release: KnowledgeRelease = {\n    id: stableId('krel', `${input.candidateId}:${input.createdAt ?? new Date().toISOString()}`),\n    candidateId: input.candidateId,\n    createdAt: input.createdAt ?? new Date().toISOString(),\n    promoted: scorecard.status !== 'fail' && (input.promotedIsBest ?? true),\n    scorecard,\n    runRecordIds: runRecords.map((record) => record.runId),\n  }\n  return { release, scorecard, candidateRuns: input.candidateRuns, baselineRuns }\n}\n","/**\n * Research-DRIVING driver for `runVerifiedResearchLoop`.\n *\n * The shipped drivers all FILTER the worker's sources:\n *   - `createVerifyingResearchDriver` judges on-topic relevance,\n *   - `createAdaptiveResearchDriver` dedups then triages then escalates,\n *   - `createClaimGroundingVerifier` rejects misattributed citations.\n *\n * This driver does the OPPOSITE job: instead of narrowing the worker's output,\n * it DRIVES the research DEEPER each round. Its value is not \"fewer sources\" —\n * it is \"more answered, better-corroborated sub-questions\". Concretely, each\n * round it:\n *\n *   1. EXTRACTS the key claims from the worker's new sources (one LLM pass per\n *      source, in `verifySource`; falls back to a deterministic sentence-pull\n *      when the model is unavailable so a round never silently extracts nothing).\n *   2. TRACKS each claim's support — the set of INDEPENDENT sources (by canonical\n *      host) that assert it — and detects CONTRADICTIONS between a new claim and\n *      one already on the ledger.\n *   3. GENERATES the next round's DEEP sub-questions from the accumulated claims,\n *      in four kinds — comparative (\"how does X's tradeoff differ from Y's?\"),\n *      mechanism (\"under what precise condition does X fail?\"), gap (\"what\n *      specific result is missing?\"), and contradiction (\"does any source\n *      challenge claim Z?\").\n *   4. FLAGS weakly-supported claims (only ONE independent source) and\n *      contradicted claims as INVALIDATION targets and demands the worker find\n *      corroborating / refuting evidence for them.\n *   5. FOLDS the deep sub-questions + invalidation challenges into the worker's\n *      next prompt via the loop's `foldGaps` → `steer` channel — that is the\n *      mechanism that drives DEPTH and VALIDATION rather than breadth.\n *\n * COMPLETION (`isComplete` / the `done` judgment the caller gates on) does NOT\n * look at source COUNT. It is done only when every deep sub-question it raised\n * has been addressed AND every key claim is either supported by >= 2 independent\n * sources OR explicitly marked CONTESTED (a contradiction the loop surfaced and\n * could not resolve). A KB with twenty sources all asserting one unchallenged\n * claim is NOT done; a KB whose handful of claims are each corroborated or\n * contested IS.\n *\n * It reuses `runVerifiedResearchLoop` (it is a plain `ResearchDriver`), the web\n * worker, `sha256` (claim identity), `canonicalizeUrl` (independent-source\n * identity), and the `RouterClient` chat surface; it reinvents none of them.\n */\n\nimport { canonicalizeUrl } from './adaptive-driver'\nimport { sha256 } from './ids'\nimport type {\n  KnowledgeGap,\n  ResearchDriver,\n  ResearchSourceProposal,\n  SourceVerdict,\n  SourceVerificationContext,\n} from './two-agent-research-loop'\nimport {\n  createTangleRouterClient,\n  type RouterClient,\n  type TangleRouterOptions,\n} from './web-research-worker'\n\n/** The four deep sub-question kinds the driver generates to drive depth. */\nexport type DeepQuestionKind = 'comparative' | 'mechanism' | 'gap' | 'contradiction'\n\n/** A deep sub-question the driver folds into the worker's next prompt. */\nexport interface DeepQuestion {\n  kind: DeepQuestionKind\n  text: string\n  /** sha256-derived stable id, so \"addressed\" can be tracked across rounds. */\n  id: string\n  /** Claim id(s) this question interrogates (for contradiction/mechanism kinds). */\n  claimIds: string[]\n  /** True once a later round's evidence addressed it (see `markAddressed`). */\n  addressed: boolean\n  /** The round this question was raised in. */\n  raisedRound: number\n}\n\n/** One tracked claim plus the independent sources that assert it. */\nexport interface TrackedClaim {\n  id: string\n  /** The claim text as first extracted (kept for prompts/audit). */\n  text: string\n  /** Canonical hosts of the INDEPENDENT sources that assert this claim. */\n  supportingHosts: Set<string>\n  /** Source URIs that assert this claim (provenance; may share a host). */\n  supportingUris: string[]\n  /** Claim ids this claim was found to CONTRADICT (and vice versa). */\n  contradicts: Set<string>\n  /**\n   * CONTESTED = a contradiction the loop surfaced but could not resolve to a\n   * single supported claim. A contested claim counts as \"settled enough to be\n   * done\" (we report the disagreement) even with < 2 independent sources.\n   */\n  contested: boolean\n  firstSeenRound: number\n}\n\n/** The driver's accumulated research state — the completion oracle reads this. */\nexport interface ResearchDrivingState {\n  /** Every claim extracted from the worker's sources, by id. */\n  claims: TrackedClaim[]\n  /** Every deep sub-question raised, by id. */\n  questions: DeepQuestion[]\n  /** Claims with exactly one independent source AND not contested. */\n  weaklySupported: TrackedClaim[]\n  /** Claims supported by >= 2 independent sources. */\n  corroborated: TrackedClaim[]\n  /** Claims marked contested (a surfaced, unresolved contradiction). */\n  contested: TrackedClaim[]\n  /** Deep questions still unaddressed. */\n  openQuestions: DeepQuestion[]\n  /** How many rounds the driver has folded steer for. */\n  rounds: number\n}\n\nexport interface ResearchDrivingDriverOptions {\n  /** Router client for claim extraction + deep-question generation. */\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /**\n   * A claim is CORROBORATED at this many INDEPENDENT supporting sources (distinct\n   * canonical hosts). Default 2 — the task's \">= 2 independent sources\" bar.\n   */\n  minIndependentSources?: number\n  /** Max deep sub-questions to fold into one round's steer. Default 6. */\n  maxQuestionsPerRound?: number\n  /** Max claims to extract from a single source. Default 3. */\n  maxClaimsPerSource?: number\n  /**\n   * When the extractor LLM is unavailable, fall back to a deterministic claim\n   * pull (the source's leading sentences) so the driver still drives. Default\n   * true. Set false to require the model (claims will be empty without it).\n   */\n  deterministicFallback?: boolean\n  /** Observe each round's generated steer (for instrumentation / the script). */\n  onSteer?: (steer: ResearchDrivingSteer) => void\n}\n\n/** What the driver folded into one round's worker prompt, surfaced for audit. */\nexport interface ResearchDrivingSteer {\n  round: number\n  deepQuestions: DeepQuestion[]\n  /** Claims it demanded corroborating/refuting evidence for this round. */\n  invalidationTargets: TrackedClaim[]\n  /** The readiness gaps it interleaved (passed through from the loop). */\n  gaps: KnowledgeGap[]\n  /** The full steer text handed to the worker. */\n  text: string\n}\n\n/**\n * The research-driving driver. It is a `ResearchDriver` (drops straight into\n * `runVerifiedResearchLoop`) PLUS a completion oracle and live state, mirroring\n * how `createAdaptiveResearchDriver` exposes `stats()`.\n */\nexport interface ResearchDrivingDriver extends ResearchDriver {\n  /** Live snapshot of the claim ledger + deep questions. */\n  researchState(): ResearchDrivingState\n  /**\n   * The completion oracle — gate `done` on THIS, not on source count. True when\n   * every deep sub-question is addressed AND every claim is corroborated\n   * (>= `minIndependentSources` independent sources) or explicitly contested.\n   * False while any claim is weakly-supported or any deep question is open.\n   * Returns false before any claim has been seen (nothing researched yet).\n   */\n  isComplete(): boolean\n  /**\n   * The last round's generated steer, or undefined before the first fold. Useful\n   * to assert the driver produced deeper questions / invalidation challenges.\n   */\n  lastSteer(): ResearchDrivingSteer | undefined\n}\n\n/** A claim the extractor returns for one source. */\ninterface ExtractedClaim {\n  text: string\n  /** A claim id ALREADY on the ledger that this one CONTRADICTS, if the model says so. */\n  contradictsExistingId?: string\n}\n\nexport function createResearchDrivingDriver(\n  options: ResearchDrivingDriverOptions = {},\n): ResearchDrivingDriver {\n  const minIndependentSources = Math.max(2, options.minIndependentSources ?? 2)\n  const maxQuestionsPerRound = Math.max(1, options.maxQuestionsPerRound ?? 6)\n  const maxClaimsPerSource = Math.max(1, options.maxClaimsPerSource ?? 3)\n  const deterministicFallback = options.deterministicFallback ?? true\n\n  // The claim ledger, keyed by claim id (sha256 of the normalized claim text).\n  const claims = new Map<string, TrackedClaim>()\n  // Every deep question raised, by id — so we can mark them addressed later.\n  const questions = new Map<string, DeepQuestion>()\n  let rounds = 0\n  let lastSteer: ResearchDrivingSteer | undefined\n\n  function resolveRouter(): RouterClient {\n    return options.router ?? createTangleRouterClient(options.router_options)\n  }\n\n  /** Record a claim from a source, growing its independent-source support. */\n  function recordClaim(extracted: ExtractedClaim, sourceUri: string, round: number): TrackedClaim {\n    const id = claimId(extracted.text)\n    const host = hostOf(sourceUri)\n    const existing = claims.get(id)\n    if (existing) {\n      if (host) existing.supportingHosts.add(host)\n      if (!existing.supportingUris.includes(sourceUri)) existing.supportingUris.push(sourceUri)\n      linkContradiction(existing, extracted.contradictsExistingId)\n      return existing\n    }\n    const tracked: TrackedClaim = {\n      id,\n      text: extracted.text.trim(),\n      supportingHosts: new Set(host ? [host] : []),\n      supportingUris: [sourceUri],\n      contradicts: new Set(),\n      contested: false,\n      firstSeenRound: round,\n    }\n    linkContradiction(tracked, extracted.contradictsExistingId)\n    claims.set(id, tracked)\n    return tracked\n  }\n\n  /** Wire a bidirectional contradiction edge and mark BOTH claims contested. */\n  function linkContradiction(claim: TrackedClaim, otherId: string | undefined): void {\n    if (!otherId || otherId === claim.id) return\n    const other = claims.get(otherId)\n    if (!other) return\n    claim.contradicts.add(otherId)\n    other.contradicts.add(claim.id)\n    claim.contested = true\n    other.contested = true\n  }\n\n  /** A claim's independent-source count = distinct canonical hosts. */\n  function independentSupport(claim: TrackedClaim): number {\n    return claim.supportingHosts.size\n  }\n\n  function isCorroborated(claim: TrackedClaim): boolean {\n    return independentSupport(claim) >= minIndependentSources\n  }\n\n  /** Weakly-supported = NOT corroborated AND NOT contested → an invalidation target. */\n  function isWeak(claim: TrackedClaim): boolean {\n    return !isCorroborated(claim) && !claim.contested\n  }\n\n  function snapshot(): ResearchDrivingState {\n    const all = [...claims.values()]\n    const allQuestions = [...questions.values()]\n    return {\n      claims: all,\n      questions: allQuestions,\n      weaklySupported: all.filter(isWeak),\n      corroborated: all.filter(isCorroborated),\n      contested: all.filter((claim) => claim.contested),\n      openQuestions: allQuestions.filter((question) => !question.addressed),\n      rounds,\n    }\n  }\n\n  /**\n   * Mark deep questions addressed when later evidence speaks to them. A question\n   * is addressed once a NEW claim's text shares enough content words with the\n   * question — i.e. the worker brought back evidence on the thing we asked about.\n   * Cheap and deterministic; the LLM is reserved for GENERATING questions, not\n   * grading them, so the oracle stays a non-model check.\n   */\n  function markAddressed(newClaimTexts: string[]): void {\n    for (const question of questions.values()) {\n      if (question.addressed) continue\n      // Contradiction questions resolve when one of their claims becomes\n      // corroborated or contested (the disagreement was surfaced/settled).\n      if (question.kind === 'contradiction') {\n        const settled = question.claimIds.some((id) => {\n          const claim = claims.get(id)\n          return claim ? isCorroborated(claim) || claim.contested : false\n        })\n        if (settled) question.addressed = true\n        continue\n      }\n      const qWords = contentWordSet(question.text)\n      if (qWords.size === 0) continue\n      for (const text of newClaimTexts) {\n        const overlap = overlapFraction(qWords, contentWordSet(text))\n        if (overlap >= 0.5) {\n          question.addressed = true\n          break\n        }\n      }\n    }\n  }\n\n  return {\n    /**\n     * `verifySource` — the per-source hook. This driver does NOT filter for\n     * relevance/dedup (other drivers do that, and the loop already dedups exact\n     * uris). Its job here is to EXTRACT the source's claims and grow the ledger.\n     * It accepts every source that yields at least one extractable claim; it\n     * only rejects a source with NO extractable signal at all (empty/unusable),\n     * because such a source cannot drive the research and pollutes the KB.\n     */\n    async verifySource(\n      source: ResearchSourceProposal,\n      ctx: SourceVerificationContext,\n    ): Promise<SourceVerdict> {\n      const extracted = await extractClaims(source, ctx)\n      if (extracted.length === 0) {\n        return {\n          accept: false,\n          reason: 'no extractable claim: source yields nothing to drive the research deeper',\n        }\n      }\n      const newTexts: string[] = []\n      for (const claim of extracted) {\n        recordClaim(claim, source.uri, ctx.round)\n        newTexts.push(claim.text)\n      }\n      markAddressed(newTexts)\n      return { accept: true }\n    },\n\n    /**\n     * `foldGaps` — the DEPTH driver. Runs after the worker's contribution is\n     * applied each round. It builds the next round's steer from (1) the readiness\n     * gaps the loop still reports, (2) freshly generated DEEP sub-questions, and\n     * (3) INVALIDATION challenges for weakly-supported / contradicted claims.\n     */\n    foldGaps(gaps: KnowledgeGap[]): string {\n      rounds += 1\n      const round = rounds\n      const ledger = [...claims.values()]\n\n      // Invalidation targets: claims with one source (need corroboration) OR\n      // contradicted claims (need a refutation/resolution). These are what the\n      // worker is told to go SHORE UP, not new breadth.\n      const invalidationTargets = ledger.filter(\n        (claim) => isWeak(claim) || claim.contradicts.size > 0,\n      )\n\n      // Generate this round's deep sub-questions from the actual ledger claims\n      // and register them so completion can track whether they get addressed.\n      const deepQuestions = synthesizeDeepQuestions(ledger, round).slice(0, maxQuestionsPerRound)\n      for (const question of deepQuestions) {\n        if (!questions.has(question.id)) questions.set(question.id, question)\n      }\n\n      const text = buildSteerText(gaps, deepQuestions, invalidationTargets, minIndependentSources)\n      lastSteer = { round, deepQuestions, invalidationTargets, gaps, text }\n      options.onSteer?.(lastSteer)\n      return text\n    },\n\n    researchState: snapshot,\n\n    isComplete(): boolean {\n      const all = [...claims.values()]\n      if (all.length === 0) return false\n      const everyClaimSettled = all.every((claim) => isCorroborated(claim) || claim.contested)\n      const everyQuestionAddressed = [...questions.values()].every((question) => question.addressed)\n      return everyClaimSettled && everyQuestionAddressed\n    },\n\n    lastSteer(): ResearchDrivingSteer | undefined {\n      return lastSteer\n    },\n  }\n\n  // -- claim extraction ------------------------------------------------------\n\n  async function extractClaims(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<ExtractedClaim[]> {\n    const ledger = [...claims.values()]\n    const fromLlm = await extractClaimsWithLlm(source, ctx, ledger)\n    if (fromLlm.length > 0) return fromLlm.slice(0, maxClaimsPerSource)\n    if (deterministicFallback) return deterministicClaims(source).slice(0, maxClaimsPerSource)\n    return []\n  }\n\n  async function extractClaimsWithLlm(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n    ledger: TrackedClaim[],\n  ): Promise<ExtractedClaim[]> {\n    let router: RouterClient\n    try {\n      router = resolveRouter()\n    } catch {\n      return []\n    }\n    const excerpt = source.text.slice(0, 1800)\n    const ledgerLines = ledger\n      .slice(0, 20)\n      .map((claim) => `- [${claim.id}] ${claim.text}`)\n      .join('\\n')\n    const system =\n      'You extract the KEY factual claims a researcher would cite a page for, and flag ' +\n      'CONTRADICTIONS with claims already on the ledger. ' +\n      \"A claim is one concrete, checkable assertion using the page's own terms and numbers. \" +\n      'Return ONLY a JSON array; each item is {\"claim\": string, \"contradicts\": string|null} where ' +\n      'contradicts is the bracketed [id] of a ledger claim this page DIRECTLY contradicts, else null. ' +\n      `Return at most ${maxClaimsPerSource} claims. No prose.`\n    const user = [\n      `Research goal: ${ctx.goal}`,\n      `Page title: ${source.title ?? '(none)'}`,\n      ledgerLines ? `Claims already on the ledger:\\n${ledgerLines}` : 'Ledger is empty.',\n      `Page excerpt:\\n${excerpt}`,\n      'Key claims as JSON [{\"claim\": \"...\", \"contradicts\": \"[id]\"|null}]:',\n    ].join('\\n\\n')\n\n    let raw = ''\n    try {\n      raw = await router.chat(\n        [\n          { role: 'system', content: system },\n          { role: 'user', content: user },\n        ],\n        1200,\n      )\n    } catch {\n      return []\n    }\n    return parseExtractedClaims(raw, ledger)\n  }\n\n  /**\n   * Deterministic fallback: pull the leading sentences as candidate claims. Used\n   * only when the model is unavailable, so the driver still drives (and the\n   * offline test runs with no creds). Each sentence becomes a checkable claim.\n   */\n  function deterministicClaims(source: ResearchSourceProposal): ExtractedClaim[] {\n    const sentences = source.text\n      .split(/(?<=[.!?])\\s+/)\n      .map((sentence) => sentence.trim())\n      .filter((sentence) => contentWordSet(sentence).size >= 3)\n    return sentences.slice(0, maxClaimsPerSource).map((text) => ({ text }))\n  }\n\n  // -- deep-question synthesis ----------------------------------------------\n\n  /**\n   * Build the four deep-question kinds from the actual ledger claims. This is\n   * intentionally deterministic (not an LLM call): the loop's `foldGaps` contract\n   * is synchronous (`foldGaps(gaps): string`), and a template grounded in the\n   * real claim text gives a faithful, non-fabricated sub-question every round —\n   * comparative, mechanism, gap, and contradiction. Claim EXTRACTION, which runs\n   * inside the awaited `verifySource`, is where the model does the open-ended\n   * work; question generation just interrogates what was extracted.\n   */\n  function synthesizeDeepQuestions(ledger: TrackedClaim[], round: number): DeepQuestion[] {\n    if (ledger.length === 0) return []\n    const out: DeepQuestion[] = []\n\n    // CONTRADICTION questions: for every contradiction edge, ask the worker to\n    // find evidence that resolves which claim holds.\n    for (const claim of ledger) {\n      for (const otherId of claim.contradicts) {\n        const other = ledger.find((entry) => entry.id === otherId)\n        if (!other || other.id < claim.id) continue // emit each pair once\n        out.push(\n          makeQuestion(\n            'contradiction',\n            `Does any independent source resolve the contradiction between \"${truncate(claim.text)}\" and \"${truncate(other.text)}\"? Find evidence that confirms or refutes one of them.`,\n            [claim.id, other.id],\n            round,\n          ),\n        )\n      }\n    }\n\n    // GAP questions: for each weakly-supported claim, ask for the specific\n    // corroborating result that is missing.\n    for (const claim of ledger.filter((entry) => !entry.contested)) {\n      if (claim.supportingHosts.size < minIndependentSources) {\n        out.push(\n          makeQuestion(\n            'gap',\n            `Only one independent source supports \"${truncate(claim.text)}\". What specific corroborating result, dataset, or independent measurement is missing to confirm it?`,\n            [claim.id],\n            round,\n          ),\n        )\n      }\n    }\n\n    // MECHANISM questions: for the best-supported claims, probe the failure\n    // boundary — under what precise condition does the asserted effect break.\n    for (const claim of [...ledger]\n      .sort((a, b) => b.supportingHosts.size - a.supportingHosts.size)\n      .slice(0, 2)) {\n      out.push(\n        makeQuestion(\n          'mechanism',\n          `Under what precise condition does \"${truncate(claim.text)}\" stop holding? Find a source that states the mechanism, limit, or failure mode.`,\n          [claim.id],\n          round,\n        ),\n      )\n    }\n\n    // COMPARATIVE questions: pair the two most-supported claims and ask how their\n    // tradeoffs differ.\n    const ranked = [...ledger].sort((a, b) => b.supportingHosts.size - a.supportingHosts.size)\n    if (ranked.length >= 2 && ranked[0] && ranked[1]) {\n      out.push(\n        makeQuestion(\n          'comparative',\n          `How does the tradeoff in \"${truncate(ranked[0].text)}\" differ from \"${truncate(ranked[1].text)}\"? Find a source that compares them directly.`,\n          [ranked[0].id, ranked[1].id],\n          round,\n        ),\n      )\n    }\n\n    // Stable order: contradiction → gap → mechanism → comparative (most urgent\n    // validation work first).\n    const priority: Record<DeepQuestionKind, number> = {\n      contradiction: 0,\n      gap: 1,\n      mechanism: 2,\n      comparative: 3,\n    }\n    return out.sort((a, b) => priority[a.kind] - priority[b.kind])\n  }\n}\n\n// ---------------------------------------------------------------------------\n// pure helpers\n// ---------------------------------------------------------------------------\n\nfunction makeQuestion(\n  kind: DeepQuestionKind,\n  text: string,\n  claimIds: string[],\n  raisedRound: number,\n): DeepQuestion {\n  return {\n    kind,\n    text,\n    id: `q_${sha256(`${kind}:${text}`).slice(0, 16)}`,\n    claimIds,\n    addressed: false,\n    raisedRound,\n  }\n}\n\n/** Claim identity = sha256 of the normalized claim text (same words ⇒ same claim). */\nfunction claimId(text: string): string {\n  return `c_${sha256(normalizeText(text)).slice(0, 16)}`\n}\n\nfunction hostOf(uri: string): string {\n  try {\n    return new URL(uri.trim()).hostname.toLowerCase().replace(/^www\\./, '')\n  } catch {\n    // Non-URL identifier (offline corpus uris like `web/foo`): canonicalize so\n    // distinct identifiers still count as distinct independent sources.\n    return canonicalizeUrl(uri)\n  }\n}\n\nfunction normalizeText(text: string): string {\n  return text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .replace(/\\s+/g, ' ')\n    .trim()\n}\n\nconst stopwords = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'but',\n  'of',\n  'to',\n  'in',\n  'on',\n  'for',\n  'with',\n  'as',\n  'by',\n  'at',\n  'from',\n  'that',\n  'this',\n  'these',\n  'those',\n  'it',\n  'its',\n  'is',\n  'are',\n  'was',\n  'were',\n  'be',\n  'been',\n  'being',\n  'has',\n  'have',\n  'had',\n  'can',\n  'will',\n  'would',\n  'should',\n  'may',\n  'might',\n  'not',\n  'no',\n  'than',\n  'then',\n  'over',\n  'under',\n  'about',\n  'into',\n  'their',\n  'they',\n  'them',\n])\n\nfunction contentWordSet(text: string): Set<string> {\n  return new Set(\n    normalizeText(text)\n      .split(' ')\n      .filter((word) => word.length >= 3 && !stopwords.has(word)),\n  )\n}\n\nfunction overlapFraction(a: Set<string>, b: Set<string>): number {\n  if (a.size === 0) return 0\n  let hits = 0\n  for (const word of a) if (b.has(word)) hits += 1\n  return hits / a.size\n}\n\nfunction truncate(text: string, max = 140): string {\n  const t = text.trim().replace(/\\s+/g, ' ')\n  return t.length <= max ? t : `${t.slice(0, max - 1)}…`\n}\n\n/**\n * Parse the extractor's JSON array of `{claim, contradicts}` items, tolerant of\n * code fences / surrounding prose. `contradicts` is mapped from a `[id]` token to\n * a ledger claim id only when that id is actually on the ledger.\n */\nfunction parseExtractedClaims(raw: string, ledger: TrackedClaim[]): ExtractedClaim[] {\n  const text = raw.trim()\n  if (!text) return []\n  const arrayMatch = text.match(/\\[[\\s\\S]*\\]/)\n  if (!arrayMatch) return []\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(arrayMatch[0])\n  } catch {\n    return []\n  }\n  if (!Array.isArray(parsed)) return []\n  const ledgerIds = new Set(ledger.map((claim) => claim.id))\n  const out: ExtractedClaim[] = []\n  for (const item of parsed) {\n    if (!item || typeof item !== 'object') continue\n    const record = item as { claim?: unknown; contradicts?: unknown }\n    if (typeof record.claim !== 'string' || !record.claim.trim()) continue\n    const contradictsId = extractBracketId(record.contradicts)\n    out.push({\n      text: record.claim.trim(),\n      contradictsExistingId:\n        contradictsId && ledgerIds.has(contradictsId) ? contradictsId : undefined,\n    })\n  }\n  return out\n}\n\n/** Pull a ledger id out of a `contradicts` field: `\"[c_abc]\"` or `\"c_abc\"`. */\nfunction extractBracketId(value: unknown): string | undefined {\n  if (typeof value !== 'string') return undefined\n  const trimmed = value.trim()\n  if (!trimmed || trimmed.toLowerCase() === 'null') return undefined\n  const bracket = trimmed.match(/\\[([^\\]]+)\\]/)\n  const id = (bracket?.[1] ?? trimmed).trim()\n  return id.startsWith('c_') ? id : undefined\n}\n\n/**\n * Build the steer string handed to the worker's next prompt. Interleaves the\n * readiness gaps the loop still reports with the deep sub-questions and the\n * invalidation challenges — the part that drives DEPTH + VALIDATION.\n */\nfunction buildSteerText(\n  gaps: KnowledgeGap[],\n  deepQuestions: DeepQuestion[],\n  invalidationTargets: TrackedClaim[],\n  minIndependentSources: number,\n): string {\n  const lines: string[] = []\n  lines.push(\n    'Do NOT just add more sources. Go DEEPER and VALIDATE. Address the following before adding breadth:',\n  )\n\n  if (deepQuestions.length > 0) {\n    lines.push('', 'Deep sub-questions to answer this round:')\n    for (const question of deepQuestions) {\n      lines.push(`- (${question.kind}) ${question.text}`)\n    }\n  }\n\n  if (invalidationTargets.length > 0) {\n    lines.push(\n      '',\n      `Claims needing corroboration or refutation (each must reach >= ${minIndependentSources} INDEPENDENT sources, or be shown contested):`,\n    )\n    for (const claim of invalidationTargets) {\n      const reason =\n        claim.contradicts.size > 0\n          ? 'CONTRADICTED by another source — find evidence that resolves it'\n          : `only ${claim.supportingHosts.size} independent source — find a SECOND, independent corroborating source`\n      lines.push(`- \"${truncate(claim.text)}\" — ${reason}`)\n    }\n  }\n\n  if (gaps.length > 0) {\n    lines.push('', 'Readiness gaps still open:')\n    for (const gap of gaps) {\n      lines.push(`- (${gap.blocking ? 'blocking' : 'soft'}) ${gap.description} [${gap.id}]`)\n    }\n  }\n\n  return lines.join('\\n')\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CA,IAAM,gBAAgB;AAEtB,IAAM,mBAAmB;AAMzB,IAAM,iBAAiB;AAgEvB,IAAM,oBAAoB,oBAAI,IAAI,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AAQtD,eAAe,eACb,KACA,MACA,MACmB;AACnB,MAAI;AACJ,WAAS,UAAU,GAAG,WAAW,KAAK,YAAY,WAAW,GAAG;AAC9D,QAAI,KAAK,QAAQ,QAAS,OAAM,IAAI,YAAY,GAAG,SAAS;AAC5D,UAAM,MAAM,MAAM,MAAM,KAAK,IAAI;AACjC,QAAI,IAAI,MAAM,CAAC,kBAAkB,IAAI,IAAI,MAAM,EAAG,QAAO;AACzD,cAAU;AACV,QAAI,YAAY,KAAK,WAAY;AAEjC,UAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC/B,UAAM,UAAU,KAAK,cAAc,KAAK;AACxC,UAAM,SAAS,WAAW,OAAO,KAAK,OAAO,IAAI;AACjD,UAAM,IAAI,QAAQ,CAACA,aAAY,WAAWA,UAAS,MAAM,CAAC;AAAA,EAC5D;AAGA,MAAI,QAAS,QAAO;AACpB,QAAM,IAAI,YAAY,GAAG,qCAAqC;AAChE;AAGO,IAAM,cAAN,cAA0B,MAAM;AAAA,EACrC,YACkB,QAChB,SACA;AACA,UAAM,UAAU,MAAM,KAAK,OAAO,EAAE;AAHpB;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;AAOO,SAAS,yBAAyB,UAA+B,CAAC,GAAiB;AACxF,QAAM,WAAW,QAAQ,WAAW,kBAAkB,QAAQ,OAAO,EAAE;AACvE,QAAM,SAAS,QAAQ,UAAU,QAAQ,IAAI;AAC7C,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI,YAAY,KAAK,oDAAoD;AAAA,EACjF;AACA,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,aAAa,KAAK,IAAI,GAAG,QAAQ,cAAc,CAAC;AACtD,QAAM,cAAc,KAAK,IAAI,GAAG,QAAQ,eAAe,IAAI;AAC3D,QAAM,UAAU;AAAA,IACd,gBAAgB;AAAA,IAChB,eAAe,UAAU,MAAM;AAAA,EACjC;AAGA,QAAM,QAAQ,EAAE,QAAQ,OAAO,KAAW,YAAY,IAAM,IAAU;AACtE,QAAM,MAAmB;AAAA,IACvB,WAAW;AAAA,IACX,aAAa;AAAA,IACb,cAAc;AAAA,IACd,kBAAkB;AAAA,IAClB,KAAK;AAAA,IACL,QAAQ;AAAA,EACV;AAEA,SAAO;AAAA,IACL,MAAM,OAAO,OAAO,MAAM;AACxB,YAAM,KAAK,KAAK,IAAI;AACpB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO;AAAA,QACV;AAAA,UACE,QAAQ;AAAA,UACR;AAAA,UACA,QAAQ,QAAQ;AAAA,UAChB,MAAM,KAAK,UAAU;AAAA,YACnB;AAAA,YACA,GAAI,QAAQ,iBAAiB,EAAE,UAAU,QAAQ,eAAe,IAAI,CAAC;AAAA,YACrE,GAAI,MAAM,cAAc,OAAO,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,UACpE,CAAC;AAAA,QACH;AAAA,QACA,EAAE,YAAY,aAAa,QAAQ,QAAQ,OAAO;AAAA,MACpD;AACA,UAAI,eAAe;AACnB,UAAI,UAAU,KAAK,IAAI,IAAI;AAC3B,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,IAAI,YAAY,IAAI,QAAQ,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI,UAAU,CAAC;AAAA,MAChF;AACA,YAAM,OAAQ,MAAM,IAAI,KAAK;AAC7B,cAAQ,KAAK,QAAQ,CAAC,GACnB,OAAO,CAAC,QAAQ,OAAO,KAAK,QAAQ,YAAY,IAAI,IAAI,SAAS,CAAC,EAClE,IAAI,CAAC,SAAS,EAAE,OAAO,IAAI,SAAS,IAAI,KAAK,KAAK,IAAI,KAAK,SAAS,IAAI,QAAQ,EAAE;AAAA,IACvF;AAAA,IACA,MAAM,KAAK,UAAU,WAAW;AAG9B,YAAM,aAAa,KAAK,IAAI,gBAAgB,aAAa,cAAc;AACvE,YAAM,KAAK,KAAK,IAAI;AACpB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO;AAAA,QACV;AAAA,UACE,QAAQ;AAAA,UACR;AAAA,UACA,QAAQ,QAAQ;AAAA,UAChB,MAAM,KAAK,UAAU,EAAE,OAAO,UAAU,YAAY,aAAa,KAAK,QAAQ,MAAM,CAAC;AAAA,QACvF;AAAA,QACA,EAAE,YAAY,aAAa,QAAQ,QAAQ,OAAO;AAAA,MACpD;AACA,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,IAAI,YAAY,IAAI,QAAQ,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI,UAAU,CAAC;AAAA,MAChF;AACA,YAAM,OAAQ,MAAM,IAAI,KAAK;AAI7B,YAAM,eAAe,KAAK,OAAO,iBAAiB;AAClD,YAAM,mBAAmB,KAAK,OAAO,qBAAqB;AAC1D,UAAI,aAAa;AACjB,UAAI,gBAAgB;AACpB,UAAI,oBAAoB;AACxB,UAAI,OAAO,eAAe,MAAM,SAAS,mBAAmB,MAAM;AAClE,UAAI,UAAU,KAAK,IAAI,IAAI;AAC3B,aAAO,KAAK,UAAU,CAAC,GAAG,SAAS,WAAW;AAAA,IAChD;AAAA,IACA,QAAQ;AACN,aAAO,EAAE,GAAG,IAAI;AAAA,IAClB;AAAA,EACF;AACF;AAqBA,SAAS,cAAc,MAGN;AACf,SAAO,KAAK,UAAU,yBAAyB,KAAK,cAAc;AACpE;AAOO,SAAS,wBAAwB,UAAoC,CAAC,GAAmB;AAC9F,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAC5D,QAAM,kBAAkB,KAAK,IAAI,GAAG,QAAQ,mBAAmB,CAAC;AAChE,QAAM,qBAAqB,KAAK,IAAI,GAAG,QAAQ,sBAAsB,CAAC;AACtE,QAAM,eAAe,KAAK,IAAI,GAAG,QAAQ,gBAAgB,GAAG;AAC5D,QAAM,eAAe,KAAK,IAAI,cAAc,QAAQ,gBAAgB,GAAI;AAExE,SAAO,OAAO,QAA8D;AAC1E,UAAM,SAAS,cAAc,OAAO;AAEpC,UAAM,aAAa,IAAI,KAAK,OAAO,CAAC,QAAQ,IAAI,QAAQ;AACxD,UAAM,OAAO,WAAW,SAAS,IAAI,aAAa,IAAI;AACtD,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,EAAE,SAAS,CAAC,GAAG,OAAO,2BAA2B;AAAA,IAC1D;AAEA,UAAM,UAAU,MAAM,kBAAkB,QAAQ,KAAK,MAAM,aAAa;AACxE,UAAM,YAAsC,CAAC;AAC7C,UAAM,WAAW,oBAAI,IAAY;AAEjC,eAAW,SAAS,SAAS;AAC3B,UAAI,UAAU,UAAU,mBAAoB;AAC5C,UAAI,IAAI,QAAQ,QAAS;AACzB,UAAI;AACJ,UAAI;AACF,eAAO,MAAM,OAAO,OAAO,OAAO,EAAE,YAAY,gBAAgB,CAAC;AAAA,MACnE,SAAS,OAAO;AAEd,YAAK,MAA4B,SAAS,aAAc;AACxD;AAAA,MACF;AACA,iBAAW,OAAO,MAAM;AACtB,YAAI,UAAU,UAAU,mBAAoB;AAC5C,YAAI,SAAS,IAAI,IAAI,GAAG,EAAG;AAC3B,cAAM,UAAU,MAAM,YAAY,IAAI,KAAK;AAAA,UACzC,QAAQ,IAAI;AAAA,UACZ,UAAU,QAAQ;AAAA,QACpB,CAAC;AACD,YAAI,CAAC,QAAQ,WAAY;AACzB,cAAM,OAAO,WAAW,QAAQ,IAAI,EAAE,MAAM,GAAG,YAAY;AAC3D,YAAI,KAAK,SAAS,aAAc;AAChC,iBAAS,IAAI,IAAI,GAAG;AACpB,kBAAU,KAAK;AAAA,UACb,KAAK,IAAI;AAAA,UACT,OAAO,IAAI,SAAS,IAAI;AAAA,UACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAOA,gBAAgB,QAAQ;AAAA,UACxB,UAAU;AAAA,YACR,eAAe;AAAA,YACf,SAAS,IAAI,WAAW;AAAA,YACxB,MAAM,IAAI;AAAA,YACV,iBAAiB,QAAQ;AAAA,UAC3B;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,YAAY,iBAAiB,SAAS;AAAA,MACtC,OAAO,wBAAwB,QAAQ,MAAM,mBAAc,UAAU,MAAM;AAAA,IAC7E;AAAA,EACF;AACF;AAOA,eAAe,kBACb,QACA,KACA,MACA,eACmB;AACnB,QAAM,WAAW,KACd,IAAI,CAAC,KAAK,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,WAAW,uBAAuB,IAAI,KAAK,IAAI,EAChF,KAAK,IAAI;AACZ,QAAM,OAAO,KAAK,SAAS;AAC3B,QAAM,SACJ;AAGF,QAAM,OAAO;AAAA,IACX,kBAAkB,IAAI,IAAI;AAAA,IAC1B,IAAI,QAAQ;AAAA,EAAgC,IAAI,KAAK,KAAK;AAAA,IAC1D;AAAA,EAAyB,QAAQ;AAAA,IACjC,gBAAgB,IAAI;AAAA,EACtB,EACG,OAAO,OAAO,EACd,KAAK,MAAM;AAEd,MAAI,MAAM;AACV,MAAI;AACF,UAAM,MAAM,OAAO;AAAA,MACjB;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,QAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,MAChC;AAAA,MACA;AAAA,IACF;AAAA,EACF,QAAQ;AACN,UAAM;AAAA,EACR;AACA,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,UAAU,OAAO,MAAM,GAAG,IAAI;AACpC,MAAI,QAAQ,SAAS,EAAG,QAAO,cAAc,OAAO;AAEpD,SAAO,cAAc,KAAK,IAAI,CAAC,QAAQ,IAAI,SAAS,IAAI,WAAW,CAAC;AACtE;AAGA,SAAS,eAAe,KAAuB;AAC7C,QAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,QAAM,aAAuB,CAAC;AAE9B,QAAM,aAAa,KAAK,MAAM,aAAa;AAC3C,MAAI,YAAY;AACd,QAAI;AACF,YAAM,MAAM,KAAK,MAAM,WAAW,CAAC,CAAC;AACpC,iBAAW,QAAQ;AACjB,YAAI,OAAO,SAAS,YAAY,KAAK,KAAK,EAAG,YAAW,KAAK,KAAK,KAAK,CAAC;AAAA,IAC5E,QAAQ;AAAA,IAER;AAAA,EACF;AACA,MAAI,WAAW,WAAW,GAAG;AAC3B,eAAW,QAAQ,KAAK,MAAM,IAAI,GAAG;AACnC,YAAM,UAAU,KACb,QAAQ,2BAA2B,EAAE,EACrC,QAAQ,gBAAgB,EAAE,EAC1B,KAAK;AACR,UAAI,WAAW,QAAQ,SAAS,KAAK,CAAC,QAAQ,WAAW,GAAG,EAAG,YAAW,KAAK,OAAO;AAAA,IACxF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,QAA4B;AACjD,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,MAAgB,CAAC;AACvB,aAAW,SAAS,QAAQ;AAC1B,UAAM,MAAM,MAAM,YAAY,EAAE,KAAK;AACrC,QAAI,OAAO,CAAC,KAAK,IAAI,GAAG,GAAG;AACzB,WAAK,IAAI,GAAG;AACZ,UAAI,KAAK,MAAM,KAAK,CAAC;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAOA,SAAS,iBACP,WACyD;AACzD,SAAO,CAAC,oBAAoB;AAC1B,QAAI,gBAAgB,WAAW,EAAG,QAAO;AACzC,UAAM,SAAS,gBAAgB,IAAI,CAAC,WAAW;AAC7C,YAAM,WAAW,UAAU,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO,UAAU,WAAW;AAC7E,YAAM,MAAM,UAAU,OAAO,OAAO;AACpC,YAAM,OACJ,IACG,QAAQ,gBAAgB,EAAE,EAC1B,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,YAAY,EAAE,EACtB,MAAM,GAAG,GAAG,KAAK,OAAO;AAC7B,YAAM,QAAQ,UAAU,SAAS,OAAO;AACxC,YAAM,OAAO,UAAU,QAAQ;AAC/B,aAAO;AAAA,QACL,sBAAsB,IAAI;AAAA,QAC1B;AAAA,QACA,UAAU,WAAW,KAAK,CAAC;AAAA,QAC3B,cAAc,OAAO,EAAE;AAAA,QACvB,eAAe,GAAG;AAAA,QAClB;AAAA,QACA,KAAK,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA,WAAW,GAAG;AAAA,QACd;AAAA,MACF,EAAE,KAAK,IAAI;AAAA,IACb,CAAC;AACD,WAAO,OAAO,KAAK,IAAI;AAAA,EACzB;AACF;AAEA,SAAS,WAAW,OAAuB;AAGzC,SAAO,MACJ,QAAQ,YAAY,GAAG,EACvB,QAAQ,MAAM,GAAG,EACjB,KAAK;AACV;AAuBO,SAAS,8BACd,UAAkC,CAAC,GACnB;AAChB,QAAM,uBAAuB,QAAQ,wBAAwB;AAC7D,SAAO;AAAA,IACL,MAAM,aACJ,QACA,KACwB;AACxB,YAAM,SAAS,cAAc,OAAO;AACpC,YAAM,WAAW,IAAI,KAClB,IAAI,CAAC,QAAQ,KAAK,IAAI,WAAW,aAAa,IAAI,KAAK,IAAI,EAC3D,KAAK,IAAI;AACZ,YAAM,iBAAiB,IAAI,kBACxB,IAAI,CAAC,aAAa,KAAK,SAAS,SAAS,SAAS,GAAG,EAAE,EACvD,KAAK,IAAI;AACZ,YAAM,UAAU,OAAO,KAAK,MAAM,GAAG,IAAI;AACzC,YAAM,SACJ;AAKF,YAAM,OAAO;AAAA,QACX,kBAAkB,IAAI,IAAI;AAAA,QAC1B;AAAA,EAAe,YAAY,kBAAkB;AAAA,QAC7C,iBACI;AAAA,EAAiC,cAAc,KAC/C;AAAA,QACJ;AAAA,OAA2B,OAAO,GAAG;AAAA,SAAY,OAAO,SAAS,QAAQ;AAAA;AAAA,EAAe,OAAO;AAAA,QAC/F;AAAA,MACF,EAAE,KAAK,MAAM;AAEb,UAAI,MAAM;AACV,UAAI;AACF,cAAM,MAAM,OAAO;AAAA,UACjB;AAAA,YACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,YAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,UAChC;AAAA,UACA;AAAA,QACF;AAAA,MACF,SAAS,OAAO;AACd,YAAK,MAA4B,SAAS,aAAc,OAAM;AAE9D,eAAO,uBACH,EAAE,QAAQ,KAAK,IACf,EAAE,QAAQ,OAAO,QAAQ,yBAA0B,MAAgB,OAAO,GAAG;AAAA,MACnF;AAEA,YAAM,UAAU,aAAa,GAAG;AAChC,UAAI,QAAS,QAAO;AACpB,aAAO,uBACH,EAAE,QAAQ,KAAK,IACf,EAAE,QAAQ,OAAO,QAAQ,2CAA2C;AAAA,IAC1E;AAAA,EACF;AACF;AAGA,SAAS,aAAa,KAAmC;AACvD,QAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,WAAW,KAAK,MAAM,aAAa;AACzC,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,SAAS,CAAC,CAAC;AACrC,QAAI,OAAO,OAAO,WAAW,UAAW,QAAO;AAC/C,QAAI,OAAO,OAAQ,QAAO,EAAE,QAAQ,KAAK;AACzC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,QACE,OAAO,OAAO,WAAW,YAAY,OAAO,OAAO,KAAK,IACpD,OAAO,OAAO,KAAK,IACnB;AAAA,IACR;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;ACvhBO,SAAS,gBAAgB,KAAqB;AACnD,QAAM,UAAU,IAAI,KAAK;AACzB,MAAI;AACF,UAAM,MAAM,IAAI,IAAI,OAAO;AAC3B,UAAM,OAAO,IAAI,SAAS,YAAY,EAAE,QAAQ,UAAU,EAAE;AAE5D,UAAM,OAA2B,CAAC;AAClC,eAAW,CAAC,KAAK,KAAK,KAAK,IAAI,cAAc;AAC3C,YAAM,QAAQ,IAAI,YAAY;AAC9B,UAAI,MAAM,WAAW,MAAM,EAAG;AAC9B,UAAI,eAAe,IAAI,KAAK,EAAG;AAC/B,WAAK,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,IACxB;AACA,SAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAE;AACpD,UAAM,QAAQ,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,GAAG;AACxD,UAAM,OAAO,IAAI,SAAS,QAAQ,QAAQ,EAAE,KAAK;AACjD,WAAO,GAAG,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,KAAK,KAAK,EAAE;AAAA,EAClD,QAAQ;AACN,WAAO,QAAQ,YAAY;AAAA,EAC7B;AACF;AAGA,IAAM,iBAAiB,oBAAI,IAAI;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAQM,SAAS,WAAW,MAAsB;AAC/C,QAAM,aAAa,KAChB,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACR,SAAO,OAAO,UAAU;AAC1B;AAoEA,IAAM,4BAA4B;AAAA,EAChC;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;AAGA,IAAM,sBAAsB;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAQO,SAAS,aACd,QACA,SAMyC;AACzC,QAAM,kBAAkB,GAAG,OAAO,SAAS,EAAE,IAC3C,OAAO,OAAO,UAAU,YAAY,WAAW,OAAO,SAAS,UAAU,EAC3E,GAAG,KAAK;AACR,QAAM,UAAU,OAAO,KAAK,KAAK,EAAE;AAInC,aAAW,WAAW,QAAQ,cAAc;AAC1C,QAAI,QAAQ,KAAK,eAAe,GAAG;AACjC,aAAO,EAAE,QAAQ,QAAQ,QAAQ,wBAAwB,QAAQ,MAAM,IAAI;AAAA,IAC7E;AAAA,EACF;AACA,MAAI,UAAU,QAAQ,cAAc;AAClC,WAAO,EAAE,QAAQ,QAAQ,QAAQ,cAAc,OAAO,MAAM,QAAQ,YAAY,UAAU;AAAA,EAC5F;AAIA,QAAM,OAAO,OAAO,OAAO,GAAG;AAC9B,QAAM,gBACJ,KAAK,SAAS,KAAK,QAAQ,mBAAmB,KAAK,CAAC,WAAW,YAAY,MAAM,MAAM,CAAC;AAC1F,MAAI,iBAAiB,WAAW,QAAQ,sBAAsB;AAC5D,WAAO,EAAE,QAAQ,QAAQ,QAAQ,sBAAsB,IAAI,wBAAwB,OAAO,IAAI;AAAA,EAChG;AAIA,SAAO,EAAE,QAAQ,aAAa,QAAQ,gBAAgB,QAAQ,QAAQ,UAAU,OAAO,SAAS;AAClG;AAEA,SAAS,OAAO,KAAqB;AACnC,MAAI;AACF,WAAO,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,SAAS,YAAY,EAAE,QAAQ,UAAU,EAAE;AAAA,EACxE,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,SAAS,YAAY,MAAc,QAAyB;AAC1D,MAAI,OAAO,WAAW,GAAG,EAAG,QAAO,KAAK,SAAS,MAAM,KAAK,SAAS,OAAO,MAAM,CAAC;AACnF,SAAO,SAAS,UAAU,KAAK,SAAS,IAAI,MAAM,EAAE;AACtD;AAqBO,SAAS,6BACd,UAAiC,CAAC,GACV;AACxB,QAAM,qBAAqB,QAAQ,sBAAsB;AACzD,QAAM,eAAe,QAAQ,gBAAgB;AAC7C,QAAM,eAAe,KAAK,IAAI,GAAG,QAAQ,gBAAgB,GAAG;AAC5D,QAAM,uBAAuB,KAAK,IAAI,cAAc,QAAQ,wBAAwB,GAAG;AAGvF,QAAM,YAAY,8BAA8B;AAAA,IAC9C,QAAQ,QAAQ;AAAA,IAChB,gBAAgB,QAAQ;AAAA,IACxB,sBAAsB,QAAQ,WAAW;AAAA,EAC3C,CAAC;AAGD,QAAM,kBAAkB,oBAAI,IAAY;AACxC,QAAM,sBAAsB,oBAAI,IAAY;AAE5C,QAAM,QAAuB;AAAA,IAC3B,OAAO;AAAA,IACP,eAAe;AAAA,IACf,eAAe;AAAA,IACf,kBAAkB;AAAA,IAClB,UAAU;AAAA,IACV,aAAa;AAAA,IACb,WAAW,CAAC;AAAA,EACd;AAEA,WAAS,OAAO,UAAkC;AAChD,UAAM,UAAU,KAAK,QAAQ;AAC7B,YAAQ,aAAa,QAAQ;AAAA,EAC/B;AAEA,SAAO;AAAA,IACL,MAAM,aAAa,QAAQ,KAA6B;AACtD,YAAM,SAAS;AACf,YAAM,SAAS,gBAAgB,OAAO,GAAG;AACzC,YAAM,OAAO,WAAW,OAAO,IAAI;AAMnC,YAAM,eAAe,IAAI;AAAA,QACvB,IAAI,kBAAkB,IAAI,CAAC,aAAa,gBAAgB,SAAS,GAAG,CAAC;AAAA,MACvE;AACA,YAAM,mBAAmB,IAAI;AAAA,QAC3B,IAAI,kBAAkB,IAAI,CAAC,aAAa,WAAW,SAAS,IAAI,CAAC;AAAA,MACnE;AACA,YAAM,eAAe,IAAI;AAAA,QACvB,IAAI,MAAM,QAAQ;AAAA,UAAQ,CAAC,YACzB,OAAO,QAAQ,UAAU,gBAAgB,WACrC,CAAC,gBAAgB,QAAQ,SAAS,WAAW,CAAC,IAC9C,CAAC;AAAA,QACP;AAAA,MACF;AACA,YAAM,SACJ,gBAAgB,IAAI,MAAM,KAAK,aAAa,IAAI,MAAM,KAAK,aAAa,IAAI,MAAM;AACpF,YAAM,aAAa,oBAAoB,IAAI,IAAI,KAAK,iBAAiB,IAAI,IAAI;AAC7E,UAAI,UAAU,YAAY;AACxB,cAAM,iBAAiB;AACvB,cAAMC,UAAsB,SAAS,kBAAkB;AACvD,eAAO,EAAE,KAAK,OAAO,KAAK,OAAO,SAAS,UAAU,OAAO,QAAAA,QAAO,CAAC;AACnE,eAAO,EAAE,QAAQ,OAAO,QAAQ,UAAUA,OAAM,GAAG;AAAA,MACrD;AAGA,YAAM,EAAE,QAAQ,OAAO,IAAI,aAAa,QAAQ;AAAA,QAC9C;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AACD,UAAI,WAAW,QAAQ;AACrB,cAAM,iBAAiB;AACvB,wBAAgB,IAAI,MAAM;AAC1B,4BAAoB,IAAI,IAAI;AAC5B,eAAO,EAAE,KAAK,OAAO,KAAK,OAAO,aAAa,UAAU,MAAM,QAAQ,OAAO,CAAC;AAC9E,eAAO,EAAE,QAAQ,KAAK;AAAA,MACxB;AACA,UAAI,WAAW,QAAQ;AACrB,cAAM,oBAAoB;AAC1B,eAAO,EAAE,KAAK,OAAO,KAAK,OAAO,aAAa,UAAU,OAAO,QAAQ,OAAO,CAAC;AAC/E,eAAO,EAAE,QAAQ,OAAO,QAAQ,mBAAmB,MAAM,GAAG;AAAA,MAC9D;AAGA,YAAM,YAAY;AAClB,YAAM,UAAU,MAAM,UAAU,aAAa,QAAQ,GAAG;AACxD,UAAI,QAAQ,QAAQ;AAClB,cAAM,eAAe;AACrB,wBAAgB,IAAI,MAAM;AAC1B,4BAAoB,IAAI,IAAI;AAAA,MAC9B;AACA,aAAO;AAAA,QACL,KAAK,OAAO;AAAA,QACZ,OAAO;AAAA,QACP,UAAU,QAAQ;AAAA,QAClB;AAAA,QACA,QAAQ,QAAQ,SAAS,iBAAiB,QAAQ;AAAA,MACpD,CAAC;AACD,aAAO;AAAA,IACT;AAAA,IACA,QAAuB;AACrB,aAAO;AAAA,QACL,GAAG;AAAA,QACH,WAAW,CAAC,GAAG,MAAM,SAAS;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACF;;;AChZA;AAAA,EAEE;AAAA,OACK;;;ACHP,SAAS,kBAAkB;AAC3B,SAAS,IAAI,OAAO,OAAO,SAAS,IAAI,YAAY;AACpD,SAAS,cAAc;AACvB,SAAS,SAAS,YAAY,MAAM,UAAU,SAAS,WAAW;AAClE;AAAA,EACE;AAAA,EACA;AAAA,EAEA;AAAA,OACK;AACP,SAAS,SAAS;;;AC0CX,IAAM,gBAAgB;AAGtB,SAAS,aAAa,QAAoD;AAC/E,QAAM,QAAQ,OAAO,WAAW,aAAa;AAC7C,SAAO,OAAO,UAAU,YAAY,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI;AACpE;AAGO,SAAS,eACd,QACA,OACwB;AACxB,SAAO,EAAE,GAAG,QAAQ,UAAU,EAAE,GAAG,OAAO,UAAU,CAAC,aAAa,GAAG,MAAM,EAAE;AAC/E;AAoCA,IAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;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;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;AAGD,SAAS,UAAU,MAAsB;AACvC,SAAO,KACJ,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACV;AAGA,SAAS,aAAa,OAAe,eAAiC;AACpE,QAAM,QAAQ,UAAU,KAAK,EAC1B,MAAM,GAAG,EACT,OAAO,CAAC,SAAS,KAAK,UAAU,iBAAiB,CAAC,UAAU,IAAI,IAAI,CAAC;AACxE,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAiBO,SAAS,kBACd,OACA,UACA,UAA8B,CAAC,GACd;AACjB,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAE5D,QAAM,eAAe,MAAM,KAAK;AAChC,MAAI,CAAC,aAAc,QAAO,EAAE,UAAU,OAAO,MAAM,eAAe,SAAS,GAAG,cAAc,CAAC,EAAE;AAC/F,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO,EAAE,UAAU,OAAO,MAAM,cAAc,SAAS,GAAG,cAAc,CAAC,EAAE;AAEjG,QAAM,gBAAgB,SAAS,YAAY;AAC3C,MAAI,cAAc,SAAS,aAAa,YAAY,CAAC,GAAG;AACtD,WAAO,EAAE,UAAU,MAAM,MAAM,YAAY,SAAS,GAAG,cAAc,CAAC,EAAE;AAAA,EAC1E;AAEA,QAAM,eAAe,UAAU,QAAQ;AACvC,QAAM,YAAY,UAAU,YAAY;AACxC,MAAI,aAAa,aAAa,SAAS,SAAS,GAAG;AACjD,WAAO,EAAE,UAAU,MAAM,MAAM,cAAc,SAAS,GAAG,cAAc,CAAC,EAAE;AAAA,EAC5E;AAEA,QAAM,QAAQ,aAAa,cAAc,aAAa;AACtD,MAAI,MAAM,WAAW,GAAG;AAGtB,WAAO,EAAE,UAAU,OAAO,MAAM,UAAU,SAAS,GAAG,cAAc,CAAC,EAAE;AAAA,EACzE;AAEA,QAAM,UAAU,MAAM;AAAA,IAAO,CAAC,SAC5B,IAAI,OAAO,MAAM,KAAK,QAAQ,uBAAuB,MAAM,CAAC,KAAK,EAAE,KAAK,YAAY;AAAA,EACtF;AACA,QAAM,eAAe,MAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,SAAS,IAAI,CAAC;AACnE,QAAM,UAAU,QAAQ,SAAS,MAAM;AACvC,QAAM,WAAW,WAAW;AAC5B,SAAO,EAAE,UAAU,MAAM,WAAW,YAAY,UAAU,SAAS,aAAa;AAClF;AAiCO,SAAS,6BAA6B,UAAuC,CAAC,GAAG;AACtF,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,SAAO,eAAe,aACpB,QACA,KACwB;AACxB,UAAM,QAAQ,aAAa,MAAM;AACjC,QAAI,CAAC,OAAO;AACV,UAAI,mBAAmB,UAAU;AAC/B,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ;AAAA,QACV;AAAA,MACF;AAEA,aAAO,QAAQ,oBAAoB,QAAQ,kBAAkB,QAAQ,GAAG,IAAI,EAAE,QAAQ,KAAK;AAAA,IAC7F;AAEA,UAAM,YAAY,kBAAkB,OAAO,OAAO,MAAM,OAAO;AAC/D,QAAI,CAAC,UAAU,UAAU;AACvB,YAAM,SACJ,UAAU,SAAS,eACf,6BACA,iDAAiD,UAAU,UAAU,KAAK,QAAQ,CAAC,CAAC,IAClF,UAAU,aAAa,SACnB,cAAc,UAAU,aAAa,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,KAC3D,EACN;AACN,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,QAAQ,2BAA2B,MAAM;AAAA,MAC3C;AAAA,IACF;AAGA,QAAI,QAAQ,kBAAmB,QAAO,QAAQ,kBAAkB,QAAQ,GAAG;AAC3E,WAAO,EAAE,QAAQ,KAAK;AAAA,EACxB;AACF;AAsBO,SAAS,qBAAqB,UAAwC,CAAC,GAAG;AAC/E,QAAM,YAAY,QAAQ,aAAa;AACvC,SAAO,eAAe,SACpB,QACA,MACiC;AACjC,UAAM,SAAS,QAAQ,UAAU,yBAAyB,QAAQ,cAAc;AAChF,UAAM,UAAU,OAAO,KAAK,MAAM,GAAG,IAAI;AACzC,UAAM,SACJ;AAGF,UAAM,OAAO;AAAA,MACX,kBAAkB,IAAI;AAAA,MACtB,eAAe,OAAO,SAAS,QAAQ;AAAA,MACvC;AAAA,EAAkB,OAAO;AAAA,MACzB;AAAA,IACF,EAAE,KAAK,MAAM;AACb,QAAI,MAAM;AACV,QAAI;AACF,YAAM,MAAM,OAAO;AAAA,QACjB;AAAA,UACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,UAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,QAChC;AAAA,QACA;AAAA,MACF;AAAA,IACF,QAAQ;AACN,aAAO;AAAA,IACT;AACA,UAAM,QAAQ,IAAI,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC,GAAG,KAAK;AAC9C,QAAI,CAAC,MAAO,QAAO;AACnB,WAAO,eAAe,QAAQ,KAAK;AAAA,EACrC;AACF;;;ACpKA,IAAM,oBAA+D;AAAA,EACnE,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,cAAc;AAAA,EACd,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,yBAAyB;AAC3B;AAEA,IAAM,iBAA4D;AAAA,EAChE,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,cAAc;AAAA,EACd,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,YAAY;AACd;AAEA,IAAM,gBAAkD;AAAA,EACtD,oBAAoB;AAAA,EACpB,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,mBAAmB;AAAA,EACnB,sBAAsB;AAAA,EACtB,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,iBAAiB;AAAA,EACjB,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,yBAAyB;AAC3B;AAEO,SAAS,sBACd,UAAwC,CAAC,GACkB;AAC3D,SAAO;AAAA,IACL,MAAM,QAAQ,QAAQ;AAAA,IACtB,YAAY;AAAA,MACV,EAAE,KAAK,qBAAqB,aAAa,4CAA4C;AAAA,MACrF,EAAE,KAAK,kBAAkB,aAAa,gDAAgD;AAAA,MACtF,EAAE,KAAK,qBAAqB,aAAa,mDAAmD;AAAA,MAC5F,EAAE,KAAK,uBAAuB,aAAa,sCAAsC;AAAA,MACjF,EAAE,KAAK,gBAAgB,aAAa,wDAAwD;AAAA,MAC5F,EAAE,KAAK,oBAAoB,aAAa,kCAAkC;AAAA,MAC1E,EAAE,KAAK,sBAAsB,aAAa,kCAAkC;AAAA,MAC5E,EAAE,KAAK,oBAAoB,aAAa,yCAAyC;AAAA,MACjF,EAAE,KAAK,cAAc,aAAa,wDAAwD;AAAA,IAC5F;AAAA,IACA,WAAW,CAAC,aAAa,SAAS,SAAS;AAAA,IAC3C,MAAM,MAAM,EAAE,UAAU,SAAS,GAAG;AAClC,YAAM,UAAU,uBAAuB,UAAU,UAAU,OAAO;AAClE,aAAO;AAAA,QACL,YAAY,QAAQ;AAAA,QACpB,WAAW,QAAQ;AAAA,QACnB,OAAO,QAAQ,SAAS,IAAI,CAAC,YAAY,QAAQ,OAAO,EAAE,KAAK,IAAI;AAAA,MACrE;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,uBACd,UACA,UACA,UAAwC,CAAC,GACjB;AACxB,QAAM,SAAS,gBAAgB,QAAQ;AACvC,QAAM,YAAY,SAAS,aAAa,oBAAoB,SAAS,MAAM;AAC3E,QAAM,kBAAkB,uBAAuB,QAAQ;AACvD,QAAM,8BAA8B,gBAAgB;AAAA,IAAO,CAAC,WAC1D,SAAS,SAAS,KAAK,CAAC,YAAY,qBAAqB,SAAS,MAAM,CAAC;AAAA,EAC3E,EAAE;AACF,QAAM,uBAAuB,gBAAgB;AAC7C,QAAM,gBACJ,yBAAyB,IACrB,aAAa,QAAQ,SAAS,YAAY,KAAK,SAAS,SAAS,SAAS,CAAC,IAC3E,8BAA8B;AACpC,QAAM,uBAAuB,SAAS,SAAS;AAAA,IAAO,CAAC,YACrD,kBAAkB,SAAS,QAAQ;AAAA,EACrC,EAAE;AACF,QAAM,mBACJ,SAAS,SAAS,WAAW,IACzB,SAAS,eACP,IACA,IACF,uBAAuB,SAAS,SAAS;AAC/C,QAAM,mBACJ,SAAS,SAAS,WAAW,IACzB,SAAS,eACP,IACA,IACF,QAAQ,SAAS,SAAS,IAAI,CAAC,YAAY,sBAAsB,SAAS,QAAQ,CAAC,CAAC;AAC1F,QAAM,qBAAqB,yBAAyB,IAAI,mBAAmB;AAC3E,QAAM,UAAU,OAAO,IAAI,CAAC,UAAU,aAAa,MAAM,MAAM,SAAS,UAAU,OAAO,CAAC;AAC1F,QAAM,sBAAsB,QAAQ,OAAO,OAAO,EAAE;AACpD,QAAM,eACJ,OAAO,WAAW,IAAK,YAAY,IAAI,IAAK,sBAAsB,KAAK,IAAI,GAAG,OAAO,MAAM;AAC7F,QAAM,WAAW,eAAe,QAAQ,UAAU,UAAU,OAAO;AACnE,QAAM,kBAAkB,qBAAqB,UAAU,UAAU,SAAS;AAC1E,QAAM,oBAAoB,uBAAuB,UAAU,UAAU,SAAS;AAC9E,QAAM,aAAa,SAAS,eAAgB,YAAY,IAAI,IAAK,YAAY,IAAI;AACjF,QAAM,wBACJ,OAAO,WAAW,IAAK,YAAY,IAAI,IAAK,IAAI,sBAAsB,KAAK,IAAI,GAAG,OAAO,MAAM;AAEjG,QAAM,uBAAyD;AAAA,IAC7D,mBAAmB,QAAQ,gBAAgB;AAAA,IAC3C,gBAAgB,QAAQ,aAAa;AAAA,IACrC,mBAAmB,QAAQ,gBAAgB;AAAA,IAC3C,qBAAqB,QAAQ,kBAAkB;AAAA,IAC/C,cAAc,QAAQ,YAAY;AAAA,IAClC,cAAc,QAAQ,YAAY;AAAA,IAClC,kBAAkB,QAAQ,eAAe;AAAA,IACzC,oBAAoB,QAAQ,iBAAiB;AAAA,IAC7C,kBAAkB,QAAQ,SAAS,OAAO;AAAA,IAC1C,YAAY,QAAQ,UAAU;AAAA,IAC9B,yBAAyB,QAAQ,qBAAqB;AAAA,EACxD;AACA,QAAM,iBAAiB,2BAA2B,SAAS,kBAAkB,CAAC,CAAC;AAC/E,QAAM,UAAU,aAAa,sBAAsB,gBAAgB,QAAQ,mBAAmB;AAC9F,QAAM,aAAa,EAAE,GAAG,mBAAmB,GAAG,SAAS,YAAY,GAAG,QAAQ,WAAW;AACzF,QAAM,WAAW,yBAAyB,SAAS,UAAU,UAAU;AACvE,QAAM,YAAY,kBAAkB,SAAS,QAAQ,WAAW,cAAc;AAE9E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,QAAQ,SAAS;AAAA,MACf,CAAC,YAAY,QAAQ,aAAa,WAAW,QAAQ,aAAa;AAAA,IACpE;AAAA,IACA;AAAA,IACA,YAAY,OAAO;AAAA,IACnB;AAAA,IACA,iBAAiB,SAAS;AAAA,IAC1B,wBAAwB,SAAS;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,yBACd,SACA,UACA,aAAwD,mBACvC;AACjB,QAAM,WAA4B,CAAC;AACnC,MAAI,MAAM,QAAQ,gBAAgB,WAAW,cAAc,GAAG;AAC5D,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM,SAAS,QAAQ,SAAS,cAAc,IAC1C,8BACA;AAAA,MACJ,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,gBAAgB,QAAQ,eAAe;AAAA,IACrD,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,mBAAmB,WAAW,iBAAiB,GAAG;AAClE,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,mBAAmB,QAAQ,kBAAkB;AAAA,IAC3D,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,cAAc,WAAW,YAAY,GAAG;AACxD,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,cAAc,QAAQ,aAAa;AAAA,IACjD,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,kBAAkB,WAAW,gBAAgB,GAAG;AAChE,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,kBAAkB,QAAQ,iBAAiB;AAAA,IACzD,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,YAAY,WAAW,UAAU,GAAG;AACpD,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS,SAAS,eACd,oDACA;AAAA,MACJ,UAAU,EAAE,YAAY,QAAQ,WAAW;AAAA,IAC7C,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEO,SAAS,2BACd,SACuC;AACvC,SAAO,YAAY;AACjB,UAAM,YAAsC,CAAC;AAC7C,UAAM,WAA4B,CAAC;AACnC,eAAW,YAAY,QAAQ,WAAW;AACxC,YAAM,kBAAkB,MAAM,QAAQ,IAAI,QAAQ;AAClD,YAAM,WAAW,MAAM,QAAQ,oBAAoB,EAAE,UAAU,UAAU,gBAAgB,CAAC;AAC1F,YAAM,WAAW,WACb;AAAA,QACE,GAAG;AAAA,QACH,gBAAgB;AAAA,UACd,GAAI,gBAAgB,kBAAkB,CAAC;AAAA,UACvC,GAAI,MAAM,QAAQ,QAAQ,IAAI,WAAW,CAAC,QAAQ;AAAA,QACpD;AAAA,MACF,IACA;AACJ,YAAM,UAAU,uBAAuB,UAAU,UAAU;AAAA,QACzD,YAAY,QAAQ;AAAA,QACpB,SAAS,QAAQ;AAAA,MACnB,CAAC;AACD,gBAAU,KAAK,OAAO;AACtB,eAAS,KAAK,GAAG,QAAQ,QAAQ;AAAA,IACnC;AACA,UAAM,UAAU,0BAA0B,SAAS;AACnD,WAAO;AAAA,MACL,QAAQ,SAAS,WAAW;AAAA,MAC5B;AAAA,MACA;AAAA,MACA,UAAU,EAAE,eAAe,QAAQ,UAAU,OAAO;AAAA,IACtD;AAAA,EACF;AACF;AAEA,eAAsB,wBACpB,SAC+B;AAC/B,QAAM,QAAQ,QAAQ,SAAS,sBAAsB;AACrD,QAAM,SAAS,MAAM,MAAM,MAAM;AAAA,IAC/B,UAAU,QAAQ;AAAA,IAClB,UAAU,QAAQ;AAAA,IAClB,QAAQ,QAAQ,UAAU,IAAI,gBAAgB,EAAE;AAAA,EAClD,CAAC;AACD,QAAM,OAAO,MAAM,MAAM,MAAM;AAAA,IAC7B,UAAU,QAAQ;AAAA,IAClB,UAAU,QAAQ;AAAA,IAClB,QAAQ,QAAQ,UAAU,IAAI,gBAAgB,EAAE;AAAA,EAClD,CAAC;AACD,QAAM,cAAc,OAAO;AAC3B,QAAM,YAAY,KAAK;AACvB,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,eAAe,QAAQ,gBAAgB;AAC7C,SAAO;AAAA,IACL,QAAQ,eAAe,kBAAkB,aAAa;AAAA,IACtD;AAAA,IACA;AAAA,IACA,KAAK,cAAc;AAAA,EACrB;AACF;AAEO,SAAS,2BACd,QACkD;AAClD,QAAM,aAA+D,CAAC;AACtE,aAAW,QAAQ,QAAQ;AACzB,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,iBAAkB,WAAW,QAAQ,KAAK,CAAC;AACjD,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,MAAM,GAAG;AACtD,YAAM,YAAY,cAAc,oBAAoB,GAAG,CAAC;AACxD,UAAI,CAAC,UAAW;AAChB,UAAI,OAAO,SAAS,KAAK,EAAG,gBAAe,SAAS,IAAI,QAAQ,KAAK;AAAA,IACvE;AACA,eAAW,QAAQ,IAAI;AAAA,EACzB;AACA,SAAO;AACT;AAEO,SAAS,sBAAsB,OAAqC;AACzE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,YAAY,SAAS;AAAA,IACrB,UAAU,SAAS;AAAA,IACnB,oBAAoB,SAAS,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI;AAAA,IACnE,WAAW,SAAS;AAAA,IACpB,oBAAoB,qBAAqB,QAAQ;AAAA,EACnD,EAAE;AACJ;AAEO,SAAS,oBAAoB,OAAqC;AACvE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,OAAO,SAAS;AAAA,IAChB,eAAe,SAAS;AAAA,IACxB,iBAAiB,SAAS;AAAA,IAC1B,mBAAmB,SAAS,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI;AAAA,IAClE,SAAS,qBAAqB,QAAQ;AAAA,EACxC,EAAE;AACJ;AAEO,SAAS,iBAAiB,OAAqC;AACpE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,OAAO,SAAS;AAAA,IAChB,QAAQ,SAAS;AAAA,IACjB,SAAS,SAAS,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI,EAAE,KAAK,MAAM;AAAA,EACvE,EAAE;AACJ;AAEO,SAAS,oBAAoB,OAAqC;AACvE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,UAAU,SAAS;AAAA,IACnB,OAAO,SAAS;AAAA,IAChB,WAAW,SAAS;AAAA,IACpB,UAAU,SAAS;AAAA,IACnB,mBAAmB,SAAS,SAAS,IAAI,CAAC,aAAa;AAAA,MACrD,QAAQ,QAAQ;AAAA,MAChB,MAAM,QAAQ;AAAA,IAChB,EAAE;AAAA,IACF,QAAQ,gBAAgB,QAAQ,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AAAA,EAC7D,EAAE;AACJ;AAEO,SAAS,wBACd,OACA,UAAuC,CAAC,GACZ;AAC5B,QAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,QAAM,eAAe,mBAAmB,KAAK;AAC7C,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,mBAAmB,MAAM,QAAQ,OAAO,CAAC,WAAW;AACxD,WAAO,OAAO,aAAa,KAAK,MAAM,OAAO,UAAU,IAAI,IAAI,QAAQ,IAAI;AAAA,EAC7E,CAAC,EAAE;AACH,QAAM,mBAAmB,oBAAI,IAAoB;AACjD,aAAW,UAAU,MAAM,SAAS;AAClC,qBAAiB,IAAI,OAAO,cAAc,iBAAiB,IAAI,OAAO,WAAW,KAAK,KAAK,CAAC;AAAA,EAC9F;AACA,QAAM,2BAA2B,CAAC,GAAG,iBAAiB,OAAO,CAAC,EAAE;AAAA,IAC9D,CAAC,UAAU,QAAQ;AAAA,EACrB,EAAE;AACF,QAAM,2BAA2B,MAAM,MAAM;AAAA,IAC3C,CAAC,SAAS,WAAW,KAAK,IAAI,EAAE,SAAS;AAAA,EAC3C,EAAE;AACF,QAAM,mBAAmB,MAAM,MAAM,OAAO,CAAC,SAAS,KAAK,UAAU,SAAS,CAAC,EAAE;AACjF,QAAM,UAAU;AAAA,IACd,YAAY,MAAM,MAAM;AAAA,IACxB,cAAc,MAAM,QAAQ;AAAA,IAC5B,eAAe,MAAM,MAAM,WAAW,IAAI,IAAI,2BAA2B,MAAM,MAAM;AAAA,IACrF,yBAAyB,MAAM,MAAM,WAAW,IAAI,IAAI,mBAAmB,MAAM,MAAM;AAAA,IACvF,mBAAmB,MAAM,QAAQ,WAAW,IAAI,IAAI,mBAAmB,MAAM,QAAQ;AAAA,IACrF,4BACE,MAAM,QAAQ,WAAW,IAAI,IAAI,2BAA2B,MAAM,QAAQ;AAAA,IAC5E,kBAAkB,WAAW,SAAS,OAAO,CAAC,YAAY,QAAQ,aAAa,OAAO,EAAE;AAAA,IACxF,oBAAoB,aAAa,OAAO,CAAC,YAAY,QAAQ,aAAa,SAAS,EAAE;AAAA,EACvF;AACA,QAAM,WAA4B,CAAC;AACnC,MAAI,QAAQ,mBAAmB,GAAG;AAChC,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,SAAS,GAAG,QAAQ,gBAAgB;AAAA,MACpC,UAAU,EAAE,kBAAkB,QAAQ,iBAAiB;AAAA,IACzD,CAAC;AAAA,EACH;AACA,MAAI,QAAQ,iBAAiB,QAAQ,mBAAmB,IAAI;AAC1D,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,SAAS;AAAA,MACT,UAAU,EAAE,eAAe,QAAQ,cAAc;AAAA,IACnD,CAAC;AAAA,EACH;AACA,MAAI,QAAQ,qBAAqB,QAAQ,sBAAsB,IAAI;AACjE,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,SAAS;AAAA,MACT,UAAU,EAAE,mBAAmB,QAAQ,kBAAkB;AAAA,IAC3D,CAAC;AAAA,EACH;AACA,SAAO,EAAE,IAAI,SAAS,WAAW,GAAG,SAAS,SAAS;AACxD;AAEA,SAAS,uBAAuB,UAAuD;AACrF,MAAI,SAAS,iBAAiB,OAAQ,QAAO,CAAC,GAAG,SAAS,eAAe;AACzE,UAAQ,SAAS,kBAAkB,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE;AACjE;AAEA,SAAS,qBAAqB,UAA2C;AACvE,SAAO,uBAAuB,QAAQ,EAAE,QAAQ,CAAC,WAAY,OAAO,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC,CAAE;AAChG;AAEA,SAAS,qBAAqB,SAAyB,QAAqC;AAC1F,MAAI,OAAO,MAAM,QAAQ,OAAO,OAAO,GAAI,QAAO;AAClD,MAAI,OAAO,UAAU,QAAQ,WAAW,OAAO,OAAQ,QAAO;AAC9D,MAAI,OAAO,YAAY,QAAQ,aAAa,OAAO,SAAU,QAAO;AACpE,MAAI,OAAO,YAAY,QAAQ,aAAa,OAAO,SAAU,QAAO;AACpE,MAAI,OAAO,QAAQ,iBAAiB,OAAO,MAAM,QAAQ,IAAI,KAAK,IAAK,QAAO;AAC9E,SAAO;AACT;AAEA,SAAS,kBAAkB,SAAyB,UAA0C;AAC5F,SAAO,sBAAsB,SAAS,QAAQ,KAAK;AACrD;AAEA,SAAS,sBAAsB,SAAyB,UAAyC;AAC/F,QAAM,UAAU;AAAA,IACd,SAAS;AAAA,IACT,SAAS;AAAA,IACT,GAAI,SAAS,kBAAkB,CAAC;AAAA,IAChC,GAAG,qBAAqB,QAAQ;AAAA,EAClC,EAAE,OAAO,CAAC,UAA2B,QAAQ,OAAO,KAAK,CAAC,CAAC;AAC3D,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,SAAO,KAAK,IAAI,GAAG,QAAQ,IAAI,CAAC,WAAW,iBAAiB,QAAQ,QAAQ,IAAI,CAAC,CAAC;AACpF;AAEA,SAAS,aACP,OACA,UACA,SACS;AACT,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,WAAW,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI,EAAE,KAAK,MAAM;AACpE,QAAM,gBAAgB,kBAAkB,OAAO,UAAU;AAAA,IACvD,YAAY,QAAQ,mBAAmB;AAAA,EACzC,CAAC;AACD,SACE,cAAc,YAAY,iBAAiB,OAAO,QAAQ,MAAM,QAAQ,mBAAmB;AAE/F;AAEA,SAAS,eACP,QACA,UACA,UACA,SAC8E;AAC9E,MAAI,OAAO,WAAW;AACpB,WAAO,EAAE,SAAS,SAAS,eAAe,IAAI,GAAG,iBAAiB,GAAG,wBAAwB,EAAE;AACjG,QAAM,YAAY,SAAS,aAAa,CAAC;AACzC,QAAM,cAAc,OAAO,OAAO,CAAC,UAAU,kBAAkB,OAAO,SAAS,EAAE,SAAS,CAAC;AAC3F,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO;AAAA,MACL,SAAS,SAAS,mBAAmB,IAAI;AAAA,MACzC,iBAAiB;AAAA,MACjB,wBAAwB;AAAA,IAC1B;AAAA,EACF;AACA,MAAI,yBAAyB;AAC7B,aAAW,SAAS,aAAa;AAC/B,UAAM,gBAAgB,iBAAiB,OAAO,WAAW,SAAS,QAAQ;AAC1E,QAAI,aAAa,MAAM,MAAM,eAAe,OAAO,EAAG,2BAA0B;AAAA,EAClF;AACA,SAAO;AAAA,IACL,SAAS,yBAAyB,YAAY;AAAA,IAC9C,iBAAiB,YAAY;AAAA,IAC7B;AAAA,EACF;AACF;AAEA,SAAS,kBACP,OACA,WACmB;AACnB,QAAM,mBAAmB,IAAI,IAAI,MAAM,eAAe,CAAC,CAAC;AACxD,SAAO,UAAU,OAAO,CAAC,aAAa;AACpC,WAAO,SAAS,YAAY,MAAM,MAAO,SAAS,MAAM,iBAAiB,IAAI,SAAS,EAAE;AAAA,EAC1F,CAAC;AACH;AAEA,SAAS,iBACP,OACA,WACA,UAC2B;AAC3B,QAAM,mBAAmB,kBAAkB,OAAO,SAAS;AAC3D,QAAM,kBAAkB,SAAS;AAAA,IAAO,CAAC,YACvC,iBAAiB,KAAK,CAAC,aAAa;AAClC,UAAI,SAAS,aAAa,SAAS,cAAc,QAAQ,GAAI,QAAO;AACpE,UAAI,SAAS,UAAU,SAAS,WAAW,QAAQ,OAAQ,QAAO;AAClE,UAAI,SAAS,YAAY,SAAS,aAAa,QAAQ,SAAU,QAAO;AACxE,UAAI,SAAS,YAAY,SAAS,aAAa,QAAQ,SAAU,QAAO;AACxE,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AACA,SAAO,gBAAgB,SAAS,IAAI,kBAAkB;AACxD;AAEA,SAAS,qBACP,UACA,UACA,WACQ;AACR,MAAI,SAAS,aAAc,QAAO,YAAY,IAAI;AAClD,MAAI,UAAW,QAAO;AACtB,QAAM,UAAU;AAAA,IACd,SAAS;AAAA,IACT,GAAI,SAAS,kBAAkB,CAAC;AAAA,IAChC,SAAS;AAAA,EACX,EAAE,OAAO,CAAC,UAA2B,QAAQ,OAAO,KAAK,CAAC,CAAC;AAC3D,SAAO,KAAK,IAAI,GAAG,QAAQ,IAAI,CAAC,WAAW,iBAAiB,QAAQ,SAAS,MAAM,CAAC,CAAC;AACvF;AAEA,SAAS,uBACP,UACA,UACA,WACQ;AACR,MAAI,SAAS,aAAc,QAAO,YAAY,IAAI;AAClD,QAAM,WAAW,SAAS,kBAAkB,CAAC;AAC7C,QAAM,YAAY,SAAS,mBAAmB,CAAC;AAC/C,QAAM,gBACJ,SAAS,WAAW,IAChB,qBAAqB,UAAU,UAAU,SAAS,IAClD,QAAQ,SAAS,IAAI,CAAC,UAAU,iBAAiB,OAAO,SAAS,MAAM,CAAC,CAAC;AAC/E,QAAM,mBACJ,UAAU,WAAW,IACjB,IACA,UAAU,OAAO,CAAC,UAAU,iBAAiB,OAAO,SAAS,MAAM,KAAK,GAAG,EAAE,SAC7E,UAAU;AAChB,SAAO,QAAQ,iBAAiB,IAAI,iBAAiB;AACvD;AAEA,SAAS,gBAAgB,UAAiD;AACxE,MAAI,SAAS,QAAQ,OAAQ,QAAO,CAAC,GAAG,SAAS,MAAM;AACvD,SAAO,eAAe,SAAS,MAAM,EAAE,IAAI,CAAC,MAAM,WAAW,EAAE,IAAI,SAAS,QAAQ,CAAC,IAAI,KAAK,EAAE;AAClG;AAEA,SAAS,eAAe,MAAwB;AAC9C,SAAO,KACJ,MAAM,eAAe,EACrB,IAAI,CAAC,aAAa,SAAS,KAAK,CAAC,EACjC,OAAO,CAAC,aAAa,SAAS,SAAS,KAAK,CAAC,oBAAoB,QAAQ,CAAC;AAC/E;AAEA,SAAS,oBAAoB,QAAyB;AACpD,QAAM,aAAa,OAAO,YAAY;AACtC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,CAAC,WAAW,WAAW,SAAS,MAAM,CAAC;AAChD;AAEA,SAAS,aACP,eACA,gBACA,SAA8D,mBAC5B;AAClC,MAAI,WAAW,sBAAuB,QAAO;AAC7C,QAAM,SAAS,EAAE,GAAG,cAAc;AAClC,aAAW,UAAU,OAAO,OAAO,cAAc,GAAG;AAClD,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAwC;AACtF,aAAO,GAAG,IAAI;AACd,UAAI,QAAQ,eAAgB,QAAO,eAAe;AAClD,UAAI,QAAQ,eAAgB,QAAO,eAAe;AAAA,IACpD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,0BACP,WACwB;AACxB,QAAM,OAAO,oBAAI,IAAsB;AACvC,aAAW,WAAW,WAAW;AAC/B,eAAW,OAAO,OAAO,KAAK,QAAQ,OAAO,EAAyB,MAAK,IAAI,GAAG;AAAA,EACpF;AACA,QAAM,MAA8B,CAAC;AACrC,aAAW,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,GAAG;AAClC,QAAI,GAAG,IAAI,QAAQ,UAAU,IAAI,CAAC,YAAY,QAAQ,QAAQ,GAAG,CAAC,CAAC;AAAA,EACrE;AACA,MAAI,YAAY,QAAQ,UAAU,IAAI,CAAC,YAAY,QAAQ,SAAS,CAAC;AACrE,SAAO;AACT;AAEA,SAAS,kBACP,SACA,SACQ;AACR,MAAI,WAAW;AACf,MAAI,QAAQ;AACZ,aAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,OAAO,GAAwC;AACxF,QAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,EAAG;AAC7C,UAAM,SAAS,QAAQ,GAAG;AAC1B,QAAI,CAAC,OAAO,SAAS,MAAM,EAAG;AAC9B,UAAM,QAAQ,QAAQ,4BAA4B,IAAI,SAAS;AAC/D,gBAAY,QAAQ;AACpB,aAAS;AAAA,EACX;AACA,SAAO,UAAU,IAAI,IAAI,WAAW;AACtC;AAEA,SAAS,oBAAoB,QAAwB;AACnD,SAAO,OACJ,KAAK,EACL,YAAY,EACZ,QAAQ,YAAY,GAAG,EACvB,QAAQ,QAAQ,GAAG;AACxB;AAEA,SAAS,iBAAiB,QAAgB,UAA0B;AAClE,QAAM,cAAcC,cAAa,MAAM;AACvC,MAAI,YAAY,WAAW,EAAG,QAAO;AACrC,QAAM,gBAAgB,IAAI,IAAIA,cAAa,QAAQ,CAAC;AACpD,QAAM,UAAU,YAAY,OAAO,CAAC,SAAS,cAAc,IAAI,IAAI,CAAC;AACpE,SAAO,QAAQ,SAAS,YAAY;AACtC;AAEA,SAASA,cAAa,MAAwB;AAC5C,QAAM,aAAa,KAChB,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,MAAM,KAAK,EACX,IAAI,CAAC,SAAS,KAAK,KAAK,KAAK,CAAC,CAAC,EAC/B,OAAO,CAAC,UAAU,KAAK,UAAU,KAAK,QAAQ,KAAK,IAAI,MAAM,CAACC,WAAU,IAAI,IAAI,CAAC;AACpF,SAAO,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC;AAChC;AAEA,SAAS,KAAK,MAAsB;AAClC,MAAI,KAAK,SAAS,KAAK,KAAK,KAAK,SAAS,EAAG,QAAO,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AACxE,MAAI,KAAK,SAAS,KAAK,KAAK,KAAK,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,EAAE;AACpE,MAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,EAAE;AACnE,MAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,EAAE;AAClE,SAAO;AACT;AAEA,SAAS,WAAW,MAAwB;AAC1C,QAAM,OAAiB,CAAC;AACxB,QAAM,QAAQ;AACd,MAAI,QAAQ,MAAM,KAAK,IAAI;AAC3B,SAAO,UAAU,MAAM;AACrB,SAAK,KAAK,MAAM,CAAC,CAAC;AAClB,YAAQ,MAAM,KAAK,IAAI;AAAA,EACzB;AACA,SAAO;AACT;AAEA,SAAS,MAAM,QAAgB,WAAwC;AACrE,SAAO,cAAc,UAAa,SAAS;AAC7C;AAEA,SAAS,aAAa,WAA4B;AAChD,SAAO,YAAY,IAAI;AACzB;AAEA,SAAS,QAAQ,QAAmC;AAClD,QAAM,SAAS,OAAO,OAAO,OAAO,QAAQ;AAC5C,SAAO,OAAO,WAAW,IAAI,IAAI,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;AAC1F;AAEA,SAAS,QAAQ,OAAuB;AACtC,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEA,IAAMA,aAAY,oBAAI,IAAI;AAAA,EACxB;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;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;;;ACn5BD;AAAA,EACE;AAAA,EAGA;AAAA,OACK;;;ACIA,SAAS,qBAAqB,OAMlB;AACjB,QAAM,aAAa,MAAM,QAAQ,MAAM,oBAAI,KAAK,IAAI,EAAE,YAAY;AAClE,SAAO;AAAA,IACL,IAAI;AAAA,MACF;AAAA,MACA,GAAG,MAAM,IAAI,IAAI,MAAM,UAAU,EAAE,IAAI,SAAS,IAAI,KAAK,UAAU,MAAM,YAAY,CAAC,CAAC,CAAC;AAAA,IAC1F;AAAA,IACA,MAAM,MAAM;AAAA,IACZ;AAAA,IACA,OAAO,MAAM;AAAA,IACb,QAAQ,MAAM;AAAA,IACd,UAAU,MAAM;AAAA,EAClB;AACF;;;AC5BA;AAAA,EACE;AAAA,EAUA;AAAA,EAEA;AAAA,OACK;AA8BA,IAAM,0BAA0B;AAAA,EACrC,UAAU;AAAA,EACV,iBAAiB;AAAA,EACjB,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,SAAS;AACX;AAqDO,SAAS,oBAAoB,OAAyD;AAC3F,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AAqBO,SAAS,yBACd,SACgC;AAChC,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,6BAAsE,CAAC;AAC7E,QAAM,eAAe,QAAQ,MAAM,IAAI,CAAC,SAAS;AAC/C,UAAM,UAAU,gBAAgB,QAAQ,OAAO,KAAK,OAAO,WAAW;AACtE,+BAA2B,KAAK,EAAE,IAAI;AACtC,WAAO,sBAAsB,QAAQ,OAAO,MAAM,SAAS,GAAG;AAAA,EAChE,CAAC;AACD,QAAM,SAAS,wBAAwB;AAAA,IACrC,QAAQ,QAAQ;AAAA,IAChB;AAAA,IACA,aAAa,QAAQ;AAAA,IACrB,aAAa,aAAa,QAAQ,CAAC,gBAAgB,YAAY,WAAW;AAAA,IAC1E,UAAU,CAAC;AAAA,IACX,aAAa;AAAA,MACX,aAAa;AAAA,QAAQ,CAAC,gBACpB,mBAAmB,2BAA2B,YAAY,EAAE,KAAK,CAAC,CAAC;AAAA,MACrE;AAAA,IACF;AAAA,IACA,UAAU,QAAQ;AAAA,EACpB,CAAC;AACD,QAAM,YAAY,8BAA8B,OAAO,2BAA2B;AAClF,QAAM,mBAAmB,iCAAiC;AAAA,IACxD,GAAG,OAAO;AAAA,IACV,GAAG,OAAO;AAAA,EACZ,CAAC;AAED,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,sBACP,OACA,MACA,SACA,KACsB;AACtB,QAAM,WAAW,QAAQ;AACzB,QAAM,YAAY,OAAO,QAAQ,QAAQ,CAAC,WAAW,OAAO,KAAK,SAAS,CAAC;AAC3E,QAAM,UAAU,MAAM,QAAQ,OAAO,CAAC,WAAW,UAAU,SAAS,OAAO,EAAE,CAAC;AAC9E,QAAM,YAAY,QAAQ,CAAC,GAAG,mBAAmB;AACjD,QAAM,iBAAiB,KAAK,aACxB,KAAK,IAAI,GAAG,UAAU,SAAS,KAAK,UAAU,IAC9C,UAAU,SAAS,IACjB,IACA;AACN,QAAM,cAAc,KAAK,UAAU,KAAK,IAAI,GAAG,WAAW,KAAK,OAAO,IAAI,WAAW,IAAI,IAAI;AAC7F,QAAM,YAAY,gBAAgB,SAAS,GAAG;AAC9C,QAAM,oBAAoB,MAAM,KAAK,IAAI,WAAW,gBAAgB,aAAa,UAAU,KAAK,CAAC;AAEjG,SAAO;AAAA,IACL,IAAI,KAAK;AAAA,IACT,aAAa,KAAK;AAAA,IAClB,aAAa,KAAK;AAAA,IAClB,UAAU,KAAK;AAAA,IACf,iBAAiB,KAAK;AAAA,IACtB,YAAY,KAAK;AAAA,IACjB,WAAW,KAAK;AAAA,IAChB,aAAa,KAAK;AAAA,IAClB,kBAAkB,KAAK;AAAA,IACvB;AAAA,IACA,aAAa,OAAO;AAAA,MAClB,GAAG,UAAU,IAAI,CAAC,aAAa,UAAU,QAAQ,EAAE;AAAA,MACnD,GAAG,QAAQ,IAAI,CAAC,WAAW,QAAQ,OAAO,KAAK,EAAE,EAAE;AAAA,IACrD,CAAC;AAAA,IACD,gBACE,KAAK,mBAAmB,KAAK,eAAe,aAAa,UAAU;AAAA,IACrE,UAAU;AAAA,MACR,GAAG,KAAK;AAAA,MACR,OAAO,KAAK;AAAA,MACZ;AAAA,MACA,aAAa,UAAU;AAAA,MACvB,qBAAqB;AAAA,MACrB,kBAAkB,UAAU;AAAA,MAC5B,gBAAgB,UAAU;AAAA,MAC1B,YAAY,UAAU;AAAA,MACtB,gBAAgB,UAAU;AAAA,IAC5B;AAAA,EACF;AACF;AAEA,SAAS,gBACP,SACA,KAC6F;AAC7F,MAAI,QAAQ,WAAW,EAAG,QAAO,EAAE,OAAO,GAAG,kBAAkB,CAAC,EAAE;AAClE,QAAM,mBAAmB,QACtB;AAAA,IACC,CAAC,WACC,OAAO,cACP,eAAe,OAAO,UAAU,YAAY,KAC5C,eAAe,OAAO,UAAU,WAAW;AAAA,EAC/C,EACC,OAAO,SAAS;AACnB,QAAM,qBAAqB,QACxB,IAAI,CAAC,WAAW,OAAO,kBAAkB,eAAe,OAAO,UAAU,gBAAgB,CAAC,EAC1F,OAAO,SAAS;AACnB,QAAM,mBAAmB,QACtB,OAAO,CAAC,WAAW;AAClB,UAAM,aACJ,OAAO,cACP,eAAe,OAAO,UAAU,YAAY,KAC5C,eAAe,OAAO,UAAU,WAAW;AAC7C,WAAO,aAAa,KAAK,MAAM,UAAU,KAAK,IAAI,QAAQ,IAAI;AAAA,EAChE,CAAC,EACA,IAAI,CAAC,WAAW,OAAO,EAAE;AAC5B,SAAO;AAAA,IACL,OAAO,iBAAiB,SAAS,IAAI,IAAI;AAAA,IACzC,YAAY,YAAY,gBAAgB;AAAA,IACxC,gBAAgB,UAAU,kBAAkB;AAAA,IAC5C;AAAA,EACF;AACF;AAEA,SAAS,UAAU,OAA4C;AAC7D,SAAO,QAAQ,SAAS,OAAO,SAAS,KAAK,MAAM,KAAK,CAAC,CAAC;AAC5D;AAEA,SAAS,YAAY,QAAsC;AACzD,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC;AAC/D;AAEA,SAAS,UAAU,QAAsC;AACvD,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC;AAC/D;AAEA,SAAS,mBAAmB,SAA4C;AACtE,SAAO,QAAQ,IAAI,CAAC,WAAW,OAAO,KAAK,EAAE;AAC/C;AAEA,SAAS,OAAU,OAAiB;AAClC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAEA,SAAS,MAAM,OAAuB;AACpC,SAAO,KAAK,MAAM,QAAQ,GAAI,IAAI;AACpC;;;ACzPO,SAAS,aACd,SACA,OAC4C;AAC5C,MAAI,CAAC,QAAQ,gBAAgB,OAAQ,QAAO;AAC5C,SAAO,yBAAyB;AAAA,IAC9B,GAAI,QAAQ,aAAa,CAAC;AAAA,IAC1B,QAAQ,QAAQ,mBAAmB,QAAQ;AAAA,IAC3C;AAAA,IACA,OAAO,QAAQ;AAAA,EACjB,CAAC;AACH;;;AHuGO,SAAS,kCACd,SAC6B;AAC7B,MAAI,cAAc;AAClB,QAAM,eAA4C,CAAC;AAEnD,SAAO;AAAA,IACL,QAAQ,QAAQ;AAAA,IAChB,MAAM,QAAQ,EAAE,SAAS,YAAY,GAAG;AACtC,UAAI,YAAY,QAAS,OAAM,IAAI,MAAM,gCAAgC;AACzE,UAAI,CAAC,aAAa;AAChB,cAAM,kBAAkB,QAAQ,IAAI;AACpC,sBAAc;AAAA,MAChB;AACA,YAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,YAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,YAAM,eAAe,mBAAmB,KAAK;AAC7C,YAAM,YAAY,aAAa,SAAS,KAAK;AAC7C,aAAO;AAAA,QACL,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,WAAW,QAAQ,SAAS;AAAA,QAC5B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,eAAe,CAAC,GAAG,YAAY;AAAA,QAC/B,QAAQ;AAAA,MACV;AAAA,IACF;AAAA,IACA,SAAS,EAAE,MAAM,GAAG;AAClB,YAAM,gBAAgB,MAAM,WAAW,SAAS;AAAA,QAC9C,CAAC,YAAY,QAAQ,aAAa;AAAA,MACpC;AACA,YAAM,QAA6B;AAAA,QACjC,cAAc;AAAA,UACZ,IAAI;AAAA,UACJ,QAAQ,MAAM,WAAW;AAAA,UACzB,UAAU;AAAA,UACV,QAAQ,MAAM,WAAW,KACrB,8BACA;AAAA,UACJ,UAAU,EAAE,UAAU,MAAM,WAAW,SAAS;AAAA,QAClD,CAAC;AAAA,QACD,cAAc;AAAA,UACZ,IAAI;AAAA,UACJ,QAAQ,cAAc,WAAW;AAAA,UACjC,UAAU;AAAA,UACV,QACE,cAAc,WAAW,IACrB,oBACA,GAAG,cAAc,MAAM;AAAA,UAC7B,UAAU,EAAE,UAAU,cAAc;AAAA,QACtC,CAAC;AAAA,MACH;AACA,UAAI,MAAM,UAAW,OAAM,KAAK,sBAAsB,MAAM,UAAU,MAAM,CAAC;AAC7E,aAAO;AAAA,IACT;AAAA,IACA,aAAa;AACX,aAAO,EAAE,MAAM,OAAO,MAAM,OAAO,QAAQ,uCAAuC;AAAA,IACpF;AAAA,IACA,MAAM,IAAI,QAAQ,KAAK;AACrB,YAAM,OAAO,MAAM,+BAA+B,SAAS,QAAQ,IAAI,MAAM,SAAS;AACtF,mBAAa,KAAK,IAAI;AACtB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,eAAsB,yBACpB,SACsC;AACtC,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAC5D,QAAM,kBAAkB,QAAQ,IAAI;AACpC,QAAM,QAAqC,CAAC;AAC5C,MAAI,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAClD,MAAI,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AACzE,MAAI,eAAe,mBAAmB,KAAK;AAC3C,MAAI,YAAY,aAAa,SAAS,KAAK;AAC3C,MAAI,OAAO;AAEX,WAAS,YAAY,GAAG,aAAa,eAAe,aAAa;AAC/D,QAAI,QAAQ,QAAQ,QAAS,OAAM,IAAI,MAAM,iCAAiC;AAC9E,UAAM,WAAW,MAAM,QAAQ,KAAK;AAAA,MAClC,MAAM,QAAQ;AAAA,MACd,MAAM,QAAQ;AAAA,MACd;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,eAAe;AAAA,MACf,QAAQ,QAAQ;AAAA,IAClB,CAAC;AAED,WAAO,QAAQ,SAAS,IAAI;AAC5B,UAAM,OAAO,MAAM,+BAA+B,SAAS,UAAU,SAAS;AAC9E,YAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAC9C,iBAAa,KAAK;AAClB,mBAAe,KAAK;AACpB,gBAAY,KAAK;AACjB,UAAM,KAAK,IAAI;AACf,UAAM,QAAQ,SAAS,IAAI;AAE3B,QAAI,KAAM;AACV,QAAI,CAAC,KAAK,WAAW,KAAK,aAAa,WAAW,EAAG;AAAA,EACvD;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAAA,IACd,MAAM,QAAQ;AAAA,IACd,YAAY,MAAM;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAe,+BACb,SACA,UACA,YAAY,GACwB;AACpC,QAAM,eAA+B,CAAC;AACtC,aAAW,cAAc,SAAS,eAAe,CAAC,GAAG;AACnD,iBAAa,KAAK,GAAI,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,aAAa,CAAE;AAAA,EAC7F;AACA,aAAW,cAAc,SAAS,eAAe,CAAC,GAAG;AACnD,iBAAa,KAAK,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,aAAa,CAAC;AAAA,EACxF;AAEA,QAAM,UAAU,SAAS,eACrB,MAAM,0BAA0B,QAAQ,MAAM,SAAS,YAAY,IACnE;AAEJ,QAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,QAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,QAAM,eAAe,mBAAmB,KAAK;AAC7C,QAAM,YAAY,aAAa,SAAS,KAAK;AAC7C,QAAM,OAAO,QAAQ,SAAS,IAAI;AAClC,QAAM,QAAQ,qBAAqB;AAAA,IACjC,MAAM;AAAA,IACN,OAAO,QAAQ;AAAA,IACf,QAAQ,QAAQ;AAAA,IAChB,UAAU;AAAA,MACR,MAAM,QAAQ;AAAA,MACd;AAAA,MACA;AAAA,MACA,kBAAkB,aAAa;AAAA,MAC/B,SAAS,SAAS;AAAA,MAClB,cAAc,SAAS,SAAS,UAAU;AAAA,MAC1C,YAAY,WAAW,SAAS,OAAO,CAAC,YAAY,QAAQ,aAAa,OAAO,EAAE;AAAA,IACpF;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA,OAAO,SAAS;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,SAAS;AAAA,EACrB;AACF;;;AIrKA,eAAsB,+BACpB,SAC+C;AAC/C,iCAA+B,OAAO;AACtC,QAAM,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC3C,QAAM,SAA+C,CAAC;AACtD,MAAI;AACJ,MAAI,WAA4B,CAAC;AACjC,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,MAAI,aAAa,SAAS,kBAAkB,GAAG;AAC7C,QAAI,QAAQ,WAAW;AACrB,kBAAY,MAAM;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,4BAA4B,QAAQ,SAAU;AAAA,QACvD;AAAA,QACA;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,oBAAoB,+BAA+B;AAAA,IAC5E;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,eAAe,GAAG;AAC1C,QAAI,QAAQ,UAAU;AACpB,iBAAW;AAAA,QACT,GAAI,MAAM;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA,YAAY;AACV,6BAAiB,QAAQ,MAAM;AAC/B,mBAAO,QAAQ,SAAU;AAAA,cACvB,MAAM,QAAQ;AAAA,cACd;AAAA,cACA,QAAQ,QAAQ;AAAA,cAChB;AAAA,YACF,CAAC;AAAA,UACH;AAAA,UACA,CAAC,cAAc,GAAG,UAAU,MAAM;AAAA,QACpC;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,iBAAiB,4BAA4B;AAAA,IACtE;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,uBAAuB,GAAG;AAClD,QAAI,QAAQ,kBAAkB;AAC5B,oBAAc,MAAM;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,iBAAkB;AAAA,YAC/B,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,yBAAyB,8BAA8B;AAAA,IAChF;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,kBAAkB,GAAG;AAC7C,QAAI,QAAQ,iBAAiB;AAC3B,wBAAkB,MAAM;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,gBAAiB;AAAA,YAC9B,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA,CAAC,WAAW,OAAO;AAAA,MACrB;AAAA,IACF,WAAW,QAAQ,mBAAmB;AACpC,wBAAkB,MAAM;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,2BAA2B,SAAS,WAAW;AAAA,QACxD;AAAA,QACA,CAAC,WAAW,OAAO;AAAA,MACrB;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,oBAAoB,0CAA0C;AAAA,IACvF;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,gBAAgB,GAAG;AAC3C,QAAI,QAAQ,iBAAiB;AAC3B,sBAAgB,MAAM;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,gBAAiB;AAAA,YAC9B,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA;AAAA,MACF;AACA,iBAAW,CAAC,GAAG,UAAU,GAAI,cAAc,YAAY,CAAC,CAAE;AAAA,IAC5D,OAAO;AACL,gBAAU,QAAQ,KAAK,kBAAkB,iCAAiC;AAAA,IAC5E;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,WAAW,GAAG;AACtC,QAAI,QAAQ,SAAS;AACnB,kBAAY,MAAM;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,QAAS;AAAA,YACtB,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA,CAAC,WAAW,GAAG,OAAO,WAAW,aAAa,MAAM,KAAK,OAAO,MAAM;AAAA,MACxE;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,aAAa,4BAA4B;AAAA,IAClE;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAe,2BACb,SACA,aACmC;AACnC,QAAM,WAAW,QAAQ;AACzB,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,0EAA0E;AAAA,EAC5F;AACA,QAAM,EAAE,MAAM,MAAM,GAAG,KAAK,IAAI;AAChC,QAAM,eAAe,QAAQ,8BAA8B,WAAW;AACtE,QAAM,gBAAgB,OAAO,KAAK,gBAAgB;AAClD,QAAM,SAAS,MAAM,yBAAyB;AAAA,IAC5C,GAAG;AAAA,IACH,MAAM,QAAQ,QAAQ;AAAA,IACtB;AAAA,IACA,QAAQ,QAAQ;AAAA,IAChB,MAAM;AAAA,EACR,CAAC;AACD,SAAO;AAAA,IACL,SAAS,OAAO,MAAM,KAAK,CAAC,eAAe;AACzC,aAAO,WAAW,aAAa,SAAS,KAAK,QAAQ,WAAW,OAAO;AAAA,IACzE,CAAC;AAAA,IACD,SAAS,GAAG,OAAO,UAAU,gCAAgC,OAAO,OAAO,IAAI,CAAC;AAAA,IAChF,UAAU;AAAA,EACZ;AACF;AAEA,SAAS,8BACP,aACyC;AACzC,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,SAAO,OAAO,EAAE,GAAG,aAAa,MAAM,YAAY,QAAQ,KAAK;AACjE;AAEA,eAAe,SACb,QACA,KACA,OACA,QACA,WACY;AACZ,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,MAAI;AACF,UAAM,SAAS,MAAM,OAAO;AAC5B,WAAO,KAAK;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,MACR,SAAS,UAAU,MAAM;AAAA,MACzB;AAAA,MACA,YAAY,IAAI,EAAE,YAAY;AAAA,IAChC,CAAC;AACD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,WAAO,KAAK;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,MACR,SAAU,MAAgB;AAAA,MAC1B;AAAA,MACA,YAAY,IAAI,EAAE,YAAY;AAAA,IAChC,CAAC;AACD,UAAM;AAAA,EACR;AACF;AAEA,SAAS,UACP,QACA,KACA,OACA,SACM;AACN,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,SAAO,KAAK,EAAE,OAAO,QAAQ,WAAW,SAAS,WAAW,WAAW,YAAY,UAAU,CAAC;AAChG;AAEA,SAAS,yBAAyB,QAAmD;AACnF,SAAO,GAAG,OAAO,WAAW,MAAM,yBAAyB,KAAK,UAAU,OAAO,YAAY,CAAC;AAChG;AAEA,SAAS,6BAA6B,UAAiD;AACrF,QAAM,kBAAkB,SAAS,aAAa,UAAU;AACxD,QAAM,kBAAkB,SAAS,aAAa,UAAU;AACxD,QAAM,WAAW,SAAS,eAAe,aAAa;AACtD,SAAO,GAAG,eAAe,oBAAoB,eAAe,oBAAoB,QAAQ;AAC1F;AAEA,SAAS,uBAAuB,QAAwC;AACtE,QAAM,UAAU,OAAO,QAAQ,OAAO,OAAO,EAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,EACrC,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG,IAAI,aAAa,KAAK,CAAC,EAAE,EACrD,KAAK,IAAI;AACZ,SAAO,GAAG,OAAO,SAAS,WAAW,QAAQ,GAAG,UAAU,KAAK,OAAO,KAAK,EAAE;AAC/E;AAEA,SAAS,aAAa,OAAuB;AAC3C,SAAO,OAAO,SAAS,KAAK,IAAI,MAAM,QAAQ,CAAC,IAAI,OAAO,KAAK;AACjE;AAEA,SAAS,aACP,SACA,OACS;AACT,SAAO,CAAC,QAAQ,iBAAiB,QAAQ,cAAc,SAAS,KAAK;AACvE;AAEA,SAAS,+BAA+B,SAAsD;AAC5F,aAAW,SAAS,QAAQ,kBAAkB,CAAC,GAAG;AAChD,QAAI,CAAC,aAAa,SAAS,KAAK,GAAG;AACjC,YAAM,IAAI,MAAM,kBAAkB,KAAK,iBAAiB;AAAA,IAC1D;AACA,QAAI,CAAC,gBAAgB,SAAS,KAAK,GAAG;AACpC,YAAM,IAAI,MAAM,qBAAqB,KAAK,CAAC;AAAA,IAC7C;AAAA,EACF;AACF;AAEA,SAAS,gBACP,SACA,OACS;AACT,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,aAAO,QAAQ,QAAQ,SAAS;AAAA,IAClC,KAAK;AACH,aAAO,QAAQ,QAAQ,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,QAAQ,gBAAgB;AAAA,IACzC,KAAK;AACH,aAAO,QAAQ,QAAQ,mBAAmB,QAAQ,iBAAiB;AAAA,IACrE,KAAK;AACH,aAAO,QAAQ,QAAQ,eAAe;AAAA,IACxC,KAAK;AACH,aAAO,QAAQ,QAAQ,OAAO;AAAA,EAClC;AACF;AAEA,SAAS,qBAAqB,OAA6C;AACzE,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,EACX;AACF;AAEA,SAAS,iBAAiB,QAAuC;AAC/D,MAAI,QAAQ,SAAS;AACnB,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AACF;;;APvUA,IAAM,eAAe,EAAE,OAAO,EAAE,MAAM,gBAAgB;AACtD,IAAM,cAAc,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,IAAK;AAC/C,IAAM,wBAAwB,EAC3B,OAAO,EACP,IAAI,CAAC,EACL,IAAI,GAAG,EACP,MAAM,8BAA8B;AACvC,IAAM,0BAA0B,EAAE,KAAK;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,IAAM,kBAAkB,EAAE,OAAkB,CAAC,UAAU;AACrD,MAAI;AACF,sBAAkB,KAAK;AACvB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF,GAAG,8BAA8B;AACjC,IAAM,sCAAsC,EACzC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,QAAQ,EAAE,QAAQ,eAAe;AACnC,CAAC,EACA,OAAO;AACV,IAAM,iCAAiC,EACpC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,QAAQ,EAAE,KAAK,CAAC,WAAW,WAAW,CAAC;AAAA,EACvC,YAAY;AAAA,EACZ,YAAY,EAAE,MAAM,eAAe,EAAE,IAAI,CAAC;AAC5C,CAAC,EACA,OAAO;AACV,IAAM,8BAA8B,EACjC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,QAAQ,EAAE,QAAQ,OAAO;AAAA,EACzB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACvB,YAAY;AAAA,EACZ,YAAY,EAAE,MAAM,eAAe,EAAE,IAAI,CAAC;AAC5C,CAAC,EACA,OAAO;AACV,IAAM,0BAA0B,EAC7B,OAAO;AAAA,EACN,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,EACvC,QAAQ,EAAE,QAAQ;AAAA,EAClB,YAAY,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EAC/D,OAAO,EAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,YAAY,EAAE,mBAAmB,UAAU;AAAA,IACzC;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACH,CAAC,EACA,OAAO,EACP,YAAY,CAAC,QAAQ,YAAY;AAChC,MAAI,OAAO,WAAW,WAAW,gBAAiB;AAClD,QAAM,mBAAmB,YAAY,OAAO,WAAW,UAAU;AACjE,MAAI,qBAAqB,OAAO,WAAW,YAAY;AACrD,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,cAAc,YAAY;AAAA,MACjC,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF,CAAC;AACH,IAAM,wBAAwB,EAC3B,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACrC,aAAa;AAAA,EACb,UAAU;AAAA,EACV,eAAe,aAAa,SAAS;AAAA,EACrC,cAAc,aAAa,SAAS;AAAA,EACpC,mBAAmB,aAAa,SAAS;AAAA,EACzC,QAAQ;AAAA,EACR,WAAW,EAAE,IAAI,SAAS;AAAA,EAC1B,WAAW,EAAE,IAAI,SAAS;AAC5B,CAAC,EACA,OAAO;AAEH,IAAM,qCAAqC,EAC/C,OAAO;AAAA,EACN,OAAO;AAAA,EACP,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACtB,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACtB,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,WAAW,EAAE,IAAI,SAAS;AAAA,EAC1B,WAAW,EAAE,IAAI,SAAS;AAAA,EAC1B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EACpC,YAAY,EAAE,MAAM,qBAAqB;AAAA,EACzC,qBAAqB,sBAAsB,SAAS;AAAA,EACpD,eAAe,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAC5C,CAAC,EACA,OAAO,EACP,YAAY,CAAC,OAAO,YAAY;AAC/B,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,CAAC,OAAO,SAAS,KAAK,MAAM,WAAW,QAAQ,GAAG;AAC3D,QAAI,aAAa,IAAI,UAAU,WAAW,GAAG;AAC3C,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,OAAO,aAAa;AAAA,QACzC,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,iBAAa,IAAI,UAAU,WAAW;AACtC,QAAI,UAAU,aAAa,MAAM,UAAU;AACzC,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,OAAO,UAAU;AAAA,QACtC,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,QAAI,UAAU,WAAW,mBAAmB;AAC1C,UAAI,CAAC,UAAU,iBAAiB,CAAC,UAAU,gBAAgB,CAAC,UAAU,mBAAmB;AACvF,gBAAQ,SAAS;AAAA,UACf,MAAM;AAAA,UACN,MAAM,CAAC,cAAc,KAAK;AAAA,UAC1B,SAAS;AAAA,QACX,CAAC;AAAA,MACH;AAAA,IACF;AACA,QACE,UAAU,WAAW,eACpB,CAAC,UAAU,iBAAiB,CAAC,UAAU,gBAAgB,CAAC,UAAU,oBACnE;AACA,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,KAAK;AAAA,QAC1B,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,QACE,UAAU,WAAW,cACrB,QAAQ,UAAU,YAAY,MAAM,QAAQ,UAAU,iBAAiB,GACvE;AACA,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,KAAK;AAAA,QAC1B,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,QAAI,UAAU,WAAW,cAAc,MAAM,WAAW,YAAY;AAClE,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,OAAO,QAAQ;AAAA,QACpC,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF;AACA,MAAI,MAAM,WAAW,YAAY;AAC/B,UAAM,WAAW,MAAM,WAAW;AAAA,MAChC,CAAC,cAAc,UAAU,gBAAgB,MAAM;AAAA,IACjD;AACA,QAAI,SAAS,WAAW,KAAK,SAAS,CAAC,GAAG,WAAW,YAAY;AAC/D,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,qBAAqB;AAAA,QAC5B,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF,WAAW,MAAM,wBAAwB,QAAW;AAClD,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,qBAAqB;AAAA,MAC5B,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MACE,MAAM,WAAW,qBACjB,MAAM,WAAW,OAAO,CAAC,cAAc,UAAU,WAAW,iBAAiB,EAAE,WAAW,GAC1F;AACA,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,QAAQ;AAAA,MACf,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MAAI,MAAM,WAAW,aAAa,MAAM,kBAAkB,QAAW;AACnE,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,eAAe;AAAA,MACtB,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF,CAAC;AAEI,IAAM,qCAAqC,EAC/C,OAAO;AAAA,EACN,MAAM,EAAE,QAAQ,gCAAgC;AAAA,EAChD,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACrC,UAAU;AAAA,EACV,UAAU;AAAA,EACV,eAAe;AAAA,EACf,mBAAmB;AAAA,EACnB,YAAY,EAAE,QAAQ;AAAA,EACtB,WAAW,EAAE,QAAQ,EAAE,SAAS;AAAA,EAChC,WAAW,EAAE,QAAQ;AAAA,EACrB,YAAY;AAAA,EACZ,WAAW,EAAE,QAAQ,EAAE,SAAS;AAClC,CAAC,EACA,OAAO;AAKH,IAAM,yCAAyC,EACnD,OAAO;AAAA,EACN,MAAM,EAAE,QAAQ,iCAAiC;AAAA,EACjD,OAAO;AAAA,EACP,aAAa;AAAA,EACb,UAAU;AAAA,EACV,UAAU;AAAA,EACV,eAAe;AAAA,EACf,cAAc;AAAA,EACd,mBAAmB;AACrB,CAAC,EACA,OAAO;AAmFV,IAAM,uBAAuB,KAAK,KAAK;AACvC,IAAM,gBAAyD;AAAA,EAC7D;AAAA,EACA;AACF;AACA,IAAM,oBAA6D;AAAA,EACjE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,SAAS,0BAA0B,MAAc,MAAsB;AAC5E,SAAO,SAAS,SAAS,GAAG,IAAI,IAAI,IAAI,EAAE;AAC5C;AAEO,SAAS,2BAA2B,MAAc,OAAuB;AAC9E,QAAM,cAAc,YAAY,MAAM,KAAK;AAC3C,QAAM,YAAY,sBAAsB,UAAU,WAAW;AAC7D,QAAM,aAAa,UAAU,UACzB,UAAU,OACV,GAAG,QAAQ,WAAW,EAAE,MAAM,GAAG,EAAE,CAAC,IAAI,OAAO,WAAW,EAAE,MAAM,GAAG,EAAE,CAAC;AAC5E,QAAM,kBAAkB,KAAK,UAAU,IAAI,EAAE,UAAU,cAAc;AACrE,QAAM,SAAS,KAAK,iBAAiB,UAAU;AAC/C,QAAM,0BAA0B,QAAQ,eAAe;AACvD,QAAM,iBAAiB,QAAQ,MAAM;AACrC,MAAI,CAAC,eAAe,WAAW,GAAG,uBAAuB,GAAG,GAAG,EAAE,GAAG;AAClE,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AACA,SAAO;AACT;AAEA,eAAe,4BACb,MACA,OACA,QACA,KACY;AACZ,QAAM,SAAS,2BAA2B,MAAM,KAAK;AACrD,QAAM,eAAe,eAAe,MAAM,MAAM;AAChD,MAAI,CAAC,aAAc,OAAM,IAAI,MAAM,sDAAsD;AACzF,SAAO,kBAAkB,MAAM,cAAc,QAAQ,OAAO,iBAAiB;AAC3E,UAAM,SAAS,MAAM,IAAI,YAAY;AACrC,UAAM,iBAAiB,MAAM,KAAK,YAAY;AAC9C,UAAM,kBAAkB,MAAM;AAAA,MAAkB;AAAA,MAAM;AAAA,MAAc;AAAA,MAAO,CAAC,kBAC1E,KAAK,aAAa;AAAA,IACpB;AACA,QAAI,eAAe,QAAQ,gBAAgB,OAAO,eAAe,QAAQ,gBAAgB,KAAK;AAC5F,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAsB,8BACpB,MACA,OAC8C;AAC9C,QAAM,gBAAgB,YAAY,MAAM,KAAK;AAC7C,MAAI;AACF,WAAO,MAAM;AAAA,MAA4B;AAAA,MAAM;AAAA,MAAe;AAAA,MAAO,CAAC,WACpE,qCAAqC,MAAM,eAAe,MAAM;AAAA,IAClE;AAAA,EACF,SAAS,OAAO;AACd,QAAI,cAAc,KAAK,EAAG,QAAO;AACjC,UAAM;AAAA,EACR;AACF;AAEA,eAAe,qCACb,MACA,OACA,QACuC;AACvC,QAAM,YAAY,MAAM,0BAA0B,QAAQ,YAAY;AACtE,QAAM,MAAM,KAAK,MAAM,UAAU,MAAM,SAAS,MAAM,CAAC;AACvD,QAAM,QAAQ,mCAAmC,MAAM,GAAG;AAC1D,MAAI,MAAM,UAAU,OAAO;AACzB,UAAM,IAAI,MAAM,8DAA8D;AAAA,EAChF;AACA,MAAI,QAAQ,MAAM,IAAI,MAAM,QAAQ,IAAI,GAAG;AACzC,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AACA,aAAW,aAAa,MAAM,YAAY;AACxC,QAAI,UAAU,WAAW,UAAW,OAAM,yBAAyB,QAAQ,SAAS;AAAA,EACtF;AACA,SAAO;AACT;AAGO,SAAS,iCACd,QACkC;AAClC,MAAI,CAAC,OAAO,UAAW,OAAM,IAAI,MAAM,+CAA+C;AACtF,SAAO,gBAAgB,OAAO,OAAO,OAAO,OAAO,OAAO,SAAS;AACrE;AAGA,eAAsB,kCACpB,SACA,KACY;AACZ,+BAA6B;AAC7B,QAAM,eAAe,uCAAuC,MAAM,QAAQ,SAAS;AACnF,SAAO,4BAA4B,QAAQ,MAAM,aAAa,OAAO,OAAO,OAAO,WAAW;AAC5F,UAAM,QAAQ,MAAM;AAAA,MAClB,QAAQ;AAAA,MACR,aAAa;AAAA,MACb;AAAA,IACF;AACA,WAAO;AAAA,MAA8B,QAAQ;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAc,CAAC,aAC/E;AAAA,QAA0B,SAAS;AAAA,QAAM,aAAa;AAAA,QAAe,CAAC,SACpE,IAAI;AAAA,UACF;AAAA,UACA,WAAW;AAAA,UACX,YAAY,SAAS,SAAS;AAAA,QAChC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAGA,eAAsB,0BACpB,SACqC;AACrC,SAAO,6BAA6B,SAAS,WAAW;AAC1D;AAGA,eAAsB,kCACpB,SACqC;AACrC,SAAO,6BAA6B,SAAS,UAAU;AACzD;AAIA,eAAe,6BACb,SACA,QACqC;AACrC,+BAA6B;AAC7B,QAAM,eAAe,OAAO;AAAA,IAC1B,uCAAuC,MAAM,QAAQ,SAAS;AAAA,EAChE;AACA,QAAM,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC3C,SAAO,4BAA4B,QAAQ,MAAM,aAAa,OAAO,OAAO,OAAO,WAAW;AAC5F,UAAM,QAAQ,MAAM,gBAAgB,QAAQ;AAAA,MAC1C,SAAS,QAAQ,WAAW,OAAO,QAAQ,GAAG;AAAA,MAC9C,OAAO,QAAQ,cAAc;AAAA,IAC/B,CAAC;AACD,QAAI;AACF,YAAM,YAAY;AAClB,YAAM,QAAQ,MAAM;AAAA,QAClB,QAAQ;AAAA,QACR,aAAa;AAAA,QACb;AAAA,MACF;AACA,aAAO,MAAM;AAAA,QACX;AAAA,UACE,MAAM,QAAQ;AAAA,UACd;AAAA,UACA;AAAA,UACA;AAAA,UACA,YAAY,QAAQ,cAAc;AAAA,UAClC,gBAAgB,MAAM;AAAA,UACtB;AAAA,UACA,SAAS,QAAQ;AAAA,QACnB;AAAA,QACA;AAAA,MACF;AAAA,IACF,UAAE;AACA,YAAM,MAAM,QAAQ;AAAA,IACtB;AAAA,EACF,CAAC;AACH;AAEA,eAAsB,qBACpB,SACqC;AACrC,+BAA6B;AAC7B,oCAAkC,OAAO;AACzC,QAAM,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC3C,QAAM,QAAQ,YAAY;AAAA,IACxB,QAAQ,SAAS,0BAA0B,QAAQ,MAAM,QAAQ,IAAI;AAAA,EACvE;AACA,SAAO;AAAA,IAA4B,QAAQ;AAAA,IAAM;AAAA,IAAO;AAAA,IAAM,CAAC,WAC7D,0BAA0B,SAAS,OAAO,QAAQ,GAAG;AAAA,EACvD;AACF;AAEA,eAAe,0BACb,SACA,OACA,QACA,KACqC;AACrC,QAAM,QAAQ,MAAM,gBAAgB,QAAQ;AAAA,IAC1C,SAAS,QAAQ,WAAW,OAAO,QAAQ,GAAG;AAAA,IAC9C,OAAO,QAAQ,cAAc;AAAA,EAC/B,CAAC;AAED,MAAI;AACF,UAAM,YAAY;AAClB,QAAI,QACF,QAAQ,WAAW,QACf,OACA,MAAM,qCAAqC,QAAQ,MAAM,OAAO,MAAM,EAAE,MAAM,CAAC,UAAU;AACvF,UAAI,cAAc,KAAK,EAAG,QAAO;AACjC,YAAM;AAAA,IACR,CAAC;AACP,QAAI,CAAC,OAAO;AACV,YAAM,WAAW,MAAM,kBAAkB,QAAQ,IAAI;AACrD,YAAM,uBAAuB,QAAQ,QAAQ,MAAM,QAAQ;AAC3D,cAAQ;AAAA,QACN;AAAA,QACA,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,QAAQ;AAAA,QACR;AAAA,QACA,WAAW,IAAI,EAAE,YAAY;AAAA,QAC7B,WAAW,IAAI,EAAE,YAAY;AAAA,QAC7B,SAAS,MAAM;AAAA,QACf,YAAY,CAAC;AAAA,MACf;AACA,YAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,YAAM,aAAa,QAAQ,EAAE,MAAM,eAAe,OAAO,SAAS,CAAC;AAAA,IACrE;AACA,QAAI,MAAM,SAAS,QAAQ,MAAM;AAC/B,YAAM,IAAI,MAAM,+DAA+D;AAAA,IACjF;AACA,UAAM,sBAAsB,MAAM;AAClC,UAAM,oBACJ,MAAM,WAAW,aACb,MAAM,WAAW,KAAK,CAACC,eAAcA,WAAU,gBAAgB,mBAAmB,IAClF;AACN,QAAI,MAAM,WAAW,cAAc,CAAC,mBAAmB;AACrD,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,UAAM,qBAAqB,MAAM,WAAW;AAAA,MAC1C,CAACA,gBACEA,WAAU,WAAW,qBAAqBA,WAAU,WAAW,eAChEA,WAAU,iBAAiB,UAC3BA,WAAU,sBAAsB;AAAA,IACpC;AACA,UAAM,wBAAwB,qBAC1B,gBAAgB,OAAO,OAAO,kBAAkB,IAChD;AACJ,UAAM,sBAAsB,QAAQ,MAAM,MAAM,QAAW;AAAA,MACzD,mBAAmB,wBACf;AAAA,QACE,SAAS,oCAAoC,uBAAuB,WAAW;AAAA,QAC/E,UAAU,CAAC,gBACT,qCAAqC,aAAa,uBAAuB,WAAW;AAAA,MACxF,IACA;AAAA,IACN,CAAC;AACD,UAAM,uBAAuB,QAAQ,QAAQ,MAAM,MAAM,QAAQ;AAEjE,QAAI,MAAM,WAAW,YAAY;AAC/B,YAAM,WAAW;AACjB,aAAO,MAAM;AAAA,QACX;AAAA,UACE,MAAM,QAAQ;AAAA,UACd;AAAA,UACA;AAAA,UACA,cAAc,gBAAgB,OAAO,OAAO,QAAQ;AAAA,UACpD,YAAY,QAAQ,cAAc;AAAA,UAClC,gBAAgB,MAAM;AAAA,UACtB;AAAA,UACA,SAAS,QAAQ;AAAA,QACnB;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,MAAM,WAAW,WAAW;AAC9B,aAAO,EAAE,OAAO,OAAO,UAAU,OAAO,SAAS,KAAK;AAAA,IACxD;AAEA,UAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAC5D,QAAI,YAAY,oBAAoB,KAAK;AACzC,QAAI;AACJ,QAAI;AACJ,QAAI;AAEJ,WAAO,aAAa,MAAM,WAAW,SAAS,eAAe;AAC3D,UAAI,CAAC,WAAW;AACd,cAAM,cAAc,MAAM,kBAAkB,QAAQ,IAAI;AACxD,YAAI,gBAAgB,MAAM,UAAU;AAClC,kBAAQ,MAAM;AAAA,YACZ;AAAA,YACA;AAAA,YACA,oDAAoD,MAAM,QAAQ,SAAS,WAAW;AAAA,YACtF,QAAQ;AAAA,YACR;AAAA,UACF;AACA,iBAAO,EAAE,OAAO,OAAO,UAAU,OAAO,SAAS,KAAK;AAAA,QACxD;AACA,cAAM,cAAc;AACpB,oBAAY,MAAM;AAAA,UAAqB;AAAA,UAAQ,YAAY;AAAA,UAAU,CAAC,iBACpE,yBAAyB,QAAQ,aAAa,cAAc,GAAG;AAAA,QACjE;AACA,cAAM,WAAW,KAAK,SAAS;AAC/B,cAAM,SAAS;AACf,cAAM,YAAY,IAAI,EAAE,YAAY;AACpC,cAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,cAAM,aAAa,QAAQ;AAAA,UACzB,MAAM;AAAA,UACN;AAAA,UACA,aAAa,UAAU;AAAA,UACvB,WAAW,UAAU;AAAA,QACvB,CAAC;AAAA,MACH;AAEA,YAAM,WAAW,MAAM,iBAAiB,OAAO,QAAQ,OAAO,WAAW,SAAS,GAAG;AACrF,kBAAY,SAAS;AACrB,YAAM,aAAa,SAAS;AAC5B,kBAAY,SAAS;AAErB,UAAI,WAAW,QAAQ;AACrB,kBAAU,SAAS;AACnB,kBAAU,YAAY,IAAI,EAAE,YAAY;AACxC,cAAM,SAAS;AACf,cAAM,YAAY,IAAI,EAAE,YAAY;AACpC,cAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,cAAM,aAAa,QAAQ;AAAA,UACzB,MAAM;AAAA,UACN;AAAA,UACA,aAAa,UAAU;AAAA,QACzB,CAAC;AACD;AAAA,MACF;AAEA,gBAAU,SAAS;AACnB,YAAM,SAAS;AACf,YAAM,YAAY,IAAI,EAAE,YAAY;AACpC,YAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,YAAM,aAAa,QAAQ;AAAA,QACzB,MAAM;AAAA,QACN;AAAA,QACA,aAAa,UAAU;AAAA,MACzB,CAAC;AACD,8BAAwB;AACxB,+BAAyB;AACzB,kBAAY;AAAA,IACd;AAEA,QAAI,CAAC,WAAW;AACd,YAAM,SAAS;AACf,YAAM,YAAY,IAAI,EAAE,YAAY;AACpC,YAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,WAAW;AAAA,QACX,GAAI,yBAAyB,EAAE,YAAY,uBAAuB,IAAI,CAAC;AAAA,QACvE;AAAA,QACA,UAAU;AAAA,QACV,SAAS;AAAA,MACX;AAAA,IACF;AAEA,UAAM,WAAW,MAAM,wBAAwB,QAAQ,gBAAgB,OAAO,OAAO,SAAS,CAAC;AAC/F,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY,SAAS;AAAA,MACrB;AAAA,MACA,UAAU;AAAA,MACV,SAAS;AAAA,IACX;AAAA,EACF,UAAE;AACA,UAAM,MAAM,QAAQ;AAAA,EACtB;AACF;AAcA,eAAe,8BACb,OACA,QACqC;AACrC,QAAM,EAAE,cAAc,QAAQ,MAAM,IAAI;AACxC,sBAAoB,MAAM,MAAM,cAAc,KAAK;AACnD,QAAM,YAAY,MAAM,WAAW,KAAK,CAAC,UAAU,MAAM,gBAAgB,aAAa,WAAW;AACjG,MACE,CAAC,aACD,cAAc,gBAAgB,aAAa,OAAO,OAAO,SAAS,CAAC,MACjE,cAAc,YAAY,GAC5B;AACA,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AAEA,QAAM,SAAS,WAAW,cAAc,cAAc;AACtD,QAAM,cAAc,WAAW,cAAc,aAAa,gBAAgB,aAAa;AACvF,QAAM,UAAU,oCAAoC,cAAc,MAAM;AACxE,SAAO;AAAA,IACL,MAAM;AAAA,IACN,OAAO,iBAAiB;AACtB,YAAM,eAAe;AACrB,YAAM,kBAAkB,aAAa;AACrC,UAAI,UAA2C;AAC/C,YAAM,cAAc,MAAM,kBAAkB,MAAM,IAAI;AACtD,UAAI,MAAM,WAAW,cAAc,MAAM,wBAAwB,UAAU,aAAa;AACtF,cAAM,IAAI;AAAA,UACR,mCAAmC,MAAM,uBAAuB,SAAS;AAAA,QAC3E;AAAA,MACF;AACA,UACE,WAAW,eACX,MAAM,WAAW,cACjB,gBAAgB,aAAa,eAC7B;AACA,cAAM,IAAI;AAAA,UACR,6CAA6C,aAAa,aAAa,SAAS,WAAW;AAAA,QAC7F;AAAA,MACF;AACA,UAAI,MAAM,WAAW,cAAc,MAAM,WAAW,mBAAmB;AACrE,cAAM,IAAI;AAAA,UACR,wCAAwC,MAAM,SAAS,MAAM,MAAM,eAAe,UAAU,MAAM;AAAA,QACpG;AAAA,MACF;AACA,UAAI,gBAAgB,MAAM,YAAY,gBAAgB,aAAa,eAAe;AAChF,cAAM,SACJ,WAAW,cACP,2CAA2C,MAAM,QAAQ,SAAS,WAAW,KAC7E,8CAA8C,aAAa,aAAa,SAAS,WAAW;AAClG,eAAO,MAAM,yBAAyB,OAAO,WAAW,QAAQ,MAAM;AAAA,MACxE;AAEA,UAAI,gBAAgB,aAAa;AAC/B,kBAAU,MAAM;AAAA,UACd,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,UACA,CAAC,aACC,qBAAqB,QAAQ,MAAM,UAAU,OAAO,iBAAiB;AACnE,kBAAM,aAAa,WAAW,cAAc,eAAe,SAAS;AACpE,kBAAM,aAAa,WAAW,cAAc,SAAS,OAAO;AAC5D,kBAAM,OAAO,MAAM,yBAAyB,YAAY,UAAU;AAClE,0CAA8B,MAAM,cAAc,MAAM;AACxD,mBAAO,gCAAgC;AAAA,cACrC,MAAM,MAAM;AAAA,cACZ;AAAA,cACA;AAAA,cACA,WAAW,MAAM,uBAAuB,YAAY,IAAI;AAAA,cACxD,kBAAkB;AAAA,cAClB,KAAK,MAAM;AAAA,YACb,CAAC;AAAA,UACH,CAAC;AAAA,QACL;AACA,YAAI,CAAC,SAAS;AACZ,gBAAM,IAAI,MAAM,aAAa,MAAM,8CAA8C;AAAA,QACnF;AACA,YAAI;AACF,+CAAqC,SAAS,cAAc,MAAM;AAAA,QACpE,SAAS,OAAO;AACd,cAAI;AACF,kBAAM,iCAAiC;AAAA,cACrC,MAAM,MAAM;AAAA,cACZ;AAAA,cACA,aAAa;AAAA,cACb,eAAe;AACb,6BAAa,YAAY;AACzB,sBAAM,eAAe;AAAA,cACvB;AAAA,YACF,CAAC;AACD,kBAAM,+BAA+B;AAAA,cACnC,MAAM,MAAM;AAAA,cACZ;AAAA,cACA,aAAa;AAAA,cACb,cAAc;AACZ,6BAAa,YAAY;AACzB,sBAAM,eAAe;AAAA,cACvB;AAAA,YACF,CAAC;AAAA,UACH,SAAS,cAAc;AACrB,kBAAM,IAAI;AAAA,cACR,CAAC,OAAO,YAAY;AAAA,cACpB,qBAAqB,MAAM;AAAA,YAC7B;AAAA,UACF;AACA,gBAAM;AAAA,QACR;AAAA,MACF;AACA,UAAI;AACF,YAAI,SAAS;AACX,gBAAM,8BAA8B;AAAA,YAClC,MAAM,MAAM;AAAA,YACZ;AAAA,YACA,aAAa;AAAA,YACb,eAAe;AACb,2BAAa,YAAY;AACzB,oBAAM,eAAe;AAAA,YACvB;AAAA,UACF,CAAC;AAAA,QACH;AACA,qBAAa,YAAY;AACzB,cAAM,eAAe;AACrB,YAAK,MAAM,kBAAkB,MAAM,IAAI,MAAO,aAAa;AACzD,gBAAM,IAAI,MAAM,aAAa,MAAM,6CAA6C;AAAA,QAClF;AACA,cAAM,oBAAoB,MAAM,IAAI;AAAA,MACtC,SAAS,OAAO;AACd,YAAI,CAAC,QAAS,OAAM;AACpB,YAAI;AACF,uBAAa,YAAY;AACzB,gBAAM,eAAe;AAAA,QACvB,SAAS,gBAAgB;AACvB,gBAAM,IAAI;AAAA,YACR,CAAC,OAAO,cAAc;AAAA,YACtB,aAAa,MAAM;AAAA,UACrB;AAAA,QACF;AACA,YAAI;AACF,gBAAM,iCAAiC;AAAA,YACrC,MAAM,MAAM;AAAA,YACZ;AAAA,YACA,aAAa;AAAA,YACb,eAAe;AACb,2BAAa,YAAY;AACzB,oBAAM,eAAe;AAAA,YACvB;AAAA,UACF,CAAC;AACD,gBAAM,+BAA+B;AAAA,YACnC,MAAM,MAAM;AAAA,YACZ;AAAA,YACA,aAAa;AAAA,YACb,cAAc;AACZ,2BAAa,YAAY;AACzB,oBAAM,eAAe;AAAA,YACvB;AAAA,UACF,CAAC;AACD,gBAAM,oBAAoB,MAAM,IAAI;AAAA,QACtC,SAAS,eAAe;AACtB,gBAAM,IAAI;AAAA,YACR,CAAC,OAAO,aAAa;AAAA,YACrB,aAAa,MAAM;AAAA,UACrB;AAAA,QACF;AACA,cAAM;AAAA,MACR;AACA,gBAAU,SAAS,WAAW,cAAc,aAAa;AACzD,gBAAU,YAAY,MAAM,IAAI,EAAE,YAAY;AAC9C,YAAM,SAAS,UAAU;AACzB,UAAI,WAAW,YAAa,OAAM,sBAAsB,UAAU;AAAA,UAC7D,QAAO,MAAM;AAClB,aAAO,MAAM;AACb,YAAM,YAAY,MAAM,IAAI,EAAE,YAAY;AAC1C,YAAM,UAAU,QAAQ,OAAO,MAAM,OAAO;AAC5C,YAAM,+BAA+B,QAAQ,cAAc,MAAM;AACjE,UAAI,SAAS;AACX,cAAM,+BAA+B;AAAA,UACnC,MAAM,MAAM;AAAA,UACZ;AAAA,UACA,aAAa;AAAA,UACb,cAAc;AACZ,yBAAa,YAAY;AACzB,kBAAM,eAAe;AAAA,UACvB;AAAA,QACF,CAAC;AAAA,MACH;AACA,aAAO,0BAA0B,OAAO,WAAW,WAAW,aAAa,KAAK;AAAA,IAClF;AAAA,IACA;AAAA,MACE,SAAS,MAAM;AAAA,MACf,mBAAmB;AAAA,QACjB;AAAA,QACA,UAAU,CAAC,gBACT,qCAAqC,aAAa,cAAc,MAAM;AAAA,MAC1E;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAe,yBACb,OACA,WACA,QACA,QACqC;AACrC,MAAI,MAAM,MAAM,WAAW,YAAY;AACrC,cAAU,SAAS;AACnB,cAAU,YAAY,MAAM,IAAI,EAAE,YAAY;AAC9C,WAAO,MAAM,MAAM;AAAA,EACrB;AACA,QAAM,SAAS,MAAM,QAAQ,MAAM,OAAO,QAAQ,MAAM,SAAS,MAAM,GAAG;AAC1E,QAAM,aAAa,MAAM,QAAQ;AAAA,IAC/B,MAAM,WAAW,cAAc,sBAAsB;AAAA,IACrD,OAAO,MAAM,aAAa;AAAA,IAC1B,aAAa,UAAU;AAAA,IACvB;AAAA,EACF,CAAC;AACD,SAAO,0BAA0B,OAAO,WAAW,OAAO,IAAI;AAChE;AAEA,SAAS,0BACP,OACA,WACA,UACA,SAC4B;AAC5B,SAAO;AAAA,IACL,OAAO,MAAM,aAAa;AAAA,IAC1B,OAAO,MAAM;AAAA,IACb;AAAA,IACA,GAAI,MAAM,YAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;AAAA,IACxD;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,gBACP,OACA,OACA,WACkC;AAClC,MAAI,CAAC,UAAU,eAAe;AAC5B,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,uBAAuB;AAAA,EACtF;AACA,MAAI,CAAC,UAAU,cAAc;AAC3B,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,wBAAwB;AAAA,EACvF;AACA,MAAI,CAAC,UAAU,mBAAmB;AAChC,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,8BAA8B;AAAA,EAC7F;AACA,MAAI,UAAU,WAAW,qBAAqB,UAAU,WAAW,YAAY;AAC7E,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,gBAAgB;AAAA,EAC/E;AACA,SAAO,OAAO,OAAO;AAAA,IACnB,MAAM;AAAA,IACN;AAAA,IACA,aAAa,UAAU;AAAA,IACvB,UAAU,OAAO,MAAM,IAAI;AAAA,IAC3B,UAAU,UAAU;AAAA,IACpB,eAAe,UAAU;AAAA,IACzB,cAAc,UAAU;AAAA,IACxB,mBAAmB,UAAU;AAAA,EAC/B,CAAC;AACH;AAEA,eAAe,8BACb,UACA,QACA,OACA,cACA,KAKY;AACZ,sBAAoB,UAAU,cAAc,KAAK;AACjD,QAAM,YAAY,MAAM,WAAW,KAAK,CAAC,UAAU,MAAM,gBAAgB,aAAa,WAAW;AACjG,MAAI,CAAC,WAAW;AACd,UAAM,IAAI,MAAM,wBAAwB,aAAa,WAAW,kBAAkB;AAAA,EACpF;AACA,QAAM,cAAc,gBAAgB,aAAa,OAAO,OAAO,SAAS;AACxE,MAAI,cAAc,WAAW,MAAM,cAAc,YAAY,GAAG;AAC9D,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,QAAM,WAAW,MAAM,wBAAwB,QAAQ,YAAY;AACnE,QAAM,eAAe;AAAA,IACnB;AAAA,IACA,UAAU;AAAA,IACV;AAAA,IACA,aAAa;AAAA,EACf;AACA,SAAO,kBAAkB,QAAQ,cAAc,OAAO,OAAO,SAAS;AACpE,QAAK,MAAM,kBAAkB,IAAI,MAAO,aAAa,eAAe;AAClE,YAAM,IAAI,MAAM,qDAAqD;AAAA,IACvE;AACA,UAAM,SAAS,MAAM,IAAI,EAAE,MAAM,WAAW,SAAS,CAAC;AACtD,QAAK,MAAM,kBAAkB,IAAI,MAAO,aAAa,eAAe;AAClE,YAAM,IAAI,MAAM,iDAAiD;AAAA,IACnE;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAe,0BACb,YACA,cACA,KACY;AACZ,QAAM,gBAAgB,MAAM,QAAQ,KAAK,OAAO,GAAG,4BAA4B,CAAC;AAChF,QAAM,gBAAgB,KAAK,eAAe,WAAW;AACrD,MAAI;AACF,UAAM,uBAAuB,YAAY,aAAa;AACtD,QAAK,MAAM,kBAAkB,aAAa,MAAO,cAAc;AAC7D,YAAM,IAAI,MAAM,kEAAkE;AAAA,IACpF;AACA,UAAM,SAAS,MAAM,IAAI,aAAa;AACtC,QAAK,MAAM,kBAAkB,aAAa,MAAO,cAAc;AAC7D,YAAM,IAAI,MAAM,iDAAiD;AAAA,IACnE;AACA,WAAO;AAAA,EACT,UAAE;AACA,UAAM,GAAG,eAAe,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EAC1D;AACF;AAEA,eAAe,wBACb,QACA,WACuC;AACvC,QAAM,WAAW,mCAAmC;AAAA,IAClD,KAAK;AAAA,OAED,MAAM;AAAA,QACJ;AAAA,QACA,8BAA8B,UAAU,WAAW;AAAA,MACrD,GACA,MAAM,SAAS,MAAM;AAAA,IACzB;AAAA,EACF;AACA,QAAM,aAAa,YAAY,QAAQ;AACvC,MAAI,eAAe,UAAU,cAAc;AACzC,UAAM,IAAI;AAAA,MACR,iEAAiE,UAAU,YAAY,SAAS,UAAU;AAAA,IAC5G;AAAA,EACF;AACA,MACE,SAAS,UAAU,UAAU,SAC7B,SAAS,gBAAgB,UAAU,eACnC,SAAS,aAAa,UAAU,YAChC,SAAS,aAAa,UAAU,YAChC,SAAS,kBAAkB,UAAU,iBACrC,SAAS,sBAAsB,UAAU,qBACzC,SAAS,WAAW,WAAW,MAC/B;AACA,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,SAAO;AACT;AAEA,SAAS,oBACP,MACA,cACA,OACM;AACN,MAAI,MAAM,UAAU,aAAa,OAAO;AACtC,UAAM,IAAI,MAAM,iEAAiE;AAAA,EACnF;AACA,MAAI,QAAQ,MAAM,IAAI,MAAM,QAAQ,IAAI,GAAG;AACzC,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACA,MAAI,OAAO,MAAM,IAAI,MAAM,aAAa,UAAU;AAChD,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACA,MAAI,MAAM,aAAa,aAAa,UAAU;AAC5C,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACF;AAEA,eAAe,yBACb,QACA,WACe;AACf,QAAM,uBAAuB,QAAQ,WAAW,MAAM,MAAS;AACjE;AAEA,eAAe,uBACb,QACA,WACA,KACY;AACZ,SAAO;AAAA,IACL;AAAA,IACA,KAAK,cAAc,sBAAsB,MAAM,UAAU,WAAW,GAAG,WAAW;AAAA,IAClF;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,kCAAkC,SAA4C;AACrF,MAAI,QAAQ,QAAQ,QAAQ,mBAAmB,MAAM;AACnD,UAAM,IAAI,MAAM,8EAA8E;AAAA,EAChG;AACA,QAAM,gBAAgB;AAAA,IACpB,QAAQ,QAAQ,QAAQ,QAAQ,iBAAiB;AAAA,IACjD,QAAQ,QAAQ,eAAe;AAAA,EACjC,EAAE,OAAO,OAAO,EAAE;AAClB,MAAI,gBAAgB,GAAG;AACrB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAe,iBACb,OACA,QACA,OACA,WACA,SACA,KAKC;AACD,SAAO,uBAAuB,QAAQ,WAAW,OAAO,kBAAkB;AACxE,UAAM,uBAAuB,MAAM,kBAAkB,aAAa;AAClE,QACE,UAAU,WAAW,qBACrB,UAAU,kBAAkB,wBAC5B,UAAU,iBAAiB,UAC3B,UAAU,sBAAsB,QAChC;AACA,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA,QACA,gBAAgB,OAAO,OAAO,SAAS;AAAA,MACzC;AACA,aAAO,EAAE,WAAW,YAAY,SAAS,WAAW;AAAA,IACtD;AAEA,8BAA0B,SAAS;AACnC,UAAM,aAAqD,CAAC;AAC5D,QAAI,UAAU,WAAW,WAAW;AAClC,YAAM,kBAAkB,MAAM;AAAA,QAC5B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,gBAAiB,YAAW,KAAK,eAAe;AAAA,IACtD;AACA,WAAO,6BAA6B,QAAQ,WAAW,eAAe,OAAO,aAAa;AACxF,YAAM,sBAAsB,MAAM;AAAA,QAChC;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA;AAAA,MACF;AACA,UAAI,oBAAqB,YAAW,KAAK,mBAAmB;AAC5D,YAAM,YAAY,sBAAsB,QAAQ,MAAM,UAAU;AAChE,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,aAAO,EAAE,GAAG,UAAU,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC,EAAG;AAAA,IAC5D,CAAC;AAAA,EACH,CAAC;AACH;AAEA,eAAe,4BACb,OACA,WACA,eACA,SACA,KAC2D;AAC3D,MAAI,CAAC,qBAAqB,OAAO,EAAG,QAAO;AAC3C,QAAM,YAAY,MAAM,+BAA+B;AAAA,IACrD,MAAM,QAAQ;AAAA,IACd,kBAAkB,QAAQ;AAAA,IAC1B,mBAAmB,kCAAkC,eAAe,OAAO;AAAA,IAC3E,iBAAiB,oBAAoB,OAAO,WAAW,eAAe,OAAO;AAAA,IAC7E,eAAe,oBAAoB,SAAS,aAAa;AAAA,IACzD,gBAAgB,4BAA4B,SAAS,aAAa;AAAA,IAClE,QAAQ,QAAQ;AAAA,IAChB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,eAAe,gCACb,QACA,WACA,eACA,SACA,KAC2D;AAC3D,MAAI,CAAC,yBAAyB,OAAO,EAAG,QAAO;AAC/C,QAAM,iBAAiB,MAAM,oBAAoB,aAAa;AAC9D,QAAM,YAAY,MAAM,+BAA+B;AAAA,IACrD,MAAM,QAAQ;AAAA,IACd,WAAW,QAAQ,YACf;AAAA,MACE,GAAG,QAAQ;AAAA,MACX,OAAO;AAAA,MACP,QAAQ,QAAQ,UAAU,UAAU,KAAK,QAAQ,aAAa,UAAU,WAAW;AAAA,IACrF,IACA;AAAA,IACJ,UAAU,QAAQ;AAAA,IAClB,iBAAiB,QAAQ;AAAA,IACzB,SAAS,QAAQ;AAAA,IACjB,eAAe,oBAAoB,SAAS,iBAAiB;AAAA,IAC7D,gBAAgB,4BAA4B,SAAS,iBAAiB;AAAA,IACtE,QAAQ,QAAQ;AAAA,IAChB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,SAAS,kCACP,eACA,SACyC;AACzC,MAAI,CAAC,QAAQ,QAAQ,CAAC,QAAQ,kBAAmB,QAAO;AACxD,QAAM,EAAE,MAAM,cAAc,GAAG,KAAK,IAAI,QAAQ,qBAAqB,CAAC;AACtE,QAAM,OAAO,QAAQ,QAAQ;AAC7B,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN;AAAA,IACA,eACE,KAAK,kBAAkB,OAAQ,QAAQ,+BAA+B,IAAK;AAAA,IAC7E,QAAQ,KAAK,UAAU,QAAQ;AAAA,IAC/B,gBAAgB,KAAK,kBAAkB,QAAQ;AAAA,IAC/C,iBAAiB,KAAK,mBAAmB,QAAQ;AAAA,IACjD,WAAW,KAAK,aAAa,QAAQ;AAAA,EACvC;AACF;AAEA,SAAS,oBACP,OACA,WACA,eACA,SAC0D;AAC1D,MAAI,CAAC,QAAQ,gBAAiB,QAAO;AACrC,SAAO,CAAC,UACN,QAAQ,gBAAiB;AAAA,IACvB,GAAG;AAAA,IACH;AAAA,IACA,WAAW,UAAU;AAAA,IACrB,aAAa,UAAU;AAAA,IACvB,MAAM;AAAA,IACN,cAAc,QAAQ;AAAA,IACtB;AAAA,IACA,UAAU,UAAU;AAAA,EACtB,CAAC;AACL;AAEA,SAAS,qBAAqB,SAA+C;AAC3E,QAAM,SAAS,oBAAoB,SAAS,aAAa;AACzD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO;AAAA,IACL,QAAQ,oBACN,QAAQ,QACR,QAAQ,qBACR,QAAQ,mBACR,4BAA4B,SAAS,aAAa,EAAE,SAAS;AAAA,EACjE;AACF;AAEA,SAAS,yBAAyB,SAA+C;AAC/E,QAAM,SAAS,oBAAoB,SAAS,iBAAiB;AAC7D,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO;AAAA,IACL,QAAQ,aACN,QAAQ,YACR,QAAQ,mBACR,QAAQ,mBACR,4BAA4B,SAAS,iBAAiB,EAAE,SAAS;AAAA,EACrE;AACF;AAEA,SAAS,oBACP,SACA,aACgC;AAChC,QAAM,YAAY,QAAQ,iBAAiB;AAC3C,SAAO,UAAU,OAAO,CAAC,UAAU,YAAY,SAAS,KAAK,CAAC;AAChE;AAEA,SAAS,4BACP,SACA,aACgC;AAChC,UAAQ,QAAQ,kBAAkB,CAAC,GAAG,OAAO,CAAC,UAAU,YAAY,SAAS,KAAK,CAAC;AACrF;AAEA,SAAS,sBACP,MACA,YACkD;AAClD,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,WAAW,QAAQ,CAAC,cAAc,UAAU,MAAM;AAAA,IAC1D,WAAW,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,SAAS,CAAC;AAAA,IACzE,UAAU,WAAW,QAAQ,CAAC,cAAc,UAAU,QAAQ;AAAA,IAC9D,aAAa,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,WAAW,CAAC;AAAA,IAC7E,iBAAiB,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,eAAe,CAAC;AAAA,IACrF,eAAe,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,aAAa,CAAC;AAAA,IACjF,WAAW,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,SAAS,CAAC;AAAA,EAC3E;AACF;AAEA,SAAS,YAAe,QAAmD;AACzE,WAAS,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;AAC1D,QAAI,OAAO,KAAK,MAAM,OAAW,QAAO,OAAO,KAAK;AAAA,EACtD;AACA,SAAO;AACT;AAEA,eAAe,kBACb,QACA,OACA,WACA,UACA,WACA,SACA,KAIC;AACD,SAAO,qBAAqB,QAAQ,MAAM,UAAU,OAAO,iBAAiB;AAC1E,UAAM,CAAC,eAAe,cAAc,IAAI,MAAM,QAAQ,IAAI;AAAA,MACxD,oBAAoB,YAAY;AAAA,MAChC,oBAAoB,SAAS,IAAI;AAAA,IACnC,CAAC;AACD,UAAM,aAAa,uBAAuB,gBAAgB,EAAE,QAAQ,QAAQ,OAAO,CAAC;AACpF,UAAM,YAAY,aAAa,SAAS,cAAc;AACtD,UAAM,YAAY,wBAAwB,gBAAgB;AAAA,MACxD,QAAQ,QAAQ;AAAA,MAChB,GAAG,QAAQ;AAAA,IACb,CAAC;AACD,UAAM,gBAAgB,SAAS;AAC/B,UAAM,SACJ,QAAQ,WAAW;AAAA,MACjB,OAAO,MAAM;AAAA,MACb,WAAW,UAAU;AAAA,MACrB,MAAM,QAAQ;AAAA,MACd;AAAA,MACA,eAAe,SAAS;AAAA,MACxB;AAAA,MACA;AAAA,MACA,UAAU,MAAM;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ,QAAQ;AAAA,IAClB,CAAC,KACD;AAAA,MACE;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,IACF;AACF,UAAM,aAAa,uBAAuB,gBAAgB,MAAM,MAAM,GAAG,SAAS;AAClF,UAAM,eAAe,MAAM,kBAAkB,SAAS,IAAI;AAC1D,QAAI,iBAAiB,eAAe;AAClC,YAAM,IAAI;AAAA,QACR,2DAA2D,aAAa,SAAS,YAAY;AAAA,MAC/F;AAAA,IACF;AACA,cAAU,gBAAgB;AAC1B,cAAU,oBAAoB;AAAA,MAC5B,MAAM,yBAAyB,cAAc,SAAS,IAAI;AAAA,IAC5D;AACA,UAAM,WAAW,mCAAmC;AAAA,MAClD,KAAK;AAAA,QACH,KAAK,UAAU;AAAA,UACb,MAAM;AAAA,UACN,OAAO,MAAM;AAAA,UACb,aAAa,UAAU;AAAA,UACvB,WAAW,UAAU;AAAA,UACrB,UAAU,OAAO,MAAM,IAAI;AAAA,UAC3B,UAAU,UAAU;AAAA,UACpB;AAAA,UACA,mBAAmB,UAAU;AAAA,UAC7B;AAAA,UACA,WAAW,aAAa;AAAA,UACxB;AAAA,UACA;AAAA,UACA,WAAW,aAAa;AAAA,QAC1B,CAAC;AAAA,MACH;AAAA,IACF;AACA,cAAU,eAAe,YAAY,QAAQ;AAC7C,cAAU,YAAY,IAAI,EAAE,YAAY;AACxC,UAAM;AAAA,MACJ;AAAA,MACA,8BAA8B,UAAU,WAAW;AAAA,MACnD;AAAA,IACF;AACA,UAAM,aAAa,QAAQ;AAAA,MACzB,MAAM;AAAA,MACN,OAAO,MAAM;AAAA,MACb,aAAa,UAAU;AAAA,MACvB,OAAO,WAAW;AAAA,MAClB,QAAQ,WAAW;AAAA,IACrB,CAAC;AACD,WAAO,EAAE,WAAW,WAAW;AAAA,EACjC,CAAC;AACH;AAEA,SAAS,kCACP,YACA,WACA,gBACA,WACA,WAC4B;AAC5B,QAAM,kBAAkB,WAAW,OAAO,4BAA4B,UAAU;AAChF,QAAM,gBAAgB,gBAAgB,OAAO,CAAC,SAAS,KAAK,eAAe,UAAU,EAAE,UAAU;AACjG,QAAM,oBACJ,kBAAkB,IAAI,IAAI,KAAK,IAAI,GAAG,gBAAgB,eAAe,IAAI;AAC3E,QAAM,gBAAgB,WAAW,gBAC7BC,SAAQ,OAAO,OAAO,UAAU,cAAc,OAAO,EAAE,OAAO,OAAO,QAAQ,CAAC,IAC9E;AACJ,QAAM,oBAAoB,WAAW,YAAa,UAAU,UAAU,WAAW,IAAI,IAAK;AAC1F,QAAM,aAAa;AAAA,IACjB,YAAY,WAAW,KAAK,IAAI;AAAA,IAChC,YAAY,UAAU,KAAK,IAAI;AAAA,IAC/B,oBAAoB;AAAA,IACpB,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,EACtB;AACA,QAAM,gBAAgB;AAAA,IACpB,WAAW,KAAK,SAAY;AAAA,IAC5B,UAAU,KAAK,SAAY;AAAA,IAC3B,oBAAoB,IAChB,SACA,GAAG,eAAe,IAAI,aAAa;AAAA,EACzC,EAAE,OAAO,CAAC,WAA6B,QAAQ,MAAM,CAAC;AACtD,SAAO;AAAA,IACL,OAAOA,SAAQ,OAAO,OAAO,UAAU,CAAC;AAAA,IACxC,QAAQ,cAAc,WAAW;AAAA,IACjC;AAAA,IACA,OACE,cAAc,WAAW,IAAI,uCAAuC,cAAc,KAAK,IAAI;AAAA,IAC7F,YAAY;AAAA,MACV,WAAW;AAAA,MACX,SAAS;AAAA,MACT,QAAQ;AAAA,IACV;AAAA,EACF;AACF;AAEA,SAAS,uBACP,QACA,WAC4B;AAC5B,QAAM,UAAU;AAAA,IACd,OAAO;AAAA,IACP,WAAW,iBAAiB,CAAC,UAAU,cAAc,SACjD,0BACA;AAAA,IACJ,WAAW,aAAa,CAAC,UAAU,UAAU,WACzC,4BAA4B,UAAU,UAAU,MAAM,KACtD;AAAA,EACN,EAAE,OAAO,CAAC,WAA6B,QAAQ,MAAM,CAAC;AACtD,QAAM,gBACJ,QAAQ,WAAW,iBAAiB,CAAC,UAAU,cAAc,MAAM,KACnE,QAAQ,WAAW,aAAa,CAAC,UAAU,UAAU,QAAQ;AAC/D,SAAO;AAAA,IACL,GAAG;AAAA,IACH,QAAQ,OAAO,UAAU,CAAC;AAAA,IAC1B,OAAO,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAO;AAAA,EAC1D;AACF;AAEA,SAAS,gBAAgB,QAAgE;AACvF,SAAO,wBAAwB,MAAM,MAAM;AAC7C;AAEA,eAAe,yBACb,QACA,OACA,MACA,KAC8C;AAC9C,QAAM,YAAY,MAAM,WAAW,SAAS;AAC5C,QAAM,cAAc,SAAS,SAAS,GAAG,MAAM,KAAK,IAAI,SAAS,IAAI,IAAI,EAAE,YAAY,CAAC,EAAE;AAC1F,QAAM,gBAAgB,uBAAuB,QAAQ,WAAW;AAChE,QAAM,uBAAuB,MAAM,aAAa;AAChD,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,UAAU,MAAM;AAAA,IAChB,QAAQ;AAAA,IACR;AAAA,IACA,WAAW;AAAA,EACb;AACF;AAEA,SAAS,uBAAuB,QAAgB,aAA6B;AAC3E,SAAO,KAAK,QAAQ,cAAc,sBAAsB,MAAM,WAAW,GAAG,WAAW;AACzF;AAEA,SAAS,qBAAqB,QAAwB;AACpD,SAAO,KAAK,QAAQ,UAAU;AAChC;AAEA,eAAe,uBACb,QACA,MACA,cACe;AACf,QAAM,SAAS,qBAAqB,MAAM;AAC1C,MAAI;AACF,UAAM,uBAAuB,QAAQ,YAAY;AACjD;AAAA,EACF,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AACA,QAAM,cAAc,MAAM,QAAQ,KAAK,QAAQ,mBAAmB,CAAC;AACnE,MAAI,YAAY;AAChB,MAAI;AACF,UAAM,uBAAuB,MAAM,WAAW;AAC9C,UAAM,aAAa,MAAM,kBAAkB,WAAW;AACtD,QAAI,eAAe,cAAc;AAC/B,YAAM,IAAI;AAAA,QACR,8DAA8D,YAAY,SAAS,UAAU;AAAA,MAC/F;AAAA,IACF;AACA,UAAM,cAAc,aAAa,MAAM;AACvC,gBAAY;AAAA,EACd,UAAE;AACA,QAAI,CAAC,UAAW,OAAM,GAAG,aAAa,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EACxE;AACF;AAEA,eAAe,uBACb,QACA,MACA,cACe;AACf,MAAI;AACF,UAAM,uBAAuB,QAAQ,YAAY;AAAA,EACnD,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AACjC,UAAM,WAAW,MAAM,kBAAkB,IAAI;AAC7C,QAAI,aAAa,cAAc;AAC7B,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,UAAM,uBAAuB,QAAQ,MAAM,YAAY;AAAA,EACzD;AACF;AAEA,eAAe,uBAAuB,QAAgB,cAAqC;AACzF,QAAM,qBAAqB,QAAQ,cAAc,MAAM,MAAS;AAClE;AAEA,eAAe,qBACb,QACA,cACA,KACY;AACZ,SAAO,kBAAkB,QAAQ,YAAY,OAAO,OAAO,iBAAiB;AAC1E,UAAM,aAAa,MAAM,kBAAkB,YAAY;AACvD,QAAI,eAAe,cAAc;AAC/B,YAAM,IAAI;AAAA,QACR,oDAAoD,YAAY,SAAS,UAAU;AAAA,MACrF;AAAA,IACF;AACA,WAAO,IAAI,YAAY;AAAA,EACzB,CAAC;AACH;AAEA,eAAe,6BACb,QACA,WACA,eACA,KACY;AACZ,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACA,sBAAsB,MAAM,UAAU,WAAW;AAAA,IACjD;AAAA,EACF;AACA,SAAO,kBAAkB,QAAQ,eAAe,MAAM,OAAO,iBAAiB;AAC5E,UAAM,cAAc,MAAM,QAAQ,KAAK,cAAc,UAAU,CAAC;AAChE,QAAI,YAAY;AAChB,QAAI;AACF,YAAM,uBAAuB,eAAe,WAAW;AACvD,YAAM,OAAO,MAAM,kBAAkB,WAAW;AAChD,UAAI;AACF,cAAM,SAAS,MAAM,kBAAkB,cAAc,MAAM,OAAO,OAAO,aAAa;AACpF,cAAK,MAAM,kBAAkB,QAAQ,MAAO,MAAM;AAChD,kBAAM,IAAI,MAAM,kEAAkE;AAAA,UACpF;AACA,iBAAO,IAAI,EAAE,MAAM,UAAU,KAAK,CAAC;AAAA,QACrC,CAAC;AACD,cAAM,GAAG,aAAa,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AACtD,oBAAY;AACZ,eAAO;AAAA,MACT,SAAS,OAAO;AACd,YAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,MACnC;AACA,YAAM,cAAc,aAAa,KAAK,cAAc,IAAI,CAAC;AACzD,kBAAY;AACZ,aAAO,kBAAkB,cAAc,MAAM,OAAO,CAAC,SAAS,IAAI,EAAE,MAAM,KAAK,CAAC,CAAC;AAAA,IACnF,UAAE;AACA,UAAI,CAAC,UAAW,OAAM,GAAG,aAAa,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,IACxE;AAAA,EACF,CAAC;AACH;AAEA,SAAS,0BAA0B,WAAsD;AACvF,SAAO,UAAU;AACjB,SAAO,UAAU;AACjB,SAAO,UAAU;AACnB;AAEA,SAAS,oBACP,OACiD;AACjD,SAAO,CAAC,GAAG,MAAM,UAAU,EACxB,QAAQ,EACR,KAAK,CAAC,cAAc,UAAU,WAAW,qBAAqB,UAAU,WAAW,SAAS;AACjG;AAEA,eAAe,uBAAuB,YAAoB,YAAmC;AAC3F,QAAM,GAAG,YAAY,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AACrD,QAAM,MAAM,KAAK,YAAY,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9D,QAAM,MAAM,KAAK,YAAY,OAAO,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACnE,QAAM,aAAa,KAAK,YAAY,WAAW,GAAG,KAAK,YAAY,WAAW,CAAC;AAC/E,QAAM,aAAa,KAAK,YAAY,KAAK,GAAG,KAAK,YAAY,KAAK,CAAC;AACnE,QAAM;AAAA,IACJ,KAAK,UAAU,UAAU,EAAE,UAAU,cAAc;AAAA,IACnD,KAAK,UAAU,UAAU,EAAE,UAAU,cAAc;AAAA,EACrD;AACA,QAAM,oBAAoB,UAAU;AACtC;AAEA,SAAS,oCACP,WACA,QACQ;AACR,QAAM,SAAS,WAAW,cAAc,cAAc;AACtD,SAAO,aAAa,MAAM,IAAI,YAAY,SAAS,CAAC;AACtD;AAEA,eAAe,yBACb,YACA,YAC8C;AAC9C,QAAM,CAAC,QAAQ,KAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,IACxC,qBAAqB,UAAU;AAAA,IAC/B,qBAAqB,UAAU;AAAA,EACjC,CAAC;AACD,QAAM,eAAe,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,KAAK,CAAC,CAAC;AACvE,QAAM,cAAc,IAAI,IAAI,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,KAAK,CAAC,CAAC;AACrE,QAAM,QAAQ;AAAA,IACZ,GAAG,oBAAI,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,UAAU,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,CAAC;AAAA,EACxF,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjD,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,gCAA4B,IAAI;AAChC,UAAM,cAAc,aAAa,IAAI,IAAI;AACzC,UAAM,aAAa,YAAY,IAAI,IAAI;AACvC,WAAO;AAAA,MACL;AAAA,MACA,YAAY,aAAa,mBAAmB;AAAA,MAC5C,WAAW,YAAY,mBAAmB;AAAA,MAC1C,GAAI,cAAc,EAAE,YAAY,YAAY,KAAK,IAAI,CAAC;AAAA,MACtD,GAAI,aAAa,EAAE,WAAW,WAAW,KAAK,IAAI,CAAC;AAAA,IACrD;AAAA,EACF,CAAC;AACH;AAEA,eAAe,uBACb,YACA,MACkC;AAClC,SAAO,QAAQ;AAAA,IACb,KAAK,IAAI,OAAO,UAAU;AACxB,UAAI,MAAM,cAAc,KAAM,QAAO,EAAE,MAAM,MAAM,MAAM,SAAS,KAAK;AACvE,YAAM,OAAO,MAAM,0BAA0B,YAAY,MAAM,IAAI;AACnE,YAAM,aAAa,WAAW,QAAQ,EAAE,OAAO,KAAK,KAAK,EAAE,OAAO,KAAK;AACvE,UAAI,eAAe,MAAM,aAAa,KAAK,SAAS,MAAM,WAAW;AACnE,cAAM,IAAI,MAAM,oDAAoD,MAAM,IAAI,EAAE;AAAA,MAClF;AACA,aAAO,EAAE,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,MAAM,KAAK,KAAK;AAAA,IAClE,CAAC;AAAA,EACH;AACF;AAEA,SAAS,8BACP,MACA,WACA,QACM;AACN,QAAM,oBAAoB,WAAW,cAAc,OAAO,yBAAyB,IAAI;AACvF,QAAM,iBAAiB,iCAAiC,iBAAiB;AACzE,MAAI,mBAAmB,UAAU,mBAAmB;AAClD,UAAM,IAAI;AAAA,MACR,6DAA6D,UAAU,iBAAiB,SAAS,cAAc;AAAA,IACjH;AAAA,EACF;AACF;AAEA,SAAS,qCACP,aACA,WACA,QACM;AACN,gCAA8B,YAAY,SAAS,WAAW,MAAM;AACtE;AAEA,SAAS,yBACP,MACqC;AACrC,SAAO,KAAK,IAAI,CAAC,WAAW;AAAA,IAC1B,MAAM,MAAM;AAAA,IACZ,YAAY,MAAM;AAAA,IAClB,WAAW,MAAM;AAAA,IACjB,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,YAAY,MAAM,UAAU;AAAA,IACvE,GAAI,MAAM,eAAe,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,WAAW;AAAA,EAC1E,EAAE;AACJ;AAEA,eAAe,+BACb,QACA,cACA,QACe;AACf,MAAI,MAAM,4BAA4B,QAAQ,cAAc,MAAM,EAAG;AACrE,QAAM,aAAa,QAAQ;AAAA,IACzB,MAAM,WAAW,cAAc,uBAAuB;AAAA,IACtD,OAAO,aAAa;AAAA,IACpB,aAAa,aAAa;AAAA,IAC1B,eAAe,aAAa;AAAA,IAC5B,cAAc,aAAa;AAAA,IAC3B,mBAAmB,aAAa;AAAA,EAClC,CAAC;AACH;AAEA,eAAe,4BACb,QACA,cACA,QACkB;AAClB,QAAM,YAAY,WAAW,cAAc,uBAAuB;AAClE,MAAI,UAAU;AACd,aAAW,OAAO,MAAM,sCAAsC,MAAM,GAAG;AACrE,QAAI,IAAI,SAAS,aAAa,IAAI,gBAAgB,aAAa,YAAa;AAC5E,QACE,IAAI,UAAU,aAAa,SAC3B,IAAI,kBAAkB,aAAa,iBACnC,IAAI,iBAAiB,aAAa,gBAClC,IAAI,sBAAsB,aAAa,mBACvC;AACA,YAAM,IAAI,MAAM,4EAA4E;AAAA,IAC9F;AACA,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AAOA,eAAsB,+BACpB,MACA,OACsC;AACtC,QAAM,cAAc,YAAY,MAAM,KAAK;AAC3C,MAAI;AACF,WAAO,MAAM;AAAA,MAA4B;AAAA,MAAM;AAAA,MAAa;AAAA,MAAO,CAAC,WAClE,sCAAsC,MAAM;AAAA,IAC9C;AAAA,EACF,SAAS,OAAO;AACd,QAAI,cAAc,KAAK,EAAG,QAAO,CAAC;AAClC,UAAM;AAAA,EACR;AACF;AAEA,eAAe,sCACb,QACsC;AACtC,QAAM,SAAsC,CAAC;AAC7C,MAAI;AACF,eAAW,QAAQ,MAAM,2BAA2B,QAAQ,QAAQ,GAAG;AACrE,YAAM,OAAO,KAAK,KAAK,MAAM,UAAU,MAAM;AAC7C,UAAI,KAAK,SAAS,GAAG,KAAK,CAAC,KAAK,SAAS,OAAO,GAAG;AACjD,cAAM,IAAI,MAAM,wDAAwD,IAAI,EAAE;AAAA,MAChF;AACA,aAAO,KAAK,+BAA+B,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC,CAAC;AAAA,IACrF;AAAA,EACF,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AAEA,QAAMC,UAAS,oBAAI,IAAuC;AAC1D,aAAW,SAAS,QAAQ;AAC1B,UAAM,EAAE,IAAI,KAAK,GAAG,SAAS,IAAI;AACjC,IAAAA,QAAO,IAAI,YAAY,QAAQ,GAAG,KAAK;AAAA,EACzC;AACA,SAAO,CAAC,GAAGA,QAAO,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AACnF;AAEA,SAAS,+BAA+B,OAA2C;AACjF,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AAC/D,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AACA,QAAM,QAAQ;AACd,MAAI,OAAO,MAAM,OAAO,YAAY,OAAO,MAAM,SAAS,UAAU;AAClE,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACrE;AACA,SAAO;AACT;AAEA,eAAe,aAAa,QAAgB,QAA+B;AACzE,MAAI;AACJ,MAAI;AACF,iBAAa,MAAM,MAAM,MAAM;AAAA,EACjC,SAAS,OAAO;AACd,QAAI,cAAc,KAAK,EAAG;AAC1B,UAAM;AAAA,EACR;AACA,MAAI,CAAC,WAAW,YAAY,KAAK,CAAC,WAAW,OAAO,GAAG;AACrD,UAAM,IAAI,MAAM,+DAA+D,MAAM,EAAE;AAAA,EACzF;AACA,QAAM,MAAM,QAAQ,MAAM,GAAG,EAAE,WAAW,KAAK,CAAC;AAChD,QAAM,GAAG,QAAQ,QAAQ,EAAE,WAAW,WAAW,YAAY,GAAG,aAAa,MAAM,CAAC;AACtF;AAEA,eAAsB,kBAAkB,MAA+B;AACrE,SAAO,kBAAkB,MAAM,MAAM,0BAA0B,IAAI,CAAC;AACtE;AAEA,eAAe,0BAA0B,MAA+B;AACtE,QAAM,UAAU,MAAM,qBAAqB,IAAI;AAC/C,SAAO,OAAO,KAAK,UAAU,QAAQ,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK,OAAO,EAAE,MAAM,MAAM,KAAK,EAAE,CAAC,CAAC;AAC7F;AASA,eAAe,qBAAqB,MAAgD;AAClF,QAAM,UAAmC,CAAC;AAC1C,aAAW,OAAO,CAAC,aAAa,KAAK,GAAG;AACtC,QAAI;AACF,iBAAW,QAAQ,MAAM,2BAA2B,MAAM,GAAG,GAAG;AAC9D,gBAAQ,KAAK,sBAAsB,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,CAAC;AAAA,MACtE;AAAA,IACF,SAAS,OAAO;AACd,UAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,IACnC;AAAA,EACF;AACA,QAAM,iBAAiB,SAAS,MAAM,UAAU,IAAI,EAAE,kBAAkB,EAAE,QAAQ,OAAO,GAAG;AAC5F,MAAI;AACF,UAAM,OAAO,MAAM,0BAA0B,MAAM,cAAc;AACjE,YAAQ,KAAK,sBAAsB,gBAAgB,KAAK,OAAO,KAAK,IAAI,CAAC;AAAA,EAC3E,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AACA,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACnD,SAAO;AACT;AAEA,SAAS,sBAAsB,MAAc,OAAe,MAAqC;AAC/F,SAAO;AAAA,IACL;AAAA,IACA,MAAM,OAAO,MAAM,SAAS,QAAQ,CAAC;AAAA,IACrC,iBAAiB,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA,IAChE;AAAA,EACF;AACF;AAEA,eAAe,gBACb,QACA,SACsB;AACtB,QAAM,OAAO,KAAK,QAAQ,kBAAkB;AAC5C,QAAM,WAAW,MAAM,uBAAuB,QAAQ;AAAA,IACpD,cAAc;AAAA,IACd,SAAS,QAAQ;AAAA,EACnB,CAAC;AACD,SAAO;AAAA,IACL,SAAS,QAAQ;AAAA,IACjB,aAAa,SAAS;AAAA,IACtB,SAAS,SAAS;AAAA,EACpB;AACF;AAEA,eAAe,SACb,QACA,OACA,QACA,SACA,KACuC;AACvC,QAAM,SAAS;AACf,QAAM,gBAAgB;AACtB,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,QAAM,UAAU,QAAQ,OAAO,OAAO;AACtC,SAAO;AACT;AAEA,eAAe,UACb,QACA,OACA,SACe;AACf,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA,mCAAmC,MAAM,KAAK;AAAA,EAChD;AACA,QAAM,UAAU,KAAK;AACvB;AAEA,eAAe,aAAa,QAAgB,OAA+C;AACzF,QAAM,OAAO,MAAM;AACnB,MAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG;AACjD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,QAAM,eAAe,KAAK,UAAU,GAAG,YAAY,KAAK,CAAC,OAAO,EAAE,QAAQ,OAAO,GAAG;AACpF,MAAI;AACF,UAAM,OAAO,MAAM,0BAA0B,QAAQ,YAAY;AACjE,UAAM,WAAW,+BAA+B,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC;AACvF,UAAM,EAAE,IAAI,KAAK,GAAG,SAAS,IAAI;AACjC,QAAI,cAAc,QAAQ,MAAM,cAAc,KAAK,GAAG;AACpD,YAAM,IAAI,MAAM,qEAAqE;AAAA,IACvF;AACA;AAAA,EACF,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AACA,QAAM,2BAA2B,QAAQ,cAAc;AAAA,IACrD,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,IAC3B,GAAG;AAAA,EACL,CAAC;AACH;AAEA,SAAS,8BAA8B,aAA6B;AAClE,SAAO,KAAK,cAAc,sBAAsB,MAAM,WAAW,GAAG,eAAe,EAAE;AAAA,IACnF;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,eAAe,MAAc,MAAkC;AACtE,QAAM,QAAQ,SAAS,QAAQ,IAAI,GAAG,QAAQ,IAAI,CAAC,EAAE,QAAQ,OAAO,GAAG;AACvE,MAAI,UAAU,MAAM,UAAU,QAAQ,MAAM,WAAW,KAAK,KAAK,WAAW,KAAK;AAC/E,WAAO;AACT,SAAO;AACT;AAEA,SAAS,+BAAqC;AAC5C,MAAI,QAAQ,aAAa,SAAS;AAChC,UAAM,IAAI,MAAM,yEAAyE;AAAA,EAC3F;AACF;AAEA,SAASD,SAAQ,QAAmC;AAClD,QAAM,SAAS,OAAO,OAAO,OAAO,QAAQ;AAC5C,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;AAChE;;;ADplEO,SAAS,6BACd,WAC4B;AAC5B,QAAM,SAAS,uCAAuC,MAAM,SAAS;AACrE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU,eAAe,OAAO,QAAQ;AAAA,IACxC,UAAU,eAAe,OAAO,QAAQ;AAAA,IACxC,eAAe,eAAe,OAAO,aAAa;AAAA,IAClD,cAAc,eAAe,OAAO,YAAY;AAAA,IAChD,mBAAmB,eAAe,OAAO,iBAAiB;AAAA,EAC5D;AACF;AAGO,SAAS,+BACd,WACkC;AAClC,SAAO,uCAAuC,MAAM;AAAA,IAClD,GAAG;AAAA,IACH,UAAU,UAAU,UAAU,QAAQ;AAAA,IACtC,UAAU,UAAU,UAAU,QAAQ;AAAA,IACtC,eAAe,UAAU,UAAU,aAAa;AAAA,IAChD,cAAc,UAAU,UAAU,YAAY;AAAA,IAC9C,mBAAmB,UAAU,UAAU,iBAAiB;AAAA,EAC1D,CAAC;AACH;AAEA,SAAS,eAAe,OAAe;AACrC,SAAO,mBAAmB,MAAM,UAAU,KAAK,EAAE;AACnD;AAEA,SAAS,UAAU,OAAuB;AACxC,SAAO,mBAAmB,MAAM,KAAK,EAAE,MAAM,UAAU,MAAM;AAC/D;;;ASqCO,SAAS,cACd,MACA,MACA,UAAgC,CAAC,GACZ;AACrB,QAAM,mBAAmB,QAAQ,oBAAoB;AACrD,QAAM,WAAqB,CAAC;AAE5B,QAAM,EAAE,KAAK,SAAS,UAAU,SAAS,IAAI,eAAe,MAAM,kBAAkB,MAAM;AAC1F,QAAM,EAAE,KAAK,SAAS,UAAU,SAAS,IAAI,eAAe,MAAM,kBAAkB,MAAM;AAC1F,WAAS,KAAK,GAAG,UAAU,GAAG,QAAQ;AAEtC,QAAM,UAA6B,CAAC;AACpC,QAAM,OAAO,oBAAI,IAAY;AAE7B,aAAW,CAAC,IAAI,YAAY,KAAK,SAAS;AACxC,SAAK,IAAI,EAAE;AACX,UAAM,eAAe,QAAQ,IAAI,EAAE;AACnC,QAAI,CAAC,cAAc;AACjB,cAAQ,KAAK;AAAA,QACX,YAAY;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,EAAE,OAAO,aAAa,KAAK;AAAA,QACjC,oBAAoB,MAAM,aAAa,cAAc;AAAA,QACrD,KAAK,aAAa,WAAW;AAAA,QAC7B,YAAY,aAAa,WAAW;AAAA,MACtC,CAAC;AACD;AAAA,IACF;AACA,QAAI,aAAa,aAAa,aAAa,UAAU;AACnD,cAAQ,KAAK;AAAA,QACX,YAAY;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,EAAE,QAAQ,aAAa,MAAM,OAAO,aAAa,KAAK;AAAA,QAC5D,oBAAoB,MAAM,CAAC,GAAG,aAAa,gBAAgB,GAAG,aAAa,cAAc,CAAC;AAAA,QAC1F,KAAK,aAAa,WAAW;AAAA,QAC7B,YAAY,aAAa,WAAW;AAAA,MACtC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,aAAW,CAAC,IAAI,YAAY,KAAK,SAAS;AACxC,QAAI,KAAK,IAAI,EAAE,EAAG;AAClB,YAAQ,KAAK;AAAA,MACX,YAAY;AAAA,MACZ,MAAM;AAAA,MACN,MAAM,EAAE,QAAQ,aAAa,KAAK;AAAA,MAClC,oBAAoB,MAAM,aAAa,cAAc;AAAA,MACrD,KAAK,aAAa,WAAW;AAAA,MAC7B,YAAY,aAAa,WAAW;AAAA,IACtC,CAAC;AAAA,EACH;AAEA,QAAM,WAAW,QAAQ,mBACrB,QAAQ,OAAO,CAAC,MAAM,EAAE,mBAAmB,KAAK,CAAC,MAAM,QAAQ,kBAAkB,SAAS,CAAC,CAAC,CAAC,IAC7F;AAEJ,SAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,MACP,OAAO,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE;AAAA,MAClD,SAAS,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE;AAAA,MACtD,UAAU,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE;AAAA,IAC1D;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,eACP,WACA,kBACA,MAC6D;AAC7D,QAAM,MAAM,oBAAI,IAA+B;AAC/C,QAAM,WAAqB,CAAC;AAC5B,MAAI,UAAU;AACd,aAAW,YAAY,WAAW;AAChC,QAAI,oBAAoB,CAAC,SAAS,WAAW,YAAY;AACvD,iBAAW;AACX;AAAA,IACF;AACA,QAAI,IAAI,IAAI,SAAS,EAAE,GAAG;AACxB,eAAS,KAAK,GAAG,IAAI,2BAA2B,SAAS,EAAE,sBAAiB;AAAA,IAC9E;AACA,QAAI,IAAI,SAAS,IAAI,QAAQ;AAAA,EAC/B;AACA,MAAI,UAAU,GAAG;AACf,aAAS,KAAK,GAAG,IAAI,aAAa,OAAO,uCAAuC;AAAA,EAClF;AACA,SAAO,EAAE,KAAK,SAAS;AACzB;AAEA,SAAS,MAAS,OAAiB;AACjC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;;;AChKA,IAAM,kBAAmC;AAAA,EACvC,aAAa;AAAA,EACb,UAAU;AAAA,EACV,UAAU;AAAA,EACV,cAAc;AAChB;AAEO,SAAS,cACd,SACA,SACkB;AAClB,QAAM,OAAO,iBAAiB,EAAE,GAAG,iBAAiB,GAAI,WAAW,CAAC,EAAG,CAAC;AACxE,QAAM,EAAE,MAAM,WAAW,IAAI,iBAAiB,OAAO;AACrD,MAAI,KAAK,KAAK,MAAM,GAAI,QAAO,CAAC;AAEhC,QAAM,WAAW,cAAc,MAAM,UAAU;AAC/C,QAAM,SAA2B,CAAC;AAClC,aAAW,WAAW,UAAU;AAC9B,eAAW,QAAQ,UAAU,QAAQ,MAAM,IAAI,GAAG;AAChD,YAAM,QAAQ,QAAQ,QAAQ,KAAK;AACnC,aAAO,KAAK;AAAA,QACV,OAAO,OAAO;AAAA,QACd,MAAM,KAAK;AAAA,QACX,aAAa,QAAQ;AAAA,QACrB,WAAW;AAAA,QACX,SAAS,QAAQ,KAAK,KAAK;AAAA,QAC3B,WAAW,KAAK,KAAK,SAAS,KAAK;AAAA,MACrC,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,iBAAiB,SAAuD;AACtF,QAAM,aAAa,QAAQ,QAAQ,SAAS,IAAI;AAChD,MAAI,CAAC,WAAW,WAAW,OAAO,EAAG,QAAO,EAAE,MAAM,YAAY,YAAY,EAAE;AAC9E,QAAM,QAAQ,4BAA4B,KAAK,UAAU;AACzD,MAAI,CAAC,MAAO,QAAO,EAAE,MAAM,YAAY,YAAY,EAAE;AACrD,SAAO,EAAE,MAAM,WAAW,MAAM,MAAM,CAAC,EAAE,MAAM,GAAG,YAAY,MAAM,CAAC,EAAE,OAAO;AAChF;AAEA,SAAS,iBAAiB,MAAwC;AAChE,MAAI,KAAK,WAAW,KAAK,YAAa,MAAK,WAAW,KAAK;AAC3D,MAAI,KAAK,gBAAgB,KAAK,YAAa,MAAK,eAAe,KAAK,MAAM,KAAK,cAAc,CAAC;AAC9F,SAAO;AACT;AAQA,SAAS,cAAc,MAAc,YAA+B;AAClE,QAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,QAAM,WAAsB,CAAC;AAC7B,QAAM,WAAmC,CAAC;AAC1C,MAAI,UAAmE;AAAA,IACrE,OAAO,CAAC;AAAA,IACR,OAAO;AAAA,IACP,aAAa;AAAA,EACf;AACA,MAAI,SAAS;AACb,MAAI,QAAuB;AAE3B,QAAM,QAAQ,MAAM;AAClB,UAAM,OAAO,QAAQ,MAAM,KAAK,IAAI;AACpC,QAAI,KAAK,KAAK,MAAM;AAClB,eAAS,KAAK,EAAE,MAAM,OAAO,QAAQ,OAAO,aAAa,QAAQ,YAAY,CAAC;AAAA,EAClF;AAEA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,UAAU,KAAK,UAAU,IAAI,MAAM,SAAS,IAAI,IAAI;AAC1D,UAAM,aAAa,iBAAiB,KAAK,IAAI;AAC7C,QAAI,YAAY;AACd,YAAM,SAAS,WAAW,CAAC;AAC3B,cAAQ,UAAU,OAAO,SAAS,KAAK,WAAW,KAAK,IAAI,OAAO;AAClE,cAAQ,MAAM,KAAK,IAAI;AACvB,gBAAU;AACV;AAAA,IACF;AACA,UAAM,UAAU,UAAU,OAAO,wBAAwB,KAAK,IAAI,IAAI;AACtE,QAAI,SAAS;AACX,YAAM;AACN,YAAM,QAAQ,QAAQ,CAAC,EAAG;AAC1B,eAAS,KAAK,IAAI,QAAQ,CAAC,EAAG,KAAK;AACnC,eAAS,OAAO,QAAQ,GAAG,QAAQ,GAAG,OAAQ,QAAO,SAAS,IAAI;AAClE,gBAAU;AAAA,QACR,OAAO,CAAC,IAAI;AAAA,QACZ,OAAO;AAAA,QACP,aAAa,OAAO,QAAQ,QAAQ,EACjC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,OAAO,CAAC,IAAI,OAAO,CAAC,CAAC,EACxC,IAAI,CAAC,CAAC,WAAW,KAAK,MAAM,GAAG,IAAI,OAAO,OAAO,SAAS,CAAC,CAAC,IAAI,KAAK,EAAE,EACvE,KAAK,KAAK;AAAA,MACf;AACA,gBAAU;AACV;AAAA,IACF;AACA,YAAQ,MAAM,KAAK,IAAI;AACvB,cAAU;AAAA,EACZ;AACA,QAAM;AACN,SAAO;AACT;AAEA,SAAS,UAAU,MAAc,MAA+D;AAC9F,MAAI,KAAK,UAAU,KAAK,YAAa,QAAO,CAAC,EAAE,MAAM,OAAO,EAAE,CAAC;AAC/D,QAAM,QAAQ,WAAW,IAAI;AAC7B,QAAM,SAAiD,CAAC;AACxD,MAAI,SAAS;AACb,MAAI,cAAc;AAClB,aAAW,QAAQ,OAAO;AACxB,QAAI,WAAW,GAAI,eAAc,KAAK;AACtC,QAAI,OAAO,SAAS,KAAK,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,aAAa;AAC5E,aAAO,KAAK,EAAE,MAAM,OAAO,QAAQ,GAAG,OAAO,YAAY,CAAC;AAC1D,YAAM,UAAU,OAAO,MAAM,KAAK,IAAI,GAAG,OAAO,SAAS,KAAK,YAAY,CAAC;AAC3E,eAAS,UAAU,KAAK;AACxB,oBAAc,KAAK,IAAI,aAAa,KAAK,QAAQ,QAAQ,MAAM;AAAA,IACjE,OAAO;AACL,gBAAU,KAAK;AAAA,IACjB;AAAA,EACF;AACA,MAAI,OAAO,KAAK,MAAM,GAAI,QAAO,KAAK,EAAE,MAAM,OAAO,QAAQ,GAAG,OAAO,YAAY,CAAC;AACpF,SAAO,gBAAgB,QAAQ,IAAI;AACrC;AAEA,SAAS,WAAW,MAAsD;AACxE,QAAM,QAAgD,CAAC;AACvD,QAAM,aAAa,KAAK,MAAM,WAAW;AACzC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;AAC7C,UAAM,aAAa,WAAW,CAAC,KAAK,OAAO,WAAW,IAAI,CAAC,KAAK;AAChE,QAAI,cAAc,GAAI;AACtB,UAAM,KAAK,EAAE,MAAM,WAAW,OAAO,OAAO,CAAC;AAC7C,cAAU,UAAU;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,gBACP,QACA,MACwC;AACxC,QAAM,MAA8C,CAAC;AACrD,aAAW,SAAS,QAAQ;AAC1B,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QACE,QACA,MAAM,KAAK,SAAS,KAAK,YACzB,KAAK,KAAK,SAAS,MAAM,KAAK,UAAU,KAAK,UAC7C;AACA,WAAK,OAAO,GAAG,KAAK,IAAI;AAAA;AAAA,EAAO,MAAM,IAAI;AAAA,IAC3C,OAAO;AACL,UAAI,KAAK,EAAE,GAAG,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;;;ACvIO,SAAS,iCAAiD;AAC/D,SAAO;AAAA,IACL,aAAa,SAAgD;AAC3D,aAAO,EAAE,QAAQ,KAAK;AAAA,IACxB;AAAA,EACF;AACF;;;AC7CA,SAAS,yBAAyB;AAwElC,eAAsB,iBACpB,SAC8B;AAC9B,QAAM,YAAY,gBAAgB,QAAQ,aAAa,GAAG,WAAW;AACrE,QAAM,WAAW,gBAAgB,QAAQ,YAAY,IAAI,UAAU;AACnE,QAAM,cAAc,gBAAgB,QAAQ,eAAe,GAAG,aAAa;AAC3E,QAAM,QAAQ,oBAAI,IAA2B;AAC7C,QAAM,UAA2B,CAAC;AAClC,QAAM,mBAAmB,oBAAI,IAAY;AACzC,eAAa,QAAQ,cAAc,OAAO,SAAS,gBAAgB;AAEnE,QAAM,SAA+B,CAAC;AACtC,QAAM,UAA6B,CAAC;AACpC,MAAI,kBAAkB;AACtB,MAAI,UAAU;AAEd,SAAO,QAAQ,SAAS,KAAK,OAAO,SAAS,aAAa,kBAAkB,UAAU;AACpF,QAAI,QAAQ,QAAQ,SAAS;AAC3B,gBAAU;AACV;AAAA,IACF;AACA,UAAM,WAAW,WAAW;AAC5B,UAAM,QAAQ,QAAQ,OAAO,GAAG,QAAQ;AACxC,QAAI;AACJ,QAAI;AACF,mBAAa;AAAA,QACX;AAAA,QACA,MAAM,QAAQ,WAAW,SAAS,OAAO;AAAA,UACvC;AAAA,UACA,QAAQ,QAAQ;AAAA,QAClB,CAAC;AAAA,MACH;AAAA,IACF,SAAS,OAAO;AACd,UAAI,CAAC,QAAQ,QAAQ,QAAS,OAAM;AACpC,cAAQ,QAAQ,GAAG,KAAK;AACxB,gBAAU;AACV;AAAA,IACF;AACA,uBAAmB,MAAM;AACzB,YAAQ,KAAK,GAAG,UAAU;AAE1B,UAAM,kBAAmC,CAAC;AAC1C,eAAW,UAAU,YAAY;AAC/B,mBAAa,OAAO,iBAAiB,CAAC,GAAG,OAAO,iBAAiB,gBAAgB;AAAA,IACnF;AACA,YAAQ,KAAK,GAAG,eAAe;AAC/B,UAAME,SAA4B;AAAA,MAChC,OAAO,OAAO,SAAS;AAAA,MACvB;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACF;AACA,WAAO,KAAKA,MAAK;AACjB,UAAM,QAAQ,UAAUA,MAAK;AAC7B,QAAI,QAAQ,QAAQ,SAAS;AAC3B,gBAAU;AACV;AAAA,IACF;AAAA,EACF;AAEA,QAAM,aAAsC,UACxC,YACA,QAAQ,WAAW,IACjB,aACA,mBAAmB,WACjB,cACA;AACR,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc;AAAA,IACd,kBAAkB,CAAC,GAAG,gBAAgB;AAAA,EACxC;AACF;AAEO,SAAS,+BACd,QAC8B;AAC9B,SAAO;AAAA,IACL,MAAM,SAAS,OAAO,UAAU,CAAC,GAAG;AAClC,YAAM,cAAc,KAAK,IAAI,GAAG,QAAQ,eAAe,CAAC;AACxD,YAAM,UAA6B,CAAC;AACpC,UAAI,SAAS;AACb,qBAAe,UAAyB;AACtC,eAAO,SAAS,MAAM,QAAQ;AAC5B,cAAI,QAAQ,QAAQ,QAAS,OAAM,IAAI,MAAM,4BAA4B;AACzE,gBAAM,OAAO,MAAM,QAAQ;AAC3B,kBAAQ,KAAK,MAAM,OAAO,IAAI,MAAM,QAAQ,MAAM,CAAC;AAAA,QACrD;AAAA,MACF;AACA,YAAM,QAAQ,IAAI,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,aAAa,MAAM,MAAM,EAAE,GAAG,OAAO,CAAC;AACtF,aAAO,sBAAsB,OAAO,OAAO;AAAA,IAC7C;AAAA,EACF;AACF;AAEA,SAAS,aACP,OACA,OACA,aACA,kBACM;AACN,aAAW,QAAQ,OAAO;AACxB,eAAW,IAAI;AACf,UAAM,QAAQ,MAAM,IAAI,KAAK,EAAE;AAC/B,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,KAAK,IAAI,IAAI;AACvB,kBAAY,KAAK,IAAI;AACrB;AAAA,IACF;AACA,QAAI,CAAC,kBAAkB,OAAO,IAAI,GAAG;AACnC,YAAM,IAAI,MAAM,sBAAsB,KAAK,EAAE,+BAA+B;AAAA,IAC9E;AACA,qBAAiB,IAAI,KAAK,EAAE;AAAA,EAC9B;AACF;AAEA,SAAS,WAAW,MAA2B;AAC7C,MAAI,CAAC,KAAK,GAAG,KAAK,EAAG,OAAM,IAAI,MAAM,qCAAqC;AAC1E,MAAI,CAAC,KAAK,KAAK,KAAK,EAAG,OAAM,IAAI,MAAM,mBAAmB,KAAK,EAAE,0BAA0B;AAC7F;AAEA,SAAS,sBACP,OACA,SACmB;AACnB,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,UAAU,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;AAClE,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,MAAM,IAAI,OAAO,MAAM,GAAG;AAC7B,YAAM,IAAI,MAAM,+CAA+C,OAAO,MAAM,GAAG;AAAA,IACjF;AACA,QAAI,SAAS,IAAI,OAAO,MAAM,GAAG;AAC/B,YAAM,IAAI,MAAM,uCAAuC,OAAO,MAAM,kBAAkB;AAAA,IACxF;AACA,aAAS,IAAI,OAAO,MAAM;AAAA,EAC5B;AACA,QAAM,UAAU,MAAM,OAAO,CAAC,SAAS,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,SAAS,KAAK,EAAE;AACpF,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,MAAM,uCAAuC,QAAQ,KAAK,IAAI,CAAC,EAAE;AAAA,EAC7E;AACA,SAAO,CAAC,GAAG,OAAO,EAAE;AAAA,IAClB,CAAC,GAAG,MAAO,MAAM,IAAI,EAAE,MAAM,IAAgB,MAAM,IAAI,EAAE,MAAM;AAAA,EACjE;AACF;AAEA,SAAS,gBAAgB,OAAe,MAAsB;AAC5D,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AACzC,UAAM,IAAI,MAAM,kBAAkB,IAAI,6BAA6B;AAAA,EACrE;AACA,SAAO;AACT;;;ACjOA,SAAS,gBAAgB;AACzB,SAAS,QAAAC,aAAY;AACrB,SAAS,KAAAC,UAAS;AAoFlB,IAAM,wBAAwBC,GAC3B,OAAO;AAAA,EACN,aAAaA,GAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC7B,UAAUA,GAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC1B,iBAAiBA,GAAE,IAAI,SAAS;AAAA,EAChC,aAAaA,GAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAC1C,CAAC,EACA,OAAO;AACV,IAAM,sBAAsBA,GACzB,OAAO,EAAE,SAASA,GAAE,OAAOA,GAAE,OAAO,GAAG,qBAAqB,EAAE,CAAC,EAC/D,OAAO;AAUH,SAAS,+BACd,SACyB;AACzB,QAAM,OAAOC,MAAK,QAAQ,MAAM,oBAAoB,gBAAgB;AAEpE,QAAM,OAAO,YAAsD;AACjE,WAAO,kBAAkB,QAAQ,MAAM,YAAY;AACjD,UAAI;AACF,eAAO,oBAAoB,MAAM,KAAK,MAAM,MAAM,SAAS,MAAM,MAAM,CAAC,CAAC,EAAE;AAAA,MAC7E,SAAS,OAAO;AACd,YAAI,cAAc,KAAK,EAAG,QAAO,CAAC;AAClC,cAAM;AAAA,MACR;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,QAAQ,OAAO,YAA4D;AAC/E,UAAM;AAAA,MACJ,QAAQ;AAAA,MACR;AAAA,MACA,oBAAoB,MAAM,EAAE,QAAQ,CAAC;AAAA,IACvC;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM,KAAK,KAAK;AACd,YAAM,UAAU,MAAM,KAAK;AAC3B,YAAM,SAAS,QAAQ,SAAS,GAAG,CAAC;AACpC,aAAO,SAAS,IAAI,KAAK,OAAO,eAAe,IAAI;AAAA,IACrD;AAAA,IACA,MAAM,KAAK,OAAO;AAChB,YAAM,sBAAsB,QAAQ,MAAM,YAAY;AACpD,cAAM,UAAU,MAAM,KAAK;AAC3B,gBAAQ,SAAS,KAAK,CAAC,IAAI;AAAA,UACzB,aAAa,MAAM;AAAA,UACnB,UAAU,MAAM;AAAA,UAChB,iBAAiB,MAAM,KAAK,YAAY;AAAA,UACxC,GAAI,MAAM,gBAAgB,SAAY,CAAC,IAAI,EAAE,aAAa,MAAM,YAAY;AAAA,QAC9E;AACA,cAAM,MAAM,OAAO;AAAA,MACrB,CAAC;AAAA,IACH;AAAA,IACA,MAAM,MAAM,OAAO;AACjB,YAAM,OAAO,MAAM,KAAK,KAAK,KAAK;AAClC,UAAI,CAAC,KAAM,QAAO;AAClB,YAAM,MAAM,MAAM,OAAO,oBAAI,KAAK;AAClC,aAAO,IAAI,QAAQ,IAAI,KAAK,QAAQ,IAAI,MAAM;AAAA,IAChD;AAAA,IACA,MAAM,KAAK,aAAa;AACtB,YAAM,UAAU,MAAM,KAAK;AAC3B,aAAO,OAAO,OAAO,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,gBAAgB,WAAW;AAAA,IAC3E;AAAA,EACF;AACF;AA0BO,SAAS,2BAA2B,SAA6C;AACtF,SAAO;AAAA,IACL,MAAM,KAAK,KAAK;AACd,YAAM,SAAS,MAAM,QAAQ,IAAI,IAAI,aAAa,IAAI,QAAQ;AAC9D,aAAO,SAAS,IAAI,KAAK,OAAO,eAAe,IAAI;AAAA,IACrD;AAAA,IACA,MAAM,KAAK,OAAO;AAChB,YAAM,QAAQ,OAAO;AAAA,QACnB,aAAa,MAAM;AAAA,QACnB,UAAU,MAAM;AAAA,QAChB,iBAAiB,MAAM,KAAK,YAAY;AAAA,QACxC,aAAa,MAAM;AAAA,MACrB,CAAC;AAAA,IACH;AAAA,IACA,MAAM,MAAM,OAAO;AACjB,YAAM,OAAO,MAAM,KAAK,KAAK,KAAK;AAClC,UAAI,CAAC,KAAM,QAAO;AAClB,YAAM,MAAM,MAAM,OAAO,oBAAI,KAAK;AAClC,aAAO,IAAI,QAAQ,IAAI,KAAK,QAAQ,IAAI,MAAM;AAAA,IAChD;AAAA,IACA,MAAM,KAAK,aAAa;AACtB,aAAO,QAAQ,gBAAgB,WAAW;AAAA,IAC5C;AAAA,EACF;AACF;AAEA,SAAS,SAAS,KAA2B;AAC3C,SAAO,GAAG,IAAI,WAAW,KAAK,IAAI,QAAQ;AAC5C;;;ACxEO,IAAM,sBAAyC;AAAA,EACpD;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO,CAAC,oBAAoB,oBAAoB,KAAK;AAAA,UACvD;AAAA,UACA;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WAAW;AAAA,QACX,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO,CAAC,SAAS,eAAe,gBAAgB,oBAAoB,aAAa;AAAA,UACnF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAOE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA;AAAA;AAAA;AAAA;AAAA,YAKE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAOE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,qBACd,MACA,YACwF;AACxF,QAAM,WAAW,WAAW,YAAY;AACxC,QAAM,QAAQ,KAAK,SAAS;AAAA,IAAO,CAAC,UAClC,MAAM,MAAM,KAAK,CAAC,aAAa,SAAS,SAAS,SAAS,YAAY,CAAC,CAAC;AAAA,EAC1E;AACA,QAAM,YAAY,KAAK,aAAa,KAAK,SAAS;AAClD,SAAO;AAAA,IACL,UAAU,MAAM,UAAU;AAAA,IAC1B,aAAa,MAAM;AAAA,IACnB,aAAa,KAAK,SAAS;AAAA,IAC3B,aAAa,MAAM,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA,EAC/C;AACF;AAGO,SAAS,wBACd,SACA,YACyF;AACzF,QAAM,UAAU,QAAQ,MAAM,IAAI,CAAC,SAAS,qBAAqB,MAAM,UAAU,CAAC;AAClF,SAAO;AAAA,IACL,UAAU,QAAQ,OAAO,CAAC,WAAW,OAAO,QAAQ,EAAE;AAAA,IACtD,OAAO,QAAQ,MAAM;AAAA,IACrB;AAAA,EACF;AACF;AAGO,SAAS,mBAAmB,MAAyB,qBAA6B;AACvF,SAAO,IAAI,OAAO,CAAC,KAAK,YAAY,MAAM,QAAQ,MAAM,QAAQ,CAAC;AACnE;AAGO,SAAS,iBACd,MAAyB,qBACS;AAClC,QAAM,OAAO,CAAC;AACd,aAAW,WAAW,KAAK;AACzB,eAAW,QAAQ,QAAQ,OAAO;AAChC,WAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK;AAAA,IAC7C;AAAA,EACF;AACA,SAAO;AACT;;;ACl3BA,SAAS,QAAAC,aAAY;;;AC4Cd,SAAS,cAAc,OAA+B;AAC3D,QAAM,WAAW,MAAM,MAAM,IAAI,CAAC,SAAS,GAAG,KAAK,KAAK;AAAA,EAAK,KAAK,IAAI,EAAE,EAAE,KAAK,MAAM;AACrF,QAAM,aAAa,MAAM,QACtB,IAAI,CAAC,WAAW,GAAG,OAAO,SAAS,EAAE;AAAA,EAAK,OAAO,QAAQ,EAAE,EAAE,EAC7D,KAAK,MAAM;AACd,SAAO,GAAG,QAAQ;AAAA;AAAA,EAAO,UAAU;AACrC;AAQO,SAAS,4BACd,SACA,QACqB;AACrB,QAAM,QAAQ,wBAAwB,SAAS,MAAM;AACrD,QAAM,UAAwB,QAAQ,MAAM,IAAI,CAAC,SAAS;AACxD,UAAM,IAAI,qBAAqB,MAAM,MAAM;AAC3C,WAAO;AAAA,MACL,IAAI,KAAK;AAAA,MACT,MAAM,KAAK;AAAA,MACX,UAAU,EAAE;AAAA,MACZ,aAAa,EAAE;AAAA,MACf,aAAa,EAAE;AAAA,MACf,aAAa,EAAE;AAAA,IACjB;AAAA,EACF,CAAC;AACD,SAAO;AAAA,IACL,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,UAAU,MAAM;AAAA,IAChB,OAAO,MAAM;AAAA,IACb,UAAU,MAAM,UAAU,IAAI,IAAI,MAAM,WAAW,MAAM;AAAA,IACzD;AAAA,EACF;AACF;AAYA,eAAsB,sBACpB,IACA,WAC8B;AAC9B,QAAM,QAAQ,OAAO,OAAO,WAAW,MAAM,oBAAoB,EAAE,IAAI;AACvE,SAAO,4BAA4B,WAAW,cAAc,KAAK,CAAC;AACpE;;;AC0FA,eAAsB,wBACpB,SACqC;AACrC,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ,aAAa,CAAC;AACpD,QAAM,kBAAkB,QAAQ,IAAI;AACpC,QAAM,QAAiC,CAAC;AACxC,MAAI,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAClD,MAAI,YAAY,aAAa,SAAS,KAAK;AAC3C,MAAI,QAAQ,QAAQ,WAAW,MAAM;AACrC,MAAI;AAEJ,WAASC,SAAQ,GAAGA,UAAS,aAAa,CAAC,OAAOA,UAAS;AACzD,QAAI,QAAQ,QAAQ,QAAS,OAAM,IAAI,MAAM,iCAAiC;AAE9E,UAAM,OAAO,kBAAkB,SAAS;AAGxC,UAAM,qBAAqB,MAAM,QAAQ,OAAO;AAAA,MAC9C,MAAM,QAAQ;AAAA,MACd,MAAM,QAAQ;AAAA,MACd,OAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW,iBAAiB,WAAW,OAAO;AAAA,MAC9C,QAAQ,QAAQ;AAAA,IAClB,CAAC;AAGD,UAAM,WAAqC,CAAC;AAC5C,UAAM,wBAA0C,CAAC;AAKjD,UAAM,eAAe,IAAI;AAAA,MACvB,MAAM,QAAQ;AAAA,QAAQ,CAAC,WACrB,OAAO,OAAO,UAAU,gBAAgB,WAAW,CAAC,OAAO,SAAS,WAAW,IAAI,CAAC;AAAA,MACtF;AAAA,IACF;AACA,eAAW,UAAU,mBAAmB,WAAW,CAAC,GAAG;AACrD,UAAI,YAAY,QAAQ,cAAc,QAAQ,GAAG;AAC/C,8BAAsB,KAAK,EAAE,QAAQ,QAAQ,2CAA2C,CAAC;AACzF;AAAA,MACF;AACA,YAAM,UAAU,MAAM,QAAQ,OAAO,aAAa,QAAQ;AAAA,QACxD,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,OAAAA;AAAA,QACA;AAAA,QACA;AAAA,QACA,mBAAmB;AAAA,QACnB,QAAQ,QAAQ;AAAA,MAClB,CAAC;AACD,UAAI,QAAQ,OAAQ,UAAS,KAAK,MAAM;AAAA,UACnC,uBAAsB,KAAK,EAAE,QAAQ,QAAQ,QAAQ,OAAO,CAAC;AAAA,IACpE;AAKA,UAAM,wBAAwB,MAAM,gBAAgB,SAAS,QAAQ;AACrE,UAAM,eAAyB,CAAC;AAChC,iBAAa;AAAA,MACX,GAAI,MAAM,WAAW,QAAQ,MAAM,oBAAoB,qBAAqB;AAAA,IAC9E;AAGA,YAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAC9C,gBAAY,aAAa,SAAS,KAAK;AAGvC,QAAI,gBAAgC,CAAC;AACrC,QAAI;AACJ,QAAI,QAAQ,oBAAoB,QAAQ,OAAO,UAAU;AACvD,YAAMC,iBAAgB,kBAAkB,SAAS;AACjD,YAAM,qBAAqB,MAAM,QAAQ,OAAO,SAAS;AAAA,QACvD,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,OAAAD;AAAA,QACA;AAAA,QACA,eAAAC;AAAA,QACA,WAAW,iBAAiB,WAAW,OAAO;AAAA,QAC9C,QAAQ,QAAQ;AAAA,MAClB,CAAC;AACD,oBAAc,mBAAmB;AACjC,sBAAgB,MAAM,gBAAgB,SAAS,mBAAmB,WAAW,CAAC,CAAC;AAC/E,mBAAa,KAAK,GAAI,MAAM,WAAW,QAAQ,MAAM,oBAAoB,aAAa,CAAE;AACxF,cAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAC9C,kBAAY,aAAa,SAAS,KAAK;AAAA,IACzC;AAGA,YAAQ,QAAQ,WAAW,MAAM;AACjC,UAAM,gBAAgB,kBAAkB,SAAS;AACjD,YAAQ,QAAQ,SAAY,SAAS,QAAQ,QAAQ,aAAa;AAElE,UAAM,OAA8B;AAAA,MAClC,OAAAD;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,qBAAqB;AAAA,QAC1B,MAAM;AAAA,QACN,OAAO,QAAQ;AAAA,QACf,QAAQ,QAAQ;AAAA,QAChB,UAAU;AAAA,UACR,MAAM,QAAQ;AAAA,UACd,OAAAA;AAAA,UACA;AAAA,UACA,2BAA2B,sBAAsB;AAAA,UACjD,2BAA2B,sBAAsB;AAAA,UACjD,mBAAmB,cAAc;AAAA,UACjC,kBAAkB,aAAa;AAAA,UAC/B,mBAAmB,cAAc;AAAA,QACnC;AAAA,MACF,CAAC;AAAA,MACD,OAAO,EAAE,QAAQ,mBAAmB,OAAO,QAAQ,YAAY;AAAA,IACjE;AACA,UAAM,KAAK,IAAI;AACf,UAAM,QAAQ,UAAU,IAAI;AAAA,EAC9B;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAAA,IACd,MAAM,QAAQ;AAAA,IACd,QAAQ,MAAM;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,QAAQ,QAAuD;AAGtE,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,OAAO,4BAA4B,WAAW;AACvD;AAEA,SAAS,kBAAkB,WAAuE;AAChG,MAAI,CAAC,UAAW,QAAO,CAAC;AACxB,QAAM,WAAW,UAAU,OAAO,4BAA4B;AAAA,IAAI,CAAC,gBACjE,OAAO,aAAa,WAAW,IAAI;AAAA,EACrC;AACA,QAAM,cAAc,UAAU,OAAO,gBAAgB;AAAA,IAAI,CAAC,gBACxD,OAAO,aAAa,WAAW,KAAK;AAAA,EACtC;AACA,SAAO,CAAC,GAAG,UAAU,GAAG,WAAW;AACrC;AAEA,SAAS,OACP,aACA,WACA,UACc;AACd,QAAM,OAAO,UAAU,aAAa,KAAK,CAAC,UAAU,MAAM,OAAO,YAAY,EAAE;AAC/E,QAAM,QACJ,OAAO,MAAM,UAAU,UAAU,WAAW,KAAK,SAAS,QAAQ,YAAY;AAChF,SAAO,EAAE,IAAI,YAAY,IAAI,aAAa,YAAY,aAAa,OAAO,SAAS;AACrF;AAEA,SAAS,SAAS,QAAwB,MAA0C;AAClF,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI,OAAO,SAAU,QAAO,OAAO,SAAS,IAAI;AAChD,SAAO;AAAA,IACL;AAAA,IACA,GAAG,KAAK;AAAA,MACN,CAAC,QAAQ,MAAM,IAAI,WAAW,aAAa,MAAM,KAAK,IAAI,WAAW,KAAK,IAAI,EAAE;AAAA,IAClF;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,YACP,QACA,cACA,UACS;AACT,SAAO,aAAa,IAAI,OAAO,GAAG,KAAK,SAAS,KAAK,CAAC,cAAc,UAAU,QAAQ,OAAO,GAAG;AAClG;AAEA,eAAe,gBACb,SACA,SACyB;AACzB,QAAM,UAA0B,CAAC;AACjC,aAAW,UAAU,SAAS;AAC5B,YAAQ,KAAK,MAAM,cAAc,QAAQ,MAAM,QAAQ,QAAQ,aAAa,CAAC;AAAA,EAC/E;AACA,SAAO;AACT;AAQA,eAAe,WACb,MACA,cACA,iBACmB;AACnB,MAAI,gBAAgB,WAAW,EAAG,QAAO,CAAC;AAC1C,QAAM,QAAkB,CAAC;AACzB,MAAI,aAAa,aAAc,OAAM,KAAK,aAAa,YAAY;AACnE,QAAM,QAAQ,aAAa,aAAa,eAAe;AACvD,MAAI,MAAO,OAAM,KAAK,KAAK;AAC3B,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,QAAM,UAAU,MAAM,0BAA0B,MAAM,MAAM,KAAK,IAAI,CAAC;AACtE,SAAO,QAAQ;AACjB;AAEA,SAAS,iBACP,WACA,SACgC;AAChC,MAAI,UAAW,QAAO;AAItB,SAAO,yBAAyB;AAAA,IAC9B,GAAI,QAAQ,aAAa,CAAC;AAAA,IAC1B,QAAQ,QAAQ,mBAAmB,QAAQ;AAAA,IAC3C,OAAO,WAAW,QAAQ,IAAI;AAAA,IAC9B,OAAO,CAAC;AAAA,EACV,CAAC;AACH;AAEA,SAAS,WAAW,MAA8B;AAChD,SAAO;AAAA,IACL;AAAA,IACA,cAAa,oBAAI,KAAK,CAAC,GAAE,YAAY;AAAA,IACrC,SAAS,CAAC;AAAA,IACV,OAAO,CAAC;AAAA,IACR,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAChC;AACF;AAOO,SAAS,kBACd,QACA,OACA,MACyB;AACzB,QAAM,WAAW,GAAG,OAAO,SAAS,EAAE;AAAA,EAAK,OAAO,IAAI,GAAG,YAAY;AACrE,QAAM,OAAgC,CAAC;AACvC,aAAW,OAAO,MAAM;AACtB,eAAW,SAAS,IAAI,MAAM,YAAY,EAAE,MAAM,KAAK,EAAE,OAAO,OAAO,GAAG;AACxE,UAAI,SAAS,SAAS,KAAK,GAAG;AAC5B,aAAK,KAAK,GAAG,gBAAgB,OAAO,IAAI,OAAO,CAAC,CAAC;AACjD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAQO,IAAM,0BAA0B;;;AFnahC,SAAS,qBAAqB,OAAkD;AACrF,QAAM,IAAI,MAAM;AAChB,QAAM,IAAI,MAAM;AAChB,QAAM,SAAS,GAAG,CAAC,IAAI,CAAC;AACxB,SAAO;AAAA,IACL,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,8CAA8C,CAAC,KAAK,CAAC,wBAAwB,MAAM,MAAM;AAAA,MACtG,OAAO;AAAA,MACP,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,IACD,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,GAAG,CAAC;AAAA,MACjB,OAAO,GAAG,CAAC,IAAI,CAAC;AAAA,MAChB,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,IACD,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,GAAG,CAAC;AAAA,MACjB,OAAO,GAAG,CAAC,IAAI,CAAC;AAAA,MAChB,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,IACD,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,GAAG,CAAC;AAAA,MACjB,OAAO,GAAG,CAAC,IAAI,CAAC;AAAA,MAChB,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF;AAUA,SAAS,wBACP,OACA,QACgD;AAChD,QAAM,SACJ;AASF,QAAM,OAAO;AAAA,IACX,YAAY,MAAM,OAAO,KAAK,MAAM,MAAM;AAAA,IAC1C,8CAA8C,MAAM,MAAM;AAAA,IAC1D,MAAM,SAAS,WAAW,MAAM,MAAM,KAAK;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,MAAM,GAAG,IAAK;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EACG,OAAO,OAAO,EACd,KAAK,IAAI;AACZ,SAAO;AAAA,IACL,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,IAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,EAChC;AACF;AAGA,eAAe,gBACb,MACA,OACA,QACiB;AACjB,SAAO,sBAAsB,MAAM,YAAY;AAC7C,UAAM,eAAe,oBAAoB,QAAQ,MAAM,MAAM,CAAC;AAC9D,UAAM,OAAO;AAAA,MACX;AAAA,MACA,mCAA8B,MAAM,OAAO,KAAK,MAAM,MAAM;AAAA,MAC5D,WAAW,MAAM,MAAM;AAAA,MACvB,WAAW,MAAM,MAAM;AAAA,MACvB;AAAA,MACA;AAAA,MACA,8BAAyB,MAAM,OAAO,KAAK,MAAM,MAAM,YAAY,MAAM,MAAM;AAAA,MAC/E;AAAA,MACA,OAAO,KAAK;AAAA,MACZ;AAAA,IACF,EAAE,KAAK,IAAI;AACX,UAAM,2BAA2B,MAAM,cAAc,MAAM,EAAE,UAAU,OAAO,CAAC;AAC/E,WAAOE,MAAK,MAAM,YAAY;AAAA,EAChC,CAAC;AACH;AAgCA,eAAsB,wBACpB,OACA,SAC0B;AAC1B,QAAM,SAAS,wBAAwB,EAAE,GAAG,QAAQ,eAAe,QAAQ,QAAQ,OAAO,CAAC;AAC3F,QAAM,OAAO,GAAG,MAAM,OAAO,KAAK,MAAM,MAAM,6BAA6B,MAAM,MAAM;AAEvF,QAAM,OAAO,MAAM,wBAAwB;AAAA,IACzC,MAAM,QAAQ;AAAA,IACd;AAAA,IACA;AAAA,IACA,QAAQ,QAAQ;AAAA,IAChB,gBAAgB,qBAAqB,KAAK;AAAA,IAC1C,WAAW,QAAQ,aAAa;AAAA,IAChC,QAAQ,QAAQ;AAAA,EAClB,CAAC;AAGD,QAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,QAAM,SAAS,cAAc,KAAK;AAClC,QAAM,WAAW,wBAAwB,OAAO,MAAM;AACtD,QAAM,SAAS,MAAM,QAAQ,OAAO,KAAK,UAAU,QAAQ,sBAAsB,IAAI;AAErF,QAAM,aAAa,MAAM,gBAAgB,QAAQ,MAAM,OAAO,MAAM;AACpE,SAAO,EAAE,MAAM,QAAQ,WAAW;AACpC;;;AGzOA,SAAS,KAAAC,UAAS;AA0BX,IAAM,gBAAN,MAAuC;AAAA,EAC3B,UAAU,oBAAI,IAA0B;AAAA,EACxC,QAAQ,oBAAI,IAA2B;AAAA,EACvC,SAA2B,CAAC;AAAA,EACrC,QAA+B;AAAA,EAEvC,MAAM,UAAU,QAAqC;AACnD,SAAK,QAAQ,IAAI,OAAO,IAAI,MAAM,MAAM,CAAC;AAAA,EAC3C;AAAA,EAEA,MAAM,UAAU,IAA0C;AACxD,WAAO,MAAM,KAAK,QAAQ,IAAI,EAAE,KAAK,IAAI;AAAA,EAC3C;AAAA,EAEA,MAAM,cAAuC;AAC3C,WAAO,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,EAAE,IAAI,KAAK;AAAA,EAC7C;AAAA,EAEA,MAAM,QAAQ,MAAoC;AAChD,SAAK,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,EACrC;AAAA,EAEA,MAAM,QAAQ,UAAiD;AAC7D,WAAO;AAAA,MACL,KAAK,MAAM,IAAI,QAAQ,KACrB,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE,KAAK,CAAC,SAAS,KAAK,SAAS,QAAQ,KAC9D;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,MAAM,YAAsC;AAC1C,WAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE,IAAI,KAAK;AAAA,EAC3C;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,SAAK,QAAQ,MAAM,KAAK;AAAA,EAC1B;AAAA,EAEA,MAAM,WAA2C;AAC/C,QAAI,KAAK,MAAO,QAAO,MAAM,KAAK,KAAK;AACvC,UAAM,QAAQ,MAAM,KAAK,UAAU;AACnC,UAAM,UAAU,MAAM,KAAK,YAAY;AACvC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC;AAAA,MACA;AAAA,MACA,OAAO,oBAAoB,KAAK;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,SAAK,OAAO,KAAK,MAAM,KAAK,CAAC;AAAA,EAC/B;AAAA,EAEA,MAAM,WAAW,QAA6B,CAAC,GAA8B;AAC3E,QAAI,MAAM,KAAK;AACf,QAAI,MAAM,KAAM,OAAM,IAAI,OAAO,CAAC,UAAU,MAAM,SAAS,MAAM,IAAI;AACrE,QAAI,MAAM,OAAQ,OAAM,IAAI,OAAO,CAAC,UAAU,MAAM,WAAW,MAAM,MAAM;AAC3E,UAAM,CAAC,GAAG,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,UAAU,cAAc,EAAE,SAAS,CAAC;AACpE,WAAO,IAAI,MAAM,EAAE,MAAM,SAAS,IAAI,OAAO,EAAE,IAAI,KAAK;AAAA,EAC1D;AACF;AAEA,IAAM,wBAAwBC,GAAE,MAAM,oBAAoB;AAEnD,IAAM,oBAAN,MAA2C;AAAA,EAChD,YAA6B,KAAa;AAAb;AAAA,EAAc;AAAA,EAAd;AAAA,EAE7B,MAAM,UAAU,QAAqC;AACnD,UAAM,SAAS,mBAAmB,MAAM,MAAM;AAC9C,UAAM,KAAK,YAAY,CAAC,WAAW;AAAA,MACjC,GAAG;AAAA,MACH,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC,SAAS,CAAC,QAAQ,GAAG,MAAM,QAAQ,OAAO,CAAC,UAAU,MAAM,OAAO,OAAO,EAAE,CAAC;AAAA,IAC9E,EAAE;AAAA,EACJ;AAAA,EAEA,MAAM,UAAU,IAA0C;AACxD,WAAO,kBAAkB,KAAK,KAAK,YAAY;AAC7C,YAAM,QAAQ,MAAM,KAAK,UAAU;AACnC,aAAO,MAAM,OAAO,QAAQ,KAAK,CAAC,WAAW,OAAO,OAAO,EAAE,KAAK,IAAI;AAAA,IACxE,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,cAAuC;AAC3C,WAAO,kBAAkB,KAAK,KAAK,YAAY,OAAO,MAAM,KAAK,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,EAC/F;AAAA,EAEA,MAAM,QAAQ,MAAoC;AAChD,UAAM,SAAS,oBAAoB,MAAM,IAAI;AAC7C,UAAM,KAAK,YAAY,CAAC,UAAU;AAChC,YAAM,QAAQ,CAAC,QAAQ,GAAG,MAAM,MAAM,OAAO,CAAC,UAAU,MAAM,OAAO,OAAO,EAAE,CAAC;AAC/E,aAAO;AAAA,QACL,GAAG;AAAA,QACH,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,QACpC;AAAA,QACA,OAAO,oBAAoB,KAAK;AAAA,MAClC;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,QAAQ,UAAiD;AAC7D,WAAO,kBAAkB,KAAK,KAAK,YAAY;AAC7C,YAAM,QAAQ,MAAM,KAAK,UAAU;AACnC,aAAO;AAAA,QACL,OAAO,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,YAAY,KAAK,SAAS,QAAQ,KAAK;AAAA,MACjF;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,YAAsC;AAC1C,WAAO,kBAAkB,KAAK,KAAK,YAAY,OAAO,MAAM,KAAK,UAAU,IAAI,SAAS,CAAC,CAAC,CAAC;AAAA,EAC7F;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,UAAM,SAAS,qBAAqB,MAAM,KAAK;AAC/C,UAAM;AAAA,MAAsB,KAAK;AAAA,MAAK,MACpC,2BAA2B,KAAK,KAAK,cAAc,MAAM;AAAA,IAC3D;AAAA,EACF;AAAA,EAEA,MAAM,WAA2C;AAC/C,WAAO,kBAAkB,KAAK,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,EAC3D;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,UAAM,SAAS,qBAAqB,MAAM,KAAK;AAC/C,UAAM,sBAAsB,KAAK,KAAK,YAAY;AAChD,YAAM,UAAU,MAAM,KAAK,WAAW;AACtC,YAAM,OAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,UAAU,MAAM,OAAO,OAAO,EAAE,GAAG,MAAM,EAAE;AAAA,QAAK,CAAC,GAAG,MACnF,EAAE,UAAU,cAAc,EAAE,SAAS;AAAA,MACvC;AACA,YAAM,2BAA2B,KAAK,KAAK,eAAe,IAAI;AAAA,IAChE,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,WAAW,QAA6B,CAAC,GAA8B;AAC3E,WAAO,kBAAkB,KAAK,KAAK,YAAY;AAC7C,UAAI,SAAS,MAAM,KAAK,WAAW;AACnC,UAAI,MAAM,KAAM,UAAS,OAAO,OAAO,CAAC,UAAU,MAAM,SAAS,MAAM,IAAI;AAC3E,UAAI,MAAM,OAAQ,UAAS,OAAO,OAAO,CAAC,UAAU,MAAM,WAAW,MAAM,MAAM;AACjF,aAAO,MAAM,OAAO,MAAM,EAAE,MAAM,SAAS,OAAO,OAAO,CAAC;AAAA,IAC5D,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,YAAY,QAAkE;AAC1F,UAAM,sBAAsB,KAAK,KAAK,YAAY;AAChD,YAAM,UAAW,MAAM,KAAK,UAAU,KAAMC,YAAW,KAAK,GAAG;AAC/D,YAAM,OAAO,qBAAqB,MAAM,OAAO,OAAO,CAAC;AACvD,YAAM,2BAA2B,KAAK,KAAK,cAAc,IAAI;AAAA,IAC/D,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,YAA4C;AACxD,WAAO;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,aAAwC;AACpD,WAAS,MAAM,aAAa,KAAK,KAAK,eAAe,qBAAqB,KACxE,CAAC;AAAA,EACL;AACF;AAEA,SAASA,YAAW,MAA8B;AAChD,SAAO;AAAA,IACL;AAAA,IACA,cAAa,oBAAI,KAAK,CAAC,GAAE,YAAY;AAAA,IACrC,SAAS,CAAC;AAAA,IACV,OAAO,CAAC;AAAA,IACR,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAChC;AACF;AAEA,eAAe,aACb,MACA,cACA,QACmB;AACnB,MAAI;AACF,UAAM,OAAO,MAAM,0BAA0B,MAAM,YAAY;AAC/D,WAAO,OAAO,MAAM,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC;AAAA,EAC7D,SAAS,OAAO;AACd,QAAK,OAAwC,SAAS,SAAU,QAAO;AACvE,UAAM;AAAA,EACR;AACF;AAEA,SAAS,MAAS,OAAa;AAC7B,SAAO,SAAS,OAAO,QAAS,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC;AAClE;;;AC1JO,IAAM,8BAAN,cAA0C,MAAM;AAAA,EACrD,YACkB,WACA,SAChB,SACA;AACA,UAAM,sBAAsB,SAAS,aAAa,OAAO,MAAM,OAAO,EAAE;AAJxD;AACA;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EANkB;AAAA,EACA;AAMpB;AAcO,SAAS,mBAAmB,SAAmD;AACpF,MAAI,CAAC,QAAQ,QAAS,QAAO;AAC7B,MAAI,CAAC,QAAQ,QAAQ,WAAW,kBAAkB,EAAG,QAAO;AAE5D,QAAM,OAAO,QAAQ,QAAQ,MAAM,mBAAmB,MAAM;AAC5D,QAAM,CAAC,UAAU,GAAG,UAAU,IAAI,KAAK,MAAM,GAAG;AAChD,QAAM,QAAQ,WAAW,KAAK,GAAG;AACjC,MAAI,CAAC,YAAY,CAAC,OAAO;AACvB,UAAM,IAAI;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WAA0C;AAAA,IAC9C,UAAU,QAAQ;AAAA,IAClB,YAAY,QAAQ;AAAA,IACpB,cAAc,QAAQ,cAAc,CAAC,GAAG;AAAA,IACxC,YAAY,QAAQ;AAAA,EACtB;AAEA,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,aAAO,aAAa,SAAS,OAAO,QAAQ;AAAA,IAC9C,KAAK;AACH,aAAO,cAAc,SAAS,OAAO,QAAQ;AAAA,IAC/C,KAAK;AACH,aAAO,gBAAgB,SAAS,OAAO,QAAQ;AAAA,IACjD,KAAK;AACH,aAAO,kBAAkB,SAAS,OAAO,QAAQ;AAAA,IACnD;AACE,YAAM,IAAI;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,iBAAiB,QAAQ;AAAA,MAC3B;AAAA,EACJ;AACF;AAEA,SAAS,aACP,SACA,OACA,UACmB;AACnB,QAAM,UAAU,MAAM,QAAQ,GAAG;AACjC,QAAM,WAAW,WAAW,IAAI,MAAM,MAAM,GAAG,OAAO,IAAI;AAC1D,QAAM,UAAU,WAAW,IAAI,MAAM,MAAM,UAAU,CAAC,IAAI;AAC1D,QAAM,OAAO,aAAa,WAAW,QAAQ,CAAC;AAE9C,QAAM,OAAO,eAAe,SAAS,UAAU,OAAO;AACtD,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM,UAAU,mBAAmB;AAAA,IACnC,OAAO;AAAA,IACP,aAAa,CAAC,EAAE,MAAM,SAAS,KAAK,CAAC;AAAA,IACrC;AAAA,EACF;AACF;AAEA,SAAS,cACP,SACA,OACA,UACmB;AACnB,QAAM,OAAmB,QAAQ,cAC9B,OAAO,CAAC,MAAM,EAAE,GAAG,EACnB,IAAI,CAAC,OAAO;AAAA,IACX,UAAU,mBAAmB,QAAQ,UAAU;AAAA,IAC/C,UAAU,EAAE;AAAA,IACZ,OAAO,EAAE;AAAA,EACX,EAAE;AACJ,QAAM,QAAwB;AAAA,IAC5B,IAAI,SAAS,QAAQ,UAAU;AAAA,IAC/B,MAAM,QAAQ,sBAAsB,QAAQ;AAAA,IAC5C;AAAA,IACA,YAAY,QAAQ;AAAA,IACpB,QAAQ;AAAA,IACR,UAAU;AAAA,MACR,YAAY,QAAQ;AAAA,MACpB,mBAAmB,QAAQ;AAAA,MAC3B,OAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN;AAAA,IACA,aAAa,CAAC;AAAA,IACd;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,gBACP,SACA,UACA,UACmB;AACnB,QAAM,OAAO,aAAa,WAAW,QAAQ,CAAC;AAC9C,QAAM,OAAO;AAAA,IACX;AAAA,IACA,UAAU,QAAQ;AAAA,IAClB,WAAW,QAAQ;AAAA,IACnB;AAAA,IACA,wBAAwB,QAAQ,UAAU;AAAA,IAC1C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA,GAAI,QAAQ,YAAY,CAAC,gBAAgB,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,IACvE,GAAI,QAAQ,qBACR,CAAC,yBAAyB,IAAI,QAAQ,oBAAoB,EAAE,IAC5D,CAAC;AAAA,EACP,EAAE,KAAK,IAAI;AACX,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,OAAO;AAAA,IACP,aAAa,CAAC,EAAE,MAAM,SAAS,KAAK,CAAC;AAAA,IACrC;AAAA,EACF;AACF;AAEA,SAAS,kBACP,SACA,UACA,UACmB;AACnB,QAAM,OAAO,aAAa,WAAW,QAAQ,CAAC;AAC9C,QAAM,OAAO;AAAA,IACX;AAAA,IACA,UAAU,QAAQ;AAAA,IAClB;AAAA,IACA,0BAA0B,QAAQ,UAAU;AAAA,IAC5C,eAAe,QAAQ,UAAU;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA,GAAI,QAAQ,YAAY,CAAC,eAAe,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,IACtE,GAAI,QAAQ,qBAAqB,CAAC,aAAa,IAAI,QAAQ,oBAAoB,EAAE,IAAI,CAAC;AAAA,EACxF,EAAE,KAAK,IAAI;AACX,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,OAAO;AAAA,IACP,aAAa,CAAC,EAAE,MAAM,SAAS,KAAK,CAAC;AAAA,IACrC;AAAA,EACF;AACF;AAaO,SAAS,oBACd,UAC2B;AAC3B,QAAM,YAAiC,CAAC;AACxC,QAAM,SAAwC,CAAC;AAC/C,MAAI,UAAU;AACd,aAAW,KAAK,UAAU;AACxB,QAAI;AACF,YAAM,IAAI,mBAAmB,CAAC;AAC9B,UAAI,EAAG,WAAU,KAAK,CAAC;AAAA,UAClB,YAAW;AAAA,IAClB,SAAS,KAAK;AACZ,UAAI,eAAe,4BAA6B,QAAO,KAAK,GAAG;AAAA,UAC1D,OAAM;AAAA,IACb;AAAA,EACF;AACA,SAAO,EAAE,WAAW,SAAS,OAAO;AACtC;AAEA,SAAS,WAAW,GAAmB;AACrC,SACE,EACG,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,YAAY,EAAE,EACtB,MAAM,GAAG,GAAG,KAAK;AAExB;AAEA,SAAS,eAAe,SAAyB,MAAc,SAAgC;AAC7F,QAAM,QAAQ,SAAS,IAAI;AAC3B,MAAI,SAAS;AACX,WAAO;AAAA,MACL,MAAM,OAAO;AAAA,MACb;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA,GAAI,QAAQ,YAAY,CAAC,iBAAiB,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,MACxE,GAAI,QAAQ,qBAAqB,CAAC,cAAc,IAAI,QAAQ,oBAAoB,EAAE,IAAI,CAAC;AAAA,MACvF,yBAAyB,QAAQ,UAAU,gBAAgB,QAAQ,WAAW,QAAQ,CAAC,CAAC;AAAA,IAC1F,EAAE,KAAK,IAAI;AAAA,EACb;AACA,SAAO;AAAA,IACL;AAAA,IACA,UAAU,KAAK;AAAA,IACf;AAAA,IACA,yBAAyB,QAAQ,UAAU;AAAA,IAC3C,eAAe,QAAQ,UAAU;AAAA,IACjC;AAAA,IACA;AAAA,IACA,KAAK,KAAK;AAAA,IACV;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA,GAAI,QAAQ,YAAY,CAAC,gBAAgB,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,IACvE,GAAI,QAAQ,qBACR,CAAC,yBAAyB,IAAI,QAAQ,oBAAoB,EAAE,IAC5D,CAAC;AAAA,EACP,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,SAAS,MAAsB;AACtC,SACE,KACG,MAAM,GAAG,EACT,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,YAAY,IAAI,EAAE,MAAM,CAAC,CAAC,EAC3C,KAAK,GAAG,KAAK;AAEpB;;;AC9RA,eAAsB,+BACpB,SAC2C;AAC3C,QAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,QAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,QAAM,YAAY;AAAA,IAChB;AAAA,MACE,GAAG;AAAA,MACH,gBAAgB,QAAQ,iBAAiB,CAAC,GAAG,QAAQ,cAAc,IAAI;AAAA,IACzE;AAAA,IACA;AAAA,EACF;AACA,QAAM,YAAY,wBAAwB,OAAO;AAAA,IAC/C,QAAQ,QAAQ;AAAA,IAChB,GAAG,QAAQ;AAAA,EACb,CAAC;AACD,QAAM,kBAAkB,WAAW,OAAO,4BAA4B,UAAU;AAChF,QAAM,gBACJ,QAAQ,gBAAgB,OAAO,CAAC,SAAS,KAAK,eAAe,UAAU,EAAE,UAAU;AACrF,QAAM,oBACJ,kBAAkB,IAAI,IAAI,KAAK,IAAI,GAAG,gBAAgB,eAAe,IAAI;AAC3E,QAAM,QAAQ,WAAW,MAAM,UAAU,MAAM,oBAAoB;AACnE,QAAM,WAAW;AAAA,IACf,WAAW,KAAK,SAAY,GAAG,WAAW,SAAS,MAAM;AAAA,IACzD,UAAU,KAAK,SAAY,GAAG,UAAU,SAAS,MAAM;AAAA,IACvD,oBAAoB,IAChB,SACA,GAAG,eAAe,IAAI,aAAa;AAAA,EACzC,EAAE,OAAO,CAAC,YAA+B,QAAQ,OAAO,CAAC;AAEzD,SAAO;AAAA,IACL;AAAA,IACA,SAAS,QAAQ,2CAA2C,SAAS,KAAK,IAAI;AAAA,IAC9E;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY;AAAA,MACV,YAAY,WAAW,KAAK,IAAI;AAAA,MAChC,YAAY,UAAU,KAAK,IAAI;AAAA,MAC/B,oBAAoB;AAAA,IACtB;AAAA,EACF;AACF;;;ACtFA;AAAA,EACE;AAAA,EAKA,qBAAAC;AAAA,OACK;AA0CA,SAAS,uBAAuB,OAAsD;AAC3F,QAAM,eAAe,MAAM,gBAAgB,CAAC;AAC5C,QAAM,aAAa,CAAC,GAAG,MAAM,eAAe,GAAG,YAAY,EAAE,IAAIC,kBAAiB;AAClF,QAAM,YAAY,0BAA0B;AAAA,IAC1C,QAAQ;AAAA,IACR,aAAa,MAAM;AAAA,IACnB,YAAY,MAAM,cAAc;AAAA,IAChC,QAAQ,MAAM,UAAU,CAAC;AAAA,IACzB,MAAM;AAAA,IACN,cAAc,MAAM,gBAAgB;AAAA,IACpC,YAAY;AAAA,MACV,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA,MAKf,kBAAkB;AAAA,MAClB,gBAAgB,MAAM,cAAc;AAAA,MACpC,gBAAgB,MAAM,aAAa,IAAI;AAAA,MACvC,eAAe;AAAA,MACf,cAAc,MAAM,YAAY;AAAA,IAClC;AAAA,EACF,CAAC;AACD,QAAM,UAA4B;AAAA,IAChC,IAAI,SAAS,QAAQ,GAAG,MAAM,WAAW,IAAI,MAAM,cAAa,oBAAI,KAAK,GAAE,YAAY,CAAC,EAAE;AAAA,IAC1F,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACrD,UAAU,UAAU,WAAW,WAAW,MAAM,kBAAkB;AAAA,IAClE;AAAA,IACA,cAAc,WAAW,IAAI,CAAC,WAAW,OAAO,KAAK;AAAA,EACvD;AACA,SAAO,EAAE,SAAS,WAAW,eAAe,MAAM,eAAe,aAAa;AAChF;;;ACkGO,SAAS,4BACd,UAAwC,CAAC,GAClB;AACvB,QAAM,wBAAwB,KAAK,IAAI,GAAG,QAAQ,yBAAyB,CAAC;AAC5E,QAAM,uBAAuB,KAAK,IAAI,GAAG,QAAQ,wBAAwB,CAAC;AAC1E,QAAM,qBAAqB,KAAK,IAAI,GAAG,QAAQ,sBAAsB,CAAC;AACtE,QAAM,wBAAwB,QAAQ,yBAAyB;AAG/D,QAAM,SAAS,oBAAI,IAA0B;AAE7C,QAAM,YAAY,oBAAI,IAA0B;AAChD,MAAI,SAAS;AACb,MAAI;AAEJ,WAASC,iBAA8B;AACrC,WAAO,QAAQ,UAAU,yBAAyB,QAAQ,cAAc;AAAA,EAC1E;AAGA,WAAS,YAAY,WAA2B,WAAmBC,QAA6B;AAC9F,UAAM,KAAK,QAAQ,UAAU,IAAI;AACjC,UAAM,OAAOC,QAAO,SAAS;AAC7B,UAAM,WAAW,OAAO,IAAI,EAAE;AAC9B,QAAI,UAAU;AACZ,UAAI,KAAM,UAAS,gBAAgB,IAAI,IAAI;AAC3C,UAAI,CAAC,SAAS,eAAe,SAAS,SAAS,EAAG,UAAS,eAAe,KAAK,SAAS;AACxF,wBAAkB,UAAU,UAAU,qBAAqB;AAC3D,aAAO;AAAA,IACT;AACA,UAAM,UAAwB;AAAA,MAC5B;AAAA,MACA,MAAM,UAAU,KAAK,KAAK;AAAA,MAC1B,iBAAiB,IAAI,IAAI,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC;AAAA,MAC3C,gBAAgB,CAAC,SAAS;AAAA,MAC1B,aAAa,oBAAI,IAAI;AAAA,MACrB,WAAW;AAAA,MACX,gBAAgBD;AAAA,IAClB;AACA,sBAAkB,SAAS,UAAU,qBAAqB;AAC1D,WAAO,IAAI,IAAI,OAAO;AACtB,WAAO;AAAA,EACT;AAGA,WAAS,kBAAkB,OAAqB,SAAmC;AACjF,QAAI,CAAC,WAAW,YAAY,MAAM,GAAI;AACtC,UAAM,QAAQ,OAAO,IAAI,OAAO;AAChC,QAAI,CAAC,MAAO;AACZ,UAAM,YAAY,IAAI,OAAO;AAC7B,UAAM,YAAY,IAAI,MAAM,EAAE;AAC9B,UAAM,YAAY;AAClB,UAAM,YAAY;AAAA,EACpB;AAGA,WAAS,mBAAmB,OAA6B;AACvD,WAAO,MAAM,gBAAgB;AAAA,EAC/B;AAEA,WAAS,eAAe,OAA8B;AACpD,WAAO,mBAAmB,KAAK,KAAK;AAAA,EACtC;AAGA,WAAS,OAAO,OAA8B;AAC5C,WAAO,CAAC,eAAe,KAAK,KAAK,CAAC,MAAM;AAAA,EAC1C;AAEA,WAAS,WAAiC;AACxC,UAAM,MAAM,CAAC,GAAG,OAAO,OAAO,CAAC;AAC/B,UAAM,eAAe,CAAC,GAAG,UAAU,OAAO,CAAC;AAC3C,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,iBAAiB,IAAI,OAAO,MAAM;AAAA,MAClC,cAAc,IAAI,OAAO,cAAc;AAAA,MACvC,WAAW,IAAI,OAAO,CAAC,UAAU,MAAM,SAAS;AAAA,MAChD,eAAe,aAAa,OAAO,CAAC,aAAa,CAAC,SAAS,SAAS;AAAA,MACpE;AAAA,IACF;AAAA,EACF;AASA,WAAS,cAAc,eAA+B;AACpD,eAAW,YAAY,UAAU,OAAO,GAAG;AACzC,UAAI,SAAS,UAAW;AAGxB,UAAI,SAAS,SAAS,iBAAiB;AACrC,cAAM,UAAU,SAAS,SAAS,KAAK,CAAC,OAAO;AAC7C,gBAAM,QAAQ,OAAO,IAAI,EAAE;AAC3B,iBAAO,QAAQ,eAAe,KAAK,KAAK,MAAM,YAAY;AAAA,QAC5D,CAAC;AACD,YAAI,QAAS,UAAS,YAAY;AAClC;AAAA,MACF;AACA,YAAM,SAAS,eAAe,SAAS,IAAI;AAC3C,UAAI,OAAO,SAAS,EAAG;AACvB,iBAAW,QAAQ,eAAe;AAChC,cAAM,UAAU,gBAAgB,QAAQ,eAAe,IAAI,CAAC;AAC5D,YAAI,WAAW,KAAK;AAClB,mBAAS,YAAY;AACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASL,MAAM,aACJ,QACA,KACwB;AACxB,YAAM,YAAY,MAAM,cAAc,QAAQ,GAAG;AACjD,UAAI,UAAU,WAAW,GAAG;AAC1B,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ;AAAA,QACV;AAAA,MACF;AACA,YAAM,WAAqB,CAAC;AAC5B,iBAAW,SAAS,WAAW;AAC7B,oBAAY,OAAO,OAAO,KAAK,IAAI,KAAK;AACxC,iBAAS,KAAK,MAAM,IAAI;AAAA,MAC1B;AACA,oBAAc,QAAQ;AACtB,aAAO,EAAE,QAAQ,KAAK;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,SAAS,MAA8B;AACrC,gBAAU;AACV,YAAMA,SAAQ;AACd,YAAM,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC;AAKlC,YAAM,sBAAsB,OAAO;AAAA,QACjC,CAAC,UAAU,OAAO,KAAK,KAAK,MAAM,YAAY,OAAO;AAAA,MACvD;AAIA,YAAM,gBAAgB,wBAAwB,QAAQA,MAAK,EAAE,MAAM,GAAG,oBAAoB;AAC1F,iBAAW,YAAY,eAAe;AACpC,YAAI,CAAC,UAAU,IAAI,SAAS,EAAE,EAAG,WAAU,IAAI,SAAS,IAAI,QAAQ;AAAA,MACtE;AAEA,YAAM,OAAO,eAAe,MAAM,eAAe,qBAAqB,qBAAqB;AAC3F,kBAAY,EAAE,OAAAA,QAAO,eAAe,qBAAqB,MAAM,KAAK;AACpE,cAAQ,UAAU,SAAS;AAC3B,aAAO;AAAA,IACT;AAAA,IAEA,eAAe;AAAA,IAEf,aAAsB;AACpB,YAAM,MAAM,CAAC,GAAG,OAAO,OAAO,CAAC;AAC/B,UAAI,IAAI,WAAW,EAAG,QAAO;AAC7B,YAAM,oBAAoB,IAAI,MAAM,CAAC,UAAU,eAAe,KAAK,KAAK,MAAM,SAAS;AACvF,YAAM,yBAAyB,CAAC,GAAG,UAAU,OAAO,CAAC,EAAE,MAAM,CAAC,aAAa,SAAS,SAAS;AAC7F,aAAO,qBAAqB;AAAA,IAC9B;AAAA,IAEA,YAA8C;AAC5C,aAAO;AAAA,IACT;AAAA,EACF;AAIA,iBAAe,cACb,QACA,KAC2B;AAC3B,UAAM,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC;AAClC,UAAM,UAAU,MAAM,qBAAqB,QAAQ,KAAK,MAAM;AAC9D,QAAI,QAAQ,SAAS,EAAG,QAAO,QAAQ,MAAM,GAAG,kBAAkB;AAClE,QAAI,sBAAuB,QAAO,oBAAoB,MAAM,EAAE,MAAM,GAAG,kBAAkB;AACzF,WAAO,CAAC;AAAA,EACV;AAEA,iBAAe,qBACb,QACA,KACA,QAC2B;AAC3B,QAAI;AACJ,QAAI;AACF,eAASD,eAAc;AAAA,IACzB,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AACA,UAAM,UAAU,OAAO,KAAK,MAAM,GAAG,IAAI;AACzC,UAAM,cAAc,OACjB,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,UAAU,MAAM,MAAM,EAAE,KAAK,MAAM,IAAI,EAAE,EAC9C,KAAK,IAAI;AACZ,UAAM,SACJ,maAKkB,kBAAkB;AACtC,UAAM,OAAO;AAAA,MACX,kBAAkB,IAAI,IAAI;AAAA,MAC1B,eAAe,OAAO,SAAS,QAAQ;AAAA,MACvC,cAAc;AAAA,EAAkC,WAAW,KAAK;AAAA,MAChE;AAAA,EAAkB,OAAO;AAAA,MACzB;AAAA,IACF,EAAE,KAAK,MAAM;AAEb,QAAI,MAAM;AACV,QAAI;AACF,YAAM,MAAM,OAAO;AAAA,QACjB;AAAA,UACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,UAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,QAChC;AAAA,QACA;AAAA,MACF;AAAA,IACF,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AACA,WAAO,qBAAqB,KAAK,MAAM;AAAA,EACzC;AAOA,WAAS,oBAAoB,QAAkD;AAC7E,UAAM,YAAY,OAAO,KACtB,MAAM,eAAe,EACrB,IAAI,CAAC,aAAa,SAAS,KAAK,CAAC,EACjC,OAAO,CAAC,aAAa,eAAe,QAAQ,EAAE,QAAQ,CAAC;AAC1D,WAAO,UAAU,MAAM,GAAG,kBAAkB,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE;AAAA,EACxE;AAaA,WAAS,wBAAwB,QAAwBC,QAA+B;AACtF,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,UAAM,MAAsB,CAAC;AAI7B,eAAW,SAAS,QAAQ;AAC1B,iBAAW,WAAW,MAAM,aAAa;AACvC,cAAM,QAAQ,OAAO,KAAK,CAAC,UAAU,MAAM,OAAO,OAAO;AACzD,YAAI,CAAC,SAAS,MAAM,KAAK,MAAM,GAAI;AACnC,YAAI;AAAA,UACF;AAAA,YACE;AAAA,YACA,kEAAkE,SAAS,MAAM,IAAI,CAAC,UAAU,SAAS,MAAM,IAAI,CAAC;AAAA,YACpH,CAAC,MAAM,IAAI,MAAM,EAAE;AAAA,YACnBA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,eAAW,SAAS,OAAO,OAAO,CAAC,UAAU,CAAC,MAAM,SAAS,GAAG;AAC9D,UAAI,MAAM,gBAAgB,OAAO,uBAAuB;AACtD,YAAI;AAAA,UACF;AAAA,YACE;AAAA,YACA,yCAAyC,SAAS,MAAM,IAAI,CAAC;AAAA,YAC7D,CAAC,MAAM,EAAE;AAAA,YACTA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,eAAW,SAAS,CAAC,GAAG,MAAM,EAC3B,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,OAAO,EAAE,gBAAgB,IAAI,EAC9D,MAAM,GAAG,CAAC,GAAG;AACd,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,sCAAsC,SAAS,MAAM,IAAI,CAAC;AAAA,UAC1D,CAAC,MAAM,EAAE;AAAA,UACTA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,UAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,OAAO,EAAE,gBAAgB,IAAI;AACzF,QAAI,OAAO,UAAU,KAAK,OAAO,CAAC,KAAK,OAAO,CAAC,GAAG;AAChD,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,6BAA6B,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,kBAAkB,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC;AAAA,UAC/F,CAAC,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,EAAE;AAAA,UAC3BA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,UAAM,WAA6C;AAAA,MACjD,eAAe;AAAA,MACf,KAAK;AAAA,MACL,WAAW;AAAA,MACX,aAAa;AAAA,IACf;AACA,WAAO,IAAI,KAAK,CAAC,GAAG,MAAM,SAAS,EAAE,IAAI,IAAI,SAAS,EAAE,IAAI,CAAC;AAAA,EAC/D;AACF;AAMA,SAAS,aACP,MACA,MACA,UACA,aACc;AACd,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,IAAI,KAAK,OAAO,GAAG,IAAI,IAAI,IAAI,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,IAC/C;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACF;AACF;AAGA,SAAS,QAAQ,MAAsB;AACrC,SAAO,KAAK,OAAO,cAAc,IAAI,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC;AACtD;AAEA,SAASC,QAAO,KAAqB;AACnC,MAAI;AACF,WAAO,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,SAAS,YAAY,EAAE,QAAQ,UAAU,EAAE;AAAA,EACxE,QAAQ;AAGN,WAAO,gBAAgB,GAAG;AAAA,EAC5B;AACF;AAEA,SAAS,cAAc,MAAsB;AAC3C,SAAO,KACJ,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACV;AAEA,IAAMC,aAAY,oBAAI,IAAI;AAAA,EACxB;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;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,eAAe,MAA2B;AACjD,SAAO,IAAI;AAAA,IACT,cAAc,IAAI,EACf,MAAM,GAAG,EACT,OAAO,CAAC,SAAS,KAAK,UAAU,KAAK,CAACA,WAAU,IAAI,IAAI,CAAC;AAAA,EAC9D;AACF;AAEA,SAAS,gBAAgB,GAAgB,GAAwB;AAC/D,MAAI,EAAE,SAAS,EAAG,QAAO;AACzB,MAAI,OAAO;AACX,aAAW,QAAQ,EAAG,KAAI,EAAE,IAAI,IAAI,EAAG,SAAQ;AAC/C,SAAO,OAAO,EAAE;AAClB;AAEA,SAAS,SAAS,MAAc,MAAM,KAAa;AACjD,QAAM,IAAI,KAAK,KAAK,EAAE,QAAQ,QAAQ,GAAG;AACzC,SAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;AACrD;AAOA,SAAS,qBAAqB,KAAa,QAA0C;AACnF,QAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,QAAM,aAAa,KAAK,MAAM,aAAa;AAC3C,MAAI,CAAC,WAAY,QAAO,CAAC;AACzB,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,WAAW,CAAC,CAAC;AAAA,EACnC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO,CAAC;AACpC,QAAM,YAAY,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,MAAM,EAAE,CAAC;AACzD,QAAM,MAAwB,CAAC;AAC/B,aAAW,QAAQ,QAAQ;AACzB,QAAI,CAAC,QAAQ,OAAO,SAAS,SAAU;AACvC,UAAM,SAAS;AACf,QAAI,OAAO,OAAO,UAAU,YAAY,CAAC,OAAO,MAAM,KAAK,EAAG;AAC9D,UAAM,gBAAgB,iBAAiB,OAAO,WAAW;AACzD,QAAI,KAAK;AAAA,MACP,MAAM,OAAO,MAAM,KAAK;AAAA,MACxB,uBACE,iBAAiB,UAAU,IAAI,aAAa,IAAI,gBAAgB;AAAA,IACpE,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,SAAS,iBAAiB,OAAoC;AAC5D,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,WAAW,QAAQ,YAAY,MAAM,OAAQ,QAAO;AACzD,QAAM,UAAU,QAAQ,MAAM,cAAc;AAC5C,QAAM,MAAM,UAAU,CAAC,KAAK,SAAS,KAAK;AAC1C,SAAO,GAAG,WAAW,IAAI,IAAI,KAAK;AACpC;AAOA,SAAS,eACP,MACA,eACA,qBACA,uBACQ;AACR,QAAM,QAAkB,CAAC;AACzB,QAAM;AAAA,IACJ;AAAA,EACF;AAEA,MAAI,cAAc,SAAS,GAAG;AAC5B,UAAM,KAAK,IAAI,0CAA0C;AACzD,eAAW,YAAY,eAAe;AACpC,YAAM,KAAK,MAAM,SAAS,IAAI,KAAK,SAAS,IAAI,EAAE;AAAA,IACpD;AAAA,EACF;AAEA,MAAI,oBAAoB,SAAS,GAAG;AAClC,UAAM;AAAA,MACJ;AAAA,MACA,kEAAkE,qBAAqB;AAAA,IACzF;AACA,eAAW,SAAS,qBAAqB;AACvC,YAAM,SACJ,MAAM,YAAY,OAAO,IACrB,yEACA,QAAQ,MAAM,gBAAgB,IAAI;AACxC,YAAM,KAAK,MAAM,SAAS,MAAM,IAAI,CAAC,YAAO,MAAM,EAAE;AAAA,IACtD;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,GAAG;AACnB,UAAM,KAAK,IAAI,4BAA4B;AAC3C,eAAW,OAAO,MAAM;AACtB,YAAM,KAAK,MAAM,IAAI,WAAW,aAAa,MAAM,KAAK,IAAI,WAAW,KAAK,IAAI,EAAE,GAAG;AAAA,IACvF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;","names":["resolve","reason","contentWords","stopwords","candidate","average","unique","round","join","z","z","join","join","round","remainingGaps","join","z","z","emptyIndex","validateRunRecord","validateRunRecord","resolveRouter","round","hostOf","stopwords"]}
+{"version":3,"sources":["../src/web-research-worker.ts","../src/adaptive-driver.ts","../src/agent-candidate.ts","../src/kb-improvement.ts","../src/claim-grounding.ts","../src/rag-eval.ts","../src/research-loop.ts","../src/events.ts","../src/eval-readiness.ts","../src/readiness-helpers.ts","../src/rag-improvement-loop.ts","../src/changes.ts","../src/chunking.ts","../src/collection-research-driver.ts","../src/discovery.ts","../src/freshness.ts","../src/investment-thesis-set.ts","../src/investment-thesis-task.ts","../src/material-facts-metric.ts","../src/two-agent-research-loop.ts","../src/kb-store.ts","../src/propose-from-finding.ts","../src/readiness-check.ts","../src/release.ts","../src/research-driving-driver.ts"],"sourcesContent":["/**\n * Real web-research worker + verifying driver for `runVerifiedResearchLoop`.\n *\n * This is the GENERAL, any-topic implementation behind the two-agent research\n * loop's live arm. Given the open knowledge gaps the readiness gate surfaces,\n * the worker:\n *\n *   1. asks an LLM (glm-5.2 by default) to turn each gap into focused web\n *      search queries,\n *   2. runs a REAL web search over the Tangle router (`POST /v1/search` — the\n *      same endpoint `tcloud mcp`'s `web_search` tool forwards to), so there is\n *      no hardcoded corpus,\n *   3. fetches the top results with the repo's polite, cached `politeFetch` and\n *      reduces each page to text with `htmlToText`,\n *   4. proposes the readable, verifiable pages as `ResearchSourceProposal`s plus\n *      a `buildPages` that writes citing `knowledge/*.md` pages from the sources\n *      the driver accepts.\n *\n * The verifying DRIVER is the differentiated role from the two-agent loop: a\n * second LLM pass that judges each fetched source's on-topic relevance to the\n * goal + open gaps and rejects off-topic / spam / already-covered material. The\n * worker ADDS; the driver GATES. Together they build a cleaner knowledge base\n * than a single agent at the same compute budget.\n *\n * Dependency-free on purpose: it talks to the router over `fetch` directly with\n * the published OpenAI-compatible chat shape and the `/v1/search` shape, so it\n * works whether or not the `tcloud` CLI is installed. Point it at any router by\n * passing `baseUrl`; supply the key via `apiKey` or `TANGLE_API_KEY`.\n */\n\nimport { htmlToText } from './sources/html'\nimport { politeFetch } from './sources/http'\nimport type {\n  KnowledgeGap,\n  ResearchContribution,\n  ResearchDriver,\n  ResearchSourceProposal,\n  ResearchWorker,\n  SourceVerdict,\n  SourceVerificationContext,\n  WorkerResearchContext,\n} from './two-agent-research-loop'\nimport type { SourceRecord } from './types'\n\n/** Default router model. Plain id (no namespace) — see CLAUDE/creds notes. */\nconst DEFAULT_MODEL = 'glm-5.2'\n/** Default router base. */\nconst DEFAULT_BASE_URL = 'https://router.tangle.tools/v1'\n/**\n * glm-5.2 spends its first tokens on hidden `reasoning_content`; below ~1200\n * output tokens it returns EMPTY visible content. Floor every call so a\n * reasoning model never silently yields nothing. (Verified creds note.)\n */\nconst MIN_MAX_TOKENS = 1200\n\n/** One live web result, as the router's `/v1/search` returns it. */\nexport interface WebSearchHit {\n  title: string\n  url: string\n  snippet?: string\n}\n\n/**\n * The two router capabilities the worker/driver need. Injectable so tests can\n * stub the network; the default talks to the live Tangle router over `fetch`.\n */\nexport interface RouterClient {\n  /** Live web search — returns title/url/snippet hits. */\n  search(query: string, opts?: { maxResults?: number }): Promise<WebSearchHit[]>\n  /** Chat completion — returns the assistant message's visible text. */\n  chat(\n    messages: { role: 'system' | 'user'; content: string }[],\n    maxTokens?: number,\n  ): Promise<string>\n  /** Cumulative cost (chat + search) since this client was created. */\n  usage(): RouterUsage\n}\n\n/**\n * Cumulative router cost — the per-arm signal the A/B reports ALONGSIDE quality,\n * so \"2.3 fewer sources\" can be read against the token/$/latency it cost. A\n * two-agent round is one worker pass plus N `verifySource` LLM calls; counting\n * each call here is what surfaces that the two-agent loop spends more inference\n * than its \"equal passes\" budget implies.\n */\nexport interface RouterUsage {\n  chatCalls: number\n  searchCalls: number\n  promptTokens: number\n  completionTokens: number\n  usd: number\n  wallMs: number\n}\n\nexport interface TangleRouterOptions {\n  /** Router base URL. Defaults to `https://router.tangle.tools/v1`. */\n  baseUrl?: string\n  /** Bearer key. Defaults to `process.env.TANGLE_API_KEY`. */\n  apiKey?: string\n  /** Chat model id. Defaults to `glm-5.2`. */\n  model?: string\n  /** Optional preferred search provider (exa | you | perplexity | …). */\n  searchProvider?: string\n  /**\n   * Retries on a TRANSIENT upstream status (502/503/504/429) with exponential\n   * backoff. Default 4. A 4xx that isn't 429, and a 401, are NOT retried — those\n   * are not transient. After the budget is exhausted the call still fails loud\n   * with the original `RouterError`, so the fail-closed contract holds; this only\n   * stops a single upstream-capacity blip from voiding a whole multi-topic run.\n   */\n  maxRetries?: number\n  /** Base backoff in ms (doubled each retry, ±25% jitter). Default 1500. */\n  retryBaseMs?: number\n  signal?: AbortSignal\n}\n\n/** Transient upstream statuses worth a retry (capacity / rate-limit / gateway). */\nconst transientStatuses = new Set([429, 502, 503, 504])\n\n/**\n * POST with bounded exponential backoff on transient upstream statuses. Returns\n * the first `res.ok` response, or the LAST response (so the caller throws the\n * real status). A non-transient failure returns immediately — only 502/503/504/\n * 429 are retried. Aborts propagate at once.\n */\nasync function fetchWithRetry(\n  url: string,\n  init: RequestInit,\n  opts: { maxRetries: number; retryBaseMs: number; signal?: AbortSignal },\n): Promise<Response> {\n  let lastRes: Response | undefined\n  for (let attempt = 0; attempt <= opts.maxRetries; attempt += 1) {\n    if (opts.signal?.aborted) throw new RouterError(0, 'aborted')\n    const res = await fetch(url, init)\n    if (res.ok || !transientStatuses.has(res.status)) return res\n    lastRes = res\n    if (attempt === opts.maxRetries) break\n    // Drain the body so the socket frees before we wait.\n    await res.text().catch(() => '')\n    const backoff = opts.retryBaseMs * 2 ** attempt\n    const jitter = backoff * (0.75 + Math.random() * 0.5)\n    await new Promise((resolve) => setTimeout(resolve, jitter))\n  }\n  // Exhausted: hand back the last transient response so the caller fails loud\n  // with its real status.\n  if (lastRes) return lastRes\n  throw new RouterError(0, 'fetchWithRetry produced no response')\n}\n\n/** A small error so a failed router call fails loud rather than returning junk. */\nexport class RouterError extends Error {\n  constructor(\n    public readonly status: number,\n    message: string,\n  ) {\n    super(`router ${status}: ${message}`)\n    this.name = 'RouterError'\n  }\n}\n\n/**\n * Build a dependency-free Tangle router client over `fetch`. This is the same\n * wire surface the `tcloud` SDK + `tcloud mcp` use (`/v1/search` for web search,\n * `/v1/chat/completions` for chat) so it needs no CLI installed.\n */\nexport function createTangleRouterClient(options: TangleRouterOptions = {}): RouterClient {\n  const baseUrl = (options.baseUrl ?? DEFAULT_BASE_URL).replace(/\\/$/, '')\n  const apiKey = options.apiKey ?? process.env.TANGLE_API_KEY\n  if (!apiKey) {\n    throw new RouterError(401, 'no TANGLE_API_KEY (pass apiKey or set the env var)')\n  }\n  const model = options.model ?? DEFAULT_MODEL\n  const maxRetries = Math.max(0, options.maxRetries ?? 4)\n  const retryBaseMs = Math.max(1, options.retryBaseMs ?? 1500)\n  const headers = {\n    'Content-Type': 'application/json',\n    Authorization: `Bearer ${apiKey}`,\n  }\n\n  // glm-5.2 pricing (USD per token) + a cumulative accumulator. Read via usage().\n  const price = { prompt: 0.95 / 1_000_000, completion: 3.0 / 1_000_000 }\n  const acc: RouterUsage = {\n    chatCalls: 0,\n    searchCalls: 0,\n    promptTokens: 0,\n    completionTokens: 0,\n    usd: 0,\n    wallMs: 0,\n  }\n\n  return {\n    async search(query, opts) {\n      const t0 = Date.now()\n      const res = await fetchWithRetry(\n        `${baseUrl}/search`,\n        {\n          method: 'POST',\n          headers,\n          signal: options.signal,\n          body: JSON.stringify({\n            query,\n            ...(options.searchProvider ? { provider: options.searchProvider } : {}),\n            ...(opts?.maxResults != null ? { maxResults: opts.maxResults } : {}),\n          }),\n        },\n        { maxRetries, retryBaseMs, signal: options.signal },\n      )\n      acc.searchCalls += 1\n      acc.wallMs += Date.now() - t0\n      if (!res.ok) {\n        throw new RouterError(res.status, await res.text().catch(() => res.statusText))\n      }\n      const body = (await res.json()) as { data?: WebSearchHit[] }\n      return (body.data ?? [])\n        .filter((hit) => typeof hit?.url === 'string' && hit.url.length > 0)\n        .map((hit) => ({ title: hit.title ?? hit.url, url: hit.url, snippet: hit.snippet }))\n    },\n    async chat(messages, maxTokens) {\n      // Reasoning-model floor: never let glm-5.2 spend the whole budget on\n      // hidden reasoning and return empty visible content.\n      const max_tokens = Math.max(MIN_MAX_TOKENS, maxTokens ?? MIN_MAX_TOKENS)\n      const t0 = Date.now()\n      const res = await fetchWithRetry(\n        `${baseUrl}/chat/completions`,\n        {\n          method: 'POST',\n          headers,\n          signal: options.signal,\n          body: JSON.stringify({ model, messages, max_tokens, temperature: 0.2, stream: false }),\n        },\n        { maxRetries, retryBaseMs, signal: options.signal },\n      )\n      if (!res.ok) {\n        throw new RouterError(res.status, await res.text().catch(() => res.statusText))\n      }\n      const body = (await res.json()) as {\n        choices?: { message?: { content?: string } }[]\n        usage?: { prompt_tokens?: number; completion_tokens?: number }\n      }\n      const promptTokens = body.usage?.prompt_tokens ?? 0\n      const completionTokens = body.usage?.completion_tokens ?? 0\n      acc.chatCalls += 1\n      acc.promptTokens += promptTokens\n      acc.completionTokens += completionTokens\n      acc.usd += promptTokens * price.prompt + completionTokens * price.completion\n      acc.wallMs += Date.now() - t0\n      return body.choices?.[0]?.message?.content ?? ''\n    },\n    usage() {\n      return { ...acc }\n    },\n  }\n}\n\nexport interface WebResearchWorkerOptions {\n  /** Router client. Defaults to a live Tangle router client from env creds. */\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /** Max search queries the LLM may form per gap. Default 2. */\n  queriesPerGap?: number\n  /** Max web results fetched per query. Default 3. */\n  resultsPerQuery?: number\n  /** Hard cap on sources proposed per round (across all gaps). Default 6. */\n  maxSourcesPerRound?: number\n  /** Disk cache dir for `politeFetch`. Optional; speeds repeat runs. */\n  cacheDir?: string\n  /** Minimum readable text length to keep a fetched page. Default 200. */\n  minTextChars?: number\n  /** Max chars of page text stored per source (keeps pages bounded). Default 4000. */\n  maxTextChars?: number\n}\n\n/** Resolve the router client lazily so a worker with an injected client never reads env. */\nfunction resolveRouter(opts: {\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n}): RouterClient {\n  return opts.router ?? createTangleRouterClient(opts.router_options)\n}\n\n/**\n * The real web-research worker. Conforms to the loop's `ResearchWorker`\n * contract: given the open gaps, it returns the sources it found plus a\n * `buildPages` that emits citing pages from the sources the driver accepted.\n */\nexport function createWebResearchWorker(options: WebResearchWorkerOptions = {}): ResearchWorker {\n  const queriesPerGap = Math.max(1, options.queriesPerGap ?? 2)\n  const resultsPerQuery = Math.max(1, options.resultsPerQuery ?? 3)\n  const maxSourcesPerRound = Math.max(1, options.maxSourcesPerRound ?? 6)\n  const minTextChars = Math.max(1, options.minTextChars ?? 200)\n  const maxTextChars = Math.max(minTextChars, options.maxTextChars ?? 4000)\n\n  return async (ctx: WorkerResearchContext): Promise<ResearchContribution> => {\n    const router = resolveRouter(options)\n    // Target the BLOCKING gaps first; fall back to all gaps if none are blocking.\n    const targetGaps = ctx.gaps.filter((gap) => gap.blocking)\n    const gaps = targetGaps.length > 0 ? targetGaps : ctx.gaps\n    if (gaps.length === 0) {\n      return { sources: [], notes: 'no open gaps to research' }\n    }\n\n    const queries = await formSearchQueries(router, ctx, gaps, queriesPerGap)\n    const proposals: ResearchSourceProposal[] = []\n    const seenUris = new Set<string>()\n\n    for (const query of queries) {\n      if (proposals.length >= maxSourcesPerRound) break\n      if (ctx.signal?.aborted) break\n      let hits: WebSearchHit[]\n      try {\n        hits = await router.search(query, { maxResults: resultsPerQuery })\n      } catch (error) {\n        // A single failed query must not sink the round — record nothing, move on.\n        if ((error as { name?: string }).name === 'AbortError') break\n        continue\n      }\n      for (const hit of hits) {\n        if (proposals.length >= maxSourcesPerRound) break\n        if (seenUris.has(hit.url)) continue\n        const fetched = await politeFetch(hit.url, {\n          signal: ctx.signal,\n          cacheDir: options.cacheDir,\n        })\n        if (!fetched.verifiable) continue\n        const text = htmlToText(fetched.body).slice(0, maxTextChars)\n        if (text.length < minTextChars) continue\n        seenUris.add(hit.url)\n        proposals.push({\n          uri: hit.url,\n          title: hit.title || hit.url,\n          text,\n          // We just fetched + verified this page, so stamp `lastVerifiedAt` with\n          // fetch time. Do NOT set `validUntil`: a live page has no inherent\n          // future expiry, and the readiness freshness check treats any\n          // `validUntil <= now` as EXPIRED (score 0). The page's `Last-Modified`\n          // is a PAST date, so writing it here would mark every real source stale\n          // and zero out coverage. Record it as provenance metadata instead.\n          lastVerifiedAt: fetched.fetchedAt,\n          metadata: {\n            discoveredVia: query,\n            snippet: hit.snippet ?? '',\n            goal: ctx.goal,\n            sourceUpdatedAt: fetched.sourceUpdatedAt,\n          },\n        })\n      }\n    }\n\n    return {\n      sources: proposals,\n      buildPages: buildCitingPages(proposals),\n      notes: `web-research worker: ${queries.length} queries → ${proposals.length} fetched sources`,\n    }\n  }\n}\n\n/**\n * Ask the LLM to turn the open gaps into focused web search queries. Falls back\n * to the gap's own readiness query if the model returns nothing parseable, so a\n * model hiccup degrades to a sane search rather than an empty round.\n */\nasync function formSearchQueries(\n  router: RouterClient,\n  ctx: WorkerResearchContext,\n  gaps: KnowledgeGap[],\n  queriesPerGap: number,\n): Promise<string[]> {\n  const gapLines = gaps\n    .map((gap, i) => `${i + 1}. ${gap.description} (readiness query: \"${gap.query}\")`)\n    .join('\\n')\n  const want = gaps.length * queriesPerGap\n  const system =\n    'You are a research librarian. Turn knowledge gaps into precise web search queries that will ' +\n    'surface authoritative primary sources (papers, docs, standards, official pages). ' +\n    'Return ONLY a JSON array of query strings, no prose.'\n  const user = [\n    `Research goal: ${ctx.goal}`,\n    ctx.steer ? `Steer from the coordinator:\\n${ctx.steer}` : '',\n    `Open knowledge gaps:\\n${gapLines}`,\n    `Return up to ${want} search query strings as a JSON array (e.g. [\"query one\",\"query two\"]).`,\n  ]\n    .filter(Boolean)\n    .join('\\n\\n')\n\n  let raw = ''\n  try {\n    raw = await router.chat(\n      [\n        { role: 'system', content: system },\n        { role: 'user', content: user },\n      ],\n      MIN_MAX_TOKENS,\n    )\n  } catch {\n    raw = ''\n  }\n  const parsed = parseQueryList(raw)\n  const fromLlm = parsed.slice(0, want)\n  if (fromLlm.length > 0) return dedupeStrings(fromLlm)\n  // Degrade to the readiness queries themselves — still a real search.\n  return dedupeStrings(gaps.map((gap) => gap.query || gap.description))\n}\n\n/** Parse a JSON array of query strings, tolerant of code fences / surrounding prose. */\nfunction parseQueryList(raw: string): string[] {\n  const text = raw.trim()\n  if (!text) return []\n  const candidates: string[] = []\n  // Prefer a fenced or bare JSON array.\n  const arrayMatch = text.match(/\\[[\\s\\S]*\\]/)\n  if (arrayMatch) {\n    try {\n      const arr = JSON.parse(arrayMatch[0]) as unknown[]\n      for (const item of arr)\n        if (typeof item === 'string' && item.trim()) candidates.push(item.trim())\n    } catch {\n      /* fall through to line parsing */\n    }\n  }\n  if (candidates.length === 0) {\n    for (const line of text.split('\\n')) {\n      const cleaned = line\n        .replace(/^\\s*(?:[-*]|\\d+[.)])\\s*/, '')\n        .replace(/^[\"']|[\"']$/g, '')\n        .trim()\n      if (cleaned && cleaned.length > 2 && !cleaned.startsWith('{')) candidates.push(cleaned)\n    }\n  }\n  return candidates\n}\n\nfunction dedupeStrings(values: string[]): string[] {\n  const seen = new Set<string>()\n  const out: string[] = []\n  for (const value of values) {\n    const key = value.toLowerCase().trim()\n    if (key && !seen.has(key)) {\n      seen.add(key)\n      out.push(value.trim())\n    }\n  }\n  return out\n}\n\n/**\n * Build the curated `knowledge/*.md` pages from the sources the driver accepted.\n * Each page cites the registered source by its assigned `record.id` (matched back\n * to the proposal via `metadata.originalUri`, which `addSourceText` stashes).\n */\nfunction buildCitingPages(\n  proposals: ResearchSourceProposal[],\n): (acceptedSources: SourceRecord[]) => string | undefined {\n  return (acceptedSources) => {\n    if (acceptedSources.length === 0) return undefined\n    const blocks = acceptedSources.map((record) => {\n      const proposal = proposals.find((p) => p.uri === record.metadata?.originalUri)\n      const uri = proposal?.uri ?? record.id\n      const slug =\n        uri\n          .replace(/^https?:\\/\\//, '')\n          .replace(/[^a-z0-9]+/gi, '-')\n          .replace(/^-+|-+$/g, '')\n          .slice(0, 120) || record.id\n      const title = proposal?.title ?? record.id\n      const body = proposal?.text ?? ''\n      return [\n        `---FILE: knowledge/${slug}.md---`,\n        '---',\n        `title: ${escapeYaml(title)}`,\n        `sources: [\"${record.id}\"]`,\n        `source_url: ${uri}`,\n        '---',\n        `# ${title}`,\n        '',\n        body,\n        '',\n        `Source: ${uri}`,\n        '---END FILE---',\n      ].join('\\n')\n    })\n    return blocks.join('\\n')\n  }\n}\n\nfunction escapeYaml(value: string): string {\n  // Keep the frontmatter line single-valued and safe: collapse newlines, strip\n  // quotes that would break the scalar.\n  return value\n    .replace(/[\\r\\n]+/g, ' ')\n    .replace(/\"/g, \"'\")\n    .trim()\n}\n\nexport interface VerifyingDriverOptions {\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /**\n   * When the LLM verdict can't be parsed, default to REJECT (fail-closed) so a\n   * model hiccup never poisons the KB with an unverified source. Set `true` to\n   * accept-on-parse-failure only if you have a reason to. Default false.\n   */\n  acceptOnParseFailure?: boolean\n}\n\n/**\n * The verifying driver: a real LLM pass that judges each candidate source's\n * on-topic relevance to the goal + open gaps and whether it duplicates material\n * already accepted this round. This is the differentiated coordinator role — it\n * GATES the worker's additions; it adds nothing itself.\n *\n * The loop already dedups exact-uri duplicates and only calls this on genuinely\n * new candidates, so the verifier focuses on relevance + near-duplicate\n * judgement, not bookkeeping.\n */\nexport function createVerifyingResearchDriver(\n  options: VerifyingDriverOptions = {},\n): ResearchDriver {\n  const acceptOnParseFailure = options.acceptOnParseFailure ?? false\n  return {\n    async verifySource(\n      source: ResearchSourceProposal,\n      ctx: SourceVerificationContext,\n    ): Promise<SourceVerdict> {\n      const router = resolveRouter(options)\n      const gapLines = ctx.gaps\n        .map((gap) => `- ${gap.description} (query: \"${gap.query}\")`)\n        .join('\\n')\n      const acceptedTitles = ctx.acceptedThisRound\n        .map((accepted) => `- ${accepted.title ?? accepted.uri}`)\n        .join('\\n')\n      const excerpt = source.text.slice(0, 1500)\n      const system =\n        'You verify whether a fetched web source belongs in a curated knowledge base. ' +\n        'Accept a source ONLY if it is genuinely on-topic for the research goal and helps close ' +\n        'one of the open gaps, AND it is not a near-duplicate of an already-accepted source. ' +\n        'Reject spam, listicles, off-topic pages, marketing, and near-duplicates. ' +\n        'Respond with ONLY a JSON object: {\"accept\": true|false, \"reason\": \"<short reason>\"}.'\n      const user = [\n        `Research goal: ${ctx.goal}`,\n        `Open gaps:\\n${gapLines || '(none specified)'}`,\n        acceptedTitles\n          ? `Already accepted this round:\\n${acceptedTitles}`\n          : 'Nothing accepted yet this round.',\n        `Candidate source:\\nURL: ${source.uri}\\nTitle: ${source.title ?? '(none)'}\\nExcerpt:\\n${excerpt}`,\n        'Verdict as JSON {\"accept\": boolean, \"reason\": string}:',\n      ].join('\\n\\n')\n\n      let raw = ''\n      try {\n        raw = await router.chat(\n          [\n            { role: 'system', content: system },\n            { role: 'user', content: user },\n          ],\n          MIN_MAX_TOKENS,\n        )\n      } catch (error) {\n        if ((error as { name?: string }).name === 'AbortError') throw error\n        // Router failure: fail-closed (reject) so an unverified source can't slip in.\n        return acceptOnParseFailure\n          ? { accept: true }\n          : { accept: false, reason: `verifier unavailable: ${(error as Error).message}` }\n      }\n\n      const verdict = parseVerdict(raw)\n      if (verdict) return verdict\n      return acceptOnParseFailure\n        ? { accept: true }\n        : { accept: false, reason: 'verifier returned an unparseable verdict' }\n    },\n  }\n}\n\n/** Parse the verifier's `{accept, reason}` JSON, tolerant of fences / prose. */\nfunction parseVerdict(raw: string): SourceVerdict | null {\n  const text = raw.trim()\n  if (!text) return null\n  const objMatch = text.match(/\\{[\\s\\S]*\\}/)\n  if (!objMatch) return null\n  try {\n    const parsed = JSON.parse(objMatch[0]) as { accept?: unknown; reason?: unknown }\n    if (typeof parsed.accept !== 'boolean') return null\n    if (parsed.accept) return { accept: true }\n    return {\n      accept: false,\n      reason:\n        typeof parsed.reason === 'string' && parsed.reason.trim()\n          ? parsed.reason.trim()\n          : 'rejected by verifier',\n    }\n  } catch {\n    return null\n  }\n}\n","/**\n * Adaptive verifier mode for `runVerifiedResearchLoop`.\n *\n * The cost/quality A/B (`docs/results/cost-quality.md`) found the LLM relevance\n * verifier's cleanliness win is dominated by DE-DUPLICATION — which a\n * deterministic content-hash / canonical-URL check captures at ~none of the LLM\n * premium — and that an LLM check only earns its dollar on the off-scope tail.\n * The honest production move it names is: do the cheap deterministic work first,\n * spend the LLM only where it pays. This module is that driver.\n *\n * Per candidate source the adaptive driver runs THREE stages, cheapest first,\n * and stops at the first that decides:\n *\n *   1. DEDUP ($0, no LLM). Reject a source whose CONTENT (normalized-text hash)\n *      or whose CANONICAL URL matches one already accepted this round or already\n *      in the knowledge base. This is the de-dup the relevance judge was being\n *      paid to do; doing it deterministically is free and exact.\n *\n *   2. HEURISTIC TRIAGE ($0, no LLM). For a unique survivor, a cheap host /\n *      title / length signal classifies it as clearly-keep, clearly-drop, or\n *      AMBIGUOUS. Clear cases are resolved without a model: an authoritative host\n *      (arxiv, *.edu, *.gov, official docs) with a substantial readable body is\n *      kept; an obvious spam/listicle/marketing title or a too-thin body is\n *      dropped. Only genuinely ambiguous survivors fall through.\n *\n *   3. LLM ESCALATION ($, one call). ONLY the ambiguous survivors reach the LLM\n *      `verifySource` — the shipped `createVerifyingResearchDriver` relevance\n *      judge. This is where the verifier earns its premium: the off-scope tail a\n *      cheap rule can't adjudicate.\n *\n * The result is the cost/quality frontier point the doc predicted: most of the\n * cleanliness (dedup + clear drops) at a fraction of the LLM $/calls (only the\n * ambiguous tail pays). It is a real `ResearchDriver` — same contract the\n * two-agent loop already gates on — and reuses `sha256`, the relevance verifier,\n * and the index; it reinvents none of them.\n */\n\nimport { sha256 } from './ids'\nimport type {\n  ResearchSourceProposal,\n  SourceVerdict,\n  SourceVerificationContext,\n} from './two-agent-research-loop'\nimport {\n  createVerifyingResearchDriver,\n  type RouterClient,\n  type TangleRouterOptions,\n  type VerifyingDriverOptions,\n} from './web-research-worker'\n\n/**\n * Canonicalize a URL for duplicate detection: lowercase host, strip a leading\n * `www.`, drop the scheme, the fragment, a trailing slash, and tracking query\n * params (`utm_*`, `ref`, `fbclid`, `gclid`, …). Two URLs that differ only by\n * those decorations canonicalize to the same key, so the dedup stage treats them\n * as the same source. Falls back to the lowercased raw string when the input is\n * not a parseable absolute URL (so non-http identifiers still dedup by equality).\n */\nexport function canonicalizeUrl(uri: string): string {\n  const trimmed = uri.trim()\n  try {\n    const url = new URL(trimmed)\n    const host = url.hostname.toLowerCase().replace(/^www\\./, '')\n    // Keep only non-tracking query params, sorted for stable ordering.\n    const kept: [string, string][] = []\n    for (const [key, value] of url.searchParams) {\n      const lower = key.toLowerCase()\n      if (lower.startsWith('utm_')) continue\n      if (trackingParams.has(lower)) continue\n      kept.push([key, value])\n    }\n    kept.sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n    const query = kept.map(([k, v]) => `${k}=${v}`).join('&')\n    const path = url.pathname.replace(/\\/+$/, '') || '/'\n    return `${host}${path}${query ? `?${query}` : ''}`\n  } catch {\n    return trimmed.toLowerCase()\n  }\n}\n\n/** Tracking / referrer query params dropped during URL canonicalization. */\nconst trackingParams = new Set([\n  'ref',\n  'ref_src',\n  'source',\n  'fbclid',\n  'gclid',\n  'mc_cid',\n  'mc_eid',\n  'igshid',\n  'spm',\n  '_hsenc',\n  '_hsmi',\n])\n\n/**\n * A stable content key for a fetched page: the sha256 of its normalized text\n * (lowercased, punctuation/whitespace collapsed). Two pages whose readable body\n * is the same modulo formatting collide here, so the dedup stage rejects a\n * mirror/syndication of an already-accepted source even when the URL differs.\n */\nexport function contentKey(text: string): string {\n  const normalized = text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .replace(/\\s+/g, ' ')\n    .trim()\n  return sha256(normalized)\n}\n\n/** Why the deterministic dedup stage rejected a candidate (for audit/notes). */\nexport type DedupReason = 'duplicate-url' | 'duplicate-content'\n\n/** The cheap-triage classification of a unique survivor. */\nexport type TriageClass = 'keep' | 'drop' | 'ambiguous'\n\n/** One source's adaptive routing decision, for instrumentation and the doc. */\nexport interface AdaptiveDecision {\n  uri: string\n  /** The stage that decided this source: dedup | heuristic | llm. */\n  stage: 'dedup' | 'heuristic' | 'llm'\n  accepted: boolean\n  /** The triage class assigned (set once past dedup). */\n  triage?: TriageClass\n  reason?: string\n}\n\n/** Running tally of where the adaptive driver spent its decisions. */\nexport interface AdaptiveStats {\n  total: number\n  /** Rejected by deterministic dedup (URL or content). $0. */\n  dedupRejected: number\n  /** Kept by the cheap heuristic without an LLM call. $0. */\n  heuristicKept: number\n  /** Dropped by the cheap heuristic without an LLM call. $0. */\n  heuristicDropped: number\n  /** Escalated to the LLM relevance verifier ($ — the only paid stage). */\n  llmCalls: number\n  /** Of the escalations, how many the LLM accepted. */\n  llmAccepted: number\n  decisions: AdaptiveDecision[]\n}\n\nexport interface AdaptiveDriverOptions {\n  /** Router client for the LLM escalation. Defaults to a live client from env. */\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /** Passed through to the escalation relevance verifier. */\n  verifying?: Pick<VerifyingDriverOptions, 'acceptOnParseFailure'>\n  /**\n   * Hosts an authoritative source lives on. A unique survivor on one of these,\n   * with a substantial body, is KEPT deterministically (no LLM). Suffix-matched\n   * against the canonical host, so `arxiv.org` matches `export.arxiv.org`. The\n   * defaults cover papers, official docs, and standards bodies.\n   */\n  authoritativeHosts?: string[]\n  /**\n   * Title/snippet patterns that mark obvious spam / listicle / marketing — a\n   * unique survivor matching one is DROPPED deterministically (no LLM).\n   */\n  spamPatterns?: RegExp[]\n  /**\n   * Below this many readable chars a survivor is too thin to be a real reference\n   * and is dropped deterministically. Default 400.\n   */\n  minBodyChars?: number\n  /**\n   * A survivor whose body is at or above this many chars AND on an authoritative\n   * host is kept without an LLM call. Default 600.\n   */\n  substantialBodyChars?: number\n  /** Receives each routing decision as it is made (for live instrumentation). */\n  onDecision?: (decision: AdaptiveDecision) => void\n}\n\n/** Default authoritative host suffixes — papers, official docs, standards. */\nconst defaultAuthoritativeHosts = [\n  'arxiv.org',\n  'aclanthology.org',\n  'openreview.net',\n  'dl.acm.org',\n  'ieeexplore.ieee.org',\n  'nature.com',\n  'science.org',\n  'pubmed.ncbi.nlm.nih.gov',\n  'ncbi.nlm.nih.gov',\n  '.edu',\n  '.gov',\n  'docs.python.org',\n  'pytorch.org',\n  'tensorflow.org',\n  'huggingface.co',\n  'github.com',\n  'developer.mozilla.org',\n  'wikipedia.org',\n  'w3.org',\n  'ietf.org',\n  'rfc-editor.org',\n]\n\n/** Default spam/listicle/marketing title patterns. */\nconst defaultSpamPatterns = [\n  /\\bbuy\\b.*\\b(cheap|now|deal|sale|discount)\\b/i,\n  /\\b\\d+\\s+(things|ways|reasons|tips|tricks|secrets|hacks)\\b.*\\b(you|that|will)\\b/i,\n  /\\bshock(ing|ed)?\\b/i,\n  /\\bclickbait\\b/i,\n  /!!!|\\$\\$\\$/,\n  /\\b(coupon|promo code|affiliate|sponsored)\\b/i,\n  /\\bbest .* (of \\d{4}|in \\d{4})\\b/i,\n]\n\n/**\n * Classify a UNIQUE survivor (already past dedup) with cheap host/title/length\n * signals only — no LLM. Returns `keep`, `drop`, or `ambiguous`. `ambiguous` is\n * the residue the LLM is reserved for: on-topic-looking pages on unknown hosts\n * with a plausible body, which a host/title rule cannot adjudicate.\n */\nexport function triageSource(\n  source: ResearchSourceProposal,\n  options: {\n    authoritativeHosts: string[]\n    spamPatterns: RegExp[]\n    minBodyChars: number\n    substantialBodyChars: number\n  },\n): { triage: TriageClass; reason: string } {\n  const titleAndSnippet = `${source.title ?? ''} ${\n    typeof source.metadata?.snippet === 'string' ? source.metadata.snippet : ''\n  }`.trim()\n  const bodyLen = source.text.trim().length\n\n  // Clear DROP: obvious spam/listicle/marketing title, OR a too-thin body that\n  // can't be a real reference.\n  for (const pattern of options.spamPatterns) {\n    if (pattern.test(titleAndSnippet)) {\n      return { triage: 'drop', reason: `spam/listicle title (${pattern.source})` }\n    }\n  }\n  if (bodyLen < options.minBodyChars) {\n    return { triage: 'drop', reason: `thin body (${bodyLen} < ${options.minBodyChars} chars)` }\n  }\n\n  // Clear KEEP: an authoritative host with a substantial readable body. The host\n  // is a strong prior for a real reference; the length rules out a stub page.\n  const host = hostOf(source.uri)\n  const authoritative =\n    host.length > 0 && options.authoritativeHosts.some((suffix) => hostMatches(host, suffix))\n  if (authoritative && bodyLen >= options.substantialBodyChars) {\n    return { triage: 'keep', reason: `authoritative host ${host} + substantial body (${bodyLen})` }\n  }\n\n  // Everything else is AMBIGUOUS — an unknown host with a plausible body. This\n  // is exactly the off-scope tail the LLM relevance judge is reserved for.\n  return { triage: 'ambiguous', reason: `unknown host ${host || '(none)'}, body ${bodyLen} chars` }\n}\n\nfunction hostOf(uri: string): string {\n  try {\n    return new URL(uri.trim()).hostname.toLowerCase().replace(/^www\\./, '')\n  } catch {\n    return ''\n  }\n}\n\n/** Suffix host match: `.edu` matches `mit.edu`; `arxiv.org` matches `export.arxiv.org`. */\nfunction hostMatches(host: string, suffix: string): boolean {\n  if (suffix.startsWith('.')) return host.endsWith(suffix) || host === suffix.slice(1)\n  return host === suffix || host.endsWith(`.${suffix}`)\n}\n\nexport interface AdaptiveResearchDriver {\n  verifySource(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<SourceVerdict>\n  /** Live tally of where decisions were spent — the cost/quality instrumentation. */\n  stats(): AdaptiveStats\n}\n\n/**\n * Build the adaptive verifier. The deterministic stages (dedup + heuristic\n * triage) cost $0; only AMBIGUOUS survivors escalate to the LLM relevance\n * verifier. `stats()` exposes where every decision was spent so the A/B can read\n * the LLM $/calls the adaptive driver saved against the cleanliness it kept.\n *\n * Dedup state is kept on the driver instance: it tracks the canonical URLs and\n * content hashes it has ACCEPTED, plus those it sees in the verification\n * context's `acceptedThisRound` and the KB index. Use one driver per loop run.\n */\nexport function createAdaptiveResearchDriver(\n  options: AdaptiveDriverOptions = {},\n): AdaptiveResearchDriver {\n  const authoritativeHosts = options.authoritativeHosts ?? defaultAuthoritativeHosts\n  const spamPatterns = options.spamPatterns ?? defaultSpamPatterns\n  const minBodyChars = Math.max(1, options.minBodyChars ?? 400)\n  const substantialBodyChars = Math.max(minBodyChars, options.substantialBodyChars ?? 600)\n\n  // The shipped LLM relevance verifier — the ONLY paid stage, reused, not rebuilt.\n  const relevance = createVerifyingResearchDriver({\n    router: options.router,\n    router_options: options.router_options,\n    acceptOnParseFailure: options.verifying?.acceptOnParseFailure,\n  })\n\n  // Dedup memory across the run: every URL/content key this driver ACCEPTED.\n  const acceptedUrlKeys = new Set<string>()\n  const acceptedContentKeys = new Set<string>()\n\n  const stats: AdaptiveStats = {\n    total: 0,\n    dedupRejected: 0,\n    heuristicKept: 0,\n    heuristicDropped: 0,\n    llmCalls: 0,\n    llmAccepted: 0,\n    decisions: [],\n  }\n\n  function record(decision: AdaptiveDecision): void {\n    stats.decisions.push(decision)\n    options.onDecision?.(decision)\n  }\n\n  return {\n    async verifySource(source, ctx): Promise<SourceVerdict> {\n      stats.total += 1\n      const urlKey = canonicalizeUrl(source.uri)\n      const cKey = contentKey(source.text)\n\n      // ---- STAGE 1: DETERMINISTIC DEDUP ($0) ----------------------------------\n      // Seed the dup sets from what the loop already accepted this round AND from\n      // the KB index, so a duplicate of an existing source is caught even if this\n      // driver instance hasn't seen it yet.\n      const roundUrlKeys = new Set(\n        ctx.acceptedThisRound.map((accepted) => canonicalizeUrl(accepted.uri)),\n      )\n      const roundContentKeys = new Set(\n        ctx.acceptedThisRound.map((accepted) => contentKey(accepted.text)),\n      )\n      const indexUrlKeys = new Set(\n        ctx.index.sources.flatMap((indexed) =>\n          typeof indexed.metadata?.originalUri === 'string'\n            ? [canonicalizeUrl(indexed.metadata.originalUri)]\n            : [],\n        ),\n      )\n      const dupUrl =\n        acceptedUrlKeys.has(urlKey) || roundUrlKeys.has(urlKey) || indexUrlKeys.has(urlKey)\n      const dupContent = acceptedContentKeys.has(cKey) || roundContentKeys.has(cKey)\n      if (dupUrl || dupContent) {\n        stats.dedupRejected += 1\n        const reason: DedupReason = dupUrl ? 'duplicate-url' : 'duplicate-content'\n        record({ uri: source.uri, stage: 'dedup', accepted: false, reason })\n        return { accept: false, reason: `dedup: ${reason}` }\n      }\n\n      // ---- STAGE 2: CHEAP HEURISTIC TRIAGE ($0) -------------------------------\n      const { triage, reason } = triageSource(source, {\n        authoritativeHosts,\n        spamPatterns,\n        minBodyChars,\n        substantialBodyChars,\n      })\n      if (triage === 'keep') {\n        stats.heuristicKept += 1\n        acceptedUrlKeys.add(urlKey)\n        acceptedContentKeys.add(cKey)\n        record({ uri: source.uri, stage: 'heuristic', accepted: true, triage, reason })\n        return { accept: true }\n      }\n      if (triage === 'drop') {\n        stats.heuristicDropped += 1\n        record({ uri: source.uri, stage: 'heuristic', accepted: false, triage, reason })\n        return { accept: false, reason: `heuristic drop: ${reason}` }\n      }\n\n      // ---- STAGE 3: LLM ESCALATION ($ — ambiguous tail only) ------------------\n      stats.llmCalls += 1\n      const verdict = await relevance.verifySource(source, ctx)\n      if (verdict.accept) {\n        stats.llmAccepted += 1\n        acceptedUrlKeys.add(urlKey)\n        acceptedContentKeys.add(cKey)\n      }\n      record({\n        uri: source.uri,\n        stage: 'llm',\n        accepted: verdict.accept,\n        triage,\n        reason: verdict.accept ? 'llm accepted' : verdict.reason,\n      })\n      return verdict\n    },\n    stats(): AdaptiveStats {\n      return {\n        ...stats,\n        decisions: [...stats.decisions],\n      }\n    },\n  }\n}\n","import {\n  type AgentCandidateKnowledgeRef,\n  sha256DigestSchema,\n} from '@tangle-network/agent-interface'\n\nimport {\n  type KnowledgeImprovementCandidateRef,\n  KnowledgeImprovementCandidateRefSchema,\n} from './kb-improvement'\n\n/** Convert a measured knowledge candidate into the shared review and execution identity. */\nexport function toAgentCandidateKnowledgeRef(\n  candidate: KnowledgeImprovementCandidateRef,\n): AgentCandidateKnowledgeRef {\n  const parsed = KnowledgeImprovementCandidateRefSchema.parse(candidate)\n  return {\n    ...parsed,\n    goalHash: prefixedDigest(parsed.goalHash),\n    baseHash: prefixedDigest(parsed.baseHash),\n    candidateHash: prefixedDigest(parsed.candidateHash),\n    evidenceHash: prefixedDigest(parsed.evidenceHash),\n    promotionPlanHash: prefixedDigest(parsed.promotionPlanHash),\n  }\n}\n\n/** Recover agent-knowledge's candidate identity from the shared contract. */\nexport function fromAgentCandidateKnowledgeRef(\n  candidate: AgentCandidateKnowledgeRef,\n): KnowledgeImprovementCandidateRef {\n  return KnowledgeImprovementCandidateRefSchema.parse({\n    ...candidate,\n    goalHash: rawDigest(candidate.goalHash),\n    baseHash: rawDigest(candidate.baseHash),\n    candidateHash: rawDigest(candidate.candidateHash),\n    evidenceHash: rawDigest(candidate.evidenceHash),\n    promotionPlanHash: rawDigest(candidate.promotionPlanHash),\n  })\n}\n\nfunction prefixedDigest(value: string) {\n  return sha256DigestSchema.parse(`sha256:${value}`)\n}\n\nfunction rawDigest(value: string): string {\n  return sha256DigestSchema.parse(value).slice('sha256:'.length)\n}\n","import { createHash } from 'node:crypto'\nimport { cp, lstat, mkdir, mkdtemp, rm, stat } from 'node:fs/promises'\nimport { tmpdir } from 'node:os'\nimport { dirname, isAbsolute, join, relative, resolve, sep } from 'node:path'\nimport {\n  canonicalJson,\n  contentHash,\n  type RunRecord,\n  validateRunRecord,\n} from '@tangle-network/agent-eval'\nimport {\n  type AgentImprovementActivation,\n  type AgentImprovementActivationResult,\n  agentImprovementActivationResultSchema,\n  agentImprovementActivationSchema,\n  canonicalCandidateDigest,\n  omitTopLevelDigest,\n  type Sha256Digest,\n  sha256DigestSchema,\n} from '@tangle-network/agent-interface'\nimport { z } from 'zod'\nimport {\n  isMissingFile,\n  listRegularFilesWithinRoot,\n  readRegularFileWithinRoot,\n  renameDurable,\n  withSafeDirectory,\n  writeJsonDurableWithinRoot,\n} from './durable-fs'\nimport type {\n  BuildEvalKnowledgeBundleOptions,\n  EvalKnowledgeBundleBuildResult,\n  KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport {\n  applyKnowledgeFileTransaction,\n  assertKnowledgeMutationPath,\n  finishKnowledgeFileTransaction,\n  type KnowledgeFileMutation,\n  type KnowledgeFileTransaction,\n  type KnowledgeFileTransactionPlanEntry,\n  knowledgeFileTransactionPlanHash,\n  prepareKnowledgeFileTransaction,\n  rollbackKnowledgeFileTransaction,\n} from './file-transaction'\nimport { sha256, slugify, stableId } from './ids'\nimport { buildKnowledgeIndex, writeKnowledgeIndex } from './indexer'\nimport { acquireDurableFileLock, withKnowledgeMutation, withKnowledgeRead } from './mutation-lock'\nimport {\n  type KnowledgeBaseQualityOptions,\n  type KnowledgeBaseQualityReport,\n  scoreKnowledgeBaseIndex,\n} from './rag-eval'\nimport {\n  type RagKnowledgeImprovementPhase,\n  type RagKnowledgeResearchOptions,\n  type RagKnowledgeUpdateInput,\n  type RagKnowledgeUpdateResult,\n  type RunRagKnowledgeImprovementLoopOptions,\n  type RunRagKnowledgeImprovementLoopResult,\n  runRagKnowledgeImprovementLoop,\n} from './rag-improvement-loop'\nimport { readinessFor } from './readiness-helpers'\nimport type { RunKnowledgeResearchLoopOptions } from './research-loop'\nimport type { RunRetrievalImprovementLoopOptions } from './retrieval-eval'\nimport { layoutFor } from './store'\nimport type { KnowledgeIndex } from './types'\nimport {\n  type ValidateKnowledgeOptions,\n  type ValidateKnowledgeResult,\n  validateKnowledgeIndex,\n} from './validate'\n\nexport type KnowledgeImprovementStatus =\n  | 'running'\n  | 'candidate-ready'\n  | 'promoted'\n  | 'rejected'\n  | 'blocked'\n\ninterface KnowledgeImprovementMetricProvenanceBase {\n  evaluator: string\n  version: string\n}\n\nexport type KnowledgeImprovementMetricProvenance =\n  | (KnowledgeImprovementMetricProvenanceBase & {\n      method: 'deterministic'\n    })\n  | (KnowledgeImprovementMetricProvenanceBase & {\n      method: 'sampled' | 'composite'\n      corpusHash: string\n      runRecords: RunRecord[]\n    })\n  | (KnowledgeImprovementMetricProvenanceBase & {\n      method: 'model'\n      model: string\n      corpusHash: string\n      runRecords: RunRecord[]\n    })\n\nexport interface KnowledgeImprovementMetric {\n  score: number\n  passed: boolean\n  dimensions?: Record<string, number>\n  notes?: string\n  provenance: KnowledgeImprovementMetricProvenance\n}\n\nexport interface KnowledgeImprovementEvaluationInput {\n  runId: string\n  iteration: number\n  root: string\n  baselineRoot: string\n  candidateRoot: string\n  baselineIndex: KnowledgeIndex\n  candidateIndex: KnowledgeIndex\n  baseHash: string\n  candidateHash: string\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  kbQuality: KnowledgeBaseQualityReport\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n  signal?: AbortSignal\n}\n\nexport type KnowledgeImprovementEvaluator = (\n  input: KnowledgeImprovementEvaluationInput,\n) => Promise<KnowledgeImprovementMetric> | KnowledgeImprovementMetric\n\nexport interface KnowledgeImprovementCandidateRecord {\n  iteration: number\n  candidateId: string\n  baseHash: string\n  candidateHash?: string\n  evidenceHash?: string\n  promotionPlanHash?: string\n  status: KnowledgeImprovementStatus\n  createdAt: string\n  updatedAt: string\n}\n\nexport interface KnowledgeImprovementRunState {\n  runId: string\n  root: string\n  goal: string\n  status: KnowledgeImprovementStatus\n  baseHash: string\n  createdAt: string\n  updatedAt: string\n  ownerId?: string\n  candidates: KnowledgeImprovementCandidateRecord[]\n  promotedCandidateId?: string\n  blockedReason?: string\n}\n\nexport interface KnowledgeImprovementResult {\n  runId: string\n  state: KnowledgeImprovementRunState\n  candidate?: KnowledgeImprovementCandidateRecord\n  evaluation?: KnowledgeImprovementMetric\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n  promoted: boolean\n  blocked: boolean\n}\n\nexport type KnowledgeImprovementTarget = 'candidate' | 'baseline'\n\nexport interface KnowledgeImprovementMutationReceipt {\n  target: KnowledgeImprovementTarget\n  beforeHash: string\n  afterHash: string\n  changed: boolean\n  transactionId: string | null\n  recovered: boolean\n}\n\nexport interface KnowledgeImprovementMutationResult extends KnowledgeImprovementResult {\n  candidate: KnowledgeImprovementCandidateRecord\n  mutation: KnowledgeImprovementMutationReceipt\n  activationResult?: AgentImprovementActivationResult\n}\n\nexport interface KnowledgeImprovementActivationPersistence {\n  activation: AgentImprovementActivation\n  attemptedAt: string\n  identity: string\n  /** May run again after interruption; keep this deterministic and free of external side effects. */\n  createResult(\n    mutation: KnowledgeImprovementMutationReceipt,\n  ): Promise<AgentImprovementActivationResult> | AgentImprovementActivationResult\n}\n\nconst digestSchema = z.string().regex(/^[a-f0-9]{64}$/)\nconst runIdSchema = z.string().min(1).max(2_048)\nconst safePathSegmentSchema = z\n  .string()\n  .min(1)\n  .max(128)\n  .regex(/^[A-Za-z0-9][A-Za-z0-9._-]*$/)\n\nconst knowledgeImprovementMutationReceiptSchema = z\n  .object({\n    target: z.enum(['candidate', 'baseline']),\n    beforeHash: digestSchema,\n    afterHash: digestSchema,\n    changed: z.boolean(),\n    transactionId: z.string().uuid().nullable(),\n    recovered: z.boolean(),\n  })\n  .strict()\n\nconst knowledgeImprovementActivationRecordSchema = z\n  .object({\n    kind: z.literal('knowledge-improvement-activation-result'),\n    candidateId: safePathSegmentSchema,\n    mutation: knowledgeImprovementMutationReceiptSchema,\n    result: agentImprovementActivationResultSchema,\n  })\n  .strict()\ntype KnowledgeImprovementActivationRecord = z.infer<\n  typeof knowledgeImprovementActivationRecordSchema\n>\nconst improvementStatusSchema = z.enum([\n  'running',\n  'candidate-ready',\n  'promoted',\n  'rejected',\n  'blocked',\n])\nconst runRecordSchema = z.custom<RunRecord>((value) => {\n  try {\n    validateRunRecord(value)\n    return true\n  } catch {\n    return false\n  }\n}, 'invalid agent-eval RunRecord')\nconst deterministicMetricProvenanceSchema = z\n  .object({\n    evaluator: z.string().min(1),\n    version: z.string().min(1),\n    method: z.literal('deterministic'),\n  })\n  .strict()\nconst measuredMetricProvenanceSchema = z\n  .object({\n    evaluator: z.string().min(1),\n    version: z.string().min(1),\n    method: z.enum(['sampled', 'composite']),\n    corpusHash: digestSchema,\n    runRecords: z.array(runRecordSchema).min(1),\n  })\n  .strict()\nconst modelMetricProvenanceSchema = z\n  .object({\n    evaluator: z.string().min(1),\n    version: z.string().min(1),\n    method: z.literal('model'),\n    model: z.string().min(1),\n    corpusHash: digestSchema,\n    runRecords: z.array(runRecordSchema).min(1),\n  })\n  .strict()\nconst improvementMetricSchema = z\n  .object({\n    score: z.number().finite().min(0).max(1),\n    passed: z.boolean(),\n    dimensions: z.record(z.string(), z.number().finite()).optional(),\n    notes: z.string().optional(),\n    provenance: z.discriminatedUnion('method', [\n      deterministicMetricProvenanceSchema,\n      measuredMetricProvenanceSchema,\n      modelMetricProvenanceSchema,\n    ]),\n  })\n  .strict()\n  .superRefine((metric, context) => {\n    if (metric.provenance.method === 'deterministic') return\n    const actualCorpusHash = contentHash(metric.provenance.runRecords)\n    if (actualCorpusHash !== metric.provenance.corpusHash) {\n      context.addIssue({\n        code: 'custom',\n        path: ['provenance', 'corpusHash'],\n        message: 'metric corpus hash must bind the complete RunRecord array',\n      })\n    }\n  })\nconst candidateRecordSchema = z\n  .object({\n    iteration: z.number().int().positive(),\n    candidateId: safePathSegmentSchema,\n    baseHash: digestSchema,\n    candidateHash: digestSchema.optional(),\n    evidenceHash: digestSchema.optional(),\n    promotionPlanHash: digestSchema.optional(),\n    status: improvementStatusSchema,\n    createdAt: z.iso.datetime(),\n    updatedAt: z.iso.datetime(),\n  })\n  .strict()\n\nexport const KnowledgeImprovementRunStateSchema = z\n  .object({\n    runId: runIdSchema,\n    root: z.string().min(1),\n    goal: z.string().min(1),\n    status: improvementStatusSchema,\n    baseHash: digestSchema,\n    createdAt: z.iso.datetime(),\n    updatedAt: z.iso.datetime(),\n    ownerId: z.string().min(1).optional(),\n    candidates: z.array(candidateRecordSchema),\n    promotedCandidateId: safePathSegmentSchema.optional(),\n    blockedReason: z.string().min(1).optional(),\n  })\n  .strict()\n  .superRefine((state, context) => {\n    const candidateIds = new Set<string>()\n    for (const [index, candidate] of state.candidates.entries()) {\n      if (candidateIds.has(candidate.candidateId)) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index, 'candidateId'],\n          message: 'candidate ids must be unique within an improvement run',\n        })\n      }\n      candidateIds.add(candidate.candidateId)\n      if (candidate.baseHash !== state.baseHash) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index, 'baseHash'],\n          message: 'candidate base hash must match its improvement run',\n        })\n      }\n      if (candidate.status === 'candidate-ready') {\n        if (!candidate.candidateHash || !candidate.evidenceHash || !candidate.promotionPlanHash) {\n          context.addIssue({\n            code: 'custom',\n            path: ['candidates', index],\n            message: 'ready candidates require content, evidence, and promotion-plan identities',\n          })\n        }\n      }\n      if (\n        candidate.status === 'promoted' &&\n        (!candidate.candidateHash || !candidate.evidenceHash || !candidate.promotionPlanHash)\n      ) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index],\n          message: 'promoted candidates require content, evidence, and promotion-plan identities',\n        })\n      }\n      if (\n        candidate.status === 'promoted' &&\n        Boolean(candidate.evidenceHash) !== Boolean(candidate.promotionPlanHash)\n      ) {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index],\n          message: 'promoted candidate evidence and promotion-plan identities must appear together',\n        })\n      }\n      if (candidate.status === 'promoted' && state.status !== 'promoted') {\n        context.addIssue({\n          code: 'custom',\n          path: ['candidates', index, 'status'],\n          message: 'only a promoted run may contain a promoted candidate',\n        })\n      }\n    }\n    if (state.status === 'promoted') {\n      const promoted = state.candidates.filter(\n        (candidate) => candidate.candidateId === state.promotedCandidateId,\n      )\n      if (promoted.length !== 1 || promoted[0]?.status !== 'promoted') {\n        context.addIssue({\n          code: 'custom',\n          path: ['promotedCandidateId'],\n          message: 'promoted state must identify exactly one promoted candidate',\n        })\n      }\n    } else if (state.promotedCandidateId !== undefined) {\n      context.addIssue({\n        code: 'custom',\n        path: ['promotedCandidateId'],\n        message: 'only a promoted run may identify a promoted candidate',\n      })\n    }\n    if (\n      state.status === 'candidate-ready' &&\n      state.candidates.filter((candidate) => candidate.status === 'candidate-ready').length !== 1\n    ) {\n      context.addIssue({\n        code: 'custom',\n        path: ['status'],\n        message: 'candidate-ready state must contain exactly one ready candidate',\n      })\n    }\n    if (state.status === 'blocked' && state.blockedReason === undefined) {\n      context.addIssue({\n        code: 'custom',\n        path: ['blockedReason'],\n        message: 'blocked state must include a reason',\n      })\n    }\n  })\n\nexport const KnowledgeImprovementEvidenceSchema = z\n  .object({\n    kind: z.literal('knowledge-improvement-evidence'),\n    runId: runIdSchema,\n    candidateId: safePathSegmentSchema,\n    iteration: z.number().int().positive(),\n    goalHash: digestSchema,\n    baseHash: digestSchema,\n    candidateHash: digestSchema,\n    promotionPlanHash: digestSchema,\n    validation: z.unknown(),\n    readiness: z.unknown().nullable(),\n    kbQuality: z.unknown(),\n    evaluation: improvementMetricSchema,\n    lifecycle: z.unknown().nullable(),\n  })\n  .strict()\n\nexport type KnowledgeImprovementEvidence = z.infer<typeof KnowledgeImprovementEvidenceSchema>\n\n/** Portable identity of one measured candidate. Paths and mutable run state are deliberately excluded. */\nexport const KnowledgeImprovementCandidateRefSchema = z\n  .object({\n    kind: z.literal('knowledge-improvement-candidate'),\n    runId: runIdSchema,\n    candidateId: safePathSegmentSchema,\n    goalHash: digestSchema,\n    baseHash: digestSchema,\n    candidateHash: digestSchema,\n    evidenceHash: digestSchema,\n    promotionPlanHash: digestSchema,\n  })\n  .strict()\n\nexport type KnowledgeImprovementCandidateRef = z.infer<\n  typeof KnowledgeImprovementCandidateRefSchema\n>\n\nexport interface PromoteKnowledgeCandidateOptions {\n  root: string\n  candidate: KnowledgeImprovementCandidateRef\n  activation?: KnowledgeImprovementActivationPersistence\n  ownerId?: string\n  leaseTtlMs?: number\n  now?: () => Date\n  onState?: (state: KnowledgeImprovementRunState) => Promise<void> | void\n}\n\nexport type RestoreKnowledgeCandidateBaselineOptions = PromoteKnowledgeCandidateOptions\n\nexport interface LoadKnowledgeImprovementActivationResultOptions {\n  root: string\n  candidate: KnowledgeImprovementCandidateRef\n  activation: AgentImprovementActivation\n  identity: string\n}\n\nexport interface UseKnowledgeImprovementCandidateOptions {\n  root: string\n  candidate: KnowledgeImprovementCandidateRef\n}\n\nexport interface ResolvedKnowledgeImprovementComparisonSnapshot {\n  root: string\n  hash: string\n}\n\nexport interface ResolvedKnowledgeImprovementComparison {\n  reference: KnowledgeImprovementCandidateRef\n  evaluation: KnowledgeImprovementMetric\n  baseline: ResolvedKnowledgeImprovementComparisonSnapshot\n  candidate: ResolvedKnowledgeImprovementComparisonSnapshot\n}\n\nexport interface ResolvedKnowledgeImprovementCandidate {\n  root: string\n  candidate: KnowledgeImprovementCandidateRef\n  evaluation: KnowledgeImprovementMetric\n}\n\nexport interface KnowledgeImprovementRetrievalOptions\n  extends Omit<RunRetrievalImprovementLoopOptions, 'index' | 'runDir'> {\n  runDir?: RunRetrievalImprovementLoopOptions['runDir']\n}\n\nexport interface KnowledgeImprovementUpdateInput extends RagKnowledgeUpdateInput {\n  runId: string\n  iteration: number\n  candidateId: string\n  root: string\n  baselineRoot: string\n  candidateRoot: string\n  baseHash: string\n}\n\nexport type KnowledgeImprovementUpdate = (\n  input: KnowledgeImprovementUpdateInput,\n) => Promise<RagKnowledgeUpdateResult> | RagKnowledgeUpdateResult\n\nexport interface KnowledgeImprovementOptions {\n  root: string\n  goal: string\n  runId?: string\n  ownerId?: string\n  leaseTtlMs?: number\n  resume?: boolean\n  maxCandidates?: number\n  candidateResearchIterations?: number\n  strict?: ValidateKnowledgeOptions['strict']\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  kbQuality?: KnowledgeBaseQualityOptions\n  step?: RunKnowledgeResearchLoopOptions['step']\n  knowledgeResearch?: Omit<RagKnowledgeResearchOptions, 'root'>\n  retrieval?: KnowledgeImprovementRetrievalOptions\n  diagnose?: NonNullable<RunRagKnowledgeImprovementLoopOptions['diagnose']>\n  acquireKnowledge?: NonNullable<RunRagKnowledgeImprovementLoopOptions['acquireKnowledge']>\n  updateKnowledge?: KnowledgeImprovementUpdate\n  evaluateAnswers?: NonNullable<RunRagKnowledgeImprovementLoopOptions['evaluateAnswers']>\n  decidePromotion?: NonNullable<RunRagKnowledgeImprovementLoopOptions['promote']>\n  enabledPhases?: readonly RagKnowledgeImprovementPhase[]\n  requiredPhases?: readonly RagKnowledgeImprovementPhase[]\n  evaluate?: KnowledgeImprovementEvaluator\n  signal?: AbortSignal\n  now?: () => Date\n  onState?: (state: KnowledgeImprovementRunState) => Promise<void> | void\n}\n\ninterface LeaseHandle {\n  ownerId: string\n  assertOwned(): void\n  release(): Promise<void>\n}\n\nconst DEFAULT_LEASE_TTL_MS = 15 * 60 * 1000\nconst UPDATE_PHASES: readonly RagKnowledgeImprovementPhase[] = [\n  'knowledge-acquisition',\n  'knowledge-update',\n]\nconst EVALUATION_PHASES: readonly RagKnowledgeImprovementPhase[] = [\n  'retrieval-tuning',\n  'gap-diagnosis',\n  'answer-quality',\n  'promotion',\n]\n\nexport function knowledgeImprovementRunId(root: string, goal: string): string {\n  return stableId('kimpr', `${root}:${goal}`)\n}\n\nexport function knowledgeImprovementRunDir(root: string, runId: string): string {\n  const parsedRunId = runIdSchema.parse(runId)\n  const safeRunId = safePathSegmentSchema.safeParse(parsedRunId)\n  const runSegment = safeRunId.success\n    ? safeRunId.data\n    : `${slugify(parsedRunId).slice(0, 72)}-${sha256(parsedRunId).slice(0, 16)}`\n  const improvementsDir = join(layoutFor(root).cacheDir, 'improvements')\n  const runDir = join(improvementsDir, runSegment)\n  const resolvedImprovementsDir = resolve(improvementsDir)\n  const resolvedRunDir = resolve(runDir)\n  if (!resolvedRunDir.startsWith(`${resolvedImprovementsDir}${sep}`)) {\n    throw new Error('knowledge improvement run directory escaped its root')\n  }\n  return runDir\n}\n\nasync function withKnowledgeImprovementRun<T>(\n  root: string,\n  runId: string,\n  create: boolean,\n  use: (runDir: string) => Promise<T> | T,\n): Promise<T> {\n  const runDir = knowledgeImprovementRunDir(root, runId)\n  const relativePath = descendantPath(root, runDir)\n  if (!relativePath) throw new Error('knowledge improvement run directory escaped its root')\n  return withSafeDirectory(root, relativePath, create, async (openedRunDir) => {\n    const result = await use(openedRunDir)\n    const openedIdentity = await stat(openedRunDir)\n    const currentIdentity = await withSafeDirectory(root, relativePath, false, (currentRunDir) =>\n      stat(currentRunDir),\n    )\n    if (openedIdentity.dev !== currentIdentity.dev || openedIdentity.ino !== currentIdentity.ino) {\n      throw new Error('knowledge improvement run directory changed during use')\n    }\n    return result\n  })\n}\n\nexport async function loadKnowledgeImprovementState(\n  root: string,\n  runId: string,\n): Promise<KnowledgeImprovementRunState | null> {\n  const expectedRunId = runIdSchema.parse(runId)\n  try {\n    return await withKnowledgeImprovementRun(root, expectedRunId, false, (runDir) =>\n      loadKnowledgeImprovementStateFromRun(root, expectedRunId, runDir),\n    )\n  } catch (error) {\n    if (isMissingFile(error)) return null\n    throw error\n  }\n}\n\n/** Load the durable result for one exact activation without changing knowledge or run state. */\nexport async function loadKnowledgeImprovementActivationResult(\n  options: LoadKnowledgeImprovementActivationResultOptions,\n): Promise<AgentImprovementActivationResult | null> {\n  assertExactCandidatePlatform()\n  const candidate = Object.freeze(KnowledgeImprovementCandidateRefSchema.parse(options.candidate))\n  const activation = verifyCanonicalKnowledgeActivation(options.activation)\n  const target = targetForKnowledgeActivation(activation)\n  assertKnowledgeActivationAuthority(activation, candidate, target, options.identity)\n  return withKnowledgeImprovementRun(options.root, candidate.runId, false, async (runDir) => {\n    const record = await loadKnowledgeActivationRecord(\n      runDir,\n      candidate,\n      activation,\n      target,\n      options.identity,\n    )\n    return record?.result ?? null\n  })\n}\n\nasync function loadKnowledgeImprovementStateFromRun(\n  root: string,\n  runId: string,\n  runDir: string,\n): Promise<KnowledgeImprovementRunState> {\n  const stateFile = await readRegularFileWithinRoot(runDir, 'state.json')\n  const raw = JSON.parse(stateFile.bytes.toString('utf8')) as unknown\n  const state = KnowledgeImprovementRunStateSchema.parse(raw) as KnowledgeImprovementRunState\n  if (state.runId !== runId) {\n    throw new Error('knowledge improvement state does not match the requested run')\n  }\n  if (resolve(state.root) !== resolve(root)) {\n    throw new Error('knowledge improvement state does not match the requested root')\n  }\n  for (const candidate of state.candidates) {\n    if (candidate.status === 'running') await assertCandidateWorkspace(runDir, candidate)\n  }\n  return state\n}\n\n/** Freeze the exact knowledge bytes and measured evidence a later approval may promote. */\nexport function knowledgeImprovementCandidateRef(\n  result: Pick<KnowledgeImprovementResult, 'runId' | 'state' | 'candidate'>,\n): KnowledgeImprovementCandidateRef {\n  if (!result.candidate) throw new Error('knowledge improvement result has no candidate')\n  return candidateRefFor(result.runId, result.state, result.candidate)\n}\n\n/** Use both frozen sides of one measured comparison in isolated, integrity-checked copies. */\nexport async function withKnowledgeImprovementComparison<T>(\n  options: UseKnowledgeImprovementCandidateOptions,\n  use: (comparison: ResolvedKnowledgeImprovementComparison) => Promise<T> | T,\n): Promise<T> {\n  assertExactCandidatePlatform()\n  const reference = Object.freeze(KnowledgeImprovementCandidateRefSchema.parse(options.candidate))\n  return withKnowledgeImprovementRun(options.root, reference.runId, false, async (runDir) => {\n    const state = await loadKnowledgeImprovementStateFromRun(options.root, reference.runId, runDir)\n    return withMeasuredCandidateSnapshot(options.root, runDir, state, reference, (resolved) =>\n      withBaselineSnapshot(runDir, reference.baseHash, (baselineRoot) =>\n        withIsolatedKnowledgeCopy(baselineRoot, reference.baseHash, 'baseline', (baseline) =>\n          withIsolatedKnowledgeCopy(\n            resolved.root,\n            reference.candidateHash,\n            'candidate',\n            (candidate) =>\n              use(\n                Object.freeze({\n                  reference,\n                  evaluation: immutableJsonValue(structuredClone(resolved.evidence.evaluation)),\n                  baseline: Object.freeze({ root: baseline, hash: reference.baseHash }),\n                  candidate: Object.freeze({ root: candidate, hash: reference.candidateHash }),\n                }),\n              ),\n          ),\n        ),\n      ),\n    )\n  })\n}\n\n/** Use the frozen candidate side of one measured comparison. */\nexport async function withKnowledgeImprovementCandidate<T>(\n  options: UseKnowledgeImprovementCandidateOptions,\n  use: (candidate: ResolvedKnowledgeImprovementCandidate) => Promise<T> | T,\n): Promise<T> {\n  assertExactCandidatePlatform()\n  const candidateRef = Object.freeze(\n    KnowledgeImprovementCandidateRefSchema.parse(options.candidate),\n  )\n  return withKnowledgeImprovementRun(options.root, candidateRef.runId, false, async (runDir) => {\n    const state = await loadKnowledgeImprovementStateFromRun(\n      options.root,\n      candidateRef.runId,\n      runDir,\n    )\n    return withMeasuredCandidateSnapshot(options.root, runDir, state, candidateRef, (resolved) =>\n      withIsolatedKnowledgeCopy(resolved.root, candidateRef.candidateHash, 'candidate', (root) =>\n        use(\n          Object.freeze({\n            root,\n            candidate: candidateRef,\n            evaluation: immutableJsonValue(structuredClone(resolved.evidence.evaluation)),\n          }),\n        ),\n      ),\n    )\n  })\n}\n\n/** Promote one previously measured candidate without rerunning research or evaluation. */\nexport async function promoteKnowledgeCandidate(\n  options: PromoteKnowledgeCandidateOptions,\n): Promise<KnowledgeImprovementMutationResult> {\n  return transitionKnowledgeCandidate(options, 'candidate')\n}\n\n/** Restore the frozen baseline paired with one previously measured candidate. */\nexport async function restoreKnowledgeCandidateBaseline(\n  options: RestoreKnowledgeCandidateBaselineOptions,\n): Promise<KnowledgeImprovementMutationResult> {\n  return transitionKnowledgeCandidate(options, 'baseline')\n}\n\nasync function transitionKnowledgeCandidate(\n  options: PromoteKnowledgeCandidateOptions,\n  target: KnowledgeImprovementTarget,\n): Promise<KnowledgeImprovementMutationResult> {\n  assertExactCandidatePlatform()\n  const candidateRef = Object.freeze(\n    KnowledgeImprovementCandidateRefSchema.parse(options.candidate),\n  )\n  const now = options.now ?? (() => new Date())\n  const activation = options.activation\n    ? resolveKnowledgeActivationPersistence(options.activation, candidateRef, target)\n    : undefined\n  return withKnowledgeImprovementRun(options.root, candidateRef.runId, false, async (runDir) => {\n    const lease = await acquireRunLease(runDir, {\n      ownerId: options.ownerId ?? `pid-${process.pid}`,\n      ttlMs: options.leaseTtlMs ?? DEFAULT_LEASE_TTL_MS,\n    })\n    try {\n      lease.assertOwned()\n      const state = await loadKnowledgeImprovementStateFromRun(\n        options.root,\n        candidateRef.runId,\n        runDir,\n      )\n      return await applyKnowledgeCandidateTarget(\n        {\n          root: options.root,\n          runDir,\n          state,\n          candidateRef,\n          leaseTtlMs: options.leaseTtlMs ?? DEFAULT_LEASE_TTL_MS,\n          assertRunOwned: lease.assertOwned,\n          now,\n          onState: options.onState,\n          activation,\n        },\n        target,\n      )\n    } finally {\n      await lease.release()\n    }\n  })\n}\n\nexport async function improveKnowledgeBase(\n  options: KnowledgeImprovementOptions,\n): Promise<KnowledgeImprovementResult> {\n  assertExactCandidatePlatform()\n  assertKnowledgeImprovementOptions(options)\n  const now = options.now ?? (() => new Date())\n  const runId = runIdSchema.parse(\n    options.runId ?? knowledgeImprovementRunId(options.root, options.goal),\n  )\n  return withKnowledgeImprovementRun(options.root, runId, true, (runDir) =>\n    improveKnowledgeBaseInRun(options, runId, runDir, now),\n  )\n}\n\nasync function improveKnowledgeBaseInRun(\n  options: KnowledgeImprovementOptions,\n  runId: string,\n  runDir: string,\n  now: () => Date,\n): Promise<KnowledgeImprovementResult> {\n  const lease = await acquireRunLease(runDir, {\n    ownerId: options.ownerId ?? `pid-${process.pid}`,\n    ttlMs: options.leaseTtlMs ?? DEFAULT_LEASE_TTL_MS,\n  })\n\n  try {\n    lease.assertOwned()\n    let state =\n      options.resume === false\n        ? null\n        : await loadKnowledgeImprovementStateFromRun(options.root, runId, runDir).catch((error) => {\n            if (isMissingFile(error)) return null\n            throw error\n          })\n    if (!state) {\n      const baseHash = await hashKnowledgeBase(options.root)\n      await createBaselineSnapshot(runDir, options.root, baseHash)\n      state = {\n        runId,\n        root: options.root,\n        goal: options.goal,\n        status: 'running',\n        baseHash,\n        createdAt: now().toISOString(),\n        updatedAt: now().toISOString(),\n        ownerId: lease.ownerId,\n        candidates: [],\n      }\n      await saveState(runDir, state, options.onState)\n      await appendLedger(runDir, { type: 'run.created', runId, baseHash })\n    }\n    if (state.goal !== options.goal) {\n      throw new Error('knowledge improvement state does not match the requested goal')\n    }\n    const promotedCandidateId = state.promotedCandidateId\n    const promotedCandidate =\n      state.status === 'promoted'\n        ? state.candidates.find((candidate) => candidate.candidateId === promotedCandidateId)\n        : undefined\n    if (state.status === 'promoted' && !promotedCandidate) {\n      throw new Error('promoted knowledge state has no promoted candidate')\n    }\n    if (state.status === 'promoted') {\n      const promoted = promotedCandidate!\n      const promotedState = state\n      return withKnowledgeMutation(options.root, async () => {\n        const currentHash = await hashKnowledgeBase(options.root)\n        if (currentHash !== promoted.candidateHash) {\n          throw new Error(\n            `promoted knowledge base changed: expected ${promoted.candidateHash}, got ${currentHash}`,\n          )\n        }\n        const evidence = await assertCandidateEvidence(\n          runDir,\n          candidateRefFor(runId, promotedState, promoted),\n        )\n        return {\n          runId,\n          state: promotedState,\n          candidate: promoted,\n          evaluation: evidence.evaluation,\n          promoted: true,\n          blocked: false,\n        }\n      })\n    }\n    await withKnowledgeMutation(options.root, () => undefined)\n    await ensureBaselineSnapshot(runDir, options.root, state.baseHash)\n\n    if (state.status === 'blocked') {\n      return { runId, state, promoted: false, blocked: true }\n    }\n\n    const maxCandidates = Math.max(1, options.maxCandidates ?? 1)\n    let candidate = findActiveCandidate(state)\n    let lastRejectedCandidate: KnowledgeImprovementCandidateRecord | undefined\n    let lastRejectedEvaluation: KnowledgeImprovementMetric | undefined\n    let lifecycle: RunRagKnowledgeImprovementLoopResult | undefined\n\n    while (candidate || state.candidates.length < maxCandidates) {\n      if (!candidate) {\n        const currentHash = await hashKnowledgeBase(options.root)\n        if (currentHash !== state.baseHash) {\n          state = await blockRun(\n            runDir,\n            state,\n            `base changed before candidate creation: expected ${state.baseHash}, got ${currentHash}`,\n            options.onState,\n            now,\n          )\n          return { runId, state, promoted: false, blocked: true }\n        }\n        const activeState = state\n        candidate = await withBaselineSnapshot(runDir, activeState.baseHash, (baselineRoot) =>\n          createCandidateWorkspace(runDir, activeState, baselineRoot, now),\n        )\n        state.candidates.push(candidate)\n        state.status = 'running'\n        state.updatedAt = now().toISOString()\n        await saveState(runDir, state, options.onState)\n        await appendLedger(runDir, {\n          type: 'candidate.created',\n          runId,\n          candidateId: candidate.candidateId,\n          iteration: candidate.iteration,\n        })\n      }\n\n      const measured = await measureCandidate(runId, runDir, state, candidate, options, now)\n      candidate = measured.candidate\n      const evaluation = measured.evaluation\n      lifecycle = measured.lifecycle\n\n      if (evaluation.passed) {\n        candidate.status = 'candidate-ready'\n        candidate.updatedAt = now().toISOString()\n        state.status = 'candidate-ready'\n        state.updatedAt = now().toISOString()\n        await saveState(runDir, state, options.onState)\n        await appendLedger(runDir, {\n          type: 'candidate.ready',\n          runId,\n          candidateId: candidate.candidateId,\n        })\n        break\n      }\n\n      candidate.status = 'rejected'\n      state.status = 'running'\n      state.updatedAt = now().toISOString()\n      await saveState(runDir, state, options.onState)\n      await appendLedger(runDir, {\n        type: 'candidate.rejected',\n        runId,\n        candidateId: candidate.candidateId,\n      })\n      lastRejectedCandidate = candidate\n      lastRejectedEvaluation = evaluation\n      candidate = undefined\n    }\n\n    if (!candidate) {\n      state.status = 'rejected'\n      state.updatedAt = now().toISOString()\n      await saveState(runDir, state, options.onState)\n      return {\n        runId,\n        state,\n        candidate: lastRejectedCandidate,\n        ...(lastRejectedEvaluation ? { evaluation: lastRejectedEvaluation } : {}),\n        lifecycle,\n        promoted: false,\n        blocked: false,\n      }\n    }\n\n    const evidence = await assertCandidateEvidence(runDir, candidateRefFor(runId, state, candidate))\n    return {\n      runId,\n      state,\n      candidate,\n      evaluation: evidence.evaluation,\n      lifecycle,\n      promoted: false,\n      blocked: false,\n    }\n  } finally {\n    await lease.release()\n  }\n}\n\ninterface KnowledgeCandidateTransitionInput {\n  root: string\n  runDir: string\n  state: KnowledgeImprovementRunState\n  candidateRef: KnowledgeImprovementCandidateRef\n  activation?: ResolvedKnowledgeImprovementActivationPersistence\n  leaseTtlMs: number\n  assertRunOwned(): void\n  now: () => Date\n  onState?: KnowledgeImprovementOptions['onState']\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n}\n\ninterface ResolvedKnowledgeImprovementActivationPersistence\n  extends KnowledgeImprovementActivationPersistence {\n  activation: AgentImprovementActivation\n}\n\nasync function applyKnowledgeCandidateTarget(\n  input: KnowledgeCandidateTransitionInput,\n  target: KnowledgeImprovementTarget,\n): Promise<KnowledgeImprovementMutationResult> {\n  const { candidateRef, runDir, state } = input\n  assertStateIdentity(input.root, candidateRef, state)\n  const candidate = state.candidates.find((entry) => entry.candidateId === candidateRef.candidateId)\n  if (\n    !candidate ||\n    canonicalJson(candidateIdentityFor(candidateRef.runId, state, candidate)) !==\n      canonicalJson(candidateRef)\n  ) {\n    throw new Error('knowledge candidate approval does not match the measured candidate')\n  }\n\n  const action = target === 'candidate' ? 'promotion' : 'restore'\n  const desiredHash = target === 'candidate' ? candidateRef.candidateHash : candidateRef.baseHash\n  const purpose = knowledgeCandidateTransitionPurpose(candidateRef, target)\n  const recoveryOwner = input.activation\n    ? `knowledge-improvement-activation:${input.activation.activation.digest}`\n    : 'knowledge-improvement-candidate-transition'\n  return withKnowledgeMutation(\n    input.root,\n    async (mutationLock) => {\n      const assertOwned = () => {\n        mutationLock.assertOwned()\n        input.assertRunOwned()\n      }\n      assertOwned()\n      const transactionRoot = mutationLock.transactionRoot\n      const recovery =\n        mutationLock.recovery?.purpose === purpose ? mutationLock.recovery : undefined\n      const existingActivation = input.activation\n        ? await loadKnowledgeActivationRecord(\n            runDir,\n            candidateRef,\n            input.activation.activation,\n            target,\n            input.activation.identity,\n          )\n        : null\n      if (existingActivation) {\n        if (recovery?.direction === 'rollback') {\n          throw new Error('stored knowledge activation result conflicts with a pending rollback')\n        }\n        if (recovery) {\n          const recoveredHash = await hashKnowledgeBase(input.root)\n          if (recoveredHash !== existingActivation.mutation.afterHash) {\n            throw new Error('stored knowledge activation result does not match the recovered files')\n          }\n          await finishKnowledgeFileTransaction({\n            root: input.root,\n            transactionRoot,\n            transaction: recovery.transaction,\n            assertOwned,\n          })\n        }\n        if (existingActivation.result.outcome.status === 'conflict') {\n          const reason = candidateTransitionConflictReason(\n            target,\n            candidateRef,\n            existingActivation.mutation.afterHash,\n          )\n          const blocked = await blockCandidateTransition(\n            input,\n            candidate,\n            target,\n            reason,\n            existingActivation.mutation.afterHash,\n          )\n          return { ...blocked, activationResult: existingActivation.result }\n        }\n        return candidateTransitionResult(\n          input,\n          candidate,\n          target === 'candidate' && state.status === 'promoted',\n          false,\n          existingActivation.mutation,\n          existingActivation.result,\n        )\n      }\n      if (recovery?.direction === 'rollback') {\n        await finishKnowledgeFileTransaction({\n          root: input.root,\n          transactionRoot,\n          transaction: recovery.transaction,\n          assertOwned,\n        })\n      }\n      const recovered = recovery?.direction === 'apply' ? recovery : undefined\n      let pending: KnowledgeFileTransaction | null =\n        input.activation && recovered ? recovered.transaction : null\n      const currentHash = await hashKnowledgeBase(input.root)\n      let transactionId = recovered?.transactionId ?? null\n      if (recovered && currentHash !== desiredHash) {\n        throw new Error(`recovered knowledge ${action} does not match the approved target`)\n      }\n      if (state.status === 'promoted' && state.promotedCandidateId !== candidate.candidateId) {\n        throw new Error(\n          `knowledge run already promoted '${state.promotedCandidateId ?? 'unknown'}'`,\n        )\n      }\n      if (\n        target === 'candidate' &&\n        state.status === 'promoted' &&\n        currentHash !== candidateRef.candidateHash\n      ) {\n        throw new Error(\n          `promoted knowledge base changed: expected ${candidateRef.candidateHash}, got ${currentHash}`,\n        )\n      }\n      if (state.status !== 'promoted' && state.status !== 'candidate-ready') {\n        throw new Error(\n          `knowledge candidate is not ready for ${action}: run=${state.status}, candidate=${candidate.status}`,\n        )\n      }\n      if (currentHash !== state.baseHash && currentHash !== candidateRef.candidateHash) {\n        const reason =\n          target === 'candidate'\n            ? `base changed before promotion: expected ${state.baseHash}, got ${currentHash}`\n            : `knowledge changed before restore: expected ${candidateRef.candidateHash}, got ${currentHash}`\n        const mutation = Object.freeze({\n          target,\n          beforeHash: currentHash,\n          afterHash: currentHash,\n          changed: false,\n          transactionId: null,\n          recovered: false,\n        }) satisfies KnowledgeImprovementMutationReceipt\n        const activationResult = input.activation\n          ? await persistKnowledgeActivationResult(\n              runDir,\n              candidateRef,\n              input.activation,\n              target,\n              mutation,\n            )\n          : undefined\n        const blocked = await blockCandidateTransition(\n          input,\n          candidate,\n          target,\n          reason,\n          currentHash,\n        )\n        return activationResult ? { ...blocked, activationResult } : blocked\n      }\n\n      if (currentHash !== desiredHash && !pending) {\n        pending = await withMeasuredCandidateSnapshot(\n          input.root,\n          runDir,\n          state,\n          candidateRef,\n          (resolved) =>\n            withBaselineSnapshot(runDir, state.baseHash, async (baselineRoot) => {\n              const sourceRoot = target === 'candidate' ? baselineRoot : resolved.root\n              const targetRoot = target === 'candidate' ? resolved.root : baselineRoot\n              const plan = await knowledgeFilePlanEntries(sourceRoot, targetRoot)\n              assertCandidateTransitionPlan(plan, candidateRef, target)\n              return prepareKnowledgeFileTransaction({\n                root: input.root,\n                transactionRoot,\n                purpose,\n                recoveryOwner,\n                mutations: await knowledgePlanMutations(targetRoot, plan),\n                includeUnchanged: true,\n                now: input.now,\n              })\n            }),\n        )\n        if (!pending) {\n          throw new Error(`knowledge ${action} plan unexpectedly contained no file changes`)\n        }\n        transactionId = pending.transactionId\n        try {\n          assertCandidateTransitionTransaction(pending, candidateRef, target)\n        } catch (error) {\n          try {\n            await rollbackKnowledgeFileTransaction({\n              root: input.root,\n              transactionRoot,\n              transaction: pending,\n              beforeCommit: assertOwned,\n            })\n            await finishKnowledgeFileTransaction({\n              root: input.root,\n              transactionRoot,\n              transaction: pending,\n              assertOwned,\n            })\n          } catch (cleanupError) {\n            throw new AggregateError(\n              [error, cleanupError],\n              `invalid knowledge ${action} transaction could not be removed`,\n            )\n          }\n          throw error\n        }\n      }\n      try {\n        if (pending) {\n          await applyKnowledgeFileTransaction({\n            root: input.root,\n            transactionRoot,\n            transaction: pending,\n            beforeCommit: assertOwned,\n          })\n        }\n        assertOwned()\n        if ((await hashKnowledgeBase(input.root)) !== desiredHash) {\n          throw new Error(`knowledge ${action} content does not match the approved target`)\n        }\n        await writeKnowledgeIndex(input.root)\n      } catch (error) {\n        if (!pending) throw error\n        if (recovered && input.activation) throw error\n        try {\n          assertOwned()\n        } catch (ownershipError) {\n          throw new AggregateError(\n            [error, ownershipError],\n            `knowledge ${action} lost its lock and left the transaction pending`,\n          )\n        }\n        try {\n          await rollbackKnowledgeFileTransaction({\n            root: input.root,\n            transactionRoot,\n            transaction: pending,\n            beforeCommit: assertOwned,\n          })\n          await finishKnowledgeFileTransaction({\n            root: input.root,\n            transactionRoot,\n            transaction: pending,\n            assertOwned,\n          })\n          await writeKnowledgeIndex(input.root)\n        } catch (rollbackError) {\n          throw new AggregateError(\n            [error, rollbackError],\n            `knowledge ${action} failed and could not restore the previous files`,\n          )\n        }\n        throw error\n      }\n      candidate.status = target === 'candidate' ? 'promoted' : 'candidate-ready'\n      candidate.updatedAt = input.now().toISOString()\n      state.status = candidate.status\n      if (target === 'candidate') state.promotedCandidateId = candidate.candidateId\n      else delete state.promotedCandidateId\n      delete state.blockedReason\n      state.updatedAt = input.now().toISOString()\n      await saveState(runDir, state, input.onState)\n      await ensureCandidateTransitionEvent(runDir, candidateRef, target)\n      let finalHash = await hashKnowledgeBase(input.root)\n      if (finalHash !== desiredHash) {\n        throw new Error(`knowledge ${action} changed before its result was returned`)\n      }\n      const mutation = Object.freeze({\n        target,\n        beforeHash: transactionId ? sourceKnowledgeHash(candidateRef, target) : currentHash,\n        afterHash: finalHash,\n        changed: transactionId !== null,\n        transactionId,\n        recovered: recovered !== undefined,\n      }) satisfies KnowledgeImprovementMutationReceipt\n      const activationResult = input.activation\n        ? await persistKnowledgeActivationResult(\n            runDir,\n            candidateRef,\n            input.activation,\n            target,\n            mutation,\n          )\n        : undefined\n      if ((await hashKnowledgeBase(input.root)) !== finalHash) {\n        throw new Error(`knowledge ${action} changed while its result was persisted`)\n      }\n      if (pending) {\n        await finishKnowledgeFileTransaction({\n          root: input.root,\n          transactionRoot,\n          transaction: pending,\n          assertOwned,\n        })\n      }\n      finalHash = await hashKnowledgeBase(input.root)\n      if (finalHash !== desiredHash) {\n        throw new Error(`knowledge ${action} changed before its result was returned`)\n      }\n      return candidateTransitionResult(\n        input,\n        candidate,\n        target === 'candidate',\n        false,\n        mutation,\n        activationResult,\n      )\n    },\n    {\n      staleMs: input.leaseTtlMs,\n      resumeTransaction: {\n        purpose,\n        recoveryOwner,\n        validate: (transaction) =>\n          assertCandidateTransitionTransaction(transaction, candidateRef, target),\n        deferFinish: input.activation !== undefined,\n      },\n    },\n  )\n}\n\nfunction candidateTransitionConflictReason(\n  target: KnowledgeImprovementTarget,\n  candidate: KnowledgeImprovementCandidateRef,\n  currentHash: string,\n): string {\n  return target === 'candidate'\n    ? `base changed before promotion: expected ${candidate.baseHash}, got ${currentHash}`\n    : `knowledge changed before restore: expected ${candidate.candidateHash}, got ${currentHash}`\n}\n\nasync function blockCandidateTransition(\n  input: KnowledgeCandidateTransitionInput,\n  candidate: KnowledgeImprovementCandidateRecord,\n  target: KnowledgeImprovementTarget,\n  reason: string,\n  currentHash: string,\n): Promise<KnowledgeImprovementMutationResult> {\n  if (input.state.status === 'promoted') {\n    candidate.status = 'blocked'\n    candidate.updatedAt = input.now().toISOString()\n    delete input.state.promotedCandidateId\n  }\n  await blockRun(input.runDir, input.state, reason, input.onState, input.now)\n  await appendLedger(input.runDir, {\n    type: target === 'candidate' ? 'promotion.blocked' : 'restore.blocked',\n    runId: input.candidateRef.runId,\n    candidateId: candidate.candidateId,\n    reason,\n  })\n  return candidateTransitionResult(input, candidate, false, true, {\n    target,\n    beforeHash: currentHash,\n    afterHash: currentHash,\n    changed: false,\n    transactionId: null,\n    recovered: false,\n  })\n}\n\nfunction candidateTransitionResult(\n  input: KnowledgeCandidateTransitionInput,\n  candidate: KnowledgeImprovementCandidateRecord,\n  promoted: boolean,\n  blocked: boolean,\n  mutation: KnowledgeImprovementMutationReceipt,\n  activationResult?: AgentImprovementActivationResult,\n): KnowledgeImprovementMutationResult {\n  return {\n    runId: input.candidateRef.runId,\n    state: input.state,\n    candidate,\n    ...(input.lifecycle ? { lifecycle: input.lifecycle } : {}),\n    mutation,\n    ...(activationResult ? { activationResult } : {}),\n    promoted,\n    blocked,\n  }\n}\n\nfunction sourceKnowledgeHash(\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n): string {\n  return target === 'candidate' ? candidate.baseHash : candidate.candidateHash\n}\n\nfunction targetForKnowledgeActivation(\n  activation: AgentImprovementActivation,\n): KnowledgeImprovementTarget {\n  return activation.intent === 'activate-candidate' ? 'candidate' : 'baseline'\n}\n\nfunction resolveKnowledgeActivationPersistence(\n  input: KnowledgeImprovementActivationPersistence,\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n): ResolvedKnowledgeImprovementActivationPersistence {\n  const activation = verifyCanonicalKnowledgeActivation(input.activation)\n  assertKnowledgeActivationAuthority(activation, candidate, target, input.identity)\n  const attemptedAt = z.iso.datetime().parse(input.attemptedAt)\n  if (\n    Date.parse(attemptedAt) < Date.parse(activation.authorizedAt) ||\n    Date.parse(attemptedAt) >= Date.parse(activation.expiresAt)\n  ) {\n    throw new Error('knowledge activation attempt is outside its authorization window')\n  }\n  return Object.freeze({\n    activation,\n    attemptedAt,\n    identity: input.identity,\n    createResult: input.createResult,\n  })\n}\n\nfunction assertKnowledgeActivationAuthority(\n  activation: AgentImprovementActivation,\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n  identity: string,\n): void {\n  if (!identity.trim()) throw new Error('knowledge activation identity is required')\n  if (targetForKnowledgeActivation(activation) !== target) {\n    throw new Error('knowledge activation intent does not match the requested transition')\n  }\n  if (activation.targets.length !== 1) {\n    throw new Error('knowledge activation requires exactly one target')\n  }\n  const authorizedTarget = activation.targets[0]\n  if (authorizedTarget.surface !== 'knowledge' || authorizedTarget.identity !== identity) {\n    throw new Error('knowledge activation target does not match this knowledge base')\n  }\n  if (\n    authorizedTarget.expectedBaseDigest !==\n    prefixedKnowledgeDigest(sourceKnowledgeHash(candidate, target))\n  ) {\n    throw new Error('knowledge activation does not authorize the measured source state')\n  }\n}\n\nfunction verifyCanonicalKnowledgeActivation(\n  value: AgentImprovementActivation,\n): AgentImprovementActivation {\n  const activation = agentImprovementActivationSchema.parse(value)\n  if (canonicalCandidateDigest(omitTopLevelDigest(activation)) !== activation.digest) {\n    throw new Error('knowledge activation digest does not match its canonical content')\n  }\n  return immutableJsonValue(structuredClone(activation))\n}\n\nfunction verifyCanonicalKnowledgeActivationResult(\n  value: AgentImprovementActivationResult,\n): AgentImprovementActivationResult {\n  const result = agentImprovementActivationResultSchema.parse(value)\n  if (canonicalCandidateDigest(omitTopLevelDigest(result)) !== result.digest) {\n    throw new Error('knowledge activation result digest does not match its canonical content')\n  }\n  return immutableJsonValue(structuredClone(result))\n}\n\nasync function persistKnowledgeActivationResult(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRef,\n  persistence: ResolvedKnowledgeImprovementActivationPersistence,\n  target: KnowledgeImprovementTarget,\n  mutation: KnowledgeImprovementMutationReceipt,\n): Promise<AgentImprovementActivationResult> {\n  const result = assertKnowledgeActivationResult(\n    persistence.activation,\n    candidate,\n    target,\n    persistence.identity,\n    mutation,\n    await persistence.createResult(Object.freeze({ ...mutation })),\n    persistence.attemptedAt,\n  )\n  const record = knowledgeImprovementActivationRecordSchema.parse({\n    kind: 'knowledge-improvement-activation-result',\n    candidateId: candidate.candidateId,\n    mutation,\n    result,\n  })\n  const existing = await loadKnowledgeActivationRecord(\n    runDir,\n    candidate,\n    persistence.activation,\n    target,\n    persistence.identity,\n  )\n  if (existing) {\n    if (canonicalJson(existing) !== canonicalJson(record)) {\n      throw new Error('knowledge activation result identity conflicts with durable content')\n    }\n    return existing.result\n  }\n  await writeJsonDurableWithinRoot(\n    runDir,\n    knowledgeActivationResultPath(persistence.activation.digest),\n    record,\n  )\n  const stored = await loadKnowledgeActivationRecord(\n    runDir,\n    candidate,\n    persistence.activation,\n    target,\n    persistence.identity,\n  )\n  if (!stored || canonicalJson(stored) !== canonicalJson(record)) {\n    throw new Error('knowledge activation result was not durably persisted')\n  }\n  return stored.result\n}\n\nasync function loadKnowledgeActivationRecord(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRef,\n  activation: AgentImprovementActivation,\n  target: KnowledgeImprovementTarget,\n  identity: string,\n): Promise<KnowledgeImprovementActivationRecord | null> {\n  let raw: unknown\n  try {\n    const file = await readRegularFileWithinRoot(\n      runDir,\n      knowledgeActivationResultPath(activation.digest),\n    )\n    raw = JSON.parse(file.bytes.toString('utf8')) as unknown\n  } catch (error) {\n    if (isMissingFile(error)) return null\n    throw error\n  }\n  const record = knowledgeImprovementActivationRecordSchema.parse(raw)\n  if (record.candidateId !== candidate.candidateId) {\n    throw new Error('knowledge activation result belongs to another candidate')\n  }\n  const result = assertKnowledgeActivationResult(\n    activation,\n    candidate,\n    target,\n    identity,\n    record.mutation,\n    record.result,\n  )\n  return immutableJsonValue({ ...record, result })\n}\n\nfunction assertKnowledgeActivationResult(\n  activation: AgentImprovementActivation,\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n  identity: string,\n  mutationInput: KnowledgeImprovementMutationReceipt,\n  resultInput: AgentImprovementActivationResult,\n  attemptedAt?: string,\n): AgentImprovementActivationResult {\n  assertKnowledgeActivationAuthority(activation, candidate, target, identity)\n  const mutation = knowledgeImprovementMutationReceiptSchema.parse(mutationInput)\n  const result = verifyCanonicalKnowledgeActivationResult(resultInput)\n  if (\n    result.idempotencyKey !== activation.digest ||\n    (attemptedAt !== undefined && result.attemptedAt !== attemptedAt) ||\n    Date.parse(result.attemptedAt) < Date.parse(activation.authorizedAt) ||\n    Date.parse(result.attemptedAt) >= Date.parse(activation.expiresAt) ||\n    mutation.target !== target ||\n    mutation.changed !== (mutation.beforeHash !== mutation.afterHash) ||\n    (!mutation.changed && (mutation.transactionId !== null || mutation.recovered))\n  ) {\n    throw new Error('knowledge activation result does not bind its authorized mutation')\n  }\n\n  const sourceDigest = prefixedKnowledgeDigest(sourceKnowledgeHash(candidate, target))\n  const desiredDigest = prefixedKnowledgeDigest(\n    target === 'candidate' ? candidate.candidateHash : candidate.baseHash,\n  )\n  const beforeDigest = prefixedKnowledgeDigest(mutation.beforeHash)\n  const afterDigest = prefixedKnowledgeDigest(mutation.afterHash)\n  const outcome = result.outcome\n  if (mutation.changed) {\n    if (\n      mutation.transactionId === null ||\n      beforeDigest !== sourceDigest ||\n      afterDigest !== desiredDigest ||\n      outcome.status !== 'applied' ||\n      outcome.transactionId !== mutation.transactionId ||\n      outcome.targets.length !== 1 ||\n      outcome.targets[0]?.surface !== 'knowledge' ||\n      outcome.targets[0]?.identity !== identity ||\n      outcome.targets[0]?.beforeDigest !== beforeDigest ||\n      outcome.targets[0]?.afterDigest !== afterDigest\n    ) {\n      throw new Error('knowledge activation result does not prove the applied transaction')\n    }\n    return result\n  }\n\n  const expectedStatus = afterDigest === desiredDigest ? 'already-applied' : 'conflict'\n  if (\n    afterDigest === sourceDigest ||\n    outcome.status !== expectedStatus ||\n    outcome.targets.length !== 1 ||\n    outcome.targets[0]?.surface !== 'knowledge' ||\n    outcome.targets[0]?.identity !== identity ||\n    outcome.targets[0]?.currentDigest !== afterDigest\n  ) {\n    throw new Error('knowledge activation result does not prove the observed target state')\n  }\n  return result\n}\n\nfunction knowledgeActivationResultPath(digest: Sha256Digest): string {\n  const parsed = sha256DigestSchema.parse(digest)\n  return `activation-results/${parsed.slice('sha256:'.length)}.json`\n}\n\nfunction prefixedKnowledgeDigest(hash: string): Sha256Digest {\n  return sha256DigestSchema.parse(`sha256:${digestSchema.parse(hash)}`)\n}\n\nfunction immutableJsonValue<T>(value: T): T {\n  if (value === null || typeof value !== 'object') return value\n  for (const child of Object.values(value)) immutableJsonValue(child)\n  return Object.freeze(value)\n}\n\nfunction candidateRefFor(\n  runId: string,\n  state: KnowledgeImprovementRunState,\n  candidate: KnowledgeImprovementCandidateRecord,\n): KnowledgeImprovementCandidateRef {\n  if (candidate.status !== 'candidate-ready' && candidate.status !== 'promoted') {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' is not ready`)\n  }\n  return candidateIdentityFor(runId, state, candidate)\n}\n\nfunction candidateIdentityFor(\n  runId: string,\n  state: KnowledgeImprovementRunState,\n  candidate: KnowledgeImprovementCandidateRecord,\n): KnowledgeImprovementCandidateRef {\n  if (!candidate.candidateHash) {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' has no content hash`)\n  }\n  if (!candidate.evidenceHash) {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' has no evidence hash`)\n  }\n  if (!candidate.promotionPlanHash) {\n    throw new Error(`knowledge candidate '${candidate.candidateId}' has no promotion plan hash`)\n  }\n  return Object.freeze({\n    kind: 'knowledge-improvement-candidate',\n    runId,\n    candidateId: candidate.candidateId,\n    goalHash: sha256(state.goal),\n    baseHash: candidate.baseHash,\n    candidateHash: candidate.candidateHash,\n    evidenceHash: candidate.evidenceHash,\n    promotionPlanHash: candidate.promotionPlanHash,\n  })\n}\n\nasync function withMeasuredCandidateSnapshot<T>(\n  liveRoot: string,\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  use: (snapshot: {\n    root: string\n    candidate: KnowledgeImprovementCandidateRecord\n    evidence: KnowledgeImprovementEvidence\n  }) => Promise<T> | T,\n): Promise<T> {\n  assertStateIdentity(liveRoot, candidateRef, state)\n  const candidate = state.candidates.find((entry) => entry.candidateId === candidateRef.candidateId)\n  if (!candidate) {\n    throw new Error(`knowledge candidate '${candidateRef.candidateId}' does not exist`)\n  }\n  const expectedRef = candidateRefFor(candidateRef.runId, state, candidate)\n  if (canonicalJson(expectedRef) !== canonicalJson(candidateRef)) {\n    throw new Error('knowledge candidate approval does not match the measured candidate')\n  }\n  const evidence = await assertCandidateEvidence(runDir, candidateRef)\n  const relativePath = join(\n    'candidates',\n    candidate.candidateId,\n    'snapshots',\n    candidateRef.candidateHash,\n  )\n  return withSafeDirectory(runDir, relativePath, false, async (root) => {\n    if ((await hashKnowledgeBase(root)) !== candidateRef.candidateHash) {\n      throw new Error('knowledge candidate snapshot changed after approval')\n    }\n    const result = await use({ root, candidate, evidence })\n    if ((await hashKnowledgeBase(root)) !== candidateRef.candidateHash) {\n      throw new Error('knowledge candidate snapshot changed during use')\n    }\n    return result\n  })\n}\n\nasync function withIsolatedKnowledgeCopy<T>(\n  sourceRoot: string,\n  expectedHash: string,\n  target: KnowledgeImprovementTarget,\n  use: (root: string) => Promise<T> | T,\n): Promise<T> {\n  const isolationRoot = await mkdtemp(join(tmpdir(), 'agent-knowledge-snapshot-'))\n  const snapshotRoot = join(isolationRoot, 'snapshot')\n  try {\n    await copyKnowledgeWorkspace(sourceRoot, snapshotRoot)\n    if ((await hashKnowledgeBase(snapshotRoot)) !== expectedHash) {\n      throw new Error(`isolated knowledge ${target} does not match its measured content`)\n    }\n    const result = await use(snapshotRoot)\n    if ((await hashKnowledgeBase(snapshotRoot)) !== expectedHash) {\n      throw new Error(`knowledge ${target} snapshot changed during use`)\n    }\n    return result\n  } finally {\n    await rm(isolationRoot, { recursive: true, force: true })\n  }\n}\n\nasync function assertCandidateEvidence(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRef,\n): Promise<KnowledgeImprovementEvidence> {\n  const evidence = KnowledgeImprovementEvidenceSchema.parse(\n    JSON.parse(\n      (\n        await readRegularFileWithinRoot(\n          runDir,\n          candidateEvidenceRelativePath(candidate.candidateId),\n        )\n      ).bytes.toString('utf8'),\n    ),\n  )\n  const actualHash = contentHash(evidence)\n  if (actualHash !== candidate.evidenceHash) {\n    throw new Error(\n      `knowledge candidate evidence changed after approval: expected ${candidate.evidenceHash}, got ${actualHash}`,\n    )\n  }\n  if (\n    evidence.runId !== candidate.runId ||\n    evidence.candidateId !== candidate.candidateId ||\n    evidence.goalHash !== candidate.goalHash ||\n    evidence.baseHash !== candidate.baseHash ||\n    evidence.candidateHash !== candidate.candidateHash ||\n    evidence.promotionPlanHash !== candidate.promotionPlanHash ||\n    evidence.evaluation.passed !== true\n  ) {\n    throw new Error('knowledge candidate evidence does not match the approved candidate')\n  }\n  return evidence\n}\n\nfunction assertStateIdentity(\n  root: string,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  state: KnowledgeImprovementRunState,\n): void {\n  if (state.runId !== candidateRef.runId) {\n    throw new Error('knowledge candidate run identity does not match persisted state')\n  }\n  if (resolve(state.root) !== resolve(root)) {\n    throw new Error('knowledge candidate root does not match persisted state')\n  }\n  if (sha256(state.goal) !== candidateRef.goalHash) {\n    throw new Error('knowledge candidate goal does not match persisted state')\n  }\n  if (state.baseHash !== candidateRef.baseHash) {\n    throw new Error('knowledge candidate base does not match persisted state')\n  }\n}\n\nasync function assertCandidateWorkspace(\n  runDir: string,\n  candidate: Pick<KnowledgeImprovementCandidateRecord, 'candidateId'>,\n): Promise<void> {\n  await withCandidateWorkspace(runDir, candidate, () => undefined)\n}\n\nasync function withCandidateWorkspace<T>(\n  runDir: string,\n  candidate: Pick<KnowledgeImprovementCandidateRecord, 'candidateId'>,\n  use: (candidateRoot: string) => Promise<T> | T,\n): Promise<T> {\n  return withSafeDirectory(\n    runDir,\n    join('candidates', safePathSegmentSchema.parse(candidate.candidateId), 'workspace'),\n    false,\n    use,\n  )\n}\n\nfunction assertKnowledgeImprovementOptions(options: KnowledgeImprovementOptions): void {\n  if (options.step && options.knowledgeResearch?.step) {\n    throw new Error('improveKnowledgeBase accepts either step or knowledgeResearch.step, not both')\n  }\n  const updateDrivers = [\n    Boolean(options.step ?? options.knowledgeResearch),\n    Boolean(options.updateKnowledge),\n  ].filter(Boolean).length\n  if (updateDrivers > 1) {\n    throw new Error(\n      'improveKnowledgeBase accepts only one knowledge-update driver: knowledgeResearch or updateKnowledge',\n    )\n  }\n}\n\nasync function measureCandidate(\n  runId: string,\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  candidate: KnowledgeImprovementCandidateRecord,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<{\n  candidate: KnowledgeImprovementCandidateRecord\n  evaluation: KnowledgeImprovementMetric\n  lifecycle?: RunRagKnowledgeImprovementLoopResult\n}> {\n  return withCandidateWorkspace(runDir, candidate, async (candidateRoot) => {\n    const currentCandidateHash = await hashKnowledgeBase(candidateRoot)\n    if (\n      candidate.status === 'candidate-ready' &&\n      candidate.candidateHash === currentCandidateHash &&\n      candidate.evidenceHash !== undefined &&\n      candidate.promotionPlanHash !== undefined\n    ) {\n      const evidence = await assertCandidateEvidence(\n        runDir,\n        candidateRefFor(runId, state, candidate),\n      )\n      return { candidate, evaluation: evidence.evaluation }\n    }\n\n    clearCandidateMeasurement(candidate)\n    const lifecycles: RunRagKnowledgeImprovementLoopResult[] = []\n    if (candidate.status === 'running') {\n      const updateLifecycle = await runCandidateUpdateLifecycle(\n        runId,\n        candidate,\n        candidateRoot,\n        options,\n        now,\n      )\n      if (updateLifecycle) lifecycles.push(updateLifecycle)\n    }\n    return withFrozenCandidateWorkspace(runDir, candidate, candidateRoot, async (snapshot) => {\n      const evaluationLifecycle = await runCandidateEvaluationLifecycle(\n        runDir,\n        candidate,\n        snapshot.root,\n        options,\n        now,\n      )\n      if (evaluationLifecycle) lifecycles.push(evaluationLifecycle)\n      const lifecycle = mergeLifecycleResults(options.goal, lifecycles)\n      const measured = await evaluateCandidate(\n        runDir,\n        state,\n        candidate,\n        snapshot,\n        lifecycle,\n        options,\n        now,\n      )\n      return { ...measured, ...(lifecycle ? { lifecycle } : {}) }\n    })\n  })\n}\n\nasync function runCandidateUpdateLifecycle(\n  runId: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<RunRagKnowledgeImprovementLoopResult | undefined> {\n  if (!shouldRunUpdateStage(options)) return undefined\n  const lifecycle = await runRagKnowledgeImprovementLoop({\n    goal: options.goal,\n    acquireKnowledge: options.acquireKnowledge,\n    knowledgeResearch: candidateKnowledgeResearchOptions(candidateRoot, options),\n    updateKnowledge: candidateUpdateHook(runId, candidate, candidateRoot, options),\n    enabledPhases: selectedStagePhases(options, UPDATE_PHASES),\n    requiredPhases: selectedStageRequiredPhases(options, UPDATE_PHASES),\n    signal: options.signal,\n    now,\n  })\n  return lifecycle\n}\n\nasync function runCandidateEvaluationLifecycle(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<RunRagKnowledgeImprovementLoopResult | undefined> {\n  if (!shouldRunEvaluationStage(options)) return undefined\n  const candidateIndex = await buildKnowledgeIndex(candidateRoot)\n  const lifecycle = await runRagKnowledgeImprovementLoop({\n    goal: options.goal,\n    retrieval: options.retrieval\n      ? {\n          ...options.retrieval,\n          index: candidateIndex,\n          runDir: options.retrieval.runDir ?? join(runDir, 'retrieval', candidate.candidateId),\n        }\n      : undefined,\n    diagnose: options.diagnose,\n    evaluateAnswers: options.evaluateAnswers,\n    promote: options.decidePromotion,\n    enabledPhases: selectedStagePhases(options, EVALUATION_PHASES),\n    requiredPhases: selectedStageRequiredPhases(options, EVALUATION_PHASES),\n    signal: options.signal,\n    now,\n  })\n  return lifecycle\n}\n\nfunction candidateKnowledgeResearchOptions(\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n): RagKnowledgeResearchOptions | undefined {\n  if (!options.step && !options.knowledgeResearch) return undefined\n  const { step: researchStep, ...rest } = options.knowledgeResearch ?? {}\n  const step = options.step ?? researchStep\n  return {\n    ...rest,\n    root: candidateRoot,\n    step,\n    maxIterations:\n      rest.maxIterations ?? (step ? (options.candidateResearchIterations ?? 3) : undefined),\n    strict: rest.strict ?? options.strict,\n    readinessSpecs: rest.readinessSpecs ?? options.readinessSpecs,\n    readinessTaskId: rest.readinessTaskId ?? options.readinessTaskId,\n    readiness: rest.readiness ?? options.readiness,\n  }\n}\n\nfunction candidateUpdateHook(\n  runId: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  options: KnowledgeImprovementOptions,\n): RunRagKnowledgeImprovementLoopOptions['updateKnowledge'] {\n  if (!options.updateKnowledge) return undefined\n  return (input) =>\n    options.updateKnowledge!({\n      ...input,\n      runId,\n      iteration: candidate.iteration,\n      candidateId: candidate.candidateId,\n      root: candidateRoot,\n      baselineRoot: options.root,\n      candidateRoot,\n      baseHash: candidate.baseHash,\n    })\n}\n\nfunction shouldRunUpdateStage(options: KnowledgeImprovementOptions): boolean {\n  const phases = selectedStagePhases(options, UPDATE_PHASES)\n  if (phases.length === 0) return false\n  return Boolean(\n    options.acquireKnowledge ||\n      options.step ||\n      options.knowledgeResearch ||\n      options.updateKnowledge ||\n      selectedStageRequiredPhases(options, UPDATE_PHASES).length > 0,\n  )\n}\n\nfunction shouldRunEvaluationStage(options: KnowledgeImprovementOptions): boolean {\n  const phases = selectedStagePhases(options, EVALUATION_PHASES)\n  if (phases.length === 0) return false\n  return Boolean(\n    options.retrieval ||\n      options.diagnose ||\n      options.evaluateAnswers ||\n      options.decidePromotion ||\n      selectedStageRequiredPhases(options, EVALUATION_PHASES).length > 0,\n  )\n}\n\nfunction selectedStagePhases(\n  options: Pick<KnowledgeImprovementOptions, 'enabledPhases'>,\n  stagePhases: readonly RagKnowledgeImprovementPhase[],\n): RagKnowledgeImprovementPhase[] {\n  const requested = options.enabledPhases ?? stagePhases\n  return requested.filter((phase) => stagePhases.includes(phase))\n}\n\nfunction selectedStageRequiredPhases(\n  options: Pick<KnowledgeImprovementOptions, 'requiredPhases'>,\n  stagePhases: readonly RagKnowledgeImprovementPhase[],\n): RagKnowledgeImprovementPhase[] {\n  return (options.requiredPhases ?? []).filter((phase) => stagePhases.includes(phase))\n}\n\nfunction mergeLifecycleResults(\n  goal: string,\n  lifecycles: readonly RunRagKnowledgeImprovementLoopResult[],\n): RunRagKnowledgeImprovementLoopResult | undefined {\n  if (lifecycles.length === 0) return undefined\n  return {\n    goal,\n    phases: lifecycles.flatMap((lifecycle) => lifecycle.phases),\n    retrieval: lastDefined(lifecycles.map((lifecycle) => lifecycle.retrieval)),\n    findings: lifecycles.flatMap((lifecycle) => lifecycle.findings),\n    acquisition: lastDefined(lifecycles.map((lifecycle) => lifecycle.acquisition)),\n    knowledgeUpdate: lastDefined(lifecycles.map((lifecycle) => lifecycle.knowledgeUpdate)),\n    answerQuality: lastDefined(lifecycles.map((lifecycle) => lifecycle.answerQuality)),\n    promotion: lastDefined(lifecycles.map((lifecycle) => lifecycle.promotion)),\n  }\n}\n\nfunction lastDefined<T>(values: readonly (T | undefined)[]): T | undefined {\n  for (let index = values.length - 1; index >= 0; index -= 1) {\n    if (values[index] !== undefined) return values[index]\n  }\n  return undefined\n}\n\nasync function evaluateCandidate(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  candidate: KnowledgeImprovementCandidateRecord,\n  snapshot: { root: string; hash: string },\n  lifecycle: RunRagKnowledgeImprovementLoopResult | undefined,\n  options: KnowledgeImprovementOptions,\n  now: () => Date,\n): Promise<{\n  candidate: KnowledgeImprovementCandidateRecord\n  evaluation: KnowledgeImprovementMetric\n}> {\n  return withBaselineSnapshot(runDir, state.baseHash, async (baselineRoot) => {\n    const [baselineIndex, candidateIndex] = await Promise.all([\n      buildKnowledgeIndex(baselineRoot),\n      buildKnowledgeIndex(snapshot.root),\n    ])\n    const validation = validateKnowledgeIndex(candidateIndex, { strict: options.strict })\n    const readiness = readinessFor(options, candidateIndex)\n    const kbQuality = scoreKnowledgeBaseIndex(candidateIndex, {\n      strict: options.strict,\n      ...options.kbQuality,\n    })\n    const candidateHash = snapshot.hash\n    const metric =\n      options.evaluate?.({\n        runId: state.runId,\n        iteration: candidate.iteration,\n        root: options.root,\n        baselineRoot,\n        candidateRoot: snapshot.root,\n        baselineIndex,\n        candidateIndex,\n        baseHash: state.baseHash,\n        candidateHash,\n        validation,\n        readiness,\n        kbQuality,\n        lifecycle,\n        signal: options.signal,\n      }) ??\n      defaultKnowledgeImprovementMetric(\n        validation,\n        readiness,\n        options.readinessSpecs,\n        kbQuality,\n        lifecycle,\n      )\n    const evaluation = applyLifecycleFailures(normalizeMetric(await metric), lifecycle)\n    const measuredHash = await hashKnowledgeBase(snapshot.root)\n    if (measuredHash !== candidateHash) {\n      throw new Error(\n        `knowledge candidate changed during evaluation: expected ${candidateHash}, got ${measuredHash}`,\n      )\n    }\n    candidate.candidateHash = candidateHash\n    candidate.promotionPlanHash = knowledgeFileTransactionPlanHash(\n      await knowledgeFilePlanEntries(baselineRoot, snapshot.root),\n    )\n    const evidence = KnowledgeImprovementEvidenceSchema.parse(\n      JSON.parse(\n        JSON.stringify({\n          kind: 'knowledge-improvement-evidence',\n          runId: state.runId,\n          candidateId: candidate.candidateId,\n          iteration: candidate.iteration,\n          goalHash: sha256(state.goal),\n          baseHash: candidate.baseHash,\n          candidateHash,\n          promotionPlanHash: candidate.promotionPlanHash,\n          validation,\n          readiness: readiness ?? null,\n          kbQuality,\n          evaluation,\n          lifecycle: lifecycle ?? null,\n        }),\n      ),\n    )\n    candidate.evidenceHash = contentHash(evidence)\n    candidate.updatedAt = now().toISOString()\n    await writeJsonDurableWithinRoot(\n      runDir,\n      candidateEvidenceRelativePath(candidate.candidateId),\n      evidence,\n    )\n    await appendLedger(runDir, {\n      type: 'candidate.evaluated',\n      runId: state.runId,\n      candidateId: candidate.candidateId,\n      score: evaluation.score,\n      passed: evaluation.passed,\n    })\n    return { candidate, evaluation }\n  })\n}\n\nfunction defaultKnowledgeImprovementMetric(\n  validation: ValidateKnowledgeResult,\n  readiness: EvalKnowledgeBundleBuildResult | undefined,\n  readinessSpecs: readonly KnowledgeReadinessSpec[] | undefined,\n  kbQuality: KnowledgeBaseQualityReport,\n  lifecycle: RunRagKnowledgeImprovementLoopResult | undefined,\n): KnowledgeImprovementMetric {\n  const blockingMissing = readiness?.report.blockingMissingRequirements.length ?? 0\n  const blockingTotal = readinessSpecs?.filter((spec) => spec.importance === 'blocking').length ?? 0\n  const blockingReadiness =\n    blockingTotal === 0 ? 1 : Math.max(0, blockingTotal - blockingMissing) / blockingTotal\n  const answerQuality = lifecycle?.answerQuality\n    ? average(Object.values(lifecycle.answerQuality.metrics).filter(Number.isFinite))\n    : 1\n  const promotionDecision = lifecycle?.promotion ? (lifecycle.promotion.promoted ? 1 : 0) : 1\n  const dimensions = {\n    validation: validation.ok ? 1 : 0,\n    kb_quality: kbQuality.ok ? 1 : 0,\n    blocking_readiness: blockingReadiness,\n    answer_quality: answerQuality,\n    promotion_decision: promotionDecision,\n  }\n  const failedReasons = [\n    validation.ok ? undefined : 'candidate validation failed',\n    kbQuality.ok ? undefined : 'candidate KB quality check failed',\n    blockingMissing === 0\n      ? undefined\n      : `${blockingMissing}/${blockingTotal} blocking knowledge requirements still missing`,\n  ].filter((reason): reason is string => Boolean(reason))\n  return {\n    score: average(Object.values(dimensions)),\n    passed: failedReasons.length === 0,\n    dimensions,\n    notes:\n      failedReasons.length === 0 ? 'candidate passed configured checks' : failedReasons.join('; '),\n    provenance: {\n      evaluator: '@tangle-network/agent-knowledge/default-knowledge-improvement-metric',\n      version: '1',\n      method: 'deterministic',\n    },\n  }\n}\n\nfunction applyLifecycleFailures(\n  metric: KnowledgeImprovementMetric,\n  lifecycle: RunRagKnowledgeImprovementLoopResult | undefined,\n): KnowledgeImprovementMetric {\n  const reasons = [\n    metric.notes,\n    lifecycle?.answerQuality && !lifecycle.answerQuality.passed\n      ? 'answer quality failed'\n      : undefined,\n    lifecycle?.promotion && !lifecycle.promotion.promoted\n      ? `promotion decision held: ${lifecycle.promotion.reason}`\n      : undefined,\n  ].filter((reason): reason is string => Boolean(reason))\n  const forcedFailure =\n    Boolean(lifecycle?.answerQuality && !lifecycle.answerQuality.passed) ||\n    Boolean(lifecycle?.promotion && !lifecycle.promotion.promoted)\n  return {\n    ...metric,\n    passed: metric.passed && !forcedFailure,\n    notes: reasons.length > 0 ? reasons.join('; ') : metric.notes,\n  }\n}\n\nfunction normalizeMetric(metric: KnowledgeImprovementMetric): KnowledgeImprovementMetric {\n  return improvementMetricSchema.parse(metric)\n}\n\nasync function createCandidateWorkspace(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  root: string,\n  now: () => Date,\n): Promise<KnowledgeImprovementCandidateRecord> {\n  const iteration = state.candidates.length + 1\n  const candidateId = stableId('kcand', `${state.runId}:${iteration}:${now().toISOString()}`)\n  const candidateRoot = candidateWorkspacePath(runDir, candidateId)\n  await copyKnowledgeWorkspace(root, candidateRoot)\n  const createdAt = now().toISOString()\n  return {\n    iteration,\n    candidateId,\n    baseHash: state.baseHash,\n    status: 'running',\n    createdAt,\n    updatedAt: createdAt,\n  }\n}\n\nfunction candidateWorkspacePath(runDir: string, candidateId: string): string {\n  return join(runDir, 'candidates', safePathSegmentSchema.parse(candidateId), 'workspace')\n}\n\nfunction baselineSnapshotPath(runDir: string): string {\n  return join(runDir, 'baseline')\n}\n\nasync function createBaselineSnapshot(\n  runDir: string,\n  root: string,\n  expectedHash: string,\n): Promise<void> {\n  const target = baselineSnapshotPath(runDir)\n  try {\n    await assertBaselineSnapshot(runDir, expectedHash)\n    return\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n  const preparation = await mkdtemp(join(runDir, 'baseline-prepare-'))\n  let activated = false\n  try {\n    await copyKnowledgeWorkspace(root, preparation)\n    const actualHash = await hashKnowledgeBase(preparation)\n    if (actualHash !== expectedHash) {\n      throw new Error(\n        `knowledge base changed while baseline was frozen: expected ${expectedHash}, got ${actualHash}`,\n      )\n    }\n    await renameDurable(preparation, target)\n    activated = true\n  } finally {\n    if (!activated) await rm(preparation, { recursive: true, force: true })\n  }\n}\n\nasync function ensureBaselineSnapshot(\n  runDir: string,\n  root: string,\n  expectedHash: string,\n): Promise<void> {\n  try {\n    await assertBaselineSnapshot(runDir, expectedHash)\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n    const liveHash = await hashKnowledgeBase(root)\n    if (liveHash !== expectedHash) {\n      throw new Error(\n        'knowledge improvement baseline snapshot is missing and cannot be reconstructed',\n      )\n    }\n    await createBaselineSnapshot(runDir, root, expectedHash)\n  }\n}\n\nasync function assertBaselineSnapshot(runDir: string, expectedHash: string): Promise<void> {\n  await withBaselineSnapshot(runDir, expectedHash, () => undefined)\n}\n\nasync function withBaselineSnapshot<T>(\n  runDir: string,\n  expectedHash: string,\n  use: (baselineRoot: string) => Promise<T> | T,\n): Promise<T> {\n  return withSafeDirectory(runDir, 'baseline', false, async (baselineRoot) => {\n    const actualHash = await hashKnowledgeBase(baselineRoot)\n    if (actualHash !== expectedHash) {\n      throw new Error(\n        `knowledge improvement baseline changed: expected ${expectedHash}, got ${actualHash}`,\n      )\n    }\n    return use(baselineRoot)\n  })\n}\n\nasync function withFrozenCandidateWorkspace<T>(\n  runDir: string,\n  candidate: KnowledgeImprovementCandidateRecord,\n  candidateRoot: string,\n  use: (snapshot: { root: string; hash: string }) => Promise<T> | T,\n): Promise<T> {\n  const snapshotsPath = join(\n    'candidates',\n    safePathSegmentSchema.parse(candidate.candidateId),\n    'snapshots',\n  )\n  return withSafeDirectory(runDir, snapshotsPath, true, async (snapshotsDir) => {\n    const preparation = await mkdtemp(join(snapshotsDir, 'prepare-'))\n    let activated = false\n    try {\n      await copyKnowledgeWorkspace(candidateRoot, preparation)\n      const hash = await hashKnowledgeBase(preparation)\n      try {\n        const result = await withSafeDirectory(snapshotsDir, hash, false, async (existing) => {\n          if ((await hashKnowledgeBase(existing)) !== hash) {\n            throw new Error('knowledge candidate snapshot does not match its content identity')\n          }\n          return use({ root: existing, hash })\n        })\n        await rm(preparation, { recursive: true, force: true })\n        activated = true\n        return result\n      } catch (error) {\n        if (!isMissingFile(error)) throw error\n      }\n      await renameDurable(preparation, join(snapshotsDir, hash))\n      activated = true\n      return withSafeDirectory(snapshotsDir, hash, false, (root) => use({ root, hash }))\n    } finally {\n      if (!activated) await rm(preparation, { recursive: true, force: true })\n    }\n  })\n}\n\nfunction clearCandidateMeasurement(candidate: KnowledgeImprovementCandidateRecord): void {\n  delete candidate.candidateHash\n  delete candidate.evidenceHash\n  delete candidate.promotionPlanHash\n}\n\nfunction findActiveCandidate(\n  state: KnowledgeImprovementRunState,\n): KnowledgeImprovementCandidateRecord | undefined {\n  return [...state.candidates]\n    .reverse()\n    .find((candidate) => candidate.status === 'candidate-ready' || candidate.status === 'running')\n}\n\nasync function copyKnowledgeWorkspace(sourceRoot: string, targetRoot: string): Promise<void> {\n  await rm(targetRoot, { recursive: true, force: true })\n  await mkdir(join(targetRoot, 'knowledge'), { recursive: true })\n  await mkdir(join(targetRoot, 'raw', 'sources'), { recursive: true })\n  await copyIfExists(join(sourceRoot, 'knowledge'), join(targetRoot, 'knowledge'))\n  await copyIfExists(join(sourceRoot, 'raw'), join(targetRoot, 'raw'))\n  await copyIfExists(\n    join(layoutFor(sourceRoot).cacheDir, 'sources.json'),\n    join(layoutFor(targetRoot).cacheDir, 'sources.json'),\n  )\n  await writeKnowledgeIndex(targetRoot)\n}\n\nfunction knowledgeCandidateTransitionPurpose(\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n): string {\n  const action = target === 'candidate' ? 'promotion' : 'restore'\n  return `knowledge-${action}:${contentHash(candidate)}`\n}\n\nasync function knowledgeFilePlanEntries(\n  sourceRoot: string,\n  targetRoot: string,\n): Promise<KnowledgeFileTransactionPlanEntry[]> {\n  const [before, after] = await Promise.all([\n    knowledgeHashEntries(sourceRoot),\n    knowledgeHashEntries(targetRoot),\n  ])\n  const beforeByPath = new Map(before.map((entry) => [entry.path, entry]))\n  const afterByPath = new Map(after.map((entry) => [entry.path, entry]))\n  const paths = [\n    ...new Set([...before.map((entry) => entry.path), ...after.map((entry) => entry.path)]),\n  ].sort((left, right) => left.localeCompare(right))\n  return paths.map((path) => {\n    assertKnowledgeMutationPath(path)\n    const beforeEntry = beforeByPath.get(path)\n    const afterEntry = afterByPath.get(path)\n    return {\n      path,\n      beforeHash: beforeEntry?.transactionHash ?? null,\n      afterHash: afterEntry?.transactionHash ?? null,\n      ...(beforeEntry ? { beforeMode: beforeEntry.mode } : {}),\n      ...(afterEntry ? { afterMode: afterEntry.mode } : {}),\n    }\n  })\n}\n\nasync function knowledgePlanMutations(\n  targetRoot: string,\n  plan: readonly KnowledgeFileTransactionPlanEntry[],\n): Promise<KnowledgeFileMutation[]> {\n  return Promise.all(\n    plan.map(async (entry) => {\n      if (entry.afterHash === null) return { path: entry.path, content: null }\n      const file = await readRegularFileWithinRoot(targetRoot, entry.path)\n      const actualHash = createHash('sha256').update(file.bytes).digest('hex')\n      if (actualHash !== entry.afterHash || file.mode !== entry.afterMode) {\n        throw new Error(`knowledge target file changed before activation: ${entry.path}`)\n      }\n      return { path: entry.path, content: file.bytes, mode: file.mode }\n    }),\n  )\n}\n\nfunction assertCandidateTransitionPlan(\n  plan: readonly KnowledgeFileTransactionPlanEntry[],\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n): void {\n  const approvedDirection = target === 'candidate' ? plan : reverseKnowledgeFilePlan(plan)\n  const actualPlanHash = knowledgeFileTransactionPlanHash(approvedDirection)\n  if (actualPlanHash !== candidate.promotionPlanHash) {\n    throw new Error(\n      `knowledge candidate plan changed after approval: expected ${candidate.promotionPlanHash}, got ${actualPlanHash}`,\n    )\n  }\n}\n\nfunction assertCandidateTransitionTransaction(\n  transaction: KnowledgeFileTransaction,\n  candidate: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n): void {\n  assertCandidateTransitionPlan(transaction.entries, candidate, target)\n}\n\nfunction reverseKnowledgeFilePlan(\n  plan: readonly KnowledgeFileTransactionPlanEntry[],\n): KnowledgeFileTransactionPlanEntry[] {\n  return plan.map((entry) => ({\n    path: entry.path,\n    beforeHash: entry.afterHash,\n    afterHash: entry.beforeHash,\n    ...(entry.afterMode === undefined ? {} : { beforeMode: entry.afterMode }),\n    ...(entry.beforeMode === undefined ? {} : { afterMode: entry.beforeMode }),\n  }))\n}\n\nasync function ensureCandidateTransitionEvent(\n  runDir: string,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n): Promise<void> {\n  if (await hasCandidateTransitionEvent(runDir, candidateRef, target)) return\n  await appendLedger(runDir, {\n    type: target === 'candidate' ? 'candidate.promoted' : 'candidate.restored',\n    runId: candidateRef.runId,\n    candidateId: candidateRef.candidateId,\n    candidateHash: candidateRef.candidateHash,\n    evidenceHash: candidateRef.evidenceHash,\n    promotionPlanHash: candidateRef.promotionPlanHash,\n  })\n}\n\nasync function hasCandidateTransitionEvent(\n  runDir: string,\n  candidateRef: KnowledgeImprovementCandidateRef,\n  target: KnowledgeImprovementTarget,\n): Promise<boolean> {\n  const eventType = target === 'candidate' ? 'candidate.promoted' : 'candidate.restored'\n  let matched = false\n  for (const row of await loadKnowledgeImprovementEventsFromRun(runDir)) {\n    if (row.type !== eventType || row.candidateId !== candidateRef.candidateId) continue\n    if (\n      row.runId !== candidateRef.runId ||\n      row.candidateHash !== candidateRef.candidateHash ||\n      row.evidenceHash !== candidateRef.evidenceHash ||\n      row.promotionPlanHash !== candidateRef.promotionPlanHash\n    ) {\n      throw new Error('persisted knowledge activation event conflicts with the approved candidate')\n    }\n    matched = true\n  }\n  return matched\n}\n\nexport interface KnowledgeImprovementEvent extends Record<string, unknown> {\n  at: string\n  type: string\n}\n\nexport async function loadKnowledgeImprovementEvents(\n  root: string,\n  runId: string,\n): Promise<KnowledgeImprovementEvent[]> {\n  const parsedRunId = runIdSchema.parse(runId)\n  try {\n    return await withKnowledgeImprovementRun(root, parsedRunId, false, (runDir) =>\n      loadKnowledgeImprovementEventsFromRun(runDir),\n    )\n  } catch (error) {\n    if (isMissingFile(error)) return []\n    throw error\n  }\n}\n\nasync function loadKnowledgeImprovementEventsFromRun(\n  runDir: string,\n): Promise<KnowledgeImprovementEvent[]> {\n  const events: KnowledgeImprovementEvent[] = []\n  try {\n    for (const file of await listRegularFilesWithinRoot(runDir, 'events')) {\n      const name = file.path.slice('events/'.length)\n      if (name.includes('/') || !name.endsWith('.json')) {\n        throw new Error(`knowledge event store contains an unsupported entry: ${name}`)\n      }\n      events.push(parseKnowledgeImprovementEvent(JSON.parse(file.bytes.toString('utf8'))))\n    }\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n\n  const unique = new Map<string, KnowledgeImprovementEvent>()\n  for (const event of events) {\n    const { at: _at, ...semantic } = event\n    unique.set(contentHash(semantic), event)\n  }\n  return [...unique.values()].sort((left, right) => left.at.localeCompare(right.at))\n}\n\nfunction parseKnowledgeImprovementEvent(value: unknown): KnowledgeImprovementEvent {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) {\n    throw new Error('knowledge improvement event is not an object')\n  }\n  const event = value as Record<string, unknown>\n  if (typeof event.at !== 'string' || typeof event.type !== 'string') {\n    throw new Error('knowledge improvement event is missing at or type')\n  }\n  return event as KnowledgeImprovementEvent\n}\n\nasync function copyIfExists(source: string, target: string): Promise<void> {\n  let sourceStat: Awaited<ReturnType<typeof lstat>>\n  try {\n    sourceStat = await lstat(source)\n  } catch (error) {\n    if (isMissingFile(error)) return\n    throw error\n  }\n  if (!sourceStat.isDirectory() && !sourceStat.isFile()) {\n    throw new Error(`knowledge surface contains an unsupported filesystem entry: ${source}`)\n  }\n  await mkdir(dirname(target), { recursive: true })\n  await cp(source, target, { recursive: sourceStat.isDirectory(), dereference: false })\n}\n\nexport async function hashKnowledgeBase(root: string): Promise<string> {\n  return withKnowledgeRead(root, () => hashKnowledgeBaseUnlocked(root))\n}\n\nasync function hashKnowledgeBaseUnlocked(root: string): Promise<string> {\n  const entries = await knowledgeHashEntries(root)\n  return sha256(JSON.stringify(entries.map(({ path, hash, mode }) => ({ path, hash, mode }))))\n}\n\ninterface KnowledgeFileIdentity {\n  path: string\n  hash: string\n  transactionHash: string\n  mode: number\n}\n\nasync function knowledgeHashEntries(root: string): Promise<KnowledgeFileIdentity[]> {\n  const entries: KnowledgeFileIdentity[] = []\n  for (const rel of ['knowledge', 'raw']) {\n    try {\n      for (const file of await listRegularFilesWithinRoot(root, rel)) {\n        entries.push(knowledgeFileIdentity(file.path, file.bytes, file.mode))\n      }\n    } catch (error) {\n      if (!isMissingFile(error)) throw error\n    }\n  }\n  const sourceRegistry = relative(root, layoutFor(root).sourceRegistryPath).replace(/\\\\/g, '/')\n  try {\n    const file = await readRegularFileWithinRoot(root, sourceRegistry)\n    entries.push(knowledgeFileIdentity(sourceRegistry, file.bytes, file.mode))\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n  entries.sort((a, b) => a.path.localeCompare(b.path))\n  return entries\n}\n\nfunction knowledgeFileIdentity(path: string, bytes: Buffer, mode: number): KnowledgeFileIdentity {\n  return {\n    path,\n    hash: sha256(bytes.toString('base64')),\n    transactionHash: createHash('sha256').update(bytes).digest('hex'),\n    mode,\n  }\n}\n\nasync function acquireRunLease(\n  runDir: string,\n  options: { ownerId: string; ttlMs: number },\n): Promise<LeaseHandle> {\n  const path = join(runDir, 'run.lock.durable')\n  const acquired = await acquireDurableFileLock(runDir, {\n    lockfilePath: path,\n    staleMs: options.ttlMs,\n  })\n  return {\n    ownerId: options.ownerId,\n    assertOwned: acquired.assertOwned,\n    release: acquired.release,\n  }\n}\n\nasync function blockRun(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  reason: string,\n  onState: KnowledgeImprovementOptions['onState'],\n  now: () => Date,\n): Promise<KnowledgeImprovementRunState> {\n  state.status = 'blocked'\n  state.blockedReason = reason\n  state.updatedAt = now().toISOString()\n  await saveState(runDir, state, onState)\n  return state\n}\n\nasync function saveState(\n  runDir: string,\n  state: KnowledgeImprovementRunState,\n  onState?: KnowledgeImprovementOptions['onState'],\n): Promise<void> {\n  await writeJsonDurableWithinRoot(\n    runDir,\n    'state.json',\n    KnowledgeImprovementRunStateSchema.parse(state),\n  )\n  await onState?.(state)\n}\n\nasync function appendLedger(runDir: string, value: Record<string, unknown>): Promise<void> {\n  const type = value.type\n  if (typeof type !== 'string' || type.length === 0) {\n    throw new Error('knowledge improvement event requires a type')\n  }\n  const relativePath = join('events', `${contentHash(value)}.json`).replace(/\\\\/g, '/')\n  try {\n    const file = await readRegularFileWithinRoot(runDir, relativePath)\n    const existing = parseKnowledgeImprovementEvent(JSON.parse(file.bytes.toString('utf8')))\n    const { at: _at, ...semantic } = existing\n    if (canonicalJson(semantic) !== canonicalJson(value)) {\n      throw new Error('knowledge improvement event identity conflicts with durable content')\n    }\n    return\n  } catch (error) {\n    if (!isMissingFile(error)) throw error\n  }\n  await writeJsonDurableWithinRoot(runDir, relativePath, {\n    at: new Date().toISOString(),\n    ...value,\n  })\n}\n\nfunction candidateEvidenceRelativePath(candidateId: string): string {\n  return join('candidates', safePathSegmentSchema.parse(candidateId), 'evidence.json').replace(\n    /\\\\/g,\n    '/',\n  )\n}\n\nfunction descendantPath(root: string, path: string): string | undefined {\n  const value = relative(resolve(root), resolve(path)).replace(/\\\\/g, '/')\n  if (value === '' || value === '..' || value.startsWith('../') || isAbsolute(value))\n    return undefined\n  return value\n}\n\nfunction assertExactCandidatePlatform(): void {\n  if (process.platform !== 'linux') {\n    throw new Error('exact knowledge candidate workflows require Linux directory descriptors')\n  }\n}\n\nfunction average(values: readonly number[]): number {\n  const finite = values.filter(Number.isFinite)\n  if (finite.length === 0) return 0\n  return finite.reduce((sum, value) => sum + value, 0) / finite.length\n}\n","/**\n * Claim-grounding mode for `runVerifiedResearchLoop`.\n *\n * The two-agent loop's existing verifier judges a source's on-topic RELEVANCE\n * (is this page about the goal?). On the topic sets we have measured, its\n * cleanliness win is dominated by DE-DUPLICATION — which a deterministic\n * content-hash / canonical-URL check captures at ~none of the LLM premium (see\n * `docs/results/cost-quality.md`). That makes the LLM verifier look expensive\n * for what a cheap rule already does.\n *\n * Claim-grounding targets a DIFFERENT, harder error band: a citation that is\n * relevant and unique but **misattributed** — the page is on-topic, the URL is\n * real, yet the specific CLAIM the source is cited for does NOT actually appear\n * in the page. This is the citation-fabrication failure mode of LLM research:\n * the model writes a plausible sentence and hangs a real URL off it that never\n * says any such thing. Neither de-dup nor a relevance judge catches it (both can\n * pass a misattributed-but-on-topic page); only checking the claim against the\n * fetched text does.\n *\n * The check is EXECUTABLE GROUND TRUTH, not another LLM opinion: the worker\n * attaches the specific claim it is citing the source for, and the verifier\n * tests whether that claim is PRESENT (verbatim, normalized, or as a sufficient\n * content-word overlap / close paraphrase) in the `htmlToText` output of the\n * page the worker actually fetched. A claim that is not grounded is rejected as\n * misattributed. Because the oracle is deterministic text presence — not a model\n * call — it is a deployable, non-oracle verifier: it can run in production with\n * zero inference cost, OR be composed with the LLM relevance verifier so the\n * loop rejects BOTH off-topic AND misattributed sources.\n *\n * This module is content-free and any-topic: it adds (1) a way for a proposal to\n * carry the claim it is cited for, (2) the `groundClaimInText` oracle, and (3) a\n * `ResearchDriver` that gates on grounding. It composes the existing\n * `ResearchDriver` / `ResearchSourceProposal` contracts and the shipped\n * `htmlToText`; it reinvents none of them.\n */\n\nimport type {\n  ResearchSourceProposal,\n  SourceVerdict,\n  SourceVerificationContext,\n} from './two-agent-research-loop'\nimport {\n  createTangleRouterClient,\n  type RouterClient,\n  type TangleRouterOptions,\n} from './web-research-worker'\n\n/**\n * Metadata key under which a proposal carries the specific claim it is cited\n * for. The worker sets `metadata[citedClaimKey] = '<the claim>'`; the\n * claim-grounding driver reads it and checks it against the fetched page text.\n */\nexport const citedClaimKey = 'citedClaim'\n\n/** Read the cited claim a proposal carries, if any. */\nexport function citedClaimOf(source: ResearchSourceProposal): string | undefined {\n  const claim = source.metadata?.[citedClaimKey]\n  return typeof claim === 'string' && claim.trim() ? claim.trim() : undefined\n}\n\n/** Attach a cited claim to a proposal (immutably returns a new proposal). */\nexport function withCitedClaim(\n  source: ResearchSourceProposal,\n  claim: string,\n): ResearchSourceProposal {\n  return { ...source, metadata: { ...source.metadata, [citedClaimKey]: claim } }\n}\n\nexport interface GroundingResult {\n  /** True when the claim is sufficiently present in the page text. */\n  grounded: boolean\n  /** How the claim matched (or why it didn't). For audit/notes. */\n  mode: 'verbatim' | 'normalized' | 'overlap' | 'absent' | 'empty-claim' | 'empty-text'\n  /**\n   * Fraction of the claim's content words found in the page text. 1 for a\n   * verbatim/normalized hit; the measured overlap otherwise.\n   */\n  overlap: number\n  /** Content words present in the claim but NOT in the page text. */\n  missingWords: string[]\n}\n\nexport interface GroundClaimOptions {\n  /**\n   * Minimum fraction of the claim's content words that must appear in the page\n   * text to count as a close paraphrase when there is no verbatim/normalized\n   * hit. Default 0.7 — a high bar, because a misattribution is exactly a claim\n   * whose specific words the page does not contain.\n   */\n  minOverlap?: number\n  /**\n   * Content words shorter than this are ignored (drops \"the\", \"of\", \"is\", …)\n   * and never count toward overlap. Default 3.\n   */\n  minWordLength?: number\n}\n\n/**\n * Stopwords stripped before overlap scoring so the bar measures the claim's\n * SUBSTANTIVE words (the numbers, nouns, methods it asserts), not filler a\n * misattributed page would trivially share with the real one.\n */\nconst stopwords = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'but',\n  'of',\n  'to',\n  'in',\n  'on',\n  'for',\n  'with',\n  'as',\n  'by',\n  'at',\n  'from',\n  'that',\n  'this',\n  'these',\n  'those',\n  'it',\n  'its',\n  'is',\n  'are',\n  'was',\n  'were',\n  'be',\n  'been',\n  'being',\n  'has',\n  'have',\n  'had',\n  'can',\n  'will',\n  'would',\n  'should',\n  'may',\n  'might',\n  'not',\n  'no',\n  'than',\n  'then',\n  'over',\n  'under',\n  'about',\n  'into',\n  'their',\n  'they',\n  'them',\n])\n\n/** Normalize for presence checks: lowercase, collapse whitespace + punctuation. */\nfunction normalize(text: string): string {\n  return text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .replace(/\\s+/g, ' ')\n    .trim()\n}\n\n/** The claim's substantive content words (deduped, stopwords + short words removed). */\nfunction contentWords(claim: string, minWordLength: number): string[] {\n  const words = normalize(claim)\n    .split(' ')\n    .filter((word) => word.length >= minWordLength && !stopwords.has(word))\n  return [...new Set(words)]\n}\n\n/**\n * THE ORACLE. Is `claim` grounded in `pageText` (the `htmlToText` output of the\n * page the worker fetched)? Deterministic, no model call:\n *\n *   1. verbatim — the claim string appears as-is (case-insensitive).\n *   2. normalized — the claim appears after collapsing punctuation/whitespace\n *      on both sides (so \"5.4x\" vs \"5.4 x\", smart quotes, etc. still match).\n *   3. overlap — a close paraphrase: at least `minOverlap` of the claim's\n *      substantive content words appear in the page text. A misattributed page\n *      fails here because the SPECIFIC words the claim asserts are absent.\n *\n * Returns the match mode, the measured overlap, and the missing content words —\n * enough for the driver to give a precise rejection reason and for a test/doc to\n * audit WHY a claim grounded or didn't.\n */\nexport function groundClaimInText(\n  claim: string,\n  pageText: string,\n  options: GroundClaimOptions = {},\n): GroundingResult {\n  const minOverlap = options.minOverlap ?? 0.7\n  const minWordLength = Math.max(1, options.minWordLength ?? 3)\n\n  const claimTrimmed = claim.trim()\n  if (!claimTrimmed) return { grounded: false, mode: 'empty-claim', overlap: 0, missingWords: [] }\n  if (!pageText.trim()) return { grounded: false, mode: 'empty-text', overlap: 0, missingWords: [] }\n\n  const haystackLower = pageText.toLowerCase()\n  if (haystackLower.includes(claimTrimmed.toLowerCase())) {\n    return { grounded: true, mode: 'verbatim', overlap: 1, missingWords: [] }\n  }\n\n  const haystackNorm = normalize(pageText)\n  const claimNorm = normalize(claimTrimmed)\n  if (claimNorm && haystackNorm.includes(claimNorm)) {\n    return { grounded: true, mode: 'normalized', overlap: 1, missingWords: [] }\n  }\n\n  const words = contentWords(claimTrimmed, minWordLength)\n  if (words.length === 0) {\n    // The claim has no substantive content words (all stopwords/short). With no\n    // verbatim/normalized hit there is nothing to ground — treat as absent.\n    return { grounded: false, mode: 'absent', overlap: 0, missingWords: [] }\n  }\n  // Word-boundary presence so \"rotary\" does not match inside \"rotaryxyz\".\n  const present = words.filter((word) =>\n    new RegExp(`\\\\b${word.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')}\\\\b`).test(haystackNorm),\n  )\n  const missingWords = words.filter((word) => !present.includes(word))\n  const overlap = present.length / words.length\n  const grounded = overlap >= minOverlap\n  return { grounded, mode: grounded ? 'overlap' : 'absent', overlap, missingWords }\n}\n\nexport interface ClaimGroundingDriverOptions extends GroundClaimOptions {\n  /**\n   * Optional second verifier to compose AFTER grounding passes. When set, a\n   * source must BOTH ground its claim AND pass this verifier (e.g. the LLM\n   * relevance driver's `verifySource`). Lets the loop reject off-topic AND\n   * misattributed sources in one driver. Omit for the pure, zero-inference\n   * grounding gate.\n   */\n  relevanceVerifier?: (\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ) => Promise<SourceVerdict> | SourceVerdict\n  /**\n   * What to do when a proposal carries NO cited claim. `'reject'` (default) is\n   * fail-closed: in claim-grounding mode every source must declare what it is\n   * cited for, so an un-annotated source is treated as ungrounded. `'accept'`\n   * lets un-annotated sources through to the relevance verifier (if any) —\n   * useful when mixing annotated and legacy proposals.\n   */\n  onMissingClaim?: 'reject' | 'accept'\n}\n\n/**\n * A `ResearchDriver`-shaped verifier (just the `verifySource` arm) that gates on\n * CLAIM GROUNDING: it rejects a source whose cited claim is not present in its\n * fetched page text — a misattributed / fabricated citation — and (optionally)\n * composes a relevance verifier after grounding passes.\n *\n * The returned function matches `ResearchDriver['verifySource']`, so it drops\n * straight into `runVerifiedResearchLoop` as `{ verifySource: createClaimGroundingVerifier(...) }`.\n */\nexport function createClaimGroundingVerifier(options: ClaimGroundingDriverOptions = {}) {\n  const onMissingClaim = options.onMissingClaim ?? 'reject'\n  return async function verifySource(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<SourceVerdict> {\n    const claim = citedClaimOf(source)\n    if (!claim) {\n      if (onMissingClaim === 'reject') {\n        return {\n          accept: false,\n          reason: 'no cited claim: claim-grounding mode requires every source to declare its claim',\n        }\n      }\n      // accept-on-missing: fall through to the relevance verifier (or accept).\n      return options.relevanceVerifier ? options.relevanceVerifier(source, ctx) : { accept: true }\n    }\n\n    const grounding = groundClaimInText(claim, source.text, options)\n    if (!grounding.grounded) {\n      const detail =\n        grounding.mode === 'empty-text'\n          ? 'fetched page has no text'\n          : `claim not found in the fetched page (overlap ${(grounding.overlap * 100).toFixed(0)}%${\n              grounding.missingWords.length\n                ? `, missing: ${grounding.missingWords.slice(0, 6).join(', ')}`\n                : ''\n            })`\n      return {\n        accept: false,\n        reason: `misattributed citation: ${detail}`,\n      }\n    }\n\n    // Claim is grounded. Compose the relevance verifier if one was provided.\n    if (options.relevanceVerifier) return options.relevanceVerifier(source, ctx)\n    return { accept: true }\n  }\n}\n\nexport interface WorkerClaimDecorationOptions {\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /** Max output tokens for the claim-extraction call. Default 1200 (glm floor). */\n  maxTokens?: number\n}\n\n/**\n * Ask an LLM to state, for one source, the single specific factual claim a\n * researcher would cite THIS page for toward the goal. Used to DECORATE the\n * sources a relevance-only worker produced with the claim a citation would make,\n * so the claim-grounding verifier has something executable to check. The model\n * is told to ground the claim in the provided excerpt; the verifier then checks\n * it against the FULL page text independently — the model does not get to mark\n * its own homework.\n *\n * Returns the proposal annotated via `withCitedClaim`, or the original proposal\n * unchanged if the model returns nothing parseable (the verifier's\n * `onMissingClaim` policy then decides).\n */\nexport function createClaimDecorator(options: WorkerClaimDecorationOptions = {}) {\n  const maxTokens = options.maxTokens ?? 1200\n  return async function decorate(\n    source: ResearchSourceProposal,\n    goal: string,\n  ): Promise<ResearchSourceProposal> {\n    const router = options.router ?? createTangleRouterClient(options.router_options)\n    const excerpt = source.text.slice(0, 1500)\n    const system =\n      'You extract the single most important factual claim a researcher would cite a page for. ' +\n      \"State ONE concrete, checkable sentence using the page's own key terms and numbers. \" +\n      'Do NOT invent facts not in the excerpt. Respond with ONLY the claim sentence, no prose.'\n    const user = [\n      `Research goal: ${goal}`,\n      `Page title: ${source.title ?? '(none)'}`,\n      `Page excerpt:\\n${excerpt}`,\n      'The single claim this page should be cited for:',\n    ].join('\\n\\n')\n    let raw = ''\n    try {\n      raw = await router.chat(\n        [\n          { role: 'system', content: system },\n          { role: 'user', content: user },\n        ],\n        maxTokens,\n      )\n    } catch {\n      return source\n    }\n    const claim = raw.trim().split('\\n')[0]?.trim()\n    if (!claim) return source\n    return withCitedClaim(source, claim)\n  }\n}\n","import type { JsonValue, JudgeConfig, Scenario } from '@tangle-network/agent-eval/campaign'\nimport { groundClaimInText } from './claim-grounding'\nimport { lintKnowledgeIndex } from './lint'\nimport type { RagAnswerQualityResult, RagGapFinding } from './rag-improvement-loop'\nimport type { KnowledgeIndex } from './types'\nimport { validateKnowledgeIndex } from './validate'\n\nexport type RagEvalProvider =\n  | 'agent-knowledge'\n  | 'ragas'\n  | 'deepeval'\n  | 'trulens'\n  | 'ragchecker'\n  | 'custom'\n\nexport type RagEvalMetricKey =\n  | 'context_precision'\n  | 'context_recall'\n  | 'context_relevance'\n  | 'context_sufficiency'\n  | 'faithfulness'\n  | 'groundedness'\n  | 'answer_relevance'\n  | 'answer_correctness'\n  | 'citation_support'\n  | 'abstention'\n  | 'unsupported_answer_rate'\n\nexport type RagEvalSlice =\n  | 'known-answer'\n  | 'paraphrase'\n  | 'distractor'\n  | 'freshness'\n  | 'multi-source'\n  | 'unanswerable'\n  | 'long-tail'\n  | 'custom'\n\nexport interface RagEvalContext {\n  id: string\n  text: string\n  rank?: number\n  pageId?: string\n  sourceId?: string\n  anchorId?: string\n  stale?: boolean\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagEvalCitation {\n  id: string\n  claimId?: string\n  contextId?: string\n  pageId?: string\n  sourceId?: string\n  anchorId?: string\n  quote?: string\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagEvalClaim {\n  id: string\n  text: string\n  citationIds?: readonly string[]\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagRequiredContext {\n  id?: string\n  text?: string\n  pageId?: string\n  sourceId?: string\n  anchorId?: string\n}\n\nexport interface RagAnswerEvalScenario extends Scenario {\n  kind: 'rag-answer-eval'\n  query: string\n  referenceAnswer?: string\n  expectedClaims?: readonly string[]\n  forbiddenClaims?: readonly string[]\n  requiredContext?: readonly RagRequiredContext[]\n  unanswerable?: boolean\n  requireCitations?: boolean\n  slices?: readonly RagEvalSlice[]\n  thresholds?: Partial<Record<RagEvalMetricKey, number>>\n}\n\nexport interface ExternalRagEvalScore {\n  provider: RagEvalProvider | string\n  scores: Record<string, number>\n  reasons?: Record<string, string>\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagAnswerEvalArtifact {\n  query: string\n  answer: string\n  contexts: readonly RagEvalContext[]\n  claims?: readonly RagEvalClaim[]\n  citations?: readonly RagEvalCitation[]\n  abstained?: boolean\n  durationMs?: number\n  costUsd?: number\n  externalScores?: readonly ExternalRagEvalScore[]\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagAnswerMetricSummary {\n  metrics: Record<RagEvalMetricKey, number>\n  composite: number\n  passed: boolean\n  findings: readonly RagGapFinding[]\n  claimCount: number\n  supportedClaimCount: number\n  citedClaimCount: number\n  supportedCitationCount: number\n  matchedRequiredContextCount: number\n  requiredContextCount: number\n  providerScores: Record<string, Record<RagEvalMetricKey, number>>\n}\n\nexport interface RagAnswerQualityJudgeOptions {\n  name?: string\n  thresholds?: Partial<Record<RagEvalMetricKey, number>>\n  weights?: Partial<Record<RagEvalMetricKey, number>>\n  externalScorePolicy?: 'prefer-external' | 'deterministic-first'\n  minClaimSupport?: number\n}\n\nexport interface RagAnswerEvalCase {\n  scenario: RagAnswerEvalScenario\n  artifact: RagAnswerEvalArtifact\n}\n\nexport interface RagAnswerQualityHookOptions {\n  scenarios: readonly RagAnswerEvalScenario[]\n  run: (scenario: RagAnswerEvalScenario) => MaybePromise<RagAnswerEvalArtifact>\n  externalEvaluator?: (\n    item: RagAnswerEvalCase,\n  ) => MaybePromise<ExternalRagEvalScore | readonly ExternalRagEvalScore[] | undefined>\n  thresholds?: Partial<Record<RagEvalMetricKey, number>>\n  weights?: Partial<Record<RagEvalMetricKey, number>>\n}\n\nexport interface RagCalibrationOptions {\n  scenario: RagAnswerEvalScenario\n  strong: RagAnswerEvalArtifact\n  weak: RagAnswerEvalArtifact\n  judge?: JudgeConfig<RagAnswerEvalArtifact, RagAnswerEvalScenario>\n  minStrongScore?: number\n  maxWeakScore?: number\n  signal?: AbortSignal\n}\n\nexport interface RagCalibrationResult {\n  passed: boolean\n  strongScore: number\n  weakScore: number\n  gap: number\n}\n\nexport interface KnowledgeBaseQualityOptions {\n  now?: Date\n  strict?: boolean\n  minCitationRate?: number\n  maxStaleSourceRate?: number\n}\n\nexport interface KnowledgeBaseQualityReport {\n  ok: boolean\n  metrics: {\n    page_count: number\n    source_count: number\n    citation_rate: number\n    source_backed_page_rate: number\n    stale_source_rate: number\n    duplicate_source_hash_rate: number\n    lint_error_count: number\n    lint_warning_count: number\n  }\n  findings: readonly RagGapFinding[]\n}\n\ntype MaybePromise<T> = T | Promise<T>\n\nconst defaultThresholds: Partial<Record<RagEvalMetricKey, number>> = {\n  context_precision: 0.5,\n  context_recall: 0.8,\n  context_relevance: 0.5,\n  context_sufficiency: 0.8,\n  faithfulness: 0.9,\n  answer_relevance: 0.7,\n  citation_support: 0.9,\n  abstention: 1,\n  unsupported_answer_rate: 0,\n}\n\nconst defaultWeights: Partial<Record<RagEvalMetricKey, number>> = {\n  context_relevance: 1,\n  context_sufficiency: 1,\n  faithfulness: 2,\n  answer_relevance: 1,\n  citation_support: 1,\n  abstention: 1,\n}\n\nconst metricAliases: Record<string, RagEvalMetricKey> = {\n  answer_correctness: 'answer_correctness',\n  answer_relevance: 'answer_relevance',\n  answer_relevancy: 'answer_relevance',\n  answerrelevancy: 'answer_relevance',\n  context_precision: 'context_precision',\n  context_recall: 'context_recall',\n  context_relevance: 'context_relevance',\n  context_relevancy: 'context_relevance',\n  context_sufficiency: 'context_sufficiency',\n  contextual_precision: 'context_precision',\n  contextual_recall: 'context_recall',\n  contextual_relevancy: 'context_relevance',\n  faithfulness: 'faithfulness',\n  groundedness: 'groundedness',\n  claim_recall: 'context_recall',\n  claim_precision: 'faithfulness',\n  citation_support: 'citation_support',\n  abstention: 'abstention',\n  unsupported_answer_rate: 'unsupported_answer_rate',\n}\n\nexport function ragAnswerQualityJudge(\n  options: RagAnswerQualityJudgeOptions = {},\n): JudgeConfig<RagAnswerEvalArtifact, RagAnswerEvalScenario> {\n  return {\n    name: options.name ?? 'rag-answer-quality',\n    dimensions: [\n      { key: 'context_precision', description: 'share of retrieved context that is useful' },\n      { key: 'context_recall', description: 'share of required evidence present in context' },\n      { key: 'context_relevance', description: 'context relevance to the query and answer target' },\n      { key: 'context_sufficiency', description: 'whether context is enough to answer' },\n      { key: 'faithfulness', description: 'share of answer claims supported by retrieved context' },\n      { key: 'answer_relevance', description: 'answer addresses the user query' },\n      { key: 'answer_correctness', description: 'answer contains expected claims' },\n      { key: 'citation_support', description: 'citations support the claims they cite' },\n      { key: 'abstention', description: 'answer abstains exactly when the case is unanswerable' },\n    ],\n    appliesTo: (scenario) => scenario.kind === 'rag-answer-eval',\n    async score({ artifact, scenario }) {\n      const summary = scoreRagAnswerArtifact(artifact, scenario, options)\n      return {\n        dimensions: summary.metrics,\n        composite: summary.composite,\n        notes: summary.findings.map((finding) => finding.message).join('; '),\n      }\n    },\n  }\n}\n\nexport function scoreRagAnswerArtifact(\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  options: RagAnswerQualityJudgeOptions = {},\n): RagAnswerMetricSummary {\n  const claims = normalizeClaims(artifact)\n  const abstained = artifact.abstained ?? looksLikeAbstention(artifact.answer)\n  const requiredTargets = requiredContextTargets(scenario)\n  const matchedRequiredContextCount = requiredTargets.filter((target) =>\n    artifact.contexts.some((context) => contextMatchesTarget(context, target)),\n  ).length\n  const requiredContextCount = requiredTargets.length\n  const contextRecall =\n    requiredContextCount === 0\n      ? neutralScore(Boolean(scenario.unanswerable) || artifact.contexts.length > 0)\n      : matchedRequiredContextCount / requiredContextCount\n  const relevantContextCount = artifact.contexts.filter((context) =>\n    contextIsRelevant(context, scenario),\n  ).length\n  const contextPrecision =\n    artifact.contexts.length === 0\n      ? scenario.unanswerable\n        ? 1\n        : 0\n      : relevantContextCount / artifact.contexts.length\n  const contextRelevance =\n    artifact.contexts.length === 0\n      ? scenario.unanswerable\n        ? 1\n        : 0\n      : average(artifact.contexts.map((context) => contextRelevanceScore(context, scenario)))\n  const contextSufficiency = requiredContextCount === 0 ? contextRelevance : contextRecall\n  const support = claims.map((claim) => claimSupport(claim.text, artifact.contexts, options))\n  const supportedClaimCount = support.filter(Boolean).length\n  const faithfulness =\n    claims.length === 0 ? (abstained ? 1 : 0) : supportedClaimCount / Math.max(1, claims.length)\n  const citation = scoreCitations(claims, artifact, scenario, options)\n  const answerRelevance = scoreAnswerRelevance(artifact, scenario, abstained)\n  const answerCorrectness = scoreAnswerCorrectness(artifact, scenario, abstained)\n  const abstention = scenario.unanswerable ? (abstained ? 1 : 0) : abstained ? 0 : 1\n  const unsupportedAnswerRate =\n    claims.length === 0 ? (abstained ? 0 : 1) : 1 - supportedClaimCount / Math.max(1, claims.length)\n\n  const deterministicMetrics: Record<RagEvalMetricKey, number> = {\n    context_precision: clamp01(contextPrecision),\n    context_recall: clamp01(contextRecall),\n    context_relevance: clamp01(contextRelevance),\n    context_sufficiency: clamp01(contextSufficiency),\n    faithfulness: clamp01(faithfulness),\n    groundedness: clamp01(faithfulness),\n    answer_relevance: clamp01(answerRelevance),\n    answer_correctness: clamp01(answerCorrectness),\n    citation_support: clamp01(citation.support),\n    abstention: clamp01(abstention),\n    unsupported_answer_rate: clamp01(unsupportedAnswerRate),\n  }\n  const providerScores = normalizeExternalRagScores(artifact.externalScores ?? [])\n  const metrics = mergeMetrics(deterministicMetrics, providerScores, options.externalScorePolicy)\n  const thresholds = { ...defaultThresholds, ...scenario.thresholds, ...options.thresholds }\n  const findings = diagnoseRagAnswerFailure(metrics, scenario, thresholds)\n  const composite = weightedComposite(metrics, options.weights ?? defaultWeights)\n\n  return {\n    metrics,\n    composite,\n    passed: findings.every(\n      (finding) => finding.severity !== 'error' && finding.severity !== 'critical',\n    ),\n    findings,\n    claimCount: claims.length,\n    supportedClaimCount,\n    citedClaimCount: citation.citedClaimCount,\n    supportedCitationCount: citation.supportedCitationCount,\n    matchedRequiredContextCount,\n    requiredContextCount,\n    providerScores,\n  }\n}\n\nexport function diagnoseRagAnswerFailure(\n  metrics: Record<RagEvalMetricKey, number>,\n  scenario: RagAnswerEvalScenario,\n  thresholds: Partial<Record<RagEvalMetricKey, number>> = defaultThresholds,\n): RagGapFinding[] {\n  const findings: RagGapFinding[] = []\n  if (below(metrics.context_recall, thresholds.context_recall)) {\n    findings.push({\n      id: `${scenario.id}:context-recall`,\n      kind: scenario.slices?.includes('multi-source')\n        ? 'missing-multihop-evidence'\n        : 'retrieval-miss',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: 'Required evidence was not present in retrieved context.',\n      evidence: { context_recall: metrics.context_recall },\n    })\n  }\n  if (below(metrics.context_precision, thresholds.context_precision)) {\n    findings.push({\n      id: `${scenario.id}:context-precision`,\n      kind: 'retrieval-noise',\n      severity: 'warning',\n      scenarioId: scenario.id,\n      message: 'Retrieved context contains too much irrelevant material.',\n      evidence: { context_precision: metrics.context_precision },\n    })\n  }\n  if (below(metrics.faithfulness, thresholds.faithfulness)) {\n    findings.push({\n      id: `${scenario.id}:faithfulness`,\n      kind: 'generator-unsupported-claim',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: 'The answer contains claims not supported by retrieved context.',\n      evidence: { faithfulness: metrics.faithfulness },\n    })\n  }\n  if (below(metrics.citation_support, thresholds.citation_support)) {\n    findings.push({\n      id: `${scenario.id}:citation-support`,\n      kind: 'citation-mismatch',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: 'Citations do not support the claims they are attached to.',\n      evidence: { citation_support: metrics.citation_support },\n    })\n  }\n  if (below(metrics.abstention, thresholds.abstention)) {\n    findings.push({\n      id: `${scenario.id}:abstention`,\n      kind: 'incorrect-abstention',\n      severity: 'error',\n      scenarioId: scenario.id,\n      message: scenario.unanswerable\n        ? 'The system answered a case marked unanswerable.'\n        : 'The system abstained from an answerable case.',\n      evidence: { abstention: metrics.abstention },\n    })\n  }\n  return findings\n}\n\nexport function createRagAnswerQualityHook(\n  options: RagAnswerQualityHookOptions,\n): () => Promise<RagAnswerQualityResult> {\n  return async () => {\n    const summaries: RagAnswerMetricSummary[] = []\n    const findings: RagGapFinding[] = []\n    for (const scenario of options.scenarios) {\n      const initialArtifact = await options.run(scenario)\n      const external = await options.externalEvaluator?.({ scenario, artifact: initialArtifact })\n      const artifact = external\n        ? {\n            ...initialArtifact,\n            externalScores: [\n              ...(initialArtifact.externalScores ?? []),\n              ...(Array.isArray(external) ? external : [external]),\n            ],\n          }\n        : initialArtifact\n      const summary = scoreRagAnswerArtifact(artifact, scenario, {\n        thresholds: options.thresholds,\n        weights: options.weights,\n      })\n      summaries.push(summary)\n      findings.push(...summary.findings)\n    }\n    const metrics = aggregateRagAnswerMetrics(summaries)\n    return {\n      passed: findings.length === 0,\n      metrics,\n      findings,\n      metadata: { scenarioCount: options.scenarios.length },\n    }\n  }\n}\n\nexport async function calibrateRagAnswerJudge(\n  options: RagCalibrationOptions,\n): Promise<RagCalibrationResult> {\n  const judge = options.judge ?? ragAnswerQualityJudge()\n  const strong = await judge.score({\n    artifact: options.strong,\n    scenario: options.scenario,\n    signal: options.signal ?? new AbortController().signal,\n  })\n  const weak = await judge.score({\n    artifact: options.weak,\n    scenario: options.scenario,\n    signal: options.signal ?? new AbortController().signal,\n  })\n  const strongScore = strong.composite\n  const weakScore = weak.composite\n  const minStrongScore = options.minStrongScore ?? 0.7\n  const maxWeakScore = options.maxWeakScore ?? 0.3\n  return {\n    passed: strongScore >= minStrongScore && weakScore <= maxWeakScore,\n    strongScore,\n    weakScore,\n    gap: strongScore - weakScore,\n  }\n}\n\nexport function normalizeExternalRagScores(\n  scores: readonly ExternalRagEvalScore[],\n): Record<string, Record<RagEvalMetricKey, number>> {\n  const normalized: Record<string, Record<RagEvalMetricKey, number>> = {}\n  for (const item of scores) {\n    const provider = item.provider || 'custom'\n    const providerScores = (normalized[provider] ?? {}) as Record<RagEvalMetricKey, number>\n    for (const [key, value] of Object.entries(item.scores)) {\n      const canonical = metricAliases[normalizeMetricName(key)]\n      if (!canonical) continue\n      if (Number.isFinite(value)) providerScores[canonical] = clamp01(value)\n    }\n    normalized[provider] = providerScores\n  }\n  return normalized\n}\n\nexport function toRagasEvaluationRows(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    user_input: scenario.query,\n    response: artifact.answer,\n    retrieved_contexts: artifact.contexts.map((context) => context.text),\n    reference: scenario.referenceAnswer,\n    reference_contexts: requiredContextTexts(scenario),\n  }))\n}\n\nexport function toDeepEvalTestCases(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    input: scenario.query,\n    actual_output: artifact.answer,\n    expected_output: scenario.referenceAnswer,\n    retrieval_context: artifact.contexts.map((context) => context.text),\n    context: requiredContextTexts(scenario),\n  }))\n}\n\nexport function toTruLensRecords(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    input: scenario.query,\n    output: artifact.answer,\n    context: artifact.contexts.map((context) => context.text).join('\\n\\n'),\n  }))\n}\n\nexport function toRagCheckerRecords(cases: readonly RagAnswerEvalCase[]) {\n  return cases.map(({ scenario, artifact }) => ({\n    query_id: scenario.id,\n    query: scenario.query,\n    gt_answer: scenario.referenceAnswer,\n    response: artifact.answer,\n    retrieved_context: artifact.contexts.map((context) => ({\n      doc_id: context.id,\n      text: context.text,\n    })),\n    claims: normalizeClaims(artifact).map((claim) => claim.text),\n  }))\n}\n\nexport function scoreKnowledgeBaseIndex(\n  index: KnowledgeIndex,\n  options: KnowledgeBaseQualityOptions = {},\n): KnowledgeBaseQualityReport {\n  const validation = validateKnowledgeIndex(index, { strict: options.strict })\n  const lintFindings = lintKnowledgeIndex(index)\n  const now = options.now ?? new Date()\n  const staleSourceCount = index.sources.filter((source) => {\n    return source.validUntil ? Date.parse(source.validUntil) < now.getTime() : false\n  }).length\n  const sourceHashCounts = new Map<string, number>()\n  for (const source of index.sources) {\n    sourceHashCounts.set(source.contentHash, (sourceHashCounts.get(source.contentHash) ?? 0) + 1)\n  }\n  const duplicateSourceHashCount = [...sourceHashCounts.values()].filter(\n    (count) => count > 1,\n  ).length\n  const pagesWithInlineCitations = index.pages.filter(\n    (page) => sourceRefs(page.text).length > 0,\n  ).length\n  const pagesWithSources = index.pages.filter((page) => page.sourceIds.length > 0).length\n  const metrics = {\n    page_count: index.pages.length,\n    source_count: index.sources.length,\n    citation_rate: index.pages.length === 0 ? 1 : pagesWithInlineCitations / index.pages.length,\n    source_backed_page_rate: index.pages.length === 0 ? 1 : pagesWithSources / index.pages.length,\n    stale_source_rate: index.sources.length === 0 ? 0 : staleSourceCount / index.sources.length,\n    duplicate_source_hash_rate:\n      index.sources.length === 0 ? 0 : duplicateSourceHashCount / index.sources.length,\n    lint_error_count: validation.findings.filter((finding) => finding.severity === 'error').length,\n    lint_warning_count: lintFindings.filter((finding) => finding.severity === 'warning').length,\n  }\n  const findings: RagGapFinding[] = []\n  if (metrics.lint_error_count > 0) {\n    findings.push({\n      id: 'kb:lint-errors',\n      kind: 'unknown',\n      severity: 'critical',\n      message: `${metrics.lint_error_count} validation error(s) in the knowledge index.`,\n      evidence: { lint_error_count: metrics.lint_error_count },\n    })\n  }\n  if (metrics.citation_rate < (options.minCitationRate ?? 0)) {\n    findings.push({\n      id: 'kb:citation-rate',\n      kind: 'missing-source',\n      severity: 'error',\n      message: 'Inline citation coverage is below the configured minimum.',\n      evidence: { citation_rate: metrics.citation_rate },\n    })\n  }\n  if (metrics.stale_source_rate > (options.maxStaleSourceRate ?? 1)) {\n    findings.push({\n      id: 'kb:stale-source-rate',\n      kind: 'stale-source',\n      severity: 'error',\n      message: 'Stale source rate exceeds the configured maximum.',\n      evidence: { stale_source_rate: metrics.stale_source_rate },\n    })\n  }\n  return { ok: findings.length === 0, metrics, findings }\n}\n\nfunction requiredContextTargets(scenario: RagAnswerEvalScenario): RagRequiredContext[] {\n  if (scenario.requiredContext?.length) return [...scenario.requiredContext]\n  return (scenario.expectedClaims ?? []).map((text) => ({ text }))\n}\n\nfunction requiredContextTexts(scenario: RagAnswerEvalScenario): string[] {\n  return requiredContextTargets(scenario).flatMap((target) => (target.text ? [target.text] : []))\n}\n\nfunction contextMatchesTarget(context: RagEvalContext, target: RagRequiredContext): boolean {\n  if (target.id && context.id === target.id) return true\n  if (target.pageId && context.pageId === target.pageId) return true\n  if (target.sourceId && context.sourceId === target.sourceId) return true\n  if (target.anchorId && context.anchorId === target.anchorId) return true\n  if (target.text && textSupportScore(target.text, context.text) >= 0.7) return true\n  return false\n}\n\nfunction contextIsRelevant(context: RagEvalContext, scenario: RagAnswerEvalScenario): boolean {\n  return contextRelevanceScore(context, scenario) >= 0.3\n}\n\nfunction contextRelevanceScore(context: RagEvalContext, scenario: RagAnswerEvalScenario): number {\n  const targets = [\n    scenario.query,\n    scenario.referenceAnswer,\n    ...(scenario.expectedClaims ?? []),\n    ...requiredContextTexts(scenario),\n  ].filter((value): value is string => Boolean(value?.trim()))\n  if (targets.length === 0) return 1\n  return Math.max(...targets.map((target) => textSupportScore(target, context.text)))\n}\n\nfunction claimSupport(\n  claim: string,\n  contexts: readonly RagEvalContext[],\n  options: Pick<RagAnswerQualityJudgeOptions, 'minClaimSupport'>,\n): boolean {\n  if (contexts.length === 0) return false\n  const combined = contexts.map((context) => context.text).join('\\n\\n')\n  const deterministic = groundClaimInText(claim, combined, {\n    minOverlap: options.minClaimSupport ?? 0.7,\n  })\n  return (\n    deterministic.grounded || textSupportScore(claim, combined) >= (options.minClaimSupport ?? 0.7)\n  )\n}\n\nfunction scoreCitations(\n  claims: readonly RagEvalClaim[],\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  options: Pick<RagAnswerQualityJudgeOptions, 'minClaimSupport'>,\n): { support: number; citedClaimCount: number; supportedCitationCount: number } {\n  if (claims.length === 0)\n    return { support: scenario.unanswerable ? 1 : 0, citedClaimCount: 0, supportedCitationCount: 0 }\n  const citations = artifact.citations ?? []\n  const citedClaims = claims.filter((claim) => citationsForClaim(claim, citations).length > 0)\n  if (citedClaims.length === 0) {\n    return {\n      support: scenario.requireCitations ? 0 : 1,\n      citedClaimCount: 0,\n      supportedCitationCount: 0,\n    }\n  }\n  let supportedCitationCount = 0\n  for (const claim of citedClaims) {\n    const citedContexts = contextsForClaim(claim, citations, artifact.contexts)\n    if (claimSupport(claim.text, citedContexts, options)) supportedCitationCount += 1\n  }\n  return {\n    support: supportedCitationCount / citedClaims.length,\n    citedClaimCount: citedClaims.length,\n    supportedCitationCount,\n  }\n}\n\nfunction citationsForClaim(\n  claim: RagEvalClaim,\n  citations: readonly RagEvalCitation[],\n): RagEvalCitation[] {\n  const claimCitationIds = new Set(claim.citationIds ?? [])\n  return citations.filter((citation) => {\n    return citation.claimId === claim.id || (citation.id && claimCitationIds.has(citation.id))\n  })\n}\n\nfunction contextsForClaim(\n  claim: RagEvalClaim,\n  citations: readonly RagEvalCitation[],\n  contexts: readonly RagEvalContext[],\n): readonly RagEvalContext[] {\n  const matchedCitations = citationsForClaim(claim, citations)\n  const matchedContexts = contexts.filter((context) =>\n    matchedCitations.some((citation) => {\n      if (citation.contextId && citation.contextId === context.id) return true\n      if (citation.pageId && citation.pageId === context.pageId) return true\n      if (citation.sourceId && citation.sourceId === context.sourceId) return true\n      if (citation.anchorId && citation.anchorId === context.anchorId) return true\n      return false\n    }),\n  )\n  return matchedContexts.length > 0 ? matchedContexts : contexts\n}\n\nfunction scoreAnswerRelevance(\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  abstained: boolean,\n): number {\n  if (scenario.unanswerable) return abstained ? 1 : 0\n  if (abstained) return 0\n  const targets = [\n    scenario.referenceAnswer,\n    ...(scenario.expectedClaims ?? []),\n    scenario.query,\n  ].filter((value): value is string => Boolean(value?.trim()))\n  return Math.max(...targets.map((target) => textSupportScore(target, artifact.answer)))\n}\n\nfunction scoreAnswerCorrectness(\n  artifact: RagAnswerEvalArtifact,\n  scenario: RagAnswerEvalScenario,\n  abstained: boolean,\n): number {\n  if (scenario.unanswerable) return abstained ? 1 : 0\n  const expected = scenario.expectedClaims ?? []\n  const forbidden = scenario.forbiddenClaims ?? []\n  const expectedScore =\n    expected.length === 0\n      ? scoreAnswerRelevance(artifact, scenario, abstained)\n      : average(expected.map((claim) => textSupportScore(claim, artifact.answer)))\n  const forbiddenPenalty =\n    forbidden.length === 0\n      ? 0\n      : forbidden.filter((claim) => textSupportScore(claim, artifact.answer) >= 0.7).length /\n        forbidden.length\n  return clamp01(expectedScore * (1 - forbiddenPenalty))\n}\n\nfunction normalizeClaims(artifact: RagAnswerEvalArtifact): RagEvalClaim[] {\n  if (artifact.claims?.length) return [...artifact.claims]\n  return splitSentences(artifact.answer).map((text, index) => ({ id: `claim-${index + 1}`, text }))\n}\n\nfunction splitSentences(text: string): string[] {\n  return text\n    .split(/(?<=[.!?])\\s+/)\n    .map((sentence) => sentence.trim())\n    .filter((sentence) => sentence.length > 0 && !looksLikeAbstention(sentence))\n}\n\nfunction looksLikeAbstention(answer: string): boolean {\n  const normalized = answer.toLowerCase()\n  return [\n    \"i don't know\",\n    'i do not know',\n    'not enough information',\n    'cannot answer',\n    \"can't answer\",\n    'insufficient information',\n    'no reliable answer',\n  ].some((phrase) => normalized.includes(phrase))\n}\n\nfunction mergeMetrics(\n  deterministic: Record<RagEvalMetricKey, number>,\n  providerScores: Record<string, Record<RagEvalMetricKey, number>>,\n  policy: RagAnswerQualityJudgeOptions['externalScorePolicy'] = 'prefer-external',\n): Record<RagEvalMetricKey, number> {\n  if (policy === 'deterministic-first') return deterministic\n  const merged = { ...deterministic }\n  for (const scores of Object.values(providerScores)) {\n    for (const [key, value] of Object.entries(scores) as Array<[RagEvalMetricKey, number]>) {\n      merged[key] = value\n      if (key === 'groundedness') merged.faithfulness = value\n      if (key === 'faithfulness') merged.groundedness = value\n    }\n  }\n  return merged\n}\n\nfunction aggregateRagAnswerMetrics(\n  summaries: readonly RagAnswerMetricSummary[],\n): Record<string, number> {\n  const keys = new Set<RagEvalMetricKey>()\n  for (const summary of summaries) {\n    for (const key of Object.keys(summary.metrics) as RagEvalMetricKey[]) keys.add(key)\n  }\n  const out: Record<string, number> = {}\n  for (const key of [...keys].sort()) {\n    out[key] = average(summaries.map((summary) => summary.metrics[key]))\n  }\n  out.composite = average(summaries.map((summary) => summary.composite))\n  return out\n}\n\nfunction weightedComposite(\n  metrics: Record<RagEvalMetricKey, number>,\n  weights: Partial<Record<RagEvalMetricKey, number>>,\n): number {\n  let weighted = 0\n  let total = 0\n  for (const [key, weight] of Object.entries(weights) as Array<[RagEvalMetricKey, number]>) {\n    if (!Number.isFinite(weight) || weight <= 0) continue\n    const metric = metrics[key]\n    if (!Number.isFinite(metric)) continue\n    const value = key === 'unsupported_answer_rate' ? 1 - metric : metric\n    weighted += value * weight\n    total += weight\n  }\n  return total === 0 ? 0 : weighted / total\n}\n\nfunction normalizeMetricName(metric: string): string {\n  return metric\n    .trim()\n    .toLowerCase()\n    .replace(/[@/.-]+/g, '_')\n    .replace(/\\s+/g, '_')\n}\n\nfunction textSupportScore(needle: string, haystack: string): number {\n  const needleWords = contentWords(needle)\n  if (needleWords.length === 0) return 0\n  const haystackWords = new Set(contentWords(haystack))\n  const present = needleWords.filter((word) => haystackWords.has(word))\n  return present.length / needleWords.length\n}\n\nfunction contentWords(text: string): string[] {\n  const normalized = text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .split(/\\s+/)\n    .map((word) => stem(word.trim()))\n    .filter((word) => (word.length >= 3 || /^\\d+$/.test(word)) && !stopwords.has(word))\n  return [...new Set(normalized)]\n}\n\nfunction stem(word: string): string {\n  if (word.endsWith('ies') && word.length > 4) return `${word.slice(0, -3)}y`\n  if (word.endsWith('ing') && word.length > 5) return word.slice(0, -3)\n  if (word.endsWith('ed') && word.length > 4) return word.slice(0, -2)\n  if (word.endsWith('s') && word.length > 3) return word.slice(0, -1)\n  return word\n}\n\nfunction sourceRefs(text: string): string[] {\n  const refs: string[] = []\n  const regex = /\\[\\^([A-Za-z0-9_-]+)(?:#([A-Za-z0-9_.:-]+))?\\]/g\n  let match = regex.exec(text)\n  while (match !== null) {\n    refs.push(match[0])\n    match = regex.exec(text)\n  }\n  return refs\n}\n\nfunction below(metric: number, threshold: number | undefined): boolean {\n  return threshold !== undefined && metric < threshold\n}\n\nfunction neutralScore(condition: boolean): number {\n  return condition ? 1 : 0\n}\n\nfunction average(values: readonly number[]): number {\n  const finite = values.filter(Number.isFinite)\n  return finite.length === 0 ? 0 : finite.reduce((sum, value) => sum + value, 0) / finite.length\n}\n\nfunction clamp01(value: number): number {\n  if (!Number.isFinite(value)) return 0\n  return Math.max(0, Math.min(1, value))\n}\n\nconst stopwords = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'but',\n  'of',\n  'to',\n  'in',\n  'on',\n  'for',\n  'with',\n  'as',\n  'by',\n  'at',\n  'from',\n  'that',\n  'this',\n  'these',\n  'those',\n  'it',\n  'its',\n  'is',\n  'are',\n  'was',\n  'were',\n  'be',\n  'been',\n  'being',\n  'has',\n  'have',\n  'had',\n  'can',\n  'will',\n  'would',\n  'should',\n  'may',\n  'might',\n  'not',\n  'no',\n  'than',\n  'then',\n  'over',\n  'under',\n  'about',\n  'into',\n  'their',\n  'they',\n  'them',\n  'what',\n  'when',\n  'where',\n  'who',\n  'why',\n  'how',\n])\n","import {\n  blockingKnowledgeEval,\n  type ControlEvalResult,\n  type ControlRuntimeConfig,\n  objectiveEval,\n} from '@tangle-network/agent-eval'\nimport type {\n  BuildEvalKnowledgeBundleOptions,\n  EvalKnowledgeBundleBuildResult,\n  KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport { createKnowledgeEvent } from './events'\nimport { buildKnowledgeIndex } from './indexer'\nimport { lintKnowledgeIndex } from './lint'\nimport { type ApplyWriteBlocksResult, applyKnowledgeWriteBlocks } from './proposals'\nimport { readinessFor } from './readiness-helpers'\nimport {\n  type AddSourceOptions,\n  type AddSourceTextInput,\n  addSourcePath,\n  addSourceText,\n} from './sources'\nimport { initKnowledgeBase } from './store'\nimport type { KnowledgeEvent, KnowledgeIndex, KnowledgeLintFinding, SourceRecord } from './types'\nimport {\n  type ValidateKnowledgeOptions,\n  type ValidateKnowledgeResult,\n  validateKnowledgeIndex,\n} from './validate'\n\nexport interface KnowledgeResearchLoopContext {\n  root: string\n  goal: string\n  iteration: number\n  index: KnowledgeIndex\n  lintFindings: KnowledgeLintFinding[]\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  previousSteps: KnowledgeResearchLoopStep[]\n  signal?: AbortSignal\n}\n\nexport interface KnowledgeResearchLoopDecision {\n  /**\n   * Free-form notes from the researcher. Keep this human-readable; products can\n   * store it as the research transcript.\n   */\n  notes?: string\n  /**\n   * Local files to register as immutable sources before applying proposals.\n   */\n  sourcePaths?: string[]\n  /**\n   * Textual source artifacts discovered by an agent, browser worker, connector,\n   * or deep-research process.\n   */\n  sourceTexts?: AddSourceTextInput[]\n  /**\n   * Safe write protocol text. The loop parses and applies only accepted\n   * `---FILE: knowledge/...---` blocks.\n   */\n  proposalText?: string\n  /**\n   * The researcher decides when the wiki is good enough. The loop deliberately\n   * does not encode a domain-specific definition of \"done\".\n   */\n  done?: boolean\n  metadata?: Record<string, unknown>\n}\n\nexport interface KnowledgeResearchLoopStep {\n  iteration: number\n  notes?: string\n  addedSources: SourceRecord[]\n  applied?: ApplyWriteBlocksResult\n  lintFindings: KnowledgeLintFinding[]\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  event: KnowledgeEvent\n  done: boolean\n  metadata?: Record<string, unknown>\n}\n\nexport interface RunKnowledgeResearchLoopOptions {\n  root: string\n  goal: string\n  maxIterations?: number\n  actor?: string\n  strict?: ValidateKnowledgeOptions['strict']\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  sourceOptions?: Pick<AddSourceOptions, 'adapters' | 'now'>\n  signal?: AbortSignal\n  step(\n    context: KnowledgeResearchLoopContext,\n  ): Promise<KnowledgeResearchLoopDecision> | KnowledgeResearchLoopDecision\n  onStep?: (step: KnowledgeResearchLoopStep) => Promise<void> | void\n}\n\nexport interface KnowledgeResearchLoopResult {\n  root: string\n  goal: string\n  iterations: number\n  done: boolean\n  index: KnowledgeIndex\n  lintFindings: KnowledgeLintFinding[]\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  steps: KnowledgeResearchLoopStep[]\n}\n\nexport type KnowledgeControlLoopState = KnowledgeResearchLoopContext\nexport type KnowledgeControlLoopAction = KnowledgeResearchLoopDecision\nexport type KnowledgeControlLoopActionResult = KnowledgeResearchLoopStep\n\nexport interface KnowledgeControlLoopAdapterOptions {\n  root: string\n  goal: string\n  actor?: string\n  strict?: ValidateKnowledgeOptions['strict']\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  sourceOptions?: Pick<AddSourceOptions, 'adapters' | 'now'>\n}\n\nexport type KnowledgeControlLoopAdapter = Pick<\n  ControlRuntimeConfig<\n    KnowledgeControlLoopState,\n    KnowledgeControlLoopAction,\n    KnowledgeControlLoopActionResult,\n    ControlEvalResult\n  >,\n  'intent' | 'observe' | 'validate' | 'act' | 'shouldStop'\n>\n\n/**\n * Adapter for running knowledge growth through `agent-eval`'s generic control\n * runtime. The caller still owns `decide`: that can be a proposer agent,\n * reviewer agent, deterministic policy, or a composition of all three.\n */\nexport function createKnowledgeControlLoopAdapter(\n  options: KnowledgeControlLoopAdapterOptions,\n): KnowledgeControlLoopAdapter {\n  let initialized = false\n  const appliedSteps: KnowledgeResearchLoopStep[] = []\n\n  return {\n    intent: options.goal,\n    async observe({ history, abortSignal }) {\n      if (abortSignal.aborted) throw new Error('Knowledge control loop aborted')\n      if (!initialized) {\n        await initKnowledgeBase(options.root)\n        initialized = true\n      }\n      const index = await buildKnowledgeIndex(options.root)\n      const validation = validateKnowledgeIndex(index, { strict: options.strict })\n      const lintFindings = lintKnowledgeIndex(index)\n      const readiness = readinessFor(options, index)\n      return {\n        root: options.root,\n        goal: options.goal,\n        iteration: history.length + 1,\n        index,\n        lintFindings,\n        validation,\n        readiness,\n        previousSteps: [...appliedSteps],\n        signal: abortSignal,\n      }\n    },\n    validate({ state }) {\n      const errorFindings = state.validation.findings.filter(\n        (finding) => finding.severity === 'error',\n      )\n      const evals: ControlEvalResult[] = [\n        objectiveEval({\n          id: 'knowledge-valid',\n          passed: state.validation.ok,\n          severity: 'critical',\n          detail: state.validation.ok\n            ? 'Knowledge index is valid.'\n            : 'Knowledge index has validation errors.',\n          metadata: { findings: state.validation.findings },\n        }),\n        objectiveEval({\n          id: 'knowledge-lint-errors',\n          passed: errorFindings.length === 0,\n          severity: 'error',\n          detail:\n            errorFindings.length === 0\n              ? 'No lint errors.'\n              : `${errorFindings.length} lint error(s).`,\n          metadata: { findings: errorFindings },\n        }),\n      ]\n      if (state.readiness) evals.push(blockingKnowledgeEval(state.readiness.report))\n      return evals\n    },\n    shouldStop() {\n      return { stop: false, pass: false, reason: 'knowledge driver owns stop decisions' }\n    },\n    async act(action, ctx) {\n      const step = await applyKnowledgeResearchDecision(options, action, ctx.state.iteration)\n      appliedSteps.push(step)\n      return step\n    },\n  }\n}\n\nexport async function runKnowledgeResearchLoop(\n  options: RunKnowledgeResearchLoopOptions,\n): Promise<KnowledgeResearchLoopResult> {\n  const maxIterations = Math.max(1, options.maxIterations ?? 3)\n  await initKnowledgeBase(options.root)\n  const steps: KnowledgeResearchLoopStep[] = []\n  let index = await buildKnowledgeIndex(options.root)\n  let validation = validateKnowledgeIndex(index, { strict: options.strict })\n  let lintFindings = lintKnowledgeIndex(index)\n  let readiness = readinessFor(options, index)\n  let done = false\n\n  for (let iteration = 1; iteration <= maxIterations; iteration++) {\n    if (options.signal?.aborted) throw new Error('Knowledge research loop aborted')\n    const decision = await options.step({\n      root: options.root,\n      goal: options.goal,\n      iteration,\n      index,\n      lintFindings,\n      validation,\n      readiness,\n      previousSteps: steps,\n      signal: options.signal,\n    })\n\n    done = Boolean(decision.done)\n    const step = await applyKnowledgeResearchDecision(options, decision, iteration)\n    index = await buildKnowledgeIndex(options.root)\n    validation = step.validation\n    lintFindings = step.lintFindings\n    readiness = step.readiness\n    steps.push(step)\n    await options.onStep?.(step)\n\n    if (done) break\n    if (!step.applied && step.addedSources.length === 0) break\n  }\n\n  return {\n    root: options.root,\n    goal: options.goal,\n    iterations: steps.length,\n    done,\n    index,\n    lintFindings,\n    validation,\n    readiness,\n    steps,\n  }\n}\n\nasync function applyKnowledgeResearchDecision(\n  options: KnowledgeControlLoopAdapterOptions,\n  decision: KnowledgeResearchLoopDecision,\n  iteration = 1,\n): Promise<KnowledgeResearchLoopStep> {\n  const addedSources: SourceRecord[] = []\n  for (const sourcePath of decision.sourcePaths ?? []) {\n    addedSources.push(...(await addSourcePath(options.root, sourcePath, options.sourceOptions)))\n  }\n  for (const sourceText of decision.sourceTexts ?? []) {\n    addedSources.push(await addSourceText(options.root, sourceText, options.sourceOptions))\n  }\n\n  const applied = decision.proposalText\n    ? await applyKnowledgeWriteBlocks(options.root, decision.proposalText)\n    : undefined\n\n  const index = await buildKnowledgeIndex(options.root)\n  const validation = validateKnowledgeIndex(index, { strict: options.strict })\n  const lintFindings = lintKnowledgeIndex(index)\n  const readiness = readinessFor(options, index)\n  const done = Boolean(decision.done)\n  const event = createKnowledgeEvent({\n    type: 'research.iteration',\n    actor: options.actor,\n    target: options.root,\n    metadata: {\n      goal: options.goal,\n      iteration,\n      done,\n      addedSourceCount: addedSources.length,\n      written: applied?.written,\n      warningCount: applied?.warnings.length ?? 0,\n      errorCount: validation.findings.filter((finding) => finding.severity === 'error').length,\n    },\n  })\n\n  return {\n    iteration,\n    notes: decision.notes,\n    addedSources,\n    applied,\n    lintFindings,\n    validation,\n    readiness,\n    event,\n    done,\n    metadata: decision.metadata,\n  }\n}\n","import { stableId } from './ids'\nimport type { KnowledgeEvent, KnowledgeEventType } from './types'\n\nexport interface KnowledgeEventQuery {\n  type?: KnowledgeEventType\n  target?: string\n  limit?: number\n}\n\nexport function createKnowledgeEvent(input: {\n  type: KnowledgeEventType\n  actor?: string\n  target?: string\n  metadata?: Record<string, unknown>\n  now?: () => Date\n}): KnowledgeEvent {\n  const createdAt = (input.now ?? (() => new Date()))().toISOString()\n  return {\n    id: stableId(\n      'evt',\n      `${input.type}:${input.target ?? ''}:${createdAt}:${JSON.stringify(input.metadata ?? {})}`,\n    ),\n    type: input.type,\n    createdAt,\n    actor: input.actor,\n    target: input.target,\n    metadata: input.metadata,\n  }\n}\n","import {\n  acquisitionPlansForKnowledgeGaps,\n  type DataAcquisitionPlan,\n  type KnowledgeAcquisitionMode,\n  type KnowledgeBundle,\n  type KnowledgeFreshness,\n  type KnowledgeImportance,\n  type KnowledgeReadinessReport,\n  type KnowledgeRequirement,\n  type KnowledgeRequirementCategory,\n  type KnowledgeSensitivity,\n  scoreKnowledgeReadiness,\n  type UserQuestion,\n  userQuestionsForKnowledgeGaps,\n} from '@tangle-network/agent-eval'\nimport { stringMetadata } from './metadata'\nimport { searchKnowledge } from './search'\nimport type { KnowledgeIndex, KnowledgeSearchResult } from './types'\n\nexport interface KnowledgeReadinessSpec {\n  id: string\n  description: string\n  query: string\n  requiredFor: string[]\n  category: KnowledgeRequirementCategory\n  acquisitionMode: KnowledgeAcquisitionMode\n  importance: KnowledgeImportance\n  freshness: KnowledgeFreshness\n  sensitivity: KnowledgeSensitivity\n  confidenceNeeded: number\n  fallbackPolicy?: KnowledgeRequirement['fallbackPolicy']\n  minSources?: number\n  minHits?: number\n  metadata?: Record<string, unknown>\n}\n\n/**\n * Defaults applied by `defineReadinessSpec` when the caller omits the field.\n *\n * These are deliberately conservative: a domain-specific topic that an agent\n * needs grounded to a high-confidence threshold from at least one authoritative\n * source. Override any field to specialise (e.g. `freshness: 'daily'` for a\n * topic that must reflect today's regulatory state).\n */\nexport const READINESS_SPEC_DEFAULTS = {\n  category: 'domain_specific',\n  acquisitionMode: 'search_web',\n  importance: 'high',\n  freshness: 'monthly',\n  sensitivity: 'public',\n  confidenceNeeded: 0.7,\n  minSources: 1,\n  minHits: 2,\n} as const satisfies Pick<\n  KnowledgeReadinessSpec,\n  | 'category'\n  | 'acquisitionMode'\n  | 'importance'\n  | 'freshness'\n  | 'sensitivity'\n  | 'confidenceNeeded'\n  | 'minSources'\n  | 'minHits'\n>\n\n/**\n * Inputs accepted by `defineReadinessSpec`. The four fields the caller cannot\n * sanely default (id, description, query, requiredFor) are required; everything\n * else is optional and pulls from `READINESS_SPEC_DEFAULTS`.\n */\nexport type DefineReadinessSpecInput = Pick<\n  KnowledgeReadinessSpec,\n  'id' | 'description' | 'query' | 'requiredFor'\n> &\n  Partial<Omit<KnowledgeReadinessSpec, 'id' | 'description' | 'query' | 'requiredFor'>>\n\n/**\n * Builder that returns a fully-typed `KnowledgeReadinessSpec` from a slim input.\n *\n * Motivation: `KnowledgeReadinessSpec` has eleven required fields. Most of them\n * (category, acquisition mode, importance, freshness, sensitivity, confidence\n * threshold, source/hit minima) have a clear default for domain-specific KB\n * topics — agents end up copy-pasting the same boilerplate across every spec.\n * This helper collapses that boilerplate while keeping every field overridable.\n *\n * @example\n * defineReadinessSpec({\n *   id: 'coop/intent-grounding',\n *   description: 'Required grounding for coop pack intent stage',\n *   query: 'flock size space ventilation predator',\n *   requiredFor: ['IntentIntakeAgent', 'requirements'],\n * })\n *\n * @example  // override defaults where the topic demands it\n * defineReadinessSpec({\n *   id: 'medical/dosing',\n *   description: 'Dosing guidance for compounding pharmacy',\n *   query: 'compounding dose schedule',\n *   requiredFor: ['DosingAgent'],\n *   importance: 'blocking',\n *   freshness: 'daily',\n *   sensitivity: 'private',\n *   confidenceNeeded: 0.95,\n *   minSources: 3,\n * })\n */\nexport function defineReadinessSpec(input: DefineReadinessSpecInput): KnowledgeReadinessSpec {\n  return {\n    ...READINESS_SPEC_DEFAULTS,\n    ...input,\n  }\n}\n\nexport interface BuildEvalKnowledgeBundleOptions {\n  taskId: string\n  index: KnowledgeIndex\n  specs: KnowledgeReadinessSpec[]\n  userAnswers?: Record<string, string>\n  searchLimit?: number\n  metadata?: Record<string, unknown>\n  now?: Date\n}\n\nexport interface EvalKnowledgeBundleBuildResult {\n  bundle: KnowledgeBundle\n  report: KnowledgeReadinessReport\n  requirements: KnowledgeRequirement[]\n  searchResultsByRequirement: Record<string, KnowledgeSearchResult[]>\n  questions: UserQuestion[]\n  acquisitionPlans: DataAcquisitionPlan[]\n}\n\nexport function buildEvalKnowledgeBundle(\n  options: BuildEvalKnowledgeBundleOptions,\n): EvalKnowledgeBundleBuildResult {\n  const searchLimit = options.searchLimit ?? 5\n  const now = options.now ?? new Date()\n  const searchResultsByRequirement: Record<string, KnowledgeSearchResult[]> = {}\n  const requirements = options.specs.map((spec) => {\n    const results = searchKnowledge(options.index, spec.query, searchLimit)\n    searchResultsByRequirement[spec.id] = results\n    return requirementFromSearch(options.index, spec, results, now)\n  })\n  const report = scoreKnowledgeReadiness({\n    taskId: options.taskId,\n    requirements,\n    userAnswers: options.userAnswers,\n    evidenceIds: requirements.flatMap((requirement) => requirement.evidenceIds),\n    claimIds: [],\n    wikiPageIds: unique(\n      requirements.flatMap((requirement) =>\n        pageIdsFromResults(searchResultsByRequirement[requirement.id] ?? []),\n      ),\n    ),\n    metadata: options.metadata,\n  })\n  const questions = userQuestionsForKnowledgeGaps(report.blockingMissingRequirements)\n  const acquisitionPlans = acquisitionPlansForKnowledgeGaps([\n    ...report.blockingMissingRequirements,\n    ...report.nonBlockingGaps,\n  ])\n\n  return {\n    bundle: report.bundle,\n    report,\n    requirements,\n    searchResultsByRequirement,\n    questions,\n    acquisitionPlans,\n  }\n}\n\nfunction requirementFromSearch(\n  index: KnowledgeIndex,\n  spec: KnowledgeReadinessSpec,\n  results: KnowledgeSearchResult[],\n  now: Date,\n): KnowledgeRequirement {\n  const hitCount = results.length\n  const sourceIds = unique(results.flatMap((result) => result.page.sourceIds))\n  const sources = index.sources.filter((source) => sourceIds.includes(source.id))\n  const bestScore = results[0]?.normalizedScore ?? 0\n  const sourceCoverage = spec.minSources\n    ? Math.min(1, sourceIds.length / spec.minSources)\n    : sourceIds.length > 0\n      ? 1\n      : 0\n  const hitCoverage = spec.minHits ? Math.min(1, hitCount / spec.minHits) : hitCount > 0 ? 1 : 0\n  const freshness = sourceFreshness(sources, now)\n  const currentConfidence = round(Math.min(bestScore, sourceCoverage, hitCoverage, freshness.score))\n\n  return {\n    id: spec.id,\n    description: spec.description,\n    requiredFor: spec.requiredFor,\n    category: spec.category,\n    acquisitionMode: spec.acquisitionMode,\n    importance: spec.importance,\n    freshness: spec.freshness,\n    sensitivity: spec.sensitivity,\n    confidenceNeeded: spec.confidenceNeeded,\n    currentConfidence,\n    evidenceIds: unique([\n      ...sourceIds.map((sourceId) => `source:${sourceId}`),\n      ...results.map((result) => `page:${result.page.id}`),\n    ]),\n    fallbackPolicy:\n      spec.fallbackPolicy ?? (spec.importance === 'blocking' ? 'block' : 'continue_with_caveat'),\n    metadata: {\n      ...spec.metadata,\n      query: spec.query,\n      hitCount,\n      sourceCount: sourceIds.length,\n      bestNormalizedScore: bestScore,\n      expiredSourceIds: freshness.expiredSourceIds,\n      freshnessScore: freshness.score,\n      validUntil: freshness.validUntil,\n      lastVerifiedAt: freshness.lastVerifiedAt,\n    },\n  }\n}\n\nfunction sourceFreshness(\n  sources: KnowledgeIndex['sources'],\n  now: Date,\n): { score: number; validUntil?: string; lastVerifiedAt?: string; expiredSourceIds: string[] } {\n  if (sources.length === 0) return { score: 0, expiredSourceIds: [] }\n  const validUntilValues = sources\n    .map(\n      (source) =>\n        source.validUntil ??\n        stringMetadata(source.metadata, 'validUntil') ??\n        stringMetadata(source.metadata, 'expiresAt'),\n    )\n    .filter(isIsoDate)\n  const lastVerifiedValues = sources\n    .map((source) => source.lastVerifiedAt ?? stringMetadata(source.metadata, 'lastVerifiedAt'))\n    .filter(isIsoDate)\n  const expiredSourceIds = sources\n    .filter((source) => {\n      const validUntil =\n        source.validUntil ??\n        stringMetadata(source.metadata, 'validUntil') ??\n        stringMetadata(source.metadata, 'expiresAt')\n      return validUntil ? Date.parse(validUntil) <= now.getTime() : false\n    })\n    .map((source) => source.id)\n  return {\n    score: expiredSourceIds.length > 0 ? 0 : 1,\n    validUntil: earliestIso(validUntilValues),\n    lastVerifiedAt: latestIso(lastVerifiedValues),\n    expiredSourceIds,\n  }\n}\n\nfunction isIsoDate(value: string | undefined): value is string {\n  return Boolean(value && Number.isFinite(Date.parse(value)))\n}\n\nfunction earliestIso(values: string[]): string | undefined {\n  return values.sort((a, b) => Date.parse(a) - Date.parse(b))[0]\n}\n\nfunction latestIso(values: string[]): string | undefined {\n  return values.sort((a, b) => Date.parse(b) - Date.parse(a))[0]\n}\n\nfunction pageIdsFromResults(results: KnowledgeSearchResult[]): string[] {\n  return results.map((result) => result.page.id)\n}\n\nfunction unique<T>(items: T[]): T[] {\n  return [...new Set(items)]\n}\n\nfunction round(value: number): number {\n  return Math.round(value * 1000) / 1000\n}\n","import {\n  type BuildEvalKnowledgeBundleOptions,\n  buildEvalKnowledgeBundle,\n  type EvalKnowledgeBundleBuildResult,\n  type KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport type { KnowledgeIndex } from './types'\n\n/**\n * The subset of a research-loop options object the readiness gate needs:\n * the goal (default task id), the readiness specs, an optional task-id\n * override, and the rest of the bundle options minus the fields this helper\n * supplies (`taskId`/`index`/`specs`).\n *\n * Both the single-agent (`research-loop`) and two-agent (`two-agent-research-loop`)\n * options shapes satisfy this structurally, so the gate is single-sourced.\n */\nexport interface ReadinessGateOptions {\n  goal: string\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n}\n\n/**\n * Build the readiness bundle for a loop run over the given index, or\n * `undefined` when no readiness specs are configured (no gate to report).\n */\nexport function readinessFor(\n  options: ReadinessGateOptions,\n  index: KnowledgeIndex,\n): EvalKnowledgeBundleBuildResult | undefined {\n  if (!options.readinessSpecs?.length) return undefined\n  return buildEvalKnowledgeBundle({\n    ...(options.readiness ?? {}),\n    taskId: options.readinessTaskId ?? options.goal,\n    index,\n    specs: options.readinessSpecs,\n  })\n}\n","import type { JsonValue } from '@tangle-network/agent-eval/campaign'\nimport {\n  type KnowledgeResearchLoopDecision,\n  type KnowledgeResearchLoopResult,\n  type RunKnowledgeResearchLoopOptions,\n  runKnowledgeResearchLoop,\n} from './research-loop'\nimport {\n  type RunRetrievalImprovementLoopOptions,\n  type RunRetrievalImprovementLoopResult,\n  runRetrievalImprovementLoop,\n} from './retrieval-eval'\n\nexport type RagKnowledgeImprovementPhase =\n  | 'retrieval-tuning'\n  | 'gap-diagnosis'\n  | 'knowledge-acquisition'\n  | 'knowledge-update'\n  | 'answer-quality'\n  | 'promotion'\n\nexport type RagKnowledgeImprovementPhaseStatus = 'completed' | 'skipped' | 'failed'\n\nexport type RagGapKind =\n  | 'missing-source'\n  | 'stale-source'\n  | 'retrieval-miss'\n  | 'retrieval-noise'\n  | 'chunking-mismatch'\n  | 'missing-multihop-evidence'\n  | 'generator-unsupported-claim'\n  | 'citation-mismatch'\n  | 'incorrect-abstention'\n  | 'unknown'\n\nexport type RagGapSeverity = 'info' | 'warning' | 'error' | 'critical'\n\nexport interface RagGapFinding {\n  id: string\n  kind: RagGapKind\n  severity: RagGapSeverity\n  message: string\n  scenarioId?: string\n  evidence?: Record<string, JsonValue>\n}\n\nexport interface RagKnowledgeImprovementPhaseResult {\n  phase: RagKnowledgeImprovementPhase\n  status: RagKnowledgeImprovementPhaseStatus\n  summary: string\n  startedAt: string\n  finishedAt: string\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagPhaseInputBase {\n  goal: string\n  phases: readonly RagKnowledgeImprovementPhaseResult[]\n  signal?: AbortSignal\n}\n\nexport interface RagDiagnosisInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n}\n\nexport interface RagKnowledgeAcquisitionInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n}\n\nexport interface RagKnowledgeUpdateInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n}\n\nexport interface RagKnowledgeUpdateResult {\n  applied: boolean\n  summary: string\n  research?: KnowledgeResearchLoopResult\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagAnswerQualityInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n  knowledgeUpdate?: RagKnowledgeUpdateResult\n}\n\nexport interface RagAnswerQualityResult {\n  passed: boolean\n  metrics: Record<string, number>\n  findings?: readonly RagGapFinding[]\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagPromotionInput extends RagPhaseInputBase {\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n  knowledgeUpdate?: RagKnowledgeUpdateResult\n  answerQuality?: RagAnswerQualityResult\n}\n\nexport interface RagPromotionResult {\n  promoted: boolean\n  reason: string\n  metadata?: Record<string, JsonValue>\n}\n\nexport interface RagKnowledgeResearchOptions\n  extends Omit<RunKnowledgeResearchLoopOptions, 'goal' | 'signal' | 'step'> {\n  goal?: string\n  step?: RunKnowledgeResearchLoopOptions['step']\n}\n\nexport interface RunRagKnowledgeImprovementLoopOptions {\n  goal: string\n  retrieval?: RunRetrievalImprovementLoopOptions\n  diagnose?: (input: RagDiagnosisInput) => MaybePromise<readonly RagGapFinding[]>\n  acquireKnowledge?: (\n    input: RagKnowledgeAcquisitionInput,\n  ) => MaybePromise<KnowledgeResearchLoopDecision>\n  knowledgeResearch?: RagKnowledgeResearchOptions\n  updateKnowledge?: (input: RagKnowledgeUpdateInput) => MaybePromise<RagKnowledgeUpdateResult>\n  evaluateAnswers?: (input: RagAnswerQualityInput) => MaybePromise<RagAnswerQualityResult>\n  promote?: (input: RagPromotionInput) => MaybePromise<RagPromotionResult>\n  enabledPhases?: readonly RagKnowledgeImprovementPhase[]\n  requiredPhases?: readonly RagKnowledgeImprovementPhase[]\n  signal?: AbortSignal\n  now?: () => Date\n}\n\nexport interface RunRagKnowledgeImprovementLoopResult {\n  goal: string\n  phases: readonly RagKnowledgeImprovementPhaseResult[]\n  retrieval?: RunRetrievalImprovementLoopResult\n  findings: readonly RagGapFinding[]\n  acquisition?: KnowledgeResearchLoopDecision\n  knowledgeUpdate?: RagKnowledgeUpdateResult\n  answerQuality?: RagAnswerQualityResult\n  promotion?: RagPromotionResult\n}\n\ntype MaybePromise<T> = T | Promise<T>\n\nexport async function runRagKnowledgeImprovementLoop(\n  options: RunRagKnowledgeImprovementLoopOptions,\n): Promise<RunRagKnowledgeImprovementLoopResult> {\n  assertConfiguredRequiredPhases(options)\n  const now = options.now ?? (() => new Date())\n  const phases: RagKnowledgeImprovementPhaseResult[] = []\n  let retrieval: RunRetrievalImprovementLoopResult | undefined\n  let findings: RagGapFinding[] = []\n  let acquisition: KnowledgeResearchLoopDecision | undefined\n  let knowledgeUpdate: RagKnowledgeUpdateResult | undefined\n  let answerQuality: RagAnswerQualityResult | undefined\n  let promotion: RagPromotionResult | undefined\n\n  if (phaseEnabled(options, 'retrieval-tuning')) {\n    if (options.retrieval) {\n      retrieval = await runPhase(\n        phases,\n        now,\n        'retrieval-tuning',\n        async () => {\n          assertNotAborted(options.signal)\n          return runRetrievalImprovementLoop(options.retrieval!)\n        },\n        summarizeRetrievalResult,\n      )\n    } else {\n      skipPhase(phases, now, 'retrieval-tuning', 'no retrieval options provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'gap-diagnosis')) {\n    if (options.diagnose) {\n      findings = [\n        ...(await runPhase(\n          phases,\n          now,\n          'gap-diagnosis',\n          async () => {\n            assertNotAborted(options.signal)\n            return options.diagnose!({\n              goal: options.goal,\n              phases,\n              signal: options.signal,\n              retrieval,\n            })\n          },\n          (diagnosed) => `${diagnosed.length} finding(s)`,\n        )),\n      ]\n    } else {\n      skipPhase(phases, now, 'gap-diagnosis', 'no diagnosis hook provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'knowledge-acquisition')) {\n    if (options.acquireKnowledge) {\n      acquisition = await runPhase(\n        phases,\n        now,\n        'knowledge-acquisition',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.acquireKnowledge!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n          })\n        },\n        summarizeAcquisitionDecision,\n      )\n    } else {\n      skipPhase(phases, now, 'knowledge-acquisition', 'no acquisition hook provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'knowledge-update')) {\n    if (options.updateKnowledge) {\n      knowledgeUpdate = await runPhase(\n        phases,\n        now,\n        'knowledge-update',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.updateKnowledge!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n            acquisition,\n          })\n        },\n        (result) => result.summary,\n      )\n    } else if (options.knowledgeResearch) {\n      knowledgeUpdate = await runPhase(\n        phases,\n        now,\n        'knowledge-update',\n        async () => {\n          assertNotAborted(options.signal)\n          return runKnowledgeResearchUpdate(options, acquisition)\n        },\n        (result) => result.summary,\n      )\n    } else {\n      skipPhase(phases, now, 'knowledge-update', 'no update hook or research loop provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'answer-quality')) {\n    if (options.evaluateAnswers) {\n      answerQuality = await runPhase(\n        phases,\n        now,\n        'answer-quality',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.evaluateAnswers!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n            acquisition,\n            knowledgeUpdate,\n          })\n        },\n        summarizeAnswerQuality,\n      )\n      findings = [...findings, ...(answerQuality.findings ?? [])]\n    } else {\n      skipPhase(phases, now, 'answer-quality', 'no answer-quality hook provided')\n    }\n  }\n\n  if (phaseEnabled(options, 'promotion')) {\n    if (options.promote) {\n      promotion = await runPhase(\n        phases,\n        now,\n        'promotion',\n        async () => {\n          assertNotAborted(options.signal)\n          return options.promote!({\n            goal: options.goal,\n            phases,\n            signal: options.signal,\n            retrieval,\n            findings,\n            acquisition,\n            knowledgeUpdate,\n            answerQuality,\n          })\n        },\n        (result) => `${result.promoted ? 'promoted' : 'held'}: ${result.reason}`,\n      )\n    } else {\n      skipPhase(phases, now, 'promotion', 'no promotion hook provided')\n    }\n  }\n\n  return {\n    goal: options.goal,\n    phases,\n    retrieval,\n    findings,\n    acquisition,\n    knowledgeUpdate,\n    answerQuality,\n    promotion,\n  }\n}\n\nasync function runKnowledgeResearchUpdate(\n  options: RunRagKnowledgeImprovementLoopOptions,\n  acquisition: KnowledgeResearchLoopDecision | undefined,\n): Promise<RagKnowledgeUpdateResult> {\n  const research = options.knowledgeResearch\n  if (!research) {\n    throw new Error('knowledgeResearch options are required to run the knowledge update phase')\n  }\n  const { goal, step, ...rest } = research\n  const researchStep = step ?? acquisitionBackedResearchStep(acquisition)\n  const maxIterations = step ? rest.maxIterations : 1\n  const result = await runKnowledgeResearchLoop({\n    ...rest,\n    goal: goal ?? options.goal,\n    maxIterations,\n    signal: options.signal,\n    step: researchStep,\n  })\n  return {\n    applied: result.steps.some((stepResult) => {\n      return stepResult.addedSources.length > 0 || Boolean(stepResult.applied)\n    }),\n    summary: `${result.iterations} research iteration(s); done=${String(result.done)}`,\n    research: result,\n  }\n}\n\nfunction acquisitionBackedResearchStep(\n  acquisition: KnowledgeResearchLoopDecision | undefined,\n): RunKnowledgeResearchLoopOptions['step'] {\n  if (!acquisition) {\n    throw new Error(\n      'knowledgeResearch requires either a step hook or a knowledge-acquisition result to apply',\n    )\n  }\n  return () => ({ ...acquisition, done: acquisition.done ?? true })\n}\n\nasync function runPhase<T>(\n  phases: RagKnowledgeImprovementPhaseResult[],\n  now: () => Date,\n  phase: RagKnowledgeImprovementPhase,\n  action: () => MaybePromise<T>,\n  summarize: (result: T) => string,\n): Promise<T> {\n  const startedAt = now().toISOString()\n  try {\n    const result = await action()\n    phases.push({\n      phase,\n      status: 'completed',\n      summary: summarize(result),\n      startedAt,\n      finishedAt: now().toISOString(),\n    })\n    return result\n  } catch (error) {\n    phases.push({\n      phase,\n      status: 'failed',\n      summary: (error as Error).message,\n      startedAt,\n      finishedAt: now().toISOString(),\n    })\n    throw error\n  }\n}\n\nfunction skipPhase(\n  phases: RagKnowledgeImprovementPhaseResult[],\n  now: () => Date,\n  phase: RagKnowledgeImprovementPhase,\n  summary: string,\n): void {\n  const timestamp = now().toISOString()\n  phases.push({ phase, status: 'skipped', summary, startedAt: timestamp, finishedAt: timestamp })\n}\n\nfunction summarizeRetrievalResult(result: RunRetrievalImprovementLoopResult): string {\n  return `${result.candidates.length} candidate(s); winner=${JSON.stringify(result.winnerConfig)}`\n}\n\nfunction summarizeAcquisitionDecision(decision: KnowledgeResearchLoopDecision): string {\n  const sourcePathCount = decision.sourcePaths?.length ?? 0\n  const sourceTextCount = decision.sourceTexts?.length ?? 0\n  const proposal = decision.proposalText ? 'proposal' : 'no proposal'\n  return `${sourcePathCount} path source(s), ${sourceTextCount} text source(s), ${proposal}`\n}\n\nfunction summarizeAnswerQuality(result: RagAnswerQualityResult): string {\n  const metrics = Object.entries(result.metrics)\n    .sort(([a], [b]) => a.localeCompare(b))\n    .map(([key, value]) => `${key}=${formatMetric(value)}`)\n    .join(', ')\n  return `${result.passed ? 'passed' : 'failed'}${metrics ? `; ${metrics}` : ''}`\n}\n\nfunction formatMetric(value: number): string {\n  return Number.isFinite(value) ? value.toFixed(3) : String(value)\n}\n\nfunction phaseEnabled(\n  options: RunRagKnowledgeImprovementLoopOptions,\n  phase: RagKnowledgeImprovementPhase,\n): boolean {\n  return !options.enabledPhases || options.enabledPhases.includes(phase)\n}\n\nfunction assertConfiguredRequiredPhases(options: RunRagKnowledgeImprovementLoopOptions): void {\n  for (const phase of options.requiredPhases ?? []) {\n    if (!phaseEnabled(options, phase)) {\n      throw new Error(`required phase ${phase} is not enabled`)\n    }\n    if (!phaseConfigured(options, phase)) {\n      throw new Error(requiredPhaseMessage(phase))\n    }\n  }\n}\n\nfunction phaseConfigured(\n  options: RunRagKnowledgeImprovementLoopOptions,\n  phase: RagKnowledgeImprovementPhase,\n): boolean {\n  switch (phase) {\n    case 'retrieval-tuning':\n      return Boolean(options.retrieval)\n    case 'gap-diagnosis':\n      return Boolean(options.diagnose)\n    case 'knowledge-acquisition':\n      return Boolean(options.acquireKnowledge)\n    case 'knowledge-update':\n      return Boolean(options.updateKnowledge ?? options.knowledgeResearch)\n    case 'answer-quality':\n      return Boolean(options.evaluateAnswers)\n    case 'promotion':\n      return Boolean(options.promote)\n  }\n}\n\nfunction requiredPhaseMessage(phase: RagKnowledgeImprovementPhase): string {\n  switch (phase) {\n    case 'retrieval-tuning':\n      return 'required phase retrieval-tuning requires retrieval options'\n    case 'gap-diagnosis':\n      return 'required phase gap-diagnosis requires a diagnose hook'\n    case 'knowledge-acquisition':\n      return 'required phase knowledge-acquisition requires an acquireKnowledge hook'\n    case 'knowledge-update':\n      return 'required phase knowledge-update requires updateKnowledge or knowledgeResearch'\n    case 'answer-quality':\n      return 'required phase answer-quality requires an evaluateAnswers hook'\n    case 'promotion':\n      return 'required phase promotion requires a promote hook'\n  }\n}\n\nfunction assertNotAborted(signal: AbortSignal | undefined): void {\n  if (signal?.aborted) {\n    throw new Error('RAG knowledge improvement loop aborted')\n  }\n}\n","import type { KnowledgeFragment } from './sources/types'\n\n/**\n * Change detection across snapshots of one source's fragments.\n *\n * The output drives the continuous-ingestion loop: each `KnowledgeChange`\n * carries the eval dimensions affected (`affectedDimensions`), which an\n * agent-eval campaign scheduler consumes to decide which campaigns to\n * re-run. Three change kinds:\n *\n *   - `added` — fragment id appears in `next` but not `prev`.\n *   - `removed` — fragment id appears in `prev` but not `next`. Typical\n *     trigger: an authority retires a Wex slug, or a state SOS reorganises\n *     its forms catalogue.\n *   - `modified` — fragment id appears in both, body hash differs. This\n *     is the dominant change kind in practice — the Ryan-LLC v. FTC\n *     vacatur case manifests as a `modified` on the Wex non-compete\n *     fragment, NOT as a removed one.\n *\n * Unverifiable fragments are filtered out before diffing — comparing a\n * captcha-blocked snapshot against a real one would falsely fire every\n * fragment as removed. The caller can inspect the raw lists if they want\n * to surface block-page failures.\n *\n * Within-snapshot duplicate ids are an upstream bug; this function picks\n * the LAST one and emits a diagnostic via the `warnings` field.\n *\n * @stable\n */\n\nexport type KnowledgeChangeKind = 'added' | 'removed' | 'modified'\n\nexport interface KnowledgeChange {\n  /** Source-scoped id (matches `KnowledgeFragment.id`). */\n  fragmentId: string\n  kind: KnowledgeChangeKind\n  /**\n   * For `added`: full body of the new fragment.\n   * For `removed`: full body of the prior fragment.\n   * For `modified`: unified-diff-style payload `{ before, after }` body strings.\n   */\n  diff?: { before?: string; after?: string }\n  /**\n   * Eval dimensions to re-score. Computed as the union of both fragments'\n   * `dimensionHints`. The eval cron treats this as a set of campaign tags.\n   */\n  affectedDimensions: string[]\n  /** URL of the affected authority page (from whichever side has it). */\n  url?: string\n  /**\n   * Source-attested change time. For `modified`, takes the NEXT fragment's\n   * `sourceUpdatedAt`. For `removed`, takes the PRIOR fragment's\n   * `sourceUpdatedAt`. For `added`, takes the NEXT fragment's\n   * `sourceUpdatedAt`. Consumers index changes by this date.\n   */\n  detectedAt: string\n}\n\nexport interface DetectChangesResult {\n  changes: KnowledgeChange[]\n  /** Counts by kind — handy for dashboards. */\n  summary: { added: number; removed: number; modified: number }\n  /** Non-fatal diagnostics (duplicate ids, dropped unverifiable fragments). */\n  warnings: string[]\n}\n\nexport interface DetectChangesOptions {\n  /**\n   * When true (default), unverifiable fragments are dropped from both\n   * sides before comparison. Set false ONLY when debugging block-page\n   * issues — comparing against unverifiable content emits false\n   * `removed`/`modified` changes.\n   */\n  skipUnverifiable?: boolean\n  /**\n   * When provided, only changes whose `affectedDimensions` intersect this\n   * set are returned. Useful for cron loops that schedule per-dimension\n   * eval campaigns and only care about a subset.\n   */\n  filterDimensions?: string[]\n}\n\nexport function detectChanges(\n  prev: KnowledgeFragment[],\n  next: KnowledgeFragment[],\n  options: DetectChangesOptions = {},\n): DetectChangesResult {\n  const skipUnverifiable = options.skipUnverifiable ?? true\n  const warnings: string[] = []\n\n  const { map: prevMap, warnings: prevWarn } = indexFragments(prev, skipUnverifiable, 'prev')\n  const { map: nextMap, warnings: nextWarn } = indexFragments(next, skipUnverifiable, 'next')\n  warnings.push(...prevWarn, ...nextWarn)\n\n  const changes: KnowledgeChange[] = []\n  const seen = new Set<string>()\n\n  for (const [id, nextFragment] of nextMap) {\n    seen.add(id)\n    const prevFragment = prevMap.get(id)\n    if (!prevFragment) {\n      changes.push({\n        fragmentId: id,\n        kind: 'added',\n        diff: { after: nextFragment.body },\n        affectedDimensions: dedup(nextFragment.dimensionHints),\n        url: nextFragment.provenance.url,\n        detectedAt: nextFragment.provenance.sourceUpdatedAt,\n      })\n      continue\n    }\n    if (prevFragment.bodyHash !== nextFragment.bodyHash) {\n      changes.push({\n        fragmentId: id,\n        kind: 'modified',\n        diff: { before: prevFragment.body, after: nextFragment.body },\n        affectedDimensions: dedup([...prevFragment.dimensionHints, ...nextFragment.dimensionHints]),\n        url: nextFragment.provenance.url,\n        detectedAt: nextFragment.provenance.sourceUpdatedAt,\n      })\n    }\n  }\n\n  for (const [id, prevFragment] of prevMap) {\n    if (seen.has(id)) continue\n    changes.push({\n      fragmentId: id,\n      kind: 'removed',\n      diff: { before: prevFragment.body },\n      affectedDimensions: dedup(prevFragment.dimensionHints),\n      url: prevFragment.provenance.url,\n      detectedAt: prevFragment.provenance.sourceUpdatedAt,\n    })\n  }\n\n  const filtered = options.filterDimensions\n    ? changes.filter((c) => c.affectedDimensions.some((d) => options.filterDimensions?.includes(d)))\n    : changes\n\n  return {\n    changes: filtered,\n    summary: {\n      added: filtered.filter((c) => c.kind === 'added').length,\n      removed: filtered.filter((c) => c.kind === 'removed').length,\n      modified: filtered.filter((c) => c.kind === 'modified').length,\n    },\n    warnings,\n  }\n}\n\nfunction indexFragments(\n  fragments: KnowledgeFragment[],\n  skipUnverifiable: boolean,\n  side: string,\n): { map: Map<string, KnowledgeFragment>; warnings: string[] } {\n  const map = new Map<string, KnowledgeFragment>()\n  const warnings: string[] = []\n  let dropped = 0\n  for (const fragment of fragments) {\n    if (skipUnverifiable && !fragment.provenance.verifiable) {\n      dropped += 1\n      continue\n    }\n    if (map.has(fragment.id)) {\n      warnings.push(`${side}: duplicate fragment id ${fragment.id} — keeping last`)\n    }\n    map.set(fragment.id, fragment)\n  }\n  if (dropped > 0) {\n    warnings.push(`${side}: dropped ${dropped} unverifiable fragment(s) before diff`)\n  }\n  return { map, warnings }\n}\n\nfunction dedup<T>(items: T[]): T[] {\n  return [...new Set(items)]\n}\n","export interface ChunkingOptions {\n  targetChars: number\n  maxChars: number\n  minChars: number\n  overlapChars: number\n}\n\nexport interface KnowledgeChunk {\n  index: number\n  text: string\n  headingPath: string\n  charStart: number\n  charEnd: number\n  oversized: boolean\n}\n\nconst DEFAULT_OPTIONS: ChunkingOptions = {\n  targetChars: 1000,\n  maxChars: 1500,\n  minChars: 160,\n  overlapChars: 180,\n}\n\nexport function chunkMarkdown(\n  content: string,\n  options?: Partial<ChunkingOptions>,\n): KnowledgeChunk[] {\n  const opts = normalizeOptions({ ...DEFAULT_OPTIONS, ...(options ?? {}) })\n  const { body, bodyOffset } = stripFrontmatter(content)\n  if (body.trim() === '') return []\n\n  const sections = splitSections(body, bodyOffset)\n  const chunks: KnowledgeChunk[] = []\n  for (const section of sections) {\n    for (const part of chunkText(section.text, opts)) {\n      const start = section.start + part.start\n      chunks.push({\n        index: chunks.length,\n        text: part.text,\n        headingPath: section.headingPath,\n        charStart: start,\n        charEnd: start + part.text.length,\n        oversized: part.text.length > opts.maxChars,\n      })\n    }\n  }\n  return chunks\n}\n\nexport function stripFrontmatter(content: string): { body: string; bodyOffset: number } {\n  const normalized = content.replace(/\\r\\n/g, '\\n')\n  if (!normalized.startsWith('---\\n')) return { body: normalized, bodyOffset: 0 }\n  const match = /^---\\n[\\s\\S]*?\\n---\\s*\\n?/.exec(normalized)\n  if (!match) return { body: normalized, bodyOffset: 0 }\n  return { body: normalized.slice(match[0].length), bodyOffset: match[0].length }\n}\n\nfunction normalizeOptions(opts: ChunkingOptions): ChunkingOptions {\n  if (opts.maxChars < opts.targetChars) opts.maxChars = opts.targetChars\n  if (opts.overlapChars >= opts.targetChars) opts.overlapChars = Math.floor(opts.targetChars / 2)\n  return opts\n}\n\ninterface Section {\n  text: string\n  start: number\n  headingPath: string\n}\n\nfunction splitSections(body: string, bodyOffset: number): Section[] {\n  const lines = body.split('\\n')\n  const sections: Section[] = []\n  const headings: Record<number, string> = {}\n  let current: { lines: string[]; start: number; headingPath: string } = {\n    lines: [],\n    start: bodyOffset,\n    headingPath: '',\n  }\n  let cursor = bodyOffset\n  let fence: string | null = null\n\n  const flush = () => {\n    const text = current.lines.join('\\n')\n    if (text.trim() !== '')\n      sections.push({ text, start: current.start, headingPath: current.headingPath })\n  }\n\n  for (let i = 0; i < lines.length; i++) {\n    const line = lines[i]!\n    const lineLen = line.length + (i < lines.length - 1 ? 1 : 0)\n    const fenceMatch = /^(`{3,}|~{3,})/.exec(line)\n    if (fenceMatch) {\n      const marker = fenceMatch[1]!\n      fence = fence === null ? marker : line.startsWith(fence) ? null : fence\n      current.lines.push(line)\n      cursor += lineLen\n      continue\n    }\n    const heading = fence === null ? /^(#{1,6})\\s+(.+?)\\s*$/.exec(line) : null\n    if (heading) {\n      flush()\n      const level = heading[1]!.length\n      headings[level] = heading[2]!.trim()\n      for (let next = level + 1; next <= 6; next++) delete headings[next]\n      current = {\n        lines: [line],\n        start: cursor,\n        headingPath: Object.entries(headings)\n          .sort(([a], [b]) => Number(a) - Number(b))\n          .map(([levelText, title]) => `${'#'.repeat(Number(levelText))} ${title}`)\n          .join(' > '),\n      }\n      cursor += lineLen\n      continue\n    }\n    current.lines.push(line)\n    cursor += lineLen\n  }\n  flush()\n  return sections\n}\n\nfunction chunkText(text: string, opts: ChunkingOptions): Array<{ text: string; start: number }> {\n  if (text.length <= opts.targetChars) return [{ text, start: 0 }]\n  const atoms = splitAtoms(text)\n  const chunks: Array<{ text: string; start: number }> = []\n  let buffer = ''\n  let bufferStart = 0\n  for (const atom of atoms) {\n    if (buffer === '') bufferStart = atom.start\n    if (buffer.length > 0 && buffer.length + atom.text.length > opts.targetChars) {\n      chunks.push({ text: buffer.trimEnd(), start: bufferStart })\n      const overlap = buffer.slice(Math.max(0, buffer.length - opts.overlapChars))\n      buffer = overlap + atom.text\n      bufferStart = Math.max(bufferStart, atom.start - overlap.length)\n    } else {\n      buffer += atom.text\n    }\n  }\n  if (buffer.trim() !== '') chunks.push({ text: buffer.trimEnd(), start: bufferStart })\n  return mergeTinyChunks(chunks, opts)\n}\n\nfunction splitAtoms(text: string): Array<{ text: string; start: number }> {\n  const parts: Array<{ text: string; start: number }> = []\n  const paragraphs = text.split(/(\\n\\s*\\n)/)\n  let cursor = 0\n  for (let i = 0; i < paragraphs.length; i += 2) {\n    const paragraph = (paragraphs[i] ?? '') + (paragraphs[i + 1] ?? '')\n    if (paragraph === '') continue\n    parts.push({ text: paragraph, start: cursor })\n    cursor += paragraph.length\n  }\n  return parts\n}\n\nfunction mergeTinyChunks(\n  chunks: Array<{ text: string; start: number }>,\n  opts: ChunkingOptions,\n): Array<{ text: string; start: number }> {\n  const out: Array<{ text: string; start: number }> = []\n  for (const chunk of chunks) {\n    const prev = out[out.length - 1]\n    if (\n      prev &&\n      chunk.text.length < opts.minChars &&\n      prev.text.length + chunk.text.length <= opts.maxChars\n    ) {\n      prev.text = `${prev.text}\\n\\n${chunk.text}`\n    } else {\n      out.push({ ...chunk })\n    }\n  }\n  return out\n}\n","/**\n * The SINGLE-AGENT COLLECTION driver — the blind-collection baseline (Arm A).\n *\n * This is the honest null the depth A/B is measured against. The other drivers\n * spend extra inference to do something differentiated:\n *   - `createVerifyingResearchDriver` runs an LLM gate per source (Arm B),\n *   - `createResearchDrivingDriver` extracts claims, tracks corroboration, and\n *     synthesizes deep follow-up questions to drive depth (Arm C).\n *\n * This driver does NONE of that. It is a pass-through: it accepts every source\n * the worker proposes and contributes no research, no gating, and no steering of\n * its own. The loop still dedups exact-uri duplicates before calling\n * `verifySource` (that is the loop's job, not the driver's), and the default\n * `foldGaps` (a plain bulleted list of the still-open readiness gaps) still folds\n * the gaps into the worker's next prompt — so the worker keeps researching, but\n * NOTHING intelligent sits between the worker and the knowledge base.\n *\n * In other words: ONE agent (the worker) collects sources round after round, and\n * the \"driver\" is an inert rubber stamp. That is exactly what \"single-agent\n * collection\" means — the topology with zero coordinator intelligence — so its\n * material-facts score is the floor every other arm must beat to justify its\n * extra inference cost.\n *\n * It adds NO router calls of its own: `verifySource` is a synchronous accept and\n * `foldGaps` is omitted so the loop uses its built-in gap list. So Arm A's cost\n * is the worker's cost alone — the cleanest possible blind-collection baseline.\n */\n\nimport type {\n  ResearchDriver,\n  ResearchSourceProposal,\n  SourceVerdict,\n} from './two-agent-research-loop'\n\n/**\n * Build the single-agent collection driver. Accepts every source; never gates,\n * never researches, never steers beyond the loop's default open-gap list. The\n * worker is the only agent that thinks.\n */\nexport function createCollectionResearchDriver(): ResearchDriver {\n  return {\n    verifySource(_source: ResearchSourceProposal): SourceVerdict {\n      return { accept: true }\n    },\n  }\n}\n","import { isDeepStrictEqual } from 'node:util'\n\nexport interface DiscoveryTask {\n  id: string\n  goal: string\n  query?: string\n  sourceHints?: string[]\n  metadata?: Record<string, unknown>\n}\n\nexport interface DiscoveryResult {\n  taskId: string\n  summary: string\n  sourceUris?: string[]\n  claims?: Array<{ text: string; sourceUri?: string; confidence?: number }>\n  followUpTasks?: DiscoveryTask[]\n  metadata?: Record<string, unknown>\n}\n\nexport interface KnowledgeDiscoveryWorker {\n  run(task: DiscoveryTask, signal?: AbortSignal): Promise<DiscoveryResult> | DiscoveryResult\n}\n\nexport interface KnowledgeDiscoveryDispatcher {\n  dispatch(\n    tasks: DiscoveryTask[],\n    options?: {\n      concurrency?: number\n      signal?: AbortSignal\n    },\n  ): Promise<DiscoveryResult[]>\n}\n\nexport type DiscoveryLoopStopReason = 'complete' | 'max-rounds' | 'max-tasks' | 'aborted'\n\nexport interface DiscoveryLoopRound {\n  round: number\n  tasks: DiscoveryTask[]\n  results: DiscoveryResult[]\n  queuedFollowUps: DiscoveryTask[]\n}\n\nexport interface DiscoveryLoopResult {\n  stopReason: DiscoveryLoopStopReason\n  tasksDispatched: number\n  results: DiscoveryResult[]\n  rounds: DiscoveryLoopRound[]\n  /** Tasks retained, not dropped, when a configured limit stops the loop. */\n  pendingTasks: DiscoveryTask[]\n  /** Structurally identical task identities ignored to prevent cycles. */\n  duplicateTaskIds: string[]\n}\n\nexport interface RunDiscoveryLoopOptions {\n  dispatcher: KnowledgeDiscoveryDispatcher\n  initialTasks: readonly DiscoveryTask[]\n  /** Maximum follow-up depth including the initial dispatch. Default 3. */\n  maxRounds?: number\n  /** Maximum tasks dispatched across all rounds. Default 24. */\n  maxTasks?: number\n  /** Forwarded to the dispatcher. Default 4. */\n  concurrency?: number\n  signal?: AbortSignal\n  onRound?: (round: DiscoveryLoopRound) => Promise<void> | void\n}\n\n/**\n * Dispatch discovery tasks and recursively pursue worker-proposed follow-ups.\n *\n * The runner owns only bounded scheduling and accounting. Workers own search,\n * source verification, and domain-specific candidate shapes.\n */\nexport async function runDiscoveryLoop(\n  options: RunDiscoveryLoopOptions,\n): Promise<DiscoveryLoopResult> {\n  const maxRounds = positiveInteger(options.maxRounds ?? 3, 'maxRounds')\n  const maxTasks = positiveInteger(options.maxTasks ?? 24, 'maxTasks')\n  const concurrency = positiveInteger(options.concurrency ?? 4, 'concurrency')\n  const known = new Map<string, DiscoveryTask>()\n  const pending: DiscoveryTask[] = []\n  const duplicateTaskIds = new Set<string>()\n  enqueueTasks(options.initialTasks, known, pending, duplicateTaskIds)\n\n  const rounds: DiscoveryLoopRound[] = []\n  const results: DiscoveryResult[] = []\n  let tasksDispatched = 0\n  let aborted = false\n\n  while (pending.length > 0 && rounds.length < maxRounds && tasksDispatched < maxTasks) {\n    if (options.signal?.aborted) {\n      aborted = true\n      break\n    }\n    const capacity = maxTasks - tasksDispatched\n    const tasks = pending.splice(0, capacity)\n    let dispatched: DiscoveryResult[]\n    try {\n      dispatched = orderCompleteDispatch(\n        tasks,\n        await options.dispatcher.dispatch(tasks, {\n          concurrency,\n          signal: options.signal,\n        }),\n      )\n    } catch (cause) {\n      if (!options.signal?.aborted) throw cause\n      pending.unshift(...tasks)\n      aborted = true\n      break\n    }\n    tasksDispatched += tasks.length\n    results.push(...dispatched)\n\n    const queuedFollowUps: DiscoveryTask[] = []\n    for (const result of dispatched) {\n      enqueueTasks(result.followUpTasks ?? [], known, queuedFollowUps, duplicateTaskIds)\n    }\n    pending.push(...queuedFollowUps)\n    const round: DiscoveryLoopRound = {\n      round: rounds.length + 1,\n      tasks,\n      results: dispatched,\n      queuedFollowUps,\n    }\n    rounds.push(round)\n    await options.onRound?.(round)\n    if (options.signal?.aborted) {\n      aborted = true\n      break\n    }\n  }\n\n  const stopReason: DiscoveryLoopStopReason = aborted\n    ? 'aborted'\n    : pending.length === 0\n      ? 'complete'\n      : tasksDispatched >= maxTasks\n        ? 'max-tasks'\n        : 'max-rounds'\n  return {\n    stopReason,\n    tasksDispatched,\n    results,\n    rounds,\n    pendingTasks: pending,\n    duplicateTaskIds: [...duplicateTaskIds],\n  }\n}\n\nexport function createLocalDiscoveryDispatcher(\n  worker: KnowledgeDiscoveryWorker,\n): KnowledgeDiscoveryDispatcher {\n  return {\n    async dispatch(tasks, options = {}) {\n      const concurrency = Math.max(1, options.concurrency ?? 4)\n      const results: DiscoveryResult[] = []\n      let cursor = 0\n      async function runNext(): Promise<void> {\n        while (cursor < tasks.length) {\n          if (options.signal?.aborted) throw new Error('Discovery dispatch aborted')\n          const task = tasks[cursor++]!\n          results.push(await worker.run(task, options.signal))\n        }\n      }\n      await Promise.all(Array.from({ length: Math.min(concurrency, tasks.length) }, runNext))\n      return orderCompleteDispatch(tasks, results)\n    },\n  }\n}\n\nfunction enqueueTasks(\n  tasks: readonly DiscoveryTask[],\n  known: Map<string, DiscoveryTask>,\n  destination: DiscoveryTask[],\n  duplicateTaskIds: Set<string>,\n): void {\n  for (const task of tasks) {\n    assertTask(task)\n    const prior = known.get(task.id)\n    if (!prior) {\n      known.set(task.id, task)\n      destination.push(task)\n      continue\n    }\n    if (!isDeepStrictEqual(prior, task)) {\n      throw new Error(`Discovery task id '${task.id}' refers to conflicting tasks`)\n    }\n    duplicateTaskIds.add(task.id)\n  }\n}\n\nfunction assertTask(task: DiscoveryTask): void {\n  if (!task.id.trim()) throw new Error('Discovery task id must not be empty')\n  if (!task.goal.trim()) throw new Error(`Discovery task '${task.id}' goal must not be empty`)\n}\n\nfunction orderCompleteDispatch(\n  tasks: readonly DiscoveryTask[],\n  results: readonly DiscoveryResult[],\n): DiscoveryResult[] {\n  const order = new Map(tasks.map((task, index) => [task.id, index]))\n  const received = new Set<string>()\n  for (const result of results) {\n    if (!order.has(result.taskId)) {\n      throw new Error(`Discovery dispatcher returned unknown task '${result.taskId}'`)\n    }\n    if (received.has(result.taskId)) {\n      throw new Error(`Discovery dispatcher returned task '${result.taskId}' more than once`)\n    }\n    received.add(result.taskId)\n  }\n  const missing = tasks.filter((task) => !received.has(task.id)).map((task) => task.id)\n  if (missing.length > 0) {\n    throw new Error(`Discovery dispatcher omitted tasks: ${missing.join(', ')}`)\n  }\n  return [...results].sort(\n    (a, b) => (order.get(a.taskId) as number) - (order.get(b.taskId) as number),\n  )\n}\n\nfunction positiveInteger(value: number, name: string): number {\n  if (!Number.isInteger(value) || value < 1) {\n    throw new Error(`Discovery loop ${name} must be a positive integer`)\n  }\n  return value\n}\n","import { readFile } from 'node:fs/promises'\nimport { join } from 'node:path'\nimport { z } from 'zod'\nimport { isMissingFile, writeJsonDurableWithinRoot } from './durable-fs'\nimport { withKnowledgeMutation, withKnowledgeRead } from './mutation-lock'\n\n/**\n * Knowledge freshness store: tracks when each `(workspaceId, sourceId)` pair\n * was last successfully refreshed, and reports staleness against a TTL.\n *\n * The contract is intentionally minimal — just enough to drive a cron loop:\n *\n *   ```ts\n *   const store = createFileSystemFreshnessStore({ root: '.agent-knowledge' })\n *   for (const source of sources) {\n *     if (await store.stale({ workspaceId, sourceId: source.id, ttlMs: DAY })) {\n *       const fragments = await source.fetch({ cacheDir })\n *       await persistFragments(fragments)\n *       await store.mark({ workspaceId, sourceId: source.id, when: new Date() })\n *     }\n *   }\n *   ```\n *\n * Per-tenant isolation is enforced by `workspaceId` keying — there is no\n * global mutable state across workspaces.\n *\n * Two adapters ship in-package:\n *\n *   - `createFileSystemFreshnessStore` — JSON file under the knowledge root,\n *     mirrors the layout convention already used by `sources.json`.\n *   - `createD1FreshnessStoreStub` — adapter scaffold for Cloudflare D1 /\n *     Postgres. Production consumers should implement the `D1Adapter`\n *     interface inside their own app; this stub exists to anchor the shape.\n *\n * @stable contract — interface is frozen at 0.x within this major.\n * @stable filesystem adapter\n * @experimental D1 stub — interface will evolve as real consumers wire it.\n */\n\n/** Identity for one freshness record. */\nexport interface FreshnessKey {\n  workspaceId: string\n  sourceId: string\n}\n\n/** TTL bound for staleness checks. */\nexport interface FreshnessTtl extends FreshnessKey {\n  /** Milliseconds — `Date.now() - last() > ttlMs` ⇒ stale. */\n  ttlMs: number\n  /** Injected clock for deterministic tests; defaults to system time. */\n  now?: Date\n}\n\n/** Mark argument. */\nexport interface FreshnessMark extends FreshnessKey {\n  when: Date\n  /** Optional content hash captured at refresh time; aids debugging. */\n  contentHash?: string\n}\n\nexport interface KnowledgeFreshnessStore {\n  /** Last refresh time, or null if never refreshed. */\n  last(key: FreshnessKey): Promise<Date | null>\n  /** Record a successful refresh. */\n  mark(input: FreshnessMark): Promise<void>\n  /** True iff `last(key)` is null or older than `ttlMs`. */\n  stale(input: FreshnessTtl): Promise<boolean>\n  /** All records for a workspace — useful for dashboards / debugging. */\n  list(workspaceId: string): Promise<FreshnessRecord[]>\n}\n\nexport interface FreshnessRecord {\n  workspaceId: string\n  sourceId: string\n  lastRefreshedAt: string\n  contentHash?: string\n}\n\nexport interface FileSystemFreshnessStoreOptions {\n  /**\n   * Knowledge root. The store writes to `<root>/.agent-knowledge/freshness.json`,\n   * mirroring the convention used by `sources.json`.\n   */\n  root: string\n}\n\nconst freshnessRecordSchema = z\n  .object({\n    workspaceId: z.string().min(1),\n    sourceId: z.string().min(1),\n    lastRefreshedAt: z.iso.datetime(),\n    contentHash: z.string().min(1).optional(),\n  })\n  .strict()\nconst freshnessFileSchema = z\n  .object({ records: z.record(z.string(), freshnessRecordSchema) })\n  .strict()\n\n/**\n * Filesystem-backed implementation. Single JSON file per knowledge root,\n * indexed by `${workspaceId}::${sourceId}`. Reads parse on every call —\n * cron tick rate is well below the cost of one JSON parse.\n *\n * Writes share the package-wide filesystem lock, so multiple workers cannot\n * overwrite one another or run through an interrupted knowledge promotion.\n */\nexport function createFileSystemFreshnessStore(\n  options: FileSystemFreshnessStoreOptions,\n): KnowledgeFreshnessStore {\n  const path = join(options.root, '.agent-knowledge', 'freshness.json')\n\n  const read = async (): Promise<Record<string, FreshnessRecord>> => {\n    return withKnowledgeRead(options.root, async () => {\n      try {\n        return freshnessFileSchema.parse(JSON.parse(await readFile(path, 'utf8'))).records\n      } catch (error) {\n        if (isMissingFile(error)) return {}\n        throw error\n      }\n    })\n  }\n\n  const write = async (records: Record<string, FreshnessRecord>): Promise<void> => {\n    await writeJsonDurableWithinRoot(\n      options.root,\n      '.agent-knowledge/freshness.json',\n      freshnessFileSchema.parse({ records }),\n    )\n  }\n\n  return {\n    async last(key) {\n      const records = await read()\n      const record = records[buildKey(key)]\n      return record ? new Date(record.lastRefreshedAt) : null\n    },\n    async mark(input) {\n      await withKnowledgeMutation(options.root, async () => {\n        const records = await read()\n        records[buildKey(input)] = {\n          workspaceId: input.workspaceId,\n          sourceId: input.sourceId,\n          lastRefreshedAt: input.when.toISOString(),\n          ...(input.contentHash === undefined ? {} : { contentHash: input.contentHash }),\n        }\n        await write(records)\n      })\n    },\n    async stale(input) {\n      const last = await this.last(input)\n      if (!last) return true\n      const now = input.now ?? new Date()\n      return now.getTime() - last.getTime() > input.ttlMs\n    },\n    async list(workspaceId) {\n      const records = await read()\n      return Object.values(records).filter((r) => r.workspaceId === workspaceId)\n    },\n  }\n}\n\n/**\n * D1 / Postgres adapter scaffold. Production consumers implement\n * `D1Adapter` against their own driver (better-sqlite3, postgres,\n * Cloudflare D1 binding, ...). This factory wires the adapter to the\n * `KnowledgeFreshnessStore` interface.\n *\n * The expected schema:\n *\n * ```sql\n * CREATE TABLE knowledge_freshness (\n *   workspace_id     TEXT NOT NULL,\n *   source_id        TEXT NOT NULL,\n *   last_refreshed_at TEXT NOT NULL,\n *   content_hash     TEXT,\n *   PRIMARY KEY (workspace_id, source_id)\n * );\n * ```\n */\nexport interface D1Adapter {\n  get(workspaceId: string, sourceId: string): Promise<FreshnessRecord | null>\n  upsert(record: FreshnessRecord): Promise<void>\n  listByWorkspace(workspaceId: string): Promise<FreshnessRecord[]>\n}\n\nexport function createD1FreshnessStoreStub(adapter: D1Adapter): KnowledgeFreshnessStore {\n  return {\n    async last(key) {\n      const record = await adapter.get(key.workspaceId, key.sourceId)\n      return record ? new Date(record.lastRefreshedAt) : null\n    },\n    async mark(input) {\n      await adapter.upsert({\n        workspaceId: input.workspaceId,\n        sourceId: input.sourceId,\n        lastRefreshedAt: input.when.toISOString(),\n        contentHash: input.contentHash,\n      })\n    },\n    async stale(input) {\n      const last = await this.last(input)\n      if (!last) return true\n      const now = input.now ?? new Date()\n      return now.getTime() - last.getTime() > input.ttlMs\n    },\n    async list(workspaceId) {\n      return adapter.listByWorkspace(workspaceId)\n    },\n  }\n}\n\nfunction buildKey(key: FreshnessKey): string {\n  return `${key.workspaceId}::${key.sourceId}`\n}\n","/**\n * HELD-OUT INVESTMENT-RESEARCH EVAL SET.\n *\n * The point of this file is the same FIREWALL the deep-question exam uses\n * (`tests/loops/held-out-exam.ts`): the material facts and their checkable\n * fragments are NEVER shown to a research loop. A loop is told only the company\n * + ticker + a research-as-of CUTOFF date, and asked to write an investment\n * thesis. AFTER it finishes, we grade the thesis it produced against THESE\n * facts — facts it never saw — so a high score is thesis QUALITY (it surfaced\n * the buried, material, non-obvious drivers) and not teaching-to-the-test.\n *\n * Each fact is a DEPTH fact by construction: a single ticker / company-name web\n * search does NOT surface it. They are the things buried in the filings or\n * knowable from then-available primary sources that a thorough analyst flags and\n * a one-shot search misses — customer/revenue/deposit concentration, a debt\n * maturity wall, a margin-trend reversal, a governance / related-party item, a\n * specific competitive or regulatory risk, an off-balance-sheet loss.\n *\n * THREE HARD RULES, enforced by how the data was gathered (see\n * docs/eval/investment-material-facts.md for the per-item provenance + the\n * curation-bias disclosure):\n *\n *   1. SPECIFIC + CHECKABLE. Each fact carries `expected` keyword groups — the\n *      specific number / name / phrase — so a deterministic, model-free\n *      substring grader (`gradeFactAgainstText`) can score \"did the thesis\n *      surface it\". $0, reproducible, and it cannot leak the answer key into a\n *      model the loop could observe.\n *\n *   2. DERIVED FROM REAL FETCHED EVIDENCE. Every fact records the primary source\n *      it came from (`sourceUrl`, an SEC EDGAR 10-K) and the literal `evidence`\n *      value read out of that document. Nothing here is invented; an item that\n *      could not be independently sourced was DROPPED, not guessed (the drop log\n *      is in the doc).\n *\n *   3. KNOWABLE AT THE CUTOFF. Every fact was disclosed in, or computable from, a\n *      document available on or before the company's `cutoff` date. Post-cutoff\n *      hindsight (the eventual bankruptcy / collapse) is NOT a checklist item —\n *      it is recorded separately as `knownOutcome`, purely for the reader, and is\n *      never graded.\n *\n * Grading mirrors the deep-question exam exactly: a fact is SURFACED when the\n * thesis text contains at least `minGroups` of its expected groups; a group is\n * satisfied when ANY of its `anyOf` fragments appears (case-insensitive\n * substring), so a faithful thesis phrased in its own words still grades as a\n * hit. `anyOf` groups model synonyms; the load-bearing tokens are the specific\n * numbers / names.\n */\n\n/** A required answer component: satisfied when any synonym fragment is present. */\nexport interface ExpectedGroup {\n  /** Human label for the component (for the doc / audit). */\n  label: string\n  /** Case-insensitive substring fragments; any one present satisfies the group. */\n  anyOf: string[]\n}\n\n/** Lens the fact belongs to — so a set can be checked for category coverage. */\nexport type MaterialFactLens =\n  | 'concentration' // customer / revenue / deposit concentration\n  | 'leverage' // debt load / maturity wall / interest burden\n  | 'margin-trend' // gross/operating margin reversal\n  | 'liquidity' // cash burn / negative operating cash flow\n  | 'capital-return' // buyback / dividend draining the balance sheet\n  | 'governance' // dual-class / related-party / control item\n  | 'off-balance-sheet' // unrealized losses not in earnings/equity\n  | 'regulatory' // a specific regulatory / legal / recall exposure\n\n/** One held-out material fact with a checkable expected answer + its provenance. */\nexport interface MaterialFact {\n  /** Stable id, `ticker/fN`. */\n  id: string\n  /** Which analyst lens this fact exercises. For coverage + the doc. */\n  lens: MaterialFactLens\n  /**\n   * The material fact, in plain words — for the doc/audit. NEVER shown to a loop.\n   * This is the thing a thorough analyst would flag and a ticker search misses.\n   */\n  fact: string\n  /**\n   * The checkable answer as required keyword GROUPS. The thesis text must contain\n   * at least `minGroups` of these groups (default: all). A group is satisfied\n   * when ANY of its `anyOf` fragments appears (case-insensitive substring).\n   */\n  expected: ExpectedGroup[]\n  /**\n   * Minimum number of `expected` groups the thesis must contain to count the\n   * fact SURFACED. Default = all groups (the strict bar). Lowered (and documented\n   * inline) only when the fact is genuinely satisfiable by a subset.\n   */\n  minGroups?: number\n  /**\n   * PROVENANCE. The primary source URL this fact was read from — an SEC EDGAR\n   * 10-K primary document, fetched live during curation.\n   */\n  sourceUrl: string\n  /**\n   * The literal value / phrase read out of `sourceUrl` that grounds the fact.\n   * This is the \"cite the actual filing + the value\" requirement — verbatim or\n   * near-verbatim from the filing, with the figure.\n   */\n  evidence: string\n}\n\n/** A company + the cutoff a loop researches as-of + its held-out material facts. */\nexport interface CompanyEvalCase {\n  /** Ticker as of the cutoff. */\n  ticker: string\n  /** Legal name as of the cutoff (what the loop is told to research). */\n  company: string\n  /** SEC Central Index Key (CIK), zero-stripped — the EDGAR filer id. */\n  cik: string\n  /**\n   * Research-as-of date (ISO). The loop must reason as if it is this date; every\n   * `evidence` value was knowable on or before it. >= 18 months before this set\n   * was curated, so the outcome is known but is NOT a checklist item.\n   */\n  cutoff: string\n  /** Sector, for coverage / the curation-bias disclosure. */\n  sector: string\n  /**\n   * The known POST-cutoff outcome — recorded for the reader ONLY, never graded.\n   * Keeping it out of `facts` is what makes the set hindsight-free.\n   */\n  knownOutcome: string\n  /** The held-out material facts for this company. */\n  facts: MaterialFact[]\n}\n\n/**\n * The eval set. 5 public companies, 5-8 held-out material facts each, every fact\n * grounded in a primary SEC EDGAR 10-K filed on or before the cutoff.\n *\n * CURATION-BIAS DISCLOSURE (full version in the doc): all five are companies\n * whose buried risks later materialized, because that is where the material-vs-\n * surface distinction is sharpest AND where the figures are easy to verify after\n * the fact. This biases the set toward downside risks (two of the eight lenses,\n * concentration + leverage, dominate) and toward distressed names. A production\n * eval would balance these with companies whose buried facts were POSITIVE\n * drivers and with survivors. This set is honest about that and reports the lens\n * distribution so the bias is measurable, not hidden.\n */\nexport const investmentThesisSet: CompanyEvalCase[] = [\n  {\n    ticker: 'SIVB',\n    company: 'SVB Financial Group',\n    cik: '719739',\n    cutoff: '2023-02-24',\n    sector: 'Banking',\n    knownOutcome:\n      'Failed in a deposit run and was placed in FDIC receivership on March 10, 2023; the holding company filed Chapter 11 on March 17, 2023.',\n    facts: [\n      {\n        id: 'SIVB/f1',\n        lens: 'off-balance-sheet',\n        fact: 'Held-to-maturity (HTM) securities carried at $91.3B amortized cost had a fair value of only $76.2B — a ~$15.1B unrealized loss that, because the portfolio is HTM, never touched earnings or equity and sat only in the footnotes.',\n        expected: [\n          {\n            label: 'HTM securities',\n            anyOf: ['held-to-maturity', 'held to maturity', 'htm'],\n          },\n          {\n            label: 'large unrealized loss (~$15B) / fair value gap',\n            anyOf: [\n              '15.1',\n              '15.2',\n              '$15 billion',\n              '15 billion',\n              '76,169',\n              '76.2 billion',\n              '91,321',\n              'unrealized loss',\n              'below amortized cost',\n              'fair value',\n            ],\n          },\n        ],\n        minGroups: 2,\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          'Balance sheet (Dec 31, 2022): \"Held-to-maturity securities, at amortized cost ... 91,321\" with parenthetical \"(fair value of $ 76,169 ...)\". The gap = $91,321M - $76,169M = ~$15,152M unrealized loss, disclosed only in the notes.',\n      },\n      {\n        id: 'SIVB/f2',\n        lens: 'off-balance-sheet',\n        fact: \"The HTM unrealized loss (~$15.1B) was roughly equal to the company's entire $16.0B total stockholders' equity — a mark-to-market wipeout hidden by HTM accounting.\",\n        expected: [\n          {\n            label: 'loss near/exceeds total equity',\n            anyOf: [\n              'equity',\n              'capital',\n              'insolvent',\n              'wipe out',\n              'exceeds',\n              'nearly all',\n              'tangible book',\n              '16,004',\n              '16 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"Total SVBFG stockholders\\' equity 16,004\" (Dec 31, 2022). The ~$15.15B HTM unrealized loss is ~95% of the $16.0B reported equity.',\n      },\n      {\n        id: 'SIVB/f3',\n        lens: 'concentration',\n        fact: 'Estimated uninsured deposits in U.S. offices were $151.5B at year-end 2022 — the run-prone funding base; a high share of total deposits exceeded the FDIC limit.',\n        expected: [\n          {\n            label: 'large uninsured deposit base',\n            anyOf: [\n              'uninsured deposit',\n              'above the fdic',\n              'exceed the fdic',\n              'exceeds the fdic',\n              '151.5',\n              '$151 billion',\n              'fdic insurance limit',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"As of December 31, 2022 ... the amount of estimated uninsured deposits in U.S. offices that exceed the FDIC insurance limit were $151.5 billion\".',\n      },\n      {\n        id: 'SIVB/f4',\n        lens: 'margin-trend',\n        fact: 'Cheap noninterest-bearing demand deposits fell 20 percentage points in one year — to 47% of total deposits from 67% — meaning funding costs were set to rise sharply as clients moved to interest-bearing accounts.',\n        expected: [\n          {\n            label: 'deposit mix shift to costlier funding',\n            anyOf: [\n              'noninterest-bearing',\n              'non-interest-bearing',\n              'noninterest bearing',\n              'deposit mix',\n              'funding cost',\n              'cost of deposits',\n              'interest-bearing',\n              '47 percent',\n              '20 percentage',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"Noninterest-bearing demand deposits to total deposits decreased by 20 percentage points to 47 percent as of December 31, 2022, compared to ... 2021.\"',\n      },\n      {\n        id: 'SIVB/f5',\n        lens: 'concentration',\n        fact: 'The deposit and loan base was concentrated in a single client type — the \"innovation economy\" (venture-backed technology and life-science startups) — so a downturn in venture funding would hit deposits and credit simultaneously.',\n        expected: [\n          {\n            label: 'concentration in tech / startups / innovation economy',\n            anyOf: [\n              'innovation economy',\n              'technology',\n              'life science',\n              'venture',\n              'startup',\n              'early-stage',\n              'concentrat',\n              'single industry',\n              'sector concentration',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          'The 10-K repeatedly frames the franchise around clients in \"the innovation economy\" (technology, life science / healthcare, and the venture firms that back them) — a single-sector deposit + credit concentration.',\n      },\n      {\n        id: 'SIVB/f6',\n        lens: 'off-balance-sheet',\n        fact: 'Available-for-sale (AFS) securities of $28.6B amortized cost were marked to a $26.1B fair value — a ~$2.5B loss that DID flow through equity (AOCI), the visible tip of a much larger unrealized-loss iceberg dominated by the footnote-only HTM book.',\n        expected: [\n          {\n            label: 'AFS unrealized loss / AOCI',\n            anyOf: [\n              'available-for-sale',\n              'available for sale',\n              'afs',\n              'aoci',\n              'accumulated other comprehensive',\n              '28,602',\n              '26,069',\n              '2.5 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/719739/000071973923000021/sivb-20221231.htm',\n        evidence:\n          '\"Available-for-sale securities, at fair value (cost of $ 28,602 ...) 26,069\" — a ~$2.5B AFS unrealized loss carried in AOCI, separate from and much smaller than the HTM gap.',\n      },\n    ],\n  },\n  {\n    ticker: 'BBBY',\n    company: 'Bed Bath & Beyond Inc.',\n    cik: '886158',\n    cutoff: '2022-04-21',\n    sector: 'Specialty retail',\n    knownOutcome: 'Filed for Chapter 11 bankruptcy on April 23, 2023; shareholders were wiped out.',\n    facts: [\n      {\n        id: 'BBBY/f1',\n        lens: 'capital-return',\n        fact: 'The company had repurchased ~$11.685B of its own stock since 2004 — including $574.9M in fiscal 2021 alone, \"two years ahead of schedule\" — draining the balance sheet of a business that was losing money.',\n        expected: [\n          {\n            label: 'massive buyback program',\n            anyOf: [\n              'repurchas',\n              'buyback',\n              'buy back',\n              'share repurchase',\n              '11.685',\n              '$11.7 billion',\n              '574.9',\n              '$575 million',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          '\"Since 2004 through the end of Fiscal 2021, we have repurchased approximately $11.685 billion of our common stock\"; FY2021 alone \"completed share repurchases of $574.9 million ... two years ahead of schedule.\"',\n      },\n      {\n        id: 'BBBY/f2',\n        lens: 'liquidity',\n        fact: 'Operating cash flow collapsed to just $17.9M in FY2021, down from $268.1M and $590.9M in the two prior years — a near-total loss of internally generated cash while it kept buying back stock.',\n        expected: [\n          {\n            label: 'operating cash flow collapse',\n            anyOf: [\n              'operating cash flow',\n              'cash from operations',\n              'cash provided by operating',\n              'cash flow from operations',\n              '17.9',\n              '17,854',\n              'declining cash flow',\n              'cash generation',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          'Statement of cash flows: \"Net cash provided by operating activities 17,854 268,108 590,941\" (FY2021 / FY2020 / FY2019, $ thousands).',\n      },\n      {\n        id: 'BBBY/f3',\n        lens: 'liquidity',\n        fact: \"Total shareholders' equity fell ~86% in one year — from $1.277B to $174.1M — as losses plus buybacks ate the equity cushion.\",\n        expected: [\n          {\n            label: 'equity erosion',\n            anyOf: [\n              'shareholders’ equity',\n              \"shareholders' equity\",\n              'stockholders equity',\n              'book value',\n              'equity',\n              'net worth',\n              '174.1',\n              '174,145',\n              'eroded',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          '\"Total shareholders\\' equity 174,145 1,276,936\" (FY2021 vs FY2020, $ thousands) — an ~86% decline in one year.',\n      },\n      {\n        id: 'BBBY/f4',\n        lens: 'liquidity',\n        fact: 'The company posted a $559.6M net loss in FY2021 — yet spent $574.9M on buybacks the same year, i.e. it returned more cash to shareholders than it had, let alone earned.',\n        expected: [\n          {\n            label: 'net loss FY2021',\n            anyOf: [\n              'net loss',\n              'unprofitable',\n              'lost money',\n              'losing money',\n              '559.6',\n              '559,623',\n              '$560 million',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence: '\"Net loss $ ( 559,623 )\" for fiscal 2021 ($ thousands).',\n      },\n      {\n        id: 'BBBY/f5',\n        lens: 'margin-trend',\n        fact: 'Merchandise inventories rose to $1.725B even as sales fell — inventory building into a demand decline, a classic markdown-risk and cash-trap signal.',\n        expected: [\n          {\n            label: 'inventory building into falling demand',\n            anyOf: [\n              'inventor',\n              'merchandise inventories',\n              'overstock',\n              'markdown',\n              '1,725',\n              '1.7 billion',\n              'stockpile',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/886158/000088615822000047/bbby-20220226.htm',\n        evidence:\n          '\"Merchandise inventories 1,725,410 1,671,909\" ($ thousands) — inventory grew year over year while comparable sales declined.',\n      },\n    ],\n  },\n  {\n    ticker: 'CVNA',\n    company: 'Carvana Co.',\n    cik: '1690820',\n    cutoff: '2023-02-23',\n    sector: 'Auto e-commerce',\n    knownOutcome:\n      'The stock fell ~98% from its 2021 peak; the company narrowly avoided bankruptcy via a 2023 debt-exchange that cut and extended its obligations.',\n    facts: [\n      {\n        id: 'CVNA/f1',\n        lens: 'leverage',\n        fact: 'Total debt had grown to $8.39B by year-end 2022 (from $5.45B) — a debt load far larger than the equity base, built up funding growth and the ADESA deal.',\n        expected: [\n          {\n            label: 'large/growing debt load',\n            anyOf: [\n              'total debt',\n              'long-term debt',\n              'leverage',\n              'highly leveraged',\n              'debt load',\n              '8,391',\n              '8.4 billion',\n              '$8.4 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence: '\"Total debt 8,391 5,447\" (Dec 31, 2022 vs 2021, $ millions).',\n      },\n      {\n        id: 'CVNA/f2',\n        lens: 'leverage',\n        fact: 'Interest expense nearly tripled to $486M in 2022 (from $176M) — debt-service was consuming cash a still-unprofitable company did not have.',\n        expected: [\n          {\n            label: 'rising interest burden',\n            anyOf: [\n              'interest expense',\n              'interest cost',\n              'debt service',\n              'cost of debt',\n              '486',\n              'interest burden',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence: '\"Interest expense 486 176\" (FY2022 vs FY2021, $ millions).',\n      },\n      {\n        id: 'CVNA/f3',\n        lens: 'leverage',\n        fact: \"In May 2022 Carvana bought ADESA's U.S. physical auction business for ~$2.2B in cash — a debt-funded acquisition that stretched the balance sheet right as used-car demand turned.\",\n        expected: [\n          {\n            label: 'ADESA acquisition ~$2.2B',\n            anyOf: ['adesa', '2.2 billion', '$2.2 billion', 'physical auction', 'acquisition'],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence:\n          '\"physical auction business of ADESA US Auction, LLC for approximately $2.2 billion in cash (the \\'ADESA Acquisition\\')\", closed 2022-05-09.',\n      },\n      {\n        id: 'CVNA/f4',\n        lens: 'governance',\n        fact: 'Carvana leases hubs and properties from DriveTime — a company controlled by founder/CEO Ernest Garcia III and his father Ernest Garcia II — a recurring related-party arrangement with the controlling family.',\n        expected: [\n          {\n            label: 'related-party with founder family / DriveTime',\n            anyOf: [\n              'related party',\n              'related-party',\n              'drivetime',\n              'garcia',\n              'controlled by',\n              'affiliate of',\n              'conflict of interest',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence:\n          'Related Party Transactions note: lease agreements with \"DriveTime Automotive Group\", a related party \"due to Ernest Garcia II, Ernest Garcia III, and entities controlled by one or both of them\".',\n      },\n      {\n        id: 'CVNA/f5',\n        lens: 'liquidity',\n        fact: 'The 2022 net loss was $2.894B — a loss far wider than prior years, showing the unit economics had not turned even at scale.',\n        expected: [\n          {\n            label: 'large net loss FY2022',\n            anyOf: [\n              'net loss',\n              'unprofitable',\n              'losing money',\n              'cash burn',\n              '2,894',\n              '2.9 billion',\n              '$2.9 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1690820/000169082023000052/cvna-20221231.htm',\n        evidence: '\"Net loss $ (2,894 ...\" for fiscal 2022 ($ millions).',\n      },\n    ],\n  },\n  {\n    ticker: 'PTON',\n    company: 'Peloton Interactive, Inc.',\n    cik: '1639825',\n    cutoff: '2022-09-07',\n    sector: 'Consumer fitness hardware',\n    knownOutcome:\n      'The stock fell ~95% from its 2021 peak; the founder-CEO departed, the company underwent mass layoffs and a multi-year turnaround through fiscal 2024.',\n    facts: [\n      {\n        id: 'PTON/f1',\n        lens: 'margin-trend',\n        fact: 'Connected Fitness (hardware) gross margin turned NEGATIVE — to (11)% in FY2022 — meaning Peloton lost money on every bike/tread it sold before any operating cost; revenue growth was masking a broken unit economics.',\n        expected: [\n          {\n            label: 'negative / collapsing hardware gross margin',\n            anyOf: [\n              'gross margin',\n              'negative margin',\n              'gross profit',\n              'margin compression',\n              'losing money on each',\n              'below cost',\n              '(11)',\n              '-11',\n              'negative gross',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          'MD&A \"Gross Profit, and Gross Margin\" table: Connected Fitness \"Gross Margin decreased to (11)\" percent in fiscal 2022 — a negative hardware gross margin.',\n      },\n      {\n        id: 'PTON/f2',\n        lens: 'liquidity',\n        fact: 'Inventories climbed to $1.105B as pandemic demand normalized — a glut of unsold equipment that tied up cash and risked markdowns.',\n        expected: [\n          {\n            label: 'inventory glut',\n            anyOf: [\n              'inventor',\n              'overstock',\n              'excess inventory',\n              'glut',\n              'markdown',\n              'unsold',\n              '1,104',\n              '1.1 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence: '\"Inventories, net 1,104.5 937\" (FY2022 vs FY2021, $ millions).',\n      },\n      {\n        id: 'PTON/f3',\n        lens: 'governance',\n        fact: \"A dual-class structure gives Class B holders 20 votes per share vs 1 for Class A — concentrating control with insiders/founders and limiting public shareholders' say.\",\n        expected: [\n          {\n            label: 'dual-class super-voting control',\n            anyOf: [\n              'dual-class',\n              'dual class',\n              'class b',\n              '20 votes',\n              'super-voting',\n              'supervoting',\n              'voting control',\n              'multiple votes per share',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          '\"Class B common stock has 20 votes per share and our Class A common stock has one vote per share.\"',\n      },\n      {\n        id: 'PTON/f4',\n        lens: 'liquidity',\n        fact: 'Peloton reported a $2.827B net loss in FY2022 — an order-of-magnitude wider loss than the prior year, signaling the demand normalization had broken the model, not just dented it.',\n        expected: [\n          {\n            label: 'large net loss FY2022',\n            anyOf: [\n              'net loss',\n              'unprofitable',\n              'losing money',\n              'cash burn',\n              '2,827',\n              '2.8 billion',\n              '$2.8 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence: '\"Net loss $ (2,827 ...\" for fiscal 2022 ($ millions).',\n      },\n      {\n        id: 'PTON/f5',\n        lens: 'regulatory',\n        fact: 'Peloton was running a CPSC recall of its Tread+ treadmill (tied to injuries and a child death) — an open product-safety and legal exposure beyond the demand story.',\n        expected: [\n          {\n            label: 'Tread+ / CPSC recall exposure',\n            anyOf: [\n              'recall',\n              'cpsc',\n              'consumer product safety',\n              'tread+',\n              'tread plus',\n              'product safety',\n              'injuries',\n              'safety',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          '\"recall on Tread+, which we are conducting in collaboration with the Consumer Product Safety Commission (\\'CPSC\\')\"; the Tread product recalls \"in the fourth quarter of fiscal 2021 continued to impact\" results.',\n      },\n      {\n        id: 'PTON/f6',\n        lens: 'leverage',\n        fact: 'Peloton was locked into ~$334M of manufacturing purchase commitments even as demand fell — contractual inventory it had to take on regardless of whether it could sell it.',\n        expected: [\n          {\n            label: 'locked-in purchase commitments',\n            anyOf: [\n              'purchase commitment',\n              'purchase obligation',\n              'minimum purchase',\n              'take-or-pay',\n              'committed to purchase',\n              '334',\n              'manufacturing commitment',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1639825/000163982522000117/pton-20220630.htm',\n        evidence:\n          '\"purchase commitments related to the manufacture of Peloton products were estimated to be approximately $334\" million.',\n      },\n    ],\n  },\n  {\n    ticker: 'SI',\n    company: 'Silvergate Capital Corporation',\n    cik: '1312109',\n    cutoff: '2022-02-28',\n    sector: 'Banking (digital-asset)',\n    knownOutcome:\n      'After the FTX collapse triggered a deposit run, Silvergate announced a voluntary wind-down of Silvergate Bank and liquidation in March 2023.',\n    facts: [\n      {\n        id: 'SI/f1',\n        lens: 'concentration',\n        fact: 'About 99.5% of total deposits were noninterest-bearing — essentially all funding was non-term money that could leave on demand, an extreme run-risk masked by very low funding cost.',\n        expected: [\n          {\n            label: 'almost all deposits noninterest-bearing / on-demand',\n            anyOf: [\n              'noninterest bearing',\n              'noninterest-bearing',\n              'non-interest-bearing',\n              'demand deposit',\n              'no term',\n              'on demand',\n              '99.5',\n              '99 percent',\n              'leave at any time',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          '\"noninterest bearing deposits as a percentage of total deposits was 99.5% as of December 31, 2021.\"',\n      },\n      {\n        id: 'SI/f2',\n        lens: 'concentration',\n        fact: 'Roughly 58% of deposits came from digital-currency EXCHANGES alone — a handful of correlated crypto counterparties whose own troubles would pull deposits out together.',\n        expected: [\n          {\n            label: 'deposits concentrated in crypto exchanges',\n            anyOf: [\n              'digital currency exchange',\n              'crypto exchange',\n              'exchanges represent',\n              'counterpart',\n              'concentrat',\n              '58%',\n              '58 percent',\n              'approximately 58',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          '\"Deposits from digital currency exchanges represent approximately 58%\" of deposits.',\n      },\n      {\n        id: 'SI/f3',\n        lens: 'concentration',\n        fact: 'The entire deposit franchise was tied to a single, volatile industry — digital-currency (crypto) customers — so a crypto downturn was a direct, undiversified funding shock.',\n        expected: [\n          {\n            // The buried, depth signal is the CONCENTRATION framing — that the\n            // whole deposit base is one undiversified industry bet — NOT the bare\n            // fact that it banks crypto (a one-line ticker summary has that). So\n            // bare \"crypto\" / \"digital asset\" are excluded; the load-bearing\n            // tokens are the concentration / single-industry / undiversified\n            // characterization or the filing's own \"digital currency customers\".\n            label: 'single-industry deposit CONCENTRATION (not just \"it banks crypto\")',\n            anyOf: [\n              'digital currency customers',\n              'single industry',\n              'one industry',\n              'single volatile industry',\n              'sector concentration',\n              'undiversified',\n              'concentrat',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          'The 10-K\\'s strategy and risk factors center the bank on \"digital currency customers\" and \"the concentration of our deposits\" in that single industry.',\n      },\n      {\n        id: 'SI/f4',\n        lens: 'liquidity',\n        fact: 'Total deposits had ballooned to $14.3B (from $10.4B) — fast, hot-money growth from the crypto boom that could reverse just as fast.',\n        expected: [\n          {\n            // The depth signal is the SIZE/character of the deposit base — the\n            // specific $14.3B figure or the explicit hot-money / volatile-deposit\n            // characterization — NOT bare \"total deposits\" / \"grew rapidly\", which\n            // any growth-story summary trips. Those generic phrases are excluded.\n            label: 'specific hot-money deposit base ($14.3B / volatile)',\n            anyOf: [\n              'hot money',\n              'hot-money',\n              'volatile deposit',\n              'could reverse',\n              '14.3 billion',\n              '14,290',\n              '$14.3b',\n              '$14 billion',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence: '\"Total deposits $ 14,290,628\" ... prior year \"$ 10,411,278\" ($ thousands).',\n      },\n      {\n        id: 'SI/f5',\n        lens: 'concentration',\n        fact: 'The franchise hinged on a single proprietary product — the Silvergate Exchange Network (SEN), a payment network built exclusively for the digital-currency industry — so its competitive moat and its deposit base were the SAME crypto-dependent bet, not two diversified ones.',\n        expected: [\n          {\n            // The depth signal is naming the SPECIFIC proprietary product (the\n            // Silvergate Exchange Network / SEN) and that the moat and the deposit\n            // base are the same single bet — NOT bare \"proprietary\" / \"payment\n            // network\", which a generic crypto-bank summary mentions. Those bare\n            // terms are excluded; the SEN name or the single-product framing is\n            // load-bearing.\n            label: 'names the SEN single-product dependence (not generic \"payment network\")',\n            anyOf: [\n              'silvergate exchange network',\n              'the sen',\n              'sen)',\n              \"sen'\",\n              'single product',\n              'single-product',\n              'core product',\n              'one product',\n              'same bet',\n            ],\n          },\n        ],\n        sourceUrl:\n          'https://www.sec.gov/Archives/edgar/data/1312109/000131210922000051/si-20211231.htm',\n        evidence:\n          \"\\\"Silvergate Exchange Network ('SEN'), our proprietary, virtually instantaneous payment network for participants in the digital currency industry\\\" — the bank's differentiator and its deposit magnet are the same crypto-only product.\",\n      },\n    ],\n  },\n]\n\n/**\n * Grade ONE material fact against an investment thesis's full text. Returns\n * whether the thesis SURFACED it plus which expected groups were found. The\n * check is a deterministic case-insensitive substring scan — $0, model-free,\n * reproducible — so the eval never leaks into a model the loop could observe.\n */\nexport function gradeFactAgainstText(\n  fact: MaterialFact,\n  thesisText: string,\n): { surfaced: boolean; groupsFound: number; groupsTotal: number; foundLabels: string[] } {\n  const haystack = thesisText.toLowerCase()\n  const found = fact.expected.filter((group) =>\n    group.anyOf.some((fragment) => haystack.includes(fragment.toLowerCase())),\n  )\n  const minGroups = fact.minGroups ?? fact.expected.length\n  return {\n    surfaced: found.length >= minGroups,\n    groupsFound: found.length,\n    groupsTotal: fact.expected.length,\n    foundLabels: found.map((group) => group.label),\n  }\n}\n\n/** Grade a whole company's thesis text: how many of its held-out facts it surfaces. */\nexport function gradeCompanyAgainstText(\n  company: CompanyEvalCase,\n  thesisText: string,\n): { surfaced: number; total: number; perFact: ReturnType<typeof gradeFactAgainstText>[] } {\n  const perFact = company.facts.map((fact) => gradeFactAgainstText(fact, thesisText))\n  return {\n    surfaced: perFact.filter((result) => result.surfaced).length,\n    total: company.facts.length,\n    perFact,\n  }\n}\n\n/** Total held-out facts across the set (the denominator the doc reports). */\nexport function totalMaterialFacts(set: CompanyEvalCase[] = investmentThesisSet): number {\n  return set.reduce((sum, company) => sum + company.facts.length, 0)\n}\n\n/** Count facts per lens across the set — used to report (and bound) curation bias. */\nexport function lensDistribution(\n  set: CompanyEvalCase[] = investmentThesisSet,\n): Record<MaterialFactLens, number> {\n  const dist = {} as Record<MaterialFactLens, number>\n  for (const company of set) {\n    for (const fact of company.facts) {\n      dist[fact.lens] = (dist[fact.lens] ?? 0) + 1\n    }\n  }\n  return dist\n}\n","/**\n * The INVESTMENT-THESIS research task.\n *\n * Given `{ company, ticker, cik, cutoff }`, drive the SAME two-agent research\n * loop the ML deep-question A/B uses (`runVerifiedResearchLoop` + the real web\n * worker) to research the company AS OF the cutoff — web + SEC EDGAR, both public\n * — and produce an investment-thesis PAGE in the knowledge base: a judgment, the\n * drivers, and the risks, grounded in what it fetched.\n *\n * This file builds NOTHING new for the loop: it composes the existing worker +\n * driver + loop, supplies the readiness specs that steer the worker toward the\n * filing-level evidence (the analyst lenses), then writes a synthesis thesis page\n * the metric (`materialFactsSurfaced`) grades against the HELD-OUT checklist.\n *\n * THE FIREWALL: the task is told ONLY company + ticker + cutoff (+ the generic\n * analyst-lens readiness specs every company gets). It is NEVER shown the\n * checklist. The checklist is read only afterward, by the metric. So a high score\n * is research depth, not teaching-to-the-test.\n */\n\nimport { join } from 'node:path'\nimport { writeFileDurableWithinRoot } from './durable-fs'\nimport { defineReadinessSpec, type KnowledgeReadinessSpec } from './eval-readiness'\nimport { slugify } from './ids'\nimport { buildKnowledgeIndex } from './indexer'\nimport { kbIndexToText } from './material-facts-metric'\nimport { withKnowledgeMutation } from './mutation-lock'\nimport {\n  type ResearchDriver,\n  runVerifiedResearchLoop,\n  type VerifiedResearchLoopResult,\n} from './two-agent-research-loop'\nimport {\n  createWebResearchWorker,\n  type RouterClient,\n  type WebResearchWorkerOptions,\n} from './web-research-worker'\n\n/** The minimal brief a thesis run is given — the firewall boundary. */\nexport interface ThesisTaskInput {\n  /** Legal name as of the cutoff — what the loop researches. */\n  company: string\n  /** Ticker as of the cutoff. */\n  ticker: string\n  /** SEC Central Index Key (CIK), zero-stripped — the EDGAR filer id. */\n  cik: string\n  /** Research-as-of date (ISO). The loop must reason as if it is this date. */\n  cutoff: string\n  /** Sector, for the readiness query context (NOT a checklist hint). */\n  sector?: string\n}\n\n/**\n * The generic analyst-lens readiness specs every company gets. They are the ONLY\n * thing the loop is told about WHAT to look for, and they name the LENSES a\n * thorough analyst checks (balance-sheet risk, concentration, leverage, margins,\n * liquidity, governance, regulatory) and where they live (the latest SEC 10-K) —\n * NOT the answers. They steer the worker's web/EDGAR search toward the filing,\n * not toward the held-out facts (which the loop never sees).\n *\n * `minSources` is set above 1 so the readiness gate stays UNMET after a single\n * fetch and the loop runs multiple rounds — the depth-driving driver needs >1\n * round to steer, exactly as the ML-exam multi-round probe established.\n */\nexport function thesisReadinessSpecs(input: ThesisTaskInput): KnowledgeReadinessSpec[] {\n  const c = input.company\n  const t = input.ticker\n  const filing = `${c} ${t} SEC 10-K annual report SEC.gov EDGAR filing`\n  return [\n    defineReadinessSpec({\n      id: 'thesis/filing',\n      description: `the most recent SEC 10-K annual report for ${c} (${t}) filed on or before ${input.cutoff}, from SEC EDGAR`,\n      query: filing,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n    defineReadinessSpec({\n      id: 'thesis/balance-sheet',\n      description: `${c} balance-sheet risks: securities marked below cost, unrealized losses, leverage / total debt, debt maturities, interest expense`,\n      query: `${c} ${t} 10-K balance sheet total debt unrealized losses interest expense leverage`,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n    defineReadinessSpec({\n      id: 'thesis/concentration-liquidity',\n      description: `${c} concentration + liquidity: customer / deposit / revenue concentration, uninsured deposits, operating cash flow, net loss, inventory, equity erosion`,\n      query: `${c} ${t} 10-K customer deposit concentration operating cash flow net loss inventory`,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n    defineReadinessSpec({\n      id: 'thesis/governance-regulatory',\n      description: `${c} governance + regulatory: related-party transactions, dual-class / super-voting control, buybacks / dividends, recalls, regulatory or legal exposure, margin trends`,\n      query: `${c} ${t} 10-K related party dual class share repurchase recall regulatory gross margin`,\n      requiredFor: ['ResearchAgent'],\n      importance: 'blocking',\n      minSources: 2,\n      minHits: 1,\n    }),\n  ]\n}\n\n/**\n * The thesis-writer prompt. After the loop has fetched + curated the filings, we\n * ask the model to SYNTHESIZE a thesis page from the curated KB text — a\n * judgment, the key drivers, and the material risks, grounded ONLY in the fetched\n * evidence. The held-out checklist is NOT in this prompt; the model writes from\n * what the loop actually pulled, so a fact only appears if the research surfaced\n * the underlying evidence.\n */\nfunction thesisSynthesisMessages(\n  input: ThesisTaskInput,\n  kbText: string,\n): { role: 'system' | 'user'; content: string }[] {\n  const system =\n    'You are a buy-side investment analyst writing a thesis memo. You are given ' +\n    'the raw research your team gathered from public filings (SEC 10-K) and the web. ' +\n    'Write a thesis that a thorough analyst would write: lead with your JUDGMENT, ' +\n    'then the KEY DRIVERS, then the MATERIAL RISKS. Be specific and quantitative — ' +\n    'name the actual figures, balance-sheet items, concentrations, leverage, ' +\n    'margin trends, governance items, and regulatory exposures that appear in the ' +\n    'research. Surface the buried, non-obvious drivers a one-line ticker summary ' +\n    'misses. Ground every claim in the research provided; do NOT invent figures. ' +\n    'If the research does not contain a figure, do not state it.'\n  const user = [\n    `Company: ${input.company} (${input.ticker})`,\n    `As-of date (reason as if it is this date): ${input.cutoff}`,\n    input.sector ? `Sector: ${input.sector}` : '',\n    '',\n    'Research gathered (filings + web excerpts):',\n    '\"\"\"',\n    kbText.slice(0, 24000),\n    '\"\"\"',\n    '',\n    'Write the investment thesis now. Structure:',\n    '## Judgment',\n    '## Key drivers',\n    '## Material risks',\n  ]\n    .filter(Boolean)\n    .join('\\n')\n  return [\n    { role: 'system', content: system },\n    { role: 'user', content: user },\n  ]\n}\n\n/** Write the synthesis thesis page into the KB so the index + metric pick it up. */\nasync function writeThesisPage(\n  root: string,\n  input: ThesisTaskInput,\n  thesis: string,\n): Promise<string> {\n  return withKnowledgeMutation(root, async () => {\n    const relativePath = `knowledge/thesis-${slugify(input.ticker)}.md`\n    const body = [\n      '---',\n      `title: Investment thesis — ${input.company} (${input.ticker})`,\n      `ticker: ${input.ticker}`,\n      `cutoff: ${input.cutoff}`,\n      'kind: investment-thesis',\n      '---',\n      `# Investment thesis — ${input.company} (${input.ticker}), as of ${input.cutoff}`,\n      '',\n      thesis.trim(),\n      '',\n    ].join('\\n')\n    await writeFileDurableWithinRoot(root, relativePath, body, { encoding: 'utf8' })\n    return join(root, relativePath)\n  })\n}\n\nexport interface ThesisRunOptions {\n  /** The KB root the loop writes into. */\n  root: string\n  /** Shared router client (web search + chat). Defaults to env creds. */\n  router: RouterClient\n  /** The driver — verify/dedup or research-driving. The loop's coordinator. */\n  driver: ResearchDriver\n  /** Round budget. Default 3 (the depth-driving driver needs >1). */\n  maxRounds?: number\n  /** Worker tuning forwarded to `createWebResearchWorker`. */\n  workerOptions?: Omit<WebResearchWorkerOptions, 'router'>\n  /** Max tokens for the synthesis pass. Default 1600 (above glm-5.2's reasoning floor). */\n  synthesisMaxTokens?: number\n  signal?: AbortSignal\n}\n\nexport interface ThesisRunResult {\n  loop: VerifiedResearchLoopResult\n  /** The synthesized thesis text. */\n  thesis: string\n  /** Path of the thesis page written into the KB. */\n  thesisPath: string\n}\n\n/**\n * Run the full thesis task: drive the two-agent loop to research the company AS\n * OF the cutoff, then synthesize + write the thesis page. Returns the loop result\n * + the thesis text + the page path. The caller grades the KB with\n * `materialFactsSurfaced(root, checklist)` — the checklist is never passed here.\n */\nexport async function runInvestmentThesisTask(\n  input: ThesisTaskInput,\n  options: ThesisRunOptions,\n): Promise<ThesisRunResult> {\n  const worker = createWebResearchWorker({ ...options.workerOptions, router: options.router })\n  const goal = `${input.company} (${input.ticker}) investment thesis as of ${input.cutoff}`\n\n  const loop = await runVerifiedResearchLoop({\n    root: options.root,\n    goal,\n    worker,\n    driver: options.driver,\n    readinessSpecs: thesisReadinessSpecs(input),\n    maxRounds: options.maxRounds ?? 3,\n    signal: options.signal,\n  })\n\n  // Synthesize the thesis from what the loop actually curated + fetched.\n  const index = await buildKnowledgeIndex(options.root)\n  const kbText = kbIndexToText(index)\n  const messages = thesisSynthesisMessages(input, kbText)\n  const thesis = await options.router.chat(messages, options.synthesisMaxTokens ?? 1600)\n\n  const thesisPath = await writeThesisPage(options.root, input, thesis)\n  return { loop, thesis, thesisPath }\n}\n","/**\n * `materialFactsSurfaced` — the held-out investment-research METRIC.\n *\n * Given a knowledge base a research loop built for a company and the company's\n * HELD-OUT material-fact checklist (`tests/eval/investment-thesis-set.ts`, never\n * shown to the loop), this returns the FRACTION of checklist items the KB's\n * pages surface + ground. The check is the same `$0`, model-free, deterministic\n * substring grader the loop's checklist already ships (`gradeFactAgainstText` /\n * `gradeCompanyAgainstText`) — so the answer key never reaches a model the loop\n * could observe, exactly the firewall the ML deep-question exam uses.\n *\n * The ONLY thing this file adds over the raw grader is the KB→text join: it reads\n * the curated pages (and the raw source text) the loop wrote and hands their\n * concatenation to the grader. That join mirrors `kbText` in the research-quality\n * A/B (research-driving-ab.test.ts) so the thesis metric and the ML-exam metric\n * read a KB the same way.\n *\n * WHY pages AND source text: an honest thesis surfaces a buried fact in its\n * curated thesis PAGE (the judgment), but a loop whose page is thin while its\n * fetched filings are rich should still get credit for what it actually pulled.\n * Grading the union is the faithful, not the lenient, choice — it rewards the\n * loop that REACHED the filing even if its synthesis was terse, and it cannot\n * manufacture a hit the underlying evidence does not contain.\n */\n\nimport { buildKnowledgeIndex } from './indexer'\nimport {\n  type CompanyEvalCase,\n  gradeCompanyAgainstText,\n  gradeFactAgainstText,\n} from './investment-thesis-set'\nimport type { KnowledgeIndex } from './types'\n\n/** Per-fact grade plus the fact's id/lens, for the audit trail. */\nexport interface FactResult {\n  id: string\n  lens: CompanyEvalCase['facts'][number]['lens']\n  surfaced: boolean\n  groupsFound: number\n  groupsTotal: number\n  foundLabels: string[]\n}\n\n/** The metric's result for one company: the surfaced fraction + the per-fact trail. */\nexport interface MaterialFactsResult {\n  ticker: string\n  company: string\n  /** Held-out facts the KB surfaced + grounded. */\n  surfaced: number\n  /** Total held-out facts for this company (the denominator). */\n  total: number\n  /** `surfaced / total` in [0, 1]. */\n  fraction: number\n  /** Per-fact grade, in checklist order, for the doc / audit. */\n  perFact: FactResult[]\n}\n\n/**\n * Join a KB index into the single text blob the grader scans: every curated PAGE\n * (title + body) followed by every raw SOURCE (title + fetched text). This is the\n * text read AFTER the loop finished — it is never handed to the loop. Identical\n * in spirit to `kbText` in the research-quality A/B so both metrics read a KB the\n * same way.\n */\nexport function kbIndexToText(index: KnowledgeIndex): string {\n  const pageText = index.pages.map((page) => `${page.title}\\n${page.text}`).join('\\n\\n')\n  const sourceText = index.sources\n    .map((source) => `${source.title ?? ''}\\n${source.text ?? ''}`)\n    .join('\\n\\n')\n  return `${pageText}\\n\\n${sourceText}`\n}\n\n/**\n * Grade one company's KB against its held-out material-fact checklist, given the\n * KB's already-joined text. The pure core — no I/O — so calibration can score a\n * hand-written shallow/deep thesis string directly and the live path can score a\n * real KB. Returns the surfaced FRACTION plus the per-fact audit trail.\n */\nexport function materialFactsSurfacedInText(\n  company: CompanyEvalCase,\n  kbText: string,\n): MaterialFactsResult {\n  const grade = gradeCompanyAgainstText(company, kbText)\n  const perFact: FactResult[] = company.facts.map((fact) => {\n    const r = gradeFactAgainstText(fact, kbText)\n    return {\n      id: fact.id,\n      lens: fact.lens,\n      surfaced: r.surfaced,\n      groupsFound: r.groupsFound,\n      groupsTotal: r.groupsTotal,\n      foundLabels: r.foundLabels,\n    }\n  })\n  return {\n    ticker: company.ticker,\n    company: company.company,\n    surfaced: grade.surfaced,\n    total: grade.total,\n    fraction: grade.total === 0 ? 0 : grade.surfaced / grade.total,\n    perFact,\n  }\n}\n\n/**\n * `materialFactsSurfaced(kb, checklist)` — the metric in its KB-reading form.\n *\n * `kb` is EITHER a knowledge-base root directory (the loop wrote pages there) or\n * an already-built `KnowledgeIndex`. `checklist` is the company's held-out\n * `CompanyEvalCase`. Returns the surfaced fraction + per-fact trail.\n *\n * The checklist is HELD OUT by construction: it lives in the test eval set, is\n * never passed to the loop, and is read only here, after the loop finished.\n */\nexport async function materialFactsSurfaced(\n  kb: string | KnowledgeIndex,\n  checklist: CompanyEvalCase,\n): Promise<MaterialFactsResult> {\n  const index = typeof kb === 'string' ? await buildKnowledgeIndex(kb) : kb\n  return materialFactsSurfacedInText(checklist, kbIndexToText(index))\n}\n","import type { KnowledgeReadinessReport } from '@tangle-network/agent-eval'\nimport {\n  type BuildEvalKnowledgeBundleOptions,\n  buildEvalKnowledgeBundle,\n  type EvalKnowledgeBundleBuildResult,\n  type KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport { createKnowledgeEvent } from './events'\nimport { buildKnowledgeIndex } from './indexer'\nimport { applyKnowledgeWriteBlocks } from './proposals'\nimport { readinessFor } from './readiness-helpers'\nimport { searchKnowledge } from './search'\nimport { type AddSourceOptions, type AddSourceTextInput, addSourceText } from './sources'\nimport { initKnowledgeBase } from './store'\nimport type { KnowledgeEvent, KnowledgeIndex, KnowledgeSearchResult, SourceRecord } from './types'\n\n/**\n * A knowledge gap the loop surfaces from `scoreKnowledgeReadiness`. The worker\n * targets these; the driver folds the unfilled remainder into the worker's next\n * prompt and runs its own gap-fill pass over them.\n */\nexport interface KnowledgeGap {\n  /** Readiness-spec id this gap belongs to. */\n  id: string\n  /** Human-readable description of what's missing. */\n  description: string\n  /** The search query the readiness check ran for this requirement. */\n  query: string\n  /** True when the gap blocks readiness (vs. a soft, non-blocking gap). */\n  blocking: boolean\n}\n\n/** A new source the worker (or driver) discovered and wants to add to the KB. */\nexport type ResearchSourceProposal = AddSourceTextInput\n\n/**\n * What a research agent contributes in one round. Both the worker and (when\n * `driverResearches` is on) the driver produce this shape — the worker ADDS\n * primary findings, the driver gap-FILLS the ones the worker missed.\n *\n * `proposalText` is the safe write-protocol text (`---FILE: knowledge/...---`\n * blocks). The loop only applies it AFTER the driver has verified the round's\n * sources, so a rejected source never reaches the curated pages.\n */\nexport interface ResearchContribution {\n  /** Immutable sources to register (the raw evidence). */\n  sources?: ResearchSourceProposal[]\n  /** Safe write-protocol text producing curated `knowledge/*.md` pages. */\n  proposalText?: string\n  /**\n   * Build the page write-protocol text FROM the sources the driver accepted —\n   * the curated, citing pages the readiness gate searches. Receives the\n   * registered `SourceRecord`s (with their assigned ids, so a page's frontmatter\n   * `sources:` can cite them). Returns `---FILE: knowledge/...---` block text or\n   * `undefined`. Runs after verification, so a page never cites a rejected\n   * source. Concatenated after any static `proposalText`.\n   */\n  buildPages?: (acceptedSources: SourceRecord[]) => string | undefined\n  /** Free-form research transcript — products can persist this. */\n  notes?: string\n  metadata?: Record<string, unknown>\n}\n\n/** Context handed to the worker each round. */\nexport interface WorkerResearchContext {\n  root: string\n  goal: string\n  round: number\n  index: KnowledgeIndex\n  /** Gaps the readiness gate currently reports — what the worker should close. */\n  gaps: KnowledgeGap[]\n  /** Steer text the driver folded in from the previous round's remaining gaps. */\n  steer?: string\n  readiness: EvalKnowledgeBundleBuildResult\n  signal?: AbortSignal\n}\n\n/** Context handed to the driver's verifier for one candidate source. */\nexport interface SourceVerificationContext {\n  root: string\n  goal: string\n  round: number\n  index: KnowledgeIndex\n  gaps: KnowledgeGap[]\n  /** Sources already accepted earlier THIS round (in-round dedup). */\n  acceptedThisRound: ResearchSourceProposal[]\n  signal?: AbortSignal\n}\n\n/** A single rejected source plus the reason the driver gave. */\nexport interface RejectedSource {\n  source: ResearchSourceProposal\n  reason: string\n}\n\n/** Context handed to the driver's gap-fill pass (only when `driverResearches`). */\nexport interface DriverResearchContext {\n  root: string\n  goal: string\n  round: number\n  index: KnowledgeIndex\n  /** Gaps STILL open after the worker's accepted contribution applied. */\n  remainingGaps: KnowledgeGap[]\n  readiness: EvalKnowledgeBundleBuildResult\n  signal?: AbortSignal\n}\n\n/**\n * The differentiated driver role.\n *\n * - `verifySource` — the gate the worker's additions pass before they commit.\n *   Return `{ accept: true }` to keep a source or `{ accept: false, reason }`\n *   to reject it (not real / not relevant / duplicate). The loop dedups exact\n *   duplicates (same `uri` already in the KB or accepted this round) BEFORE\n *   calling this, so the verifier only sees genuinely-new candidates.\n * - `research` — the driver's OWN gap-fill pass over the gaps the worker left\n *   open. Only invoked when `driverResearches` is true.\n * - `foldGaps` — turn the remaining gaps into a steer string for the worker's\n *   next prompt. Defaults to a compact bulleted list when omitted.\n */\nexport interface ResearchDriver {\n  verifySource(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<SourceVerdict> | SourceVerdict\n  research?(ctx: DriverResearchContext): Promise<ResearchContribution> | ResearchContribution\n  foldGaps?(gaps: KnowledgeGap[]): string\n}\n\nexport type SourceVerdict = { accept: true } | { accept: false; reason: string }\n\n/** The worker: primary research targeting the round's gaps. */\nexport type ResearchWorker = (\n  ctx: WorkerResearchContext,\n) => Promise<ResearchContribution> | ResearchContribution\n\nexport interface VerifiedResearchLoopOptions {\n  root: string\n  goal: string\n  worker: ResearchWorker\n  driver: ResearchDriver\n  /**\n   * When false (default), the driver ONLY verifies + gates — a pure coordinator\n   * that contributes no research of its own (the \"doesn't participate in the\n   * work\" mode). When true, the driver also runs its `research` gap-fill pass\n   * each round over the gaps the worker left open.\n   */\n  driverResearches?: boolean\n  maxRounds?: number\n  actor?: string\n  /** Readiness specs define the gate; an empty list means the loop never gates. */\n  readinessSpecs?: KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  sourceOptions?: Pick<AddSourceOptions, 'adapters' | 'now'>\n  signal?: AbortSignal\n  onRound?: (round: VerifiedResearchRound) => Promise<void> | void\n}\n\nexport interface VerifiedResearchRound {\n  round: number\n  /** Gaps reported at the START of the round (what the worker targeted). */\n  gaps: KnowledgeGap[]\n  /** Worker sources accepted by the driver and written to the KB. */\n  acceptedWorkerSources: SourceRecord[]\n  /** Worker sources the driver rejected (with reasons) — never written. */\n  rejectedWorkerSources: RejectedSource[]\n  /** Sources the driver itself added in its gap-fill pass. */\n  driverSources: SourceRecord[]\n  /** Curated pages written this round (worker proposal + driver proposal). */\n  writtenPages: string[]\n  readiness?: EvalKnowledgeBundleBuildResult\n  /** True once the readiness gate reports no blocking gaps. */\n  ready: boolean\n  event: KnowledgeEvent\n  notes: { worker?: string; driver?: string }\n}\n\nexport interface VerifiedResearchLoopResult {\n  root: string\n  goal: string\n  rounds: number\n  ready: boolean\n  index: KnowledgeIndex\n  readiness?: EvalKnowledgeBundleBuildResult\n  steps: VerifiedResearchRound[]\n}\n\n/**\n * Two-agent (driver + worker) sibling of `runKnowledgeResearchLoop`.\n *\n * Both agents research to grow ONE knowledge base. The roles are differentiated:\n *\n * - **WORKER** = primary research. Each round it reads the open gaps, discovers\n *   new sources, and proposes additions (`sources` + `proposalText`). It ADDS.\n * - **DRIVER** = the verifier / gap-filler / gate. It (1) VERIFIES the worker's\n *   sources before they commit — dedup against the KB, then `verifySource`\n *   rejects ones that aren't real/relevant; (2) GAP-FILLS the gaps the worker\n *   missed with its own research pass (when `driverResearches`); (3) folds the\n *   remaining gaps into the worker's next prompt; and (4) GATES on\n *   `scoreKnowledgeReadiness` — the loop stops as soon as there are no blocking\n *   gaps.\n *\n * Set `driverResearches: false` (default) for the pure-coordinator mode: the\n * driver only verifies + gates and contributes no research itself.\n *\n * Composes existing atoms — `initKnowledgeBase`, `addSourceText`,\n * `applyKnowledgeWriteBlocks`, `buildEvalKnowledgeBundle` (the readiness gate),\n * and `searchKnowledge` — and reinvents none of them.\n */\nexport async function runVerifiedResearchLoop(\n  options: VerifiedResearchLoopOptions,\n): Promise<VerifiedResearchLoopResult> {\n  const maxRounds = Math.max(1, options.maxRounds ?? 3)\n  await initKnowledgeBase(options.root)\n  const steps: VerifiedResearchRound[] = []\n  let index = await buildKnowledgeIndex(options.root)\n  let readiness = readinessFor(options, index)\n  let ready = isReady(readiness?.report)\n  let steer: string | undefined\n\n  for (let round = 1; round <= maxRounds && !ready; round++) {\n    if (options.signal?.aborted) throw new Error('Two-agent research loop aborted')\n\n    const gaps = gapsFromReadiness(readiness)\n\n    // 1. WORKER: primary research over the open gaps.\n    const workerContribution = await options.worker({\n      root: options.root,\n      goal: options.goal,\n      round,\n      index,\n      gaps,\n      steer,\n      readiness: requireReadiness(readiness, options),\n      signal: options.signal,\n    })\n\n    // 2. DRIVER VERIFIES the worker's sources before they commit.\n    const accepted: ResearchSourceProposal[] = []\n    const rejectedWorkerSources: RejectedSource[] = []\n    // Dedup against the ORIGINAL input uri. `addSourceText` rewrites `record.uri`\n    // to a slugified raw path and stashes the caller's uri under\n    // `metadata.originalUri`, so that — not the stored uri — is the round-to-round\n    // identity a verifier dedups against.\n    const existingUris = new Set(\n      index.sources.flatMap((source) =>\n        typeof source.metadata?.originalUri === 'string' ? [source.metadata.originalUri] : [],\n      ),\n    )\n    for (const source of workerContribution.sources ?? []) {\n      if (isDuplicate(source, existingUris, accepted)) {\n        rejectedWorkerSources.push({ source, reason: 'duplicate: already in the knowledge base' })\n        continue\n      }\n      const verdict = await options.driver.verifySource(source, {\n        root: options.root,\n        goal: options.goal,\n        round,\n        index,\n        gaps,\n        acceptedThisRound: accepted,\n        signal: options.signal,\n      })\n      if (verdict.accept) accepted.push(source)\n      else rejectedWorkerSources.push({ source, reason: verdict.reason })\n    }\n\n    // Register the accepted worker sources, then apply the worker's curated\n    // pages — but only when at least one source survived verification, so a\n    // page never cites a rejected source.\n    const acceptedWorkerSources = await registerSources(options, accepted)\n    const writtenPages: string[] = []\n    writtenPages.push(\n      ...(await applyPages(options.root, workerContribution, acceptedWorkerSources)),\n    )\n\n    // Re-index so the driver's gap-fill pass sees the worker's contribution.\n    index = await buildKnowledgeIndex(options.root)\n    readiness = readinessFor(options, index)\n\n    // 3. DRIVER GAP-FILLS the gaps the worker left open (opt-in).\n    let driverSources: SourceRecord[] = []\n    let driverNotes: string | undefined\n    if (options.driverResearches && options.driver.research) {\n      const remainingGaps = gapsFromReadiness(readiness)\n      const driverContribution = await options.driver.research({\n        root: options.root,\n        goal: options.goal,\n        round,\n        index,\n        remainingGaps,\n        readiness: requireReadiness(readiness, options),\n        signal: options.signal,\n      })\n      driverNotes = driverContribution.notes\n      driverSources = await registerSources(options, driverContribution.sources ?? [])\n      writtenPages.push(...(await applyPages(options.root, driverContribution, driverSources)))\n      index = await buildKnowledgeIndex(options.root)\n      readiness = readinessFor(options, index)\n    }\n\n    // 4. DRIVER GATES on readiness and folds the remainder into the next prompt.\n    ready = isReady(readiness?.report)\n    const remainingGaps = gapsFromReadiness(readiness)\n    steer = ready ? undefined : foldGaps(options.driver, remainingGaps)\n\n    const step: VerifiedResearchRound = {\n      round,\n      gaps,\n      acceptedWorkerSources,\n      rejectedWorkerSources,\n      driverSources,\n      writtenPages,\n      readiness,\n      ready,\n      event: createKnowledgeEvent({\n        type: 'research.iteration',\n        actor: options.actor,\n        target: options.root,\n        metadata: {\n          goal: options.goal,\n          round,\n          ready,\n          acceptedWorkerSourceCount: acceptedWorkerSources.length,\n          rejectedWorkerSourceCount: rejectedWorkerSources.length,\n          driverSourceCount: driverSources.length,\n          writtenPageCount: writtenPages.length,\n          remainingGapCount: remainingGaps.length,\n        },\n      }),\n      notes: { worker: workerContribution.notes, driver: driverNotes },\n    }\n    steps.push(step)\n    await options.onRound?.(step)\n  }\n\n  return {\n    root: options.root,\n    goal: options.goal,\n    rounds: steps.length,\n    ready,\n    index,\n    readiness,\n    steps,\n  }\n}\n\nfunction isReady(report: KnowledgeReadinessReport | undefined): boolean {\n  // No specs ⇒ no gate ⇒ the loop runs to `maxRounds`. With specs, the gate is\n  // \"no blocking gaps remain\".\n  if (!report) return false\n  return report.blockingMissingRequirements.length === 0\n}\n\nfunction gapsFromReadiness(readiness: EvalKnowledgeBundleBuildResult | undefined): KnowledgeGap[] {\n  if (!readiness) return []\n  const blocking = readiness.report.blockingMissingRequirements.map((requirement) =>\n    gapFor(requirement, readiness, true),\n  )\n  const nonBlocking = readiness.report.nonBlockingGaps.map((requirement) =>\n    gapFor(requirement, readiness, false),\n  )\n  return [...blocking, ...nonBlocking]\n}\n\nfunction gapFor(\n  requirement: { id: string; description: string; metadata?: Record<string, unknown> },\n  readiness: EvalKnowledgeBundleBuildResult,\n  blocking: boolean,\n): KnowledgeGap {\n  const spec = readiness.requirements.find((entry) => entry.id === requirement.id)\n  const query =\n    typeof spec?.metadata?.query === 'string' ? spec.metadata.query : requirement.description\n  return { id: requirement.id, description: requirement.description, query, blocking }\n}\n\nfunction foldGaps(driver: ResearchDriver, gaps: KnowledgeGap[]): string | undefined {\n  if (gaps.length === 0) return undefined\n  if (driver.foldGaps) return driver.foldGaps(gaps)\n  return [\n    'The knowledge base is still missing the following. Prioritise these next round:',\n    ...gaps.map(\n      (gap) => `- (${gap.blocking ? 'blocking' : 'soft'}) ${gap.description} [${gap.id}]`,\n    ),\n  ].join('\\n')\n}\n\nfunction isDuplicate(\n  source: ResearchSourceProposal,\n  existingUris: Set<string>,\n  accepted: ResearchSourceProposal[],\n): boolean {\n  return existingUris.has(source.uri) || accepted.some((candidate) => candidate.uri === source.uri)\n}\n\nasync function registerSources(\n  options: VerifiedResearchLoopOptions,\n  sources: ResearchSourceProposal[],\n): Promise<SourceRecord[]> {\n  const records: SourceRecord[] = []\n  for (const source of sources) {\n    records.push(await addSourceText(options.root, source, options.sourceOptions))\n  }\n  return records\n}\n\n/**\n * Apply a contribution's curated pages. Static `proposalText` plus a\n * `buildPages(acceptedSources)` result are concatenated and run through the safe\n * write protocol — but ONLY when at least one source survived verification, so a\n * page never cites a rejected (or absent) source.\n */\nasync function applyPages(\n  root: string,\n  contribution: ResearchContribution,\n  acceptedSources: SourceRecord[],\n): Promise<string[]> {\n  if (acceptedSources.length === 0) return []\n  const parts: string[] = []\n  if (contribution.proposalText) parts.push(contribution.proposalText)\n  const built = contribution.buildPages?.(acceptedSources)\n  if (built) parts.push(built)\n  if (parts.length === 0) return []\n  const applied = await applyKnowledgeWriteBlocks(root, parts.join('\\n'))\n  return applied.written\n}\n\nfunction requireReadiness(\n  readiness: EvalKnowledgeBundleBuildResult | undefined,\n  options: VerifiedResearchLoopOptions,\n): EvalKnowledgeBundleBuildResult {\n  if (readiness) return readiness\n  // The worker/driver contexts type `readiness` as required for ergonomics; when\n  // no specs are configured there is no gate to report, so synthesise an empty\n  // bundle rather than forcing every caller to handle `undefined`.\n  return buildEvalKnowledgeBundle({\n    ...(options.readiness ?? {}),\n    taskId: options.readinessTaskId ?? options.goal,\n    index: emptyIndex(options.root),\n    specs: [],\n  })\n}\n\nfunction emptyIndex(root: string): KnowledgeIndex {\n  return {\n    root,\n    generatedAt: new Date(0).toISOString(),\n    sources: [],\n    pages: [],\n    graph: { nodes: [], edges: [] },\n  }\n}\n\n/**\n * Helper for verifiers: does the candidate source's text/title overlap any page\n * the readiness search returns for a gap query? A cheap relevance heuristic the\n * driver can compose into `verifySource` (real verifiers can do more).\n */\nexport function sourceMatchesGaps(\n  source: ResearchSourceProposal,\n  index: KnowledgeIndex,\n  gaps: KnowledgeGap[],\n): KnowledgeSearchResult[] {\n  const haystack = `${source.title ?? ''}\\n${source.text}`.toLowerCase()\n  const hits: KnowledgeSearchResult[] = []\n  for (const gap of gaps) {\n    for (const token of gap.query.toLowerCase().split(/\\s+/).filter(Boolean)) {\n      if (haystack.includes(token)) {\n        hits.push(...searchKnowledge(index, gap.query, 1))\n        break\n      }\n    }\n  }\n  return hits\n}\n\n// ── Deprecated aliases ───────────────────────────────────────────────────────────\n// The old \"TwoAgent\" names described the MECHANISM (a proposer worker + a verifier driver)\n// instead of the VALUE (research whose sources are verified before admission). Kept as\n// aliases so existing importers do not break; prefer the `Verified*` names.\n\n/** @deprecated Renamed to {@link runVerifiedResearchLoop}. */\nexport const runTwoAgentResearchLoop = runVerifiedResearchLoop\n/** @deprecated Renamed to {@link VerifiedResearchLoopOptions}. */\nexport type TwoAgentResearchLoopOptions = VerifiedResearchLoopOptions\n/** @deprecated Renamed to {@link VerifiedResearchLoopResult}. */\nexport type TwoAgentResearchLoopResult = VerifiedResearchLoopResult\n/** @deprecated Renamed to {@link VerifiedResearchRound}. */\nexport type TwoAgentResearchRound = VerifiedResearchRound\n","import { z } from 'zod'\nimport { readRegularFileWithinRoot, writeJsonDurableWithinRoot } from './durable-fs'\nimport type { KnowledgeEventQuery } from './events'\nimport { buildKnowledgeGraph } from './graph'\nimport { withKnowledgeMutation, withKnowledgeRead } from './mutation-lock'\nimport {\n  KnowledgeEventSchema,\n  KnowledgeIndexSchema,\n  KnowledgePageSchema,\n  SourceRecordSchema,\n} from './schemas'\nimport type { KnowledgeEvent, KnowledgeIndex, KnowledgePage, SourceRecord } from './types'\n\nexport interface KbStore {\n  putSource(source: SourceRecord): Promise<void>\n  getSource(id: string): Promise<SourceRecord | null>\n  listSources(): Promise<SourceRecord[]>\n  putPage(page: KnowledgePage): Promise<void>\n  getPage(idOrPath: string): Promise<KnowledgePage | null>\n  listPages(): Promise<KnowledgePage[]>\n  putIndex(index: KnowledgeIndex): Promise<void>\n  getIndex(): Promise<KnowledgeIndex | null>\n  putEvent(event: KnowledgeEvent): Promise<void>\n  listEvents(query?: KnowledgeEventQuery): Promise<KnowledgeEvent[]>\n}\n\nexport class MemoryKbStore implements KbStore {\n  private readonly sources = new Map<string, SourceRecord>()\n  private readonly pages = new Map<string, KnowledgePage>()\n  private readonly events: KnowledgeEvent[] = []\n  private index: KnowledgeIndex | null = null\n\n  async putSource(source: SourceRecord): Promise<void> {\n    this.sources.set(source.id, clone(source))\n  }\n\n  async getSource(id: string): Promise<SourceRecord | null> {\n    return clone(this.sources.get(id) ?? null)\n  }\n\n  async listSources(): Promise<SourceRecord[]> {\n    return [...this.sources.values()].map(clone)\n  }\n\n  async putPage(page: KnowledgePage): Promise<void> {\n    this.pages.set(page.id, clone(page))\n  }\n\n  async getPage(idOrPath: string): Promise<KnowledgePage | null> {\n    return clone(\n      this.pages.get(idOrPath) ??\n        [...this.pages.values()].find((page) => page.path === idOrPath) ??\n        null,\n    )\n  }\n\n  async listPages(): Promise<KnowledgePage[]> {\n    return [...this.pages.values()].map(clone)\n  }\n\n  async putIndex(index: KnowledgeIndex): Promise<void> {\n    this.index = clone(index)\n  }\n\n  async getIndex(): Promise<KnowledgeIndex | null> {\n    if (this.index) return clone(this.index)\n    const pages = await this.listPages()\n    const sources = await this.listSources()\n    return {\n      root: 'memory',\n      generatedAt: new Date().toISOString(),\n      sources,\n      pages,\n      graph: buildKnowledgeGraph(pages),\n    }\n  }\n\n  async putEvent(event: KnowledgeEvent): Promise<void> {\n    this.events.push(clone(event))\n  }\n\n  async listEvents(query: KnowledgeEventQuery = {}): Promise<KnowledgeEvent[]> {\n    let out = this.events\n    if (query.type) out = out.filter((event) => event.type === query.type)\n    if (query.target) out = out.filter((event) => event.target === query.target)\n    out = [...out].sort((a, b) => a.createdAt.localeCompare(b.createdAt))\n    return out.slice(-(query.limit ?? out.length)).map(clone)\n  }\n}\n\nconst knowledgeEventsSchema = z.array(KnowledgeEventSchema)\n\nexport class FileSystemKbStore implements KbStore {\n  constructor(private readonly dir: string) {}\n\n  async putSource(source: SourceRecord): Promise<void> {\n    const parsed = SourceRecordSchema.parse(source) as SourceRecord\n    await this.updateIndex((index) => ({\n      ...index,\n      generatedAt: new Date().toISOString(),\n      sources: [parsed, ...index.sources.filter((entry) => entry.id !== parsed.id)],\n    }))\n  }\n\n  async getSource(id: string): Promise<SourceRecord | null> {\n    return withKnowledgeRead(this.dir, async () => {\n      const index = await this.readIndex()\n      return clone(index?.sources.find((source) => source.id === id) ?? null)\n    })\n  }\n\n  async listSources(): Promise<SourceRecord[]> {\n    return withKnowledgeRead(this.dir, async () => clone((await this.readIndex())?.sources ?? []))\n  }\n\n  async putPage(page: KnowledgePage): Promise<void> {\n    const parsed = KnowledgePageSchema.parse(page) as KnowledgePage\n    await this.updateIndex((index) => {\n      const pages = [parsed, ...index.pages.filter((entry) => entry.id !== parsed.id)]\n      return {\n        ...index,\n        generatedAt: new Date().toISOString(),\n        pages,\n        graph: buildKnowledgeGraph(pages),\n      }\n    })\n  }\n\n  async getPage(idOrPath: string): Promise<KnowledgePage | null> {\n    return withKnowledgeRead(this.dir, async () => {\n      const index = await this.readIndex()\n      return clone(\n        index?.pages.find((page) => page.id === idOrPath || page.path === idOrPath) ?? null,\n      )\n    })\n  }\n\n  async listPages(): Promise<KnowledgePage[]> {\n    return withKnowledgeRead(this.dir, async () => clone((await this.readIndex())?.pages ?? []))\n  }\n\n  async putIndex(index: KnowledgeIndex): Promise<void> {\n    const parsed = KnowledgeIndexSchema.parse(index) as KnowledgeIndex\n    await withKnowledgeMutation(this.dir, () =>\n      writeJsonDurableWithinRoot(this.dir, 'index.json', parsed),\n    )\n  }\n\n  async getIndex(): Promise<KnowledgeIndex | null> {\n    return withKnowledgeRead(this.dir, () => this.readIndex())\n  }\n\n  async putEvent(event: KnowledgeEvent): Promise<void> {\n    const parsed = KnowledgeEventSchema.parse(event) as KnowledgeEvent\n    await withKnowledgeMutation(this.dir, async () => {\n      const current = await this.readEvents()\n      const next = [...current.filter((entry) => entry.id !== parsed.id), parsed].sort((a, b) =>\n        a.createdAt.localeCompare(b.createdAt),\n      )\n      await writeJsonDurableWithinRoot(this.dir, 'events.json', next)\n    })\n  }\n\n  async listEvents(query: KnowledgeEventQuery = {}): Promise<KnowledgeEvent[]> {\n    return withKnowledgeRead(this.dir, async () => {\n      let events = await this.readEvents()\n      if (query.type) events = events.filter((event) => event.type === query.type)\n      if (query.target) events = events.filter((event) => event.target === query.target)\n      return clone(events.slice(-(query.limit ?? events.length)))\n    })\n  }\n\n  private async updateIndex(change: (index: KnowledgeIndex) => KnowledgeIndex): Promise<void> {\n    await withKnowledgeMutation(this.dir, async () => {\n      const current = (await this.readIndex()) ?? emptyIndex(this.dir)\n      const next = KnowledgeIndexSchema.parse(change(current)) as KnowledgeIndex\n      await writeJsonDurableWithinRoot(this.dir, 'index.json', next)\n    })\n  }\n\n  private async readIndex(): Promise<KnowledgeIndex | null> {\n    return readJsonFile(\n      this.dir,\n      'index.json',\n      KnowledgeIndexSchema,\n    ) as Promise<KnowledgeIndex | null>\n  }\n\n  private async readEvents(): Promise<KnowledgeEvent[]> {\n    return ((await readJsonFile(this.dir, 'events.json', knowledgeEventsSchema)) ??\n      []) as KnowledgeEvent[]\n  }\n}\n\nfunction emptyIndex(root: string): KnowledgeIndex {\n  return {\n    root,\n    generatedAt: new Date(0).toISOString(),\n    sources: [],\n    pages: [],\n    graph: { nodes: [], edges: [] },\n  }\n}\n\nasync function readJsonFile<T>(\n  root: string,\n  relativePath: string,\n  schema: z.ZodType<T>,\n): Promise<T | null> {\n  try {\n    const file = await readRegularFileWithinRoot(root, relativePath)\n    return schema.parse(JSON.parse(file.bytes.toString('utf8')))\n  } catch (error) {\n    if ((error as NodeJS.ErrnoException | null)?.code === 'ENOENT') return null\n    throw error\n  }\n}\n\nfunction clone<T>(value: T): T {\n  return value == null ? value : (JSON.parse(JSON.stringify(value)) as T)\n}\n","/**\n * Bridge from `AnalystFinding` (agent-eval) to knowledge proposals.\n *\n * Closes the failure → wiki side of the recursive-self-improvement\n * loop: a knowledge-gap or knowledge-poisoning finding produced by an\n * analyst becomes a concrete proposal an operator (or auto-merge bot)\n * can review and apply. The bridge is intentionally lossless on the\n * fail-loud side — a finding the parser can't classify returns a\n * `KnowledgeProposalParseError` rather than a silent skip, so the\n * loop never accepts an underspecified edit.\n *\n * Subject grammar this bridge understands (analyst-side convention,\n * stamped in the kind prompts):\n *\n *   agent-knowledge:wiki:<page-slug>            create / update page\n *   agent-knowledge:wiki:<page-slug>#<heading>  insert section under page\n *   agent-knowledge:claim:<topic>               draft claim row\n *   agent-knowledge:raw:<source-id>             lift raw → curated\n *   agent-knowledge:stale:<page-slug>           mark page superseded\n *\n * Anything else (websearch:outdated:*, tool-doc:*, system-prompt:*,\n * memory:*) is NOT a knowledge-base concern and returns `null` so the\n * loop's improvement-applier handles it.\n */\n\nimport type { AnalystFinding, AnalystSeverity } from '@tangle-network/agent-eval'\nimport type { ClaimRef, KnowledgeClaim, KnowledgeWriteBlock } from './types'\n\nexport interface KnowledgeProposal {\n  /**\n   * Stable id derived from the finding so cross-run diffs share an\n   * identity. Re-proposing the same finding produces the same id.\n   */\n  id: string\n  /** The finding that generated this proposal — useful for audit + revert. */\n  sourceFindingId: string\n  /** What the proposal does. */\n  kind:\n    | 'create-page'\n    | 'update-page'\n    | 'append-section'\n    | 'create-claim'\n    | 'lift-raw'\n    | 'mark-stale'\n  /** Locus on disk (page slug or claim topic). */\n  locus: string\n  /**\n   * Page write blocks the standard `applyKnowledgeWriteBlocks` consumer\n   * accepts. Empty for proposals that don't change page text (e.g.\n   * `create-claim` produces a `claim` field instead).\n   */\n  writeBlocks: KnowledgeWriteBlock[]\n  /**\n   * Granular claim draft for proposals whose unit-of-change is a claim\n   * row rather than a whole page. `status: 'draft'` until reviewed.\n   */\n  claim?: KnowledgeClaim\n  /** Per-proposal metadata: severity, confidence, source span. */\n  metadata: {\n    severity: AnalystSeverity\n    confidence: number\n    evidence_uri?: string\n    analyst_id: string\n  }\n}\n\nexport class KnowledgeProposalParseError extends Error {\n  constructor(\n    public readonly findingId: string,\n    public readonly subject: string,\n    message: string,\n  ) {\n    super(`proposeFromFinding(${findingId}, subject=${subject}): ${message}`)\n    this.name = 'KnowledgeProposalParseError'\n  }\n}\n\n/**\n * Convert one `AnalystFinding` into a knowledge proposal. Returns\n * `null` when the finding's locus isn't a knowledge-base concern\n * (`websearch:outdated:*`, `tool-doc:*`, `system-prompt:*`,\n * `memory:*`, missing subject). Throws when the locus IS a\n * knowledge-base concern but is malformed — that's a bug in the\n * analyst prompt and should fail loud.\n *\n * Caller convention: feed the function the analyst's full findings\n * list and filter out the `null`s; the orchestrator passes the\n * remaining proposals to the existing review / apply pipeline.\n */\nexport function proposeFromFinding(finding: AnalystFinding): KnowledgeProposal | null {\n  if (!finding.subject) return null\n  if (!finding.subject.startsWith('agent-knowledge:')) return null\n\n  const rest = finding.subject.slice('agent-knowledge:'.length)\n  const [kindPart, ...locusParts] = rest.split(':')\n  const locus = locusParts.join(':')\n  if (!kindPart || !locus) {\n    throw new KnowledgeProposalParseError(\n      finding.finding_id,\n      finding.subject,\n      'expected `agent-knowledge:<kind>:<locus>` shape',\n    )\n  }\n\n  const baseMeta: KnowledgeProposal['metadata'] = {\n    severity: finding.severity,\n    confidence: finding.confidence,\n    evidence_uri: finding.evidence_refs[0]?.uri,\n    analyst_id: finding.analyst_id,\n  }\n\n  switch (kindPart) {\n    case 'wiki':\n      return wikiProposal(finding, locus, baseMeta)\n    case 'claim':\n      return claimProposal(finding, locus, baseMeta)\n    case 'raw':\n      return liftRawProposal(finding, locus, baseMeta)\n    case 'stale':\n      return markStaleProposal(finding, locus, baseMeta)\n    default:\n      throw new KnowledgeProposalParseError(\n        finding.finding_id,\n        finding.subject,\n        `unknown kind \"${kindPart}\" (expected one of: wiki | claim | raw | stale)`,\n      )\n  }\n}\n\nfunction wikiProposal(\n  finding: AnalystFinding,\n  locus: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const hashIdx = locus.indexOf('#')\n  const pageSlug = hashIdx >= 0 ? locus.slice(0, hashIdx) : locus\n  const heading = hashIdx >= 0 ? locus.slice(hashIdx + 1) : null\n  const path = `knowledge/${ensureSlug(pageSlug)}.md`\n\n  const body = renderWikiBody(finding, pageSlug, heading)\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: heading ? 'append-section' : 'create-page',\n    locus: pageSlug,\n    writeBlocks: [{ path, content: body }],\n    metadata,\n  }\n}\n\nfunction claimProposal(\n  finding: AnalystFinding,\n  locus: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const refs: ClaimRef[] = finding.evidence_refs\n    .filter((r) => r.uri)\n    .map((r) => ({\n      sourceId: `analyst-finding:${finding.finding_id}`,\n      anchorId: r.uri,\n      quote: r.excerpt,\n    }))\n  const claim: KnowledgeClaim = {\n    id: `claim-${finding.finding_id}`,\n    text: finding.recommended_action ?? finding.claim,\n    refs,\n    confidence: finding.confidence,\n    status: 'draft',\n    metadata: {\n      analyst_id: finding.analyst_id,\n      source_finding_id: finding.finding_id,\n      topic: locus,\n    },\n  }\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: 'create-claim',\n    locus,\n    writeBlocks: [],\n    claim,\n    metadata,\n  }\n}\n\nfunction liftRawProposal(\n  finding: AnalystFinding,\n  sourceId: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const path = `knowledge/${ensureSlug(sourceId)}.md`\n  const body = [\n    '---',\n    `title: ${sourceId}`,\n    `source: ${sourceId}`,\n    `status: draft`,\n    `lifted_from_finding: ${finding.finding_id}`,\n    '---',\n    '',\n    '## Why this page exists',\n    '',\n    finding.claim,\n    '',\n    ...(finding.rationale ? ['## Rationale', '', finding.rationale, ''] : []),\n    ...(finding.recommended_action\n      ? ['## Recommended action', '', finding.recommended_action, '']\n      : []),\n  ].join('\\n')\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: 'lift-raw',\n    locus: sourceId,\n    writeBlocks: [{ path, content: body }],\n    metadata,\n  }\n}\n\nfunction markStaleProposal(\n  finding: AnalystFinding,\n  pageSlug: string,\n  metadata: KnowledgeProposal['metadata'],\n): KnowledgeProposal {\n  const path = `knowledge/${ensureSlug(pageSlug)}.stale.md`\n  const body = [\n    '---',\n    `title: ${pageSlug} (marked stale)`,\n    `status: superseded`,\n    `superseded_by_finding: ${finding.finding_id}`,\n    `confidence: ${finding.confidence}`,\n    '---',\n    '',\n    '## Why marked stale',\n    '',\n    finding.claim,\n    '',\n    ...(finding.rationale ? ['## Evidence', '', finding.rationale, ''] : []),\n    ...(finding.recommended_action ? ['## Action', '', finding.recommended_action, ''] : []),\n  ].join('\\n')\n  return {\n    id: `prop-${finding.finding_id}`,\n    sourceFindingId: finding.finding_id,\n    kind: 'mark-stale',\n    locus: pageSlug,\n    writeBlocks: [{ path, content: body }],\n    metadata,\n  }\n}\n\n/**\n * Plural convenience: filter + map across an entire findings batch\n * with one call. Parse errors collect into `errors[]`; the loop\n * decides per-error whether to abort or continue.\n */\nexport interface ProposeFromFindingsResult {\n  proposals: KnowledgeProposal[]\n  skipped: number\n  errors: KnowledgeProposalParseError[]\n}\n\nexport function proposeFromFindings(\n  findings: ReadonlyArray<AnalystFinding>,\n): ProposeFromFindingsResult {\n  const proposals: KnowledgeProposal[] = []\n  const errors: KnowledgeProposalParseError[] = []\n  let skipped = 0\n  for (const f of findings) {\n    try {\n      const p = proposeFromFinding(f)\n      if (p) proposals.push(p)\n      else skipped += 1\n    } catch (err) {\n      if (err instanceof KnowledgeProposalParseError) errors.push(err)\n      else throw err\n    }\n  }\n  return { proposals, skipped, errors }\n}\n\nfunction ensureSlug(s: string): string {\n  return (\n    s\n      .toLowerCase()\n      .replace(/[^a-z0-9-]+/g, '-')\n      .replace(/^-+|-+$/g, '')\n      .slice(0, 200) || 'untitled'\n  )\n}\n\nfunction renderWikiBody(finding: AnalystFinding, slug: string, heading: string | null): string {\n  const title = humanize(slug)\n  if (heading) {\n    return [\n      `## ${heading}`,\n      '',\n      finding.claim,\n      '',\n      ...(finding.rationale ? ['### Rationale', '', finding.rationale, ''] : []),\n      ...(finding.recommended_action ? ['### Action', '', finding.recommended_action, ''] : []),\n      `_Drafted from finding ${finding.finding_id} (confidence ${finding.confidence.toFixed(2)})._`,\n    ].join('\\n')\n  }\n  return [\n    '---',\n    `title: ${title}`,\n    `status: draft`,\n    `drafted_from_finding: ${finding.finding_id}`,\n    `confidence: ${finding.confidence}`,\n    '---',\n    '',\n    `# ${title}`,\n    '',\n    finding.claim,\n    '',\n    ...(finding.rationale ? ['## Rationale', '', finding.rationale, ''] : []),\n    ...(finding.recommended_action\n      ? ['## Recommended action', '', finding.recommended_action, '']\n      : []),\n  ].join('\\n')\n}\n\nfunction humanize(slug: string): string {\n  return (\n    slug\n      .split('-')\n      .filter(Boolean)\n      .map((w) => w[0]?.toUpperCase() + w.slice(1))\n      .join(' ') || slug\n  )\n}\n","import type {\n  BuildEvalKnowledgeBundleOptions,\n  EvalKnowledgeBundleBuildResult,\n  KnowledgeReadinessSpec,\n} from './eval-readiness'\nimport { buildKnowledgeIndex } from './indexer'\nimport {\n  type KnowledgeBaseQualityOptions,\n  type KnowledgeBaseQualityReport,\n  scoreKnowledgeBaseIndex,\n} from './rag-eval'\nimport { readinessFor } from './readiness-helpers'\nimport type { KnowledgeIndex } from './types'\nimport {\n  type ValidateKnowledgeOptions,\n  type ValidateKnowledgeResult,\n  validateKnowledgeIndex,\n} from './validate'\n\nexport interface EvaluateKnowledgeBaseReadinessOptions {\n  root: string\n  goal: string\n  readinessSpecs?: readonly KnowledgeReadinessSpec[]\n  readinessTaskId?: string\n  readiness?: Omit<BuildEvalKnowledgeBundleOptions, 'taskId' | 'index' | 'specs'>\n  strict?: ValidateKnowledgeOptions['strict']\n  kbQuality?: KnowledgeBaseQualityOptions\n}\n\nexport interface KnowledgeBaseReadinessEvaluation {\n  ready: boolean\n  summary: string\n  index: KnowledgeIndex\n  validation: ValidateKnowledgeResult\n  readiness?: EvalKnowledgeBundleBuildResult\n  kbQuality: KnowledgeBaseQualityReport\n  dimensions: {\n    validation: number\n    kb_quality: number\n    blocking_readiness: number\n  }\n}\n\nexport async function evaluateKnowledgeBaseReadiness(\n  options: EvaluateKnowledgeBaseReadinessOptions,\n): Promise<KnowledgeBaseReadinessEvaluation> {\n  const index = await buildKnowledgeIndex(options.root)\n  const validation = validateKnowledgeIndex(index, { strict: options.strict })\n  const readiness = readinessFor(\n    {\n      ...options,\n      readinessSpecs: options.readinessSpecs ? [...options.readinessSpecs] : undefined,\n    },\n    index,\n  )\n  const kbQuality = scoreKnowledgeBaseIndex(index, {\n    strict: options.strict,\n    ...options.kbQuality,\n  })\n  const blockingMissing = readiness?.report.blockingMissingRequirements.length ?? 0\n  const blockingTotal =\n    options.readinessSpecs?.filter((spec) => spec.importance === 'blocking').length ?? 0\n  const blockingReadiness =\n    blockingTotal === 0 ? 1 : Math.max(0, blockingTotal - blockingMissing) / blockingTotal\n  const ready = validation.ok && kbQuality.ok && blockingMissing === 0\n  const failures = [\n    validation.ok ? undefined : `${validation.findings.length} validation finding(s)`,\n    kbQuality.ok ? undefined : `${kbQuality.findings.length} KB quality finding(s)`,\n    blockingMissing === 0\n      ? undefined\n      : `${blockingMissing}/${blockingTotal} blocking readiness requirement(s) missing`,\n  ].filter((failure): failure is string => Boolean(failure))\n\n  return {\n    ready,\n    summary: ready ? 'knowledge base passed readiness checks' : failures.join('; '),\n    index,\n    validation,\n    readiness,\n    kbQuality,\n    dimensions: {\n      validation: validation.ok ? 1 : 0,\n      kb_quality: kbQuality.ok ? 1 : 0,\n      blocking_readiness: blockingReadiness,\n    },\n  }\n}\n","import {\n  evaluateReleaseConfidence,\n  type GateDecision,\n  type ReleaseConfidenceScorecard,\n  type ReleaseTraceEvidence,\n  type RunRecord,\n  validateRunRecord,\n} from '@tangle-network/agent-eval'\nimport { stableId } from './ids'\nimport type { KnowledgeRelease } from './types'\n\nexport interface KnowledgeReleaseReport {\n  release: KnowledgeRelease\n  scorecard: ReleaseConfidenceScorecard\n  candidateRuns: RunRecord[]\n  baselineRuns: RunRecord[]\n}\n\n/**\n * Campaign-native release report. The caller (a consumer's KB self-improvement\n * loop) supplies the candidate/baseline `RunRecord[]` (e.g. via\n * `campaignToRunRecords`) + optional per-instance `ReleaseTraceEvidence` + the\n * gate decision; this folds them into a `ReleaseConfidenceScorecard` + a\n * `KnowledgeRelease`. Release confidence is computed from run records + traces,\n * independent of any optimizer result shape.\n */\nexport interface KnowledgeReleaseInput {\n  candidateId: string\n  baselineId?: string\n  candidateRuns: RunRecord[]\n  baselineRuns?: RunRecord[]\n  traces?: ReleaseTraceEvidence[]\n  gateDecision?: GateDecision | null\n  /**\n   * True when a held-out split was evaluated (drives the holdout threshold).\n   *\n   * Constraint: the substrate gate keys the holdout requirement off a scenario\n   * corpus, which this run-only report does not carry. With `hasHoldout: true`\n   * the gate fails closed (`missing_holdout_split`) even when holdout RunRecords\n   * are supplied. Callers that gate on a real held-out split should drive\n   * `evaluateReleaseConfidence` directly with a dataset/scenarios.\n   */\n  hasHoldout?: boolean\n  /** Candidate is the search-best variant — a promotion precondition. Default true. */\n  promotedIsBest?: boolean\n  createdAt?: string\n  minScore?: number\n}\n\nexport function knowledgeReleaseReport(input: KnowledgeReleaseInput): KnowledgeReleaseReport {\n  const baselineRuns = input.baselineRuns ?? []\n  const runRecords = [...input.candidateRuns, ...baselineRuns].map(validateRunRecord)\n  const scorecard = evaluateReleaseConfidence({\n    target: 'agent-knowledge-base',\n    candidateId: input.candidateId,\n    baselineId: input.baselineId ?? 'baseline',\n    traces: input.traces ?? [],\n    runs: runRecords,\n    gateDecision: input.gateDecision ?? null,\n    thresholds: {\n      requireCorpus: false,\n      // The report gates on RunRecord-level outcomes, not on a separate scenario\n      // corpus (KnowledgeReleaseInput carries no dataset/scenarios). The scenario\n      // floor must therefore be 0 — otherwise the corpus axis fails closed on a\n      // dimension the report has no way to satisfy, masking the run-based gate.\n      minScenarioCount: 0,\n      requireHoldout: input.hasHoldout ?? false,\n      minHoldoutRuns: input.hasHoldout ? 1 : 0,\n      minSearchRuns: 1,\n      minMeanScore: input.minScore ?? 0.7,\n    },\n  })\n  const release: KnowledgeRelease = {\n    id: stableId('krel', `${input.candidateId}:${input.createdAt ?? new Date().toISOString()}`),\n    candidateId: input.candidateId,\n    createdAt: input.createdAt ?? new Date().toISOString(),\n    promoted: scorecard.status !== 'fail' && (input.promotedIsBest ?? true),\n    scorecard,\n    runRecordIds: runRecords.map((record) => record.runId),\n  }\n  return { release, scorecard, candidateRuns: input.candidateRuns, baselineRuns }\n}\n","/**\n * Research-DRIVING driver for `runVerifiedResearchLoop`.\n *\n * The shipped drivers all FILTER the worker's sources:\n *   - `createVerifyingResearchDriver` judges on-topic relevance,\n *   - `createAdaptiveResearchDriver` dedups then triages then escalates,\n *   - `createClaimGroundingVerifier` rejects misattributed citations.\n *\n * This driver does the OPPOSITE job: instead of narrowing the worker's output,\n * it DRIVES the research DEEPER each round. Its value is not \"fewer sources\" —\n * it is \"more answered, better-corroborated sub-questions\". Concretely, each\n * round it:\n *\n *   1. EXTRACTS the key claims from the worker's new sources (one LLM pass per\n *      source, in `verifySource`; falls back to a deterministic sentence-pull\n *      when the model is unavailable so a round never silently extracts nothing).\n *   2. TRACKS each claim's support — the set of INDEPENDENT sources (by canonical\n *      host) that assert it — and detects CONTRADICTIONS between a new claim and\n *      one already on the ledger.\n *   3. GENERATES the next round's DEEP sub-questions from the accumulated claims,\n *      in four kinds — comparative (\"how does X's tradeoff differ from Y's?\"),\n *      mechanism (\"under what precise condition does X fail?\"), gap (\"what\n *      specific result is missing?\"), and contradiction (\"does any source\n *      challenge claim Z?\").\n *   4. FLAGS weakly-supported claims (only ONE independent source) and\n *      contradicted claims as INVALIDATION targets and demands the worker find\n *      corroborating / refuting evidence for them.\n *   5. FOLDS the deep sub-questions + invalidation challenges into the worker's\n *      next prompt via the loop's `foldGaps` → `steer` channel — that is the\n *      mechanism that drives DEPTH and VALIDATION rather than breadth.\n *\n * COMPLETION (`isComplete` / the `done` judgment the caller gates on) does NOT\n * look at source COUNT. It is done only when every deep sub-question it raised\n * has been addressed AND every key claim is either supported by >= 2 independent\n * sources OR explicitly marked CONTESTED (a contradiction the loop surfaced and\n * could not resolve). A KB with twenty sources all asserting one unchallenged\n * claim is NOT done; a KB whose handful of claims are each corroborated or\n * contested IS.\n *\n * It reuses `runVerifiedResearchLoop` (it is a plain `ResearchDriver`), the web\n * worker, `sha256` (claim identity), `canonicalizeUrl` (independent-source\n * identity), and the `RouterClient` chat surface; it reinvents none of them.\n */\n\nimport { canonicalizeUrl } from './adaptive-driver'\nimport { sha256 } from './ids'\nimport type {\n  KnowledgeGap,\n  ResearchDriver,\n  ResearchSourceProposal,\n  SourceVerdict,\n  SourceVerificationContext,\n} from './two-agent-research-loop'\nimport {\n  createTangleRouterClient,\n  type RouterClient,\n  type TangleRouterOptions,\n} from './web-research-worker'\n\n/** The four deep sub-question kinds the driver generates to drive depth. */\nexport type DeepQuestionKind = 'comparative' | 'mechanism' | 'gap' | 'contradiction'\n\n/** A deep sub-question the driver folds into the worker's next prompt. */\nexport interface DeepQuestion {\n  kind: DeepQuestionKind\n  text: string\n  /** sha256-derived stable id, so \"addressed\" can be tracked across rounds. */\n  id: string\n  /** Claim id(s) this question interrogates (for contradiction/mechanism kinds). */\n  claimIds: string[]\n  /** True once a later round's evidence addressed it (see `markAddressed`). */\n  addressed: boolean\n  /** The round this question was raised in. */\n  raisedRound: number\n}\n\n/** One tracked claim plus the independent sources that assert it. */\nexport interface TrackedClaim {\n  id: string\n  /** The claim text as first extracted (kept for prompts/audit). */\n  text: string\n  /** Canonical hosts of the INDEPENDENT sources that assert this claim. */\n  supportingHosts: Set<string>\n  /** Source URIs that assert this claim (provenance; may share a host). */\n  supportingUris: string[]\n  /** Claim ids this claim was found to CONTRADICT (and vice versa). */\n  contradicts: Set<string>\n  /**\n   * CONTESTED = a contradiction the loop surfaced but could not resolve to a\n   * single supported claim. A contested claim counts as \"settled enough to be\n   * done\" (we report the disagreement) even with < 2 independent sources.\n   */\n  contested: boolean\n  firstSeenRound: number\n}\n\n/** The driver's accumulated research state — the completion oracle reads this. */\nexport interface ResearchDrivingState {\n  /** Every claim extracted from the worker's sources, by id. */\n  claims: TrackedClaim[]\n  /** Every deep sub-question raised, by id. */\n  questions: DeepQuestion[]\n  /** Claims with exactly one independent source AND not contested. */\n  weaklySupported: TrackedClaim[]\n  /** Claims supported by >= 2 independent sources. */\n  corroborated: TrackedClaim[]\n  /** Claims marked contested (a surfaced, unresolved contradiction). */\n  contested: TrackedClaim[]\n  /** Deep questions still unaddressed. */\n  openQuestions: DeepQuestion[]\n  /** How many rounds the driver has folded steer for. */\n  rounds: number\n}\n\nexport interface ResearchDrivingDriverOptions {\n  /** Router client for claim extraction + deep-question generation. */\n  router?: RouterClient\n  router_options?: TangleRouterOptions\n  /**\n   * A claim is CORROBORATED at this many INDEPENDENT supporting sources (distinct\n   * canonical hosts). Default 2 — the task's \">= 2 independent sources\" bar.\n   */\n  minIndependentSources?: number\n  /** Max deep sub-questions to fold into one round's steer. Default 6. */\n  maxQuestionsPerRound?: number\n  /** Max claims to extract from a single source. Default 3. */\n  maxClaimsPerSource?: number\n  /**\n   * When the extractor LLM is unavailable, fall back to a deterministic claim\n   * pull (the source's leading sentences) so the driver still drives. Default\n   * true. Set false to require the model (claims will be empty without it).\n   */\n  deterministicFallback?: boolean\n  /** Observe each round's generated steer (for instrumentation / the script). */\n  onSteer?: (steer: ResearchDrivingSteer) => void\n}\n\n/** What the driver folded into one round's worker prompt, surfaced for audit. */\nexport interface ResearchDrivingSteer {\n  round: number\n  deepQuestions: DeepQuestion[]\n  /** Claims it demanded corroborating/refuting evidence for this round. */\n  invalidationTargets: TrackedClaim[]\n  /** The readiness gaps it interleaved (passed through from the loop). */\n  gaps: KnowledgeGap[]\n  /** The full steer text handed to the worker. */\n  text: string\n}\n\n/**\n * The research-driving driver. It is a `ResearchDriver` (drops straight into\n * `runVerifiedResearchLoop`) PLUS a completion oracle and live state, mirroring\n * how `createAdaptiveResearchDriver` exposes `stats()`.\n */\nexport interface ResearchDrivingDriver extends ResearchDriver {\n  /** Live snapshot of the claim ledger + deep questions. */\n  researchState(): ResearchDrivingState\n  /**\n   * The completion oracle — gate `done` on THIS, not on source count. True when\n   * every deep sub-question is addressed AND every claim is corroborated\n   * (>= `minIndependentSources` independent sources) or explicitly contested.\n   * False while any claim is weakly-supported or any deep question is open.\n   * Returns false before any claim has been seen (nothing researched yet).\n   */\n  isComplete(): boolean\n  /**\n   * The last round's generated steer, or undefined before the first fold. Useful\n   * to assert the driver produced deeper questions / invalidation challenges.\n   */\n  lastSteer(): ResearchDrivingSteer | undefined\n}\n\n/** A claim the extractor returns for one source. */\ninterface ExtractedClaim {\n  text: string\n  /** A claim id ALREADY on the ledger that this one CONTRADICTS, if the model says so. */\n  contradictsExistingId?: string\n}\n\nexport function createResearchDrivingDriver(\n  options: ResearchDrivingDriverOptions = {},\n): ResearchDrivingDriver {\n  const minIndependentSources = Math.max(2, options.minIndependentSources ?? 2)\n  const maxQuestionsPerRound = Math.max(1, options.maxQuestionsPerRound ?? 6)\n  const maxClaimsPerSource = Math.max(1, options.maxClaimsPerSource ?? 3)\n  const deterministicFallback = options.deterministicFallback ?? true\n\n  // The claim ledger, keyed by claim id (sha256 of the normalized claim text).\n  const claims = new Map<string, TrackedClaim>()\n  // Every deep question raised, by id — so we can mark them addressed later.\n  const questions = new Map<string, DeepQuestion>()\n  let rounds = 0\n  let lastSteer: ResearchDrivingSteer | undefined\n\n  function resolveRouter(): RouterClient {\n    return options.router ?? createTangleRouterClient(options.router_options)\n  }\n\n  /** Record a claim from a source, growing its independent-source support. */\n  function recordClaim(extracted: ExtractedClaim, sourceUri: string, round: number): TrackedClaim {\n    const id = claimId(extracted.text)\n    const host = hostOf(sourceUri)\n    const existing = claims.get(id)\n    if (existing) {\n      if (host) existing.supportingHosts.add(host)\n      if (!existing.supportingUris.includes(sourceUri)) existing.supportingUris.push(sourceUri)\n      linkContradiction(existing, extracted.contradictsExistingId)\n      return existing\n    }\n    const tracked: TrackedClaim = {\n      id,\n      text: extracted.text.trim(),\n      supportingHosts: new Set(host ? [host] : []),\n      supportingUris: [sourceUri],\n      contradicts: new Set(),\n      contested: false,\n      firstSeenRound: round,\n    }\n    linkContradiction(tracked, extracted.contradictsExistingId)\n    claims.set(id, tracked)\n    return tracked\n  }\n\n  /** Wire a bidirectional contradiction edge and mark BOTH claims contested. */\n  function linkContradiction(claim: TrackedClaim, otherId: string | undefined): void {\n    if (!otherId || otherId === claim.id) return\n    const other = claims.get(otherId)\n    if (!other) return\n    claim.contradicts.add(otherId)\n    other.contradicts.add(claim.id)\n    claim.contested = true\n    other.contested = true\n  }\n\n  /** A claim's independent-source count = distinct canonical hosts. */\n  function independentSupport(claim: TrackedClaim): number {\n    return claim.supportingHosts.size\n  }\n\n  function isCorroborated(claim: TrackedClaim): boolean {\n    return independentSupport(claim) >= minIndependentSources\n  }\n\n  /** Weakly-supported = NOT corroborated AND NOT contested → an invalidation target. */\n  function isWeak(claim: TrackedClaim): boolean {\n    return !isCorroborated(claim) && !claim.contested\n  }\n\n  function snapshot(): ResearchDrivingState {\n    const all = [...claims.values()]\n    const allQuestions = [...questions.values()]\n    return {\n      claims: all,\n      questions: allQuestions,\n      weaklySupported: all.filter(isWeak),\n      corroborated: all.filter(isCorroborated),\n      contested: all.filter((claim) => claim.contested),\n      openQuestions: allQuestions.filter((question) => !question.addressed),\n      rounds,\n    }\n  }\n\n  /**\n   * Mark deep questions addressed when later evidence speaks to them. A question\n   * is addressed once a NEW claim's text shares enough content words with the\n   * question — i.e. the worker brought back evidence on the thing we asked about.\n   * Cheap and deterministic; the LLM is reserved for GENERATING questions, not\n   * grading them, so the oracle stays a non-model check.\n   */\n  function markAddressed(newClaimTexts: string[]): void {\n    for (const question of questions.values()) {\n      if (question.addressed) continue\n      // Contradiction questions resolve when one of their claims becomes\n      // corroborated or contested (the disagreement was surfaced/settled).\n      if (question.kind === 'contradiction') {\n        const settled = question.claimIds.some((id) => {\n          const claim = claims.get(id)\n          return claim ? isCorroborated(claim) || claim.contested : false\n        })\n        if (settled) question.addressed = true\n        continue\n      }\n      const qWords = contentWordSet(question.text)\n      if (qWords.size === 0) continue\n      for (const text of newClaimTexts) {\n        const overlap = overlapFraction(qWords, contentWordSet(text))\n        if (overlap >= 0.5) {\n          question.addressed = true\n          break\n        }\n      }\n    }\n  }\n\n  return {\n    /**\n     * `verifySource` — the per-source hook. This driver does NOT filter for\n     * relevance/dedup (other drivers do that, and the loop already dedups exact\n     * uris). Its job here is to EXTRACT the source's claims and grow the ledger.\n     * It accepts every source that yields at least one extractable claim; it\n     * only rejects a source with NO extractable signal at all (empty/unusable),\n     * because such a source cannot drive the research and pollutes the KB.\n     */\n    async verifySource(\n      source: ResearchSourceProposal,\n      ctx: SourceVerificationContext,\n    ): Promise<SourceVerdict> {\n      const extracted = await extractClaims(source, ctx)\n      if (extracted.length === 0) {\n        return {\n          accept: false,\n          reason: 'no extractable claim: source yields nothing to drive the research deeper',\n        }\n      }\n      const newTexts: string[] = []\n      for (const claim of extracted) {\n        recordClaim(claim, source.uri, ctx.round)\n        newTexts.push(claim.text)\n      }\n      markAddressed(newTexts)\n      return { accept: true }\n    },\n\n    /**\n     * `foldGaps` — the DEPTH driver. Runs after the worker's contribution is\n     * applied each round. It builds the next round's steer from (1) the readiness\n     * gaps the loop still reports, (2) freshly generated DEEP sub-questions, and\n     * (3) INVALIDATION challenges for weakly-supported / contradicted claims.\n     */\n    foldGaps(gaps: KnowledgeGap[]): string {\n      rounds += 1\n      const round = rounds\n      const ledger = [...claims.values()]\n\n      // Invalidation targets: claims with one source (need corroboration) OR\n      // contradicted claims (need a refutation/resolution). These are what the\n      // worker is told to go SHORE UP, not new breadth.\n      const invalidationTargets = ledger.filter(\n        (claim) => isWeak(claim) || claim.contradicts.size > 0,\n      )\n\n      // Generate this round's deep sub-questions from the actual ledger claims\n      // and register them so completion can track whether they get addressed.\n      const deepQuestions = synthesizeDeepQuestions(ledger, round).slice(0, maxQuestionsPerRound)\n      for (const question of deepQuestions) {\n        if (!questions.has(question.id)) questions.set(question.id, question)\n      }\n\n      const text = buildSteerText(gaps, deepQuestions, invalidationTargets, minIndependentSources)\n      lastSteer = { round, deepQuestions, invalidationTargets, gaps, text }\n      options.onSteer?.(lastSteer)\n      return text\n    },\n\n    researchState: snapshot,\n\n    isComplete(): boolean {\n      const all = [...claims.values()]\n      if (all.length === 0) return false\n      const everyClaimSettled = all.every((claim) => isCorroborated(claim) || claim.contested)\n      const everyQuestionAddressed = [...questions.values()].every((question) => question.addressed)\n      return everyClaimSettled && everyQuestionAddressed\n    },\n\n    lastSteer(): ResearchDrivingSteer | undefined {\n      return lastSteer\n    },\n  }\n\n  // -- claim extraction ------------------------------------------------------\n\n  async function extractClaims(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n  ): Promise<ExtractedClaim[]> {\n    const ledger = [...claims.values()]\n    const fromLlm = await extractClaimsWithLlm(source, ctx, ledger)\n    if (fromLlm.length > 0) return fromLlm.slice(0, maxClaimsPerSource)\n    if (deterministicFallback) return deterministicClaims(source).slice(0, maxClaimsPerSource)\n    return []\n  }\n\n  async function extractClaimsWithLlm(\n    source: ResearchSourceProposal,\n    ctx: SourceVerificationContext,\n    ledger: TrackedClaim[],\n  ): Promise<ExtractedClaim[]> {\n    let router: RouterClient\n    try {\n      router = resolveRouter()\n    } catch {\n      return []\n    }\n    const excerpt = source.text.slice(0, 1800)\n    const ledgerLines = ledger\n      .slice(0, 20)\n      .map((claim) => `- [${claim.id}] ${claim.text}`)\n      .join('\\n')\n    const system =\n      'You extract the KEY factual claims a researcher would cite a page for, and flag ' +\n      'CONTRADICTIONS with claims already on the ledger. ' +\n      \"A claim is one concrete, checkable assertion using the page's own terms and numbers. \" +\n      'Return ONLY a JSON array; each item is {\"claim\": string, \"contradicts\": string|null} where ' +\n      'contradicts is the bracketed [id] of a ledger claim this page DIRECTLY contradicts, else null. ' +\n      `Return at most ${maxClaimsPerSource} claims. No prose.`\n    const user = [\n      `Research goal: ${ctx.goal}`,\n      `Page title: ${source.title ?? '(none)'}`,\n      ledgerLines ? `Claims already on the ledger:\\n${ledgerLines}` : 'Ledger is empty.',\n      `Page excerpt:\\n${excerpt}`,\n      'Key claims as JSON [{\"claim\": \"...\", \"contradicts\": \"[id]\"|null}]:',\n    ].join('\\n\\n')\n\n    let raw = ''\n    try {\n      raw = await router.chat(\n        [\n          { role: 'system', content: system },\n          { role: 'user', content: user },\n        ],\n        1200,\n      )\n    } catch {\n      return []\n    }\n    return parseExtractedClaims(raw, ledger)\n  }\n\n  /**\n   * Deterministic fallback: pull the leading sentences as candidate claims. Used\n   * only when the model is unavailable, so the driver still drives (and the\n   * offline test runs with no creds). Each sentence becomes a checkable claim.\n   */\n  function deterministicClaims(source: ResearchSourceProposal): ExtractedClaim[] {\n    const sentences = source.text\n      .split(/(?<=[.!?])\\s+/)\n      .map((sentence) => sentence.trim())\n      .filter((sentence) => contentWordSet(sentence).size >= 3)\n    return sentences.slice(0, maxClaimsPerSource).map((text) => ({ text }))\n  }\n\n  // -- deep-question synthesis ----------------------------------------------\n\n  /**\n   * Build the four deep-question kinds from the actual ledger claims. This is\n   * intentionally deterministic (not an LLM call): the loop's `foldGaps` contract\n   * is synchronous (`foldGaps(gaps): string`), and a template grounded in the\n   * real claim text gives a faithful, non-fabricated sub-question every round —\n   * comparative, mechanism, gap, and contradiction. Claim EXTRACTION, which runs\n   * inside the awaited `verifySource`, is where the model does the open-ended\n   * work; question generation just interrogates what was extracted.\n   */\n  function synthesizeDeepQuestions(ledger: TrackedClaim[], round: number): DeepQuestion[] {\n    if (ledger.length === 0) return []\n    const out: DeepQuestion[] = []\n\n    // CONTRADICTION questions: for every contradiction edge, ask the worker to\n    // find evidence that resolves which claim holds.\n    for (const claim of ledger) {\n      for (const otherId of claim.contradicts) {\n        const other = ledger.find((entry) => entry.id === otherId)\n        if (!other || other.id < claim.id) continue // emit each pair once\n        out.push(\n          makeQuestion(\n            'contradiction',\n            `Does any independent source resolve the contradiction between \"${truncate(claim.text)}\" and \"${truncate(other.text)}\"? Find evidence that confirms or refutes one of them.`,\n            [claim.id, other.id],\n            round,\n          ),\n        )\n      }\n    }\n\n    // GAP questions: for each weakly-supported claim, ask for the specific\n    // corroborating result that is missing.\n    for (const claim of ledger.filter((entry) => !entry.contested)) {\n      if (claim.supportingHosts.size < minIndependentSources) {\n        out.push(\n          makeQuestion(\n            'gap',\n            `Only one independent source supports \"${truncate(claim.text)}\". What specific corroborating result, dataset, or independent measurement is missing to confirm it?`,\n            [claim.id],\n            round,\n          ),\n        )\n      }\n    }\n\n    // MECHANISM questions: for the best-supported claims, probe the failure\n    // boundary — under what precise condition does the asserted effect break.\n    for (const claim of [...ledger]\n      .sort((a, b) => b.supportingHosts.size - a.supportingHosts.size)\n      .slice(0, 2)) {\n      out.push(\n        makeQuestion(\n          'mechanism',\n          `Under what precise condition does \"${truncate(claim.text)}\" stop holding? Find a source that states the mechanism, limit, or failure mode.`,\n          [claim.id],\n          round,\n        ),\n      )\n    }\n\n    // COMPARATIVE questions: pair the two most-supported claims and ask how their\n    // tradeoffs differ.\n    const ranked = [...ledger].sort((a, b) => b.supportingHosts.size - a.supportingHosts.size)\n    if (ranked.length >= 2 && ranked[0] && ranked[1]) {\n      out.push(\n        makeQuestion(\n          'comparative',\n          `How does the tradeoff in \"${truncate(ranked[0].text)}\" differ from \"${truncate(ranked[1].text)}\"? Find a source that compares them directly.`,\n          [ranked[0].id, ranked[1].id],\n          round,\n        ),\n      )\n    }\n\n    // Stable order: contradiction → gap → mechanism → comparative (most urgent\n    // validation work first).\n    const priority: Record<DeepQuestionKind, number> = {\n      contradiction: 0,\n      gap: 1,\n      mechanism: 2,\n      comparative: 3,\n    }\n    return out.sort((a, b) => priority[a.kind] - priority[b.kind])\n  }\n}\n\n// ---------------------------------------------------------------------------\n// pure helpers\n// ---------------------------------------------------------------------------\n\nfunction makeQuestion(\n  kind: DeepQuestionKind,\n  text: string,\n  claimIds: string[],\n  raisedRound: number,\n): DeepQuestion {\n  return {\n    kind,\n    text,\n    id: `q_${sha256(`${kind}:${text}`).slice(0, 16)}`,\n    claimIds,\n    addressed: false,\n    raisedRound,\n  }\n}\n\n/** Claim identity = sha256 of the normalized claim text (same words ⇒ same claim). */\nfunction claimId(text: string): string {\n  return `c_${sha256(normalizeText(text)).slice(0, 16)}`\n}\n\nfunction hostOf(uri: string): string {\n  try {\n    return new URL(uri.trim()).hostname.toLowerCase().replace(/^www\\./, '')\n  } catch {\n    // Non-URL identifier (offline corpus uris like `web/foo`): canonicalize so\n    // distinct identifiers still count as distinct independent sources.\n    return canonicalizeUrl(uri)\n  }\n}\n\nfunction normalizeText(text: string): string {\n  return text\n    .toLowerCase()\n    .replace(/[^\\p{L}\\p{N}\\s]+/gu, ' ')\n    .replace(/\\s+/g, ' ')\n    .trim()\n}\n\nconst stopwords = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'but',\n  'of',\n  'to',\n  'in',\n  'on',\n  'for',\n  'with',\n  'as',\n  'by',\n  'at',\n  'from',\n  'that',\n  'this',\n  'these',\n  'those',\n  'it',\n  'its',\n  'is',\n  'are',\n  'was',\n  'were',\n  'be',\n  'been',\n  'being',\n  'has',\n  'have',\n  'had',\n  'can',\n  'will',\n  'would',\n  'should',\n  'may',\n  'might',\n  'not',\n  'no',\n  'than',\n  'then',\n  'over',\n  'under',\n  'about',\n  'into',\n  'their',\n  'they',\n  'them',\n])\n\nfunction contentWordSet(text: string): Set<string> {\n  return new Set(\n    normalizeText(text)\n      .split(' ')\n      .filter((word) => word.length >= 3 && !stopwords.has(word)),\n  )\n}\n\nfunction overlapFraction(a: Set<string>, b: Set<string>): number {\n  if (a.size === 0) return 0\n  let hits = 0\n  for (const word of a) if (b.has(word)) hits += 1\n  return hits / a.size\n}\n\nfunction truncate(text: string, max = 140): string {\n  const t = text.trim().replace(/\\s+/g, ' ')\n  return t.length <= max ? t : `${t.slice(0, max - 1)}…`\n}\n\n/**\n * Parse the extractor's JSON array of `{claim, contradicts}` items, tolerant of\n * code fences / surrounding prose. `contradicts` is mapped from a `[id]` token to\n * a ledger claim id only when that id is actually on the ledger.\n */\nfunction parseExtractedClaims(raw: string, ledger: TrackedClaim[]): ExtractedClaim[] {\n  const text = raw.trim()\n  if (!text) return []\n  const arrayMatch = text.match(/\\[[\\s\\S]*\\]/)\n  if (!arrayMatch) return []\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(arrayMatch[0])\n  } catch {\n    return []\n  }\n  if (!Array.isArray(parsed)) return []\n  const ledgerIds = new Set(ledger.map((claim) => claim.id))\n  const out: ExtractedClaim[] = []\n  for (const item of parsed) {\n    if (!item || typeof item !== 'object') continue\n    const record = item as { claim?: unknown; contradicts?: unknown }\n    if (typeof record.claim !== 'string' || !record.claim.trim()) continue\n    const contradictsId = extractBracketId(record.contradicts)\n    out.push({\n      text: record.claim.trim(),\n      contradictsExistingId:\n        contradictsId && ledgerIds.has(contradictsId) ? contradictsId : undefined,\n    })\n  }\n  return out\n}\n\n/** Pull a ledger id out of a `contradicts` field: `\"[c_abc]\"` or `\"c_abc\"`. */\nfunction extractBracketId(value: unknown): string | undefined {\n  if (typeof value !== 'string') return undefined\n  const trimmed = value.trim()\n  if (!trimmed || trimmed.toLowerCase() === 'null') return undefined\n  const bracket = trimmed.match(/\\[([^\\]]+)\\]/)\n  const id = (bracket?.[1] ?? trimmed).trim()\n  return id.startsWith('c_') ? id : undefined\n}\n\n/**\n * Build the steer string handed to the worker's next prompt. Interleaves the\n * readiness gaps the loop still reports with the deep sub-questions and the\n * invalidation challenges — the part that drives DEPTH + VALIDATION.\n */\nfunction buildSteerText(\n  gaps: KnowledgeGap[],\n  deepQuestions: DeepQuestion[],\n  invalidationTargets: TrackedClaim[],\n  minIndependentSources: number,\n): string {\n  const lines: string[] = []\n  lines.push(\n    'Do NOT just add more sources. Go DEEPER and VALIDATE. Address the following before adding breadth:',\n  )\n\n  if (deepQuestions.length > 0) {\n    lines.push('', 'Deep sub-questions to answer this round:')\n    for (const question of deepQuestions) {\n      lines.push(`- (${question.kind}) ${question.text}`)\n    }\n  }\n\n  if (invalidationTargets.length > 0) {\n    lines.push(\n      '',\n      `Claims needing corroboration or refutation (each must reach >= ${minIndependentSources} INDEPENDENT sources, or be shown contested):`,\n    )\n    for (const claim of invalidationTargets) {\n      const reason =\n        claim.contradicts.size > 0\n          ? 'CONTRADICTED by another source — find evidence that resolves it'\n          : `only ${claim.supportingHosts.size} independent source — find a SECOND, independent corroborating source`\n      lines.push(`- \"${truncate(claim.text)}\" — ${reason}`)\n    }\n  }\n\n  if (gaps.length > 0) {\n    lines.push('', 'Readiness gaps still open:')\n    for (const gap of gaps) {\n      lines.push(`- (${gap.blocking ? 'blocking' : 'soft'}) ${gap.description} [${gap.id}]`)\n    }\n  }\n\n  return lines.join('\\n')\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6CA,IAAM,gBAAgB;AAEtB,IAAM,mBAAmB;AAMzB,IAAM,iBAAiB;AAgEvB,IAAM,oBAAoB,oBAAI,IAAI,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AAQtD,eAAe,eACb,KACA,MACA,MACmB;AACnB,MAAI;AACJ,WAAS,UAAU,GAAG,WAAW,KAAK,YAAY,WAAW,GAAG;AAC9D,QAAI,KAAK,QAAQ,QAAS,OAAM,IAAI,YAAY,GAAG,SAAS;AAC5D,UAAM,MAAM,MAAM,MAAM,KAAK,IAAI;AACjC,QAAI,IAAI,MAAM,CAAC,kBAAkB,IAAI,IAAI,MAAM,EAAG,QAAO;AACzD,cAAU;AACV,QAAI,YAAY,KAAK,WAAY;AAEjC,UAAM,IAAI,KAAK,EAAE,MAAM,MAAM,EAAE;AAC/B,UAAM,UAAU,KAAK,cAAc,KAAK;AACxC,UAAM,SAAS,WAAW,OAAO,KAAK,OAAO,IAAI;AACjD,UAAM,IAAI,QAAQ,CAACA,aAAY,WAAWA,UAAS,MAAM,CAAC;AAAA,EAC5D;AAGA,MAAI,QAAS,QAAO;AACpB,QAAM,IAAI,YAAY,GAAG,qCAAqC;AAChE;AAGO,IAAM,cAAN,cAA0B,MAAM;AAAA,EACrC,YACkB,QAChB,SACA;AACA,UAAM,UAAU,MAAM,KAAK,OAAO,EAAE;AAHpB;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;AAOO,SAAS,yBAAyB,UAA+B,CAAC,GAAiB;AACxF,QAAM,WAAW,QAAQ,WAAW,kBAAkB,QAAQ,OAAO,EAAE;AACvE,QAAM,SAAS,QAAQ,UAAU,QAAQ,IAAI;AAC7C,MAAI,CAAC,QAAQ;AACX,UAAM,IAAI,YAAY,KAAK,oDAAoD;AAAA,EACjF;AACA,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,aAAa,KAAK,IAAI,GAAG,QAAQ,cAAc,CAAC;AACtD,QAAM,cAAc,KAAK,IAAI,GAAG,QAAQ,eAAe,IAAI;AAC3D,QAAM,UAAU;AAAA,IACd,gBAAgB;AAAA,IAChB,eAAe,UAAU,MAAM;AAAA,EACjC;AAGA,QAAM,QAAQ,EAAE,QAAQ,OAAO,KAAW,YAAY,IAAM,IAAU;AACtE,QAAM,MAAmB;AAAA,IACvB,WAAW;AAAA,IACX,aAAa;AAAA,IACb,cAAc;AAAA,IACd,kBAAkB;AAAA,IAClB,KAAK;AAAA,IACL,QAAQ;AAAA,EACV;AAEA,SAAO;AAAA,IACL,MAAM,OAAO,OAAO,MAAM;AACxB,YAAM,KAAK,KAAK,IAAI;AACpB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO;AAAA,QACV;AAAA,UACE,QAAQ;AAAA,UACR;AAAA,UACA,QAAQ,QAAQ;AAAA,UAChB,MAAM,KAAK,UAAU;AAAA,YACnB;AAAA,YACA,GAAI,QAAQ,iBAAiB,EAAE,UAAU,QAAQ,eAAe,IAAI,CAAC;AAAA,YACrE,GAAI,MAAM,cAAc,OAAO,EAAE,YAAY,KAAK,WAAW,IAAI,CAAC;AAAA,UACpE,CAAC;AAAA,QACH;AAAA,QACA,EAAE,YAAY,aAAa,QAAQ,QAAQ,OAAO;AAAA,MACpD;AACA,UAAI,eAAe;AACnB,UAAI,UAAU,KAAK,IAAI,IAAI;AAC3B,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,IAAI,YAAY,IAAI,QAAQ,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI,UAAU,CAAC;AAAA,MAChF;AACA,YAAM,OAAQ,MAAM,IAAI,KAAK;AAC7B,cAAQ,KAAK,QAAQ,CAAC,GACnB,OAAO,CAAC,QAAQ,OAAO,KAAK,QAAQ,YAAY,IAAI,IAAI,SAAS,CAAC,EAClE,IAAI,CAAC,SAAS,EAAE,OAAO,IAAI,SAAS,IAAI,KAAK,KAAK,IAAI,KAAK,SAAS,IAAI,QAAQ,EAAE;AAAA,IACvF;AAAA,IACA,MAAM,KAAK,UAAU,WAAW;AAG9B,YAAM,aAAa,KAAK,IAAI,gBAAgB,aAAa,cAAc;AACvE,YAAM,KAAK,KAAK,IAAI;AACpB,YAAM,MAAM,MAAM;AAAA,QAChB,GAAG,OAAO;AAAA,QACV;AAAA,UACE,QAAQ;AAAA,UACR;AAAA,UACA,QAAQ,QAAQ;AAAA,UAChB,MAAM,KAAK,UAAU,EAAE,OAAO,UAAU,YAAY,aAAa,KAAK,QAAQ,MAAM,CAAC;AAAA,QACvF;AAAA,QACA,EAAE,YAAY,aAAa,QAAQ,QAAQ,OAAO;AAAA,MACpD;AACA,UAAI,CAAC,IAAI,IAAI;AACX,cAAM,IAAI,YAAY,IAAI,QAAQ,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM,IAAI,UAAU,CAAC;AAAA,MAChF;AACA,YAAM,OAAQ,MAAM,IAAI,KAAK;AAI7B,YAAM,eAAe,KAAK,OAAO,iBAAiB;AAClD,YAAM,mBAAmB,KAAK,OAAO,qBAAqB;AAC1D,UAAI,aAAa;AACjB,UAAI,gBAAgB;AACpB,UAAI,oBAAoB;AACxB,UAAI,OAAO,eAAe,MAAM,SAAS,mBAAmB,MAAM;AAClE,UAAI,UAAU,KAAK,IAAI,IAAI;AAC3B,aAAO,KAAK,UAAU,CAAC,GAAG,SAAS,WAAW;AAAA,IAChD;AAAA,IACA,QAAQ;AACN,aAAO,EAAE,GAAG,IAAI;AAAA,IAClB;AAAA,EACF;AACF;AAqBA,SAAS,cAAc,MAGN;AACf,SAAO,KAAK,UAAU,yBAAyB,KAAK,cAAc;AACpE;AAOO,SAAS,wBAAwB,UAAoC,CAAC,GAAmB;AAC9F,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAC5D,QAAM,kBAAkB,KAAK,IAAI,GAAG,QAAQ,mBAAmB,CAAC;AAChE,QAAM,qBAAqB,KAAK,IAAI,GAAG,QAAQ,sBAAsB,CAAC;AACtE,QAAM,eAAe,KAAK,IAAI,GAAG,QAAQ,gBAAgB,GAAG;AAC5D,QAAM,eAAe,KAAK,IAAI,cAAc,QAAQ,gBAAgB,GAAI;AAExE,SAAO,OAAO,QAA8D;AAC1E,UAAM,SAAS,cAAc,OAAO;AAEpC,UAAM,aAAa,IAAI,KAAK,OAAO,CAAC,QAAQ,IAAI,QAAQ;AACxD,UAAM,OAAO,WAAW,SAAS,IAAI,aAAa,IAAI;AACtD,QAAI,KAAK,WAAW,GAAG;AACrB,aAAO,EAAE,SAAS,CAAC,GAAG,OAAO,2BAA2B;AAAA,IAC1D;AAEA,UAAM,UAAU,MAAM,kBAAkB,QAAQ,KAAK,MAAM,aAAa;AACxE,UAAM,YAAsC,CAAC;AAC7C,UAAM,WAAW,oBAAI,IAAY;AAEjC,eAAW,SAAS,SAAS;AAC3B,UAAI,UAAU,UAAU,mBAAoB;AAC5C,UAAI,IAAI,QAAQ,QAAS;AACzB,UAAI;AACJ,UAAI;AACF,eAAO,MAAM,OAAO,OAAO,OAAO,EAAE,YAAY,gBAAgB,CAAC;AAAA,MACnE,SAAS,OAAO;AAEd,YAAK,MAA4B,SAAS,aAAc;AACxD;AAAA,MACF;AACA,iBAAW,OAAO,MAAM;AACtB,YAAI,UAAU,UAAU,mBAAoB;AAC5C,YAAI,SAAS,IAAI,IAAI,GAAG,EAAG;AAC3B,cAAM,UAAU,MAAM,YAAY,IAAI,KAAK;AAAA,UACzC,QAAQ,IAAI;AAAA,UACZ,UAAU,QAAQ;AAAA,QACpB,CAAC;AACD,YAAI,CAAC,QAAQ,WAAY;AACzB,cAAM,OAAO,WAAW,QAAQ,IAAI,EAAE,MAAM,GAAG,YAAY;AAC3D,YAAI,KAAK,SAAS,aAAc;AAChC,iBAAS,IAAI,IAAI,GAAG;AACpB,kBAAU,KAAK;AAAA,UACb,KAAK,IAAI;AAAA,UACT,OAAO,IAAI,SAAS,IAAI;AAAA,UACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,UAOA,gBAAgB,QAAQ;AAAA,UACxB,UAAU;AAAA,YACR,eAAe;AAAA,YACf,SAAS,IAAI,WAAW;AAAA,YACxB,MAAM,IAAI;AAAA,YACV,iBAAiB,QAAQ;AAAA,UAC3B;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,MACL,SAAS;AAAA,MACT,YAAY,iBAAiB,SAAS;AAAA,MACtC,OAAO,wBAAwB,QAAQ,MAAM,mBAAc,UAAU,MAAM;AAAA,IAC7E;AAAA,EACF;AACF;AAOA,eAAe,kBACb,QACA,KACA,MACA,eACmB;AACnB,QAAM,WAAW,KACd,IAAI,CAAC,KAAK,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,WAAW,uBAAuB,IAAI,KAAK,IAAI,EAChF,KAAK,IAAI;AACZ,QAAM,OAAO,KAAK,SAAS;AAC3B,QAAM,SACJ;AAGF,QAAM,OAAO;AAAA,IACX,kBAAkB,IAAI,IAAI;AAAA,IAC1B,IAAI,QAAQ;AAAA,EAAgC,IAAI,KAAK,KAAK;AAAA,IAC1D;AAAA,EAAyB,QAAQ;AAAA,IACjC,gBAAgB,IAAI;AAAA,EACtB,EACG,OAAO,OAAO,EACd,KAAK,MAAM;AAEd,MAAI,MAAM;AACV,MAAI;AACF,UAAM,MAAM,OAAO;AAAA,MACjB;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,QAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,MAChC;AAAA,MACA;AAAA,IACF;AAAA,EACF,QAAQ;AACN,UAAM;AAAA,EACR;AACA,QAAM,SAAS,eAAe,GAAG;AACjC,QAAM,UAAU,OAAO,MAAM,GAAG,IAAI;AACpC,MAAI,QAAQ,SAAS,EAAG,QAAO,cAAc,OAAO;AAEpD,SAAO,cAAc,KAAK,IAAI,CAAC,QAAQ,IAAI,SAAS,IAAI,WAAW,CAAC;AACtE;AAGA,SAAS,eAAe,KAAuB;AAC7C,QAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,QAAM,aAAuB,CAAC;AAE9B,QAAM,aAAa,KAAK,MAAM,aAAa;AAC3C,MAAI,YAAY;AACd,QAAI;AACF,YAAM,MAAM,KAAK,MAAM,WAAW,CAAC,CAAC;AACpC,iBAAW,QAAQ;AACjB,YAAI,OAAO,SAAS,YAAY,KAAK,KAAK,EAAG,YAAW,KAAK,KAAK,KAAK,CAAC;AAAA,IAC5E,QAAQ;AAAA,IAER;AAAA,EACF;AACA,MAAI,WAAW,WAAW,GAAG;AAC3B,eAAW,QAAQ,KAAK,MAAM,IAAI,GAAG;AACnC,YAAM,UAAU,KACb,QAAQ,2BAA2B,EAAE,EACrC,QAAQ,gBAAgB,EAAE,EAC1B,KAAK;AACR,UAAI,WAAW,QAAQ,SAAS,KAAK,CAAC,QAAQ,WAAW,GAAG,EAAG,YAAW,KAAK,OAAO;AAAA,IACxF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,QAA4B;AACjD,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,MAAgB,CAAC;AACvB,aAAW,SAAS,QAAQ;AAC1B,UAAM,MAAM,MAAM,YAAY,EAAE,KAAK;AACrC,QAAI,OAAO,CAAC,KAAK,IAAI,GAAG,GAAG;AACzB,WAAK,IAAI,GAAG;AACZ,UAAI,KAAK,MAAM,KAAK,CAAC;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAOA,SAAS,iBACP,WACyD;AACzD,SAAO,CAAC,oBAAoB;AAC1B,QAAI,gBAAgB,WAAW,EAAG,QAAO;AACzC,UAAM,SAAS,gBAAgB,IAAI,CAAC,WAAW;AAC7C,YAAM,WAAW,UAAU,KAAK,CAAC,MAAM,EAAE,QAAQ,OAAO,UAAU,WAAW;AAC7E,YAAM,MAAM,UAAU,OAAO,OAAO;AACpC,YAAM,OACJ,IACG,QAAQ,gBAAgB,EAAE,EAC1B,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,YAAY,EAAE,EACtB,MAAM,GAAG,GAAG,KAAK,OAAO;AAC7B,YAAM,QAAQ,UAAU,SAAS,OAAO;AACxC,YAAM,OAAO,UAAU,QAAQ;AAC/B,aAAO;AAAA,QACL,sBAAsB,IAAI;AAAA,QAC1B;AAAA,QACA,UAAU,WAAW,KAAK,CAAC;AAAA,QAC3B,cAAc,OAAO,EAAE;AAAA,QACvB,eAAe,GAAG;AAAA,QAClB;AAAA,QACA,KAAK,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA,WAAW,GAAG;AAAA,QACd;AAAA,MACF,EAAE,KAAK,IAAI;AAAA,IACb,CAAC;AACD,WAAO,OAAO,KAAK,IAAI;AAAA,EACzB;AACF;AAEA,SAAS,WAAW,OAAuB;AAGzC,SAAO,MACJ,QAAQ,YAAY,GAAG,EACvB,QAAQ,MAAM,GAAG,EACjB,KAAK;AACV;AAuBO,SAAS,8BACd,UAAkC,CAAC,GACnB;AAChB,QAAM,uBAAuB,QAAQ,wBAAwB;AAC7D,SAAO;AAAA,IACL,MAAM,aACJ,QACA,KACwB;AACxB,YAAM,SAAS,cAAc,OAAO;AACpC,YAAM,WAAW,IAAI,KAClB,IAAI,CAAC,QAAQ,KAAK,IAAI,WAAW,aAAa,IAAI,KAAK,IAAI,EAC3D,KAAK,IAAI;AACZ,YAAM,iBAAiB,IAAI,kBACxB,IAAI,CAAC,aAAa,KAAK,SAAS,SAAS,SAAS,GAAG,EAAE,EACvD,KAAK,IAAI;AACZ,YAAM,UAAU,OAAO,KAAK,MAAM,GAAG,IAAI;AACzC,YAAM,SACJ;AAKF,YAAM,OAAO;AAAA,QACX,kBAAkB,IAAI,IAAI;AAAA,QAC1B;AAAA,EAAe,YAAY,kBAAkB;AAAA,QAC7C,iBACI;AAAA,EAAiC,cAAc,KAC/C;AAAA,QACJ;AAAA,OAA2B,OAAO,GAAG;AAAA,SAAY,OAAO,SAAS,QAAQ;AAAA;AAAA,EAAe,OAAO;AAAA,QAC/F;AAAA,MACF,EAAE,KAAK,MAAM;AAEb,UAAI,MAAM;AACV,UAAI;AACF,cAAM,MAAM,OAAO;AAAA,UACjB;AAAA,YACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,YAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,UAChC;AAAA,UACA;AAAA,QACF;AAAA,MACF,SAAS,OAAO;AACd,YAAK,MAA4B,SAAS,aAAc,OAAM;AAE9D,eAAO,uBACH,EAAE,QAAQ,KAAK,IACf,EAAE,QAAQ,OAAO,QAAQ,yBAA0B,MAAgB,OAAO,GAAG;AAAA,MACnF;AAEA,YAAM,UAAU,aAAa,GAAG;AAChC,UAAI,QAAS,QAAO;AACpB,aAAO,uBACH,EAAE,QAAQ,KAAK,IACf,EAAE,QAAQ,OAAO,QAAQ,2CAA2C;AAAA,IAC1E;AAAA,EACF;AACF;AAGA,SAAS,aAAa,KAAmC;AACvD,QAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,KAAM,QAAO;AAClB,QAAM,WAAW,KAAK,MAAM,aAAa;AACzC,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,SAAS,CAAC,CAAC;AACrC,QAAI,OAAO,OAAO,WAAW,UAAW,QAAO;AAC/C,QAAI,OAAO,OAAQ,QAAO,EAAE,QAAQ,KAAK;AACzC,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,QACE,OAAO,OAAO,WAAW,YAAY,OAAO,OAAO,KAAK,IACpD,OAAO,OAAO,KAAK,IACnB;AAAA,IACR;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;ACvhBO,SAAS,gBAAgB,KAAqB;AACnD,QAAM,UAAU,IAAI,KAAK;AACzB,MAAI;AACF,UAAM,MAAM,IAAI,IAAI,OAAO;AAC3B,UAAM,OAAO,IAAI,SAAS,YAAY,EAAE,QAAQ,UAAU,EAAE;AAE5D,UAAM,OAA2B,CAAC;AAClC,eAAW,CAAC,KAAK,KAAK,KAAK,IAAI,cAAc;AAC3C,YAAM,QAAQ,IAAI,YAAY;AAC9B,UAAI,MAAM,WAAW,MAAM,EAAG;AAC9B,UAAI,eAAe,IAAI,KAAK,EAAG;AAC/B,WAAK,KAAK,CAAC,KAAK,KAAK,CAAC;AAAA,IACxB;AACA,SAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAE;AACpD,UAAM,QAAQ,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,GAAG;AACxD,UAAM,OAAO,IAAI,SAAS,QAAQ,QAAQ,EAAE,KAAK;AACjD,WAAO,GAAG,IAAI,GAAG,IAAI,GAAG,QAAQ,IAAI,KAAK,KAAK,EAAE;AAAA,EAClD,QAAQ;AACN,WAAO,QAAQ,YAAY;AAAA,EAC7B;AACF;AAGA,IAAM,iBAAiB,oBAAI,IAAI;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAQM,SAAS,WAAW,MAAsB;AAC/C,QAAM,aAAa,KAChB,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACR,SAAO,OAAO,UAAU;AAC1B;AAoEA,IAAM,4BAA4B;AAAA,EAChC;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;AAGA,IAAM,sBAAsB;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAQO,SAAS,aACd,QACA,SAMyC;AACzC,QAAM,kBAAkB,GAAG,OAAO,SAAS,EAAE,IAC3C,OAAO,OAAO,UAAU,YAAY,WAAW,OAAO,SAAS,UAAU,EAC3E,GAAG,KAAK;AACR,QAAM,UAAU,OAAO,KAAK,KAAK,EAAE;AAInC,aAAW,WAAW,QAAQ,cAAc;AAC1C,QAAI,QAAQ,KAAK,eAAe,GAAG;AACjC,aAAO,EAAE,QAAQ,QAAQ,QAAQ,wBAAwB,QAAQ,MAAM,IAAI;AAAA,IAC7E;AAAA,EACF;AACA,MAAI,UAAU,QAAQ,cAAc;AAClC,WAAO,EAAE,QAAQ,QAAQ,QAAQ,cAAc,OAAO,MAAM,QAAQ,YAAY,UAAU;AAAA,EAC5F;AAIA,QAAM,OAAO,OAAO,OAAO,GAAG;AAC9B,QAAM,gBACJ,KAAK,SAAS,KAAK,QAAQ,mBAAmB,KAAK,CAAC,WAAW,YAAY,MAAM,MAAM,CAAC;AAC1F,MAAI,iBAAiB,WAAW,QAAQ,sBAAsB;AAC5D,WAAO,EAAE,QAAQ,QAAQ,QAAQ,sBAAsB,IAAI,wBAAwB,OAAO,IAAI;AAAA,EAChG;AAIA,SAAO,EAAE,QAAQ,aAAa,QAAQ,gBAAgB,QAAQ,QAAQ,UAAU,OAAO,SAAS;AAClG;AAEA,SAAS,OAAO,KAAqB;AACnC,MAAI;AACF,WAAO,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,SAAS,YAAY,EAAE,QAAQ,UAAU,EAAE;AAAA,EACxE,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,SAAS,YAAY,MAAc,QAAyB;AAC1D,MAAI,OAAO,WAAW,GAAG,EAAG,QAAO,KAAK,SAAS,MAAM,KAAK,SAAS,OAAO,MAAM,CAAC;AACnF,SAAO,SAAS,UAAU,KAAK,SAAS,IAAI,MAAM,EAAE;AACtD;AAqBO,SAAS,6BACd,UAAiC,CAAC,GACV;AACxB,QAAM,qBAAqB,QAAQ,sBAAsB;AACzD,QAAM,eAAe,QAAQ,gBAAgB;AAC7C,QAAM,eAAe,KAAK,IAAI,GAAG,QAAQ,gBAAgB,GAAG;AAC5D,QAAM,uBAAuB,KAAK,IAAI,cAAc,QAAQ,wBAAwB,GAAG;AAGvF,QAAM,YAAY,8BAA8B;AAAA,IAC9C,QAAQ,QAAQ;AAAA,IAChB,gBAAgB,QAAQ;AAAA,IACxB,sBAAsB,QAAQ,WAAW;AAAA,EAC3C,CAAC;AAGD,QAAM,kBAAkB,oBAAI,IAAY;AACxC,QAAM,sBAAsB,oBAAI,IAAY;AAE5C,QAAM,QAAuB;AAAA,IAC3B,OAAO;AAAA,IACP,eAAe;AAAA,IACf,eAAe;AAAA,IACf,kBAAkB;AAAA,IAClB,UAAU;AAAA,IACV,aAAa;AAAA,IACb,WAAW,CAAC;AAAA,EACd;AAEA,WAAS,OAAO,UAAkC;AAChD,UAAM,UAAU,KAAK,QAAQ;AAC7B,YAAQ,aAAa,QAAQ;AAAA,EAC/B;AAEA,SAAO;AAAA,IACL,MAAM,aAAa,QAAQ,KAA6B;AACtD,YAAM,SAAS;AACf,YAAM,SAAS,gBAAgB,OAAO,GAAG;AACzC,YAAM,OAAO,WAAW,OAAO,IAAI;AAMnC,YAAM,eAAe,IAAI;AAAA,QACvB,IAAI,kBAAkB,IAAI,CAAC,aAAa,gBAAgB,SAAS,GAAG,CAAC;AAAA,MACvE;AACA,YAAM,mBAAmB,IAAI;AAAA,QAC3B,IAAI,kBAAkB,IAAI,CAAC,aAAa,WAAW,SAAS,IAAI,CAAC;AAAA,MACnE;AACA,YAAM,eAAe,IAAI;AAAA,QACvB,IAAI,MAAM,QAAQ;AAAA,UAAQ,CAAC,YACzB,OAAO,QAAQ,UAAU,gBAAgB,WACrC,CAAC,gBAAgB,QAAQ,SAAS,WAAW,CAAC,IAC9C,CAAC;AAAA,QACP;AAAA,MACF;AACA,YAAM,SACJ,gBAAgB,IAAI,MAAM,KAAK,aAAa,IAAI,MAAM,KAAK,aAAa,IAAI,MAAM;AACpF,YAAM,aAAa,oBAAoB,IAAI,IAAI,KAAK,iBAAiB,IAAI,IAAI;AAC7E,UAAI,UAAU,YAAY;AACxB,cAAM,iBAAiB;AACvB,cAAMC,UAAsB,SAAS,kBAAkB;AACvD,eAAO,EAAE,KAAK,OAAO,KAAK,OAAO,SAAS,UAAU,OAAO,QAAAA,QAAO,CAAC;AACnE,eAAO,EAAE,QAAQ,OAAO,QAAQ,UAAUA,OAAM,GAAG;AAAA,MACrD;AAGA,YAAM,EAAE,QAAQ,OAAO,IAAI,aAAa,QAAQ;AAAA,QAC9C;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AACD,UAAI,WAAW,QAAQ;AACrB,cAAM,iBAAiB;AACvB,wBAAgB,IAAI,MAAM;AAC1B,4BAAoB,IAAI,IAAI;AAC5B,eAAO,EAAE,KAAK,OAAO,KAAK,OAAO,aAAa,UAAU,MAAM,QAAQ,OAAO,CAAC;AAC9E,eAAO,EAAE,QAAQ,KAAK;AAAA,MACxB;AACA,UAAI,WAAW,QAAQ;AACrB,cAAM,oBAAoB;AAC1B,eAAO,EAAE,KAAK,OAAO,KAAK,OAAO,aAAa,UAAU,OAAO,QAAQ,OAAO,CAAC;AAC/E,eAAO,EAAE,QAAQ,OAAO,QAAQ,mBAAmB,MAAM,GAAG;AAAA,MAC9D;AAGA,YAAM,YAAY;AAClB,YAAM,UAAU,MAAM,UAAU,aAAa,QAAQ,GAAG;AACxD,UAAI,QAAQ,QAAQ;AAClB,cAAM,eAAe;AACrB,wBAAgB,IAAI,MAAM;AAC1B,4BAAoB,IAAI,IAAI;AAAA,MAC9B;AACA,aAAO;AAAA,QACL,KAAK,OAAO;AAAA,QACZ,OAAO;AAAA,QACP,UAAU,QAAQ;AAAA,QAClB;AAAA,QACA,QAAQ,QAAQ,SAAS,iBAAiB,QAAQ;AAAA,MACpD,CAAC;AACD,aAAO;AAAA,IACT;AAAA,IACA,QAAuB;AACrB,aAAO;AAAA,QACL,GAAG;AAAA,QACH,WAAW,CAAC,GAAG,MAAM,SAAS;AAAA,MAChC;AAAA,IACF;AAAA,EACF;AACF;;;AChZA;AAAA,EAEE,sBAAAC;AAAA,OACK;;;ACHP,SAAS,kBAAkB;AAC3B,SAAS,IAAI,OAAO,OAAO,SAAS,IAAI,YAAY;AACpD,SAAS,cAAc;AACvB,SAAS,SAAS,YAAY,MAAM,UAAU,SAAS,WAAW;AAClE;AAAA,EACE;AAAA,EACA;AAAA,EAEA;AAAA,OACK;AACP;AAAA,EAGE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA;AAAA,OACK;AACP,SAAS,SAAS;;;ACgCX,IAAM,gBAAgB;AAGtB,SAAS,aAAa,QAAoD;AAC/E,QAAM,QAAQ,OAAO,WAAW,aAAa;AAC7C,SAAO,OAAO,UAAU,YAAY,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI;AACpE;AAGO,SAAS,eACd,QACA,OACwB;AACxB,SAAO,EAAE,GAAG,QAAQ,UAAU,EAAE,GAAG,OAAO,UAAU,CAAC,aAAa,GAAG,MAAM,EAAE;AAC/E;AAoCA,IAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;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;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;AAGD,SAAS,UAAU,MAAsB;AACvC,SAAO,KACJ,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACV;AAGA,SAAS,aAAa,OAAe,eAAiC;AACpE,QAAM,QAAQ,UAAU,KAAK,EAC1B,MAAM,GAAG,EACT,OAAO,CAAC,SAAS,KAAK,UAAU,iBAAiB,CAAC,UAAU,IAAI,IAAI,CAAC;AACxE,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAiBO,SAAS,kBACd,OACA,UACA,UAA8B,CAAC,GACd;AACjB,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAE5D,QAAM,eAAe,MAAM,KAAK;AAChC,MAAI,CAAC,aAAc,QAAO,EAAE,UAAU,OAAO,MAAM,eAAe,SAAS,GAAG,cAAc,CAAC,EAAE;AAC/F,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO,EAAE,UAAU,OAAO,MAAM,cAAc,SAAS,GAAG,cAAc,CAAC,EAAE;AAEjG,QAAM,gBAAgB,SAAS,YAAY;AAC3C,MAAI,cAAc,SAAS,aAAa,YAAY,CAAC,GAAG;AACtD,WAAO,EAAE,UAAU,MAAM,MAAM,YAAY,SAAS,GAAG,cAAc,CAAC,EAAE;AAAA,EAC1E;AAEA,QAAM,eAAe,UAAU,QAAQ;AACvC,QAAM,YAAY,UAAU,YAAY;AACxC,MAAI,aAAa,aAAa,SAAS,SAAS,GAAG;AACjD,WAAO,EAAE,UAAU,MAAM,MAAM,cAAc,SAAS,GAAG,cAAc,CAAC,EAAE;AAAA,EAC5E;AAEA,QAAM,QAAQ,aAAa,cAAc,aAAa;AACtD,MAAI,MAAM,WAAW,GAAG;AAGtB,WAAO,EAAE,UAAU,OAAO,MAAM,UAAU,SAAS,GAAG,cAAc,CAAC,EAAE;AAAA,EACzE;AAEA,QAAM,UAAU,MAAM;AAAA,IAAO,CAAC,SAC5B,IAAI,OAAO,MAAM,KAAK,QAAQ,uBAAuB,MAAM,CAAC,KAAK,EAAE,KAAK,YAAY;AAAA,EACtF;AACA,QAAM,eAAe,MAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,SAAS,IAAI,CAAC;AACnE,QAAM,UAAU,QAAQ,SAAS,MAAM;AACvC,QAAM,WAAW,WAAW;AAC5B,SAAO,EAAE,UAAU,MAAM,WAAW,YAAY,UAAU,SAAS,aAAa;AAClF;AAiCO,SAAS,6BAA6B,UAAuC,CAAC,GAAG;AACtF,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,SAAO,eAAe,aACpB,QACA,KACwB;AACxB,UAAM,QAAQ,aAAa,MAAM;AACjC,QAAI,CAAC,OAAO;AACV,UAAI,mBAAmB,UAAU;AAC/B,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ;AAAA,QACV;AAAA,MACF;AAEA,aAAO,QAAQ,oBAAoB,QAAQ,kBAAkB,QAAQ,GAAG,IAAI,EAAE,QAAQ,KAAK;AAAA,IAC7F;AAEA,UAAM,YAAY,kBAAkB,OAAO,OAAO,MAAM,OAAO;AAC/D,QAAI,CAAC,UAAU,UAAU;AACvB,YAAM,SACJ,UAAU,SAAS,eACf,6BACA,iDAAiD,UAAU,UAAU,KAAK,QAAQ,CAAC,CAAC,IAClF,UAAU,aAAa,SACnB,cAAc,UAAU,aAAa,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,KAC3D,EACN;AACN,aAAO;AAAA,QACL,QAAQ;AAAA,QACR,QAAQ,2BAA2B,MAAM;AAAA,MAC3C;AAAA,IACF;AAGA,QAAI,QAAQ,kBAAmB,QAAO,QAAQ,kBAAkB,QAAQ,GAAG;AAC3E,WAAO,EAAE,QAAQ,KAAK;AAAA,EACxB;AACF;AAsBO,SAAS,qBAAqB,UAAwC,CAAC,GAAG;AAC/E,QAAM,YAAY,QAAQ,aAAa;AACvC,SAAO,eAAe,SACpB,QACA,MACiC;AACjC,UAAM,SAAS,QAAQ,UAAU,yBAAyB,QAAQ,cAAc;AAChF,UAAM,UAAU,OAAO,KAAK,MAAM,GAAG,IAAI;AACzC,UAAM,SACJ;AAGF,UAAM,OAAO;AAAA,MACX,kBAAkB,IAAI;AAAA,MACtB,eAAe,OAAO,SAAS,QAAQ;AAAA,MACvC;AAAA,EAAkB,OAAO;AAAA,MACzB;AAAA,IACF,EAAE,KAAK,MAAM;AACb,QAAI,MAAM;AACV,QAAI;AACF,YAAM,MAAM,OAAO;AAAA,QACjB;AAAA,UACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,UAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,QAChC;AAAA,QACA;AAAA,MACF;AAAA,IACF,QAAQ;AACN,aAAO;AAAA,IACT;AACA,UAAM,QAAQ,IAAI,KAAK,EAAE,MAAM,IAAI,EAAE,CAAC,GAAG,KAAK;AAC9C,QAAI,CAAC,MAAO,QAAO;AACnB,WAAO,eAAe,QAAQ,KAAK;AAAA,EACrC;AACF;;;ACpKA,IAAM,oBAA+D;AAAA,EACnE,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,cAAc;AAAA,EACd,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,yBAAyB;AAC3B;AAEA,IAAM,iBAA4D;AAAA,EAChE,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,cAAc;AAAA,EACd,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,YAAY;AACd;AAEA,IAAM,gBAAkD;AAAA,EACtD,oBAAoB;AAAA,EACpB,kBAAkB;AAAA,EAClB,kBAAkB;AAAA,EAClB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,sBAAsB;AAAA,EACtB,mBAAmB;AAAA,EACnB,sBAAsB;AAAA,EACtB,cAAc;AAAA,EACd,cAAc;AAAA,EACd,cAAc;AAAA,EACd,iBAAiB;AAAA,EACjB,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,yBAAyB;AAC3B;AAEO,SAAS,sBACd,UAAwC,CAAC,GACkB;AAC3D,SAAO;AAAA,IACL,MAAM,QAAQ,QAAQ;AAAA,IACtB,YAAY;AAAA,MACV,EAAE,KAAK,qBAAqB,aAAa,4CAA4C;AAAA,MACrF,EAAE,KAAK,kBAAkB,aAAa,gDAAgD;AAAA,MACtF,EAAE,KAAK,qBAAqB,aAAa,mDAAmD;AAAA,MAC5F,EAAE,KAAK,uBAAuB,aAAa,sCAAsC;AAAA,MACjF,EAAE,KAAK,gBAAgB,aAAa,wDAAwD;AAAA,MAC5F,EAAE,KAAK,oBAAoB,aAAa,kCAAkC;AAAA,MAC1E,EAAE,KAAK,sBAAsB,aAAa,kCAAkC;AAAA,MAC5E,EAAE,KAAK,oBAAoB,aAAa,yCAAyC;AAAA,MACjF,EAAE,KAAK,cAAc,aAAa,wDAAwD;AAAA,IAC5F;AAAA,IACA,WAAW,CAAC,aAAa,SAAS,SAAS;AAAA,IAC3C,MAAM,MAAM,EAAE,UAAU,SAAS,GAAG;AAClC,YAAM,UAAU,uBAAuB,UAAU,UAAU,OAAO;AAClE,aAAO;AAAA,QACL,YAAY,QAAQ;AAAA,QACpB,WAAW,QAAQ;AAAA,QACnB,OAAO,QAAQ,SAAS,IAAI,CAAC,YAAY,QAAQ,OAAO,EAAE,KAAK,IAAI;AAAA,MACrE;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,uBACd,UACA,UACA,UAAwC,CAAC,GACjB;AACxB,QAAM,SAAS,gBAAgB,QAAQ;AACvC,QAAM,YAAY,SAAS,aAAa,oBAAoB,SAAS,MAAM;AAC3E,QAAM,kBAAkB,uBAAuB,QAAQ;AACvD,QAAM,8BAA8B,gBAAgB;AAAA,IAAO,CAAC,WAC1D,SAAS,SAAS,KAAK,CAAC,YAAY,qBAAqB,SAAS,MAAM,CAAC;AAAA,EAC3E,EAAE;AACF,QAAM,uBAAuB,gBAAgB;AAC7C,QAAM,gBACJ,yBAAyB,IACrB,aAAa,QAAQ,SAAS,YAAY,KAAK,SAAS,SAAS,SAAS,CAAC,IAC3E,8BAA8B;AACpC,QAAM,uBAAuB,SAAS,SAAS;AAAA,IAAO,CAAC,YACrD,kBAAkB,SAAS,QAAQ;AAAA,EACrC,EAAE;AACF,QAAM,mBACJ,SAAS,SAAS,WAAW,IACzB,SAAS,eACP,IACA,IACF,uBAAuB,SAAS,SAAS;AAC/C,QAAM,mBACJ,SAAS,SAAS,WAAW,IACzB,SAAS,eACP,IACA,IACF,QAAQ,SAAS,SAAS,IAAI,CAAC,YAAY,sBAAsB,SAAS,QAAQ,CAAC,CAAC;AAC1F,QAAM,qBAAqB,yBAAyB,IAAI,mBAAmB;AAC3E,QAAM,UAAU,OAAO,IAAI,CAAC,UAAU,aAAa,MAAM,MAAM,SAAS,UAAU,OAAO,CAAC;AAC1F,QAAM,sBAAsB,QAAQ,OAAO,OAAO,EAAE;AACpD,QAAM,eACJ,OAAO,WAAW,IAAK,YAAY,IAAI,IAAK,sBAAsB,KAAK,IAAI,GAAG,OAAO,MAAM;AAC7F,QAAM,WAAW,eAAe,QAAQ,UAAU,UAAU,OAAO;AACnE,QAAM,kBAAkB,qBAAqB,UAAU,UAAU,SAAS;AAC1E,QAAM,oBAAoB,uBAAuB,UAAU,UAAU,SAAS;AAC9E,QAAM,aAAa,SAAS,eAAgB,YAAY,IAAI,IAAK,YAAY,IAAI;AACjF,QAAM,wBACJ,OAAO,WAAW,IAAK,YAAY,IAAI,IAAK,IAAI,sBAAsB,KAAK,IAAI,GAAG,OAAO,MAAM;AAEjG,QAAM,uBAAyD;AAAA,IAC7D,mBAAmB,QAAQ,gBAAgB;AAAA,IAC3C,gBAAgB,QAAQ,aAAa;AAAA,IACrC,mBAAmB,QAAQ,gBAAgB;AAAA,IAC3C,qBAAqB,QAAQ,kBAAkB;AAAA,IAC/C,cAAc,QAAQ,YAAY;AAAA,IAClC,cAAc,QAAQ,YAAY;AAAA,IAClC,kBAAkB,QAAQ,eAAe;AAAA,IACzC,oBAAoB,QAAQ,iBAAiB;AAAA,IAC7C,kBAAkB,QAAQ,SAAS,OAAO;AAAA,IAC1C,YAAY,QAAQ,UAAU;AAAA,IAC9B,yBAAyB,QAAQ,qBAAqB;AAAA,EACxD;AACA,QAAM,iBAAiB,2BAA2B,SAAS,kBAAkB,CAAC,CAAC;AAC/E,QAAM,UAAU,aAAa,sBAAsB,gBAAgB,QAAQ,mBAAmB;AAC9F,QAAM,aAAa,EAAE,GAAG,mBAAmB,GAAG,SAAS,YAAY,GAAG,QAAQ,WAAW;AACzF,QAAM,WAAW,yBAAyB,SAAS,UAAU,UAAU;AACvE,QAAM,YAAY,kBAAkB,SAAS,QAAQ,WAAW,cAAc;AAE9E,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,QAAQ,SAAS;AAAA,MACf,CAAC,YAAY,QAAQ,aAAa,WAAW,QAAQ,aAAa;AAAA,IACpE;AAAA,IACA;AAAA,IACA,YAAY,OAAO;AAAA,IACnB;AAAA,IACA,iBAAiB,SAAS;AAAA,IAC1B,wBAAwB,SAAS;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEO,SAAS,yBACd,SACA,UACA,aAAwD,mBACvC;AACjB,QAAM,WAA4B,CAAC;AACnC,MAAI,MAAM,QAAQ,gBAAgB,WAAW,cAAc,GAAG;AAC5D,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM,SAAS,QAAQ,SAAS,cAAc,IAC1C,8BACA;AAAA,MACJ,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,gBAAgB,QAAQ,eAAe;AAAA,IACrD,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,mBAAmB,WAAW,iBAAiB,GAAG;AAClE,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,mBAAmB,QAAQ,kBAAkB;AAAA,IAC3D,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,cAAc,WAAW,YAAY,GAAG;AACxD,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,cAAc,QAAQ,aAAa;AAAA,IACjD,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,kBAAkB,WAAW,gBAAgB,GAAG;AAChE,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS;AAAA,MACT,UAAU,EAAE,kBAAkB,QAAQ,iBAAiB;AAAA,IACzD,CAAC;AAAA,EACH;AACA,MAAI,MAAM,QAAQ,YAAY,WAAW,UAAU,GAAG;AACpD,aAAS,KAAK;AAAA,MACZ,IAAI,GAAG,SAAS,EAAE;AAAA,MAClB,MAAM;AAAA,MACN,UAAU;AAAA,MACV,YAAY,SAAS;AAAA,MACrB,SAAS,SAAS,eACd,oDACA;AAAA,MACJ,UAAU,EAAE,YAAY,QAAQ,WAAW;AAAA,IAC7C,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEO,SAAS,2BACd,SACuC;AACvC,SAAO,YAAY;AACjB,UAAM,YAAsC,CAAC;AAC7C,UAAM,WAA4B,CAAC;AACnC,eAAW,YAAY,QAAQ,WAAW;AACxC,YAAM,kBAAkB,MAAM,QAAQ,IAAI,QAAQ;AAClD,YAAM,WAAW,MAAM,QAAQ,oBAAoB,EAAE,UAAU,UAAU,gBAAgB,CAAC;AAC1F,YAAM,WAAW,WACb;AAAA,QACE,GAAG;AAAA,QACH,gBAAgB;AAAA,UACd,GAAI,gBAAgB,kBAAkB,CAAC;AAAA,UACvC,GAAI,MAAM,QAAQ,QAAQ,IAAI,WAAW,CAAC,QAAQ;AAAA,QACpD;AAAA,MACF,IACA;AACJ,YAAM,UAAU,uBAAuB,UAAU,UAAU;AAAA,QACzD,YAAY,QAAQ;AAAA,QACpB,SAAS,QAAQ;AAAA,MACnB,CAAC;AACD,gBAAU,KAAK,OAAO;AACtB,eAAS,KAAK,GAAG,QAAQ,QAAQ;AAAA,IACnC;AACA,UAAM,UAAU,0BAA0B,SAAS;AACnD,WAAO;AAAA,MACL,QAAQ,SAAS,WAAW;AAAA,MAC5B;AAAA,MACA;AAAA,MACA,UAAU,EAAE,eAAe,QAAQ,UAAU,OAAO;AAAA,IACtD;AAAA,EACF;AACF;AAEA,eAAsB,wBACpB,SAC+B;AAC/B,QAAM,QAAQ,QAAQ,SAAS,sBAAsB;AACrD,QAAM,SAAS,MAAM,MAAM,MAAM;AAAA,IAC/B,UAAU,QAAQ;AAAA,IAClB,UAAU,QAAQ;AAAA,IAClB,QAAQ,QAAQ,UAAU,IAAI,gBAAgB,EAAE;AAAA,EAClD,CAAC;AACD,QAAM,OAAO,MAAM,MAAM,MAAM;AAAA,IAC7B,UAAU,QAAQ;AAAA,IAClB,UAAU,QAAQ;AAAA,IAClB,QAAQ,QAAQ,UAAU,IAAI,gBAAgB,EAAE;AAAA,EAClD,CAAC;AACD,QAAM,cAAc,OAAO;AAC3B,QAAM,YAAY,KAAK;AACvB,QAAM,iBAAiB,QAAQ,kBAAkB;AACjD,QAAM,eAAe,QAAQ,gBAAgB;AAC7C,SAAO;AAAA,IACL,QAAQ,eAAe,kBAAkB,aAAa;AAAA,IACtD;AAAA,IACA;AAAA,IACA,KAAK,cAAc;AAAA,EACrB;AACF;AAEO,SAAS,2BACd,QACkD;AAClD,QAAM,aAA+D,CAAC;AACtE,aAAW,QAAQ,QAAQ;AACzB,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,iBAAkB,WAAW,QAAQ,KAAK,CAAC;AACjD,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,MAAM,GAAG;AACtD,YAAM,YAAY,cAAc,oBAAoB,GAAG,CAAC;AACxD,UAAI,CAAC,UAAW;AAChB,UAAI,OAAO,SAAS,KAAK,EAAG,gBAAe,SAAS,IAAI,QAAQ,KAAK;AAAA,IACvE;AACA,eAAW,QAAQ,IAAI;AAAA,EACzB;AACA,SAAO;AACT;AAEO,SAAS,sBAAsB,OAAqC;AACzE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,YAAY,SAAS;AAAA,IACrB,UAAU,SAAS;AAAA,IACnB,oBAAoB,SAAS,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI;AAAA,IACnE,WAAW,SAAS;AAAA,IACpB,oBAAoB,qBAAqB,QAAQ;AAAA,EACnD,EAAE;AACJ;AAEO,SAAS,oBAAoB,OAAqC;AACvE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,OAAO,SAAS;AAAA,IAChB,eAAe,SAAS;AAAA,IACxB,iBAAiB,SAAS;AAAA,IAC1B,mBAAmB,SAAS,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI;AAAA,IAClE,SAAS,qBAAqB,QAAQ;AAAA,EACxC,EAAE;AACJ;AAEO,SAAS,iBAAiB,OAAqC;AACpE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,OAAO,SAAS;AAAA,IAChB,QAAQ,SAAS;AAAA,IACjB,SAAS,SAAS,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI,EAAE,KAAK,MAAM;AAAA,EACvE,EAAE;AACJ;AAEO,SAAS,oBAAoB,OAAqC;AACvE,SAAO,MAAM,IAAI,CAAC,EAAE,UAAU,SAAS,OAAO;AAAA,IAC5C,UAAU,SAAS;AAAA,IACnB,OAAO,SAAS;AAAA,IAChB,WAAW,SAAS;AAAA,IACpB,UAAU,SAAS;AAAA,IACnB,mBAAmB,SAAS,SAAS,IAAI,CAAC,aAAa;AAAA,MACrD,QAAQ,QAAQ;AAAA,MAChB,MAAM,QAAQ;AAAA,IAChB,EAAE;AAAA,IACF,QAAQ,gBAAgB,QAAQ,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AAAA,EAC7D,EAAE;AACJ;AAEO,SAAS,wBACd,OACA,UAAuC,CAAC,GACZ;AAC5B,QAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,QAAM,eAAe,mBAAmB,KAAK;AAC7C,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,mBAAmB,MAAM,QAAQ,OAAO,CAAC,WAAW;AACxD,WAAO,OAAO,aAAa,KAAK,MAAM,OAAO,UAAU,IAAI,IAAI,QAAQ,IAAI;AAAA,EAC7E,CAAC,EAAE;AACH,QAAM,mBAAmB,oBAAI,IAAoB;AACjD,aAAW,UAAU,MAAM,SAAS;AAClC,qBAAiB,IAAI,OAAO,cAAc,iBAAiB,IAAI,OAAO,WAAW,KAAK,KAAK,CAAC;AAAA,EAC9F;AACA,QAAM,2BAA2B,CAAC,GAAG,iBAAiB,OAAO,CAAC,EAAE;AAAA,IAC9D,CAAC,UAAU,QAAQ;AAAA,EACrB,EAAE;AACF,QAAM,2BAA2B,MAAM,MAAM;AAAA,IAC3C,CAAC,SAAS,WAAW,KAAK,IAAI,EAAE,SAAS;AAAA,EAC3C,EAAE;AACF,QAAM,mBAAmB,MAAM,MAAM,OAAO,CAAC,SAAS,KAAK,UAAU,SAAS,CAAC,EAAE;AACjF,QAAM,UAAU;AAAA,IACd,YAAY,MAAM,MAAM;AAAA,IACxB,cAAc,MAAM,QAAQ;AAAA,IAC5B,eAAe,MAAM,MAAM,WAAW,IAAI,IAAI,2BAA2B,MAAM,MAAM;AAAA,IACrF,yBAAyB,MAAM,MAAM,WAAW,IAAI,IAAI,mBAAmB,MAAM,MAAM;AAAA,IACvF,mBAAmB,MAAM,QAAQ,WAAW,IAAI,IAAI,mBAAmB,MAAM,QAAQ;AAAA,IACrF,4BACE,MAAM,QAAQ,WAAW,IAAI,IAAI,2BAA2B,MAAM,QAAQ;AAAA,IAC5E,kBAAkB,WAAW,SAAS,OAAO,CAAC,YAAY,QAAQ,aAAa,OAAO,EAAE;AAAA,IACxF,oBAAoB,aAAa,OAAO,CAAC,YAAY,QAAQ,aAAa,SAAS,EAAE;AAAA,EACvF;AACA,QAAM,WAA4B,CAAC;AACnC,MAAI,QAAQ,mBAAmB,GAAG;AAChC,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,SAAS,GAAG,QAAQ,gBAAgB;AAAA,MACpC,UAAU,EAAE,kBAAkB,QAAQ,iBAAiB;AAAA,IACzD,CAAC;AAAA,EACH;AACA,MAAI,QAAQ,iBAAiB,QAAQ,mBAAmB,IAAI;AAC1D,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,SAAS;AAAA,MACT,UAAU,EAAE,eAAe,QAAQ,cAAc;AAAA,IACnD,CAAC;AAAA,EACH;AACA,MAAI,QAAQ,qBAAqB,QAAQ,sBAAsB,IAAI;AACjE,aAAS,KAAK;AAAA,MACZ,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,UAAU;AAAA,MACV,SAAS;AAAA,MACT,UAAU,EAAE,mBAAmB,QAAQ,kBAAkB;AAAA,IAC3D,CAAC;AAAA,EACH;AACA,SAAO,EAAE,IAAI,SAAS,WAAW,GAAG,SAAS,SAAS;AACxD;AAEA,SAAS,uBAAuB,UAAuD;AACrF,MAAI,SAAS,iBAAiB,OAAQ,QAAO,CAAC,GAAG,SAAS,eAAe;AACzE,UAAQ,SAAS,kBAAkB,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE;AACjE;AAEA,SAAS,qBAAqB,UAA2C;AACvE,SAAO,uBAAuB,QAAQ,EAAE,QAAQ,CAAC,WAAY,OAAO,OAAO,CAAC,OAAO,IAAI,IAAI,CAAC,CAAE;AAChG;AAEA,SAAS,qBAAqB,SAAyB,QAAqC;AAC1F,MAAI,OAAO,MAAM,QAAQ,OAAO,OAAO,GAAI,QAAO;AAClD,MAAI,OAAO,UAAU,QAAQ,WAAW,OAAO,OAAQ,QAAO;AAC9D,MAAI,OAAO,YAAY,QAAQ,aAAa,OAAO,SAAU,QAAO;AACpE,MAAI,OAAO,YAAY,QAAQ,aAAa,OAAO,SAAU,QAAO;AACpE,MAAI,OAAO,QAAQ,iBAAiB,OAAO,MAAM,QAAQ,IAAI,KAAK,IAAK,QAAO;AAC9E,SAAO;AACT;AAEA,SAAS,kBAAkB,SAAyB,UAA0C;AAC5F,SAAO,sBAAsB,SAAS,QAAQ,KAAK;AACrD;AAEA,SAAS,sBAAsB,SAAyB,UAAyC;AAC/F,QAAM,UAAU;AAAA,IACd,SAAS;AAAA,IACT,SAAS;AAAA,IACT,GAAI,SAAS,kBAAkB,CAAC;AAAA,IAChC,GAAG,qBAAqB,QAAQ;AAAA,EAClC,EAAE,OAAO,CAAC,UAA2B,QAAQ,OAAO,KAAK,CAAC,CAAC;AAC3D,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,SAAO,KAAK,IAAI,GAAG,QAAQ,IAAI,CAAC,WAAW,iBAAiB,QAAQ,QAAQ,IAAI,CAAC,CAAC;AACpF;AAEA,SAAS,aACP,OACA,UACA,SACS;AACT,MAAI,SAAS,WAAW,EAAG,QAAO;AAClC,QAAM,WAAW,SAAS,IAAI,CAAC,YAAY,QAAQ,IAAI,EAAE,KAAK,MAAM;AACpE,QAAM,gBAAgB,kBAAkB,OAAO,UAAU;AAAA,IACvD,YAAY,QAAQ,mBAAmB;AAAA,EACzC,CAAC;AACD,SACE,cAAc,YAAY,iBAAiB,OAAO,QAAQ,MAAM,QAAQ,mBAAmB;AAE/F;AAEA,SAAS,eACP,QACA,UACA,UACA,SAC8E;AAC9E,MAAI,OAAO,WAAW;AACpB,WAAO,EAAE,SAAS,SAAS,eAAe,IAAI,GAAG,iBAAiB,GAAG,wBAAwB,EAAE;AACjG,QAAM,YAAY,SAAS,aAAa,CAAC;AACzC,QAAM,cAAc,OAAO,OAAO,CAAC,UAAU,kBAAkB,OAAO,SAAS,EAAE,SAAS,CAAC;AAC3F,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO;AAAA,MACL,SAAS,SAAS,mBAAmB,IAAI;AAAA,MACzC,iBAAiB;AAAA,MACjB,wBAAwB;AAAA,IAC1B;AAAA,EACF;AACA,MAAI,yBAAyB;AAC7B,aAAW,SAAS,aAAa;AAC/B,UAAM,gBAAgB,iBAAiB,OAAO,WAAW,SAAS,QAAQ;AAC1E,QAAI,aAAa,MAAM,MAAM,eAAe,OAAO,EAAG,2BAA0B;AAAA,EAClF;AACA,SAAO;AAAA,IACL,SAAS,yBAAyB,YAAY;AAAA,IAC9C,iBAAiB,YAAY;AAAA,IAC7B;AAAA,EACF;AACF;AAEA,SAAS,kBACP,OACA,WACmB;AACnB,QAAM,mBAAmB,IAAI,IAAI,MAAM,eAAe,CAAC,CAAC;AACxD,SAAO,UAAU,OAAO,CAAC,aAAa;AACpC,WAAO,SAAS,YAAY,MAAM,MAAO,SAAS,MAAM,iBAAiB,IAAI,SAAS,EAAE;AAAA,EAC1F,CAAC;AACH;AAEA,SAAS,iBACP,OACA,WACA,UAC2B;AAC3B,QAAM,mBAAmB,kBAAkB,OAAO,SAAS;AAC3D,QAAM,kBAAkB,SAAS;AAAA,IAAO,CAAC,YACvC,iBAAiB,KAAK,CAAC,aAAa;AAClC,UAAI,SAAS,aAAa,SAAS,cAAc,QAAQ,GAAI,QAAO;AACpE,UAAI,SAAS,UAAU,SAAS,WAAW,QAAQ,OAAQ,QAAO;AAClE,UAAI,SAAS,YAAY,SAAS,aAAa,QAAQ,SAAU,QAAO;AACxE,UAAI,SAAS,YAAY,SAAS,aAAa,QAAQ,SAAU,QAAO;AACxE,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AACA,SAAO,gBAAgB,SAAS,IAAI,kBAAkB;AACxD;AAEA,SAAS,qBACP,UACA,UACA,WACQ;AACR,MAAI,SAAS,aAAc,QAAO,YAAY,IAAI;AAClD,MAAI,UAAW,QAAO;AACtB,QAAM,UAAU;AAAA,IACd,SAAS;AAAA,IACT,GAAI,SAAS,kBAAkB,CAAC;AAAA,IAChC,SAAS;AAAA,EACX,EAAE,OAAO,CAAC,UAA2B,QAAQ,OAAO,KAAK,CAAC,CAAC;AAC3D,SAAO,KAAK,IAAI,GAAG,QAAQ,IAAI,CAAC,WAAW,iBAAiB,QAAQ,SAAS,MAAM,CAAC,CAAC;AACvF;AAEA,SAAS,uBACP,UACA,UACA,WACQ;AACR,MAAI,SAAS,aAAc,QAAO,YAAY,IAAI;AAClD,QAAM,WAAW,SAAS,kBAAkB,CAAC;AAC7C,QAAM,YAAY,SAAS,mBAAmB,CAAC;AAC/C,QAAM,gBACJ,SAAS,WAAW,IAChB,qBAAqB,UAAU,UAAU,SAAS,IAClD,QAAQ,SAAS,IAAI,CAAC,UAAU,iBAAiB,OAAO,SAAS,MAAM,CAAC,CAAC;AAC/E,QAAM,mBACJ,UAAU,WAAW,IACjB,IACA,UAAU,OAAO,CAAC,UAAU,iBAAiB,OAAO,SAAS,MAAM,KAAK,GAAG,EAAE,SAC7E,UAAU;AAChB,SAAO,QAAQ,iBAAiB,IAAI,iBAAiB;AACvD;AAEA,SAAS,gBAAgB,UAAiD;AACxE,MAAI,SAAS,QAAQ,OAAQ,QAAO,CAAC,GAAG,SAAS,MAAM;AACvD,SAAO,eAAe,SAAS,MAAM,EAAE,IAAI,CAAC,MAAM,WAAW,EAAE,IAAI,SAAS,QAAQ,CAAC,IAAI,KAAK,EAAE;AAClG;AAEA,SAAS,eAAe,MAAwB;AAC9C,SAAO,KACJ,MAAM,eAAe,EACrB,IAAI,CAAC,aAAa,SAAS,KAAK,CAAC,EACjC,OAAO,CAAC,aAAa,SAAS,SAAS,KAAK,CAAC,oBAAoB,QAAQ,CAAC;AAC/E;AAEA,SAAS,oBAAoB,QAAyB;AACpD,QAAM,aAAa,OAAO,YAAY;AACtC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,CAAC,WAAW,WAAW,SAAS,MAAM,CAAC;AAChD;AAEA,SAAS,aACP,eACA,gBACA,SAA8D,mBAC5B;AAClC,MAAI,WAAW,sBAAuB,QAAO;AAC7C,QAAM,SAAS,EAAE,GAAG,cAAc;AAClC,aAAW,UAAU,OAAO,OAAO,cAAc,GAAG;AAClD,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAwC;AACtF,aAAO,GAAG,IAAI;AACd,UAAI,QAAQ,eAAgB,QAAO,eAAe;AAClD,UAAI,QAAQ,eAAgB,QAAO,eAAe;AAAA,IACpD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,0BACP,WACwB;AACxB,QAAM,OAAO,oBAAI,IAAsB;AACvC,aAAW,WAAW,WAAW;AAC/B,eAAW,OAAO,OAAO,KAAK,QAAQ,OAAO,EAAyB,MAAK,IAAI,GAAG;AAAA,EACpF;AACA,QAAM,MAA8B,CAAC;AACrC,aAAW,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,GAAG;AAClC,QAAI,GAAG,IAAI,QAAQ,UAAU,IAAI,CAAC,YAAY,QAAQ,QAAQ,GAAG,CAAC,CAAC;AAAA,EACrE;AACA,MAAI,YAAY,QAAQ,UAAU,IAAI,CAAC,YAAY,QAAQ,SAAS,CAAC;AACrE,SAAO;AACT;AAEA,SAAS,kBACP,SACA,SACQ;AACR,MAAI,WAAW;AACf,MAAI,QAAQ;AACZ,aAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,OAAO,GAAwC;AACxF,QAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,EAAG;AAC7C,UAAM,SAAS,QAAQ,GAAG;AAC1B,QAAI,CAAC,OAAO,SAAS,MAAM,EAAG;AAC9B,UAAM,QAAQ,QAAQ,4BAA4B,IAAI,SAAS;AAC/D,gBAAY,QAAQ;AACpB,aAAS;AAAA,EACX;AACA,SAAO,UAAU,IAAI,IAAI,WAAW;AACtC;AAEA,SAAS,oBAAoB,QAAwB;AACnD,SAAO,OACJ,KAAK,EACL,YAAY,EACZ,QAAQ,YAAY,GAAG,EACvB,QAAQ,QAAQ,GAAG;AACxB;AAEA,SAAS,iBAAiB,QAAgB,UAA0B;AAClE,QAAM,cAAcC,cAAa,MAAM;AACvC,MAAI,YAAY,WAAW,EAAG,QAAO;AACrC,QAAM,gBAAgB,IAAI,IAAIA,cAAa,QAAQ,CAAC;AACpD,QAAM,UAAU,YAAY,OAAO,CAAC,SAAS,cAAc,IAAI,IAAI,CAAC;AACpE,SAAO,QAAQ,SAAS,YAAY;AACtC;AAEA,SAASA,cAAa,MAAwB;AAC5C,QAAM,aAAa,KAChB,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,MAAM,KAAK,EACX,IAAI,CAAC,SAAS,KAAK,KAAK,KAAK,CAAC,CAAC,EAC/B,OAAO,CAAC,UAAU,KAAK,UAAU,KAAK,QAAQ,KAAK,IAAI,MAAM,CAACC,WAAU,IAAI,IAAI,CAAC;AACpF,SAAO,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC;AAChC;AAEA,SAAS,KAAK,MAAsB;AAClC,MAAI,KAAK,SAAS,KAAK,KAAK,KAAK,SAAS,EAAG,QAAO,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AACxE,MAAI,KAAK,SAAS,KAAK,KAAK,KAAK,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,EAAE;AACpE,MAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,EAAE;AACnE,MAAI,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,EAAG,QAAO,KAAK,MAAM,GAAG,EAAE;AAClE,SAAO;AACT;AAEA,SAAS,WAAW,MAAwB;AAC1C,QAAM,OAAiB,CAAC;AACxB,QAAM,QAAQ;AACd,MAAI,QAAQ,MAAM,KAAK,IAAI;AAC3B,SAAO,UAAU,MAAM;AACrB,SAAK,KAAK,MAAM,CAAC,CAAC;AAClB,YAAQ,MAAM,KAAK,IAAI;AAAA,EACzB;AACA,SAAO;AACT;AAEA,SAAS,MAAM,QAAgB,WAAwC;AACrE,SAAO,cAAc,UAAa,SAAS;AAC7C;AAEA,SAAS,aAAa,WAA4B;AAChD,SAAO,YAAY,IAAI;AACzB;AAEA,SAAS,QAAQ,QAAmC;AAClD,QAAM,SAAS,OAAO,OAAO,OAAO,QAAQ;AAC5C,SAAO,OAAO,WAAW,IAAI,IAAI,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;AAC1F;AAEA,SAAS,QAAQ,OAAuB;AACtC,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;AAEA,IAAMA,aAAY,oBAAI,IAAI;AAAA,EACxB;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;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;;;ACn5BD;AAAA,EACE;AAAA,EAGA;AAAA,OACK;;;ACIA,SAAS,qBAAqB,OAMlB;AACjB,QAAM,aAAa,MAAM,QAAQ,MAAM,oBAAI,KAAK,IAAI,EAAE,YAAY;AAClE,SAAO;AAAA,IACL,IAAI;AAAA,MACF;AAAA,MACA,GAAG,MAAM,IAAI,IAAI,MAAM,UAAU,EAAE,IAAI,SAAS,IAAI,KAAK,UAAU,MAAM,YAAY,CAAC,CAAC,CAAC;AAAA,IAC1F;AAAA,IACA,MAAM,MAAM;AAAA,IACZ;AAAA,IACA,OAAO,MAAM;AAAA,IACb,QAAQ,MAAM;AAAA,IACd,UAAU,MAAM;AAAA,EAClB;AACF;;;AC5BA;AAAA,EACE;AAAA,EAUA;AAAA,EAEA;AAAA,OACK;AA8BA,IAAM,0BAA0B;AAAA,EACrC,UAAU;AAAA,EACV,iBAAiB;AAAA,EACjB,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,aAAa;AAAA,EACb,kBAAkB;AAAA,EAClB,YAAY;AAAA,EACZ,SAAS;AACX;AAqDO,SAAS,oBAAoB,OAAyD;AAC3F,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AAqBO,SAAS,yBACd,SACgC;AAChC,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,6BAAsE,CAAC;AAC7E,QAAM,eAAe,QAAQ,MAAM,IAAI,CAAC,SAAS;AAC/C,UAAM,UAAU,gBAAgB,QAAQ,OAAO,KAAK,OAAO,WAAW;AACtE,+BAA2B,KAAK,EAAE,IAAI;AACtC,WAAO,sBAAsB,QAAQ,OAAO,MAAM,SAAS,GAAG;AAAA,EAChE,CAAC;AACD,QAAM,SAAS,wBAAwB;AAAA,IACrC,QAAQ,QAAQ;AAAA,IAChB;AAAA,IACA,aAAa,QAAQ;AAAA,IACrB,aAAa,aAAa,QAAQ,CAAC,gBAAgB,YAAY,WAAW;AAAA,IAC1E,UAAU,CAAC;AAAA,IACX,aAAa;AAAA,MACX,aAAa;AAAA,QAAQ,CAAC,gBACpB,mBAAmB,2BAA2B,YAAY,EAAE,KAAK,CAAC,CAAC;AAAA,MACrE;AAAA,IACF;AAAA,IACA,UAAU,QAAQ;AAAA,EACpB,CAAC;AACD,QAAM,YAAY,8BAA8B,OAAO,2BAA2B;AAClF,QAAM,mBAAmB,iCAAiC;AAAA,IACxD,GAAG,OAAO;AAAA,IACV,GAAG,OAAO;AAAA,EACZ,CAAC;AAED,SAAO;AAAA,IACL,QAAQ,OAAO;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,sBACP,OACA,MACA,SACA,KACsB;AACtB,QAAM,WAAW,QAAQ;AACzB,QAAM,YAAY,OAAO,QAAQ,QAAQ,CAAC,WAAW,OAAO,KAAK,SAAS,CAAC;AAC3E,QAAM,UAAU,MAAM,QAAQ,OAAO,CAAC,WAAW,UAAU,SAAS,OAAO,EAAE,CAAC;AAC9E,QAAM,YAAY,QAAQ,CAAC,GAAG,mBAAmB;AACjD,QAAM,iBAAiB,KAAK,aACxB,KAAK,IAAI,GAAG,UAAU,SAAS,KAAK,UAAU,IAC9C,UAAU,SAAS,IACjB,IACA;AACN,QAAM,cAAc,KAAK,UAAU,KAAK,IAAI,GAAG,WAAW,KAAK,OAAO,IAAI,WAAW,IAAI,IAAI;AAC7F,QAAM,YAAY,gBAAgB,SAAS,GAAG;AAC9C,QAAM,oBAAoB,MAAM,KAAK,IAAI,WAAW,gBAAgB,aAAa,UAAU,KAAK,CAAC;AAEjG,SAAO;AAAA,IACL,IAAI,KAAK;AAAA,IACT,aAAa,KAAK;AAAA,IAClB,aAAa,KAAK;AAAA,IAClB,UAAU,KAAK;AAAA,IACf,iBAAiB,KAAK;AAAA,IACtB,YAAY,KAAK;AAAA,IACjB,WAAW,KAAK;AAAA,IAChB,aAAa,KAAK;AAAA,IAClB,kBAAkB,KAAK;AAAA,IACvB;AAAA,IACA,aAAa,OAAO;AAAA,MAClB,GAAG,UAAU,IAAI,CAAC,aAAa,UAAU,QAAQ,EAAE;AAAA,MACnD,GAAG,QAAQ,IAAI,CAAC,WAAW,QAAQ,OAAO,KAAK,EAAE,EAAE;AAAA,IACrD,CAAC;AAAA,IACD,gBACE,KAAK,mBAAmB,KAAK,eAAe,aAAa,UAAU;AAAA,IACrE,UAAU;AAAA,MACR,GAAG,KAAK;AAAA,MACR,OAAO,KAAK;AAAA,MACZ;AAAA,MACA,aAAa,UAAU;AAAA,MACvB,qBAAqB;AAAA,MACrB,kBAAkB,UAAU;AAAA,MAC5B,gBAAgB,UAAU;AAAA,MAC1B,YAAY,UAAU;AAAA,MACtB,gBAAgB,UAAU;AAAA,IAC5B;AAAA,EACF;AACF;AAEA,SAAS,gBACP,SACA,KAC6F;AAC7F,MAAI,QAAQ,WAAW,EAAG,QAAO,EAAE,OAAO,GAAG,kBAAkB,CAAC,EAAE;AAClE,QAAM,mBAAmB,QACtB;AAAA,IACC,CAAC,WACC,OAAO,cACP,eAAe,OAAO,UAAU,YAAY,KAC5C,eAAe,OAAO,UAAU,WAAW;AAAA,EAC/C,EACC,OAAO,SAAS;AACnB,QAAM,qBAAqB,QACxB,IAAI,CAAC,WAAW,OAAO,kBAAkB,eAAe,OAAO,UAAU,gBAAgB,CAAC,EAC1F,OAAO,SAAS;AACnB,QAAM,mBAAmB,QACtB,OAAO,CAAC,WAAW;AAClB,UAAM,aACJ,OAAO,cACP,eAAe,OAAO,UAAU,YAAY,KAC5C,eAAe,OAAO,UAAU,WAAW;AAC7C,WAAO,aAAa,KAAK,MAAM,UAAU,KAAK,IAAI,QAAQ,IAAI;AAAA,EAChE,CAAC,EACA,IAAI,CAAC,WAAW,OAAO,EAAE;AAC5B,SAAO;AAAA,IACL,OAAO,iBAAiB,SAAS,IAAI,IAAI;AAAA,IACzC,YAAY,YAAY,gBAAgB;AAAA,IACxC,gBAAgB,UAAU,kBAAkB;AAAA,IAC5C;AAAA,EACF;AACF;AAEA,SAAS,UAAU,OAA4C;AAC7D,SAAO,QAAQ,SAAS,OAAO,SAAS,KAAK,MAAM,KAAK,CAAC,CAAC;AAC5D;AAEA,SAAS,YAAY,QAAsC;AACzD,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC;AAC/D;AAEA,SAAS,UAAU,QAAsC;AACvD,SAAO,OAAO,KAAK,CAAC,GAAG,MAAM,KAAK,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC;AAC/D;AAEA,SAAS,mBAAmB,SAA4C;AACtE,SAAO,QAAQ,IAAI,CAAC,WAAW,OAAO,KAAK,EAAE;AAC/C;AAEA,SAAS,OAAU,OAAiB;AAClC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;AAEA,SAAS,MAAM,OAAuB;AACpC,SAAO,KAAK,MAAM,QAAQ,GAAI,IAAI;AACpC;;;ACzPO,SAAS,aACd,SACA,OAC4C;AAC5C,MAAI,CAAC,QAAQ,gBAAgB,OAAQ,QAAO;AAC5C,SAAO,yBAAyB;AAAA,IAC9B,GAAI,QAAQ,aAAa,CAAC;AAAA,IAC1B,QAAQ,QAAQ,mBAAmB,QAAQ;AAAA,IAC3C;AAAA,IACA,OAAO,QAAQ;AAAA,EACjB,CAAC;AACH;;;AHuGO,SAAS,kCACd,SAC6B;AAC7B,MAAI,cAAc;AAClB,QAAM,eAA4C,CAAC;AAEnD,SAAO;AAAA,IACL,QAAQ,QAAQ;AAAA,IAChB,MAAM,QAAQ,EAAE,SAAS,YAAY,GAAG;AACtC,UAAI,YAAY,QAAS,OAAM,IAAI,MAAM,gCAAgC;AACzE,UAAI,CAAC,aAAa;AAChB,cAAM,kBAAkB,QAAQ,IAAI;AACpC,sBAAc;AAAA,MAChB;AACA,YAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,YAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,YAAM,eAAe,mBAAmB,KAAK;AAC7C,YAAM,YAAY,aAAa,SAAS,KAAK;AAC7C,aAAO;AAAA,QACL,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,WAAW,QAAQ,SAAS;AAAA,QAC5B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,eAAe,CAAC,GAAG,YAAY;AAAA,QAC/B,QAAQ;AAAA,MACV;AAAA,IACF;AAAA,IACA,SAAS,EAAE,MAAM,GAAG;AAClB,YAAM,gBAAgB,MAAM,WAAW,SAAS;AAAA,QAC9C,CAAC,YAAY,QAAQ,aAAa;AAAA,MACpC;AACA,YAAM,QAA6B;AAAA,QACjC,cAAc;AAAA,UACZ,IAAI;AAAA,UACJ,QAAQ,MAAM,WAAW;AAAA,UACzB,UAAU;AAAA,UACV,QAAQ,MAAM,WAAW,KACrB,8BACA;AAAA,UACJ,UAAU,EAAE,UAAU,MAAM,WAAW,SAAS;AAAA,QAClD,CAAC;AAAA,QACD,cAAc;AAAA,UACZ,IAAI;AAAA,UACJ,QAAQ,cAAc,WAAW;AAAA,UACjC,UAAU;AAAA,UACV,QACE,cAAc,WAAW,IACrB,oBACA,GAAG,cAAc,MAAM;AAAA,UAC7B,UAAU,EAAE,UAAU,cAAc;AAAA,QACtC,CAAC;AAAA,MACH;AACA,UAAI,MAAM,UAAW,OAAM,KAAK,sBAAsB,MAAM,UAAU,MAAM,CAAC;AAC7E,aAAO;AAAA,IACT;AAAA,IACA,aAAa;AACX,aAAO,EAAE,MAAM,OAAO,MAAM,OAAO,QAAQ,uCAAuC;AAAA,IACpF;AAAA,IACA,MAAM,IAAI,QAAQ,KAAK;AACrB,YAAM,OAAO,MAAM,+BAA+B,SAAS,QAAQ,IAAI,MAAM,SAAS;AACtF,mBAAa,KAAK,IAAI;AACtB,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,eAAsB,yBACpB,SACsC;AACtC,QAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAC5D,QAAM,kBAAkB,QAAQ,IAAI;AACpC,QAAM,QAAqC,CAAC;AAC5C,MAAI,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAClD,MAAI,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AACzE,MAAI,eAAe,mBAAmB,KAAK;AAC3C,MAAI,YAAY,aAAa,SAAS,KAAK;AAC3C,MAAI,OAAO;AAEX,WAAS,YAAY,GAAG,aAAa,eAAe,aAAa;AAC/D,QAAI,QAAQ,QAAQ,QAAS,OAAM,IAAI,MAAM,iCAAiC;AAC9E,UAAM,WAAW,MAAM,QAAQ,KAAK;AAAA,MAClC,MAAM,QAAQ;AAAA,MACd,MAAM,QAAQ;AAAA,MACd;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,eAAe;AAAA,MACf,QAAQ,QAAQ;AAAA,IAClB,CAAC;AAED,WAAO,QAAQ,SAAS,IAAI;AAC5B,UAAM,OAAO,MAAM,+BAA+B,SAAS,UAAU,SAAS;AAC9E,YAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAC9C,iBAAa,KAAK;AAClB,mBAAe,KAAK;AACpB,gBAAY,KAAK;AACjB,UAAM,KAAK,IAAI;AACf,UAAM,QAAQ,SAAS,IAAI;AAE3B,QAAI,KAAM;AACV,QAAI,CAAC,KAAK,WAAW,KAAK,aAAa,WAAW,EAAG;AAAA,EACvD;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAAA,IACd,MAAM,QAAQ;AAAA,IACd,YAAY,MAAM;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAe,+BACb,SACA,UACA,YAAY,GACwB;AACpC,QAAM,eAA+B,CAAC;AACtC,aAAW,cAAc,SAAS,eAAe,CAAC,GAAG;AACnD,iBAAa,KAAK,GAAI,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,aAAa,CAAE;AAAA,EAC7F;AACA,aAAW,cAAc,SAAS,eAAe,CAAC,GAAG;AACnD,iBAAa,KAAK,MAAM,cAAc,QAAQ,MAAM,YAAY,QAAQ,aAAa,CAAC;AAAA,EACxF;AAEA,QAAM,UAAU,SAAS,eACrB,MAAM,0BAA0B,QAAQ,MAAM,SAAS,YAAY,IACnE;AAEJ,QAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,QAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,QAAM,eAAe,mBAAmB,KAAK;AAC7C,QAAM,YAAY,aAAa,SAAS,KAAK;AAC7C,QAAM,OAAO,QAAQ,SAAS,IAAI;AAClC,QAAM,QAAQ,qBAAqB;AAAA,IACjC,MAAM;AAAA,IACN,OAAO,QAAQ;AAAA,IACf,QAAQ,QAAQ;AAAA,IAChB,UAAU;AAAA,MACR,MAAM,QAAQ;AAAA,MACd;AAAA,MACA;AAAA,MACA,kBAAkB,aAAa;AAAA,MAC/B,SAAS,SAAS;AAAA,MAClB,cAAc,SAAS,SAAS,UAAU;AAAA,MAC1C,YAAY,WAAW,SAAS,OAAO,CAAC,YAAY,QAAQ,aAAa,OAAO,EAAE;AAAA,IACpF;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL;AAAA,IACA,OAAO,SAAS;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,SAAS;AAAA,EACrB;AACF;;;AIrKA,eAAsB,+BACpB,SAC+C;AAC/C,iCAA+B,OAAO;AACtC,QAAM,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC3C,QAAM,SAA+C,CAAC;AACtD,MAAI;AACJ,MAAI,WAA4B,CAAC;AACjC,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AAEJ,MAAI,aAAa,SAAS,kBAAkB,GAAG;AAC7C,QAAI,QAAQ,WAAW;AACrB,kBAAY,MAAM;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,4BAA4B,QAAQ,SAAU;AAAA,QACvD;AAAA,QACA;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,oBAAoB,+BAA+B;AAAA,IAC5E;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,eAAe,GAAG;AAC1C,QAAI,QAAQ,UAAU;AACpB,iBAAW;AAAA,QACT,GAAI,MAAM;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA,YAAY;AACV,6BAAiB,QAAQ,MAAM;AAC/B,mBAAO,QAAQ,SAAU;AAAA,cACvB,MAAM,QAAQ;AAAA,cACd;AAAA,cACA,QAAQ,QAAQ;AAAA,cAChB;AAAA,YACF,CAAC;AAAA,UACH;AAAA,UACA,CAAC,cAAc,GAAG,UAAU,MAAM;AAAA,QACpC;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,iBAAiB,4BAA4B;AAAA,IACtE;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,uBAAuB,GAAG;AAClD,QAAI,QAAQ,kBAAkB;AAC5B,oBAAc,MAAM;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,iBAAkB;AAAA,YAC/B,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA;AAAA,MACF;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,yBAAyB,8BAA8B;AAAA,IAChF;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,kBAAkB,GAAG;AAC7C,QAAI,QAAQ,iBAAiB;AAC3B,wBAAkB,MAAM;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,gBAAiB;AAAA,YAC9B,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA,CAAC,WAAW,OAAO;AAAA,MACrB;AAAA,IACF,WAAW,QAAQ,mBAAmB;AACpC,wBAAkB,MAAM;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,2BAA2B,SAAS,WAAW;AAAA,QACxD;AAAA,QACA,CAAC,WAAW,OAAO;AAAA,MACrB;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,oBAAoB,0CAA0C;AAAA,IACvF;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,gBAAgB,GAAG;AAC3C,QAAI,QAAQ,iBAAiB;AAC3B,sBAAgB,MAAM;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,gBAAiB;AAAA,YAC9B,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA;AAAA,MACF;AACA,iBAAW,CAAC,GAAG,UAAU,GAAI,cAAc,YAAY,CAAC,CAAE;AAAA,IAC5D,OAAO;AACL,gBAAU,QAAQ,KAAK,kBAAkB,iCAAiC;AAAA,IAC5E;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,WAAW,GAAG;AACtC,QAAI,QAAQ,SAAS;AACnB,kBAAY,MAAM;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AACV,2BAAiB,QAAQ,MAAM;AAC/B,iBAAO,QAAQ,QAAS;AAAA,YACtB,MAAM,QAAQ;AAAA,YACd;AAAA,YACA,QAAQ,QAAQ;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,UACF,CAAC;AAAA,QACH;AAAA,QACA,CAAC,WAAW,GAAG,OAAO,WAAW,aAAa,MAAM,KAAK,OAAO,MAAM;AAAA,MACxE;AAAA,IACF,OAAO;AACL,gBAAU,QAAQ,KAAK,aAAa,4BAA4B;AAAA,IAClE;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,eAAe,2BACb,SACA,aACmC;AACnC,QAAM,WAAW,QAAQ;AACzB,MAAI,CAAC,UAAU;AACb,UAAM,IAAI,MAAM,0EAA0E;AAAA,EAC5F;AACA,QAAM,EAAE,MAAM,MAAM,GAAG,KAAK,IAAI;AAChC,QAAM,eAAe,QAAQ,8BAA8B,WAAW;AACtE,QAAM,gBAAgB,OAAO,KAAK,gBAAgB;AAClD,QAAM,SAAS,MAAM,yBAAyB;AAAA,IAC5C,GAAG;AAAA,IACH,MAAM,QAAQ,QAAQ;AAAA,IACtB;AAAA,IACA,QAAQ,QAAQ;AAAA,IAChB,MAAM;AAAA,EACR,CAAC;AACD,SAAO;AAAA,IACL,SAAS,OAAO,MAAM,KAAK,CAAC,eAAe;AACzC,aAAO,WAAW,aAAa,SAAS,KAAK,QAAQ,WAAW,OAAO;AAAA,IACzE,CAAC;AAAA,IACD,SAAS,GAAG,OAAO,UAAU,gCAAgC,OAAO,OAAO,IAAI,CAAC;AAAA,IAChF,UAAU;AAAA,EACZ;AACF;AAEA,SAAS,8BACP,aACyC;AACzC,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,SAAO,OAAO,EAAE,GAAG,aAAa,MAAM,YAAY,QAAQ,KAAK;AACjE;AAEA,eAAe,SACb,QACA,KACA,OACA,QACA,WACY;AACZ,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,MAAI;AACF,UAAM,SAAS,MAAM,OAAO;AAC5B,WAAO,KAAK;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,MACR,SAAS,UAAU,MAAM;AAAA,MACzB;AAAA,MACA,YAAY,IAAI,EAAE,YAAY;AAAA,IAChC,CAAC;AACD,WAAO;AAAA,EACT,SAAS,OAAO;AACd,WAAO,KAAK;AAAA,MACV;AAAA,MACA,QAAQ;AAAA,MACR,SAAU,MAAgB;AAAA,MAC1B;AAAA,MACA,YAAY,IAAI,EAAE,YAAY;AAAA,IAChC,CAAC;AACD,UAAM;AAAA,EACR;AACF;AAEA,SAAS,UACP,QACA,KACA,OACA,SACM;AACN,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,SAAO,KAAK,EAAE,OAAO,QAAQ,WAAW,SAAS,WAAW,WAAW,YAAY,UAAU,CAAC;AAChG;AAEA,SAAS,yBAAyB,QAAmD;AACnF,SAAO,GAAG,OAAO,WAAW,MAAM,yBAAyB,KAAK,UAAU,OAAO,YAAY,CAAC;AAChG;AAEA,SAAS,6BAA6B,UAAiD;AACrF,QAAM,kBAAkB,SAAS,aAAa,UAAU;AACxD,QAAM,kBAAkB,SAAS,aAAa,UAAU;AACxD,QAAM,WAAW,SAAS,eAAe,aAAa;AACtD,SAAO,GAAG,eAAe,oBAAoB,eAAe,oBAAoB,QAAQ;AAC1F;AAEA,SAAS,uBAAuB,QAAwC;AACtE,QAAM,UAAU,OAAO,QAAQ,OAAO,OAAO,EAC1C,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,EACrC,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG,IAAI,aAAa,KAAK,CAAC,EAAE,EACrD,KAAK,IAAI;AACZ,SAAO,GAAG,OAAO,SAAS,WAAW,QAAQ,GAAG,UAAU,KAAK,OAAO,KAAK,EAAE;AAC/E;AAEA,SAAS,aAAa,OAAuB;AAC3C,SAAO,OAAO,SAAS,KAAK,IAAI,MAAM,QAAQ,CAAC,IAAI,OAAO,KAAK;AACjE;AAEA,SAAS,aACP,SACA,OACS;AACT,SAAO,CAAC,QAAQ,iBAAiB,QAAQ,cAAc,SAAS,KAAK;AACvE;AAEA,SAAS,+BAA+B,SAAsD;AAC5F,aAAW,SAAS,QAAQ,kBAAkB,CAAC,GAAG;AAChD,QAAI,CAAC,aAAa,SAAS,KAAK,GAAG;AACjC,YAAM,IAAI,MAAM,kBAAkB,KAAK,iBAAiB;AAAA,IAC1D;AACA,QAAI,CAAC,gBAAgB,SAAS,KAAK,GAAG;AACpC,YAAM,IAAI,MAAM,qBAAqB,KAAK,CAAC;AAAA,IAC7C;AAAA,EACF;AACF;AAEA,SAAS,gBACP,SACA,OACS;AACT,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,aAAO,QAAQ,QAAQ,SAAS;AAAA,IAClC,KAAK;AACH,aAAO,QAAQ,QAAQ,QAAQ;AAAA,IACjC,KAAK;AACH,aAAO,QAAQ,QAAQ,gBAAgB;AAAA,IACzC,KAAK;AACH,aAAO,QAAQ,QAAQ,mBAAmB,QAAQ,iBAAiB;AAAA,IACrE,KAAK;AACH,aAAO,QAAQ,QAAQ,eAAe;AAAA,IACxC,KAAK;AACH,aAAO,QAAQ,QAAQ,OAAO;AAAA,EAClC;AACF;AAEA,SAAS,qBAAqB,OAA6C;AACzE,UAAQ,OAAO;AAAA,IACb,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,EACX;AACF;AAEA,SAAS,iBAAiB,QAAuC;AAC/D,MAAI,QAAQ,SAAS;AACnB,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AACF;;;APlSA,IAAM,eAAe,EAAE,OAAO,EAAE,MAAM,gBAAgB;AACtD,IAAM,cAAc,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,IAAK;AAC/C,IAAM,wBAAwB,EAC3B,OAAO,EACP,IAAI,CAAC,EACL,IAAI,GAAG,EACP,MAAM,8BAA8B;AAEvC,IAAM,4CAA4C,EAC/C,OAAO;AAAA,EACN,QAAQ,EAAE,KAAK,CAAC,aAAa,UAAU,CAAC;AAAA,EACxC,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,SAAS,EAAE,QAAQ;AAAA,EACnB,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS;AAAA,EAC1C,WAAW,EAAE,QAAQ;AACvB,CAAC,EACA,OAAO;AAEV,IAAM,6CAA6C,EAChD,OAAO;AAAA,EACN,MAAM,EAAE,QAAQ,yCAAyC;AAAA,EACzD,aAAa;AAAA,EACb,UAAU;AAAA,EACV,QAAQ;AACV,CAAC,EACA,OAAO;AAIV,IAAM,0BAA0B,EAAE,KAAK;AAAA,EACrC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,IAAM,kBAAkB,EAAE,OAAkB,CAAC,UAAU;AACrD,MAAI;AACF,sBAAkB,KAAK;AACvB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF,GAAG,8BAA8B;AACjC,IAAM,sCAAsC,EACzC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,QAAQ,EAAE,QAAQ,eAAe;AACnC,CAAC,EACA,OAAO;AACV,IAAM,iCAAiC,EACpC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,QAAQ,EAAE,KAAK,CAAC,WAAW,WAAW,CAAC;AAAA,EACvC,YAAY;AAAA,EACZ,YAAY,EAAE,MAAM,eAAe,EAAE,IAAI,CAAC;AAC5C,CAAC,EACA,OAAO;AACV,IAAM,8BAA8B,EACjC,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC3B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,QAAQ,EAAE,QAAQ,OAAO;AAAA,EACzB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACvB,YAAY;AAAA,EACZ,YAAY,EAAE,MAAM,eAAe,EAAE,IAAI,CAAC;AAC5C,CAAC,EACA,OAAO;AACV,IAAM,0BAA0B,EAC7B,OAAO;AAAA,EACN,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,EACvC,QAAQ,EAAE,QAAQ;AAAA,EAClB,YAAY,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,SAAS;AAAA,EAC/D,OAAO,EAAE,OAAO,EAAE,SAAS;AAAA,EAC3B,YAAY,EAAE,mBAAmB,UAAU;AAAA,IACzC;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACH,CAAC,EACA,OAAO,EACP,YAAY,CAAC,QAAQ,YAAY;AAChC,MAAI,OAAO,WAAW,WAAW,gBAAiB;AAClD,QAAM,mBAAmB,YAAY,OAAO,WAAW,UAAU;AACjE,MAAI,qBAAqB,OAAO,WAAW,YAAY;AACrD,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,cAAc,YAAY;AAAA,MACjC,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF,CAAC;AACH,IAAM,wBAAwB,EAC3B,OAAO;AAAA,EACN,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACrC,aAAa;AAAA,EACb,UAAU;AAAA,EACV,eAAe,aAAa,SAAS;AAAA,EACrC,cAAc,aAAa,SAAS;AAAA,EACpC,mBAAmB,aAAa,SAAS;AAAA,EACzC,QAAQ;AAAA,EACR,WAAW,EAAE,IAAI,SAAS;AAAA,EAC1B,WAAW,EAAE,IAAI,SAAS;AAC5B,CAAC,EACA,OAAO;AAEH,IAAM,qCAAqC,EAC/C,OAAO;AAAA,EACN,OAAO;AAAA,EACP,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACtB,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACtB,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,WAAW,EAAE,IAAI,SAAS;AAAA,EAC1B,WAAW,EAAE,IAAI,SAAS;AAAA,EAC1B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAAA,EACpC,YAAY,EAAE,MAAM,qBAAqB;AAAA,EACzC,qBAAqB,sBAAsB,SAAS;AAAA,EACpD,eAAe,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAC5C,CAAC,EACA,OAAO,EACP,YAAY,CAAC,OAAO,YAAY;AAC/B,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,CAAC,OAAO,SAAS,KAAK,MAAM,WAAW,QAAQ,GAAG;AAC3D,QAAI,aAAa,IAAI,UAAU,WAAW,GAAG;AAC3C,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,OAAO,aAAa;AAAA,QACzC,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,iBAAa,IAAI,UAAU,WAAW;AACtC,QAAI,UAAU,aAAa,MAAM,UAAU;AACzC,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,OAAO,UAAU;AAAA,QACtC,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,QAAI,UAAU,WAAW,mBAAmB;AAC1C,UAAI,CAAC,UAAU,iBAAiB,CAAC,UAAU,gBAAgB,CAAC,UAAU,mBAAmB;AACvF,gBAAQ,SAAS;AAAA,UACf,MAAM;AAAA,UACN,MAAM,CAAC,cAAc,KAAK;AAAA,UAC1B,SAAS;AAAA,QACX,CAAC;AAAA,MACH;AAAA,IACF;AACA,QACE,UAAU,WAAW,eACpB,CAAC,UAAU,iBAAiB,CAAC,UAAU,gBAAgB,CAAC,UAAU,oBACnE;AACA,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,KAAK;AAAA,QAC1B,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,QACE,UAAU,WAAW,cACrB,QAAQ,UAAU,YAAY,MAAM,QAAQ,UAAU,iBAAiB,GACvE;AACA,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,KAAK;AAAA,QAC1B,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AACA,QAAI,UAAU,WAAW,cAAc,MAAM,WAAW,YAAY;AAClE,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,cAAc,OAAO,QAAQ;AAAA,QACpC,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF;AACA,MAAI,MAAM,WAAW,YAAY;AAC/B,UAAM,WAAW,MAAM,WAAW;AAAA,MAChC,CAAC,cAAc,UAAU,gBAAgB,MAAM;AAAA,IACjD;AACA,QAAI,SAAS,WAAW,KAAK,SAAS,CAAC,GAAG,WAAW,YAAY;AAC/D,cAAQ,SAAS;AAAA,QACf,MAAM;AAAA,QACN,MAAM,CAAC,qBAAqB;AAAA,QAC5B,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF,WAAW,MAAM,wBAAwB,QAAW;AAClD,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,qBAAqB;AAAA,MAC5B,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MACE,MAAM,WAAW,qBACjB,MAAM,WAAW,OAAO,CAAC,cAAc,UAAU,WAAW,iBAAiB,EAAE,WAAW,GAC1F;AACA,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,QAAQ;AAAA,MACf,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MAAI,MAAM,WAAW,aAAa,MAAM,kBAAkB,QAAW;AACnE,YAAQ,SAAS;AAAA,MACf,MAAM;AAAA,MACN,MAAM,CAAC,eAAe;AAAA,MACtB,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF,CAAC;AAEI,IAAM,qCAAqC,EAC/C,OAAO;AAAA,EACN,MAAM,EAAE,QAAQ,gCAAgC;AAAA,EAChD,OAAO;AAAA,EACP,aAAa;AAAA,EACb,WAAW,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS;AAAA,EACrC,UAAU;AAAA,EACV,UAAU;AAAA,EACV,eAAe;AAAA,EACf,mBAAmB;AAAA,EACnB,YAAY,EAAE,QAAQ;AAAA,EACtB,WAAW,EAAE,QAAQ,EAAE,SAAS;AAAA,EAChC,WAAW,EAAE,QAAQ;AAAA,EACrB,YAAY;AAAA,EACZ,WAAW,EAAE,QAAQ,EAAE,SAAS;AAClC,CAAC,EACA,OAAO;AAKH,IAAM,yCAAyC,EACnD,OAAO;AAAA,EACN,MAAM,EAAE,QAAQ,iCAAiC;AAAA,EACjD,OAAO;AAAA,EACP,aAAa;AAAA,EACb,UAAU;AAAA,EACV,UAAU;AAAA,EACV,eAAe;AAAA,EACf,cAAc;AAAA,EACd,mBAAmB;AACrB,CAAC,EACA,OAAO;AAuGV,IAAM,uBAAuB,KAAK,KAAK;AACvC,IAAM,gBAAyD;AAAA,EAC7D;AAAA,EACA;AACF;AACA,IAAM,oBAA6D;AAAA,EACjE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,SAAS,0BAA0B,MAAc,MAAsB;AAC5E,SAAO,SAAS,SAAS,GAAG,IAAI,IAAI,IAAI,EAAE;AAC5C;AAEO,SAAS,2BAA2B,MAAc,OAAuB;AAC9E,QAAM,cAAc,YAAY,MAAM,KAAK;AAC3C,QAAM,YAAY,sBAAsB,UAAU,WAAW;AAC7D,QAAM,aAAa,UAAU,UACzB,UAAU,OACV,GAAG,QAAQ,WAAW,EAAE,MAAM,GAAG,EAAE,CAAC,IAAI,OAAO,WAAW,EAAE,MAAM,GAAG,EAAE,CAAC;AAC5E,QAAM,kBAAkB,KAAK,UAAU,IAAI,EAAE,UAAU,cAAc;AACrE,QAAM,SAAS,KAAK,iBAAiB,UAAU;AAC/C,QAAM,0BAA0B,QAAQ,eAAe;AACvD,QAAM,iBAAiB,QAAQ,MAAM;AACrC,MAAI,CAAC,eAAe,WAAW,GAAG,uBAAuB,GAAG,GAAG,EAAE,GAAG;AAClE,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AACA,SAAO;AACT;AAEA,eAAe,4BACb,MACA,OACA,QACA,KACY;AACZ,QAAM,SAAS,2BAA2B,MAAM,KAAK;AACrD,QAAM,eAAe,eAAe,MAAM,MAAM;AAChD,MAAI,CAAC,aAAc,OAAM,IAAI,MAAM,sDAAsD;AACzF,SAAO,kBAAkB,MAAM,cAAc,QAAQ,OAAO,iBAAiB;AAC3E,UAAM,SAAS,MAAM,IAAI,YAAY;AACrC,UAAM,iBAAiB,MAAM,KAAK,YAAY;AAC9C,UAAM,kBAAkB,MAAM;AAAA,MAAkB;AAAA,MAAM;AAAA,MAAc;AAAA,MAAO,CAAC,kBAC1E,KAAK,aAAa;AAAA,IACpB;AACA,QAAI,eAAe,QAAQ,gBAAgB,OAAO,eAAe,QAAQ,gBAAgB,KAAK;AAC5F,YAAM,IAAI,MAAM,wDAAwD;AAAA,IAC1E;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAsB,8BACpB,MACA,OAC8C;AAC9C,QAAM,gBAAgB,YAAY,MAAM,KAAK;AAC7C,MAAI;AACF,WAAO,MAAM;AAAA,MAA4B;AAAA,MAAM;AAAA,MAAe;AAAA,MAAO,CAAC,WACpE,qCAAqC,MAAM,eAAe,MAAM;AAAA,IAClE;AAAA,EACF,SAAS,OAAO;AACd,QAAI,cAAc,KAAK,EAAG,QAAO;AACjC,UAAM;AAAA,EACR;AACF;AAGA,eAAsB,yCACpB,SACkD;AAClD,+BAA6B;AAC7B,QAAM,YAAY,OAAO,OAAO,uCAAuC,MAAM,QAAQ,SAAS,CAAC;AAC/F,QAAM,aAAa,mCAAmC,QAAQ,UAAU;AACxE,QAAM,SAAS,6BAA6B,UAAU;AACtD,qCAAmC,YAAY,WAAW,QAAQ,QAAQ,QAAQ;AAClF,SAAO,4BAA4B,QAAQ,MAAM,UAAU,OAAO,OAAO,OAAO,WAAW;AACzF,UAAM,SAAS,MAAM;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,IACV;AACA,WAAO,QAAQ,UAAU;AAAA,EAC3B,CAAC;AACH;AAEA,eAAe,qCACb,MACA,OACA,QACuC;AACvC,QAAM,YAAY,MAAM,0BAA0B,QAAQ,YAAY;AACtE,QAAM,MAAM,KAAK,MAAM,UAAU,MAAM,SAAS,MAAM,CAAC;AACvD,QAAM,QAAQ,mCAAmC,MAAM,GAAG;AAC1D,MAAI,MAAM,UAAU,OAAO;AACzB,UAAM,IAAI,MAAM,8DAA8D;AAAA,EAChF;AACA,MAAI,QAAQ,MAAM,IAAI,MAAM,QAAQ,IAAI,GAAG;AACzC,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AACA,aAAW,aAAa,MAAM,YAAY;AACxC,QAAI,UAAU,WAAW,UAAW,OAAM,yBAAyB,QAAQ,SAAS;AAAA,EACtF;AACA,SAAO;AACT;AAGO,SAAS,iCACd,QACkC;AAClC,MAAI,CAAC,OAAO,UAAW,OAAM,IAAI,MAAM,+CAA+C;AACtF,SAAO,gBAAgB,OAAO,OAAO,OAAO,OAAO,OAAO,SAAS;AACrE;AAGA,eAAsB,mCACpB,SACA,KACY;AACZ,+BAA6B;AAC7B,QAAM,YAAY,OAAO,OAAO,uCAAuC,MAAM,QAAQ,SAAS,CAAC;AAC/F,SAAO,4BAA4B,QAAQ,MAAM,UAAU,OAAO,OAAO,OAAO,WAAW;AACzF,UAAM,QAAQ,MAAM,qCAAqC,QAAQ,MAAM,UAAU,OAAO,MAAM;AAC9F,WAAO;AAAA,MAA8B,QAAQ;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAW,CAAC,aAC5E;AAAA,QAAqB;AAAA,QAAQ,UAAU;AAAA,QAAU,CAAC,iBAChD;AAAA,UAA0B;AAAA,UAAc,UAAU;AAAA,UAAU;AAAA,UAAY,CAAC,aACvE;AAAA,YACE,SAAS;AAAA,YACT,UAAU;AAAA,YACV;AAAA,YACA,CAAC,cACC;AAAA,cACE,OAAO,OAAO;AAAA,gBACZ;AAAA,gBACA,YAAY,mBAAmB,gBAAgB,SAAS,SAAS,UAAU,CAAC;AAAA,gBAC5E,UAAU,OAAO,OAAO,EAAE,MAAM,UAAU,MAAM,UAAU,SAAS,CAAC;AAAA,gBACpE,WAAW,OAAO,OAAO,EAAE,MAAM,WAAW,MAAM,UAAU,cAAc,CAAC;AAAA,cAC7E,CAAC;AAAA,YACH;AAAA,UACJ;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAGA,eAAsB,kCACpB,SACA,KACY;AACZ,+BAA6B;AAC7B,QAAM,eAAe,OAAO;AAAA,IAC1B,uCAAuC,MAAM,QAAQ,SAAS;AAAA,EAChE;AACA,SAAO,4BAA4B,QAAQ,MAAM,aAAa,OAAO,OAAO,OAAO,WAAW;AAC5F,UAAM,QAAQ,MAAM;AAAA,MAClB,QAAQ;AAAA,MACR,aAAa;AAAA,MACb;AAAA,IACF;AACA,WAAO;AAAA,MAA8B,QAAQ;AAAA,MAAM;AAAA,MAAQ;AAAA,MAAO;AAAA,MAAc,CAAC,aAC/E;AAAA,QAA0B,SAAS;AAAA,QAAM,aAAa;AAAA,QAAe;AAAA,QAAa,CAAC,SACjF;AAAA,UACE,OAAO,OAAO;AAAA,YACZ;AAAA,YACA,WAAW;AAAA,YACX,YAAY,mBAAmB,gBAAgB,SAAS,SAAS,UAAU,CAAC;AAAA,UAC9E,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAGA,eAAsB,0BACpB,SAC6C;AAC7C,SAAO,6BAA6B,SAAS,WAAW;AAC1D;AAGA,eAAsB,kCACpB,SAC6C;AAC7C,SAAO,6BAA6B,SAAS,UAAU;AACzD;AAEA,eAAe,6BACb,SACA,QAC6C;AAC7C,+BAA6B;AAC7B,QAAM,eAAe,OAAO;AAAA,IAC1B,uCAAuC,MAAM,QAAQ,SAAS;AAAA,EAChE;AACA,QAAM,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC3C,QAAM,aAAa,QAAQ,aACvB,sCAAsC,QAAQ,YAAY,cAAc,MAAM,IAC9E;AACJ,SAAO,4BAA4B,QAAQ,MAAM,aAAa,OAAO,OAAO,OAAO,WAAW;AAC5F,UAAM,QAAQ,MAAM,gBAAgB,QAAQ;AAAA,MAC1C,SAAS,QAAQ,WAAW,OAAO,QAAQ,GAAG;AAAA,MAC9C,OAAO,QAAQ,cAAc;AAAA,IAC/B,CAAC;AACD,QAAI;AACF,YAAM,YAAY;AAClB,YAAM,QAAQ,MAAM;AAAA,QAClB,QAAQ;AAAA,QACR,aAAa;AAAA,QACb;AAAA,MACF;AACA,aAAO,MAAM;AAAA,QACX;AAAA,UACE,MAAM,QAAQ;AAAA,UACd;AAAA,UACA;AAAA,UACA;AAAA,UACA,YAAY,QAAQ,cAAc;AAAA,UAClC,gBAAgB,MAAM;AAAA,UACtB;AAAA,UACA,SAAS,QAAQ;AAAA,UACjB;AAAA,QACF;AAAA,QACA;AAAA,MACF;AAAA,IACF,UAAE;AACA,YAAM,MAAM,QAAQ;AAAA,IACtB;AAAA,EACF,CAAC;AACH;AAEA,eAAsB,qBACpB,SACqC;AACrC,+BAA6B;AAC7B,oCAAkC,OAAO;AACzC,QAAM,MAAM,QAAQ,QAAQ,MAAM,oBAAI,KAAK;AAC3C,QAAM,QAAQ,YAAY;AAAA,IACxB,QAAQ,SAAS,0BAA0B,QAAQ,MAAM,QAAQ,IAAI;AAAA,EACvE;AACA,SAAO;AAAA,IAA4B,QAAQ;AAAA,IAAM;AAAA,IAAO;AAAA,IAAM,CAAC,WAC7D,0BAA0B,SAAS,OAAO,QAAQ,GAAG;AAAA,EACvD;AACF;AAEA,eAAe,0BACb,SACA,OACA,QACA,KACqC;AACrC,QAAM,QAAQ,MAAM,gBAAgB,QAAQ;AAAA,IAC1C,SAAS,QAAQ,WAAW,OAAO,QAAQ,GAAG;AAAA,IAC9C,OAAO,QAAQ,cAAc;AAAA,EAC/B,CAAC;AAED,MAAI;AACF,UAAM,YAAY;AAClB,QAAI,QACF,QAAQ,WAAW,QACf,OACA,MAAM,qCAAqC,QAAQ,MAAM,OAAO,MAAM,EAAE,MAAM,CAAC,UAAU;AACvF,UAAI,cAAc,KAAK,EAAG,QAAO;AACjC,YAAM;AAAA,IACR,CAAC;AACP,QAAI,CAAC,OAAO;AACV,YAAM,WAAW,MAAM,kBAAkB,QAAQ,IAAI;AACrD,YAAM,uBAAuB,QAAQ,QAAQ,MAAM,QAAQ;AAC3D,cAAQ;AAAA,QACN;AAAA,QACA,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,QAAQ;AAAA,QACR;AAAA,QACA,WAAW,IAAI,EAAE,YAAY;AAAA,QAC7B,WAAW,IAAI,EAAE,YAAY;AAAA,QAC7B,SAAS,MAAM;AAAA,QACf,YAAY,CAAC;AAAA,MACf;AACA,YAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,YAAM,aAAa,QAAQ,EAAE,MAAM,eAAe,OAAO,SAAS,CAAC;AAAA,IACrE;AACA,QAAI,MAAM,SAAS,QAAQ,MAAM;AAC/B,YAAM,IAAI,MAAM,+DAA+D;AAAA,IACjF;AACA,UAAM,sBAAsB,MAAM;AAClC,UAAM,oBACJ,MAAM,WAAW,aACb,MAAM,WAAW,KAAK,CAACC,eAAcA,WAAU,gBAAgB,mBAAmB,IAClF;AACN,QAAI,MAAM,WAAW,cAAc,CAAC,mBAAmB;AACrD,YAAM,IAAI,MAAM,oDAAoD;AAAA,IACtE;AACA,QAAI,MAAM,WAAW,YAAY;AAC/B,YAAM,WAAW;AACjB,YAAM,gBAAgB;AACtB,aAAO,sBAAsB,QAAQ,MAAM,YAAY;AACrD,cAAM,cAAc,MAAM,kBAAkB,QAAQ,IAAI;AACxD,YAAI,gBAAgB,SAAS,eAAe;AAC1C,gBAAM,IAAI;AAAA,YACR,6CAA6C,SAAS,aAAa,SAAS,WAAW;AAAA,UACzF;AAAA,QACF;AACA,cAAMC,YAAW,MAAM;AAAA,UACrB;AAAA,UACA,gBAAgB,OAAO,eAAe,QAAQ;AAAA,QAChD;AACA,eAAO;AAAA,UACL;AAAA,UACA,OAAO;AAAA,UACP,WAAW;AAAA,UACX,YAAYA,UAAS;AAAA,UACrB,UAAU;AAAA,UACV,SAAS;AAAA,QACX;AAAA,MACF,CAAC;AAAA,IACH;AACA,UAAM,sBAAsB,QAAQ,MAAM,MAAM,MAAS;AACzD,UAAM,uBAAuB,QAAQ,QAAQ,MAAM,MAAM,QAAQ;AAEjE,QAAI,MAAM,WAAW,WAAW;AAC9B,aAAO,EAAE,OAAO,OAAO,UAAU,OAAO,SAAS,KAAK;AAAA,IACxD;AAEA,UAAM,gBAAgB,KAAK,IAAI,GAAG,QAAQ,iBAAiB,CAAC;AAC5D,QAAI,YAAY,oBAAoB,KAAK;AACzC,QAAI;AACJ,QAAI;AACJ,QAAI;AAEJ,WAAO,aAAa,MAAM,WAAW,SAAS,eAAe;AAC3D,UAAI,CAAC,WAAW;AACd,cAAM,cAAc,MAAM,kBAAkB,QAAQ,IAAI;AACxD,YAAI,gBAAgB,MAAM,UAAU;AAClC,kBAAQ,MAAM;AAAA,YACZ;AAAA,YACA;AAAA,YACA,oDAAoD,MAAM,QAAQ,SAAS,WAAW;AAAA,YACtF,QAAQ;AAAA,YACR;AAAA,UACF;AACA,iBAAO,EAAE,OAAO,OAAO,UAAU,OAAO,SAAS,KAAK;AAAA,QACxD;AACA,cAAM,cAAc;AACpB,oBAAY,MAAM;AAAA,UAAqB;AAAA,UAAQ,YAAY;AAAA,UAAU,CAAC,iBACpE,yBAAyB,QAAQ,aAAa,cAAc,GAAG;AAAA,QACjE;AACA,cAAM,WAAW,KAAK,SAAS;AAC/B,cAAM,SAAS;AACf,cAAM,YAAY,IAAI,EAAE,YAAY;AACpC,cAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,cAAM,aAAa,QAAQ;AAAA,UACzB,MAAM;AAAA,UACN;AAAA,UACA,aAAa,UAAU;AAAA,UACvB,WAAW,UAAU;AAAA,QACvB,CAAC;AAAA,MACH;AAEA,YAAM,WAAW,MAAM,iBAAiB,OAAO,QAAQ,OAAO,WAAW,SAAS,GAAG;AACrF,kBAAY,SAAS;AACrB,YAAM,aAAa,SAAS;AAC5B,kBAAY,SAAS;AAErB,UAAI,WAAW,QAAQ;AACrB,kBAAU,SAAS;AACnB,kBAAU,YAAY,IAAI,EAAE,YAAY;AACxC,cAAM,SAAS;AACf,cAAM,YAAY,IAAI,EAAE,YAAY;AACpC,cAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,cAAM,aAAa,QAAQ;AAAA,UACzB,MAAM;AAAA,UACN;AAAA,UACA,aAAa,UAAU;AAAA,QACzB,CAAC;AACD;AAAA,MACF;AAEA,gBAAU,SAAS;AACnB,YAAM,SAAS;AACf,YAAM,YAAY,IAAI,EAAE,YAAY;AACpC,YAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,YAAM,aAAa,QAAQ;AAAA,QACzB,MAAM;AAAA,QACN;AAAA,QACA,aAAa,UAAU;AAAA,MACzB,CAAC;AACD,8BAAwB;AACxB,+BAAyB;AACzB,kBAAY;AAAA,IACd;AAEA,QAAI,CAAC,WAAW;AACd,YAAM,SAAS;AACf,YAAM,YAAY,IAAI,EAAE,YAAY;AACpC,YAAM,UAAU,QAAQ,OAAO,QAAQ,OAAO;AAC9C,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,WAAW;AAAA,QACX,GAAI,yBAAyB,EAAE,YAAY,uBAAuB,IAAI,CAAC;AAAA,QACvE;AAAA,QACA,UAAU;AAAA,QACV,SAAS;AAAA,MACX;AAAA,IACF;AAEA,UAAM,WAAW,MAAM,wBAAwB,QAAQ,gBAAgB,OAAO,OAAO,SAAS,CAAC;AAC/F,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY,SAAS;AAAA,MACrB;AAAA,MACA,UAAU;AAAA,MACV,SAAS;AAAA,IACX;AAAA,EACF,UAAE;AACA,UAAM,MAAM,QAAQ;AAAA,EACtB;AACF;AAoBA,eAAe,8BACb,OACA,QAC6C;AAC7C,QAAM,EAAE,cAAc,QAAQ,MAAM,IAAI;AACxC,sBAAoB,MAAM,MAAM,cAAc,KAAK;AACnD,QAAM,YAAY,MAAM,WAAW,KAAK,CAAC,UAAU,MAAM,gBAAgB,aAAa,WAAW;AACjG,MACE,CAAC,aACD,cAAc,qBAAqB,aAAa,OAAO,OAAO,SAAS,CAAC,MACtE,cAAc,YAAY,GAC5B;AACA,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AAEA,QAAM,SAAS,WAAW,cAAc,cAAc;AACtD,QAAM,cAAc,WAAW,cAAc,aAAa,gBAAgB,aAAa;AACvF,QAAM,UAAU,oCAAoC,cAAc,MAAM;AACxE,QAAM,gBAAgB,MAAM,aACxB,oCAAoC,MAAM,WAAW,WAAW,MAAM,KACtE;AACJ,SAAO;AAAA,IACL,MAAM;AAAA,IACN,OAAO,iBAAiB;AACtB,YAAM,cAAc,MAAM;AACxB,qBAAa,YAAY;AACzB,cAAM,eAAe;AAAA,MACvB;AACA,kBAAY;AACZ,YAAM,kBAAkB,aAAa;AACrC,YAAM,WACJ,aAAa,UAAU,YAAY,UAAU,aAAa,WAAW;AACvE,YAAM,qBAAqB,MAAM,aAC7B,MAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA,MAAM,WAAW;AAAA,QACjB;AAAA,QACA,MAAM,WAAW;AAAA,MACnB,IACA;AACJ,UAAI,oBAAoB;AACtB,YAAI,UAAU,cAAc,YAAY;AACtC,gBAAM,IAAI,MAAM,sEAAsE;AAAA,QACxF;AACA,YAAI,UAAU;AACZ,gBAAM,gBAAgB,MAAM,kBAAkB,MAAM,IAAI;AACxD,cAAI,kBAAkB,mBAAmB,SAAS,WAAW;AAC3D,kBAAM,IAAI,MAAM,uEAAuE;AAAA,UACzF;AACA,gBAAM,+BAA+B;AAAA,YACnC,MAAM,MAAM;AAAA,YACZ;AAAA,YACA,aAAa,SAAS;AAAA,YACtB;AAAA,UACF,CAAC;AAAA,QACH;AACA,YAAI,mBAAmB,OAAO,QAAQ,WAAW,YAAY;AAC3D,gBAAM,SAAS;AAAA,YACb;AAAA,YACA;AAAA,YACA,mBAAmB,SAAS;AAAA,UAC9B;AACA,gBAAM,UAAU,MAAM;AAAA,YACpB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA,mBAAmB,SAAS;AAAA,UAC9B;AACA,iBAAO,EAAE,GAAG,SAAS,kBAAkB,mBAAmB,OAAO;AAAA,QACnE;AACA,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA,WAAW,eAAe,MAAM,WAAW;AAAA,UAC3C;AAAA,UACA,mBAAmB;AAAA,UACnB,mBAAmB;AAAA,QACrB;AAAA,MACF;AACA,UAAI,UAAU,cAAc,YAAY;AACtC,cAAM,+BAA+B;AAAA,UACnC,MAAM,MAAM;AAAA,UACZ;AAAA,UACA,aAAa,SAAS;AAAA,UACtB;AAAA,QACF,CAAC;AAAA,MACH;AACA,YAAM,YAAY,UAAU,cAAc,UAAU,WAAW;AAC/D,UAAI,UACF,MAAM,cAAc,YAAY,UAAU,cAAc;AAC1D,YAAM,cAAc,MAAM,kBAAkB,MAAM,IAAI;AACtD,UAAI,gBAAgB,WAAW,iBAAiB;AAChD,UAAI,aAAa,gBAAgB,aAAa;AAC5C,cAAM,IAAI,MAAM,uBAAuB,MAAM,qCAAqC;AAAA,MACpF;AACA,UAAI,MAAM,WAAW,cAAc,MAAM,wBAAwB,UAAU,aAAa;AACtF,cAAM,IAAI;AAAA,UACR,mCAAmC,MAAM,uBAAuB,SAAS;AAAA,QAC3E;AAAA,MACF;AACA,UACE,WAAW,eACX,MAAM,WAAW,cACjB,gBAAgB,aAAa,eAC7B;AACA,cAAM,IAAI;AAAA,UACR,6CAA6C,aAAa,aAAa,SAAS,WAAW;AAAA,QAC7F;AAAA,MACF;AACA,UAAI,MAAM,WAAW,cAAc,MAAM,WAAW,mBAAmB;AACrE,cAAM,IAAI;AAAA,UACR,wCAAwC,MAAM,SAAS,MAAM,MAAM,eAAe,UAAU,MAAM;AAAA,QACpG;AAAA,MACF;AACA,UAAI,gBAAgB,MAAM,YAAY,gBAAgB,aAAa,eAAe;AAChF,cAAM,SACJ,WAAW,cACP,2CAA2C,MAAM,QAAQ,SAAS,WAAW,KAC7E,8CAA8C,aAAa,aAAa,SAAS,WAAW;AAClG,cAAMC,YAAW,OAAO,OAAO;AAAA,UAC7B;AAAA,UACA,YAAY;AAAA,UACZ,WAAW;AAAA,UACX,SAAS;AAAA,UACT,eAAe;AAAA,UACf,WAAW;AAAA,QACb,CAAC;AACD,cAAMC,oBAAmB,MAAM,aAC3B,MAAM;AAAA,UACJ;AAAA,UACA;AAAA,UACA,MAAM;AAAA,UACN;AAAA,UACAD;AAAA,QACF,IACA;AACJ,cAAM,UAAU,MAAM;AAAA,UACpB;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,eAAOC,oBAAmB,EAAE,GAAG,SAAS,kBAAAA,kBAAiB,IAAI;AAAA,MAC/D;AAEA,UAAI,gBAAgB,eAAe,CAAC,SAAS;AAC3C,kBAAU,MAAM;AAAA,UACd,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,UACA,CAAC,aACC,qBAAqB,QAAQ,MAAM,UAAU,OAAO,iBAAiB;AACnE,kBAAM,aAAa,WAAW,cAAc,eAAe,SAAS;AACpE,kBAAM,aAAa,WAAW,cAAc,SAAS,OAAO;AAC5D,kBAAM,OAAO,MAAM,yBAAyB,YAAY,UAAU;AAClE,0CAA8B,MAAM,cAAc,MAAM;AACxD,mBAAO,gCAAgC;AAAA,cACrC,MAAM,MAAM;AAAA,cACZ;AAAA,cACA;AAAA,cACA;AAAA,cACA,WAAW,MAAM,uBAAuB,YAAY,IAAI;AAAA,cACxD,kBAAkB;AAAA,cAClB,KAAK,MAAM;AAAA,YACb,CAAC;AAAA,UACH,CAAC;AAAA,QACL;AACA,YAAI,CAAC,SAAS;AACZ,gBAAM,IAAI,MAAM,aAAa,MAAM,8CAA8C;AAAA,QACnF;AACA,wBAAgB,QAAQ;AACxB,YAAI;AACF,+CAAqC,SAAS,cAAc,MAAM;AAAA,QACpE,SAAS,OAAO;AACd,cAAI;AACF,kBAAM,iCAAiC;AAAA,cACrC,MAAM,MAAM;AAAA,cACZ;AAAA,cACA,aAAa;AAAA,cACb,cAAc;AAAA,YAChB,CAAC;AACD,kBAAM,+BAA+B;AAAA,cACnC,MAAM,MAAM;AAAA,cACZ;AAAA,cACA,aAAa;AAAA,cACb;AAAA,YACF,CAAC;AAAA,UACH,SAAS,cAAc;AACrB,kBAAM,IAAI;AAAA,cACR,CAAC,OAAO,YAAY;AAAA,cACpB,qBAAqB,MAAM;AAAA,YAC7B;AAAA,UACF;AACA,gBAAM;AAAA,QACR;AAAA,MACF;AACA,UAAI;AACF,YAAI,SAAS;AACX,gBAAM,8BAA8B;AAAA,YAClC,MAAM,MAAM;AAAA,YACZ;AAAA,YACA,aAAa;AAAA,YACb,cAAc;AAAA,UAChB,CAAC;AAAA,QACH;AACA,oBAAY;AACZ,YAAK,MAAM,kBAAkB,MAAM,IAAI,MAAO,aAAa;AACzD,gBAAM,IAAI,MAAM,aAAa,MAAM,6CAA6C;AAAA,QAClF;AACA,cAAM,oBAAoB,MAAM,IAAI;AAAA,MACtC,SAAS,OAAO;AACd,YAAI,CAAC,QAAS,OAAM;AACpB,YAAI,aAAa,MAAM,WAAY,OAAM;AACzC,YAAI;AACF,sBAAY;AAAA,QACd,SAAS,gBAAgB;AACvB,gBAAM,IAAI;AAAA,YACR,CAAC,OAAO,cAAc;AAAA,YACtB,aAAa,MAAM;AAAA,UACrB;AAAA,QACF;AACA,YAAI;AACF,gBAAM,iCAAiC;AAAA,YACrC,MAAM,MAAM;AAAA,YACZ;AAAA,YACA,aAAa;AAAA,YACb,cAAc;AAAA,UAChB,CAAC;AACD,gBAAM,+BAA+B;AAAA,YACnC,MAAM,MAAM;AAAA,YACZ;AAAA,YACA,aAAa;AAAA,YACb;AAAA,UACF,CAAC;AACD,gBAAM,oBAAoB,MAAM,IAAI;AAAA,QACtC,SAAS,eAAe;AACtB,gBAAM,IAAI;AAAA,YACR,CAAC,OAAO,aAAa;AAAA,YACrB,aAAa,MAAM;AAAA,UACrB;AAAA,QACF;AACA,cAAM;AAAA,MACR;AACA,gBAAU,SAAS,WAAW,cAAc,aAAa;AACzD,gBAAU,YAAY,MAAM,IAAI,EAAE,YAAY;AAC9C,YAAM,SAAS,UAAU;AACzB,UAAI,WAAW,YAAa,OAAM,sBAAsB,UAAU;AAAA,UAC7D,QAAO,MAAM;AAClB,aAAO,MAAM;AACb,YAAM,YAAY,MAAM,IAAI,EAAE,YAAY;AAC1C,YAAM,UAAU,QAAQ,OAAO,MAAM,OAAO;AAC5C,YAAM,+BAA+B,QAAQ,cAAc,MAAM;AACjE,UAAI,YAAY,MAAM,kBAAkB,MAAM,IAAI;AAClD,UAAI,cAAc,aAAa;AAC7B,cAAM,IAAI,MAAM,aAAa,MAAM,yCAAyC;AAAA,MAC9E;AACA,YAAM,WAAW,OAAO,OAAO;AAAA,QAC7B;AAAA,QACA,YAAY,gBAAgB,oBAAoB,cAAc,MAAM,IAAI;AAAA,QACxE,WAAW;AAAA,QACX,SAAS,kBAAkB;AAAA,QAC3B;AAAA,QACA,WAAW,cAAc;AAAA,MAC3B,CAAC;AACD,YAAM,mBAAmB,MAAM,aAC3B,MAAM;AAAA,QACJ;AAAA,QACA;AAAA,QACA,MAAM;AAAA,QACN;AAAA,QACA;AAAA,MACF,IACA;AACJ,UAAK,MAAM,kBAAkB,MAAM,IAAI,MAAO,WAAW;AACvD,cAAM,IAAI,MAAM,aAAa,MAAM,yCAAyC;AAAA,MAC9E;AACA,UAAI,SAAS;AACX,cAAM,+BAA+B;AAAA,UACnC,MAAM,MAAM;AAAA,UACZ;AAAA,UACA,aAAa;AAAA,UACb;AAAA,QACF,CAAC;AAAA,MACH;AACA,kBAAY,MAAM,kBAAkB,MAAM,IAAI;AAC9C,UAAI,cAAc,aAAa;AAC7B,cAAM,IAAI,MAAM,aAAa,MAAM,yCAAyC;AAAA,MAC9E;AACA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,WAAW;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,IACA;AAAA,MACE,SAAS,MAAM;AAAA,MACf,mBAAmB;AAAA,QACjB;AAAA,QACA;AAAA,QACA,UAAU,CAAC,gBACT,qCAAqC,aAAa,cAAc,MAAM;AAAA,QACxE,aAAa,MAAM,eAAe;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,kCACP,QACA,WACA,aACQ;AACR,SAAO,WAAW,cACd,2CAA2C,UAAU,QAAQ,SAAS,WAAW,KACjF,8CAA8C,UAAU,aAAa,SAAS,WAAW;AAC/F;AAEA,eAAe,yBACb,OACA,WACA,QACA,QACA,aAC6C;AAC7C,MAAI,MAAM,MAAM,WAAW,YAAY;AACrC,cAAU,SAAS;AACnB,cAAU,YAAY,MAAM,IAAI,EAAE,YAAY;AAC9C,WAAO,MAAM,MAAM;AAAA,EACrB;AACA,QAAM,SAAS,MAAM,QAAQ,MAAM,OAAO,QAAQ,MAAM,SAAS,MAAM,GAAG;AAC1E,QAAM,aAAa,MAAM,QAAQ;AAAA,IAC/B,MAAM,WAAW,cAAc,sBAAsB;AAAA,IACrD,OAAO,MAAM,aAAa;AAAA,IAC1B,aAAa,UAAU;AAAA,IACvB;AAAA,EACF,CAAC;AACD,SAAO,0BAA0B,OAAO,WAAW,OAAO,MAAM;AAAA,IAC9D;AAAA,IACA,YAAY;AAAA,IACZ,WAAW;AAAA,IACX,SAAS;AAAA,IACT,eAAe;AAAA,IACf,WAAW;AAAA,EACb,CAAC;AACH;AAEA,SAAS,0BACP,OACA,WACA,UACA,SACA,UACA,kBACoC;AACpC,SAAO;AAAA,IACL,OAAO,MAAM,aAAa;AAAA,IAC1B,OAAO,MAAM;AAAA,IACb;AAAA,IACA,GAAI,MAAM,YAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;AAAA,IACxD;AAAA,IACA,GAAI,mBAAmB,EAAE,iBAAiB,IAAI,CAAC;AAAA,IAC/C;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,oBACP,WACA,QACQ;AACR,SAAO,WAAW,cAAc,UAAU,WAAW,UAAU;AACjE;AAEA,SAAS,6BACP,YAC4B;AAC5B,SAAO,WAAW,WAAW,uBAAuB,cAAc;AACpE;AAEA,SAAS,sCACP,OACA,WACA,QACmD;AACnD,QAAM,aAAa,mCAAmC,MAAM,UAAU;AACtE,qCAAmC,YAAY,WAAW,QAAQ,MAAM,QAAQ;AAChF,QAAM,cAAc,EAAE,IAAI,SAAS,EAAE,MAAM,MAAM,WAAW;AAC5D,MACE,KAAK,MAAM,WAAW,IAAI,KAAK,MAAM,WAAW,YAAY,KAC5D,KAAK,MAAM,WAAW,KAAK,KAAK,MAAM,WAAW,SAAS,GAC1D;AACA,UAAM,IAAI,MAAM,kEAAkE;AAAA,EACpF;AACA,SAAO,OAAO,OAAO;AAAA,IACnB;AAAA,IACA;AAAA,IACA,UAAU,MAAM;AAAA,IAChB,cAAc,MAAM;AAAA,EACtB,CAAC;AACH;AAEA,SAAS,mCACP,YACA,WACA,QACA,UACM;AACN,MAAI,CAAC,SAAS,KAAK,EAAG,OAAM,IAAI,MAAM,2CAA2C;AACjF,MAAI,6BAA6B,UAAU,MAAM,QAAQ;AACvD,UAAM,IAAI,MAAM,qEAAqE;AAAA,EACvF;AACA,MAAI,WAAW,QAAQ,WAAW,GAAG;AACnC,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACpE;AACA,QAAM,mBAAmB,WAAW,QAAQ,CAAC;AAC7C,MAAI,iBAAiB,YAAY,eAAe,iBAAiB,aAAa,UAAU;AACtF,UAAM,IAAI,MAAM,gEAAgE;AAAA,EAClF;AACA,MACE,iBAAiB,uBACjB,wBAAwB,oBAAoB,WAAW,MAAM,CAAC,GAC9D;AACA,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACF;AAEA,SAAS,mCACP,OAC4B;AAC5B,QAAM,aAAa,iCAAiC,MAAM,KAAK;AAC/D,MAAI,yBAAyB,mBAAmB,UAAU,CAAC,MAAM,WAAW,QAAQ;AAClF,UAAM,IAAI,MAAM,kEAAkE;AAAA,EACpF;AACA,SAAO,mBAAmB,gBAAgB,UAAU,CAAC;AACvD;AAEA,SAAS,yCACP,OACkC;AAClC,QAAM,SAAS,uCAAuC,MAAM,KAAK;AACjE,MAAI,yBAAyB,mBAAmB,MAAM,CAAC,MAAM,OAAO,QAAQ;AAC1E,UAAM,IAAI,MAAM,yEAAyE;AAAA,EAC3F;AACA,SAAO,mBAAmB,gBAAgB,MAAM,CAAC;AACnD;AAEA,eAAe,iCACb,QACA,WACA,aACA,QACA,UAC2C;AAC3C,QAAM,SAAS;AAAA,IACb,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,IACA,MAAM,YAAY,aAAa,OAAO,OAAO,EAAE,GAAG,SAAS,CAAC,CAAC;AAAA,IAC7D,YAAY;AAAA,EACd;AACA,QAAM,SAAS,2CAA2C,MAAM;AAAA,IAC9D,MAAM;AAAA,IACN,aAAa,UAAU;AAAA,IACvB;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,WAAW,MAAM;AAAA,IACrB;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,IACA,YAAY;AAAA,EACd;AACA,MAAI,UAAU;AACZ,QAAI,cAAc,QAAQ,MAAM,cAAc,MAAM,GAAG;AACrD,YAAM,IAAI,MAAM,qEAAqE;AAAA,IACvF;AACA,WAAO,SAAS;AAAA,EAClB;AACA,QAAM;AAAA,IACJ;AAAA,IACA,8BAA8B,YAAY,WAAW,MAAM;AAAA,IAC3D;AAAA,EACF;AACA,QAAM,SAAS,MAAM;AAAA,IACnB;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,IACA,YAAY;AAAA,EACd;AACA,MAAI,CAAC,UAAU,cAAc,MAAM,MAAM,cAAc,MAAM,GAAG;AAC9D,UAAM,IAAI,MAAM,uDAAuD;AAAA,EACzE;AACA,SAAO,OAAO;AAChB;AAEA,eAAe,8BACb,QACA,WACA,YACA,QACA,UACsD;AACtD,MAAI;AACJ,MAAI;AACF,UAAM,OAAO,MAAM;AAAA,MACjB;AAAA,MACA,8BAA8B,WAAW,MAAM;AAAA,IACjD;AACA,UAAM,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC;AAAA,EAC9C,SAAS,OAAO;AACd,QAAI,cAAc,KAAK,EAAG,QAAO;AACjC,UAAM;AAAA,EACR;AACA,QAAM,SAAS,2CAA2C,MAAM,GAAG;AACnE,MAAI,OAAO,gBAAgB,UAAU,aAAa;AAChD,UAAM,IAAI,MAAM,0DAA0D;AAAA,EAC5E;AACA,QAAM,SAAS;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,EACT;AACA,SAAO,mBAAmB,EAAE,GAAG,QAAQ,OAAO,CAAC;AACjD;AAEA,SAAS,gCACP,YACA,WACA,QACA,UACA,eACA,aACA,aACkC;AAClC,qCAAmC,YAAY,WAAW,QAAQ,QAAQ;AAC1E,QAAM,WAAW,0CAA0C,MAAM,aAAa;AAC9E,QAAM,SAAS,yCAAyC,WAAW;AACnE,MACE,OAAO,mBAAmB,WAAW,UACpC,gBAAgB,UAAa,OAAO,gBAAgB,eACrD,KAAK,MAAM,OAAO,WAAW,IAAI,KAAK,MAAM,WAAW,YAAY,KACnE,KAAK,MAAM,OAAO,WAAW,KAAK,KAAK,MAAM,WAAW,SAAS,KACjE,SAAS,WAAW,UACpB,SAAS,aAAa,SAAS,eAAe,SAAS,cACtD,CAAC,SAAS,YAAY,SAAS,kBAAkB,QAAQ,SAAS,YACnE;AACA,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AAEA,QAAM,eAAe,wBAAwB,oBAAoB,WAAW,MAAM,CAAC;AACnF,QAAM,gBAAgB;AAAA,IACpB,WAAW,cAAc,UAAU,gBAAgB,UAAU;AAAA,EAC/D;AACA,QAAM,eAAe,wBAAwB,SAAS,UAAU;AAChE,QAAM,cAAc,wBAAwB,SAAS,SAAS;AAC9D,QAAM,UAAU,OAAO;AACvB,MAAI,SAAS,SAAS;AACpB,QACE,SAAS,kBAAkB,QAC3B,iBAAiB,gBACjB,gBAAgB,iBAChB,QAAQ,WAAW,aACnB,QAAQ,kBAAkB,SAAS,iBACnC,QAAQ,QAAQ,WAAW,KAC3B,QAAQ,QAAQ,CAAC,GAAG,YAAY,eAChC,QAAQ,QAAQ,CAAC,GAAG,aAAa,YACjC,QAAQ,QAAQ,CAAC,GAAG,iBAAiB,gBACrC,QAAQ,QAAQ,CAAC,GAAG,gBAAgB,aACpC;AACA,YAAM,IAAI,MAAM,oEAAoE;AAAA,IACtF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,iBAAiB,gBAAgB,gBAAgB,oBAAoB;AAC3E,MACE,gBAAgB,gBAChB,QAAQ,WAAW,kBACnB,QAAQ,QAAQ,WAAW,KAC3B,QAAQ,QAAQ,CAAC,GAAG,YAAY,eAChC,QAAQ,QAAQ,CAAC,GAAG,aAAa,YACjC,QAAQ,QAAQ,CAAC,GAAG,kBAAkB,aACtC;AACA,UAAM,IAAI,MAAM,sEAAsE;AAAA,EACxF;AACA,SAAO;AACT;AAEA,SAAS,8BAA8B,QAA8B;AACnE,QAAM,SAAS,mBAAmB,MAAM,MAAM;AAC9C,SAAO,sBAAsB,OAAO,MAAM,UAAU,MAAM,CAAC;AAC7D;AAEA,SAAS,wBAAwB,MAA4B;AAC3D,SAAO,mBAAmB,MAAM,UAAU,aAAa,MAAM,IAAI,CAAC,EAAE;AACtE;AAEA,SAAS,mBAAsB,OAAa;AAC1C,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;AACxD,aAAW,SAAS,OAAO,OAAO,KAAK,EAAG,oBAAmB,KAAK;AAClE,SAAO,OAAO,OAAO,KAAK;AAC5B;AAEA,SAAS,gBACP,OACA,OACA,WACkC;AAClC,MAAI,UAAU,WAAW,qBAAqB,UAAU,WAAW,YAAY;AAC7E,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,gBAAgB;AAAA,EAC/E;AACA,SAAO,qBAAqB,OAAO,OAAO,SAAS;AACrD;AAEA,SAAS,qBACP,OACA,OACA,WACkC;AAClC,MAAI,CAAC,UAAU,eAAe;AAC5B,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,uBAAuB;AAAA,EACtF;AACA,MAAI,CAAC,UAAU,cAAc;AAC3B,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,wBAAwB;AAAA,EACvF;AACA,MAAI,CAAC,UAAU,mBAAmB;AAChC,UAAM,IAAI,MAAM,wBAAwB,UAAU,WAAW,8BAA8B;AAAA,EAC7F;AACA,SAAO,OAAO,OAAO;AAAA,IACnB,MAAM;AAAA,IACN;AAAA,IACA,aAAa,UAAU;AAAA,IACvB,UAAU,OAAO,MAAM,IAAI;AAAA,IAC3B,UAAU,UAAU;AAAA,IACpB,eAAe,UAAU;AAAA,IACzB,cAAc,UAAU;AAAA,IACxB,mBAAmB,UAAU;AAAA,EAC/B,CAAC;AACH;AAEA,eAAe,8BACb,UACA,QACA,OACA,cACA,KAKY;AACZ,sBAAoB,UAAU,cAAc,KAAK;AACjD,QAAM,YAAY,MAAM,WAAW,KAAK,CAAC,UAAU,MAAM,gBAAgB,aAAa,WAAW;AACjG,MAAI,CAAC,WAAW;AACd,UAAM,IAAI,MAAM,wBAAwB,aAAa,WAAW,kBAAkB;AAAA,EACpF;AACA,QAAM,cAAc,gBAAgB,aAAa,OAAO,OAAO,SAAS;AACxE,MAAI,cAAc,WAAW,MAAM,cAAc,YAAY,GAAG;AAC9D,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,QAAM,WAAW,MAAM,wBAAwB,QAAQ,YAAY;AACnE,QAAM,eAAe;AAAA,IACnB;AAAA,IACA,UAAU;AAAA,IACV;AAAA,IACA,aAAa;AAAA,EACf;AACA,SAAO,kBAAkB,QAAQ,cAAc,OAAO,OAAO,SAAS;AACpE,QAAK,MAAM,kBAAkB,IAAI,MAAO,aAAa,eAAe;AAClE,YAAM,IAAI,MAAM,qDAAqD;AAAA,IACvE;AACA,UAAM,SAAS,MAAM,IAAI,EAAE,MAAM,WAAW,SAAS,CAAC;AACtD,QAAK,MAAM,kBAAkB,IAAI,MAAO,aAAa,eAAe;AAClE,YAAM,IAAI,MAAM,iDAAiD;AAAA,IACnE;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,eAAe,0BACb,YACA,cACA,QACA,KACY;AACZ,QAAM,gBAAgB,MAAM,QAAQ,KAAK,OAAO,GAAG,2BAA2B,CAAC;AAC/E,QAAM,eAAe,KAAK,eAAe,UAAU;AACnD,MAAI;AACF,UAAM,uBAAuB,YAAY,YAAY;AACrD,QAAK,MAAM,kBAAkB,YAAY,MAAO,cAAc;AAC5D,YAAM,IAAI,MAAM,sBAAsB,MAAM,sCAAsC;AAAA,IACpF;AACA,UAAM,SAAS,MAAM,IAAI,YAAY;AACrC,QAAK,MAAM,kBAAkB,YAAY,MAAO,cAAc;AAC5D,YAAM,IAAI,MAAM,aAAa,MAAM,8BAA8B;AAAA,IACnE;AACA,WAAO;AAAA,EACT,UAAE;AACA,UAAM,GAAG,eAAe,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EAC1D;AACF;AAEA,eAAe,wBACb,QACA,WACuC;AACvC,QAAM,WAAW,mCAAmC;AAAA,IAClD,KAAK;AAAA,OAED,MAAM;AAAA,QACJ;AAAA,QACA,8BAA8B,UAAU,WAAW;AAAA,MACrD,GACA,MAAM,SAAS,MAAM;AAAA,IACzB;AAAA,EACF;AACA,QAAM,aAAa,YAAY,QAAQ;AACvC,MAAI,eAAe,UAAU,cAAc;AACzC,UAAM,IAAI;AAAA,MACR,iEAAiE,UAAU,YAAY,SAAS,UAAU;AAAA,IAC5G;AAAA,EACF;AACA,MACE,SAAS,UAAU,UAAU,SAC7B,SAAS,gBAAgB,UAAU,eACnC,SAAS,aAAa,UAAU,YAChC,SAAS,aAAa,UAAU,YAChC,SAAS,kBAAkB,UAAU,iBACrC,SAAS,sBAAsB,UAAU,qBACzC,SAAS,WAAW,WAAW,MAC/B;AACA,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AACA,SAAO;AACT;AAEA,SAAS,oBACP,MACA,cACA,OACM;AACN,MAAI,MAAM,UAAU,aAAa,OAAO;AACtC,UAAM,IAAI,MAAM,iEAAiE;AAAA,EACnF;AACA,MAAI,QAAQ,MAAM,IAAI,MAAM,QAAQ,IAAI,GAAG;AACzC,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACA,MAAI,OAAO,MAAM,IAAI,MAAM,aAAa,UAAU;AAChD,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACA,MAAI,MAAM,aAAa,aAAa,UAAU;AAC5C,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACF;AAEA,eAAe,yBACb,QACA,WACe;AACf,QAAM,uBAAuB,QAAQ,WAAW,MAAM,MAAS;AACjE;AAEA,eAAe,uBACb,QACA,WACA,KACY;AACZ,SAAO;AAAA,IACL;AAAA,IACA,KAAK,cAAc,sBAAsB,MAAM,UAAU,WAAW,GAAG,WAAW;AAAA,IAClF;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,kCAAkC,SAA4C;AACrF,MAAI,QAAQ,QAAQ,QAAQ,mBAAmB,MAAM;AACnD,UAAM,IAAI,MAAM,8EAA8E;AAAA,EAChG;AACA,QAAM,gBAAgB;AAAA,IACpB,QAAQ,QAAQ,QAAQ,QAAQ,iBAAiB;AAAA,IACjD,QAAQ,QAAQ,eAAe;AAAA,EACjC,EAAE,OAAO,OAAO,EAAE;AAClB,MAAI,gBAAgB,GAAG;AACrB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;AAEA,eAAe,iBACb,OACA,QACA,OACA,WACA,SACA,KAKC;AACD,SAAO,uBAAuB,QAAQ,WAAW,OAAO,kBAAkB;AACxE,UAAM,uBAAuB,MAAM,kBAAkB,aAAa;AAClE,QACE,UAAU,WAAW,qBACrB,UAAU,kBAAkB,wBAC5B,UAAU,iBAAiB,UAC3B,UAAU,sBAAsB,QAChC;AACA,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA,QACA,gBAAgB,OAAO,OAAO,SAAS;AAAA,MACzC;AACA,aAAO,EAAE,WAAW,YAAY,SAAS,WAAW;AAAA,IACtD;AAEA,8BAA0B,SAAS;AACnC,UAAM,aAAqD,CAAC;AAC5D,QAAI,UAAU,WAAW,WAAW;AAClC,YAAM,kBAAkB,MAAM;AAAA,QAC5B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,UAAI,gBAAiB,YAAW,KAAK,eAAe;AAAA,IACtD;AACA,WAAO,6BAA6B,QAAQ,WAAW,eAAe,OAAO,aAAa;AACxF,YAAM,sBAAsB,MAAM;AAAA,QAChC;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA;AAAA,MACF;AACA,UAAI,oBAAqB,YAAW,KAAK,mBAAmB;AAC5D,YAAM,YAAY,sBAAsB,QAAQ,MAAM,UAAU;AAChE,YAAM,WAAW,MAAM;AAAA,QACrB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,aAAO,EAAE,GAAG,UAAU,GAAI,YAAY,EAAE,UAAU,IAAI,CAAC,EAAG;AAAA,IAC5D,CAAC;AAAA,EACH,CAAC;AACH;AAEA,eAAe,4BACb,OACA,WACA,eACA,SACA,KAC2D;AAC3D,MAAI,CAAC,qBAAqB,OAAO,EAAG,QAAO;AAC3C,QAAM,YAAY,MAAM,+BAA+B;AAAA,IACrD,MAAM,QAAQ;AAAA,IACd,kBAAkB,QAAQ;AAAA,IAC1B,mBAAmB,kCAAkC,eAAe,OAAO;AAAA,IAC3E,iBAAiB,oBAAoB,OAAO,WAAW,eAAe,OAAO;AAAA,IAC7E,eAAe,oBAAoB,SAAS,aAAa;AAAA,IACzD,gBAAgB,4BAA4B,SAAS,aAAa;AAAA,IAClE,QAAQ,QAAQ;AAAA,IAChB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,eAAe,gCACb,QACA,WACA,eACA,SACA,KAC2D;AAC3D,MAAI,CAAC,yBAAyB,OAAO,EAAG,QAAO;AAC/C,QAAM,iBAAiB,MAAM,oBAAoB,aAAa;AAC9D,QAAM,YAAY,MAAM,+BAA+B;AAAA,IACrD,MAAM,QAAQ;AAAA,IACd,WAAW,QAAQ,YACf;AAAA,MACE,GAAG,QAAQ;AAAA,MACX,OAAO;AAAA,MACP,QAAQ,QAAQ,UAAU,UAAU,KAAK,QAAQ,aAAa,UAAU,WAAW;AAAA,IACrF,IACA;AAAA,IACJ,UAAU,QAAQ;AAAA,IAClB,iBAAiB,QAAQ;AAAA,IACzB,SAAS,QAAQ;AAAA,IACjB,eAAe,oBAAoB,SAAS,iBAAiB;AAAA,IAC7D,gBAAgB,4BAA4B,SAAS,iBAAiB;AAAA,IACtE,QAAQ,QAAQ;AAAA,IAChB;AAAA,EACF,CAAC;AACD,SAAO;AACT;AAEA,SAAS,kCACP,eACA,SACyC;AACzC,MAAI,CAAC,QAAQ,QAAQ,CAAC,QAAQ,kBAAmB,QAAO;AACxD,QAAM,EAAE,MAAM,cAAc,GAAG,KAAK,IAAI,QAAQ,qBAAqB,CAAC;AACtE,QAAM,OAAO,QAAQ,QAAQ;AAC7B,SAAO;AAAA,IACL,GAAG;AAAA,IACH,MAAM;AAAA,IACN;AAAA,IACA,eACE,KAAK,kBAAkB,OAAQ,QAAQ,+BAA+B,IAAK;AAAA,IAC7E,QAAQ,KAAK,UAAU,QAAQ;AAAA,IAC/B,gBAAgB,KAAK,kBAAkB,QAAQ;AAAA,IAC/C,iBAAiB,KAAK,mBAAmB,QAAQ;AAAA,IACjD,WAAW,KAAK,aAAa,QAAQ;AAAA,EACvC;AACF;AAEA,SAAS,oBACP,OACA,WACA,eACA,SAC0D;AAC1D,MAAI,CAAC,QAAQ,gBAAiB,QAAO;AACrC,SAAO,CAAC,UACN,QAAQ,gBAAiB;AAAA,IACvB,GAAG;AAAA,IACH;AAAA,IACA,WAAW,UAAU;AAAA,IACrB,aAAa,UAAU;AAAA,IACvB,MAAM;AAAA,IACN,cAAc,QAAQ;AAAA,IACtB;AAAA,IACA,UAAU,UAAU;AAAA,EACtB,CAAC;AACL;AAEA,SAAS,qBAAqB,SAA+C;AAC3E,QAAM,SAAS,oBAAoB,SAAS,aAAa;AACzD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO;AAAA,IACL,QAAQ,oBACN,QAAQ,QACR,QAAQ,qBACR,QAAQ,mBACR,4BAA4B,SAAS,aAAa,EAAE,SAAS;AAAA,EACjE;AACF;AAEA,SAAS,yBAAyB,SAA+C;AAC/E,QAAM,SAAS,oBAAoB,SAAS,iBAAiB;AAC7D,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO;AAAA,IACL,QAAQ,aACN,QAAQ,YACR,QAAQ,mBACR,QAAQ,mBACR,4BAA4B,SAAS,iBAAiB,EAAE,SAAS;AAAA,EACrE;AACF;AAEA,SAAS,oBACP,SACA,aACgC;AAChC,QAAM,YAAY,QAAQ,iBAAiB;AAC3C,SAAO,UAAU,OAAO,CAAC,UAAU,YAAY,SAAS,KAAK,CAAC;AAChE;AAEA,SAAS,4BACP,SACA,aACgC;AAChC,UAAQ,QAAQ,kBAAkB,CAAC,GAAG,OAAO,CAAC,UAAU,YAAY,SAAS,KAAK,CAAC;AACrF;AAEA,SAAS,sBACP,MACA,YACkD;AAClD,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,WAAW,QAAQ,CAAC,cAAc,UAAU,MAAM;AAAA,IAC1D,WAAW,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,SAAS,CAAC;AAAA,IACzE,UAAU,WAAW,QAAQ,CAAC,cAAc,UAAU,QAAQ;AAAA,IAC9D,aAAa,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,WAAW,CAAC;AAAA,IAC7E,iBAAiB,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,eAAe,CAAC;AAAA,IACrF,eAAe,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,aAAa,CAAC;AAAA,IACjF,WAAW,YAAY,WAAW,IAAI,CAAC,cAAc,UAAU,SAAS,CAAC;AAAA,EAC3E;AACF;AAEA,SAAS,YAAe,QAAmD;AACzE,WAAS,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;AAC1D,QAAI,OAAO,KAAK,MAAM,OAAW,QAAO,OAAO,KAAK;AAAA,EACtD;AACA,SAAO;AACT;AAEA,eAAe,kBACb,QACA,OACA,WACA,UACA,WACA,SACA,KAIC;AACD,SAAO,qBAAqB,QAAQ,MAAM,UAAU,OAAO,iBAAiB;AAC1E,UAAM,CAAC,eAAe,cAAc,IAAI,MAAM,QAAQ,IAAI;AAAA,MACxD,oBAAoB,YAAY;AAAA,MAChC,oBAAoB,SAAS,IAAI;AAAA,IACnC,CAAC;AACD,UAAM,aAAa,uBAAuB,gBAAgB,EAAE,QAAQ,QAAQ,OAAO,CAAC;AACpF,UAAM,YAAY,aAAa,SAAS,cAAc;AACtD,UAAM,YAAY,wBAAwB,gBAAgB;AAAA,MACxD,QAAQ,QAAQ;AAAA,MAChB,GAAG,QAAQ;AAAA,IACb,CAAC;AACD,UAAM,gBAAgB,SAAS;AAC/B,UAAM,SACJ,QAAQ,WAAW;AAAA,MACjB,OAAO,MAAM;AAAA,MACb,WAAW,UAAU;AAAA,MACrB,MAAM,QAAQ;AAAA,MACd;AAAA,MACA,eAAe,SAAS;AAAA,MACxB;AAAA,MACA;AAAA,MACA,UAAU,MAAM;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ,QAAQ;AAAA,IAClB,CAAC,KACD;AAAA,MACE;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,IACF;AACF,UAAM,aAAa,uBAAuB,gBAAgB,MAAM,MAAM,GAAG,SAAS;AAClF,UAAM,eAAe,MAAM,kBAAkB,SAAS,IAAI;AAC1D,QAAI,iBAAiB,eAAe;AAClC,YAAM,IAAI;AAAA,QACR,2DAA2D,aAAa,SAAS,YAAY;AAAA,MAC/F;AAAA,IACF;AACA,cAAU,gBAAgB;AAC1B,cAAU,oBAAoB;AAAA,MAC5B,MAAM,yBAAyB,cAAc,SAAS,IAAI;AAAA,IAC5D;AACA,UAAM,WAAW,mCAAmC;AAAA,MAClD,KAAK;AAAA,QACH,KAAK,UAAU;AAAA,UACb,MAAM;AAAA,UACN,OAAO,MAAM;AAAA,UACb,aAAa,UAAU;AAAA,UACvB,WAAW,UAAU;AAAA,UACrB,UAAU,OAAO,MAAM,IAAI;AAAA,UAC3B,UAAU,UAAU;AAAA,UACpB;AAAA,UACA,mBAAmB,UAAU;AAAA,UAC7B;AAAA,UACA,WAAW,aAAa;AAAA,UACxB;AAAA,UACA;AAAA,UACA,WAAW,aAAa;AAAA,QAC1B,CAAC;AAAA,MACH;AAAA,IACF;AACA,cAAU,eAAe,YAAY,QAAQ;AAC7C,cAAU,YAAY,IAAI,EAAE,YAAY;AACxC,UAAM;AAAA,MACJ;AAAA,MACA,8BAA8B,UAAU,WAAW;AAAA,MACnD;AAAA,IACF;AACA,UAAM,aAAa,QAAQ;AAAA,MACzB,MAAM;AAAA,MACN,OAAO,MAAM;AAAA,MACb,aAAa,UAAU;AAAA,MACvB,OAAO,WAAW;AAAA,MAClB,QAAQ,WAAW;AAAA,IACrB,CAAC;AACD,WAAO,EAAE,WAAW,WAAW;AAAA,EACjC,CAAC;AACH;AAEA,SAAS,kCACP,YACA,WACA,gBACA,WACA,WAC4B;AAC5B,QAAM,kBAAkB,WAAW,OAAO,4BAA4B,UAAU;AAChF,QAAM,gBAAgB,gBAAgB,OAAO,CAAC,SAAS,KAAK,eAAe,UAAU,EAAE,UAAU;AACjG,QAAM,oBACJ,kBAAkB,IAAI,IAAI,KAAK,IAAI,GAAG,gBAAgB,eAAe,IAAI;AAC3E,QAAM,gBAAgB,WAAW,gBAC7BC,SAAQ,OAAO,OAAO,UAAU,cAAc,OAAO,EAAE,OAAO,OAAO,QAAQ,CAAC,IAC9E;AACJ,QAAM,oBAAoB,WAAW,YAAa,UAAU,UAAU,WAAW,IAAI,IAAK;AAC1F,QAAM,aAAa;AAAA,IACjB,YAAY,WAAW,KAAK,IAAI;AAAA,IAChC,YAAY,UAAU,KAAK,IAAI;AAAA,IAC/B,oBAAoB;AAAA,IACpB,gBAAgB;AAAA,IAChB,oBAAoB;AAAA,EACtB;AACA,QAAM,gBAAgB;AAAA,IACpB,WAAW,KAAK,SAAY;AAAA,IAC5B,UAAU,KAAK,SAAY;AAAA,IAC3B,oBAAoB,IAChB,SACA,GAAG,eAAe,IAAI,aAAa;AAAA,EACzC,EAAE,OAAO,CAAC,WAA6B,QAAQ,MAAM,CAAC;AACtD,SAAO;AAAA,IACL,OAAOA,SAAQ,OAAO,OAAO,UAAU,CAAC;AAAA,IACxC,QAAQ,cAAc,WAAW;AAAA,IACjC;AAAA,IACA,OACE,cAAc,WAAW,IAAI,uCAAuC,cAAc,KAAK,IAAI;AAAA,IAC7F,YAAY;AAAA,MACV,WAAW;AAAA,MACX,SAAS;AAAA,MACT,QAAQ;AAAA,IACV;AAAA,EACF;AACF;AAEA,SAAS,uBACP,QACA,WAC4B;AAC5B,QAAM,UAAU;AAAA,IACd,OAAO;AAAA,IACP,WAAW,iBAAiB,CAAC,UAAU,cAAc,SACjD,0BACA;AAAA,IACJ,WAAW,aAAa,CAAC,UAAU,UAAU,WACzC,4BAA4B,UAAU,UAAU,MAAM,KACtD;AAAA,EACN,EAAE,OAAO,CAAC,WAA6B,QAAQ,MAAM,CAAC;AACtD,QAAM,gBACJ,QAAQ,WAAW,iBAAiB,CAAC,UAAU,cAAc,MAAM,KACnE,QAAQ,WAAW,aAAa,CAAC,UAAU,UAAU,QAAQ;AAC/D,SAAO;AAAA,IACL,GAAG;AAAA,IACH,QAAQ,OAAO,UAAU,CAAC;AAAA,IAC1B,OAAO,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAO;AAAA,EAC1D;AACF;AAEA,SAAS,gBAAgB,QAAgE;AACvF,SAAO,wBAAwB,MAAM,MAAM;AAC7C;AAEA,eAAe,yBACb,QACA,OACA,MACA,KAC8C;AAC9C,QAAM,YAAY,MAAM,WAAW,SAAS;AAC5C,QAAM,cAAc,SAAS,SAAS,GAAG,MAAM,KAAK,IAAI,SAAS,IAAI,IAAI,EAAE,YAAY,CAAC,EAAE;AAC1F,QAAM,gBAAgB,uBAAuB,QAAQ,WAAW;AAChE,QAAM,uBAAuB,MAAM,aAAa;AAChD,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,UAAU,MAAM;AAAA,IAChB,QAAQ;AAAA,IACR;AAAA,IACA,WAAW;AAAA,EACb;AACF;AAEA,SAAS,uBAAuB,QAAgB,aAA6B;AAC3E,SAAO,KAAK,QAAQ,cAAc,sBAAsB,MAAM,WAAW,GAAG,WAAW;AACzF;AAEA,SAAS,qBAAqB,QAAwB;AACpD,SAAO,KAAK,QAAQ,UAAU;AAChC;AAEA,eAAe,uBACb,QACA,MACA,cACe;AACf,QAAM,SAAS,qBAAqB,MAAM;AAC1C,MAAI;AACF,UAAM,uBAAuB,QAAQ,YAAY;AACjD;AAAA,EACF,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AACA,QAAM,cAAc,MAAM,QAAQ,KAAK,QAAQ,mBAAmB,CAAC;AACnE,MAAI,YAAY;AAChB,MAAI;AACF,UAAM,uBAAuB,MAAM,WAAW;AAC9C,UAAM,aAAa,MAAM,kBAAkB,WAAW;AACtD,QAAI,eAAe,cAAc;AAC/B,YAAM,IAAI;AAAA,QACR,8DAA8D,YAAY,SAAS,UAAU;AAAA,MAC/F;AAAA,IACF;AACA,UAAM,cAAc,aAAa,MAAM;AACvC,gBAAY;AAAA,EACd,UAAE;AACA,QAAI,CAAC,UAAW,OAAM,GAAG,aAAa,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EACxE;AACF;AAEA,eAAe,uBACb,QACA,MACA,cACe;AACf,MAAI;AACF,UAAM,uBAAuB,QAAQ,YAAY;AAAA,EACnD,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AACjC,UAAM,WAAW,MAAM,kBAAkB,IAAI;AAC7C,QAAI,aAAa,cAAc;AAC7B,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,UAAM,uBAAuB,QAAQ,MAAM,YAAY;AAAA,EACzD;AACF;AAEA,eAAe,uBAAuB,QAAgB,cAAqC;AACzF,QAAM,qBAAqB,QAAQ,cAAc,MAAM,MAAS;AAClE;AAEA,eAAe,qBACb,QACA,cACA,KACY;AACZ,SAAO,kBAAkB,QAAQ,YAAY,OAAO,OAAO,iBAAiB;AAC1E,UAAM,aAAa,MAAM,kBAAkB,YAAY;AACvD,QAAI,eAAe,cAAc;AAC/B,YAAM,IAAI;AAAA,QACR,oDAAoD,YAAY,SAAS,UAAU;AAAA,MACrF;AAAA,IACF;AACA,WAAO,IAAI,YAAY;AAAA,EACzB,CAAC;AACH;AAEA,eAAe,6BACb,QACA,WACA,eACA,KACY;AACZ,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACA,sBAAsB,MAAM,UAAU,WAAW;AAAA,IACjD;AAAA,EACF;AACA,SAAO,kBAAkB,QAAQ,eAAe,MAAM,OAAO,iBAAiB;AAC5E,UAAM,cAAc,MAAM,QAAQ,KAAK,cAAc,UAAU,CAAC;AAChE,QAAI,YAAY;AAChB,QAAI;AACF,YAAM,uBAAuB,eAAe,WAAW;AACvD,YAAM,OAAO,MAAM,kBAAkB,WAAW;AAChD,UAAI;AACF,cAAM,SAAS,MAAM,kBAAkB,cAAc,MAAM,OAAO,OAAO,aAAa;AACpF,cAAK,MAAM,kBAAkB,QAAQ,MAAO,MAAM;AAChD,kBAAM,IAAI,MAAM,kEAAkE;AAAA,UACpF;AACA,iBAAO,IAAI,EAAE,MAAM,UAAU,KAAK,CAAC;AAAA,QACrC,CAAC;AACD,cAAM,GAAG,aAAa,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AACtD,oBAAY;AACZ,eAAO;AAAA,MACT,SAAS,OAAO;AACd,YAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,MACnC;AACA,YAAM,cAAc,aAAa,KAAK,cAAc,IAAI,CAAC;AACzD,kBAAY;AACZ,aAAO,kBAAkB,cAAc,MAAM,OAAO,CAAC,SAAS,IAAI,EAAE,MAAM,KAAK,CAAC,CAAC;AAAA,IACnF,UAAE;AACA,UAAI,CAAC,UAAW,OAAM,GAAG,aAAa,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,IACxE;AAAA,EACF,CAAC;AACH;AAEA,SAAS,0BAA0B,WAAsD;AACvF,SAAO,UAAU;AACjB,SAAO,UAAU;AACjB,SAAO,UAAU;AACnB;AAEA,SAAS,oBACP,OACiD;AACjD,SAAO,CAAC,GAAG,MAAM,UAAU,EACxB,QAAQ,EACR,KAAK,CAAC,cAAc,UAAU,WAAW,qBAAqB,UAAU,WAAW,SAAS;AACjG;AAEA,eAAe,uBAAuB,YAAoB,YAAmC;AAC3F,QAAM,GAAG,YAAY,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AACrD,QAAM,MAAM,KAAK,YAAY,WAAW,GAAG,EAAE,WAAW,KAAK,CAAC;AAC9D,QAAM,MAAM,KAAK,YAAY,OAAO,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACnE,QAAM,aAAa,KAAK,YAAY,WAAW,GAAG,KAAK,YAAY,WAAW,CAAC;AAC/E,QAAM,aAAa,KAAK,YAAY,KAAK,GAAG,KAAK,YAAY,KAAK,CAAC;AACnE,QAAM;AAAA,IACJ,KAAK,UAAU,UAAU,EAAE,UAAU,cAAc;AAAA,IACnD,KAAK,UAAU,UAAU,EAAE,UAAU,cAAc;AAAA,EACrD;AACA,QAAM,oBAAoB,UAAU;AACtC;AAEA,SAAS,oCACP,WACA,QACQ;AACR,QAAM,SAAS,WAAW,cAAc,cAAc;AACtD,SAAO,aAAa,MAAM,IAAI,YAAY,SAAS,CAAC;AACtD;AAEA,eAAe,yBACb,YACA,YAC8C;AAC9C,QAAM,CAAC,QAAQ,KAAK,IAAI,MAAM,QAAQ,IAAI;AAAA,IACxC,qBAAqB,UAAU;AAAA,IAC/B,qBAAqB,UAAU;AAAA,EACjC,CAAC;AACD,QAAM,eAAe,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,KAAK,CAAC,CAAC;AACvE,QAAM,cAAc,IAAI,IAAI,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,MAAM,KAAK,CAAC,CAAC;AACrE,QAAM,QAAQ;AAAA,IACZ,GAAG,oBAAI,IAAI,CAAC,GAAG,OAAO,IAAI,CAAC,UAAU,MAAM,IAAI,GAAG,GAAG,MAAM,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,CAAC;AAAA,EACxF,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,cAAc,KAAK,CAAC;AACjD,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,gCAA4B,IAAI;AAChC,UAAM,cAAc,aAAa,IAAI,IAAI;AACzC,UAAM,aAAa,YAAY,IAAI,IAAI;AACvC,WAAO;AAAA,MACL;AAAA,MACA,YAAY,aAAa,mBAAmB;AAAA,MAC5C,WAAW,YAAY,mBAAmB;AAAA,MAC1C,GAAI,cAAc,EAAE,YAAY,YAAY,KAAK,IAAI,CAAC;AAAA,MACtD,GAAI,aAAa,EAAE,WAAW,WAAW,KAAK,IAAI,CAAC;AAAA,IACrD;AAAA,EACF,CAAC;AACH;AAEA,eAAe,uBACb,YACA,MACkC;AAClC,SAAO,QAAQ;AAAA,IACb,KAAK,IAAI,OAAO,UAAU;AACxB,UAAI,MAAM,cAAc,KAAM,QAAO,EAAE,MAAM,MAAM,MAAM,SAAS,KAAK;AACvE,YAAM,OAAO,MAAM,0BAA0B,YAAY,MAAM,IAAI;AACnE,YAAM,aAAa,WAAW,QAAQ,EAAE,OAAO,KAAK,KAAK,EAAE,OAAO,KAAK;AACvE,UAAI,eAAe,MAAM,aAAa,KAAK,SAAS,MAAM,WAAW;AACnE,cAAM,IAAI,MAAM,oDAAoD,MAAM,IAAI,EAAE;AAAA,MAClF;AACA,aAAO,EAAE,MAAM,MAAM,MAAM,SAAS,KAAK,OAAO,MAAM,KAAK,KAAK;AAAA,IAClE,CAAC;AAAA,EACH;AACF;AAEA,SAAS,8BACP,MACA,WACA,QACM;AACN,QAAM,oBAAoB,WAAW,cAAc,OAAO,yBAAyB,IAAI;AACvF,QAAM,iBAAiB,iCAAiC,iBAAiB;AACzE,MAAI,mBAAmB,UAAU,mBAAmB;AAClD,UAAM,IAAI;AAAA,MACR,6DAA6D,UAAU,iBAAiB,SAAS,cAAc;AAAA,IACjH;AAAA,EACF;AACF;AAEA,SAAS,qCACP,aACA,WACA,QACM;AACN,gCAA8B,YAAY,SAAS,WAAW,MAAM;AACtE;AAEA,SAAS,yBACP,MACqC;AACrC,SAAO,KAAK,IAAI,CAAC,WAAW;AAAA,IAC1B,MAAM,MAAM;AAAA,IACZ,YAAY,MAAM;AAAA,IAClB,WAAW,MAAM;AAAA,IACjB,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,YAAY,MAAM,UAAU;AAAA,IACvE,GAAI,MAAM,eAAe,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,WAAW;AAAA,EAC1E,EAAE;AACJ;AAEA,eAAe,+BACb,QACA,cACA,QACe;AACf,MAAI,MAAM,4BAA4B,QAAQ,cAAc,MAAM,EAAG;AACrE,QAAM,aAAa,QAAQ;AAAA,IACzB,MAAM,WAAW,cAAc,uBAAuB;AAAA,IACtD,OAAO,aAAa;AAAA,IACpB,aAAa,aAAa;AAAA,IAC1B,eAAe,aAAa;AAAA,IAC5B,cAAc,aAAa;AAAA,IAC3B,mBAAmB,aAAa;AAAA,EAClC,CAAC;AACH;AAEA,eAAe,4BACb,QACA,cACA,QACkB;AAClB,QAAM,YAAY,WAAW,cAAc,uBAAuB;AAClE,MAAI,UAAU;AACd,aAAW,OAAO,MAAM,sCAAsC,MAAM,GAAG;AACrE,QAAI,IAAI,SAAS,aAAa,IAAI,gBAAgB,aAAa,YAAa;AAC5E,QACE,IAAI,UAAU,aAAa,SAC3B,IAAI,kBAAkB,aAAa,iBACnC,IAAI,iBAAiB,aAAa,gBAClC,IAAI,sBAAsB,aAAa,mBACvC;AACA,YAAM,IAAI,MAAM,4EAA4E;AAAA,IAC9F;AACA,cAAU;AAAA,EACZ;AACA,SAAO;AACT;AAOA,eAAsB,+BACpB,MACA,OACsC;AACtC,QAAM,cAAc,YAAY,MAAM,KAAK;AAC3C,MAAI;AACF,WAAO,MAAM;AAAA,MAA4B;AAAA,MAAM;AAAA,MAAa;AAAA,MAAO,CAAC,WAClE,sCAAsC,MAAM;AAAA,IAC9C;AAAA,EACF,SAAS,OAAO;AACd,QAAI,cAAc,KAAK,EAAG,QAAO,CAAC;AAClC,UAAM;AAAA,EACR;AACF;AAEA,eAAe,sCACb,QACsC;AACtC,QAAM,SAAsC,CAAC;AAC7C,MAAI;AACF,eAAW,QAAQ,MAAM,2BAA2B,QAAQ,QAAQ,GAAG;AACrE,YAAM,OAAO,KAAK,KAAK,MAAM,UAAU,MAAM;AAC7C,UAAI,KAAK,SAAS,GAAG,KAAK,CAAC,KAAK,SAAS,OAAO,GAAG;AACjD,cAAM,IAAI,MAAM,wDAAwD,IAAI,EAAE;AAAA,MAChF;AACA,aAAO,KAAK,+BAA+B,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC,CAAC;AAAA,IACrF;AAAA,EACF,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AAEA,QAAMC,UAAS,oBAAI,IAAuC;AAC1D,aAAW,SAAS,QAAQ;AAC1B,UAAM,EAAE,IAAI,KAAK,GAAG,SAAS,IAAI;AACjC,IAAAA,QAAO,IAAI,YAAY,QAAQ,GAAG,KAAK;AAAA,EACzC;AACA,SAAO,CAAC,GAAGA,QAAO,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,GAAG,cAAc,MAAM,EAAE,CAAC;AACnF;AAEA,SAAS,+BAA+B,OAA2C;AACjF,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AAC/D,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AACA,QAAM,QAAQ;AACd,MAAI,OAAO,MAAM,OAAO,YAAY,OAAO,MAAM,SAAS,UAAU;AAClE,UAAM,IAAI,MAAM,mDAAmD;AAAA,EACrE;AACA,SAAO;AACT;AAEA,eAAe,aAAa,QAAgB,QAA+B;AACzE,MAAI;AACJ,MAAI;AACF,iBAAa,MAAM,MAAM,MAAM;AAAA,EACjC,SAAS,OAAO;AACd,QAAI,cAAc,KAAK,EAAG;AAC1B,UAAM;AAAA,EACR;AACA,MAAI,CAAC,WAAW,YAAY,KAAK,CAAC,WAAW,OAAO,GAAG;AACrD,UAAM,IAAI,MAAM,+DAA+D,MAAM,EAAE;AAAA,EACzF;AACA,QAAM,MAAM,QAAQ,MAAM,GAAG,EAAE,WAAW,KAAK,CAAC;AAChD,QAAM,GAAG,QAAQ,QAAQ,EAAE,WAAW,WAAW,YAAY,GAAG,aAAa,MAAM,CAAC;AACtF;AAEA,eAAsB,kBAAkB,MAA+B;AACrE,SAAO,kBAAkB,MAAM,MAAM,0BAA0B,IAAI,CAAC;AACtE;AAEA,eAAe,0BAA0B,MAA+B;AACtE,QAAM,UAAU,MAAM,qBAAqB,IAAI;AAC/C,SAAO,OAAO,KAAK,UAAU,QAAQ,IAAI,CAAC,EAAE,MAAM,MAAM,KAAK,OAAO,EAAE,MAAM,MAAM,KAAK,EAAE,CAAC,CAAC;AAC7F;AASA,eAAe,qBAAqB,MAAgD;AAClF,QAAM,UAAmC,CAAC;AAC1C,aAAW,OAAO,CAAC,aAAa,KAAK,GAAG;AACtC,QAAI;AACF,iBAAW,QAAQ,MAAM,2BAA2B,MAAM,GAAG,GAAG;AAC9D,gBAAQ,KAAK,sBAAsB,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,CAAC;AAAA,MACtE;AAAA,IACF,SAAS,OAAO;AACd,UAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,IACnC;AAAA,EACF;AACA,QAAM,iBAAiB,SAAS,MAAM,UAAU,IAAI,EAAE,kBAAkB,EAAE,QAAQ,OAAO,GAAG;AAC5F,MAAI;AACF,UAAM,OAAO,MAAM,0BAA0B,MAAM,cAAc;AACjE,YAAQ,KAAK,sBAAsB,gBAAgB,KAAK,OAAO,KAAK,IAAI,CAAC;AAAA,EAC3E,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AACA,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AACnD,SAAO;AACT;AAEA,SAAS,sBAAsB,MAAc,OAAe,MAAqC;AAC/F,SAAO;AAAA,IACL;AAAA,IACA,MAAM,OAAO,MAAM,SAAS,QAAQ,CAAC;AAAA,IACrC,iBAAiB,WAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA,IAChE;AAAA,EACF;AACF;AAEA,eAAe,gBACb,QACA,SACsB;AACtB,QAAM,OAAO,KAAK,QAAQ,kBAAkB;AAC5C,QAAM,WAAW,MAAM,uBAAuB,QAAQ;AAAA,IACpD,cAAc;AAAA,IACd,SAAS,QAAQ;AAAA,EACnB,CAAC;AACD,SAAO;AAAA,IACL,SAAS,QAAQ;AAAA,IACjB,aAAa,SAAS;AAAA,IACtB,SAAS,SAAS;AAAA,EACpB;AACF;AAEA,eAAe,SACb,QACA,OACA,QACA,SACA,KACuC;AACvC,QAAM,SAAS;AACf,QAAM,gBAAgB;AACtB,QAAM,YAAY,IAAI,EAAE,YAAY;AACpC,QAAM,UAAU,QAAQ,OAAO,OAAO;AACtC,SAAO;AACT;AAEA,eAAe,UACb,QACA,OACA,SACe;AACf,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA,mCAAmC,MAAM,KAAK;AAAA,EAChD;AACA,QAAM,UAAU,KAAK;AACvB;AAEA,eAAe,aAAa,QAAgB,OAA+C;AACzF,QAAM,OAAO,MAAM;AACnB,MAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG;AACjD,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AACA,QAAM,eAAe,KAAK,UAAU,GAAG,YAAY,KAAK,CAAC,OAAO,EAAE,QAAQ,OAAO,GAAG;AACpF,MAAI;AACF,UAAM,OAAO,MAAM,0BAA0B,QAAQ,YAAY;AACjE,UAAM,WAAW,+BAA+B,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC;AACvF,UAAM,EAAE,IAAI,KAAK,GAAG,SAAS,IAAI;AACjC,QAAI,cAAc,QAAQ,MAAM,cAAc,KAAK,GAAG;AACpD,YAAM,IAAI,MAAM,qEAAqE;AAAA,IACvF;AACA;AAAA,EACF,SAAS,OAAO;AACd,QAAI,CAAC,cAAc,KAAK,EAAG,OAAM;AAAA,EACnC;AACA,QAAM,2BAA2B,QAAQ,cAAc;AAAA,IACrD,KAAI,oBAAI,KAAK,GAAE,YAAY;AAAA,IAC3B,GAAG;AAAA,EACL,CAAC;AACH;AAEA,SAAS,8BAA8B,aAA6B;AAClE,SAAO,KAAK,cAAc,sBAAsB,MAAM,WAAW,GAAG,eAAe,EAAE;AAAA,IACnF;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,eAAe,MAAc,MAAkC;AACtE,QAAM,QAAQ,SAAS,QAAQ,IAAI,GAAG,QAAQ,IAAI,CAAC,EAAE,QAAQ,OAAO,GAAG;AACvE,MAAI,UAAU,MAAM,UAAU,QAAQ,MAAM,WAAW,KAAK,KAAK,WAAW,KAAK;AAC/E,WAAO;AACT,SAAO;AACT;AAEA,SAAS,+BAAqC;AAC5C,MAAI,QAAQ,aAAa,SAAS;AAChC,UAAM,IAAI,MAAM,yEAAyE;AAAA,EAC3F;AACF;AAEA,SAASD,SAAQ,QAAmC;AAClD,QAAM,SAAS,OAAO,OAAO,OAAO,QAAQ;AAC5C,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;AAChE;;;ADnmFO,SAAS,6BACd,WAC4B;AAC5B,QAAM,SAAS,uCAAuC,MAAM,SAAS;AACrE,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU,eAAe,OAAO,QAAQ;AAAA,IACxC,UAAU,eAAe,OAAO,QAAQ;AAAA,IACxC,eAAe,eAAe,OAAO,aAAa;AAAA,IAClD,cAAc,eAAe,OAAO,YAAY;AAAA,IAChD,mBAAmB,eAAe,OAAO,iBAAiB;AAAA,EAC5D;AACF;AAGO,SAAS,+BACd,WACkC;AAClC,SAAO,uCAAuC,MAAM;AAAA,IAClD,GAAG;AAAA,IACH,UAAU,UAAU,UAAU,QAAQ;AAAA,IACtC,UAAU,UAAU,UAAU,QAAQ;AAAA,IACtC,eAAe,UAAU,UAAU,aAAa;AAAA,IAChD,cAAc,UAAU,UAAU,YAAY;AAAA,IAC9C,mBAAmB,UAAU,UAAU,iBAAiB;AAAA,EAC1D,CAAC;AACH;AAEA,SAAS,eAAe,OAAe;AACrC,SAAOE,oBAAmB,MAAM,UAAU,KAAK,EAAE;AACnD;AAEA,SAAS,UAAU,OAAuB;AACxC,SAAOA,oBAAmB,MAAM,KAAK,EAAE,MAAM,UAAU,MAAM;AAC/D;;;ASqCO,SAAS,cACd,MACA,MACA,UAAgC,CAAC,GACZ;AACrB,QAAM,mBAAmB,QAAQ,oBAAoB;AACrD,QAAM,WAAqB,CAAC;AAE5B,QAAM,EAAE,KAAK,SAAS,UAAU,SAAS,IAAI,eAAe,MAAM,kBAAkB,MAAM;AAC1F,QAAM,EAAE,KAAK,SAAS,UAAU,SAAS,IAAI,eAAe,MAAM,kBAAkB,MAAM;AAC1F,WAAS,KAAK,GAAG,UAAU,GAAG,QAAQ;AAEtC,QAAM,UAA6B,CAAC;AACpC,QAAM,OAAO,oBAAI,IAAY;AAE7B,aAAW,CAAC,IAAI,YAAY,KAAK,SAAS;AACxC,SAAK,IAAI,EAAE;AACX,UAAM,eAAe,QAAQ,IAAI,EAAE;AACnC,QAAI,CAAC,cAAc;AACjB,cAAQ,KAAK;AAAA,QACX,YAAY;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,EAAE,OAAO,aAAa,KAAK;AAAA,QACjC,oBAAoB,MAAM,aAAa,cAAc;AAAA,QACrD,KAAK,aAAa,WAAW;AAAA,QAC7B,YAAY,aAAa,WAAW;AAAA,MACtC,CAAC;AACD;AAAA,IACF;AACA,QAAI,aAAa,aAAa,aAAa,UAAU;AACnD,cAAQ,KAAK;AAAA,QACX,YAAY;AAAA,QACZ,MAAM;AAAA,QACN,MAAM,EAAE,QAAQ,aAAa,MAAM,OAAO,aAAa,KAAK;AAAA,QAC5D,oBAAoB,MAAM,CAAC,GAAG,aAAa,gBAAgB,GAAG,aAAa,cAAc,CAAC;AAAA,QAC1F,KAAK,aAAa,WAAW;AAAA,QAC7B,YAAY,aAAa,WAAW;AAAA,MACtC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,aAAW,CAAC,IAAI,YAAY,KAAK,SAAS;AACxC,QAAI,KAAK,IAAI,EAAE,EAAG;AAClB,YAAQ,KAAK;AAAA,MACX,YAAY;AAAA,MACZ,MAAM;AAAA,MACN,MAAM,EAAE,QAAQ,aAAa,KAAK;AAAA,MAClC,oBAAoB,MAAM,aAAa,cAAc;AAAA,MACrD,KAAK,aAAa,WAAW;AAAA,MAC7B,YAAY,aAAa,WAAW;AAAA,IACtC,CAAC;AAAA,EACH;AAEA,QAAM,WAAW,QAAQ,mBACrB,QAAQ,OAAO,CAAC,MAAM,EAAE,mBAAmB,KAAK,CAAC,MAAM,QAAQ,kBAAkB,SAAS,CAAC,CAAC,CAAC,IAC7F;AAEJ,SAAO;AAAA,IACL,SAAS;AAAA,IACT,SAAS;AAAA,MACP,OAAO,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,OAAO,EAAE;AAAA,MAClD,SAAS,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,SAAS,EAAE;AAAA,MACtD,UAAU,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,EAAE;AAAA,IAC1D;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,eACP,WACA,kBACA,MAC6D;AAC7D,QAAM,MAAM,oBAAI,IAA+B;AAC/C,QAAM,WAAqB,CAAC;AAC5B,MAAI,UAAU;AACd,aAAW,YAAY,WAAW;AAChC,QAAI,oBAAoB,CAAC,SAAS,WAAW,YAAY;AACvD,iBAAW;AACX;AAAA,IACF;AACA,QAAI,IAAI,IAAI,SAAS,EAAE,GAAG;AACxB,eAAS,KAAK,GAAG,IAAI,2BAA2B,SAAS,EAAE,sBAAiB;AAAA,IAC9E;AACA,QAAI,IAAI,SAAS,IAAI,QAAQ;AAAA,EAC/B;AACA,MAAI,UAAU,GAAG;AACf,aAAS,KAAK,GAAG,IAAI,aAAa,OAAO,uCAAuC;AAAA,EAClF;AACA,SAAO,EAAE,KAAK,SAAS;AACzB;AAEA,SAAS,MAAS,OAAiB;AACjC,SAAO,CAAC,GAAG,IAAI,IAAI,KAAK,CAAC;AAC3B;;;AChKA,IAAM,kBAAmC;AAAA,EACvC,aAAa;AAAA,EACb,UAAU;AAAA,EACV,UAAU;AAAA,EACV,cAAc;AAChB;AAEO,SAAS,cACd,SACA,SACkB;AAClB,QAAM,OAAO,iBAAiB,EAAE,GAAG,iBAAiB,GAAI,WAAW,CAAC,EAAG,CAAC;AACxE,QAAM,EAAE,MAAM,WAAW,IAAI,iBAAiB,OAAO;AACrD,MAAI,KAAK,KAAK,MAAM,GAAI,QAAO,CAAC;AAEhC,QAAM,WAAW,cAAc,MAAM,UAAU;AAC/C,QAAM,SAA2B,CAAC;AAClC,aAAW,WAAW,UAAU;AAC9B,eAAW,QAAQ,UAAU,QAAQ,MAAM,IAAI,GAAG;AAChD,YAAM,QAAQ,QAAQ,QAAQ,KAAK;AACnC,aAAO,KAAK;AAAA,QACV,OAAO,OAAO;AAAA,QACd,MAAM,KAAK;AAAA,QACX,aAAa,QAAQ;AAAA,QACrB,WAAW;AAAA,QACX,SAAS,QAAQ,KAAK,KAAK;AAAA,QAC3B,WAAW,KAAK,KAAK,SAAS,KAAK;AAAA,MACrC,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,iBAAiB,SAAuD;AACtF,QAAM,aAAa,QAAQ,QAAQ,SAAS,IAAI;AAChD,MAAI,CAAC,WAAW,WAAW,OAAO,EAAG,QAAO,EAAE,MAAM,YAAY,YAAY,EAAE;AAC9E,QAAM,QAAQ,4BAA4B,KAAK,UAAU;AACzD,MAAI,CAAC,MAAO,QAAO,EAAE,MAAM,YAAY,YAAY,EAAE;AACrD,SAAO,EAAE,MAAM,WAAW,MAAM,MAAM,CAAC,EAAE,MAAM,GAAG,YAAY,MAAM,CAAC,EAAE,OAAO;AAChF;AAEA,SAAS,iBAAiB,MAAwC;AAChE,MAAI,KAAK,WAAW,KAAK,YAAa,MAAK,WAAW,KAAK;AAC3D,MAAI,KAAK,gBAAgB,KAAK,YAAa,MAAK,eAAe,KAAK,MAAM,KAAK,cAAc,CAAC;AAC9F,SAAO;AACT;AAQA,SAAS,cAAc,MAAc,YAA+B;AAClE,QAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,QAAM,WAAsB,CAAC;AAC7B,QAAM,WAAmC,CAAC;AAC1C,MAAI,UAAmE;AAAA,IACrE,OAAO,CAAC;AAAA,IACR,OAAO;AAAA,IACP,aAAa;AAAA,EACf;AACA,MAAI,SAAS;AACb,MAAI,QAAuB;AAE3B,QAAM,QAAQ,MAAM;AAClB,UAAM,OAAO,QAAQ,MAAM,KAAK,IAAI;AACpC,QAAI,KAAK,KAAK,MAAM;AAClB,eAAS,KAAK,EAAE,MAAM,OAAO,QAAQ,OAAO,aAAa,QAAQ,YAAY,CAAC;AAAA,EAClF;AAEA,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,UAAU,KAAK,UAAU,IAAI,MAAM,SAAS,IAAI,IAAI;AAC1D,UAAM,aAAa,iBAAiB,KAAK,IAAI;AAC7C,QAAI,YAAY;AACd,YAAM,SAAS,WAAW,CAAC;AAC3B,cAAQ,UAAU,OAAO,SAAS,KAAK,WAAW,KAAK,IAAI,OAAO;AAClE,cAAQ,MAAM,KAAK,IAAI;AACvB,gBAAU;AACV;AAAA,IACF;AACA,UAAM,UAAU,UAAU,OAAO,wBAAwB,KAAK,IAAI,IAAI;AACtE,QAAI,SAAS;AACX,YAAM;AACN,YAAM,QAAQ,QAAQ,CAAC,EAAG;AAC1B,eAAS,KAAK,IAAI,QAAQ,CAAC,EAAG,KAAK;AACnC,eAAS,OAAO,QAAQ,GAAG,QAAQ,GAAG,OAAQ,QAAO,SAAS,IAAI;AAClE,gBAAU;AAAA,QACR,OAAO,CAAC,IAAI;AAAA,QACZ,OAAO;AAAA,QACP,aAAa,OAAO,QAAQ,QAAQ,EACjC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,OAAO,CAAC,IAAI,OAAO,CAAC,CAAC,EACxC,IAAI,CAAC,CAAC,WAAW,KAAK,MAAM,GAAG,IAAI,OAAO,OAAO,SAAS,CAAC,CAAC,IAAI,KAAK,EAAE,EACvE,KAAK,KAAK;AAAA,MACf;AACA,gBAAU;AACV;AAAA,IACF;AACA,YAAQ,MAAM,KAAK,IAAI;AACvB,cAAU;AAAA,EACZ;AACA,QAAM;AACN,SAAO;AACT;AAEA,SAAS,UAAU,MAAc,MAA+D;AAC9F,MAAI,KAAK,UAAU,KAAK,YAAa,QAAO,CAAC,EAAE,MAAM,OAAO,EAAE,CAAC;AAC/D,QAAM,QAAQ,WAAW,IAAI;AAC7B,QAAM,SAAiD,CAAC;AACxD,MAAI,SAAS;AACb,MAAI,cAAc;AAClB,aAAW,QAAQ,OAAO;AACxB,QAAI,WAAW,GAAI,eAAc,KAAK;AACtC,QAAI,OAAO,SAAS,KAAK,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,aAAa;AAC5E,aAAO,KAAK,EAAE,MAAM,OAAO,QAAQ,GAAG,OAAO,YAAY,CAAC;AAC1D,YAAM,UAAU,OAAO,MAAM,KAAK,IAAI,GAAG,OAAO,SAAS,KAAK,YAAY,CAAC;AAC3E,eAAS,UAAU,KAAK;AACxB,oBAAc,KAAK,IAAI,aAAa,KAAK,QAAQ,QAAQ,MAAM;AAAA,IACjE,OAAO;AACL,gBAAU,KAAK;AAAA,IACjB;AAAA,EACF;AACA,MAAI,OAAO,KAAK,MAAM,GAAI,QAAO,KAAK,EAAE,MAAM,OAAO,QAAQ,GAAG,OAAO,YAAY,CAAC;AACpF,SAAO,gBAAgB,QAAQ,IAAI;AACrC;AAEA,SAAS,WAAW,MAAsD;AACxE,QAAM,QAAgD,CAAC;AACvD,QAAM,aAAa,KAAK,MAAM,WAAW;AACzC,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK,GAAG;AAC7C,UAAM,aAAa,WAAW,CAAC,KAAK,OAAO,WAAW,IAAI,CAAC,KAAK;AAChE,QAAI,cAAc,GAAI;AACtB,UAAM,KAAK,EAAE,MAAM,WAAW,OAAO,OAAO,CAAC;AAC7C,cAAU,UAAU;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,gBACP,QACA,MACwC;AACxC,QAAM,MAA8C,CAAC;AACrD,aAAW,SAAS,QAAQ;AAC1B,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QACE,QACA,MAAM,KAAK,SAAS,KAAK,YACzB,KAAK,KAAK,SAAS,MAAM,KAAK,UAAU,KAAK,UAC7C;AACA,WAAK,OAAO,GAAG,KAAK,IAAI;AAAA;AAAA,EAAO,MAAM,IAAI;AAAA,IAC3C,OAAO;AACL,UAAI,KAAK,EAAE,GAAG,MAAM,CAAC;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;;;ACvIO,SAAS,iCAAiD;AAC/D,SAAO;AAAA,IACL,aAAa,SAAgD;AAC3D,aAAO,EAAE,QAAQ,KAAK;AAAA,IACxB;AAAA,EACF;AACF;;;AC7CA,SAAS,yBAAyB;AAwElC,eAAsB,iBACpB,SAC8B;AAC9B,QAAM,YAAY,gBAAgB,QAAQ,aAAa,GAAG,WAAW;AACrE,QAAM,WAAW,gBAAgB,QAAQ,YAAY,IAAI,UAAU;AACnE,QAAM,cAAc,gBAAgB,QAAQ,eAAe,GAAG,aAAa;AAC3E,QAAM,QAAQ,oBAAI,IAA2B;AAC7C,QAAM,UAA2B,CAAC;AAClC,QAAM,mBAAmB,oBAAI,IAAY;AACzC,eAAa,QAAQ,cAAc,OAAO,SAAS,gBAAgB;AAEnE,QAAM,SAA+B,CAAC;AACtC,QAAM,UAA6B,CAAC;AACpC,MAAI,kBAAkB;AACtB,MAAI,UAAU;AAEd,SAAO,QAAQ,SAAS,KAAK,OAAO,SAAS,aAAa,kBAAkB,UAAU;AACpF,QAAI,QAAQ,QAAQ,SAAS;AAC3B,gBAAU;AACV;AAAA,IACF;AACA,UAAM,WAAW,WAAW;AAC5B,UAAM,QAAQ,QAAQ,OAAO,GAAG,QAAQ;AACxC,QAAI;AACJ,QAAI;AACF,mBAAa;AAAA,QACX;AAAA,QACA,MAAM,QAAQ,WAAW,SAAS,OAAO;AAAA,UACvC;AAAA,UACA,QAAQ,QAAQ;AAAA,QAClB,CAAC;AAAA,MACH;AAAA,IACF,SAAS,OAAO;AACd,UAAI,CAAC,QAAQ,QAAQ,QAAS,OAAM;AACpC,cAAQ,QAAQ,GAAG,KAAK;AACxB,gBAAU;AACV;AAAA,IACF;AACA,uBAAmB,MAAM;AACzB,YAAQ,KAAK,GAAG,UAAU;AAE1B,UAAM,kBAAmC,CAAC;AAC1C,eAAW,UAAU,YAAY;AAC/B,mBAAa,OAAO,iBAAiB,CAAC,GAAG,OAAO,iBAAiB,gBAAgB;AAAA,IACnF;AACA,YAAQ,KAAK,GAAG,eAAe;AAC/B,UAAMC,SAA4B;AAAA,MAChC,OAAO,OAAO,SAAS;AAAA,MACvB;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACF;AACA,WAAO,KAAKA,MAAK;AACjB,UAAM,QAAQ,UAAUA,MAAK;AAC7B,QAAI,QAAQ,QAAQ,SAAS;AAC3B,gBAAU;AACV;AAAA,IACF;AAAA,EACF;AAEA,QAAM,aAAsC,UACxC,YACA,QAAQ,WAAW,IACjB,aACA,mBAAmB,WACjB,cACA;AACR,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc;AAAA,IACd,kBAAkB,CAAC,GAAG,gBAAgB;AAAA,EACxC;AACF;AAEO,SAAS,+BACd,QAC8B;AAC9B,SAAO;AAAA,IACL,MAAM,SAAS,OAAO,UAAU,CAAC,GAAG;AAClC,YAAM,cAAc,KAAK,IAAI,GAAG,QAAQ,eAAe,CAAC;AACxD,YAAM,UAA6B,CAAC;AACpC,UAAI,SAAS;AACb,qBAAe,UAAyB;AACtC,eAAO,SAAS,MAAM,QAAQ;AAC5B,cAAI,QAAQ,QAAQ,QAAS,OAAM,IAAI,MAAM,4BAA4B;AACzE,gBAAM,OAAO,MAAM,QAAQ;AAC3B,kBAAQ,KAAK,MAAM,OAAO,IAAI,MAAM,QAAQ,MAAM,CAAC;AAAA,QACrD;AAAA,MACF;AACA,YAAM,QAAQ,IAAI,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,aAAa,MAAM,MAAM,EAAE,GAAG,OAAO,CAAC;AACtF,aAAO,sBAAsB,OAAO,OAAO;AAAA,IAC7C;AAAA,EACF;AACF;AAEA,SAAS,aACP,OACA,OACA,aACA,kBACM;AACN,aAAW,QAAQ,OAAO;AACxB,eAAW,IAAI;AACf,UAAM,QAAQ,MAAM,IAAI,KAAK,EAAE;AAC/B,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,KAAK,IAAI,IAAI;AACvB,kBAAY,KAAK,IAAI;AACrB;AAAA,IACF;AACA,QAAI,CAAC,kBAAkB,OAAO,IAAI,GAAG;AACnC,YAAM,IAAI,MAAM,sBAAsB,KAAK,EAAE,+BAA+B;AAAA,IAC9E;AACA,qBAAiB,IAAI,KAAK,EAAE;AAAA,EAC9B;AACF;AAEA,SAAS,WAAW,MAA2B;AAC7C,MAAI,CAAC,KAAK,GAAG,KAAK,EAAG,OAAM,IAAI,MAAM,qCAAqC;AAC1E,MAAI,CAAC,KAAK,KAAK,KAAK,EAAG,OAAM,IAAI,MAAM,mBAAmB,KAAK,EAAE,0BAA0B;AAC7F;AAEA,SAAS,sBACP,OACA,SACmB;AACnB,QAAM,QAAQ,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,UAAU,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;AAClE,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,UAAU,SAAS;AAC5B,QAAI,CAAC,MAAM,IAAI,OAAO,MAAM,GAAG;AAC7B,YAAM,IAAI,MAAM,+CAA+C,OAAO,MAAM,GAAG;AAAA,IACjF;AACA,QAAI,SAAS,IAAI,OAAO,MAAM,GAAG;AAC/B,YAAM,IAAI,MAAM,uCAAuC,OAAO,MAAM,kBAAkB;AAAA,IACxF;AACA,aAAS,IAAI,OAAO,MAAM;AAAA,EAC5B;AACA,QAAM,UAAU,MAAM,OAAO,CAAC,SAAS,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,SAAS,KAAK,EAAE;AACpF,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,MAAM,uCAAuC,QAAQ,KAAK,IAAI,CAAC,EAAE;AAAA,EAC7E;AACA,SAAO,CAAC,GAAG,OAAO,EAAE;AAAA,IAClB,CAAC,GAAG,MAAO,MAAM,IAAI,EAAE,MAAM,IAAgB,MAAM,IAAI,EAAE,MAAM;AAAA,EACjE;AACF;AAEA,SAAS,gBAAgB,OAAe,MAAsB;AAC5D,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AACzC,UAAM,IAAI,MAAM,kBAAkB,IAAI,6BAA6B;AAAA,EACrE;AACA,SAAO;AACT;;;ACjOA,SAAS,gBAAgB;AACzB,SAAS,QAAAC,aAAY;AACrB,SAAS,KAAAC,UAAS;AAoFlB,IAAM,wBAAwBC,GAC3B,OAAO;AAAA,EACN,aAAaA,GAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC7B,UAAUA,GAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EAC1B,iBAAiBA,GAAE,IAAI,SAAS;AAAA,EAChC,aAAaA,GAAE,OAAO,EAAE,IAAI,CAAC,EAAE,SAAS;AAC1C,CAAC,EACA,OAAO;AACV,IAAM,sBAAsBA,GACzB,OAAO,EAAE,SAASA,GAAE,OAAOA,GAAE,OAAO,GAAG,qBAAqB,EAAE,CAAC,EAC/D,OAAO;AAUH,SAAS,+BACd,SACyB;AACzB,QAAM,OAAOC,MAAK,QAAQ,MAAM,oBAAoB,gBAAgB;AAEpE,QAAM,OAAO,YAAsD;AACjE,WAAO,kBAAkB,QAAQ,MAAM,YAAY;AACjD,UAAI;AACF,eAAO,oBAAoB,MAAM,KAAK,MAAM,MAAM,SAAS,MAAM,MAAM,CAAC,CAAC,EAAE;AAAA,MAC7E,SAAS,OAAO;AACd,YAAI,cAAc,KAAK,EAAG,QAAO,CAAC;AAClC,cAAM;AAAA,MACR;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,QAAQ,OAAO,YAA4D;AAC/E,UAAM;AAAA,MACJ,QAAQ;AAAA,MACR;AAAA,MACA,oBAAoB,MAAM,EAAE,QAAQ,CAAC;AAAA,IACvC;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM,KAAK,KAAK;AACd,YAAM,UAAU,MAAM,KAAK;AAC3B,YAAM,SAAS,QAAQ,SAAS,GAAG,CAAC;AACpC,aAAO,SAAS,IAAI,KAAK,OAAO,eAAe,IAAI;AAAA,IACrD;AAAA,IACA,MAAM,KAAK,OAAO;AAChB,YAAM,sBAAsB,QAAQ,MAAM,YAAY;AACpD,cAAM,UAAU,MAAM,KAAK;AAC3B,gBAAQ,SAAS,KAAK,CAAC,IAAI;AAAA,UACzB,aAAa,MAAM;AAAA,UACnB,UAAU,MAAM;AAAA,UAChB,iBAAiB,MAAM,KAAK,YAAY;AAAA,UACxC,GAAI,MAAM,gBAAgB,SAAY,CAAC,IAAI,EAAE,aAAa,MAAM,YAAY;AAAA,QAC9E;AACA,cAAM,MAAM,OAAO;AAAA,MACrB,CAAC;AAAA,IACH;AAAA,IACA,MAAM,MAAM,OAAO;AACjB,YAAM,OAAO,MAAM,KAAK,KAAK,KAAK;AAClC,UAAI,CAAC,KAAM,QAAO;AAClB,YAAM,MAAM,MAAM,OAAO,oBAAI,KAAK;AAClC,aAAO,IAAI,QAAQ,IAAI,KAAK,QAAQ,IAAI,MAAM;AAAA,IAChD;AAAA,IACA,MAAM,KAAK,aAAa;AACtB,YAAM,UAAU,MAAM,KAAK;AAC3B,aAAO,OAAO,OAAO,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,gBAAgB,WAAW;AAAA,IAC3E;AAAA,EACF;AACF;AA0BO,SAAS,2BAA2B,SAA6C;AACtF,SAAO;AAAA,IACL,MAAM,KAAK,KAAK;AACd,YAAM,SAAS,MAAM,QAAQ,IAAI,IAAI,aAAa,IAAI,QAAQ;AAC9D,aAAO,SAAS,IAAI,KAAK,OAAO,eAAe,IAAI;AAAA,IACrD;AAAA,IACA,MAAM,KAAK,OAAO;AAChB,YAAM,QAAQ,OAAO;AAAA,QACnB,aAAa,MAAM;AAAA,QACnB,UAAU,MAAM;AAAA,QAChB,iBAAiB,MAAM,KAAK,YAAY;AAAA,QACxC,aAAa,MAAM;AAAA,MACrB,CAAC;AAAA,IACH;AAAA,IACA,MAAM,MAAM,OAAO;AACjB,YAAM,OAAO,MAAM,KAAK,KAAK,KAAK;AAClC,UAAI,CAAC,KAAM,QAAO;AAClB,YAAM,MAAM,MAAM,OAAO,oBAAI,KAAK;AAClC,aAAO,IAAI,QAAQ,IAAI,KAAK,QAAQ,IAAI,MAAM;AAAA,IAChD;AAAA,IACA,MAAM,KAAK,aAAa;AACtB,aAAO,QAAQ,gBAAgB,WAAW;AAAA,IAC5C;AAAA,EACF;AACF;AAEA,SAAS,SAAS,KAA2B;AAC3C,SAAO,GAAG,IAAI,WAAW,KAAK,IAAI,QAAQ;AAC5C;;;ACxEO,IAAM,sBAAyC;AAAA,EACpD;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO,CAAC,oBAAoB,oBAAoB,KAAK;AAAA,UACvD;AAAA,UACA;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WAAW;AAAA,QACX,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cAAc;AAAA,IACd,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO,CAAC,SAAS,eAAe,gBAAgB,oBAAoB,aAAa;AAAA,UACnF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AAAA,EACA;AAAA,IACE,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,KAAK;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,cACE;AAAA,IACF,OAAO;AAAA,MACL;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA,YACE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAOE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA;AAAA;AAAA;AAAA;AAAA,YAKE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,QACE,IAAI;AAAA,QACJ,MAAM;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAOE,OAAO;AAAA,YACP,OAAO;AAAA,cACL;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,QACA,WACE;AAAA,QACF,UACE;AAAA,MACJ;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,qBACd,MACA,YACwF;AACxF,QAAM,WAAW,WAAW,YAAY;AACxC,QAAM,QAAQ,KAAK,SAAS;AAAA,IAAO,CAAC,UAClC,MAAM,MAAM,KAAK,CAAC,aAAa,SAAS,SAAS,SAAS,YAAY,CAAC,CAAC;AAAA,EAC1E;AACA,QAAM,YAAY,KAAK,aAAa,KAAK,SAAS;AAClD,SAAO;AAAA,IACL,UAAU,MAAM,UAAU;AAAA,IAC1B,aAAa,MAAM;AAAA,IACnB,aAAa,KAAK,SAAS;AAAA,IAC3B,aAAa,MAAM,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA,EAC/C;AACF;AAGO,SAAS,wBACd,SACA,YACyF;AACzF,QAAM,UAAU,QAAQ,MAAM,IAAI,CAAC,SAAS,qBAAqB,MAAM,UAAU,CAAC;AAClF,SAAO;AAAA,IACL,UAAU,QAAQ,OAAO,CAAC,WAAW,OAAO,QAAQ,EAAE;AAAA,IACtD,OAAO,QAAQ,MAAM;AAAA,IACrB;AAAA,EACF;AACF;AAGO,SAAS,mBAAmB,MAAyB,qBAA6B;AACvF,SAAO,IAAI,OAAO,CAAC,KAAK,YAAY,MAAM,QAAQ,MAAM,QAAQ,CAAC;AACnE;AAGO,SAAS,iBACd,MAAyB,qBACS;AAClC,QAAM,OAAO,CAAC;AACd,aAAW,WAAW,KAAK;AACzB,eAAW,QAAQ,QAAQ,OAAO;AAChC,WAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK;AAAA,IAC7C;AAAA,EACF;AACA,SAAO;AACT;;;ACl3BA,SAAS,QAAAC,aAAY;;;AC4Cd,SAAS,cAAc,OAA+B;AAC3D,QAAM,WAAW,MAAM,MAAM,IAAI,CAAC,SAAS,GAAG,KAAK,KAAK;AAAA,EAAK,KAAK,IAAI,EAAE,EAAE,KAAK,MAAM;AACrF,QAAM,aAAa,MAAM,QACtB,IAAI,CAAC,WAAW,GAAG,OAAO,SAAS,EAAE;AAAA,EAAK,OAAO,QAAQ,EAAE,EAAE,EAC7D,KAAK,MAAM;AACd,SAAO,GAAG,QAAQ;AAAA;AAAA,EAAO,UAAU;AACrC;AAQO,SAAS,4BACd,SACA,QACqB;AACrB,QAAM,QAAQ,wBAAwB,SAAS,MAAM;AACrD,QAAM,UAAwB,QAAQ,MAAM,IAAI,CAAC,SAAS;AACxD,UAAM,IAAI,qBAAqB,MAAM,MAAM;AAC3C,WAAO;AAAA,MACL,IAAI,KAAK;AAAA,MACT,MAAM,KAAK;AAAA,MACX,UAAU,EAAE;AAAA,MACZ,aAAa,EAAE;AAAA,MACf,aAAa,EAAE;AAAA,MACf,aAAa,EAAE;AAAA,IACjB;AAAA,EACF,CAAC;AACD,SAAO;AAAA,IACL,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,IACjB,UAAU,MAAM;AAAA,IAChB,OAAO,MAAM;AAAA,IACb,UAAU,MAAM,UAAU,IAAI,IAAI,MAAM,WAAW,MAAM;AAAA,IACzD;AAAA,EACF;AACF;AAYA,eAAsB,sBACpB,IACA,WAC8B;AAC9B,QAAM,QAAQ,OAAO,OAAO,WAAW,MAAM,oBAAoB,EAAE,IAAI;AACvE,SAAO,4BAA4B,WAAW,cAAc,KAAK,CAAC;AACpE;;;AC0FA,eAAsB,wBACpB,SACqC;AACrC,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ,aAAa,CAAC;AACpD,QAAM,kBAAkB,QAAQ,IAAI;AACpC,QAAM,QAAiC,CAAC;AACxC,MAAI,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAClD,MAAI,YAAY,aAAa,SAAS,KAAK;AAC3C,MAAI,QAAQ,QAAQ,WAAW,MAAM;AACrC,MAAI;AAEJ,WAASC,SAAQ,GAAGA,UAAS,aAAa,CAAC,OAAOA,UAAS;AACzD,QAAI,QAAQ,QAAQ,QAAS,OAAM,IAAI,MAAM,iCAAiC;AAE9E,UAAM,OAAO,kBAAkB,SAAS;AAGxC,UAAM,qBAAqB,MAAM,QAAQ,OAAO;AAAA,MAC9C,MAAM,QAAQ;AAAA,MACd,MAAM,QAAQ;AAAA,MACd,OAAAA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW,iBAAiB,WAAW,OAAO;AAAA,MAC9C,QAAQ,QAAQ;AAAA,IAClB,CAAC;AAGD,UAAM,WAAqC,CAAC;AAC5C,UAAM,wBAA0C,CAAC;AAKjD,UAAM,eAAe,IAAI;AAAA,MACvB,MAAM,QAAQ;AAAA,QAAQ,CAAC,WACrB,OAAO,OAAO,UAAU,gBAAgB,WAAW,CAAC,OAAO,SAAS,WAAW,IAAI,CAAC;AAAA,MACtF;AAAA,IACF;AACA,eAAW,UAAU,mBAAmB,WAAW,CAAC,GAAG;AACrD,UAAI,YAAY,QAAQ,cAAc,QAAQ,GAAG;AAC/C,8BAAsB,KAAK,EAAE,QAAQ,QAAQ,2CAA2C,CAAC;AACzF;AAAA,MACF;AACA,YAAM,UAAU,MAAM,QAAQ,OAAO,aAAa,QAAQ;AAAA,QACxD,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,OAAAA;AAAA,QACA;AAAA,QACA;AAAA,QACA,mBAAmB;AAAA,QACnB,QAAQ,QAAQ;AAAA,MAClB,CAAC;AACD,UAAI,QAAQ,OAAQ,UAAS,KAAK,MAAM;AAAA,UACnC,uBAAsB,KAAK,EAAE,QAAQ,QAAQ,QAAQ,OAAO,CAAC;AAAA,IACpE;AAKA,UAAM,wBAAwB,MAAM,gBAAgB,SAAS,QAAQ;AACrE,UAAM,eAAyB,CAAC;AAChC,iBAAa;AAAA,MACX,GAAI,MAAM,WAAW,QAAQ,MAAM,oBAAoB,qBAAqB;AAAA,IAC9E;AAGA,YAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAC9C,gBAAY,aAAa,SAAS,KAAK;AAGvC,QAAI,gBAAgC,CAAC;AACrC,QAAI;AACJ,QAAI,QAAQ,oBAAoB,QAAQ,OAAO,UAAU;AACvD,YAAMC,iBAAgB,kBAAkB,SAAS;AACjD,YAAM,qBAAqB,MAAM,QAAQ,OAAO,SAAS;AAAA,QACvD,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,OAAAD;AAAA,QACA;AAAA,QACA,eAAAC;AAAA,QACA,WAAW,iBAAiB,WAAW,OAAO;AAAA,QAC9C,QAAQ,QAAQ;AAAA,MAClB,CAAC;AACD,oBAAc,mBAAmB;AACjC,sBAAgB,MAAM,gBAAgB,SAAS,mBAAmB,WAAW,CAAC,CAAC;AAC/E,mBAAa,KAAK,GAAI,MAAM,WAAW,QAAQ,MAAM,oBAAoB,aAAa,CAAE;AACxF,cAAQ,MAAM,oBAAoB,QAAQ,IAAI;AAC9C,kBAAY,aAAa,SAAS,KAAK;AAAA,IACzC;AAGA,YAAQ,QAAQ,WAAW,MAAM;AACjC,UAAM,gBAAgB,kBAAkB,SAAS;AACjD,YAAQ,QAAQ,SAAY,SAAS,QAAQ,QAAQ,aAAa;AAElE,UAAM,OAA8B;AAAA,MAClC,OAAAD;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,OAAO,qBAAqB;AAAA,QAC1B,MAAM;AAAA,QACN,OAAO,QAAQ;AAAA,QACf,QAAQ,QAAQ;AAAA,QAChB,UAAU;AAAA,UACR,MAAM,QAAQ;AAAA,UACd,OAAAA;AAAA,UACA;AAAA,UACA,2BAA2B,sBAAsB;AAAA,UACjD,2BAA2B,sBAAsB;AAAA,UACjD,mBAAmB,cAAc;AAAA,UACjC,kBAAkB,aAAa;AAAA,UAC/B,mBAAmB,cAAc;AAAA,QACnC;AAAA,MACF,CAAC;AAAA,MACD,OAAO,EAAE,QAAQ,mBAAmB,OAAO,QAAQ,YAAY;AAAA,IACjE;AACA,UAAM,KAAK,IAAI;AACf,UAAM,QAAQ,UAAU,IAAI;AAAA,EAC9B;AAEA,SAAO;AAAA,IACL,MAAM,QAAQ;AAAA,IACd,MAAM,QAAQ;AAAA,IACd,QAAQ,MAAM;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,QAAQ,QAAuD;AAGtE,MAAI,CAAC,OAAQ,QAAO;AACpB,SAAO,OAAO,4BAA4B,WAAW;AACvD;AAEA,SAAS,kBAAkB,WAAuE;AAChG,MAAI,CAAC,UAAW,QAAO,CAAC;AACxB,QAAM,WAAW,UAAU,OAAO,4BAA4B;AAAA,IAAI,CAAC,gBACjE,OAAO,aAAa,WAAW,IAAI;AAAA,EACrC;AACA,QAAM,cAAc,UAAU,OAAO,gBAAgB;AAAA,IAAI,CAAC,gBACxD,OAAO,aAAa,WAAW,KAAK;AAAA,EACtC;AACA,SAAO,CAAC,GAAG,UAAU,GAAG,WAAW;AACrC;AAEA,SAAS,OACP,aACA,WACA,UACc;AACd,QAAM,OAAO,UAAU,aAAa,KAAK,CAAC,UAAU,MAAM,OAAO,YAAY,EAAE;AAC/E,QAAM,QACJ,OAAO,MAAM,UAAU,UAAU,WAAW,KAAK,SAAS,QAAQ,YAAY;AAChF,SAAO,EAAE,IAAI,YAAY,IAAI,aAAa,YAAY,aAAa,OAAO,SAAS;AACrF;AAEA,SAAS,SAAS,QAAwB,MAA0C;AAClF,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI,OAAO,SAAU,QAAO,OAAO,SAAS,IAAI;AAChD,SAAO;AAAA,IACL;AAAA,IACA,GAAG,KAAK;AAAA,MACN,CAAC,QAAQ,MAAM,IAAI,WAAW,aAAa,MAAM,KAAK,IAAI,WAAW,KAAK,IAAI,EAAE;AAAA,IAClF;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,YACP,QACA,cACA,UACS;AACT,SAAO,aAAa,IAAI,OAAO,GAAG,KAAK,SAAS,KAAK,CAAC,cAAc,UAAU,QAAQ,OAAO,GAAG;AAClG;AAEA,eAAe,gBACb,SACA,SACyB;AACzB,QAAM,UAA0B,CAAC;AACjC,aAAW,UAAU,SAAS;AAC5B,YAAQ,KAAK,MAAM,cAAc,QAAQ,MAAM,QAAQ,QAAQ,aAAa,CAAC;AAAA,EAC/E;AACA,SAAO;AACT;AAQA,eAAe,WACb,MACA,cACA,iBACmB;AACnB,MAAI,gBAAgB,WAAW,EAAG,QAAO,CAAC;AAC1C,QAAM,QAAkB,CAAC;AACzB,MAAI,aAAa,aAAc,OAAM,KAAK,aAAa,YAAY;AACnE,QAAM,QAAQ,aAAa,aAAa,eAAe;AACvD,MAAI,MAAO,OAAM,KAAK,KAAK;AAC3B,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAChC,QAAM,UAAU,MAAM,0BAA0B,MAAM,MAAM,KAAK,IAAI,CAAC;AACtE,SAAO,QAAQ;AACjB;AAEA,SAAS,iBACP,WACA,SACgC;AAChC,MAAI,UAAW,QAAO;AAItB,SAAO,yBAAyB;AAAA,IAC9B,GAAI,QAAQ,aAAa,CAAC;AAAA,IAC1B,QAAQ,QAAQ,mBAAmB,QAAQ;AAAA,IAC3C,OAAO,WAAW,QAAQ,IAAI;AAAA,IAC9B,OAAO,CAAC;AAAA,EACV,CAAC;AACH;AAEA,SAAS,WAAW,MAA8B;AAChD,SAAO;AAAA,IACL;AAAA,IACA,cAAa,oBAAI,KAAK,CAAC,GAAE,YAAY;AAAA,IACrC,SAAS,CAAC;AAAA,IACV,OAAO,CAAC;AAAA,IACR,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAChC;AACF;AAOO,SAAS,kBACd,QACA,OACA,MACyB;AACzB,QAAM,WAAW,GAAG,OAAO,SAAS,EAAE;AAAA,EAAK,OAAO,IAAI,GAAG,YAAY;AACrE,QAAM,OAAgC,CAAC;AACvC,aAAW,OAAO,MAAM;AACtB,eAAW,SAAS,IAAI,MAAM,YAAY,EAAE,MAAM,KAAK,EAAE,OAAO,OAAO,GAAG;AACxE,UAAI,SAAS,SAAS,KAAK,GAAG;AAC5B,aAAK,KAAK,GAAG,gBAAgB,OAAO,IAAI,OAAO,CAAC,CAAC;AACjD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAQO,IAAM,0BAA0B;;;AFnahC,SAAS,qBAAqB,OAAkD;AACrF,QAAM,IAAI,MAAM;AAChB,QAAM,IAAI,MAAM;AAChB,QAAM,SAAS,GAAG,CAAC,IAAI,CAAC;AACxB,SAAO;AAAA,IACL,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,8CAA8C,CAAC,KAAK,CAAC,wBAAwB,MAAM,MAAM;AAAA,MACtG,OAAO;AAAA,MACP,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,IACD,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,GAAG,CAAC;AAAA,MACjB,OAAO,GAAG,CAAC,IAAI,CAAC;AAAA,MAChB,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,IACD,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,GAAG,CAAC;AAAA,MACjB,OAAO,GAAG,CAAC,IAAI,CAAC;AAAA,MAChB,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,IACD,oBAAoB;AAAA,MAClB,IAAI;AAAA,MACJ,aAAa,GAAG,CAAC;AAAA,MACjB,OAAO,GAAG,CAAC,IAAI,CAAC;AAAA,MAChB,aAAa,CAAC,eAAe;AAAA,MAC7B,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF;AAUA,SAAS,wBACP,OACA,QACgD;AAChD,QAAM,SACJ;AASF,QAAM,OAAO;AAAA,IACX,YAAY,MAAM,OAAO,KAAK,MAAM,MAAM;AAAA,IAC1C,8CAA8C,MAAM,MAAM;AAAA,IAC1D,MAAM,SAAS,WAAW,MAAM,MAAM,KAAK;AAAA,IAC3C;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,MAAM,GAAG,IAAK;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EACG,OAAO,OAAO,EACd,KAAK,IAAI;AACZ,SAAO;AAAA,IACL,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,IAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,EAChC;AACF;AAGA,eAAe,gBACb,MACA,OACA,QACiB;AACjB,SAAO,sBAAsB,MAAM,YAAY;AAC7C,UAAM,eAAe,oBAAoB,QAAQ,MAAM,MAAM,CAAC;AAC9D,UAAM,OAAO;AAAA,MACX;AAAA,MACA,mCAA8B,MAAM,OAAO,KAAK,MAAM,MAAM;AAAA,MAC5D,WAAW,MAAM,MAAM;AAAA,MACvB,WAAW,MAAM,MAAM;AAAA,MACvB;AAAA,MACA;AAAA,MACA,8BAAyB,MAAM,OAAO,KAAK,MAAM,MAAM,YAAY,MAAM,MAAM;AAAA,MAC/E;AAAA,MACA,OAAO,KAAK;AAAA,MACZ;AAAA,IACF,EAAE,KAAK,IAAI;AACX,UAAM,2BAA2B,MAAM,cAAc,MAAM,EAAE,UAAU,OAAO,CAAC;AAC/E,WAAOE,MAAK,MAAM,YAAY;AAAA,EAChC,CAAC;AACH;AAgCA,eAAsB,wBACpB,OACA,SAC0B;AAC1B,QAAM,SAAS,wBAAwB,EAAE,GAAG,QAAQ,eAAe,QAAQ,QAAQ,OAAO,CAAC;AAC3F,QAAM,OAAO,GAAG,MAAM,OAAO,KAAK,MAAM,MAAM,6BAA6B,MAAM,MAAM;AAEvF,QAAM,OAAO,MAAM,wBAAwB;AAAA,IACzC,MAAM,QAAQ;AAAA,IACd;AAAA,IACA;AAAA,IACA,QAAQ,QAAQ;AAAA,IAChB,gBAAgB,qBAAqB,KAAK;AAAA,IAC1C,WAAW,QAAQ,aAAa;AAAA,IAChC,QAAQ,QAAQ;AAAA,EAClB,CAAC;AAGD,QAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,QAAM,SAAS,cAAc,KAAK;AAClC,QAAM,WAAW,wBAAwB,OAAO,MAAM;AACtD,QAAM,SAAS,MAAM,QAAQ,OAAO,KAAK,UAAU,QAAQ,sBAAsB,IAAI;AAErF,QAAM,aAAa,MAAM,gBAAgB,QAAQ,MAAM,OAAO,MAAM;AACpE,SAAO,EAAE,MAAM,QAAQ,WAAW;AACpC;;;AGzOA,SAAS,KAAAC,UAAS;AA0BX,IAAM,gBAAN,MAAuC;AAAA,EAC3B,UAAU,oBAAI,IAA0B;AAAA,EACxC,QAAQ,oBAAI,IAA2B;AAAA,EACvC,SAA2B,CAAC;AAAA,EACrC,QAA+B;AAAA,EAEvC,MAAM,UAAU,QAAqC;AACnD,SAAK,QAAQ,IAAI,OAAO,IAAI,MAAM,MAAM,CAAC;AAAA,EAC3C;AAAA,EAEA,MAAM,UAAU,IAA0C;AACxD,WAAO,MAAM,KAAK,QAAQ,IAAI,EAAE,KAAK,IAAI;AAAA,EAC3C;AAAA,EAEA,MAAM,cAAuC;AAC3C,WAAO,CAAC,GAAG,KAAK,QAAQ,OAAO,CAAC,EAAE,IAAI,KAAK;AAAA,EAC7C;AAAA,EAEA,MAAM,QAAQ,MAAoC;AAChD,SAAK,MAAM,IAAI,KAAK,IAAI,MAAM,IAAI,CAAC;AAAA,EACrC;AAAA,EAEA,MAAM,QAAQ,UAAiD;AAC7D,WAAO;AAAA,MACL,KAAK,MAAM,IAAI,QAAQ,KACrB,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE,KAAK,CAAC,SAAS,KAAK,SAAS,QAAQ,KAC9D;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,MAAM,YAAsC;AAC1C,WAAO,CAAC,GAAG,KAAK,MAAM,OAAO,CAAC,EAAE,IAAI,KAAK;AAAA,EAC3C;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,SAAK,QAAQ,MAAM,KAAK;AAAA,EAC1B;AAAA,EAEA,MAAM,WAA2C;AAC/C,QAAI,KAAK,MAAO,QAAO,MAAM,KAAK,KAAK;AACvC,UAAM,QAAQ,MAAM,KAAK,UAAU;AACnC,UAAM,UAAU,MAAM,KAAK,YAAY;AACvC,WAAO;AAAA,MACL,MAAM;AAAA,MACN,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC;AAAA,MACA;AAAA,MACA,OAAO,oBAAoB,KAAK;AAAA,IAClC;AAAA,EACF;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,SAAK,OAAO,KAAK,MAAM,KAAK,CAAC;AAAA,EAC/B;AAAA,EAEA,MAAM,WAAW,QAA6B,CAAC,GAA8B;AAC3E,QAAI,MAAM,KAAK;AACf,QAAI,MAAM,KAAM,OAAM,IAAI,OAAO,CAAC,UAAU,MAAM,SAAS,MAAM,IAAI;AACrE,QAAI,MAAM,OAAQ,OAAM,IAAI,OAAO,CAAC,UAAU,MAAM,WAAW,MAAM,MAAM;AAC3E,UAAM,CAAC,GAAG,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,UAAU,cAAc,EAAE,SAAS,CAAC;AACpE,WAAO,IAAI,MAAM,EAAE,MAAM,SAAS,IAAI,OAAO,EAAE,IAAI,KAAK;AAAA,EAC1D;AACF;AAEA,IAAM,wBAAwBC,GAAE,MAAM,oBAAoB;AAEnD,IAAM,oBAAN,MAA2C;AAAA,EAChD,YAA6B,KAAa;AAAb;AAAA,EAAc;AAAA,EAAd;AAAA,EAE7B,MAAM,UAAU,QAAqC;AACnD,UAAM,SAAS,mBAAmB,MAAM,MAAM;AAC9C,UAAM,KAAK,YAAY,CAAC,WAAW;AAAA,MACjC,GAAG;AAAA,MACH,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,MACpC,SAAS,CAAC,QAAQ,GAAG,MAAM,QAAQ,OAAO,CAAC,UAAU,MAAM,OAAO,OAAO,EAAE,CAAC;AAAA,IAC9E,EAAE;AAAA,EACJ;AAAA,EAEA,MAAM,UAAU,IAA0C;AACxD,WAAO,kBAAkB,KAAK,KAAK,YAAY;AAC7C,YAAM,QAAQ,MAAM,KAAK,UAAU;AACnC,aAAO,MAAM,OAAO,QAAQ,KAAK,CAAC,WAAW,OAAO,OAAO,EAAE,KAAK,IAAI;AAAA,IACxE,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,cAAuC;AAC3C,WAAO,kBAAkB,KAAK,KAAK,YAAY,OAAO,MAAM,KAAK,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC;AAAA,EAC/F;AAAA,EAEA,MAAM,QAAQ,MAAoC;AAChD,UAAM,SAAS,oBAAoB,MAAM,IAAI;AAC7C,UAAM,KAAK,YAAY,CAAC,UAAU;AAChC,YAAM,QAAQ,CAAC,QAAQ,GAAG,MAAM,MAAM,OAAO,CAAC,UAAU,MAAM,OAAO,OAAO,EAAE,CAAC;AAC/E,aAAO;AAAA,QACL,GAAG;AAAA,QACH,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,QACpC;AAAA,QACA,OAAO,oBAAoB,KAAK;AAAA,MAClC;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,QAAQ,UAAiD;AAC7D,WAAO,kBAAkB,KAAK,KAAK,YAAY;AAC7C,YAAM,QAAQ,MAAM,KAAK,UAAU;AACnC,aAAO;AAAA,QACL,OAAO,MAAM,KAAK,CAAC,SAAS,KAAK,OAAO,YAAY,KAAK,SAAS,QAAQ,KAAK;AAAA,MACjF;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,YAAsC;AAC1C,WAAO,kBAAkB,KAAK,KAAK,YAAY,OAAO,MAAM,KAAK,UAAU,IAAI,SAAS,CAAC,CAAC,CAAC;AAAA,EAC7F;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,UAAM,SAAS,qBAAqB,MAAM,KAAK;AAC/C,UAAM;AAAA,MAAsB,KAAK;AAAA,MAAK,MACpC,2BAA2B,KAAK,KAAK,cAAc,MAAM;AAAA,IAC3D;AAAA,EACF;AAAA,EAEA,MAAM,WAA2C;AAC/C,WAAO,kBAAkB,KAAK,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,EAC3D;AAAA,EAEA,MAAM,SAAS,OAAsC;AACnD,UAAM,SAAS,qBAAqB,MAAM,KAAK;AAC/C,UAAM,sBAAsB,KAAK,KAAK,YAAY;AAChD,YAAM,UAAU,MAAM,KAAK,WAAW;AACtC,YAAM,OAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,UAAU,MAAM,OAAO,OAAO,EAAE,GAAG,MAAM,EAAE;AAAA,QAAK,CAAC,GAAG,MACnF,EAAE,UAAU,cAAc,EAAE,SAAS;AAAA,MACvC;AACA,YAAM,2BAA2B,KAAK,KAAK,eAAe,IAAI;AAAA,IAChE,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,WAAW,QAA6B,CAAC,GAA8B;AAC3E,WAAO,kBAAkB,KAAK,KAAK,YAAY;AAC7C,UAAI,SAAS,MAAM,KAAK,WAAW;AACnC,UAAI,MAAM,KAAM,UAAS,OAAO,OAAO,CAAC,UAAU,MAAM,SAAS,MAAM,IAAI;AAC3E,UAAI,MAAM,OAAQ,UAAS,OAAO,OAAO,CAAC,UAAU,MAAM,WAAW,MAAM,MAAM;AACjF,aAAO,MAAM,OAAO,MAAM,EAAE,MAAM,SAAS,OAAO,OAAO,CAAC;AAAA,IAC5D,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,YAAY,QAAkE;AAC1F,UAAM,sBAAsB,KAAK,KAAK,YAAY;AAChD,YAAM,UAAW,MAAM,KAAK,UAAU,KAAMC,YAAW,KAAK,GAAG;AAC/D,YAAM,OAAO,qBAAqB,MAAM,OAAO,OAAO,CAAC;AACvD,YAAM,2BAA2B,KAAK,KAAK,cAAc,IAAI;AAAA,IAC/D,CAAC;AAAA,EACH;AAAA,EAEA,MAAc,YAA4C;AACxD,WAAO;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,aAAwC;AACpD,WAAS,MAAM,aAAa,KAAK,KAAK,eAAe,qBAAqB,KACxE,CAAC;AAAA,EACL;AACF;AAEA,SAASA,YAAW,MAA8B;AAChD,SAAO;AAAA,IACL;AAAA,IACA,cAAa,oBAAI,KAAK,CAAC,GAAE,YAAY;AAAA,IACrC,SAAS,CAAC;AAAA,IACV,OAAO,CAAC;AAAA,IACR,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAChC;AACF;AAEA,eAAe,aACb,MACA,cACA,QACmB;AACnB,MAAI;AACF,UAAM,OAAO,MAAM,0BAA0B,MAAM,YAAY;AAC/D,WAAO,OAAO,MAAM,KAAK,MAAM,KAAK,MAAM,SAAS,MAAM,CAAC,CAAC;AAAA,EAC7D,SAAS,OAAO;AACd,QAAK,OAAwC,SAAS,SAAU,QAAO;AACvE,UAAM;AAAA,EACR;AACF;AAEA,SAAS,MAAS,OAAa;AAC7B,SAAO,SAAS,OAAO,QAAS,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC;AAClE;;;AC1JO,IAAM,8BAAN,cAA0C,MAAM;AAAA,EACrD,YACkB,WACA,SAChB,SACA;AACA,UAAM,sBAAsB,SAAS,aAAa,OAAO,MAAM,OAAO,EAAE;AAJxD;AACA;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EANkB;AAAA,EACA;AAMpB;AAcO,SAAS,mBAAmB,SAAmD;AACpF,MAAI,CAAC,QAAQ,QAAS,QAAO;AAC7B,MAAI,CAAC,QAAQ,QAAQ,WAAW,kBAAkB,EAAG,QAAO;AAE5D,QAAM,OAAO,QAAQ,QAAQ,MAAM,mBAAmB,MAAM;AAC5D,QAAM,CAAC,UAAU,GAAG,UAAU,IAAI,KAAK,MAAM,GAAG;AAChD,QAAM,QAAQ,WAAW,KAAK,GAAG;AACjC,MAAI,CAAC,YAAY,CAAC,OAAO;AACvB,UAAM,IAAI;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,WAA0C;AAAA,IAC9C,UAAU,QAAQ;AAAA,IAClB,YAAY,QAAQ;AAAA,IACpB,cAAc,QAAQ,cAAc,CAAC,GAAG;AAAA,IACxC,YAAY,QAAQ;AAAA,EACtB;AAEA,UAAQ,UAAU;AAAA,IAChB,KAAK;AACH,aAAO,aAAa,SAAS,OAAO,QAAQ;AAAA,IAC9C,KAAK;AACH,aAAO,cAAc,SAAS,OAAO,QAAQ;AAAA,IAC/C,KAAK;AACH,aAAO,gBAAgB,SAAS,OAAO,QAAQ;AAAA,IACjD,KAAK;AACH,aAAO,kBAAkB,SAAS,OAAO,QAAQ;AAAA,IACnD;AACE,YAAM,IAAI;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,iBAAiB,QAAQ;AAAA,MAC3B;AAAA,EACJ;AACF;AAEA,SAAS,aACP,SACA,OACA,UACmB;AACnB,QAAM,UAAU,MAAM,QAAQ,GAAG;AACjC,QAAM,WAAW,WAAW,IAAI,MAAM,MAAM,GAAG,OAAO,IAAI;AAC1D,QAAM,UAAU,WAAW,IAAI,MAAM,MAAM,UAAU,CAAC,IAAI;AAC1D,QAAM,OAAO,aAAa,WAAW,QAAQ,CAAC;AAE9C,QAAM,OAAO,eAAe,SAAS,UAAU,OAAO;AACtD,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM,UAAU,mBAAmB;AAAA,IACnC,OAAO;AAAA,IACP,aAAa,CAAC,EAAE,MAAM,SAAS,KAAK,CAAC;AAAA,IACrC;AAAA,EACF;AACF;AAEA,SAAS,cACP,SACA,OACA,UACmB;AACnB,QAAM,OAAmB,QAAQ,cAC9B,OAAO,CAAC,MAAM,EAAE,GAAG,EACnB,IAAI,CAAC,OAAO;AAAA,IACX,UAAU,mBAAmB,QAAQ,UAAU;AAAA,IAC/C,UAAU,EAAE;AAAA,IACZ,OAAO,EAAE;AAAA,EACX,EAAE;AACJ,QAAM,QAAwB;AAAA,IAC5B,IAAI,SAAS,QAAQ,UAAU;AAAA,IAC/B,MAAM,QAAQ,sBAAsB,QAAQ;AAAA,IAC5C;AAAA,IACA,YAAY,QAAQ;AAAA,IACpB,QAAQ;AAAA,IACR,UAAU;AAAA,MACR,YAAY,QAAQ;AAAA,MACpB,mBAAmB,QAAQ;AAAA,MAC3B,OAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN;AAAA,IACA,aAAa,CAAC;AAAA,IACd;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,gBACP,SACA,UACA,UACmB;AACnB,QAAM,OAAO,aAAa,WAAW,QAAQ,CAAC;AAC9C,QAAM,OAAO;AAAA,IACX;AAAA,IACA,UAAU,QAAQ;AAAA,IAClB,WAAW,QAAQ;AAAA,IACnB;AAAA,IACA,wBAAwB,QAAQ,UAAU;AAAA,IAC1C;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA,GAAI,QAAQ,YAAY,CAAC,gBAAgB,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,IACvE,GAAI,QAAQ,qBACR,CAAC,yBAAyB,IAAI,QAAQ,oBAAoB,EAAE,IAC5D,CAAC;AAAA,EACP,EAAE,KAAK,IAAI;AACX,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,OAAO;AAAA,IACP,aAAa,CAAC,EAAE,MAAM,SAAS,KAAK,CAAC;AAAA,IACrC;AAAA,EACF;AACF;AAEA,SAAS,kBACP,SACA,UACA,UACmB;AACnB,QAAM,OAAO,aAAa,WAAW,QAAQ,CAAC;AAC9C,QAAM,OAAO;AAAA,IACX;AAAA,IACA,UAAU,QAAQ;AAAA,IAClB;AAAA,IACA,0BAA0B,QAAQ,UAAU;AAAA,IAC5C,eAAe,QAAQ,UAAU;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA,GAAI,QAAQ,YAAY,CAAC,eAAe,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,IACtE,GAAI,QAAQ,qBAAqB,CAAC,aAAa,IAAI,QAAQ,oBAAoB,EAAE,IAAI,CAAC;AAAA,EACxF,EAAE,KAAK,IAAI;AACX,SAAO;AAAA,IACL,IAAI,QAAQ,QAAQ,UAAU;AAAA,IAC9B,iBAAiB,QAAQ;AAAA,IACzB,MAAM;AAAA,IACN,OAAO;AAAA,IACP,aAAa,CAAC,EAAE,MAAM,SAAS,KAAK,CAAC;AAAA,IACrC;AAAA,EACF;AACF;AAaO,SAAS,oBACd,UAC2B;AAC3B,QAAM,YAAiC,CAAC;AACxC,QAAM,SAAwC,CAAC;AAC/C,MAAI,UAAU;AACd,aAAW,KAAK,UAAU;AACxB,QAAI;AACF,YAAM,IAAI,mBAAmB,CAAC;AAC9B,UAAI,EAAG,WAAU,KAAK,CAAC;AAAA,UAClB,YAAW;AAAA,IAClB,SAAS,KAAK;AACZ,UAAI,eAAe,4BAA6B,QAAO,KAAK,GAAG;AAAA,UAC1D,OAAM;AAAA,IACb;AAAA,EACF;AACA,SAAO,EAAE,WAAW,SAAS,OAAO;AACtC;AAEA,SAAS,WAAW,GAAmB;AACrC,SACE,EACG,YAAY,EACZ,QAAQ,gBAAgB,GAAG,EAC3B,QAAQ,YAAY,EAAE,EACtB,MAAM,GAAG,GAAG,KAAK;AAExB;AAEA,SAAS,eAAe,SAAyB,MAAc,SAAgC;AAC7F,QAAM,QAAQ,SAAS,IAAI;AAC3B,MAAI,SAAS;AACX,WAAO;AAAA,MACL,MAAM,OAAO;AAAA,MACb;AAAA,MACA,QAAQ;AAAA,MACR;AAAA,MACA,GAAI,QAAQ,YAAY,CAAC,iBAAiB,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,MACxE,GAAI,QAAQ,qBAAqB,CAAC,cAAc,IAAI,QAAQ,oBAAoB,EAAE,IAAI,CAAC;AAAA,MACvF,yBAAyB,QAAQ,UAAU,gBAAgB,QAAQ,WAAW,QAAQ,CAAC,CAAC;AAAA,IAC1F,EAAE,KAAK,IAAI;AAAA,EACb;AACA,SAAO;AAAA,IACL;AAAA,IACA,UAAU,KAAK;AAAA,IACf;AAAA,IACA,yBAAyB,QAAQ,UAAU;AAAA,IAC3C,eAAe,QAAQ,UAAU;AAAA,IACjC;AAAA,IACA;AAAA,IACA,KAAK,KAAK;AAAA,IACV;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,IACA,GAAI,QAAQ,YAAY,CAAC,gBAAgB,IAAI,QAAQ,WAAW,EAAE,IAAI,CAAC;AAAA,IACvE,GAAI,QAAQ,qBACR,CAAC,yBAAyB,IAAI,QAAQ,oBAAoB,EAAE,IAC5D,CAAC;AAAA,EACP,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,SAAS,MAAsB;AACtC,SACE,KACG,MAAM,GAAG,EACT,OAAO,OAAO,EACd,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,YAAY,IAAI,EAAE,MAAM,CAAC,CAAC,EAC3C,KAAK,GAAG,KAAK;AAEpB;;;AC9RA,eAAsB,+BACpB,SAC2C;AAC3C,QAAM,QAAQ,MAAM,oBAAoB,QAAQ,IAAI;AACpD,QAAM,aAAa,uBAAuB,OAAO,EAAE,QAAQ,QAAQ,OAAO,CAAC;AAC3E,QAAM,YAAY;AAAA,IAChB;AAAA,MACE,GAAG;AAAA,MACH,gBAAgB,QAAQ,iBAAiB,CAAC,GAAG,QAAQ,cAAc,IAAI;AAAA,IACzE;AAAA,IACA;AAAA,EACF;AACA,QAAM,YAAY,wBAAwB,OAAO;AAAA,IAC/C,QAAQ,QAAQ;AAAA,IAChB,GAAG,QAAQ;AAAA,EACb,CAAC;AACD,QAAM,kBAAkB,WAAW,OAAO,4BAA4B,UAAU;AAChF,QAAM,gBACJ,QAAQ,gBAAgB,OAAO,CAAC,SAAS,KAAK,eAAe,UAAU,EAAE,UAAU;AACrF,QAAM,oBACJ,kBAAkB,IAAI,IAAI,KAAK,IAAI,GAAG,gBAAgB,eAAe,IAAI;AAC3E,QAAM,QAAQ,WAAW,MAAM,UAAU,MAAM,oBAAoB;AACnE,QAAM,WAAW;AAAA,IACf,WAAW,KAAK,SAAY,GAAG,WAAW,SAAS,MAAM;AAAA,IACzD,UAAU,KAAK,SAAY,GAAG,UAAU,SAAS,MAAM;AAAA,IACvD,oBAAoB,IAChB,SACA,GAAG,eAAe,IAAI,aAAa;AAAA,EACzC,EAAE,OAAO,CAAC,YAA+B,QAAQ,OAAO,CAAC;AAEzD,SAAO;AAAA,IACL;AAAA,IACA,SAAS,QAAQ,2CAA2C,SAAS,KAAK,IAAI;AAAA,IAC9E;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY;AAAA,MACV,YAAY,WAAW,KAAK,IAAI;AAAA,MAChC,YAAY,UAAU,KAAK,IAAI;AAAA,MAC/B,oBAAoB;AAAA,IACtB;AAAA,EACF;AACF;;;ACtFA;AAAA,EACE;AAAA,EAKA,qBAAAC;AAAA,OACK;AA0CA,SAAS,uBAAuB,OAAsD;AAC3F,QAAM,eAAe,MAAM,gBAAgB,CAAC;AAC5C,QAAM,aAAa,CAAC,GAAG,MAAM,eAAe,GAAG,YAAY,EAAE,IAAIC,kBAAiB;AAClF,QAAM,YAAY,0BAA0B;AAAA,IAC1C,QAAQ;AAAA,IACR,aAAa,MAAM;AAAA,IACnB,YAAY,MAAM,cAAc;AAAA,IAChC,QAAQ,MAAM,UAAU,CAAC;AAAA,IACzB,MAAM;AAAA,IACN,cAAc,MAAM,gBAAgB;AAAA,IACpC,YAAY;AAAA,MACV,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA,MAKf,kBAAkB;AAAA,MAClB,gBAAgB,MAAM,cAAc;AAAA,MACpC,gBAAgB,MAAM,aAAa,IAAI;AAAA,MACvC,eAAe;AAAA,MACf,cAAc,MAAM,YAAY;AAAA,IAClC;AAAA,EACF,CAAC;AACD,QAAM,UAA4B;AAAA,IAChC,IAAI,SAAS,QAAQ,GAAG,MAAM,WAAW,IAAI,MAAM,cAAa,oBAAI,KAAK,GAAE,YAAY,CAAC,EAAE;AAAA,IAC1F,aAAa,MAAM;AAAA,IACnB,WAAW,MAAM,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACrD,UAAU,UAAU,WAAW,WAAW,MAAM,kBAAkB;AAAA,IAClE;AAAA,IACA,cAAc,WAAW,IAAI,CAAC,WAAW,OAAO,KAAK;AAAA,EACvD;AACA,SAAO,EAAE,SAAS,WAAW,eAAe,MAAM,eAAe,aAAa;AAChF;;;ACkGO,SAAS,4BACd,UAAwC,CAAC,GAClB;AACvB,QAAM,wBAAwB,KAAK,IAAI,GAAG,QAAQ,yBAAyB,CAAC;AAC5E,QAAM,uBAAuB,KAAK,IAAI,GAAG,QAAQ,wBAAwB,CAAC;AAC1E,QAAM,qBAAqB,KAAK,IAAI,GAAG,QAAQ,sBAAsB,CAAC;AACtE,QAAM,wBAAwB,QAAQ,yBAAyB;AAG/D,QAAM,SAAS,oBAAI,IAA0B;AAE7C,QAAM,YAAY,oBAAI,IAA0B;AAChD,MAAI,SAAS;AACb,MAAI;AAEJ,WAASC,iBAA8B;AACrC,WAAO,QAAQ,UAAU,yBAAyB,QAAQ,cAAc;AAAA,EAC1E;AAGA,WAAS,YAAY,WAA2B,WAAmBC,QAA6B;AAC9F,UAAM,KAAK,QAAQ,UAAU,IAAI;AACjC,UAAM,OAAOC,QAAO,SAAS;AAC7B,UAAM,WAAW,OAAO,IAAI,EAAE;AAC9B,QAAI,UAAU;AACZ,UAAI,KAAM,UAAS,gBAAgB,IAAI,IAAI;AAC3C,UAAI,CAAC,SAAS,eAAe,SAAS,SAAS,EAAG,UAAS,eAAe,KAAK,SAAS;AACxF,wBAAkB,UAAU,UAAU,qBAAqB;AAC3D,aAAO;AAAA,IACT;AACA,UAAM,UAAwB;AAAA,MAC5B;AAAA,MACA,MAAM,UAAU,KAAK,KAAK;AAAA,MAC1B,iBAAiB,IAAI,IAAI,OAAO,CAAC,IAAI,IAAI,CAAC,CAAC;AAAA,MAC3C,gBAAgB,CAAC,SAAS;AAAA,MAC1B,aAAa,oBAAI,IAAI;AAAA,MACrB,WAAW;AAAA,MACX,gBAAgBD;AAAA,IAClB;AACA,sBAAkB,SAAS,UAAU,qBAAqB;AAC1D,WAAO,IAAI,IAAI,OAAO;AACtB,WAAO;AAAA,EACT;AAGA,WAAS,kBAAkB,OAAqB,SAAmC;AACjF,QAAI,CAAC,WAAW,YAAY,MAAM,GAAI;AACtC,UAAM,QAAQ,OAAO,IAAI,OAAO;AAChC,QAAI,CAAC,MAAO;AACZ,UAAM,YAAY,IAAI,OAAO;AAC7B,UAAM,YAAY,IAAI,MAAM,EAAE;AAC9B,UAAM,YAAY;AAClB,UAAM,YAAY;AAAA,EACpB;AAGA,WAAS,mBAAmB,OAA6B;AACvD,WAAO,MAAM,gBAAgB;AAAA,EAC/B;AAEA,WAAS,eAAe,OAA8B;AACpD,WAAO,mBAAmB,KAAK,KAAK;AAAA,EACtC;AAGA,WAAS,OAAO,OAA8B;AAC5C,WAAO,CAAC,eAAe,KAAK,KAAK,CAAC,MAAM;AAAA,EAC1C;AAEA,WAAS,WAAiC;AACxC,UAAM,MAAM,CAAC,GAAG,OAAO,OAAO,CAAC;AAC/B,UAAM,eAAe,CAAC,GAAG,UAAU,OAAO,CAAC;AAC3C,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,iBAAiB,IAAI,OAAO,MAAM;AAAA,MAClC,cAAc,IAAI,OAAO,cAAc;AAAA,MACvC,WAAW,IAAI,OAAO,CAAC,UAAU,MAAM,SAAS;AAAA,MAChD,eAAe,aAAa,OAAO,CAAC,aAAa,CAAC,SAAS,SAAS;AAAA,MACpE;AAAA,IACF;AAAA,EACF;AASA,WAAS,cAAc,eAA+B;AACpD,eAAW,YAAY,UAAU,OAAO,GAAG;AACzC,UAAI,SAAS,UAAW;AAGxB,UAAI,SAAS,SAAS,iBAAiB;AACrC,cAAM,UAAU,SAAS,SAAS,KAAK,CAAC,OAAO;AAC7C,gBAAM,QAAQ,OAAO,IAAI,EAAE;AAC3B,iBAAO,QAAQ,eAAe,KAAK,KAAK,MAAM,YAAY;AAAA,QAC5D,CAAC;AACD,YAAI,QAAS,UAAS,YAAY;AAClC;AAAA,MACF;AACA,YAAM,SAAS,eAAe,SAAS,IAAI;AAC3C,UAAI,OAAO,SAAS,EAAG;AACvB,iBAAW,QAAQ,eAAe;AAChC,cAAM,UAAU,gBAAgB,QAAQ,eAAe,IAAI,CAAC;AAC5D,YAAI,WAAW,KAAK;AAClB,mBAAS,YAAY;AACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASL,MAAM,aACJ,QACA,KACwB;AACxB,YAAM,YAAY,MAAM,cAAc,QAAQ,GAAG;AACjD,UAAI,UAAU,WAAW,GAAG;AAC1B,eAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQ;AAAA,QACV;AAAA,MACF;AACA,YAAM,WAAqB,CAAC;AAC5B,iBAAW,SAAS,WAAW;AAC7B,oBAAY,OAAO,OAAO,KAAK,IAAI,KAAK;AACxC,iBAAS,KAAK,MAAM,IAAI;AAAA,MAC1B;AACA,oBAAc,QAAQ;AACtB,aAAO,EAAE,QAAQ,KAAK;AAAA,IACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQA,SAAS,MAA8B;AACrC,gBAAU;AACV,YAAMA,SAAQ;AACd,YAAM,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC;AAKlC,YAAM,sBAAsB,OAAO;AAAA,QACjC,CAAC,UAAU,OAAO,KAAK,KAAK,MAAM,YAAY,OAAO;AAAA,MACvD;AAIA,YAAM,gBAAgB,wBAAwB,QAAQA,MAAK,EAAE,MAAM,GAAG,oBAAoB;AAC1F,iBAAW,YAAY,eAAe;AACpC,YAAI,CAAC,UAAU,IAAI,SAAS,EAAE,EAAG,WAAU,IAAI,SAAS,IAAI,QAAQ;AAAA,MACtE;AAEA,YAAM,OAAO,eAAe,MAAM,eAAe,qBAAqB,qBAAqB;AAC3F,kBAAY,EAAE,OAAAA,QAAO,eAAe,qBAAqB,MAAM,KAAK;AACpE,cAAQ,UAAU,SAAS;AAC3B,aAAO;AAAA,IACT;AAAA,IAEA,eAAe;AAAA,IAEf,aAAsB;AACpB,YAAM,MAAM,CAAC,GAAG,OAAO,OAAO,CAAC;AAC/B,UAAI,IAAI,WAAW,EAAG,QAAO;AAC7B,YAAM,oBAAoB,IAAI,MAAM,CAAC,UAAU,eAAe,KAAK,KAAK,MAAM,SAAS;AACvF,YAAM,yBAAyB,CAAC,GAAG,UAAU,OAAO,CAAC,EAAE,MAAM,CAAC,aAAa,SAAS,SAAS;AAC7F,aAAO,qBAAqB;AAAA,IAC9B;AAAA,IAEA,YAA8C;AAC5C,aAAO;AAAA,IACT;AAAA,EACF;AAIA,iBAAe,cACb,QACA,KAC2B;AAC3B,UAAM,SAAS,CAAC,GAAG,OAAO,OAAO,CAAC;AAClC,UAAM,UAAU,MAAM,qBAAqB,QAAQ,KAAK,MAAM;AAC9D,QAAI,QAAQ,SAAS,EAAG,QAAO,QAAQ,MAAM,GAAG,kBAAkB;AAClE,QAAI,sBAAuB,QAAO,oBAAoB,MAAM,EAAE,MAAM,GAAG,kBAAkB;AACzF,WAAO,CAAC;AAAA,EACV;AAEA,iBAAe,qBACb,QACA,KACA,QAC2B;AAC3B,QAAI;AACJ,QAAI;AACF,eAASD,eAAc;AAAA,IACzB,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AACA,UAAM,UAAU,OAAO,KAAK,MAAM,GAAG,IAAI;AACzC,UAAM,cAAc,OACjB,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,UAAU,MAAM,MAAM,EAAE,KAAK,MAAM,IAAI,EAAE,EAC9C,KAAK,IAAI;AACZ,UAAM,SACJ,maAKkB,kBAAkB;AACtC,UAAM,OAAO;AAAA,MACX,kBAAkB,IAAI,IAAI;AAAA,MAC1B,eAAe,OAAO,SAAS,QAAQ;AAAA,MACvC,cAAc;AAAA,EAAkC,WAAW,KAAK;AAAA,MAChE;AAAA,EAAkB,OAAO;AAAA,MACzB;AAAA,IACF,EAAE,KAAK,MAAM;AAEb,QAAI,MAAM;AACV,QAAI;AACF,YAAM,MAAM,OAAO;AAAA,QACjB;AAAA,UACE,EAAE,MAAM,UAAU,SAAS,OAAO;AAAA,UAClC,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,QAChC;AAAA,QACA;AAAA,MACF;AAAA,IACF,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AACA,WAAO,qBAAqB,KAAK,MAAM;AAAA,EACzC;AAOA,WAAS,oBAAoB,QAAkD;AAC7E,UAAM,YAAY,OAAO,KACtB,MAAM,eAAe,EACrB,IAAI,CAAC,aAAa,SAAS,KAAK,CAAC,EACjC,OAAO,CAAC,aAAa,eAAe,QAAQ,EAAE,QAAQ,CAAC;AAC1D,WAAO,UAAU,MAAM,GAAG,kBAAkB,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE;AAAA,EACxE;AAaA,WAAS,wBAAwB,QAAwBC,QAA+B;AACtF,QAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AACjC,UAAM,MAAsB,CAAC;AAI7B,eAAW,SAAS,QAAQ;AAC1B,iBAAW,WAAW,MAAM,aAAa;AACvC,cAAM,QAAQ,OAAO,KAAK,CAAC,UAAU,MAAM,OAAO,OAAO;AACzD,YAAI,CAAC,SAAS,MAAM,KAAK,MAAM,GAAI;AACnC,YAAI;AAAA,UACF;AAAA,YACE;AAAA,YACA,kEAAkE,SAAS,MAAM,IAAI,CAAC,UAAU,SAAS,MAAM,IAAI,CAAC;AAAA,YACpH,CAAC,MAAM,IAAI,MAAM,EAAE;AAAA,YACnBA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,eAAW,SAAS,OAAO,OAAO,CAAC,UAAU,CAAC,MAAM,SAAS,GAAG;AAC9D,UAAI,MAAM,gBAAgB,OAAO,uBAAuB;AACtD,YAAI;AAAA,UACF;AAAA,YACE;AAAA,YACA,yCAAyC,SAAS,MAAM,IAAI,CAAC;AAAA,YAC7D,CAAC,MAAM,EAAE;AAAA,YACTA;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,eAAW,SAAS,CAAC,GAAG,MAAM,EAC3B,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,OAAO,EAAE,gBAAgB,IAAI,EAC9D,MAAM,GAAG,CAAC,GAAG;AACd,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,sCAAsC,SAAS,MAAM,IAAI,CAAC;AAAA,UAC1D,CAAC,MAAM,EAAE;AAAA,UACTA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,UAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,gBAAgB,OAAO,EAAE,gBAAgB,IAAI;AACzF,QAAI,OAAO,UAAU,KAAK,OAAO,CAAC,KAAK,OAAO,CAAC,GAAG;AAChD,UAAI;AAAA,QACF;AAAA,UACE;AAAA,UACA,6BAA6B,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,kBAAkB,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC;AAAA,UAC/F,CAAC,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,EAAE;AAAA,UAC3BA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAIA,UAAM,WAA6C;AAAA,MACjD,eAAe;AAAA,MACf,KAAK;AAAA,MACL,WAAW;AAAA,MACX,aAAa;AAAA,IACf;AACA,WAAO,IAAI,KAAK,CAAC,GAAG,MAAM,SAAS,EAAE,IAAI,IAAI,SAAS,EAAE,IAAI,CAAC;AAAA,EAC/D;AACF;AAMA,SAAS,aACP,MACA,MACA,UACA,aACc;AACd,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,IAAI,KAAK,OAAO,GAAG,IAAI,IAAI,IAAI,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,IAC/C;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACF;AACF;AAGA,SAAS,QAAQ,MAAsB;AACrC,SAAO,KAAK,OAAO,cAAc,IAAI,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC;AACtD;AAEA,SAASC,QAAO,KAAqB;AACnC,MAAI;AACF,WAAO,IAAI,IAAI,IAAI,KAAK,CAAC,EAAE,SAAS,YAAY,EAAE,QAAQ,UAAU,EAAE;AAAA,EACxE,QAAQ;AAGN,WAAO,gBAAgB,GAAG;AAAA,EAC5B;AACF;AAEA,SAAS,cAAc,MAAsB;AAC3C,SAAO,KACJ,YAAY,EACZ,QAAQ,sBAAsB,GAAG,EACjC,QAAQ,QAAQ,GAAG,EACnB,KAAK;AACV;AAEA,IAAMC,aAAY,oBAAI,IAAI;AAAA,EACxB;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;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,eAAe,MAA2B;AACjD,SAAO,IAAI;AAAA,IACT,cAAc,IAAI,EACf,MAAM,GAAG,EACT,OAAO,CAAC,SAAS,KAAK,UAAU,KAAK,CAACA,WAAU,IAAI,IAAI,CAAC;AAAA,EAC9D;AACF;AAEA,SAAS,gBAAgB,GAAgB,GAAwB;AAC/D,MAAI,EAAE,SAAS,EAAG,QAAO;AACzB,MAAI,OAAO;AACX,aAAW,QAAQ,EAAG,KAAI,EAAE,IAAI,IAAI,EAAG,SAAQ;AAC/C,SAAO,OAAO,EAAE;AAClB;AAEA,SAAS,SAAS,MAAc,MAAM,KAAa;AACjD,QAAM,IAAI,KAAK,KAAK,EAAE,QAAQ,QAAQ,GAAG;AACzC,SAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;AACrD;AAOA,SAAS,qBAAqB,KAAa,QAA0C;AACnF,QAAM,OAAO,IAAI,KAAK;AACtB,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,QAAM,aAAa,KAAK,MAAM,aAAa;AAC3C,MAAI,CAAC,WAAY,QAAO,CAAC;AACzB,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,WAAW,CAAC,CAAC;AAAA,EACnC,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO,CAAC;AACpC,QAAM,YAAY,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,MAAM,EAAE,CAAC;AACzD,QAAM,MAAwB,CAAC;AAC/B,aAAW,QAAQ,QAAQ;AACzB,QAAI,CAAC,QAAQ,OAAO,SAAS,SAAU;AACvC,UAAM,SAAS;AACf,QAAI,OAAO,OAAO,UAAU,YAAY,CAAC,OAAO,MAAM,KAAK,EAAG;AAC9D,UAAM,gBAAgB,iBAAiB,OAAO,WAAW;AACzD,QAAI,KAAK;AAAA,MACP,MAAM,OAAO,MAAM,KAAK;AAAA,MACxB,uBACE,iBAAiB,UAAU,IAAI,aAAa,IAAI,gBAAgB;AAAA,IACpE,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,SAAS,iBAAiB,OAAoC;AAC5D,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,WAAW,QAAQ,YAAY,MAAM,OAAQ,QAAO;AACzD,QAAM,UAAU,QAAQ,MAAM,cAAc;AAC5C,QAAM,MAAM,UAAU,CAAC,KAAK,SAAS,KAAK;AAC1C,SAAO,GAAG,WAAW,IAAI,IAAI,KAAK;AACpC;AAOA,SAAS,eACP,MACA,eACA,qBACA,uBACQ;AACR,QAAM,QAAkB,CAAC;AACzB,QAAM;AAAA,IACJ;AAAA,EACF;AAEA,MAAI,cAAc,SAAS,GAAG;AAC5B,UAAM,KAAK,IAAI,0CAA0C;AACzD,eAAW,YAAY,eAAe;AACpC,YAAM,KAAK,MAAM,SAAS,IAAI,KAAK,SAAS,IAAI,EAAE;AAAA,IACpD;AAAA,EACF;AAEA,MAAI,oBAAoB,SAAS,GAAG;AAClC,UAAM;AAAA,MACJ;AAAA,MACA,kEAAkE,qBAAqB;AAAA,IACzF;AACA,eAAW,SAAS,qBAAqB;AACvC,YAAM,SACJ,MAAM,YAAY,OAAO,IACrB,yEACA,QAAQ,MAAM,gBAAgB,IAAI;AACxC,YAAM,KAAK,MAAM,SAAS,MAAM,IAAI,CAAC,YAAO,MAAM,EAAE;AAAA,IACtD;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,GAAG;AACnB,UAAM,KAAK,IAAI,4BAA4B;AAC3C,eAAW,OAAO,MAAM;AACtB,YAAM,KAAK,MAAM,IAAI,WAAW,aAAa,MAAM,KAAK,IAAI,WAAW,KAAK,IAAI,EAAE,GAAG;AAAA,IACvF;AAAA,EACF;AAEA,SAAO,MAAM,KAAK,IAAI;AACxB;","names":["resolve","reason","sha256DigestSchema","contentWords","stopwords","candidate","evidence","mutation","activationResult","average","unique","sha256DigestSchema","round","join","z","z","join","join","round","remainingGaps","join","z","z","emptyIndex","validateRunRecord","validateRunRecord","resolveRouter","round","hostOf","stopwords"]}