@tangle-network/agent-eval 0.118.1 → 0.118.2

package/dist/chunk-GCT3DQWU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/campaign/lineage.ts","../src/campaign/analyst-surface.ts","../src/paired-arms.ts","../src/campaign/cross-surface-context.ts","../src/campaign/cross-surface-interaction.ts","../src/campaign/fixtures.ts","../src/campaign/gates/neutralization-gate.ts","../src/campaign/gates/sequential.ts","../src/campaign/grounded-reflection.ts","../src/campaign/labeled-store/fs-adapter.ts","../src/campaign/neutralize.ts","../src/campaign/proposers/fapo.ts","../src/campaign/skill-patch.ts","../src/campaign/proposers/skill-opt.ts","../src/campaign/presets/run-skill-opt.ts","../src/campaign/presets/compare-proposers.ts","../src/completion-verifier.ts","../src/produced-state.ts","../src/campaign/presets/playback.ts","../src/campaign/presets/run-lineage-loop.ts","../src/campaign/presets/run-profile-matrix.ts","../src/agent-profile.ts","../src/campaign/proposers/_findings-text.ts","../src/campaign/proposers/ace.ts","../src/campaign/proposers/composite.ts","../src/campaign/proposers/halo.ts","../src/campaign/proposers/analysis-edit.ts","../src/campaign/proposers/llm-policy-edit.ts","../src/campaign/proposers/policy-edit.ts","../src/campaign/proposers/policy-edit-author-context.ts","../src/campaign/proposers/memory.ts","../src/campaign/proposers/trace-analyst.ts","../src/campaign/scenario-selection.ts","../src/campaign/search-ledger.ts","../src/campaign/single-run-lock.ts","../src/campaign/transient-failure.ts","../src/campaign/worktree/index.ts"],"sourcesContent":["/**\n * Lineage DAG — a git-graph of improvement candidates.\n *\n * The improvement loop (`run-optimization.ts`) records a LINEAR `GenerationRecord[]`\n * with no parent pointers, computes a Pareto frontier within a run, then collapses\n * to one gated winner and discards the rest. This module adds the missing\n * first-class structure: a directed acyclic graph of candidate versions where\n *\n *   - a node with ONE parent is a mutation,\n *   - a node with ZERO parents is a root/seed,\n *   - a node with 2+ parents is a MERGE (a \"collapse\") — nothing special-cased,\n *     just a multi-parent node,\n *   - a `track` groups a lineage into an island, and each track runs a distinct\n *     `vision` (a proposer strategy — e.g. a \"solve\" vision, an \"outside-the-box\"\n *     vision, and an adversarial \"contrarian\" vision that attacks the leader).\n *\n * An agent-managed {@link Governor} decides the next operation (extend / branch /\n * merge / prune / stop), so branching AND collapsing are choices a supervisor\n * makes by reading the graph, not hard-coded control flow.\n *\n * DETERMINISM is a hard invariant: no `Date.now`, `Math.random`, or `new Date`.\n * Ids are content+lineage hashes; order is a monotone insertion counter; every\n * query returns nodes in `seq` order. Same inputs ⇒ identical graph.\n */\n\nimport { createHash } from 'node:crypto'\nimport { appendFile, mkdir, readFile, writeFile } from 'node:fs/promises'\nimport { dirname } from 'node:path'\n\nexport interface LineageNode {\n  /** Deterministic content+lineage hash (see {@link lineageNodeId}). */\n  id: string\n  /** `[]` = root/seed; `[x]` = mutation; `[x, y, ...]` = MERGE (collapse). */\n  parentIds: string[]\n  /** Logical island/track this node belongs to. */\n  track: string\n  /** Human label for the strategy driving this track (e.g. `solve`, `contrarian`). */\n  vision?: string\n  /** Candidate content (prompt text, skill document, config JSON, ...). */\n  surface: string\n  /** Scalar fitness (e.g. mean holdout composite); higher is better. */\n  score: number\n  /** Optional per-scenario objective vector for Pareto dominance. */\n  scoreVector?: number[]\n  /** Which proposer produced it (`gepa`, `skill-opt`, `merge`, `seed`, ...). */\n  proposer: string\n  rationale?: string\n  /** Gate verdict, when this node was gated. */\n  gate?: 'ship' | 'hold'\n  /** Step index within its track (root = 0). */\n  generation: number\n  /** Monotone global insertion order (assigned by {@link Lineage.addNode}). */\n  seq: number\n}\n\nexport interface LineageEdge {\n  /** Parent node id. */\n  from: string\n  /** Child node id. */\n  to: string\n}\n\nexport interface LineageGraph {\n  nodes: LineageNode[]\n  edges: LineageEdge[]\n}\n\n/** Deterministic node id: a hash of the node's lineage + content + proposer.\n *  Pure — identical inputs always yield the same id (a re-derived node collapses\n *  onto its original rather than duplicating). */\nexport function lineageNodeId(input: {\n  parentIds: string[]\n  track: string\n  surface: string\n  proposer: string\n}): string {\n  const parents = [...input.parentIds].sort().join(',')\n  const payload = `${parents}|${input.track}|${input.surface}|${input.proposer}`\n  return createHash('sha256').update(payload).digest('hex').slice(0, 16)\n}\n\n/** Input to {@link Lineage.addNode}: everything but the derived `id`/`seq` and the\n *  optional `generation` (derived from parents when omitted). */\nexport type LineageNodeInput = Omit<LineageNode, 'id' | 'seq' | 'generation'> & {\n  generation?: number\n}\n\n/** Deterministic improvement-candidate graph with mutation, merge, frontier, and persistence helpers. */\nexport class Lineage {\n  private readonly byId = new Map<string, LineageNode>()\n  private readonly childIds = new Map<string, string[]>()\n  private nextSeq = 0\n\n  constructor(nodes?: readonly LineageNode[]) {\n    if (!nodes) return\n    // Rehydrate in seq order so parents always precede children and the monotone\n    // counter resumes past the highest persisted seq.\n    for (const node of [...nodes].sort((a, b) => a.seq - b.seq)) {\n      this.index(node)\n      this.nextSeq = Math.max(this.nextSeq, node.seq + 1)\n    }\n  }\n\n  /** Append a node. Derives `id` (via {@link lineageNodeId}), assigns the next\n   *  `seq`, and derives `generation` as `max(parent.generation) + 1` (root = 0)\n   *  when omitted. Throws on an unknown parent. Idempotent: re-adding an identical\n   *  node returns the existing one.\n   *\n   *  Acyclicity is guaranteed by construction, not by a runtime check: every\n   *  parent must already exist (a child can never point at a not-yet-added node),\n   *  ids are immutable content hashes (an existing node can never gain new\n   *  parents), and the store is append-only — so no back-edge can form. (Traversal\n   *  is still cycle-safe against hand-corrupted deserialized input via visited\n   *  sets in {@link ancestors}/{@link descendants}.) */\n  addNode(input: LineageNodeInput): LineageNode {\n    for (const parentId of input.parentIds) {\n      if (!this.byId.has(parentId)) {\n        throw new Error(`Lineage.addNode: unknown parent '${parentId}'`)\n      }\n    }\n    const id = lineageNodeId({\n      parentIds: input.parentIds,\n      track: input.track,\n      surface: input.surface,\n      proposer: input.proposer,\n    })\n    const existing = this.byId.get(id)\n    if (existing) return existing\n\n    const generation =\n      input.generation ??\n      (input.parentIds.length === 0\n        ? 0\n        : Math.max(...input.parentIds.map((p) => this.byId.get(p)!.generation)) + 1)\n\n    const node: LineageNode = {\n      id,\n      parentIds: [...input.parentIds],\n      track: input.track,\n      surface: input.surface,\n      score: input.score,\n      proposer: input.proposer,\n      generation,\n      seq: this.nextSeq++,\n      ...(input.vision !== undefined ? { vision: input.vision } : {}),\n      ...(input.scoreVector !== undefined ? { scoreVector: [...input.scoreVector] } : {}),\n      ...(input.rationale !== undefined ? { rationale: input.rationale } : {}),\n      ...(input.gate !== undefined ? { gate: input.gate } : {}),\n    }\n    this.index(node)\n    return node\n  }\n\n  /** Collapse 2+ parents into a single node (a merge/\"collapse\"). A merge is an\n   *  ordinary multi-parent node; this is a guarded convenience. */\n  merge(input: {\n    parentIds: string[]\n    track: string\n    surface: string\n    score: number\n    proposer?: string\n    vision?: string\n    scoreVector?: number[]\n    rationale?: string\n  }): LineageNode {\n    if (input.parentIds.length < 2) {\n      throw new Error(`Lineage.merge: a merge needs >= 2 parents, got ${input.parentIds.length}`)\n    }\n    return this.addNode({ ...input, proposer: input.proposer ?? 'merge' })\n  }\n\n  get(id: string): LineageNode | undefined {\n    return this.byId.get(id)\n  }\n\n  has(id: string): boolean {\n    return this.byId.has(id)\n  }\n\n  /** All nodes, in insertion (`seq`) order. */\n  all(): LineageNode[] {\n    return [...this.byId.values()].sort(bySeq)\n  }\n\n  roots(): LineageNode[] {\n    return this.all().filter((n) => n.parentIds.length === 0)\n  }\n\n  parents(id: string): LineageNode[] {\n    const node = this.byId.get(id)\n    if (!node) return []\n    return node.parentIds\n      .map((p) => this.byId.get(p))\n      .filter((n): n is LineageNode => n !== undefined)\n      .sort(bySeq)\n  }\n\n  children(id: string): LineageNode[] {\n    return (this.childIds.get(id) ?? []).map((c) => this.byId.get(c)!).sort(bySeq)\n  }\n\n  /** Transitive ancestors (excludes `id`). */\n  ancestors(id: string): Set<string> {\n    const out = new Set<string>()\n    const stack = [...(this.byId.get(id)?.parentIds ?? [])]\n    while (stack.length > 0) {\n      const cur = stack.pop()!\n      if (out.has(cur)) continue\n      out.add(cur)\n      const node = this.byId.get(cur)\n      if (node) stack.push(...node.parentIds)\n    }\n    return out\n  }\n\n  /** Transitive descendants (excludes `id`). */\n  descendants(id: string): Set<string> {\n    const out = new Set<string>()\n    const stack = [...(this.childIds.get(id) ?? [])]\n    while (stack.length > 0) {\n      const cur = stack.pop()!\n      if (out.has(cur)) continue\n      out.add(cur)\n      stack.push(...(this.childIds.get(cur) ?? []))\n    }\n    return out\n  }\n\n  /** Nodes with no children (leaf/branch tips). */\n  tips(): LineageNode[] {\n    return this.all().filter((n) => (this.childIds.get(n.id) ?? []).length === 0)\n  }\n\n  /** Distinct track ids, in first-seen (`seq`) order. */\n  tracks(): string[] {\n    const seen = new Set<string>()\n    const out: string[] = []\n    for (const node of this.all()) {\n      if (!seen.has(node.track)) {\n        seen.add(node.track)\n        out.push(node.track)\n      }\n    }\n    return out\n  }\n\n  trackNodes(track: string): LineageNode[] {\n    return this.all().filter((n) => n.track === track)\n  }\n\n  /** The highest-`score` tip of a track (ties broken by lowest `seq`). */\n  trackTip(track: string): LineageNode | undefined {\n    return pickBest(this.tips().filter((n) => n.track === track))\n  }\n\n  /** The highest-`score` node overall (ties broken by lowest `seq`). */\n  best(): LineageNode | undefined {\n    return pickBest(this.all())\n  }\n\n  /** The Pareto-non-dominated set among TIPS. Uses `scoreVector` when every\n   *  compared tip carries one, else the scalar `score`. A dominates B iff A is\n   *  >= B on every component and > B on at least one. */\n  frontier(): LineageNode[] {\n    const tips = this.tips()\n    const useVector = tips.length > 0 && tips.every((n) => n.scoreVector !== undefined)\n    const vecOf = (n: LineageNode): number[] => (useVector ? n.scoreVector! : [n.score])\n    return tips\n      .filter((a) => !tips.some((b) => b.id !== a.id && dominates(vecOf(b), vecOf(a))))\n      .sort(bySeq)\n  }\n\n  toGraph(): LineageGraph {\n    const nodes = this.all()\n    const edges: LineageEdge[] = []\n    for (const node of nodes) {\n      for (const parentId of node.parentIds) {\n        edges.push({ from: parentId, to: node.id })\n      }\n    }\n    return { nodes, edges }\n  }\n\n  /** One JSON node per line, in `seq` order. */\n  toJSONL(): string {\n    return this.all()\n      .map((n) => JSON.stringify(n))\n      .join('\\n')\n  }\n\n  static fromJSONL(text: string): Lineage {\n    const nodes = text\n      .split('\\n')\n      .map((line) => line.trim())\n      .filter((line) => line.length > 0)\n      .map((line) => JSON.parse(line) as LineageNode)\n    return new Lineage(nodes)\n  }\n\n  private index(node: LineageNode): void {\n    this.byId.set(node.id, node)\n    for (const parentId of node.parentIds) {\n      const list = this.childIds.get(parentId)\n      if (list) {\n        if (!list.includes(node.id)) list.push(node.id)\n      } else {\n        this.childIds.set(parentId, [node.id])\n      }\n    }\n  }\n}\n\nfunction bySeq(a: LineageNode, b: LineageNode): number {\n  return a.seq - b.seq\n}\n\n/** Highest score, ties broken by lowest seq. */\nfunction pickBest(nodes: LineageNode[]): LineageNode | undefined {\n  let best: LineageNode | undefined\n  for (const node of nodes) {\n    if (!best || node.score > best.score || (node.score === best.score && node.seq < best.seq)) {\n      best = node\n    }\n  }\n  return best\n}\n\n/** True iff `a` Pareto-dominates `b`: `a[i] >= b[i]` for all i and `a[i] > b[i]`\n *  for some i. Vectors of unequal length never dominate (incomparable). */\nfunction dominates(a: number[], b: number[]): boolean {\n  if (a.length !== b.length) return false\n  let strictlyBetter = false\n  for (let i = 0; i < a.length; i += 1) {\n    if (a[i]! < b[i]!) return false\n    if (a[i]! > b[i]!) strictlyBetter = true\n  }\n  return strictlyBetter\n}\n\n// ── Persistence ──────────────────────────────────────────────────────────────\n\nexport interface LineageStore {\n  /** Load the persisted lineage (an empty `Lineage` when nothing is stored). */\n  load(): Promise<Lineage>\n  /** Append one node durably. */\n  append(node: LineageNode): Promise<void>\n  /** Overwrite with a full snapshot. */\n  save(lineage: Lineage): Promise<void>\n}\n\n/** JSONL-file store: append-only durability, snapshot via rewrite, `load` parses\n *  through {@link Lineage.fromJSONL}. */\nexport function fsLineageStore(path: string): LineageStore {\n  const ensureDir = () => mkdir(dirname(path), { recursive: true })\n  return {\n    async load() {\n      try {\n        return Lineage.fromJSONL(await readFile(path, 'utf8'))\n      } catch (err) {\n        if ((err as NodeJS.ErrnoException).code === 'ENOENT') return new Lineage()\n        throw err\n      }\n    },\n    async append(node) {\n      await ensureDir()\n      await appendFile(path, `${JSON.stringify(node)}\\n`, 'utf8')\n    },\n    async save(lineage) {\n      await ensureDir()\n      const jsonl = lineage.toJSONL()\n      await writeFile(path, jsonl.length > 0 ? `${jsonl}\\n` : '', 'utf8')\n    },\n  }\n}\n\n/** In-memory store (default; for tests and ephemeral runs). */\nexport function memLineageStore(): LineageStore {\n  const nodes: LineageNode[] = []\n  return {\n    async load() {\n      return new Lineage(nodes)\n    },\n    async append(node) {\n      nodes.push(node)\n    },\n    async save(lineage) {\n      nodes.length = 0\n      nodes.push(...lineage.all())\n    },\n  }\n}\n\n// ── Governor (agent-managed decision layer) ──────────────────────────────────\n\nexport type GovernorOp =\n  | { op: 'extend'; track: string }\n  | { op: 'branch'; fromNodeId: string; track: string; proposer: string; vision?: string }\n  | { op: 'merge'; parentIds: string[]; track: string }\n  | { op: 'prune'; track: string }\n  | { op: 'stop' }\n\nexport interface GovernorContext {\n  lineage: Lineage\n  /** Operations executed so far. */\n  step: number\n  budgetRemaining: number\n  /** Tracks already pruned — the governor must not target these for extend/branch. */\n  prunedTracks: string[]\n}\n\nexport interface Governor {\n  decide(ctx: GovernorContext): Promise<GovernorOp> | GovernorOp\n}\n\nexport interface HeuristicGovernorOptions {\n  /** Cap on live tracks before branching a new one. Default 3. */\n  maxTracks?: number\n  /** Non-improving steps a track may take before it is pruned. Default 2. */\n  plateauSteps?: number\n  /** Frontier-tip count (across distinct tracks) that triggers a merge. Default 2. */\n  mergeFrontierAt?: number\n}\n\n/** The reference deterministic policy an agent {@link Governor} can replace.\n *  Reads only the lineage + context — no LLM, no randomness. */\nexport function heuristicGovernor(opts: HeuristicGovernorOptions = {}): Governor {\n  const maxTracks = opts.maxTracks ?? 3\n  const plateauSteps = opts.plateauSteps ?? 2\n  const mergeFrontierAt = opts.mergeFrontierAt ?? 2\n\n  return {\n    decide(ctx: GovernorContext): GovernorOp {\n      const { lineage } = ctx\n      if (ctx.budgetRemaining <= 0) return { op: 'stop' }\n\n      const pruned = new Set(ctx.prunedTracks)\n      const liveTracks = lineage.tracks().filter((t) => !pruned.has(t))\n      if (liveTracks.length === 0) return { op: 'stop' }\n\n      // Merge first: when distinct-track frontier tips have accumulated, collapse\n      // them into the best-scoring track so parallel progress consolidates.\n      const frontierByTrack = new Map<string, LineageNode>()\n      for (const tip of lineage.frontier()) {\n        if (pruned.has(tip.track)) continue\n        if (!frontierByTrack.has(tip.track)) frontierByTrack.set(tip.track, tip)\n      }\n      if (frontierByTrack.size >= mergeFrontierAt) {\n        const tips = [...frontierByTrack.values()].sort(bySeq)\n        const target = pickBest(tips)!\n        return { op: 'merge', parentIds: tips.map((t) => t.id), track: target.track }\n      }\n\n      // Prune a plateaued track (best score unchanged over the last `plateauSteps`\n      // nodes of the track).\n      for (const track of liveTracks) {\n        if (isPlateaued(lineage.trackNodes(track), plateauSteps)) {\n          // Only prune if another live track remains OR we can branch — otherwise\n          // pruning the last track just stops the run prematurely.\n          if (liveTracks.length > 1 || liveTracks.length < maxTracks) {\n            return { op: 'prune', track }\n          }\n        }\n      }\n\n      // Branch a fresh track when there is headroom and the leader has plateaued.\n      const leader = pickBest(liveTracks.map((t) => lineage.trackTip(t)!).filter(Boolean))\n      if (\n        leader &&\n        liveTracks.length < maxTracks &&\n        isPlateaued(lineage.trackNodes(leader.track), plateauSteps)\n      ) {\n        return {\n          op: 'branch',\n          fromNodeId: leader.id,\n          track: `${leader.track}+${lineage.tracks().length}`,\n          proposer: 'gepa',\n        }\n      }\n\n      // Otherwise extend the best climbing track.\n      if (leader) return { op: 'extend', track: leader.track }\n      return { op: 'stop' }\n    },\n  }\n}\n\n/** The LLM-supervisor slot: a governor whose `decide` defers to a caller-supplied\n *  async function (which may read `ctx.lineage.toGraph()`). */\nexport function callbackGovernor(decide: (ctx: GovernorContext) => Promise<GovernorOp>): Governor {\n  return { decide }\n}\n\n/** A track is plateaued when its best score has not improved across its most\n *  recent `window` nodes (needs > `window` nodes to judge). */\nfunction isPlateaued(trackNodes: LineageNode[], window: number): boolean {\n  if (trackNodes.length <= window) return false\n  const ordered = [...trackNodes].sort(bySeq)\n  const head = ordered.slice(0, ordered.length - window)\n  const tail = ordered.slice(ordered.length - window)\n  const bestBefore = Math.max(...head.map((n) => n.score))\n  const bestRecent = Math.max(...tail.map((n) => n.score))\n  return bestRecent <= bestBefore\n}\n\n// ── Orchestration ────────────────────────────────────────────────────────────\n\nexport interface RunLineageSeed {\n  surface: string\n  track: string\n  vision?: string\n  proposer: string\n  score: number\n  scoreVector?: number[]\n}\n\nexport interface RunLineageStepResult {\n  surface: string\n  score: number\n  scoreVector?: number[]\n  rationale?: string\n  gate?: 'ship' | 'hold'\n}\n\nexport interface RunLineageOptions {\n  seeds: RunLineageSeed[]\n  /** Produce one new candidate from a track's tip (propose + measure + gate in\n   *  real use; a pure function in tests). */\n  step: (args: {\n    track: string\n    proposer: string\n    tip: LineageNode\n  }) => Promise<RunLineageStepResult>\n  /** Collapse 2+ parent surfaces into one (GEPA crossover / LLM merge in real use). */\n  merge: (args: {\n    parents: LineageNode[]\n    track: string\n  }) => Promise<Omit<RunLineageStepResult, 'gate'>>\n  governor: Governor\n  budget: { maxSteps: number }\n  store?: LineageStore\n  log?: (msg: string, fields?: Record<string, unknown>) => void\n}\n\nexport interface RunLineageResult {\n  lineage: Lineage\n  best: LineageNode | undefined\n  steps: number\n}\n\n/** Drive a multi-track improvement DAG under an agent-managed governor. Seeds each\n *  entry as a root, then repeatedly asks the governor for the next operation\n *  (extend / branch / merge / prune / stop) up to `budget.maxSteps`, persisting\n *  every node. Honors `prune`: a pruned track is never extended or branched again. */\nexport async function runLineage(opts: RunLineageOptions): Promise<RunLineageResult> {\n  const store = opts.store ?? memLineageStore()\n  const lineage = await store.load()\n  const log = opts.log ?? (() => {})\n  const pruned = new Set<string>()\n\n  // The proposer a track extends with — seeded, inherited by branches.\n  const trackProposer = new Map<string, string>()\n\n  const persist = async (node: LineageNode) => {\n    await store.append(node)\n  }\n\n  for (const seed of opts.seeds) {\n    const node = lineage.addNode({\n      parentIds: [],\n      track: seed.track,\n      surface: seed.surface,\n      score: seed.score,\n      proposer: seed.proposer,\n      ...(seed.vision !== undefined ? { vision: seed.vision } : {}),\n      ...(seed.scoreVector !== undefined ? { scoreVector: seed.scoreVector } : {}),\n    })\n    trackProposer.set(seed.track, seed.proposer)\n    await persist(node)\n  }\n\n  let steps = 0\n  while (steps < opts.budget.maxSteps) {\n    const op = await opts.governor.decide({\n      lineage,\n      step: steps,\n      budgetRemaining: opts.budget.maxSteps - steps,\n      prunedTracks: [...pruned],\n    })\n\n    if (op.op === 'stop') {\n      log('lineage: governor stop', { steps })\n      break\n    }\n\n    if (op.op === 'prune') {\n      pruned.add(op.track)\n      log('lineage: prune', { track: op.track })\n      steps += 1\n      continue\n    }\n\n    if (op.op === 'merge') {\n      const parents = op.parentIds\n        .map((id) => lineage.get(id))\n        .filter((n): n is LineageNode => n !== undefined)\n      if (parents.length < 2) {\n        log('lineage: merge skipped (fewer than 2 known parents)', { op })\n        steps += 1\n        continue\n      }\n      const result = await opts.merge({ parents, track: op.track })\n      const node = lineage.merge({\n        parentIds: parents.map((p) => p.id),\n        track: op.track,\n        surface: result.surface,\n        score: result.score,\n        ...(parents[0]!.vision !== undefined ? { vision: parents[0]!.vision } : {}),\n        ...(result.scoreVector !== undefined ? { scoreVector: result.scoreVector } : {}),\n        ...(result.rationale !== undefined ? { rationale: result.rationale } : {}),\n      })\n      await persist(node)\n      steps += 1\n      continue\n    }\n\n    if (op.op === 'branch') {\n      if (pruned.has(op.track)) {\n        log('lineage: branch skipped (target track pruned)', { track: op.track })\n        steps += 1\n        continue\n      }\n      const from = lineage.get(op.fromNodeId)\n      if (!from) {\n        log('lineage: branch skipped (unknown fromNodeId)', { op })\n        steps += 1\n        continue\n      }\n      trackProposer.set(op.track, op.proposer)\n      const result = await opts.step({ track: op.track, proposer: op.proposer, tip: from })\n      const node = lineage.addNode({\n        parentIds: [from.id],\n        track: op.track,\n        surface: result.surface,\n        score: result.score,\n        proposer: op.proposer,\n        ...(op.vision !== undefined ? { vision: op.vision } : {}),\n        ...(result.scoreVector !== undefined ? { scoreVector: result.scoreVector } : {}),\n        ...(result.rationale !== undefined ? { rationale: result.rationale } : {}),\n        ...(result.gate !== undefined ? { gate: result.gate } : {}),\n      })\n      await persist(node)\n      steps += 1\n      continue\n    }\n\n    // op.op === 'extend'\n    if (pruned.has(op.track)) {\n      log('lineage: extend skipped (track pruned)', { track: op.track })\n      steps += 1\n      continue\n    }\n    const tip = lineage.trackTip(op.track)\n    if (!tip) {\n      log('lineage: extend skipped (no tip for track)', { track: op.track })\n      steps += 1\n      continue\n    }\n    const proposer = trackProposer.get(op.track) ?? tip.proposer\n    const result = await opts.step({ track: op.track, proposer, tip })\n    const node = lineage.addNode({\n      parentIds: [tip.id],\n      track: op.track,\n      surface: result.surface,\n      score: result.score,\n      proposer,\n      ...(tip.vision !== undefined ? { vision: tip.vision } : {}),\n      ...(result.scoreVector !== undefined ? { scoreVector: result.scoreVector } : {}),\n      ...(result.rationale !== undefined ? { rationale: result.rationale } : {}),\n      ...(result.gate !== undefined ? { gate: result.gate } : {}),\n    })\n    await persist(node)\n    steps += 1\n  }\n\n  return { lineage, best: lineage.best(), steps }\n}\n","/**\n * Make the trace-analyst's OWN prompt a GEPA-optimizable surface.\n *\n * The analyst that drives self-improvement is itself a prompt — and a\n * hand-tuned one (a hardcoded, hand-versioned `const`). This module lets the\n * loop optimize it: the analyst `actorDescription` becomes a `MutableSurface`\n * that `gepaProposer` / `haloProposer` / any `SurfaceProposer` can mutate inside\n * `runImprovementLoop` or `compareProposers`. That is the second-order loop —\n * optimizing the optimizer's eyes, not just the agent's prompt.\n *\n * Two pieces, both deliberately small (the loop engine already exists — this\n * only supplies the analyst-shaped dispatch + an objective scorer):\n *\n *  - `buildAnalystSurfaceDispatch` — `dispatchWithSurface(surface, scenario)`\n *    runs `analyzeTraces` with `surface` as the actorDescription over the\n *    scenario's fixed trace corpus, returning its findings.\n *  - `failureModeRecallJudge` — a DETERMINISTIC judge (no LLM, no opinion)\n *    that scores those findings against the scenario's GROUND-TRUTH failure\n *    modes. This is what keeps optimizing the analyst prompt ungameable: the\n *    labels come from objective signal (e.g. AppWorld `world.evaluate()` tells\n *    us which task failed and which API calls were wrong), so we reward an\n *    analyst for surfacing the failures that really happened — not for\n *    pleasing a judge that could be talked into anything (Goodhart).\n *\n * Wiring (the loop is unchanged; you only pass these in):\n *\n *   const dispatchWithSurface = buildAnalystSurfaceDispatch({ analystOptions: { ai } })\n *   await runImprovementLoop({\n *     baselineSurface: TRACE_ANALYST_ACTOR_DESCRIPTION,  // the prompt under optimization\n *     scenarios: trainScenarios,                          // labeled trace corpora\n *     holdoutScenarios: heldOutScenarios,\n *     dispatchWithSurface,\n *     judges: [failureModeRecallJudge()],\n *     proposer: gepaProposer({ baseUrl, apiKey }),\n *     gate: heldOutGate({ minDelta: 0.02 }),\n *     autoOnPromote: 'none',\n *   })\n */\n\nimport type {\n  AnalyzeTracesInput,\n  AnalyzeTracesOptions,\n  AnalyzeTracesResult,\n} from '../trace-analyst/analyst'\nimport { analyzeTraces } from '../trace-analyst/analyst'\nimport type { DispatchContext, JudgeConfig, MutableSurface, Scenario } from './types'\n\n/**\n * A labeled trace scenario: a FIXED trace corpus plus the failure modes a\n * competent analyst MUST surface from it. The labels are ground truth — the\n * objective failures that actually occurred — which is what makes optimizing\n * the analyst prompt against them meaningful rather than circular.\n */\nexport interface AnalystScenario extends Scenario {\n  kind: 'analyst-surface'\n  /** OTLP-JSONL path or an in-memory store of the traces to analyze. */\n  source: AnalyzeTracesOptions['source']\n  /** The domain question handed to the analyst (framing lives here, not in\n   *  the surface under optimization). */\n  question: string\n  /**\n   * Ground-truth failure modes a good analyst must identify. A finding \"hits\"\n   * a mode when it contains ANY of the mode's case-insensitive cues. Derive\n   * these from objective signal (failed task + which step broke), never from\n   * the analyst's own prior output.\n   */\n  expectedFailureModes: Array<{ id: string; cues: string[] }>\n  /**\n   * Cues that mark a finding as HALLUCINATED / out-of-scope for this corpus —\n   * naming a tool, error, or failure that did not occur. Presence penalizes\n   * precision. Optional; omit to score recall only.\n   */\n  forbiddenCues?: string[]\n}\n\n/** The analyst's output for one scenario — the artifact the judge scores. */\nexport interface AnalystArtifact {\n  answer: string\n  findings: string[]\n  /** The hardcoded-prompt version the analyst reported (provenance only; the\n   *  optimized surface overrides the actual prompt text used). */\n  actorPromptVersion: string\n}\n\nexport interface BuildAnalystSurfaceDispatchOptions {\n  /**\n   * Everything `analyzeTraces` needs EXCEPT `actorDescription` (supplied by the\n   * surface under optimization) and `source` (supplied by the scenario). `ai`\n   * (the AxAIService) is required for a live run.\n   */\n  analystOptions: Omit<AnalyzeTracesOptions, 'actorDescription' | 'source'>\n  /** Test seam: defaults to the real `analyzeTraces`. */\n  analyze?: (\n    input: AnalyzeTracesInput,\n    options: AnalyzeTracesOptions,\n  ) => Promise<AnalyzeTracesResult>\n}\n\nfunction surfaceToText(surface: MutableSurface): string {\n  if (typeof surface === 'string') return surface\n  // A code-tier surface can't be an analyst prompt — fail loud rather than\n  // silently analyzing with an empty actorDescription.\n  throw new Error(\n    'buildAnalystSurfaceDispatch: the analyst surface must be a string actorDescription, ' +\n      `got a ${surface.kind}-tier surface (${surface.worktreeRef}). The analyst prompt is prompt-tier.`,\n  )\n}\n\n/**\n * Build the `dispatchWithSurface(surface, scenario, ctx)` the improvement loop\n * calls: run the analyst with `surface` as its actorDescription over the\n * scenario's trace corpus and return its findings.\n */\nexport function buildAnalystSurfaceDispatch(\n  opts: BuildAnalystSurfaceDispatchOptions,\n): (\n  surface: MutableSurface,\n  scenario: AnalystScenario,\n  ctx: DispatchContext,\n) => Promise<AnalystArtifact> {\n  const analyze = opts.analyze ?? analyzeTraces\n  return async (surface, scenario, _ctx) => {\n    const actorDescription = surfaceToText(surface)\n    const res = await analyze(\n      { question: scenario.question },\n      { ...opts.analystOptions, actorDescription, source: scenario.source },\n    )\n    return {\n      answer: res.answer,\n      findings: res.findings,\n      actorPromptVersion: res.actorPromptVersion,\n    }\n  }\n}\n\nexport interface FailureModeRecallJudgeOptions {\n  /** Weight on recall when precision is also scored (forbiddenCues present).\n   *  Default 0.5 (equal). Recall-only when no forbiddenCues exist. */\n  recallWeight?: number\n}\n\n/**\n * Deterministic, ground-truth judge for analyst findings. Composite =\n * recall of the scenario's `expectedFailureModes` (optionally blended with a\n * precision term that penalizes findings tripping `forbiddenCues`). No LLM —\n * the score is a function of the labels, so the analyst prompt is optimized\n * toward surfacing real failures, not toward a judge it can flatter.\n */\nexport function failureModeRecallJudge(\n  opts: FailureModeRecallJudgeOptions = {},\n): JudgeConfig<AnalystArtifact, AnalystScenario> {\n  const recallWeight = opts.recallWeight ?? 0.5\n  return {\n    name: 'failure-mode-recall',\n    dimensions: [\n      { key: 'recall', description: 'fraction of ground-truth failure modes the analyst surfaced' },\n      {\n        key: 'precision',\n        description:\n          '1 − share of findings that named a failure/tool/error absent from this corpus',\n      },\n    ],\n    appliesTo: (s) => s.kind === 'analyst-surface',\n    score({ artifact, scenario }) {\n      const modes = scenario.expectedFailureModes\n      if (modes.length === 0) {\n        throw new Error(\n          `failureModeRecallJudge: scenario '${scenario.id}' has no expectedFailureModes — refusing to score (a vacuous 1.0 would corrupt the comparison)`,\n        )\n      }\n      const hay = artifact.findings.join('\\n').toLowerCase()\n      const matched = modes.filter((m) => m.cues.some((c) => hay.includes(c.toLowerCase())))\n      const recall = matched.length / modes.length\n\n      const forbidden = (scenario.forbiddenCues ?? []).map((c) => c.toLowerCase())\n      let precision = 1\n      let hallucinated = 0\n      if (forbidden.length > 0) {\n        const denom = Math.max(1, artifact.findings.length)\n        hallucinated = artifact.findings.filter((f) =>\n          forbidden.some((c) => f.toLowerCase().includes(c)),\n        ).length\n        precision = 1 - hallucinated / denom\n      }\n\n      const composite =\n        forbidden.length > 0 ? recallWeight * recall + (1 - recallWeight) * precision : recall\n      const missed = modes.filter((m) => !matched.includes(m)).map((m) => m.id)\n      const notes =\n        `matched ${matched.length}/${modes.length} failure modes` +\n        (missed.length ? `; missed [${missed.join(', ')}]` : '') +\n        (hallucinated ? `; ${hallucinated} out-of-corpus finding(s)` : '')\n      return { dimensions: { recall, precision }, composite, notes }\n    },\n  }\n}\n","/**\n * Matched-pair arm comparison — \"did the treatment arm beat the baseline arm\n * on the SAME work items?\"\n *\n * An arm A/B over run records is only trustworthy when it is PAIRED: the same\n * task/scenario/seed evaluated under both arms, compared item-by-item, so\n * inter-item difficulty variance cancels instead of masquerading as an arm\n * effect. This module owns the two error-prone steps every consumer otherwise\n * hand-rolls:\n *\n *   1. Pairing — matching rows across arms by `pairKey` (and by `repKey`\n *      within multi-rep items), with leftovers REPORTED rather than silently\n *      dropped (a silently unbalanced pairing biases every paired statistic\n *      downstream). Pairing never keys on outcome content: matching reps by\n *      their outcomes deflates discordant-pair counts and makes McNemar\n *      anti-conservative, so reps pair only by (`pairKey`, `repKey`) identity.\n *   2. Composition — feeding the matched pairs to the correct paired\n *      estimators that already live in `statistics`: `mcnemar` +\n *      `pairedRiskDifference` for pass/fail, `pairedBootstrap` +\n *      `wilcoxonSignedRank` for continuous metrics. No statistic is\n *      re-implemented here.\n *\n * The row shape is deliberately structural — callers project a `RunRecord`\n * (or any record) into `{ pairKey, arm, pass?, metrics? }`. Arm names are\n * caller-supplied parameters; the module ships no domain literal.\n */\n\nimport { ValidationError } from './errors'\nimport type { McNemarResult, PairedBootstrapOptions, PairedBootstrapResult } from './statistics'\nimport {\n  mcnemar,\n  pairedBootstrap,\n  pairedRiskDifference,\n  type RiskDifferenceResult,\n  wilcoxonSignedRank,\n} from './statistics'\n\n/** One arm observation of one work item. Structural on purpose: callers\n *  project their own record type (e.g. a `RunRecord`) into this shape. */\nexport interface PairedArmRow {\n  /** Matching key — rows sharing a `pairKey` across both arms form pairs\n   *  (typically the task/scenario/seed identity). */\n  pairKey: string\n  /** Rep identity within a `pairKey` (e.g. a seed or rep number). Required on\n   *  every row of a `pairKey` that has more than one rep in either arm; reps\n   *  then pair only on exact (`pairKey`, `repKey`) match, never on outcome\n   *  content. Optional when each arm has at most one rep of the item. */\n  repKey?: string\n  /** Arm label this row was produced under. */\n  arm: string\n  /** Binary outcome; omit when the comparison has no pass/fail notion. */\n  pass?: boolean\n  /** Named numeric measurements (score, cost, latency, …). */\n  metrics?: Record<string, number>\n}\n\nexport interface PairArmsOptions {\n  /** Arm treated as the control side of every pair. */\n  baselineArm: string\n  /** Arm treated as the treatment side of every pair. */\n  treatmentArm: string\n}\n\n/** One matched (baseline, treatment) observation of the same work item. */\nexport interface MatchedPair {\n  pairKey: string\n  /** 0-based position of this pair within its `pairKey`, ordered by sorted\n   *  `repKey` (always 0 for a single-rep item). The rep identity itself is on\n   *  the rows (`baseline.repKey` / `treatment.repKey`). */\n  repIndex: number\n  baseline: PairedArmRow\n  treatment: PairedArmRow\n}\n\nexport interface PairArmsResult {\n  /** Matched pairs, ordered by (`pairKey`, `repIndex`). */\n  pairs: MatchedPair[]\n  /** Baseline rows left without a treatment counterpart — reported, never\n   *  silently dropped. */\n  unpairedBaseline: PairedArmRow[]\n  /** Treatment rows left without a baseline counterpart. */\n  unpairedTreatment: PairedArmRow[]\n}\n\n/**\n * Match rows across two arms into (baseline, treatment) pairs by `pairKey`.\n *\n * A `pairKey` with at most one row per arm pairs directly, no `repKey`\n * needed. A `pairKey` with multiple reps in either arm requires `repKey` on\n * every one of its rows, and reps pair only on exact (`pairKey`, `repKey`)\n * match — pairing is keyed purely on row identity, never on outcome content\n * (outcome-keyed matching deflates discordant counts and biases McNemar), and\n * is therefore independent of input order. Reps whose `repKey` has no\n * counterpart in the other arm, and items present in only one arm, land in\n * the unpaired lists — reported, never truncated.\n *\n * Fail-loud: throws when either named arm has zero rows (an unknown arm\n * name would otherwise read as \"everything unpaired\"), when the two arm\n * names are equal, when a multi-rep `pairKey` has a row without `repKey`, or\n * when a (`pairKey`, arm) group repeats a `repKey` (the match would be\n * ambiguous).\n */\nexport function pairArms(rows: readonly PairedArmRow[], opts: PairArmsOptions): PairArmsResult {\n  const { baselineArm, treatmentArm } = opts\n  if (baselineArm === treatmentArm) {\n    throw new ValidationError(\n      `pairArms: baselineArm and treatmentArm are both '${baselineArm}' — an arm cannot be compared to itself`,\n    )\n  }\n\n  // arm → pairKey → rows\n  const byArm = new Map<string, Map<string, PairedArmRow[]>>()\n  const armsSeen = new Set<string>()\n  for (const row of rows) {\n    armsSeen.add(row.arm)\n    if (row.arm !== baselineArm && row.arm !== treatmentArm) continue\n    const byKey = byArm.get(row.arm) ?? new Map<string, PairedArmRow[]>()\n    const group = byKey.get(row.pairKey) ?? []\n    group.push(row)\n    byKey.set(row.pairKey, group)\n    byArm.set(row.arm, byKey)\n  }\n\n  for (const arm of [baselineArm, treatmentArm]) {\n    if (!byArm.has(arm)) {\n      const seen = [...armsSeen].sort().join(', ') || '<none>'\n      throw new ValidationError(`pairArms: no rows for arm '${arm}' (arms present: ${seen})`)\n    }\n  }\n\n  const baselineByKey = byArm.get(baselineArm)!\n  const treatmentByKey = byArm.get(treatmentArm)!\n\n  const allKeys = [...new Set([...baselineByKey.keys(), ...treatmentByKey.keys()])].sort()\n  const pairs: MatchedPair[] = []\n  const unpairedBaseline: PairedArmRow[] = []\n  const unpairedTreatment: PairedArmRow[] = []\n  for (const pairKey of allKeys) {\n    const b = baselineByKey.get(pairKey) ?? []\n    const t = treatmentByKey.get(pairKey) ?? []\n\n    if (b.length <= 1 && t.length <= 1) {\n      if (b.length === 1 && t.length === 1) {\n        pairs.push({ pairKey, repIndex: 0, baseline: b[0]!, treatment: t[0]! })\n      } else {\n        unpairedBaseline.push(...b)\n        unpairedTreatment.push(...t)\n      }\n      continue\n    }\n\n    const bByRep = indexByRepKey(b, pairKey, baselineArm)\n    const tByRep = indexByRepKey(t, pairKey, treatmentArm)\n    const repKeys = [...new Set([...bByRep.keys(), ...tByRep.keys()])].sort()\n    let repIndex = 0\n    for (const repKey of repKeys) {\n      const baseline = bByRep.get(repKey)\n      const treatment = tByRep.get(repKey)\n      if (baseline !== undefined && treatment !== undefined) {\n        pairs.push({ pairKey, repIndex: repIndex++, baseline, treatment })\n      } else if (baseline !== undefined) {\n        unpairedBaseline.push(baseline)\n      } else if (treatment !== undefined) {\n        unpairedTreatment.push(treatment)\n      }\n    }\n  }\n\n  return { pairs, unpairedBaseline, unpairedTreatment }\n}\n\n/** Index a multi-rep (pairKey, arm) group by `repKey`, enforcing that every\n *  row carries one and that no repKey repeats within the group. */\nfunction indexByRepKey(\n  group: readonly PairedArmRow[],\n  pairKey: string,\n  arm: string,\n): Map<string, PairedArmRow> {\n  const byRep = new Map<string, PairedArmRow>()\n  for (const row of group) {\n    if (row.repKey === undefined) {\n      throw new ValidationError(\n        `pairArms: pairKey '${pairKey}' has multiple reps in an arm, but a row in arm '${arm}' ` +\n          `is missing repKey — multi-rep items require an explicit repKey on every row so reps ` +\n          `pair by identity (pairing reps by outcome or by index would bias the paired statistics)`,\n      )\n    }\n    if (byRep.has(row.repKey)) {\n      throw new ValidationError(\n        `pairArms: duplicate repKey '${row.repKey}' for pairKey '${pairKey}' in arm '${arm}' — ` +\n          `(pairKey, repKey) must uniquely identify a rep within an arm`,\n      )\n    }\n    byRep.set(row.repKey, row)\n  }\n  return byRep\n}\n\n/** Paired pass/fail comparison over the pairs where BOTH sides carry `pass`. */\nexport interface PairedCorrectness {\n  /** Discordant pairs where the treatment passed and the baseline failed. */\n  b10: number\n  /** Discordant pairs where the baseline passed and the treatment failed. */\n  b01: number\n  /** Exact McNemar significance over the paired outcomes (`b === b10`, `c === b01`). */\n  mcnemar: McNemarResult\n  /** Paired effect size: p(treatment) − p(baseline) with a paired-variance CI. */\n  riskDifference: RiskDifferenceResult\n}\n\n/** Paired delta summary for one named metric (delta = treatment − baseline). */\nexport interface PairedMetricDelta {\n  name: string\n  /** Pairs where BOTH sides carry a finite value for this metric. */\n  n: number\n  /** Pairs where at least one side does not carry the metric. */\n  nMissing: number\n  /** Median paired delta; NaN when `n === 0` (no data ≠ measured zero). */\n  medianDelta: number\n  /** Mean paired delta; NaN when `n === 0`. */\n  meanDelta: number\n  /** Bootstrap CI on the paired delta (`pairedBootstrap`); null when\n   *  `n === 0` — a zero-width [0, 0] interval on no data would read as a\n   *  measured tight null. */\n  bootstrapCi: PairedBootstrapResult | null\n  /** Wilcoxon signed-rank test on the paired deltas; null when `n === 0`. */\n  wilcoxon: { w: number; p: number } | null\n}\n\nexport interface ComparePairedArmsOptions extends PairArmsOptions {\n  /** Metrics to compare. Default: every metric name observed on any matched\n   *  pair, sorted. A name that appears on no pair is still reported (with\n   *  `n = 0`) so a misspelled metric is visible instead of vanishing. */\n  metricNames?: string[]\n  /** Passed through to `pairedBootstrap` — set `seed` for reproducible CIs. */\n  bootstrap?: PairedBootstrapOptions\n}\n\nexport interface PairedArmsComparison {\n  nPairs: number\n  nUnpairedBaseline: number\n  nUnpairedTreatment: number\n  /** null when no matched pair carries `pass` on both sides — a pass/fail\n   *  verdict over rows that never measured pass/fail would be fabricated. */\n  correctness: PairedCorrectness | null\n  metricDeltas: PairedMetricDelta[]\n}\n\n/**\n * Full matched-pair arm comparison: pair via {@link pairArms}, then compose\n * the paired estimators from `statistics` over the matched pairs.\n *\n * Correctness uses only the pairs where both sides carry `pass` (`mcnemar.n`\n * is that subset's size); each metric uses only the pairs where both sides\n * carry a finite value for it, with the remainder counted in `nMissing`.\n * Deltas are treatment − baseline throughout.\n *\n * Fail-loud: inherits {@link pairArms}'s unknown-arm throw, and throws on a\n * non-finite metric value — silently treating corrupt telemetry as \"metric\n * absent\" would misreport it as missing coverage.\n */\nexport function comparePairedArms(\n  rows: readonly PairedArmRow[],\n  opts: ComparePairedArmsOptions,\n): PairedArmsComparison {\n  const { pairs, unpairedBaseline, unpairedTreatment } = pairArms(rows, opts)\n\n  let correctness: PairedCorrectness | null = null\n  const baselinePass: number[] = []\n  const treatmentPass: number[] = []\n  for (const pair of pairs) {\n    if (pair.baseline.pass === undefined || pair.treatment.pass === undefined) continue\n    baselinePass.push(pair.baseline.pass ? 1 : 0)\n    treatmentPass.push(pair.treatment.pass ? 1 : 0)\n  }\n  if (baselinePass.length > 0) {\n    const mc = mcnemar(baselinePass, treatmentPass)\n    correctness = {\n      b10: mc.b,\n      b01: mc.c,\n      mcnemar: mc,\n      riskDifference: pairedRiskDifference(baselinePass, treatmentPass),\n    }\n  }\n\n  const metricNames =\n    opts.metricNames ??\n    [\n      ...new Set(\n        pairs.flatMap((p) => [\n          ...Object.keys(p.baseline.metrics ?? {}),\n          ...Object.keys(p.treatment.metrics ?? {}),\n        ]),\n      ),\n    ].sort()\n\n  const metricDeltas: PairedMetricDelta[] = metricNames.map((name) => {\n    const before: number[] = []\n    const after: number[] = []\n    let nMissing = 0\n    for (const pair of pairs) {\n      const b = metricValue(pair.baseline, name)\n      const t = metricValue(pair.treatment, name)\n      if (b === undefined || t === undefined) {\n        nMissing++\n        continue\n      }\n      before.push(b)\n      after.push(t)\n    }\n    const bootstrapCi = before.length === 0 ? null : pairedBootstrap(before, after, opts.bootstrap)\n    return {\n      name,\n      n: before.length,\n      nMissing,\n      medianDelta: bootstrapCi === null ? Number.NaN : bootstrapCi.median,\n      meanDelta: bootstrapCi === null ? Number.NaN : bootstrapCi.mean,\n      bootstrapCi,\n      wilcoxon: before.length === 0 ? null : wilcoxonSignedRank(before, after),\n    }\n  })\n\n  return {\n    nPairs: pairs.length,\n    nUnpairedBaseline: unpairedBaseline.length,\n    nUnpairedTreatment: unpairedTreatment.length,\n    correctness,\n    metricDeltas,\n  }\n}\n\nfunction metricValue(row: PairedArmRow, name: string): number | undefined {\n  const v = row.metrics?.[name]\n  if (v === undefined) return undefined\n  if (!Number.isFinite(v)) {\n    throw new ValidationError(\n      `comparePairedArms: non-finite value for metric '${name}' on pairKey '${row.pairKey}' (arm '${row.arm}'): ${v}`,\n    )\n  }\n  return v\n}\n","import { ValidationError } from '../errors'\nimport type {\n  AnalyzeCrossSurfaceInteractionsInput,\n  CrossSurfaceCandidate,\n  CrossSurfaceComponent,\n  CrossSurfaceTaskRow,\n} from './cross-surface-types'\n\n/** Validated indexes shared by analysis and deterministic selection. */\nexport interface CrossSurfaceAnalysisContext<TRow extends CrossSurfaceTaskRow> {\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>\n  components: CrossSurfaceComponent[]\n  candidates: CrossSurfaceCandidate[]\n  componentById: Map<string, CrossSurfaceComponent>\n  candidateById: Map<string, CrossSurfaceCandidate>\n  candidateByComponents: Map<string, CrossSurfaceCandidate>\n  singleByComponent: Map<string, CrossSurfaceCandidate>\n  rowsByCandidate: Map<string, Map<string, TRow>>\n  componentIndex: Map<string, number>\n  candidateIndex: Map<string, number>\n}\n\nexport function validateCrossSurfaceInput<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): CrossSurfaceAnalysisContext<TRow> {\n  assertNonEmptyUnique(input.taskOrder, 'taskOrder')\n  assertNonEmptyUnique(input.componentOrder, 'componentOrder')\n  if (input.componentOrder.length < 2) {\n    throw new ValidationError(\n      'analyzeCrossSurfaceInteractions: componentOrder must contain at least two surfaces',\n    )\n  }\n  assertNonEmptyUnique(input.candidateOrder, 'candidateOrder')\n  assertNonEmptyUnique(input.costMetricOrder, 'costMetricOrder')\n  if (input.costMetricOrder.includes('score')) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: costMetricOrder cannot contain reserved metric 'score'`,\n    )\n  }\n  validateBootstrap(input)\n  validateSelection(input)\n\n  const componentById = indexUnique(\n    input.components,\n    (component) => component.componentId,\n    'component',\n  )\n  assertExactSet(input.componentOrder, componentById.keys(), 'componentOrder', 'components')\n  const surfaces = new Set<string>()\n  for (const component of componentById.values()) {\n    assertNonEmpty(component.componentId, 'componentId')\n    assertNonEmpty(component.surfaceId, `surfaceId for component '${component.componentId}'`)\n    if (surfaces.has(component.surfaceId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: surfaceId '${component.surfaceId}' has more than one component; ` +\n          'the interaction stage requires one independently selected finalist per surface',\n      )\n    }\n    surfaces.add(component.surfaceId)\n    if (typeof component.bestSingleEligible !== 'boolean') {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: component '${component.componentId}' must declare bestSingleEligible`,\n      )\n    }\n  }\n\n  const componentIndex = new Map(input.componentOrder.map((id, index) => [id, index]))\n  const candidateById = indexUnique(\n    input.candidates,\n    (candidate) => candidate.candidateId,\n    'candidate',\n  )\n  assertExactSet(input.candidateOrder, candidateById.keys(), 'candidateOrder', 'candidates')\n  if (!candidateById.has(input.baselineCandidateId)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: unknown baselineCandidateId '${input.baselineCandidateId}'`,\n    )\n  }\n\n  const candidateByComponents = new Map<string, CrossSurfaceCandidate>()\n  const singleByComponent = new Map<string, CrossSurfaceCandidate>()\n  for (const candidate of candidateById.values()) {\n    validateCandidate(candidate, componentById, componentIndex, input.baselineCandidateId)\n    const key = crossSurfaceComponentSetKey(candidate.componentIds)\n    const duplicate = candidateByComponents.get(key)\n    if (duplicate) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidates '${duplicate.candidateId}' and ` +\n          `'${candidate.candidateId}' materialize the same component set`,\n      )\n    }\n    candidateByComponents.set(key, candidate)\n    if (candidate.componentIds.length === 1) {\n      singleByComponent.set(candidate.componentIds[0]!, candidate)\n    }\n  }\n  const baseline = candidateById.get(input.baselineCandidateId)!\n  if (baseline.componentIds.length !== 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: baseline '${baseline.candidateId}' must have zero components`,\n    )\n  }\n  for (const componentId of input.componentOrder) {\n    if (!singleByComponent.has(componentId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: no single-surface candidate for component '${componentId}'`,\n      )\n    }\n  }\n  for (let left = 0; left < input.componentOrder.length; left++) {\n    for (let right = left + 1; right < input.componentOrder.length; right++) {\n      const ids = [input.componentOrder[left]!, input.componentOrder[right]!]\n      if (!candidateByComponents.has(crossSurfaceComponentSetKey(ids))) {\n        throw new ValidationError(\n          `analyzeCrossSurfaceInteractions: missing pair candidate for components [${ids.join(', ')}]`,\n        )\n      }\n    }\n  }\n\n  const rowsByCandidate = new Map<string, Map<string, TRow>>()\n  const taskIds = new Set(input.taskOrder)\n  for (const row of input.rows) {\n    const candidate = candidateById.get(row.candidateId)\n    if (!candidate) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: row for task '${row.taskId}' names unknown candidate '${row.candidateId}'`,\n      )\n    }\n    if (!taskIds.has(row.taskId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: row for candidate '${row.candidateId}' names task '${row.taskId}' ` +\n          'outside the declared taskOrder',\n      )\n    }\n    validateRow(input, row, candidate)\n    const byTask = rowsByCandidate.get(row.candidateId) ?? new Map<string, TRow>()\n    if (byTask.has(row.taskId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: duplicate row for candidate '${row.candidateId}' and task '${row.taskId}'`,\n      )\n    }\n    byTask.set(row.taskId, row)\n    rowsByCandidate.set(row.candidateId, byTask)\n  }\n  for (const candidateId of input.candidateOrder) {\n    const byTask = rowsByCandidate.get(candidateId)\n    const missing = input.taskOrder.filter((taskId) => !byTask?.has(taskId))\n    if (missing.length > 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidate '${candidateId}' is missing declared task row(s) ` +\n          `[${missing.join(', ')}]; encode failed attempts explicitly instead of changing the task axis`,\n      )\n    }\n  }\n  const expectedRows = input.candidateOrder.length * input.taskOrder.length\n  if (input.rows.length !== expectedRows) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: expected exactly ${expectedRows} candidate × task rows, got ${input.rows.length}`,\n    )\n  }\n\n  return {\n    input,\n    components: input.componentOrder.map((id) => componentById.get(id)!),\n    candidates: input.candidateOrder.map((id) => candidateById.get(id)!),\n    componentById,\n    candidateById,\n    candidateByComponents,\n    singleByComponent,\n    rowsByCandidate,\n    componentIndex,\n    candidateIndex: new Map(input.candidateOrder.map((id, index) => [id, index])),\n  }\n}\n\nexport function crossSurfaceRowsFor<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  candidateId: string,\n): TRow[] {\n  return context.input.taskOrder.map((taskId) => crossSurfaceRowFor(context, candidateId, taskId))\n}\n\nexport function crossSurfaceRowFor<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  candidateId: string,\n  taskId: string,\n): TRow {\n  return context.rowsByCandidate.get(candidateId)!.get(taskId)!\n}\n\nexport function canonicalCrossSurfaceComponents<TRow extends CrossSurfaceTaskRow>(\n  context: CrossSurfaceAnalysisContext<TRow>,\n  componentIds: string[],\n): string[] {\n  return [...componentIds].sort(\n    (left, right) => context.componentIndex.get(left)! - context.componentIndex.get(right)!,\n  )\n}\n\nexport function crossSurfaceComponentSetKey(componentIds: readonly string[]): string {\n  return JSON.stringify(componentIds)\n}\n\nfunction validateBootstrap<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): void {\n  const { seed, resamples, confidence } = input.bootstrap\n  if (!Number.isInteger(seed)) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: bootstrap.seed must be an integer`)\n  }\n  if (!Number.isInteger(resamples) || resamples <= 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: bootstrap.resamples must be a positive integer`,\n    )\n  }\n  if (!Number.isFinite(confidence) || confidence <= 0 || confidence >= 1) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: bootstrap.confidence must be in (0,1)`,\n    )\n  }\n}\n\nfunction validateSelection<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): void {\n  const policy = input.selection\n  for (const [name, value] of [\n    ['minimumFiringTasks', policy.minimumFiringTasks],\n    ['minimumEffectTasks', policy.minimumEffectTasks],\n  ] as const) {\n    if (!Number.isInteger(value) || value < 0 || value > input.taskOrder.length) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: selection.${name} must be an integer in [0,${input.taskOrder.length}]`,\n      )\n    }\n  }\n  if (\n    !Number.isInteger(policy.minimumBundleComponents) ||\n    policy.minimumBundleComponents < 2 ||\n    policy.minimumBundleComponents > input.componentOrder.length\n  ) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: selection.minimumBundleComponents must be an integer in ` +\n        `[2,${input.componentOrder.length}]`,\n    )\n  }\n  for (const [metric, limit] of Object.entries(policy.maximumMedianCostRatioToBaseline)) {\n    if (!input.costMetricOrder.includes(metric)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: cost limit names undeclared metric '${metric}'`,\n      )\n    }\n    if (!Number.isFinite(limit) || limit <= 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: cost ratio limit for '${metric}' must be positive and finite`,\n      )\n    }\n  }\n}\n\nfunction validateCandidate(\n  candidate: CrossSurfaceCandidate,\n  componentById: Map<string, CrossSurfaceComponent>,\n  componentIndex: Map<string, number>,\n  baselineCandidateId: string,\n): void {\n  assertNonEmpty(candidate.candidateId, 'candidateId')\n  assertNonEmpty(candidate.contentHash, `contentHash for candidate '${candidate.candidateId}'`)\n  if (!Number.isInteger(candidate.artifactBytes) || candidate.artifactBytes < 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: artifactBytes for candidate '${candidate.candidateId}' must be a non-negative integer`,\n    )\n  }\n  assertUnique(candidate.componentIds, `componentIds for candidate '${candidate.candidateId}'`)\n  for (const componentId of candidate.componentIds) {\n    if (!componentById.has(componentId)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: candidate '${candidate.candidateId}' names unknown component '${componentId}'`,\n      )\n    }\n  }\n  const canonical = [...candidate.componentIds].sort(\n    (left, right) => componentIndex.get(left)! - componentIndex.get(right)!,\n  )\n  if (!arraysEqual(candidate.componentIds, canonical)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: candidate '${candidate.candidateId}' components must follow componentOrder`,\n    )\n  }\n  if (candidate.candidateId !== baselineCandidateId && candidate.componentIds.length === 0) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: only baseline '${baselineCandidateId}' may have zero components`,\n    )\n  }\n}\n\nfunction validateRow<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n  row: TRow,\n  candidate: CrossSurfaceCandidate,\n): void {\n  if (!arraysEqual(row.componentIds, candidate.componentIds)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: row '${row.candidateId}/${row.taskId}' componentIds do not match its candidate`,\n    )\n  }\n  if (!['complete', 'missing', 'invalid'].includes(row.completeness)) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: row '${row.candidateId}/${row.taskId}' has unknown completeness '${String(row.completeness)}'`,\n    )\n  }\n  if (row.completeness === 'complete') {\n    if (typeof row.pass !== 'boolean' || !Number.isFinite(row.score)) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: complete row '${row.candidateId}/${row.taskId}' requires boolean pass and finite score`,\n      )\n    }\n    if (row.rejectReason !== null) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: complete row '${row.candidateId}/${row.taskId}' cannot carry rejectReason`,\n      )\n    }\n  } else {\n    if (row.pass !== null || row.score !== null) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: ${row.completeness} row '${row.candidateId}/${row.taskId}' must use null pass and score`,\n      )\n    }\n    if (typeof row.rejectReason !== 'string' || row.rejectReason.trim() === '') {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: ${row.completeness} row '${row.candidateId}/${row.taskId}' requires rejectReason`,\n      )\n    }\n  }\n  assertExactSet(\n    input.costMetricOrder,\n    Object.keys(row.cost),\n    `cost keys for row '${row.candidateId}/${row.taskId}'`,\n    'costMetricOrder',\n  )\n  for (const metric of input.costMetricOrder) {\n    const value = row.cost[metric]\n    if (value === null || value === undefined || !Number.isFinite(value) || value < 0) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: unknown or invalid cost '${metric}' on row ` +\n          `'${row.candidateId}/${row.taskId}'; every attempt must report a non-negative finite value`,\n      )\n    }\n  }\n  const evidenceByComponent = indexUnique(\n    row.componentEvidence,\n    (evidence) => evidence.componentId,\n    `componentEvidence on row '${row.candidateId}/${row.taskId}'`,\n  )\n  assertExactSet(\n    candidate.componentIds,\n    evidenceByComponent.keys(),\n    `componentEvidence on row '${row.candidateId}/${row.taskId}'`,\n    'candidate components',\n  )\n  for (const evidence of evidenceByComponent.values()) {\n    assertTriState(evidence.fired, 'fired', row)\n    assertTriState(evidence.effectObserved, 'effectObserved', row)\n    if (evidence.effectObserved === true && evidence.fired !== true) {\n      throw new ValidationError(\n        `analyzeCrossSurfaceInteractions: effectObserved=true requires fired=true for component ` +\n          `'${evidence.componentId}' on row '${row.candidateId}/${row.taskId}'`,\n      )\n    }\n  }\n}\n\nfunction assertTriState<TRow extends CrossSurfaceTaskRow>(\n  value: boolean | null,\n  field: string,\n  row: TRow,\n): void {\n  if (value !== true && value !== false && value !== null) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${field} on row '${row.candidateId}/${row.taskId}' must be boolean or null`,\n    )\n  }\n}\n\nfunction indexUnique<T>(\n  items: readonly T[],\n  id: (item: T) => string,\n  label: string,\n): Map<string, T> {\n  const result = new Map<string, T>()\n  for (const item of items) {\n    const key = id(item)\n    assertNonEmpty(key, `${label} id`)\n    if (result.has(key)) {\n      throw new ValidationError(`analyzeCrossSurfaceInteractions: duplicate ${label} id '${key}'`)\n    }\n    result.set(key, item)\n  }\n  return result\n}\n\nfunction assertNonEmptyUnique(values: readonly string[], label: string): void {\n  if (values.length === 0) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: ${label} is empty`)\n  }\n  assertUnique(values, label)\n  for (const value of values) assertNonEmpty(value, label)\n}\n\nfunction assertUnique(values: readonly string[], label: string): void {\n  if (new Set(values).size !== values.length) {\n    throw new ValidationError(`analyzeCrossSurfaceInteractions: ${label} contains duplicates`)\n  }\n}\n\nfunction assertNonEmpty(value: string, label: string): void {\n  if (typeof value !== 'string' || value.trim() === '') {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${label} must be a non-empty string`,\n    )\n  }\n}\n\nfunction assertExactSet(\n  expected: readonly string[],\n  actualIterable: Iterable<string>,\n  actualLabel: string,\n  expectedLabel: string,\n): void {\n  const actual = [...actualIterable]\n  const expectedSet = new Set(expected)\n  const actualSet = new Set(actual)\n  const missing = expected.filter((value) => !actualSet.has(value))\n  const extra = actual.filter((value) => !expectedSet.has(value))\n  if (missing.length > 0 || extra.length > 0 || actual.length !== expected.length) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: ${actualLabel} does not match ${expectedLabel}; ` +\n        `missing=[${missing.join(', ')}], extra=[${extra.join(', ')}]`,\n    )\n  }\n}\n\nfunction arraysEqual(left: readonly string[], right: readonly string[]): boolean {\n  return left.length === right.length && left.every((value, index) => value === right[index])\n}\n","/**\n * Task-paired comparison and deterministic selection for independently\n * proposed agent surfaces. Unlike factorial cell-mean attribution, every\n * benefit, regression, and interaction remains attached to its task row.\n */\n\nimport { ValidationError } from '../errors'\nimport { comparePairedArms, type PairedArmRow, type PairedArmsComparison } from '../paired-arms'\nimport { pairedBootstrap } from '../statistics'\nimport {\n  type CrossSurfaceAnalysisContext as AnalysisContext,\n  canonicalCrossSurfaceComponents as canonicalComponents,\n  crossSurfaceComponentSetKey as componentSetKey,\n  crossSurfaceRowFor as rowFor,\n  crossSurfaceRowsFor as rowsFor,\n  validateCrossSurfaceInput as validateAndIndex,\n} from './cross-surface-context'\nimport type {\n  AnalyzeCrossSurfaceInteractionsInput,\n  CrossSurfaceAdditionDecision,\n  CrossSurfaceAdditionRejectionReason,\n  CrossSurfaceCandidate,\n  CrossSurfaceCandidateComparison,\n  CrossSurfaceCandidateEvidence,\n  CrossSurfaceCandidateOutcome,\n  CrossSurfaceCandidateSummary,\n  CrossSurfaceCompositionStep,\n  CrossSurfaceDistribution,\n  CrossSurfaceEligibility,\n  CrossSurfaceEvidenceBreakdown,\n  CrossSurfaceIneligibilityReason,\n  CrossSurfaceInteractionAwareSelection,\n  CrossSurfaceInteractionEffect,\n  CrossSurfaceInteractionPath,\n  CrossSurfaceInteractionReport,\n  CrossSurfaceNaiveStackSelection,\n  CrossSurfacePairCompatibility,\n  CrossSurfacePairEvidence,\n  CrossSurfacePairIncompatibilityReason,\n  CrossSurfacePairwiseEntry,\n  CrossSurfaceRankedSingle,\n  CrossSurfaceRelativeCost,\n  CrossSurfaceSelections,\n  CrossSurfaceTaskRow,\n} from './cross-surface-types'\n\n/**\n * Build the complete cross-surface evidence matrix and derive all three frozen\n * candidates. The task/candidate/component orders are part of the input so\n * neither insertion order nor an after-the-fact tie-break can change a result.\n */\nexport function analyzeCrossSurfaceInteractions<TRow extends CrossSurfaceTaskRow>(\n  input: AnalyzeCrossSurfaceInteractionsInput<TRow>,\n): CrossSurfaceInteractionReport<TRow> {\n  const context = validateAndIndex(input)\n  const baseline = context.candidateById.get(input.baselineCandidateId)!\n\n  const preliminary = context.candidates.map((candidate) =>\n    summarizeCandidate(context, candidate, baseline),\n  )\n  const baselineSummary = preliminary.find(\n    (summary) => summary.candidate.candidateId === input.baselineCandidateId,\n  )!\n  const summaries = preliminary.map((summary) =>\n    summary.candidate.candidateId === input.baselineCandidateId\n      ? summary\n      : {\n          ...summary,\n          eligibility: candidateEligibility(context, summary, baselineSummary),\n        },\n  )\n  const summaryById = new Map(summaries.map((summary) => [summary.candidate.candidateId, summary]))\n  const eligibleSingles = rankedEligibleSingles(context, summaryById)\n  const interactionReadySingles = rankedInteractionReadySingles(context, summaryById)\n  const pairwise = buildPairwise(context, summaryById, interactionReadySingles, baselineSummary)\n  const selections = selectCandidates(\n    context,\n    summaryById,\n    eligibleSingles,\n    interactionReadySingles,\n    pairwise,\n  )\n  const rows = context.candidates.flatMap((candidate) =>\n    input.taskOrder.map(\n      (taskId) => context.rowsByCandidate.get(candidate.candidateId)!.get(taskId)!,\n    ),\n  )\n\n  return {\n    taskIds: [...input.taskOrder],\n    componentIds: [...input.componentOrder],\n    candidateIds: [...input.candidateOrder],\n    costMetrics: [...input.costMetricOrder],\n    rows,\n    missingAttempts: rows.filter((row) => row.completeness === 'missing'),\n    invalidAttempts: rows.filter((row) => row.completeness === 'invalid'),\n    candidates: summaries,\n    pairwise,\n    selections,\n  }\n}\n\nfunction summarizeCandidate<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  candidate: CrossSurfaceCandidate,\n  baseline: CrossSurfaceCandidate,\n): CrossSurfaceCandidateSummary {\n  const rows = rowsFor(context, candidate.candidateId)\n  const baselineRows = rowsFor(context, baseline.candidateId)\n  const outcome = summarizeOutcome(\n    context,\n    rows,\n    baselineRows,\n    candidate.candidateId === baseline.candidateId,\n  )\n  const completeScores = rows\n    .filter((row) => row.completeness === 'complete')\n    .map((row) => row.score as number)\n  const costs = Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => [\n      metric,\n      distribution(rows.map((row) => row.cost[metric] as number)),\n    ]),\n  )\n  return {\n    candidate,\n    outcome,\n    score: completeScores.length === 0 ? null : distribution(completeScores),\n    costs,\n    firing: summarizeCandidateEvidence(rows, candidate.componentIds, 'fired'),\n    effect: summarizeCandidateEvidence(rows, candidate.componentIds, 'effectObserved'),\n    comparisonToBaseline:\n      candidate.candidateId === baseline.candidateId\n        ? null\n        : pairedComparison(context, baseline.candidateId, candidate.candidateId),\n    eligibility: null,\n  }\n}\n\nfunction summarizeOutcome<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  rows: TRow[],\n  baselineRows: TRow[],\n  isBaseline: boolean,\n): CrossSurfaceCandidateOutcome {\n  const resolvedTaskIds: string[] = []\n  const failedTaskIds: string[] = []\n  const missingTaskIds: string[] = []\n  const invalidTaskIds: string[] = []\n  const benefitTaskIds: string[] = []\n  const regressionTaskIds: string[] = []\n  const comparisonMissingTaskIds: string[] = []\n  for (let index = 0; index < context.input.taskOrder.length; index++) {\n    const row = rows[index]!\n    const baseline = baselineRows[index]!\n    if (row.completeness === 'missing') missingTaskIds.push(row.taskId)\n    else if (row.completeness === 'invalid') invalidTaskIds.push(row.taskId)\n    else if (row.pass) resolvedTaskIds.push(row.taskId)\n    else failedTaskIds.push(row.taskId)\n\n    if (isBaseline) continue\n    if (row.completeness !== 'complete' || baseline.completeness !== 'complete') {\n      comparisonMissingTaskIds.push(row.taskId)\n    } else if (row.pass && !baseline.pass) benefitTaskIds.push(row.taskId)\n    else if (!row.pass && baseline.pass) regressionTaskIds.push(row.taskId)\n  }\n  return {\n    resolvedTaskIds,\n    failedTaskIds,\n    missingTaskIds,\n    invalidTaskIds,\n    benefitTaskIds,\n    regressionTaskIds,\n    comparisonMissingTaskIds,\n    netBenefit: benefitTaskIds.length - regressionTaskIds.length,\n  }\n}\n\nfunction summarizeCandidateEvidence<TRow extends CrossSurfaceTaskRow>(\n  rows: TRow[],\n  componentIds: string[],\n  field: 'fired' | 'effectObserved',\n): CrossSurfaceCandidateEvidence {\n  if (componentIds.length === 0) {\n    return {\n      byComponent: [],\n      allObservedTaskIds: [],\n      someObservedTaskIds: [],\n      noneObservedTaskIds: [],\n      unobservedTaskIds: [],\n    }\n  }\n  const byComponent: CrossSurfaceEvidenceBreakdown[] = componentIds.map((componentId) => {\n    const observedTaskIds: string[] = []\n    const notObservedTaskIds: string[] = []\n    const unobservedTaskIds: string[] = []\n    for (const row of rows) {\n      const value = evidenceValue(row, componentId, field)\n      if (value === true) observedTaskIds.push(row.taskId)\n      else if (value === false) notObservedTaskIds.push(row.taskId)\n      else unobservedTaskIds.push(row.taskId)\n    }\n    return { componentId, observedTaskIds, notObservedTaskIds, unobservedTaskIds }\n  })\n  const allObservedTaskIds: string[] = []\n  const someObservedTaskIds: string[] = []\n  const noneObservedTaskIds: string[] = []\n  const unobservedTaskIds: string[] = []\n  for (const row of rows) {\n    const values = componentIds.map((componentId) => evidenceValue(row, componentId, field))\n    if (values.some((value) => value === null)) unobservedTaskIds.push(row.taskId)\n    else if (values.every(Boolean)) allObservedTaskIds.push(row.taskId)\n    else if (values.some(Boolean)) someObservedTaskIds.push(row.taskId)\n    else noneObservedTaskIds.push(row.taskId)\n  }\n  return {\n    byComponent,\n    allObservedTaskIds,\n    someObservedTaskIds,\n    noneObservedTaskIds,\n    unobservedTaskIds,\n  }\n}\n\nfunction candidateEligibility<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summary: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n): CrossSurfaceEligibility {\n  const reasons: CrossSurfaceIneligibilityReason[] = []\n  if (summary.outcome.missingTaskIds.length > 0) reasons.push('missing_attempt')\n  if (summary.outcome.invalidTaskIds.length > 0) reasons.push('invalid_attempt')\n  if (summary.outcome.comparisonMissingTaskIds.length > 0) reasons.push('baseline_outcome_missing')\n  if (summary.outcome.benefitTaskIds.length <= summary.outcome.regressionTaskIds.length) {\n    reasons.push('benefit_not_greater_than_regression')\n  }\n  appendEvidenceEligibilityReasons(\n    reasons,\n    summary.firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendEvidenceEligibilityReasons(\n    reasons,\n    summary.effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, summary, baseline)) reasons.push('cost_limit_exceeded')\n  return { eligible: reasons.length === 0, reasons: unique(reasons) }\n}\n\nfunction appendEvidenceEligibilityReasons(\n  reasons: CrossSurfaceIneligibilityReason[],\n  evidence: CrossSurfaceCandidateEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfaceIneligibilityReason,\n  unobservedReason: CrossSurfaceIneligibilityReason,\n): void {\n  if (evidence.byComponent.some((component) => component.observedTaskIds.length < minimum)) {\n    reasons.push(belowReason)\n  }\n  if (\n    requireObserved &&\n    evidence.byComponent.some((component) => component.unobservedTaskIds.length > 0)\n  ) {\n    reasons.push(unobservedReason)\n  }\n}\n\nfunction rankedEligibleSingles<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n): CrossSurfaceCandidateSummary[] {\n  return [...context.singleByComponent.values()]\n    .map((candidate) => summaryById.get(candidate.candidateId)!)\n    .filter((summary) => summary.eligibility?.eligible)\n    .sort((left, right) => compareSingleSummaries(context, left, right))\n}\n\n/**\n * A neutral constituent may seed a composition when it has complete, bounded,\n * observed evidence and causes no baseline regression. Individual benefit is\n * deliberately left to the best-single arm rather than used as a pair gate.\n */\nfunction rankedInteractionReadySingles<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n): CrossSurfaceCandidateSummary[] {\n  return [...context.singleByComponent.values()]\n    .map((candidate) => summaryById.get(candidate.candidateId)!)\n    .filter(\n      (summary) =>\n        summary.outcome.regressionTaskIds.length === 0 &&\n        summary.eligibility?.reasons.every(\n          (reason) => reason === 'benefit_not_greater_than_regression',\n        ),\n    )\n    .sort((left, right) => compareSingleSummaries(context, left, right))\n}\n\nfunction compareSingleSummaries<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  left: CrossSurfaceCandidateSummary,\n  right: CrossSurfaceCandidateSummary,\n): number {\n  const byNetBenefit = right.outcome.netBenefit - left.outcome.netBenefit\n  if (byNetBenefit !== 0) return byNetBenefit\n  const byBenefit = right.outcome.benefitTaskIds.length - left.outcome.benefitTaskIds.length\n  if (byBenefit !== 0) return byBenefit\n  const byRegression =\n    left.outcome.regressionTaskIds.length - right.outcome.regressionTaskIds.length\n  if (byRegression !== 0) return byRegression\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = left.costs[metric]!.median - right.costs[metric]!.median\n    if (byCost !== 0) return byCost\n  }\n  const byBytes = left.candidate.artifactBytes - right.candidate.artifactBytes\n  if (byBytes !== 0) return byBytes\n  return (\n    context.candidateIndex.get(left.candidate.candidateId)! -\n    context.candidateIndex.get(right.candidate.candidateId)!\n  )\n}\n\nfunction buildPairwise<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  baseline: CrossSurfaceCandidateSummary,\n): CrossSurfacePairwiseEntry[] {\n  const interactionReadyIds = new Set(\n    interactionReadySingles.map((summary) => summary.candidate.candidateId),\n  )\n  const entries: CrossSurfacePairwiseEntry[] = []\n  for (let leftIndex = 0; leftIndex < context.components.length; leftIndex++) {\n    for (let rightIndex = leftIndex + 1; rightIndex < context.components.length; rightIndex++) {\n      const leftComponent = context.components[leftIndex]!\n      const rightComponent = context.components[rightIndex]!\n      const leftSingle = context.singleByComponent.get(leftComponent.componentId)!\n      const rightSingle = context.singleByComponent.get(rightComponent.componentId)!\n      const pair = context.candidateByComponents.get(\n        componentSetKey([leftComponent.componentId, rightComponent.componentId]),\n      )!\n      const pairSummary = summaryById.get(pair.candidateId)!\n      const leftSummary = summaryById.get(leftSingle.candidateId)!\n      const rightSummary = summaryById.get(rightSingle.candidateId)!\n      const synergyTaskIds: string[] = []\n      const interferenceTaskIds: string[] = []\n      for (const taskId of context.input.taskOrder) {\n        const pairRow = rowFor(context, pair.candidateId, taskId)\n        const leftRow = rowFor(context, leftSingle.candidateId, taskId)\n        const rightRow = rowFor(context, rightSingle.candidateId, taskId)\n        if (![pairRow, leftRow, rightRow].every((row) => row.completeness === 'complete')) continue\n        if (pairRow.pass && !leftRow.pass && !rightRow.pass) synergyTaskIds.push(taskId)\n        if (!pairRow.pass && (leftRow.pass || rightRow.pass)) interferenceTaskIds.push(taskId)\n      }\n      const incrementalVsConstituents: [\n        CrossSurfaceCandidateComparison,\n        CrossSurfaceCandidateComparison,\n      ] = [\n        compareCandidates(context, summaryById, leftSingle.candidateId, pair.candidateId),\n        compareCandidates(context, summaryById, rightSingle.candidateId, pair.candidateId),\n      ]\n      const betterSingle =\n        compareSingleSummaries(context, leftSummary, rightSummary) <= 0 ? leftSummary : rightSummary\n      const firing = summarizePairEvidence(\n        rowsFor(context, pair.candidateId),\n        leftComponent.componentId,\n        rightComponent.componentId,\n        'fired',\n      )\n      const effect = summarizePairEvidence(\n        rowsFor(context, pair.candidateId),\n        leftComponent.componentId,\n        rightComponent.componentId,\n        'effectObserved',\n      )\n      const compatibility = pairCompatibility(\n        context,\n        pairSummary,\n        baseline,\n        betterSingle,\n        incrementalVsConstituents,\n        interactionReadyIds.has(leftSingle.candidateId) &&\n          interactionReadyIds.has(rightSingle.candidateId),\n        interferenceTaskIds,\n        firing,\n        effect,\n      )\n      entries.push({\n        componentIds: [leftComponent.componentId, rightComponent.componentId],\n        singleCandidateIds: [leftSingle.candidateId, rightSingle.candidateId],\n        compositionCandidateId: pair.candidateId,\n        benefitTaskIds: [...pairSummary.outcome.benefitTaskIds],\n        regressionTaskIds: [...pairSummary.outcome.regressionTaskIds],\n        synergyTaskIds,\n        interferenceTaskIds,\n        incrementalVsConstituents,\n        relativeCostToBaseline: relativeCosts(context, pairSummary, baseline),\n        firing,\n        effect,\n        interaction: interactionEffect(\n          context,\n          baseline.candidate,\n          [leftSingle, rightSingle],\n          pair,\n        ),\n        compatibility,\n      })\n    }\n  }\n  return entries\n}\n\nfunction pairCompatibility<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  pair: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n  betterSingle: CrossSurfaceCandidateSummary,\n  comparisons: [CrossSurfaceCandidateComparison, CrossSurfaceCandidateComparison],\n  constituentsReady: boolean,\n  interferenceTaskIds: string[],\n  firing: CrossSurfacePairEvidence,\n  effect: CrossSurfacePairEvidence,\n): CrossSurfacePairCompatibility {\n  const reasons: CrossSurfacePairIncompatibilityReason[] = []\n  if (!constituentsReady) reasons.push('constituent_not_ready')\n  if (\n    pair.outcome.missingTaskIds.length > 0 ||\n    pair.outcome.invalidTaskIds.length > 0 ||\n    pair.outcome.comparisonMissingTaskIds.length > 0\n  ) {\n    reasons.push('pair_incomplete')\n  }\n  if (pair.outcome.regressionTaskIds.length > 0) reasons.push('baseline_regression')\n  if (interferenceTaskIds.length > 0) reasons.push('interference')\n  const betterComparison = comparisons.find(\n    (comparison) => comparison.comparatorCandidateId === betterSingle.candidate.candidateId,\n  )!\n  if (betterComparison.winsTaskIds.length === 0) reasons.push('no_incremental_resolution')\n  appendPairEvidenceReasons(\n    reasons,\n    firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendPairEvidenceReasons(\n    reasons,\n    effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, pair, baseline)) reasons.push('cost_limit_exceeded')\n  return {\n    compatible: reasons.length === 0,\n    reasons: unique(reasons),\n    betterSingleCandidateId: betterSingle.candidate.candidateId,\n  }\n}\n\nfunction appendPairEvidenceReasons(\n  reasons: CrossSurfacePairIncompatibilityReason[],\n  evidence: CrossSurfacePairEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfacePairIncompatibilityReason,\n  unobservedReason: CrossSurfacePairIncompatibilityReason,\n): void {\n  const leftObserved = evidence.bothTaskIds.length + evidence.leftOnlyTaskIds.length\n  const rightObserved = evidence.bothTaskIds.length + evidence.rightOnlyTaskIds.length\n  if (leftObserved < minimum || rightObserved < minimum) reasons.push(belowReason)\n  if (requireObserved && evidence.unobservedTaskIds.length > 0) reasons.push(unobservedReason)\n}\n\nfunction interactionEffect<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  baseline: CrossSurfaceCandidate,\n  singles: CrossSurfaceCandidate[],\n  composition: CrossSurfaceCandidate,\n): CrossSurfaceInteractionEffect {\n  const perTask = context.input.taskOrder.map((taskId) => {\n    const baselineRow = rowFor(context, baseline.candidateId, taskId)\n    const singleRows = singles.map((single) => rowFor(context, single.candidateId, taskId))\n    const compositionRow = rowFor(context, composition.candidateId, taskId)\n    const rows = [baselineRow, ...singleRows, compositionRow]\n    if (!rows.every((row) => row.completeness === 'complete')) {\n      return { taskId, passInteraction: null, scoreInteraction: null }\n    }\n    const additivePass =\n      singleRows.reduce((sum, row) => sum + Number(row.pass), 0) -\n      (singles.length - 1) * Number(baselineRow.pass)\n    const additiveScore =\n      singleRows.reduce((sum, row) => sum + (row.score as number), 0) -\n      (singles.length - 1) * (baselineRow.score as number)\n    return {\n      taskId,\n      passInteraction: Number(compositionRow.pass) - additivePass,\n      scoreInteraction: (compositionRow.score as number) - additiveScore,\n    }\n  })\n  const complete = perTask.filter(\n    (row): row is { taskId: string; passInteraction: number; scoreInteraction: number } =>\n      row.passInteraction !== null && row.scoreInteraction !== null,\n  )\n  const passInteractions = complete.map((row) => row.passInteraction)\n  const scoreInteractions = complete.map((row) => row.scoreInteraction)\n  return {\n    perTask,\n    n: complete.length,\n    nMissing: perTask.length - complete.length,\n    meanPassInteraction: meanOrNull(passInteractions),\n    meanScoreInteraction: meanOrNull(scoreInteractions),\n    passBootstrap: bootstrapInteraction(passInteractions, context),\n    scoreBootstrap: bootstrapInteraction(scoreInteractions, context),\n  }\n}\n\nfunction bootstrapInteraction<TRow extends CrossSurfaceTaskRow>(\n  interactions: number[],\n  context: AnalysisContext<TRow>,\n) {\n  if (interactions.length === 0) return null\n  return pairedBootstrap(new Array(interactions.length).fill(0), interactions, {\n    ...context.input.bootstrap,\n    statistic: 'mean',\n  })\n}\n\nfunction selectCandidates<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  eligibleSingles: CrossSurfaceCandidateSummary[],\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairwise: CrossSurfacePairwiseEntry[],\n): CrossSurfaceSelections {\n  const bestSingleRanking = eligibleSingles.filter((summary) => {\n    const componentId = summary.candidate.componentIds[0]!\n    return context.componentById.get(componentId)!.bestSingleEligible\n  })\n  const ranking: CrossSurfaceRankedSingle[] = bestSingleRanking.map((summary, index) => ({\n    rank: index + 1,\n    candidateId: summary.candidate.candidateId,\n    componentId: summary.candidate.componentIds[0]!,\n  }))\n  const best = bestSingleRanking[0]\n  const bestSingle = best\n    ? {\n        candidateId: best.candidate.candidateId,\n        componentId: best.candidate.componentIds[0]!,\n        ranking,\n      }\n    : null\n  const naiveStack = selectNaiveStack(context, eligibleSingles)\n  const interactionAware = selectInteractionAware(\n    context,\n    summaryById,\n    interactionReadySingles,\n    pairwise,\n  )\n  return { bestSingle, naiveStack, interactionAware }\n}\n\nfunction selectNaiveStack<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  eligibleSingles: CrossSurfaceCandidateSummary[],\n): CrossSurfaceNaiveStackSelection | null {\n  if (eligibleSingles.length === 0) return null\n  const componentIds = eligibleSingles\n    .map((summary) => summary.candidate.componentIds[0]!)\n    .sort((left, right) => context.componentIndex.get(left)! - context.componentIndex.get(right)!)\n  const candidate = context.candidateByComponents.get(componentSetKey(componentIds))\n  if (!candidate) {\n    throw new ValidationError(\n      `analyzeCrossSurfaceInteractions: naive stack [${componentIds.join(', ')}] was not evaluated`,\n    )\n  }\n  return { candidateId: candidate.candidateId, componentIds }\n}\n\nfunction selectInteractionAware<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairwise: CrossSurfacePairwiseEntry[],\n): CrossSurfaceInteractionAwareSelection | null {\n  const baseline = summaryById.get(context.input.baselineCandidateId)!\n  const pairByComponents = new Map(\n    pairwise.map((entry) => [componentSetKey(entry.componentIds), entry]),\n  )\n  const paths = pairwise\n    .filter((entry) => entry.compatibility.compatible)\n    .map((entry) =>\n      growInteractionPath(\n        context,\n        summaryById,\n        interactionReadySingles,\n        pairByComponents,\n        baseline,\n        summaryById.get(entry.compositionCandidateId)!,\n      ),\n    )\n  if (paths.length === 0) return null\n\n  const qualified = paths\n    .filter((path) => path.qualified)\n    .sort((left, right) => compareInteractionPaths(context, summaryById, left, right))\n  const winning =\n    qualified[0] ??\n    [...paths].sort((left, right) => compareInteractionPaths(context, summaryById, left, right))[0]!\n  return {\n    seedCandidateId: winning.seedCandidateId,\n    terminalCandidateId: winning.terminalCandidateId,\n    terminalComponentIds: [...winning.terminalComponentIds],\n    selectedCandidateId: qualified.length > 0 ? winning.terminalCandidateId : null,\n    qualified: qualified.length > 0,\n    evaluatedPaths: paths,\n    steps: winning.steps,\n  }\n}\n\nfunction growInteractionPath<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  interactionReadySingles: CrossSurfaceCandidateSummary[],\n  pairByComponents: Map<string, CrossSurfacePairwiseEntry>,\n  baseline: CrossSurfaceCandidateSummary,\n  seed: CrossSurfaceCandidateSummary,\n): CrossSurfaceInteractionPath {\n  let current = seed\n  let retained = [...seed.candidate.componentIds]\n  let remaining = interactionReadySingles.filter(\n    (summary) => !retained.includes(summary.candidate.componentIds[0]!),\n  )\n  const steps: CrossSurfaceCompositionStep[] = []\n\n  while (remaining.length > 0) {\n    const decisions = remaining.map((addition) =>\n      evaluateAddition(\n        context,\n        summaryById,\n        pairByComponents,\n        baseline,\n        current,\n        retained,\n        addition,\n      ),\n    )\n    const eligible = decisions\n      .filter((decision) => decision.eligible)\n      .sort((left, right) => compareAdditionDecisions(context, summaryById, left, right))\n    const selected = eligible[0]\n    if (selected) selected.selected = true\n    steps.push({\n      fromCandidateId: current.candidate.candidateId,\n      retainedComponentIds: [...retained],\n      considered: decisions.sort(\n        (left, right) =>\n          context.candidateIndex.get(left.additionCandidateId)! -\n          context.candidateIndex.get(right.additionCandidateId)!,\n      ),\n      selectedCandidateId: selected?.bundleCandidateId ?? null,\n    })\n    if (!selected?.bundleCandidateId) break\n    current = summaryById.get(selected.bundleCandidateId)!\n    retained = [...current.candidate.componentIds]\n    remaining = remaining.filter(\n      (summary) => summary.candidate.candidateId !== selected.additionCandidateId,\n    )\n  }\n\n  const qualified = retained.length >= context.input.selection.minimumBundleComponents\n  return {\n    seedCandidateId: seed.candidate.candidateId,\n    terminalCandidateId: current.candidate.candidateId,\n    terminalComponentIds: retained,\n    qualified,\n    steps,\n  }\n}\n\nfunction compareInteractionPaths<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  left: CrossSurfaceInteractionPath,\n  right: CrossSurfaceInteractionPath,\n): number {\n  const leftSummary = summaryById.get(left.terminalCandidateId)!\n  const rightSummary = summaryById.get(right.terminalCandidateId)!\n  const byNetBenefit = rightSummary.outcome.netBenefit - leftSummary.outcome.netBenefit\n  if (byNetBenefit !== 0) return byNetBenefit\n  const byBenefit =\n    rightSummary.outcome.benefitTaskIds.length - leftSummary.outcome.benefitTaskIds.length\n  if (byBenefit !== 0) return byBenefit\n  const byRegression =\n    leftSummary.outcome.regressionTaskIds.length - rightSummary.outcome.regressionTaskIds.length\n  if (byRegression !== 0) return byRegression\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = leftSummary.costs[metric]!.median - rightSummary.costs[metric]!.median\n    if (byCost !== 0) return byCost\n  }\n  const byBytes = leftSummary.candidate.artifactBytes - rightSummary.candidate.artifactBytes\n  if (byBytes !== 0) return byBytes\n  const byCandidateOrder =\n    context.candidateIndex.get(left.terminalCandidateId)! -\n    context.candidateIndex.get(right.terminalCandidateId)!\n  if (byCandidateOrder !== 0) return byCandidateOrder\n  return (\n    context.candidateIndex.get(left.seedCandidateId)! -\n    context.candidateIndex.get(right.seedCandidateId)!\n  )\n}\n\nfunction evaluateAddition<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  pairByComponents: Map<string, CrossSurfacePairwiseEntry>,\n  baseline: CrossSurfaceCandidateSummary,\n  current: CrossSurfaceCandidateSummary,\n  retained: string[],\n  addition: CrossSurfaceCandidateSummary,\n): CrossSurfaceAdditionDecision {\n  const additionComponentId = addition.candidate.componentIds[0]!\n  const reasons: CrossSurfaceAdditionRejectionReason[] = []\n  for (const retainedComponentId of retained) {\n    const pair = pairByComponents.get(\n      componentSetKey(canonicalComponents(context, [retainedComponentId, additionComponentId])),\n    )\n    if (!pair?.compatibility.compatible) reasons.push('pair_incompatible')\n  }\n  const bundleComponents = canonicalComponents(context, [...retained, additionComponentId])\n  const bundle = context.candidateByComponents.get(componentSetKey(bundleComponents))\n  if (!bundle) {\n    reasons.push('full_bundle_not_evaluated')\n    return emptyAdditionDecision(addition, additionComponentId, reasons)\n  }\n  const bundleSummary = summaryById.get(bundle.candidateId)!\n  if (\n    bundleSummary.outcome.missingTaskIds.length > 0 ||\n    bundleSummary.outcome.invalidTaskIds.length > 0 ||\n    bundleSummary.outcome.comparisonMissingTaskIds.length > 0\n  ) {\n    reasons.push('bundle_incomplete')\n  }\n  if (bundleSummary.outcome.regressionTaskIds.length > 0) reasons.push('baseline_regression')\n  const comparison = compareCandidates(\n    context,\n    summaryById,\n    current.candidate.candidateId,\n    bundle.candidateId,\n  )\n  if (comparison.winsTaskIds.length === 0) reasons.push('no_incremental_resolution')\n  if (comparison.regressionTaskIds.length > 0) reasons.push('incremental_regression')\n  appendBundleEvidenceReasons(\n    reasons,\n    bundleSummary.firing,\n    context.input.selection.minimumFiringTasks,\n    context.input.selection.requireObservedFiring,\n    'firing_below_minimum',\n    'firing_unobserved',\n  )\n  appendBundleEvidenceReasons(\n    reasons,\n    bundleSummary.effect,\n    context.input.selection.minimumEffectTasks,\n    context.input.selection.requireObservedEffect,\n    'effect_below_minimum',\n    'effect_unobserved',\n  )\n  if (!withinCostLimits(context, bundleSummary, baseline)) reasons.push('cost_limit_exceeded')\n  return {\n    additionCandidateId: addition.candidate.candidateId,\n    additionComponentId,\n    bundleCandidateId: bundle.candidateId,\n    incrementalResolutionTaskIds: comparison.winsTaskIds,\n    incrementalRegressionTaskIds: comparison.regressionTaskIds,\n    incrementalMedianCost: Object.fromEntries(\n      context.input.costMetricOrder.map((metric) => [\n        metric,\n        bundleSummary.costs[metric]!.median - current.costs[metric]!.median,\n      ]),\n    ),\n    eligible: reasons.length === 0,\n    selected: false,\n    reasons: unique(reasons),\n  }\n}\n\nfunction emptyAdditionDecision(\n  addition: CrossSurfaceCandidateSummary,\n  additionComponentId: string,\n  reasons: CrossSurfaceAdditionRejectionReason[],\n): CrossSurfaceAdditionDecision {\n  return {\n    additionCandidateId: addition.candidate.candidateId,\n    additionComponentId,\n    bundleCandidateId: null,\n    incrementalResolutionTaskIds: [],\n    incrementalRegressionTaskIds: [],\n    incrementalMedianCost: null,\n    eligible: false,\n    selected: false,\n    reasons: unique(reasons),\n  }\n}\n\nfunction appendBundleEvidenceReasons(\n  reasons: CrossSurfaceAdditionRejectionReason[],\n  evidence: CrossSurfaceCandidateEvidence,\n  minimum: number,\n  requireObserved: boolean,\n  belowReason: CrossSurfaceAdditionRejectionReason,\n  unobservedReason: CrossSurfaceAdditionRejectionReason,\n): void {\n  if (evidence.byComponent.some((component) => component.observedTaskIds.length < minimum)) {\n    reasons.push(belowReason)\n  }\n  if (\n    requireObserved &&\n    evidence.byComponent.some((component) => component.unobservedTaskIds.length > 0)\n  ) {\n    reasons.push(unobservedReason)\n  }\n}\n\nfunction compareAdditionDecisions<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  left: CrossSurfaceAdditionDecision,\n  right: CrossSurfaceAdditionDecision,\n): number {\n  const byWins =\n    right.incrementalResolutionTaskIds.length - left.incrementalResolutionTaskIds.length\n  if (byWins !== 0) return byWins\n  for (const metric of context.input.costMetricOrder) {\n    const byCost = left.incrementalMedianCost![metric]! - right.incrementalMedianCost![metric]!\n    if (byCost !== 0) return byCost\n  }\n  const leftBytes = summaryById.get(left.additionCandidateId)!.candidate.artifactBytes\n  const rightBytes = summaryById.get(right.additionCandidateId)!.candidate.artifactBytes\n  const byBytes = leftBytes - rightBytes\n  if (byBytes !== 0) return byBytes\n  return (\n    context.candidateIndex.get(left.additionCandidateId)! -\n    context.candidateIndex.get(right.additionCandidateId)!\n  )\n}\n\nfunction compareCandidates<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  summaryById: Map<string, CrossSurfaceCandidateSummary>,\n  comparatorCandidateId: string,\n  treatmentCandidateId: string,\n): CrossSurfaceCandidateComparison {\n  const winsTaskIds: string[] = []\n  const regressionTaskIds: string[] = []\n  const missingTaskIds: string[] = []\n  for (const taskId of context.input.taskOrder) {\n    const comparator = rowFor(context, comparatorCandidateId, taskId)\n    const treatment = rowFor(context, treatmentCandidateId, taskId)\n    if (comparator.completeness !== 'complete' || treatment.completeness !== 'complete') {\n      missingTaskIds.push(taskId)\n    } else if (treatment.pass && !comparator.pass) winsTaskIds.push(taskId)\n    else if (!treatment.pass && comparator.pass) regressionTaskIds.push(taskId)\n  }\n  return {\n    comparatorCandidateId,\n    treatmentCandidateId,\n    winsTaskIds,\n    regressionTaskIds,\n    missingTaskIds,\n    paired: pairedComparison(context, comparatorCandidateId, treatmentCandidateId),\n    relativeCost: relativeCosts(\n      context,\n      summaryById.get(treatmentCandidateId)!,\n      summaryById.get(comparatorCandidateId)!,\n    ),\n  }\n}\n\nfunction pairedComparison<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  comparatorCandidateId: string,\n  treatmentCandidateId: string,\n): PairedArmsComparison {\n  const rows: PairedArmRow[] = []\n  for (const taskId of context.input.taskOrder) {\n    rows.push(toPairedArmRow(context, rowFor(context, comparatorCandidateId, taskId)))\n    rows.push(toPairedArmRow(context, rowFor(context, treatmentCandidateId, taskId)))\n  }\n  return comparePairedArms(rows, {\n    baselineArm: comparatorCandidateId,\n    treatmentArm: treatmentCandidateId,\n    metricNames: ['score', ...context.input.costMetricOrder],\n    bootstrap: { ...context.input.bootstrap, statistic: 'mean' },\n  })\n}\n\nfunction toPairedArmRow<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  row: TRow,\n): PairedArmRow {\n  const metrics: Record<string, number> = Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => [metric, row.cost[metric] as number]),\n  )\n  if (row.completeness === 'complete') metrics.score = row.score as number\n  return {\n    pairKey: row.taskId,\n    arm: row.candidateId,\n    ...(row.completeness === 'complete' ? { pass: row.pass as boolean } : {}),\n    metrics,\n  }\n}\n\nfunction summarizePairEvidence<TRow extends CrossSurfaceTaskRow>(\n  rows: TRow[],\n  leftComponentId: string,\n  rightComponentId: string,\n  field: 'fired' | 'effectObserved',\n): CrossSurfacePairEvidence {\n  const bothTaskIds: string[] = []\n  const leftOnlyTaskIds: string[] = []\n  const rightOnlyTaskIds: string[] = []\n  const neitherTaskIds: string[] = []\n  const unobservedTaskIds: string[] = []\n  for (const row of rows) {\n    const left = evidenceValue(row, leftComponentId, field)\n    const right = evidenceValue(row, rightComponentId, field)\n    if (left === null || right === null) unobservedTaskIds.push(row.taskId)\n    else if (left && right) bothTaskIds.push(row.taskId)\n    else if (left) leftOnlyTaskIds.push(row.taskId)\n    else if (right) rightOnlyTaskIds.push(row.taskId)\n    else neitherTaskIds.push(row.taskId)\n  }\n  return {\n    bothTaskIds,\n    leftOnlyTaskIds,\n    rightOnlyTaskIds,\n    neitherTaskIds,\n    unobservedTaskIds,\n  }\n}\n\nfunction relativeCosts<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  treatment: CrossSurfaceCandidateSummary,\n  comparator: CrossSurfaceCandidateSummary,\n): Record<string, CrossSurfaceRelativeCost> {\n  return Object.fromEntries(\n    context.input.costMetricOrder.map((metric) => {\n      const treatmentMedian = treatment.costs[metric]!.median\n      const comparatorMedian = comparator.costs[metric]!.median\n      return [\n        metric,\n        {\n          treatmentMedian,\n          comparatorMedian,\n          medianDelta: treatmentMedian - comparatorMedian,\n          medianRatio:\n            comparatorMedian === 0\n              ? treatmentMedian === 0\n                ? 1\n                : null\n              : treatmentMedian / comparatorMedian,\n        },\n      ]\n    }),\n  )\n}\n\nfunction withinCostLimits<TRow extends CrossSurfaceTaskRow>(\n  context: AnalysisContext<TRow>,\n  treatment: CrossSurfaceCandidateSummary,\n  baseline: CrossSurfaceCandidateSummary,\n): boolean {\n  const relative = relativeCosts(context, treatment, baseline)\n  return Object.entries(context.input.selection.maximumMedianCostRatioToBaseline).every(\n    ([metric, limit]) => {\n      const ratio = relative[metric]!.medianRatio\n      return ratio !== null && ratio <= limit\n    },\n  )\n}\n\nfunction distribution(values: number[]): CrossSurfaceDistribution {\n  const sorted = [...values].sort((left, right) => left - right)\n  const total = sorted.reduce((sum, value) => sum + value, 0)\n  const middle = Math.floor(sorted.length / 2)\n  const median =\n    sorted.length % 2 === 1 ? sorted[middle]! : (sorted[middle - 1]! + sorted[middle]!) / 2\n  return {\n    n: sorted.length,\n    min: sorted[0]!,\n    median,\n    mean: total / sorted.length,\n    max: sorted[sorted.length - 1]!,\n    total,\n  }\n}\n\nfunction evidenceValue(\n  row: CrossSurfaceTaskRow,\n  componentId: string,\n  field: 'fired' | 'effectObserved',\n): boolean | null {\n  return row.componentEvidence.find((evidence) => evidence.componentId === componentId)![field]\n}\n\nfunction meanOrNull(values: number[]): number | null {\n  return values.length === 0 ? null : values.reduce((sum, value) => sum + value, 0) / values.length\n}\n\nfunction unique<T>(values: T[]): T[] {\n  return [...new Set(values)]\n}\n","import { createHash } from 'node:crypto'\nimport { existsSync, readdirSync, readFileSync, statSync } from 'node:fs'\nimport { isAbsolute, join, relative, resolve } from 'node:path'\nimport { contentHash } from '../verdict-cache'\nimport { type CampaignRunPlan, type PlanCampaignRunOptions, planCampaignRun } from './run-campaign'\nimport type { CampaignStorage } from './storage'\nimport type { JudgeConfig, Scenario } from './types'\n\nexport type EvalFixtureValidationMode = 'vitest' | 'none'\n\nexport interface EvalFixtureFile {\n  path: string\n  sha256: string\n  bytes: number\n}\n\nexport interface EvalFixture {\n  name: string\n  path: string\n  promptPath: string\n  evalPath?: string\n  packageJsonPath?: string\n  prompt: string\n  files: EvalFixtureFile[]\n  fingerprint: string\n}\n\nexport interface EvalFixtureScenario extends Scenario {\n  kind: 'eval-fixture'\n  fixtureName: string\n  fixturePath: string\n  promptPath: string\n  evalPath?: string\n  packageJsonPath?: string\n  prompt: string\n  fingerprint: string\n}\n\nexport interface EvalFixtureLoadOptions {\n  /** `vitest` requires EVAL.ts/EVAL.tsx and package.json type=module. `none` only requires PROMPT.md. */\n  validation?: EvalFixtureValidationMode\n  /** Extra caller-owned knobs that affect fixture behavior, folded into the fingerprint. */\n  fingerprintConfig?: unknown\n}\n\nexport interface LoadEvalFixtureScenariosOptions extends EvalFixtureLoadOptions {\n  names?: string[]\n}\n\nexport interface PlanEvalFixtureRunOptions<TArtifact = unknown>\n  extends Pick<\n    PlanCampaignRunOptions<EvalFixtureScenario, TArtifact>,\n    'dispatchRef' | 'judges' | 'seed' | 'reps' | 'resumable' | 'runDir'\n  > {\n  evalsDir: string\n  validation?: EvalFixtureValidationMode\n  fingerprintConfig?: unknown\n  names?: string[]\n  storage?: CampaignStorage\n}\n\nexport type EvalFixtureRunPlan = CampaignRunPlan & {\n  fixtures: Array<Pick<EvalFixtureScenario, 'fixtureName' | 'fixturePath' | 'fingerprint'>>\n}\n\n/** Walk `evalsDir` and return the relative name of every fixture directory (one containing an exact-case `PROMPT.md`). */\nexport function discoverEvalFixtures(evalsDir: string): string[] {\n  const root = resolve(evalsDir)\n  if (!existsSync(root)) throw new Error(`discoverEvalFixtures: evalsDir not found: ${root}`)\n\n  const fixtures: string[] = []\n  const walk = (dir: string, base = '') => {\n    for (const entry of readdirSync(dir).sort()) {\n      if (entry.startsWith('.') || entry === 'node_modules') continue\n      const fullPath = join(dir, entry)\n      if (!statSync(fullPath).isDirectory()) continue\n\n      const name = base ? `${base}/${entry}` : entry\n      if (existsWithExactCase(fullPath, 'PROMPT.md')) {\n        fixtures.push(name)\n      } else {\n        walk(fullPath, name)\n      }\n    }\n  }\n\n  walk(root)\n  return fixtures\n}\n\n/**\n * Load ONE fixture by name: reads `PROMPT.md` (plus `EVAL.ts`/`EVAL.tsx` and `package.json` under\n * `vitest` validation) and content-fingerprints the full file set for cache identity.\n */\nexport function loadEvalFixture(\n  evalsDir: string,\n  name: string,\n  options: EvalFixtureLoadOptions = {},\n): EvalFixture {\n  const validation = options.validation ?? 'vitest'\n  const root = resolve(evalsDir)\n  const fixturePath = resolve(root, name)\n  assertInside(root, fixturePath, name)\n\n  if (!existsSync(fixturePath) || !statSync(fixturePath).isDirectory()) {\n    throw new Error(`loadEvalFixture: fixture not found: ${name}`)\n  }\n  if (!existsWithExactCase(fixturePath, 'PROMPT.md')) {\n    throw new Error(`loadEvalFixture: ${name} is missing exact-case PROMPT.md`)\n  }\n\n  const promptPath = join(fixturePath, 'PROMPT.md')\n  const evalPath = resolveEvalPath(fixturePath)\n  const packageJsonPath = existsWithExactCase(fixturePath, 'package.json')\n    ? join(fixturePath, 'package.json')\n    : undefined\n\n  if (validation !== 'none') {\n    if (!evalPath)\n      throw new Error(`loadEvalFixture: ${name} is missing exact-case EVAL.ts or EVAL.tsx`)\n    if (!packageJsonPath)\n      throw new Error(`loadEvalFixture: ${name} is missing exact-case package.json`)\n    assertModulePackage(packageJsonPath, name)\n  }\n\n  const files = collectFixtureFiles(fixturePath)\n  return {\n    name,\n    path: fixturePath,\n    promptPath,\n    evalPath,\n    packageJsonPath,\n    prompt: readFileSync(promptPath, 'utf8'),\n    files,\n    fingerprint: contentHash({\n      files,\n      config: options.fingerprintConfig ?? null,\n    }),\n  }\n}\n\n/** Load fixtures (all discovered, or just `names`) as campaign `Scenario`s tagged `eval-fixture`. */\nexport function loadEvalFixtureScenarios(\n  evalsDir: string,\n  options: LoadEvalFixtureScenariosOptions = {},\n): EvalFixtureScenario[] {\n  const names = options.names ?? discoverEvalFixtures(evalsDir)\n  return names.map((name) => {\n    const fixture = loadEvalFixture(evalsDir, name, options)\n    return {\n      id: fixture.name,\n      kind: 'eval-fixture',\n      tags: ['eval-fixture'],\n      fixtureName: fixture.name,\n      fixturePath: fixture.path,\n      promptPath: fixture.promptPath,\n      evalPath: fixture.evalPath,\n      packageJsonPath: fixture.packageJsonPath,\n      prompt: fixture.prompt,\n      fingerprint: fixture.fingerprint,\n    }\n  })\n}\n\n/**\n * Dry-run planner for a fixture campaign: loads the scenarios, delegates to `planCampaignRun`,\n * and returns the plan plus each fixture's name/path/fingerprint.\n */\nexport function planEvalFixtureRun<TArtifact = unknown>(\n  options: PlanEvalFixtureRunOptions<TArtifact>,\n): EvalFixtureRunPlan {\n  const scenarios = loadEvalFixtureScenarios(options.evalsDir, {\n    names: options.names,\n    validation: options.validation,\n    fingerprintConfig: options.fingerprintConfig,\n  })\n  const plan = planCampaignRun<EvalFixtureScenario, TArtifact>({\n    scenarios,\n    dispatchRef: options.dispatchRef ?? 'eval-fixture-dispatch',\n    judges: options.judges as JudgeConfig<TArtifact, EvalFixtureScenario>[] | undefined,\n    seed: options.seed,\n    reps: options.reps,\n    resumable: options.resumable,\n    runDir: options.runDir,\n    storage: options.storage,\n  })\n\n  return {\n    ...plan,\n    fixtures: scenarios.map((scenario) => ({\n      fixtureName: scenario.fixtureName,\n      fixturePath: scenario.fixturePath,\n      fingerprint: scenario.fingerprint,\n    })),\n  }\n}\n\nfunction existsWithExactCase(dirPath: string, fileName: string): boolean {\n  try {\n    return readdirSync(dirPath).includes(fileName)\n  } catch {\n    return false\n  }\n}\n\nfunction resolveEvalPath(fixturePath: string): string | undefined {\n  if (existsWithExactCase(fixturePath, 'EVAL.ts')) return join(fixturePath, 'EVAL.ts')\n  if (existsWithExactCase(fixturePath, 'EVAL.tsx')) return join(fixturePath, 'EVAL.tsx')\n  return undefined\n}\n\nfunction assertModulePackage(packageJsonPath: string, name: string): void {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(readFileSync(packageJsonPath, 'utf8'))\n  } catch (err) {\n    throw new Error(\n      `loadEvalFixture: ${name} package.json is invalid JSON: ${err instanceof Error ? err.message : String(err)}`,\n    )\n  }\n\n  if (\n    typeof parsed !== 'object' ||\n    parsed === null ||\n    (parsed as { type?: unknown }).type !== 'module'\n  ) {\n    throw new Error(`loadEvalFixture: ${name} package.json must set \"type\": \"module\"`)\n  }\n}\n\nfunction collectFixtureFiles(fixturePath: string, base = ''): EvalFixtureFile[] {\n  const files: EvalFixtureFile[] = []\n  for (const entry of readdirSync(join(fixturePath, base)).sort()) {\n    if (entry === 'node_modules' || entry === '.git') continue\n    const relativePath = base ? `${base}/${entry}` : entry\n    const fullPath = join(fixturePath, relativePath)\n    const stat = statSync(fullPath)\n    if (stat.isDirectory()) {\n      files.push(...collectFixtureFiles(fixturePath, relativePath))\n      continue\n    }\n    const bytes = readFileSync(fullPath)\n    files.push({\n      path: relativePath,\n      sha256: createHash('sha256').update(bytes).digest('hex'),\n      bytes: bytes.byteLength,\n    })\n  }\n  return files\n}\n\nfunction assertInside(root: string, target: string, label: string): void {\n  const rel = relative(root, target)\n  if (rel === '' || (!rel.startsWith('..') && !isAbsolute(rel))) return\n  throw new Error(`loadEvalFixture: fixture path escapes evalsDir: ${label}`)\n}\n","/**\n * @module\n * Composable placebo / neutralization promotion gate.\n *\n * A held-out gate proves a candidate beat baseline. It CANNOT prove the lift came\n * from the candidate's CONTENT rather than from the prompt/mount FOOTPRINT the\n * content happened to add (more bytes, a longer prompt). This gate closes that\n * hole: it compares the candidate's held-out lift against the lift of a\n * FOOTPRINT-MATCHED neutralized variant (same layout + length, zero content, via\n * `neutralizeText`). If the neutralized variant reproduces more than\n * `maxDecorativeFraction` of the candidate's lift, the lift is decorative — it\n * survives blanking the content — and the candidate is HELD regardless of how\n * large or significant its raw lift is.\n *\n * Compose it AFTER the significance gate — significance says the lift is real,\n * this says the lift is CAUSED BY THE CONTENT:\n *   composeGate(heldOutGate({ ... }), neutralizationGate({ ... }))\n *\n * Requires `ctx.neutralizedJudgeScores`, populated by `runImprovementLoop` when it\n * is given a `neutralize` function. A gate composed without that wiring fails\n * loud rather than silently passing an unproven candidate.\n */\n\nimport type { Gate, GateContext, GateResult, Scenario } from '../types'\nimport { pairHoldout } from './statistical-heldout'\n\nexport interface NeutralizationGateOptions<TScenario extends Scenario = Scenario> {\n  scenarios: TScenario[]\n  /** Reject when the neutralized (content-blanked, footprint-matched) variant\n   *  reproduces at least this fraction of the candidate's held-out lift. Default\n   *  0.5 — if blanking the content keeps half the lift, the content is decorative.\n   *  Equality rejects: a neutralized lift == threshold·candidateLift is decorative. */\n  maxDecorativeFraction?: number\n}\n\n/** Mean of a numeric array; 0 for an empty array (callers guard n separately). */\nfunction mean(xs: number[]): number {\n  return xs.length === 0 ? 0 : xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\n/** Paired mean held-out lift of `arm` over baseline, on the in-scope cells. */\nfunction pairedLift(\n  arm: Map<string, Record<string, { composite: number }>>,\n  baseline: Map<string, Record<string, { composite: number }>>,\n  scenarioIds: Set<string>,\n): { lift: number; n: number } {\n  const paired = pairHoldout(arm as never, baseline as never, scenarioIds, (s) => s.composite)\n  const deltas = paired.after.map((a, i) => a - (paired.before[i] ?? 0))\n  return { lift: mean(deltas), n: deltas.length }\n}\n\n/**\n * Composable placebo gate: ships only when the candidate's held-out lift is NOT\n * mostly reproduced by a footprint-matched neutralized variant.\n */\nexport function neutralizationGate<TArtifact, TScenario extends Scenario>(\n  options: NeutralizationGateOptions<TScenario>,\n): Gate<TArtifact, TScenario> {\n  const maxDecorativeFraction = options.maxDecorativeFraction ?? 0.5\n  return {\n    name: 'neutralizationGate',\n    async decide(ctx: GateContext<TArtifact, TScenario>): Promise<GateResult> {\n      if (!ctx.baselineJudgeScores) {\n        throw new Error(\n          'neutralizationGate: ctx.baselineJudgeScores is required — the placebo control measures lift OVER baseline.',\n        )\n      }\n      if (!ctx.neutralizedJudgeScores) {\n        throw new Error(\n          'neutralizationGate: ctx.neutralizedJudgeScores is required. It is populated by runImprovementLoop only when a `neutralize` function is supplied — composing this gate without that wiring would pass an unproven candidate.',\n        )\n      }\n      const scenarioIds = new Set(options.scenarios.map((s) => s.id))\n      const cand = pairedLift(\n        ctx.judgeScores as never,\n        ctx.baselineJudgeScores as never,\n        scenarioIds,\n      )\n      const neut = pairedLift(\n        ctx.neutralizedJudgeScores as never,\n        ctx.baselineJudgeScores as never,\n        scenarioIds,\n      )\n\n      // No positive candidate lift → nothing to attribute. Fail closed: the\n      // placebo control has no basis to clear the candidate (the significance\n      // gate is what judges lift magnitude; this one only judges its CAUSE).\n      if (cand.lift <= 0) {\n        return {\n          decision: 'hold',\n          reasons: [\n            `neutralization: candidate held-out lift ${cand.lift.toFixed(3)} ≤ 0 — no positive lift to attribute to content`,\n          ],\n          contributingGates: [\n            {\n              name: 'neutralizationGate',\n              passed: false,\n              detail: { candidateLift: cand.lift, neutralizedLift: neut.lift, n: cand.n },\n            },\n          ],\n          delta: cand.lift,\n        }\n      }\n\n      const decorativeFraction = neut.lift / cand.lift\n      const passed = decorativeFraction < maxDecorativeFraction\n      const pct = (decorativeFraction * 100).toFixed(0)\n      return {\n        decision: passed ? 'ship' : 'hold',\n        reasons: passed\n          ? [\n              `neutralization: content is causal — blanked variant reproduces ${pct}% of the lift (< ${(maxDecorativeFraction * 100).toFixed(0)}%); candidate Δ ${cand.lift.toFixed(3)}, neutralized Δ ${neut.lift.toFixed(3)}`,\n            ]\n          : [\n              `neutralization: lift is DECORATIVE — blanking the content (footprint-matched) reproduces ${pct}% of the lift (≥ ${(maxDecorativeFraction * 100).toFixed(0)}%); candidate Δ ${cand.lift.toFixed(3)}, neutralized Δ ${neut.lift.toFixed(3)}`,\n            ],\n        contributingGates: [\n          {\n            name: 'neutralizationGate',\n            passed,\n            detail: {\n              candidateLift: cand.lift,\n              neutralizedLift: neut.lift,\n              decorativeFraction,\n              maxDecorativeFraction,\n              n: cand.n,\n            },\n          },\n        ],\n        delta: cand.lift,\n      }\n    },\n  }\n}\n","/**\n * Anytime-valid sequential promotion gate — an e-process (betting\n * test-martingale, see `eProcess` in `statistics.ts`) over paired\n * per-scenario deltas, so a campaign stops the MOMENT evidence decides\n * instead of burning a fixed-n budget. Decisions remain valid at any\n * data-dependent stopping time (Ville's inequality), which is exactly what\n * fixed-n machinery cannot offer: peeking at a bootstrap CI after every\n * observation and stopping on the first significant peek inflates type-I\n * error far beyond alpha.\n *\n * REPLACES, never layers on, a fixed-n gate. Running `heldoutSignificance`\n * or `paretoSignificanceGate` repeatedly on a growing sample and stopping\n * early is optional stopping no matter how it is dressed up; this gate is\n * the valid way to stop early. Use one or the other per evidence stream.\n *\n * Pre-registration binding: anytime validity holds only for the\n * PRE-REGISTERED statistic. When a `SignedManifest` is bound, the gate takes\n * alpha from `manifest.alpha`, the observation budget from\n * `manifest.preRegisteredN`, orients deltas by `manifest.direction`, and\n * shifts the null boundary by `manifest.minEffect` — re-deciding the same\n * stream under different parameters after seeing data would reopen optional\n * stopping under a fancier name. The manifest's content hash is verified at\n * construction (sync, same `sha256-content` scheme as `signManifest`).\n *\n * Non-iid caveat (stated honestly): the supermartingale guarantee needs each\n * delta's conditional mean under H0 to stay ≤ the null boundary given the\n * past — exchangeable scenario deltas suffice. Scenario streams ordered by\n * difficulty or by scenario family violate this; `decide(ctx)` therefore\n * shuffles the paired deltas with a SEEDED permutation by default (the\n * permutation is data-independent, so bet predictability is preserved).\n * Stratified betting (per-stratum λ) is future work, not implemented here.\n */\n\nimport { createHash } from 'node:crypto'\nimport { canonicalize, type SignedManifest } from '../../pre-registration'\nimport { type EProcessState, eProcess, mulberry32 } from '../../statistics'\nimport type { Gate, GateContext, GateResult, GenerationRecord, Scenario } from '../types'\nimport { pairHoldout } from './statistical-heldout'\n\nexport type SequentialDecision = 'promote' | 'continue' | 'undecided-at-maxN'\n\nexport interface SequentialObservation {\n  decision: SequentialDecision\n  /** Current e-value (the betting wealth) against H0. */\n  eValue: number\n  /** Paired deltas consumed so far. */\n  n: number\n  /** Names the decision basis. For 'undecided-at-maxN' it states explicitly\n   *  that exhausting the budget is NOT evidence of no effect. */\n  reason: string\n}\n\nexport interface SequentialPairedGateOptions {\n  /** Type-I budget. With `preRegistration` bound this MUST match\n   *  `manifest.alpha` (conflict throws). Default 0.05. */\n  alpha?: number\n  /** Minimum paired deltas before a promote may fire. The stopping rule is\n   *  \"first n ≥ minN with e-value ≥ 1/alpha\" — still a valid stopping time.\n   *  Default 5. */\n  minN?: number\n  /** Pre-registered observation budget. Required unless `preRegistration`\n   *  supplies it via `preRegisteredN` (conflict throws). */\n  maxN?: number\n  /** Bet truncation forwarded to `eProcess`. Default 0.5. */\n  maxBet?: number\n  /** Bound on |delta| in the judge's native scale; deltas are mapped to\n   *  x = (d/scale + 1)/2 ∈ [0,1]. A delta outside ±scale throws (use\n   *  `detectScale` to pick 1 vs 100 BEFORE streaming). Default 1. */\n  scale?: number\n  /** Seed for the data-independent shuffle of paired deltas in `decide(ctx)`\n   *  (exchangeability guard). Default 1337. */\n  shuffleSeed?: number\n  /** Bind the pre-registered hypothesis. Verified (content hash) at\n   *  construction; alpha/maxN/direction/minEffect come FROM the manifest. */\n  preRegistration?: SignedManifest\n  /** Override the gate name in reports. */\n  name?: string\n}\n\nexport interface SequentialPairedGate<TArtifact = unknown, TScenario extends Scenario = Scenario>\n  extends Gate<TArtifact, TScenario> {\n  /** Streaming entry point: feed one paired per-scenario delta\n   *  (candidate − baseline, native scale). Each gate instance carries ONE\n   *  observe-stream; `decide(ctx)` runs on its own fresh stream and never\n   *  consumes or advances this one. 'promote' is sticky; observing past the\n   *  pre-registered maxN throws (extending a finished stream after seeing\n   *  the result reopens optional stopping — start a NEW pre-registered\n   *  test). */\n  observe(delta: number): SequentialObservation\n  /** Read-only snapshot of the observe-stream. */\n  state(): EProcessState & { decision: SequentialDecision }\n}\n\ninterface ResolvedConfig {\n  alpha: number\n  minN: number\n  maxN: number\n  maxBet: number\n  scale: number\n  shuffleSeed: number\n  /** 'decrease' negates deltas so \"better\" is always positive. */\n  direction: 'increase' | 'decrease'\n  /** H0 boundary in x-space: 1/2 + minEffect/(2·scale). */\n  nullMean: number\n  minEffect: number\n}\n\n/** Sync twin of `verifyManifest` — same `sha256-content` scheme\n *  (sha256 over the canonicalized manifest minus contentHash/algo), via\n *  node:crypto so gate construction can stay synchronous and fail loud\n *  before any observation is consumed. */\nfunction verifyManifestSync(m: SignedManifest): boolean {\n  if (m.algo !== undefined && m.algo !== 'sha256-content') {\n    throw new Error(`sequentialPairedGate: unrecognized manifest hash algo '${m.algo}'`)\n  }\n  const { contentHash, algo: _algo, ...rest } = m\n  void _algo\n  const bytes = JSON.stringify(canonicalize(rest))\n  const hash = createHash('sha256').update(bytes, 'utf8').digest('hex')\n  return hash === contentHash\n}\n\nfunction resolveConfig(opts: SequentialPairedGateOptions): ResolvedConfig {\n  const m = opts.preRegistration\n  let alpha: number\n  let maxN: number\n  let direction: 'increase' | 'decrease'\n  let minEffect: number\n  if (m) {\n    if (!verifyManifestSync(m)) {\n      throw new Error(\n        `sequentialPairedGate: pre-registration manifest '${m.id}' content hash mismatch (tampered)`,\n      )\n    }\n    if (opts.alpha !== undefined && opts.alpha !== m.alpha) {\n      throw new Error(\n        `sequentialPairedGate: alpha ${opts.alpha} conflicts with pre-registered alpha ${m.alpha} — ` +\n          `the registered statistic is the only one anytime validity covers`,\n      )\n    }\n    if (opts.maxN !== undefined && opts.maxN !== m.preRegisteredN) {\n      throw new Error(\n        `sequentialPairedGate: maxN ${opts.maxN} conflicts with pre-registered N ${m.preRegisteredN}`,\n      )\n    }\n    alpha = m.alpha\n    maxN = m.preRegisteredN\n    direction = m.direction\n    minEffect = m.minEffect\n  } else {\n    alpha = opts.alpha ?? 0.05\n    if (opts.maxN === undefined) {\n      throw new Error(\n        'sequentialPairedGate: maxN is required (or bind a preRegistration manifest whose ' +\n          'preRegisteredN is the budget) — an unbounded stream has no pre-registered budget',\n      )\n    }\n    maxN = opts.maxN\n    direction = 'increase'\n    minEffect = 0\n  }\n  const scale = opts.scale ?? 1\n  if (!Number.isFinite(scale) || scale <= 0) {\n    throw new Error(`sequentialPairedGate: scale must be > 0, got ${scale}`)\n  }\n  if (!Number.isInteger(maxN) || maxN < 1) {\n    throw new Error(`sequentialPairedGate: maxN must be a positive integer, got ${maxN}`)\n  }\n  const minN = opts.minN ?? 5\n  if (!Number.isInteger(minN) || minN < 1 || minN > maxN) {\n    throw new Error(\n      `sequentialPairedGate: minN must be an integer in [1, maxN=${maxN}], got ${minN}`,\n    )\n  }\n  if (!Number.isFinite(minEffect) || minEffect < 0 || minEffect >= scale) {\n    throw new Error(\n      `sequentialPairedGate: minEffect must be in [0, scale=${scale}), got ${minEffect}`,\n    )\n  }\n  // H0: mean delta ≤ minEffect. In x = (d/scale + 1)/2 space that is\n  // E[x] ≤ 1/2 + minEffect/(2·scale) — a shifted null boundary, NOT a clamp\n  // of the observations (clamping is mean-distorting for skewed deltas).\n  const nullMean = 0.5 + minEffect / (2 * scale)\n  return {\n    alpha,\n    minN,\n    maxN,\n    maxBet: opts.maxBet ?? 0.5,\n    scale,\n    shuffleSeed: opts.shuffleSeed ?? 1337,\n    direction,\n    nullMean,\n    minEffect,\n  }\n}\n\ninterface SequentialStream {\n  observe(delta: number): SequentialObservation\n  state(): EProcessState & { decision: SequentialDecision }\n}\n\nfunction makeStream(cfg: ResolvedConfig): SequentialStream {\n  const proc = eProcess({ alpha: cfg.alpha, maxBet: cfg.maxBet, nullMean: cfg.nullMean })\n  const threshold = 1 / cfg.alpha\n  let terminal: SequentialDecision | undefined\n  return {\n    observe(delta: number): SequentialObservation {\n      if (terminal === 'undecided-at-maxN') {\n        throw new Error(\n          `sequentialPairedGate: pre-registered maxN=${cfg.maxN} exhausted — extending the ` +\n            'stream after seeing the result reopens optional stopping; start a NEW ' +\n            'pre-registered test',\n        )\n      }\n      if (!Number.isFinite(delta) || Math.abs(delta) > cfg.scale) {\n        throw new Error(\n          `sequentialPairedGate: delta ${delta} outside ±scale=${cfg.scale} — pass the judge's ` +\n            `native scale explicitly (detectScale helps pick 1 vs 100)`,\n        )\n      }\n      const d = cfg.direction === 'decrease' ? -delta : delta\n      const step = proc.update((d / cfg.scale + 1) / 2)\n      // Stopping rule: FIRST n ≥ minN with current wealth ≥ 1/alpha — a valid\n      // stopping time (measurable w.r.t. the past), sticky once latched. The\n      // core's own `decided` latch ignores minN, so the gate re-derives the\n      // decision from current wealth here.\n      if (terminal === undefined && step.n >= cfg.minN && step.wealth >= threshold) {\n        terminal = 'promote'\n      }\n      if (terminal === 'promote') {\n        return {\n          decision: 'promote',\n          eValue: step.wealth,\n          n: step.n,\n          reason:\n            `e-value ${step.wealth.toFixed(2)} ≥ 1/α=${threshold.toFixed(2)} at n=${step.n} ` +\n            `(minN=${cfg.minN}): the paired improvement exceeds ${cfg.minEffect} at anytime-valid ` +\n            `level α=${cfg.alpha}`,\n        }\n      }\n      if (step.n >= cfg.maxN) {\n        terminal = 'undecided-at-maxN'\n        return {\n          decision: 'undecided-at-maxN',\n          eValue: step.wealth,\n          n: step.n,\n          reason:\n            `undecided at pre-registered maxN=${cfg.maxN} (e-value ${step.wealth.toFixed(2)} < ` +\n            `1/α=${threshold.toFixed(2)}). This is NOT evidence of no effect — the effect may be ` +\n            'real but smaller than this budget can detect; re-register with a larger N to test that',\n        }\n      }\n      return {\n        decision: 'continue',\n        eValue: step.wealth,\n        n: step.n,\n        reason: `e-value ${step.wealth.toFixed(2)} < 1/α=${threshold.toFixed(2)} at n=${step.n}/${cfg.maxN} — keep observing`,\n      }\n    },\n    state() {\n      return { ...proc.state(), decision: terminal ?? 'continue' }\n    },\n  }\n}\n\n/** Data-independent in-place Fisher–Yates with a seeded PRNG — the permutation\n *  depends only on the seed, never the values, so bet predictability survives. */\nfunction seededShuffle<T>(items: T[], seed: number): T[] {\n  const rng = mulberry32(seed)\n  for (let i = items.length - 1; i > 0; i--) {\n    const j = Math.floor(rng() * (i + 1))\n    const tmp = items[i]!\n    items[i] = items[j]!\n    items[j] = tmp\n  }\n  return items\n}\n\n/**\n * Anytime-valid sequential paired gate. Conforms to the existing `Gate`\n * contract (`decide(ctx)` consumes candidate vs baseline judge scores via\n * `pairHoldout` — same pairing granularity as the fixed-n gates: full cellId,\n * never scenarioId) and adds a streaming `observe(delta)` entry for campaigns\n * that score cells incrementally and want to stop mid-stream.\n *\n * Decision mapping onto the substrate's five-valued `GateDecision`:\n *   - 'promote'            → 'ship'\n *   - 'continue'           → 'need_more_work' (stream ended before maxN with\n *                            the e-value undecided — more reps could decide)\n *   - 'undecided-at-maxN'  → 'hold', with the reason stating it is NOT\n *                            evidence of no effect (never a silent default)\n */\nexport function sequentialPairedGate<TArtifact = unknown, TScenario extends Scenario = Scenario>(\n  options: SequentialPairedGateOptions,\n): SequentialPairedGate<TArtifact, TScenario> {\n  const cfg = resolveConfig(options)\n  const name = options.name ?? 'sequentialPairedGate'\n  const manifest = options.preRegistration\n  const observeStream = makeStream(cfg)\n\n  return {\n    name,\n    observe(delta: number): SequentialObservation {\n      return observeStream.observe(delta)\n    },\n    state() {\n      return observeStream.state()\n    },\n    async decide(ctx: GateContext<TArtifact, TScenario>): Promise<GateResult> {\n      if (!ctx.baselineJudgeScores) {\n        throw new Error(\n          `${name}: ctx.baselineJudgeScores is required — falling back to the candidate's own ` +\n            'scores would compare the candidate against itself (delta 0, silent no-op)',\n        )\n      }\n      const scenarioIds = new Set(ctx.scenarios.map((s) => s.id))\n      const paired = pairHoldout(\n        ctx.judgeScores,\n        ctx.baselineJudgeScores,\n        scenarioIds,\n        (s) => s.composite,\n      )\n      const deltas = paired.after.map((a, i) => a - paired.before[i]!)\n      seededShuffle(deltas, cfg.shuffleSeed)\n\n      const stream = makeStream(cfg)\n      let last: SequentialObservation | undefined\n      for (const d of deltas) {\n        last = stream.observe(d)\n        if (last.decision !== 'continue') break\n      }\n\n      const detail = {\n        ...stream.state(),\n        minN: cfg.minN,\n        maxN: cfg.maxN,\n        scale: cfg.scale,\n        shuffleSeed: cfg.shuffleSeed,\n        direction: cfg.direction,\n        minEffect: cfg.minEffect,\n        pairedN: deltas.length,\n        preRegisteredId: manifest?.id,\n        metric: manifest?.metric,\n      }\n      const meanDelta =\n        deltas.length === 0 ? undefined : deltas.reduce((s, d) => s + d, 0) / deltas.length\n\n      if (last === undefined) {\n        return {\n          decision: 'need_more_work',\n          reasons: [`${name}: no paired holdout observations — nothing to test`],\n          contributingGates: [{ name, passed: false, detail }],\n        }\n      }\n      const decision =\n        last.decision === 'promote'\n          ? 'ship'\n          : last.decision === 'continue'\n            ? 'need_more_work'\n            : 'hold'\n      return {\n        decision,\n        reasons: [`${name}: ${last.reason}`],\n        contributingGates: [{ name, passed: decision === 'ship', detail }],\n        delta: meanDelta,\n      }\n    },\n  }\n}\n\nexport interface SequentialDecideOptions {\n  /** Type-I budget for the early-stop evidence. Default 0.05. */\n  alpha?: number\n  /** Minimum paired deltas before a stop may fire. Default 5. */\n  minN?: number\n  /** Bet truncation forwarded to `eProcess`. Default 0.5. */\n  maxBet?: number\n  /** Bound on |per-scenario composite delta|. Default 1. */\n  scale?: number\n}\n\nexport interface SequentialDecideFn {\n  (args: { history: GenerationRecord[] }): { stop: boolean; reason?: string }\n  /** Read-only snapshot of the accumulated e-process (observability + tests). */\n  state(): EProcessState\n}\n\n/**\n * `SurfaceProposer.decide` adapter — stops the optimization loop the moment\n * the e-process decides the loop has produced a real improvement, instead of\n * always running `maxGenerations`.\n *\n * Stream: for each generation g ≥ 1, the per-scenario composite deltas of\n * generation g's top candidate vs the generation-0 top candidate (the\n * incumbent the loop set out to beat), paired by scenarioId. H0: no proposed\n * surface improves any scenario's expected composite over the incumbent —\n * under it every delta has conditional mean ≤ 0 and the e-process is valid.\n * Once wealth ≥ 1/alpha the loop stops and hands the winner to the promotion\n * gate (which re-scores on HELD-OUT data — this adapter only spends the\n * exploration budget, it never promotes).\n *\n * Honesty caveats: (1) the incumbent's scores are measured once and shared\n * across all generations' deltas, so type-I control is exact only insofar as\n * those scores approximate the incumbent's true per-scenario means (more reps\n * → tighter); (2) an UNDECIDED process never stops the loop — absence of a\n * crossing is NOT evidence of no effect, so the loop simply runs its normal\n * course. Calling the adapter repeatedly with a growing history consumes each\n * generation exactly once (re-feeding an already-seen record would double-count\n * evidence).\n */\nexport function sequentialDecide(options: SequentialDecideOptions = {}): SequentialDecideFn {\n  const alpha = options.alpha ?? 0.05\n  const minN = options.minN ?? 5\n  const scale = options.scale ?? 1\n  if (!Number.isFinite(scale) || scale <= 0) {\n    throw new Error(`sequentialDecide: scale must be > 0, got ${scale}`)\n  }\n  const proc = eProcess({ alpha, maxBet: options.maxBet ?? 0.5, nullMean: 0.5 })\n  const threshold = 1 / alpha\n  let processedGenerations = 0\n  let reference: Map<string, number> | undefined\n  let stopped: { stop: true; reason: string } | undefined\n\n  const topCandidate = (record: GenerationRecord) => {\n    if (record.candidates.length === 0) {\n      throw new Error(\n        `sequentialDecide: generation ${record.generationIndex} has no candidates — ` +\n          'cannot extract a top candidate',\n      )\n    }\n    return record.candidates.reduce((best, c) => (c.composite > best.composite ? c : best))\n  }\n\n  const decide: SequentialDecideFn = ({ history }) => {\n    if (stopped) return stopped\n    if (history.length === 0) return { stop: false }\n    if (reference === undefined) {\n      reference = new Map(\n        topCandidate(history[0]!).scenarios.map((s) => [s.scenarioId, s.composite]),\n      )\n    }\n    // Consume only generations not yet seen; start at 1 — generation 0 IS the\n    // reference and would contribute all-zero deltas (pure wealth dilution).\n    for (let g = Math.max(1, processedGenerations); g < history.length; g++) {\n      const top = topCandidate(history[g]!)\n      const byScenario = new Map(top.scenarios.map((s) => [s.scenarioId, s.composite]))\n      for (const [scenarioId, refComposite] of reference) {\n        const candComposite = byScenario.get(scenarioId)\n        if (candComposite === undefined) {\n          throw new Error(\n            `sequentialDecide: generation ${history[g]!.generationIndex} top candidate is missing ` +\n              `scenario '${scenarioId}' — generations must score the same scenario set to pair`,\n          )\n        }\n        const delta = candComposite - refComposite\n        if (!Number.isFinite(delta) || Math.abs(delta) > scale) {\n          throw new Error(\n            `sequentialDecide: paired delta ${delta} outside ±scale=${scale} on scenario ` +\n              `'${scenarioId}' — pass the composite scale explicitly`,\n          )\n        }\n        const step = proc.update((delta / scale + 1) / 2)\n        if (step.n >= minN && step.wealth >= threshold) {\n          stopped = {\n            stop: true,\n            reason:\n              `sequential e-process decided at generation ${history[g]!.generationIndex}: ` +\n              `e-value ${step.wealth.toFixed(2)} ≥ 1/α=${threshold.toFixed(2)} after n=${step.n} ` +\n              'paired deltas vs the generation-0 incumbent — the improvement is real at ' +\n              `α=${alpha}; stop exploring and promote via the gate`,\n          }\n          processedGenerations = history.length\n          return stopped\n        }\n      }\n    }\n    processedGenerations = history.length\n    return { stop: false }\n  }\n  decide.state = () => proc.state()\n  return decide\n}\n","/**\n * Evidence grounding for reflective optimizers (GEPA-style revise loops).\n *\n * Two failure modes recur when an LLM revises an artifact from raw rollout\n * traces (first measured in agent-lab R358, where naive reflection REGRESSED\n * the score 0.375 -> 0.125 before these helpers fixed it):\n *\n * 1. The environment often hides WHY a rollout failed - a tool call can\n *    succeed while an invisible downstream check fails - so the reviser\n *    cannot see the cause in the transcript. The only reliable signal is the\n *    field-level difference between what passing and failing rollouts did.\n *    `rolloutArgumentDiff` computes that difference deterministically so the\n *    reviser is handed the diff instead of being trusted to derive it.\n *\n * 2. Revisers invent plausible-but-wrong literal values (\"use 'new'\",\n *    \"use 'sent'\") that no passing rollout ever used, turning every rollout\n *    into a failure. `classifyUngroundedLiterals` mechanically detects them,\n *    separating HARMFUL literals (ones failing rollouts actually used -\n *    proven damage) from benign illustrations (e.g. a name example like\n *    'Doe'), so callers can hard-reject the former and merely log the latter.\n *    Rejecting every ungrounded quoted word is too blunt: it killed a run\n *    over a surname illustration before the severity split existed.\n *\n * Pure data in, data out: no LLM calls, no filesystem, no domain knowledge.\n */\n\n/** One tool/action call observed in a rollout: a name plus its arguments. */\nexport interface RolloutCall {\n  readonly name: string\n  readonly args: Readonly<Record<string, unknown>>\n}\n\n/** A scored rollout: its calls plus the scalar outcome used to split pass/fail. */\nexport interface ScoredRollout {\n  /** Caller-meaningful identifier (task id, cell id) used only for reporting. */\n  readonly id: string\n  /** Scalar outcome in [0, 1]; `passThreshold` splits passing from failing. */\n  readonly score: number\n  readonly calls: readonly RolloutCall[]\n}\n\nexport interface RolloutArgumentDiffOptions {\n  /** Rollouts with `score >= passThreshold` count as passing. Default 1. */\n  readonly passThreshold?: number\n  /** Max distinct values listed per field per side in the rendered text. Default 4. */\n  readonly maxValuesPerField?: number\n}\n\nexport interface RolloutArgumentDiff {\n  /** Human/LLM-readable per-field diff, one line per field. */\n  readonly text: string\n  /** Lowercased stringified argument values seen in passing rollouts. */\n  readonly passingValues: ReadonlySet<string>\n  /** Lowercased stringified argument values seen in failing rollouts. */\n  readonly failingValues: ReadonlySet<string>\n}\n\n/**\n * Deterministic per-field diff of call arguments between passing and failing\n * rollouts. A field set by failing rollouts but left unset by passing ones is\n * the classic poison-input signature; a field whose values differ across the\n * split points at the correct value. Feed `text` to the reviser verbatim.\n */\nexport function rolloutArgumentDiff(\n  rollouts: readonly ScoredRollout[],\n  opts: RolloutArgumentDiffOptions = {},\n): RolloutArgumentDiff {\n  const passThreshold = opts.passThreshold ?? 1\n  const maxValues = opts.maxValuesPerField ?? 4\n  const collect = (pass: boolean): Map<string, Set<string>> => {\n    const byField = new Map<string, Set<string>>()\n    for (const r of rollouts) {\n      if (pass !== r.score >= passThreshold) continue\n      for (const c of r.calls) {\n        for (const [k, v] of Object.entries(c.args)) {\n          const set = byField.get(k) ?? new Set<string>()\n          set.add(String(v))\n          byField.set(k, set)\n        }\n      }\n    }\n    return byField\n  }\n  const passing = collect(true)\n  const failing = collect(false)\n  const lines: string[] = []\n  for (const field of new Set([...passing.keys(), ...failing.keys()])) {\n    const pv = [...(passing.get(field) ?? [])].slice(0, maxValues)\n    const fv = [...(failing.get(field) ?? [])].slice(0, maxValues)\n    const render = (vals: string[]) => (vals.length ? JSON.stringify(vals) : 'NOT SET (omitted)')\n    lines.push(`  ${field}: passing runs -> ${render(pv)} | failing runs -> ${render(fv)}`)\n  }\n  const lower = (m: Map<string, Set<string>>): Set<string> => {\n    const out = new Set<string>()\n    for (const vals of m.values()) for (const v of vals) out.add(v.toLowerCase())\n    return out\n  }\n  return {\n    text: lines.join('\\n') || '  (no calls observed)',\n    passingValues: lower(passing),\n    failingValues: lower(failing),\n  }\n}\n\nexport interface UngroundedLiteralReport {\n  /** Quoted single-word literals in the text that no passing rollout used. */\n  readonly ungrounded: readonly string[]\n  /** The subset failing rollouts actually used - prescribing these is proven harmful. */\n  readonly harmful: readonly string[]\n}\n\n/**\n * Scan revised artifact text for single-quoted single-word literals (the\n * \"use exactly 'new'\" pattern) that appear in no passing rollout's argument\n * values. Multi-word quotes pass (they are prose, not prescriptions).\n * Callers should reject on `harmful` (with a bounded retry) and at most log\n * `ungrounded` - see the module header for why the severities differ.\n */\nexport function classifyUngroundedLiterals(\n  text: string,\n  diff: Pick<RolloutArgumentDiff, 'passingValues' | 'failingValues'>,\n): UngroundedLiteralReport {\n  const ungrounded = new Set<string>()\n  for (const m of text.matchAll(/'([a-z][a-z_-]{1,19})'/gi)) {\n    const w = (m[1] as string).toLowerCase()\n    if (!diff.passingValues.has(w)) ungrounded.add(w)\n  }\n  const all = [...ungrounded]\n  return {\n    ungrounded: all,\n    harmful: all.filter((w) => diff.failingValues.has(w)),\n  }\n}\n","/**\n * Filesystem `LabeledScenarioStore` adapter. The default capture sink for\n * traces + eval artifacts. Production deployments typically swap for a\n * Turso/SQLite adapter (same interface).\n *\n * Records land as one JSONL file per source under `<root>/<source>.jsonl`.\n * Each line is a `LabeledScenarioRecord`. Append-only — no in-place edits.\n *\n * Safety properties enforced at write-time:\n *\n *   - **Provenance required**: writes without `source`, `sourceVersionHash`,\n *     `capturedAt`, `redactionStatus` are rejected. Closes the alignment\n *     reviewer's data-poisoning gap.\n *   - **Per-source rate limits**: optional `rateLimitBucket` + `maxWritesPerMinute`\n *     stops a single tenant/source from flooding the store.\n *\n * Safety properties enforced at sample-time:\n *\n *   - **Required split + capturedBefore**: substrate refuses to sample without\n *     an explicit `split` ('train' | 'test') AND a temporal cutoff. Eliminates\n *     accidental train/test contamination.\n *   - **Default training-source filter**: when the store is sampled with\n *     `split: 'train'`, production-trace records are EXCLUDED unless the\n *     caller passes `filter.source: 'production-trace'` explicitly. Closes\n *     the contamination-by-default gap flagged by the senior eval engineer.\n */\n\nimport { createHash } from 'node:crypto'\nimport { existsSync, mkdirSync, readFileSync, writeFileSync } from 'node:fs'\nimport { join } from 'node:path'\nimport type {\n  LabeledScenarioRecord,\n  LabeledScenarioSampleArgs,\n  LabeledScenarioSource,\n  LabeledScenarioStore,\n  LabeledScenarioWrite,\n  LabelTrust,\n} from '../types'\nimport { labelTrustRank } from '../types'\n\nexport interface FsLabeledScenarioStoreOptions {\n  /** Root directory for JSONL files. Created if missing. */\n  root: string\n  /** Per-source rate limit. When set, writes exceeding the cap are rejected\n   *  with a typed error. Default: no limit. */\n  maxWritesPerMinutePerBucket?: number\n  /** Test seam — override `Date.now()` for deterministic tests. */\n  now?: () => number\n}\n\n/** Typed rejection from a labeled-scenario store (bad provenance, rate limit, invalid sample args) — carries a stable string `code`. */\nexport class LabeledScenarioStoreError extends Error {\n  constructor(\n    public readonly code: string,\n    message: string,\n  ) {\n    super(message)\n    this.name = 'LabeledScenarioStoreError'\n  }\n}\n\ninterface RateLimitState {\n  bucket: string\n  windowStartMs: number\n  count: number\n}\n\n/**\n * Filesystem `LabeledScenarioStore`: appends one JSONL file per source with provenance and\n * rate-limit guards. For tests, local dev, and small workloads — high-throughput lands in Turso.\n */\nexport class FsLabeledScenarioStore implements LabeledScenarioStore {\n  private readonly now: () => number\n  private readonly rateLimits = new Map<string, RateLimitState>()\n\n  constructor(private readonly options: FsLabeledScenarioStoreOptions) {\n    if (!existsSync(options.root)) mkdirSync(options.root, { recursive: true })\n    this.now = options.now ?? Date.now\n  }\n\n  async observe(write: LabeledScenarioWrite): Promise<void> {\n    this.assertProvenance(write)\n    this.assertRateLimit(write)\n    const record = this.toRecord(write)\n    const path = this.pathForSource(write.source)\n    const line = `${JSON.stringify(record)}\\n`\n    // Append atomically. For high-throughput a writev-friendly buffered\n    // implementation lands in the Turso adapter; FS adapter is for tests +\n    // local dev + small workloads.\n    appendLine(path, line)\n  }\n\n  async sample(args: LabeledScenarioSampleArgs): Promise<LabeledScenarioRecord[]> {\n    if (!args.split) {\n      throw new LabeledScenarioStoreError(\n        'split_required',\n        'sample() requires an explicit `split` (train | test) — substrate refuses ambiguous reads',\n      )\n    }\n    if (!args.capturedBefore) {\n      throw new LabeledScenarioStoreError(\n        'capturedBefore_required',\n        'sample() requires an explicit `capturedBefore` timestamp for temporal-split discipline',\n      )\n    }\n\n    const all: LabeledScenarioRecord[] = []\n    for (const source of ALL_SOURCES) {\n      // Default training-source filter: when sampling train, EXCLUDE\n      // production-trace records unless the caller asks for them.\n      if (args.split === 'train' && source === 'production-trace') {\n        const explicit = sourceFilterContains(args.filter?.source, 'production-trace')\n        if (!explicit) continue\n      }\n      const path = this.pathForSource(source)\n      if (!existsSync(path)) continue\n      const lines = readFileSync(path, 'utf8').split('\\n').filter(Boolean)\n      for (const line of lines) {\n        let record: LabeledScenarioRecord\n        try {\n          record = JSON.parse(line) as LabeledScenarioRecord\n        } catch {\n          continue\n        }\n        if (!matchesFilter(record, args, source)) continue\n        all.push(record)\n      }\n    }\n\n    // Deterministic order: by capturedAt ascending, then recordHash.\n    all.sort((a, b) => {\n      if (a.capturedAt !== b.capturedAt) return a.capturedAt.localeCompare(b.capturedAt)\n      return a.recordHash.localeCompare(b.recordHash)\n    })\n\n    return all.slice(0, args.count)\n  }\n\n  async size(): Promise<{\n    train: number\n    test: number\n    bySource: Record<string, number>\n    byTrust: Record<LabelTrust, number>\n  }> {\n    const bySource: Record<string, number> = {}\n    const byTrust: Record<LabelTrust, number> = {\n      unverified: 0,\n      'verified-signal': 0,\n      'human-rated': 0,\n    }\n    let total = 0\n    for (const source of ALL_SOURCES) {\n      const path = this.pathForSource(source)\n      if (!existsSync(path)) {\n        bySource[source] = 0\n        continue\n      }\n      const lines = readFileSync(path, 'utf8').split('\\n').filter(Boolean)\n      bySource[source] = lines.length\n      total += lines.length\n      for (const line of lines) {\n        let trust: LabelTrust = 'unverified'\n        try {\n          trust = (JSON.parse(line) as LabeledScenarioRecord).labelTrust ?? 'unverified'\n        } catch {\n          // A malformed line counts as unverified — never silently gold.\n        }\n        byTrust[trust] += 1\n      }\n    }\n    // FS adapter doesn't track split assignments per-record (split is\n    // computed at sample-time based on `capturedBefore`). For size(), we\n    // report `train`+`test` as the same total — split is a sampling concept.\n    return { train: total, test: total, bySource, byTrust }\n  }\n\n  private assertProvenance(write: LabeledScenarioWrite): void {\n    if (!write.source) {\n      throw new LabeledScenarioStoreError(\n        'missing_source',\n        'LabeledScenarioWrite requires `source`',\n      )\n    }\n    if (!write.sourceVersionHash || write.sourceVersionHash.length === 0) {\n      throw new LabeledScenarioStoreError(\n        'missing_source_version',\n        'LabeledScenarioWrite requires `sourceVersionHash` (git sha or substrate version)',\n      )\n    }\n    if (!write.capturedAt) {\n      throw new LabeledScenarioStoreError(\n        'missing_captured_at',\n        'LabeledScenarioWrite requires `capturedAt` ISO timestamp',\n      )\n    }\n    if (!write.redactionStatus) {\n      throw new LabeledScenarioStoreError(\n        'missing_redaction_status',\n        'LabeledScenarioWrite requires explicit `redactionStatus` — raw / redacted-pii / redacted-secrets / fully-redacted',\n      )\n    }\n    if (!ALL_SOURCES.includes(write.source)) {\n      throw new LabeledScenarioStoreError(\n        'unknown_source',\n        `LabeledScenarioWrite.source must be one of: ${ALL_SOURCES.join(', ')}`,\n      )\n    }\n  }\n\n  private assertRateLimit(write: LabeledScenarioWrite): void {\n    const cap = this.options.maxWritesPerMinutePerBucket\n    if (!cap || !write.rateLimitBucket) return\n    const now = this.now()\n    const windowMs = 60_000\n    let state = this.rateLimits.get(write.rateLimitBucket)\n    if (!state || now - state.windowStartMs >= windowMs) {\n      state = { bucket: write.rateLimitBucket, windowStartMs: now, count: 0 }\n      this.rateLimits.set(write.rateLimitBucket, state)\n    }\n    if (state.count >= cap) {\n      throw new LabeledScenarioStoreError(\n        'rate_limit_exceeded',\n        `LabeledScenarioStore: bucket ${write.rateLimitBucket} exceeded ${cap} writes/min`,\n      )\n    }\n    state.count += 1\n  }\n\n  private toRecord(write: LabeledScenarioWrite): LabeledScenarioRecord {\n    const recordHash = sha256(\n      JSON.stringify({\n        id: write.scenario.id,\n        src: write.source,\n        at: write.capturedAt,\n        ver: write.sourceVersionHash,\n      }),\n    )\n    // FS adapter assigns split at sample-time, but we cache a hint here\n    // based on capturedAt vs the world's \"now\" — sampler overrides this.\n    return {\n      ...write,\n      recordHash,\n      split: 'train',\n    }\n  }\n\n  private pathForSource(source: string): string {\n    return join(this.options.root, `${source}.jsonl`)\n  }\n}\n\nconst ALL_SOURCES: LabeledScenarioWrite['source'][] = [\n  'production-trace',\n  'eval-run',\n  'manual',\n  'red-team',\n  'synthetic',\n]\n\nfunction sourceFilterContains(\n  filter: LabeledScenarioSource | LabeledScenarioSource[] | undefined,\n  needle: LabeledScenarioSource,\n): boolean {\n  if (!filter) return false\n  if (Array.isArray(filter)) return filter.includes(needle)\n  return filter === needle\n}\n\nfunction matchesFilter(\n  record: LabeledScenarioRecord,\n  args: LabeledScenarioSampleArgs,\n  source: string,\n): boolean {\n  // Temporal cutoff — train must be capturedAt < capturedBefore.\n  if (args.split === 'train' && record.capturedAt >= args.capturedBefore) return false\n  if (args.split === 'test' && record.capturedAt < args.capturedBefore) return false\n\n  const f = args.filter\n  if (!f) return true\n  if (f.kind && record.scenario.kind !== f.kind) return false\n  if (f.source) {\n    const sources = Array.isArray(f.source) ? f.source : [f.source]\n    if (!sources.includes(source as never)) return false\n  }\n  if (f.minComposite !== undefined || f.maxComposite !== undefined) {\n    const composites = Object.values(record.judgeScores).map((s) => s.composite)\n    const max = composites.length === 0 ? 0 : Math.max(...composites)\n    if (f.minComposite !== undefined && max < f.minComposite) return false\n    if (f.maxComposite !== undefined && max > f.maxComposite) return false\n  }\n  if (f.minTrust !== undefined && labelTrustRank(record.labelTrust) < labelTrustRank(f.minTrust)) {\n    return false\n  }\n  return true\n}\n\nfunction sha256(input: string): string {\n  return createHash('sha256').update(input).digest('hex').slice(0, 16)\n}\n\nfunction appendLine(path: string, line: string): void {\n  if (existsSync(path)) {\n    const existing = readFileSync(path, 'utf8')\n    writeFileSync(path, existing + line)\n  } else {\n    writeFileSync(path, line)\n  }\n}\n","/**\n * @module\n * Footprint-matched neutralization — the placebo control for content-vs-footprint\n * attribution in a promotion gate.\n *\n * A promoted surface can raise a held-out score two different ways:\n *  1. its CONTENT is informative (the thing we want to promote), or\n *  2. it merely added prompt/mount FOOTPRINT — more bytes, more lines, a longer\n *     more authoritative-looking prompt — that the model spends attention on\n *     regardless of what the bytes say.\n *\n * A held-out gate proves the candidate beat baseline; it cannot separate (1) from\n * (2). `neutralizeText` produces a variant that keeps the input's layout and\n * length while carrying ZERO information, so scoring it isolates the footprint\n * contribution (2). Feed the neutralized variant's scores to `neutralizationGate`:\n * any lift it still holds over baseline is decorative, and a candidate whose lift\n * survives neutralization is rejected however large its raw lift.\n */\n\n/** Filler for blanked content. A single ASCII byte, so a run of it preserves an\n *  ASCII source's exact byte length; for multibyte sources it preserves CHARACTER\n *  count and layout (what the tokenizer footprint tracks), not raw byte count. */\nconst FILLER = '#'\n\n/**\n * Blank every non-whitespace character to a 1-byte filler while preserving all\n * whitespace. Line count, indentation, and word/line lengths are unchanged — so\n * the neutralized variant has the same layout and (for ASCII) the same byte\n * footprint as the input, but no readable content. Whitespace is preserved\n * deliberately: collapsing it would change the token structure and stop the\n * variant from being a true footprint match.\n */\nexport function neutralizeText(content: string): string {\n  return content.replace(/\\S/g, FILLER)\n}\n","/**\n * FAPO (Fully Autonomous Prompt Optimization) is an orchestration policy, not\n * a new prompt mutation primitive. The paper's loop evaluates an inspectable\n * workflow, attributes failures to an edit level, proposes ONE scoped change,\n * reviews it, measures it, and escalates from prompt -> parameters -> structure\n * only when prompt-level search is exhausted and attribution supports the\n * higher-cost edit.\n *\n * This substrate proposer encodes that policy while keeping the edit generators\n * pluggable:\n *   - prompt: usually `gepaProposer`, `skillOptProposer`, or a runtime reflective proposer\n *   - parameter: `parameterSweepProposer` or a caller-supplied config proposer\n *   - structural: a caller-supplied code/worktree proposer from agent-runtime\n *\n * It deliberately does not import Claude Code, LangGraph, or Cisco's tenant\n * runtime. agent-eval owns measurement and proposer contracts; runtime-shaped\n * code generation stays downstream.\n *\n * Grounded sources:\n *   - Kassianik et al., \"FAPO: Fully Autonomous Prompt Optimization of\n *     Multi-Step LLM Pipelines\", arXiv:2606.19605v1.\n *   - cisco-foundation-ai/fully-automated-prompt-optimization at\n *     376b50c57d5e2423e5a5de46e0d315a761d272d8.\n */\n\nimport type {\n  GenerationCandidate,\n  GenerationRecord,\n  MutableSurface,\n  ProposeContext,\n  ProposedCandidate,\n  SurfaceProposer,\n} from '../types'\nimport { isProposedCandidate } from '../types'\n\nexport type FapoOptimizationLevel = 'prompt' | 'parameter' | 'structural'\n\nconst FAPO_LEVELS: readonly FapoOptimizationLevel[] = ['prompt', 'parameter', 'structural']\nconst MAX_FINDING_DEPTH = 16\nconst UNSAFE_JSON_KEYS = new Set(['__proto__', 'prototype', 'constructor'])\n\nexport interface FapoScopeContract {\n  /** Levels the tenant/playbook allows. Defaults to the levels with proposers. */\n  allowedLevels?: readonly FapoOptimizationLevel[]\n  /** Explicitly forbidden levels; wins over `allowedLevels`. */\n  forbiddenLevels?: readonly FapoOptimizationLevel[]\n}\n\nexport interface FapoFailureCluster {\n  label: string\n  level: FapoOptimizationLevel\n  count: number\n  confidence?: 'high' | 'medium' | 'low'\n  suggestedFix?: string\n  caseIds?: string[]\n}\n\nexport interface FapoAttributionSignals {\n  counts: Record<FapoOptimizationLevel, number>\n  clusters: FapoFailureCluster[]\n}\n\nexport interface FapoReviewIssue {\n  checkName: string\n  severity: 'block' | 'warn'\n  description: string\n  location?: string\n}\n\nexport interface FapoReviewResult {\n  verdict: 'pass' | 'warn' | 'fail'\n  issues?: FapoReviewIssue[]\n  suggestions?: string[]\n}\n\nexport interface FapoReviewInput<TFindings = unknown> {\n  level: FapoOptimizationLevel\n  candidate: ProposedCandidate\n  context: ProposeContext<TFindings>\n  reason: string\n}\n\nexport interface FapoProposerOptions<TFindings = unknown> {\n  /** Level-specific candidate proposers. At least one is required. */\n  proposers?: Partial<Record<FapoOptimizationLevel, SurfaceProposer<TFindings>>>\n  /** Convenience aliases for `proposers.<level>`. */\n  promptProposer?: SurfaceProposer<TFindings>\n  parameterProposer?: SurfaceProposer<TFindings>\n  structuralProposer?: SurfaceProposer<TFindings>\n  /** Tenant/playbook-derived allowed and forbidden edit levels. */\n  scope?: FapoScopeContract\n  /**\n   * Independent reviewer hook. Return `fail` to block a candidate before eval,\n   * mirroring FAPO's variant-reviewer phase.\n   */\n  reviewCandidate?: (input: FapoReviewInput<TFindings>) => Promise<FapoReviewResult>\n  /**\n   * FAPO proposes one scoped change per cycle. Keep this at 1 unless you are\n   * intentionally relaxing the paper loop for a batch experiment.\n   */\n  proposalsPerCycle?: number\n  /** Consecutive non-improving variants required before a level is exhausted. Default 3. */\n  plateauWindow?: number\n  /** Distinct strategies required before declaring a plateau. Default 3. */\n  minDistinctStrategies?: number\n  /** Candidate score delta needed to count as an improvement. Default 0. */\n  minImprovement?: number\n  /** Paper-faithful default: try prompt edits before escalating. */\n  promptFirst?: boolean\n  /** Paper-faithful default: try parameter/config edits before structural code edits. */\n  parameterBeforeStructural?: boolean\n}\n\ninterface FapoAttempt {\n  level: FapoOptimizationLevel\n  composite: number\n  strategy: string\n}\n\ninterface FapoPolicyState {\n  attempts: FapoAttempt[]\n  exhausted: Record<FapoOptimizationLevel, boolean>\n  signals: FapoAttributionSignals\n}\n\n/** Build a FAPO policy proposer from level-specific candidate generators. */\nexport function fapoProposer<TFindings = unknown>(\n  opts: FapoProposerOptions<TFindings>,\n): SurfaceProposer<TFindings> {\n  const proposers = levelProposers(opts)\n  const allowed = allowedLevels(opts, proposers)\n  const plateauWindow = opts.plateauWindow ?? 3\n  const minDistinctStrategies = opts.minDistinctStrategies ?? 3\n  const minImprovement = opts.minImprovement ?? 0\n  const proposalsPerCycle = opts.proposalsPerCycle ?? 1\n\n  if (allowed.length === 0) {\n    throw new Error('fapoProposer: at least one allowed level must have a proposer')\n  }\n  if (plateauWindow < 1) throw new Error('fapoProposer: plateauWindow must be >= 1')\n  if (minDistinctStrategies < 1) {\n    throw new Error('fapoProposer: minDistinctStrategies must be >= 1')\n  }\n  if (proposalsPerCycle < 1) throw new Error('fapoProposer: proposalsPerCycle must be >= 1')\n\n  return {\n    kind: 'fapo',\n    async propose(ctx: ProposeContext<TFindings>): Promise<ProposedCandidate[]> {\n      const state = policyState(ctx.history, ctx.findings, {\n        plateauWindow,\n        minDistinctStrategies,\n        minImprovement,\n      })\n      const decision = chooseLevel({\n        allowed,\n        available: allowed.filter((level) => !state.exhausted[level]),\n        proposers,\n        state,\n        promptFirst: opts.promptFirst ?? true,\n        parameterBeforeStructural: opts.parameterBeforeStructural ?? true,\n      })\n      if (!decision) return []\n\n      const proposer = proposers[decision.level]\n      if (!proposer) {\n        throw new Error(`fapoProposer: selected ${decision.level} but no proposer is configured`)\n      }\n\n      const requested = Math.min(ctx.populationSize, proposalsPerCycle)\n      const raw = await proposer.propose({ ...ctx, populationSize: requested })\n      const wrapped = raw\n        .map((candidate) => normalizeProposal(candidate))\n        .map((candidate) => wrapProposal(candidate, decision.level, decision.reason))\n\n      const reviewed: ProposedCandidate[] = []\n      for (const candidate of wrapped) {\n        const review = opts.reviewCandidate\n          ? await opts.reviewCandidate({\n              level: decision.level,\n              candidate,\n              context: ctx,\n              reason: decision.reason,\n            })\n          : { verdict: 'pass' as const }\n        if (review.verdict === 'fail') continue\n        const warn = review.verdict === 'warn' ? renderReviewWarnings(review) : ''\n        reviewed.push(\n          warn ? { ...candidate, rationale: `${candidate.rationale}\\n${warn}` } : candidate,\n        )\n      }\n\n      if (wrapped.length > 0 && reviewed.length === 0) {\n        throw new Error(\n          `fapoProposer: reviewer blocked every ${decision.level} candidate; refusing to evaluate an unreviewed variant`,\n        )\n      }\n      return reviewed\n    },\n    decide({ history }) {\n      const last = history[history.length - 1]\n      if (last && last.candidates.length === 0) {\n        return { stop: true, reason: 'FAPO produced no scoped candidate in the prior generation' }\n      }\n      const state = policyState(history, [], {\n        plateauWindow,\n        minDistinctStrategies,\n        minImprovement,\n      })\n      const everyAllowedLevelExhausted = allowed.every((level) => state.exhausted[level])\n      return everyAllowedLevelExhausted\n        ? { stop: true, reason: `all FAPO levels exhausted (${allowed.join(', ')})` }\n        : { stop: false }\n    },\n  }\n}\n\nfunction levelProposers<TFindings>(\n  opts: FapoProposerOptions<TFindings>,\n): Partial<Record<FapoOptimizationLevel, SurfaceProposer<TFindings>>> {\n  return {\n    ...(opts.proposers ?? {}),\n    ...(opts.promptProposer ? { prompt: opts.promptProposer } : {}),\n    ...(opts.parameterProposer ? { parameter: opts.parameterProposer } : {}),\n    ...(opts.structuralProposer ? { structural: opts.structuralProposer } : {}),\n  }\n}\n\nfunction allowedLevels<TFindings>(\n  opts: FapoProposerOptions<TFindings>,\n  proposers: Partial<Record<FapoOptimizationLevel, SurfaceProposer<TFindings>>>,\n): FapoOptimizationLevel[] {\n  const explicit = opts.scope?.allowedLevels\n  const forbidden = new Set(opts.scope?.forbiddenLevels ?? [])\n  return FAPO_LEVELS.filter((level) => {\n    if (!proposers[level]) return false\n    if (forbidden.has(level)) return false\n    return explicit ? explicit.includes(level) : true\n  })\n}\n\nfunction policyState(\n  history: readonly GenerationRecord[],\n  findings: readonly unknown[],\n  opts: { plateauWindow: number; minDistinctStrategies: number; minImprovement: number },\n): FapoPolicyState {\n  const attempts = extractAttempts(history)\n  return {\n    attempts,\n    exhausted: {\n      prompt: isLevelExhausted('prompt', attempts, opts),\n      parameter: isLevelExhausted('parameter', attempts, opts),\n      structural: isLevelExhausted('structural', attempts, opts),\n    },\n    signals: extractFapoAttributionSignals(findings),\n  }\n}\n\nfunction extractAttempts(history: readonly GenerationRecord[]): FapoAttempt[] {\n  const attempts: FapoAttempt[] = []\n  for (const generation of history) {\n    for (const candidate of generation.candidates) {\n      const level = candidateLevel(candidate)\n      if (!level) continue\n      attempts.push({\n        level,\n        composite: candidate.composite,\n        strategy: candidateStrategy(candidate),\n      })\n    }\n  }\n  return attempts\n}\n\nfunction candidateLevel(candidate: GenerationCandidate): FapoOptimizationLevel | null {\n  const label = candidate.label ?? ''\n  const rationale = candidate.rationale ?? ''\n  return parseLevel(label) ?? parseLevel(rationale)\n}\n\nfunction parseLevel(text: string): FapoOptimizationLevel | null {\n  const match = /\\bfapo:(prompt|parameter|structural)\\b/.exec(text)\n  return match ? (match[1] as FapoOptimizationLevel) : null\n}\n\nfunction candidateStrategy(candidate: GenerationCandidate): string {\n  const label = candidate.label ?? candidate.rationale ?? candidate.surfaceHash\n  return (\n    label.replace(/\\bfapo:(prompt|parameter|structural):?/g, '').trim() || candidate.surfaceHash\n  )\n}\n\nfunction isLevelExhausted(\n  level: FapoOptimizationLevel,\n  attempts: readonly FapoAttempt[],\n  opts: { plateauWindow: number; minDistinctStrategies: number; minImprovement: number },\n): boolean {\n  const own = attempts.filter((attempt) => attempt.level === level)\n  if (own.length < opts.plateauWindow) return false\n  const distinctStrategies = new Set(own.map((attempt) => attempt.strategy)).size\n  if (distinctStrategies < opts.minDistinctStrategies) return false\n\n  let best = Number.NEGATIVE_INFINITY\n  let nonImproving = 0\n  for (const attempt of own) {\n    if (attempt.composite > best + opts.minImprovement) {\n      best = attempt.composite\n      nonImproving = 0\n    } else {\n      nonImproving += 1\n    }\n  }\n  return nonImproving >= opts.plateauWindow\n}\n\nfunction chooseLevel<TFindings>(args: {\n  allowed: readonly FapoOptimizationLevel[]\n  available: readonly FapoOptimizationLevel[]\n  proposers: Partial<Record<FapoOptimizationLevel, SurfaceProposer<TFindings>>>\n  state: FapoPolicyState\n  promptFirst: boolean\n  parameterBeforeStructural: boolean\n}): { level: FapoOptimizationLevel; reason: string } | null {\n  const { available, state } = args\n  if (available.length === 0) return null\n\n  const triedPrompt = state.attempts.some((attempt) => attempt.level === 'prompt')\n  if (args.promptFirst && available.includes('prompt') && !triedPrompt) {\n    return {\n      level: 'prompt',\n      reason: 'prompt-first policy: no prompt-level variant has been tried yet',\n    }\n  }\n\n  const supported = available.filter((level) => state.signals.counts[level] > 0)\n  if (supported.includes('prompt')) {\n    return {\n      level: 'prompt',\n      reason: `attribution has ${state.signals.counts.prompt} prompt-addressable failure(s)`,\n    }\n  }\n\n  const strongest = supported.sort(\n    (a, b) => state.signals.counts[b] - state.signals.counts[a] || levelRank(a) - levelRank(b),\n  )[0]\n  if (strongest) {\n    if (\n      strongest === 'structural' &&\n      args.parameterBeforeStructural &&\n      available.includes('parameter') &&\n      args.proposers.parameter\n    ) {\n      return {\n        level: 'parameter',\n        reason:\n          'attribution indicates a non-prompt bottleneck; trying parameter/config edits before structural edits',\n      }\n    }\n    return {\n      level: strongest,\n      reason: `attribution has ${state.signals.counts[strongest]} ${strongest}-addressable failure(s)`,\n    }\n  }\n\n  // No usable attribution yet. FAPO can still start at the cheapest allowed\n  // level, but it should not silently jump to structure after prompt exhausts.\n  if (state.attempts.length === 0) {\n    const first = available.slice().sort((a, b) => levelRank(a) - levelRank(b))[0]!\n    return { level: first, reason: 'no attribution yet; starting at the cheapest allowed level' }\n  }\n  return null\n}\n\nfunction levelRank(level: FapoOptimizationLevel): number {\n  return level === 'prompt' ? 0 : level === 'parameter' ? 1 : 2\n}\n\nfunction normalizeProposal(value: MutableSurface | ProposedCandidate): ProposedCandidate {\n  return isProposedCandidate(value)\n    ? value\n    : { surface: value, label: 'candidate', rationale: 'bare candidate from level proposer' }\n}\n\nfunction wrapProposal(\n  candidate: ProposedCandidate,\n  level: FapoOptimizationLevel,\n  reason: string,\n): ProposedCandidate {\n  const label = candidate.label ? `fapo:${level}:${candidate.label}` : `fapo:${level}`\n  return {\n    ...candidate,\n    label,\n    rationale: [\n      `fapo:${level} selected by reviewed escalation policy`,\n      `Reason: ${reason}`,\n      candidate.rationale ? `Level proposer rationale: ${candidate.rationale}` : '',\n    ]\n      .filter(Boolean)\n      .join('\\n'),\n  }\n}\n\nfunction renderReviewWarnings(review: FapoReviewResult): string {\n  const issues = review.issues?.filter((issue) => issue.severity === 'warn') ?? []\n  if (issues.length === 0) return ''\n  return `Reviewer warnings:\\n${issues.map((issue) => `- ${issue.checkName}: ${issue.description}`).join('\\n')}`\n}\n\n/**\n * Scan a findings array and extract FAPO attribution signals — per-level counts and failure clusters used to decide which optimization level to escalate to next.\n */\nexport function extractFapoAttributionSignals(\n  findings: readonly unknown[],\n): FapoAttributionSignals {\n  const signals: FapoAttributionSignals = {\n    counts: { prompt: 0, parameter: 0, structural: 0 },\n    clusters: [],\n  }\n  const seen = new WeakSet<object>()\n  for (const finding of findings) {\n    collectFinding(signals, finding, seen, 0)\n  }\n  return signals\n}\n\nfunction collectFinding(\n  signals: FapoAttributionSignals,\n  finding: unknown,\n  seen: WeakSet<object>,\n  depth: number,\n): void {\n  if (depth > MAX_FINDING_DEPTH) return\n  if (!finding) return\n  if (typeof finding === 'string') {\n    const level = inferLevelFromText(finding)\n    if (level) addCluster(signals, { label: finding, level, count: 1 })\n    return\n  }\n  if (Array.isArray(finding)) {\n    if (seen.has(finding)) return\n    seen.add(finding)\n    for (const item of finding) collectFinding(signals, item, seen, depth + 1)\n    return\n  }\n  if (typeof finding !== 'object') return\n  if (seen.has(finding)) return\n  seen.add(finding)\n  const obj = finding as Record<string, unknown>\n\n  collectLevelPartition(signals, obj.level_partition ?? obj.levelPartition, seen, depth + 1)\n  collectCounts(signals, obj)\n  collectClusters(signals, obj.clusters, true, seen, depth + 1)\n\n  const explicit = parseFindingLevel(obj.level ?? obj.optimization_level ?? obj.optimizationLevel)\n  const text = textFields(obj)\n  const inferred = explicit ?? inferLevelFromText(text)\n  if (inferred) {\n    addCluster(signals, {\n      label: text || inferred,\n      level: inferred,\n      count: numberField(obj.count) ?? 1,\n      confidence: confidenceField(obj.confidence),\n      suggestedFix: stringField(obj.suggested_fix ?? obj.suggestedFix ?? obj.recommended_action),\n      caseIds: stringArrayField(obj.case_ids ?? obj.caseIds),\n    })\n  }\n}\n\nfunction collectLevelPartition(\n  signals: FapoAttributionSignals,\n  raw: unknown,\n  seen: WeakSet<object>,\n  depth: number,\n): void {\n  if (!raw || typeof raw !== 'object') return\n  if (seen.has(raw)) return\n  seen.add(raw)\n  const partition = raw as Record<string, unknown>\n  for (const level of FAPO_LEVELS) {\n    const bucket = partition[level]\n    if (!bucket || typeof bucket !== 'object') continue\n    const obj = bucket as Record<string, unknown>\n    const count = numberField(obj.count) ?? 0\n    if (count > 0) signals.counts[level] += count\n    collectClusters(signals, obj.clusters, false, seen, depth + 1)\n  }\n}\n\nfunction collectCounts(signals: FapoAttributionSignals, obj: Record<string, unknown>): void {\n  const prompt = numberField(obj.prompt_addressable ?? obj.promptAddressable)\n  const structural = numberField(obj.structural_addressable ?? obj.structuralAddressable)\n  const tool = numberField(obj.tool_addressable ?? obj.toolAddressable)\n  if (prompt) signals.counts.prompt += prompt\n  if (structural) signals.counts.structural += structural\n  if (tool) signals.counts.structural += tool\n}\n\nfunction collectClusters(\n  signals: FapoAttributionSignals,\n  raw: unknown,\n  countClusters: boolean,\n  seen: WeakSet<object>,\n  depth: number,\n): void {\n  if (!Array.isArray(raw)) return\n  if (seen.has(raw)) return\n  seen.add(raw)\n  for (const item of raw) {\n    if (countClusters) {\n      collectFinding(signals, item, seen, depth + 1)\n      continue\n    }\n    const cluster = parseCluster(item)\n    if (cluster) signals.clusters.push(cluster)\n  }\n}\n\nfunction addCluster(signals: FapoAttributionSignals, cluster: FapoFailureCluster): void {\n  signals.counts[cluster.level] += Math.max(1, cluster.count)\n  signals.clusters.push(cluster)\n}\n\nfunction parseCluster(raw: unknown): FapoFailureCluster | null {\n  if (!raw || typeof raw !== 'object') return null\n  const obj = raw as Record<string, unknown>\n  const text = textFields(obj)\n  const level =\n    parseFindingLevel(obj.level ?? obj.optimization_level ?? obj.optimizationLevel) ??\n    inferLevelFromText(text)\n  if (!level) return null\n  return {\n    label: text || level,\n    level,\n    count: numberField(obj.count) ?? 1,\n    confidence: confidenceField(obj.confidence),\n    suggestedFix: stringField(obj.suggested_fix ?? obj.suggestedFix ?? obj.recommended_action),\n    caseIds: stringArrayField(obj.case_ids ?? obj.caseIds),\n  }\n}\n\nfunction parseFindingLevel(raw: unknown): FapoOptimizationLevel | null {\n  if (typeof raw !== 'string') return null\n  const lower = raw.toLowerCase()\n  if (lower === 'prompt' || lower === 'parameter' || lower === 'structural') return lower\n  if (lower === 'chain' || lower === 'tool' || lower === 'code') return 'structural'\n  if (lower === 'config' || lower === 'params') return 'parameter'\n  return null\n}\n\nfunction inferLevelFromText(text: string): FapoOptimizationLevel | null {\n  const lower = text.toLowerCase()\n  if (\n    /\\b(retrieval_k|temperature|top_p|max_tokens|max_completion_tokens|reasoning_effort|config|parameter)\\b/.test(\n      lower,\n    )\n  ) {\n    return 'parameter'\n  }\n  if (\n    /\\b(retriev\\w*|search\\w*|bm25|hop|evidence|cascade|tool|node|chain|state|structur\\w*|topology|import)\\b/.test(\n      lower,\n    )\n  ) {\n    return 'structural'\n  }\n  if (\n    /\\b(format\\w*|verbose|brevity|abstain\\w*|reasoning|instruction|prompt|output|answer)\\b/.test(\n      lower,\n    )\n  ) {\n    return 'prompt'\n  }\n  return null\n}\n\nfunction textFields(obj: Record<string, unknown>): string {\n  return [\n    obj.label,\n    obj.claim,\n    obj.recommended_action,\n    obj.suggested_fix,\n    obj.suggestedFix,\n    obj.message,\n    obj.text,\n    obj.heuristic,\n    obj.area,\n  ]\n    .filter((value): value is string => typeof value === 'string' && value.trim().length > 0)\n    .join(' ')\n}\n\nfunction numberField(value: unknown): number | null {\n  return typeof value === 'number' && Number.isFinite(value) ? value : null\n}\n\nfunction stringField(value: unknown): string | undefined {\n  return typeof value === 'string' && value.trim() ? value.trim() : undefined\n}\n\nfunction confidenceField(value: unknown): FapoFailureCluster['confidence'] {\n  return value === 'high' || value === 'medium' || value === 'low' ? value : undefined\n}\n\nfunction stringArrayField(value: unknown): string[] | undefined {\n  return Array.isArray(value)\n    ? value.filter((item): item is string => typeof item === 'string')\n    : undefined\n}\n\nexport type JsonPrimitive = string | number | boolean | null\nexport type JsonValue = JsonPrimitive | JsonValue[] | { [key: string]: JsonValue }\n\nexport interface ParameterChange {\n  path: string | readonly string[]\n  value: JsonValue\n}\n\nexport interface ParameterCandidate {\n  label: string\n  rationale: string\n  /** Deep-merged into the current JSON surface. */\n  patch?: Record<string, JsonValue>\n  /** Dot-path writes, e.g. `{ path: 'retrieval.k', value: 10 }`. */\n  changes?: readonly ParameterChange[]\n}\n\nexport interface ParameterSweepProposerOptions {\n  candidates: readonly ParameterCandidate[]\n  /** Optional parser for non-JSON config surface strings. */\n  parse?: (surface: string) => Record<string, JsonValue>\n  /** Optional serializer for non-JSON config surface strings. */\n  stringify?: (config: Record<string, JsonValue>) => string\n}\n\n/** Config/parameter-level proposer for FAPO's middle escalation level. */\nexport function parameterSweepProposer(opts: ParameterSweepProposerOptions): SurfaceProposer {\n  if (opts.candidates.length === 0) {\n    throw new Error('parameterSweepProposer: candidates must not be empty')\n  }\n  return {\n    kind: 'parameter-sweep',\n    async propose(ctx: ProposeContext): Promise<ProposedCandidate[]> {\n      if (typeof ctx.currentSurface !== 'string') {\n        throw new Error(\n          'parameterSweepProposer: currentSurface must be a JSON string config surface',\n        )\n      }\n      const parse = opts.parse ?? parseJsonObject\n      const stringify =\n        opts.stringify ?? ((config: Record<string, JsonValue>) => JSON.stringify(config, null, 2))\n      const current = parse(ctx.currentSurface)\n      const currentCanonical = canonicalJson(current)\n      const tried = triedLabels(ctx.history)\n      const out: ProposedCandidate[] = []\n      for (const candidate of opts.candidates) {\n        if (tried.has(candidate.label)) continue\n        const next = applyParameterCandidate(current, candidate)\n        const surface = stringify(next)\n        if (surface === ctx.currentSurface || canonicalJson(next) === currentCanonical) continue\n        out.push({ surface, label: candidate.label, rationale: candidate.rationale })\n        if (out.length >= ctx.populationSize) break\n      }\n      return out\n    },\n  }\n}\n\nfunction parseJsonObject(surface: string): Record<string, JsonValue> {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(surface)\n  } catch (error) {\n    throw new Error(\n      `parameterSweepProposer: currentSurface must be valid JSON object config (${error instanceof Error ? error.message : String(error)})`,\n    )\n  }\n  if (!parsed || typeof parsed !== 'object' || Array.isArray(parsed)) {\n    throw new Error('parameterSweepProposer: JSON surface must parse to an object')\n  }\n  return parsed as Record<string, JsonValue>\n}\n\nfunction triedLabels(history: readonly GenerationRecord[]): Set<string> {\n  const tried = new Set<string>()\n  for (const generation of history) {\n    for (const candidate of generation.candidates) {\n      if (!candidate.label) continue\n      tried.add(candidate.label)\n      tried.add(candidateStrategy(candidate))\n    }\n  }\n  return tried\n}\n\nfunction applyParameterCandidate(\n  current: Record<string, JsonValue>,\n  candidate: ParameterCandidate,\n): Record<string, JsonValue> {\n  const next = cloneJsonObject(current)\n  if (candidate.patch) deepMerge(next, candidate.patch)\n  for (const change of candidate.changes ?? []) {\n    setPath(\n      next,\n      typeof change.path === 'string' ? change.path.split('.') : [...change.path],\n      change.value,\n    )\n  }\n  return next\n}\n\nfunction cloneJsonObject(value: Record<string, JsonValue>): Record<string, JsonValue> {\n  return JSON.parse(JSON.stringify(value)) as Record<string, JsonValue>\n}\n\nfunction deepMerge(target: Record<string, JsonValue>, patch: Record<string, JsonValue>): void {\n  for (const [key, value] of Object.entries(patch)) {\n    assertSafeJsonKey(key)\n    if (isPlainObject(value) && isPlainObject(target[key])) {\n      deepMerge(target[key] as Record<string, JsonValue>, value as Record<string, JsonValue>)\n    } else {\n      target[key] = value\n    }\n  }\n}\n\nfunction setPath(target: Record<string, JsonValue>, path: string[], value: JsonValue): void {\n  if (path.length === 0) throw new Error('parameterSweepProposer: change path must not be empty')\n  for (const part of path) assertSafeJsonKey(part)\n  let cursor: Record<string, JsonValue> = target\n  for (const part of path.slice(0, -1)) {\n    const existing = cursor[part]\n    if (!isPlainObject(existing)) {\n      cursor[part] = {}\n    }\n    cursor = cursor[part] as Record<string, JsonValue>\n  }\n  cursor[path[path.length - 1]!] = value\n}\n\nfunction assertSafeJsonKey(key: string): void {\n  if (!key.trim()) throw new Error('parameterSweepProposer: change path contains an empty key')\n  if (UNSAFE_JSON_KEYS.has(key)) {\n    throw new Error(`parameterSweepProposer: unsafe JSON key \"${key}\" is not allowed`)\n  }\n}\n\nfunction canonicalJson(value: JsonValue | Record<string, JsonValue>): string {\n  if (Array.isArray(value)) return `[${value.map((item) => canonicalJson(item)).join(',')}]`\n  if (isPlainObject(value)) {\n    return `{${Object.keys(value)\n      .sort()\n      .map((key) => `${JSON.stringify(key)}:${canonicalJson(value[key]!)}`)\n      .join(',')}}`\n  }\n  return JSON.stringify(value)\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, JsonValue> {\n  if (!value || typeof value !== 'object' || Array.isArray(value)) return false\n  const proto = Object.getPrototypeOf(value)\n  return proto === Object.prototype || proto === null\n}\n","/**\n * SkillOpt patch primitives (Microsoft, arXiv:2605.23904 — \"Executive\n * Strategy for Self-Evolving Agent Skills\"). Where GEPA regenerates a surface\n * by reflection, SkillOpt emits BOUNDED, anchored edits to ONE skill document\n * — add / delete / replace — and accepts an edit only if it strictly improves\n * a held-out score. Bounded edits are the \"textual learning rate\": small,\n * reversible, and cheap to accept/reject, so a good rule introduced earlier is\n * not overwritten by a later sweeping rewrite.\n *\n * This module applies a patch deterministically and reports, per op, what\n * applied and what could not (a missing anchor is a rejected op, never a\n * silently dropped one). Pure, no I/O.\n */\n\n/** A single bounded edit against a skill surface.\n *   - `add`     — insert `text` after the first line containing `after`\n *                 (append to the end when `after` is absent/empty).\n *   - `delete`  — remove the first line containing `anchor`.\n *   - `replace` — replace the first line containing `anchor` with `text`.\n *  `text` may be multi-line; it is spliced in as multiple lines. Anchors match\n *  the FIRST line that contains the substring (deterministic; SkillOpt is\n *  expected to anchor on unique text). */\nexport type SkillPatchOp =\n  | { op: 'add'; after?: string; text: string }\n  | { op: 'delete'; anchor: string }\n  | { op: 'replace'; anchor: string; text: string }\n\n/** A named, attributable bundle of ops the optimizer proposes as one edit. */\nexport interface SkillPatch {\n  label: string\n  rationale: string\n  ops: SkillPatchOp[]\n}\n\nexport interface SkillPatchRejection {\n  op: SkillPatchOp\n  reason: string\n}\n\nexport interface ApplySkillPatchResult {\n  surface: string\n  /** Count of ops that mutated the surface. */\n  applied: number\n  /** Ops that could not apply (unanchored / empty), with the reason. The\n   *  surface still reflects every APPLIED op — partial application is honest,\n   *  and the caller decides whether a partial patch is worth scoring. */\n  rejected: SkillPatchRejection[]\n}\n\n/**\n * Apply a SkillOpt patch to a text surface. Ops apply in array order against\n * the evolving line buffer (an `add after X` followed by a `delete X` sees the\n * inserted lines). A missing anchor rejects only that op; the rest still apply.\n */\nexport function applySkillPatch(surface: string, patch: SkillPatch): ApplySkillPatchResult {\n  let lines = surface.split('\\n')\n  let applied = 0\n  const rejected: SkillPatchRejection[] = []\n  const findLine = (anchor: string): number => lines.findIndex((l) => l.includes(anchor))\n\n  for (const op of patch.ops) {\n    if (op.op === 'add') {\n      if (typeof op.text !== 'string' || op.text.trim() === '') {\n        rejected.push({ op, reason: 'empty add text' })\n        continue\n      }\n      const insert = op.text.split('\\n')\n      if (op.after === undefined || op.after === '') {\n        lines = [...lines, ...insert]\n        applied++\n        continue\n      }\n      const idx = findLine(op.after)\n      if (idx === -1) {\n        rejected.push({ op, reason: `add anchor not found: ${truncate(op.after)}` })\n        continue\n      }\n      lines = [...lines.slice(0, idx + 1), ...insert, ...lines.slice(idx + 1)]\n      applied++\n    } else if (op.op === 'delete') {\n      const idx = findLine(op.anchor)\n      if (idx === -1) {\n        rejected.push({ op, reason: `delete anchor not found: ${truncate(op.anchor)}` })\n        continue\n      }\n      lines = [...lines.slice(0, idx), ...lines.slice(idx + 1)]\n      applied++\n    } else {\n      // replace\n      const idx = findLine(op.anchor)\n      if (idx === -1) {\n        rejected.push({ op, reason: `replace anchor not found: ${truncate(op.anchor)}` })\n        continue\n      }\n      if (typeof op.text !== 'string') {\n        rejected.push({ op, reason: 'replace text missing' })\n        continue\n      }\n      lines = [...lines.slice(0, idx), ...op.text.split('\\n'), ...lines.slice(idx + 1)]\n      applied++\n    }\n  }\n\n  return { surface: lines.join('\\n'), applied, rejected }\n}\n\n/** Total ops in a patch — the edit-budget axis (SkillOpt's \"textual learning\n *  rate\" caps this per epoch). */\nexport function patchEditCount(patch: SkillPatch): number {\n  return patch.ops.length\n}\n\nfunction truncate(s: string, max = 48): string {\n  return s.length <= max ? s : `${s.slice(0, max)}…`\n}\n","/**\n * `skillOptProposer` — a patch-mode `SurfaceProposer` implementing SkillOpt\n * (Microsoft, arXiv:2605.23904). Where `gepaProposer` regenerates the whole\n * surface by reflection, SkillOpt proposes BOUNDED, anchored edits\n * (add/delete/replace) to ONE skill document, so a good rule introduced\n * earlier is not clobbered by a later sweeping rewrite. The edit budget is the\n * paper's \"textual learning rate\"; a rejected-edit buffer + a slow-update\n * meta-note steer the optimizer away from dead ends.\n *\n * This module is the PROPOSER — the LLM call that turns evidence into\n * structured patches. The accept-only-if-held-out-improves loop, the budget\n * annealing, and the rejected buffer live in the `runSkillOpt` preset, which\n * owns the epoch hill-climb. The proposer also conforms to `SurfaceProposer`\n * (`propose` applies its patches to the current surface and returns the\n * candidate surfaces) so it is a drop-in for `runOptimization` and a fair\n * entrant in `compareProposers`.\n */\n\nimport { CostLedger, type CostLedgerHandle } from '../../cost-ledger'\nimport {\n  callLlm,\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  type LlmCallRequest,\n  type LlmClientOptions,\n  maximumChargeForLlmRequest,\n} from '../../llm-client'\nimport { renderAnalystEvidence } from '../../reflective-mutation'\nimport { applySkillPatch, type SkillPatch, type SkillPatchOp } from '../skill-patch'\nimport type { ProposeContext, ProposedCandidate, SurfaceProposer } from '../types'\n\nconst SKILLOPT_SYSTEM =\n  'You are a SkillOpt optimizer. You improve ONE skill document by proposing ' +\n  'BOUNDED, anchored edits — never a full rewrite. Output ONLY a JSON object of ' +\n  'shape {\"patches\":[{\"label\":string,\"rationale\":string,\"ops\":[op,...]}]} where ' +\n  'each op is one of: {\"op\":\"add\",\"after\":<exact substring of an existing line, ' +\n  'or omit to append>,\"text\":<new line(s)>}, {\"op\":\"delete\",\"anchor\":<exact ' +\n  'substring of the line to remove>}, {\"op\":\"replace\",\"anchor\":<exact substring ' +\n  'of the line to replace>,\"text\":<replacement line(s)>}. Anchors MUST be ' +\n  'verbatim substrings of lines that exist in the document. No prose outside JSON.'\n\n/** Evidence the optimizer reflects on: where the current surface is weakest.\n *  Computed by the caller (the preset uses a TRAIN campaign so proposals never\n *  see the held-out split; the generic loop derives it from history). */\nexport interface SkillOptEvidence {\n  /** Lowest-scoring scenarios (drives WHICH behavior to patch). */\n  weakScenarios: Array<{ scenarioId: string; composite: number }>\n  /** Lowest-scoring judge dimensions (drives WHAT to patch for). */\n  weakDimensions: Array<{ dimension: string; score: number }>\n}\n\n/** A patch that was tried and not accepted — fed back to the model so it does\n *  not re-propose a dead end (SkillOpt's rejected-edit buffer). */\nexport interface RejectedEdit {\n  label: string\n  rationale: string\n  reason: string\n}\n\nexport interface ProposePatchesArgs {\n  surface: string\n  evidence: SkillOptEvidence\n  /** Max ops per patch this round (the annealed textual learning rate). */\n  editBudget: number\n  rejectedBuffer: RejectedEdit[]\n  /** Slow-update meta guidance accumulated across epochs. */\n  metaNote?: string\n  /** Analyst findings + research report rendered as a prompt block so a patch\n   *  targets a NAMED diagnosed root cause. Built by\n   *  the proposer from `ctx.findings`/`ctx.report`; the patch-native `runSkillOpt`\n   *  path may also supply it. */\n  findingsNote?: string\n  /** How many candidate patches to propose. */\n  count: number\n  signal: AbortSignal\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n}\n\nexport interface SkillOptProposerOptions {\n  llm: LlmClientOptions\n  model: string\n  /** Optional ledger for direct proposer use. Campaign context takes precedence. */\n  costLedger?: CostLedgerHandle\n  /** What the skill document governs — orients the prompt. */\n  target: string\n  /** Default ops-per-patch cap when used as a bare `SurfaceProposer`. The\n   *  `runSkillOpt` preset overrides this per epoch as it anneals. Default 3. */\n  editBudget?: number\n  temperature?: number\n  maxTokens?: number\n  /** Top-K weak scenarios/dimensions surfaced as evidence. Default 3. */\n  evidenceK?: number\n}\n\nexport interface SkillOptProposer extends SurfaceProposer {\n  /** Patch-native path used by `runSkillOpt` (the SkillOpt epoch loop owns\n   *  acceptance/budget/buffer). Returns structured patches, NOT surfaces. */\n  proposePatches(args: ProposePatchesArgs): Promise<SkillPatch[]>\n}\n\n/**\n * SkillOpt proposer: proposes bounded, anchored patch operations (add/delete/replace) on a skill document, conforming to both the patch-native `SkillOptProposer` and the generic `SurfaceProposer` interfaces.\n */\nexport function skillOptProposer(opts: SkillOptProposerOptions): SkillOptProposer {\n  const evidenceK = opts.evidenceK ?? 3\n  const defaultBudget = opts.editBudget ?? 3\n  const directCostLedger = opts.costLedger ?? new CostLedger()\n\n  async function proposePatches(args: ProposePatchesArgs): Promise<SkillPatch[]> {\n    const userPrompt = buildPatchPrompt({\n      target: opts.target,\n      surface: args.surface,\n      evidence: args.evidence,\n      editBudget: args.editBudget,\n      rejectedBuffer: args.rejectedBuffer,\n      metaNote: args.metaNote,\n      findingsNote: args.findingsNote,\n      count: args.count,\n    })\n    const request: LlmCallRequest = {\n      model: opts.model,\n      messages: [\n        { role: 'system', content: SKILLOPT_SYSTEM },\n        { role: 'user', content: userPrompt },\n      ],\n      jsonMode: true,\n      temperature: opts.temperature ?? 0.6,\n      maxTokens: opts.maxTokens ?? 4000,\n    }\n    const paid = await (args.costLedger ?? directCostLedger).runPaidCall({\n      channel: 'driver',\n      phase: args.costPhase ?? 'search.proposal',\n      actor: 'skill-opt.propose',\n      model: opts.model,\n      maximumCharge: maximumChargeForLlmRequest(request, opts.llm),\n      signal: args.signal,\n      execute: (signal, callId) =>\n        callLlm(request, { ...opts.llm, signal, idempotencyKey: callId }),\n      receipt: costReceiptFromLlm,\n      receiptFromError: costReceiptFromLlmError,\n    })\n    if (!paid.succeeded) throw paid.error\n    const result = paid.value\n    return parseSkillPatchResponse(result.content, args.count, args.editBudget)\n  }\n\n  return {\n    kind: 'skill-opt',\n    proposePatches,\n    async propose(ctx: ProposeContext): Promise<ProposedCandidate[]> {\n      if (typeof ctx.currentSurface !== 'string') {\n        throw new Error(\n          'skillOptProposer: surface must be a string skill document (got a CodeSurface). SkillOpt patches text.',\n        )\n      }\n      const surface = ctx.currentSurface\n      const patches = await proposePatches({\n        surface,\n        evidence: evidenceFromHistory(ctx, evidenceK),\n        editBudget: defaultBudget,\n        rejectedBuffer: [],\n        findingsNote: renderAnalystEvidence(ctx.findings, ctx.report) ?? undefined,\n        count: ctx.populationSize,\n        signal: ctx.signal,\n        costLedger: ctx.costLedger ?? directCostLedger,\n        costPhase: ctx.costPhase ?? 'search.proposal',\n      })\n      const out: ProposedCandidate[] = []\n      const seen = new Set<string>()\n      for (const patch of patches) {\n        const { surface: candidate, applied } = applySkillPatch(surface, patch)\n        if (applied === 0 || candidate === surface || seen.has(candidate)) continue\n        seen.add(candidate)\n        out.push({ surface: candidate, label: patch.label, rationale: patch.rationale })\n        if (out.length >= ctx.populationSize) break\n      }\n      return out\n    },\n  }\n}\n\n/** Derive evidence from the loop's generation history (generic-proposer path):\n *  the prior best candidate's worst scenarios + weakest dimensions. Empty on\n *  generation 0. */\nfunction evidenceFromHistory(ctx: ProposeContext, k: number): SkillOptEvidence {\n  const last = ctx.history.at(-1)\n  if (!last || last.candidates.length === 0) return { weakScenarios: [], weakDimensions: [] }\n  const best = [...last.candidates].sort((a, b) => b.composite - a.composite)[0]\n  if (!best) return { weakScenarios: [], weakDimensions: [] }\n  const weakScenarios = [...best.scenarios].sort((a, b) => a.composite - b.composite).slice(0, k)\n  const weakDimensions = Object.entries(best.dimensions)\n    .sort((a, b) => a[1] - b[1])\n    .slice(0, k)\n    .map(([dimension, score]) => ({ dimension, score }))\n  return { weakScenarios, weakDimensions }\n}\n\nfunction buildPatchPrompt(args: {\n  target: string\n  surface: string\n  evidence: SkillOptEvidence\n  editBudget: number\n  rejectedBuffer: RejectedEdit[]\n  metaNote?: string\n  findingsNote?: string\n  count: number\n}): string {\n  const lines: string[] = [\n    `Skill document governs: ${args.target}.`,\n    '',\n    'Current skill document:',\n    '```',\n    args.surface,\n    '```',\n    '',\n    `Propose ${args.count} candidate patch(es). Each patch is a SMALL bundle of`,\n    `at most ${args.editBudget} op(s). Anchors must be verbatim substrings of`,\n    'existing lines. Prefer adding a specific missing rule or sharpening a vague',\n    'one over deleting; never rewrite the whole document.',\n  ]\n  if (args.evidence.weakScenarios.length > 0) {\n    lines.push(\n      '',\n      'Weakest scenarios (patch to fix these):',\n      ...args.evidence.weakScenarios.map((s) => `- ${s.scenarioId} (${s.composite.toFixed(2)})`),\n    )\n  }\n  if (args.evidence.weakDimensions.length > 0) {\n    lines.push(\n      '',\n      'Weakest dimensions (what to improve):',\n      ...args.evidence.weakDimensions.map((d) => `- ${d.dimension} (${d.score.toFixed(2)})`),\n    )\n  }\n  if (args.rejectedBuffer.length > 0) {\n    lines.push(\n      '',\n      'Already tried and REJECTED (do not repeat or restate these edits):',\n      ...args.rejectedBuffer.map((e) => `- ${e.label}: ${e.rationale} — ${e.reason}`),\n    )\n  }\n  if (args.findingsNote) {\n    lines.push('', args.findingsNote)\n  }\n  if (args.metaNote) {\n    lines.push('', `Strategy note from prior epochs: ${args.metaNote}`)\n  }\n  return lines.join('\\n')\n}\n\n/** Parse + validate the patch response. Throws `SkillPatchParseError` when the\n *  response is not valid JSON at all (a router/model failure the caller must\n *  see — never a silent no-op epoch). Returns `[]` only for the legitimate\n *  \"valid JSON, zero usable patches\" case. Malformed ops within a patch are\n *  dropped (not silently mutated); each patch is truncated to the edit budget. */\nexport class SkillPatchParseError extends Error {\n  constructor(message: string) {\n    super(message)\n    this.name = 'SkillPatchParseError'\n  }\n}\n\n/**\n * Parse a SkillOpt LLM response into validated `SkillPatch` objects, throwing `SkillPatchParseError` on malformed JSON and silently dropping ops that violate the edit budget.\n */\nexport function parseSkillPatchResponse(\n  raw: string,\n  maxPatches: number,\n  editBudget: number,\n): SkillPatch[] {\n  let text = raw.trim()\n  if (text.startsWith('```')) text = text.replace(/^```(?:json)?\\n?/, '').replace(/\\n?```$/, '')\n  const start = text.indexOf('{')\n  const end = text.lastIndexOf('}')\n  if (start < 0 || end <= start) {\n    throw new SkillPatchParseError(\n      `parseSkillPatchResponse: response was not valid JSON (no object found): ${snippet(raw)}`,\n    )\n  }\n  let parsed: { patches?: unknown }\n  try {\n    parsed = JSON.parse(text.slice(start, end + 1))\n  } catch (err) {\n    throw new SkillPatchParseError(\n      `parseSkillPatchResponse: response was not valid JSON (${\n        err instanceof Error ? err.message : String(err)\n      }): ${snippet(raw)}`,\n    )\n  }\n  const rawPatches = Array.isArray(parsed.patches) ? parsed.patches : []\n  const out: SkillPatch[] = []\n  for (const rp of rawPatches) {\n    if (typeof rp !== 'object' || rp === null) continue\n    const obj = rp as Record<string, unknown>\n    const ops = Array.isArray(obj.ops) ? obj.ops.map(normalizeOp).filter(isOp) : []\n    if (ops.length === 0) continue\n    out.push({\n      label: typeof obj.label === 'string' ? obj.label : 'patch',\n      rationale: typeof obj.rationale === 'string' ? obj.rationale : '',\n      ops: ops.slice(0, editBudget),\n    })\n    if (out.length >= maxPatches) break\n  }\n  return out\n}\n\nfunction normalizeOp(raw: unknown): SkillPatchOp | null {\n  if (typeof raw !== 'object' || raw === null) return null\n  const o = raw as Record<string, unknown>\n  if (o.op === 'add') {\n    if (typeof o.text !== 'string') return null\n    const op: SkillPatchOp = { op: 'add', text: o.text }\n    if (typeof o.after === 'string') op.after = o.after\n    return op\n  }\n  if (o.op === 'delete') {\n    if (typeof o.anchor !== 'string') return null\n    return { op: 'delete', anchor: o.anchor }\n  }\n  if (o.op === 'replace') {\n    if (typeof o.anchor !== 'string' || typeof o.text !== 'string') return null\n    return { op: 'replace', anchor: o.anchor, text: o.text }\n  }\n  return null\n}\n\nfunction isOp(op: SkillPatchOp | null): op is SkillPatchOp {\n  return op !== null\n}\n\nfunction snippet(s: string, max = 120): string {\n  const t = s.trim().replace(/\\s+/g, ' ')\n  return t.length <= max ? t : `${t.slice(0, max)}…`\n}\n","/**\n * `runSkillOpt` — the SkillOpt epoch hill-climb (Microsoft, arXiv:2605.23904).\n * Unlike `runOptimization`'s population search around one global incumbent,\n * SkillOpt is a sequential, held-out-gated hill-climb on ONE skill document:\n *\n *   each epoch:\n *     1. reflect on the CURRENT surface's weakest TRAIN scenarios/dimensions\n *        (never the held-out split — proposals must not see the acceptance axis)\n *     2. propose ≤ `patchesPerEpoch` bounded patches (≤ `editBudget` ops each)\n *     3. apply each; score the candidate on the HELD-OUT split\n *     4. ACCEPT the first patch that STRICTLY improves the held-out composite;\n *        otherwise push it to the rejected-edit buffer (fed back so the model\n *        does not re-propose dead ends)\n *     5. anneal the edit budget down after consecutive rejections (the\n *        \"textual learning rate\" decay); refresh the slow-update meta note\n *     6. stop at `maxEpochs` or after `patience` epochs with no acceptance\n *\n * The accept-only-if-held-out-improves rule is the same discipline as\n * `HeldOutGate`/`defaultProductionGate`, applied per edit instead of once at\n * the end — which is why the held-out composite is monotonically\n * non-decreasing and a regression can never ship. `runCampaign` is the\n * measurement; `applySkillPatch` applies the edits; `skillOptProposer` proposes\n * them.\n */\n\nimport type { CostLedgerHandle, CostLedgerSummary } from '../../cost-ledger'\nimport type { RejectedEdit, SkillOptEvidence, SkillOptProposer } from '../proposers/skill-opt'\nimport { type RunCampaignOptions, runCampaign } from '../run-campaign'\nimport { resolveRunDir } from '../run-dir'\nimport { campaignBreakdown, campaignMeanComposite } from '../score-utils'\nimport { applySkillPatch } from '../skill-patch'\nimport { createRunCostLedger, fsCampaignStorage } from '../storage'\nimport type { CampaignResult, DispatchContext, Scenario } from '../types'\n\nexport interface RunSkillOptOptions<TScenario extends Scenario, TArtifact>\n  extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'dispatch' | 'scenarios'> {\n  /** The skill document being optimized. */\n  baselineSurface: string\n  /** Dispatcher taking the CURRENT skill surface + scenario → artifact. */\n  dispatchWithSurface: (\n    surface: string,\n    scenario: TScenario,\n    ctx: DispatchContext,\n  ) => Promise<TArtifact>\n  proposer: SkillOptProposer\n  /** Scenarios the optimizer reflects on for evidence. MUST be disjoint from\n   *  `holdoutScenarios` — proposals never see the acceptance axis. */\n  trainScenarios: TScenario[]\n  /** Held-out scenarios. An edit is accepted ONLY if it strictly improves the\n   *  mean composite here. */\n  holdoutScenarios: TScenario[]\n  maxEpochs: number\n  /** Candidate patches proposed per epoch. Default 2. */\n  patchesPerEpoch?: number\n  /** Initial ops-per-patch cap (the textual learning rate). Default 3. */\n  editBudget?: number\n  /** Strict acceptance margin: accept iff the held-out composite improves by\n   *  MORE than this. Default 0 (any strict improvement). */\n  minImprovement?: number\n  /** Stop after this many consecutive epochs with no acceptance. Default =\n   *  `maxEpochs` (never early-stop). */\n  patience?: number\n  /** Shrink the edit budget by 1 after 2 consecutive rejected epochs (min 1).\n   *  Default true. */\n  budgetAnneal?: boolean\n  /** Cap on the rejected-edit buffer (most-recent kept). Default 12. */\n  rejectedBufferSize?: number\n  /** Refresh the slow-update meta note every N epochs. Default 2. 0 disables. */\n  slowMetaEvery?: number\n  /** Top-K weak scenarios/dimensions surfaced as evidence each epoch. Default 3. */\n  evidenceK?: number\n  /** Abort signal forwarded to the patch-proposing LLM calls. */\n  signal?: AbortSignal\n}\n\nexport interface AcceptedEdit {\n  epoch: number\n  label: string\n  rationale: string\n  /** Held-out composite improvement vs the surface before this edit. */\n  holdoutDelta: number\n}\n\nexport interface SkillOptEpochRecord {\n  epoch: number\n  editBudget: number\n  proposed: number\n  /** The accepted edit this epoch, or null if every proposal was rejected. */\n  accepted: AcceptedEdit | null\n  rejected: RejectedEdit[]\n  /** Held-out composite of the CURRENT surface at the END of the epoch. */\n  holdoutComposite: number\n}\n\nexport interface RunSkillOptResult {\n  winnerSurface: string\n  baselineHoldoutComposite: number\n  winnerHoldoutComposite: number\n  /** `winnerHoldoutComposite - baselineHoldoutComposite` — monotonically ≥ 0\n   *  by construction (only strictly-improving edits are accepted). */\n  lift: number\n  acceptedEdits: AcceptedEdit[]\n  rejectedEdits: RejectedEdit[]\n  epochsRun: number\n  history: SkillOptEpochRecord[]\n  /** Total cost across every scoring campaign (train evidence + holdout\n   *  acceptance) the hill-climb ran. */\n  totalCostUsd: number\n  /** Run-wide spend, including scoring, proposals, and judges. */\n  cost: CostLedgerSummary\n}\n\n/**\n * SkillOpt sequential hill-climb: each epoch reflects on train-scenario weaknesses, proposes bounded patches, accepts the first patch that strictly improves the held-out composite, and anneals the edit budget on consecutive rejections.\n */\nexport async function runSkillOpt<TScenario extends Scenario, TArtifact>(\n  opts: RunSkillOptOptions<TScenario, TArtifact>,\n): Promise<RunSkillOptResult> {\n  if (opts.trainScenarios.length === 0) throw new Error('runSkillOpt: trainScenarios is empty')\n  if (opts.holdoutScenarios.length === 0) throw new Error('runSkillOpt: holdoutScenarios is empty')\n  if (!opts.judges || opts.judges.length === 0) {\n    throw new Error(\n      'runSkillOpt: at least one judge is required — scoring (and therefore acceptance) is meaningless without one, and would report a silent zero lift.',\n    )\n  }\n  // train ∩ holdout must be empty: proposals reflect on TRAIN evidence, so any\n  // overlap leaks the acceptance axis into the proposal (held-out contamination).\n  const holdoutIds = new Set(opts.holdoutScenarios.map((s) => s.id))\n  const overlap = opts.trainScenarios.filter((s) => holdoutIds.has(s.id)).map((s) => s.id)\n  if (overlap.length > 0) {\n    throw new Error(\n      `runSkillOpt: trainScenarios and holdoutScenarios must be disjoint (overlap: [${overlap.join(\n        ', ',\n      )}]) — a shared scenario leaks the held-out acceptance axis into the proposal evidence.`,\n    )\n  }\n\n  const patchesPerEpoch = opts.patchesPerEpoch ?? 2\n  const initialBudget = opts.editBudget ?? 3\n  const minImprovement = opts.minImprovement ?? 0\n  if (minImprovement < 0) {\n    throw new Error(\n      'runSkillOpt: minImprovement must be >= 0 — a negative threshold would accept held-out regressions, breaking the monotonic-lift contract.',\n    )\n  }\n  const patience = opts.patience ?? opts.maxEpochs\n  const budgetAnneal = opts.budgetAnneal ?? true\n  const rejectedBufferSize = opts.rejectedBufferSize ?? 12\n  const slowMetaEvery = opts.slowMetaEvery ?? 2\n  opts.runDir = resolveRunDir(opts.runDir, opts.repo)\n  const storage = opts.storage ?? fsCampaignStorage()\n  const costLedger =\n    opts.costLedger ??\n    createRunCostLedger({\n      storage,\n      runDir: opts.runDir,\n      costCeilingUsd: opts.costCeiling,\n    })\n\n  const scoreHoldout = async (surface: string, tag: string): Promise<number> => {\n    const campaign = await runScoringCampaign(opts, opts.holdoutScenarios, surface, tag, costLedger)\n    return campaignMeanComposite(campaign)\n  }\n  const evidenceK = opts.evidenceK ?? 3\n  const trainEvidence = async (surface: string, tag: string): Promise<SkillOptEvidence> => {\n    const campaign = await runScoringCampaign(opts, opts.trainScenarios, surface, tag, costLedger)\n    return toEvidence(campaign, evidenceK)\n  }\n\n  let current = opts.baselineSurface\n  let currentEvidence = await trainEvidence(current, 'baseline-train')\n  const baselineHoldout = await scoreHoldout(current, 'baseline-holdout')\n  let currentHoldout = baselineHoldout\n\n  const buffer: RejectedEdit[] = []\n  const acceptedEdits: AcceptedEdit[] = []\n  const rejectedAll: RejectedEdit[] = []\n  const history: SkillOptEpochRecord[] = []\n  let budget = initialBudget\n  let sinceAccept = 0\n  let metaNote: string | undefined\n  let epochsRun = 0\n\n  for (let epoch = 0; epoch < opts.maxEpochs; epoch++) {\n    epochsRun++\n    const patches = await opts.proposer.proposePatches({\n      surface: current,\n      evidence: currentEvidence,\n      editBudget: budget,\n      rejectedBuffer: buffer,\n      metaNote,\n      count: patchesPerEpoch,\n      signal: opts.signal ?? new AbortController().signal,\n      costLedger,\n      costPhase: 'skill-opt.proposal',\n    })\n\n    let accepted: AcceptedEdit | null = null\n    const rejectedThisEpoch: RejectedEdit[] = []\n    for (let i = 0; i < patches.length; i++) {\n      const patch = patches[i]!\n      const { surface: candidate, applied } = applySkillPatch(current, patch)\n      if (applied === 0 || candidate === current) {\n        rejectedThisEpoch.push({\n          label: patch.label,\n          rationale: patch.rationale,\n          reason: 'no-op (unanchored or zero-change)',\n        })\n        continue\n      }\n      const candidateHoldout = await scoreHoldout(candidate, `epoch-${epoch}-cand-${i}-holdout`)\n      if (candidateHoldout > currentHoldout + minImprovement) {\n        accepted = {\n          epoch,\n          label: patch.label,\n          rationale: patch.rationale,\n          holdoutDelta: candidateHoldout - currentHoldout,\n        }\n        current = candidate\n        currentHoldout = candidateHoldout\n        // The surface changed — recompute evidence for the next epoch from it.\n        currentEvidence = await trainEvidence(current, `epoch-${epoch}-train`)\n        break // greedy: take the first strictly-improving edit\n      }\n      rejectedThisEpoch.push({\n        label: patch.label,\n        rationale: patch.rationale,\n        reason: `held-out ${candidateHoldout.toFixed(3)} ≤ current ${currentHoldout.toFixed(3)}`,\n      })\n    }\n\n    if (accepted) {\n      acceptedEdits.push(accepted)\n      sinceAccept = 0\n    } else {\n      sinceAccept++\n      if (budgetAnneal && sinceAccept >= 2 && budget > 1) budget--\n    }\n    // Maintain the bounded rejected-edit buffer (steers the proposer away from\n    // dead ends; capped so the prompt stays bounded).\n    for (const r of rejectedThisEpoch) {\n      buffer.push(r)\n      rejectedAll.push(r)\n    }\n    while (buffer.length > rejectedBufferSize) buffer.shift()\n\n    // Slow-update meta note: a cross-epoch digest refreshed on a slow cadence.\n    if (slowMetaEvery > 0 && (epoch + 1) % slowMetaEvery === 0) {\n      metaNote = buildMetaNote(acceptedEdits, buffer)\n    }\n\n    history.push({\n      epoch,\n      editBudget: budget,\n      proposed: patches.length,\n      accepted,\n      rejected: rejectedThisEpoch,\n      holdoutComposite: currentHoldout,\n    })\n\n    if (sinceAccept >= patience) break\n  }\n\n  const cost = costLedger.summary()\n  return {\n    winnerSurface: current,\n    baselineHoldoutComposite: baselineHoldout,\n    winnerHoldoutComposite: currentHoldout,\n    lift: currentHoldout - baselineHoldout,\n    acceptedEdits,\n    rejectedEdits: rejectedAll,\n    epochsRun,\n    history,\n    totalCostUsd: cost.totalCostUsd,\n    cost,\n  }\n}\n\nfunction runScoringCampaign<TScenario extends Scenario, TArtifact>(\n  opts: RunSkillOptOptions<TScenario, TArtifact>,\n  scenarios: TScenario[],\n  surface: string,\n  tag: string,\n  costLedger: CostLedgerHandle,\n): Promise<CampaignResult<TArtifact, TScenario>> {\n  return runCampaign<TScenario, TArtifact>({\n    ...opts,\n    costLedger,\n    scenarios,\n    dispatch: (scenario, ctx) => opts.dispatchWithSurface(surface, scenario, ctx),\n    runDir: `${opts.runDir}/${tag}`,\n  })\n}\n\nfunction toEvidence<TArtifact, TScenario extends Scenario>(\n  campaign: CampaignResult<TArtifact, TScenario>,\n  k: number,\n): SkillOptEvidence {\n  const { dimensions, scenarios } = campaignBreakdown(campaign)\n  const weakScenarios = [...scenarios].sort((a, b) => a.composite - b.composite).slice(0, k)\n  const weakDimensions = Object.entries(dimensions)\n    .sort((a, b) => a[1] - b[1])\n    .slice(0, k)\n    .map(([dimension, score]) => ({ dimension, score }))\n  return { weakScenarios, weakDimensions }\n}\n\nfunction buildMetaNote(accepted: AcceptedEdit[], rejected: RejectedEdit[]): string {\n  const parts: string[] = []\n  if (accepted.length > 0) {\n    parts.push(\n      `Edits that improved held-out so far: ${accepted\n        .map((a) => `\"${a.label}\" (+${a.holdoutDelta.toFixed(3)})`)\n        .join('; ')}. Build on these.`,\n    )\n  }\n  if (rejected.length > 0) {\n    const labels = [...new Set(rejected.map((r) => r.label))].slice(0, 5)\n    parts.push(`Dead ends to avoid: ${labels.join(', ')}. Try a different anchor or rule.`)\n  }\n  parts.push('Keep edits small and anchored to existing lines.')\n  return parts.join(' ')\n}\n","/**\n * `compareProposers` — a head-to-head lift benchmark across surface proposers\n * on ONE corpus. This is the forcing function: optimizer quality (GEPA\n * reflection vs GEPA+Pareto vs SkillOpt) becomes a NUMBER with a confidence\n * interval, so a proposer regression — or shipping a simplified proposer and\n * calling it the real one — turns a build red instead of going\n * measurement-invisible.\n *\n * Every entrant is scored the SAME way: each proposer returns the surface it\n * promoted, then the benchmark scores the baseline + every winner on the\n * SAME held-out scenarios with the SAME judges. Apples-to-apples by\n * construction — the comparison never depends on how a proposer measured itself.\n * The per-scenario held-out composites feed a paired bootstrap (`statistics.ts`)\n * for each proposer's lift CI and for the pairwise \"which proposer wins\" CI.\n */\n\nimport type { LlmClientOptions } from '../../llm-client'\nimport { pairedBootstrap } from '../../statistics'\nimport { defaultProductionGate } from '../gates/default-production-gate'\nimport {\n  type FapoProposerOptions,\n  fapoProposer,\n  type ParameterCandidate,\n  parameterSweepProposer,\n} from '../proposers/fapo'\nimport { gepaProposer } from '../proposers/gepa'\nimport { skillOptProposer } from '../proposers/skill-opt'\nimport { type RunCampaignOptions, runCampaign } from '../run-campaign'\nimport { campaignBreakdown } from '../score-utils'\nimport type {\n  CampaignResult,\n  DispatchContext,\n  JudgeConfig,\n  MutableSurface,\n  Scenario,\n  SurfaceProposer,\n} from '../types'\nimport { type RunImprovementLoopOptions, runImprovementLoop } from './run-improvement-loop'\nimport { runSkillOpt } from './run-skill-opt'\n\n/** What an optimizer produced: the surface it promoted + what it cost to get\n *  there. The comparison does the held-out scoring itself, so an entry only\n *  needs to run its loop and hand back the winner. */\nexport interface ProposerEntry {\n  name: string\n  optimize: () => Promise<{ winnerSurface: MutableSurface; costUsd: number; durationMs?: number }>\n}\n\nexport interface ProposerScore {\n  name: string\n  /** Mean held-out composite of the baseline (identical across proposers). */\n  baselineComposite: number\n  /** Mean held-out composite of this proposer's promoted surface. */\n  winnerComposite: number\n  /** Mean per-scenario held-out lift (winner − baseline). */\n  lift: number\n  /** Paired-bootstrap CI of the per-scenario lift. `low > 0` ⇒ a real gain. */\n  liftCi: { low: number; high: number }\n  costUsd: number\n  durationMs?: number\n  winnerSurface: MutableSurface\n  /** 1-based, by descending lift. */\n  rank: number\n}\n\nexport interface ProposerPairwise {\n  /** Higher-ranked proposer. */\n  a: string\n  b: string\n  /** Mean per-scenario held-out delta (a − b). */\n  deltaMean: number\n  low: number\n  high: number\n  /** `a` if the CI clears 0, `b` if it is entirely negative, else `'tie'`. */\n  favored: string\n}\n\nexport interface ProposerComparison {\n  /** Sorted by descending lift; `rank` set accordingly. */\n  scores: ProposerScore[]\n  best: ProposerScore\n  /** Best vs each other proposer, paired-bootstrap on the held-out winners. */\n  pairwise: ProposerPairwise[]\n  holdoutScenarioIds: string[]\n}\n\nexport interface CompareProposersOptions<TScenario extends Scenario, TArtifact>\n  extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'dispatch' | 'scenarios'> {\n  proposers: ProposerEntry[]\n  baselineSurface: MutableSurface\n  /** The held-out scenarios every winner is scored on. */\n  holdoutScenarios: TScenario[]\n  /** Scores a surface on a scenario — the same dispatcher the proposers used. */\n  dispatchWithSurface: (\n    surface: MutableSurface,\n    scenario: TScenario,\n    ctx: DispatchContext,\n  ) => Promise<TArtifact>\n  /** Bootstrap resamples for the lift CIs. Default 2000. */\n  resamples?: number\n  /** CI confidence. Default 0.95. */\n  confidence?: number\n}\n\n/**\n * Run a head-to-head lift benchmark across surface proposers on a shared holdout, returning per-proposer lift CIs and pairwise \"who wins\" verdicts.\n */\nexport async function compareProposers<TScenario extends Scenario, TArtifact>(\n  opts: CompareProposersOptions<TScenario, TArtifact>,\n): Promise<ProposerComparison> {\n  return compareProposerEntries(opts)\n}\n\nasync function compareProposerEntries<TScenario extends Scenario, TArtifact>(\n  opts: CompareProposersOptions<TScenario, TArtifact>,\n): Promise<ProposerComparison> {\n  if (opts.proposers.length === 0) throw new Error('compareProposers: no proposers to compare')\n  const seed = opts.seed ?? 42\n  const resamples = opts.resamples ?? 2000\n  const confidence = opts.confidence ?? 0.95\n\n  const scoreOnHoldout = async (\n    surface: MutableSurface,\n    tag: string,\n  ): Promise<Record<string, number>> => {\n    const campaign: CampaignResult<TArtifact, TScenario> = await runCampaign<TScenario, TArtifact>({\n      ...opts,\n      scenarios: opts.holdoutScenarios,\n      dispatch: (scenario, ctx) => opts.dispatchWithSurface(surface, scenario, ctx),\n      runDir: `${opts.runDir}/${tag}`,\n    })\n    const byScenario: Record<string, number> = {}\n    for (const { scenarioId, composite } of campaignBreakdown(campaign).scenarios) {\n      byScenario[scenarioId] = composite\n    }\n    return byScenario\n  }\n\n  // The comparison axis is the DESIGNED held-out set, not whatever a campaign\n  // happened to score. Align every score vector to it and FAIL LOUD if a\n  // surface is missing any scenario (an errored cell / a judge that returned no\n  // score). Fabricating a 0 there would silently penalize that surface and\n  // corrupt the paired-bootstrap lift CI — the exact \"no silent zeros\" trap.\n  const scenarioIds = [...new Set(opts.holdoutScenarios.map((s) => s.id))].sort()\n  if (scenarioIds.length === 0) throw new Error('compareProposers: holdoutScenarios is empty')\n  const align = (byScenario: Record<string, number>, label: string): number[] => {\n    const missing = scenarioIds.filter((id) => !(id in byScenario))\n    if (missing.length > 0) {\n      throw new Error(\n        `compareProposers: ${label} produced no held-out score for scenario(s) [${missing.join(\n          ', ',\n        )}] — a cell errored or its judges returned nothing. Refusing to fabricate a 0 (it would corrupt the lift comparison). Fix the dispatch/judge or drop the scenario.`,\n      )\n    }\n    return scenarioIds.map((id) => byScenario[id]!)\n  }\n\n  const baselineArr = align(\n    await scoreOnHoldout(opts.baselineSurface, 'compare-baseline'),\n    'baseline',\n  )\n\n  // Run + uniformly re-score every entrant on the SAME held-out axis.\n  const winners: Array<{\n    name: string\n    winnerSurface: MutableSurface\n    costUsd: number\n    durationMs?: number\n    arr: number[]\n  }> = []\n  for (const proposer of opts.proposers) {\n    const out = await proposer.optimize()\n    const byScenario = await scoreOnHoldout(out.winnerSurface, `compare-${slug(proposer.name)}`)\n    winners.push({\n      name: proposer.name,\n      winnerSurface: out.winnerSurface,\n      costUsd: out.costUsd,\n      durationMs: out.durationMs,\n      arr: align(byScenario, `proposer \"${proposer.name}\"`),\n    })\n  }\n\n  const scores: ProposerScore[] = winners.map((w) => {\n    const boot = pairedBootstrap(baselineArr, w.arr, {\n      seed,\n      resamples,\n      confidence,\n      statistic: 'mean',\n    })\n    const score: ProposerScore = {\n      name: w.name,\n      baselineComposite: mean(baselineArr),\n      winnerComposite: mean(w.arr),\n      lift: boot.mean,\n      liftCi: { low: boot.low, high: boot.high },\n      costUsd: w.costUsd,\n      winnerSurface: w.winnerSurface,\n      rank: 0,\n    }\n    if (w.durationMs !== undefined) score.durationMs = w.durationMs\n    return score\n  })\n  // Sort by lift; tie-break by lower cost (cheaper wins a tie).\n  scores.sort((a, b) => b.lift - a.lift || a.costUsd - b.costUsd)\n  scores.forEach((s, i) => {\n    s.rank = i + 1\n  })\n  const best = scores[0]!\n\n  const byName = new Map(winners.map((w) => [w.name, w]))\n  const bestArr = byName.get(best.name)!.arr\n  const pairwise: ProposerPairwise[] = scores.slice(1).map((other) => {\n    const otherArr = byName.get(other.name)!.arr\n    // before = other, after = best ⇒ delta = best − other on the held-out set.\n    const boot = pairedBootstrap(otherArr, bestArr, {\n      seed,\n      resamples,\n      confidence,\n      statistic: 'mean',\n    })\n    const favored = boot.low > 0 ? best.name : boot.high < 0 ? other.name : 'tie'\n    return {\n      a: best.name,\n      b: other.name,\n      deltaMean: boot.mean,\n      low: boot.low,\n      high: boot.high,\n      favored,\n    }\n  })\n\n  return { scores, best, pairwise, holdoutScenarioIds: scenarioIds }\n}\n\nfunction mean(xs: number[]): number {\n  return xs.length === 0 ? 0 : xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\nfunction slug(name: string): string {\n  return name.replace(/[^a-z0-9]+/gi, '-').toLowerCase()\n}\n\n// ── Built-in entries — wire the real optimizers for a live comparison ───────\n\n/** Shared corpus + transport for the three built-in optimizer entries. */\nexport interface OptimizerEntryConfig<TScenario extends Scenario, TArtifact> {\n  baselineSurface: string\n  /** Training scenarios the proposers reflect on. */\n  trainScenarios: TScenario[]\n  /** Held-out scenarios (the gate axis + the benchmark scoring axis). */\n  holdoutScenarios: TScenario[]\n  dispatchWithSurface: (\n    surface: MutableSurface,\n    scenario: TScenario,\n    ctx: DispatchContext,\n  ) => Promise<TArtifact>\n  judges: JudgeConfig<TArtifact, TScenario>[]\n  llm: LlmClientOptions\n  model: string\n  target: string\n  runDir: string\n  seed?: number\n  /** GEPA population per generation. Default 2. */\n  populationSize?: number\n  /** GEPA generations. Default 3. */\n  maxGenerations?: number\n  /** SkillOpt epochs. Default 6. */\n  maxEpochs?: number\n  mutationPrimitives?: string[]\n  /** Static findings seed forwarded to each GEPA proposer's `propose()` as\n   *  `ctx.findings`. Forwarded by `gepaReflectionEntry` / `gepaParetoEntry`;\n   *  `skillOptEntry` runs without findings (see its doc). */\n  findings?: unknown[]\n  /** Per-generation findings producer: after each generation scores, this\n   *  re-diagnoses and REPLACES `ctx.findings` for the\n   *  next generation's `propose()`. Reuses the `runOptimization` field type so\n   *  it cannot drift. GEPA entries only. */\n  analyzeGeneration?: RunImprovementLoopOptions<TScenario, TArtifact>['analyzeGeneration']\n  /** Optional analysis report forwarded to `propose()` as `ctx.report`. */\n  report?: unknown\n}\n\n/** GEPA, reflection-only (single-parent, no Pareto combine). */\nexport function gepaReflectionEntry<TScenario extends Scenario, TArtifact>(\n  config: OptimizerEntryConfig<TScenario, TArtifact>,\n  name = 'gepa-reflection',\n): ProposerEntry {\n  return gepaEntry(config, false, name)\n}\n\n/** GEPA with the Pareto frontier + combine-complementary-lessons. */\nexport function gepaParetoEntry<TScenario extends Scenario, TArtifact>(\n  config: OptimizerEntryConfig<TScenario, TArtifact>,\n  name = 'gepa-pareto',\n): ProposerEntry {\n  return gepaEntry(config, true, name)\n}\n\nfunction gepaEntry<TScenario extends Scenario, TArtifact>(\n  config: OptimizerEntryConfig<TScenario, TArtifact>,\n  combineParents: boolean,\n  name: string,\n): ProposerEntry {\n  return {\n    name,\n    async optimize() {\n      const started = Date.now()\n      const proposer = gepaProposer({\n        llm: config.llm,\n        model: config.model,\n        target: config.target,\n        combineParents,\n        ...(config.mutationPrimitives ? { mutationPrimitives: config.mutationPrimitives } : {}),\n      })\n      const result = await runImprovementLoop<TScenario, TArtifact>({\n        scenarios: config.trainScenarios,\n        holdoutScenarios: config.holdoutScenarios,\n        baselineSurface: config.baselineSurface,\n        dispatchWithSurface: config.dispatchWithSurface,\n        judges: config.judges,\n        proposer,\n        populationSize: config.populationSize ?? 2,\n        maxGenerations: config.maxGenerations ?? 3,\n        gate: defaultProductionGate<TArtifact, TScenario>({\n          holdoutScenarios: config.holdoutScenarios,\n          deltaThreshold: 0,\n        }),\n        autoOnPromote: 'none',\n        runDir: `${config.runDir}/${slug(name)}-loop`,\n        ...(config.seed !== undefined ? { seed: config.seed } : {}),\n        // Flow findings to the proposer's propose(). These reach runOptimization\n        // unchanged (runImprovementLoop extends RunOptimizationOptions and\n        // forwards {...opts}); ctx.findings/report/analyzeGeneration are consumed there.\n        ...(config.findings !== undefined ? { findings: config.findings } : {}),\n        ...(config.analyzeGeneration ? { analyzeGeneration: config.analyzeGeneration } : {}),\n        ...(config.report !== undefined ? { report: config.report } : {}),\n      })\n      return {\n        winnerSurface: result.winnerSurface,\n        costUsd: result.cost.totalCostUsd,\n        durationMs: Date.now() - started,\n      }\n    },\n  }\n}\n\n/** SkillOpt patch-mode hill-climb. Runs findings-BLIND: `runSkillOpt` owns its\n *  own epoch acceptance/budget loop and does not thread `analyzeGeneration`, so\n *  `config.findings` is intentionally NOT forwarded here. In a findings-fed\n *  comparison this entry is the blind control — do not read its result as\n *  findings-fed. (Threading findings into the SkillOpt epoch loop is a separate\n *  refactor, deferred not faked.) */\nexport function skillOptEntry<TScenario extends Scenario, TArtifact>(\n  config: OptimizerEntryConfig<TScenario, TArtifact>,\n  name = 'skill-opt',\n): ProposerEntry {\n  return {\n    name,\n    async optimize() {\n      const started = Date.now()\n      const proposer = skillOptProposer({\n        llm: config.llm,\n        model: config.model,\n        target: config.target,\n      })\n      const result = await runSkillOpt<TScenario, TArtifact>({\n        baselineSurface: config.baselineSurface,\n        dispatchWithSurface: config.dispatchWithSurface,\n        judges: config.judges,\n        proposer,\n        trainScenarios: config.trainScenarios,\n        holdoutScenarios: config.holdoutScenarios,\n        maxEpochs: config.maxEpochs ?? 6,\n        runDir: `${config.runDir}/${slug(name)}-loop`,\n        ...(config.seed !== undefined ? { seed: config.seed } : {}),\n      })\n      return {\n        winnerSurface: result.winnerSurface,\n        costUsd: result.totalCostUsd,\n        durationMs: Date.now() - started,\n      }\n    },\n  }\n}\n\n/** FAPO reviewed-escalation policy. This is an orchestration layer over\n * level-specific proposers, not a new mutation operator:\n * prompt -> parameter -> structural, with scope + reviewer + plateau rules in\n * `fapoProposer`. The prompt proposer defaults to GEPA+Pareto because that is\n * the package's strongest prompt-tier proposer; parameter/structural proposers\n * are opt-in so we do not fake code-generation inside agent-eval. */\nexport interface FapoEntryConfig<TScenario extends Scenario, TArtifact>\n  extends OptimizerEntryConfig<TScenario, TArtifact> {\n  /** Override the prompt-level proposer. Default: `gepaProposer({ combineParents: true })`. */\n  promptProposer?: SurfaceProposer\n  /** Parameter/config-level proposer. If omitted, `parameterCandidates` builds one. */\n  parameterProposer?: SurfaceProposer\n  /** Structural/code-level proposer, typically supplied by agent-runtime. */\n  structuralProposer?: SurfaceProposer\n  /** Convenience: build a `parameterSweepProposer` from these candidates. */\n  parameterCandidates?: readonly ParameterCandidate[]\n  /** FAPO policy knobs: scope, reviewer, plateau thresholds. */\n  fapo?: Omit<\n    FapoProposerOptions,\n    'proposers' | 'promptProposer' | 'parameterProposer' | 'structuralProposer'\n  >\n}\n\n/**\n * Build a `ProposerEntry` that runs the full FAPO escalation policy (prompt → parameter → structural) as a single comparable optimizer entry.\n */\nexport function fapoEscalationEntry<TScenario extends Scenario, TArtifact>(\n  config: FapoEntryConfig<TScenario, TArtifact>,\n  name = 'fapo-escalation',\n): ProposerEntry {\n  return {\n    name,\n    async optimize() {\n      const started = Date.now()\n      const promptProposer =\n        config.promptProposer ??\n        gepaProposer({\n          llm: config.llm,\n          model: config.model,\n          target: config.target,\n          combineParents: true,\n          ...(config.mutationPrimitives ? { mutationPrimitives: config.mutationPrimitives } : {}),\n        })\n      const parameterProposer =\n        config.parameterProposer ??\n        (config.parameterCandidates\n          ? parameterSweepProposer({ candidates: config.parameterCandidates })\n          : undefined)\n      const structuralProposer = config.structuralProposer\n      const proposer = fapoProposer({\n        ...(config.fapo ?? {}),\n        promptProposer,\n        ...(parameterProposer ? { parameterProposer } : {}),\n        ...(structuralProposer ? { structuralProposer } : {}),\n      })\n      const result = await runImprovementLoop<TScenario, TArtifact>({\n        scenarios: config.trainScenarios,\n        holdoutScenarios: config.holdoutScenarios,\n        baselineSurface: config.baselineSurface,\n        dispatchWithSurface: config.dispatchWithSurface,\n        judges: config.judges,\n        proposer,\n        populationSize: config.populationSize ?? 2,\n        maxGenerations: config.maxGenerations ?? 3,\n        gate: defaultProductionGate<TArtifact, TScenario>({\n          holdoutScenarios: config.holdoutScenarios,\n          deltaThreshold: 0,\n        }),\n        autoOnPromote: 'none',\n        runDir: `${config.runDir}/${slug(name)}-loop`,\n        ...(config.seed !== undefined ? { seed: config.seed } : {}),\n        ...(config.findings !== undefined ? { findings: config.findings } : {}),\n        ...(config.analyzeGeneration ? { analyzeGeneration: config.analyzeGeneration } : {}),\n        ...(config.report !== undefined ? { report: config.report } : {}),\n      })\n      return {\n        winnerSurface: result.winnerSurface,\n        costUsd: result.cost.totalCostUsd,\n        durationMs: Date.now() - started,\n      }\n    },\n  }\n}\n","/**\n * Completion verifier — the task-completion oracle.\n *\n * Answers the only eval question that is not a proxy: did the agent actually\n * COMPLETE the task — produce every required deliverable, persisted and\n * correct — rather than describe what should be done. A fluent transcript\n * that never produces the artifact scores zero here.\n *\n * Per requirement, a two-stage check:\n *   1. Structural — a produced item (vault artifact / approved proposal /\n *      tool call) of the right kind is matched against the requirement and\n *      carries non-empty content. Deterministic; no LLM.\n *   2. Correctness — only if structurally present AND the matched item\n *      carries content, one targeted check decides whether that item\n *      actually fulfils the requirement. A hallucinated artifact fails here;\n *      an absent one already failed stage 1.\n *\n * `completionRate` is satisfied / MEASURABLE requirements (unmeasured rows —\n * checker failures — are excluded from the denominator, never scored as\n * zeros). Quality dimensions are meaningless on an incomplete task — callers\n * gate on `fullyComplete` / `completionRate` before scoring quality.\n */\n\nimport { randomUUID } from 'node:crypto'\nimport type { TCloud } from '@tangle-network/tcloud'\nimport type { Artifact } from './artifact-validator'\nimport { CostLedger, type CostLedgerHandle, type CostReceiptInput } from './cost-ledger'\nimport { recoverTruncatedJson } from './json-recovery'\nimport { JudgeParseError } from './judges'\nimport type { LlmCallRequest } from './llm-client'\nimport { costReceiptFromTCloud, maximumChargeForTCloudRequest } from './tcloud-cost'\nimport type { RawProviderEvent, RawProviderSink } from './trace/raw-provider-sink'\nimport type { DefaultVerdict } from './verdict'\n\n/** What kind of produced state can satisfy a requirement structurally. */\nexport type SatisfiedBy = 'artifact' | 'proposal' | 'tool-call' | 'any'\n\nexport interface CompletionRequirement {\n  /** Stable id from the task gold (e.g. a persona's `expected_requirements[].req_id`). */\n  reqId: string\n  /** Human-readable description of the required deliverable. */\n  title: string\n  /** Optional kind/category hint, matched against a produced item's kind. */\n  category?: string\n  /** What produced state satisfies this requirement. Defaults to 'any'. */\n  satisfiedBy?: SatisfiedBy\n}\n\nexport interface TaskGold {\n  taskId: string\n  requirements: CompletionRequirement[]\n}\n\nexport interface ProducedProposal {\n  id: string\n  title: string\n  status: 'pending' | 'approved' | 'rejected'\n  /** Optional persisted body — when present, enables a correctness check. */\n  content?: string\n}\n\n/** Everything observable about what a run actually produced. */\nexport interface ProducedState {\n  /** Persisted vault artifacts. Reuses the shared `Artifact` shape. */\n  artifacts: Artifact[]\n  /** Proposals / filings the agent created. */\n  proposals: ProducedProposal[]\n  /** Names of tools the agent invoked. */\n  toolCalls: string[]\n}\n\nexport interface RequirementCheck {\n  reqId: string\n  title: string\n  /** A produced item of the right kind matched the requirement, non-empty. */\n  structurallyPresent: boolean\n  /**\n   * Whether the matched item actually fulfils the requirement. `null` when\n   * not structurally present, when the matched item carries no content\n   * to assess, or when the correctness check itself failed (`unmeasured`).\n   */\n  correct: boolean | null\n  /** structurallyPresent && !unmeasured && correct !== false. */\n  satisfied: boolean\n  /**\n   * Set when the correctness check itself errored (LLM call failure or an\n   * unparseable response after retry). The requirement's fulfilment is\n   * UNKNOWN — `correct` stays null, `satisfied` is false, and\n   * `completionVerdict` excludes the row from `completionRate`'s\n   * denominator. Never folded into a zero: a synthetic zero is\n   * indistinguishable from a real failure (see `JudgeParseError`).\n   */\n  unmeasured?: true\n  /** Why the correctness check could not be measured (present iff `unmeasured`). */\n  unmeasuredReason?: string\n  /** Human-readable evidence for the verdict. */\n  evidence: string[]\n}\n\n/** Extends the substrate verdict spine: `valid` = `fullyComplete` and\n *  `score` = `completionRate` — derived in `completionVerdict()`, the one\n *  place those equalities hold by construction. */\nexport interface CompletionVerdict extends DefaultVerdict {\n  taskId: string\n  requirements: RequirementCheck[]\n  /** satisfied / MEASURABLE requirements (unmeasured rows leave the denominator). */\n  completionRate: number\n  /** Every measurable requirement satisfied (false when anything is unmeasured). */\n  fullyComplete: boolean\n  /** Requirements whose correctness check errored — reported, never scored as zero. */\n  unmeasuredCount: number\n}\n\n/**\n * Construct a `CompletionVerdict` from the per-requirement checks, deriving\n * `completionRate` / `fullyComplete` and the spine fields (`valid` =\n * `fullyComplete`, `score` = `completionRate`) in one place. Throws on zero\n * requirements — a verdict over nothing is a misconfiguration, mirroring\n * `verifyCompletion`'s gold-spec guard.\n */\nexport function completionVerdict(input: {\n  taskId: string\n  requirements: RequirementCheck[]\n}): CompletionVerdict {\n  if (input.requirements.length === 0) {\n    throw new Error(\n      `completionVerdict: task '${input.taskId}' has no requirement checks — nothing to derive a verdict from`,\n    )\n  }\n  const measurable = input.requirements.filter((r) => !r.unmeasured)\n  const unmeasuredCount = input.requirements.length - measurable.length\n  if (measurable.length === 0) {\n    // Every check errored: this is an infrastructure failure, not a scored\n    // run. A 0-rate verdict here would be a fabricated measurement.\n    throw new Error(\n      `completionVerdict: task '${input.taskId}' has no measurable requirements — all ${input.requirements.length} correctness checks failed (${input.requirements[0]?.unmeasuredReason ?? 'unknown reason'})`,\n    )\n  }\n  const satisfiedCount = measurable.filter((r) => r.satisfied).length\n  const completionRate = satisfiedCount / measurable.length\n  // A run with unmeasured rows can still report a rate over what WAS\n  // measured, but must not claim full completion.\n  const fullyComplete = unmeasuredCount === 0 && satisfiedCount === measurable.length\n  return {\n    taskId: input.taskId,\n    requirements: input.requirements,\n    completionRate,\n    fullyComplete,\n    unmeasuredCount,\n    valid: fullyComplete,\n    score: completionRate,\n  }\n}\n\n/**\n * Decides whether a produced item's content actually fulfils a requirement.\n * Injected so the structural verifier stays pure and unit-testable; the\n * production implementation is `createLlmCorrectnessChecker`.\n */\nexport type CorrectnessChecker = (\n  requirement: CompletionRequirement,\n  content: string,\n) => Promise<{ correct: boolean; reason: string }>\n\nconst STOPWORDS = new Set([\n  'the',\n  'a',\n  'an',\n  'of',\n  'for',\n  'and',\n  'or',\n  'to',\n  'in',\n  'on',\n  'with',\n  'by',\n])\n\n// Deliverable-FORM vocabulary — words that name the SHAPE of an output, not its\n// domain content. A correct \"swap-comparison view persisted as a ui/** artifact\"\n// is an OpenUI JSON whose body says nothing about \"artifact\" / \"persisted\" /\n// \"view\"; the discriminative tokens are the domain nouns (swap, comparison).\n// Stripped from the REQUIREMENT side of structural recall so a deliverable is\n// matched on what it IS about, not on the boilerplate describing its form. The\n// correctness checker strips the same class via TITLE_STOPWORDS. Anti-game holds:\n// the distinctive domain tokens remain, so an off-topic item still fails.\nconst REQUIREMENT_FORM_STOPWORDS = new Set([\n  'generated',\n  'generate',\n  'view',\n  'render',\n  'rendered',\n  'persisted',\n  'persist',\n  'artifact',\n  'file',\n  'document',\n  'note',\n  'proposal',\n  'deliverable',\n  'output',\n  'created',\n  'create',\n  'produce',\n  'produced',\n  'flag',\n])\n\nconst MATCH_THRESHOLD = 0.5\nconst MIN_CONTENT_CHARS = 50\n\nfunction tokens(s: string, extraStop?: Set<string>): Set<string> {\n  return new Set(\n    s\n      .toLowerCase()\n      .split(/[^a-z0-9]+/)\n      .filter((t) => t.length > 1 && !STOPWORDS.has(t) && !extraStop?.has(t)),\n  )\n}\n\n/**\n * Recall of the requirement's tokens within a candidate's identifying text.\n * Recall, not Jaccard — a candidate's path/id legitimately carries extra\n * tokens the requirement does not name. The requirement side drops\n * deliverable-FORM vocabulary so recall keys on the distinctive domain tokens.\n */\nfunction tokenRecall(requirementText: string, candidateText: string): number {\n  const req = tokens(requirementText, REQUIREMENT_FORM_STOPWORDS)\n  if (req.size === 0) return 0\n  const cand = tokens(candidateText)\n  let hit = 0\n  for (const t of req) if (cand.has(t)) hit++\n  return hit / req.size\n}\n\ninterface Candidate {\n  reqIndex: number\n  /** Unique key for a produced item — each item satisfies at most one requirement. */\n  itemKey: string\n  score: number\n  evidence: string\n  /** Content to correctness-check, or null when the matched item has none. */\n  content: string | null\n}\n\nfunction artifactCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  artifacts: Artifact[],\n): Candidate[] {\n  const reqText = `${req.title} ${req.category ?? ''}`\n  const out: Candidate[] = []\n  artifacts.forEach((a, i) => {\n    if ((a.content ?? '').trim().length < MIN_CONTENT_CHARS) return\n    // Match against the artifact CONTENT too, not just its path + kind — a\n    // generated view / note whose path is generic still satisfies a requirement\n    // when its body covers it (e.g. an OpenUI comparison grounded in the on-file\n    // figures). Bounded slice keeps the recall text cheap; MATCH_THRESHOLD holds.\n    let score = tokenRecall(\n      reqText,\n      `${a.path ?? ''} ${a.kind} ${(a.content ?? '').slice(0, 4000)}`,\n    )\n    if (req.category && a.kind && req.category.toLowerCase() === a.kind.toLowerCase()) {\n      score = Math.max(score, 1)\n    }\n    if (score < MATCH_THRESHOLD) return\n    out.push({\n      reqIndex,\n      itemKey: `artifact:${i}`,\n      score,\n      evidence: `artifact '${a.path ?? a.kind}' matched (token recall ${score.toFixed(2)})`,\n      content: a.content ?? null,\n    })\n  })\n  return out\n}\n\nfunction proposalCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  proposals: ProducedProposal[],\n): Candidate[] {\n  const reqText = `${req.title} ${req.category ?? ''}`\n  const out: Candidate[] = []\n  for (const p of proposals) {\n    // Pending or rejected work is not a completed deliverable.\n    if (p.status !== 'approved') continue\n    // A proposal needs an assessable BODY to be a deliverable. A bare title is\n    // not completion: correctness cannot be judged on it, so a title-only match\n    // would auto-pass the oracle (structurallyPresent && correct===null →\n    // satisfied) with no verifiable content. Tool calls are the only\n    // legitimately content-less deliverable (`toolCallCandidates`).\n    const body = (p.content ?? '').trim()\n    if (body.length < MIN_CONTENT_CHARS) continue\n    // Match against the body as well as the (often short) title — a refusal /\n    // flag / analysis proposal whose title is a label still satisfies a\n    // descriptively-worded requirement when its content covers it. MATCH_THRESHOLD\n    // + the requirement's distinctive tokens keep an off-topic proposal out;\n    // correctness (a SEMANTIC checker, NOT this lexical pass) then judges\n    // polarity/fulfilment, so a negation that merely contains the tokens fails.\n    // Structural and correctness must use different evidence or the two-stage\n    // check collapses to one lexical gate.\n    const score = tokenRecall(reqText, `${p.title} ${body}`)\n    if (score < MATCH_THRESHOLD) continue\n    out.push({\n      reqIndex,\n      itemKey: `proposal:${p.id}`,\n      score,\n      evidence: `approved proposal '${p.title}' matched (token recall ${score.toFixed(2)})`,\n      content: body,\n    })\n  }\n  return out\n}\n\nfunction toolCallCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  toolCalls: string[],\n): Candidate[] {\n  const out: Candidate[] = []\n  toolCalls.forEach((name, i) => {\n    const score = tokenRecall(req.title, name)\n    if (score < MATCH_THRESHOLD) return\n    out.push({\n      reqIndex,\n      itemKey: `tool:${i}`,\n      score,\n      evidence: `tool call '${name}' matched (token recall ${score.toFixed(2)})`,\n      content: null,\n    })\n  })\n  return out\n}\n\n/**\n * Verify whether a run completed the task. `checkCorrectness` is injected —\n * `createLlmCorrectnessChecker` for production, a deterministic stub in tests.\n *\n * Throws on a gold spec with no requirements: an eval task that requires\n * nothing is a misconfiguration, not a vacuously-complete task.\n */\nexport async function verifyCompletion(\n  gold: TaskGold,\n  state: ProducedState,\n  checkCorrectness: CorrectnessChecker,\n): Promise<CompletionVerdict> {\n  if (gold.requirements.length === 0) {\n    throw new Error(\n      `verifyCompletion: task '${gold.taskId}' has no requirements — malformed gold spec`,\n    )\n  }\n\n  // Collect every above-threshold (requirement, produced-item) candidate, then\n  // assign greedily by descending score: each requirement and each produced\n  // item is used at most once. One deliverable fulfils one requirement.\n  const candidates: Candidate[] = []\n  gold.requirements.forEach((req, i) => {\n    const by = req.satisfiedBy ?? 'any'\n    if (by === 'artifact' || by === 'any') {\n      candidates.push(...artifactCandidates(req, i, state.artifacts))\n    }\n    if (by === 'proposal' || by === 'any') {\n      candidates.push(...proposalCandidates(req, i, state.proposals))\n    }\n    if (by === 'tool-call' || by === 'any') {\n      candidates.push(...toolCallCandidates(req, i, state.toolCalls))\n    }\n  })\n  candidates.sort((a, b) => b.score - a.score)\n\n  const assigned = new Map<number, Candidate>()\n  const itemTaken = new Set<string>()\n  for (const c of candidates) {\n    if (assigned.has(c.reqIndex) || itemTaken.has(c.itemKey)) continue\n    assigned.set(c.reqIndex, c)\n    itemTaken.add(c.itemKey)\n  }\n\n  const requirements: RequirementCheck[] = []\n  for (let i = 0; i < gold.requirements.length; i++) {\n    const req = gold.requirements[i]!\n    const match = assigned.get(i)\n    const evidence: string[] = []\n    let correct: boolean | null = null\n    let unmeasuredReason: string | undefined\n\n    if (match) {\n      evidence.push(match.evidence)\n      if (match.content !== null) {\n        try {\n          const r = await checkCorrectness(req, match.content)\n          correct = r.correct\n          evidence.push(`correctness: ${r.correct ? 'pass' : 'fail'} — ${r.reason}`)\n        } catch (err) {\n          // The CHECKER failed, not the requirement. Recording this as a\n          // zero would fabricate a model failure out of an infrastructure\n          // one; the requirement is unmeasured and leaves the denominator.\n          unmeasuredReason =\n            err instanceof JudgeParseError\n              ? `checker response unparseable after retry: ${err.raw.slice(0, 200)}`\n              : `checker call failed: ${err instanceof Error ? err.message : String(err)}`\n          evidence.push(`correctness: UNMEASURED — ${unmeasuredReason}`)\n        }\n      } else {\n        evidence.push('correctness: not assessed — matched item carries no content')\n      }\n    } else {\n      const by = req.satisfiedBy ?? 'any'\n      const kind = by === 'any' ? 'artifact/proposal/tool-call' : by\n      evidence.push(`no produced ${kind} matched this requirement`)\n    }\n\n    const structurallyPresent = match !== undefined\n    const unmeasured = unmeasuredReason !== undefined\n    const satisfied = structurallyPresent && !unmeasured && correct !== false\n    requirements.push({\n      reqId: req.reqId,\n      title: req.title,\n      structurallyPresent,\n      correct,\n      satisfied,\n      ...(unmeasured ? { unmeasured: true as const, unmeasuredReason } : {}),\n      evidence,\n    })\n  }\n\n  return completionVerdict({ taskId: gold.taskId, requirements })\n}\n\nexport interface LlmCorrectnessCheckerOpts {\n  model?: string\n  /** Optional ledger for direct use. */\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n  costTags?: Record<string, string>\n  signal?: AbortSignal\n  /** Exact maximum provider attempts configured on the supplied TCloud client. */\n  tcloudMaximumAttempts?: number\n  /** Usage/cost retained by a failed provider response; enables a safe retry. */\n  receiptFromError?: (error: Error, attempt: number) => CostReceiptInput | undefined\n  /** Max chars of artifact content sent to the checker. */\n  maxContentChars?: number\n  /**\n   * Checker LLM calls per requirement before giving up (parse failures and\n   * call errors both consume attempts). The failure then surfaces as an\n   * `unmeasured` requirement, never a zero.\n   */\n  maxAttempts?: number\n  /**\n   * Forensic capture of every checker request/response/error — without it a\n   * checker failure is unauditable (the agent-turn raws never contain the\n   * checker's own calls). Same sink contract as `LlmClient`.\n   */\n  rawSink?: RawProviderSink\n}\n\n/**\n * Parse the correctness checker's model response. Tolerates a response\n * truncated mid-JSON (max_tokens cap) by auto-closing the prefix — the\n * verdict boolean usually lands in the first few tokens, so a recovered\n * prefix with a boolean `correct` is a real measurement, not a guess.\n * Fails loud (JudgeParseError) when no boolean verdict is recoverable.\n */\nexport function parseCorrectnessResponse(raw: string): { correct: boolean; reason: string } {\n  const readVerdict = (candidate: unknown): { correct: boolean; reason: string } | null => {\n    if (candidate === null || typeof candidate !== 'object') return null\n    const { correct, reason } = candidate as { correct?: unknown; reason?: unknown }\n    if (typeof correct !== 'boolean') return null\n    return { correct, reason: typeof reason === 'string' ? reason : '' }\n  }\n\n  const match = raw.match(/\\{[\\s\\S]*\\}/)\n  if (match) {\n    try {\n      const strict = readVerdict(JSON.parse(match[0]))\n      if (strict) return strict\n    } catch {\n      // fall through to truncation recovery\n    }\n  }\n  // The strict path needs a closing `}`; a cap-hit response has none. Take\n  // everything from the first `{` and auto-close it.\n  const start = raw.indexOf('{')\n  if (start !== -1) {\n    const recovered = readVerdict(recoverTruncatedJson(raw.slice(start)))\n    if (recovered) return recovered\n  }\n  throw new JudgeParseError('correctness-checker', raw)\n}\n\n/**\n * Production `CorrectnessChecker` — one LLM call per matched artifact,\n * deterministic (temperature 0), structured JSON out. Judges fulfilment\n * only: a plan, a gesture, or a description of what should be done does not\n * fulfil a requirement — the artifact must BE the deliverable.\n */\nexport function createLlmCorrectnessChecker(\n  tc: TCloud,\n  opts: LlmCorrectnessCheckerOpts = {},\n): CorrectnessChecker {\n  const model = opts.model ?? 'claude-sonnet-4-6'\n  const maxContentChars = opts.maxContentChars ?? 8000\n  const maxAttempts = opts.maxAttempts ?? 2\n  const costLedger = opts.costLedger ?? new CostLedger()\n  const sink = opts.rawSink\n  const record = async (event: RawProviderEvent): Promise<void> => {\n    // Forensic capture is best-effort; the verdict is the system of record.\n    try {\n      await sink?.record(event)\n    } catch {\n      // Intentionally swallowed.\n    }\n  }\n  return async (requirement, content) => {\n    const request = {\n      model,\n      messages: [\n        {\n          role: 'system' as const,\n          content:\n            'You verify whether a produced work artifact actually fulfils a stated requirement. Judge fulfilment only — is the deliverable substantively present and on-point — not polish. A plan to do it later, a vague gesture, or a description of what should be done does NOT fulfil a requirement; the artifact must BE the deliverable. Respond with a single JSON object: {\"correct\": boolean, \"reason\": string (<= 30 words)}.',\n        },\n        {\n          role: 'user' as const,\n          content: `Requirement: ${requirement.title}\\n${\n            requirement.category ? `Category: ${requirement.category}\\n` : ''\n          }\\nProduced artifact:\\n${content.slice(0, maxContentChars)}`,\n        },\n      ],\n      temperature: 0,\n      maxTokens: 200,\n    } satisfies LlmCallRequest\n    let lastErr: unknown\n    for (let attempt = 0; attempt < maxAttempts; attempt++) {\n      const started = Date.now()\n      await record({\n        eventId: randomUUID(),\n        provider: 'correctness-checker',\n        model,\n        endpoint: '/chat',\n        baseUrl: '',\n        attemptIndex: attempt,\n        direction: 'request',\n        timestamp: started,\n        requestBody: request,\n        redactedFields: [],\n      })\n      try {\n        const paid = await costLedger.runPaidCall({\n          channel: 'verifier',\n          phase: opts.costPhase ?? 'completion.correctness',\n          actor: 'correctness-checker',\n          model,\n          maximumCharge: maximumChargeForTCloudRequest(request, opts.tcloudMaximumAttempts),\n          tags: {\n            ...opts.costTags,\n            requirementId: requirement.reqId,\n            attempt: String(attempt),\n          },\n          signal: opts.signal,\n          execute: () => tc.chat(request),\n          receipt: (response) => costReceiptFromTCloud(response, model),\n          receiptFromError: (error) => opts.receiptFromError?.(error, attempt),\n        })\n        if (!paid.succeeded) throw paid.error\n        const resp = paid.value\n        const raw =\n          (resp as { choices?: { message?: { content?: string } }[] }).choices?.[0]?.message\n            ?.content ?? ''\n        await record({\n          eventId: randomUUID(),\n          provider: 'correctness-checker',\n          model,\n          endpoint: '/chat',\n          baseUrl: '',\n          attemptIndex: attempt,\n          direction: 'response',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          responseBody: resp,\n          redactedFields: [],\n        })\n        return parseCorrectnessResponse(raw)\n      } catch (err) {\n        lastErr = err\n        await record({\n          eventId: randomUUID(),\n          provider: 'correctness-checker',\n          model,\n          endpoint: '/chat',\n          baseUrl: '',\n          attemptIndex: attempt,\n          direction: 'error',\n          timestamp: Date.now(),\n          durationMs: Date.now() - started,\n          errorMessage: err instanceof Error ? err.message : String(err),\n          redactedFields: [],\n        })\n      }\n    }\n    throw lastErr instanceof Error ? lastErr : new Error(String(lastErr))\n  }\n}\n\n/** Stopwords for requirement-title tokenization — drops the imperative verbs\n *  ('review', 'update', …) common to deliverable titles so recall keys on the\n *  substantive nouns, not the boilerplate ask. */\nconst TITLE_STOPWORDS = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'for',\n  'to',\n  'of',\n  'in',\n  'on',\n  'with',\n  'review',\n  'update',\n  'new',\n  'proposed',\n])\n\n/**\n * Deterministic `CorrectnessChecker` — the no-LLM counterpart to\n * `createLlmCorrectnessChecker`. A produced item fulfils a requirement when its\n * content is substantive (≥ `minContentLength` chars) AND recalls ≥ `minRecall`\n * of the requirement title's significant tokens. No network.\n *\n * Polarity-blind: token recall credits a negation that contains the\n * requirement's tokens (\"I will NOT produce the comparison\" recalls every token\n * of \"produce the comparison\"). The structural match stage is ALSO lexical, so\n * pairing the two collapses to a single gameable gate. Use this only as an\n * opt-in structural pre-filter or for tasks whose requirements have no polarity\n * to invert; for produced-state grading the correctness checker MUST be semantic\n * (`createLlmCorrectnessChecker`). See the anti-game fixtures in the test suite.\n */\nexport function createTokenRecallChecker(\n  opts: { minRecall?: number; minContentLength?: number } = {},\n): CorrectnessChecker {\n  const minRecall = opts.minRecall ?? 0.5\n  const minLen = opts.minContentLength ?? 120\n  return async (requirement, content) => {\n    const body = content.trim()\n    if (body.length < minLen)\n      return {\n        correct: false,\n        reason: `content too thin (${body.length} chars) to be the deliverable`,\n      }\n    const titleTokens = requirement.title\n      .toLowerCase()\n      .split(/[^a-z0-9]+/)\n      .filter((t) => t.length > 2 && !TITLE_STOPWORDS.has(t))\n    if (titleTokens.length === 0)\n      return {\n        correct: true,\n        reason: 'requirement title has no significant tokens — structural match accepted',\n      }\n    const lower = body.toLowerCase()\n    const hits = titleTokens.filter((t) => lower.includes(t)).length\n    const recall = hits / titleTokens.length\n    return recall >= minRecall\n      ? {\n          correct: true,\n          reason: `content recalls ${hits}/${titleTokens.length} requirement tokens`,\n        }\n      : {\n          correct: false,\n          reason: `content recalls only ${hits}/${titleTokens.length} requirement tokens`,\n        }\n  }\n}\n","/**\n * Produced-state extraction — normalize a run's runtime event stream into the\n * typed `ProducedState` the completion oracle consumes.\n *\n * `ProducedState` answers \"what did the agent actually produce\" — vault\n * artifacts, proposals, tool calls. The runtime emits these as a stream of\n * events; this module is the single normalization point from that stream to\n * the shape `verifyCompletion` expects.\n *\n * Input is structurally typed (`RuntimeEventLike`) so this module does not\n * depend on agent-runtime — agent-runtime's `RuntimeStreamEvent` satisfies it\n * structurally. The `content` on `ArtifactEventLike` and the whole\n * `proposal_created` variant are the runtime-side enrichments this contract\n * requires; the runtime emits them, this module consumes them.\n */\n\nimport type { Artifact } from './artifact-validator'\nimport type { ProducedProposal, ProducedState } from './completion-verifier'\n\n/** A tool the agent invoked. */\nexport interface ToolCallEventLike {\n  type: 'tool_call'\n  toolName: string\n}\n\n/**\n * An artifact the agent produced. `content` is the enriched field — the\n * runtime's base `artifact` event carries only metadata; the completion\n * oracle needs the body to verify the deliverable, so the runtime emits it.\n */\nexport interface ArtifactEventLike {\n  type: 'artifact'\n  artifactId: string\n  name?: string\n  mimeType?: string\n  uri?: string\n  content?: string\n}\n\n/** A proposal / filing the agent created. */\nexport interface ProposalEventLike {\n  type: 'proposal_created'\n  proposalId: string\n  title: string\n  status?: 'pending' | 'approved' | 'rejected'\n  // body of the proposal (e.g. a submit_proposal `description`). When present,\n  // the completion oracle correctness-checks it like artifact content; absent,\n  // the proposal is graded presence-only.\n  content?: string\n}\n\n/**\n * The subset of runtime stream events `extractProducedState` consumes.\n * agent-runtime's full `RuntimeStreamEvent` union satisfies this structurally;\n * the `{ type: string }` catch-all keeps the input permissive so callers can\n * pass the whole unfiltered telemetry stream — unrecognized events are skipped.\n */\nexport type RuntimeEventLike =\n  | ToolCallEventLike\n  | ArtifactEventLike\n  | ProposalEventLike\n  | { type: string }\n\nfunction artifactKind(mimeType: string | undefined): string {\n  if (!mimeType) return 'file'\n  if (mimeType.includes('json')) return 'json'\n  if (mimeType.startsWith('text/')) return 'text'\n  return 'file'\n}\n\n/**\n * Normalize a run's runtime event stream into `ProducedState`.\n *\n * Pure and total — unrecognized event types are skipped. `toolCalls` is\n * deduplicated by name in first-seen order (completion cares about a tool's\n * presence, not its call count). An artifact with neither a name nor a uri\n * still yields an entry keyed by its `artifactId` so it is never silently\n * dropped; an artifact with no `content` yields empty content, which the\n * completion oracle's structural check then rejects on its own.\n */\nexport function extractProducedState(events: readonly RuntimeEventLike[]): ProducedState {\n  const artifacts: Artifact[] = []\n  const proposals: ProducedProposal[] = []\n  const toolCalls: string[] = []\n  const seenTools = new Set<string>()\n\n  for (const ev of events) {\n    if (ev.type === 'tool_call') {\n      const name = (ev as ToolCallEventLike).toolName\n      if (name && !seenTools.has(name)) {\n        seenTools.add(name)\n        toolCalls.push(name)\n      }\n    } else if (ev.type === 'artifact') {\n      const a = ev as ArtifactEventLike\n      artifacts.push({\n        kind: artifactKind(a.mimeType),\n        path: a.name ?? a.uri ?? a.artifactId,\n        content: a.content ?? '',\n      })\n    } else if (ev.type === 'proposal_created') {\n      const p = ev as ProposalEventLike\n      proposals.push({\n        id: p.proposalId,\n        title: p.title,\n        status: p.status ?? 'pending',\n        ...(p.content !== undefined ? { content: p.content } : {}),\n      })\n    }\n  }\n\n  return { artifacts, proposals, toolCalls }\n}\n","/**\n * Product-flow playback — drive the REAL product through a user story and\n * score the produced state per requirement (the launch \"Jira tick-off\").\n *\n * This is the substrate adapter + contract only. It plugs a `PlaybackDriver`\n * into the existing `runProfileMatrix` dispatch seam: a driver drives the real\n * product (a Playwright UI session or a sandbox workspace) and returns the\n * runtime event stream; `extractProducedState` + `verifyCompletion` then score\n * each requirement PASS/FAIL. The concrete drivers live in consumers — they\n * depend on browser / runtime infra the substrate must not import — so\n * agent-eval owns the seam, the `UserStory` contract, and the scoreboard.\n */\n\nimport type { AgentProfile } from '@tangle-network/agent-interface'\nimport {\n  type CompletionRequirement,\n  type CompletionVerdict,\n  type CorrectnessChecker,\n  type ProducedState,\n  verifyCompletion,\n} from '../../completion-verifier'\nimport { extractProducedState, type RuntimeEventLike } from '../../produced-state'\nimport type { DispatchContext, Scenario } from '../types'\nimport type { ProfileDispatchFn } from './run-profile-matrix'\n\n/** One step of a user story — what the user does. The driver interprets\n *  `payload` (a Playwright selector + action, or a sandbox chat turn). */\nexport interface PlaybackStep {\n  /** Human-readable action, captured verbatim in the UX narrative. */\n  action: string\n  /** Driver-specific payload (e.g. `{ selector, fill }` or `{ turn }`). */\n  payload?: Record<string, unknown>\n}\n\n/**\n * A user story = a runnable product journey plus the requirements that define\n * \"this story works\". Each requirement is one Jira ticket line. Extends\n * `Scenario` so a catalog drops straight into `runProfileMatrix({ scenarios })`.\n */\nexport interface UserStory extends Scenario {\n  /** Human-readable story title (the ticket headline). */\n  title: string\n  /** Ordered steps the driver executes. */\n  steps: PlaybackStep[]\n  /** What must hold in the produced state for the story to pass. */\n  requirements: CompletionRequirement[]\n}\n\n/** Dispatch context plus the profile under test (which cheap model, etc.). */\nexport interface PlaybackContext extends DispatchContext {\n  profile: AgentProfile\n}\n\n/**\n * Drives the real product through a story and returns the runtime event stream\n * `extractProducedState` consumes. Implemented by CONSUMERS —\n * `SandboxPlaybackDriver` (real API / sandbox workspace) and\n * `PlaywrightPlaybackDriver` (real UI) — because they depend on runtime /\n * browser infra the substrate must not import. The driver MUST report LLM\n * usage through `ctx.cost.runPaidCall` so the backend-integrity check sees real\n * tokens (a run that never reports tokens reads as a stub).\n */\nexport interface PlaybackDriver<TStory extends UserStory = UserStory> {\n  run(story: TStory, ctx: PlaybackContext): Promise<readonly RuntimeEventLike[]>\n}\n\n/**\n * Adapt a `PlaybackDriver` into a `runProfileMatrix` dispatch. The artifact the\n * matrix scores is the `ProducedState` extracted from the driver's event\n * stream — grade it with `scoreUserStory` (or a judge wrapping it).\n */\nexport function makePlaybackDispatch<TStory extends UserStory>(\n  driver: PlaybackDriver<TStory>,\n): ProfileDispatchFn<TStory, ProducedState> {\n  return async (profile, scenario, ctx) => {\n    const events = await driver.run(scenario, { ...ctx, profile })\n    return extractProducedState(events)\n  }\n}\n\n/** A scored user story — the completion verdict plus its human title. */\nexport interface UserStoryVerdict extends CompletionVerdict {\n  title: string\n}\n\n/**\n * Score one story's produced state against its requirements. Thin wrapper over\n * `verifyCompletion` that builds the gold from the story and returns a\n * per-requirement PASS/FAIL verdict. `checkCorrectness` is injected — a\n * deterministic stub in tests, `createLlmCorrectnessChecker` in production.\n */\nexport async function scoreUserStory(\n  story: UserStory,\n  state: ProducedState,\n  checkCorrectness: CorrectnessChecker,\n): Promise<UserStoryVerdict> {\n  const verdict = await verifyCompletion(\n    { taskId: story.id, requirements: story.requirements },\n    state,\n    checkCorrectness,\n  )\n  return { ...verdict, title: story.title }\n}\n\n/** One row of the launch scoreboard — story × requirement → PASS/FAIL. */\nexport interface ScoreboardRow {\n  storyId: string\n  storyTitle: string\n  reqId: string\n  reqTitle: string\n  status: 'PASS' | 'FAIL'\n  evidence: string[]\n}\n\n/**\n * Flatten story verdicts into the per-requirement scoreboard — the literal\n * Jira tick-off: one row per (story, requirement) with PASS/FAIL and the\n * evidence behind the verdict.\n */\nexport function userStoryScoreboard(verdicts: readonly UserStoryVerdict[]): ScoreboardRow[] {\n  const rows: ScoreboardRow[] = []\n  for (const v of verdicts) {\n    for (const r of v.requirements) {\n      rows.push({\n        storyId: v.taskId,\n        storyTitle: v.title,\n        reqId: r.reqId,\n        reqTitle: r.title,\n        status: r.satisfied ? 'PASS' : 'FAIL',\n        evidence: r.evidence,\n      })\n    }\n  }\n  return rows\n}\n\n/** Launch-readiness headline counts rolled up from the per-requirement rows. */\nexport interface ScoreboardSummary {\n  /** Distinct user stories on the board. */\n  stories: number\n  /** Stories whose every requirement passed. */\n  storiesFullyComplete: number\n  /** Total (story, requirement) rows. */\n  requirements: number\n  /** Rows with status PASS. */\n  passed: number\n  /** Rows with status FAIL. */\n  failed: number\n  /** passed / requirements; 0 when there are no rows. */\n  passRate: number\n}\n\n/** Roll the per-requirement rows up into the launch headline counts. */\nexport function scoreboardSummary(rows: readonly ScoreboardRow[]): ScoreboardSummary {\n  const byStory = new Map<string, { total: number; passed: number }>()\n  let passed = 0\n  for (const r of rows) {\n    const s = byStory.get(r.storyId) ?? { total: 0, passed: 0 }\n    s.total++\n    if (r.status === 'PASS') {\n      s.passed++\n      passed++\n    }\n    byStory.set(r.storyId, s)\n  }\n  let storiesFullyComplete = 0\n  for (const s of byStory.values()) if (s.total > 0 && s.passed === s.total) storiesFullyComplete++\n  return {\n    stories: byStory.size,\n    storiesFullyComplete,\n    requirements: rows.length,\n    passed,\n    failed: rows.length - passed,\n    passRate: rows.length === 0 ? 0 : passed / rows.length,\n  }\n}\n\nexport interface ScoreboardRenderOptions {\n  /** Document H1. Defaults to a generic playback title. */\n  title?: string\n  /** Key/value run metadata rendered under the headline (runId, backend, model, date). */\n  meta?: Record<string, string>\n  /** Max chars of joined evidence shown per row. Default 160. */\n  maxEvidenceChars?: number\n}\n\nfunction escapeCell(s: string): string {\n  return s.replace(/\\|/g, '\\\\|').replace(/\\r?\\n/g, ' ')\n}\n\nfunction truncate(s: string, max: number): string {\n  return s.length <= max ? s : `${s.slice(0, Math.max(0, max - 1))}…`\n}\n\n/**\n * Render the scoreboard as a launch-readiness Markdown document — the literal\n * \"tick off every user story\" artifact: a headline roll-up, the open tickets\n * (FAIL rows) up top as the launch blockers, then a per-story table of\n * requirement → PASS/FAIL with the evidence behind each verdict. Pure: same\n * rows in, same bytes out (no clock/random), so it is safe to snapshot.\n */\nexport function renderScoreboardMarkdown(\n  rows: readonly ScoreboardRow[],\n  opts: ScoreboardRenderOptions = {},\n): string {\n  const maxEv = opts.maxEvidenceChars ?? 160\n  const sum = scoreboardSummary(rows)\n  const pct = (n: number) => `${Math.round(n * 100)}%`\n  const ev = (e: string[]) => escapeCell(truncate(e.join('; '), maxEv)) || '—'\n  const out: string[] = [`# ${opts.title ?? 'Product-flow playback scoreboard'}`, '']\n  if (opts.meta) {\n    for (const [k, v] of Object.entries(opts.meta)) out.push(`- **${k}:** ${v}`)\n    out.push('')\n  }\n  out.push(\n    `**${sum.storiesFullyComplete}/${sum.stories}** user stories fully shipped · ` +\n      `**${sum.passed}/${sum.requirements}** requirements passing (${pct(sum.passRate)}) · ` +\n      `**${sum.failed}** open`,\n    '',\n  )\n  const fails = rows.filter((r) => r.status === 'FAIL')\n  if (fails.length > 0) {\n    out.push('## Open tickets', '', '| Story | Requirement | Evidence |', '| --- | --- | --- |')\n    for (const r of fails) {\n      out.push(`| ${escapeCell(r.storyTitle)} | ${escapeCell(r.reqTitle)} | ${ev(r.evidence)} |`)\n    }\n    out.push('')\n  } else {\n    out.push('_All requirements passing — no open tickets._', '')\n  }\n  out.push('## Per-story tick-off', '')\n  for (const storyId of [...new Set(rows.map((r) => r.storyId))]) {\n    const storyRows = rows.filter((r) => r.storyId === storyId)\n    const passed = storyRows.filter((r) => r.status === 'PASS').length\n    const mark = passed === storyRows.length ? '✅' : '⚠️'\n    out.push(\n      `### ${escapeCell(storyRows[0]!.storyTitle)} — ${passed}/${storyRows.length} ${mark}`,\n      '',\n      '| Requirement | Status | Evidence |',\n      '| --- | --- | --- |',\n    )\n    for (const r of storyRows) {\n      out.push(\n        `| ${escapeCell(r.reqTitle)} | ${r.status === 'PASS' ? '✅ PASS' : '❌ FAIL'} | ${ev(r.evidence)} |`,\n      )\n    }\n    out.push('')\n  }\n  return out.join('\\n')\n}\n","/**\n * `runLineageLoop` — the live adapter that wires the {@link runLineage} DAG's\n * two abstract seams (`step`, `merge`) to the REAL improvement machinery, so the\n * multi-track, multi-parent improvement DAG can run against a real proposer +\n * real measurement.\n *\n * INTEGRATION CHOICE (smallest correct integration):\n *   - `step`  = ONE `SurfaceProposer.propose` from the track tip (a single GEPA\n *               reflective generation, small population) + one scoring campaign\n *               per candidate. The best-scoring candidate (elitist: the tip is\n *               kept in the pool so a step never regresses below its parent)\n *               becomes the new DAG node.\n *   - `merge` = the SAME proposer driven with `ctx.paretoParents` set to the\n *               2+ parent surfaces, which fires `gepaProposer`'s GEPA\n *               combine-complementary-lessons CROSSOVER, then one scoring\n *               campaign on the merged surface.\n *\n * We deliberately do NOT run a full {@link runImprovementLoop} (baseline\n * campaign + optimization + two holdout campaigns + gate + optional PR) per DAG\n * step — that is the OUTER gated-promotion shell for a single lineage, far too\n * heavy to fire once per node. The DAG {@link Governor} controls BREADTH across\n * steps (extend / branch / merge / prune); the inner step is intentionally one\n * small generation. This mirrors the task's guidance: \"Keep the improvement\n * budget per step SMALL (1 generation, small population).\"\n *\n * Both machinery halves are injectable seams so the loop is unit-testable\n * without a live model or a sandbox:\n *   - `proposer`     — defaults to {@link gepaProposer} (needs `llm` + `model`).\n *                      A test injects a pure stub `SurfaceProposer`.\n *   - `scoreSurface` — defaults to a {@link runCampaign} pass over\n *                      `holdoutScenarios ?? scenarios` (the \"agent\" =\n *                      `dispatchWithSurface`, the judges = `judges`). A test\n *                      injects a deterministic function of the surface string,\n *                      or supplies a stub `dispatchWithSurface` + `judges` and\n *                      exercises the real `runCampaign` path.\n *\n * Additive: no changes to `lineage.ts`, `run-optimization.ts`, or `gepa.ts`.\n */\n\nimport type { LlmClientOptions } from '../../llm-client'\nimport {\n  type Governor,\n  heuristicGovernor,\n  type Lineage,\n  type LineageNode,\n  type LineageStore,\n  type RunLineageSeed,\n  runLineage,\n} from '../lineage'\nimport { gepaProposer } from '../proposers/gepa'\nimport { type RunCampaignOptions, runCampaign } from '../run-campaign'\nimport { campaignBreakdown, campaignMeanComposite } from '../score-utils'\nimport type { CampaignStorage } from '../storage'\nimport {\n  isProposedCandidate,\n  type JudgeConfig,\n  type MutableSurface,\n  type ParetoParent,\n  type ProposedCandidate,\n  type Scenario,\n  type SurfaceProposer,\n} from '../types'\nimport { surfaceHash } from './run-optimization'\n\n/** A seed track: the initial surface + track identity. Unlike\n *  {@link RunLineageSeed} there is NO `score` — `runLineageLoop` scores each\n *  seed surface in an initial pass so seed fitness is measured, not asserted. */\nexport interface RunLineageLoopSeed {\n  surface: MutableSurface\n  track: string\n  /** Human label for the strategy driving this track (e.g. `solve`,\n   *  `outside-the-box`, `contrarian`). */\n  vision?: string\n  /** Proposer label recorded on the seed node (e.g. `gepa`, `seed`). */\n  proposer: string\n}\n\n/** The measured fitness of one surface — the value recorded on a DAG node. */\nexport interface SurfaceScore {\n  score: number\n  /** Per-objective vector (per-scenario composite) for Pareto dominance across\n   *  track tips. Omitted ⇒ the DAG uses the scalar `score`. */\n  scoreVector?: number[]\n}\n\nexport interface RunLineageLoopOptions<TScenario extends Scenario, TArtifact> {\n  /** The visioned tracks to seed the DAG with. Each is scored once up front. */\n  seeds: RunLineageLoopSeed[]\n\n  // ── Scoring machinery (default `scoreSurface` = a runCampaign pass) ────────\n  /** Scenarios the candidate surfaces are proposed against + scored on. */\n  scenarios: TScenario[]\n  /** Held-out scenarios used to SCORE each DAG node's fitness. Defaults to\n   *  `scenarios` when omitted. Scored the same way for seeds, steps, and merges\n   *  so every node's `score` is comparable. */\n  holdoutScenarios?: TScenario[]\n  /** Judges for the scoring campaign. */\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  /** The \"agent\" seam: run the CURRENT surface on a scenario → artifact. Same\n   *  shape as `runOptimization`'s `dispatchWithSurface`. Required UNLESS a\n   *  custom `scoreSurface` is injected. */\n  dispatchWithSurface?: (\n    surface: MutableSurface,\n    scenario: TScenario,\n    ctx: Parameters<RunCampaignOptions<TScenario, TArtifact>['dispatch']>[1],\n  ) => Promise<TArtifact>\n  /** Where scoring campaigns write. Required UNLESS `scoreSurface` is injected. */\n  runDir?: string\n\n  // ── Proposer machinery (default = gepaProposer) ───────────────────────────\n  /** Router transport for the default `gepaProposer`. Required UNLESS a custom\n   *  `proposer` is injected. */\n  llm?: LlmClientOptions\n  /** Model for the default `gepaProposer`. Required UNLESS a custom `proposer`\n   *  is injected. */\n  model?: string\n  /** What is being optimized — appears in the GEPA reflection/combine prompts.\n   *  Default `'agent surface'`. */\n  target?: string\n  /** Candidates proposed per extend/branch step (BREADTH within one step).\n   *  Default 4. The merge always proposes a single crossover. */\n  populationSize?: number\n\n  // ── DAG control ───────────────────────────────────────────────────────────\n  /** Agent-managed decision layer. Default {@link heuristicGovernor}. */\n  governor?: Governor\n  budget: { maxSteps: number }\n  store?: LineageStore\n\n  // ── Injectable seams (unit-testable without a live model) ─────────────────\n  /** Override the per-step proposer. Default {@link gepaProposer}. Inject a\n   *  pure stub to unit-test without an LLM. */\n  proposer?: SurfaceProposer\n  /** Override how a surface is scored into a DAG-node fitness. Default is a\n   *  {@link runCampaign} pass over `holdoutScenarios ?? scenarios`. Inject a\n   *  deterministic function to unit-test without a campaign. */\n  scoreSurface?: (surface: MutableSurface) => Promise<SurfaceScore>\n\n  // ── runCampaign passthroughs (consumed by the default `scoreSurface`) ─────\n  seed?: number\n  reps?: number\n  storage?: CampaignStorage\n  tracing?: 'on' | 'off'\n  expectUsage?: 'assert' | 'warn' | 'off'\n  maxConcurrency?: number\n  dispatchTimeoutMs?: number\n  /** Test seam — deterministic wall clock forwarded to `runCampaign`. */\n  now?: () => Date\n\n  log?: (msg: string, fields?: Record<string, unknown>) => void\n}\n\nexport interface RunLineageLoopResult {\n  lineage: Lineage\n  best: LineageNode | undefined\n  steps: number\n}\n\n/** Normalize a proposer output (bare surface OR `ProposedCandidate`) to its\n *  surface + optional rationale. */\nfunction toCandidate(p: MutableSurface | ProposedCandidate): {\n  surface: MutableSurface\n  rationale?: string\n} {\n  return isProposedCandidate(p)\n    ? { surface: p.surface, ...(p.rationale ? { rationale: p.rationale } : {}) }\n    : { surface: p }\n}\n\n/**\n * Wire the {@link runLineage} DAG's `step`/`merge` seams to a real\n * `SurfaceProposer` + a real scoring campaign and run the multi-track improvement\n * DAG live under a {@link Governor}.\n */\nexport async function runLineageLoop<TScenario extends Scenario, TArtifact>(\n  opts: RunLineageLoopOptions<TScenario, TArtifact>,\n): Promise<RunLineageLoopResult> {\n  const governor = opts.governor ?? heuristicGovernor()\n  const populationSize = opts.populationSize ?? 4\n  if (populationSize < 1) {\n    throw new Error('runLineageLoop: populationSize must be >= 1')\n  }\n\n  // ── Resolve the proposer seam ─────────────────────────────────────────────\n  let proposer = opts.proposer\n  if (!proposer) {\n    if (!opts.llm || !opts.model) {\n      throw new Error(\n        'runLineageLoop: a proposer is required — either inject `proposer`, or provide `llm` + `model` for the default gepaProposer.',\n      )\n    }\n    proposer = gepaProposer({\n      llm: opts.llm,\n      model: opts.model,\n      target: opts.target ?? 'agent surface',\n      // GEPA combine-complementary-lessons is what the `merge` seam relies on.\n      combineParents: true,\n    })\n  }\n\n  // ── Resolve the scoreSurface seam ─────────────────────────────────────────\n  const scoringScenarios = opts.holdoutScenarios ?? opts.scenarios\n  let scoreSurface = opts.scoreSurface\n  if (!scoreSurface) {\n    const dispatchWithSurface = opts.dispatchWithSurface\n    const runDir = opts.runDir\n    if (!dispatchWithSurface || !runDir) {\n      throw new Error(\n        'runLineageLoop: scoring is required — either inject `scoreSurface`, or provide `dispatchWithSurface` (the agent) + `runDir` for the default runCampaign scorer.',\n      )\n    }\n    if (scoringScenarios.length === 0) {\n      throw new Error(\n        'runLineageLoop: the default scorer needs at least one scenario (holdoutScenarios ?? scenarios is empty).',\n      )\n    }\n    scoreSurface = async (surface: MutableSurface): Promise<SurfaceScore> => {\n      const campaign = await runCampaign<TScenario, TArtifact>({\n        scenarios: scoringScenarios,\n        dispatch: (scenario, ctx) => dispatchWithSurface(surface, scenario, ctx),\n        dispatchRef: `lineage-loop:${surfaceHash(surface)}`,\n        runDir: `${runDir}/score/${surfaceHash(surface)}`,\n        ...(opts.judges ? { judges: opts.judges } : {}),\n        ...(opts.seed !== undefined ? { seed: opts.seed } : {}),\n        ...(opts.reps !== undefined ? { reps: opts.reps } : {}),\n        ...(opts.storage ? { storage: opts.storage } : {}),\n        ...(opts.tracing ? { tracing: opts.tracing } : {}),\n        ...(opts.expectUsage ? { expectUsage: opts.expectUsage } : {}),\n        ...(opts.maxConcurrency !== undefined ? { maxConcurrency: opts.maxConcurrency } : {}),\n        ...(opts.dispatchTimeoutMs !== undefined\n          ? { dispatchTimeoutMs: opts.dispatchTimeoutMs }\n          : {}),\n        ...(opts.now ? { now: opts.now } : {}),\n      })\n      const score = campaignMeanComposite(campaign)\n      // Build the objective vector in a STABLE order (scoringScenarios order) so\n      // component i is the same scenario across every scored surface — a\n      // prerequisite for the DAG's Pareto dominance across track tips.\n      const byId = new Map(\n        campaignBreakdown(campaign).scenarios.map((s) => [s.scenarioId, s.composite]),\n      )\n      const scoreVector = scoringScenarios.map((s) => byId.get(s.id) ?? 0)\n      return { score, scoreVector }\n    }\n  }\n\n  // Build the per-parent objective map GEPA's combine prompt reads: per-scenario\n  // composite when a scoreVector is present, else the scalar score. Aligned to\n  // `scoringScenarios` order (the same order `scoreSurface` builds the vector in).\n  const objectivesOf = (node: LineageNode): Record<string, number> => {\n    const objectives: Record<string, number> = {}\n    if (node.scoreVector && node.scoreVector.length > 0) {\n      scoringScenarios.forEach((s, i) => {\n        objectives[s.id] = node.scoreVector![i] ?? 0\n      })\n      if (Object.keys(objectives).length > 0) return objectives\n    }\n    objectives.composite = node.score\n    return objectives\n  }\n\n  // ── (1) Score every seed surface → RunLineageSeed[] ───────────────────────\n  const scoredSeeds: RunLineageSeed[] = []\n  for (const seed of opts.seeds) {\n    const measured = await scoreSurface(seed.surface)\n    scoredSeeds.push({\n      surface: seed.surface as string,\n      track: seed.track,\n      proposer: seed.proposer,\n      score: measured.score,\n      ...(seed.vision !== undefined ? { vision: seed.vision } : {}),\n      ...(measured.scoreVector !== undefined ? { scoreVector: measured.scoreVector } : {}),\n    })\n  }\n\n  // ── (2) The live `step` seam: propose from the tip, score, pick the best ──\n  const step = async (args: {\n    tip: LineageNode\n  }): Promise<SurfaceScore & { surface: string; rationale?: string }> => {\n    const proposed = await proposer!.propose({\n      currentSurface: args.tip.surface,\n      history: [],\n      findings: [],\n      populationSize,\n      generation: 0,\n      signal: new AbortController().signal,\n      paretoParents: [],\n    })\n\n    // Elitism: keep the tip in the pool so a step never regresses below its\n    // parent — mirrors runOptimization keeping the winner as the baseline when\n    // no candidate beats it. A tie resolves to the earliest pool entry (the tip\n    // first, then proposer order) → deterministic.\n    type PoolEntry = {\n      surface: MutableSurface\n      score: number\n      scoreVector?: number[]\n      rationale?: string\n    }\n    const pool: PoolEntry[] = [\n      {\n        surface: args.tip.surface,\n        score: args.tip.score,\n        ...(args.tip.scoreVector !== undefined ? { scoreVector: args.tip.scoreVector } : {}),\n        ...(args.tip.rationale !== undefined ? { rationale: args.tip.rationale } : {}),\n      },\n    ]\n    for (const p of proposed) {\n      const { surface, rationale } = toCandidate(p)\n      const measured = await scoreSurface!(surface)\n      pool.push({\n        surface,\n        score: measured.score,\n        ...(measured.scoreVector !== undefined ? { scoreVector: measured.scoreVector } : {}),\n        ...(rationale !== undefined ? { rationale } : {}),\n      })\n    }\n\n    let best = pool[0]!\n    for (const entry of pool) {\n      if (entry.score > best.score) best = entry\n    }\n    return {\n      surface: best.surface as string,\n      score: best.score,\n      ...(best.scoreVector !== undefined ? { scoreVector: best.scoreVector } : {}),\n      ...(best.rationale !== undefined ? { rationale: best.rationale } : {}),\n    }\n  }\n\n  // ── (3) The live `merge` seam: GEPA crossover of the parents, then score ──\n  const merge = async (args: {\n    parents: LineageNode[]\n  }): Promise<SurfaceScore & { surface: string; rationale?: string }> => {\n    // Order parents best-first; the strongest surface is the reflection base and\n    // GEPA reads each parent's per-scenario objectives to combine strengths.\n    const ordered = [...args.parents].sort((a, b) => b.score - a.score)\n    const paretoParents: ParetoParent[] = ordered.map((node) => ({\n      surface: node.surface,\n      surfaceHash: surfaceHash(node.surface),\n      objectives: objectivesOf(node),\n      composite: node.score,\n      generation: node.generation,\n    }))\n\n    const proposed = await proposer!.propose({\n      currentSurface: ordered[0]!.surface,\n      history: [],\n      findings: [],\n      // A merge is a single crossover; combineParents fires because\n      // paretoParents has > 1 string member.\n      populationSize: 1,\n      // generation >= 1 keeps the combine slot semantically a \"merge\" step.\n      generation: 1,\n      signal: new AbortController().signal,\n      paretoParents,\n    })\n\n    const first = proposed[0]\n    // Fall back to the best parent surface if the proposer returned nothing\n    // mergeable (a degenerate proposer) — never fabricate a surface.\n    const merged = first ? toCandidate(first) : { surface: ordered[0]!.surface as string }\n    const measured = await scoreSurface!(merged.surface)\n    return {\n      surface: merged.surface as string,\n      score: measured.score,\n      ...(measured.scoreVector !== undefined ? { scoreVector: measured.scoreVector } : {}),\n      ...(merged.rationale !== undefined ? { rationale: merged.rationale } : {}),\n    }\n  }\n\n  // ── (4) Run the DAG under the governor ────────────────────────────────────\n  const result = await runLineage({\n    seeds: scoredSeeds,\n    step,\n    merge,\n    governor,\n    budget: opts.budget,\n    ...(opts.store ? { store: opts.store } : {}),\n    ...(opts.log ? { log: opts.log } : {}),\n  })\n\n  return { lineage: result.lineage, best: result.best, steps: result.steps }\n}\n","/**\n * `runProfileMatrix` — the missing keystone between `runAgentMatrix` and the\n * backend-integrity guard.\n *\n * The gap it closes: `runAgentMatrix` is a topology-opaque scheduler whose\n * cells return a bare `{ output, verdict, costUsd }` — no `tokenUsage`, not a\n * `RunRecord`. `assertRealBackend` / `summarizeBackendIntegrity` key on\n * `RunRecord.tokenUsage`, so they cannot run on a raw matrix result. Every\n * consumer therefore hand-writes the same bridge: fan a profile × scenario\n * cartesian, call dispatch, fabricate a `RunRecord` with token usage, thread it\n * back, run the integrity guard. That hand-rolled bridge is exactly the pile of\n * bespoke `eval:*` scripts the adoption skills keep trying (and failing) to\n * forbid.\n *\n * `runProfileMatrix` IS that bridge, once:\n *\n *   - axis 3 (PROFILE) = `profiles: AgentProfile[]`\n *   - axis 1 (PERSONA/SCENARIO) = `scenarios: Scenario[]` (each scenario carries\n *     its persona; `personaOf` groups them for the `byPersona` pivot)\n *   - the scoring axis = `judges`\n *\n * It runs `runCampaign` once per profile (reusing its seeds, reps, bootstrap\n * CIs, resumability, and the `LabeledScenarioStore` capture flywheel), maps\n * every cell to a validated `RunRecord` carrying the real `tokenUsage` the\n * dispatch committed via `ctx.cost.runPaidCall`, and runs `assertRealBackend`\n * BY CONSTRUCTION before returning — so a stub-backend run fails loudly instead\n * of reporting a clean 0/N leaderboard.\n *\n * Dispatch contract: a dispatch that calls an LLM MUST report usage via\n * `ctx.cost.runPaidCall({ execute, receipt })`.\n * A dispatch that reports zero tokens is indistinguishable from a stub and the\n * integrity guard treats it as one.\n */\n\nimport { createHash } from 'node:crypto'\nimport { join } from 'node:path'\nimport {\n  type AgentProfile,\n  agentProfileHash,\n  agentProfileId,\n  agentProfileModelId,\n  HARNESS_NATIVE_MODEL,\n  harnessAxisOf,\n} from '../../agent-profile'\nimport { type AgentProfileCell, buildAgentProfileCell } from '../../agent-profile-cell'\nimport { AgentEvalError } from '../../errors'\nimport {\n  assertRealBackend,\n  type BackendIntegrityReport,\n  summarizeBackendIntegrity,\n} from '../../integrity/backend-integrity'\nimport {\n  modelHasSnapshot,\n  type RunOutcome,\n  type RunRecord,\n  type RunSplitTag,\n  validateRunRecord,\n} from '../../run-record'\nimport { runCampaign } from '../run-campaign'\nimport type { CampaignStorage } from '../storage'\nimport type {\n  CampaignCellResult,\n  CampaignResult,\n  DispatchContext,\n  JudgeConfig,\n  LabeledScenarioSource,\n  LabeledScenarioStore,\n  Scenario,\n} from '../types'\n\n/** Thrown when the matrix is misconfigured (no profiles, a profile whose model\n *  lacks a snapshot version, etc.). Distinct from `BackendIntegrityError`,\n *  which signals a stub backend at run time. */\nexport class ProfileMatrixError extends AgentEvalError {\n  constructor(message: string) {\n    super('profile_matrix', message)\n  }\n}\n\n/** Dispatch for one cell: render `profile` against `scenario`, returning the\n *  artifact the judges score. Run LLM work through `ctx.cost.runPaidCall` —\n *  the integrity check depends on its receipt. */\nexport type ProfileDispatchFn<TScenario extends Scenario, TArtifact> = (\n  profile: AgentProfile,\n  scenario: TScenario,\n  ctx: DispatchContext,\n) => Promise<TArtifact>\n\nexport interface RunProfileMatrixOptions<TScenario extends Scenario, TArtifact> {\n  /** Axis 3 — the agent-under-test configurations. Each is one column. */\n  profiles: AgentProfile[]\n  /** Axis 1 — the persona/scenario corpus, run against every profile. */\n  scenarios: TScenario[]\n  /** Renders one (profile, scenario) cell. */\n  dispatch: ProfileDispatchFn<TScenario, TArtifact>\n  /** The scoring axis. */\n  judges?: JudgeConfig<TArtifact, TScenario>[]\n  /** Where each profile's campaign writes artifacts/traces. One subdir per\n   *  profile. */\n  runDir: string\n  /** Git SHA the harness ran from — stamped onto every RunRecord (mandatory\n   *  for paper-grade records). */\n  commitSha: string\n  /** Logical experiment id shared across the whole matrix so the promotion\n   *  gate can pair profiles on matched scenarios. Default: a hash of the\n   *  profile + scenario ids. */\n  experimentId?: string\n  /** Which split these runs belong to. Default `'search'`. */\n  splitTag?: RunSplitTag\n  /** Replicates per (profile, scenario) cell for CI bands. Default 1. */\n  reps?: number\n  /** Campaign seed (per profile). Default 42. */\n  seed?: number\n  /**\n   * Backend-integrity posture, enforced AFTER the matrix completes:\n   *   - `'assert'` (default) — throw `BackendIntegrityError` if the run was a\n   *     stub (and, with `allowMixed:false`, if it was mixed).\n   *   - `'warn'` — log the verdict but never throw.\n   *   - `'off'` — skip the guard entirely (only for offline/replay analysis).\n   */\n  integrity?: 'assert' | 'warn' | 'off'\n  /** Forwarded to `assertRealBackend`. Default true (tolerate partial 429\n   *  cascades); set false for strict CI gates. */\n  allowMixed?: boolean\n  /** Max concurrent cells WITHIN each profile's campaign. Default 2.\n   *  Profiles run sequentially so the cost ceiling is honored deterministically. */\n  maxConcurrency?: number\n  /** Cumulative USD cap per profile campaign. */\n  costCeiling?: number\n  /** Capture flywheel — forwarded to each campaign. */\n  labeledStore?: LabeledScenarioStore | 'off'\n  captureSource?: LabeledScenarioSource\n  /** Storage backend. Default `fsCampaignStorage`. Pass\n   *  `inMemoryCampaignStorage()` for edge/CF-Worker/test runs. */\n  storage?: CampaignStorage\n  /** Test seam — override the wall clock. */\n  now?: () => Date\n  /** Optional persona key per scenario — drives the `byPersona` pivot. When\n   *  unset, `byPersona` is omitted. */\n  personaOf?: (scenario: TScenario) => string\n  /** Validate every produced RunRecord with `validateRunRecord` (fail-loud).\n   *  Default true — catches bad model snapshots and non-finite judge dims at\n   *  the boundary instead of letting them poison downstream analysis. */\n  validate?: boolean\n  /** Corpus-by-default: derive the trajectory text (`prompt` + `completion`)\n   *  for each cell from its artifact + scenario. When set, every produced\n   *  record carries `prompt`/`completion` (a `CorpusRecord`) so the run's\n   *  graded trajectories can be appended to the durable RL corpus with no\n   *  side-channel — `appendToCorpus(result.records, path)`. Fail-soft: a\n   *  throwing or undefined-returning extractor just omits the text. */\n  corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n}\n\nexport interface ProfileSummary {\n  profileId: string\n  profileHash: string\n  model: string\n  /** RunRecords produced for this profile (= scenarios × reps). */\n  records: number\n  /** Mean composite across this profile's records. */\n  meanComposite: number\n  totalCostUsd: number\n  /** Per-profile integrity verdict — surfaces a single profile that ran stub\n   *  even when the matrix as a whole looks real. */\n  integrity: BackendIntegrityReport\n}\n\nexport interface ScenarioRollup {\n  meanComposite: number\n  n: number\n}\n\nexport interface RunProfileMatrixResult<TArtifact, TScenario extends Scenario> {\n  matrixId: string\n  experimentId: string\n  /** One RunRecord per (profile, scenario, rep) cell — the integrity-checked,\n   *  paper-grade output. Feed straight into `analyzeRuns`, `HeldOutGate`,\n   *  scorecards, the hosted wire format. */\n  records: RunRecord[]\n  byProfile: Record<string, ProfileSummary>\n  byScenario: Record<string, ScenarioRollup>\n  /** Present only when `personaOf` was supplied. */\n  byPersona?: Record<string, ScenarioRollup>\n  /** Whole-matrix integrity report (the one `integrity:'assert'` enforces). */\n  integrity: BackendIntegrityReport\n  /** The raw per-profile campaign results, keyed by profile id. */\n  campaigns: Record<string, CampaignResult<TArtifact, TScenario>>\n}\n\nfunction sanitize(id: string): string {\n  return id.replace(/[^a-zA-Z0-9_-]/g, '_')\n}\n\nfunction sha(input: unknown): string {\n  return createHash('sha256').update(JSON.stringify(input)).digest('hex')\n}\n\nfunction mean(xs: number[]): number {\n  return xs.length === 0 ? 0 : xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\nfunction cellComposite(cell: CampaignCellResult<unknown>): number {\n  const composites = Object.values(cell.judgeScores).map((s) => s.composite)\n  return composites.length === 0 ? 0 : mean(composites)\n}\n\ninterface BuildRecordArgs<TScenario extends Scenario, TArtifact> {\n  cell: CampaignCellResult<TArtifact>\n  profile: AgentProfile\n  profileHash: string\n  configHash: string\n  experimentId: string\n  splitTag: RunSplitTag\n  commitSha: string\n  matrixId: string\n  /** The (profile, harness, model, dimensions) identity of this cell — attached to\n   *  every record so results group by the canonical `groupRunsByAgentProfileCell`\n   *  (harness/model aware) instead of profileId alone. */\n  agentProfileCell?: AgentProfileCell\n  scenario?: TScenario\n  corpusText?: (\n    artifact: TArtifact,\n    scenario: TScenario,\n  ) => { prompt: string; completion: string } | undefined\n}\n\n/**\n * Resolve the concrete, snapshot-bearing model for a cell whose profile\n * declared the `HARNESS_NATIVE_MODEL` sentinel (a vendor-locked harness that\n * resolves its model at runtime). The dispatch must have reported it via\n * the model in a paid-call receipt — surfaced as `cell.resolvedModel`. Throws when it is\n * missing or lacks a snapshot, so a provenance-broken row can never be\n * recorded as the bare sentinel.\n */\nfunction requireResolvedModel(cell: CampaignCellResult<unknown>, profileId: string): string {\n  const resolved = cell.resolvedModel?.trim()\n  if (!resolved) {\n    throw new ProfileMatrixError(\n      `profile '${profileId}' declared the '${HARNESS_NATIVE_MODEL}' runtime-resolved model but its dispatch reported no resolved model for cell '${cell.cellId}' — return it in the ctx.cost.runPaidCall receipt so the RunRecord pins the real model (never records '${HARNESS_NATIVE_MODEL}')`,\n    )\n  }\n  if (!modelHasSnapshot(resolved)) {\n    throw new ProfileMatrixError(\n      `profile '${profileId}' resolved to model '${resolved}' for cell '${cell.cellId}', which lacks a snapshot version — pin it (name@YYYY-MM-DD or name-YYYYMMDD) in the paid-call receipt`,\n    )\n  }\n  return resolved\n}\n\nfunction buildRunRecord<TScenario extends Scenario, TArtifact>(\n  args: BuildRecordArgs<TScenario, TArtifact>,\n): RunRecord {\n  const { cell, profile, profileHash, configHash, experimentId, splitTag, commitSha, matrixId } =\n    args\n  const profileId = agentProfileId(profile)\n  const declaredModel = agentProfileModelId(profile)\n  // Provenance guarantee: every recorded cell pins a real, snapshot-bearing\n  // model. A profile that declared the `HARNESS_NATIVE_MODEL` sentinel resolved\n  // its model at runtime — the dispatch commits it in the paid-call receipt,\n  // surfaced here as `cell.resolvedModel`. Substitute it (and require a\n  // snapshot). If the dispatch reported no resolved model, or an unpinned one,\n  // FAIL LOUD — never silently record the sentinel, which would erase which\n  // model actually produced the row.\n  const model =\n    declaredModel === HARNESS_NATIVE_MODEL ? requireResolvedModel(cell, profileId) : declaredModel\n  const composite = cellComposite(cell)\n\n  // Flatten judge dimensions (judge-prefixed to avoid collisions) into raw.\n  const raw: Record<string, number> = { composite }\n  const perJudge: Record<string, Record<string, number>> = {}\n  const dimAccum: Record<string, number[]> = {}\n  const notes: string[] = []\n  for (const [judgeName, js] of Object.entries(cell.judgeScores)) {\n    perJudge[judgeName] = { ...js.dimensions }\n    for (const [dim, value] of Object.entries(js.dimensions)) {\n      raw[`${judgeName}.${dim}`] = value\n      dimAccum[dim] ??= []\n      dimAccum[dim]!.push(value)\n    }\n    if (js.notes) notes.push(`${judgeName}: ${js.notes}`)\n  }\n  const perDimMean: Record<string, number> = {}\n  for (const [dim, values] of Object.entries(dimAccum)) perDimMean[dim] = mean(values)\n\n  // Cost / efficiency guardrail dimensions — RAW-ONLY. The composite stays the\n  // judge objective (anti-Goodhart); these are tracked + dashboarded + carried\n  // into the dataset, never optimized. Makes every run multi-dimensional by\n  // construction (the cost/tokens/latency the cell already reports). Computed\n  // ratios are guarded so a zero-cost stub or zero-quality cell never writes a\n  // non-finite value into the raw bag.\n  //\n  const costUsd = cell.costUsd\n  raw.cost_usd = costUsd\n  raw.cost_estimated = cell.costEstimated ? 1 : 0\n  raw.tokens_input = cell.tokenUsage.input\n  raw.tokens_output = cell.tokenUsage.output\n  if (typeof cell.tokenUsage.cached === 'number') raw.tokens_cached = cell.tokenUsage.cached\n  raw.latency_ms = cell.durationMs\n  if (costUsd > 0) {\n    raw.tokens_per_dollar = (cell.tokenUsage.input + cell.tokenUsage.output) / costUsd\n  }\n  if (composite > 0.01) raw.cost_per_quality = costUsd / composite\n\n  const outcome: RunOutcome =\n    splitTag === 'holdout' ? { holdoutScore: composite, raw } : { searchScore: composite, raw }\n  if (Object.keys(perJudge).length > 0) {\n    outcome.judgeScores = {\n      perJudge,\n      perDimMean,\n      composite,\n      ...(notes.length > 0 ? { notes: notes.join(' | ') } : {}),\n    }\n  }\n\n  const record: RunRecord & { prompt?: string; completion?: string } = {\n    runId: `${matrixId}:${profileId}:${cell.cellId}`,\n    experimentId,\n    candidateId: profileId,\n    seed: cell.seed,\n    model,\n    promptHash: profileHash,\n    configHash,\n    commitSha,\n    wallMs: cell.durationMs,\n    costUsd,\n    tokenUsage: cell.tokenUsage,\n    outcome,\n    splitTag,\n    scenarioId: cell.scenarioId,\n    ...(args.agentProfileCell ? { agentProfile: args.agentProfileCell } : {}),\n    ...(cell.error ? { failureMode: cell.error } : {}),\n  }\n\n  // Corpus-by-default: stamp the trajectory text onto the record (CorpusRecord\n  // shape — the validator ignores the extra keys) so the run is dataset-able\n  // with no side-channel. Fail-soft: a bad extractor never fails the run.\n  if (args.corpusText && args.scenario) {\n    try {\n      const text = args.corpusText(cell.artifact, args.scenario)\n      if (text && typeof text.prompt === 'string' && typeof text.completion === 'string') {\n        record.prompt = text.prompt\n        record.completion = text.completion\n      }\n    } catch {\n      // extractor threw — omit trajectory text, keep the graded record.\n    }\n  }\n  return record\n}\n\n/**\n * Profile × scenario matrix runner: fan N agent profiles across M scenarios, project each cell to a validated `RunRecord` with real token usage, and enforce the backend-integrity guard before returning.\n */\nexport async function runProfileMatrix<TScenario extends Scenario, TArtifact>(\n  opts: RunProfileMatrixOptions<TScenario, TArtifact>,\n): Promise<RunProfileMatrixResult<TArtifact, TScenario>> {\n  if (opts.profiles.length === 0) throw new ProfileMatrixError('profiles must not be empty')\n  if (opts.scenarios.length === 0) throw new ProfileMatrixError('scenarios must not be empty')\n\n  const splitTag = opts.splitTag ?? 'search'\n  const seed = opts.seed ?? 42\n  const validate = opts.validate ?? true\n  const integrityMode = opts.integrity ?? 'assert'\n  const profileIds = opts.profiles.map(agentProfileId)\n  const experimentId =\n    opts.experimentId ??\n    `pm_${sha({ profileIds, scenarios: opts.scenarios.map((s) => s.id) }).slice(0, 16)}`\n  const matrixId = `mtx_${sha({ experimentId, profileIds, seed, splitTag }).slice(0, 16)}`\n  // Scenario lookup for the corpus-text extractor (records carry trajectory text).\n  const scenarioById = new Map(opts.scenarios.map((s) => [s.id, s]))\n\n  // Preflight: every profile must hash (non-empty model) AND its model must\n  // carry a snapshot version, BEFORE any LLM spend. A probe record run through\n  // validateRunRecord catches both in the exact place they'd otherwise surface\n  // far downstream.\n  //\n  // Exception: a vendor-locked harness that snapped to `HARNESS_NATIVE_MODEL`\n  // declares no concrete model up front — the backend resolves it at runtime.\n  // Its declared model deliberately carries no snapshot, so probing it verbatim\n  // would fail the snapshot assertion for a profile that IS recordable (the\n  // resolved model, committed in the paid-call receipt, pins the RunRecord).\n  // Probe such a profile with a snapshot-bearing placeholder so the OTHER\n  // recordability checks still run, without asserting a snapshot the sentinel\n  // can't have. `buildRunRecord` enforces the real snapshot from the resolved\n  // model — never records the sentinel.\n  for (const profile of opts.profiles) {\n    const profileHash = agentProfileHash(profile)\n    const profileId = agentProfileId(profile)\n    const declaredModel = agentProfileModelId(profile)\n    const model =\n      declaredModel === HARNESS_NATIVE_MODEL\n        ? `${HARNESS_NATIVE_MODEL}@runtime-resolved`\n        : declaredModel\n    try {\n      validateRunRecord({\n        runId: `${matrixId}:${profileId}:probe`,\n        experimentId,\n        candidateId: profileId,\n        seed,\n        model,\n        promptHash: profileHash,\n        configHash: profileHash,\n        commitSha: opts.commitSha,\n        wallMs: 0,\n        costUsd: 0,\n        tokenUsage: { input: 0, output: 0 },\n        outcome:\n          splitTag === 'holdout' ? { holdoutScore: 0, raw: {} } : { searchScore: 0, raw: {} },\n        splitTag,\n      })\n    } catch (err) {\n      throw new ProfileMatrixError(\n        `profile '${profileId}' is not recordable: ${err instanceof Error ? err.message : String(err)}`,\n      )\n    }\n  }\n\n  const records: RunRecord[] = []\n  const campaigns: Record<string, CampaignResult<TArtifact, TScenario>> = {}\n  const byProfile: Record<string, ProfileSummary> = {}\n\n  for (const profile of opts.profiles) {\n    const profileHash = agentProfileHash(profile)\n    const profileId = agentProfileId(profile)\n    const declaredModel = agentProfileModelId(profile)\n    const configHash = sha({\n      profile: profileHash,\n      judges: (opts.judges ?? []).map((j) => j.name),\n      seed,\n      splitTag,\n    })\n\n    // Bind the profile into a campaign dispatch. Name it so the campaign's\n    // manifest hash is stable + distinct per profile.\n    const dispatch = (scenario: TScenario, ctx: DispatchContext): Promise<TArtifact> =>\n      opts.dispatch(profile, scenario, ctx)\n    Object.defineProperty(dispatch, 'name', { value: `profile_${sanitize(profileId)}` })\n\n    const campaign = await runCampaign<TScenario, TArtifact>({\n      scenarios: opts.scenarios,\n      dispatch,\n      judges: opts.judges,\n      seed,\n      reps: opts.reps,\n      maxConcurrency: opts.maxConcurrency,\n      costCeiling: opts.costCeiling,\n      labeledStore: opts.labeledStore,\n      captureSource: opts.captureSource,\n      storage: opts.storage,\n      now: opts.now,\n      runDir: join(opts.runDir, sanitize(profileId)),\n    })\n\n    // The canonical (profile, harness, model) identity for every record in this\n    // column, so results group by `groupRunsByAgentProfileCell` (harness/model\n    // aware). Harness comes from the axis stamp `expandProfileAxes` left on the\n    // profile; a profile that wasn't axis-expanded simply has no harness in its\n    // cell (unchanged grouping). The `model` is the profile's declared model\n    // UNLESS it snapped to the `HARNESS_NATIVE_MODEL` sentinel — then the cell\n    // identity must carry the RUNTIME-RESOLVED model per cell (surfaced via\n    // `cell.resolvedModel`), so the pivot groups by the real Kimi/etc. model and\n    // the cell identity matches the RunRecord's pinned model.\n    const axis = harnessAxisOf(profile)\n    const buildCellIdentity = (cellModel: string): Promise<AgentProfileCell> =>\n      buildAgentProfileCell({\n        profileId,\n        sourceProfile: { kind: 'agent-interface-profile', hash: profileHash },\n        model: cellModel,\n        ...(axis ? { harness: { id: axis.harness } } : {}),\n      })\n    // A profile with a concrete declared model builds its cell identity once and\n    // shares it; the sentinel path builds one per cell after resolution.\n    const sharedCellIdentity =\n      declaredModel === HARNESS_NATIVE_MODEL ? undefined : await buildCellIdentity(declaredModel)\n\n    const profileRecords: RunRecord[] = []\n    for (const cell of campaign.cells) {\n      const agentProfileCell =\n        sharedCellIdentity ?? (await buildCellIdentity(requireResolvedModel(cell, profileId)))\n      const record = buildRunRecord({\n        cell,\n        profile,\n        profileHash,\n        configHash,\n        experimentId,\n        splitTag,\n        commitSha: opts.commitSha,\n        matrixId,\n        agentProfileCell,\n        scenario: scenarioById.get(cell.scenarioId),\n        corpusText: opts.corpusText,\n      })\n      if (validate) validateRunRecord(record)\n      profileRecords.push(record)\n      records.push(record)\n    }\n\n    const totalCostUsd = campaign.aggregates.totalCostUsd\n    campaigns[profileId] = campaign\n\n    byProfile[profileId] = {\n      profileId,\n      profileHash,\n      // The declared model, unless it snapped to the sentinel — then the\n      // resolved model the cells actually ran on (all cells of a profile share\n      // one harness, so the first record's model is representative).\n      model:\n        declaredModel === HARNESS_NATIVE_MODEL\n          ? (profileRecords[0]?.model ?? declaredModel)\n          : declaredModel,\n      records: profileRecords.length,\n      meanComposite: mean(profileRecords.map(compositeOf)),\n      totalCostUsd,\n      integrity: summarizeBackendIntegrity(profileRecords),\n    }\n  }\n\n  // Integrity by construction — the whole point of the primitive.\n  const integrity = summarizeBackendIntegrity(records)\n  if (integrityMode === 'assert') {\n    assertRealBackend(records, { allowMixed: opts.allowMixed ?? true })\n  } else if (integrityMode === 'warn' && integrity.verdict !== 'real') {\n    // eslint-disable-next-line no-console\n    console.warn(\n      `[runProfileMatrix] backend integrity: ${integrity.verdict} — ${integrity.diagnosis}`,\n    )\n  }\n\n  // Pivots.\n  const byScenario = rollup(records, (r) => r.scenarioId)\n  const byPersona = opts.personaOf\n    ? rollupByPersona(records, opts.scenarios, opts.personaOf)\n    : undefined\n\n  return { matrixId, experimentId, records, byProfile, byScenario, byPersona, integrity, campaigns }\n}\n\n/** Composite for a produced RunRecord (the split score it carries). */\nfunction compositeOf(r: RunRecord): number {\n  return r.outcome.holdoutScore ?? r.outcome.searchScore ?? 0\n}\n\nfunction rollup(\n  records: RunRecord[],\n  keyOf: (r: RunRecord) => string | undefined,\n): Record<string, ScenarioRollup> {\n  const groups = new Map<string, number[]>()\n  for (const r of records) {\n    const key = keyOf(r)\n    if (key === undefined) continue\n    const arr = groups.get(key) ?? []\n    arr.push(compositeOf(r))\n    groups.set(key, arr)\n  }\n  const out: Record<string, ScenarioRollup> = {}\n  for (const [key, xs] of groups) out[key] = { meanComposite: mean(xs), n: xs.length }\n  return out\n}\n\nfunction rollupByPersona<TScenario extends Scenario>(\n  records: RunRecord[],\n  scenarios: TScenario[],\n  personaOf: (s: TScenario) => string,\n): Record<string, ScenarioRollup> {\n  const personaByScenarioId = new Map<string, string>()\n  for (const s of scenarios) personaByScenarioId.set(s.id, personaOf(s))\n  return rollup(records, (r) => (r.scenarioId ? personaByScenarioId.get(r.scenarioId) : undefined))\n}\n","import { createHash } from 'node:crypto'\nimport type { AgentProfile } from '@tangle-network/agent-interface'\nimport { type HarnessType, harnessSupportsModel } from '@tangle-network/agent-interface'\nimport { ValidationError } from './errors'\nimport { canonicalize } from './pre-registration'\n\nexport type { AgentProfile, HarnessType } from '@tangle-network/agent-interface'\n\n/**\n * The agentic coding harnesses an eval sweeps by default — the ones we care about\n * ranking. This is the SINGLE source of that list; consumers import it instead of\n * re-declaring their own (a re-declared list is how the fleet drifts). Pass an\n * explicit `harnesses` (e.g. `harnessTypeSchema.options` for literally every known\n * harness) to widen beyond these.\n */\nexport const CODING_HARNESSES: readonly HarnessType[] = [\n  'opencode',\n  'claude-code',\n  'codex',\n  'kimi-code',\n]\n\nexport interface ProfileAxisSpec {\n  /** The domain profile to sweep. Its prompt/tools/skills are held fixed; only the\n   *  harness and model vary. `model.default` is the fallback model. */\n  base: AgentProfile\n  /** Harnesses to cross. Default: {@link CODING_HARNESSES}. */\n  harnesses?: readonly HarnessType[]\n  /** Models to cross. Default: `[base.model.default]` — one model, i.e. today's\n   *  single-model behaviour, so omitting this never changes an existing run. */\n  models?: readonly string[]\n  /** Force every (harness, model) pair verbatim, even ones the harness can't run —\n   *  for deliberately testing failure modes. Default (false): SNAP instead — a\n   *  vendor-locked harness runs only the swept models in its family, or its native\n   *  default when it supports none, so no harness is dropped and none gets a\n   *  guaranteed-failing foreign-model cell. */\n  keepIncompatible?: boolean\n}\n\n/** Model sentinel for a vendor-locked harness that supports none of the swept models:\n *  it carries no provider prefix, so `harnessSupportsModel` accepts it and the harness\n *  resolves it to its own native default model at runtime (e.g. kimi-code → its Kimi\n *  model). Lets `expandProfileAxes` snap-instead-of-drop without a per-harness flagship\n *  table that would rot as router catalogs change. */\nexport const HARNESS_NATIVE_MODEL = 'default'\n\n/**\n * Expand a base profile across the harness × model matrix into the `AgentProfile[]`\n * that `runProfileMatrix` / `selfImprove` score — the ONE place \"which harnesses ×\n * which models do we evaluate\" lives, so no product hand-rolls its own harness list\n * or column→profile mapping (the pattern that let those copies drift and silently\n * break the harness pivot).\n *\n * Each cell clones `base`, sets `model.default`, and stamps `metadata.harness` +\n * `metadata.harnessModel` (both hash-bearing, so every cell gets a distinct\n * `agentProfileId` row and results join back by harness/model via {@link harnessAxisOf}\n * with no hand-recomputed key). A vendor-locked harness snaps to its family's swept\n * models — or its native default ({@link HARNESS_NATIVE_MODEL}) when it supports none —\n * so every requested harness runs; `keepIncompatible` forces every pair verbatim.\n *\n * Omit `harnesses`/`models` to sweep the full default set — the \"turn it on for\n * everything we care about\" switch, identical in shape whether one harness or all.\n */\nexport function expandProfileAxes(spec: ProfileAxisSpec): AgentProfile[] {\n  const harnesses = spec.harnesses ?? CODING_HARNESSES\n  if (harnesses.length === 0) throw new ValidationError('expandProfileAxes: no harnesses to sweep')\n  const baseModel = spec.base.model?.default\n  const models = spec.models ?? (baseModel ? [baseModel] : [])\n  if (models.length === 0) {\n    throw new ValidationError(\n      'expandProfileAxes: no models to sweep — base profile has no model.default and none were supplied',\n    )\n  }\n  const out: AgentProfile[] = []\n  const seen = new Set<string>()\n  for (const harness of harnesses) {\n    // A universal (router-backed) harness — opencode/pi/claudish — runs every swept\n    // model. A vendor-locked harness — codex/claude-code/kimi-code — runs only the\n    // swept models in its own family; when it supports NONE of them it snaps to its\n    // native default (the `HARNESS_NATIVE_MODEL` sentinel it resolves at runtime)\n    // rather than being dropped, so every requested harness still appears in the\n    // sweep on a model it can actually run — e.g. sweeping `deepseek/x` puts opencode\n    // on deepseek and kimi-code on its own Kimi model, a real head-to-head.\n    // `keepIncompatible` forces every (harness, model) pair verbatim (failure-mode runs).\n    const supported = spec.keepIncompatible\n      ? models\n      : models.filter((model) => harnessSupportsModel(harness, model))\n    const effective = supported.length > 0 ? supported : [HARNESS_NATIVE_MODEL]\n    for (const model of effective) {\n      const profile: AgentProfile = {\n        ...spec.base,\n        name: `${spec.base.name ?? 'agent'}/${harness}/${model}`,\n        model: { ...spec.base.model, default: model },\n        metadata: { ...(spec.base.metadata ?? {}), harness, harnessModel: model },\n      }\n      const id = agentProfileId(profile)\n      if (seen.has(id)) continue\n      seen.add(id)\n      out.push(profile)\n    }\n  }\n  if (out.length === 0) {\n    // Unreachable in normal use — snapping guarantees ≥1 cell per harness — but keep a\n    // fail-closed guard so a future refactor can't silently produce an empty sweep.\n    throw new ValidationError(\n      `expandProfileAxes: produced no profiles (harnesses=[${harnesses.join(', ')}], models=[${models.join(', ')}]).`,\n    )\n  }\n  return out\n}\n\n/**\n * Read the (harness, model) a matrix cell ran under, off a profile or a result row's\n * profile — the join-back for a `byHarness` pivot. Returns undefined when the profile\n * wasn't produced by {@link expandProfileAxes}. Callers group `result.byProfile` by\n * this instead of recomputing an id (recomputing the wrong key is what broke the pivot\n * in the hand-rolled copies).\n */\nexport function harnessAxisOf(\n  profile: Pick<AgentProfile, 'metadata'>,\n): { harness: HarnessType; model: string } | undefined {\n  const m = profile.metadata as Record<string, unknown> | undefined\n  const harness = m?.harness\n  const model = m?.harnessModel\n  if (typeof harness === 'string' && typeof model === 'string') {\n    return { harness: harness as HarnessType, model }\n  }\n  return undefined\n}\n\n/**\n * Collision-resistant, path-safe, human-readable profile id for eval artifacts.\n * Scorecard joins still use `agentProfileHash`; this id is for run ids, matrix\n * keys, and directory names where two profiles must not collapse onto one row.\n * The suffix is the first 64 bits of the behaviour hash, enough for ordinary\n * eval matrices while keeping filenames readable.\n */\nexport function agentProfileId(profile: AgentProfile): string {\n  const label = pathSafeProfileLabel(agentProfileDisplayLabel(profile)) ?? 'profile'\n  return `${label}-${agentProfileHash(profile).slice(0, 16)}`\n}\n\n/**\n * Model snapshot used for `RunRecord.model`. Eval surfaces require a concrete\n * model id because run records reject bare/missing model aliases.\n */\nexport function agentProfileModelId(profile: AgentProfile): string {\n  const model = profile.model?.default?.trim()\n  if (!model) {\n    const label = agentProfileDisplayLabel(profile) ?? 'unnamed profile'\n    throw new ValidationError(\n      `AgentProfile \"${label}\" has no model.default — cannot record eval run`,\n    )\n  }\n  return model\n}\n\nfunction agentProfileDisplayLabel(profile: AgentProfile): string | undefined {\n  return profile.name?.trim() || profile.version?.trim() || undefined\n}\n\nfunction pathSafeProfileLabel(label: string | undefined): string | undefined {\n  const safe = label\n    ?.trim()\n    .replace(/[^A-Za-z0-9._-]+/g, '-')\n    .replace(/-+/g, '-')\n    .replace(/^-|-$/g, '')\n  return safe || undefined\n}\n\nfunction compact<T extends Record<string, unknown>>(input: T): Partial<T> {\n  const out: Record<string, unknown> = {}\n  for (const [key, value] of Object.entries(input)) {\n    if (value !== undefined) out[key] = value\n  }\n  return out as Partial<T>\n}\n\n/**\n * Deterministic behaviour identity for the canonical\n * `@tangle-network/agent-interface` AgentProfile.\n *\n * `name` and `description` are labels and do not affect the hash. Profile\n * `version`, prompt, model hints, tools, resources, hooks, modes, permissions,\n * and extensions do affect the hash. Resource array order is hash-bearing\n * because mount order can change agent behaviour. Undefined fields are treated\n * as absent; explicit `null` fields remain hash-bearing.\n */\nexport function agentProfileHash(profile: AgentProfile): string {\n  const model = agentProfileModelId(profile)\n  const behaviour = {\n    ...profile,\n    name: undefined,\n    description: undefined,\n    tags: profile.tags ? [...profile.tags].sort() : undefined,\n    model: compact({ ...profile.model, default: model }),\n  }\n  return createHash('sha256')\n    .update(JSON.stringify(canonicalize(behaviour)))\n    .digest('hex')\n}\n","/**\n * Shared finding→text helpers for the curator-style proposers (`memoryCurationProposer`\n * dedup-and-replace, `aceProposer` append-mostly). One copy so the two proposers\n * extract lessons + normalize keys identically and cannot drift apart.\n */\n\nimport type { MutableSurface } from '../types'\n\n/** A finding can be a raw string or a structured analyst finding. Pulls the\n *  most actionable text (recommended_action > claim > lesson > text > message). */\nexport function findingToLesson(f: unknown): string | null {\n  if (typeof f === 'string') return f.trim() || null\n  if (f && typeof f === 'object') {\n    const o = f as Record<string, unknown>\n    const cand = o.recommended_action ?? o.claim ?? o.lesson ?? o.text ?? o.message\n    if (typeof cand === 'string' && cand.trim()) return cand.trim()\n  }\n  return null\n}\n\n/** Normalize for dedup/idempotency: lowercase, collapse whitespace, strip\n *  trailing punctuation. */\nexport function normKey(s: string): string {\n  return s\n    .toLowerCase()\n    .replace(/\\s+/g, ' ')\n    .replace(/[.;:!?\\s]+$/, '')\n    .trim()\n}\n\n/** Curator proposers are prompt-tier — they manage a text block in the surface.\n *  A code-tier surface has no prompt to append to; fail loud rather than\n *  silently coercing. */\nexport function surfaceToText(surface: MutableSurface): string {\n  if (typeof surface === 'string') return surface\n  throw new Error(\n    `curator proposer: surface must be a string prompt, got a ${surface.kind}-tier surface (${surface.worktreeRef}) — curation is prompt-tier`,\n  )\n}\n\n// ── Delimited-block IO (the part ace + memory curators share) ──────────\n// Both manage a marker-delimited block in the surface; only the bullet\n// format + retention policy differ. One copy of the read/strip so they\n// cannot drift on how they find or remove the block.\n\n/** Body text strictly between `startMarker` and `endMarker`; '' if absent. */\nexport function extractBlockBody(text: string, startMarker: string, endMarker: string): string {\n  const start = text.indexOf(startMarker)\n  const end = text.indexOf(endMarker)\n  if (start === -1 || end === -1 || end < start) return ''\n  return text.slice(start + startMarker.length, end)\n}\n\n/** Remove the delimited block (and surrounding trailing whitespace), trimmed,\n *  so the caller can re-emit a fresh block. */\nexport function stripBlock(text: string, startMarker: string, endMarker: string): string {\n  const start = text.indexOf(startMarker)\n  const end = text.indexOf(endMarker)\n  if (start === -1 || end === -1 || end < start) return text.trimEnd()\n  return (text.slice(0, start) + text.slice(end + endMarker.length)).trimEnd()\n}\n","/**\n * `aceProposer` — Agentic Context Engineering: an APPEND-MOSTLY curator, the\n * deliberate contrast to `memoryCurationProposer`'s dedup-and-replace. ACE's\n * thesis (arXiv:2510.04618) is that aggressively deduping/rewriting a context\n * causes \"context collapse\" — hard-won specific lessons get summarized away. So\n * the playbook GROWS by appending each generation's new lessons as provenance-\n * tagged delta bullets; existing bullets are preserved verbatim, never merged.\n *\n * Each generation it:\n *  1. reads the playbook block already in the parent surface (verbatim);\n *  2. turns this generation's `findings` into lessons, keeping only the ones not\n *     already present (idempotency — a recurring finding is not re-appended, but\n *     a genuinely NEW lesson always is, even if similar to an old one);\n *  3. appends the new lessons as `- [gN] <lesson>` deltas and re-emits the block.\n *\n * Bounded WITHOUT collapse: when the playbook exceeds `maxEntries`, the OLDEST\n * deltas are evicted (FIFO) — recency is kept, but no two distinct lessons are\n * ever merged into one. Deterministic (no LLM) so a lift is attributable to the\n * accumulated lessons, not a rewrite's model noise.\n *\n * Fail-loud: with no new lesson this generation it returns NO candidate (the\n * playbook is unchanged — nothing to propose), never a fabricated bullet.\n */\n\nimport type { ProposeContext, ProposedCandidate, SurfaceProposer } from '../types'\nimport {\n  extractBlockBody,\n  findingToLesson,\n  normKey,\n  stripBlock,\n  surfaceToText,\n} from './_findings-text'\n\nconst BLOCK_START = '<!-- BEGIN ace-playbook (auto-managed by aceProposer) -->'\nconst BLOCK_END = '<!-- END ace-playbook -->'\nconst DEFAULT_HEADING = '## Playbook (accumulated lessons — append-only)'\n\nexport interface AceProposerOptions {\n  /** Max delta bullets retained in the playbook. On overflow the OLDEST are\n   *  evicted (FIFO) — never merged. Default 50 (ACE keeps a long context). */\n  maxEntries?: number\n  /** Heading rendered above the bullets inside the block. */\n  sectionHeading?: string\n}\n\ninterface Bullet {\n  /** Generation tag the lesson was first appended at. */\n  gen: number\n  text: string\n}\n\n/** Parse the existing playbook block into bullets, preserving order + tags. A\n *  bullet line is `- [gN] <text>`; an untagged `- <text>` is tolerated (gen -1). */\nfunction parsePlaybook(surface: string): Bullet[] {\n  const body = extractBlockBody(surface, BLOCK_START, BLOCK_END)\n  const out: Bullet[] = []\n  for (const raw of body.split('\\n')) {\n    const line = raw.trim()\n    if (!line.startsWith('- ')) continue\n    const item = line.slice(2).trim()\n    const tag = /^\\[g(-?\\d+)\\]\\s*(.*)$/.exec(item)\n    if (tag) out.push({ gen: Number(tag[1]), text: tag[2]!.trim() })\n    else out.push({ gen: -1, text: item })\n  }\n  return out\n}\n\n/**\n * Append-only context engineering proposer: grows a skill playbook by appending generation-tagged lessons without merging or overwriting prior entries.\n */\nexport function aceProposer(opts: AceProposerOptions = {}): SurfaceProposer {\n  const maxEntries = opts.maxEntries ?? 50\n  if (maxEntries < 1) throw new Error('aceProposer: maxEntries must be >= 1')\n  const heading = opts.sectionHeading ?? DEFAULT_HEADING\n\n  return {\n    kind: 'ace',\n    async propose(ctx: ProposeContext): Promise<ProposedCandidate[]> {\n      const parent = surfaceToText(ctx.currentSurface)\n      const existing = parsePlaybook(parent)\n      const seen = new Set(existing.map((b) => normKey(b.text)))\n\n      // New lessons from this generation's findings — only those not already in\n      // the playbook (idempotent; a recurring finding never duplicates a bullet).\n      const fresh: Bullet[] = []\n      for (const f of ctx.findings ?? []) {\n        const lesson = findingToLesson(f)\n        if (!lesson) continue\n        const k = normKey(lesson)\n        if (!k || seen.has(k)) continue\n        seen.add(k)\n        fresh.push({ gen: ctx.generation, text: lesson })\n      }\n\n      // Nothing genuinely new ⇒ the playbook is unchanged ⇒ no candidate.\n      if (fresh.length === 0) return []\n\n      // Append (preserving existing verbatim), then FIFO-evict the oldest on\n      // overflow — recency kept, distinct lessons never merged.\n      const all = [...existing, ...fresh].slice(-maxEntries)\n      const block = [\n        BLOCK_START,\n        heading,\n        ...all.map((b) => `- [g${b.gen}] ${b.text}`),\n        BLOCK_END,\n      ].join('\\n')\n      const base = stripBlock(parent, BLOCK_START, BLOCK_END)\n      const surface = base ? `${base}\\n\\n${block}` : block\n\n      return [\n        {\n          surface,\n          label: `ace-playbook +${fresh.length}`,\n          rationale: `appended ${fresh.length} new lesson(s) from gen ${ctx.generation} findings (playbook now ${all.length} bullet(s), append-only)`,\n        },\n      ]\n    },\n  }\n}\n","/**\n * `compositeProposer` — run N proposers TOGETHER on the same surface.\n *\n * The question this answers (\"why can't we combine GEPA + skillOpt + ACE + a\n * trace-analyst?\"): nothing in the loop cares where candidates come from — the\n * generation's population is one pool and the Pareto frontier / promotion logic\n * evaluates every candidate identically. The only missing piece was a proposer\n * that fans the population budget out across members and merges their proposals.\n * This is that piece.\n *\n * Semantics:\n *   - Budget: each member is asked for a share of `populationSize`\n *     (near-equal split by default, or explicit `weights`). Members may return\n *     fewer; the pool is topped up round-robin from members that can offer more\n *     is NOT attempted — proposers are not obligated to be re-entrant.\n *   - Provenance: every candidate's `label` is prefixed with its member's kind\n *     (`gepa:...`, `skill-opt:...`) so generation records and the promotion\n *     provenance attribute each winner to the proposer family that made it —\n *     the cheap, honest version of proposer-level credit assignment.\n *   - Dedup: identical surfaces from different members collapse to the first.\n *   - Failure isolation: one member throwing does not sink the generation; its\n *     error is logged into the surviving candidates' generation via a warning\n *     and the pool proceeds (a generation with zero candidates from all members\n *     failing still throws — that is a real failure).\n *   - Early stop: the composite stops only when EVERY member with a `decide`\n *     votes stop (a member without `decide` never votes stop).\n *\n * This is deliberately NOT joint multi-surface mutation: every member mutates\n * the SAME `MutableSurface`. Joint profile-patch surfaces (prompt+skills+tools\n * in one candidate) require the composite-surface contract and measured\n * component attribution — see the experiment-optimal research brief.\n */\n\nimport { surfaceContentHash } from '../surface-identity'\nimport type {\n  GenerationRecord,\n  MutableSurface,\n  ProposeContext,\n  ProposedCandidate,\n  SurfaceProposer,\n} from '../types'\n\nexport interface CompositeProposerOptions<TFindings = unknown> {\n  /** Member proposers, in priority order (earlier members get the larger share\n   *  of an uneven split). At least one required. */\n  proposers: Array<SurfaceProposer<TFindings>>\n  /** Optional population-share weights, same length as `proposers`. Need not\n   *  sum to anything; shares are proportional. Default: equal. */\n  weights?: number[]\n}\n\n/** Fan the population budget across N proposers and merge their candidates into\n *  one generation pool, with per-member provenance labels. */\nexport function compositeProposer<TFindings = unknown>(\n  opts: CompositeProposerOptions<TFindings>,\n): SurfaceProposer<TFindings> {\n  const members = opts.proposers\n  if (members.length === 0)\n    throw new Error('compositeProposer: at least one member proposer required')\n  const weights = opts.weights ?? members.map(() => 1)\n  if (weights.length !== members.length || weights.some((w) => !(w > 0))) {\n    throw new Error('compositeProposer: weights must match proposers length and be positive')\n  }\n\n  return {\n    kind: `composite(${members.map((m) => m.kind).join('+')})`,\n\n    async propose(\n      ctx: ProposeContext<TFindings>,\n    ): Promise<Array<MutableSurface | ProposedCandidate>> {\n      const totalWeight = weights.reduce((a, b) => a + b, 0)\n      // Largest-remainder split so shares sum exactly to populationSize and\n      // every member with positive weight gets at least the floor of its share.\n      const exact = weights.map((w) => (ctx.populationSize * w) / totalWeight)\n      const shares = exact.map((e) => Math.floor(e))\n      let remaining = ctx.populationSize - shares.reduce((a, b) => a + b, 0)\n      const byRemainder = exact\n        .map((e, i) => ({ i, rem: e - Math.floor(e) }))\n        .sort((a, b) => b.rem - a.rem)\n      for (const { i } of byRemainder) {\n        if (remaining <= 0) break\n        shares[i] = (shares[i] ?? 0) + 1\n        remaining -= 1\n      }\n\n      const pool: ProposedCandidate[] = []\n      const seen = new Set<string>()\n      const errors: string[] = []\n      for (let i = 0; i < members.length; i += 1) {\n        const member = members[i]\n        const share = shares[i] ?? 0\n        if (!member || share === 0 || ctx.signal.aborted) continue\n        try {\n          const proposals = await member.propose({ ...ctx, populationSize: share })\n          for (const proposal of proposals) {\n            const isCandidate =\n              typeof proposal === 'object' && proposal !== null && 'surface' in proposal\n            const surface = isCandidate\n              ? (proposal as ProposedCandidate).surface\n              : (proposal as MutableSurface)\n            const label = isCandidate ? (proposal as ProposedCandidate).label : 'candidate'\n            const rationale = isCandidate ? (proposal as ProposedCandidate).rationale : ''\n            const candidateRecord = isCandidate\n              ? (proposal as ProposedCandidate).candidateRecord\n              : undefined\n            const key = surfaceContentHash(surface)\n            if (seen.has(key)) continue\n            seen.add(key)\n            pool.push({\n              surface,\n              label: `${member.kind}:${label}`,\n              rationale,\n              ...(candidateRecord ? { candidateRecord } : {}),\n            })\n          }\n        } catch (err) {\n          errors.push(`${member.kind}: ${err instanceof Error ? err.message : String(err)}`)\n        }\n      }\n      if (pool.length === 0) {\n        throw new Error(\n          `compositeProposer: every member failed or proposed nothing${errors.length ? ` — ${errors.join('; ')}` : ''}`,\n        )\n      }\n      if (errors.length > 0) {\n        console.warn(\n          `[compositeProposer] ${errors.length} member(s) failed this generation: ${errors.join('; ')}`,\n        )\n      }\n      return pool.slice(0, ctx.populationSize)\n    },\n\n    decide(args: { history: GenerationRecord[] }): { stop: boolean; reason?: string } {\n      const votes = members\n        .filter((m) => typeof m.decide === 'function')\n        .map((m) => (m.decide as NonNullable<SurfaceProposer<TFindings>['decide']>)(args))\n      if (votes.length === 0) return { stop: false }\n      const allStop = votes.every((v) => v.stop)\n      return allStop\n        ? {\n            stop: true,\n            reason:\n              votes\n                .map((v) => v.reason)\n                .filter(Boolean)\n                .join('; ') || 'all members converged',\n          }\n        : { stop: false }\n    },\n  }\n}\n","/**\n * `haloProposer` — wraps the REAL halo-engine (Inference.net's hierarchical\n * agentic trace analyzer, `pip install halo-engine`, repo context-labs/halo)\n * as an agent-eval `SurfaceProposer`, so HALO competes head-to-head with\n * `gepaProposer` — and with our own `traceAnalystProposer` — inside `compareProposers`\n * on identical traces / scenarios / held-out scoring.\n *\n * It PRESERVES halo's actual working usage — `analyze` shells out to the\n * published CLI (`halo <traces.jsonl> -p <prompt> -m <model>`) and uses its real\n * RLM findings verbatim. We do NOT reimplement its analysis; that would make the\n * benchmark meaningless. The materialize/apply pipeline is the shared\n * `analysisEditProposer` — identical to `traceAnalystProposer`, which is what makes\n * the comparison apples-to-apples.\n *\n * Fail-loud: no traces → throw; halo errors → throw; empty findings → throw.\n */\n\nimport { execFile } from 'node:child_process'\nimport { promisify } from 'node:util'\nimport type { CostLedgerHandle, CostReceiptInput, MaximumCharge } from '../../cost-ledger'\nimport type { LlmClientOptions } from '../../llm-client'\nimport type { ProposeContext, SurfaceProposer } from '../types'\nimport { analysisEditProposer } from './analysis-edit'\n\nconst execFileAsync = promisify(execFile)\n\nexport interface HaloProposerOptions {\n  /** OpenAI-compatible base URL for BOTH halo's RLM analysis and the apply\n   *  step (e.g. the Tangle router `https://router.tangle.tools/v1`). */\n  baseUrl: string\n  /** Bearer key (else relies on OPENAI_API_KEY in the env halo inherits). */\n  apiKey?: string\n  /** Model for halo's `--model` (its RLM). Default 'gpt-5.4-mini' (halo's own default). */\n  model?: string\n  /** Model used to APPLY halo's findings to the prompt surface. Default = `model`. */\n  applyModel?: string\n  /** Optional ledger for direct proposer use. Campaign context takes precedence. */\n  costLedger?: CostLedgerHandle\n  analysisMaximumCharge?: MaximumCharge\n  analysisReceipt?: (report: string) => CostReceiptInput\n  applyMaxTokens?: number\n  /** The real halo binary. Default 'halo' (from `pip install halo-engine`). */\n  haloBin?: string\n  /** Resolve the OTLP traces (JSONL string) halo should analyze for THIS\n   *  generation. Returning empty throws (halo has nothing to analyze). */\n  resolveTraces: (ctx: ProposeContext) => string | Promise<string>\n  /** halo's analysis prompt (`-p`). Default targets the failure taxonomy. */\n  analysisPrompt?: string\n  /** halo `--max-depth` / `--max-turns` passthrough. */\n  maxDepth?: number\n  maxTurns?: number\n  /** Test seam: inject a fetch for the apply-step callLlm (no network in unit tests). */\n  fetchImpl?: LlmClientOptions['fetch']\n}\n\nconst DEFAULT_ANALYSIS_PROMPT =\n  'Diagnose the failures in these agent execution traces — hallucinated tool calls, redundant tool arguments, refusal loops, and semantic-correctness errors — and suggest concrete, generalizable fixes to the agent instructions.'\n\n/** Wrap the real halo-engine CLI as a SurfaceProposer (prompt-tier). */\nexport function haloProposer(opts: HaloProposerOptions): SurfaceProposer {\n  const haloBin = opts.haloBin ?? 'halo'\n  const model = opts.model ?? 'gpt-5.4-mini'\n  return analysisEditProposer({\n    kind: 'halo',\n    label: 'halo',\n    baseUrl: opts.baseUrl,\n    apiKey: opts.apiKey,\n    analysisModel: model,\n    applyModel: opts.applyModel ?? model,\n    costLedger: opts.costLedger,\n    analysisMaximumCharge: opts.analysisMaximumCharge,\n    analysisReceipt: opts.analysisReceipt,\n    applyMaxTokens: opts.applyMaxTokens,\n    fetchImpl: opts.fetchImpl,\n    resolveTraces: opts.resolveTraces,\n    noTracesError:\n      'haloProposer: resolveTraces returned no OTLP traces — the halo engine has nothing to analyze',\n    // HALO's real findings are preserved verbatim in the rationale (attribution).\n    rationale: (findings) => `halo-engine findings:\\n${findings.slice(0, 800)}`,\n    analyze: async (tracePath, ctx) => {\n      // The published halo-engine reads the base URL + key from the env\n      // (OPENAI_BASE_URL / OPENAI_API_KEY) — it has no --base-url/--api-key flags.\n      const args = [\n        tracePath,\n        '-p',\n        opts.analysisPrompt ?? DEFAULT_ANALYSIS_PROMPT,\n        '-m',\n        model,\n        ...(opts.maxDepth !== undefined ? ['--max-depth', String(opts.maxDepth)] : []),\n        ...(opts.maxTurns !== undefined ? ['--max-turns', String(opts.maxTurns)] : []),\n      ]\n      let findings: string\n      try {\n        const { stdout } = await execFileAsync(haloBin, args, {\n          maxBuffer: 64 * 1024 * 1024,\n          signal: ctx.signal,\n          env: {\n            ...process.env,\n            ...(opts.apiKey ? { OPENAI_API_KEY: opts.apiKey } : {}),\n            OPENAI_BASE_URL: opts.baseUrl,\n          },\n        })\n        findings = stdout.trim()\n      } catch (e) {\n        throw new Error(\n          `haloProposer: halo-engine ('${haloBin}') failed — ${e instanceof Error ? e.message : String(e)}`,\n        )\n      }\n      if (!findings) throw new Error('haloProposer: halo-engine produced no findings')\n      return findings\n    },\n  })\n}\n","/**\n * Shared core for prompt-tier \"analysis → one LLM edit\" proposers. `haloProposer`\n * and `traceAnalystProposer` differ ONLY in who produces the findings; the\n * materialize-traces → apply-via-`APPLY_SYSTEM` → candidate pipeline is\n * identical. Keeping it in one place IS the fairness contract their head-to-head\n * (`compareProposers`) depends on — the apply step can no longer drift between the\n * two engines being compared.\n */\n\nimport { mkdtempSync, writeFileSync } from 'node:fs'\nimport { tmpdir } from 'node:os'\nimport { join } from 'node:path'\nimport {\n  CostAccountingIncompleteError,\n  CostLedger,\n  type CostLedgerHandle,\n  type CostReceiptInput,\n  type MaximumCharge,\n} from '../../cost-ledger'\nimport {\n  callLlm,\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  type LlmCallRequest,\n  type LlmClientOptions,\n  maximumChargeForLlmRequest,\n} from '../../llm-client'\nimport type { ProposeContext, ProposedCandidate, SurfaceProposer } from '../types'\n\nexport const APPLY_SYSTEM =\n  'You apply a trace-analysis report to an agent instruction prompt. Output ONLY the full revised prompt — no preamble, no commentary, no code fences. Make the minimal edits that address the report findings; preserve everything else verbatim.'\n\n/** Serialize a surface (string or structured) into prompt text. */\nexport function surfaceToPromptText(surface: unknown): string {\n  return typeof surface === 'string' ? surface : JSON.stringify(surface)\n}\n\nexport interface AnalysisEditProposerOptions {\n  kind: string\n  label: string\n  baseUrl: string\n  apiKey?: string\n  analysisModel: string\n  applyModel: string\n  /** Optional ledger for direct proposer use. Campaign context takes precedence. */\n  costLedger?: CostLedgerHandle\n  /** Required for each external step when the shared ledger has a dollar cap. */\n  analysisMaximumCharge?: MaximumCharge\n  /** Convert the external analyzer's result into measured usage/cost. */\n  analysisReceipt?: (report: string) => CostReceiptInput\n  applyMaxTokens?: number\n  fetchImpl?: LlmClientOptions['fetch']\n  /** Resolve the OTLP traces (JSONL) for THIS generation. Empty → `noTracesError`. */\n  resolveTraces: (ctx: ProposeContext) => string | Promise<string>\n  /** Produce the analysis REPORT string from the materialized trace file. Owns\n   *  its engine-specific failure + no-findings throws. */\n  analyze: (tracePath: string, ctx: ProposeContext) => Promise<string>\n  noTracesError: string\n  rationale: (report: string) => string\n}\n\n/** Build a `SurfaceProposer` that runs `analyze` over the generation's OTLP\n *  traces and applies the report to the surface via one identical LLM edit. */\nexport function analysisEditProposer(opts: AnalysisEditProposerOptions): SurfaceProposer {\n  const directCostLedger = opts.costLedger ?? new CostLedger()\n  return {\n    kind: opts.kind,\n    async propose(ctx: ProposeContext): Promise<ProposedCandidate[]> {\n      const parent = surfaceToPromptText(ctx.currentSurface)\n      const costLedger = ctx.costLedger ?? directCostLedger\n      const phase = ctx.costPhase ?? 'search.proposal'\n\n      const traces = (await opts.resolveTraces(ctx)) ?? ''\n      if (!traces.trim()) throw new Error(opts.noTracesError)\n      const dir = mkdtempSync(join(tmpdir(), `${opts.kind}-proposer-`))\n      const tracePath = join(dir, 'traces.jsonl')\n      writeFileSync(tracePath, traces.endsWith('\\n') ? traces : `${traces}\\n`)\n\n      if (costLedger.costCeilingUsd !== undefined && !opts.analysisReceipt) {\n        throw new CostAccountingIncompleteError(\n          `${opts.kind}: capped analysis requires analysisReceipt before external execution`,\n        )\n      }\n\n      const analysis = await costLedger.runPaidCall({\n        channel: 'analyst',\n        phase,\n        actor: `${opts.kind}.analyze`,\n        model: opts.analysisModel,\n        maximumCharge: opts.analysisMaximumCharge,\n        tags: { generation: String(ctx.generation) },\n        signal: ctx.signal,\n        execute: (signal) => opts.analyze(tracePath, { ...ctx, signal }),\n        receipt: (report) =>\n          opts.analysisReceipt?.(report) ?? {\n            model: opts.analysisModel,\n            inputTokens: 0,\n            outputTokens: 0,\n            costUnknown: true,\n          },\n      })\n      if (!analysis.succeeded) throw analysis.error\n      const report = analysis.value\n\n      const request: LlmCallRequest = {\n        model: opts.applyModel,\n        messages: [\n          { role: 'system', content: APPLY_SYSTEM },\n          {\n            role: 'user',\n            content: `CURRENT PROMPT:\\n${parent}\\n\\nTRACE-ANALYSIS REPORT:\\n${report}\\n\\nReturn the full revised prompt.`,\n          },\n        ],\n        maxTokens: opts.applyMaxTokens ?? 6000,\n      }\n      const llm: LlmClientOptions = {\n        baseUrl: opts.baseUrl,\n        apiKey: opts.apiKey,\n        fetch: opts.fetchImpl,\n      }\n      const apply = await costLedger.runPaidCall({\n        channel: 'driver',\n        phase,\n        actor: `${opts.kind}.apply`,\n        model: opts.applyModel,\n        maximumCharge: maximumChargeForLlmRequest(request, llm),\n        tags: { generation: String(ctx.generation) },\n        signal: ctx.signal,\n        execute: (signal, callId) => callLlm(request, { ...llm, signal, idempotencyKey: callId }),\n        receipt: costReceiptFromLlm,\n        receiptFromError: costReceiptFromLlmError,\n      })\n      if (!apply.succeeded) throw apply.error\n      const applied = apply.value\n      const text = applied.content.trim()\n      if (!text || text === parent) return []\n      return [{ surface: text, label: opts.label, rationale: opts.rationale(report) }]\n    },\n  }\n}\n","import { z } from 'zod'\nimport type { AgentProfileJson } from '../../agent-profile-cell'\nimport {\n  makePolicyEdit,\n  POLICY_EDIT_AXES,\n  POLICY_EDIT_TARGET_SURFACES,\n  type PolicyEdit,\n  type PolicyEditAdmission,\n  type PolicyEditAdmissionOptions,\n  type PolicyEditCandidateRecord,\n  type PolicyEditExpectedGain,\n  type PolicyEditInit,\n  validatePolicyEditCandidateRecord,\n} from '../../analyst/policy-edit'\nimport { assertNoJudgeVerdict } from '../../analyst/steer-firewall'\nimport type { AnalystFinding, EvidenceRef } from '../../analyst/types'\nimport { CostLedger, type CostLedgerHandle } from '../../cost-ledger'\nimport {\n  callLlmJson,\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  type LlmCallRequest,\n  type LlmClientOptions,\n  maximumChargeForLlmRequest,\n} from '../../llm-client'\nimport type {\n  GenerationCandidate,\n  GenerationRecord,\n  MutableSurface,\n  ProposeContext,\n  ProposedCandidate,\n  ScoredSurfaceOutcome,\n  SurfaceProposer,\n} from '../types'\nimport { policyEditProposer } from './policy-edit'\nimport {\n  assertPolicyEditAuthorContextBudget,\n  selectPolicyEditAuthorRows,\n} from './policy-edit-author-context'\n\nconst JSON_POLICY_EDIT_TARGET_SURFACES = [\n  'prompt',\n  'tool-contract',\n  'runtime-config',\n  'memory',\n  'agent-profile',\n] as const satisfies readonly (typeof POLICY_EDIT_TARGET_SURFACES)[number][]\n\nexport type JsonPolicyEditTargetSurface = (typeof JSON_POLICY_EDIT_TARGET_SURFACES)[number]\n\nconst NonEmptyStringSchema = z.string().trim().min(1)\n\nconst JsonValueSchema: z.ZodType<AgentProfileJson> = z.lazy(() =>\n  z.union([\n    z.string(),\n    z.number().finite(),\n    z.boolean(),\n    z.null(),\n    z.array(JsonValueSchema),\n    z.record(NonEmptyStringSchema, JsonValueSchema),\n  ]),\n)\n\nconst AuthoredJsonChangeSchema = z.discriminatedUnion('mode', [\n  z\n    .object({\n      kind: z.literal('json'),\n      mode: z.literal('set'),\n      path: NonEmptyStringSchema,\n      value: JsonValueSchema,\n    })\n    .strict(),\n  z\n    .object({\n      kind: z.literal('json'),\n      mode: z.literal('merge'),\n      path: NonEmptyStringSchema,\n      value: JsonValueSchema,\n    })\n    .strict(),\n  z\n    .object({\n      kind: z.literal('json'),\n      mode: z.literal('remove'),\n      path: NonEmptyStringSchema,\n    })\n    .strict(),\n])\n\nconst AuthoredPolicyEditSchema = z\n  .object({\n    axis: z.enum(POLICY_EDIT_AXES),\n    target: z\n      .object({\n        surface: z.enum(POLICY_EDIT_TARGET_SURFACES),\n        path: NonEmptyStringSchema,\n        label: NonEmptyStringSchema.max(200).nullable(),\n      })\n      .strict(),\n    change: AuthoredJsonChangeSchema,\n    claim: NonEmptyStringSchema.max(2_000),\n    expectedGain: z\n      .object({\n        metric: NonEmptyStringSchema.max(400),\n        direction: z.enum(['increase', 'decrease']),\n        amount: z.number().finite().positive(),\n        unit: z.enum(['absolute', 'relative', 'percent', 'score']).nullable(),\n        rationale: NonEmptyStringSchema.max(2_000).nullable(),\n      })\n      .strict(),\n    confidence: z.number().finite().min(0).max(1),\n    risk: z.enum(['low', 'medium', 'high', 'unknown']),\n    source: z\n      .object({\n        findingKeys: z\n          .array(NonEmptyStringSchema)\n          .min(1)\n          .refine((ids) => new Set(ids).size === ids.length, 'findingKeys must be unique'),\n      })\n      .strict(),\n    rationale: NonEmptyStringSchema.max(4_000).nullable(),\n    validationPlan: NonEmptyStringSchema.max(2_000).nullable(),\n  })\n  .strict()\n\nconst PolicyEditAuthorResponseSchema = z\n  .object({\n    edits: z.array(AuthoredPolicyEditSchema),\n  })\n  .strict()\n\ntype AuthoredPolicyEdit = z.infer<typeof AuthoredPolicyEditSchema>\n\nconst POLICY_EDIT_AUTHOR_JSON_SCHEMA: Record<string, unknown> = {\n  type: 'object',\n  additionalProperties: false,\n  required: ['edits'],\n  properties: {\n    edits: {\n      type: 'array',\n      items: {\n        type: 'object',\n        additionalProperties: false,\n        required: [\n          'axis',\n          'target',\n          'change',\n          'claim',\n          'expectedGain',\n          'confidence',\n          'risk',\n          'source',\n          'rationale',\n          'validationPlan',\n        ],\n        properties: {\n          axis: { type: 'string', enum: [...POLICY_EDIT_AXES] },\n          target: {\n            type: 'object',\n            additionalProperties: false,\n            required: ['surface', 'path', 'label'],\n            properties: {\n              surface: { type: 'string', enum: [...POLICY_EDIT_TARGET_SURFACES] },\n              path: { type: 'string', minLength: 1 },\n              label: { type: ['string', 'null'], maxLength: 200 },\n            },\n          },\n          change: {\n            anyOf: [\n              {\n                type: 'object',\n                additionalProperties: false,\n                required: ['kind', 'mode', 'path', 'value'],\n                properties: {\n                  kind: { const: 'json' },\n                  mode: { const: 'set' },\n                  path: { type: 'string', minLength: 1 },\n                  value: {},\n                },\n              },\n              {\n                type: 'object',\n                additionalProperties: false,\n                required: ['kind', 'mode', 'path', 'value'],\n                properties: {\n                  kind: { const: 'json' },\n                  mode: { const: 'merge' },\n                  path: { type: 'string', minLength: 1 },\n                  value: {},\n                },\n              },\n              {\n                type: 'object',\n                additionalProperties: false,\n                required: ['kind', 'mode', 'path'],\n                properties: {\n                  kind: { const: 'json' },\n                  mode: { const: 'remove' },\n                  path: { type: 'string', minLength: 1 },\n                },\n              },\n            ],\n          },\n          claim: { type: 'string', minLength: 1, maxLength: 2_000 },\n          expectedGain: {\n            type: 'object',\n            additionalProperties: false,\n            required: ['metric', 'direction', 'amount', 'unit', 'rationale'],\n            properties: {\n              metric: { type: 'string', minLength: 1, maxLength: 400 },\n              direction: { type: 'string', enum: ['increase', 'decrease'] },\n              amount: { type: 'number', exclusiveMinimum: 0 },\n              unit: {\n                type: ['string', 'null'],\n                enum: ['absolute', 'relative', 'percent', 'score', null],\n              },\n              rationale: { type: ['string', 'null'], maxLength: 2_000 },\n            },\n          },\n          confidence: { type: 'number', minimum: 0, maximum: 1 },\n          risk: { type: 'string', enum: ['low', 'medium', 'high', 'unknown'] },\n          source: {\n            type: 'object',\n            additionalProperties: false,\n            required: ['findingKeys'],\n            properties: {\n              findingKeys: {\n                type: 'array',\n                minItems: 1,\n                uniqueItems: true,\n                items: { type: 'string', minLength: 1 },\n              },\n            },\n          },\n          rationale: { type: ['string', 'null'], maxLength: 4_000 },\n          validationPlan: { type: ['string', 'null'], maxLength: 2_000 },\n        },\n      },\n    },\n  },\n}\n\nfunction policyEditAuthorJsonSchema(\n  maxItems: number,\n  targetSurface: JsonPolicyEditTargetSurface,\n  allowedJsonPaths: readonly string[],\n  objectives: readonly PolicyEditObjective[],\n): Record<string, unknown> {\n  const schema = JSON.parse(JSON.stringify(POLICY_EDIT_AUTHOR_JSON_SCHEMA)) as Record<\n    string,\n    unknown\n  >\n  const properties = schema.properties as Record<string, unknown>\n  const edits = properties.edits as Record<string, unknown>\n  edits.maxItems = maxItems\n  const item = edits.items as Record<string, unknown>\n  const itemProperties = item.properties as Record<string, unknown>\n  const target = itemProperties.target as Record<string, unknown>\n  const targetProperties = target.properties as Record<string, unknown>\n  targetProperties.surface = { type: 'string', enum: [targetSurface] }\n  targetProperties.path = { type: 'string', enum: [...allowedJsonPaths] }\n  const change = itemProperties.change as { anyOf: Array<Record<string, unknown>> }\n  for (const variant of change.anyOf) {\n    const variantProperties = variant.properties as Record<string, unknown>\n    variantProperties.path = { type: 'string', enum: [...allowedJsonPaths] }\n  }\n  const expectedGain = itemProperties.expectedGain as Record<string, unknown>\n  const gainProperties = expectedGain.properties as Record<string, unknown>\n  gainProperties.metric = { type: 'string', enum: objectives.map((objective) => objective.key) }\n  gainProperties.direction = {\n    type: 'string',\n    enum: [...new Set(objectives.map((objective) => objective.direction))],\n  }\n  gainProperties.unit = {\n    type: 'string',\n    enum: [...new Set(objectives.map((objective) => objective.unit))],\n  }\n  return schema\n}\n\nexport const DEFAULT_POLICY_EDIT_HISTORY_LIMITS = Object.freeze({\n  generations: 4,\n  candidatesPerGeneration: 16,\n  scenariosPerCandidate: 12,\n  findings: 32,\n  authorContextChars: 200_000,\n})\n\nexport interface PolicyEditObjective {\n  /** Stable objective key cited by forecasts, for example `search.composite`. */\n  key: string\n  /** Steering objectives are search-only; fresh-task results never enter author context. */\n  split: 'search'\n  /** Search promotes only larger composite scores. */\n  direction: 'increase'\n  scale: { min: number; max: number }\n  /** Forecast amounts are absolute deltas on the declared score scale. */\n  unit: 'score'\n}\n\nexport type PolicyEditFindingSource =\n  | { kind: 'surface'; surfaceHash: string; generation: number }\n  | { kind: 'global'; label: string }\n\n/** Trace-derived findings must name the measured profile that produced them.\n *  Cross-run doctrine can be explicitly global; an unwrapped finding is rejected. */\nexport interface PolicyEditFindingInput {\n  finding: AnalystFinding\n  source: PolicyEditFindingSource\n}\n\nexport interface PolicyEditHistoryProjectionOptions {\n  /** Number of most recent generations retained. Default: 4. */\n  maxGenerations?: number\n  /** Number of candidates retained per generation. Default: 16. */\n  maxCandidatesPerGeneration?: number\n  /** Scored tasks retained per candidate/outcome after deterministic extreme selection. */\n  maxScenariosPerCandidate?: number\n  /** Optional pseudonymizer applied before scenario IDs enter author text. */\n  scenarioIdTransform?: (scenarioId: string) => string\n  /** Objectives used to compute forecast residuals from measured composite deltas. */\n  objectives?: readonly PolicyEditObjective[]\n}\n\nexport interface PolicyEditCandidateSummary {\n  editId: string\n  axis: PolicyEdit['axis']\n  target: PolicyEdit['target']\n  change: PolicyEdit['change']\n  claim: string\n  expectedGain: PolicyEdit['expectedGain']\n  confidence: number\n  risk: PolicyEdit['risk']\n  sourceFindingIds: string[]\n  rationale: string | null\n  validationPlan: string | null\n}\n\nexport interface PolicyEditHistoryCandidateContext {\n  surfaceHash: string\n  parentSurfaceHash: string | null\n  parentComposite: number | null\n  label: string | null\n  rationale: string | null\n  composite: number\n  observedDeltaFromParent: number | null\n  eligibleForPromotion: boolean | null\n  coverage: {\n    expectedCells: number\n    scorableCells: number\n    unscorableCells: Array<{ reason: string }>\n  } | null\n  dimensions: Record<string, number>\n  scenarios: Array<{ scenarioId: string; composite: number; notes: string | null }>\n  candidateEdit: PolicyEditCandidateSummary | null\n  forecastCalibration: {\n    objectiveKey: string\n    predictedDelta: number\n    observedDelta: number\n    residual: number\n  } | null\n}\n\nexport interface PolicyEditOutcomeContext {\n  split: 'search'\n  generation: number\n  surfaceHash: string\n  composite: number\n  dimensions: Record<string, number>\n  scenarios: Array<{ scenarioId: string; composite: number; notes: string | null }>\n  coverage: { expectedCells: number; scorableCells: number }\n}\n\nexport interface PolicyEditHistoryGenerationContext {\n  generationIndex: number\n  promoted: string[]\n  candidates: PolicyEditHistoryCandidateContext[]\n}\n\nconst POLICY_EDIT_AUTHOR_SYSTEM = [\n  'You author strictly typed PolicyEdit candidates over one JSON surface.',\n  'Return exactly one JSON object with shape {\"edits\":[...]}; emit an empty edits array when no evidence supports a change.',\n  `axis must be one of: ${POLICY_EDIT_AXES.join(', ')}.`,\n  `target.surface must be one of: ${POLICY_EDIT_TARGET_SURFACES.join(', ')}.`,\n  'target.path and change.path must be the same caller-allowed JSON path.',\n  'change must be exactly one operation: {\"kind\":\"json\",\"mode\":\"set\",\"path\":string,\"value\":json}, {\"kind\":\"json\",\"mode\":\"merge\",\"path\":string,\"value\":json}, or {\"kind\":\"json\",\"mode\":\"remove\",\"path\":string}.',\n  'Nullable fields required by the response schema must be null when they do not apply.',\n  'Every edit must cite one or more supplied finding keys in source.findingKeys. Do not emit persistent finding IDs, analyst IDs, or evidence references; the caller binds those from the cited findings.',\n  'Treat expectedGain and confidence as forecasts, never as measured evidence. Learn from baselineOutcome, incumbentOutcome, and observedDeltaFromParent.',\n  'Do not invent a finding, path, field, score, or task fact. Do not include schemaVersion, editId, metadata, prose, or undeclared keys.',\n].join('\\n')\n\nexport interface LlmPolicyEditProposerOptions {\n  llm: LlmClientOptions\n  model: string\n  /** Optional ledger for direct proposer use. Campaign context takes precedence. */\n  costLedger?: CostLedgerHandle\n  /** Plain-language description of the JSON surface being improved. */\n  target: string\n  /** PolicyEdit target surface every authored edit must retain. */\n  targetSurface: JsonPolicyEditTargetSurface\n  /** Exact JSON paths the author may change. Prefix or fuzzy matches are not accepted. */\n  allowedJsonPaths: readonly string[]\n  /** Exact search objectives forecasts may name. Unknown keys or mismatched directions fail. */\n  objectives: readonly PolicyEditObjective[]\n  /** Default: evidence-only, so uncertain edits are measured rather than\n   *  suppressed by their own model-authored predictions. */\n  admissionMode?: 'evidence-only' | 'strict'\n  /** Readiness thresholds used only when admissionMode is explicitly strict. */\n  admission?: PolicyEditAdmissionOptions\n  maxCandidates?: number\n  temperature?: number\n  maxTokens?: number\n  timeoutMs?: number\n  /** Number of most recent scored generations sent to the author. Default: 4. */\n  maxHistoryGenerations?: number\n  /** Candidates retained per admitted generation. Default: 16. */\n  maxHistoryCandidatesPerGeneration?: number\n  /** Scored tasks retained per candidate/outcome after deterministic extreme selection. */\n  maxScenariosPerCandidate?: number\n  /** Evidence-bearing findings retained after deterministic severity/confidence ordering. */\n  maxFindings?: number\n  /** Hard character limit over system + schema + serialized author context. */\n  maxAuthorContextChars?: number\n  /** Optional one-to-one pseudonymizer applied to every author-visible evidence field. */\n  scenarioIdTransform?: (scenarioId: string) => string\n  onAdmission?: (admission: PolicyEditAdmission) => void\n}\n\n/**\n * LLM-backed PolicyEdit author. It reads only the current JSON surface,\n * evidence-bearing analyst findings, and scored generation history. Model output\n * is validated and rebound to exact finding evidence before the deterministic\n * policyEditProposer applies, admits, and deduplicates candidates.\n */\nexport function llmPolicyEditProposer(\n  opts: LlmPolicyEditProposerOptions,\n): SurfaceProposer<PolicyEditFindingInput> {\n  const allowedJsonPaths = validateAllowedJsonPaths(opts.allowedJsonPaths)\n  const allowedPathSet = new Set(allowedJsonPaths)\n  const objectives = validateObjectives(opts.objectives)\n  const objectiveByKey = new Map(objectives.map((objective) => [objective.key, objective]))\n  requireNonEmpty(opts.model, 'model')\n  requireNonEmpty(opts.target, 'target')\n  if (!(JSON_POLICY_EDIT_TARGET_SURFACES as readonly string[]).includes(opts.targetSurface)) {\n    throw new Error(\n      `llmPolicyEditProposer: targetSurface '${opts.targetSurface}' is not a JSON-backed surface`,\n    )\n  }\n  if (\n    opts.maxCandidates !== undefined &&\n    (!Number.isSafeInteger(opts.maxCandidates) || opts.maxCandidates < 0)\n  ) {\n    throw new Error('llmPolicyEditProposer: maxCandidates must be a non-negative safe integer')\n  }\n  const admissionMode = opts.admissionMode ?? 'evidence-only'\n  if (admissionMode !== 'evidence-only' && admissionMode !== 'strict') {\n    throw new Error(\"llmPolicyEditProposer: admissionMode must be 'evidence-only' or 'strict'\")\n  }\n  if (opts.admission && admissionMode !== 'strict') {\n    throw new Error(\"llmPolicyEditProposer: admission thresholds require admissionMode: 'strict'\")\n  }\n  const historyLimits = validateHistoryLimits({\n    ...(opts.maxHistoryGenerations === undefined\n      ? {}\n      : { maxGenerations: opts.maxHistoryGenerations }),\n    ...(opts.maxHistoryCandidatesPerGeneration === undefined\n      ? {}\n      : { maxCandidatesPerGeneration: opts.maxHistoryCandidatesPerGeneration }),\n    ...(opts.maxScenariosPerCandidate === undefined\n      ? {}\n      : { maxScenariosPerCandidate: opts.maxScenariosPerCandidate }),\n    ...(opts.scenarioIdTransform === undefined\n      ? {}\n      : { scenarioIdTransform: opts.scenarioIdTransform }),\n  })\n  const maxFindings = positiveLimit(\n    opts.maxFindings ?? DEFAULT_POLICY_EDIT_HISTORY_LIMITS.findings,\n    'maxFindings',\n  )\n  const maxAuthorContextChars = positiveLimit(\n    opts.maxAuthorContextChars ?? DEFAULT_POLICY_EDIT_HISTORY_LIMITS.authorContextChars,\n    'maxAuthorContextChars',\n  )\n  const directCostLedger = opts.costLedger ?? new CostLedger()\n\n  return {\n    kind: 'llm-policy-edit',\n    async propose(\n      ctx: ProposeContext<PolicyEditFindingInput>,\n    ): Promise<Array<MutableSurface | ProposedCandidate>> {\n      const limit = Math.min(ctx.populationSize, opts.maxCandidates ?? ctx.populationSize)\n      if (limit <= 0) return []\n\n      const currentSurface = parseJsonSurface(ctx.currentSurface)\n      assertSearchOutcome(ctx.baselineOutcome, 'baselineOutcome')\n      assertSearchOutcome(ctx.incumbentOutcome, 'incumbentOutcome')\n      assertMeasuredCompositesInScale(ctx, objectives[0]!)\n      const scenarioIds = createScenarioIdProjector(historyLimits.scenarioIdTransform)\n      registerOutcomeScenarioIds(ctx.baselineOutcome, scenarioIds)\n      registerOutcomeScenarioIds(ctx.incumbentOutcome, scenarioIds)\n      registerHistoryScenarioIds(ctx.history.slice(-historyLimits.maxGenerations), scenarioIds)\n      assertSurfaceIsTaskAgnostic(\n        { currentSurface, allowedJsonPaths, objectives, targetSurface: opts.targetSurface },\n        scenarioIds,\n      )\n      const measuredSources = measuredSourceMeasurements(ctx)\n      const findings = citableFindings(ctx.findings, measuredSources, maxFindings)\n      const findingByKey = new Map(\n        findings.map((finding, index) => [`finding-${index + 1}`, finding]),\n      )\n      const authorContext = {\n        target: scenarioIds.sanitize(opts.target),\n        targetSurface: opts.targetSurface,\n        allowedJsonPaths,\n        objectives,\n        candidateCount: limit,\n        generation: ctx.generation,\n        currentSurface,\n        findings: findings.map((finding, index) =>\n          renderFinding(finding, `finding-${index + 1}`, scenarioIds, measuredSources),\n        ),\n        baselineOutcome: projectOutcome(\n          ctx.baselineOutcome,\n          scenarioIds,\n          historyLimits.maxScenariosPerCandidate,\n        ),\n        incumbentOutcome: projectOutcome(\n          ctx.incumbentOutcome,\n          scenarioIds,\n          historyLimits.maxScenariosPerCandidate,\n          ctx.baselineOutcome,\n        ),\n        history: projectPolicyEditHistoryWithProjector(\n          ctx.history,\n          historyLimits,\n          scenarioIds,\n          objectiveByKey,\n        ),\n      }\n      const responseSchema = policyEditAuthorJsonSchema(\n        limit,\n        opts.targetSurface,\n        allowedJsonPaths,\n        objectives,\n      )\n      assertPolicyEditAuthorContextBudget(\n        { system: POLICY_EDIT_AUTHOR_SYSTEM, authorContext, responseSchema },\n        maxAuthorContextChars,\n      )\n      const userContent = JSON.stringify(authorContext)\n      const request: LlmCallRequest = {\n        model: opts.model,\n        messages: [\n          { role: 'system', content: POLICY_EDIT_AUTHOR_SYSTEM },\n          { role: 'user', content: userContent },\n        ],\n        jsonSchema: {\n          name: 'policy_edit_author',\n          schema: responseSchema,\n        },\n        temperature: opts.temperature ?? 0.2,\n        maxTokens: opts.maxTokens ?? 6_000,\n        timeoutMs: opts.timeoutMs,\n      }\n      const paid = await (ctx.costLedger ?? directCostLedger).runPaidCall({\n        channel: 'driver',\n        phase: ctx.costPhase ?? 'search.proposal',\n        actor: 'llm-policy-edit.author',\n        model: opts.model,\n        maximumCharge: maximumChargeForLlmRequest(request, opts.llm),\n        tags: { generation: String(ctx.generation) },\n        signal: ctx.signal,\n        execute: (signal, callId) =>\n          callLlmJson<unknown>(request, { ...opts.llm, signal, idempotencyKey: callId }),\n        receipt: ({ result }) => costReceiptFromLlm(result),\n        receiptFromError: costReceiptFromLlmError,\n      })\n      if (!paid.succeeded) throw paid.error\n      const { value } = paid.value\n      const response = parseAuthorResponse(value)\n      if (response.edits.length > limit) {\n        throw new Error(\n          `llmPolicyEditProposer: author returned ${response.edits.length} edits for ${limit} candidate slots`,\n        )\n      }\n      const edits = response.edits.map((draft) =>\n        bindAuthoredEdit(\n          draft,\n          findingByKey,\n          opts.targetSurface,\n          allowedPathSet,\n          objectiveByKey,\n          ctx.incumbentOutcome?.composite ?? ctx.baselineOutcome?.composite,\n        ),\n      )\n      return policyEditProposer({\n        edits,\n        admission:\n          admissionMode === 'strict'\n            ? opts.admission\n            : {\n                minScore: 0,\n                minExpectedGain: 0,\n                allowHighRisk: true,\n                requireEvidence: true,\n              },\n        maxCandidates: limit,\n        onAdmission: opts.onAdmission,\n      }).propose(ctx)\n    },\n  }\n}\n\n/**\n * Projects scored history into the only fields a policy author may consume.\n * It admits recent generations and a bounded candidate count, while retaining\n * every dimension and scenario score for each admitted candidate.\n */\nexport function projectPolicyEditHistory(\n  history: readonly GenerationRecord[],\n  options: PolicyEditHistoryProjectionOptions = {},\n): PolicyEditHistoryGenerationContext[] {\n  const limits = validateHistoryLimits(options)\n  const objectiveByKey = new Map(\n    (options.objectives ? validateObjectives(options.objectives) : []).map((objective) => [\n      objective.key,\n      objective,\n    ]),\n  )\n  const scenarioIds = createScenarioIdProjector(limits.scenarioIdTransform)\n  registerHistoryScenarioIds(history.slice(-limits.maxGenerations), scenarioIds)\n  return projectPolicyEditHistoryWithProjector(history, limits, scenarioIds, objectiveByKey)\n}\n\nfunction projectPolicyEditHistoryWithProjector(\n  history: readonly GenerationRecord[],\n  limits: ReturnType<typeof validateHistoryLimits>,\n  scenarioIds: ScenarioIdProjector,\n  objectiveByKey: ReadonlyMap<string, PolicyEditObjective>,\n): PolicyEditHistoryGenerationContext[] {\n  const retainedHistory = history.slice(-limits.maxGenerations)\n  const candidateByHash = new Map(\n    retainedHistory.flatMap((record) =>\n      record.candidates.map((candidate) => [candidate.surfaceHash, candidate] as const),\n    ),\n  )\n  return retainedHistory.map((record) => {\n    const candidates = selectHistoryCandidates(record, limits.maxCandidatesPerGeneration)\n    const hashes = new Set(candidates.map((candidate) => candidate.surfaceHash))\n    return {\n      generationIndex: record.generationIndex,\n      promoted: record.promoted\n        .filter((hash) => hashes.has(hash))\n        .map((hash) => scenarioIds.sanitize(hash)),\n      candidates: candidates.map((candidate) =>\n        projectHistoryCandidate(\n          candidate,\n          scenarioIds,\n          limits.maxScenariosPerCandidate,\n          candidate.parentSurfaceHash\n            ? candidateByHash.get(candidate.parentSurfaceHash)?.scenarios\n            : undefined,\n          objectiveByKey,\n        ),\n      ),\n    }\n  })\n}\n\nfunction selectHistoryCandidates(record: GenerationRecord, limit: number): GenerationCandidate[] {\n  const promotionOrder = new Map(record.promoted.map((hash, index) => [hash, index]))\n  const promoted = [...record.candidates]\n    .filter((candidate) => promotionOrder.has(candidate.surfaceHash))\n    .sort((a, b) => promotionOrder.get(a.surfaceHash)! - promotionOrder.get(b.surfaceHash)!)\n  const selected = promoted.slice(0, limit)\n  const selectedHashes = new Set(selected.map((candidate) => candidate.surfaceHash))\n  const remaining = [...record.candidates]\n    .filter((candidate) => !promotionOrder.has(candidate.surfaceHash))\n    .sort((a, b) => b.composite - a.composite || a.surfaceHash.localeCompare(b.surfaceHash))\n  let high = 0\n  let low = remaining.length - 1\n  let takeLow = selected.length > 0\n  while (selected.length < limit && high <= low) {\n    const candidate = takeLow ? remaining[low--] : remaining[high++]\n    takeLow = !takeLow\n    if (!candidate || selectedHashes.has(candidate.surfaceHash)) continue\n    selected.push(candidate)\n    selectedHashes.add(candidate.surfaceHash)\n  }\n  return selected\n}\n\nfunction projectHistoryCandidate(\n  candidate: GenerationCandidate,\n  scenarioIds: ScenarioIdProjector,\n  maxScenarios: number,\n  parentScenarios: GenerationCandidate['scenarios'] | undefined,\n  objectiveByKey: ReadonlyMap<string, PolicyEditObjective>,\n): PolicyEditHistoryCandidateContext {\n  const referenceByScenario = parentScenarios\n    ? new Map(parentScenarios.map((scenario) => [scenario.scenarioId, scenario.composite]))\n    : undefined\n  const selectedScenarios = selectPolicyEditAuthorRows(candidate.scenarios, {\n    limit: maxScenarios,\n    ...(referenceByScenario ? { referenceByScenario } : {}),\n  })\n  const validatedRecord = candidate.candidateRecord\n    ? validatePolicyEditCandidateRecord(candidate.candidateRecord)\n    : undefined\n  return {\n    surfaceHash: scenarioIds.sanitize(candidate.surfaceHash),\n    parentSurfaceHash: candidate.parentSurfaceHash\n      ? scenarioIds.sanitize(candidate.parentSurfaceHash)\n      : null,\n    parentComposite: candidate.parentComposite ?? null,\n    label: candidate.label ? scenarioIds.sanitize(candidate.label) : null,\n    rationale: candidate.rationale ? scenarioIds.sanitize(candidate.rationale) : null,\n    composite: candidate.composite,\n    observedDeltaFromParent: candidate.observedDeltaFromParent ?? null,\n    eligibleForPromotion: candidate.eligibleForPromotion ?? null,\n    coverage: candidate.coverage\n      ? {\n          expectedCells: candidate.coverage.expectedCells,\n          scorableCells: candidate.coverage.scorableCells,\n          // `cellId` embeds the raw scenario ID. The aggregate reason is useful\n          // for search, but the identifier must not bypass scenarioIdTransform.\n          unscorableCells: [...candidate.coverage.unscorableCells]\n            .sort((a, b) => a.cellId.localeCompare(b.cellId))\n            .slice(0, maxScenarios)\n            .map((cell) => ({ reason: scenarioIds.sanitize(cell.reason) })),\n        }\n      : null,\n    // GenerationCandidate.ci95 is currently a placeholder [composite, composite],\n    // not a measured interval. Keep it out of author context until it is real.\n    dimensions: sanitizeDimensions(candidate.dimensions, scenarioIds),\n    scenarios: selectedScenarios.map((scenario) => {\n      return {\n        scenarioId: scenarioIds.project(scenario.scenarioId),\n        composite: scenario.composite,\n        notes: scenario.notes ? scenarioIds.sanitize(scenario.notes) : null,\n      }\n    }),\n    candidateEdit: validatedRecord ? summarizeCandidateEdit(validatedRecord, scenarioIds) : null,\n    forecastCalibration: forecastCalibration(candidate, validatedRecord, objectiveByKey),\n  }\n}\n\nfunction projectOutcome(\n  outcome: ScoredSurfaceOutcome | undefined,\n  scenarioIds: ScenarioIdProjector,\n  maxScenarios: number,\n  reference: ScoredSurfaceOutcome | undefined = undefined,\n): PolicyEditOutcomeContext | null {\n  if (!outcome) return null\n  const referenceByScenario = reference\n    ? new Map(reference.scenarios.map((scenario) => [scenario.scenarioId, scenario.composite]))\n    : undefined\n  const selectedScenarios = selectPolicyEditAuthorRows(outcome.scenarios, {\n    limit: maxScenarios,\n    ...(referenceByScenario ? { referenceByScenario } : {}),\n  })\n  return {\n    split: 'search',\n    generation: outcome.generation,\n    surfaceHash: scenarioIds.sanitize(outcome.surfaceHash),\n    composite: outcome.composite,\n    dimensions: sanitizeDimensions(outcome.dimensions, scenarioIds),\n    scenarios: selectedScenarios.map((scenario) => {\n      return {\n        scenarioId: scenarioIds.project(scenario.scenarioId),\n        composite: scenario.composite,\n        notes: scenario.notes ? scenarioIds.sanitize(scenario.notes) : null,\n      }\n    }),\n    coverage: { ...outcome.coverage },\n  }\n}\n\ninterface ScenarioIdProjector {\n  project(scenarioId: string): string\n  sanitize(text: string): string\n}\n\nfunction createScenarioIdProjector(transform: (scenarioId: string) => string): ScenarioIdProjector {\n  const aliases = new Map<string, string>()\n  const originals = new Map<string, string>()\n  return {\n    project(scenarioId) {\n      const known = aliases.get(scenarioId)\n      if (known) return known\n      const alias = transform(scenarioId)\n      if (!alias || alias.trim() !== alias) {\n        throw new Error(\n          'llmPolicyEditProposer: scenarioIdTransform must return a trimmed non-empty string',\n        )\n      }\n      const collision = originals.get(alias)\n      if (collision && collision !== scenarioId) {\n        throw new Error(\n          `llmPolicyEditProposer: scenarioIdTransform collision for '${collision}' and '${scenarioId}'`,\n        )\n      }\n      const aliasIsAnotherOriginal = aliases.has(alias) && alias !== scenarioId\n      const originalIsAnotherAlias =\n        originals.has(scenarioId) && originals.get(scenarioId) !== scenarioId\n      if (aliasIsAnotherOriginal || originalIsAnotherAlias) {\n        throw new Error(\n          'llmPolicyEditProposer: scenarioIdTransform aliases overlap raw scenario IDs',\n        )\n      }\n      aliases.set(scenarioId, alias)\n      originals.set(alias, scenarioId)\n      return alias\n    },\n    sanitize(text) {\n      const originalsByLength = [...aliases.keys()].sort((a, b) => b.length - a.length)\n      if (originalsByLength.length === 0) return text\n      const pattern = new RegExp(\n        `(^|[^A-Za-z0-9_-])(${originalsByLength.map(escapeRegExp).join('|')})(?=$|[^A-Za-z0-9_-])`,\n        'g',\n      )\n      return text.replace(\n        pattern,\n        (_match, prefix: string, original: string) =>\n          `${prefix}${aliases.get(original) ?? original}`,\n      )\n    },\n  }\n}\n\nfunction escapeRegExp(value: string): string {\n  return value.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&')\n}\n\ninterface PolicyEditFindingMeasurement {\n  surfaceHash: string\n  generation: number\n  composite: number\n  parentComposite: number | null\n  observedDeltaFromParent: number | null\n  eligibleForPromotion: boolean\n  coverage: { expectedCells: number; scorableCells: number }\n}\n\nfunction sourceKey(surfaceHash: string, generation: number): string {\n  return `${surfaceHash}@${generation}`\n}\n\nfunction measuredSourceMeasurements(\n  ctx: ProposeContext<PolicyEditFindingInput>,\n): Map<string, PolicyEditFindingMeasurement> {\n  const measurements = new Map<string, PolicyEditFindingMeasurement>()\n  const add = (measurement: PolicyEditFindingMeasurement) => {\n    measurements.set(sourceKey(measurement.surfaceHash, measurement.generation), measurement)\n  }\n  if (ctx.baselineOutcome) {\n    add({\n      surfaceHash: ctx.baselineOutcome.surfaceHash,\n      generation: ctx.baselineOutcome.generation,\n      composite: ctx.baselineOutcome.composite,\n      parentComposite: null,\n      observedDeltaFromParent: null,\n      eligibleForPromotion: true,\n      coverage: { ...ctx.baselineOutcome.coverage },\n    })\n  }\n  for (const record of ctx.history) {\n    for (const candidate of record.candidates) {\n      add({\n        surfaceHash: candidate.surfaceHash,\n        generation: record.generationIndex,\n        composite: candidate.composite,\n        parentComposite: candidate.parentComposite ?? null,\n        observedDeltaFromParent: candidate.observedDeltaFromParent ?? null,\n        eligibleForPromotion: candidate.eligibleForPromotion === true,\n        coverage: candidate.coverage\n          ? {\n              expectedCells: candidate.coverage.expectedCells,\n              scorableCells: candidate.coverage.scorableCells,\n            }\n          : { expectedCells: 0, scorableCells: 0 },\n      })\n    }\n  }\n  if (ctx.incumbentOutcome) {\n    const generation = ctx.incumbentOutcome.generation\n    const key = sourceKey(ctx.incumbentOutcome.surfaceHash, generation)\n    if (!measurements.has(key)) {\n      add({\n        surfaceHash: ctx.incumbentOutcome.surfaceHash,\n        generation,\n        composite: ctx.incumbentOutcome.composite,\n        parentComposite: null,\n        observedDeltaFromParent: null,\n        eligibleForPromotion: true,\n        coverage: { ...ctx.incumbentOutcome.coverage },\n      })\n    }\n  }\n  return measurements\n}\n\nfunction validateFindingSource(\n  source: PolicyEditFindingSource,\n  measured: ReadonlyMap<string, PolicyEditFindingMeasurement>,\n): void {\n  if (source.kind === 'global') {\n    requireNonEmpty(source.label, 'global finding source label')\n    return\n  }\n  if (!measured.has(sourceKey(source.surfaceHash, source.generation))) {\n    throw new Error(\n      `llmPolicyEditProposer: finding source ${source.surfaceHash}@${source.generation} is not a measured surface`,\n    )\n  }\n}\n\nfunction sameFindingSource(a: PolicyEditFindingSource, b: PolicyEditFindingSource): boolean {\n  if (a.kind !== b.kind) return false\n  return a.kind === 'surface' && b.kind === 'surface'\n    ? a.surfaceHash === b.surfaceHash && a.generation === b.generation\n    : a.kind === 'global' && b.kind === 'global' && a.label === b.label\n}\n\nfunction summarizeCandidateEdit(\n  record: PolicyEditCandidateRecord,\n  scenarioIds: ScenarioIdProjector,\n): PolicyEditCandidateSummary {\n  const edit = record.policyEdit\n  return {\n    editId: edit.editId,\n    axis: edit.axis,\n    target: sanitizeAuthorValue(edit.target, scenarioIds) as PolicyEdit['target'],\n    change: sanitizeAuthorValue(edit.change, scenarioIds) as PolicyEdit['change'],\n    claim: scenarioIds.sanitize(edit.claim),\n    expectedGain: sanitizeAuthorValue(edit.expectedGain, scenarioIds) as PolicyEdit['expectedGain'],\n    confidence: edit.confidence,\n    risk: edit.risk,\n    sourceFindingIds: edit.source.findingIds.map((id) => scenarioIds.sanitize(id)),\n    rationale: edit.rationale ? scenarioIds.sanitize(edit.rationale) : null,\n    validationPlan: edit.validationPlan ? scenarioIds.sanitize(edit.validationPlan) : null,\n  }\n}\n\nfunction sanitizeAuthorValue(value: unknown, scenarioIds: ScenarioIdProjector): unknown {\n  if (typeof value === 'string') return scenarioIds.sanitize(value)\n  if (Array.isArray(value)) return value.map((item) => sanitizeAuthorValue(item, scenarioIds))\n  if (value && typeof value === 'object') {\n    return Object.fromEntries(\n      Object.entries(value).map(([key, child]) => [\n        scenarioIds.sanitize(key),\n        sanitizeAuthorValue(child, scenarioIds),\n      ]),\n    )\n  }\n  return value\n}\n\nfunction sanitizeDimensions(\n  dimensions: Readonly<Record<string, number>>,\n  scenarioIds: ScenarioIdProjector,\n): Record<string, number> {\n  const sanitized = new Map<string, { original: string; value: number }>()\n  for (const [key, value] of Object.entries(dimensions)) {\n    const projected = scenarioIds.sanitize(key)\n    const prior = sanitized.get(projected)\n    if (prior && prior.original !== key) {\n      throw new Error(\n        `llmPolicyEditProposer: pseudonymized dimension key collision for '${prior.original}' and '${key}'`,\n      )\n    }\n    sanitized.set(projected, { original: key, value })\n  }\n  return Object.fromEntries([...sanitized].map(([key, entry]) => [key, entry.value]))\n}\n\nfunction forecastCalibration(\n  candidate: GenerationCandidate,\n  record: PolicyEditCandidateRecord | undefined,\n  objectiveByKey: ReadonlyMap<string, PolicyEditObjective>,\n): PolicyEditHistoryCandidateContext['forecastCalibration'] {\n  if (!record || candidate.observedDeltaFromParent === undefined) return null\n  const forecast = record.policyEdit.expectedGain\n  const objective = objectiveByKey.get(forecast.metric)\n  if (!objective || objective.key !== 'search.composite') return null\n  if (forecast.direction !== objective.direction || forecast.unit !== objective.unit) return null\n  if (forecast.amount > objective.scale.max - objective.scale.min) return null\n  const predictedDelta = forecast.amount\n  return {\n    objectiveKey: objective.key,\n    predictedDelta,\n    observedDelta: candidate.observedDeltaFromParent,\n    residual: candidate.observedDeltaFromParent - predictedDelta,\n  }\n}\n\nfunction assertSearchOutcome(outcome: ScoredSurfaceOutcome | undefined, field: string): void {\n  if (outcome && (outcome as { split?: unknown }).split !== 'search') {\n    throw new Error(`llmPolicyEditProposer: ${field} must be a search-split outcome`)\n  }\n}\n\nfunction assertMeasuredCompositesInScale(\n  ctx: ProposeContext<PolicyEditFindingInput>,\n  objective: PolicyEditObjective,\n): void {\n  const assertInScale = (value: number, field: string) => {\n    if (!Number.isFinite(value) || value < objective.scale.min || value > objective.scale.max) {\n      throw new Error(\n        `llmPolicyEditProposer: ${field} ${value} is outside objective '${objective.key}' scale [${objective.scale.min}, ${objective.scale.max}]`,\n      )\n    }\n  }\n  const assertOutcome = (outcome: ScoredSurfaceOutcome | undefined, field: string) => {\n    if (!outcome) return\n    assertInScale(outcome.composite, `${field}.composite`)\n    for (const [index, scenario] of outcome.scenarios.entries()) {\n      assertInScale(scenario.composite, `${field}.scenarios[${index}].composite`)\n    }\n  }\n  assertOutcome(ctx.baselineOutcome, 'baselineOutcome')\n  assertOutcome(ctx.incumbentOutcome, 'incumbentOutcome')\n  for (const [generationIndex, generation] of ctx.history.entries()) {\n    for (const [candidateIndex, candidate] of generation.candidates.entries()) {\n      const field = `history[${generationIndex}].candidates[${candidateIndex}]`\n      assertInScale(candidate.composite, `${field}.composite`)\n      if (candidate.parentComposite !== undefined) {\n        assertInScale(candidate.parentComposite, `${field}.parentComposite`)\n      }\n      for (const [scenarioIndex, scenario] of candidate.scenarios.entries()) {\n        assertInScale(scenario.composite, `${field}.scenarios[${scenarioIndex}].composite`)\n      }\n    }\n  }\n}\n\nfunction assertSurfaceIsTaskAgnostic(value: unknown, scenarioIds: ScenarioIdProjector): void {\n  const serialized = JSON.stringify(value)\n  if (scenarioIds.sanitize(serialized) !== serialized) {\n    throw new Error(\n      'llmPolicyEditProposer: current JSON surface or signature contains a raw scenario identifier',\n    )\n  }\n}\n\nfunction registerOutcomeScenarioIds(\n  outcome: ScoredSurfaceOutcome | undefined,\n  scenarioIds: ScenarioIdProjector,\n): void {\n  for (const scenario of outcome?.scenarios ?? []) scenarioIds.project(scenario.scenarioId)\n}\n\nfunction registerHistoryScenarioIds(\n  history: readonly GenerationRecord[],\n  scenarioIds: ScenarioIdProjector,\n): void {\n  for (const record of history) {\n    for (const candidate of record.candidates) {\n      for (const scenario of candidate.scenarios) scenarioIds.project(scenario.scenarioId)\n      for (const cell of candidate.coverage?.unscorableCells ?? []) {\n        const separator = cell.cellId.lastIndexOf(':')\n        if (separator <= 0 || !/^\\d+$/.test(cell.cellId.slice(separator + 1))) continue\n        scenarioIds.project(cell.cellId.slice(0, separator))\n      }\n    }\n  }\n}\n\nfunction validateHistoryLimits(options: PolicyEditHistoryProjectionOptions): {\n  maxGenerations: number\n  maxCandidatesPerGeneration: number\n  maxScenariosPerCandidate: number\n  scenarioIdTransform: (scenarioId: string) => string\n} {\n  const maxGenerations = options.maxGenerations ?? DEFAULT_POLICY_EDIT_HISTORY_LIMITS.generations\n  const maxCandidatesPerGeneration =\n    options.maxCandidatesPerGeneration ?? DEFAULT_POLICY_EDIT_HISTORY_LIMITS.candidatesPerGeneration\n  const maxScenariosPerCandidate =\n    options.maxScenariosPerCandidate ?? DEFAULT_POLICY_EDIT_HISTORY_LIMITS.scenariosPerCandidate\n  if (!Number.isSafeInteger(maxGenerations) || maxGenerations <= 0) {\n    throw new Error('llmPolicyEditProposer: maxHistoryGenerations must be a positive safe integer')\n  }\n  if (!Number.isSafeInteger(maxCandidatesPerGeneration) || maxCandidatesPerGeneration <= 0) {\n    throw new Error(\n      'llmPolicyEditProposer: maxHistoryCandidatesPerGeneration must be a positive safe integer',\n    )\n  }\n  if (!Number.isSafeInteger(maxScenariosPerCandidate) || maxScenariosPerCandidate <= 0) {\n    throw new Error(\n      'llmPolicyEditProposer: maxScenariosPerCandidate must be a positive safe integer',\n    )\n  }\n  return {\n    maxGenerations,\n    maxCandidatesPerGeneration,\n    maxScenariosPerCandidate,\n    scenarioIdTransform: options.scenarioIdTransform ?? ((scenarioId) => scenarioId),\n  }\n}\n\nfunction validateObjectives(inputs: readonly PolicyEditObjective[]): PolicyEditObjective[] {\n  if (inputs.length === 0) {\n    throw new Error('llmPolicyEditProposer: objectives must not be empty')\n  }\n  const seen = new Set<string>()\n  return inputs.map((input) => {\n    requireNonEmpty(input.key, 'objective key')\n    if (seen.has(input.key)) {\n      throw new Error(`llmPolicyEditProposer: duplicate objective '${input.key}'`)\n    }\n    seen.add(input.key)\n    if (input.split !== 'search') {\n      throw new Error(`llmPolicyEditProposer: objective '${input.key}' must use the search split`)\n    }\n    if (input.key !== 'search.composite') {\n      throw new Error(\n        `llmPolicyEditProposer: objective '${input.key}' is not yet measurable; use 'search.composite'`,\n      )\n    }\n    if (input.direction !== 'increase') {\n      throw new Error(\n        `llmPolicyEditProposer: objective '${input.key}' must increase because search promotes larger composite scores`,\n      )\n    }\n    if (\n      !Number.isFinite(input.scale.min) ||\n      !Number.isFinite(input.scale.max) ||\n      input.scale.max <= input.scale.min\n    ) {\n      throw new Error(`llmPolicyEditProposer: objective '${input.key}' has an invalid scale`)\n    }\n    if (input.unit !== 'score') {\n      throw new Error(`llmPolicyEditProposer: objective '${input.key}' must use raw score deltas`)\n    }\n    return {\n      key: input.key,\n      split: 'search',\n      direction: input.direction,\n      scale: { ...input.scale },\n      unit: input.unit,\n    }\n  })\n}\n\nfunction positiveLimit(value: number, field: string): number {\n  if (!Number.isSafeInteger(value) || value <= 0) {\n    throw new Error(`llmPolicyEditProposer: ${field} must be a positive safe integer`)\n  }\n  return value\n}\n\nfunction parseAuthorResponse(value: unknown): z.infer<typeof PolicyEditAuthorResponseSchema> {\n  const parsed = PolicyEditAuthorResponseSchema.safeParse(value)\n  if (parsed.success) return parsed.data\n  const issues = parsed.error.issues\n    .map((issue) => `${issue.path.join('.') || '<root>'}: ${issue.message}`)\n    .join('; ')\n  throw new Error(`llmPolicyEditProposer: invalid PolicyEdit response: ${issues}`)\n}\n\nfunction bindAuthoredEdit(\n  draft: AuthoredPolicyEdit,\n  findingByKey: ReadonlyMap<string, CitableFinding>,\n  targetSurface: JsonPolicyEditTargetSurface,\n  allowedPaths: ReadonlySet<string>,\n  objectiveByKey: ReadonlyMap<string, PolicyEditObjective>,\n  currentComposite: number | undefined,\n): PolicyEdit {\n  if (draft.target.surface !== targetSurface) {\n    throw new Error(\n      `llmPolicyEditProposer: target surface '${draft.target.surface}' does not match '${targetSurface}'`,\n    )\n  }\n  if (draft.target.path !== draft.change.path) {\n    throw new Error('llmPolicyEditProposer: target.path must equal change.path')\n  }\n  if (!allowedPaths.has(draft.change.path)) {\n    throw new Error(\n      `llmPolicyEditProposer: JSON path '${draft.change.path}' is outside allowedJsonPaths`,\n    )\n  }\n\n  const cited = draft.source.findingKeys.map((findingKey) => {\n    const finding = findingByKey.get(findingKey)\n    if (!finding) {\n      throw new Error(\n        `llmPolicyEditProposer: edit cites unknown or uncitable finding key '${findingKey}'`,\n      )\n    }\n    return finding\n  })\n  const evidenceRefs = uniqueEvidenceRefs(cited.flatMap((finding) => finding.evidenceRefs))\n  if (evidenceRefs.length === 0) {\n    throw new Error('llmPolicyEditProposer: authored edit has no cited evidence')\n  }\n\n  const objective = objectiveByKey.get(draft.expectedGain.metric)\n  if (!objective) {\n    throw new Error(\n      `llmPolicyEditProposer: unknown forecast objective '${draft.expectedGain.metric}'`,\n    )\n  }\n  if (draft.expectedGain.direction !== objective.direction) {\n    throw new Error(\n      `llmPolicyEditProposer: forecast direction for '${objective.key}' must be '${objective.direction}'`,\n    )\n  }\n  if (draft.expectedGain.unit !== objective.unit) {\n    throw new Error(\n      `llmPolicyEditProposer: forecast unit for '${objective.key}' must be '${objective.unit}'`,\n    )\n  }\n  const maxGain =\n    currentComposite === undefined\n      ? objective.scale.max - objective.scale.min\n      : objective.scale.max - currentComposite\n  if (draft.expectedGain.amount > maxGain) {\n    throw new Error(\n      `llmPolicyEditProposer: forecast amount for '${objective.key}' exceeds the available score headroom`,\n    )\n  }\n\n  const expectedGain: PolicyEditExpectedGain = {\n    metric: draft.expectedGain.metric,\n    direction: draft.expectedGain.direction,\n    amount: draft.expectedGain.amount,\n    ...(draft.expectedGain.unit ? { unit: draft.expectedGain.unit } : {}),\n    ...(draft.expectedGain.rationale ? { rationale: draft.expectedGain.rationale } : {}),\n  }\n  const init: PolicyEditInit = {\n    axis: draft.axis,\n    target: {\n      surface: draft.target.surface,\n      path: draft.target.path,\n      ...(draft.target.label ? { label: draft.target.label } : {}),\n    },\n    change: draft.change,\n    claim: draft.claim,\n    expectedGain,\n    confidence: draft.confidence,\n    risk: draft.risk,\n    source: {\n      findingIds: [...new Set(cited.map((finding) => finding.finding.finding_id))],\n      analystIds: [...new Set(cited.map((finding) => finding.finding.analyst_id))],\n      evidenceRefs,\n    },\n    ...(draft.rationale ? { rationale: draft.rationale } : {}),\n    ...(draft.validationPlan ? { validationPlan: draft.validationPlan } : {}),\n  }\n  return makePolicyEdit(init)\n}\n\nfunction parseJsonSurface(surface: MutableSurface): AgentProfileJson {\n  if (typeof surface !== 'string') {\n    throw new Error('llmPolicyEditProposer: currentSurface must be serialized JSON')\n  }\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(surface)\n  } catch {\n    throw new Error('llmPolicyEditProposer: currentSurface must be valid JSON')\n  }\n  if (!parsed || typeof parsed !== 'object' || Array.isArray(parsed)) {\n    throw new Error('llmPolicyEditProposer: currentSurface JSON root must be an object')\n  }\n  return parsed as AgentProfileJson\n}\n\ninterface CitableFinding {\n  finding: AnalystFinding\n  sources: PolicyEditFindingSource[]\n  evidenceRefs: EvidenceRef[]\n}\n\nfunction citableFindings(\n  inputs: readonly PolicyEditFindingInput[],\n  measuredSources: ReadonlyMap<string, PolicyEditFindingMeasurement>,\n  limit: number,\n): CitableFinding[] {\n  if (inputs.length === 0) {\n    throw new Error('llmPolicyEditProposer: at least one analyst finding is required')\n  }\n  const findings: AnalystFinding[] = []\n  for (const input of inputs) {\n    if (!isPolicyEditFindingInput(input)) {\n      throw new Error(\n        'llmPolicyEditProposer: ctx.findings must contain attributed PolicyEditFindingInput rows',\n      )\n    }\n    findings.push(input.finding)\n  }\n  assertNoJudgeVerdict(findings, 'llmPolicyEditProposer')\n  const grouped = new Map<string, CitableFinding>()\n  for (const input of inputs) {\n    validateFindingSource(input.source, measuredSources)\n    if (input.finding.evidence_refs.length === 0) continue\n    const existing = grouped.get(input.finding.finding_id)\n    if (existing) {\n      if (\n        existing.finding.analyst_id !== input.finding.analyst_id ||\n        existing.finding.area !== input.finding.area ||\n        existing.finding.claim !== input.finding.claim ||\n        existing.finding.subject !== input.finding.subject\n      ) {\n        throw new Error(\n          `llmPolicyEditProposer: finding '${input.finding.finding_id}' has conflicting content`,\n        )\n      }\n      if (!existing.sources.some((source) => sameFindingSource(source, input.source))) {\n        existing.sources.push(input.source)\n      }\n      existing.evidenceRefs = uniqueEvidenceRefs([\n        ...existing.evidenceRefs,\n        ...input.finding.evidence_refs,\n      ])\n      continue\n    }\n    grouped.set(input.finding.finding_id, {\n      finding: input.finding,\n      sources: [input.source],\n      evidenceRefs: uniqueEvidenceRefs(input.finding.evidence_refs),\n    })\n  }\n  if (grouped.size === 0) {\n    throw new Error('llmPolicyEditProposer: no evidence-bearing findings are available')\n  }\n  const severityRank: Record<AnalystFinding['severity'], number> = {\n    critical: 0,\n    high: 1,\n    medium: 2,\n    low: 3,\n    info: 4,\n  }\n  return [...grouped.values()]\n    .sort(\n      (a, b) =>\n        severityRank[a.finding.severity] - severityRank[b.finding.severity] ||\n        b.finding.confidence - a.finding.confidence ||\n        a.finding.finding_id.localeCompare(b.finding.finding_id),\n    )\n    .slice(0, limit)\n}\n\nfunction isAnalystFindingLike(input: unknown): input is AnalystFinding {\n  if (!input || typeof input !== 'object') return false\n  const value = input as Partial<AnalystFinding>\n  return (\n    typeof value.finding_id === 'string' &&\n    typeof value.analyst_id === 'string' &&\n    typeof value.claim === 'string' &&\n    Array.isArray(value.evidence_refs)\n  )\n}\n\nfunction isPolicyEditFindingInput(input: unknown): input is PolicyEditFindingInput {\n  if (!input || typeof input !== 'object') return false\n  const value = input as Partial<PolicyEditFindingInput>\n  return isAnalystFindingLike(value.finding) && isFindingSource(value.source)\n}\n\nfunction isFindingSource(input: unknown): input is PolicyEditFindingSource {\n  if (!input || typeof input !== 'object') return false\n  const value = input as Partial<PolicyEditFindingSource>\n  if (value.kind === 'surface') {\n    return typeof value.surfaceHash === 'string' && Number.isSafeInteger(value.generation)\n  }\n  return value.kind === 'global' && typeof value.label === 'string' && value.label.trim().length > 0\n}\n\nfunction renderFinding(\n  context: CitableFinding,\n  findingKey: string,\n  scenarioIds: ScenarioIdProjector,\n  measuredSources: ReadonlyMap<string, PolicyEditFindingMeasurement>,\n): Record<string, unknown> {\n  const { finding } = context\n  return {\n    findingKey,\n    sources: context.sources.map((source) =>\n      source.kind === 'surface'\n        ? {\n            ...measuredSources.get(sourceKey(source.surfaceHash, source.generation))!,\n            surfaceHash: scenarioIds.sanitize(source.surfaceHash),\n            kind: 'surface',\n          }\n        : { kind: 'global', label: scenarioIds.sanitize(source.label) },\n    ),\n    analystId: scenarioIds.sanitize(finding.analyst_id),\n    area: scenarioIds.sanitize(finding.area),\n    severity: finding.severity,\n    subject: finding.subject ? scenarioIds.sanitize(finding.subject) : null,\n    claim: scenarioIds.sanitize(finding.claim),\n    rationale: finding.rationale ? scenarioIds.sanitize(finding.rationale) : null,\n    recommendedAction: finding.recommended_action\n      ? scenarioIds.sanitize(finding.recommended_action)\n      : null,\n    validationPlan: finding.validation_plan ? scenarioIds.sanitize(finding.validation_plan) : null,\n    confidence: finding.confidence,\n    evidenceRefs: context.evidenceRefs.map((ref) => ({\n      kind: ref.kind,\n      uri: scenarioIds.sanitize(ref.uri),\n      excerpt: ref.excerpt ? scenarioIds.sanitize(ref.excerpt) : null,\n    })),\n  }\n}\n\nfunction uniqueEvidenceRefs(refs: readonly EvidenceRef[]): EvidenceRef[] {\n  const seen = new Set<string>()\n  return refs.filter((ref) => {\n    const key = JSON.stringify([ref.kind, ref.uri, ref.excerpt ?? null])\n    if (seen.has(key)) return false\n    seen.add(key)\n    return true\n  })\n}\n\nfunction validateAllowedJsonPaths(paths: readonly string[]): string[] {\n  if (paths.length === 0) {\n    throw new Error('llmPolicyEditProposer: allowedJsonPaths must not be empty')\n  }\n  for (const path of paths) {\n    if (!path || path.trim() !== path) {\n      throw new Error(\n        'llmPolicyEditProposer: allowedJsonPaths must contain trimmed non-empty paths',\n      )\n    }\n  }\n  if (new Set(paths).size !== paths.length) {\n    throw new Error('llmPolicyEditProposer: allowedJsonPaths must be unique')\n  }\n  return [...paths]\n}\n\nfunction requireNonEmpty(value: string, field: string): void {\n  if (!value || value.trim() !== value) {\n    throw new Error(`llmPolicyEditProposer: ${field} must be a trimmed non-empty string`)\n  }\n}\n","/**\n * `policyEditProposer` turns typed analyst policy edits into measured candidate\n * surfaces. It is deliberately deterministic: analysts propose the edit, this\n * proposer only checks admission and applies it. The campaign/holdout loop still\n * decides whether the candidate actually wins.\n */\n\nimport {\n  admitPolicyEdit,\n  applyPolicyEditToSurface,\n  type FindingToPolicyEditOptions,\n  isPolicyEdit,\n  makePolicyEditCandidateRecord,\n  type PolicyEdit,\n  type PolicyEditAdmission,\n  type PolicyEditAdmissionOptions,\n  policyEditsFromFindings,\n} from '../../analyst/policy-edit'\nimport type { AnalystFinding } from '../../analyst/types'\nimport { assertCodeSurfaceIdentity, surfaceContentHash } from '../surface-identity'\nimport type { MutableSurface, ProposeContext, ProposedCandidate, SurfaceProposer } from '../types'\n\nexport interface PolicyEditProposerOptions {\n  /** Static edits, useful when an analyst has already emitted typed edits. When\n   * omitted, the proposer reads `ctx.findings`. */\n  edits?: ReadonlyArray<PolicyEdit>\n  /** Adapter for legacy `AnalystFinding` rows. Findings without typed expected\n   * gain are ignored rather than inflated with fake numbers. */\n  findingOptions?: FindingToPolicyEditOptions\n  /** Admission threshold. Defaults live in `admitPolicyEdit`. */\n  admission?: PolicyEditAdmissionOptions\n  /** Candidate cap. Default: `ctx.populationSize`. */\n  maxCandidates?: number\n  /** Optional callback for audit UIs/tests that need rejected edit reasons. */\n  onAdmission?: (admission: PolicyEditAdmission) => void\n}\n\n/**\n * `SurfaceProposer` that admission-checks typed analyst `PolicyEdit`s and applies each\n * admitted edit to the current surface as one measured candidate.\n */\nexport function policyEditProposer(opts: PolicyEditProposerOptions = {}): SurfaceProposer {\n  return {\n    kind: 'policy-edit',\n    async propose(ctx: ProposeContext): Promise<ProposedCandidate[]> {\n      const edits = materializePolicyEdits(opts.edits ?? ctx.findings, opts.findingOptions)\n      const limit = Math.max(\n        0,\n        Math.min(opts.maxCandidates ?? ctx.populationSize, ctx.populationSize),\n      )\n      const out: ProposedCandidate[] = []\n      const seen = new Set([surfaceContentHash(ctx.currentSurface)])\n      if (limit === 0) return out\n\n      for (const edit of edits) {\n        const admission = admitPolicyEdit(edit, opts.admission)\n        opts.onAdmission?.(admission)\n        if (admission.decision !== 'admit') continue\n\n        const surface = coerceCandidateSurface(applyPolicyEditToSurface(ctx.currentSurface, edit))\n        const hash = surfaceContentHash(surface)\n        if (seen.has(hash)) continue\n        seen.add(hash)\n\n        out.push({\n          surface,\n          label: `policy-edit:${edit.axis}`,\n          rationale:\n            `${edit.editId} expected ${edit.expectedGain.direction} ` +\n            `${edit.expectedGain.metric} by ${edit.expectedGain.amount}; ` +\n            `source findings [${edit.source.findingIds.join(', ')}]`,\n          candidateRecord: makePolicyEditCandidateRecord(edit),\n        })\n        if (out.length >= limit) break\n      }\n\n      return out\n    },\n  }\n}\n\nfunction materializePolicyEdits(\n  inputs: ReadonlyArray<unknown>,\n  findingOptions: FindingToPolicyEditOptions | undefined,\n): PolicyEdit[] {\n  const edits: PolicyEdit[] = []\n  const findings: AnalystFinding[] = []\n\n  for (const input of inputs) {\n    if (isPolicyEdit(input)) {\n      edits.push(input)\n    } else if (isAnalystFindingLike(input)) {\n      findings.push(input)\n    }\n  }\n\n  if (findings.length > 0) edits.push(...policyEditsFromFindings(findings, findingOptions))\n  return edits\n}\n\nfunction isAnalystFindingLike(input: unknown): input is AnalystFinding {\n  if (!input || typeof input !== 'object') return false\n  const obj = input as Record<string, unknown>\n  return (\n    typeof obj.finding_id === 'string' &&\n    typeof obj.analyst_id === 'string' &&\n    typeof obj.claim === 'string' &&\n    Array.isArray(obj.evidence_refs)\n  )\n}\n\nfunction coerceCandidateSurface(surface: unknown): MutableSurface {\n  if (typeof surface === 'string') return surface\n  if (surface && typeof surface === 'object') {\n    const obj = surface as Record<string, unknown>\n    if (obj.kind === 'code' && typeof obj.worktreeRef === 'string') {\n      assertCodeSurfaceIdentity(surface)\n      return surface\n    }\n    return JSON.stringify(surface, null, 2)\n  }\n  throw new Error('policyEditProposer: policy edit produced an unsupported surface')\n}\n","/** One measured scenario row eligible for PolicyEdit author context. */\nexport interface PolicyEditAuthorScenarioRow {\n  scenarioId: string\n  composite: number\n}\n\nexport interface SelectPolicyEditAuthorRowsOptions {\n  /** Maximum returned rows. Must be a positive safe integer. */\n  limit: number\n  /** Optional score to compare against, keyed by scenario ID. */\n  referenceByScenario?: ReadonlyMap<string, number>\n}\n\nexport interface SerializedJsonBudget {\n  json: string\n  actualChars: number\n  maxChars: number\n}\n\ninterface RankedRow<T> {\n  row: T\n  delta: number | null\n}\n\n/**\n * Select a bounded, deterministic evidence slice for a PolicyEdit author.\n *\n * Rows are deduplicated by scenario ID, keeping the first measured row. The\n * result then interleaves three ranked views: hardest score, largest regression,\n * and largest improvement. A row selected by multiple views appears once.\n */\nexport function selectPolicyEditAuthorRows<T extends PolicyEditAuthorScenarioRow>(\n  rows: readonly T[],\n  options: SelectPolicyEditAuthorRowsOptions,\n): T[] {\n  assertPositiveSafeInteger(options.limit, 'limit')\n\n  const unique = new Map<string, RankedRow<T>>()\n  for (const row of rows) {\n    if (!row.scenarioId || row.scenarioId.trim() !== row.scenarioId) {\n      throw new Error('selectPolicyEditAuthorRows: scenarioId must be trimmed and non-empty')\n    }\n    if (!Number.isFinite(row.composite)) {\n      throw new Error(\n        `selectPolicyEditAuthorRows: composite must be finite for '${row.scenarioId}'`,\n      )\n    }\n    if (unique.has(row.scenarioId)) continue\n\n    const reference = options.referenceByScenario?.get(row.scenarioId)\n    if (reference !== undefined && !Number.isFinite(reference)) {\n      throw new Error(\n        `selectPolicyEditAuthorRows: reference must be finite for '${row.scenarioId}'`,\n      )\n    }\n    unique.set(row.scenarioId, {\n      row,\n      delta: reference === undefined ? null : row.composite - reference,\n    })\n  }\n\n  const hardest = [...unique.values()].sort(\n    (a, b) => a.row.composite - b.row.composite || compareScenarioId(a.row, b.row),\n  )\n  const regressions = [...unique.values()]\n    .filter((entry) => entry.delta !== null && entry.delta < 0)\n    .sort((a, b) => a.delta! - b.delta! || compareScenarioId(a.row, b.row))\n  const improvements = [...unique.values()]\n    .filter((entry) => entry.delta !== null && entry.delta > 0)\n    .sort((a, b) => b.delta! - a.delta! || compareScenarioId(a.row, b.row))\n  const rankings = [hardest, regressions, improvements]\n  const maxDepth = Math.max(...rankings.map((ranking) => ranking.length), 0)\n  const selected: T[] = []\n  const selectedIds = new Set<string>()\n\n  for (let depth = 0; depth < maxDepth && selected.length < options.limit; depth += 1) {\n    for (const ranking of rankings) {\n      const entry = ranking[depth]\n      if (!entry || selectedIds.has(entry.row.scenarioId)) continue\n      selected.push(entry.row)\n      selectedIds.add(entry.row.scenarioId)\n      if (selected.length === options.limit) break\n    }\n  }\n  return selected\n}\n\n/** Serialize once and fail before dispatch when author context exceeds its budget. */\nexport function assertPolicyEditAuthorContextBudget(\n  value: unknown,\n  maxChars: number,\n): SerializedJsonBudget {\n  assertPositiveSafeInteger(maxChars, 'maxChars')\n  const json = JSON.stringify(value)\n  if (json === undefined) {\n    throw new Error('assertPolicyEditAuthorContextBudget: value must serialize to JSON')\n  }\n  const actualChars = json.length\n  if (actualChars > maxChars) {\n    throw new Error(\n      `assertPolicyEditAuthorContextBudget: serialized JSON exceeds budget (actualChars=${actualChars}, maxChars=${maxChars})`,\n    )\n  }\n  return { json, actualChars, maxChars }\n}\n\nfunction compareScenarioId(a: PolicyEditAuthorScenarioRow, b: PolicyEditAuthorScenarioRow): number {\n  return a.scenarioId < b.scenarioId ? -1 : a.scenarioId > b.scenarioId ? 1 : 0\n}\n\nfunction assertPositiveSafeInteger(value: number, name: string): void {\n  if (!Number.isSafeInteger(value) || value <= 0) {\n    throw new Error(`${name} must be a positive safe integer (got ${value})`)\n  }\n}\n","/**\n * `memoryCurationProposer` — a CURATOR `SurfaceProposer`, the complement to the\n * OPTIMIZER proposers (`gepaProposer` rewrites the prompt; this one BUILDS a\n * searchable memory of what prior trajectories taught and grafts the most\n * relevant lessons onto the surface).\n *\n * Each generation it:\n *  1. collects lessons — this generation's trace-analyst `findings` PLUS the\n *     memory already carried in the parent surface (so memory accumulates\n *     across generations instead of resetting);\n *  2. curates them — normalizes, deduplicates near-identical lessons, and ranks\n *     by recurrence (a lesson seen across many findings outranks a one-off);\n *  3. retrieves the top-K and writes them back as a single delimited memory\n *     block in the surface (idempotent — the block is replaced, never stacked,\n *     so the prompt does not grow without bound).\n *\n * This is the substrate behind the \"knowledge base of working trajectories\" the\n * agent searches: the curated block IS the retrieved memory the next run reads.\n * Curation is DETERMINISTIC (no LLM) so a lift it produces is attributable to\n * the lessons, not to model noise in a rewrite. An optional `distill` LLM step\n * can compress raw findings into crisp imperatives; default is verbatim.\n *\n * Fail-loud: never fabricates a lesson. With no findings and no prior memory it\n * returns no candidate (nothing learned yet — gen 0). It does not throw on an\n * empty generation because early generations legitimately have no findings.\n */\n\nimport { CostLedger, type CostLedgerHandle } from '../../cost-ledger'\nimport {\n  callLlm,\n  costReceiptFromLlm,\n  costReceiptFromLlmError,\n  type LlmCallRequest,\n  type LlmClientOptions,\n  maximumChargeForLlmRequest,\n} from '../../llm-client'\nimport type { ProposeContext, ProposedCandidate, SurfaceProposer } from '../types'\nimport {\n  extractBlockBody,\n  findingToLesson,\n  normKey,\n  stripBlock,\n  surfaceToText,\n} from './_findings-text'\n\nconst BLOCK_START = '<!-- BEGIN curated-memory (auto-managed by memoryCurationProposer) -->'\nconst BLOCK_END = '<!-- END curated-memory -->'\n\nexport interface MemoryCurationProposerOptions {\n  /** Optional ledger for direct proposer use. Campaign context takes precedence. */\n  costLedger?: CostLedgerHandle\n  /** Top-K lessons retained in the surface memory block. Default 12. */\n  maxEntries?: number\n  /** Heading rendered above the lessons inside the block. Default below. */\n  sectionHeading?: string\n  /**\n   * Optional LLM distillation: compress raw findings into crisp, generalizable\n   * one-line imperatives before curating. Omit for verbatim (deterministic).\n   */\n  distill?: {\n    baseUrl: string\n    apiKey?: string\n    model: string\n    maxTokens?: number\n    fetchImpl?: LlmClientOptions['fetch']\n  }\n}\n\nconst DEFAULT_HEADING = '## Learned from prior runs (curated memory)'\n\nconst DISTILL_SYSTEM =\n  'You compress raw trace-analysis findings into crisp, generalizable agent guidance. ' +\n  'Output ONLY a JSON array of strings, each one imperative lesson the agent should follow ' +\n  '(e.g. \"Always fetch a resource before mutating it\"). No prose outside the JSON. ' +\n  'Deduplicate; keep the most actionable and general; drop case-specific noise.'\n\n/** Pull the lessons already curated into the parent surface's memory block. */\nfunction extractExistingLessons(text: string): string[] {\n  return extractBlockBody(text, BLOCK_START, BLOCK_END)\n    .split('\\n')\n    .map((l) => l.replace(/^\\s*-\\s+/, '').trim())\n    .filter((l) => l && !l.startsWith('#'))\n}\n\nasync function distillLessons(\n  raw: string[],\n  distill: NonNullable<MemoryCurationProposerOptions['distill']>,\n  ctx: ProposeContext,\n  costLedger: CostLedgerHandle,\n): Promise<string[]> {\n  const request: LlmCallRequest = {\n    model: distill.model,\n    messages: [\n      { role: 'system', content: DISTILL_SYSTEM },\n      { role: 'user', content: `Findings:\\n${raw.map((r) => `- ${r}`).join('\\n')}` },\n    ],\n    maxTokens: distill.maxTokens ?? 2000,\n  }\n  const llm: LlmClientOptions = {\n    baseUrl: distill.baseUrl,\n    apiKey: distill.apiKey,\n    fetch: distill.fetchImpl,\n  }\n  const paid = await costLedger.runPaidCall({\n    channel: 'driver',\n    phase: ctx.costPhase ?? 'search.proposal',\n    actor: 'memory-curation.distill',\n    model: distill.model,\n    maximumCharge: maximumChargeForLlmRequest(request, llm),\n    tags: { generation: String(ctx.generation) },\n    signal: ctx.signal,\n    execute: (signal, callId) => callLlm(request, { ...llm, signal, idempotencyKey: callId }),\n    receipt: costReceiptFromLlm,\n    receiptFromError: costReceiptFromLlmError,\n  })\n  if (!paid.succeeded) throw paid.error\n  const res = paid.value\n  try {\n    const parsed = JSON.parse(res.content.trim())\n    if (Array.isArray(parsed)) {\n      const lessons = parsed.filter(\n        (x): x is string => typeof x === 'string' && x.trim().length > 0,\n      )\n      if (lessons.length > 0) return lessons\n    }\n  } catch {\n    // Distillation is a best-effort refinement; fall back to the verbatim\n    // findings rather than dropping real lessons on a malformed LLM reply.\n  }\n  return raw\n}\n\n/** Build the CURATOR proposer. */\nexport function memoryCurationProposer(opts: MemoryCurationProposerOptions = {}): SurfaceProposer {\n  const maxEntries = opts.maxEntries ?? 12\n  const heading = opts.sectionHeading ?? DEFAULT_HEADING\n  const directCostLedger = opts.costLedger ?? new CostLedger()\n  return {\n    kind: 'memory-curation',\n    async propose(ctx: ProposeContext): Promise<ProposedCandidate[]> {\n      const parent = surfaceToText(ctx.currentSurface)\n\n      // (1) Collect lessons: this generation's findings + memory already in the\n      //     parent (accumulation across generations).\n      const fresh: string[] = []\n      for (const f of ctx.findings ?? []) {\n        const l = findingToLesson(f)\n        if (l) fresh.push(l)\n      }\n      const carried = extractExistingLessons(parent)\n      if (fresh.length === 0 && carried.length === 0) return [] // nothing learned yet\n\n      const distilled =\n        opts.distill && fresh.length > 0\n          ? await distillLessons(fresh, opts.distill, ctx, ctx.costLedger ?? directCostLedger)\n          : fresh\n\n      // (2) Curate: dedup by normalized key, rank by recurrence (carried lessons\n      //     start with a recurrence prior of 1; each fresh occurrence adds).\n      const byKey = new Map<string, { text: string; count: number }>()\n      for (const l of carried) {\n        const k = normKey(l)\n        if (k) byKey.set(k, { text: l, count: 1 })\n      }\n      for (const l of distilled) {\n        const k = normKey(l)\n        if (!k) continue\n        const e = byKey.get(k)\n        if (e) e.count += 1\n        else byKey.set(k, { text: l, count: 1 })\n      }\n\n      // (3) Rank + top-K. Stable: by count desc, then lexicographic for determinism.\n      const ranked = [...byKey.values()]\n        .sort((a, b) => b.count - a.count || a.text.localeCompare(b.text))\n        .slice(0, maxEntries)\n      if (ranked.length === 0) return []\n\n      const block = [BLOCK_START, heading, ...ranked.map((e) => `- ${e.text}`), BLOCK_END].join(\n        '\\n',\n      )\n      const next = `${stripBlock(parent, BLOCK_START, BLOCK_END)}\\n\\n${block}\\n`\n      if (next === parent) return [] // no change (same lessons already curated)\n\n      return [\n        {\n          surface: next,\n          label: 'memory-curation',\n          rationale: `curated ${ranked.length} lessons (from ${fresh.length} new finding(s) + ${carried.length} carried)`,\n        },\n      ]\n    },\n  }\n}\n","/**\n * `traceAnalystProposer` — wraps agent-eval's OWN trace-analyst engine\n * (`AnalystRegistry` over the agentic OTLP reader) as a `SurfaceProposer`.\n * It is the symmetric opponent to `haloProposer`: both run the SAME shared\n * `analysisEditProposer` pipeline (materialize identical traces → apply via one\n * identical LLM edit), so a `compareProposers` lift delta isolates a single\n * variable — ANALYSIS QUALITY. The benchmark answers \"is our HALO clone as good\n * as the real HALO?\" as a held-out lift CI, not a vibe.\n *\n * Findings come from the REGISTRY (structured `AnalystFinding[]` carrying\n * area / severity / recommended_action), rendered into the report the shared\n * apply step consumes.\n *\n * Fail-loud: no traces → throw; analyst run errors → throw; zero findings →\n * throw. Never fabricate a candidate.\n */\n\nimport { ai } from '@ax-llm/ax'\nimport { createTraceAnalystKind, type TraceAnalystKindSpec } from '../../analyst/kind-factory'\nimport { DEFAULT_TRACE_ANALYST_KINDS } from '../../analyst/kinds'\nimport { AnalystRegistry } from '../../analyst/registry'\nimport type { AnalystFinding } from '../../analyst/types'\nimport type { CostLedgerHandle, CostReceiptInput, MaximumCharge } from '../../cost-ledger'\nimport type { LlmClientOptions } from '../../llm-client'\nimport { OtlpFileTraceStore } from '../../trace-analyst/store-otlp'\nimport type { ProposeContext, SurfaceProposer } from '../types'\nimport { analysisEditProposer } from './analysis-edit'\n\nexport interface TraceAnalystProposerOptions {\n  /** OpenAI-compatible base URL for BOTH the analyst's agentic reads and the\n   *  apply step (e.g. `https://api.deepseek.com/v1` or the Tangle router). */\n  baseUrl: string\n  /** Bearer key. Required — the Ax AI service has no env fallback here. */\n  apiKey: string\n  /** Model the analyst kinds use for their agentic trace reads. */\n  model: string\n  /** Model used to APPLY findings to the prompt surface. Default = `model`.\n   *  Keep this EQUAL to haloProposer's `applyModel` for an apples-to-apples run. */\n  applyModel?: string\n  /** Optional ledger for direct proposer use. Campaign context takes precedence. */\n  costLedger?: CostLedgerHandle\n  analysisMaximumCharge?: MaximumCharge\n  analysisReceipt?: (report: string) => CostReceiptInput\n  applyMaxTokens?: number\n  /** Ax provider name. Default 'openai' — works for any OpenAI-compatible base\n   *  via `apiURL`. Use 'deepseek' to hit DeepSeek's native provider. */\n  provider?: string\n  /** Which analyst kinds to run. Default = the full shipped suite. */\n  kinds?: readonly TraceAnalystKindSpec[]\n  /** Resolve the OTLP traces (JSONL string) the analyst should read for THIS\n   *  generation — identical contract to `haloProposer.resolveTraces`. */\n  resolveTraces: (ctx: ProposeContext) => string | Promise<string>\n  /** Override the findings producer. Default: the shipped `AnalystRegistry`\n   *  over `kinds`. The unit suite injects canned findings here. */\n  analyze?: (tracePath: string, ctx: ProposeContext) => Promise<ReadonlyArray<AnalystFinding>>\n  /** Test seam: inject a fetch for the apply-step `callLlm`. */\n  fetchImpl?: LlmClientOptions['fetch']\n}\n\n/** Render structured findings into the report shape the shared apply step\n *  consumes — so the application is identical across engines. */\nfunction renderFindings(findings: ReadonlyArray<AnalystFinding>): string {\n  return findings\n    .map((f, i) => {\n      const action = f.recommended_action ? `\\n   FIX: ${f.recommended_action}` : ''\n      const subject = f.subject ? ` (${f.subject})` : ''\n      return `${i + 1}. [${f.severity}/${f.area}]${subject} ${f.claim}${action}`\n    })\n    .join('\\n')\n}\n\n/** Wrap agent-eval's trace-analyst registry as a SurfaceProposer (prompt-tier). */\nexport function traceAnalystProposer(opts: TraceAnalystProposerOptions): SurfaceProposer {\n  if (!opts.apiKey) throw new Error('traceAnalystProposer: apiKey is required')\n  if (!opts.model) throw new Error('traceAnalystProposer: model is required')\n  const kinds = opts.kinds ?? DEFAULT_TRACE_ANALYST_KINDS\n\n  const produceFindings =\n    opts.analyze ??\n    (async (path: string, c: ProposeContext): Promise<ReadonlyArray<AnalystFinding>> => {\n      const aiService = ai({\n        name: opts.provider ?? 'openai',\n        apiKey: opts.apiKey,\n        apiURL: opts.baseUrl,\n        config: { model: opts.model },\n      })\n      const registry = new AnalystRegistry()\n      for (const spec of kinds) {\n        registry.register(createTraceAnalystKind(spec, { ai: aiService, model: opts.model }))\n      }\n      const result = await registry.run(\n        `trace-analyst-gen-${c.generation}`,\n        { traceStore: new OtlpFileTraceStore({ path }) },\n        { signal: c.signal },\n      )\n      return result.findings\n    })\n\n  return analysisEditProposer({\n    kind: 'trace-analyst',\n    label: 'trace-analyst',\n    baseUrl: opts.baseUrl,\n    apiKey: opts.apiKey,\n    analysisModel: opts.model,\n    applyModel: opts.applyModel ?? opts.model,\n    costLedger: opts.costLedger,\n    analysisMaximumCharge: opts.analysisMaximumCharge,\n    analysisReceipt: opts.analysisReceipt,\n    applyMaxTokens: opts.applyMaxTokens,\n    fetchImpl: opts.fetchImpl,\n    resolveTraces: opts.resolveTraces,\n    noTracesError:\n      'traceAnalystProposer: resolveTraces returned no OTLP traces — the analyst has nothing to read',\n    rationale: (report) => `trace-analyst findings:\\n${report.slice(0, 800)}`,\n    analyze: async (tracePath, ctx) => {\n      let findings: ReadonlyArray<AnalystFinding>\n      try {\n        findings = await produceFindings(tracePath, ctx)\n      } catch (e) {\n        throw new Error(\n          `traceAnalystProposer: analyst engine failed — ${e instanceof Error ? e.message : String(e)}`,\n        )\n      }\n      if (findings.length === 0) {\n        throw new Error('traceAnalystProposer: analyst engine produced no findings')\n      }\n      return renderFindings(findings)\n    },\n  })\n}\n","/**\n * Discriminative scenario selection (research claim E2).\n *\n * The OR benchmark is SATURATING: run 7 measured ~75% tied holdout cells — most\n * problems are solved optimally by the baseline AND every candidate, so those\n * paired cells carry zero signal. A random/balanced holdout split spends its\n * budget on scenarios that cannot separate candidates.\n *\n * This picks the holdout by DISCRIMINATION power instead: a scenario every\n * candidate scores identically (variance ~0) carries no signal; one where the\n * scores spread carries the most. We drop fully saturated ties so each paired\n * holdout cell is spent on a scenario that can actually move a verdict.\n */\n\n/** Per-scenario observation: the composite scores each candidate earned on it. */\nexport interface ScenarioSignal {\n  scenarioId: string\n  /** Per-candidate composite scores observed for this scenario (>=1 values). */\n  scores: number[]\n}\n\nexport interface DiscriminationScore {\n  scenarioId: string\n  /** Higher = separates candidates more (spread of their scores). */\n  discrimination: number\n  /** Higher = easier / more-saturated (mean of candidate scores). */\n  meanScore: number\n  variance: number\n  /** variance ~0 AND meanScore at/above the ceiling ⇒ a saturated tie, no signal. */\n  tied: boolean\n}\n\nconst DEFAULT_SATURATION_CEILING = 0.999\n/** Variance below this is treated as \"every candidate scored the same\". */\nconst VARIANCE_EPSILON = 1e-9\n\ninterface Moments {\n  meanScore: number\n  variance: number\n}\n\n/** Population mean + variance of the candidate scores. Empty ⇒ zeros (a signal\n *  with no observations cannot discriminate). */\nfunction moments(scores: number[]): Moments {\n  const n = scores.length\n  if (n === 0) return { meanScore: 0, variance: 0 }\n  let sum = 0\n  for (const s of scores) sum += s\n  const meanScore = sum / n\n  let sqDev = 0\n  for (const s of scores) {\n    const d = s - meanScore\n    sqDev += d * d\n  }\n  return { meanScore, variance: sqDev / n }\n}\n\n/** Deterministic ordering: discrimination desc, then meanScore asc (more\n *  headroom first), then scenarioId asc. */\nfunction compareDiscrimination(a: DiscriminationScore, b: DiscriminationScore): number {\n  if (b.discrimination !== a.discrimination) return b.discrimination - a.discrimination\n  if (a.meanScore !== b.meanScore) return a.meanScore - b.meanScore\n  return a.scenarioId < b.scenarioId ? -1 : a.scenarioId > b.scenarioId ? 1 : 0\n}\n\n/**\n * Rank scenarios by how well they DISCRIMINATE candidates.\n *\n * `discrimination = variance` (spread of the candidate scores) — kept simple on\n * purpose; the headroom term (`saturationCeiling - meanScore`) only breaks ties\n * so that, among equally spread scenarios, the one with more room to improve\n * ranks first. Returned sorted by the deterministic order above.\n */\nexport function scoreDiscrimination(\n  signals: ScenarioSignal[],\n  opts?: { saturationCeiling?: number },\n): DiscriminationScore[] {\n  const saturationCeiling = opts?.saturationCeiling ?? DEFAULT_SATURATION_CEILING\n  const scored = signals.map((signal): DiscriminationScore => {\n    const { meanScore, variance } = moments(signal.scores)\n    const tied = variance < VARIANCE_EPSILON && meanScore >= saturationCeiling\n    return {\n      scenarioId: signal.scenarioId,\n      discrimination: variance,\n      meanScore,\n      variance,\n      tied,\n    }\n  })\n  return scored.sort(compareDiscrimination)\n}\n\n/**\n * Select the top-`k` most discriminative scenario ids for a holdout, EXCLUDING\n * fully saturated ties when enough non-tied scenarios exist (a tie in the\n * holdout wastes a paired cell).\n *\n * Prefers non-tied scenarios; if fewer than `k` non-tied exist, fills with the\n * least-saturated tied ones (tied scenarios are already ordered least-saturated\n * first by `meanScore` asc). Deterministic. Throws if `k < 1`. If\n * `signals.length <= k`, returns all ids in discrimination order.\n */\nexport function selectDiscriminative(\n  signals: ScenarioSignal[],\n  k: number,\n  opts?: { saturationCeiling?: number },\n): string[] {\n  if (k < 1) throw new Error(`selectDiscriminative: k must be >= 1 (got ${k})`)\n  const ranked = scoreDiscrimination(signals, opts)\n  if (ranked.length <= k) return ranked.map((s) => s.scenarioId)\n  const nonTied = ranked.filter((s) => !s.tied)\n  if (nonTied.length >= k) return nonTied.slice(0, k).map((s) => s.scenarioId)\n  const tied = ranked.filter((s) => s.tied)\n  const fill = tied.slice(0, k - nonTied.length)\n  return [...nonTied, ...fill].map((s) => s.scenarioId)\n}\n","/**\n * Durable append-only audit log for improvement searches.\n *\n * Existing campaign artifacts keep their own rich records: `RunRecord` owns a\n * measured run, `Lineage` owns the candidate graph, and `CostLedger` owns\n * per-call accounting. This ledger does not copy those structures. It binds\n * their immutable ids and receipts into one replayable event stream so a\n * search can answer, after a crash, exactly which candidates and task attempts\n * existed, which surfaces actually fired, what they cost, and why they were\n * selected or rejected.\n *\n * The file format is canonical JSONL with a SHA-256 hash chain. Every append is\n * serialized across processes, fsynced before acknowledgement, and idempotent\n * by `eventId`. A malformed, non-canonical, truncated, reordered, or conflicting\n * log fails loudly; the implementation never skips a bad row.\n */\n\nimport { createHash } from 'node:crypto'\nimport { existsSync, readFileSync } from 'node:fs'\nimport { resolve } from 'node:path'\nimport { z } from 'zod'\nimport { Mutex } from '../concurrency'\nimport { canonicalize } from '../pre-registration'\nimport { modelHasSnapshot } from '../run-record'\nimport {\n  SearchLedgerConflictError,\n  SearchLedgerError,\n  SearchLedgerIntegrityError,\n} from './search-ledger-errors'\nimport { appendSearchLedgerLine, withSearchLedgerFileLock } from './search-ledger-file'\n\nexport { SearchLedgerConflictError, SearchLedgerError, SearchLedgerIntegrityError }\n\nexport const SEARCH_LEDGER_SCHEMA = 'tangle.search-ledger.v1' as const\n\nexport type SearchLedgerHash = `sha256:${string}`\n\nexport type SearchSurfaceKind =\n  | 'prompt'\n  | 'tool-contract'\n  | 'runtime-config'\n  | 'memory'\n  | 'knowledge'\n  | 'agent-profile'\n  | 'code'\n  | 'deployment'\n\n/** Content-addressed artifact or receipt. Mutable paths are locators only; the\n * digest and byte length bind the exact bytes used by the search. */\nexport interface SearchArtifactRef {\n  role: string\n  uri: string\n  sha256: SearchLedgerHash\n  byteLength: number\n}\n\n/** Repository, dataset, or package source pinned to an immutable commit or\n * content digest. Branches, tags, and bare package versions are rejected. */\nexport interface SearchSourceRef {\n  uri: string\n  revision: string\n}\n\nexport interface SearchModelIdentity {\n  provider: string\n  snapshot: string\n}\n\nexport interface SearchCandidateSurface {\n  surfaceId: string\n  kind: SearchSurfaceKind\n  artifact: SearchArtifactRef\n}\n\nexport interface SearchCandidateLineage {\n  /** Existing `LineageNode.id`; this ledger references rather than embeds it. */\n  lineageNodeId: string\n  parentCandidateIds: string[]\n  generation: number\n  proposer: string\n  proposerSource: SearchSourceRef\n}\n\nexport type SearchOperationKind =\n  | 'candidate-generation'\n  | 'analysis'\n  | 'selection'\n  | 'judge'\n  | 'other'\n\nexport interface SearchPlannedTask {\n  taskId: string\n  source: SearchSourceRef\n  benchmark: SearchSourceRef\n  /** Maximum transport attempts for this task and candidate. Only an explicit\n   * passed/failed outcome satisfies the planned denominator. */\n  maxAttempts: number\n}\n\nexport interface SearchPlannedOperation {\n  operationId: string\n  kind: SearchOperationKind\n}\n\nexport interface SearchCandidateSlot {\n  slotId: string\n  /** Planned candidate-generation call that must either produce this slot or\n   * fail before the slot can be closed. Several slots may share one batched call. */\n  generationOperationId: string\n}\n\nexport interface SearchPlan {\n  /** Stable slots and their proposer calls are frozen before search begins. */\n  candidateSlots: SearchCandidateSlot[]\n  /** Every task applies to every successfully registered candidate. */\n  tasks: SearchPlannedTask[]\n  /** Non-task spend slots: proposal, analysis, selection, extra judges, etc. */\n  operations: SearchPlannedOperation[]\n}\n\nexport type SearchTokenAccounting =\n  | {\n      status: 'known'\n      inputTokens: number\n      outputTokens: number\n      cachedTokens: number\n    }\n  | {\n      status: 'unknown'\n      reason: string\n    }\n\nexport type SearchCostAccounting =\n  | {\n      status: 'known'\n      usd: number\n      source: 'provider' | 'pricing-table' | 'free'\n    }\n  | {\n      status: 'unknown'\n      /** Known spend may still be a lower bound when one call was unpriced. */\n      knownLowerBoundUsd: number\n      reason: string\n    }\n\nexport interface SearchAttemptAccounting {\n  tokens: SearchTokenAccounting\n  cost: SearchCostAccounting\n}\n\nexport interface SearchFailureReason {\n  code: string\n  message: string\n}\n\nexport type SearchTaskOutcome =\n  | {\n      status: 'passed'\n      score: number\n      metrics: Record<string, number>\n    }\n  | {\n      status: 'failed'\n      score: number\n      metrics: Record<string, number>\n      failure: SearchFailureReason\n    }\n  | {\n      status: 'errored'\n      metrics: Record<string, number>\n      error: SearchFailureReason & { retryable: boolean }\n    }\n\nexport type SearchSurfaceEffect =\n  | {\n      status: 'measured'\n      metric: string\n      baselineValue: number\n      candidateValue: number\n      delta: number\n    }\n  | {\n      status: 'not-measured'\n      reason: string\n    }\n\n/** Per-attempt proof that a declared candidate surface was or was not active,\n * plus measured effect when the experiment supports attribution. */\nexport interface SearchSurfaceEvidence {\n  surfaceId: string\n  fired: boolean\n  firingCount: number\n  effect: SearchSurfaceEffect\n  evidence: SearchArtifactRef[]\n}\n\ninterface SearchLedgerEventBase {\n  eventId: string\n  occurredAt: string\n  artifacts: SearchArtifactRef[]\n}\n\nexport interface SearchPlannedEvent extends SearchLedgerEventBase {\n  kind: 'search-planned'\n  plan: SearchPlan\n}\n\nexport interface SearchCandidateRegisteredEvent extends SearchLedgerEventBase {\n  kind: 'candidate-registered'\n  slotId: string\n  generationOperationId: string\n  candidateId: string\n  lineage: SearchCandidateLineage\n  surfaces: SearchCandidateSurface[]\n}\n\nexport interface SearchCandidateSlotClosedEvent extends SearchLedgerEventBase {\n  kind: 'candidate-slot-closed'\n  slotId: string\n  generationOperationId: string\n  reason: SearchFailureReason\n}\n\nexport interface SearchTaskAttemptedEvent extends SearchLedgerEventBase {\n  kind: 'task-attempted'\n  candidateId: string\n  runId: string\n  attemptIndex: number\n  task: {\n    taskId: string\n    source: SearchSourceRef\n  }\n  identity: {\n    model: SearchModelIdentity\n    agent: SearchSourceRef\n    benchmark: SearchSourceRef\n  }\n  outcome: SearchTaskOutcome\n  accounting: SearchAttemptAccounting\n  surfaceEvidence: SearchSurfaceEvidence[]\n}\n\nexport interface SearchOperationRecordedEvent extends SearchLedgerEventBase {\n  kind: 'search-operation-recorded'\n  operationId: string\n  operationKind: SearchOperationKind\n  execution:\n    | {\n        kind: 'model'\n        model: SearchModelIdentity\n        source: SearchSourceRef\n      }\n    | {\n        kind: 'deterministic'\n        source: SearchSourceRef\n      }\n  outcome:\n    | { status: 'completed' }\n    | { status: 'partial'; failure: SearchFailureReason }\n    | { status: 'failed'; failure: SearchFailureReason }\n  accounting: SearchAttemptAccounting\n}\n\nexport interface SearchCandidateDecidedEvent extends SearchLedgerEventBase {\n  kind: 'candidate-decided'\n  candidateId: string\n  decision:\n    | { status: 'selected' }\n    | {\n        status: 'rejected'\n        reason: SearchFailureReason\n      }\n}\n\nexport interface SearchCompletedEvent extends SearchLedgerEventBase {\n  kind: 'search-completed'\n  result:\n    | {\n        status: 'selected'\n        candidateId: string\n      }\n    | {\n        status: 'all-rejected'\n        reason: SearchFailureReason\n      }\n}\n\nexport type SearchLedgerEvent =\n  | SearchPlannedEvent\n  | SearchCandidateRegisteredEvent\n  | SearchCandidateSlotClosedEvent\n  | SearchTaskAttemptedEvent\n  | SearchOperationRecordedEvent\n  | SearchCandidateDecidedEvent\n  | SearchCompletedEvent\n\nexport interface SearchLedgerEntry {\n  schema: typeof SEARCH_LEDGER_SCHEMA\n  campaignId: string\n  sequence: number\n  previousHash: SearchLedgerHash | null\n  event: SearchLedgerEvent\n  entryHash: SearchLedgerHash\n}\n\nexport type SearchAccountingAudit =\n  | {\n      status: 'known'\n      inputTokens: number\n      outputTokens: number\n      cachedTokens: number\n      costUsd: number\n    }\n  | {\n      status: 'partial'\n      knownInputTokens: number\n      knownOutputTokens: number\n      knownCachedTokens: number\n      knownCostUsd: number\n      unknownTokenEventIds: string[]\n      unknownCostEventIds: string[]\n    }\n\nexport interface SearchLedgerAudit {\n  campaignId: string\n  eventCount: number\n  candidateCount: number\n  closedCandidateSlotCount: number\n  attemptCount: number\n  operationCount: number\n  outcomes: { passed: number; failed: number; errored: number }\n  operationOutcomes: { completed: number; partial: number; failed: number }\n  decisions: { selected: number; rejected: number; pending: number }\n  expected: {\n    candidateSlots: number\n    taskOutcomes: number\n    operations: number\n    missingCandidateSlots: string[]\n    missingTaskOutcomes: string[]\n    missingOperations: string[]\n  }\n  status: 'in-progress' | 'selected' | 'all-rejected'\n  selectedCandidateId: string | null\n  accounting: SearchAccountingAudit\n  headHash: SearchLedgerHash | null\n}\n\nexport interface SearchLedgerReplay {\n  entries: SearchLedgerEntry[]\n  plan: SearchPlannedEvent | null\n  candidates: SearchCandidateRegisteredEvent[]\n  closedCandidateSlots: SearchCandidateSlotClosedEvent[]\n  attempts: SearchTaskAttemptedEvent[]\n  operations: SearchOperationRecordedEvent[]\n  decisions: SearchCandidateDecidedEvent[]\n  completion: SearchCompletedEvent | null\n  audit: SearchLedgerAudit\n}\n\nexport interface SearchLedgerAppendResult {\n  entry: SearchLedgerEntry\n  /** False when the exact event was already durably present. */\n  appended: boolean\n  replay: SearchLedgerReplay\n}\n\nconst NON_EMPTY = z\n  .string()\n  .min(1)\n  .refine((value) => value.trim() === value, 'must not contain surrounding whitespace')\nconst HASH = z.string().regex(/^sha256:[a-f0-9]{64}$/)\nconst LINEAGE_NODE_ID = z.string().regex(/^[a-f0-9]{16}$/)\nconst IMMUTABLE_REVISION = z\n  .string()\n  .regex(/^(?:[a-f0-9]{40}|[a-f0-9]{64}|sha256:[a-f0-9]{64}|sha512:[A-Za-z0-9+/=]+)$/)\nconst ISO_TIMESTAMP = z\n  .string()\n  .regex(/^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(?:\\.\\d{3})?Z$/)\n  .refine((value) => Number.isFinite(Date.parse(value)), 'invalid timestamp')\nconst NON_NEGATIVE_INT = z.number().int().nonnegative().safe()\nconst FINITE_NUMBER = z.number().finite()\n\nconst ArtifactRefSchema = z\n  .object({\n    role: NON_EMPTY,\n    uri: NON_EMPTY,\n    sha256: HASH,\n    byteLength: NON_NEGATIVE_INT,\n  })\n  .strict()\n\nconst SourceRefSchema = z\n  .object({\n    uri: NON_EMPTY,\n    revision: IMMUTABLE_REVISION,\n  })\n  .strict()\n\nconst FailureReasonSchema = z\n  .object({\n    code: NON_EMPTY,\n    message: NON_EMPTY,\n  })\n  .strict()\n\nconst EventBaseShape = {\n  eventId: NON_EMPTY,\n  occurredAt: ISO_TIMESTAMP,\n  artifacts: z.array(ArtifactRefSchema).min(1),\n}\n\nconst OperationKindSchema = z.enum([\n  'candidate-generation',\n  'analysis',\n  'selection',\n  'judge',\n  'other',\n])\n\nconst SearchPlannedSchema = z\n  .object({\n    ...EventBaseShape,\n    kind: z.literal('search-planned'),\n    plan: z\n      .object({\n        candidateSlots: z\n          .array(\n            z\n              .object({\n                slotId: NON_EMPTY,\n                generationOperationId: NON_EMPTY,\n              })\n              .strict(),\n          )\n          .min(1),\n        tasks: z\n          .array(\n            z\n              .object({\n                taskId: NON_EMPTY,\n                source: SourceRefSchema,\n                benchmark: SourceRefSchema,\n                maxAttempts: z.number().int().positive().safe(),\n              })\n              .strict(),\n          )\n          .min(1),\n        operations: z\n          .array(\n            z\n              .object({\n                operationId: NON_EMPTY,\n                kind: OperationKindSchema,\n              })\n              .strict(),\n          )\n          .min(1),\n      })\n      .strict(),\n  })\n  .strict()\n\nconst CandidateRegisteredSchema = z\n  .object({\n    ...EventBaseShape,\n    kind: z.literal('candidate-registered'),\n    slotId: NON_EMPTY,\n    generationOperationId: NON_EMPTY,\n    candidateId: NON_EMPTY,\n    lineage: z\n      .object({\n        lineageNodeId: LINEAGE_NODE_ID,\n        parentCandidateIds: z.array(NON_EMPTY),\n        generation: NON_NEGATIVE_INT,\n        proposer: NON_EMPTY,\n        proposerSource: SourceRefSchema,\n      })\n      .strict(),\n    surfaces: z\n      .array(\n        z\n          .object({\n            surfaceId: NON_EMPTY,\n            kind: z.enum([\n              'prompt',\n              'tool-contract',\n              'runtime-config',\n              'memory',\n              'knowledge',\n              'agent-profile',\n              'code',\n              'deployment',\n            ]),\n            artifact: ArtifactRefSchema,\n          })\n          .strict(),\n      )\n      .min(1),\n  })\n  .strict()\n\nconst CandidateSlotClosedSchema = z\n  .object({\n    ...EventBaseShape,\n    kind: z.literal('candidate-slot-closed'),\n    slotId: NON_EMPTY,\n    generationOperationId: NON_EMPTY,\n    reason: FailureReasonSchema,\n  })\n  .strict()\n\nconst KnownTokensSchema = z\n  .object({\n    status: z.literal('known'),\n    inputTokens: NON_NEGATIVE_INT,\n    outputTokens: NON_NEGATIVE_INT,\n    cachedTokens: NON_NEGATIVE_INT,\n  })\n  .strict()\n\nconst UnknownSchema = z\n  .object({\n    status: z.literal('unknown'),\n    reason: NON_EMPTY,\n  })\n  .strict()\n\nconst KnownCostSchema = z\n  .object({\n    status: z.literal('known'),\n    usd: z.number().finite().nonnegative(),\n    source: z.enum(['provider', 'pricing-table', 'free']),\n  })\n  .strict()\n  .superRefine((cost, ctx) => {\n    if (cost.source === 'free' && cost.usd !== 0) {\n      ctx.addIssue({ code: 'custom', message: 'free cost source must have usd 0' })\n    }\n  })\n\nconst UnknownCostSchema = z\n  .object({\n    status: z.literal('unknown'),\n    knownLowerBoundUsd: z.number().finite().nonnegative(),\n    reason: NON_EMPTY,\n  })\n  .strict()\n\nconst AccountingSchema = z\n  .object({\n    tokens: z.discriminatedUnion('status', [KnownTokensSchema, UnknownSchema]),\n    cost: z.discriminatedUnion('status', [KnownCostSchema, UnknownCostSchema]),\n  })\n  .strict()\n\nconst MetricsSchema = z.record(NON_EMPTY, FINITE_NUMBER).superRefine((metrics, ctx) => {\n  for (const key of Object.keys(metrics)) {\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      ctx.addIssue({ code: 'custom', message: `unsafe metric key ${key}` })\n    }\n  }\n})\n\nconst OutcomeSchema = z.discriminatedUnion('status', [\n  z\n    .object({\n      status: z.literal('passed'),\n      score: FINITE_NUMBER,\n      metrics: MetricsSchema,\n    })\n    .strict(),\n  z\n    .object({\n      status: z.literal('failed'),\n      score: FINITE_NUMBER,\n      metrics: MetricsSchema,\n      failure: FailureReasonSchema,\n    })\n    .strict(),\n  z\n    .object({\n      status: z.literal('errored'),\n      metrics: MetricsSchema,\n      error: FailureReasonSchema.extend({ retryable: z.boolean() }).strict(),\n    })\n    .strict(),\n])\n\nconst EffectSchema = z.discriminatedUnion('status', [\n  z\n    .object({\n      status: z.literal('measured'),\n      metric: NON_EMPTY,\n      baselineValue: FINITE_NUMBER,\n      candidateValue: FINITE_NUMBER,\n      delta: FINITE_NUMBER,\n    })\n    .strict()\n    .superRefine((effect, ctx) => {\n      const expected = effect.candidateValue - effect.baselineValue\n      const tolerance = Number.EPSILON * Math.max(1, Math.abs(expected), Math.abs(effect.delta)) * 8\n      if (Math.abs(effect.delta - expected) > tolerance) {\n        ctx.addIssue({ code: 'custom', message: 'delta must equal candidateValue - baselineValue' })\n      }\n    }),\n  z\n    .object({\n      status: z.literal('not-measured'),\n      reason: NON_EMPTY,\n    })\n    .strict(),\n])\n\nconst SurfaceEvidenceSchema = z\n  .object({\n    surfaceId: NON_EMPTY,\n    fired: z.boolean(),\n    firingCount: NON_NEGATIVE_INT,\n    effect: EffectSchema,\n    evidence: z.array(ArtifactRefSchema).min(1),\n  })\n  .strict()\n  .superRefine((evidence, ctx) => {\n    if (evidence.fired && evidence.firingCount === 0) {\n      ctx.addIssue({ code: 'custom', message: 'a fired surface must have firingCount >= 1' })\n    }\n    if (!evidence.fired && evidence.firingCount !== 0) {\n      ctx.addIssue({\n        code: 'custom',\n        message: 'a surface that did not fire must have firingCount 0',\n      })\n    }\n    if (!evidence.fired && evidence.effect.status === 'measured' && evidence.effect.delta !== 0) {\n      ctx.addIssue({\n        code: 'custom',\n        message: 'a surface that did not fire cannot claim non-zero effect',\n      })\n    }\n  })\n\nconst TaskAttemptedSchema = z\n  .object({\n    ...EventBaseShape,\n    kind: z.literal('task-attempted'),\n    candidateId: NON_EMPTY,\n    runId: NON_EMPTY,\n    attemptIndex: NON_NEGATIVE_INT,\n    task: z.object({ taskId: NON_EMPTY, source: SourceRefSchema }).strict(),\n    identity: z\n      .object({\n        model: z\n          .object({\n            provider: NON_EMPTY,\n            snapshot: NON_EMPTY.refine(\n              modelHasSnapshot,\n              'model must include an immutable snapshot',\n            ),\n          })\n          .strict(),\n        agent: SourceRefSchema,\n        benchmark: SourceRefSchema,\n      })\n      .strict(),\n    outcome: OutcomeSchema,\n    accounting: AccountingSchema,\n    surfaceEvidence: z.array(SurfaceEvidenceSchema).min(1),\n  })\n  .strict()\n\nconst SearchOperationRecordedSchema = z\n  .object({\n    ...EventBaseShape,\n    kind: z.literal('search-operation-recorded'),\n    operationId: NON_EMPTY,\n    operationKind: OperationKindSchema,\n    execution: z.discriminatedUnion('kind', [\n      z\n        .object({\n          kind: z.literal('model'),\n          model: z\n            .object({\n              provider: NON_EMPTY,\n              snapshot: NON_EMPTY.refine(\n                modelHasSnapshot,\n                'model must include an immutable snapshot',\n              ),\n            })\n            .strict(),\n          source: SourceRefSchema,\n        })\n        .strict(),\n      z\n        .object({\n          kind: z.literal('deterministic'),\n          source: SourceRefSchema,\n        })\n        .strict(),\n    ]),\n    outcome: z.discriminatedUnion('status', [\n      z.object({ status: z.literal('completed') }).strict(),\n      z\n        .object({\n          status: z.literal('partial'),\n          failure: FailureReasonSchema,\n        })\n        .strict(),\n      z\n        .object({\n          status: z.literal('failed'),\n          failure: FailureReasonSchema,\n        })\n        .strict(),\n    ]),\n    accounting: AccountingSchema,\n  })\n  .strict()\n\nconst CandidateDecidedSchema = z\n  .object({\n    ...EventBaseShape,\n    kind: z.literal('candidate-decided'),\n    candidateId: NON_EMPTY,\n    decision: z.discriminatedUnion('status', [\n      z.object({ status: z.literal('selected') }).strict(),\n      z\n        .object({\n          status: z.literal('rejected'),\n          reason: FailureReasonSchema,\n        })\n        .strict(),\n    ]),\n  })\n  .strict()\n\nconst SearchCompletedSchema = z\n  .object({\n    ...EventBaseShape,\n    kind: z.literal('search-completed'),\n    result: z.discriminatedUnion('status', [\n      z\n        .object({\n          status: z.literal('selected'),\n          candidateId: NON_EMPTY,\n        })\n        .strict(),\n      z\n        .object({\n          status: z.literal('all-rejected'),\n          reason: FailureReasonSchema,\n        })\n        .strict(),\n    ]),\n  })\n  .strict()\n\nconst EventSchema = z.discriminatedUnion('kind', [\n  SearchPlannedSchema,\n  CandidateRegisteredSchema,\n  CandidateSlotClosedSchema,\n  TaskAttemptedSchema,\n  SearchOperationRecordedSchema,\n  CandidateDecidedSchema,\n  SearchCompletedSchema,\n])\n\nconst EntrySchema = z\n  .object({\n    schema: z.literal(SEARCH_LEDGER_SCHEMA),\n    campaignId: NON_EMPTY,\n    sequence: NON_NEGATIVE_INT,\n    previousHash: z.union([HASH, z.null()]),\n    event: EventSchema,\n    entryHash: HASH,\n  })\n  .strict()\n\n/** Validate and return a canonical copy. Arrays whose order is not semantic are\n * sorted so retries from different processes produce byte-identical events. */\nexport function validateSearchLedgerEvent(input: unknown): SearchLedgerEvent {\n  const parsed = EventSchema.safeParse(input)\n  if (!parsed.success) {\n    throw new SearchLedgerError(`invalid search ledger event: ${formatZodError(parsed.error)}`)\n  }\n  return normalizeEvent(parsed.data as SearchLedgerEvent)\n}\n\nexport interface OpenSearchLedgerOptions {\n  path: string\n  campaignId: string\n}\n\nexport interface SearchLedger {\n  readonly path: string\n  readonly campaignId: string\n  append(event: SearchLedgerEvent): Promise<SearchLedgerAppendResult>\n  replay(): Promise<SearchLedgerReplay>\n}\n\n/** Open a durable filesystem search ledger. Construction performs no I/O; the\n * first `append` or `replay` validates the complete existing file. */\nexport function openSearchLedger(options: OpenSearchLedgerOptions): SearchLedger {\n  if (options.path.trim().length === 0) throw new SearchLedgerError('ledger path is empty')\n  return new FileSearchLedger(options.path, options.campaignId)\n}\n\nconst ledgerMutexes = new Map<string, Mutex>()\n\nfunction mutexFor(path: string): Mutex {\n  const existing = ledgerMutexes.get(path)\n  if (existing) return existing\n  const mutex = new Mutex()\n  ledgerMutexes.set(path, mutex)\n  return mutex\n}\n\nexport class FileSearchLedger implements SearchLedger {\n  readonly path: string\n  readonly campaignId: string\n  private readonly mutex: Mutex\n\n  constructor(path: string, campaignId: string) {\n    if (path.trim().length === 0) throw new SearchLedgerError('ledger path is empty')\n    if (campaignId.length === 0) throw new SearchLedgerError('campaignId is empty')\n    if (campaignId.trim() !== campaignId) {\n      throw new SearchLedgerError('campaignId must not contain surrounding whitespace')\n    }\n    this.path = resolve(path)\n    this.campaignId = campaignId\n    this.mutex = mutexFor(this.path)\n  }\n\n  async replay(): Promise<SearchLedgerReplay> {\n    return this.mutex.runExclusive(() =>\n      withSearchLedgerFileLock(this.path, () => replayFile(this.path, this.campaignId)),\n    )\n  }\n\n  async append(input: SearchLedgerEvent): Promise<SearchLedgerAppendResult> {\n    const event = validateSearchLedgerEvent(input)\n    return this.mutex.runExclusive(() =>\n      withSearchLedgerFileLock(this.path, () => {\n        const before = replayFile(this.path, this.campaignId)\n        const existing = before.entries.find((entry) => entry.event.eventId === event.eventId)\n        if (existing) {\n          if (canonicalString(existing.event) !== canonicalString(event)) {\n            throw new SearchLedgerConflictError(\n              `eventId ${event.eventId} already exists with different content`,\n            )\n          }\n          return { entry: existing, appended: false, replay: before }\n        }\n\n        const previousHash = before.audit.headHash\n        const material = {\n          schema: SEARCH_LEDGER_SCHEMA,\n          campaignId: this.campaignId,\n          sequence: before.entries.length,\n          previousHash,\n          event,\n        } as const\n        const entry: SearchLedgerEntry = {\n          ...material,\n          entryHash: hashCanonical(material),\n        }\n\n        // Apply the state transition before spending an append. This catches\n        // unknown parents, missing task attempts, duplicate decisions, and\n        // invalid completion records without touching the durable file.\n        const replay = replayEntries([...before.entries, entry], this.campaignId)\n        appendSearchLedgerLine(this.path, `${canonicalString(entry)}\\n`)\n        return { entry, appended: true, replay }\n      }),\n    )\n  }\n}\n\nfunction replayFile(path: string, campaignId: string): SearchLedgerReplay {\n  if (!existsSync(path)) return replayEntries([], campaignId)\n  const text = readFileSync(path, 'utf8')\n  if (text.length === 0) return replayEntries([], campaignId)\n  if (!text.endsWith('\\n')) {\n    throw new SearchLedgerIntegrityError(\n      `search ledger ${path} has a truncated final record (missing newline)`,\n    )\n  }\n\n  const lines = text.slice(0, -1).split('\\n')\n  const entries: SearchLedgerEntry[] = []\n  for (let index = 0; index < lines.length; index += 1) {\n    const line = lines[index]!\n    if (line.length === 0) {\n      throw new SearchLedgerIntegrityError(\n        `search ledger ${path} has a blank row at line ${index + 1}`,\n      )\n    }\n    let raw: unknown\n    try {\n      raw = JSON.parse(line)\n    } catch (error) {\n      throw new SearchLedgerIntegrityError(\n        `search ledger ${path} has invalid JSON at line ${index + 1}`,\n        { cause: error },\n      )\n    }\n    const parsed = EntrySchema.safeParse(raw)\n    if (!parsed.success) {\n      throw new SearchLedgerIntegrityError(\n        `search ledger ${path} has a malformed entry at line ${index + 1}: ${formatZodError(parsed.error)}`,\n      )\n    }\n    const entry = parsed.data as SearchLedgerEntry\n    const normalizedEvent = validateSearchLedgerEvent(entry.event)\n    if (canonicalString(normalizedEvent) !== canonicalString(entry.event)) {\n      throw new SearchLedgerIntegrityError(\n        `search ledger ${path} has non-canonical event ordering at line ${index + 1}`,\n      )\n    }\n    if (line !== canonicalString(entry)) {\n      throw new SearchLedgerIntegrityError(\n        `search ledger ${path} has non-canonical bytes at line ${index + 1}`,\n      )\n    }\n    entries.push(entry)\n  }\n  return replayEntries(entries, campaignId)\n}\n\ninterface CandidateState {\n  registered: SearchCandidateRegisteredEvent\n  attempts: SearchTaskAttemptedEvent[]\n  decision: SearchCandidateDecidedEvent | null\n}\n\nfunction replayEntries(entries: SearchLedgerEntry[], campaignId: string): SearchLedgerReplay {\n  const candidates = new Map<string, CandidateState>()\n  const candidateBySlot = new Map<string, string>()\n  const closedSlots = new Map<string, SearchCandidateSlotClosedEvent>()\n  const lineageNodes = new Map<string, string>()\n  const eventIds = new Set<string>()\n  const runIds = new Set<string>()\n  const attemptKeys = new Set<string>()\n  const candidateEvents: SearchCandidateRegisteredEvent[] = []\n  const closedSlotEvents: SearchCandidateSlotClosedEvent[] = []\n  const attempts: SearchTaskAttemptedEvent[] = []\n  const operationEvents: SearchOperationRecordedEvent[] = []\n  const operationsById = new Map<string, SearchOperationRecordedEvent>()\n  const decisions: SearchCandidateDecidedEvent[] = []\n  let planEvent: SearchPlannedEvent | null = null\n  let completion: SearchCompletedEvent | null = null\n  let expectedPrevious: SearchLedgerHash | null = null\n  let previousOccurredAt = Number.NEGATIVE_INFINITY\n\n  for (let index = 0; index < entries.length; index += 1) {\n    const entry = entries[index]!\n    if (entry.campaignId !== campaignId) {\n      throw new SearchLedgerIntegrityError(\n        `entry ${index} belongs to campaign ${entry.campaignId}, expected ${campaignId}`,\n      )\n    }\n    if (entry.sequence !== index) {\n      throw new SearchLedgerIntegrityError(\n        `entry ${entry.event.eventId} has sequence ${entry.sequence}, expected ${index}`,\n      )\n    }\n    if (entry.previousHash !== expectedPrevious) {\n      throw new SearchLedgerIntegrityError(\n        `entry ${entry.event.eventId} does not extend the previous hash`,\n      )\n    }\n    const { entryHash: _entryHash, ...material } = entry\n    const expectedHash = hashCanonical(material)\n    if (entry.entryHash !== expectedHash) {\n      throw new SearchLedgerIntegrityError(\n        `entry ${entry.event.eventId} hash mismatch: expected ${expectedHash}, got ${entry.entryHash}`,\n      )\n    }\n    expectedPrevious = entry.entryHash\n\n    const event = entry.event\n    if (eventIds.has(event.eventId)) {\n      throw new SearchLedgerIntegrityError(`duplicate eventId ${event.eventId} in durable ledger`)\n    }\n    eventIds.add(event.eventId)\n    if (completion) {\n      throw new SearchLedgerIntegrityError(\n        `event ${event.eventId} appears after terminal event ${completion.eventId}`,\n      )\n    }\n    const occurredAt = Date.parse(event.occurredAt)\n    if (occurredAt < previousOccurredAt) {\n      throw new SearchLedgerIntegrityError(\n        `event ${event.eventId} occurred before the preceding durable event`,\n      )\n    }\n    previousOccurredAt = occurredAt\n    assertUnique(event.artifacts.map(artifactKey), 'artifact receipt', event.eventId)\n\n    if (event.kind === 'search-planned') {\n      if (index !== 0 || planEvent) {\n        throw new SearchLedgerIntegrityError('search plan must be the first and only plan event')\n      }\n      assertUnique(\n        event.plan.candidateSlots.map((slot) => slot.slotId),\n        'candidate slot',\n        event.eventId,\n      )\n      assertUnique(\n        event.plan.tasks.map((task) => task.taskId),\n        'planned taskId',\n        event.eventId,\n      )\n      assertUnique(\n        event.plan.operations.map((operation) => operation.operationId),\n        'planned operationId',\n        event.eventId,\n      )\n      for (const slot of event.plan.candidateSlots) {\n        const generationOperation = event.plan.operations.find(\n          (operation) => operation.operationId === slot.generationOperationId,\n        )\n        if (!generationOperation || generationOperation.kind !== 'candidate-generation') {\n          throw new SearchLedgerIntegrityError(\n            `candidate slot ${slot.slotId} references unplanned candidate-generation operation ${slot.generationOperationId}`,\n          )\n        }\n      }\n      planEvent = event\n      continue\n    }\n\n    if (!planEvent) {\n      throw new SearchLedgerIntegrityError(\n        `event ${event.eventId} appears before the required search plan`,\n      )\n    }\n\n    if (event.kind === 'candidate-registered') {\n      if (candidates.has(event.candidateId)) {\n        throw new SearchLedgerIntegrityError(`candidate ${event.candidateId} was registered twice`)\n      }\n      const plannedSlot = planEvent.plan.candidateSlots.find((slot) => slot.slotId === event.slotId)\n      if (!plannedSlot) {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} binds unknown slot ${event.slotId}`,\n        )\n      }\n      if (candidateBySlot.has(event.slotId)) {\n        throw new SearchLedgerIntegrityError(`candidate slot ${event.slotId} was bound twice`)\n      }\n      if (closedSlots.has(event.slotId)) {\n        throw new SearchLedgerIntegrityError(`candidate slot ${event.slotId} was already closed`)\n      }\n      if (event.generationOperationId !== plannedSlot.generationOperationId) {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} generation operation ${event.generationOperationId} does not match slot ${event.slotId} plan ${plannedSlot.generationOperationId}`,\n        )\n      }\n      const generationOperation = operationsById.get(event.generationOperationId)\n      if (!generationOperation) {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} precedes generation operation ${event.generationOperationId}`,\n        )\n      }\n      if (generationOperation.outcome.status === 'failed') {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} cannot bind failed generation operation ${event.generationOperationId}`,\n        )\n      }\n      const previousCandidate = lineageNodes.get(event.lineage.lineageNodeId)\n      if (previousCandidate) {\n        throw new SearchLedgerIntegrityError(\n          `lineage node ${event.lineage.lineageNodeId} is already bound to ${previousCandidate}`,\n        )\n      }\n      assertUnique(event.lineage.parentCandidateIds, 'parentCandidateId', event.eventId)\n      const parents = event.lineage.parentCandidateIds.map((id) => {\n        const parent = candidates.get(id)\n        if (!parent) {\n          throw new SearchLedgerIntegrityError(\n            `candidate ${event.candidateId} references unknown parent ${id}`,\n          )\n        }\n        return parent\n      })\n      const expectedGeneration =\n        parents.length === 0\n          ? 0\n          : Math.max(...parents.map((parent) => parent.registered.lineage.generation)) + 1\n      if (event.lineage.generation !== expectedGeneration) {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} generation ${event.lineage.generation} does not follow its parents (expected ${expectedGeneration})`,\n        )\n      }\n      assertUnique(\n        event.surfaces.map((surface) => surface.surfaceId),\n        'surfaceId',\n        event.eventId,\n      )\n      candidates.set(event.candidateId, { registered: event, attempts: [], decision: null })\n      candidateBySlot.set(event.slotId, event.candidateId)\n      lineageNodes.set(event.lineage.lineageNodeId, event.candidateId)\n      candidateEvents.push(event)\n      continue\n    }\n\n    if (event.kind === 'task-attempted') {\n      const candidate = candidates.get(event.candidateId)\n      if (!candidate) {\n        throw new SearchLedgerIntegrityError(\n          `attempt ${event.eventId} references unknown candidate ${event.candidateId}`,\n        )\n      }\n      if (candidate.decision) {\n        throw new SearchLedgerIntegrityError(\n          `attempt ${event.eventId} appears after candidate ${event.candidateId} was decided`,\n        )\n      }\n      const plannedTask = planEvent.plan.tasks.find((task) => task.taskId === event.task.taskId)\n      if (!plannedTask) {\n        throw new SearchLedgerIntegrityError(\n          `attempt ${event.eventId} references unplanned task ${event.task.taskId}`,\n        )\n      }\n      if (\n        canonicalString(plannedTask.source) !== canonicalString(event.task.source) ||\n        canonicalString(plannedTask.benchmark) !== canonicalString(event.identity.benchmark)\n      ) {\n        throw new SearchLedgerIntegrityError(\n          `task ${event.task.taskId} does not match its planned source identity`,\n        )\n      }\n      if (event.attemptIndex >= plannedTask.maxAttempts) {\n        throw new SearchLedgerIntegrityError(\n          `task ${event.task.taskId} attempt ${event.attemptIndex} exceeds planned maxAttempts ${plannedTask.maxAttempts}`,\n        )\n      }\n      if (runIds.has(event.runId)) {\n        throw new SearchLedgerIntegrityError(`runId ${event.runId} was recorded twice`)\n      }\n      runIds.add(event.runId)\n      const attemptKey = canonicalString([event.candidateId, event.task.taskId, event.attemptIndex])\n      if (attemptKeys.has(attemptKey)) {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} task ${event.task.taskId} attempt ${event.attemptIndex} was recorded twice`,\n        )\n      }\n      const expectedAttemptIndex = candidate.attempts.filter(\n        (attempt) => attempt.task.taskId === event.task.taskId,\n      ).length\n      if (event.attemptIndex !== expectedAttemptIndex) {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} task ${event.task.taskId} attempt index ${event.attemptIndex} is not contiguous (expected ${expectedAttemptIndex})`,\n        )\n      }\n      const previousAttempt = candidate.attempts.find(\n        (attempt) => attempt.task.taskId === event.task.taskId,\n      )\n      if (\n        previousAttempt?.outcome.status !== undefined &&\n        previousAttempt.outcome.status !== 'errored'\n      ) {\n        throw new SearchLedgerIntegrityError(\n          `task ${event.task.taskId} was retried after a measured outcome`,\n        )\n      }\n      if (\n        previousAttempt &&\n        canonicalString({ task: previousAttempt.task, identity: previousAttempt.identity }) !==\n          canonicalString({ task: event.task, identity: event.identity })\n      ) {\n        throw new SearchLedgerIntegrityError(\n          `candidate ${event.candidateId} task ${event.task.taskId} changed immutable execution identity between attempts`,\n        )\n      }\n      attemptKeys.add(attemptKey)\n\n      const declared = candidate.registered.surfaces.map((surface) => surface.surfaceId).sort()\n      const observed = event.surfaceEvidence.map((surface) => surface.surfaceId).sort()\n      assertUnique(observed, 'surface evidence', event.eventId)\n      for (const evidence of event.surfaceEvidence) {\n        assertUnique(evidence.evidence.map(artifactKey), 'surface evidence receipt', event.eventId)\n      }\n      if (canonicalString(declared) !== canonicalString(observed)) {\n        throw new SearchLedgerIntegrityError(\n          `attempt ${event.eventId} surface evidence does not exactly cover candidate ${event.candidateId}`,\n        )\n      }\n      candidate.attempts.push(event)\n      attempts.push(event)\n      continue\n    }\n\n    if (event.kind === 'search-operation-recorded') {\n      const plannedOperation = planEvent.plan.operations.find(\n        (operation) => operation.operationId === event.operationId,\n      )\n      if (!plannedOperation) {\n        throw new SearchLedgerIntegrityError(\n          `operation ${event.operationId} was not declared in the search plan`,\n        )\n      }\n      if (plannedOperation.kind !== event.operationKind) {\n        throw new SearchLedgerIntegrityError(\n          `operation ${event.operationId} kind ${event.operationKind} does not match planned ${plannedOperation.kind}`,\n        )\n      }\n      if (operationsById.has(event.operationId)) {\n        throw new SearchLedgerIntegrityError(`operation ${event.operationId} was recorded twice`)\n      }\n      operationsById.set(event.operationId, event)\n      operationEvents.push(event)\n      continue\n    }\n\n    if (event.kind === 'candidate-slot-closed') {\n      const plannedSlot = planEvent.plan.candidateSlots.find((slot) => slot.slotId === event.slotId)\n      if (!plannedSlot) {\n        throw new SearchLedgerIntegrityError(\n          `candidate slot closure ${event.eventId} references unknown slot ${event.slotId}`,\n        )\n      }\n      if (event.generationOperationId !== plannedSlot.generationOperationId) {\n        throw new SearchLedgerIntegrityError(\n          `candidate slot closure ${event.eventId} generation operation ${event.generationOperationId} does not match slot ${event.slotId} plan ${plannedSlot.generationOperationId}`,\n        )\n      }\n      if (candidateBySlot.has(event.slotId)) {\n        throw new SearchLedgerIntegrityError(\n          `candidate slot ${event.slotId} was already bound to a candidate`,\n        )\n      }\n      if (closedSlots.has(event.slotId)) {\n        throw new SearchLedgerIntegrityError(`candidate slot ${event.slotId} was closed twice`)\n      }\n      const operation = operationsById.get(event.generationOperationId)\n      if (!operation) {\n        throw new SearchLedgerIntegrityError(\n          `candidate slot closure ${event.eventId} precedes operation ${event.generationOperationId}`,\n        )\n      }\n      if (operation.outcome.status === 'completed') {\n        throw new SearchLedgerIntegrityError(\n          `candidate slot ${event.slotId} cannot close from completed operation ${event.generationOperationId}`,\n        )\n      }\n      closedSlots.set(event.slotId, event)\n      closedSlotEvents.push(event)\n      continue\n    }\n\n    if (event.kind === 'candidate-decided') {\n      const candidate = candidates.get(event.candidateId)\n      if (!candidate) {\n        throw new SearchLedgerIntegrityError(\n          `decision ${event.eventId} references unknown candidate ${event.candidateId}`,\n        )\n      }\n      if (candidate.decision) {\n        throw new SearchLedgerIntegrityError(`candidate ${event.candidateId} was decided twice`)\n      }\n      if (event.decision.status === 'selected') {\n        if (!candidate.attempts.some((attempt) => attempt.outcome.status !== 'errored')) {\n          throw new SearchLedgerIntegrityError(\n            `candidate ${event.candidateId} cannot be selected without a measured task outcome`,\n          )\n        }\n        if (decisions.some((decision) => decision.decision.status === 'selected')) {\n          throw new SearchLedgerIntegrityError('more than one candidate was selected')\n        }\n      }\n      candidate.decision = event\n      decisions.push(event)\n      continue\n    }\n\n    const missingCandidateSlots = planEvent.plan.candidateSlots\n      .filter((slot) => !candidateBySlot.has(slot.slotId) && !closedSlots.has(slot.slotId))\n      .map((slot) => slot.slotId)\n    if (missingCandidateSlots.length > 0) {\n      throw new SearchLedgerIntegrityError(\n        `search completed with missing candidate slots: ${missingCandidateSlots.join(', ')}`,\n      )\n    }\n    const missingTaskOutcomes = plannedTaskOutcomeKeys(planEvent, candidates)\n    if (missingTaskOutcomes.length > 0) {\n      throw new SearchLedgerIntegrityError(\n        `search completed with missing task outcomes: ${missingTaskOutcomes.join(', ')}`,\n      )\n    }\n    const missingOperations = planEvent.plan.operations\n      .filter((operation) => !operationsById.has(operation.operationId))\n      .map((operation) => operation.operationId)\n    if (missingOperations.length > 0) {\n      throw new SearchLedgerIntegrityError(\n        `search completed with missing search operations: ${missingOperations.join(', ')}`,\n      )\n    }\n    for (const operation of planEvent.plan.operations) {\n      if (operation.kind !== 'candidate-generation') continue\n      const generationOutcome = operationsById.get(operation.operationId)!.outcome.status\n      const slots = planEvent.plan.candidateSlots.filter(\n        (slot) => slot.generationOperationId === operation.operationId,\n      )\n      if (slots.length === 0) continue\n      const registeredCount = slots.filter((slot) => candidateBySlot.has(slot.slotId)).length\n      const closedCount = slots.filter((slot) => closedSlots.has(slot.slotId)).length\n      if (generationOutcome === 'completed' && closedCount > 0) {\n        throw new SearchLedgerIntegrityError(\n          `completed generation operation ${operation.operationId} contains ${closedCount} closed slot(s)`,\n        )\n      }\n      if (generationOutcome === 'failed' && registeredCount > 0) {\n        throw new SearchLedgerIntegrityError(\n          `failed generation operation ${operation.operationId} contains ${registeredCount} registered candidate(s)`,\n        )\n      }\n      if (generationOutcome === 'partial' && (registeredCount === 0 || closedCount === 0)) {\n        throw new SearchLedgerIntegrityError(\n          `partial generation operation ${operation.operationId} must contain both a registered candidate and a closed slot`,\n        )\n      }\n    }\n    const pending = [...candidates.values()].filter((candidate) => candidate.decision === null)\n    if (pending.length > 0) {\n      throw new SearchLedgerIntegrityError(\n        `search completed with ${pending.length} candidate decision(s) missing`,\n      )\n    }\n    const selected = decisions.filter((decision) => decision.decision.status === 'selected')\n    if (event.result.status === 'selected') {\n      if (selected.length !== 1 || selected[0]!.candidateId !== event.result.candidateId) {\n        throw new SearchLedgerIntegrityError(\n          `search completion winner ${event.result.candidateId} does not match candidate decisions`,\n        )\n      }\n    } else if (selected.length !== 0) {\n      throw new SearchLedgerIntegrityError('all-rejected completion contains a selected candidate')\n    }\n    completion = event\n  }\n\n  const selectedDecisions = decisions.filter((decision) => decision.decision.status === 'selected')\n  const rejectedDecisions = decisions.filter((decision) => decision.decision.status === 'rejected')\n  const outcomeCounts = { passed: 0, failed: 0, errored: 0 }\n  const operationOutcomeCounts = { completed: 0, partial: 0, failed: 0 }\n  let inputTokens = 0\n  let outputTokens = 0\n  let cachedTokens = 0\n  let costUsd = 0\n  const unknownTokenEventIds: string[] = []\n  const unknownCostEventIds: string[] = []\n  for (const attempt of attempts) {\n    outcomeCounts[attempt.outcome.status] += 1\n  }\n  for (const operation of operationEvents) {\n    operationOutcomeCounts[operation.outcome.status] += 1\n  }\n  for (const costedEvent of [...attempts, ...operationEvents]) {\n    if (costedEvent.accounting.tokens.status === 'known') {\n      inputTokens += costedEvent.accounting.tokens.inputTokens\n      outputTokens += costedEvent.accounting.tokens.outputTokens\n      cachedTokens += costedEvent.accounting.tokens.cachedTokens\n    } else {\n      unknownTokenEventIds.push(costedEvent.eventId)\n    }\n    if (costedEvent.accounting.cost.status === 'known') {\n      costUsd += costedEvent.accounting.cost.usd\n    } else {\n      costUsd += costedEvent.accounting.cost.knownLowerBoundUsd\n      unknownCostEventIds.push(costedEvent.eventId)\n    }\n  }\n  const accounting: SearchAccountingAudit =\n    unknownTokenEventIds.length === 0 && unknownCostEventIds.length === 0\n      ? {\n          status: 'known',\n          inputTokens,\n          outputTokens,\n          cachedTokens,\n          costUsd,\n        }\n      : {\n          status: 'partial',\n          knownInputTokens: inputTokens,\n          knownOutputTokens: outputTokens,\n          knownCachedTokens: cachedTokens,\n          knownCostUsd: costUsd,\n          unknownTokenEventIds,\n          unknownCostEventIds,\n        }\n\n  const selectedCandidateId =\n    completion?.result.status === 'selected' ? completion.result.candidateId : null\n  const status: SearchLedgerAudit['status'] =\n    completion?.result.status === 'selected'\n      ? 'selected'\n      : completion?.result.status === 'all-rejected'\n        ? 'all-rejected'\n        : 'in-progress'\n  const missingCandidateSlots =\n    planEvent?.plan.candidateSlots\n      .filter((slot) => !candidateBySlot.has(slot.slotId) && !closedSlots.has(slot.slotId))\n      .map((slot) => slot.slotId) ?? []\n  const missingTaskOutcomes = planEvent ? plannedTaskOutcomeKeys(planEvent, candidates) : []\n  const missingOperations =\n    planEvent?.plan.operations\n      .filter((operation) => !operationsById.has(operation.operationId))\n      .map((operation) => operation.operationId) ?? []\n  return {\n    entries: [...entries],\n    plan: planEvent,\n    candidates: candidateEvents,\n    closedCandidateSlots: closedSlotEvents,\n    attempts,\n    operations: operationEvents,\n    decisions,\n    completion,\n    audit: {\n      campaignId,\n      eventCount: entries.length,\n      candidateCount: candidates.size,\n      closedCandidateSlotCount: closedSlots.size,\n      attemptCount: attempts.length,\n      operationCount: operationEvents.length,\n      outcomes: outcomeCounts,\n      operationOutcomes: operationOutcomeCounts,\n      decisions: {\n        selected: selectedDecisions.length,\n        rejected: rejectedDecisions.length,\n        pending: candidates.size - decisions.length,\n      },\n      expected: {\n        candidateSlots: planEvent?.plan.candidateSlots.length ?? 0,\n        taskOutcomes: candidates.size * (planEvent?.plan.tasks.length ?? 0),\n        operations: planEvent?.plan.operations.length ?? 0,\n        missingCandidateSlots,\n        missingTaskOutcomes,\n        missingOperations,\n      },\n      status,\n      selectedCandidateId,\n      accounting,\n      headHash: entries.at(-1)?.entryHash ?? null,\n    },\n  }\n}\n\nfunction plannedTaskOutcomeKeys(\n  planEvent: SearchPlannedEvent,\n  candidates: Map<string, CandidateState>,\n): string[] {\n  const missing: string[] = []\n  const registeredCandidates = [...candidates.values()].sort((a, b) =>\n    compareStrings(a.registered.slotId, b.registered.slotId),\n  )\n  for (const candidate of registeredCandidates) {\n    const slotId = candidate.registered.slotId\n    for (const task of planEvent.plan.tasks) {\n      const measured = candidate.attempts.some(\n        (attempt) => attempt.task.taskId === task.taskId && attempt.outcome.status !== 'errored',\n      )\n      if (!measured) missing.push(`${slotId}/${task.taskId}`)\n    }\n  }\n  return missing\n}\n\nfunction normalizeEvent(event: SearchLedgerEvent): SearchLedgerEvent {\n  const artifacts = sortArtifacts(event.artifacts)\n  if (event.kind === 'search-planned') {\n    return {\n      ...event,\n      artifacts,\n      plan: {\n        candidateSlots: [...event.plan.candidateSlots].sort((a, b) =>\n          compareStrings(a.slotId, b.slotId),\n        ),\n        tasks: [...event.plan.tasks].sort((a, b) => compareStrings(a.taskId, b.taskId)),\n        operations: [...event.plan.operations].sort((a, b) =>\n          compareStrings(a.operationId, b.operationId),\n        ),\n      },\n    }\n  }\n  if (event.kind === 'candidate-registered') {\n    return {\n      ...event,\n      artifacts,\n      lineage: {\n        ...event.lineage,\n        parentCandidateIds: sortedStrings(event.lineage.parentCandidateIds),\n      },\n      surfaces: [...event.surfaces]\n        .map((surface) => ({ ...surface, artifact: { ...surface.artifact } }))\n        .sort((a, b) => compareStrings(a.surfaceId, b.surfaceId)),\n    }\n  }\n  if (event.kind === 'task-attempted') {\n    return {\n      ...event,\n      artifacts,\n      surfaceEvidence: [...event.surfaceEvidence]\n        .map((evidence) => ({ ...evidence, evidence: sortArtifacts(evidence.evidence) }))\n        .sort((a, b) => compareStrings(a.surfaceId, b.surfaceId)),\n    }\n  }\n  return { ...event, artifacts }\n}\n\nfunction sortArtifacts(artifacts: SearchArtifactRef[]): SearchArtifactRef[] {\n  return [...artifacts]\n    .map((artifact) => ({ ...artifact }))\n    .sort((a, b) => compareStrings(artifactKey(a), artifactKey(b)))\n}\n\nfunction artifactKey(artifact: SearchArtifactRef): string {\n  return canonicalString(artifact)\n}\n\nfunction compareStrings(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0\n}\n\nfunction sortedStrings(values: string[]): string[] {\n  return [...values].sort()\n}\n\nfunction assertUnique(values: string[], label: string, eventId: string): void {\n  if (new Set(values).size !== values.length) {\n    throw new SearchLedgerIntegrityError(`event ${eventId} contains duplicate ${label} values`)\n  }\n}\n\nfunction canonicalString(value: unknown): string {\n  return JSON.stringify(canonicalize(value))\n}\n\nfunction hashCanonical(value: unknown): SearchLedgerHash {\n  return `sha256:${createHash('sha256').update(canonicalString(value)).digest('hex')}`\n}\n\nfunction formatZodError(error: z.ZodError): string {\n  return error.issues\n    .map((issue) => `${issue.path.length > 0 ? issue.path.join('.') : '<root>'}: ${issue.message}`)\n    .join('; ')\n}\n","/**\n * Single-run lock for evaluations that share one mutable environment.\n *\n * Two concurrent runs against a shared stateful gym silently corrupt each\n * other: each resets/mutates environment state mid-cell of the other, and\n * every score from both becomes garbage that LOOKS like worker variance\n * (agent-lab R357 burned hours on flip-flopping scores before tracing them\n * to exactly this). The fix is a pid lockfile: refuse to start while a live\n * holder exists, reclaim stale locks whose pid is gone, release only if the\n * lock is still ours.\n *\n * `alsoCheck` exists because independent runners can guard the same shared\n * resource with differently named lockfiles; a runner must respect all of\n * them even though it writes only its own.\n */\n\nimport { existsSync, readFileSync, unlinkSync, writeFileSync } from 'node:fs'\n\nexport interface SingleRunLockOptions {\n  /** Lockfile this runner writes (and checks). */\n  readonly lockPath: string\n  /** Other runners' lockfiles guarding the same resource; checked, never written. */\n  readonly alsoCheck?: readonly string[]\n  /** Install a process 'exit' hook that releases the lock. Default true. */\n  readonly releaseOnExit?: boolean\n  /** Owner pid recorded in the lockfile. Default process.pid. */\n  readonly pid?: number\n}\n\nexport interface SingleRunLock {\n  /** Remove the lockfile if this process still owns it. Idempotent. */\n  release(): void\n}\n\nfunction liveHolder(path: string): number | null {\n  if (!existsSync(path)) return null\n  const holder = Number(readFileSync(path, 'utf8').trim())\n  if (!Number.isFinite(holder) || holder <= 0) return null\n  try {\n    process.kill(holder, 0)\n    return holder\n  } catch {\n    return null // stale: holder pid is gone; safe to reclaim\n  }\n}\n\n/**\n * Acquire the lock or throw naming the live holder. A stale lock (holder pid\n * no longer running) is reclaimed silently.\n */\nexport function acquireSingleRunLock(opts: SingleRunLockOptions): SingleRunLock {\n  const pid = opts.pid ?? process.pid\n  for (const path of [opts.lockPath, ...(opts.alsoCheck ?? [])]) {\n    const holder = liveHolder(path)\n    if (holder !== null && holder !== pid) {\n      throw new Error(\n        `single-run lock held by live pid ${holder} (${path}); refusing a concurrent run on the shared resource`,\n      )\n    }\n  }\n  writeFileSync(opts.lockPath, String(pid))\n  const release = (): void => {\n    try {\n      if (existsSync(opts.lockPath) && readFileSync(opts.lockPath, 'utf8').trim() === String(pid)) {\n        unlinkSync(opts.lockPath)\n      }\n    } catch {\n      // release is best-effort; a leftover stale lock is reclaimed on next acquire\n    }\n  }\n  if (opts.releaseOnExit ?? true) process.on('exit', release)\n  return { release }\n}\n","/**\n * Transient-transport-failure classification for dispatch retry policies.\n *\n * When an eval cell dies, the harness must decide: retry (the infrastructure\n * hiccuped - a 502 storm, an admission-queue rejection, a dropped stream) or\n * score it (the agent genuinely failed). Getting this wrong corrupts results\n * in both directions: scoring transport hiccups as failures buries real\n * effects under noise (agent-lab R353 found 5/30 identical repeats were 502s\n * scored as task failures), while retrying genuine failures silently drops\n * the hard cells and inflates every arm.\n *\n * Full-duration timeouts are the deliberate knob: on saturated shared\n * infrastructure a timeout usually means the request never got a slot\n * (retry it), but on unthrottled infrastructure it means the agent flailed\n * on the task until the clock ran out (a real score-0). Both readings were\n * needed in practice within one week, so the classifier takes it as an\n * option instead of hardcoding either.\n */\n\nexport interface TransientFailureOptions {\n  /**\n   * Treat full-duration timeouts (\"timeout after 180000ms\") as transient.\n   * Enable on saturated shared infrastructure where queue starvation eats\n   * the clock; leave off when the agent had the resources and simply failed.\n   * Default false.\n   */\n  readonly retryFullDurationTimeouts?: boolean\n  /** Additional caller-specific transient patterns. */\n  readonly extraPatterns?: readonly RegExp[]\n}\n\nconst BASE_TRANSIENT =\n  /\\b50[234]\\b|no stream output|produced no stream|admission timed out|admission_rejected|queue_timeout|fetch failed|ECONNRESET|This operation was aborted/i\n\nconst TIMEOUT_PATTERN = /timeout after \\d+ ?ms|cli-bridge timeout/i\n\n/**\n * True when the error text describes an infrastructure hiccup that should be\n * retried rather than scored. Empty/undefined input is not transient.\n */\nexport function isTransientTransportFailure(\n  message: string | null | undefined,\n  opts: TransientFailureOptions = {},\n): boolean {\n  if (!message) return false\n  if (BASE_TRANSIENT.test(message)) return true\n  if ((opts.retryFullDurationTimeouts ?? false) && TIMEOUT_PATTERN.test(message)) return true\n  for (const p of opts.extraPatterns ?? []) if (p.test(message)) return true\n  return false\n}\n","/**\n * VCS-pluggable worktree adapter. One improvement = one worktree, PR-like\n * (multiple commits allowed). A code-tier proposer's `propose()` creates a\n * worktree, an agent commits the change into it, and `finalize()` returns a\n * content-addressed `CodeSurface` the measurement verifies before running.\n * On promotion the worktree becomes the PR branch.\n *\n * The interface is VCS-agnostic so a future `jj` ([jj-vcs](https://github.com/jj-vcs/jj))\n * adapter can slot in without touching proposer code. Only the git adapter\n * ships today. See `docs/design/loop-taxonomy.md`.\n */\n\nimport { execFileSync } from 'node:child_process'\nimport { createHash } from 'node:crypto'\nimport {\n  closeSync,\n  existsSync,\n  constants as fsConstants,\n  fstatSync,\n  lstatSync,\n  mkdirSync,\n  mkdtempSync,\n  openSync,\n  readlinkSync,\n  readSync,\n  realpathSync,\n  rmSync,\n} from 'node:fs'\nimport { devNull, tmpdir } from 'node:os'\nimport { basename, dirname, isAbsolute, join, relative, resolve, sep } from 'node:path'\nimport { assertCodeSurfaceIdentity, surfaceContentHash } from '../surface-identity'\nimport type { CodeSurface } from '../types'\n\nconst MAX_GIT_OUTPUT_BYTES = 256 * 1024 * 1024\nconst FILE_HASH_CHUNK_BYTES = 1024 * 1024\n\ntype GitOutput = string | Uint8Array\ntype GitEnvironment = Readonly<Record<string, string>>\ntype GitRunner = (args: string[], cwd: string, env?: GitEnvironment) => GitOutput\n\nconst GIT_REPOSITORY_ENV = new Set([\n  'GIT_ALTERNATE_OBJECT_DIRECTORIES',\n  'GIT_COMMON_DIR',\n  'GIT_DIR',\n  'GIT_INDEX_FILE',\n  'GIT_NAMESPACE',\n  'GIT_OBJECT_DIRECTORY',\n  'GIT_PREFIX',\n  'GIT_QUARANTINE_PATH',\n  'GIT_WORK_TREE',\n])\n\nexport interface Worktree {\n  /** Absolute path to the checked-out worktree directory. */\n  readonly path: string\n  /** The branch the worktree is on (becomes the PR branch on promotion). */\n  readonly branch: string\n  /** The ref the worktree was forked from. */\n  readonly baseRef: string\n  /** Exact commit `baseRef` resolved to before the worktree was created. */\n  readonly baseCommit: string\n  /** Exact tree object for `baseCommit`. */\n  readonly baseTree: string\n}\n\nexport interface WorktreeAdapter {\n  /** Create an isolated worktree on a fresh branch off `baseRef`. */\n  create(opts: { baseRef: string; label: string }): Promise<Worktree>\n  /** Commit pending changes, freeze the exact Git objects + binary patch, and\n   *  verify the worktree still matches that identity. */\n  finalize(worktree: Worktree, summary: string): Promise<CodeSurface>\n  /** Idempotently remove the worktree and branch. Safe to retry after partial cleanup. */\n  discard(worktree: Worktree): Promise<void>\n}\n\n/** Typed failure from a `WorktreeAdapter` operation (create/finalize/discard) — wraps the underlying git error as `cause`. */\nexport class WorktreeAdapterError extends Error {\n  constructor(\n    message: string,\n    readonly cause?: unknown,\n  ) {\n    super(message)\n    this.name = 'WorktreeAdapterError'\n  }\n}\n\nexport interface GitWorktreeAdapterOptions {\n  /** Repo root the worktrees fork from. */\n  repoRoot: string\n  /** Directory worktrees are created under. Default: `<repoRoot>/.worktrees`. */\n  worktreeDir?: string\n  /** Branch-name prefix. Default: `improve`. */\n  branchPrefix?: string\n  /** Test seam — defaults to a real `git` runner. The return value must contain\n   *  stdout verbatim, and runners that execute Git must forward the optional\n   *  environment overrides used to isolate patch generation. */\n  git?: GitRunner\n}\n\nfunction defaultGit(args: string[], cwd: string, overrides?: GitEnvironment): Uint8Array {\n  try {\n    const env = { ...process.env }\n    for (const key of Object.keys(env)) {\n      if (\n        GIT_REPOSITORY_ENV.has(key) ||\n        key === 'GIT_CONFIG' ||\n        key.startsWith('GIT_CONFIG_') ||\n        key.startsWith('GIT_ATTR_') ||\n        key === 'GIT_DIFF_OPTS' ||\n        key === 'GIT_EXTERNAL_DIFF'\n      ) {\n        delete env[key]\n      }\n    }\n    Object.assign(env, overrides)\n    env.GIT_NO_REPLACE_OBJECTS = '1'\n    env.LC_ALL = 'C'\n    env.LANG = 'C'\n    return execFileSync('git', args, { cwd, env, maxBuffer: MAX_GIT_OUTPUT_BYTES })\n  } catch (err) {\n    const stderr =\n      err && typeof err === 'object' && 'stderr' in err\n        ? String((err as { stderr: unknown }).stderr)\n        : ''\n    throw new WorktreeAdapterError(`git ${args.join(' ')} failed: ${stderr || String(err)}`, err)\n  }\n}\n\nfunction gitBytes(git: GitRunner, args: string[], cwd: string, env?: GitEnvironment): Buffer {\n  try {\n    const output = git(args, cwd, env)\n    return typeof output === 'string' ? Buffer.from(output, 'utf8') : Buffer.from(output)\n  } catch (err) {\n    if (err instanceof WorktreeAdapterError) throw err\n    throw new WorktreeAdapterError(`git ${args.join(' ')} failed: ${String(err)}`, err)\n  }\n}\n\nfunction gitText(git: GitRunner, args: string[], cwd: string, env?: GitEnvironment): string {\n  return gitBytes(git, args, cwd, env).toString('utf8').trim()\n}\n\nfunction hasRegisteredWorktree(git: GitRunner, repoRoot: string, path: string): boolean {\n  const expected = Buffer.from(`worktree ${resolve(path)}`, 'utf8')\n  const records = gitBytes(git, ['worktree', 'list', '--porcelain', '-z'], repoRoot)\n  let start = 0\n  while (start < records.length) {\n    const end = records.indexOf(0, start)\n    if (end < 0) {\n      throw new WorktreeAdapterError('Git worktree list output was not NUL-terminated')\n    }\n    if (records.subarray(start, end).equals(expected)) return true\n    start = end + 1\n  }\n  return false\n}\n\nfunction hasLocalBranch(git: GitRunner, repoRoot: string, branch: string): boolean {\n  const ref = `refs/heads/${branch}`\n  return gitText(git, ['for-each-ref', '--format=%(refname)', '--', ref], repoRoot)\n    .split('\\n')\n    .some((candidate) => candidate === ref)\n}\n\nfunction reconcileAbsent(exists: () => boolean, remove: () => void): unknown | undefined {\n  try {\n    if (!exists()) return undefined\n  } catch (err) {\n    return err\n  }\n\n  try {\n    remove()\n    return undefined\n  } catch (removeError) {\n    try {\n      // Git may complete the mutation before the caller observes a failure, or\n      // another cleanup may win the race. The desired end state is what matters.\n      if (!exists()) return undefined\n    } catch (recheckError) {\n      return new AggregateError(\n        [removeError, recheckError],\n        'Removal failed and the resulting resource state could not be checked',\n      )\n    }\n    return removeError\n  }\n}\n\nfunction sha256(bytes: Uint8Array): `sha256:${string}` {\n  return `sha256:${createHash('sha256').update(bytes).digest('hex')}`\n}\n\nconst PATCH_ARGS = [\n  // Git binary patches embed a zlib stream. Pin no-compression at command\n  // scope so repository/global config and compressor heuristics cannot change\n  // the candidate identity for the same base and final tree.\n  '-c',\n  'core.compression=0',\n  '-c',\n  `core.attributesFile=${devNull}`,\n  '-c',\n  'core.quotePath=true',\n  '-c',\n  'diff.suppressBlankEmpty=false',\n  'diff',\n  '--unified=3',\n  '--inter-hunk-context=0',\n  `-O${devNull}`,\n  '--binary',\n  '--full-index',\n  '--no-color',\n  '--no-ext-diff',\n  '--no-textconv',\n  '--no-renames',\n  '--diff-algorithm=myers',\n  '--no-indent-heuristic',\n  '--src-prefix=a/',\n  '--dst-prefix=b/',\n] as const\n\nconst CANONICAL_GIT_ENV: GitEnvironment = {\n  GIT_ATTR_GLOBAL: devNull,\n  GIT_ATTR_NOSYSTEM: '1',\n  GIT_CONFIG_GLOBAL: devNull,\n  GIT_CONFIG_NOSYSTEM: '1',\n  GIT_CONFIG_SYSTEM: devNull,\n}\n\n/** Render the transport patch from immutable objects through fresh Git metadata.\n *  Source-repository config, info attributes, templates, and caller environment\n *  therefore cannot alter bytes for the same two trees. */\nfunction patchBytes(\n  git: GitRunner,\n  cwd: string,\n  baseCommit: string,\n  candidateCommit: string,\n): Buffer {\n  const scratch = mkdtempSync(join(tmpdir(), 'agent-eval-patch-'))\n  const bareRepo = join(scratch, 'repo.git')\n  const emptyTemplate = join(scratch, 'empty-template')\n  mkdirSync(emptyTemplate)\n  try {\n    const objectFormat = gitObjectHashAlgorithm(candidateCommit)\n    const sourceObjects = realpathSync(gitText(git, ['rev-parse', '--git-path', 'objects'], cwd))\n    gitText(\n      git,\n      [\n        'init',\n        '--bare',\n        '--quiet',\n        ...(objectFormat === 'sha256' ? ['--object-format=sha256'] : []),\n        `--template=${emptyTemplate}`,\n        bareRepo,\n      ],\n      scratch,\n      CANONICAL_GIT_ENV,\n    )\n    return gitBytes(\n      git,\n      [`--git-dir=${bareRepo}`, ...PATCH_ARGS, baseCommit, candidateCommit, '--'],\n      scratch,\n      {\n        ...CANONICAL_GIT_ENV,\n        GIT_ALTERNATE_OBJECT_DIRECTORIES: sourceObjects,\n      },\n    )\n  } finally {\n    rmSync(scratch, { recursive: true, force: true })\n  }\n}\n\nfunction resolveCommit(git: GitRunner, cwd: string, ref: string): string {\n  return gitText(git, ['rev-parse', '--verify', `${ref}^{commit}`], cwd)\n}\n\nfunction unresolvedWorktreePath(surface: CodeSurface, worktreeDir?: string): string {\n  if (isAbsolute(surface.worktreeRef)) return surface.worktreeRef\n  if (worktreeDir) return join(worktreeDir, basename(surface.worktreeRef))\n  return surface.worktreeRef\n}\n\ninterface GitTreeEntry {\n  mode: string\n  objectId: string\n  path: string\n}\n\nfunction displayGitPath(path: string): string {\n  return JSON.stringify(path)\n}\n\nfunction parseGitTreeEntries(bytes: Uint8Array): GitTreeEntry[] {\n  const input = Buffer.from(bytes)\n  const entries: GitTreeEntry[] = []\n  let start = 0\n  while (start < input.length) {\n    const end = input.indexOf(0, start)\n    if (end < 0) throw new WorktreeAdapterError('Git tree output was not NUL-terminated')\n    const record = input.subarray(start, end)\n    start = end + 1\n    if (record.length === 0) continue\n\n    const tab = record.indexOf(0x09)\n    if (tab < 0) throw new WorktreeAdapterError('Git tree entry did not contain a path')\n    const metadata = record.subarray(0, tab).toString('ascii').split(' ')\n    if (metadata.length !== 3) throw new WorktreeAdapterError('Git tree entry was malformed')\n    const mode = metadata[0]\n    const type = metadata[1]\n    const objectId = metadata[2]\n    if (!mode || !type || !objectId) {\n      throw new WorktreeAdapterError('Git tree entry was malformed')\n    }\n    const pathBytes = record.subarray(tab + 1)\n    const path = pathBytes.toString('utf8')\n    if (!Buffer.from(path, 'utf8').equals(pathBytes)) {\n      throw new WorktreeAdapterError('CodeSurface paths must be valid UTF-8')\n    }\n    if (type !== 'blob' && type !== 'commit') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains unsupported Git object type ${type} at ${displayGitPath(path)}`,\n      )\n    }\n    entries.push({ mode, objectId, path })\n  }\n  return entries\n}\n\nfunction parseGitPathList(bytes: Uint8Array): string[] {\n  const input = Buffer.from(bytes)\n  const paths: string[] = []\n  let start = 0\n  while (start < input.length) {\n    const end = input.indexOf(0, start)\n    if (end < 0) throw new WorktreeAdapterError('Git path output was not NUL-terminated')\n    const pathBytes = input.subarray(start, end)\n    start = end + 1\n    if (pathBytes.length === 0) continue\n    const path = pathBytes.toString('utf8')\n    if (!Buffer.from(path, 'utf8').equals(pathBytes)) {\n      throw new WorktreeAdapterError('CodeSurface paths must be valid UTF-8')\n    }\n    paths.push(path)\n  }\n  return paths\n}\n\nfunction isWithinRoot(root: string, candidate: string): boolean {\n  const rel = relative(root, candidate)\n  return rel === '' || (!isAbsolute(rel) && rel !== '..' && !rel.startsWith(`..${sep}`))\n}\n\nfunction assertSafeRelativePath(root: string, path: string): string {\n  if (path.length === 0 || isAbsolute(path)) {\n    throw new WorktreeAdapterError(`CodeSurface contains unsafe path ${displayGitPath(path)}`)\n  }\n  const absolutePath = resolve(root, path)\n  if (!isWithinRoot(root, absolutePath) || absolutePath === root) {\n    throw new WorktreeAdapterError(`CodeSurface path escapes its worktree: ${displayGitPath(path)}`)\n  }\n\n  const segments = path.split(/[\\\\/]/u)\n  let parent = root\n  for (const segment of segments.slice(0, -1)) {\n    if (segment.length === 0 || segment === '.' || segment === '..') {\n      throw new WorktreeAdapterError(`CodeSurface contains unsafe path ${displayGitPath(path)}`)\n    }\n    parent = join(parent, segment)\n    const stat = lstatSync(parent)\n    if (!stat.isDirectory() || stat.isSymbolicLink()) {\n      throw new WorktreeAdapterError(\n        `CodeSurface path traverses a non-directory or symbolic link: ${displayGitPath(path)}`,\n      )\n    }\n  }\n  return absolutePath\n}\n\nfunction gitObjectHashAlgorithm(objectId: string): 'sha1' | 'sha256' {\n  if (/^[a-f0-9]{40}$/.test(objectId)) return 'sha1'\n  if (/^[a-f0-9]{64}$/.test(objectId)) return 'sha256'\n  throw new WorktreeAdapterError(`Unsupported Git object id: ${objectId}`)\n}\n\nfunction hashGitBlobBytes(bytes: Uint8Array, objectId: string): string {\n  const hash = createHash(gitObjectHashAlgorithm(objectId))\n  hash.update(`blob ${bytes.byteLength}\\0`)\n  hash.update(bytes)\n  return hash.digest('hex')\n}\n\nfunction hashGitBlobFile(path: string, objectId: string): { hash: string; executable: boolean } {\n  const before = lstatSync(path)\n  if (!before.isFile() || before.isSymbolicLink()) {\n    throw new WorktreeAdapterError(`CodeSurface expected a regular file at ${displayGitPath(path)}`)\n  }\n\n  const noFollow = process.platform === 'win32' ? 0 : fsConstants.O_NOFOLLOW\n  const fd = openSync(path, fsConstants.O_RDONLY | noFollow)\n  try {\n    const opened = fstatSync(fd)\n    if (\n      !opened.isFile() ||\n      opened.dev !== before.dev ||\n      opened.ino !== before.ino ||\n      opened.size !== before.size\n    ) {\n      throw new WorktreeAdapterError(\n        `CodeSurface file changed while it was being verified: ${displayGitPath(path)}`,\n      )\n    }\n\n    const hash = createHash(gitObjectHashAlgorithm(objectId))\n    hash.update(`blob ${opened.size}\\0`)\n    const chunk = Buffer.allocUnsafe(FILE_HASH_CHUNK_BYTES)\n    let total = 0\n    while (true) {\n      const count = readSync(fd, chunk, 0, chunk.length, null)\n      if (count === 0) break\n      total += count\n      hash.update(chunk.subarray(0, count))\n    }\n    if (total !== opened.size) {\n      throw new WorktreeAdapterError(\n        `CodeSurface file changed while it was being verified: ${displayGitPath(path)}`,\n      )\n    }\n    return { hash: hash.digest('hex'), executable: (opened.mode & 0o111) !== 0 }\n  } finally {\n    closeSync(fd)\n  }\n}\n\nfunction assertSymlinkTargetIsBound(\n  root: string,\n  linkPath: string,\n  trackedPaths: ReadonlySet<string>,\n): void {\n  const targetBytes = readlinkSync(linkPath, { encoding: 'buffer' })\n  const target = targetBytes.toString('utf8')\n  if (!Buffer.from(target, 'utf8').equals(targetBytes)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link has an unsafe target at ${displayGitPath(linkPath)}`,\n    )\n  }\n  if (isAbsolute(target)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n  const lexicalTarget = resolve(dirname(linkPath), target)\n  if (!isWithinRoot(root, lexicalTarget)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n  let resolvedTarget: string\n  try {\n    resolvedTarget = realpathSync(linkPath)\n  } catch (err) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link target is missing or cyclic at ${displayGitPath(linkPath)}`,\n      err,\n    )\n  }\n  if (!isWithinRoot(root, resolvedTarget)) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link escapes its worktree at ${displayGitPath(linkPath)}`,\n    )\n  }\n\n  const targetRelative = relative(root, resolvedTarget).split(sep).join('/')\n  const targetIsTracked =\n    trackedPaths.has(targetRelative) ||\n    [...trackedPaths].some((trackedPath) => trackedPath.startsWith(`${targetRelative}/`))\n  if (!targetIsTracked) {\n    throw new WorktreeAdapterError(\n      `CodeSurface symbolic link resolves to untracked content at ${displayGitPath(linkPath)}`,\n    )\n  }\n}\n\nfunction assertRawTreeMatchesWorktree(git: GitRunner, root: string, candidateCommit: string): void {\n  const entries = parseGitTreeEntries(\n    gitBytes(git, ['ls-tree', '-r', '-z', '--full-tree', candidateCommit], root),\n  )\n  const trackedPaths = new Set(entries.map((entry) => entry.path))\n\n  for (const entry of entries) {\n    const absolutePath = assertSafeRelativePath(root, entry.path)\n    if (entry.mode === '160000' || entry.mode === '040000') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains a Git submodule whose executable bytes are not bound: ${displayGitPath(entry.path)}`,\n      )\n    }\n    if (entry.mode === '120000') {\n      const stat = lstatSync(absolutePath)\n      if (!stat.isSymbolicLink()) {\n        throw new WorktreeAdapterError(\n          `CodeSurface expected a symbolic link at ${displayGitPath(entry.path)}`,\n        )\n      }\n      const targetBytes = readlinkSync(absolutePath, { encoding: 'buffer' })\n      const actualObjectId = hashGitBlobBytes(targetBytes, entry.objectId)\n      if (actualObjectId !== entry.objectId) {\n        throw new WorktreeAdapterError(\n          `CodeSurface raw symbolic-link bytes differ from the candidate tree at ${displayGitPath(entry.path)}`,\n        )\n      }\n      assertSymlinkTargetIsBound(root, absolutePath, trackedPaths)\n      continue\n    }\n    if (entry.mode !== '100644' && entry.mode !== '100755') {\n      throw new WorktreeAdapterError(\n        `CodeSurface contains unsupported Git mode ${entry.mode} at ${displayGitPath(entry.path)}`,\n      )\n    }\n\n    const actual = hashGitBlobFile(absolutePath, entry.objectId)\n    if (actual.hash !== entry.objectId) {\n      throw new WorktreeAdapterError(\n        `CodeSurface raw tracked bytes differ from the candidate tree because the worktree changed after finalization at ${displayGitPath(entry.path)}`,\n      )\n    }\n    if (process.platform !== 'win32' && actual.executable !== (entry.mode === '100755')) {\n      throw new WorktreeAdapterError(\n        `CodeSurface executable mode differs from the candidate tree at ${displayGitPath(entry.path)}`,\n      )\n    }\n  }\n}\n\nexport interface CodeSurfaceVerification {\n  /** Verified worktree path. */\n  path: string\n  /** Git's canonical root for the verified checkout. */\n  repoRoot: string\n  /** Recomputed full content identity. */\n  contentHash: `sha256:${string}`\n  /** Exact verified binary-patch bytes. Candidate-bundle builders encode this\n   *  directly instead of reproducing Git diff options. */\n  patchBytes: Uint8Array\n}\n\nfunction verifyCodeSurfaceWithGit(\n  surface: CodeSurface,\n  path: string,\n  git: GitRunner,\n): CodeSurfaceVerification {\n  assertCodeSurfaceIdentity(surface)\n  if (!existsSync(path)) {\n    throw new WorktreeAdapterError(`CodeSurface worktree does not exist: ${path}`)\n  }\n  const lexicalRoot = resolve(path)\n  const canonicalRoot = realpathSync(path)\n  if (\n    lstatSync(lexicalRoot).isSymbolicLink() ||\n    (process.platform !== 'win32' && lexicalRoot !== canonicalRoot)\n  ) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree locator must not contain a symbolic link: ${path}`,\n    )\n  }\n  const repoRoot = gitText(git, ['rev-parse', '--show-toplevel'], path)\n  const canonicalRepoRoot = realpathSync(repoRoot)\n  if (canonicalRepoRoot !== canonicalRoot) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree locator is not the repository root: expected ${repoRoot}, got ${path}`,\n    )\n  }\n\n  const indexFlags = gitText(git, ['ls-files', '-v'], path)\n    .split('\\n')\n    .filter((line) => line.length > 0 && (line.startsWith('S ') || /^[a-z]/.test(line)))\n  if (indexFlags.length > 0) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree uses hidden index entries that cannot be verified: ${path}\\n${indexFlags.join('\\n')}`,\n    )\n  }\n\n  const extraPaths = [\n    ...parseGitPathList(gitBytes(git, ['ls-files', '--others', '--exclude-standard', '-z'], path)),\n    ...parseGitPathList(\n      gitBytes(git, ['ls-files', '--others', '--ignored', '--exclude-standard', '-z'], path),\n    ),\n  ]\n  if (extraPaths.length > 0) {\n    throw new WorktreeAdapterError(\n      `CodeSurface worktree changed after finalization: ${path}\\n${extraPaths.join('\\n')}`,\n    )\n  }\n\n  const candidateCommit = resolveCommit(git, path, 'HEAD')\n  if (candidateCommit !== surface.candidateCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface candidate commit mismatch: expected ${surface.candidateCommit}, got ${candidateCommit}`,\n    )\n  }\n\n  const baseCommit = resolveCommit(git, path, surface.baseCommit)\n  if (baseCommit !== surface.baseCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface base commit mismatch: expected ${surface.baseCommit}, got ${baseCommit}`,\n    )\n  }\n\n  const baseTree = gitText(git, ['rev-parse', '--verify', `${surface.baseCommit}^{tree}`], path)\n  if (baseTree !== surface.baseTree) {\n    throw new WorktreeAdapterError(\n      `CodeSurface base tree mismatch: expected ${surface.baseTree}, got ${baseTree}`,\n    )\n  }\n\n  const candidateTree = gitText(\n    git,\n    ['rev-parse', '--verify', `${surface.candidateCommit}^{tree}`],\n    path,\n  )\n  if (candidateTree !== surface.candidateTree) {\n    throw new WorktreeAdapterError(\n      `CodeSurface tree mismatch: expected ${surface.candidateTree}, got ${candidateTree}`,\n    )\n  }\n\n  try {\n    gitText(\n      git,\n      [\n        'diff-index',\n        '--cached',\n        '--quiet',\n        '--no-ext-diff',\n        '--no-textconv',\n        surface.candidateCommit,\n        '--',\n      ],\n      path,\n    )\n  } catch (err) {\n    throw new WorktreeAdapterError(\n      `CodeSurface index differs from finalized candidate: ${path}`,\n      err,\n    )\n  }\n\n  try {\n    assertRawTreeMatchesWorktree(git, canonicalRepoRoot, surface.candidateCommit)\n  } catch (err) {\n    if (err instanceof WorktreeAdapterError) throw err\n    throw new WorktreeAdapterError(`CodeSurface raw tree verification failed: ${path}`, err)\n  }\n\n  const mergeBase = gitText(git, ['merge-base', surface.baseCommit, surface.candidateCommit], path)\n  if (mergeBase !== surface.baseCommit) {\n    throw new WorktreeAdapterError(\n      `CodeSurface candidate ${surface.candidateCommit} does not descend from base ${surface.baseCommit}`,\n    )\n  }\n\n  const patch = patchBytes(git, path, surface.baseCommit, surface.candidateCommit)\n  const actualPatchHash = sha256(patch)\n  if (actualPatchHash !== surface.patch.sha256 || patch.byteLength !== surface.patch.byteLength) {\n    throw new WorktreeAdapterError(\n      `CodeSurface patch mismatch: expected ${surface.patch.sha256}/${surface.patch.byteLength} bytes, got ${actualPatchHash}/${patch.byteLength} bytes`,\n    )\n  }\n\n  return {\n    path,\n    repoRoot: canonicalRepoRoot,\n    contentHash: surfaceContentHash(surface),\n    patchBytes: new Uint8Array(patch),\n  }\n}\n\n/** Slugify a label into a branch-safe segment. */\nfunction slug(label: string): string {\n  return (\n    label\n      .toLowerCase()\n      .replace(/[^a-z0-9]+/g, '-')\n      .replace(/^-+|-+$/g, '')\n      .slice(0, 48) || 'candidate'\n  )\n}\n\n/**\n * Git-backed `WorktreeAdapter`: creates isolated worktrees on fresh branches, commits agent changes, and discards losers.\n */\nexport function gitWorktreeAdapter(opts: GitWorktreeAdapterOptions): WorktreeAdapter {\n  const git = opts.git ?? defaultGit\n  const worktreeDir = opts.worktreeDir ?? join(opts.repoRoot, '.worktrees')\n  const branchPrefix = opts.branchPrefix ?? 'improve'\n\n  return {\n    async create({ baseRef, label }) {\n      const id = `${slug(label)}-${Date.now().toString(36)}-${Math.random().toString(36).slice(2, 6)}`\n      const branch = `${branchPrefix}/${id}`\n      const path = join(worktreeDir, id)\n      const baseCommit = resolveCommit(git, opts.repoRoot, baseRef)\n      const baseTree = gitText(\n        git,\n        ['rev-parse', '--verify', `${baseCommit}^{tree}`],\n        opts.repoRoot,\n      )\n      gitText(git, ['worktree', 'add', '-b', branch, path, baseCommit], opts.repoRoot)\n      return { path, branch, baseRef, baseCommit, baseTree }\n    },\n\n    async finalize(worktree, summary) {\n      // Stage + commit any pending changes the agent left in the worktree.\n      // A no-op commit is refused by git, so only commit when the tree is dirty.\n      const status = gitText(\n        git,\n        ['status', '--porcelain=v1', '--untracked-files=all'],\n        worktree.path,\n      )\n      if (status.length > 0) {\n        gitText(git, ['add', '-A'], worktree.path)\n        gitText(git, ['commit', '-m', summary], worktree.path)\n      }\n      const candidateCommit = resolveCommit(git, worktree.path, 'HEAD')\n      const candidateTree = gitText(\n        git,\n        ['rev-parse', '--verify', `${candidateCommit}^{tree}`],\n        worktree.path,\n      )\n      const patch = patchBytes(git, worktree.path, worktree.baseCommit, candidateCommit)\n      const surface: CodeSurface = {\n        kind: 'code',\n        worktreeRef: worktree.path,\n        baseRef: worktree.baseRef,\n        baseCommit: worktree.baseCommit,\n        baseTree: worktree.baseTree,\n        candidateCommit,\n        candidateTree,\n        patch: {\n          format: 'git-diff-binary',\n          sha256: sha256(patch),\n          byteLength: patch.byteLength,\n        },\n        summary,\n      }\n      verifyCodeSurfaceWithGit(surface, worktree.path, git)\n      return surface\n    },\n\n    async discard(worktree) {\n      // Reconcile both resources independently so a retry can finish cleanup\n      // after either command succeeded alone. Force-remove because the worktree\n      // may hold uncommitted experiment state we're discarding.\n      const failures = [\n        reconcileAbsent(\n          () => hasRegisteredWorktree(git, opts.repoRoot, worktree.path),\n          () => gitText(git, ['worktree', 'remove', '--force', '--', worktree.path], opts.repoRoot),\n        ),\n        reconcileAbsent(\n          () => hasLocalBranch(git, opts.repoRoot, worktree.branch),\n          () => gitText(git, ['branch', '-D', '--', worktree.branch], opts.repoRoot),\n        ),\n      ].filter((failure) => failure !== undefined)\n\n      if (failures.length > 0) {\n        const cause =\n          failures.length === 1\n            ? failures[0]\n            : new AggregateError(failures, 'Multiple Git resources could not be removed')\n        throw new WorktreeAdapterError(\n          `Failed to discard worktree ${worktree.path} and branch ${worktree.branch}`,\n          cause,\n        )\n      }\n    },\n  }\n}\n\n/** Verify a finalized code surface against its current checkout. This rejects\n *  dirty/ignored files, moved refs, missing Git objects, raw byte/mode\n *  mismatches, external symlinks, and submodules. */\nexport function verifyCodeSurface(\n  surface: CodeSurface,\n  worktreeDir?: string,\n): CodeSurfaceVerification {\n  const path = unresolvedWorktreePath(surface, worktreeDir)\n  return verifyCodeSurfaceWithGit(surface, path, defaultGit)\n}\n\n/** Resolve a code candidate for evaluation only after verifying its immutable\n *  identity against the checkout at `worktreeRef`. */\nexport function resolveWorktreePath(surface: CodeSurface, worktreeDir?: string): string {\n  return verifyCodeSurface(surface, worktreeDir).path\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,SAAS,kBAAkB;AAC3B,SAAS,YAAY,OAAO,UAAU,iBAAiB;AACvD,SAAS,eAAe;AA2CjB,SAAS,cAAc,OAKnB;AACT,QAAM,UAAU,CAAC,GAAG,MAAM,SAAS,EAAE,KAAK,EAAE,KAAK,GAAG;AACpD,QAAM,UAAU,GAAG,OAAO,IAAI,MAAM,KAAK,IAAI,MAAM,OAAO,IAAI,MAAM,QAAQ;AAC5E,SAAO,WAAW,QAAQ,EAAE,OAAO,OAAO,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACvE;AASO,IAAM,UAAN,MAAM,SAAQ;AAAA,EACF,OAAO,oBAAI,IAAyB;AAAA,EACpC,WAAW,oBAAI,IAAsB;AAAA,EAC9C,UAAU;AAAA,EAElB,YAAY,OAAgC;AAC1C,QAAI,CAAC,MAAO;AAGZ,eAAW,QAAQ,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG,GAAG;AAC3D,WAAK,MAAM,IAAI;AACf,WAAK,UAAU,KAAK,IAAI,KAAK,SAAS,KAAK,MAAM,CAAC;AAAA,IACpD;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QAAQ,OAAsC;AAC5C,eAAW,YAAY,MAAM,WAAW;AACtC,UAAI,CAAC,KAAK,KAAK,IAAI,QAAQ,GAAG;AAC5B,cAAM,IAAI,MAAM,oCAAoC,QAAQ,GAAG;AAAA,MACjE;AAAA,IACF;AACA,UAAM,KAAK,cAAc;AAAA,MACvB,WAAW,MAAM;AAAA,MACjB,OAAO,MAAM;AAAA,MACb,SAAS,MAAM;AAAA,MACf,UAAU,MAAM;AAAA,IAClB,CAAC;AACD,UAAM,WAAW,KAAK,KAAK,IAAI,EAAE;AACjC,QAAI,SAAU,QAAO;AAErB,UAAM,aACJ,MAAM,eACL,MAAM,UAAU,WAAW,IACxB,IACA,KAAK,IAAI,GAAG,MAAM,UAAU,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,EAAG,UAAU,CAAC,IAAI;AAE9E,UAAM,OAAoB;AAAA,MACxB;AAAA,MACA,WAAW,CAAC,GAAG,MAAM,SAAS;AAAA,MAC9B,OAAO,MAAM;AAAA,MACb,SAAS,MAAM;AAAA,MACf,OAAO,MAAM;AAAA,MACb,UAAU,MAAM;AAAA,MAChB;AAAA,MACA,KAAK,KAAK;AAAA,MACV,GAAI,MAAM,WAAW,SAAY,EAAE,QAAQ,MAAM,OAAO,IAAI,CAAC;AAAA,MAC7D,GAAI,MAAM,gBAAgB,SAAY,EAAE,aAAa,CAAC,GAAG,MAAM,WAAW,EAAE,IAAI,CAAC;AAAA,MACjF,GAAI,MAAM,cAAc,SAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;AAAA,MACtE,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,MAAM,KAAK,IAAI,CAAC;AAAA,IACzD;AACA,SAAK,MAAM,IAAI;AACf,WAAO;AAAA,EACT;AAAA;AAAA;AAAA,EAIA,MAAM,OASU;AACd,QAAI,MAAM,UAAU,SAAS,GAAG;AAC9B,YAAM,IAAI,MAAM,kDAAkD,MAAM,UAAU,MAAM,EAAE;AAAA,IAC5F;AACA,WAAO,KAAK,QAAQ,EAAE,GAAG,OAAO,UAAU,MAAM,YAAY,QAAQ,CAAC;AAAA,EACvE;AAAA,EAEA,IAAI,IAAqC;AACvC,WAAO,KAAK,KAAK,IAAI,EAAE;AAAA,EACzB;AAAA,EAEA,IAAI,IAAqB;AACvB,WAAO,KAAK,KAAK,IAAI,EAAE;AAAA,EACzB;AAAA;AAAA,EAGA,MAAqB;AACnB,WAAO,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,EAAE,KAAK,KAAK;AAAA,EAC3C;AAAA,EAEA,QAAuB;AACrB,WAAO,KAAK,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,WAAW,CAAC;AAAA,EAC1D;AAAA,EAEA,QAAQ,IAA2B;AACjC,UAAM,OAAO,KAAK,KAAK,IAAI,EAAE;AAC7B,QAAI,CAAC,KAAM,QAAO,CAAC;AACnB,WAAO,KAAK,UACT,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,EAC3B,OAAO,CAAC,MAAwB,MAAM,MAAS,EAC/C,KAAK,KAAK;AAAA,EACf;AAAA,EAEA,SAAS,IAA2B;AAClC,YAAQ,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAE,EAAE,KAAK,KAAK;AAAA,EAC/E;AAAA;AAAA,EAGA,UAAU,IAAyB;AACjC,UAAM,MAAM,oBAAI,IAAY;AAC5B,UAAM,QAAQ,CAAC,GAAI,KAAK,KAAK,IAAI,EAAE,GAAG,aAAa,CAAC,CAAE;AACtD,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,MAAM,MAAM,IAAI;AACtB,UAAI,IAAI,IAAI,GAAG,EAAG;AAClB,UAAI,IAAI,GAAG;AACX,YAAM,OAAO,KAAK,KAAK,IAAI,GAAG;AAC9B,UAAI,KAAM,OAAM,KAAK,GAAG,KAAK,SAAS;AAAA,IACxC;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,YAAY,IAAyB;AACnC,UAAM,MAAM,oBAAI,IAAY;AAC5B,UAAM,QAAQ,CAAC,GAAI,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,CAAE;AAC/C,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,MAAM,MAAM,IAAI;AACtB,UAAI,IAAI,IAAI,GAAG,EAAG;AAClB,UAAI,IAAI,GAAG;AACX,YAAM,KAAK,GAAI,KAAK,SAAS,IAAI,GAAG,KAAK,CAAC,CAAE;AAAA,IAC9C;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAsB;AACpB,WAAO,KAAK,IAAI,EAAE,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,EAAE,EAAE,KAAK,CAAC,GAAG,WAAW,CAAC;AAAA,EAC9E;AAAA;AAAA,EAGA,SAAmB;AACjB,UAAM,OAAO,oBAAI,IAAY;AAC7B,UAAM,MAAgB,CAAC;AACvB,eAAW,QAAQ,KAAK,IAAI,GAAG;AAC7B,UAAI,CAAC,KAAK,IAAI,KAAK,KAAK,GAAG;AACzB,aAAK,IAAI,KAAK,KAAK;AACnB,YAAI,KAAK,KAAK,KAAK;AAAA,MACrB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,WAAW,OAA8B;AACvC,WAAO,KAAK,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK;AAAA,EACnD;AAAA;AAAA,EAGA,SAAS,OAAwC;AAC/C,WAAO,SAAS,KAAK,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,CAAC;AAAA,EAC9D;AAAA;AAAA,EAGA,OAAgC;AAC9B,WAAO,SAAS,KAAK,IAAI,CAAC;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,WAA0B;AACxB,UAAM,OAAO,KAAK,KAAK;AACvB,UAAM,YAAY,KAAK,SAAS,KAAK,KAAK,MAAM,CAAC,MAAM,EAAE,gBAAgB,MAAS;AAClF,UAAM,QAAQ,CAAC,MAA8B,YAAY,EAAE,cAAe,CAAC,EAAE,KAAK;AAClF,WAAO,KACJ,OAAO,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,UAAU,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EAC/E,KAAK,KAAK;AAAA,EACf;AAAA,EAEA,UAAwB;AACtB,UAAM,QAAQ,KAAK,IAAI;AACvB,UAAM,QAAuB,CAAC;AAC9B,eAAW,QAAQ,OAAO;AACxB,iBAAW,YAAY,KAAK,WAAW;AACrC,cAAM,KAAK,EAAE,MAAM,UAAU,IAAI,KAAK,GAAG,CAAC;AAAA,MAC5C;AAAA,IACF;AACA,WAAO,EAAE,OAAO,MAAM;AAAA,EACxB;AAAA;AAAA,EAGA,UAAkB;AAChB,WAAO,KAAK,IAAI,EACb,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,EAC5B,KAAK,IAAI;AAAA,EACd;AAAA,EAEA,OAAO,UAAU,MAAuB;AACtC,UAAM,QAAQ,KACX,MAAM,IAAI,EACV,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,EAChC,IAAI,CAAC,SAAS,KAAK,MAAM,IAAI,CAAgB;AAChD,WAAO,IAAI,SAAQ,KAAK;AAAA,EAC1B;AAAA,EAEQ,MAAM,MAAyB;AACrC,SAAK,KAAK,IAAI,KAAK,IAAI,IAAI;AAC3B,eAAW,YAAY,KAAK,WAAW;AACrC,YAAM,OAAO,KAAK,SAAS,IAAI,QAAQ;AACvC,UAAI,MAAM;AACR,YAAI,CAAC,KAAK,SAAS,KAAK,EAAE,EAAG,MAAK,KAAK,KAAK,EAAE;AAAA,MAChD,OAAO;AACL,aAAK,SAAS,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,MAAM,GAAgB,GAAwB;AACrD,SAAO,EAAE,MAAM,EAAE;AACnB;AAGA,SAAS,SAAS,OAA+C;AAC/D,MAAI;AACJ,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,QAAQ,KAAK,QAAQ,KAAK,SAAU,KAAK,UAAU,KAAK,SAAS,KAAK,MAAM,KAAK,KAAM;AAC1F,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAIA,SAAS,UAAU,GAAa,GAAsB;AACpD,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,MAAI,iBAAiB;AACrB,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;AACpC,QAAI,EAAE,CAAC,IAAK,EAAE,CAAC,EAAI,QAAO;AAC1B,QAAI,EAAE,CAAC,IAAK,EAAE,CAAC,EAAI,kBAAiB;AAAA,EACtC;AACA,SAAO;AACT;AAeO,SAAS,eAAe,MAA4B;AACzD,QAAM,YAAY,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAChE,SAAO;AAAA,IACL,MAAM,OAAO;AACX,UAAI;AACF,eAAO,QAAQ,UAAU,MAAM,SAAS,MAAM,MAAM,CAAC;AAAA,MACvD,SAAS,KAAK;AACZ,YAAK,IAA8B,SAAS,SAAU,QAAO,IAAI,QAAQ;AACzE,cAAM;AAAA,MACR;AAAA,IACF;AAAA,IACA,MAAM,OAAO,MAAM;AACjB,YAAM,UAAU;AAChB,YAAM,WAAW,MAAM,GAAG,KAAK,UAAU,IAAI,CAAC;AAAA,GAAM,MAAM;AAAA,IAC5D;AAAA,IACA,MAAM,KAAK,SAAS;AAClB,YAAM,UAAU;AAChB,YAAM,QAAQ,QAAQ,QAAQ;AAC9B,YAAM,UAAU,MAAM,MAAM,SAAS,IAAI,GAAG,KAAK;AAAA,IAAO,IAAI,MAAM;AAAA,IACpE;AAAA,EACF;AACF;AAGO,SAAS,kBAAgC;AAC9C,QAAM,QAAuB,CAAC;AAC9B,SAAO;AAAA,IACL,MAAM,OAAO;AACX,aAAO,IAAI,QAAQ,KAAK;AAAA,IAC1B;AAAA,IACA,MAAM,OAAO,MAAM;AACjB,YAAM,KAAK,IAAI;AAAA,IACjB;AAAA,IACA,MAAM,KAAK,SAAS;AAClB,YAAM,SAAS;AACf,YAAM,KAAK,GAAG,QAAQ,IAAI,CAAC;AAAA,IAC7B;AAAA,EACF;AACF;AAmCO,SAAS,kBAAkB,OAAiC,CAAC,GAAa;AAC/E,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,kBAAkB,KAAK,mBAAmB;AAEhD,SAAO;AAAA,IACL,OAAO,KAAkC;AACvC,YAAM,EAAE,QAAQ,IAAI;AACpB,UAAI,IAAI,mBAAmB,EAAG,QAAO,EAAE,IAAI,OAAO;AAElD,YAAM,SAAS,IAAI,IAAI,IAAI,YAAY;AACvC,YAAM,aAAa,QAAQ,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,CAAC;AAChE,UAAI,WAAW,WAAW,EAAG,QAAO,EAAE,IAAI,OAAO;AAIjD,YAAM,kBAAkB,oBAAI,IAAyB;AACrD,iBAAW,OAAO,QAAQ,SAAS,GAAG;AACpC,YAAI,OAAO,IAAI,IAAI,KAAK,EAAG;AAC3B,YAAI,CAAC,gBAAgB,IAAI,IAAI,KAAK,EAAG,iBAAgB,IAAI,IAAI,OAAO,GAAG;AAAA,MACzE;AACA,UAAI,gBAAgB,QAAQ,iBAAiB;AAC3C,cAAM,OAAO,CAAC,GAAG,gBAAgB,OAAO,CAAC,EAAE,KAAK,KAAK;AACrD,cAAM,SAAS,SAAS,IAAI;AAC5B,eAAO,EAAE,IAAI,SAAS,WAAW,KAAK,IAAI,CAAC,MAAM,EAAE,EAAE,GAAG,OAAO,OAAO,MAAM;AAAA,MAC9E;AAIA,iBAAW,SAAS,YAAY;AAC9B,YAAI,YAAY,QAAQ,WAAW,KAAK,GAAG,YAAY,GAAG;AAGxD,cAAI,WAAW,SAAS,KAAK,WAAW,SAAS,WAAW;AAC1D,mBAAO,EAAE,IAAI,SAAS,MAAM;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AAGA,YAAM,SAAS,SAAS,WAAW,IAAI,CAAC,MAAM,QAAQ,SAAS,CAAC,CAAE,EAAE,OAAO,OAAO,CAAC;AACnF,UACE,UACA,WAAW,SAAS,aACpB,YAAY,QAAQ,WAAW,OAAO,KAAK,GAAG,YAAY,GAC1D;AACA,eAAO;AAAA,UACL,IAAI;AAAA,UACJ,YAAY,OAAO;AAAA,UACnB,OAAO,GAAG,OAAO,KAAK,IAAI,QAAQ,OAAO,EAAE,MAAM;AAAA,UACjD,UAAU;AAAA,QACZ;AAAA,MACF;AAGA,UAAI,OAAQ,QAAO,EAAE,IAAI,UAAU,OAAO,OAAO,MAAM;AACvD,aAAO,EAAE,IAAI,OAAO;AAAA,IACtB;AAAA,EACF;AACF;AAIO,SAAS,iBAAiB,QAAiE;AAChG,SAAO,EAAE,OAAO;AAClB;AAIA,SAAS,YAAY,YAA2B,QAAyB;AACvE,MAAI,WAAW,UAAU,OAAQ,QAAO;AACxC,QAAM,UAAU,CAAC,GAAG,UAAU,EAAE,KAAK,KAAK;AAC1C,QAAM,OAAO,QAAQ,MAAM,GAAG,QAAQ,SAAS,MAAM;AACrD,QAAM,OAAO,QAAQ,MAAM,QAAQ,SAAS,MAAM;AAClD,QAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACvD,QAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AACvD,SAAO,cAAc;AACvB;AAmDA,eAAsB,WAAW,MAAoD;AACnF,QAAM,QAAQ,KAAK,SAAS,gBAAgB;AAC5C,QAAM,UAAU,MAAM,MAAM,KAAK;AACjC,QAAM,MAAM,KAAK,QAAQ,MAAM;AAAA,EAAC;AAChC,QAAM,SAAS,oBAAI,IAAY;AAG/B,QAAM,gBAAgB,oBAAI,IAAoB;AAE9C,QAAM,UAAU,OAAO,SAAsB;AAC3C,UAAM,MAAM,OAAO,IAAI;AAAA,EACzB;AAEA,aAAW,QAAQ,KAAK,OAAO;AAC7B,UAAM,OAAO,QAAQ,QAAQ;AAAA,MAC3B,WAAW,CAAC;AAAA,MACZ,OAAO,KAAK;AAAA,MACZ,SAAS,KAAK;AAAA,MACd,OAAO,KAAK;AAAA,MACZ,UAAU,KAAK;AAAA,MACf,GAAI,KAAK,WAAW,SAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,MAC3D,GAAI,KAAK,gBAAgB,SAAY,EAAE,aAAa,KAAK,YAAY,IAAI,CAAC;AAAA,IAC5E,CAAC;AACD,kBAAc,IAAI,KAAK,OAAO,KAAK,QAAQ;AAC3C,UAAM,QAAQ,IAAI;AAAA,EACpB;AAEA,MAAI,QAAQ;AACZ,SAAO,QAAQ,KAAK,OAAO,UAAU;AACnC,UAAM,KAAK,MAAM,KAAK,SAAS,OAAO;AAAA,MACpC;AAAA,MACA,MAAM;AAAA,MACN,iBAAiB,KAAK,OAAO,WAAW;AAAA,MACxC,cAAc,CAAC,GAAG,MAAM;AAAA,IAC1B,CAAC;AAED,QAAI,GAAG,OAAO,QAAQ;AACpB,UAAI,0BAA0B,EAAE,MAAM,CAAC;AACvC;AAAA,IACF;AAEA,QAAI,GAAG,OAAO,SAAS;AACrB,aAAO,IAAI,GAAG,KAAK;AACnB,UAAI,kBAAkB,EAAE,OAAO,GAAG,MAAM,CAAC;AACzC,eAAS;AACT;AAAA,IACF;AAEA,QAAI,GAAG,OAAO,SAAS;AACrB,YAAM,UAAU,GAAG,UAChB,IAAI,CAAC,OAAO,QAAQ,IAAI,EAAE,CAAC,EAC3B,OAAO,CAAC,MAAwB,MAAM,MAAS;AAClD,UAAI,QAAQ,SAAS,GAAG;AACtB,YAAI,uDAAuD,EAAE,GAAG,CAAC;AACjE,iBAAS;AACT;AAAA,MACF;AACA,YAAMA,UAAS,MAAM,KAAK,MAAM,EAAE,SAAS,OAAO,GAAG,MAAM,CAAC;AAC5D,YAAMC,QAAO,QAAQ,MAAM;AAAA,QACzB,WAAW,QAAQ,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,QAClC,OAAO,GAAG;AAAA,QACV,SAASD,QAAO;AAAA,QAChB,OAAOA,QAAO;AAAA,QACd,GAAI,QAAQ,CAAC,EAAG,WAAW,SAAY,EAAE,QAAQ,QAAQ,CAAC,EAAG,OAAO,IAAI,CAAC;AAAA,QACzE,GAAIA,QAAO,gBAAgB,SAAY,EAAE,aAAaA,QAAO,YAAY,IAAI,CAAC;AAAA,QAC9E,GAAIA,QAAO,cAAc,SAAY,EAAE,WAAWA,QAAO,UAAU,IAAI,CAAC;AAAA,MAC1E,CAAC;AACD,YAAM,QAAQC,KAAI;AAClB,eAAS;AACT;AAAA,IACF;AAEA,QAAI,GAAG,OAAO,UAAU;AACtB,UAAI,OAAO,IAAI,GAAG,KAAK,GAAG;AACxB,YAAI,iDAAiD,EAAE,OAAO,GAAG,MAAM,CAAC;AACxE,iBAAS;AACT;AAAA,MACF;AACA,YAAM,OAAO,QAAQ,IAAI,GAAG,UAAU;AACtC,UAAI,CAAC,MAAM;AACT,YAAI,gDAAgD,EAAE,GAAG,CAAC;AAC1D,iBAAS;AACT;AAAA,MACF;AACA,oBAAc,IAAI,GAAG,OAAO,GAAG,QAAQ;AACvC,YAAMD,UAAS,MAAM,KAAK,KAAK,EAAE,OAAO,GAAG,OAAO,UAAU,GAAG,UAAU,KAAK,KAAK,CAAC;AACpF,YAAMC,QAAO,QAAQ,QAAQ;AAAA,QAC3B,WAAW,CAAC,KAAK,EAAE;AAAA,QACnB,OAAO,GAAG;AAAA,QACV,SAASD,QAAO;AAAA,QAChB,OAAOA,QAAO;AAAA,QACd,UAAU,GAAG;AAAA,QACb,GAAI,GAAG,WAAW,SAAY,EAAE,QAAQ,GAAG,OAAO,IAAI,CAAC;AAAA,QACvD,GAAIA,QAAO,gBAAgB,SAAY,EAAE,aAAaA,QAAO,YAAY,IAAI,CAAC;AAAA,QAC9E,GAAIA,QAAO,cAAc,SAAY,EAAE,WAAWA,QAAO,UAAU,IAAI,CAAC;AAAA,QACxE,GAAIA,QAAO,SAAS,SAAY,EAAE,MAAMA,QAAO,KAAK,IAAI,CAAC;AAAA,MAC3D,CAAC;AACD,YAAM,QAAQC,KAAI;AAClB,eAAS;AACT;AAAA,IACF;AAGA,QAAI,OAAO,IAAI,GAAG,KAAK,GAAG;AACxB,UAAI,0CAA0C,EAAE,OAAO,GAAG,MAAM,CAAC;AACjE,eAAS;AACT;AAAA,IACF;AACA,UAAM,MAAM,QAAQ,SAAS,GAAG,KAAK;AACrC,QAAI,CAAC,KAAK;AACR,UAAI,8CAA8C,EAAE,OAAO,GAAG,MAAM,CAAC;AACrE,eAAS;AACT;AAAA,IACF;AACA,UAAM,WAAW,cAAc,IAAI,GAAG,KAAK,KAAK,IAAI;AACpD,UAAM,SAAS,MAAM,KAAK,KAAK,EAAE,OAAO,GAAG,OAAO,UAAU,IAAI,CAAC;AACjE,UAAM,OAAO,QAAQ,QAAQ;AAAA,MAC3B,WAAW,CAAC,IAAI,EAAE;AAAA,MAClB,OAAO,GAAG;AAAA,MACV,SAAS,OAAO;AAAA,MAChB,OAAO,OAAO;AAAA,MACd;AAAA,MACA,GAAI,IAAI,WAAW,SAAY,EAAE,QAAQ,IAAI,OAAO,IAAI,CAAC;AAAA,MACzD,GAAI,OAAO,gBAAgB,SAAY,EAAE,aAAa,OAAO,YAAY,IAAI,CAAC;AAAA,MAC9E,GAAI,OAAO,cAAc,SAAY,EAAE,WAAW,OAAO,UAAU,IAAI,CAAC;AAAA,MACxE,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,KAAK,IAAI,CAAC;AAAA,IAC3D,CAAC;AACD,UAAM,QAAQ,IAAI;AAClB,aAAS;AAAA,EACX;AAEA,SAAO,EAAE,SAAS,MAAM,QAAQ,KAAK,GAAG,MAAM;AAChD;;;AC3kBA,SAAS,cAAc,SAAiC;AACtD,MAAI,OAAO,YAAY,SAAU,QAAO;AAGxC,QAAM,IAAI;AAAA,IACR,6FACW,QAAQ,IAAI,kBAAkB,QAAQ,WAAW;AAAA,EAC9D;AACF;AAOO,SAAS,4BACd,MAK4B;AAC5B,QAAM,UAAU,KAAK,WAAW;AAChC,SAAO,OAAO,SAAS,UAAU,SAAS;AACxC,UAAM,mBAAmB,cAAc,OAAO;AAC9C,UAAM,MAAM,MAAM;AAAA,MAChB,EAAE,UAAU,SAAS,SAAS;AAAA,MAC9B,EAAE,GAAG,KAAK,gBAAgB,kBAAkB,QAAQ,SAAS,OAAO;AAAA,IACtE;AACA,WAAO;AAAA,MACL,QAAQ,IAAI;AAAA,MACZ,UAAU,IAAI;AAAA,MACd,oBAAoB,IAAI;AAAA,IAC1B;AAAA,EACF;AACF;AAeO,SAAS,uBACd,OAAsC,CAAC,GACQ;AAC/C,QAAM,eAAe,KAAK,gBAAgB;AAC1C,SAAO;AAAA,IACL,MAAM;AAAA,IACN,YAAY;AAAA,MACV,EAAE,KAAK,UAAU,aAAa,8DAA8D;AAAA,MAC5F;AAAA,QACE,KAAK;AAAA,QACL,aACE;AAAA,MACJ;AAAA,IACF;AAAA,IACA,WAAW,CAAC,MAAM,EAAE,SAAS;AAAA,IAC7B,MAAM,EAAE,UAAU,SAAS,GAAG;AAC5B,YAAM,QAAQ,SAAS;AACvB,UAAI,MAAM,WAAW,GAAG;AACtB,cAAM,IAAI;AAAA,UACR,qCAAqC,SAAS,EAAE;AAAA,QAClD;AAAA,MACF;AACA,YAAM,MAAM,SAAS,SAAS,KAAK,IAAI,EAAE,YAAY;AACrD,YAAM,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,KAAK,KAAK,CAAC,MAAM,IAAI,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;AACrF,YAAM,SAAS,QAAQ,SAAS,MAAM;AAEtC,YAAM,aAAa,SAAS,iBAAiB,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAC3E,UAAI,YAAY;AAChB,UAAI,eAAe;AACnB,UAAI,UAAU,SAAS,GAAG;AACxB,cAAM,QAAQ,KAAK,IAAI,GAAG,SAAS,SAAS,MAAM;AAClD,uBAAe,SAAS,SAAS;AAAA,UAAO,CAAC,MACvC,UAAU,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;AAAA,QACnD,EAAE;AACF,oBAAY,IAAI,eAAe;AAAA,MACjC;AAEA,YAAM,YACJ,UAAU,SAAS,IAAI,eAAe,UAAU,IAAI,gBAAgB,YAAY;AAClF,YAAM,SAAS,MAAM,OAAO,CAAC,MAAM,CAAC,QAAQ,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AACxE,YAAM,QACJ,WAAW,QAAQ,MAAM,IAAI,MAAM,MAAM,oBACxC,OAAO,SAAS,aAAa,OAAO,KAAK,IAAI,CAAC,MAAM,OACpD,eAAe,KAAK,YAAY,8BAA8B;AACjE,aAAO,EAAE,YAAY,EAAE,QAAQ,UAAU,GAAG,WAAW,MAAM;AAAA,IAC/D;AAAA,EACF;AACF;;;AC7FO,SAAS,SAAS,MAA+B,MAAuC;AAC7F,QAAM,EAAE,aAAa,aAAa,IAAI;AACtC,MAAI,gBAAgB,cAAc;AAChC,UAAM,IAAI;AAAA,MACR,oDAAoD,WAAW;AAAA,IACjE;AAAA,EACF;AAGA,QAAM,QAAQ,oBAAI,IAAyC;AAC3D,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,OAAO,MAAM;AACtB,aAAS,IAAI,IAAI,GAAG;AACpB,QAAI,IAAI,QAAQ,eAAe,IAAI,QAAQ,aAAc;AACzD,UAAM,QAAQ,MAAM,IAAI,IAAI,GAAG,KAAK,oBAAI,IAA4B;AACpE,UAAM,QAAQ,MAAM,IAAI,IAAI,OAAO,KAAK,CAAC;AACzC,UAAM,KAAK,GAAG;AACd,UAAM,IAAI,IAAI,SAAS,KAAK;AAC5B,UAAM,IAAI,IAAI,KAAK,KAAK;AAAA,EAC1B;AAEA,aAAW,OAAO,CAAC,aAAa,YAAY,GAAG;AAC7C,QAAI,CAAC,MAAM,IAAI,GAAG,GAAG;AACnB,YAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK,EAAE,KAAK,IAAI,KAAK;AAChD,YAAM,IAAI,gBAAgB,8BAA8B,GAAG,oBAAoB,IAAI,GAAG;AAAA,IACxF;AAAA,EACF;AAEA,QAAM,gBAAgB,MAAM,IAAI,WAAW;AAC3C,QAAM,iBAAiB,MAAM,IAAI,YAAY;AAE7C,QAAM,UAAU,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,cAAc,KAAK,GAAG,GAAG,eAAe,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK;AACvF,QAAM,QAAuB,CAAC;AAC9B,QAAM,mBAAmC,CAAC;AAC1C,QAAM,oBAAoC,CAAC;AAC3C,aAAW,WAAW,SAAS;AAC7B,UAAM,IAAI,cAAc,IAAI,OAAO,KAAK,CAAC;AACzC,UAAM,IAAI,eAAe,IAAI,OAAO,KAAK,CAAC;AAE1C,QAAI,EAAE,UAAU,KAAK,EAAE,UAAU,GAAG;AAClC,UAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;AACpC,cAAM,KAAK,EAAE,SAAS,UAAU,GAAG,UAAU,EAAE,CAAC,GAAI,WAAW,EAAE,CAAC,EAAG,CAAC;AAAA,MACxE,OAAO;AACL,yBAAiB,KAAK,GAAG,CAAC;AAC1B,0BAAkB,KAAK,GAAG,CAAC;AAAA,MAC7B;AACA;AAAA,IACF;AAEA,UAAM,SAAS,cAAc,GAAG,SAAS,WAAW;AACpD,UAAM,SAAS,cAAc,GAAG,SAAS,YAAY;AACrD,UAAM,UAAU,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,OAAO,KAAK,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK;AACxE,QAAI,WAAW;AACf,eAAW,UAAU,SAAS;AAC5B,YAAM,WAAW,OAAO,IAAI,MAAM;AAClC,YAAM,YAAY,OAAO,IAAI,MAAM;AACnC,UAAI,aAAa,UAAa,cAAc,QAAW;AACrD,cAAM,KAAK,EAAE,SAAS,UAAU,YAAY,UAAU,UAAU,CAAC;AAAA,MACnE,WAAW,aAAa,QAAW;AACjC,yBAAiB,KAAK,QAAQ;AAAA,MAChC,WAAW,cAAc,QAAW;AAClC,0BAAkB,KAAK,SAAS;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,kBAAkB,kBAAkB;AACtD;AAIA,SAAS,cACP,OACA,SACA,KAC2B;AAC3B,QAAM,QAAQ,oBAAI,IAA0B;AAC5C,aAAW,OAAO,OAAO;AACvB,QAAI,IAAI,WAAW,QAAW;AAC5B,YAAM,IAAI;AAAA,QACR,sBAAsB,OAAO,oDAAoD,GAAG;AAAA,MAGtF;AAAA,IACF;AACA,QAAI,MAAM,IAAI,IAAI,MAAM,GAAG;AACzB,YAAM,IAAI;AAAA,QACR,+BAA+B,IAAI,MAAM,kBAAkB,OAAO,aAAa,GAAG;AAAA,MAEpF;AAAA,IACF;AACA,UAAM,IAAI,IAAI,QAAQ,GAAG;AAAA,EAC3B;AACA,SAAO;AACT;AAiEO,SAAS,kBACd,MACA,MACsB;AACtB,QAAM,EAAE,OAAO,kBAAkB,kBAAkB,IAAI,SAAS,MAAM,IAAI;AAE1E,MAAI,cAAwC;AAC5C,QAAM,eAAyB,CAAC;AAChC,QAAM,gBAA0B,CAAC;AACjC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,SAAS,SAAS,UAAa,KAAK,UAAU,SAAS,OAAW;AAC3E,iBAAa,KAAK,KAAK,SAAS,OAAO,IAAI,CAAC;AAC5C,kBAAc,KAAK,KAAK,UAAU,OAAO,IAAI,CAAC;AAAA,EAChD;AACA,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,KAAK,QAAQ,cAAc,aAAa;AAC9C,kBAAc;AAAA,MACZ,KAAK,GAAG;AAAA,MACR,KAAK,GAAG;AAAA,MACR,SAAS;AAAA,MACT,gBAAgB,qBAAqB,cAAc,aAAa;AAAA,IAClE;AAAA,EACF;AAEA,QAAM,cACJ,KAAK,eACL;AAAA,IACE,GAAG,IAAI;AAAA,MACL,MAAM,QAAQ,CAAC,MAAM;AAAA,QACnB,GAAG,OAAO,KAAK,EAAE,SAAS,WAAW,CAAC,CAAC;AAAA,QACvC,GAAG,OAAO,KAAK,EAAE,UAAU,WAAW,CAAC,CAAC;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF,EAAE,KAAK;AAET,QAAM,eAAoC,YAAY,IAAI,CAAC,SAAS;AAClE,UAAM,SAAmB,CAAC;AAC1B,UAAM,QAAkB,CAAC;AACzB,QAAI,WAAW;AACf,eAAW,QAAQ,OAAO;AACxB,YAAM,IAAI,YAAY,KAAK,UAAU,IAAI;AACzC,YAAM,IAAI,YAAY,KAAK,WAAW,IAAI;AAC1C,UAAI,MAAM,UAAa,MAAM,QAAW;AACtC;AACA;AAAA,MACF;AACA,aAAO,KAAK,CAAC;AACb,YAAM,KAAK,CAAC;AAAA,IACd;AACA,UAAM,cAAc,OAAO,WAAW,IAAI,OAAO,gBAAgB,QAAQ,OAAO,KAAK,SAAS;AAC9F,WAAO;AAAA,MACL;AAAA,MACA,GAAG,OAAO;AAAA,MACV;AAAA,MACA,aAAa,gBAAgB,OAAO,OAAO,MAAM,YAAY;AAAA,MAC7D,WAAW,gBAAgB,OAAO,OAAO,MAAM,YAAY;AAAA,MAC3D;AAAA,MACA,UAAU,OAAO,WAAW,IAAI,OAAO,mBAAmB,QAAQ,KAAK;AAAA,IACzE;AAAA,EACF,CAAC;AAED,SAAO;AAAA,IACL,QAAQ,MAAM;AAAA,IACd,mBAAmB,iBAAiB;AAAA,IACpC,oBAAoB,kBAAkB;AAAA,IACtC;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,YAAY,KAAmB,MAAkC;AACxE,QAAM,IAAI,IAAI,UAAU,IAAI;AAC5B,MAAI,MAAM,OAAW,QAAO;AAC5B,MAAI,CAAC,OAAO,SAAS,CAAC,GAAG;AACvB,UAAM,IAAI;AAAA,MACR,mDAAmD,IAAI,iBAAiB,IAAI,OAAO,WAAW,IAAI,GAAG,OAAO,CAAC;AAAA,IAC/G;AAAA,EACF;AACA,SAAO;AACT;;;AC9TO,SAAS,0BACd,OACmC;AACnC,uBAAqB,MAAM,WAAW,WAAW;AACjD,uBAAqB,MAAM,gBAAgB,gBAAgB;AAC3D,MAAI,MAAM,eAAe,SAAS,GAAG;AACnC,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,uBAAqB,MAAM,gBAAgB,gBAAgB;AAC3D,uBAAqB,MAAM,iBAAiB,iBAAiB;AAC7D,MAAI,MAAM,gBAAgB,SAAS,OAAO,GAAG;AAC3C,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,oBAAkB,KAAK;AACvB,oBAAkB,KAAK;AAEvB,QAAM,gBAAgB;AAAA,IACpB,MAAM;AAAA,IACN,CAAC,cAAc,UAAU;AAAA,IACzB;AAAA,EACF;AACA,iBAAe,MAAM,gBAAgB,cAAc,KAAK,GAAG,kBAAkB,YAAY;AACzF,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,aAAa,cAAc,OAAO,GAAG;AAC9C,mBAAe,UAAU,aAAa,aAAa;AACnD,mBAAe,UAAU,WAAW,4BAA4B,UAAU,WAAW,GAAG;AACxF,QAAI,SAAS,IAAI,UAAU,SAAS,GAAG;AACrC,YAAM,IAAI;AAAA,QACR,+CAA+C,UAAU,SAAS;AAAA,MAEpE;AAAA,IACF;AACA,aAAS,IAAI,UAAU,SAAS;AAChC,QAAI,OAAO,UAAU,uBAAuB,WAAW;AACrD,YAAM,IAAI;AAAA,QACR,+CAA+C,UAAU,WAAW;AAAA,MACtE;AAAA,IACF;AAAA,EACF;AAEA,QAAM,iBAAiB,IAAI,IAAI,MAAM,eAAe,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;AACnF,QAAM,gBAAgB;AAAA,IACpB,MAAM;AAAA,IACN,CAAC,cAAc,UAAU;AAAA,IACzB;AAAA,EACF;AACA,iBAAe,MAAM,gBAAgB,cAAc,KAAK,GAAG,kBAAkB,YAAY;AACzF,MAAI,CAAC,cAAc,IAAI,MAAM,mBAAmB,GAAG;AACjD,UAAM,IAAI;AAAA,MACR,iEAAiE,MAAM,mBAAmB;AAAA,IAC5F;AAAA,EACF;AAEA,QAAM,wBAAwB,oBAAI,IAAmC;AACrE,QAAM,oBAAoB,oBAAI,IAAmC;AACjE,aAAW,aAAa,cAAc,OAAO,GAAG;AAC9C,sBAAkB,WAAW,eAAe,gBAAgB,MAAM,mBAAmB;AACrF,UAAM,MAAM,4BAA4B,UAAU,YAAY;AAC9D,UAAM,YAAY,sBAAsB,IAAI,GAAG;AAC/C,QAAI,WAAW;AACb,YAAM,IAAI;AAAA,QACR,gDAAgD,UAAU,WAAW,UAC/D,UAAU,WAAW;AAAA,MAC7B;AAAA,IACF;AACA,0BAAsB,IAAI,KAAK,SAAS;AACxC,QAAI,UAAU,aAAa,WAAW,GAAG;AACvC,wBAAkB,IAAI,UAAU,aAAa,CAAC,GAAI,SAAS;AAAA,IAC7D;AAAA,EACF;AACA,QAAM,WAAW,cAAc,IAAI,MAAM,mBAAmB;AAC5D,MAAI,SAAS,aAAa,WAAW,GAAG;AACtC,UAAM,IAAI;AAAA,MACR,8CAA8C,SAAS,WAAW;AAAA,IACpE;AAAA,EACF;AACA,aAAW,eAAe,MAAM,gBAAgB;AAC9C,QAAI,CAAC,kBAAkB,IAAI,WAAW,GAAG;AACvC,YAAM,IAAI;AAAA,QACR,+EAA+E,WAAW;AAAA,MAC5F;AAAA,IACF;AAAA,EACF;AACA,WAAS,OAAO,GAAG,OAAO,MAAM,eAAe,QAAQ,QAAQ;AAC7D,aAAS,QAAQ,OAAO,GAAG,QAAQ,MAAM,eAAe,QAAQ,SAAS;AACvE,YAAM,MAAM,CAAC,MAAM,eAAe,IAAI,GAAI,MAAM,eAAe,KAAK,CAAE;AACtE,UAAI,CAAC,sBAAsB,IAAI,4BAA4B,GAAG,CAAC,GAAG;AAChE,cAAM,IAAI;AAAA,UACR,2EAA2E,IAAI,KAAK,IAAI,CAAC;AAAA,QAC3F;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,kBAAkB,oBAAI,IAA+B;AAC3D,QAAM,UAAU,IAAI,IAAI,MAAM,SAAS;AACvC,aAAW,OAAO,MAAM,MAAM;AAC5B,UAAM,YAAY,cAAc,IAAI,IAAI,WAAW;AACnD,QAAI,CAAC,WAAW;AACd,YAAM,IAAI;AAAA,QACR,kDAAkD,IAAI,MAAM,8BAA8B,IAAI,WAAW;AAAA,MAC3G;AAAA,IACF;AACA,QAAI,CAAC,QAAQ,IAAI,IAAI,MAAM,GAAG;AAC5B,YAAM,IAAI;AAAA,QACR,uDAAuD,IAAI,WAAW,iBAAiB,IAAI,MAAM;AAAA,MAEnG;AAAA,IACF;AACA,gBAAY,OAAO,KAAK,SAAS;AACjC,UAAM,SAAS,gBAAgB,IAAI,IAAI,WAAW,KAAK,oBAAI,IAAkB;AAC7E,QAAI,OAAO,IAAI,IAAI,MAAM,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,iEAAiE,IAAI,WAAW,eAAe,IAAI,MAAM;AAAA,MAC3G;AAAA,IACF;AACA,WAAO,IAAI,IAAI,QAAQ,GAAG;AAC1B,oBAAgB,IAAI,IAAI,aAAa,MAAM;AAAA,EAC7C;AACA,aAAW,eAAe,MAAM,gBAAgB;AAC9C,UAAM,SAAS,gBAAgB,IAAI,WAAW;AAC9C,UAAM,UAAU,MAAM,UAAU,OAAO,CAAC,WAAW,CAAC,QAAQ,IAAI,MAAM,CAAC;AACvE,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,+CAA+C,WAAW,sCACpD,QAAQ,KAAK,IAAI,CAAC;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AACA,QAAM,eAAe,MAAM,eAAe,SAAS,MAAM,UAAU;AACnE,MAAI,MAAM,KAAK,WAAW,cAAc;AACtC,UAAM,IAAI;AAAA,MACR,qDAAqD,YAAY,kCAA+B,MAAM,KAAK,MAAM;AAAA,IACnH;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,YAAY,MAAM,eAAe,IAAI,CAAC,OAAO,cAAc,IAAI,EAAE,CAAE;AAAA,IACnE,YAAY,MAAM,eAAe,IAAI,CAAC,OAAO,cAAc,IAAI,EAAE,CAAE;AAAA,IACnE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,gBAAgB,IAAI,IAAI,MAAM,eAAe,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;AAAA,EAC9E;AACF;AAEO,SAAS,oBACd,SACA,aACQ;AACR,SAAO,QAAQ,MAAM,UAAU,IAAI,CAAC,WAAW,mBAAmB,SAAS,aAAa,MAAM,CAAC;AACjG;AAEO,SAAS,mBACd,SACA,aACA,QACM;AACN,SAAO,QAAQ,gBAAgB,IAAI,WAAW,EAAG,IAAI,MAAM;AAC7D;AAEO,SAAS,gCACd,SACA,cACU;AACV,SAAO,CAAC,GAAG,YAAY,EAAE;AAAA,IACvB,CAAC,MAAM,UAAU,QAAQ,eAAe,IAAI,IAAI,IAAK,QAAQ,eAAe,IAAI,KAAK;AAAA,EACvF;AACF;AAEO,SAAS,4BAA4B,cAAyC;AACnF,SAAO,KAAK,UAAU,YAAY;AACpC;AAEA,SAAS,kBACP,OACM;AACN,QAAM,EAAE,MAAM,WAAW,WAAW,IAAI,MAAM;AAC9C,MAAI,CAAC,OAAO,UAAU,IAAI,GAAG;AAC3B,UAAM,IAAI,gBAAgB,oEAAoE;AAAA,EAChG;AACA,MAAI,CAAC,OAAO,UAAU,SAAS,KAAK,aAAa,GAAG;AAClD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,OAAO,SAAS,UAAU,KAAK,cAAc,KAAK,cAAc,GAAG;AACtE,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,kBACP,OACM;AACN,QAAM,SAAS,MAAM;AACrB,aAAW,CAAC,MAAM,KAAK,KAAK;AAAA,IAC1B,CAAC,sBAAsB,OAAO,kBAAkB;AAAA,IAChD,CAAC,sBAAsB,OAAO,kBAAkB;AAAA,EAClD,GAAY;AACV,QAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,MAAM,UAAU,QAAQ;AAC3E,YAAM,IAAI;AAAA,QACR,8CAA8C,IAAI,6BAA6B,MAAM,UAAU,MAAM;AAAA,MACvG;AAAA,IACF;AAAA,EACF;AACA,MACE,CAAC,OAAO,UAAU,OAAO,uBAAuB,KAChD,OAAO,0BAA0B,KACjC,OAAO,0BAA0B,MAAM,eAAe,QACtD;AACA,UAAM,IAAI;AAAA,MACR,+FACQ,MAAM,eAAe,MAAM;AAAA,IACrC;AAAA,EACF;AACA,aAAW,CAAC,QAAQ,KAAK,KAAK,OAAO,QAAQ,OAAO,gCAAgC,GAAG;AACrF,QAAI,CAAC,MAAM,gBAAgB,SAAS,MAAM,GAAG;AAC3C,YAAM,IAAI;AAAA,QACR,wEAAwE,MAAM;AAAA,MAChF;AAAA,IACF;AACA,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG;AACzC,YAAM,IAAI;AAAA,QACR,0DAA0D,MAAM;AAAA,MAClE;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,kBACP,WACA,eACA,gBACA,qBACM;AACN,iBAAe,UAAU,aAAa,aAAa;AACnD,iBAAe,UAAU,aAAa,8BAA8B,UAAU,WAAW,GAAG;AAC5F,MAAI,CAAC,OAAO,UAAU,UAAU,aAAa,KAAK,UAAU,gBAAgB,GAAG;AAC7E,UAAM,IAAI;AAAA,MACR,iEAAiE,UAAU,WAAW;AAAA,IACxF;AAAA,EACF;AACA,eAAa,UAAU,cAAc,+BAA+B,UAAU,WAAW,GAAG;AAC5F,aAAW,eAAe,UAAU,cAAc;AAChD,QAAI,CAAC,cAAc,IAAI,WAAW,GAAG;AACnC,YAAM,IAAI;AAAA,QACR,+CAA+C,UAAU,WAAW,8BAA8B,WAAW;AAAA,MAC/G;AAAA,IACF;AAAA,EACF;AACA,QAAM,YAAY,CAAC,GAAG,UAAU,YAAY,EAAE;AAAA,IAC5C,CAAC,MAAM,UAAU,eAAe,IAAI,IAAI,IAAK,eAAe,IAAI,KAAK;AAAA,EACvE;AACA,MAAI,CAAC,YAAY,UAAU,cAAc,SAAS,GAAG;AACnD,UAAM,IAAI;AAAA,MACR,+CAA+C,UAAU,WAAW;AAAA,IACtE;AAAA,EACF;AACA,MAAI,UAAU,gBAAgB,uBAAuB,UAAU,aAAa,WAAW,GAAG;AACxF,UAAM,IAAI;AAAA,MACR,mDAAmD,mBAAmB;AAAA,IACxE;AAAA,EACF;AACF;AAEA,SAAS,YACP,OACA,KACA,WACM;AACN,MAAI,CAAC,YAAY,IAAI,cAAc,UAAU,YAAY,GAAG;AAC1D,UAAM,IAAI;AAAA,MACR,yCAAyC,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,IACxE;AAAA,EACF;AACA,MAAI,CAAC,CAAC,YAAY,WAAW,SAAS,EAAE,SAAS,IAAI,YAAY,GAAG;AAClE,UAAM,IAAI;AAAA,MACR,yCAAyC,IAAI,WAAW,IAAI,IAAI,MAAM,+BAA+B,OAAO,IAAI,YAAY,CAAC;AAAA,IAC/H;AAAA,EACF;AACA,MAAI,IAAI,iBAAiB,YAAY;AACnC,QAAI,OAAO,IAAI,SAAS,aAAa,CAAC,OAAO,SAAS,IAAI,KAAK,GAAG;AAChE,YAAM,IAAI;AAAA,QACR,kDAAkD,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,MACjF;AAAA,IACF;AACA,QAAI,IAAI,iBAAiB,MAAM;AAC7B,YAAM,IAAI;AAAA,QACR,kDAAkD,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,MACjF;AAAA,IACF;AAAA,EACF,OAAO;AACL,QAAI,IAAI,SAAS,QAAQ,IAAI,UAAU,MAAM;AAC3C,YAAM,IAAI;AAAA,QACR,oCAAoC,IAAI,YAAY,SAAS,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,MAC5F;AAAA,IACF;AACA,QAAI,OAAO,IAAI,iBAAiB,YAAY,IAAI,aAAa,KAAK,MAAM,IAAI;AAC1E,YAAM,IAAI;AAAA,QACR,oCAAoC,IAAI,YAAY,SAAS,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,MAC5F;AAAA,IACF;AAAA,EACF;AACA;AAAA,IACE,MAAM;AAAA,IACN,OAAO,KAAK,IAAI,IAAI;AAAA,IACpB,sBAAsB,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,IACnD;AAAA,EACF;AACA,aAAW,UAAU,MAAM,iBAAiB;AAC1C,UAAM,QAAQ,IAAI,KAAK,MAAM;AAC7B,QAAI,UAAU,QAAQ,UAAU,UAAa,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,GAAG;AACjF,YAAM,IAAI;AAAA,QACR,6DAA6D,MAAM,aAC7D,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AACA,QAAM,sBAAsB;AAAA,IAC1B,IAAI;AAAA,IACJ,CAAC,aAAa,SAAS;AAAA,IACvB,6BAA6B,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,EAC5D;AACA;AAAA,IACE,UAAU;AAAA,IACV,oBAAoB,KAAK;AAAA,IACzB,6BAA6B,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,IAC1D;AAAA,EACF;AACA,aAAW,YAAY,oBAAoB,OAAO,GAAG;AACnD,mBAAe,SAAS,OAAO,SAAS,GAAG;AAC3C,mBAAe,SAAS,gBAAgB,kBAAkB,GAAG;AAC7D,QAAI,SAAS,mBAAmB,QAAQ,SAAS,UAAU,MAAM;AAC/D,YAAM,IAAI;AAAA,QACR,2FACM,SAAS,WAAW,aAAa,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,MACtE;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,eACP,OACA,OACA,KACM;AACN,MAAI,UAAU,QAAQ,UAAU,SAAS,UAAU,MAAM;AACvD,UAAM,IAAI;AAAA,MACR,oCAAoC,KAAK,YAAY,IAAI,WAAW,IAAI,IAAI,MAAM;AAAA,IACpF;AAAA,EACF;AACF;AAEA,SAAS,YACP,OACA,IACA,OACgB;AAChB,QAAM,SAAS,oBAAI,IAAe;AAClC,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,GAAG,IAAI;AACnB,mBAAe,KAAK,GAAG,KAAK,KAAK;AACjC,QAAI,OAAO,IAAI,GAAG,GAAG;AACnB,YAAM,IAAI,gBAAgB,8CAA8C,KAAK,QAAQ,GAAG,GAAG;AAAA,IAC7F;AACA,WAAO,IAAI,KAAK,IAAI;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,QAA2B,OAAqB;AAC5E,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,gBAAgB,oCAAoC,KAAK,WAAW;AAAA,EAChF;AACA,eAAa,QAAQ,KAAK;AAC1B,aAAW,SAAS,OAAQ,gBAAe,OAAO,KAAK;AACzD;AAEA,SAAS,aAAa,QAA2B,OAAqB;AACpE,MAAI,IAAI,IAAI,MAAM,EAAE,SAAS,OAAO,QAAQ;AAC1C,UAAM,IAAI,gBAAgB,oCAAoC,KAAK,sBAAsB;AAAA,EAC3F;AACF;AAEA,SAAS,eAAe,OAAe,OAAqB;AAC1D,MAAI,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,IAAI;AACpD,UAAM,IAAI;AAAA,MACR,oCAAoC,KAAK;AAAA,IAC3C;AAAA,EACF;AACF;AAEA,SAAS,eACP,UACA,gBACA,aACA,eACM;AACN,QAAM,SAAS,CAAC,GAAG,cAAc;AACjC,QAAM,cAAc,IAAI,IAAI,QAAQ;AACpC,QAAM,YAAY,IAAI,IAAI,MAAM;AAChC,QAAM,UAAU,SAAS,OAAO,CAAC,UAAU,CAAC,UAAU,IAAI,KAAK,CAAC;AAChE,QAAM,QAAQ,OAAO,OAAO,CAAC,UAAU,CAAC,YAAY,IAAI,KAAK,CAAC;AAC9D,MAAI,QAAQ,SAAS,KAAK,MAAM,SAAS,KAAK,OAAO,WAAW,SAAS,QAAQ;AAC/E,UAAM,IAAI;AAAA,MACR,oCAAoC,WAAW,mBAAmB,aAAa,cACjE,QAAQ,KAAK,IAAI,CAAC,aAAa,MAAM,KAAK,IAAI,CAAC;AAAA,IAC/D;AAAA,EACF;AACF;AAEA,SAAS,YAAY,MAAyB,OAAmC;AAC/E,SAAO,KAAK,WAAW,MAAM,UAAU,KAAK,MAAM,CAAC,OAAO,UAAU,UAAU,MAAM,KAAK,CAAC;AAC5F;;;AC1YO,SAAS,gCACd,OACqC;AACrC,QAAM,UAAU,0BAAiB,KAAK;AACtC,QAAM,WAAW,QAAQ,cAAc,IAAI,MAAM,mBAAmB;AAEpE,QAAM,cAAc,QAAQ,WAAW;AAAA,IAAI,CAAC,cAC1C,mBAAmB,SAAS,WAAW,QAAQ;AAAA,EACjD;AACA,QAAM,kBAAkB,YAAY;AAAA,IAClC,CAAC,YAAY,QAAQ,UAAU,gBAAgB,MAAM;AAAA,EACvD;AACA,QAAM,YAAY,YAAY;AAAA,IAAI,CAAC,YACjC,QAAQ,UAAU,gBAAgB,MAAM,sBACpC,UACA;AAAA,MACE,GAAG;AAAA,MACH,aAAa,qBAAqB,SAAS,SAAS,eAAe;AAAA,IACrE;AAAA,EACN;AACA,QAAM,cAAc,IAAI,IAAI,UAAU,IAAI,CAAC,YAAY,CAAC,QAAQ,UAAU,aAAa,OAAO,CAAC,CAAC;AAChG,QAAM,kBAAkB,sBAAsB,SAAS,WAAW;AAClE,QAAM,0BAA0B,8BAA8B,SAAS,WAAW;AAClF,QAAM,WAAW,cAAc,SAAS,aAAa,yBAAyB,eAAe;AAC7F,QAAM,aAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,OAAO,QAAQ,WAAW;AAAA,IAAQ,CAAC,cACvC,MAAM,UAAU;AAAA,MACd,CAAC,WAAW,QAAQ,gBAAgB,IAAI,UAAU,WAAW,EAAG,IAAI,MAAM;AAAA,IAC5E;AAAA,EACF;AAEA,SAAO;AAAA,IACL,SAAS,CAAC,GAAG,MAAM,SAAS;AAAA,IAC5B,cAAc,CAAC,GAAG,MAAM,cAAc;AAAA,IACtC,cAAc,CAAC,GAAG,MAAM,cAAc;AAAA,IACtC,aAAa,CAAC,GAAG,MAAM,eAAe;AAAA,IACtC;AAAA,IACA,iBAAiB,KAAK,OAAO,CAAC,QAAQ,IAAI,iBAAiB,SAAS;AAAA,IACpE,iBAAiB,KAAK,OAAO,CAAC,QAAQ,IAAI,iBAAiB,SAAS;AAAA,IACpE,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,mBACP,SACA,WACA,UAC8B;AAC9B,QAAM,OAAO,oBAAQ,SAAS,UAAU,WAAW;AACnD,QAAM,eAAe,oBAAQ,SAAS,SAAS,WAAW;AAC1D,QAAM,UAAU;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,gBAAgB,SAAS;AAAA,EACrC;AACA,QAAM,iBAAiB,KACpB,OAAO,CAAC,QAAQ,IAAI,iBAAiB,UAAU,EAC/C,IAAI,CAAC,QAAQ,IAAI,KAAe;AACnC,QAAM,QAAQ,OAAO;AAAA,IACnB,QAAQ,MAAM,gBAAgB,IAAI,CAAC,WAAW;AAAA,MAC5C;AAAA,MACA,aAAa,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,MAAM,CAAW,CAAC;AAAA,IAC5D,CAAC;AAAA,EACH;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,OAAO,eAAe,WAAW,IAAI,OAAO,aAAa,cAAc;AAAA,IACvE;AAAA,IACA,QAAQ,2BAA2B,MAAM,UAAU,cAAc,OAAO;AAAA,IACxE,QAAQ,2BAA2B,MAAM,UAAU,cAAc,gBAAgB;AAAA,IACjF,sBACE,UAAU,gBAAgB,SAAS,cAC/B,OACA,iBAAiB,SAAS,SAAS,aAAa,UAAU,WAAW;AAAA,IAC3E,aAAa;AAAA,EACf;AACF;AAEA,SAAS,iBACP,SACA,MACA,cACA,YAC8B;AAC9B,QAAM,kBAA4B,CAAC;AACnC,QAAM,gBAA0B,CAAC;AACjC,QAAM,iBAA2B,CAAC;AAClC,QAAM,iBAA2B,CAAC;AAClC,QAAM,iBAA2B,CAAC;AAClC,QAAM,oBAA8B,CAAC;AACrC,QAAM,2BAAqC,CAAC;AAC5C,WAAS,QAAQ,GAAG,QAAQ,QAAQ,MAAM,UAAU,QAAQ,SAAS;AACnE,UAAM,MAAM,KAAK,KAAK;AACtB,UAAM,WAAW,aAAa,KAAK;AACnC,QAAI,IAAI,iBAAiB,UAAW,gBAAe,KAAK,IAAI,MAAM;AAAA,aACzD,IAAI,iBAAiB,UAAW,gBAAe,KAAK,IAAI,MAAM;AAAA,aAC9D,IAAI,KAAM,iBAAgB,KAAK,IAAI,MAAM;AAAA,QAC7C,eAAc,KAAK,IAAI,MAAM;AAElC,QAAI,WAAY;AAChB,QAAI,IAAI,iBAAiB,cAAc,SAAS,iBAAiB,YAAY;AAC3E,+BAAyB,KAAK,IAAI,MAAM;AAAA,IAC1C,WAAW,IAAI,QAAQ,CAAC,SAAS,KAAM,gBAAe,KAAK,IAAI,MAAM;AAAA,aAC5D,CAAC,IAAI,QAAQ,SAAS,KAAM,mBAAkB,KAAK,IAAI,MAAM;AAAA,EACxE;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,eAAe,SAAS,kBAAkB;AAAA,EACxD;AACF;AAEA,SAAS,2BACP,MACA,cACA,OAC+B;AAC/B,MAAI,aAAa,WAAW,GAAG;AAC7B,WAAO;AAAA,MACL,aAAa,CAAC;AAAA,MACd,oBAAoB,CAAC;AAAA,MACrB,qBAAqB,CAAC;AAAA,MACtB,qBAAqB,CAAC;AAAA,MACtB,mBAAmB,CAAC;AAAA,IACtB;AAAA,EACF;AACA,QAAM,cAA+C,aAAa,IAAI,CAAC,gBAAgB;AACrF,UAAM,kBAA4B,CAAC;AACnC,UAAM,qBAA+B,CAAC;AACtC,UAAMC,qBAA8B,CAAC;AACrC,eAAW,OAAO,MAAM;AACtB,YAAM,QAAQ,cAAc,KAAK,aAAa,KAAK;AACnD,UAAI,UAAU,KAAM,iBAAgB,KAAK,IAAI,MAAM;AAAA,eAC1C,UAAU,MAAO,oBAAmB,KAAK,IAAI,MAAM;AAAA,UACvD,CAAAA,mBAAkB,KAAK,IAAI,MAAM;AAAA,IACxC;AACA,WAAO,EAAE,aAAa,iBAAiB,oBAAoB,mBAAAA,mBAAkB;AAAA,EAC/E,CAAC;AACD,QAAM,qBAA+B,CAAC;AACtC,QAAM,sBAAgC,CAAC;AACvC,QAAM,sBAAgC,CAAC;AACvC,QAAM,oBAA8B,CAAC;AACrC,aAAW,OAAO,MAAM;AACtB,UAAM,SAAS,aAAa,IAAI,CAAC,gBAAgB,cAAc,KAAK,aAAa,KAAK,CAAC;AACvF,QAAI,OAAO,KAAK,CAAC,UAAU,UAAU,IAAI,EAAG,mBAAkB,KAAK,IAAI,MAAM;AAAA,aACpE,OAAO,MAAM,OAAO,EAAG,oBAAmB,KAAK,IAAI,MAAM;AAAA,aACzD,OAAO,KAAK,OAAO,EAAG,qBAAoB,KAAK,IAAI,MAAM;AAAA,QAC7D,qBAAoB,KAAK,IAAI,MAAM;AAAA,EAC1C;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,qBACP,SACA,SACA,UACyB;AACzB,QAAM,UAA6C,CAAC;AACpD,MAAI,QAAQ,QAAQ,eAAe,SAAS,EAAG,SAAQ,KAAK,iBAAiB;AAC7E,MAAI,QAAQ,QAAQ,eAAe,SAAS,EAAG,SAAQ,KAAK,iBAAiB;AAC7E,MAAI,QAAQ,QAAQ,yBAAyB,SAAS,EAAG,SAAQ,KAAK,0BAA0B;AAChG,MAAI,QAAQ,QAAQ,eAAe,UAAU,QAAQ,QAAQ,kBAAkB,QAAQ;AACrF,YAAQ,KAAK,qCAAqC;AAAA,EACpD;AACA;AAAA,IACE;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ,MAAM,UAAU;AAAA,IACxB,QAAQ,MAAM,UAAU;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACA;AAAA,IACE;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ,MAAM,UAAU;AAAA,IACxB,QAAQ,MAAM,UAAU;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACA,MAAI,CAAC,iBAAiB,SAAS,SAAS,QAAQ,EAAG,SAAQ,KAAK,qBAAqB;AACrF,SAAO,EAAE,UAAU,QAAQ,WAAW,GAAG,SAAS,OAAO,OAAO,EAAE;AACpE;AAEA,SAAS,iCACP,SACA,UACA,SACA,iBACA,aACA,kBACM;AACN,MAAI,SAAS,YAAY,KAAK,CAAC,cAAc,UAAU,gBAAgB,SAAS,OAAO,GAAG;AACxF,YAAQ,KAAK,WAAW;AAAA,EAC1B;AACA,MACE,mBACA,SAAS,YAAY,KAAK,CAAC,cAAc,UAAU,kBAAkB,SAAS,CAAC,GAC/E;AACA,YAAQ,KAAK,gBAAgB;AAAA,EAC/B;AACF;AAEA,SAAS,sBACP,SACA,aACgC;AAChC,SAAO,CAAC,GAAG,QAAQ,kBAAkB,OAAO,CAAC,EAC1C,IAAI,CAAC,cAAc,YAAY,IAAI,UAAU,WAAW,CAAE,EAC1D,OAAO,CAAC,YAAY,QAAQ,aAAa,QAAQ,EACjD,KAAK,CAAC,MAAM,UAAU,uBAAuB,SAAS,MAAM,KAAK,CAAC;AACvE;AAOA,SAAS,8BACP,SACA,aACgC;AAChC,SAAO,CAAC,GAAG,QAAQ,kBAAkB,OAAO,CAAC,EAC1C,IAAI,CAAC,cAAc,YAAY,IAAI,UAAU,WAAW,CAAE,EAC1D;AAAA,IACC,CAAC,YACC,QAAQ,QAAQ,kBAAkB,WAAW,KAC7C,QAAQ,aAAa,QAAQ;AAAA,MAC3B,CAAC,WAAW,WAAW;AAAA,IACzB;AAAA,EACJ,EACC,KAAK,CAAC,MAAM,UAAU,uBAAuB,SAAS,MAAM,KAAK,CAAC;AACvE;AAEA,SAAS,uBACP,SACA,MACA,OACQ;AACR,QAAM,eAAe,MAAM,QAAQ,aAAa,KAAK,QAAQ;AAC7D,MAAI,iBAAiB,EAAG,QAAO;AAC/B,QAAM,YAAY,MAAM,QAAQ,eAAe,SAAS,KAAK,QAAQ,eAAe;AACpF,MAAI,cAAc,EAAG,QAAO;AAC5B,QAAM,eACJ,KAAK,QAAQ,kBAAkB,SAAS,MAAM,QAAQ,kBAAkB;AAC1E,MAAI,iBAAiB,EAAG,QAAO;AAC/B,aAAW,UAAU,QAAQ,MAAM,iBAAiB;AAClD,UAAM,SAAS,KAAK,MAAM,MAAM,EAAG,SAAS,MAAM,MAAM,MAAM,EAAG;AACjE,QAAI,WAAW,EAAG,QAAO;AAAA,EAC3B;AACA,QAAM,UAAU,KAAK,UAAU,gBAAgB,MAAM,UAAU;AAC/D,MAAI,YAAY,EAAG,QAAO;AAC1B,SACE,QAAQ,eAAe,IAAI,KAAK,UAAU,WAAW,IACrD,QAAQ,eAAe,IAAI,MAAM,UAAU,WAAW;AAE1D;AAEA,SAAS,cACP,SACA,aACA,yBACA,UAC6B;AAC7B,QAAM,sBAAsB,IAAI;AAAA,IAC9B,wBAAwB,IAAI,CAAC,YAAY,QAAQ,UAAU,WAAW;AAAA,EACxE;AACA,QAAM,UAAuC,CAAC;AAC9C,WAAS,YAAY,GAAG,YAAY,QAAQ,WAAW,QAAQ,aAAa;AAC1E,aAAS,aAAa,YAAY,GAAG,aAAa,QAAQ,WAAW,QAAQ,cAAc;AACzF,YAAM,gBAAgB,QAAQ,WAAW,SAAS;AAClD,YAAM,iBAAiB,QAAQ,WAAW,UAAU;AACpD,YAAM,aAAa,QAAQ,kBAAkB,IAAI,cAAc,WAAW;AAC1E,YAAM,cAAc,QAAQ,kBAAkB,IAAI,eAAe,WAAW;AAC5E,YAAM,OAAO,QAAQ,sBAAsB;AAAA,QACzC,4BAAgB,CAAC,cAAc,aAAa,eAAe,WAAW,CAAC;AAAA,MACzE;AACA,YAAM,cAAc,YAAY,IAAI,KAAK,WAAW;AACpD,YAAM,cAAc,YAAY,IAAI,WAAW,WAAW;AAC1D,YAAM,eAAe,YAAY,IAAI,YAAY,WAAW;AAC5D,YAAM,iBAA2B,CAAC;AAClC,YAAM,sBAAgC,CAAC;AACvC,iBAAW,UAAU,QAAQ,MAAM,WAAW;AAC5C,cAAM,UAAU,mBAAO,SAAS,KAAK,aAAa,MAAM;AACxD,cAAM,UAAU,mBAAO,SAAS,WAAW,aAAa,MAAM;AAC9D,cAAM,WAAW,mBAAO,SAAS,YAAY,aAAa,MAAM;AAChE,YAAI,CAAC,CAAC,SAAS,SAAS,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,iBAAiB,UAAU,EAAG;AACnF,YAAI,QAAQ,QAAQ,CAAC,QAAQ,QAAQ,CAAC,SAAS,KAAM,gBAAe,KAAK,MAAM;AAC/E,YAAI,CAAC,QAAQ,SAAS,QAAQ,QAAQ,SAAS,MAAO,qBAAoB,KAAK,MAAM;AAAA,MACvF;AACA,YAAM,4BAGF;AAAA,QACF,kBAAkB,SAAS,aAAa,WAAW,aAAa,KAAK,WAAW;AAAA,QAChF,kBAAkB,SAAS,aAAa,YAAY,aAAa,KAAK,WAAW;AAAA,MACnF;AACA,YAAM,eACJ,uBAAuB,SAAS,aAAa,YAAY,KAAK,IAAI,cAAc;AAClF,YAAM,SAAS;AAAA,QACb,oBAAQ,SAAS,KAAK,WAAW;AAAA,QACjC,cAAc;AAAA,QACd,eAAe;AAAA,QACf;AAAA,MACF;AACA,YAAM,SAAS;AAAA,QACb,oBAAQ,SAAS,KAAK,WAAW;AAAA,QACjC,cAAc;AAAA,QACd,eAAe;AAAA,QACf;AAAA,MACF;AACA,YAAM,gBAAgB;AAAA,QACpB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,oBAAoB,IAAI,WAAW,WAAW,KAC5C,oBAAoB,IAAI,YAAY,WAAW;AAAA,QACjD;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,cAAQ,KAAK;AAAA,QACX,cAAc,CAAC,cAAc,aAAa,eAAe,WAAW;AAAA,QACpE,oBAAoB,CAAC,WAAW,aAAa,YAAY,WAAW;AAAA,QACpE,wBAAwB,KAAK;AAAA,QAC7B,gBAAgB,CAAC,GAAG,YAAY,QAAQ,cAAc;AAAA,QACtD,mBAAmB,CAAC,GAAG,YAAY,QAAQ,iBAAiB;AAAA,QAC5D;AAAA,QACA;AAAA,QACA;AAAA,QACA,wBAAwB,cAAc,SAAS,aAAa,QAAQ;AAAA,QACpE;AAAA,QACA;AAAA,QACA,aAAa;AAAA,UACX;AAAA,UACA,SAAS;AAAA,UACT,CAAC,YAAY,WAAW;AAAA,UACxB;AAAA,QACF;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,kBACP,SACA,MACA,UACA,cACA,aACA,mBACA,qBACA,QACA,QAC+B;AAC/B,QAAM,UAAmD,CAAC;AAC1D,MAAI,CAAC,kBAAmB,SAAQ,KAAK,uBAAuB;AAC5D,MACE,KAAK,QAAQ,eAAe,SAAS,KACrC,KAAK,QAAQ,eAAe,SAAS,KACrC,KAAK,QAAQ,yBAAyB,SAAS,GAC/C;AACA,YAAQ,KAAK,iBAAiB;AAAA,EAChC;AACA,MAAI,KAAK,QAAQ,kBAAkB,SAAS,EAAG,SAAQ,KAAK,qBAAqB;AACjF,MAAI,oBAAoB,SAAS,EAAG,SAAQ,KAAK,cAAc;AAC/D,QAAM,mBAAmB,YAAY;AAAA,IACnC,CAAC,eAAe,WAAW,0BAA0B,aAAa,UAAU;AAAA,EAC9E;AACA,MAAI,iBAAiB,YAAY,WAAW,EAAG,SAAQ,KAAK,2BAA2B;AACvF;AAAA,IACE;AAAA,IACA;AAAA,IACA,QAAQ,MAAM,UAAU;AAAA,IACxB,QAAQ,MAAM,UAAU;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACA;AAAA,IACE;AAAA,IACA;AAAA,IACA,QAAQ,MAAM,UAAU;AAAA,IACxB,QAAQ,MAAM,UAAU;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACA,MAAI,CAAC,iBAAiB,SAAS,MAAM,QAAQ,EAAG,SAAQ,KAAK,qBAAqB;AAClF,SAAO;AAAA,IACL,YAAY,QAAQ,WAAW;AAAA,IAC/B,SAAS,OAAO,OAAO;AAAA,IACvB,yBAAyB,aAAa,UAAU;AAAA,EAClD;AACF;AAEA,SAAS,0BACP,SACA,UACA,SACA,iBACA,aACA,kBACM;AACN,QAAM,eAAe,SAAS,YAAY,SAAS,SAAS,gBAAgB;AAC5E,QAAM,gBAAgB,SAAS,YAAY,SAAS,SAAS,iBAAiB;AAC9E,MAAI,eAAe,WAAW,gBAAgB,QAAS,SAAQ,KAAK,WAAW;AAC/E,MAAI,mBAAmB,SAAS,kBAAkB,SAAS,EAAG,SAAQ,KAAK,gBAAgB;AAC7F;AAEA,SAAS,kBACP,SACA,UACA,SACA,aAC+B;AAC/B,QAAM,UAAU,QAAQ,MAAM,UAAU,IAAI,CAAC,WAAW;AACtD,UAAM,cAAc,mBAAO,SAAS,SAAS,aAAa,MAAM;AAChE,UAAM,aAAa,QAAQ,IAAI,CAAC,WAAW,mBAAO,SAAS,OAAO,aAAa,MAAM,CAAC;AACtF,UAAM,iBAAiB,mBAAO,SAAS,YAAY,aAAa,MAAM;AACtE,UAAM,OAAO,CAAC,aAAa,GAAG,YAAY,cAAc;AACxD,QAAI,CAAC,KAAK,MAAM,CAAC,QAAQ,IAAI,iBAAiB,UAAU,GAAG;AACzD,aAAO,EAAE,QAAQ,iBAAiB,MAAM,kBAAkB,KAAK;AAAA,IACjE;AACA,UAAM,eACJ,WAAW,OAAO,CAAC,KAAK,QAAQ,MAAM,OAAO,IAAI,IAAI,GAAG,CAAC,KACxD,QAAQ,SAAS,KAAK,OAAO,YAAY,IAAI;AAChD,UAAM,gBACJ,WAAW,OAAO,CAAC,KAAK,QAAQ,MAAO,IAAI,OAAkB,CAAC,KAC7D,QAAQ,SAAS,KAAM,YAAY;AACtC,WAAO;AAAA,MACL;AAAA,MACA,iBAAiB,OAAO,eAAe,IAAI,IAAI;AAAA,MAC/C,kBAAmB,eAAe,QAAmB;AAAA,IACvD;AAAA,EACF,CAAC;AACD,QAAM,WAAW,QAAQ;AAAA,IACvB,CAAC,QACC,IAAI,oBAAoB,QAAQ,IAAI,qBAAqB;AAAA,EAC7D;AACA,QAAM,mBAAmB,SAAS,IAAI,CAAC,QAAQ,IAAI,eAAe;AAClE,QAAM,oBAAoB,SAAS,IAAI,CAAC,QAAQ,IAAI,gBAAgB;AACpE,SAAO;AAAA,IACL;AAAA,IACA,GAAG,SAAS;AAAA,IACZ,UAAU,QAAQ,SAAS,SAAS;AAAA,IACpC,qBAAqB,WAAW,gBAAgB;AAAA,IAChD,sBAAsB,WAAW,iBAAiB;AAAA,IAClD,eAAe,qBAAqB,kBAAkB,OAAO;AAAA,IAC7D,gBAAgB,qBAAqB,mBAAmB,OAAO;AAAA,EACjE;AACF;AAEA,SAAS,qBACP,cACA,SACA;AACA,MAAI,aAAa,WAAW,EAAG,QAAO;AACtC,SAAO,gBAAgB,IAAI,MAAM,aAAa,MAAM,EAAE,KAAK,CAAC,GAAG,cAAc;AAAA,IAC3E,GAAG,QAAQ,MAAM;AAAA,IACjB,WAAW;AAAA,EACb,CAAC;AACH;AAEA,SAAS,iBACP,SACA,aACA,iBACA,yBACA,UACwB;AACxB,QAAM,oBAAoB,gBAAgB,OAAO,CAAC,YAAY;AAC5D,UAAM,cAAc,QAAQ,UAAU,aAAa,CAAC;AACpD,WAAO,QAAQ,cAAc,IAAI,WAAW,EAAG;AAAA,EACjD,CAAC;AACD,QAAM,UAAsC,kBAAkB,IAAI,CAAC,SAAS,WAAW;AAAA,IACrF,MAAM,QAAQ;AAAA,IACd,aAAa,QAAQ,UAAU;AAAA,IAC/B,aAAa,QAAQ,UAAU,aAAa,CAAC;AAAA,EAC/C,EAAE;AACF,QAAM,OAAO,kBAAkB,CAAC;AAChC,QAAM,aAAa,OACf;AAAA,IACE,aAAa,KAAK,UAAU;AAAA,IAC5B,aAAa,KAAK,UAAU,aAAa,CAAC;AAAA,IAC1C;AAAA,EACF,IACA;AACJ,QAAM,aAAa,iBAAiB,SAAS,eAAe;AAC5D,QAAM,mBAAmB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,EAAE,YAAY,YAAY,iBAAiB;AACpD;AAEA,SAAS,iBACP,SACA,iBACwC;AACxC,MAAI,gBAAgB,WAAW,EAAG,QAAO;AACzC,QAAM,eAAe,gBAClB,IAAI,CAAC,YAAY,QAAQ,UAAU,aAAa,CAAC,CAAE,EACnD,KAAK,CAAC,MAAM,UAAU,QAAQ,eAAe,IAAI,IAAI,IAAK,QAAQ,eAAe,IAAI,KAAK,CAAE;AAC/F,QAAM,YAAY,QAAQ,sBAAsB,IAAI,4BAAgB,YAAY,CAAC;AACjF,MAAI,CAAC,WAAW;AACd,UAAM,IAAI;AAAA,MACR,iDAAiD,aAAa,KAAK,IAAI,CAAC;AAAA,IAC1E;AAAA,EACF;AACA,SAAO,EAAE,aAAa,UAAU,aAAa,aAAa;AAC5D;AAEA,SAAS,uBACP,SACA,aACA,yBACA,UAC8C;AAC9C,QAAM,WAAW,YAAY,IAAI,QAAQ,MAAM,mBAAmB;AAClE,QAAM,mBAAmB,IAAI;AAAA,IAC3B,SAAS,IAAI,CAAC,UAAU,CAAC,4BAAgB,MAAM,YAAY,GAAG,KAAK,CAAC;AAAA,EACtE;AACA,QAAM,QAAQ,SACX,OAAO,CAAC,UAAU,MAAM,cAAc,UAAU,EAChD;AAAA,IAAI,CAAC,UACJ;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY,IAAI,MAAM,sBAAsB;AAAA,IAC9C;AAAA,EACF;AACF,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,QAAM,YAAY,MACf,OAAO,CAAC,SAAS,KAAK,SAAS,EAC/B,KAAK,CAAC,MAAM,UAAU,wBAAwB,SAAS,aAAa,MAAM,KAAK,CAAC;AACnF,QAAM,UACJ,UAAU,CAAC,KACX,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,MAAM,UAAU,wBAAwB,SAAS,aAAa,MAAM,KAAK,CAAC,EAAE,CAAC;AAChG,SAAO;AAAA,IACL,iBAAiB,QAAQ;AAAA,IACzB,qBAAqB,QAAQ;AAAA,IAC7B,sBAAsB,CAAC,GAAG,QAAQ,oBAAoB;AAAA,IACtD,qBAAqB,UAAU,SAAS,IAAI,QAAQ,sBAAsB;AAAA,IAC1E,WAAW,UAAU,SAAS;AAAA,IAC9B,gBAAgB;AAAA,IAChB,OAAO,QAAQ;AAAA,EACjB;AACF;AAEA,SAAS,oBACP,SACA,aACA,yBACA,kBACA,UACA,MAC6B;AAC7B,MAAI,UAAU;AACd,MAAI,WAAW,CAAC,GAAG,KAAK,UAAU,YAAY;AAC9C,MAAI,YAAY,wBAAwB;AAAA,IACtC,CAAC,YAAY,CAAC,SAAS,SAAS,QAAQ,UAAU,aAAa,CAAC,CAAE;AAAA,EACpE;AACA,QAAM,QAAuC,CAAC;AAE9C,SAAO,UAAU,SAAS,GAAG;AAC3B,UAAM,YAAY,UAAU;AAAA,MAAI,CAAC,aAC/B;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,UAAM,WAAW,UACd,OAAO,CAAC,aAAa,SAAS,QAAQ,EACtC,KAAK,CAAC,MAAM,UAAU,yBAAyB,SAAS,aAAa,MAAM,KAAK,CAAC;AACpF,UAAM,WAAW,SAAS,CAAC;AAC3B,QAAI,SAAU,UAAS,WAAW;AAClC,UAAM,KAAK;AAAA,MACT,iBAAiB,QAAQ,UAAU;AAAA,MACnC,sBAAsB,CAAC,GAAG,QAAQ;AAAA,MAClC,YAAY,UAAU;AAAA,QACpB,CAAC,MAAM,UACL,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB;AAAA,MACxD;AAAA,MACA,qBAAqB,UAAU,qBAAqB;AAAA,IACtD,CAAC;AACD,QAAI,CAAC,UAAU,kBAAmB;AAClC,cAAU,YAAY,IAAI,SAAS,iBAAiB;AACpD,eAAW,CAAC,GAAG,QAAQ,UAAU,YAAY;AAC7C,gBAAY,UAAU;AAAA,MACpB,CAAC,YAAY,QAAQ,UAAU,gBAAgB,SAAS;AAAA,IAC1D;AAAA,EACF;AAEA,QAAM,YAAY,SAAS,UAAU,QAAQ,MAAM,UAAU;AAC7D,SAAO;AAAA,IACL,iBAAiB,KAAK,UAAU;AAAA,IAChC,qBAAqB,QAAQ,UAAU;AAAA,IACvC,sBAAsB;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,wBACP,SACA,aACA,MACA,OACQ;AACR,QAAM,cAAc,YAAY,IAAI,KAAK,mBAAmB;AAC5D,QAAM,eAAe,YAAY,IAAI,MAAM,mBAAmB;AAC9D,QAAM,eAAe,aAAa,QAAQ,aAAa,YAAY,QAAQ;AAC3E,MAAI,iBAAiB,EAAG,QAAO;AAC/B,QAAM,YACJ,aAAa,QAAQ,eAAe,SAAS,YAAY,QAAQ,eAAe;AAClF,MAAI,cAAc,EAAG,QAAO;AAC5B,QAAM,eACJ,YAAY,QAAQ,kBAAkB,SAAS,aAAa,QAAQ,kBAAkB;AACxF,MAAI,iBAAiB,EAAG,QAAO;AAC/B,aAAW,UAAU,QAAQ,MAAM,iBAAiB;AAClD,UAAM,SAAS,YAAY,MAAM,MAAM,EAAG,SAAS,aAAa,MAAM,MAAM,EAAG;AAC/E,QAAI,WAAW,EAAG,QAAO;AAAA,EAC3B;AACA,QAAM,UAAU,YAAY,UAAU,gBAAgB,aAAa,UAAU;AAC7E,MAAI,YAAY,EAAG,QAAO;AAC1B,QAAM,mBACJ,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB;AACtD,MAAI,qBAAqB,EAAG,QAAO;AACnC,SACE,QAAQ,eAAe,IAAI,KAAK,eAAe,IAC/C,QAAQ,eAAe,IAAI,MAAM,eAAe;AAEpD;AAEA,SAAS,iBACP,SACA,aACA,kBACA,UACA,SACA,UACA,UAC8B;AAC9B,QAAM,sBAAsB,SAAS,UAAU,aAAa,CAAC;AAC7D,QAAM,UAAiD,CAAC;AACxD,aAAW,uBAAuB,UAAU;AAC1C,UAAM,OAAO,iBAAiB;AAAA,MAC5B,4BAAgB,gCAAoB,SAAS,CAAC,qBAAqB,mBAAmB,CAAC,CAAC;AAAA,IAC1F;AACA,QAAI,CAAC,MAAM,cAAc,WAAY,SAAQ,KAAK,mBAAmB;AAAA,EACvE;AACA,QAAM,mBAAmB,gCAAoB,SAAS,CAAC,GAAG,UAAU,mBAAmB,CAAC;AACxF,QAAM,SAAS,QAAQ,sBAAsB,IAAI,4BAAgB,gBAAgB,CAAC;AAClF,MAAI,CAAC,QAAQ;AACX,YAAQ,KAAK,2BAA2B;AACxC,WAAO,sBAAsB,UAAU,qBAAqB,OAAO;AAAA,EACrE;AACA,QAAM,gBAAgB,YAAY,IAAI,OAAO,WAAW;AACxD,MACE,cAAc,QAAQ,eAAe,SAAS,KAC9C,cAAc,QAAQ,eAAe,SAAS,KAC9C,cAAc,QAAQ,yBAAyB,SAAS,GACxD;AACA,YAAQ,KAAK,mBAAmB;AAAA,EAClC;AACA,MAAI,cAAc,QAAQ,kBAAkB,SAAS,EAAG,SAAQ,KAAK,qBAAqB;AAC1F,QAAM,aAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA,QAAQ,UAAU;AAAA,IAClB,OAAO;AAAA,EACT;AACA,MAAI,WAAW,YAAY,WAAW,EAAG,SAAQ,KAAK,2BAA2B;AACjF,MAAI,WAAW,kBAAkB,SAAS,EAAG,SAAQ,KAAK,wBAAwB;AAClF;AAAA,IACE;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,MAAM,UAAU;AAAA,IACxB,QAAQ,MAAM,UAAU;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACA;AAAA,IACE;AAAA,IACA,cAAc;AAAA,IACd,QAAQ,MAAM,UAAU;AAAA,IACxB,QAAQ,MAAM,UAAU;AAAA,IACxB;AAAA,IACA;AAAA,EACF;AACA,MAAI,CAAC,iBAAiB,SAAS,eAAe,QAAQ,EAAG,SAAQ,KAAK,qBAAqB;AAC3F,SAAO;AAAA,IACL,qBAAqB,SAAS,UAAU;AAAA,IACxC;AAAA,IACA,mBAAmB,OAAO;AAAA,IAC1B,8BAA8B,WAAW;AAAA,IACzC,8BAA8B,WAAW;AAAA,IACzC,uBAAuB,OAAO;AAAA,MAC5B,QAAQ,MAAM,gBAAgB,IAAI,CAAC,WAAW;AAAA,QAC5C;AAAA,QACA,cAAc,MAAM,MAAM,EAAG,SAAS,QAAQ,MAAM,MAAM,EAAG;AAAA,MAC/D,CAAC;AAAA,IACH;AAAA,IACA,UAAU,QAAQ,WAAW;AAAA,IAC7B,UAAU;AAAA,IACV,SAAS,OAAO,OAAO;AAAA,EACzB;AACF;AAEA,SAAS,sBACP,UACA,qBACA,SAC8B;AAC9B,SAAO;AAAA,IACL,qBAAqB,SAAS,UAAU;AAAA,IACxC;AAAA,IACA,mBAAmB;AAAA,IACnB,8BAA8B,CAAC;AAAA,IAC/B,8BAA8B,CAAC;AAAA,IAC/B,uBAAuB;AAAA,IACvB,UAAU;AAAA,IACV,UAAU;AAAA,IACV,SAAS,OAAO,OAAO;AAAA,EACzB;AACF;AAEA,SAAS,4BACP,SACA,UACA,SACA,iBACA,aACA,kBACM;AACN,MAAI,SAAS,YAAY,KAAK,CAAC,cAAc,UAAU,gBAAgB,SAAS,OAAO,GAAG;AACxF,YAAQ,KAAK,WAAW;AAAA,EAC1B;AACA,MACE,mBACA,SAAS,YAAY,KAAK,CAAC,cAAc,UAAU,kBAAkB,SAAS,CAAC,GAC/E;AACA,YAAQ,KAAK,gBAAgB;AAAA,EAC/B;AACF;AAEA,SAAS,yBACP,SACA,aACA,MACA,OACQ;AACR,QAAM,SACJ,MAAM,6BAA6B,SAAS,KAAK,6BAA6B;AAChF,MAAI,WAAW,EAAG,QAAO;AACzB,aAAW,UAAU,QAAQ,MAAM,iBAAiB;AAClD,UAAM,SAAS,KAAK,sBAAuB,MAAM,IAAK,MAAM,sBAAuB,MAAM;AACzF,QAAI,WAAW,EAAG,QAAO;AAAA,EAC3B;AACA,QAAM,YAAY,YAAY,IAAI,KAAK,mBAAmB,EAAG,UAAU;AACvE,QAAM,aAAa,YAAY,IAAI,MAAM,mBAAmB,EAAG,UAAU;AACzE,QAAM,UAAU,YAAY;AAC5B,MAAI,YAAY,EAAG,QAAO;AAC1B,SACE,QAAQ,eAAe,IAAI,KAAK,mBAAmB,IACnD,QAAQ,eAAe,IAAI,MAAM,mBAAmB;AAExD;AAEA,SAAS,kBACP,SACA,aACA,uBACA,sBACiC;AACjC,QAAM,cAAwB,CAAC;AAC/B,QAAM,oBAA8B,CAAC;AACrC,QAAM,iBAA2B,CAAC;AAClC,aAAW,UAAU,QAAQ,MAAM,WAAW;AAC5C,UAAM,aAAa,mBAAO,SAAS,uBAAuB,MAAM;AAChE,UAAM,YAAY,mBAAO,SAAS,sBAAsB,MAAM;AAC9D,QAAI,WAAW,iBAAiB,cAAc,UAAU,iBAAiB,YAAY;AACnF,qBAAe,KAAK,MAAM;AAAA,IAC5B,WAAW,UAAU,QAAQ,CAAC,WAAW,KAAM,aAAY,KAAK,MAAM;AAAA,aAC7D,CAAC,UAAU,QAAQ,WAAW,KAAM,mBAAkB,KAAK,MAAM;AAAA,EAC5E;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,iBAAiB,SAAS,uBAAuB,oBAAoB;AAAA,IAC7E,cAAc;AAAA,MACZ;AAAA,MACA,YAAY,IAAI,oBAAoB;AAAA,MACpC,YAAY,IAAI,qBAAqB;AAAA,IACvC;AAAA,EACF;AACF;AAEA,SAAS,iBACP,SACA,uBACA,sBACsB;AACtB,QAAM,OAAuB,CAAC;AAC9B,aAAW,UAAU,QAAQ,MAAM,WAAW;AAC5C,SAAK,KAAK,eAAe,SAAS,mBAAO,SAAS,uBAAuB,MAAM,CAAC,CAAC;AACjF,SAAK,KAAK,eAAe,SAAS,mBAAO,SAAS,sBAAsB,MAAM,CAAC,CAAC;AAAA,EAClF;AACA,SAAO,kBAAkB,MAAM;AAAA,IAC7B,aAAa;AAAA,IACb,cAAc;AAAA,IACd,aAAa,CAAC,SAAS,GAAG,QAAQ,MAAM,eAAe;AAAA,IACvD,WAAW,EAAE,GAAG,QAAQ,MAAM,WAAW,WAAW,OAAO;AAAA,EAC7D,CAAC;AACH;AAEA,SAAS,eACP,SACA,KACc;AACd,QAAM,UAAkC,OAAO;AAAA,IAC7C,QAAQ,MAAM,gBAAgB,IAAI,CAAC,WAAW,CAAC,QAAQ,IAAI,KAAK,MAAM,CAAW,CAAC;AAAA,EACpF;AACA,MAAI,IAAI,iBAAiB,WAAY,SAAQ,QAAQ,IAAI;AACzD,SAAO;AAAA,IACL,SAAS,IAAI;AAAA,IACb,KAAK,IAAI;AAAA,IACT,GAAI,IAAI,iBAAiB,aAAa,EAAE,MAAM,IAAI,KAAgB,IAAI,CAAC;AAAA,IACvE;AAAA,EACF;AACF;AAEA,SAAS,sBACP,MACA,iBACA,kBACA,OAC0B;AAC1B,QAAM,cAAwB,CAAC;AAC/B,QAAM,kBAA4B,CAAC;AACnC,QAAM,mBAA6B,CAAC;AACpC,QAAM,iBAA2B,CAAC;AAClC,QAAM,oBAA8B,CAAC;AACrC,aAAW,OAAO,MAAM;AACtB,UAAM,OAAO,cAAc,KAAK,iBAAiB,KAAK;AACtD,UAAM,QAAQ,cAAc,KAAK,kBAAkB,KAAK;AACxD,QAAI,SAAS,QAAQ,UAAU,KAAM,mBAAkB,KAAK,IAAI,MAAM;AAAA,aAC7D,QAAQ,MAAO,aAAY,KAAK,IAAI,MAAM;AAAA,aAC1C,KAAM,iBAAgB,KAAK,IAAI,MAAM;AAAA,aACrC,MAAO,kBAAiB,KAAK,IAAI,MAAM;AAAA,QAC3C,gBAAe,KAAK,IAAI,MAAM;AAAA,EACrC;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,cACP,SACA,WACA,YAC0C;AAC1C,SAAO,OAAO;AAAA,IACZ,QAAQ,MAAM,gBAAgB,IAAI,CAAC,WAAW;AAC5C,YAAM,kBAAkB,UAAU,MAAM,MAAM,EAAG;AACjD,YAAM,mBAAmB,WAAW,MAAM,MAAM,EAAG;AACnD,aAAO;AAAA,QACL;AAAA,QACA;AAAA,UACE;AAAA,UACA;AAAA,UACA,aAAa,kBAAkB;AAAA,UAC/B,aACE,qBAAqB,IACjB,oBAAoB,IAClB,IACA,OACF,kBAAkB;AAAA,QAC1B;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AACF;AAEA,SAAS,iBACP,SACA,WACA,UACS;AACT,QAAMC,YAAW,cAAc,SAAS,WAAW,QAAQ;AAC3D,SAAO,OAAO,QAAQ,QAAQ,MAAM,UAAU,gCAAgC,EAAE;AAAA,IAC9E,CAAC,CAAC,QAAQ,KAAK,MAAM;AACnB,YAAM,QAAQA,UAAS,MAAM,EAAG;AAChC,aAAO,UAAU,QAAQ,SAAS;AAAA,IACpC;AAAA,EACF;AACF;AAEA,SAAS,aAAa,QAA4C;AAChE,QAAM,SAAS,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;AAC7D,QAAM,QAAQ,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC;AAC1D,QAAM,SAAS,KAAK,MAAM,OAAO,SAAS,CAAC;AAC3C,QAAM,SACJ,OAAO,SAAS,MAAM,IAAI,OAAO,MAAM,KAAM,OAAO,SAAS,CAAC,IAAK,OAAO,MAAM,KAAM;AACxF,SAAO;AAAA,IACL,GAAG,OAAO;AAAA,IACV,KAAK,OAAO,CAAC;AAAA,IACb;AAAA,IACA,MAAM,QAAQ,OAAO;AAAA,IACrB,KAAK,OAAO,OAAO,SAAS,CAAC;AAAA,IAC7B;AAAA,EACF;AACF;AAEA,SAAS,cACP,KACA,aACA,OACgB;AAChB,SAAO,IAAI,kBAAkB,KAAK,CAAC,aAAa,SAAS,gBAAgB,WAAW,EAAG,KAAK;AAC9F;AAEA,SAAS,WAAW,QAAiC;AACnD,SAAO,OAAO,WAAW,IAAI,OAAO,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;AAC7F;AAEA,SAAS,OAAU,QAAkB;AACnC,SAAO,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AAC5B;;;AC//BA,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,YAAY,aAAa,cAAc,gBAAgB;AAChE,SAAS,YAAY,MAAM,UAAU,eAAe;AAgE7C,SAAS,qBAAqB,UAA4B;AAC/D,QAAM,OAAO,QAAQ,QAAQ;AAC7B,MAAI,CAAC,WAAW,IAAI,EAAG,OAAM,IAAI,MAAM,6CAA6C,IAAI,EAAE;AAE1F,QAAM,WAAqB,CAAC;AAC5B,QAAM,OAAO,CAAC,KAAa,OAAO,OAAO;AACvC,eAAW,SAAS,YAAY,GAAG,EAAE,KAAK,GAAG;AAC3C,UAAI,MAAM,WAAW,GAAG,KAAK,UAAU,eAAgB;AACvD,YAAM,WAAW,KAAK,KAAK,KAAK;AAChC,UAAI,CAAC,SAAS,QAAQ,EAAE,YAAY,EAAG;AAEvC,YAAM,OAAO,OAAO,GAAG,IAAI,IAAI,KAAK,KAAK;AACzC,UAAI,oBAAoB,UAAU,WAAW,GAAG;AAC9C,iBAAS,KAAK,IAAI;AAAA,MACpB,OAAO;AACL,aAAK,UAAU,IAAI;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAEA,OAAK,IAAI;AACT,SAAO;AACT;AAMO,SAAS,gBACd,UACA,MACA,UAAkC,CAAC,GACtB;AACb,QAAM,aAAa,QAAQ,cAAc;AACzC,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,cAAc,QAAQ,MAAM,IAAI;AACtC,eAAa,MAAM,aAAa,IAAI;AAEpC,MAAI,CAAC,WAAW,WAAW,KAAK,CAAC,SAAS,WAAW,EAAE,YAAY,GAAG;AACpE,UAAM,IAAI,MAAM,uCAAuC,IAAI,EAAE;AAAA,EAC/D;AACA,MAAI,CAAC,oBAAoB,aAAa,WAAW,GAAG;AAClD,UAAM,IAAI,MAAM,oBAAoB,IAAI,kCAAkC;AAAA,EAC5E;AAEA,QAAM,aAAa,KAAK,aAAa,WAAW;AAChD,QAAM,WAAW,gBAAgB,WAAW;AAC5C,QAAM,kBAAkB,oBAAoB,aAAa,cAAc,IACnE,KAAK,aAAa,cAAc,IAChC;AAEJ,MAAI,eAAe,QAAQ;AACzB,QAAI,CAAC;AACH,YAAM,IAAI,MAAM,oBAAoB,IAAI,4CAA4C;AACtF,QAAI,CAAC;AACH,YAAM,IAAI,MAAM,oBAAoB,IAAI,qCAAqC;AAC/E,wBAAoB,iBAAiB,IAAI;AAAA,EAC3C;AAEA,QAAM,QAAQ,oBAAoB,WAAW;AAC7C,SAAO;AAAA,IACL;AAAA,IACA,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,aAAa,YAAY,MAAM;AAAA,IACvC;AAAA,IACA,aAAa,YAAY;AAAA,MACvB;AAAA,MACA,QAAQ,QAAQ,qBAAqB;AAAA,IACvC,CAAC;AAAA,EACH;AACF;AAGO,SAAS,yBACd,UACA,UAA2C,CAAC,GACrB;AACvB,QAAM,QAAQ,QAAQ,SAAS,qBAAqB,QAAQ;AAC5D,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,UAAM,UAAU,gBAAgB,UAAU,MAAM,OAAO;AACvD,WAAO;AAAA,MACL,IAAI,QAAQ;AAAA,MACZ,MAAM;AAAA,MACN,MAAM,CAAC,cAAc;AAAA,MACrB,aAAa,QAAQ;AAAA,MACrB,aAAa,QAAQ;AAAA,MACrB,YAAY,QAAQ;AAAA,MACpB,UAAU,QAAQ;AAAA,MAClB,iBAAiB,QAAQ;AAAA,MACzB,QAAQ,QAAQ;AAAA,MAChB,aAAa,QAAQ;AAAA,IACvB;AAAA,EACF,CAAC;AACH;AAMO,SAAS,mBACd,SACoB;AACpB,QAAM,YAAY,yBAAyB,QAAQ,UAAU;AAAA,IAC3D,OAAO,QAAQ;AAAA,IACf,YAAY,QAAQ;AAAA,IACpB,mBAAmB,QAAQ;AAAA,EAC7B,CAAC;AACD,QAAM,OAAO,gBAAgD;AAAA,IAC3D;AAAA,IACA,aAAa,QAAQ,eAAe;AAAA,IACpC,QAAQ,QAAQ;AAAA,IAChB,MAAM,QAAQ;AAAA,IACd,MAAM,QAAQ;AAAA,IACd,WAAW,QAAQ;AAAA,IACnB,QAAQ,QAAQ;AAAA,IAChB,SAAS,QAAQ;AAAA,EACnB,CAAC;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,UAAU,UAAU,IAAI,CAAC,cAAc;AAAA,MACrC,aAAa,SAAS;AAAA,MACtB,aAAa,SAAS;AAAA,MACtB,aAAa,SAAS;AAAA,IACxB,EAAE;AAAA,EACJ;AACF;AAEA,SAAS,oBAAoB,SAAiB,UAA2B;AACvE,MAAI;AACF,WAAO,YAAY,OAAO,EAAE,SAAS,QAAQ;AAAA,EAC/C,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,gBAAgB,aAAyC;AAChE,MAAI,oBAAoB,aAAa,SAAS,EAAG,QAAO,KAAK,aAAa,SAAS;AACnF,MAAI,oBAAoB,aAAa,UAAU,EAAG,QAAO,KAAK,aAAa,UAAU;AACrF,SAAO;AACT;AAEA,SAAS,oBAAoB,iBAAyB,MAAoB;AACxE,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,aAAa,iBAAiB,MAAM,CAAC;AAAA,EAC3D,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,oBAAoB,IAAI,kCAAkC,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IAC5G;AAAA,EACF;AAEA,MACE,OAAO,WAAW,YAClB,WAAW,QACV,OAA8B,SAAS,UACxC;AACA,UAAM,IAAI,MAAM,oBAAoB,IAAI,yCAAyC;AAAA,EACnF;AACF;AAEA,SAAS,oBAAoB,aAAqB,OAAO,IAAuB;AAC9E,QAAM,QAA2B,CAAC;AAClC,aAAW,SAAS,YAAY,KAAK,aAAa,IAAI,CAAC,EAAE,KAAK,GAAG;AAC/D,QAAI,UAAU,kBAAkB,UAAU,OAAQ;AAClD,UAAM,eAAe,OAAO,GAAG,IAAI,IAAI,KAAK,KAAK;AACjD,UAAM,WAAW,KAAK,aAAa,YAAY;AAC/C,UAAM,OAAO,SAAS,QAAQ;AAC9B,QAAI,KAAK,YAAY,GAAG;AACtB,YAAM,KAAK,GAAG,oBAAoB,aAAa,YAAY,CAAC;AAC5D;AAAA,IACF;AACA,UAAM,QAAQ,aAAa,QAAQ;AACnC,UAAM,KAAK;AAAA,MACT,MAAM;AAAA,MACN,QAAQC,YAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK;AAAA,MACvD,OAAO,MAAM;AAAA,IACf,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAAS,aAAa,MAAc,QAAgB,OAAqB;AACvE,QAAM,MAAM,SAAS,MAAM,MAAM;AACjC,MAAI,QAAQ,MAAO,CAAC,IAAI,WAAW,IAAI,KAAK,CAAC,WAAW,GAAG,EAAI;AAC/D,QAAM,IAAI,MAAM,mDAAmD,KAAK,EAAE;AAC5E;;;AC3NA,SAAS,KAAK,IAAsB;AAClC,SAAO,GAAG,WAAW,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAClE;AAGA,SAAS,WACP,KACA,UACA,aAC6B;AAC7B,QAAM,SAAS,YAAY,KAAc,UAAmB,aAAa,CAAC,MAAM,EAAE,SAAS;AAC3F,QAAM,SAAS,OAAO,MAAM,IAAI,CAAC,GAAG,MAAM,KAAK,OAAO,OAAO,CAAC,KAAK,EAAE;AACrE,SAAO,EAAE,MAAM,KAAK,MAAM,GAAG,GAAG,OAAO,OAAO;AAChD;AAMO,SAAS,mBACd,SAC4B;AAC5B,QAAM,wBAAwB,QAAQ,yBAAyB;AAC/D,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,OAAO,KAA6D;AACxE,UAAI,CAAC,IAAI,qBAAqB;AAC5B,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,IAAI,wBAAwB;AAC/B,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,YAAM,cAAc,IAAI,IAAI,QAAQ,UAAU,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC9D,YAAM,OAAO;AAAA,QACX,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ;AAAA,MACF;AACA,YAAM,OAAO;AAAA,QACX,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ;AAAA,MACF;AAKA,UAAI,KAAK,QAAQ,GAAG;AAClB,eAAO;AAAA,UACL,UAAU;AAAA,UACV,SAAS;AAAA,YACP,2CAA2C,KAAK,KAAK,QAAQ,CAAC,CAAC;AAAA,UACjE;AAAA,UACA,mBAAmB;AAAA,YACjB;AAAA,cACE,MAAM;AAAA,cACN,QAAQ;AAAA,cACR,QAAQ,EAAE,eAAe,KAAK,MAAM,iBAAiB,KAAK,MAAM,GAAG,KAAK,EAAE;AAAA,YAC5E;AAAA,UACF;AAAA,UACA,OAAO,KAAK;AAAA,QACd;AAAA,MACF;AAEA,YAAM,qBAAqB,KAAK,OAAO,KAAK;AAC5C,YAAM,SAAS,qBAAqB;AACpC,YAAM,OAAO,qBAAqB,KAAK,QAAQ,CAAC;AAChD,aAAO;AAAA,QACL,UAAU,SAAS,SAAS;AAAA,QAC5B,SAAS,SACL;AAAA,UACE,uEAAkE,GAAG,qBAAqB,wBAAwB,KAAK,QAAQ,CAAC,CAAC,wBAAmB,KAAK,KAAK,QAAQ,CAAC,CAAC,wBAAmB,KAAK,KAAK,QAAQ,CAAC,CAAC;AAAA,QACjN,IACA;AAAA,UACE,iGAA4F,GAAG,0BAAqB,wBAAwB,KAAK,QAAQ,CAAC,CAAC,wBAAmB,KAAK,KAAK,QAAQ,CAAC,CAAC,wBAAmB,KAAK,KAAK,QAAQ,CAAC,CAAC;AAAA,QAC3O;AAAA,QACJ,mBAAmB;AAAA,UACjB;AAAA,YACE,MAAM;AAAA,YACN;AAAA,YACA,QAAQ;AAAA,cACN,eAAe,KAAK;AAAA,cACpB,iBAAiB,KAAK;AAAA,cACtB;AAAA,cACA;AAAA,cACA,GAAG,KAAK;AAAA,YACV;AAAA,UACF;AAAA,QACF;AAAA,QACA,OAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,EACF;AACF;;;ACpGA,SAAS,cAAAC,mBAAkB;AA8E3B,SAAS,mBAAmB,GAA4B;AACtD,MAAI,EAAE,SAAS,UAAa,EAAE,SAAS,kBAAkB;AACvD,UAAM,IAAI,MAAM,0DAA0D,EAAE,IAAI,GAAG;AAAA,EACrF;AACA,QAAM,EAAE,aAAAC,cAAa,MAAM,OAAO,GAAG,KAAK,IAAI;AAC9C,OAAK;AACL,QAAM,QAAQ,KAAK,UAAU,aAAa,IAAI,CAAC;AAC/C,QAAM,OAAOC,YAAW,QAAQ,EAAE,OAAO,OAAO,MAAM,EAAE,OAAO,KAAK;AACpE,SAAO,SAASD;AAClB;AAEA,SAAS,cAAc,MAAmD;AACxE,QAAM,IAAI,KAAK;AACf,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI,GAAG;AACL,QAAI,CAAC,mBAAmB,CAAC,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,oDAAoD,EAAE,EAAE;AAAA,MAC1D;AAAA,IACF;AACA,QAAI,KAAK,UAAU,UAAa,KAAK,UAAU,EAAE,OAAO;AACtD,YAAM,IAAI;AAAA,QACR,+BAA+B,KAAK,KAAK,wCAAwC,EAAE,KAAK;AAAA,MAE1F;AAAA,IACF;AACA,QAAI,KAAK,SAAS,UAAa,KAAK,SAAS,EAAE,gBAAgB;AAC7D,YAAM,IAAI;AAAA,QACR,8BAA8B,KAAK,IAAI,oCAAoC,EAAE,cAAc;AAAA,MAC7F;AAAA,IACF;AACA,YAAQ,EAAE;AACV,WAAO,EAAE;AACT,gBAAY,EAAE;AACd,gBAAY,EAAE;AAAA,EAChB,OAAO;AACL,YAAQ,KAAK,SAAS;AACtB,QAAI,KAAK,SAAS,QAAW;AAC3B,YAAM,IAAI;AAAA,QACR;AAAA,MAEF;AAAA,IACF;AACA,WAAO,KAAK;AACZ,gBAAY;AACZ,gBAAY;AAAA,EACd;AACA,QAAM,QAAQ,KAAK,SAAS;AAC5B,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG;AACzC,UAAM,IAAI,MAAM,gDAAgD,KAAK,EAAE;AAAA,EACzE;AACA,MAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,GAAG;AACvC,UAAM,IAAI,MAAM,8DAA8D,IAAI,EAAE;AAAA,EACtF;AACA,QAAM,OAAO,KAAK,QAAQ;AAC1B,MAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,KAAK,OAAO,MAAM;AACtD,UAAM,IAAI;AAAA,MACR,6DAA6D,IAAI,UAAU,IAAI;AAAA,IACjF;AAAA,EACF;AACA,MAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,KAAK,aAAa,OAAO;AACtE,UAAM,IAAI;AAAA,MACR,wDAAwD,KAAK,UAAU,SAAS;AAAA,IAClF;AAAA,EACF;AAIA,QAAM,WAAW,MAAM,aAAa,IAAI;AACxC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,KAAK,UAAU;AAAA,IACvB;AAAA,IACA,aAAa,KAAK,eAAe;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAOA,SAAS,WAAW,KAAuC;AACzD,QAAM,OAAO,SAAS,EAAE,OAAO,IAAI,OAAO,QAAQ,IAAI,QAAQ,UAAU,IAAI,SAAS,CAAC;AACtF,QAAM,YAAY,IAAI,IAAI;AAC1B,MAAI;AACJ,SAAO;AAAA,IACL,QAAQ,OAAsC;AAC5C,UAAI,aAAa,qBAAqB;AACpC,cAAM,IAAI;AAAA,UACR,6CAA6C,IAAI,IAAI;AAAA,QAGvD;AAAA,MACF;AACA,UAAI,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,OAAO;AAC1D,cAAM,IAAI;AAAA,UACR,+BAA+B,KAAK,sBAAmB,IAAI,KAAK;AAAA,QAElE;AAAA,MACF;AACA,YAAM,IAAI,IAAI,cAAc,aAAa,CAAC,QAAQ;AAClD,YAAM,OAAO,KAAK,QAAQ,IAAI,IAAI,QAAQ,KAAK,CAAC;AAKhD,UAAI,aAAa,UAAa,KAAK,KAAK,IAAI,QAAQ,KAAK,UAAU,WAAW;AAC5E,mBAAW;AAAA,MACb;AACA,UAAI,aAAa,WAAW;AAC1B,eAAO;AAAA,UACL,UAAU;AAAA,UACV,QAAQ,KAAK;AAAA,UACb,GAAG,KAAK;AAAA,UACR,QACE,WAAW,KAAK,OAAO,QAAQ,CAAC,CAAC,oBAAU,UAAU,QAAQ,CAAC,CAAC,SAAS,KAAK,CAAC,UACrE,IAAI,IAAI,qCAAqC,IAAI,SAAS,kCACxD,IAAI,KAAK;AAAA,QACxB;AAAA,MACF;AACA,UAAI,KAAK,KAAK,IAAI,MAAM;AACtB,mBAAW;AACX,eAAO;AAAA,UACL,UAAU;AAAA,UACV,QAAQ,KAAK;AAAA,UACb,GAAG,KAAK;AAAA,UACR,QACE,oCAAoC,IAAI,IAAI,aAAa,KAAK,OAAO,QAAQ,CAAC,CAAC,eACxE,UAAU,QAAQ,CAAC,CAAC;AAAA,QAE/B;AAAA,MACF;AACA,aAAO;AAAA,QACL,UAAU;AAAA,QACV,QAAQ,KAAK;AAAA,QACb,GAAG,KAAK;AAAA,QACR,QAAQ,WAAW,KAAK,OAAO,QAAQ,CAAC,CAAC,eAAU,UAAU,QAAQ,CAAC,CAAC,SAAS,KAAK,CAAC,IAAI,IAAI,IAAI;AAAA,MACpG;AAAA,IACF;AAAA,IACA,QAAQ;AACN,aAAO,EAAE,GAAG,KAAK,MAAM,GAAG,UAAU,YAAY,WAAW;AAAA,IAC7D;AAAA,EACF;AACF;AAIA,SAAS,cAAiB,OAAY,MAAmB;AACvD,QAAM,MAAM,WAAW,IAAI;AAC3B,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACzC,UAAM,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,EAAE;AACpC,UAAM,MAAM,MAAM,CAAC;AACnB,UAAM,CAAC,IAAI,MAAM,CAAC;AAClB,UAAM,CAAC,IAAI;AAAA,EACb;AACA,SAAO;AACT;AAgBO,SAAS,qBACd,SAC4C;AAC5C,QAAM,MAAM,cAAc,OAAO;AACjC,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,WAAW,QAAQ;AACzB,QAAM,gBAAgB,WAAW,GAAG;AAEpC,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,OAAsC;AAC5C,aAAO,cAAc,QAAQ,KAAK;AAAA,IACpC;AAAA,IACA,QAAQ;AACN,aAAO,cAAc,MAAM;AAAA,IAC7B;AAAA,IACA,MAAM,OAAO,KAA6D;AACxE,UAAI,CAAC,IAAI,qBAAqB;AAC5B,cAAM,IAAI;AAAA,UACR,GAAG,IAAI;AAAA,QAET;AAAA,MACF;AACA,YAAM,cAAc,IAAI,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC1D,YAAM,SAAS;AAAA,QACb,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ;AAAA,QACA,CAAC,MAAM,EAAE;AAAA,MACX;AACA,YAAM,SAAS,OAAO,MAAM,IAAI,CAAC,GAAG,MAAM,IAAI,OAAO,OAAO,CAAC,CAAE;AAC/D,oBAAc,QAAQ,IAAI,WAAW;AAErC,YAAM,SAAS,WAAW,GAAG;AAC7B,UAAI;AACJ,iBAAW,KAAK,QAAQ;AACtB,eAAO,OAAO,QAAQ,CAAC;AACvB,YAAI,KAAK,aAAa,WAAY;AAAA,MACpC;AAEA,YAAM,SAAS;AAAA,QACb,GAAG,OAAO,MAAM;AAAA,QAChB,MAAM,IAAI;AAAA,QACV,MAAM,IAAI;AAAA,QACV,OAAO,IAAI;AAAA,QACX,aAAa,IAAI;AAAA,QACjB,WAAW,IAAI;AAAA,QACf,WAAW,IAAI;AAAA,QACf,SAAS,OAAO;AAAA,QAChB,iBAAiB,UAAU;AAAA,QAC3B,QAAQ,UAAU;AAAA,MACpB;AACA,YAAM,YACJ,OAAO,WAAW,IAAI,SAAY,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;AAE/E,UAAI,SAAS,QAAW;AACtB,eAAO;AAAA,UACL,UAAU;AAAA,UACV,SAAS,CAAC,GAAG,IAAI,yDAAoD;AAAA,UACrE,mBAAmB,CAAC,EAAE,MAAM,QAAQ,OAAO,OAAO,CAAC;AAAA,QACrD;AAAA,MACF;AACA,YAAM,WACJ,KAAK,aAAa,YACd,SACA,KAAK,aAAa,aAChB,mBACA;AACR,aAAO;AAAA,QACL;AAAA,QACA,SAAS,CAAC,GAAG,IAAI,KAAK,KAAK,MAAM,EAAE;AAAA,QACnC,mBAAmB,CAAC,EAAE,MAAM,QAAQ,aAAa,QAAQ,OAAO,CAAC;AAAA,QACjE,OAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACF;AA0CO,SAAS,iBAAiB,UAAmC,CAAC,GAAuB;AAC1F,QAAM,QAAQ,QAAQ,SAAS;AAC/B,QAAM,OAAO,QAAQ,QAAQ;AAC7B,QAAM,QAAQ,QAAQ,SAAS;AAC/B,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GAAG;AACzC,UAAM,IAAI,MAAM,4CAA4C,KAAK,EAAE;AAAA,EACrE;AACA,QAAM,OAAO,SAAS,EAAE,OAAO,QAAQ,QAAQ,UAAU,KAAK,UAAU,IAAI,CAAC;AAC7E,QAAM,YAAY,IAAI;AACtB,MAAI,uBAAuB;AAC3B,MAAI;AACJ,MAAI;AAEJ,QAAM,eAAe,CAAC,WAA6B;AACjD,QAAI,OAAO,WAAW,WAAW,GAAG;AAClC,YAAM,IAAI;AAAA,QACR,gCAAgC,OAAO,eAAe;AAAA,MAExD;AAAA,IACF;AACA,WAAO,OAAO,WAAW,OAAO,CAAC,MAAM,MAAO,EAAE,YAAY,KAAK,YAAY,IAAI,IAAK;AAAA,EACxF;AAEA,QAAM,SAA6B,CAAC,EAAE,QAAQ,MAAM;AAClD,QAAI,QAAS,QAAO;AACpB,QAAI,QAAQ,WAAW,EAAG,QAAO,EAAE,MAAM,MAAM;AAC/C,QAAI,cAAc,QAAW;AAC3B,kBAAY,IAAI;AAAA,QACd,aAAa,QAAQ,CAAC,CAAE,EAAE,UAAU,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC;AAAA,MAC5E;AAAA,IACF;AAGA,aAAS,IAAI,KAAK,IAAI,GAAG,oBAAoB,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvE,YAAM,MAAM,aAAa,QAAQ,CAAC,CAAE;AACpC,YAAM,aAAa,IAAI,IAAI,IAAI,UAAU,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;AAChF,iBAAW,CAAC,YAAY,YAAY,KAAK,WAAW;AAClD,cAAM,gBAAgB,WAAW,IAAI,UAAU;AAC/C,YAAI,kBAAkB,QAAW;AAC/B,gBAAM,IAAI;AAAA,YACR,gCAAgC,QAAQ,CAAC,EAAG,eAAe,uCAC5C,UAAU;AAAA,UAC3B;AAAA,QACF;AACA,cAAM,QAAQ,gBAAgB;AAC9B,YAAI,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,OAAO;AACtD,gBAAM,IAAI;AAAA,YACR,kCAAkC,KAAK,sBAAmB,KAAK,iBACzD,UAAU;AAAA,UAClB;AAAA,QACF;AACA,cAAM,OAAO,KAAK,QAAQ,QAAQ,QAAQ,KAAK,CAAC;AAChD,YAAI,KAAK,KAAK,QAAQ,KAAK,UAAU,WAAW;AAC9C,oBAAU;AAAA,YACR,MAAM;AAAA,YACN,QACE,8CAA8C,QAAQ,CAAC,EAAG,eAAe,aAC9D,KAAK,OAAO,QAAQ,CAAC,CAAC,oBAAU,UAAU,QAAQ,CAAC,CAAC,YAAY,KAAK,CAAC,yFAE5E,KAAK;AAAA,UACd;AACA,iCAAuB,QAAQ;AAC/B,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,2BAAuB,QAAQ;AAC/B,WAAO,EAAE,MAAM,MAAM;AAAA,EACvB;AACA,SAAO,QAAQ,MAAM,KAAK,MAAM;AAChC,SAAO;AACT;;;AClaO,SAAS,oBACd,UACA,OAAmC,CAAC,GACf;AACrB,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAM,YAAY,KAAK,qBAAqB;AAC5C,QAAM,UAAU,CAAC,SAA4C;AAC3D,UAAM,UAAU,oBAAI,IAAyB;AAC7C,eAAW,KAAK,UAAU;AACxB,UAAI,SAAS,EAAE,SAAS,cAAe;AACvC,iBAAW,KAAK,EAAE,OAAO;AACvB,mBAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,EAAE,IAAI,GAAG;AAC3C,gBAAM,MAAM,QAAQ,IAAI,CAAC,KAAK,oBAAI,IAAY;AAC9C,cAAI,IAAI,OAAO,CAAC,CAAC;AACjB,kBAAQ,IAAI,GAAG,GAAG;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,QAAM,UAAU,QAAQ,IAAI;AAC5B,QAAM,UAAU,QAAQ,KAAK;AAC7B,QAAM,QAAkB,CAAC;AACzB,aAAW,SAAS,oBAAI,IAAI,CAAC,GAAG,QAAQ,KAAK,GAAG,GAAG,QAAQ,KAAK,CAAC,CAAC,GAAG;AACnE,UAAM,KAAK,CAAC,GAAI,QAAQ,IAAI,KAAK,KAAK,CAAC,CAAE,EAAE,MAAM,GAAG,SAAS;AAC7D,UAAM,KAAK,CAAC,GAAI,QAAQ,IAAI,KAAK,KAAK,CAAC,CAAE,EAAE,MAAM,GAAG,SAAS;AAC7D,UAAM,SAAS,CAAC,SAAoB,KAAK,SAAS,KAAK,UAAU,IAAI,IAAI;AACzE,UAAM,KAAK,KAAK,KAAK,qBAAqB,OAAO,EAAE,CAAC,sBAAsB,OAAO,EAAE,CAAC,EAAE;AAAA,EACxF;AACA,QAAM,QAAQ,CAAC,MAA6C;AAC1D,UAAM,MAAM,oBAAI,IAAY;AAC5B,eAAW,QAAQ,EAAE,OAAO,EAAG,YAAW,KAAK,KAAM,KAAI,IAAI,EAAE,YAAY,CAAC;AAC5E,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL,MAAM,MAAM,KAAK,IAAI,KAAK;AAAA,IAC1B,eAAe,MAAM,OAAO;AAAA,IAC5B,eAAe,MAAM,OAAO;AAAA,EAC9B;AACF;AAgBO,SAAS,2BACd,MACA,MACyB;AACzB,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,KAAK,KAAK,SAAS,0BAA0B,GAAG;AACzD,UAAM,IAAK,EAAE,CAAC,EAAa,YAAY;AACvC,QAAI,CAAC,KAAK,cAAc,IAAI,CAAC,EAAG,YAAW,IAAI,CAAC;AAAA,EAClD;AACA,QAAM,MAAM,CAAC,GAAG,UAAU;AAC1B,SAAO;AAAA,IACL,YAAY;AAAA,IACZ,SAAS,IAAI,OAAO,CAAC,MAAM,KAAK,cAAc,IAAI,CAAC,CAAC;AAAA,EACtD;AACF;;;ACzGA,SAAS,cAAAE,mBAAkB;AAC3B,SAAS,cAAAC,aAAY,WAAW,gBAAAC,eAAc,qBAAqB;AACnE,SAAS,QAAAC,aAAY;AAsBd,IAAM,4BAAN,cAAwC,MAAM;AAAA,EACnD,YACkB,MAChB,SACA;AACA,UAAM,OAAO;AAHG;AAIhB,SAAK,OAAO;AAAA,EACd;AAAA,EALkB;AAMpB;AAYO,IAAM,yBAAN,MAA6D;AAAA,EAIlE,YAA6B,SAAwC;AAAxC;AAC3B,QAAI,CAACC,YAAW,QAAQ,IAAI,EAAG,WAAU,QAAQ,MAAM,EAAE,WAAW,KAAK,CAAC;AAC1E,SAAK,MAAM,QAAQ,OAAO,KAAK;AAAA,EACjC;AAAA,EAH6B;AAAA,EAHZ;AAAA,EACA,aAAa,oBAAI,IAA4B;AAAA,EAO9D,MAAM,QAAQ,OAA4C;AACxD,SAAK,iBAAiB,KAAK;AAC3B,SAAK,gBAAgB,KAAK;AAC1B,UAAM,SAAS,KAAK,SAAS,KAAK;AAClC,UAAM,OAAO,KAAK,cAAc,MAAM,MAAM;AAC5C,UAAM,OAAO,GAAG,KAAK,UAAU,MAAM,CAAC;AAAA;AAItC,eAAW,MAAM,IAAI;AAAA,EACvB;AAAA,EAEA,MAAM,OAAO,MAAmE;AAC9E,QAAI,CAAC,KAAK,OAAO;AACf,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,KAAK,gBAAgB;AACxB,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAEA,UAAM,MAA+B,CAAC;AACtC,eAAW,UAAU,aAAa;AAGhC,UAAI,KAAK,UAAU,WAAW,WAAW,oBAAoB;AAC3D,cAAM,WAAW,qBAAqB,KAAK,QAAQ,QAAQ,kBAAkB;AAC7E,YAAI,CAAC,SAAU;AAAA,MACjB;AACA,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,UAAI,CAACA,YAAW,IAAI,EAAG;AACvB,YAAM,QAAQC,cAAa,MAAM,MAAM,EAAE,MAAM,IAAI,EAAE,OAAO,OAAO;AACnE,iBAAW,QAAQ,OAAO;AACxB,YAAI;AACJ,YAAI;AACF,mBAAS,KAAK,MAAM,IAAI;AAAA,QAC1B,QAAQ;AACN;AAAA,QACF;AACA,YAAI,CAAC,cAAc,QAAQ,MAAM,MAAM,EAAG;AAC1C,YAAI,KAAK,MAAM;AAAA,MACjB;AAAA,IACF;AAGA,QAAI,KAAK,CAAC,GAAG,MAAM;AACjB,UAAI,EAAE,eAAe,EAAE,WAAY,QAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AACjF,aAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,IAChD,CAAC;AAED,WAAO,IAAI,MAAM,GAAG,KAAK,KAAK;AAAA,EAChC;AAAA,EAEA,MAAM,OAKH;AACD,UAAM,WAAmC,CAAC;AAC1C,UAAM,UAAsC;AAAA,MAC1C,YAAY;AAAA,MACZ,mBAAmB;AAAA,MACnB,eAAe;AAAA,IACjB;AACA,QAAI,QAAQ;AACZ,eAAW,UAAU,aAAa;AAChC,YAAM,OAAO,KAAK,cAAc,MAAM;AACtC,UAAI,CAACD,YAAW,IAAI,GAAG;AACrB,iBAAS,MAAM,IAAI;AACnB;AAAA,MACF;AACA,YAAM,QAAQC,cAAa,MAAM,MAAM,EAAE,MAAM,IAAI,EAAE,OAAO,OAAO;AACnE,eAAS,MAAM,IAAI,MAAM;AACzB,eAAS,MAAM;AACf,iBAAW,QAAQ,OAAO;AACxB,YAAI,QAAoB;AACxB,YAAI;AACF,kBAAS,KAAK,MAAM,IAAI,EAA4B,cAAc;AAAA,QACpE,QAAQ;AAAA,QAER;AACA,gBAAQ,KAAK,KAAK;AAAA,MACpB;AAAA,IACF;AAIA,WAAO,EAAE,OAAO,OAAO,MAAM,OAAO,UAAU,QAAQ;AAAA,EACxD;AAAA,EAEQ,iBAAiB,OAAmC;AAC1D,QAAI,CAAC,MAAM,QAAQ;AACjB,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,MAAM,qBAAqB,MAAM,kBAAkB,WAAW,GAAG;AACpE,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,MAAM,YAAY;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,MAAM,iBAAiB;AAC1B,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,YAAY,SAAS,MAAM,MAAM,GAAG;AACvC,YAAM,IAAI;AAAA,QACR;AAAA,QACA,+CAA+C,YAAY,KAAK,IAAI,CAAC;AAAA,MACvE;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,gBAAgB,OAAmC;AACzD,UAAM,MAAM,KAAK,QAAQ;AACzB,QAAI,CAAC,OAAO,CAAC,MAAM,gBAAiB;AACpC,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,WAAW;AACjB,QAAI,QAAQ,KAAK,WAAW,IAAI,MAAM,eAAe;AACrD,QAAI,CAAC,SAAS,MAAM,MAAM,iBAAiB,UAAU;AACnD,cAAQ,EAAE,QAAQ,MAAM,iBAAiB,eAAe,KAAK,OAAO,EAAE;AACtE,WAAK,WAAW,IAAI,MAAM,iBAAiB,KAAK;AAAA,IAClD;AACA,QAAI,MAAM,SAAS,KAAK;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,QACA,gCAAgC,MAAM,eAAe,aAAa,GAAG;AAAA,MACvE;AAAA,IACF;AACA,UAAM,SAAS;AAAA,EACjB;AAAA,EAEQ,SAAS,OAAoD;AACnE,UAAM,aAAa;AAAA,MACjB,KAAK,UAAU;AAAA,QACb,IAAI,MAAM,SAAS;AAAA,QACnB,KAAK,MAAM;AAAA,QACX,IAAI,MAAM;AAAA,QACV,KAAK,MAAM;AAAA,MACb,CAAC;AAAA,IACH;AAGA,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA,OAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEQ,cAAc,QAAwB;AAC5C,WAAOC,MAAK,KAAK,QAAQ,MAAM,GAAG,MAAM,QAAQ;AAAA,EAClD;AACF;AAEA,IAAM,cAAgD;AAAA,EACpD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,SAAS,qBACP,QACA,QACS;AACT,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,MAAM,QAAQ,MAAM,EAAG,QAAO,OAAO,SAAS,MAAM;AACxD,SAAO,WAAW;AACpB;AAEA,SAAS,cACP,QACA,MACA,QACS;AAET,MAAI,KAAK,UAAU,WAAW,OAAO,cAAc,KAAK,eAAgB,QAAO;AAC/E,MAAI,KAAK,UAAU,UAAU,OAAO,aAAa,KAAK,eAAgB,QAAO;AAE7E,QAAM,IAAI,KAAK;AACf,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,EAAE,QAAQ,OAAO,SAAS,SAAS,EAAE,KAAM,QAAO;AACtD,MAAI,EAAE,QAAQ;AACZ,UAAM,UAAU,MAAM,QAAQ,EAAE,MAAM,IAAI,EAAE,SAAS,CAAC,EAAE,MAAM;AAC9D,QAAI,CAAC,QAAQ,SAAS,MAAe,EAAG,QAAO;AAAA,EACjD;AACA,MAAI,EAAE,iBAAiB,UAAa,EAAE,iBAAiB,QAAW;AAChE,UAAM,aAAa,OAAO,OAAO,OAAO,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS;AAC3E,UAAM,MAAM,WAAW,WAAW,IAAI,IAAI,KAAK,IAAI,GAAG,UAAU;AAChE,QAAI,EAAE,iBAAiB,UAAa,MAAM,EAAE,aAAc,QAAO;AACjE,QAAI,EAAE,iBAAiB,UAAa,MAAM,EAAE,aAAc,QAAO;AAAA,EACnE;AACA,MAAI,EAAE,aAAa,UAAa,eAAe,OAAO,UAAU,IAAI,eAAe,EAAE,QAAQ,GAAG;AAC9F,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,OAAO,OAAuB;AACrC,SAAOC,YAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AACrE;AAEA,SAAS,WAAW,MAAc,MAAoB;AACpD,MAAIH,YAAW,IAAI,GAAG;AACpB,UAAM,WAAWC,cAAa,MAAM,MAAM;AAC1C,kBAAc,MAAM,WAAW,IAAI;AAAA,EACrC,OAAO;AACL,kBAAc,MAAM,IAAI;AAAA,EAC1B;AACF;;;AC7RA,IAAM,SAAS;AAUR,SAAS,eAAe,SAAyB;AACtD,SAAO,QAAQ,QAAQ,OAAO,MAAM;AACtC;;;ACGA,IAAM,cAAgD,CAAC,UAAU,aAAa,YAAY;AAC1F,IAAM,oBAAoB;AAC1B,IAAM,mBAAmB,oBAAI,IAAI,CAAC,aAAa,aAAa,aAAa,CAAC;AAuFnE,SAAS,aACd,MAC4B;AAC5B,QAAM,YAAY,eAAe,IAAI;AACrC,QAAM,UAAU,cAAc,MAAM,SAAS;AAC7C,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAM,wBAAwB,KAAK,yBAAyB;AAC5D,QAAM,iBAAiB,KAAK,kBAAkB;AAC9C,QAAM,oBAAoB,KAAK,qBAAqB;AAEpD,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AACA,MAAI,gBAAgB,EAAG,OAAM,IAAI,MAAM,0CAA0C;AACjF,MAAI,wBAAwB,GAAG;AAC7B,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACpE;AACA,MAAI,oBAAoB,EAAG,OAAM,IAAI,MAAM,8CAA8C;AAEzF,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,QAAQ,KAA8D;AAC1E,YAAM,QAAQ,YAAY,IAAI,SAAS,IAAI,UAAU;AAAA,QACnD;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AACD,YAAM,WAAW,YAAY;AAAA,QAC3B;AAAA,QACA,WAAW,QAAQ,OAAO,CAAC,UAAU,CAAC,MAAM,UAAU,KAAK,CAAC;AAAA,QAC5D;AAAA,QACA;AAAA,QACA,aAAa,KAAK,eAAe;AAAA,QACjC,2BAA2B,KAAK,6BAA6B;AAAA,MAC/D,CAAC;AACD,UAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,YAAM,WAAW,UAAU,SAAS,KAAK;AACzC,UAAI,CAAC,UAAU;AACb,cAAM,IAAI,MAAM,0BAA0B,SAAS,KAAK,gCAAgC;AAAA,MAC1F;AAEA,YAAM,YAAY,KAAK,IAAI,IAAI,gBAAgB,iBAAiB;AAChE,YAAM,MAAM,MAAM,SAAS,QAAQ,EAAE,GAAG,KAAK,gBAAgB,UAAU,CAAC;AACxE,YAAM,UAAU,IACb,IAAI,CAAC,cAAc,kBAAkB,SAAS,CAAC,EAC/C,IAAI,CAAC,cAAc,aAAa,WAAW,SAAS,OAAO,SAAS,MAAM,CAAC;AAE9E,YAAM,WAAgC,CAAC;AACvC,iBAAW,aAAa,SAAS;AAC/B,cAAM,SAAS,KAAK,kBAChB,MAAM,KAAK,gBAAgB;AAAA,UACzB,OAAO,SAAS;AAAA,UAChB;AAAA,UACA,SAAS;AAAA,UACT,QAAQ,SAAS;AAAA,QACnB,CAAC,IACD,EAAE,SAAS,OAAgB;AAC/B,YAAI,OAAO,YAAY,OAAQ;AAC/B,cAAM,OAAO,OAAO,YAAY,SAAS,qBAAqB,MAAM,IAAI;AACxE,iBAAS;AAAA,UACP,OAAO,EAAE,GAAG,WAAW,WAAW,GAAG,UAAU,SAAS;AAAA,EAAK,IAAI,GAAG,IAAI;AAAA,QAC1E;AAAA,MACF;AAEA,UAAI,QAAQ,SAAS,KAAK,SAAS,WAAW,GAAG;AAC/C,cAAM,IAAI;AAAA,UACR,wCAAwC,SAAS,KAAK;AAAA,QACxD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,OAAO,EAAE,QAAQ,GAAG;AAClB,YAAM,OAAO,QAAQ,QAAQ,SAAS,CAAC;AACvC,UAAI,QAAQ,KAAK,WAAW,WAAW,GAAG;AACxC,eAAO,EAAE,MAAM,MAAM,QAAQ,4DAA4D;AAAA,MAC3F;AACA,YAAM,QAAQ,YAAY,SAAS,CAAC,GAAG;AAAA,QACrC;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AACD,YAAM,6BAA6B,QAAQ,MAAM,CAAC,UAAU,MAAM,UAAU,KAAK,CAAC;AAClF,aAAO,6BACH,EAAE,MAAM,MAAM,QAAQ,8BAA8B,QAAQ,KAAK,IAAI,CAAC,IAAI,IAC1E,EAAE,MAAM,MAAM;AAAA,IACpB;AAAA,EACF;AACF;AAEA,SAAS,eACP,MACoE;AACpE,SAAO;AAAA,IACL,GAAI,KAAK,aAAa,CAAC;AAAA,IACvB,GAAI,KAAK,iBAAiB,EAAE,QAAQ,KAAK,eAAe,IAAI,CAAC;AAAA,IAC7D,GAAI,KAAK,oBAAoB,EAAE,WAAW,KAAK,kBAAkB,IAAI,CAAC;AAAA,IACtE,GAAI,KAAK,qBAAqB,EAAE,YAAY,KAAK,mBAAmB,IAAI,CAAC;AAAA,EAC3E;AACF;AAEA,SAAS,cACP,MACA,WACyB;AACzB,QAAM,WAAW,KAAK,OAAO;AAC7B,QAAM,YAAY,IAAI,IAAI,KAAK,OAAO,mBAAmB,CAAC,CAAC;AAC3D,SAAO,YAAY,OAAO,CAAC,UAAU;AACnC,QAAI,CAAC,UAAU,KAAK,EAAG,QAAO;AAC9B,QAAI,UAAU,IAAI,KAAK,EAAG,QAAO;AACjC,WAAO,WAAW,SAAS,SAAS,KAAK,IAAI;AAAA,EAC/C,CAAC;AACH;AAEA,SAAS,YACP,SACA,UACA,MACiB;AACjB,QAAM,WAAW,gBAAgB,OAAO;AACxC,SAAO;AAAA,IACL;AAAA,IACA,WAAW;AAAA,MACT,QAAQ,iBAAiB,UAAU,UAAU,IAAI;AAAA,MACjD,WAAW,iBAAiB,aAAa,UAAU,IAAI;AAAA,MACvD,YAAY,iBAAiB,cAAc,UAAU,IAAI;AAAA,IAC3D;AAAA,IACA,SAAS,8BAA8B,QAAQ;AAAA,EACjD;AACF;AAEA,SAAS,gBAAgB,SAAqD;AAC5E,QAAM,WAA0B,CAAC;AACjC,aAAW,cAAc,SAAS;AAChC,eAAW,aAAa,WAAW,YAAY;AAC7C,YAAM,QAAQ,eAAe,SAAS;AACtC,UAAI,CAAC,MAAO;AACZ,eAAS,KAAK;AAAA,QACZ;AAAA,QACA,WAAW,UAAU;AAAA,QACrB,UAAU,kBAAkB,SAAS;AAAA,MACvC,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eAAe,WAA8D;AACpF,QAAM,QAAQ,UAAU,SAAS;AACjC,QAAM,YAAY,UAAU,aAAa;AACzC,SAAO,WAAW,KAAK,KAAK,WAAW,SAAS;AAClD;AAEA,SAAS,WAAW,MAA4C;AAC9D,QAAM,QAAQ,yCAAyC,KAAK,IAAI;AAChE,SAAO,QAAS,MAAM,CAAC,IAA8B;AACvD;AAEA,SAAS,kBAAkB,WAAwC;AACjE,QAAM,QAAQ,UAAU,SAAS,UAAU,aAAa,UAAU;AAClE,SACE,MAAM,QAAQ,2CAA2C,EAAE,EAAE,KAAK,KAAK,UAAU;AAErF;AAEA,SAAS,iBACP,OACA,UACA,MACS;AACT,QAAM,MAAM,SAAS,OAAO,CAAC,YAAY,QAAQ,UAAU,KAAK;AAChE,MAAI,IAAI,SAAS,KAAK,cAAe,QAAO;AAC5C,QAAM,qBAAqB,IAAI,IAAI,IAAI,IAAI,CAAC,YAAY,QAAQ,QAAQ,CAAC,EAAE;AAC3E,MAAI,qBAAqB,KAAK,sBAAuB,QAAO;AAE5D,MAAI,OAAO,OAAO;AAClB,MAAI,eAAe;AACnB,aAAW,WAAW,KAAK;AACzB,QAAI,QAAQ,YAAY,OAAO,KAAK,gBAAgB;AAClD,aAAO,QAAQ;AACf,qBAAe;AAAA,IACjB,OAAO;AACL,sBAAgB;AAAA,IAClB;AAAA,EACF;AACA,SAAO,gBAAgB,KAAK;AAC9B;AAEA,SAAS,YAAuB,MAO4B;AAC1D,QAAM,EAAE,WAAW,MAAM,IAAI;AAC7B,MAAI,UAAU,WAAW,EAAG,QAAO;AAEnC,QAAM,cAAc,MAAM,SAAS,KAAK,CAAC,YAAY,QAAQ,UAAU,QAAQ;AAC/E,MAAI,KAAK,eAAe,UAAU,SAAS,QAAQ,KAAK,CAAC,aAAa;AACpE,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ;AAAA,IACV;AAAA,EACF;AAEA,QAAM,YAAY,UAAU,OAAO,CAAC,UAAU,MAAM,QAAQ,OAAO,KAAK,IAAI,CAAC;AAC7E,MAAI,UAAU,SAAS,QAAQ,GAAG;AAChC,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ,mBAAmB,MAAM,QAAQ,OAAO,MAAM;AAAA,IACxD;AAAA,EACF;AAEA,QAAM,YAAY,UAAU;AAAA,IAC1B,CAAC,GAAG,MAAM,MAAM,QAAQ,OAAO,CAAC,IAAI,MAAM,QAAQ,OAAO,CAAC,KAAK,UAAU,CAAC,IAAI,UAAU,CAAC;AAAA,EAC3F,EAAE,CAAC;AACH,MAAI,WAAW;AACb,QACE,cAAc,gBACd,KAAK,6BACL,UAAU,SAAS,WAAW,KAC9B,KAAK,UAAU,WACf;AACA,aAAO;AAAA,QACL,OAAO;AAAA,QACP,QACE;AAAA,MACJ;AAAA,IACF;AACA,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ,mBAAmB,MAAM,QAAQ,OAAO,SAAS,CAAC,IAAI,SAAS;AAAA,IACzE;AAAA,EACF;AAIA,MAAI,MAAM,SAAS,WAAW,GAAG;AAC/B,UAAM,QAAQ,UAAU,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC;AAC7E,WAAO,EAAE,OAAO,OAAO,QAAQ,6DAA6D;AAAA,EAC9F;AACA,SAAO;AACT;AAEA,SAAS,UAAU,OAAsC;AACvD,SAAO,UAAU,WAAW,IAAI,UAAU,cAAc,IAAI;AAC9D;AAEA,SAAS,kBAAkB,OAA8D;AACvF,SAAO,oBAAoB,KAAK,IAC5B,QACA,EAAE,SAAS,OAAO,OAAO,aAAa,WAAW,qCAAqC;AAC5F;AAEA,SAAS,aACP,WACA,OACA,QACmB;AACnB,QAAM,QAAQ,UAAU,QAAQ,QAAQ,KAAK,IAAI,UAAU,KAAK,KAAK,QAAQ,KAAK;AAClF,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,IACA,WAAW;AAAA,MACT,QAAQ,KAAK;AAAA,MACb,WAAW,MAAM;AAAA,MACjB,UAAU,YAAY,6BAA6B,UAAU,SAAS,KAAK;AAAA,IAC7E,EACG,OAAO,OAAO,EACd,KAAK,IAAI;AAAA,EACd;AACF;AAEA,SAAS,qBAAqB,QAAkC;AAC9D,QAAM,SAAS,OAAO,QAAQ,OAAO,CAAC,UAAU,MAAM,aAAa,MAAM,KAAK,CAAC;AAC/E,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO;AAAA,EAAuB,OAAO,IAAI,CAAC,UAAU,KAAK,MAAM,SAAS,KAAK,MAAM,WAAW,EAAE,EAAE,KAAK,IAAI,CAAC;AAC9G;AAKO,SAAS,8BACd,UACwB;AACxB,QAAM,UAAkC;AAAA,IACtC,QAAQ,EAAE,QAAQ,GAAG,WAAW,GAAG,YAAY,EAAE;AAAA,IACjD,UAAU,CAAC;AAAA,EACb;AACA,QAAM,OAAO,oBAAI,QAAgB;AACjC,aAAW,WAAW,UAAU;AAC9B,mBAAe,SAAS,SAAS,MAAM,CAAC;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,SAAS,eACP,SACA,SACA,MACA,OACM;AACN,MAAI,QAAQ,kBAAmB;AAC/B,MAAI,CAAC,QAAS;AACd,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM,QAAQ,mBAAmB,OAAO;AACxC,QAAI,MAAO,YAAW,SAAS,EAAE,OAAO,SAAS,OAAO,OAAO,EAAE,CAAC;AAClE;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,QAAI,KAAK,IAAI,OAAO,EAAG;AACvB,SAAK,IAAI,OAAO;AAChB,eAAW,QAAQ,QAAS,gBAAe,SAAS,MAAM,MAAM,QAAQ,CAAC;AACzE;AAAA,EACF;AACA,MAAI,OAAO,YAAY,SAAU;AACjC,MAAI,KAAK,IAAI,OAAO,EAAG;AACvB,OAAK,IAAI,OAAO;AAChB,QAAM,MAAM;AAEZ,wBAAsB,SAAS,IAAI,mBAAmB,IAAI,gBAAgB,MAAM,QAAQ,CAAC;AACzF,gBAAc,SAAS,GAAG;AAC1B,kBAAgB,SAAS,IAAI,UAAU,MAAM,MAAM,QAAQ,CAAC;AAE5D,QAAM,WAAW,kBAAkB,IAAI,SAAS,IAAI,sBAAsB,IAAI,iBAAiB;AAC/F,QAAM,OAAO,WAAW,GAAG;AAC3B,QAAM,WAAW,YAAY,mBAAmB,IAAI;AACpD,MAAI,UAAU;AACZ,eAAW,SAAS;AAAA,MAClB,OAAO,QAAQ;AAAA,MACf,OAAO;AAAA,MACP,OAAO,YAAY,IAAI,KAAK,KAAK;AAAA,MACjC,YAAY,gBAAgB,IAAI,UAAU;AAAA,MAC1C,cAAc,YAAY,IAAI,iBAAiB,IAAI,gBAAgB,IAAI,kBAAkB;AAAA,MACzF,SAAS,iBAAiB,IAAI,YAAY,IAAI,OAAO;AAAA,IACvD,CAAC;AAAA,EACH;AACF;AAEA,SAAS,sBACP,SACA,KACA,MACA,OACM;AACN,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU;AACrC,MAAI,KAAK,IAAI,GAAG,EAAG;AACnB,OAAK,IAAI,GAAG;AACZ,QAAM,YAAY;AAClB,aAAW,SAAS,aAAa;AAC/B,UAAM,SAAS,UAAU,KAAK;AAC9B,QAAI,CAAC,UAAU,OAAO,WAAW,SAAU;AAC3C,UAAM,MAAM;AACZ,UAAM,QAAQ,YAAY,IAAI,KAAK,KAAK;AACxC,QAAI,QAAQ,EAAG,SAAQ,OAAO,KAAK,KAAK;AACxC,oBAAgB,SAAS,IAAI,UAAU,OAAO,MAAM,QAAQ,CAAC;AAAA,EAC/D;AACF;AAEA,SAAS,cAAc,SAAiC,KAAoC;AAC1F,QAAM,SAAS,YAAY,IAAI,sBAAsB,IAAI,iBAAiB;AAC1E,QAAM,aAAa,YAAY,IAAI,0BAA0B,IAAI,qBAAqB;AACtF,QAAM,OAAO,YAAY,IAAI,oBAAoB,IAAI,eAAe;AACpE,MAAI,OAAQ,SAAQ,OAAO,UAAU;AACrC,MAAI,WAAY,SAAQ,OAAO,cAAc;AAC7C,MAAI,KAAM,SAAQ,OAAO,cAAc;AACzC;AAEA,SAAS,gBACP,SACA,KACA,eACA,MACA,OACM;AACN,MAAI,CAAC,MAAM,QAAQ,GAAG,EAAG;AACzB,MAAI,KAAK,IAAI,GAAG,EAAG;AACnB,OAAK,IAAI,GAAG;AACZ,aAAW,QAAQ,KAAK;AACtB,QAAI,eAAe;AACjB,qBAAe,SAAS,MAAM,MAAM,QAAQ,CAAC;AAC7C;AAAA,IACF;AACA,UAAM,UAAU,aAAa,IAAI;AACjC,QAAI,QAAS,SAAQ,SAAS,KAAK,OAAO;AAAA,EAC5C;AACF;AAEA,SAAS,WAAW,SAAiC,SAAmC;AACtF,UAAQ,OAAO,QAAQ,KAAK,KAAK,KAAK,IAAI,GAAG,QAAQ,KAAK;AAC1D,UAAQ,SAAS,KAAK,OAAO;AAC/B;AAEA,SAAS,aAAa,KAAyC;AAC7D,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,QAAM,MAAM;AACZ,QAAM,OAAO,WAAW,GAAG;AAC3B,QAAM,QACJ,kBAAkB,IAAI,SAAS,IAAI,sBAAsB,IAAI,iBAAiB,KAC9E,mBAAmB,IAAI;AACzB,MAAI,CAAC,MAAO,QAAO;AACnB,SAAO;AAAA,IACL,OAAO,QAAQ;AAAA,IACf;AAAA,IACA,OAAO,YAAY,IAAI,KAAK,KAAK;AAAA,IACjC,YAAY,gBAAgB,IAAI,UAAU;AAAA,IAC1C,cAAc,YAAY,IAAI,iBAAiB,IAAI,gBAAgB,IAAI,kBAAkB;AAAA,IACzF,SAAS,iBAAiB,IAAI,YAAY,IAAI,OAAO;AAAA,EACvD;AACF;AAEA,SAAS,kBAAkB,KAA4C;AACrE,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,QAAM,QAAQ,IAAI,YAAY;AAC9B,MAAI,UAAU,YAAY,UAAU,eAAe,UAAU,aAAc,QAAO;AAClF,MAAI,UAAU,WAAW,UAAU,UAAU,UAAU,OAAQ,QAAO;AACtE,MAAI,UAAU,YAAY,UAAU,SAAU,QAAO;AACrD,SAAO;AACT;AAEA,SAAS,mBAAmB,MAA4C;AACtE,QAAM,QAAQ,KAAK,YAAY;AAC/B,MACE,yGAAyG;AAAA,IACvG;AAAA,EACF,GACA;AACA,WAAO;AAAA,EACT;AACA,MACE,yGAAyG;AAAA,IACvG;AAAA,EACF,GACA;AACA,WAAO;AAAA,EACT;AACA,MACE,wFAAwF;AAAA,IACtF;AAAA,EACF,GACA;AACA,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,WAAW,KAAsC;AACxD,SAAO;AAAA,IACL,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,IACJ,IAAI;AAAA,EACN,EACG,OAAO,CAAC,UAA2B,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,SAAS,CAAC,EACvF,KAAK,GAAG;AACb;AAEA,SAAS,YAAY,OAA+B;AAClD,SAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ;AACvE;AAEA,SAAS,YAAY,OAAoC;AACvD,SAAO,OAAO,UAAU,YAAY,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI;AACpE;AAEA,SAAS,gBAAgB,OAAkD;AACzE,SAAO,UAAU,UAAU,UAAU,YAAY,UAAU,QAAQ,QAAQ;AAC7E;AAEA,SAAS,iBAAiB,OAAsC;AAC9D,SAAO,MAAM,QAAQ,KAAK,IACtB,MAAM,OAAO,CAAC,SAAyB,OAAO,SAAS,QAAQ,IAC/D;AACN;AA4BO,SAAS,uBAAuB,MAAsD;AAC3F,MAAI,KAAK,WAAW,WAAW,GAAG;AAChC,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACxE;AACA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,QAAQ,KAAmD;AAC/D,UAAI,OAAO,IAAI,mBAAmB,UAAU;AAC1C,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,YAAM,QAAQ,KAAK,SAAS;AAC5B,YAAM,YACJ,KAAK,cAAc,CAAC,WAAsC,KAAK,UAAU,QAAQ,MAAM,CAAC;AAC1F,YAAM,UAAU,MAAM,IAAI,cAAc;AACxC,YAAM,mBAAmB,cAAc,OAAO;AAC9C,YAAM,QAAQ,YAAY,IAAI,OAAO;AACrC,YAAM,MAA2B,CAAC;AAClC,iBAAW,aAAa,KAAK,YAAY;AACvC,YAAI,MAAM,IAAI,UAAU,KAAK,EAAG;AAChC,cAAM,OAAO,wBAAwB,SAAS,SAAS;AACvD,cAAM,UAAU,UAAU,IAAI;AAC9B,YAAI,YAAY,IAAI,kBAAkB,cAAc,IAAI,MAAM,iBAAkB;AAChF,YAAI,KAAK,EAAE,SAAS,OAAO,UAAU,OAAO,WAAW,UAAU,UAAU,CAAC;AAC5E,YAAI,IAAI,UAAU,IAAI,eAAgB;AAAA,MACxC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,gBAAgB,SAA4C;AACnE,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,OAAO;AAAA,EAC7B,SAAS,OAAO;AACd,UAAM,IAAI;AAAA,MACR,4EAA4E,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,IACpI;AAAA,EACF;AACA,MAAI,CAAC,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GAAG;AAClE,UAAM,IAAI,MAAM,8DAA8D;AAAA,EAChF;AACA,SAAO;AACT;AAEA,SAAS,YAAY,SAAmD;AACtE,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,cAAc,SAAS;AAChC,eAAW,aAAa,WAAW,YAAY;AAC7C,UAAI,CAAC,UAAU,MAAO;AACtB,YAAM,IAAI,UAAU,KAAK;AACzB,YAAM,IAAI,kBAAkB,SAAS,CAAC;AAAA,IACxC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,wBACP,SACA,WAC2B;AAC3B,QAAM,OAAO,gBAAgB,OAAO;AACpC,MAAI,UAAU,MAAO,WAAU,MAAM,UAAU,KAAK;AACpD,aAAW,UAAU,UAAU,WAAW,CAAC,GAAG;AAC5C;AAAA,MACE;AAAA,MACA,OAAO,OAAO,SAAS,WAAW,OAAO,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,OAAO,IAAI;AAAA,MAC1E,OAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,OAA6D;AACpF,SAAO,KAAK,MAAM,KAAK,UAAU,KAAK,CAAC;AACzC;AAEA,SAAS,UAAU,QAAmC,OAAwC;AAC5F,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,sBAAkB,GAAG;AACrB,QAAI,cAAc,KAAK,KAAK,cAAc,OAAO,GAAG,CAAC,GAAG;AACtD,gBAAU,OAAO,GAAG,GAAgC,KAAkC;AAAA,IACxF,OAAO;AACL,aAAO,GAAG,IAAI;AAAA,IAChB;AAAA,EACF;AACF;AAEA,SAAS,QAAQ,QAAmC,MAAgB,OAAwB;AAC1F,MAAI,KAAK,WAAW,EAAG,OAAM,IAAI,MAAM,uDAAuD;AAC9F,aAAW,QAAQ,KAAM,mBAAkB,IAAI;AAC/C,MAAI,SAAoC;AACxC,aAAW,QAAQ,KAAK,MAAM,GAAG,EAAE,GAAG;AACpC,UAAM,WAAW,OAAO,IAAI;AAC5B,QAAI,CAAC,cAAc,QAAQ,GAAG;AAC5B,aAAO,IAAI,IAAI,CAAC;AAAA,IAClB;AACA,aAAS,OAAO,IAAI;AAAA,EACtB;AACA,SAAO,KAAK,KAAK,SAAS,CAAC,CAAE,IAAI;AACnC;AAEA,SAAS,kBAAkB,KAAmB;AAC5C,MAAI,CAAC,IAAI,KAAK,EAAG,OAAM,IAAI,MAAM,2DAA2D;AAC5F,MAAI,iBAAiB,IAAI,GAAG,GAAG;AAC7B,UAAM,IAAI,MAAM,4CAA4C,GAAG,kBAAkB;AAAA,EACnF;AACF;AAEA,SAAS,cAAc,OAAsD;AAC3E,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,IAAI,MAAM,IAAI,CAAC,SAAS,cAAc,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;AACvF,MAAI,cAAc,KAAK,GAAG;AACxB,WAAO,IAAI,OAAO,KAAK,KAAK,EACzB,KAAK,EACL,IAAI,CAAC,QAAQ,GAAG,KAAK,UAAU,GAAG,CAAC,IAAI,cAAc,MAAM,GAAG,CAAE,CAAC,EAAE,EACnE,KAAK,GAAG,CAAC;AAAA,EACd;AACA,SAAO,KAAK,UAAU,KAAK;AAC7B;AAEA,SAAS,cAAc,OAAoD;AACzE,MAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,EAAG,QAAO;AACxE,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,SAAO,UAAU,OAAO,aAAa,UAAU;AACjD;;;AClsBO,SAAS,gBAAgB,SAAiB,OAA0C;AACzF,MAAI,QAAQ,QAAQ,MAAM,IAAI;AAC9B,MAAI,UAAU;AACd,QAAM,WAAkC,CAAC;AACzC,QAAM,WAAW,CAAC,WAA2B,MAAM,UAAU,CAAC,MAAM,EAAE,SAAS,MAAM,CAAC;AAEtF,aAAW,MAAM,MAAM,KAAK;AAC1B,QAAI,GAAG,OAAO,OAAO;AACnB,UAAI,OAAO,GAAG,SAAS,YAAY,GAAG,KAAK,KAAK,MAAM,IAAI;AACxD,iBAAS,KAAK,EAAE,IAAI,QAAQ,iBAAiB,CAAC;AAC9C;AAAA,MACF;AACA,YAAM,SAAS,GAAG,KAAK,MAAM,IAAI;AACjC,UAAI,GAAG,UAAU,UAAa,GAAG,UAAU,IAAI;AAC7C,gBAAQ,CAAC,GAAG,OAAO,GAAG,MAAM;AAC5B;AACA;AAAA,MACF;AACA,YAAM,MAAM,SAAS,GAAG,KAAK;AAC7B,UAAI,QAAQ,IAAI;AACd,iBAAS,KAAK,EAAE,IAAI,QAAQ,yBAAyB,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC;AAC3E;AAAA,MACF;AACA,cAAQ,CAAC,GAAG,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,GAAG,QAAQ,GAAG,MAAM,MAAM,MAAM,CAAC,CAAC;AACvE;AAAA,IACF,WAAW,GAAG,OAAO,UAAU;AAC7B,YAAM,MAAM,SAAS,GAAG,MAAM;AAC9B,UAAI,QAAQ,IAAI;AACd,iBAAS,KAAK,EAAE,IAAI,QAAQ,4BAA4B,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC;AAC/E;AAAA,MACF;AACA,cAAQ,CAAC,GAAG,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,MAAM,MAAM,MAAM,CAAC,CAAC;AACxD;AAAA,IACF,OAAO;AAEL,YAAM,MAAM,SAAS,GAAG,MAAM;AAC9B,UAAI,QAAQ,IAAI;AACd,iBAAS,KAAK,EAAE,IAAI,QAAQ,6BAA6B,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC;AAChF;AAAA,MACF;AACA,UAAI,OAAO,GAAG,SAAS,UAAU;AAC/B,iBAAS,KAAK,EAAE,IAAI,QAAQ,uBAAuB,CAAC;AACpD;AAAA,MACF;AACA,cAAQ,CAAC,GAAG,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,MAAM,IAAI,GAAG,GAAG,MAAM,MAAM,MAAM,CAAC,CAAC;AAChF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,EAAE,SAAS,MAAM,KAAK,IAAI,GAAG,SAAS,SAAS;AACxD;AAIO,SAAS,eAAe,OAA2B;AACxD,SAAO,MAAM,IAAI;AACnB;AAEA,SAAS,SAAS,GAAW,MAAM,IAAY;AAC7C,SAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;AACjD;;;ACnFA,IAAM,kBACJ;AAwEK,SAAS,iBAAiB,MAAiD;AAChF,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,gBAAgB,KAAK,cAAc;AACzC,QAAM,mBAAmB,KAAK,cAAc,IAAI,WAAW;AAE3D,iBAAe,eAAe,MAAiD;AAC7E,UAAM,aAAa,iBAAiB;AAAA,MAClC,QAAQ,KAAK;AAAA,MACb,SAAS,KAAK;AAAA,MACd,UAAU,KAAK;AAAA,MACf,YAAY,KAAK;AAAA,MACjB,gBAAgB,KAAK;AAAA,MACrB,UAAU,KAAK;AAAA,MACf,cAAc,KAAK;AAAA,MACnB,OAAO,KAAK;AAAA,IACd,CAAC;AACD,UAAM,UAA0B;AAAA,MAC9B,OAAO,KAAK;AAAA,MACZ,UAAU;AAAA,QACR,EAAE,MAAM,UAAU,SAAS,gBAAgB;AAAA,QAC3C,EAAE,MAAM,QAAQ,SAAS,WAAW;AAAA,MACtC;AAAA,MACA,UAAU;AAAA,MACV,aAAa,KAAK,eAAe;AAAA,MACjC,WAAW,KAAK,aAAa;AAAA,IAC/B;AACA,UAAM,OAAO,OAAO,KAAK,cAAc,kBAAkB,YAAY;AAAA,MACnE,SAAS;AAAA,MACT,OAAO,KAAK,aAAa;AAAA,MACzB,OAAO;AAAA,MACP,OAAO,KAAK;AAAA,MACZ,eAAe,2BAA2B,SAAS,KAAK,GAAG;AAAA,MAC3D,QAAQ,KAAK;AAAA,MACb,SAAS,CAAC,QAAQ,WAChB,QAAQ,SAAS,EAAE,GAAG,KAAK,KAAK,QAAQ,gBAAgB,OAAO,CAAC;AAAA,MAClE,SAAS;AAAA,MACT,kBAAkB;AAAA,IACpB,CAAC;AACD,QAAI,CAAC,KAAK,UAAW,OAAM,KAAK;AAChC,UAAM,SAAS,KAAK;AACpB,WAAO,wBAAwB,OAAO,SAAS,KAAK,OAAO,KAAK,UAAU;AAAA,EAC5E;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,MAAM,QAAQ,KAAmD;AAC/D,UAAI,OAAO,IAAI,mBAAmB,UAAU;AAC1C,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,YAAM,UAAU,IAAI;AACpB,YAAM,UAAU,MAAM,eAAe;AAAA,QACnC;AAAA,QACA,UAAU,oBAAoB,KAAK,SAAS;AAAA,QAC5C,YAAY;AAAA,QACZ,gBAAgB,CAAC;AAAA,QACjB,cAAc,sBAAsB,IAAI,UAAU,IAAI,MAAM,KAAK;AAAA,QACjE,OAAO,IAAI;AAAA,QACX,QAAQ,IAAI;AAAA,QACZ,YAAY,IAAI,cAAc;AAAA,QAC9B,WAAW,IAAI,aAAa;AAAA,MAC9B,CAAC;AACD,YAAM,MAA2B,CAAC;AAClC,YAAM,OAAO,oBAAI,IAAY;AAC7B,iBAAW,SAAS,SAAS;AAC3B,cAAM,EAAE,SAAS,WAAW,QAAQ,IAAI,gBAAgB,SAAS,KAAK;AACtE,YAAI,YAAY,KAAK,cAAc,WAAW,KAAK,IAAI,SAAS,EAAG;AACnE,aAAK,IAAI,SAAS;AAClB,YAAI,KAAK,EAAE,SAAS,WAAW,OAAO,MAAM,OAAO,WAAW,MAAM,UAAU,CAAC;AAC/E,YAAI,IAAI,UAAU,IAAI,eAAgB;AAAA,MACxC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAKA,SAAS,oBAAoB,KAAqB,GAA6B;AAC7E,QAAM,OAAO,IAAI,QAAQ,GAAG,EAAE;AAC9B,MAAI,CAAC,QAAQ,KAAK,WAAW,WAAW,EAAG,QAAO,EAAE,eAAe,CAAC,GAAG,gBAAgB,CAAC,EAAE;AAC1F,QAAM,OAAO,CAAC,GAAG,KAAK,UAAU,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC;AAC7E,MAAI,CAAC,KAAM,QAAO,EAAE,eAAe,CAAC,GAAG,gBAAgB,CAAC,EAAE;AAC1D,QAAM,gBAAgB,CAAC,GAAG,KAAK,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC;AAC9F,QAAM,iBAAiB,OAAO,QAAQ,KAAK,UAAU,EAClD,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,CAAC,WAAW,KAAK,OAAO,EAAE,WAAW,MAAM,EAAE;AACrD,SAAO,EAAE,eAAe,eAAe;AACzC;AAEA,SAAS,iBAAiB,MASf;AACT,QAAM,QAAkB;AAAA,IACtB,2BAA2B,KAAK,MAAM;AAAA,IACtC;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA,WAAW,KAAK,KAAK;AAAA,IACrB,WAAW,KAAK,UAAU;AAAA,IAC1B;AAAA,IACA;AAAA,EACF;AACA,MAAI,KAAK,SAAS,cAAc,SAAS,GAAG;AAC1C,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA,GAAG,KAAK,SAAS,cAAc,IAAI,CAAC,MAAM,KAAK,EAAE,UAAU,KAAK,EAAE,UAAU,QAAQ,CAAC,CAAC,GAAG;AAAA,IAC3F;AAAA,EACF;AACA,MAAI,KAAK,SAAS,eAAe,SAAS,GAAG;AAC3C,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA,GAAG,KAAK,SAAS,eAAe,IAAI,CAAC,MAAM,KAAK,EAAE,SAAS,KAAK,EAAE,MAAM,QAAQ,CAAC,CAAC,GAAG;AAAA,IACvF;AAAA,EACF;AACA,MAAI,KAAK,eAAe,SAAS,GAAG;AAClC,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA,GAAG,KAAK,eAAe,IAAI,CAAC,MAAM,KAAK,EAAE,KAAK,KAAK,EAAE,SAAS,WAAM,EAAE,MAAM,EAAE;AAAA,IAChF;AAAA,EACF;AACA,MAAI,KAAK,cAAc;AACrB,UAAM,KAAK,IAAI,KAAK,YAAY;AAAA,EAClC;AACA,MAAI,KAAK,UAAU;AACjB,UAAM,KAAK,IAAI,oCAAoC,KAAK,QAAQ,EAAE;AAAA,EACpE;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAOO,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAC9C,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;AAKO,SAAS,wBACd,KACA,YACA,YACc;AACd,MAAI,OAAO,IAAI,KAAK;AACpB,MAAI,KAAK,WAAW,KAAK,EAAG,QAAO,KAAK,QAAQ,oBAAoB,EAAE,EAAE,QAAQ,WAAW,EAAE;AAC7F,QAAM,QAAQ,KAAK,QAAQ,GAAG;AAC9B,QAAM,MAAM,KAAK,YAAY,GAAG;AAChC,MAAI,QAAQ,KAAK,OAAO,OAAO;AAC7B,UAAM,IAAI;AAAA,MACR,2EAA2E,QAAQ,GAAG,CAAC;AAAA,IACzF;AAAA,EACF;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,KAAK,MAAM,OAAO,MAAM,CAAC,CAAC;AAAA,EAChD,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,yDACE,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD,MAAM,QAAQ,GAAG,CAAC;AAAA,IACpB;AAAA,EACF;AACA,QAAM,aAAa,MAAM,QAAQ,OAAO,OAAO,IAAI,OAAO,UAAU,CAAC;AACrE,QAAM,MAAoB,CAAC;AAC3B,aAAW,MAAM,YAAY;AAC3B,QAAI,OAAO,OAAO,YAAY,OAAO,KAAM;AAC3C,UAAM,MAAM;AACZ,UAAM,MAAM,MAAM,QAAQ,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,WAAW,EAAE,OAAO,IAAI,IAAI,CAAC;AAC9E,QAAI,IAAI,WAAW,EAAG;AACtB,QAAI,KAAK;AAAA,MACP,OAAO,OAAO,IAAI,UAAU,WAAW,IAAI,QAAQ;AAAA,MACnD,WAAW,OAAO,IAAI,cAAc,WAAW,IAAI,YAAY;AAAA,MAC/D,KAAK,IAAI,MAAM,GAAG,UAAU;AAAA,IAC9B,CAAC;AACD,QAAI,IAAI,UAAU,WAAY;AAAA,EAChC;AACA,SAAO;AACT;AAEA,SAAS,YAAY,KAAmC;AACtD,MAAI,OAAO,QAAQ,YAAY,QAAQ,KAAM,QAAO;AACpD,QAAM,IAAI;AACV,MAAI,EAAE,OAAO,OAAO;AAClB,QAAI,OAAO,EAAE,SAAS,SAAU,QAAO;AACvC,UAAM,KAAmB,EAAE,IAAI,OAAO,MAAM,EAAE,KAAK;AACnD,QAAI,OAAO,EAAE,UAAU,SAAU,IAAG,QAAQ,EAAE;AAC9C,WAAO;AAAA,EACT;AACA,MAAI,EAAE,OAAO,UAAU;AACrB,QAAI,OAAO,EAAE,WAAW,SAAU,QAAO;AACzC,WAAO,EAAE,IAAI,UAAU,QAAQ,EAAE,OAAO;AAAA,EAC1C;AACA,MAAI,EAAE,OAAO,WAAW;AACtB,QAAI,OAAO,EAAE,WAAW,YAAY,OAAO,EAAE,SAAS,SAAU,QAAO;AACvE,WAAO,EAAE,IAAI,WAAW,QAAQ,EAAE,QAAQ,MAAM,EAAE,KAAK;AAAA,EACzD;AACA,SAAO;AACT;AAEA,SAAS,KAAK,IAA6C;AACzD,SAAO,OAAO;AAChB;AAEA,SAAS,QAAQ,GAAW,MAAM,KAAa;AAC7C,QAAM,IAAI,EAAE,KAAK,EAAE,QAAQ,QAAQ,GAAG;AACtC,SAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC;AACjD;;;AC3NA,eAAsB,YACpB,MAC4B;AAC5B,MAAI,KAAK,eAAe,WAAW,EAAG,OAAM,IAAI,MAAM,sCAAsC;AAC5F,MAAI,KAAK,iBAAiB,WAAW,EAAG,OAAM,IAAI,MAAM,wCAAwC;AAChG,MAAI,CAAC,KAAK,UAAU,KAAK,OAAO,WAAW,GAAG;AAC5C,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAGA,QAAM,aAAa,IAAI,IAAI,KAAK,iBAAiB,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AACjE,QAAM,UAAU,KAAK,eAAe,OAAO,CAAC,MAAM,WAAW,IAAI,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AACvF,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI;AAAA,MACR,gFAAgF,QAAQ;AAAA,QACtF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,kBAAkB,KAAK,mBAAmB;AAChD,QAAM,gBAAgB,KAAK,cAAc;AACzC,QAAM,iBAAiB,KAAK,kBAAkB;AAC9C,MAAI,iBAAiB,GAAG;AACtB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,QAAM,WAAW,KAAK,YAAY,KAAK;AACvC,QAAM,eAAe,KAAK,gBAAgB;AAC1C,QAAM,qBAAqB,KAAK,sBAAsB;AACtD,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,OAAK,SAAS,cAAc,KAAK,QAAQ,KAAK,IAAI;AAClD,QAAM,UAAU,KAAK,WAAW,kBAAkB;AAClD,QAAM,aACJ,KAAK,cACL,oBAAoB;AAAA,IAClB;AAAA,IACA,QAAQ,KAAK;AAAA,IACb,gBAAgB,KAAK;AAAA,EACvB,CAAC;AAEH,QAAM,eAAe,OAAO,SAAiB,QAAiC;AAC5E,UAAM,WAAW,MAAM,mBAAmB,MAAM,KAAK,kBAAkB,SAAS,KAAK,UAAU;AAC/F,WAAO,sBAAsB,QAAQ;AAAA,EACvC;AACA,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,gBAAgB,OAAO,SAAiB,QAA2C;AACvF,UAAM,WAAW,MAAM,mBAAmB,MAAM,KAAK,gBAAgB,SAAS,KAAK,UAAU;AAC7F,WAAO,WAAW,UAAU,SAAS;AAAA,EACvC;AAEA,MAAI,UAAU,KAAK;AACnB,MAAI,kBAAkB,MAAM,cAAc,SAAS,gBAAgB;AACnE,QAAM,kBAAkB,MAAM,aAAa,SAAS,kBAAkB;AACtE,MAAI,iBAAiB;AAErB,QAAM,SAAyB,CAAC;AAChC,QAAM,gBAAgC,CAAC;AACvC,QAAM,cAA8B,CAAC;AACrC,QAAM,UAAiC,CAAC;AACxC,MAAI,SAAS;AACb,MAAI,cAAc;AAClB,MAAI;AACJ,MAAI,YAAY;AAEhB,WAAS,QAAQ,GAAG,QAAQ,KAAK,WAAW,SAAS;AACnD;AACA,UAAM,UAAU,MAAM,KAAK,SAAS,eAAe;AAAA,MACjD,SAAS;AAAA,MACT,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,gBAAgB;AAAA,MAChB;AAAA,MACA,OAAO;AAAA,MACP,QAAQ,KAAK,UAAU,IAAI,gBAAgB,EAAE;AAAA,MAC7C;AAAA,MACA,WAAW;AAAA,IACb,CAAC;AAED,QAAI,WAAgC;AACpC,UAAM,oBAAoC,CAAC;AAC3C,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,YAAM,QAAQ,QAAQ,CAAC;AACvB,YAAM,EAAE,SAAS,WAAW,QAAQ,IAAI,gBAAgB,SAAS,KAAK;AACtE,UAAI,YAAY,KAAK,cAAc,SAAS;AAC1C,0BAAkB,KAAK;AAAA,UACrB,OAAO,MAAM;AAAA,UACb,WAAW,MAAM;AAAA,UACjB,QAAQ;AAAA,QACV,CAAC;AACD;AAAA,MACF;AACA,YAAM,mBAAmB,MAAM,aAAa,WAAW,SAAS,KAAK,SAAS,CAAC,UAAU;AACzF,UAAI,mBAAmB,iBAAiB,gBAAgB;AACtD,mBAAW;AAAA,UACT;AAAA,UACA,OAAO,MAAM;AAAA,UACb,WAAW,MAAM;AAAA,UACjB,cAAc,mBAAmB;AAAA,QACnC;AACA,kBAAU;AACV,yBAAiB;AAEjB,0BAAkB,MAAM,cAAc,SAAS,SAAS,KAAK,QAAQ;AACrE;AAAA,MACF;AACA,wBAAkB,KAAK;AAAA,QACrB,OAAO,MAAM;AAAA,QACb,WAAW,MAAM;AAAA,QACjB,QAAQ,YAAY,iBAAiB,QAAQ,CAAC,CAAC,mBAAc,eAAe,QAAQ,CAAC,CAAC;AAAA,MACxF,CAAC;AAAA,IACH;AAEA,QAAI,UAAU;AACZ,oBAAc,KAAK,QAAQ;AAC3B,oBAAc;AAAA,IAChB,OAAO;AACL;AACA,UAAI,gBAAgB,eAAe,KAAK,SAAS,EAAG;AAAA,IACtD;AAGA,eAAW,KAAK,mBAAmB;AACjC,aAAO,KAAK,CAAC;AACb,kBAAY,KAAK,CAAC;AAAA,IACpB;AACA,WAAO,OAAO,SAAS,mBAAoB,QAAO,MAAM;AAGxD,QAAI,gBAAgB,MAAM,QAAQ,KAAK,kBAAkB,GAAG;AAC1D,iBAAW,cAAc,eAAe,MAAM;AAAA,IAChD;AAEA,YAAQ,KAAK;AAAA,MACX;AAAA,MACA,YAAY;AAAA,MACZ,UAAU,QAAQ;AAAA,MAClB;AAAA,MACA,UAAU;AAAA,MACV,kBAAkB;AAAA,IACpB,CAAC;AAED,QAAI,eAAe,SAAU;AAAA,EAC/B;AAEA,QAAM,OAAO,WAAW,QAAQ;AAChC,SAAO;AAAA,IACL,eAAe;AAAA,IACf,0BAA0B;AAAA,IAC1B,wBAAwB;AAAA,IACxB,MAAM,iBAAiB;AAAA,IACvB;AAAA,IACA,eAAe;AAAA,IACf;AAAA,IACA;AAAA,IACA,cAAc,KAAK;AAAA,IACnB;AAAA,EACF;AACF;AAEA,SAAS,mBACP,MACA,WACA,SACA,KACA,YAC+C;AAC/C,SAAO,YAAkC;AAAA,IACvC,GAAG;AAAA,IACH;AAAA,IACA;AAAA,IACA,UAAU,CAAC,UAAU,QAAQ,KAAK,oBAAoB,SAAS,UAAU,GAAG;AAAA,IAC5E,QAAQ,GAAG,KAAK,MAAM,IAAI,GAAG;AAAA,EAC/B,CAAC;AACH;AAEA,SAAS,WACP,UACA,GACkB;AAClB,QAAM,EAAE,YAAY,UAAU,IAAI,kBAAkB,QAAQ;AAC5D,QAAM,gBAAgB,CAAC,GAAG,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC;AACzF,QAAM,iBAAiB,OAAO,QAAQ,UAAU,EAC7C,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,CAAC,WAAW,KAAK,OAAO,EAAE,WAAW,MAAM,EAAE;AACrD,SAAO,EAAE,eAAe,eAAe;AACzC;AAEA,SAAS,cAAc,UAA0B,UAAkC;AACjF,QAAM,QAAkB,CAAC;AACzB,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM;AAAA,MACJ,wCAAwC,SACrC,IAAI,CAAC,MAAM,IAAI,EAAE,KAAK,OAAO,EAAE,aAAa,QAAQ,CAAC,CAAC,GAAG,EACzD,KAAK,IAAI,CAAC;AAAA,IACf;AAAA,EACF;AACA,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM,SAAS,CAAC,GAAG,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC;AACpE,UAAM,KAAK,uBAAuB,OAAO,KAAK,IAAI,CAAC,mCAAmC;AAAA,EACxF;AACA,QAAM,KAAK,kDAAkD;AAC7D,SAAO,MAAM,KAAK,GAAG;AACvB;;;ACvNA,eAAsB,iBACpB,MAC6B;AAC7B,SAAO,uBAAuB,IAAI;AACpC;AAEA,eAAe,uBACb,MAC6B;AAC7B,MAAI,KAAK,UAAU,WAAW,EAAG,OAAM,IAAI,MAAM,2CAA2C;AAC5F,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,aAAa,KAAK,cAAc;AAEtC,QAAM,iBAAiB,OACrB,SACA,QACoC;AACpC,UAAM,WAAiD,MAAM,YAAkC;AAAA,MAC7F,GAAG;AAAA,MACH,WAAW,KAAK;AAAA,MAChB,UAAU,CAAC,UAAU,QAAQ,KAAK,oBAAoB,SAAS,UAAU,GAAG;AAAA,MAC5E,QAAQ,GAAG,KAAK,MAAM,IAAI,GAAG;AAAA,IAC/B,CAAC;AACD,UAAM,aAAqC,CAAC;AAC5C,eAAW,EAAE,YAAY,UAAU,KAAK,kBAAkB,QAAQ,EAAE,WAAW;AAC7E,iBAAW,UAAU,IAAI;AAAA,IAC3B;AACA,WAAO;AAAA,EACT;AAOA,QAAM,cAAc,CAAC,GAAG,IAAI,IAAI,KAAK,iBAAiB,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK;AAC9E,MAAI,YAAY,WAAW,EAAG,OAAM,IAAI,MAAM,6CAA6C;AAC3F,QAAM,QAAQ,CAAC,YAAoC,UAA4B;AAC7E,UAAM,UAAU,YAAY,OAAO,CAAC,OAAO,EAAE,MAAM,WAAW;AAC9D,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,qBAAqB,KAAK,gDAAgD,QAAQ;AAAA,UAChF;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AACA,WAAO,YAAY,IAAI,CAAC,OAAO,WAAW,EAAE,CAAE;AAAA,EAChD;AAEA,QAAM,cAAc;AAAA,IAClB,MAAM,eAAe,KAAK,iBAAiB,kBAAkB;AAAA,IAC7D;AAAA,EACF;AAGA,QAAM,UAMD,CAAC;AACN,aAAW,YAAY,KAAK,WAAW;AACrC,UAAM,MAAM,MAAM,SAAS,SAAS;AACpC,UAAM,aAAa,MAAM,eAAe,IAAI,eAAe,WAAW,KAAK,SAAS,IAAI,CAAC,EAAE;AAC3F,YAAQ,KAAK;AAAA,MACX,MAAM,SAAS;AAAA,MACf,eAAe,IAAI;AAAA,MACnB,SAAS,IAAI;AAAA,MACb,YAAY,IAAI;AAAA,MAChB,KAAK,MAAM,YAAY,aAAa,SAAS,IAAI,GAAG;AAAA,IACtD,CAAC;AAAA,EACH;AAEA,QAAM,SAA0B,QAAQ,IAAI,CAAC,MAAM;AACjD,UAAM,OAAO,gBAAgB,aAAa,EAAE,KAAK;AAAA,MAC/C;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW;AAAA,IACb,CAAC;AACD,UAAM,QAAuB;AAAA,MAC3B,MAAM,EAAE;AAAA,MACR,mBAAmBG,MAAK,WAAW;AAAA,MACnC,iBAAiBA,MAAK,EAAE,GAAG;AAAA,MAC3B,MAAM,KAAK;AAAA,MACX,QAAQ,EAAE,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK;AAAA,MACzC,SAAS,EAAE;AAAA,MACX,eAAe,EAAE;AAAA,MACjB,MAAM;AAAA,IACR;AACA,QAAI,EAAE,eAAe,OAAW,OAAM,aAAa,EAAE;AACrD,WAAO;AAAA,EACT,CAAC;AAED,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO;AAC9D,SAAO,QAAQ,CAAC,GAAG,MAAM;AACvB,MAAE,OAAO,IAAI;AAAA,EACf,CAAC;AACD,QAAM,OAAO,OAAO,CAAC;AAErB,QAAM,SAAS,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACtD,QAAM,UAAU,OAAO,IAAI,KAAK,IAAI,EAAG;AACvC,QAAM,WAA+B,OAAO,MAAM,CAAC,EAAE,IAAI,CAAC,UAAU;AAClE,UAAM,WAAW,OAAO,IAAI,MAAM,IAAI,EAAG;AAEzC,UAAM,OAAO,gBAAgB,UAAU,SAAS;AAAA,MAC9C;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW;AAAA,IACb,CAAC;AACD,UAAM,UAAU,KAAK,MAAM,IAAI,KAAK,OAAO,KAAK,OAAO,IAAI,MAAM,OAAO;AACxE,WAAO;AAAA,MACL,GAAG,KAAK;AAAA,MACR,GAAG,MAAM;AAAA,MACT,WAAW,KAAK;AAAA,MAChB,KAAK,KAAK;AAAA,MACV,MAAM,KAAK;AAAA,MACX;AAAA,IACF;AAAA,EACF,CAAC;AAED,SAAO,EAAE,QAAQ,MAAM,UAAU,oBAAoB,YAAY;AACnE;AAEA,SAASA,MAAK,IAAsB;AAClC,SAAO,GAAG,WAAW,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAClE;AAEA,SAAS,KAAK,MAAsB;AAClC,SAAO,KAAK,QAAQ,gBAAgB,GAAG,EAAE,YAAY;AACvD;AA2CO,SAAS,oBACd,QACA,OAAO,mBACQ;AACf,SAAO,UAAU,QAAQ,OAAO,IAAI;AACtC;AAGO,SAAS,gBACd,QACA,OAAO,eACQ;AACf,SAAO,UAAU,QAAQ,MAAM,IAAI;AACrC;AAEA,SAAS,UACP,QACA,gBACA,MACe;AACf,SAAO;AAAA,IACL;AAAA,IACA,MAAM,WAAW;AACf,YAAM,UAAU,KAAK,IAAI;AACzB,YAAM,WAAW,aAAa;AAAA,QAC5B,KAAK,OAAO;AAAA,QACZ,OAAO,OAAO;AAAA,QACd,QAAQ,OAAO;AAAA,QACf;AAAA,QACA,GAAI,OAAO,qBAAqB,EAAE,oBAAoB,OAAO,mBAAmB,IAAI,CAAC;AAAA,MACvF,CAAC;AACD,YAAM,SAAS,MAAM,mBAAyC;AAAA,QAC5D,WAAW,OAAO;AAAA,QAClB,kBAAkB,OAAO;AAAA,QACzB,iBAAiB,OAAO;AAAA,QACxB,qBAAqB,OAAO;AAAA,QAC5B,QAAQ,OAAO;AAAA,QACf;AAAA,QACA,gBAAgB,OAAO,kBAAkB;AAAA,QACzC,gBAAgB,OAAO,kBAAkB;AAAA,QACzC,MAAM,sBAA4C;AAAA,UAChD,kBAAkB,OAAO;AAAA,UACzB,gBAAgB;AAAA,QAClB,CAAC;AAAA,QACD,eAAe;AAAA,QACf,QAAQ,GAAG,OAAO,MAAM,IAAI,KAAK,IAAI,CAAC;AAAA,QACtC,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA,QAIzD,GAAI,OAAO,aAAa,SAAY,EAAE,UAAU,OAAO,SAAS,IAAI,CAAC;AAAA,QACrE,GAAI,OAAO,oBAAoB,EAAE,mBAAmB,OAAO,kBAAkB,IAAI,CAAC;AAAA,QAClF,GAAI,OAAO,WAAW,SAAY,EAAE,QAAQ,OAAO,OAAO,IAAI,CAAC;AAAA,MACjE,CAAC;AACD,aAAO;AAAA,QACL,eAAe,OAAO;AAAA,QACtB,SAAS,OAAO,KAAK;AAAA,QACrB,YAAY,KAAK,IAAI,IAAI;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AACF;AAQO,SAAS,cACd,QACA,OAAO,aACQ;AACf,SAAO;AAAA,IACL;AAAA,IACA,MAAM,WAAW;AACf,YAAM,UAAU,KAAK,IAAI;AACzB,YAAM,WAAW,iBAAiB;AAAA,QAChC,KAAK,OAAO;AAAA,QACZ,OAAO,OAAO;AAAA,QACd,QAAQ,OAAO;AAAA,MACjB,CAAC;AACD,YAAM,SAAS,MAAM,YAAkC;AAAA,QACrD,iBAAiB,OAAO;AAAA,QACxB,qBAAqB,OAAO;AAAA,QAC5B,QAAQ,OAAO;AAAA,QACf;AAAA,QACA,gBAAgB,OAAO;AAAA,QACvB,kBAAkB,OAAO;AAAA,QACzB,WAAW,OAAO,aAAa;AAAA,QAC/B,QAAQ,GAAG,OAAO,MAAM,IAAI,KAAK,IAAI,CAAC;AAAA,QACtC,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,KAAK,IAAI,CAAC;AAAA,MAC3D,CAAC;AACD,aAAO;AAAA,QACL,eAAe,OAAO;AAAA,QACtB,SAAS,OAAO;AAAA,QAChB,YAAY,KAAK,IAAI,IAAI;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AACF;AA4BO,SAAS,oBACd,QACA,OAAO,mBACQ;AACf,SAAO;AAAA,IACL;AAAA,IACA,MAAM,WAAW;AACf,YAAM,UAAU,KAAK,IAAI;AACzB,YAAM,iBACJ,OAAO,kBACP,aAAa;AAAA,QACX,KAAK,OAAO;AAAA,QACZ,OAAO,OAAO;AAAA,QACd,QAAQ,OAAO;AAAA,QACf,gBAAgB;AAAA,QAChB,GAAI,OAAO,qBAAqB,EAAE,oBAAoB,OAAO,mBAAmB,IAAI,CAAC;AAAA,MACvF,CAAC;AACH,YAAM,oBACJ,OAAO,sBACN,OAAO,sBACJ,uBAAuB,EAAE,YAAY,OAAO,oBAAoB,CAAC,IACjE;AACN,YAAM,qBAAqB,OAAO;AAClC,YAAM,WAAW,aAAa;AAAA,QAC5B,GAAI,OAAO,QAAQ,CAAC;AAAA,QACpB;AAAA,QACA,GAAI,oBAAoB,EAAE,kBAAkB,IAAI,CAAC;AAAA,QACjD,GAAI,qBAAqB,EAAE,mBAAmB,IAAI,CAAC;AAAA,MACrD,CAAC;AACD,YAAM,SAAS,MAAM,mBAAyC;AAAA,QAC5D,WAAW,OAAO;AAAA,QAClB,kBAAkB,OAAO;AAAA,QACzB,iBAAiB,OAAO;AAAA,QACxB,qBAAqB,OAAO;AAAA,QAC5B,QAAQ,OAAO;AAAA,QACf;AAAA,QACA,gBAAgB,OAAO,kBAAkB;AAAA,QACzC,gBAAgB,OAAO,kBAAkB;AAAA,QACzC,MAAM,sBAA4C;AAAA,UAChD,kBAAkB,OAAO;AAAA,UACzB,gBAAgB;AAAA,QAClB,CAAC;AAAA,QACD,eAAe;AAAA,QACf,QAAQ,GAAG,OAAO,MAAM,IAAI,KAAK,IAAI,CAAC;AAAA,QACtC,GAAI,OAAO,SAAS,SAAY,EAAE,MAAM,OAAO,KAAK,IAAI,CAAC;AAAA,QACzD,GAAI,OAAO,aAAa,SAAY,EAAE,UAAU,OAAO,SAAS,IAAI,CAAC;AAAA,QACrE,GAAI,OAAO,oBAAoB,EAAE,mBAAmB,OAAO,kBAAkB,IAAI,CAAC;AAAA,QAClF,GAAI,OAAO,WAAW,SAAY,EAAE,QAAQ,OAAO,OAAO,IAAI,CAAC;AAAA,MACjE,CAAC;AACD,aAAO;AAAA,QACL,eAAe,OAAO;AAAA,QACtB,SAAS,OAAO,KAAK;AAAA,QACrB,YAAY,KAAK,IAAI,IAAI;AAAA,MAC3B;AAAA,IACF;AAAA,EACF;AACF;;;AC5bA,SAAS,kBAAkB;AAiGpB,SAAS,kBAAkB,OAGZ;AACpB,MAAI,MAAM,aAAa,WAAW,GAAG;AACnC,UAAM,IAAI;AAAA,MACR,4BAA4B,MAAM,MAAM;AAAA,IAC1C;AAAA,EACF;AACA,QAAM,aAAa,MAAM,aAAa,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU;AACjE,QAAM,kBAAkB,MAAM,aAAa,SAAS,WAAW;AAC/D,MAAI,WAAW,WAAW,GAAG;AAG3B,UAAM,IAAI;AAAA,MACR,4BAA4B,MAAM,MAAM,+CAA0C,MAAM,aAAa,MAAM,+BAA+B,MAAM,aAAa,CAAC,GAAG,oBAAoB,gBAAgB;AAAA,IACvM;AAAA,EACF;AACA,QAAM,iBAAiB,WAAW,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE;AAC7D,QAAM,iBAAiB,iBAAiB,WAAW;AAGnD,QAAM,gBAAgB,oBAAoB,KAAK,mBAAmB,WAAW;AAC7E,SAAO;AAAA,IACL,QAAQ,MAAM;AAAA,IACd,cAAc,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,OAAO;AAAA,EACT;AACF;AAYA,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;AACF,CAAC;AAUD,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,kBAAkB;AACxB,IAAM,oBAAoB;AAE1B,SAAS,OAAO,GAAW,WAAsC;AAC/D,SAAO,IAAI;AAAA,IACT,EACG,YAAY,EACZ,MAAM,YAAY,EAClB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,UAAU,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,CAAC,CAAC;AAAA,EAC1E;AACF;AAQA,SAAS,YAAY,iBAAyB,eAA+B;AAC3E,QAAM,MAAM,OAAO,iBAAiB,0BAA0B;AAC9D,MAAI,IAAI,SAAS,EAAG,QAAO;AAC3B,QAAM,OAAO,OAAO,aAAa;AACjC,MAAI,MAAM;AACV,aAAW,KAAK,IAAK,KAAI,KAAK,IAAI,CAAC,EAAG;AACtC,SAAO,MAAM,IAAI;AACnB;AAYA,SAAS,mBACP,KACA,UACA,WACa;AACb,QAAM,UAAU,GAAG,IAAI,KAAK,IAAI,IAAI,YAAY,EAAE;AAClD,QAAM,MAAmB,CAAC;AAC1B,YAAU,QAAQ,CAAC,GAAG,MAAM;AAC1B,SAAK,EAAE,WAAW,IAAI,KAAK,EAAE,SAAS,kBAAmB;AAKzD,QAAI,QAAQ;AAAA,MACV;AAAA,MACA,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,WAAW,IAAI,MAAM,GAAG,GAAI,CAAC;AAAA,IAC/D;AACA,QAAI,IAAI,YAAY,EAAE,QAAQ,IAAI,SAAS,YAAY,MAAM,EAAE,KAAK,YAAY,GAAG;AACjF,cAAQ,KAAK,IAAI,OAAO,CAAC;AAAA,IAC3B;AACA,QAAI,QAAQ,gBAAiB;AAC7B,QAAI,KAAK;AAAA,MACP;AAAA,MACA,SAAS,YAAY,CAAC;AAAA,MACtB;AAAA,MACA,UAAU,aAAa,EAAE,QAAQ,EAAE,IAAI,2BAA2B,MAAM,QAAQ,CAAC,CAAC;AAAA,MAClF,SAAS,EAAE,WAAW;AAAA,IACxB,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAEA,SAAS,mBACP,KACA,UACA,WACa;AACb,QAAM,UAAU,GAAG,IAAI,KAAK,IAAI,IAAI,YAAY,EAAE;AAClD,QAAM,MAAmB,CAAC;AAC1B,aAAW,KAAK,WAAW;AAEzB,QAAI,EAAE,WAAW,WAAY;AAM7B,UAAM,QAAQ,EAAE,WAAW,IAAI,KAAK;AACpC,QAAI,KAAK,SAAS,kBAAmB;AASrC,UAAM,QAAQ,YAAY,SAAS,GAAG,EAAE,KAAK,IAAI,IAAI,EAAE;AACvD,QAAI,QAAQ,gBAAiB;AAC7B,QAAI,KAAK;AAAA,MACP;AAAA,MACA,SAAS,YAAY,EAAE,EAAE;AAAA,MACzB;AAAA,MACA,UAAU,sBAAsB,EAAE,KAAK,2BAA2B,MAAM,QAAQ,CAAC,CAAC;AAAA,MAClF,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAAS,mBACP,KACA,UACA,WACa;AACb,QAAM,MAAmB,CAAC;AAC1B,YAAU,QAAQ,CAAC,MAAM,MAAM;AAC7B,UAAM,QAAQ,YAAY,IAAI,OAAO,IAAI;AACzC,QAAI,QAAQ,gBAAiB;AAC7B,QAAI,KAAK;AAAA,MACP;AAAA,MACA,SAAS,QAAQ,CAAC;AAAA,MAClB;AAAA,MACA,UAAU,cAAc,IAAI,2BAA2B,MAAM,QAAQ,CAAC,CAAC;AAAA,MACvE,SAAS;AAAA,IACX,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AASA,eAAsB,iBACpB,MACA,OACA,kBAC4B;AAC5B,MAAI,KAAK,aAAa,WAAW,GAAG;AAClC,UAAM,IAAI;AAAA,MACR,2BAA2B,KAAK,MAAM;AAAA,IACxC;AAAA,EACF;AAKA,QAAM,aAA0B,CAAC;AACjC,OAAK,aAAa,QAAQ,CAAC,KAAK,MAAM;AACpC,UAAM,KAAK,IAAI,eAAe;AAC9B,QAAI,OAAO,cAAc,OAAO,OAAO;AACrC,iBAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;AAAA,IAChE;AACA,QAAI,OAAO,cAAc,OAAO,OAAO;AACrC,iBAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;AAAA,IAChE;AACA,QAAI,OAAO,eAAe,OAAO,OAAO;AACtC,iBAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;AAAA,IAChE;AAAA,EACF,CAAC;AACD,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAE3C,QAAM,WAAW,oBAAI,IAAuB;AAC5C,QAAM,YAAY,oBAAI,IAAY;AAClC,aAAW,KAAK,YAAY;AAC1B,QAAI,SAAS,IAAI,EAAE,QAAQ,KAAK,UAAU,IAAI,EAAE,OAAO,EAAG;AAC1D,aAAS,IAAI,EAAE,UAAU,CAAC;AAC1B,cAAU,IAAI,EAAE,OAAO;AAAA,EACzB;AAEA,QAAM,eAAmC,CAAC;AAC1C,WAAS,IAAI,GAAG,IAAI,KAAK,aAAa,QAAQ,KAAK;AACjD,UAAM,MAAM,KAAK,aAAa,CAAC;AAC/B,UAAM,QAAQ,SAAS,IAAI,CAAC;AAC5B,UAAM,WAAqB,CAAC;AAC5B,QAAI,UAA0B;AAC9B,QAAI;AAEJ,QAAI,OAAO;AACT,eAAS,KAAK,MAAM,QAAQ;AAC5B,UAAI,MAAM,YAAY,MAAM;AAC1B,YAAI;AACF,gBAAM,IAAI,MAAM,iBAAiB,KAAK,MAAM,OAAO;AACnD,oBAAU,EAAE;AACZ,mBAAS,KAAK,gBAAgB,EAAE,UAAU,SAAS,MAAM,WAAM,EAAE,MAAM,EAAE;AAAA,QAC3E,SAAS,KAAK;AAIZ,6BACE,eAAe,kBACX,6CAA6C,IAAI,IAAI,MAAM,GAAG,GAAG,CAAC,KAClE,wBAAwB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAC9E,mBAAS,KAAK,kCAA6B,gBAAgB,EAAE;AAAA,QAC/D;AAAA,MACF,OAAO;AACL,iBAAS,KAAK,kEAA6D;AAAA,MAC7E;AAAA,IACF,OAAO;AACL,YAAM,KAAK,IAAI,eAAe;AAC9B,YAAM,OAAO,OAAO,QAAQ,gCAAgC;AAC5D,eAAS,KAAK,eAAe,IAAI,2BAA2B;AAAA,IAC9D;AAEA,UAAM,sBAAsB,UAAU;AACtC,UAAM,aAAa,qBAAqB;AACxC,UAAM,YAAY,uBAAuB,CAAC,cAAc,YAAY;AACpE,iBAAa,KAAK;AAAA,MAChB,OAAO,IAAI;AAAA,MACX,OAAO,IAAI;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,aAAa,EAAE,YAAY,MAAe,iBAAiB,IAAI,CAAC;AAAA,MACpE;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO,kBAAkB,EAAE,QAAQ,KAAK,QAAQ,aAAa,CAAC;AAChE;AAoCO,SAAS,yBAAyB,KAAmD;AAC1F,QAAM,cAAc,CAAC,cAAoE;AACvF,QAAI,cAAc,QAAQ,OAAO,cAAc,SAAU,QAAO;AAChE,UAAM,EAAE,SAAS,OAAO,IAAI;AAC5B,QAAI,OAAO,YAAY,UAAW,QAAO;AACzC,WAAO,EAAE,SAAS,QAAQ,OAAO,WAAW,WAAW,SAAS,GAAG;AAAA,EACrE;AAEA,QAAM,QAAQ,IAAI,MAAM,aAAa;AACrC,MAAI,OAAO;AACT,QAAI;AACF,YAAM,SAAS,YAAY,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC;AAC/C,UAAI,OAAQ,QAAO;AAAA,IACrB,QAAQ;AAAA,IAER;AAAA,EACF;AAGA,QAAM,QAAQ,IAAI,QAAQ,GAAG;AAC7B,MAAI,UAAU,IAAI;AAChB,UAAM,YAAY,YAAY,qBAAqB,IAAI,MAAM,KAAK,CAAC,CAAC;AACpE,QAAI,UAAW,QAAO;AAAA,EACxB;AACA,QAAM,IAAI,gBAAgB,uBAAuB,GAAG;AACtD;AAQO,SAAS,4BACd,IACA,OAAkC,CAAC,GACf;AACpB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,kBAAkB,KAAK,mBAAmB;AAChD,QAAM,cAAc,KAAK,eAAe;AACxC,QAAM,aAAa,KAAK,cAAc,IAAI,WAAW;AACrD,QAAM,OAAO,KAAK;AAClB,QAAM,SAAS,OAAO,UAA2C;AAE/D,QAAI;AACF,YAAM,MAAM,OAAO,KAAK;AAAA,IAC1B,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO,OAAO,aAAa,YAAY;AACrC,UAAM,UAAU;AAAA,MACd;AAAA,MACA,UAAU;AAAA,QACR;AAAA,UACE,MAAM;AAAA,UACN,SACE;AAAA,QACJ;AAAA,QACA;AAAA,UACE,MAAM;AAAA,UACN,SAAS,gBAAgB,YAAY,KAAK;AAAA,EACxC,YAAY,WAAW,aAAa,YAAY,QAAQ;AAAA,IAAO,EACjE;AAAA;AAAA,EAAyB,QAAQ,MAAM,GAAG,eAAe,CAAC;AAAA,QAC5D;AAAA,MACF;AAAA,MACA,aAAa;AAAA,MACb,WAAW;AAAA,IACb;AACA,QAAI;AACJ,aAAS,UAAU,GAAG,UAAU,aAAa,WAAW;AACtD,YAAM,UAAU,KAAK,IAAI;AACzB,YAAM,OAAO;AAAA,QACX,SAAS,WAAW;AAAA,QACpB,UAAU;AAAA,QACV;AAAA,QACA,UAAU;AAAA,QACV,SAAS;AAAA,QACT,cAAc;AAAA,QACd,WAAW;AAAA,QACX,WAAW;AAAA,QACX,aAAa;AAAA,QACb,gBAAgB,CAAC;AAAA,MACnB,CAAC;AACD,UAAI;AACF,cAAM,OAAO,MAAM,WAAW,YAAY;AAAA,UACxC,SAAS;AAAA,UACT,OAAO,KAAK,aAAa;AAAA,UACzB,OAAO;AAAA,UACP;AAAA,UACA,eAAe,8BAA8B,SAAS,KAAK,qBAAqB;AAAA,UAChF,MAAM;AAAA,YACJ,GAAG,KAAK;AAAA,YACR,eAAe,YAAY;AAAA,YAC3B,SAAS,OAAO,OAAO;AAAA,UACzB;AAAA,UACA,QAAQ,KAAK;AAAA,UACb,SAAS,MAAM,GAAG,KAAK,OAAO;AAAA,UAC9B,SAAS,CAAC,aAAa,sBAAsB,UAAU,KAAK;AAAA,UAC5D,kBAAkB,CAAC,UAAU,KAAK,mBAAmB,OAAO,OAAO;AAAA,QACrE,CAAC;AACD,YAAI,CAAC,KAAK,UAAW,OAAM,KAAK;AAChC,cAAM,OAAO,KAAK;AAClB,cAAM,MACH,KAA4D,UAAU,CAAC,GAAG,SACvE,WAAW;AACjB,cAAM,OAAO;AAAA,UACX,SAAS,WAAW;AAAA,UACpB,UAAU;AAAA,UACV;AAAA,UACA,UAAU;AAAA,UACV,SAAS;AAAA,UACT,cAAc;AAAA,UACd,WAAW;AAAA,UACX,WAAW,KAAK,IAAI;AAAA,UACpB,YAAY,KAAK,IAAI,IAAI;AAAA,UACzB,cAAc;AAAA,UACd,gBAAgB,CAAC;AAAA,QACnB,CAAC;AACD,eAAO,yBAAyB,GAAG;AAAA,MACrC,SAAS,KAAK;AACZ,kBAAU;AACV,cAAM,OAAO;AAAA,UACX,SAAS,WAAW;AAAA,UACpB,UAAU;AAAA,UACV;AAAA,UACA,UAAU;AAAA,UACV,SAAS;AAAA,UACT,cAAc;AAAA,UACd,WAAW;AAAA,UACX,WAAW,KAAK,IAAI;AAAA,UACpB,YAAY,KAAK,IAAI,IAAI;AAAA,UACzB,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,UAC7D,gBAAgB,CAAC;AAAA,QACnB,CAAC;AAAA,MACH;AAAA,IACF;AACA,UAAM,mBAAmB,QAAQ,UAAU,IAAI,MAAM,OAAO,OAAO,CAAC;AAAA,EACtE;AACF;AAKA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;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;AAgBM,SAAS,yBACd,OAA0D,CAAC,GACvC;AACpB,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,SAAS,KAAK,oBAAoB;AACxC,SAAO,OAAO,aAAa,YAAY;AACrC,UAAM,OAAO,QAAQ,KAAK;AAC1B,QAAI,KAAK,SAAS;AAChB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ,qBAAqB,KAAK,MAAM;AAAA,MAC1C;AACF,UAAM,cAAc,YAAY,MAC7B,YAAY,EACZ,MAAM,YAAY,EAClB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;AACxD,QAAI,YAAY,WAAW;AACzB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AACF,UAAM,QAAQ,KAAK,YAAY;AAC/B,UAAM,OAAO,YAAY,OAAO,CAAC,MAAM,MAAM,SAAS,CAAC,CAAC,EAAE;AAC1D,UAAM,SAAS,OAAO,YAAY;AAClC,WAAO,UAAU,YACb;AAAA,MACE,SAAS;AAAA,MACT,QAAQ,mBAAmB,IAAI,IAAI,YAAY,MAAM;AAAA,IACvD,IACA;AAAA,MACE,SAAS;AAAA,MACT,QAAQ,wBAAwB,IAAI,IAAI,YAAY,MAAM;AAAA,IAC5D;AAAA,EACN;AACF;;;ACpmBA,SAAS,aAAa,UAAsC;AAC1D,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI,SAAS,SAAS,MAAM,EAAG,QAAO;AACtC,MAAI,SAAS,WAAW,OAAO,EAAG,QAAO;AACzC,SAAO;AACT;AAYO,SAAS,qBAAqB,QAAoD;AACvF,QAAM,YAAwB,CAAC;AAC/B,QAAM,YAAgC,CAAC;AACvC,QAAM,YAAsB,CAAC;AAC7B,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,MAAM,QAAQ;AACvB,QAAI,GAAG,SAAS,aAAa;AAC3B,YAAM,OAAQ,GAAyB;AACvC,UAAI,QAAQ,CAAC,UAAU,IAAI,IAAI,GAAG;AAChC,kBAAU,IAAI,IAAI;AAClB,kBAAU,KAAK,IAAI;AAAA,MACrB;AAAA,IACF,WAAW,GAAG,SAAS,YAAY;AACjC,YAAM,IAAI;AACV,gBAAU,KAAK;AAAA,QACb,MAAM,aAAa,EAAE,QAAQ;AAAA,QAC7B,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,QAC3B,SAAS,EAAE,WAAW;AAAA,MACxB,CAAC;AAAA,IACH,WAAW,GAAG,SAAS,oBAAoB;AACzC,YAAM,IAAI;AACV,gBAAU,KAAK;AAAA,QACb,IAAI,EAAE;AAAA,QACN,OAAO,EAAE;AAAA,QACT,QAAQ,EAAE,UAAU;AAAA,QACpB,GAAI,EAAE,YAAY,SAAY,EAAE,SAAS,EAAE,QAAQ,IAAI,CAAC;AAAA,MAC1D,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,EAAE,WAAW,WAAW,UAAU;AAC3C;;;ACzCO,SAAS,qBACd,QAC0C;AAC1C,SAAO,OAAO,SAAS,UAAU,QAAQ;AACvC,UAAM,SAAS,MAAM,OAAO,IAAI,UAAU,EAAE,GAAG,KAAK,QAAQ,CAAC;AAC7D,WAAO,qBAAqB,MAAM;AAAA,EACpC;AACF;AAaA,eAAsB,eACpB,OACA,OACA,kBAC2B;AAC3B,QAAM,UAAU,MAAM;AAAA,IACpB,EAAE,QAAQ,MAAM,IAAI,cAAc,MAAM,aAAa;AAAA,IACrD;AAAA,IACA;AAAA,EACF;AACA,SAAO,EAAE,GAAG,SAAS,OAAO,MAAM,MAAM;AAC1C;AAiBO,SAAS,oBAAoB,UAAwD;AAC1F,QAAM,OAAwB,CAAC;AAC/B,aAAW,KAAK,UAAU;AACxB,eAAW,KAAK,EAAE,cAAc;AAC9B,WAAK,KAAK;AAAA,QACR,SAAS,EAAE;AAAA,QACX,YAAY,EAAE;AAAA,QACd,OAAO,EAAE;AAAA,QACT,UAAU,EAAE;AAAA,QACZ,QAAQ,EAAE,YAAY,SAAS;AAAA,QAC/B,UAAU,EAAE;AAAA,MACd,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAmBO,SAAS,kBAAkB,MAAmD;AACnF,QAAM,UAAU,oBAAI,IAA+C;AACnE,MAAI,SAAS;AACb,aAAW,KAAK,MAAM;AACpB,UAAM,IAAI,QAAQ,IAAI,EAAE,OAAO,KAAK,EAAE,OAAO,GAAG,QAAQ,EAAE;AAC1D,MAAE;AACF,QAAI,EAAE,WAAW,QAAQ;AACvB,QAAE;AACF;AAAA,IACF;AACA,YAAQ,IAAI,EAAE,SAAS,CAAC;AAAA,EAC1B;AACA,MAAI,uBAAuB;AAC3B,aAAW,KAAK,QAAQ,OAAO,EAAG,KAAI,EAAE,QAAQ,KAAK,EAAE,WAAW,EAAE,MAAO;AAC3E,SAAO;AAAA,IACL,SAAS,QAAQ;AAAA,IACjB;AAAA,IACA,cAAc,KAAK;AAAA,IACnB;AAAA,IACA,QAAQ,KAAK,SAAS;AAAA,IACtB,UAAU,KAAK,WAAW,IAAI,IAAI,SAAS,KAAK;AAAA,EAClD;AACF;AAWA,SAAS,WAAW,GAAmB;AACrC,SAAO,EAAE,QAAQ,OAAO,KAAK,EAAE,QAAQ,UAAU,GAAG;AACtD;AAEA,SAASC,UAAS,GAAW,KAAqB;AAChD,SAAO,EAAE,UAAU,MAAM,IAAI,GAAG,EAAE,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;AAClE;AASO,SAAS,yBACd,MACA,OAAgC,CAAC,GACzB;AACR,QAAM,QAAQ,KAAK,oBAAoB;AACvC,QAAM,MAAM,kBAAkB,IAAI;AAClC,QAAM,MAAM,CAAC,MAAc,GAAG,KAAK,MAAM,IAAI,GAAG,CAAC;AACjD,QAAM,KAAK,CAAC,MAAgB,WAAWA,UAAS,EAAE,KAAK,IAAI,GAAG,KAAK,CAAC,KAAK;AACzE,QAAM,MAAgB,CAAC,KAAK,KAAK,SAAS,kCAAkC,IAAI,EAAE;AAClF,MAAI,KAAK,MAAM;AACb,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,IAAI,EAAG,KAAI,KAAK,OAAO,CAAC,OAAO,CAAC,EAAE;AAC3E,QAAI,KAAK,EAAE;AAAA,EACb;AACA,MAAI;AAAA,IACF,KAAK,IAAI,oBAAoB,IAAI,IAAI,OAAO,wCACrC,IAAI,MAAM,IAAI,IAAI,YAAY,4BAA4B,IAAI,IAAI,QAAQ,CAAC,YAC3E,IAAI,MAAM;AAAA,IACjB;AAAA,EACF;AACA,QAAM,QAAQ,KAAK,OAAO,CAAC,MAAM,EAAE,WAAW,MAAM;AACpD,MAAI,MAAM,SAAS,GAAG;AACpB,QAAI,KAAK,mBAAmB,IAAI,sCAAsC,qBAAqB;AAC3F,eAAW,KAAK,OAAO;AACrB,UAAI,KAAK,KAAK,WAAW,EAAE,UAAU,CAAC,MAAM,WAAW,EAAE,QAAQ,CAAC,MAAM,GAAG,EAAE,QAAQ,CAAC,IAAI;AAAA,IAC5F;AACA,QAAI,KAAK,EAAE;AAAA,EACb,OAAO;AACL,QAAI,KAAK,sDAAiD,EAAE;AAAA,EAC9D;AACA,MAAI,KAAK,yBAAyB,EAAE;AACpC,aAAW,WAAW,CAAC,GAAG,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG;AAC9D,UAAM,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,YAAY,OAAO;AAC1D,UAAM,SAAS,UAAU,OAAO,CAAC,MAAM,EAAE,WAAW,MAAM,EAAE;AAC5D,UAAM,OAAO,WAAW,UAAU,SAAS,WAAM;AACjD,QAAI;AAAA,MACF,OAAO,WAAW,UAAU,CAAC,EAAG,UAAU,CAAC,WAAM,MAAM,IAAI,UAAU,MAAM,IAAI,IAAI;AAAA,MACnF;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,eAAW,KAAK,WAAW;AACzB,UAAI;AAAA,QACF,KAAK,WAAW,EAAE,QAAQ,CAAC,MAAM,EAAE,WAAW,SAAS,gBAAW,aAAQ,MAAM,GAAG,EAAE,QAAQ,CAAC;AAAA,MAChG;AAAA,IACF;AACA,QAAI,KAAK,EAAE;AAAA,EACb;AACA,SAAO,IAAI,KAAK,IAAI;AACtB;;;ACzFA,SAAS,YAAY,GAGnB;AACA,SAAO,oBAAoB,CAAC,IACxB,EAAE,SAAS,EAAE,SAAS,GAAI,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,IAAI,CAAC,EAAG,IACzE,EAAE,SAAS,EAAE;AACnB;AAOA,eAAsB,eACpB,MAC+B;AAC/B,QAAM,WAAW,KAAK,YAAY,kBAAkB;AACpD,QAAM,iBAAiB,KAAK,kBAAkB;AAC9C,MAAI,iBAAiB,GAAG;AACtB,UAAM,IAAI,MAAM,6CAA6C;AAAA,EAC/D;AAGA,MAAI,WAAW,KAAK;AACpB,MAAI,CAAC,UAAU;AACb,QAAI,CAAC,KAAK,OAAO,CAAC,KAAK,OAAO;AAC5B,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,eAAW,aAAa;AAAA,MACtB,KAAK,KAAK;AAAA,MACV,OAAO,KAAK;AAAA,MACZ,QAAQ,KAAK,UAAU;AAAA;AAAA,MAEvB,gBAAgB;AAAA,IAClB,CAAC;AAAA,EACH;AAGA,QAAM,mBAAmB,KAAK,oBAAoB,KAAK;AACvD,MAAI,eAAe,KAAK;AACxB,MAAI,CAAC,cAAc;AACjB,UAAM,sBAAsB,KAAK;AACjC,UAAM,SAAS,KAAK;AACpB,QAAI,CAAC,uBAAuB,CAAC,QAAQ;AACnC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,QAAI,iBAAiB,WAAW,GAAG;AACjC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,mBAAe,OAAO,YAAmD;AACvE,YAAM,WAAW,MAAM,YAAkC;AAAA,QACvD,WAAW;AAAA,QACX,UAAU,CAAC,UAAU,QAAQ,oBAAoB,SAAS,UAAU,GAAG;AAAA,QACvE,aAAa,gBAAgB,YAAY,OAAO,CAAC;AAAA,QACjD,QAAQ,GAAG,MAAM,UAAU,YAAY,OAAO,CAAC;AAAA,QAC/C,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,QAC7C,GAAI,KAAK,SAAS,SAAY,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QACrD,GAAI,KAAK,SAAS,SAAY,EAAE,MAAM,KAAK,KAAK,IAAI,CAAC;AAAA,QACrD,GAAI,KAAK,UAAU,EAAE,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,QAChD,GAAI,KAAK,UAAU,EAAE,SAAS,KAAK,QAAQ,IAAI,CAAC;AAAA,QAChD,GAAI,KAAK,cAAc,EAAE,aAAa,KAAK,YAAY,IAAI,CAAC;AAAA,QAC5D,GAAI,KAAK,mBAAmB,SAAY,EAAE,gBAAgB,KAAK,eAAe,IAAI,CAAC;AAAA,QACnF,GAAI,KAAK,sBAAsB,SAC3B,EAAE,mBAAmB,KAAK,kBAAkB,IAC5C,CAAC;AAAA,QACL,GAAI,KAAK,MAAM,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,MACtC,CAAC;AACD,YAAM,QAAQ,sBAAsB,QAAQ;AAI5C,YAAM,OAAO,IAAI;AAAA,QACf,kBAAkB,QAAQ,EAAE,UAAU,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC;AAAA,MAC9E;AACA,YAAM,cAAc,iBAAiB,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,EAAE,KAAK,CAAC;AACnE,aAAO,EAAE,OAAO,YAAY;AAAA,IAC9B;AAAA,EACF;AAKA,QAAM,eAAe,CAAC,SAA8C;AAClE,UAAM,aAAqC,CAAC;AAC5C,QAAI,KAAK,eAAe,KAAK,YAAY,SAAS,GAAG;AACnD,uBAAiB,QAAQ,CAAC,GAAG,MAAM;AACjC,mBAAW,EAAE,EAAE,IAAI,KAAK,YAAa,CAAC,KAAK;AAAA,MAC7C,CAAC;AACD,UAAI,OAAO,KAAK,UAAU,EAAE,SAAS,EAAG,QAAO;AAAA,IACjD;AACA,eAAW,YAAY,KAAK;AAC5B,WAAO;AAAA,EACT;AAGA,QAAM,cAAgC,CAAC;AACvC,aAAW,QAAQ,KAAK,OAAO;AAC7B,UAAM,WAAW,MAAM,aAAa,KAAK,OAAO;AAChD,gBAAY,KAAK;AAAA,MACf,SAAS,KAAK;AAAA,MACd,OAAO,KAAK;AAAA,MACZ,UAAU,KAAK;AAAA,MACf,OAAO,SAAS;AAAA,MAChB,GAAI,KAAK,WAAW,SAAY,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;AAAA,MAC3D,GAAI,SAAS,gBAAgB,SAAY,EAAE,aAAa,SAAS,YAAY,IAAI,CAAC;AAAA,IACpF,CAAC;AAAA,EACH;AAGA,QAAM,OAAO,OAAO,SAEmD;AACrE,UAAM,WAAW,MAAM,SAAU,QAAQ;AAAA,MACvC,gBAAgB,KAAK,IAAI;AAAA,MACzB,SAAS,CAAC;AAAA,MACV,UAAU,CAAC;AAAA,MACX;AAAA,MACA,YAAY;AAAA,MACZ,QAAQ,IAAI,gBAAgB,EAAE;AAAA,MAC9B,eAAe,CAAC;AAAA,IAClB,CAAC;AAYD,UAAM,OAAoB;AAAA,MACxB;AAAA,QACE,SAAS,KAAK,IAAI;AAAA,QAClB,OAAO,KAAK,IAAI;AAAA,QAChB,GAAI,KAAK,IAAI,gBAAgB,SAAY,EAAE,aAAa,KAAK,IAAI,YAAY,IAAI,CAAC;AAAA,QAClF,GAAI,KAAK,IAAI,cAAc,SAAY,EAAE,WAAW,KAAK,IAAI,UAAU,IAAI,CAAC;AAAA,MAC9E;AAAA,IACF;AACA,eAAW,KAAK,UAAU;AACxB,YAAM,EAAE,SAAS,UAAU,IAAI,YAAY,CAAC;AAC5C,YAAM,WAAW,MAAM,aAAc,OAAO;AAC5C,WAAK,KAAK;AAAA,QACR;AAAA,QACA,OAAO,SAAS;AAAA,QAChB,GAAI,SAAS,gBAAgB,SAAY,EAAE,aAAa,SAAS,YAAY,IAAI,CAAC;AAAA,QAClF,GAAI,cAAc,SAAY,EAAE,UAAU,IAAI,CAAC;AAAA,MACjD,CAAC;AAAA,IACH;AAEA,QAAI,OAAO,KAAK,CAAC;AACjB,eAAW,SAAS,MAAM;AACxB,UAAI,MAAM,QAAQ,KAAK,MAAO,QAAO;AAAA,IACvC;AACA,WAAO;AAAA,MACL,SAAS,KAAK;AAAA,MACd,OAAO,KAAK;AAAA,MACZ,GAAI,KAAK,gBAAgB,SAAY,EAAE,aAAa,KAAK,YAAY,IAAI,CAAC;AAAA,MAC1E,GAAI,KAAK,cAAc,SAAY,EAAE,WAAW,KAAK,UAAU,IAAI,CAAC;AAAA,IACtE;AAAA,EACF;AAGA,QAAM,QAAQ,OAAO,SAEkD;AAGrE,UAAM,UAAU,CAAC,GAAG,KAAK,OAAO,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAClE,UAAM,gBAAgC,QAAQ,IAAI,CAAC,UAAU;AAAA,MAC3D,SAAS,KAAK;AAAA,MACd,aAAa,YAAY,KAAK,OAAO;AAAA,MACrC,YAAY,aAAa,IAAI;AAAA,MAC7B,WAAW,KAAK;AAAA,MAChB,YAAY,KAAK;AAAA,IACnB,EAAE;AAEF,UAAM,WAAW,MAAM,SAAU,QAAQ;AAAA,MACvC,gBAAgB,QAAQ,CAAC,EAAG;AAAA,MAC5B,SAAS,CAAC;AAAA,MACV,UAAU,CAAC;AAAA;AAAA;AAAA,MAGX,gBAAgB;AAAA;AAAA,MAEhB,YAAY;AAAA,MACZ,QAAQ,IAAI,gBAAgB,EAAE;AAAA,MAC9B;AAAA,IACF,CAAC;AAED,UAAM,QAAQ,SAAS,CAAC;AAGxB,UAAM,SAAS,QAAQ,YAAY,KAAK,IAAI,EAAE,SAAS,QAAQ,CAAC,EAAG,QAAkB;AACrF,UAAM,WAAW,MAAM,aAAc,OAAO,OAAO;AACnD,WAAO;AAAA,MACL,SAAS,OAAO;AAAA,MAChB,OAAO,SAAS;AAAA,MAChB,GAAI,SAAS,gBAAgB,SAAY,EAAE,aAAa,SAAS,YAAY,IAAI,CAAC;AAAA,MAClF,GAAI,OAAO,cAAc,SAAY,EAAE,WAAW,OAAO,UAAU,IAAI,CAAC;AAAA,IAC1E;AAAA,EACF;AAGA,QAAM,SAAS,MAAM,WAAW;AAAA,IAC9B,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,KAAK;AAAA,IACb,GAAI,KAAK,QAAQ,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC;AAAA,IAC1C,GAAI,KAAK,MAAM,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;AAAA,EACtC,CAAC;AAED,SAAO,EAAE,SAAS,OAAO,SAAS,MAAM,OAAO,MAAM,OAAO,OAAO,MAAM;AAC3E;;;AC7VA,SAAS,cAAAC,mBAAkB;AAC3B,SAAS,QAAAC,aAAY;;;ACnCrB,SAAS,cAAAC,mBAAkB;AAE3B,SAA2B,4BAA4B;AAahD,IAAM,mBAA2C;AAAA,EACtD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAwBO,IAAM,uBAAuB;AAmB7B,SAAS,kBAAkB,MAAuC;AACvE,QAAM,YAAY,KAAK,aAAa;AACpC,MAAI,UAAU,WAAW,EAAG,OAAM,IAAI,gBAAgB,0CAA0C;AAChG,QAAM,YAAY,KAAK,KAAK,OAAO;AACnC,QAAM,SAAS,KAAK,WAAW,YAAY,CAAC,SAAS,IAAI,CAAC;AAC1D,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,QAAM,MAAsB,CAAC;AAC7B,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,WAAW,WAAW;AAS/B,UAAM,YAAY,KAAK,mBACnB,SACA,OAAO,OAAO,CAAC,UAAU,qBAAqB,SAAS,KAAK,CAAC;AACjE,UAAM,YAAY,UAAU,SAAS,IAAI,YAAY,CAAC,oBAAoB;AAC1E,eAAW,SAAS,WAAW;AAC7B,YAAM,UAAwB;AAAA,QAC5B,GAAG,KAAK;AAAA,QACR,MAAM,GAAG,KAAK,KAAK,QAAQ,OAAO,IAAI,OAAO,IAAI,KAAK;AAAA,QACtD,OAAO,EAAE,GAAG,KAAK,KAAK,OAAO,SAAS,MAAM;AAAA,QAC5C,UAAU,EAAE,GAAI,KAAK,KAAK,YAAY,CAAC,GAAI,SAAS,cAAc,MAAM;AAAA,MAC1E;AACA,YAAM,KAAK,eAAe,OAAO;AACjC,UAAI,KAAK,IAAI,EAAE,EAAG;AAClB,WAAK,IAAI,EAAE;AACX,UAAI,KAAK,OAAO;AAAA,IAClB;AAAA,EACF;AACA,MAAI,IAAI,WAAW,GAAG;AAGpB,UAAM,IAAI;AAAA,MACR,uDAAuD,UAAU,KAAK,IAAI,CAAC,cAAc,OAAO,KAAK,IAAI,CAAC;AAAA,IAC5G;AAAA,EACF;AACA,SAAO;AACT;AASO,SAAS,cACd,SACqD;AACrD,QAAM,IAAI,QAAQ;AAClB,QAAM,UAAU,GAAG;AACnB,QAAM,QAAQ,GAAG;AACjB,MAAI,OAAO,YAAY,YAAY,OAAO,UAAU,UAAU;AAC5D,WAAO,EAAE,SAAiC,MAAM;AAAA,EAClD;AACA,SAAO;AACT;AASO,SAAS,eAAe,SAA+B;AAC5D,QAAM,QAAQ,qBAAqB,yBAAyB,OAAO,CAAC,KAAK;AACzE,SAAO,GAAG,KAAK,IAAI,iBAAiB,OAAO,EAAE,MAAM,GAAG,EAAE,CAAC;AAC3D;AAMO,SAAS,oBAAoB,SAA+B;AACjE,QAAM,QAAQ,QAAQ,OAAO,SAAS,KAAK;AAC3C,MAAI,CAAC,OAAO;AACV,UAAM,QAAQ,yBAAyB,OAAO,KAAK;AACnD,UAAM,IAAI;AAAA,MACR,iBAAiB,KAAK;AAAA,IACxB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,yBAAyB,SAA2C;AAC3E,SAAO,QAAQ,MAAM,KAAK,KAAK,QAAQ,SAAS,KAAK,KAAK;AAC5D;AAEA,SAAS,qBAAqB,OAA+C;AAC3E,QAAM,OAAO,OACT,KAAK,EACN,QAAQ,qBAAqB,GAAG,EAChC,QAAQ,OAAO,GAAG,EAClB,QAAQ,UAAU,EAAE;AACvB,SAAO,QAAQ;AACjB;AAEA,SAAS,QAA2C,OAAsB;AACxE,QAAM,MAA+B,CAAC;AACtC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,QAAI,UAAU,OAAW,KAAI,GAAG,IAAI;AAAA,EACtC;AACA,SAAO;AACT;AAYO,SAAS,iBAAiB,SAA+B;AAC9D,QAAM,QAAQ,oBAAoB,OAAO;AACzC,QAAM,YAAY;AAAA,IAChB,GAAG;AAAA,IACH,MAAM;AAAA,IACN,aAAa;AAAA,IACb,MAAM,QAAQ,OAAO,CAAC,GAAG,QAAQ,IAAI,EAAE,KAAK,IAAI;AAAA,IAChD,OAAO,QAAQ,EAAE,GAAG,QAAQ,OAAO,SAAS,MAAM,CAAC;AAAA,EACrD;AACA,SAAOC,YAAW,QAAQ,EACvB,OAAO,KAAK,UAAU,aAAa,SAAS,CAAC,CAAC,EAC9C,OAAO,KAAK;AACjB;;;AD/HO,IAAM,qBAAN,cAAiC,eAAe;AAAA,EACrD,YAAY,SAAiB;AAC3B,UAAM,kBAAkB,OAAO;AAAA,EACjC;AACF;AAmHA,SAAS,SAAS,IAAoB;AACpC,SAAO,GAAG,QAAQ,mBAAmB,GAAG;AAC1C;AAEA,SAAS,IAAI,OAAwB;AACnC,SAAOC,YAAW,QAAQ,EAAE,OAAO,KAAK,UAAU,KAAK,CAAC,EAAE,OAAO,KAAK;AACxE;AAEA,SAASC,MAAK,IAAsB;AAClC,SAAO,GAAG,WAAW,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAClE;AAEA,SAAS,cAAc,MAA2C;AAChE,QAAM,aAAa,OAAO,OAAO,KAAK,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS;AACzE,SAAO,WAAW,WAAW,IAAI,IAAIA,MAAK,UAAU;AACtD;AA8BA,SAAS,qBAAqB,MAAmC,WAA2B;AAC1F,QAAM,WAAW,KAAK,eAAe,KAAK;AAC1C,MAAI,CAAC,UAAU;AACb,UAAM,IAAI;AAAA,MACR,YAAY,SAAS,mBAAmB,oBAAoB,kFAAkF,KAAK,MAAM,+GAA0G,oBAAoB;AAAA,IACzR;AAAA,EACF;AACA,MAAI,CAAC,iBAAiB,QAAQ,GAAG;AAC/B,UAAM,IAAI;AAAA,MACR,YAAY,SAAS,wBAAwB,QAAQ,eAAe,KAAK,MAAM;AAAA,IACjF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eACP,MACW;AACX,QAAM,EAAE,MAAM,SAAS,aAAa,YAAY,cAAc,UAAU,WAAW,SAAS,IAC1F;AACF,QAAM,YAAY,eAAe,OAAO;AACxC,QAAM,gBAAgB,oBAAoB,OAAO;AAQjD,QAAM,QACJ,kBAAkB,uBAAuB,qBAAqB,MAAM,SAAS,IAAI;AACnF,QAAM,YAAY,cAAc,IAAI;AAGpC,QAAM,MAA8B,EAAE,UAAU;AAChD,QAAM,WAAmD,CAAC;AAC1D,QAAM,WAAqC,CAAC;AAC5C,QAAM,QAAkB,CAAC;AACzB,aAAW,CAAC,WAAW,EAAE,KAAK,OAAO,QAAQ,KAAK,WAAW,GAAG;AAC9D,aAAS,SAAS,IAAI,EAAE,GAAG,GAAG,WAAW;AACzC,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,GAAG,UAAU,GAAG;AACxD,UAAI,GAAG,SAAS,IAAI,GAAG,EAAE,IAAI;AAC7B,eAAS,GAAG,MAAM,CAAC;AACnB,eAAS,GAAG,EAAG,KAAK,KAAK;AAAA,IAC3B;AACA,QAAI,GAAG,MAAO,OAAM,KAAK,GAAG,SAAS,KAAK,GAAG,KAAK,EAAE;AAAA,EACtD;AACA,QAAM,aAAqC,CAAC;AAC5C,aAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,QAAQ,EAAG,YAAW,GAAG,IAAIA,MAAK,MAAM;AASnF,QAAM,UAAU,KAAK;AACrB,MAAI,WAAW;AACf,MAAI,iBAAiB,KAAK,gBAAgB,IAAI;AAC9C,MAAI,eAAe,KAAK,WAAW;AACnC,MAAI,gBAAgB,KAAK,WAAW;AACpC,MAAI,OAAO,KAAK,WAAW,WAAW,SAAU,KAAI,gBAAgB,KAAK,WAAW;AACpF,MAAI,aAAa,KAAK;AACtB,MAAI,UAAU,GAAG;AACf,QAAI,qBAAqB,KAAK,WAAW,QAAQ,KAAK,WAAW,UAAU;AAAA,EAC7E;AACA,MAAI,YAAY,KAAM,KAAI,mBAAmB,UAAU;AAEvD,QAAM,UACJ,aAAa,YAAY,EAAE,cAAc,WAAW,IAAI,IAAI,EAAE,aAAa,WAAW,IAAI;AAC5F,MAAI,OAAO,KAAK,QAAQ,EAAE,SAAS,GAAG;AACpC,YAAQ,cAAc;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,MAAM,SAAS,IAAI,EAAE,OAAO,MAAM,KAAK,KAAK,EAAE,IAAI,CAAC;AAAA,IACzD;AAAA,EACF;AAEA,QAAM,SAA+D;AAAA,IACnE,OAAO,GAAG,QAAQ,IAAI,SAAS,IAAI,KAAK,MAAM;AAAA,IAC9C;AAAA,IACA,aAAa;AAAA,IACb,MAAM,KAAK;AAAA,IACX;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,QAAQ,KAAK;AAAA,IACb;AAAA,IACA,YAAY,KAAK;AAAA,IACjB;AAAA,IACA;AAAA,IACA,YAAY,KAAK;AAAA,IACjB,GAAI,KAAK,mBAAmB,EAAE,cAAc,KAAK,iBAAiB,IAAI,CAAC;AAAA,IACvE,GAAI,KAAK,QAAQ,EAAE,aAAa,KAAK,MAAM,IAAI,CAAC;AAAA,EAClD;AAKA,MAAI,KAAK,cAAc,KAAK,UAAU;AACpC,QAAI;AACF,YAAM,OAAO,KAAK,WAAW,KAAK,UAAU,KAAK,QAAQ;AACzD,UAAI,QAAQ,OAAO,KAAK,WAAW,YAAY,OAAO,KAAK,eAAe,UAAU;AAClF,eAAO,SAAS,KAAK;AACrB,eAAO,aAAa,KAAK;AAAA,MAC3B;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAKA,eAAsB,iBACpB,MACuD;AACvD,MAAI,KAAK,SAAS,WAAW,EAAG,OAAM,IAAI,mBAAmB,4BAA4B;AACzF,MAAI,KAAK,UAAU,WAAW,EAAG,OAAM,IAAI,mBAAmB,6BAA6B;AAE3F,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,gBAAgB,KAAK,aAAa;AACxC,QAAM,aAAa,KAAK,SAAS,IAAI,cAAc;AACnD,QAAM,eACJ,KAAK,gBACL,MAAM,IAAI,EAAE,YAAY,WAAW,KAAK,UAAU,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC;AACpF,QAAM,WAAW,OAAO,IAAI,EAAE,cAAc,YAAY,MAAM,SAAS,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC;AAEtF,QAAM,eAAe,IAAI,IAAI,KAAK,UAAU,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAgBjE,aAAW,WAAW,KAAK,UAAU;AACnC,UAAM,cAAc,iBAAiB,OAAO;AAC5C,UAAM,YAAY,eAAe,OAAO;AACxC,UAAM,gBAAgB,oBAAoB,OAAO;AACjD,UAAM,QACJ,kBAAkB,uBACd,GAAG,oBAAoB,sBACvB;AACN,QAAI;AACF,wBAAkB;AAAA,QAChB,OAAO,GAAG,QAAQ,IAAI,SAAS;AAAA,QAC/B;AAAA,QACA,aAAa;AAAA,QACb;AAAA,QACA;AAAA,QACA,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,WAAW,KAAK;AAAA,QAChB,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,YAAY,EAAE,OAAO,GAAG,QAAQ,EAAE;AAAA,QAClC,SACE,aAAa,YAAY,EAAE,cAAc,GAAG,KAAK,CAAC,EAAE,IAAI,EAAE,aAAa,GAAG,KAAK,CAAC,EAAE;AAAA,QACpF;AAAA,MACF,CAAC;AAAA,IACH,SAAS,KAAK;AACZ,YAAM,IAAI;AAAA,QACR,YAAY,SAAS,wBAAwB,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC/F;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAuB,CAAC;AAC9B,QAAM,YAAkE,CAAC;AACzE,QAAM,YAA4C,CAAC;AAEnD,aAAW,WAAW,KAAK,UAAU;AACnC,UAAM,cAAc,iBAAiB,OAAO;AAC5C,UAAM,YAAY,eAAe,OAAO;AACxC,UAAM,gBAAgB,oBAAoB,OAAO;AACjD,UAAM,aAAa,IAAI;AAAA,MACrB,SAAS;AAAA,MACT,SAAS,KAAK,UAAU,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,MAC7C;AAAA,MACA;AAAA,IACF,CAAC;AAID,UAAM,WAAW,CAAC,UAAqB,QACrC,KAAK,SAAS,SAAS,UAAU,GAAG;AACtC,WAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,WAAW,SAAS,SAAS,CAAC,GAAG,CAAC;AAEnF,UAAM,WAAW,MAAM,YAAkC;AAAA,MACvD,WAAW,KAAK;AAAA,MAChB;AAAA,MACA,QAAQ,KAAK;AAAA,MACb;AAAA,MACA,MAAM,KAAK;AAAA,MACX,gBAAgB,KAAK;AAAA,MACrB,aAAa,KAAK;AAAA,MAClB,cAAc,KAAK;AAAA,MACnB,eAAe,KAAK;AAAA,MACpB,SAAS,KAAK;AAAA,MACd,KAAK,KAAK;AAAA,MACV,QAAQC,MAAK,KAAK,QAAQ,SAAS,SAAS,CAAC;AAAA,IAC/C,CAAC;AAWD,UAAM,OAAO,cAAc,OAAO;AAClC,UAAM,oBAAoB,CAAC,cACzB,sBAAsB;AAAA,MACpB;AAAA,MACA,eAAe,EAAE,MAAM,2BAA2B,MAAM,YAAY;AAAA,MACpE,OAAO;AAAA,MACP,GAAI,OAAO,EAAE,SAAS,EAAE,IAAI,KAAK,QAAQ,EAAE,IAAI,CAAC;AAAA,IAClD,CAAC;AAGH,UAAM,qBACJ,kBAAkB,uBAAuB,SAAY,MAAM,kBAAkB,aAAa;AAE5F,UAAM,iBAA8B,CAAC;AACrC,eAAW,QAAQ,SAAS,OAAO;AACjC,YAAM,mBACJ,sBAAuB,MAAM,kBAAkB,qBAAqB,MAAM,SAAS,CAAC;AACtF,YAAM,SAAS,eAAe;AAAA,QAC5B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,WAAW,KAAK;AAAA,QAChB;AAAA,QACA;AAAA,QACA,UAAU,aAAa,IAAI,KAAK,UAAU;AAAA,QAC1C,YAAY,KAAK;AAAA,MACnB,CAAC;AACD,UAAI,SAAU,mBAAkB,MAAM;AACtC,qBAAe,KAAK,MAAM;AAC1B,cAAQ,KAAK,MAAM;AAAA,IACrB;AAEA,UAAM,eAAe,SAAS,WAAW;AACzC,cAAU,SAAS,IAAI;AAEvB,cAAU,SAAS,IAAI;AAAA,MACrB;AAAA,MACA;AAAA;AAAA;AAAA;AAAA,MAIA,OACE,kBAAkB,uBACb,eAAe,CAAC,GAAG,SAAS,gBAC7B;AAAA,MACN,SAAS,eAAe;AAAA,MACxB,eAAeD,MAAK,eAAe,IAAI,WAAW,CAAC;AAAA,MACnD;AAAA,MACA,WAAW,0BAA0B,cAAc;AAAA,IACrD;AAAA,EACF;AAGA,QAAM,YAAY,0BAA0B,OAAO;AACnD,MAAI,kBAAkB,UAAU;AAC9B,sBAAkB,SAAS,EAAE,YAAY,KAAK,cAAc,KAAK,CAAC;AAAA,EACpE,WAAW,kBAAkB,UAAU,UAAU,YAAY,QAAQ;AAEnE,YAAQ;AAAA,MACN,yCAAyC,UAAU,OAAO,WAAM,UAAU,SAAS;AAAA,IACrF;AAAA,EACF;AAGA,QAAM,aAAa,OAAO,SAAS,CAAC,MAAM,EAAE,UAAU;AACtD,QAAM,YAAY,KAAK,YACnB,gBAAgB,SAAS,KAAK,WAAW,KAAK,SAAS,IACvD;AAEJ,SAAO,EAAE,UAAU,cAAc,SAAS,WAAW,YAAY,WAAW,WAAW,UAAU;AACnG;AAGA,SAAS,YAAY,GAAsB;AACzC,SAAO,EAAE,QAAQ,gBAAgB,EAAE,QAAQ,eAAe;AAC5D;AAEA,SAAS,OACP,SACA,OACgC;AAChC,QAAM,SAAS,oBAAI,IAAsB;AACzC,aAAW,KAAK,SAAS;AACvB,UAAM,MAAM,MAAM,CAAC;AACnB,QAAI,QAAQ,OAAW;AACvB,UAAM,MAAM,OAAO,IAAI,GAAG,KAAK,CAAC;AAChC,QAAI,KAAK,YAAY,CAAC,CAAC;AACvB,WAAO,IAAI,KAAK,GAAG;AAAA,EACrB;AACA,QAAM,MAAsC,CAAC;AAC7C,aAAW,CAAC,KAAK,EAAE,KAAK,OAAQ,KAAI,GAAG,IAAI,EAAE,eAAeA,MAAK,EAAE,GAAG,GAAG,GAAG,OAAO;AACnF,SAAO;AACT;AAEA,SAAS,gBACP,SACA,WACA,WACgC;AAChC,QAAM,sBAAsB,oBAAI,IAAoB;AACpD,aAAW,KAAK,UAAW,qBAAoB,IAAI,EAAE,IAAI,UAAU,CAAC,CAAC;AACrE,SAAO,OAAO,SAAS,CAAC,MAAO,EAAE,aAAa,oBAAoB,IAAI,EAAE,UAAU,IAAI,MAAU;AAClG;;;AEhjBO,SAAS,gBAAgB,GAA2B;AACzD,MAAI,OAAO,MAAM,SAAU,QAAO,EAAE,KAAK,KAAK;AAC9C,MAAI,KAAK,OAAO,MAAM,UAAU;AAC9B,UAAM,IAAI;AACV,UAAM,OAAO,EAAE,sBAAsB,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE;AACxE,QAAI,OAAO,SAAS,YAAY,KAAK,KAAK,EAAG,QAAO,KAAK,KAAK;AAAA,EAChE;AACA,SAAO;AACT;AAIO,SAAS,QAAQ,GAAmB;AACzC,SAAO,EACJ,YAAY,EACZ,QAAQ,QAAQ,GAAG,EACnB,QAAQ,eAAe,EAAE,EACzB,KAAK;AACV;AAKO,SAASE,eAAc,SAAiC;AAC7D,MAAI,OAAO,YAAY,SAAU,QAAO;AACxC,QAAM,IAAI;AAAA,IACR,4DAA4D,QAAQ,IAAI,kBAAkB,QAAQ,WAAW;AAAA,EAC/G;AACF;AAQO,SAAS,iBAAiB,MAAc,aAAqB,WAA2B;AAC7F,QAAM,QAAQ,KAAK,QAAQ,WAAW;AACtC,QAAM,MAAM,KAAK,QAAQ,SAAS;AAClC,MAAI,UAAU,MAAM,QAAQ,MAAM,MAAM,MAAO,QAAO;AACtD,SAAO,KAAK,MAAM,QAAQ,YAAY,QAAQ,GAAG;AACnD;AAIO,SAAS,WAAW,MAAc,aAAqB,WAA2B;AACvF,QAAM,QAAQ,KAAK,QAAQ,WAAW;AACtC,QAAM,MAAM,KAAK,QAAQ,SAAS;AAClC,MAAI,UAAU,MAAM,QAAQ,MAAM,MAAM,MAAO,QAAO,KAAK,QAAQ;AACnE,UAAQ,KAAK,MAAM,GAAG,KAAK,IAAI,KAAK,MAAM,MAAM,UAAU,MAAM,GAAG,QAAQ;AAC7E;;;AC3BA,IAAM,cAAc;AACpB,IAAM,YAAY;AAClB,IAAM,kBAAkB;AAkBxB,SAAS,cAAc,SAA2B;AAChD,QAAM,OAAO,iBAAiB,SAAS,aAAa,SAAS;AAC7D,QAAM,MAAgB,CAAC;AACvB,aAAW,OAAO,KAAK,MAAM,IAAI,GAAG;AAClC,UAAM,OAAO,IAAI,KAAK;AACtB,QAAI,CAAC,KAAK,WAAW,IAAI,EAAG;AAC5B,UAAM,OAAO,KAAK,MAAM,CAAC,EAAE,KAAK;AAChC,UAAM,MAAM,wBAAwB,KAAK,IAAI;AAC7C,QAAI,IAAK,KAAI,KAAK,EAAE,KAAK,OAAO,IAAI,CAAC,CAAC,GAAG,MAAM,IAAI,CAAC,EAAG,KAAK,EAAE,CAAC;AAAA,QAC1D,KAAI,KAAK,EAAE,KAAK,IAAI,MAAM,KAAK,CAAC;AAAA,EACvC;AACA,SAAO;AACT;AAKO,SAAS,YAAY,OAA2B,CAAC,GAAoB;AAC1E,QAAM,aAAa,KAAK,cAAc;AACtC,MAAI,aAAa,EAAG,OAAM,IAAI,MAAM,sCAAsC;AAC1E,QAAM,UAAU,KAAK,kBAAkB;AAEvC,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,QAAQ,KAAmD;AAC/D,YAAM,SAASC,eAAc,IAAI,cAAc;AAC/C,YAAM,WAAW,cAAc,MAAM;AACrC,YAAM,OAAO,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,QAAQ,EAAE,IAAI,CAAC,CAAC;AAIzD,YAAM,QAAkB,CAAC;AACzB,iBAAW,KAAK,IAAI,YAAY,CAAC,GAAG;AAClC,cAAM,SAAS,gBAAgB,CAAC;AAChC,YAAI,CAAC,OAAQ;AACb,cAAM,IAAI,QAAQ,MAAM;AACxB,YAAI,CAAC,KAAK,KAAK,IAAI,CAAC,EAAG;AACvB,aAAK,IAAI,CAAC;AACV,cAAM,KAAK,EAAE,KAAK,IAAI,YAAY,MAAM,OAAO,CAAC;AAAA,MAClD;AAGA,UAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAIhC,YAAM,MAAM,CAAC,GAAG,UAAU,GAAG,KAAK,EAAE,MAAM,CAAC,UAAU;AACrD,YAAM,QAAQ;AAAA,QACZ;AAAA,QACA;AAAA,QACA,GAAG,IAAI,IAAI,CAAC,MAAM,OAAO,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE;AAAA,QAC3C;AAAA,MACF,EAAE,KAAK,IAAI;AACX,YAAM,OAAO,WAAW,QAAQ,aAAa,SAAS;AACtD,YAAM,UAAU,OAAO,GAAG,IAAI;AAAA;AAAA,EAAO,KAAK,KAAK;AAE/C,aAAO;AAAA,QACL;AAAA,UACE;AAAA,UACA,OAAO,iBAAiB,MAAM,MAAM;AAAA,UACpC,WAAW,YAAY,MAAM,MAAM,2BAA2B,IAAI,UAAU,2BAA2B,IAAI,MAAM;AAAA,QACnH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;;;ACjEO,SAAS,kBACd,MAC4B;AAC5B,QAAM,UAAU,KAAK;AACrB,MAAI,QAAQ,WAAW;AACrB,UAAM,IAAI,MAAM,0DAA0D;AAC5E,QAAM,UAAU,KAAK,WAAW,QAAQ,IAAI,MAAM,CAAC;AACnD,MAAI,QAAQ,WAAW,QAAQ,UAAU,QAAQ,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG;AACtE,UAAM,IAAI,MAAM,wEAAwE;AAAA,EAC1F;AAEA,SAAO;AAAA,IACL,MAAM,aAAa,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC;AAAA,IAEvD,MAAM,QACJ,KACoD;AACpD,YAAM,cAAc,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAGrD,YAAM,QAAQ,QAAQ,IAAI,CAAC,MAAO,IAAI,iBAAiB,IAAK,WAAW;AACvE,YAAM,SAAS,MAAM,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;AAC7C,UAAI,YAAY,IAAI,iBAAiB,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AACrE,YAAM,cAAc,MACjB,IAAI,CAAC,GAAG,OAAO,EAAE,GAAG,KAAK,IAAI,KAAK,MAAM,CAAC,EAAE,EAAE,EAC7C,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AAC/B,iBAAW,EAAE,EAAE,KAAK,aAAa;AAC/B,YAAI,aAAa,EAAG;AACpB,eAAO,CAAC,KAAK,OAAO,CAAC,KAAK,KAAK;AAC/B,qBAAa;AAAA,MACf;AAEA,YAAM,OAA4B,CAAC;AACnC,YAAM,OAAO,oBAAI,IAAY;AAC7B,YAAM,SAAmB,CAAC;AAC1B,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1C,cAAM,SAAS,QAAQ,CAAC;AACxB,cAAM,QAAQ,OAAO,CAAC,KAAK;AAC3B,YAAI,CAAC,UAAU,UAAU,KAAK,IAAI,OAAO,QAAS;AAClD,YAAI;AACF,gBAAM,YAAY,MAAM,OAAO,QAAQ,EAAE,GAAG,KAAK,gBAAgB,MAAM,CAAC;AACxE,qBAAW,YAAY,WAAW;AAChC,kBAAM,cACJ,OAAO,aAAa,YAAY,aAAa,QAAQ,aAAa;AACpE,kBAAM,UAAU,cACX,SAA+B,UAC/B;AACL,kBAAM,QAAQ,cAAe,SAA+B,QAAQ;AACpE,kBAAM,YAAY,cAAe,SAA+B,YAAY;AAC5E,kBAAM,kBAAkB,cACnB,SAA+B,kBAChC;AACJ,kBAAM,MAAM,mBAAmB,OAAO;AACtC,gBAAI,KAAK,IAAI,GAAG,EAAG;AACnB,iBAAK,IAAI,GAAG;AACZ,iBAAK,KAAK;AAAA,cACR;AAAA,cACA,OAAO,GAAG,OAAO,IAAI,IAAI,KAAK;AAAA,cAC9B;AAAA,cACA,GAAI,kBAAkB,EAAE,gBAAgB,IAAI,CAAC;AAAA,YAC/C,CAAC;AAAA,UACH;AAAA,QACF,SAAS,KAAK;AACZ,iBAAO,KAAK,GAAG,OAAO,IAAI,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC,EAAE;AAAA,QACnF;AAAA,MACF;AACA,UAAI,KAAK,WAAW,GAAG;AACrB,cAAM,IAAI;AAAA,UACR,6DAA6D,OAAO,SAAS,WAAM,OAAO,KAAK,IAAI,CAAC,KAAK,EAAE;AAAA,QAC7G;AAAA,MACF;AACA,UAAI,OAAO,SAAS,GAAG;AACrB,gBAAQ;AAAA,UACN,uBAAuB,OAAO,MAAM,sCAAsC,OAAO,KAAK,IAAI,CAAC;AAAA,QAC7F;AAAA,MACF;AACA,aAAO,KAAK,MAAM,GAAG,IAAI,cAAc;AAAA,IACzC;AAAA,IAEA,OAAO,MAA2E;AAChF,YAAM,QAAQ,QACX,OAAO,CAAC,MAAM,OAAO,EAAE,WAAW,UAAU,EAC5C,IAAI,CAAC,MAAO,EAAE,OAA6D,IAAI,CAAC;AACnF,UAAI,MAAM,WAAW,EAAG,QAAO,EAAE,MAAM,MAAM;AAC7C,YAAM,UAAU,MAAM,MAAM,CAAC,MAAM,EAAE,IAAI;AACzC,aAAO,UACH;AAAA,QACE,MAAM;AAAA,QACN,QACE,MACG,IAAI,CAAC,MAAM,EAAE,MAAM,EACnB,OAAO,OAAO,EACd,KAAK,IAAI,KAAK;AAAA,MACrB,IACA,EAAE,MAAM,MAAM;AAAA,IACpB;AAAA,EACF;AACF;;;ACrIA,SAAS,gBAAgB;AACzB,SAAS,iBAAiB;;;ACT1B,SAAS,aAAa,iBAAAC,sBAAqB;AAC3C,SAAS,cAAc;AACvB,SAAS,QAAAC,aAAY;AAkBd,IAAM,eACX;AAGK,SAAS,oBAAoB,SAA0B;AAC5D,SAAO,OAAO,YAAY,WAAW,UAAU,KAAK,UAAU,OAAO;AACvE;AA4BO,SAAS,qBAAqB,MAAoD;AACvF,QAAM,mBAAmB,KAAK,cAAc,IAAI,WAAW;AAC3D,SAAO;AAAA,IACL,MAAM,KAAK;AAAA,IACX,MAAM,QAAQ,KAAmD;AAC/D,YAAM,SAAS,oBAAoB,IAAI,cAAc;AACrD,YAAM,aAAa,IAAI,cAAc;AACrC,YAAM,QAAQ,IAAI,aAAa;AAE/B,YAAM,SAAU,MAAM,KAAK,cAAc,GAAG,KAAM;AAClD,UAAI,CAAC,OAAO,KAAK,EAAG,OAAM,IAAI,MAAM,KAAK,aAAa;AACtD,YAAM,MAAM,YAAYC,MAAK,OAAO,GAAG,GAAG,KAAK,IAAI,YAAY,CAAC;AAChE,YAAM,YAAYA,MAAK,KAAK,cAAc;AAC1C,MAAAC,eAAc,WAAW,OAAO,SAAS,IAAI,IAAI,SAAS,GAAG,MAAM;AAAA,CAAI;AAEvE,UAAI,WAAW,mBAAmB,UAAa,CAAC,KAAK,iBAAiB;AACpE,cAAM,IAAI;AAAA,UACR,GAAG,KAAK,IAAI;AAAA,QACd;AAAA,MACF;AAEA,YAAM,WAAW,MAAM,WAAW,YAAY;AAAA,QAC5C,SAAS;AAAA,QACT;AAAA,QACA,OAAO,GAAG,KAAK,IAAI;AAAA,QACnB,OAAO,KAAK;AAAA,QACZ,eAAe,KAAK;AAAA,QACpB,MAAM,EAAE,YAAY,OAAO,IAAI,UAAU,EAAE;AAAA,QAC3C,QAAQ,IAAI;AAAA,QACZ,SAAS,CAAC,WAAW,KAAK,QAAQ,WAAW,EAAE,GAAG,KAAK,OAAO,CAAC;AAAA,QAC/D,SAAS,CAACC,YACR,KAAK,kBAAkBA,OAAM,KAAK;AAAA,UAChC,OAAO,KAAK;AAAA,UACZ,aAAa;AAAA,UACb,cAAc;AAAA,UACd,aAAa;AAAA,QACf;AAAA,MACJ,CAAC;AACD,UAAI,CAAC,SAAS,UAAW,OAAM,SAAS;AACxC,YAAM,SAAS,SAAS;AAExB,YAAM,UAA0B;AAAA,QAC9B,OAAO,KAAK;AAAA,QACZ,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,aAAa;AAAA,UACxC;AAAA,YACE,MAAM;AAAA,YACN,SAAS;AAAA,EAAoB,MAAM;AAAA;AAAA;AAAA,EAA+B,MAAM;AAAA;AAAA;AAAA,UAC1E;AAAA,QACF;AAAA,QACA,WAAW,KAAK,kBAAkB;AAAA,MACpC;AACA,YAAM,MAAwB;AAAA,QAC5B,SAAS,KAAK;AAAA,QACd,QAAQ,KAAK;AAAA,QACb,OAAO,KAAK;AAAA,MACd;AACA,YAAM,QAAQ,MAAM,WAAW,YAAY;AAAA,QACzC,SAAS;AAAA,QACT;AAAA,QACA,OAAO,GAAG,KAAK,IAAI;AAAA,QACnB,OAAO,KAAK;AAAA,QACZ,eAAe,2BAA2B,SAAS,GAAG;AAAA,QACtD,MAAM,EAAE,YAAY,OAAO,IAAI,UAAU,EAAE;AAAA,QAC3C,QAAQ,IAAI;AAAA,QACZ,SAAS,CAAC,QAAQ,WAAW,QAAQ,SAAS,EAAE,GAAG,KAAK,QAAQ,gBAAgB,OAAO,CAAC;AAAA,QACxF,SAAS;AAAA,QACT,kBAAkB;AAAA,MACpB,CAAC;AACD,UAAI,CAAC,MAAM,UAAW,OAAM,MAAM;AAClC,YAAM,UAAU,MAAM;AACtB,YAAM,OAAO,QAAQ,QAAQ,KAAK;AAClC,UAAI,CAAC,QAAQ,SAAS,OAAQ,QAAO,CAAC;AACtC,aAAO,CAAC,EAAE,SAAS,MAAM,OAAO,KAAK,OAAO,WAAW,KAAK,UAAU,MAAM,EAAE,CAAC;AAAA,IACjF;AAAA,EACF;AACF;;;ADnHA,IAAM,gBAAgB,UAAU,QAAQ;AA+BxC,IAAM,0BACJ;AAGK,SAAS,aAAa,MAA4C;AACvE,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,QAAQ,KAAK,SAAS;AAC5B,SAAO,qBAAqB;AAAA,IAC1B,MAAM;AAAA,IACN,OAAO;AAAA,IACP,SAAS,KAAK;AAAA,IACd,QAAQ,KAAK;AAAA,IACb,eAAe;AAAA,IACf,YAAY,KAAK,cAAc;AAAA,IAC/B,YAAY,KAAK;AAAA,IACjB,uBAAuB,KAAK;AAAA,IAC5B,iBAAiB,KAAK;AAAA,IACtB,gBAAgB,KAAK;AAAA,IACrB,WAAW,KAAK;AAAA,IAChB,eAAe,KAAK;AAAA,IACpB,eACE;AAAA;AAAA,IAEF,WAAW,CAAC,aAAa;AAAA,EAA0B,SAAS,MAAM,GAAG,GAAG,CAAC;AAAA,IACzE,SAAS,OAAO,WAAW,QAAQ;AAGjC,YAAM,OAAO;AAAA,QACX;AAAA,QACA;AAAA,QACA,KAAK,kBAAkB;AAAA,QACvB;AAAA,QACA;AAAA,QACA,GAAI,KAAK,aAAa,SAAY,CAAC,eAAe,OAAO,KAAK,QAAQ,CAAC,IAAI,CAAC;AAAA,QAC5E,GAAI,KAAK,aAAa,SAAY,CAAC,eAAe,OAAO,KAAK,QAAQ,CAAC,IAAI,CAAC;AAAA,MAC9E;AACA,UAAI;AACJ,UAAI;AACF,cAAM,EAAE,OAAO,IAAI,MAAM,cAAc,SAAS,MAAM;AAAA,UACpD,WAAW,KAAK,OAAO;AAAA,UACvB,QAAQ,IAAI;AAAA,UACZ,KAAK;AAAA,YACH,GAAG,QAAQ;AAAA,YACX,GAAI,KAAK,SAAS,EAAE,gBAAgB,KAAK,OAAO,IAAI,CAAC;AAAA,YACrD,iBAAiB,KAAK;AAAA,UACxB;AAAA,QACF,CAAC;AACD,mBAAW,OAAO,KAAK;AAAA,MACzB,SAAS,GAAG;AACV,cAAM,IAAI;AAAA,UACR,+BAA+B,OAAO,oBAAe,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;AAAA,QACjG;AAAA,MACF;AACA,UAAI,CAAC,SAAU,OAAM,IAAI,MAAM,gDAAgD;AAC/E,aAAO;AAAA,IACT;AAAA,EACF,CAAC;AACH;;;AEhHA,SAAS,SAAS;;;ACyCX,SAAS,mBAAmB,OAAkC,CAAC,GAAoB;AACxF,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,QAAQ,KAAmD;AAC/D,YAAM,QAAQ,uBAAuB,KAAK,SAAS,IAAI,UAAU,KAAK,cAAc;AACpF,YAAM,QAAQ,KAAK;AAAA,QACjB;AAAA,QACA,KAAK,IAAI,KAAK,iBAAiB,IAAI,gBAAgB,IAAI,cAAc;AAAA,MACvE;AACA,YAAM,MAA2B,CAAC;AAClC,YAAM,OAAO,oBAAI,IAAI,CAAC,mBAAmB,IAAI,cAAc,CAAC,CAAC;AAC7D,UAAI,UAAU,EAAG,QAAO;AAExB,iBAAW,QAAQ,OAAO;AACxB,cAAM,YAAY,gBAAgB,MAAM,KAAK,SAAS;AACtD,aAAK,cAAc,SAAS;AAC5B,YAAI,UAAU,aAAa,QAAS;AAEpC,cAAM,UAAU,uBAAuB,yBAAyB,IAAI,gBAAgB,IAAI,CAAC;AACzF,cAAM,OAAO,mBAAmB,OAAO;AACvC,YAAI,KAAK,IAAI,IAAI,EAAG;AACpB,aAAK,IAAI,IAAI;AAEb,YAAI,KAAK;AAAA,UACP;AAAA,UACA,OAAO,eAAe,KAAK,IAAI;AAAA,UAC/B,WACE,GAAG,KAAK,MAAM,aAAa,KAAK,aAAa,SAAS,IACnD,KAAK,aAAa,MAAM,OAAO,KAAK,aAAa,MAAM,sBACtC,KAAK,OAAO,WAAW,KAAK,IAAI,CAAC;AAAA,UACvD,iBAAiB,8BAA8B,IAAI;AAAA,QACrD,CAAC;AACD,YAAI,IAAI,UAAU,MAAO;AAAA,MAC3B;AAEA,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,uBACP,QACA,gBACc;AACd,QAAM,QAAsB,CAAC;AAC7B,QAAM,WAA6B,CAAC;AAEpC,aAAW,SAAS,QAAQ;AAC1B,QAAI,aAAa,KAAK,GAAG;AACvB,YAAM,KAAK,KAAK;AAAA,IAClB,WAAW,qBAAqB,KAAK,GAAG;AACtC,eAAS,KAAK,KAAK;AAAA,IACrB;AAAA,EACF;AAEA,MAAI,SAAS,SAAS,EAAG,OAAM,KAAK,GAAG,wBAAwB,UAAU,cAAc,CAAC;AACxF,SAAO;AACT;AAEA,SAAS,qBAAqB,OAAyC;AACrE,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,MAAM;AACZ,SACE,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,eAAe,YAC1B,OAAO,IAAI,UAAU,YACrB,MAAM,QAAQ,IAAI,aAAa;AAEnC;AAEA,SAAS,uBAAuB,SAAkC;AAChE,MAAI,OAAO,YAAY,SAAU,QAAO;AACxC,MAAI,WAAW,OAAO,YAAY,UAAU;AAC1C,UAAM,MAAM;AACZ,QAAI,IAAI,SAAS,UAAU,OAAO,IAAI,gBAAgB,UAAU;AAC9D,gCAA0B,OAAO;AACjC,aAAO;AAAA,IACT;AACA,WAAO,KAAK,UAAU,SAAS,MAAM,CAAC;AAAA,EACxC;AACA,QAAM,IAAI,MAAM,iEAAiE;AACnF;;;AC3FO,SAAS,2BACd,MACA,SACK;AACL,4BAA0B,QAAQ,OAAO,OAAO;AAEhD,QAAMC,UAAS,oBAAI,IAA0B;AAC7C,aAAW,OAAO,MAAM;AACtB,QAAI,CAAC,IAAI,cAAc,IAAI,WAAW,KAAK,MAAM,IAAI,YAAY;AAC/D,YAAM,IAAI,MAAM,sEAAsE;AAAA,IACxF;AACA,QAAI,CAAC,OAAO,SAAS,IAAI,SAAS,GAAG;AACnC,YAAM,IAAI;AAAA,QACR,6DAA6D,IAAI,UAAU;AAAA,MAC7E;AAAA,IACF;AACA,QAAIA,QAAO,IAAI,IAAI,UAAU,EAAG;AAEhC,UAAM,YAAY,QAAQ,qBAAqB,IAAI,IAAI,UAAU;AACjE,QAAI,cAAc,UAAa,CAAC,OAAO,SAAS,SAAS,GAAG;AAC1D,YAAM,IAAI;AAAA,QACR,6DAA6D,IAAI,UAAU;AAAA,MAC7E;AAAA,IACF;AACA,IAAAA,QAAO,IAAI,IAAI,YAAY;AAAA,MACzB;AAAA,MACA,OAAO,cAAc,SAAY,OAAO,IAAI,YAAY;AAAA,IAC1D,CAAC;AAAA,EACH;AAEA,QAAM,UAAU,CAAC,GAAGA,QAAO,OAAO,CAAC,EAAE;AAAA,IACnC,CAAC,GAAG,MAAM,EAAE,IAAI,YAAY,EAAE,IAAI,aAAa,kBAAkB,EAAE,KAAK,EAAE,GAAG;AAAA,EAC/E;AACA,QAAM,cAAc,CAAC,GAAGA,QAAO,OAAO,CAAC,EACpC,OAAO,CAAC,UAAU,MAAM,UAAU,QAAQ,MAAM,QAAQ,CAAC,EACzD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAS,EAAE,SAAU,kBAAkB,EAAE,KAAK,EAAE,GAAG,CAAC;AACxE,QAAM,eAAe,CAAC,GAAGA,QAAO,OAAO,CAAC,EACrC,OAAO,CAAC,UAAU,MAAM,UAAU,QAAQ,MAAM,QAAQ,CAAC,EACzD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAS,EAAE,SAAU,kBAAkB,EAAE,KAAK,EAAE,GAAG,CAAC;AACxE,QAAM,WAAW,CAAC,SAAS,aAAa,YAAY;AACpD,QAAM,WAAW,KAAK,IAAI,GAAG,SAAS,IAAI,CAAC,YAAY,QAAQ,MAAM,GAAG,CAAC;AACzE,QAAM,WAAgB,CAAC;AACvB,QAAM,cAAc,oBAAI,IAAY;AAEpC,WAAS,QAAQ,GAAG,QAAQ,YAAY,SAAS,SAAS,QAAQ,OAAO,SAAS,GAAG;AACnF,eAAW,WAAW,UAAU;AAC9B,YAAM,QAAQ,QAAQ,KAAK;AAC3B,UAAI,CAAC,SAAS,YAAY,IAAI,MAAM,IAAI,UAAU,EAAG;AACrD,eAAS,KAAK,MAAM,GAAG;AACvB,kBAAY,IAAI,MAAM,IAAI,UAAU;AACpC,UAAI,SAAS,WAAW,QAAQ,MAAO;AAAA,IACzC;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,oCACd,OACA,UACsB;AACtB,4BAA0B,UAAU,UAAU;AAC9C,QAAM,OAAO,KAAK,UAAU,KAAK;AACjC,MAAI,SAAS,QAAW;AACtB,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,QAAM,cAAc,KAAK;AACzB,MAAI,cAAc,UAAU;AAC1B,UAAM,IAAI;AAAA,MACR,oFAAoF,WAAW,cAAc,QAAQ;AAAA,IACvH;AAAA,EACF;AACA,SAAO,EAAE,MAAM,aAAa,SAAS;AACvC;AAEA,SAAS,kBAAkB,GAAgC,GAAwC;AACjG,SAAO,EAAE,aAAa,EAAE,aAAa,KAAK,EAAE,aAAa,EAAE,aAAa,IAAI;AAC9E;AAEA,SAAS,0BAA0B,OAAe,MAAoB;AACpE,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,SAAS,GAAG;AAC9C,UAAM,IAAI,MAAM,GAAG,IAAI,yCAAyC,KAAK,GAAG;AAAA,EAC1E;AACF;;;AF1EA,IAAM,mCAAmC;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAIA,IAAM,uBAAuB,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC;AAEpD,IAAM,kBAA+C,EAAE;AAAA,EAAK,MAC1D,EAAE,MAAM;AAAA,IACN,EAAE,OAAO;AAAA,IACT,EAAE,OAAO,EAAE,OAAO;AAAA,IAClB,EAAE,QAAQ;AAAA,IACV,EAAE,KAAK;AAAA,IACP,EAAE,MAAM,eAAe;AAAA,IACvB,EAAE,OAAO,sBAAsB,eAAe;AAAA,EAChD,CAAC;AACH;AAEA,IAAM,2BAA2B,EAAE,mBAAmB,QAAQ;AAAA,EAC5D,EACG,OAAO;AAAA,IACN,MAAM,EAAE,QAAQ,MAAM;AAAA,IACtB,MAAM,EAAE,QAAQ,KAAK;AAAA,IACrB,MAAM;AAAA,IACN,OAAO;AAAA,EACT,CAAC,EACA,OAAO;AAAA,EACV,EACG,OAAO;AAAA,IACN,MAAM,EAAE,QAAQ,MAAM;AAAA,IACtB,MAAM,EAAE,QAAQ,OAAO;AAAA,IACvB,MAAM;AAAA,IACN,OAAO;AAAA,EACT,CAAC,EACA,OAAO;AAAA,EACV,EACG,OAAO;AAAA,IACN,MAAM,EAAE,QAAQ,MAAM;AAAA,IACtB,MAAM,EAAE,QAAQ,QAAQ;AAAA,IACxB,MAAM;AAAA,EACR,CAAC,EACA,OAAO;AACZ,CAAC;AAED,IAAM,2BAA2B,EAC9B,OAAO;AAAA,EACN,MAAM,EAAE,KAAK,gBAAgB;AAAA,EAC7B,QAAQ,EACL,OAAO;AAAA,IACN,SAAS,EAAE,KAAK,2BAA2B;AAAA,IAC3C,MAAM;AAAA,IACN,OAAO,qBAAqB,IAAI,GAAG,EAAE,SAAS;AAAA,EAChD,CAAC,EACA,OAAO;AAAA,EACV,QAAQ;AAAA,EACR,OAAO,qBAAqB,IAAI,GAAK;AAAA,EACrC,cAAc,EACX,OAAO;AAAA,IACN,QAAQ,qBAAqB,IAAI,GAAG;AAAA,IACpC,WAAW,EAAE,KAAK,CAAC,YAAY,UAAU,CAAC;AAAA,IAC1C,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS;AAAA,IACrC,MAAM,EAAE,KAAK,CAAC,YAAY,YAAY,WAAW,OAAO,CAAC,EAAE,SAAS;AAAA,IACpE,WAAW,qBAAqB,IAAI,GAAK,EAAE,SAAS;AAAA,EACtD,CAAC,EACA,OAAO;AAAA,EACV,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;AAAA,EAC5C,MAAM,EAAE,KAAK,CAAC,OAAO,UAAU,QAAQ,SAAS,CAAC;AAAA,EACjD,QAAQ,EACL,OAAO;AAAA,IACN,aAAa,EACV,MAAM,oBAAoB,EAC1B,IAAI,CAAC,EACL,OAAO,CAAC,QAAQ,IAAI,IAAI,GAAG,EAAE,SAAS,IAAI,QAAQ,4BAA4B;AAAA,EACnF,CAAC,EACA,OAAO;AAAA,EACV,WAAW,qBAAqB,IAAI,GAAK,EAAE,SAAS;AAAA,EACpD,gBAAgB,qBAAqB,IAAI,GAAK,EAAE,SAAS;AAC3D,CAAC,EACA,OAAO;AAEV,IAAM,iCAAiC,EACpC,OAAO;AAAA,EACN,OAAO,EAAE,MAAM,wBAAwB;AACzC,CAAC,EACA,OAAO;AAIV,IAAM,iCAA0D;AAAA,EAC9D,MAAM;AAAA,EACN,sBAAsB;AAAA,EACtB,UAAU,CAAC,OAAO;AAAA,EAClB,YAAY;AAAA,IACV,OAAO;AAAA,MACL,MAAM;AAAA,MACN,OAAO;AAAA,QACL,MAAM;AAAA,QACN,sBAAsB;AAAA,QACtB,UAAU;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,QACA,YAAY;AAAA,UACV,MAAM,EAAE,MAAM,UAAU,MAAM,CAAC,GAAG,gBAAgB,EAAE;AAAA,UACpD,QAAQ;AAAA,YACN,MAAM;AAAA,YACN,sBAAsB;AAAA,YACtB,UAAU,CAAC,WAAW,QAAQ,OAAO;AAAA,YACrC,YAAY;AAAA,cACV,SAAS,EAAE,MAAM,UAAU,MAAM,CAAC,GAAG,2BAA2B,EAAE;AAAA,cAClE,MAAM,EAAE,MAAM,UAAU,WAAW,EAAE;AAAA,cACrC,OAAO,EAAE,MAAM,CAAC,UAAU,MAAM,GAAG,WAAW,IAAI;AAAA,YACpD;AAAA,UACF;AAAA,UACA,QAAQ;AAAA,YACN,OAAO;AAAA,cACL;AAAA,gBACE,MAAM;AAAA,gBACN,sBAAsB;AAAA,gBACtB,UAAU,CAAC,QAAQ,QAAQ,QAAQ,OAAO;AAAA,gBAC1C,YAAY;AAAA,kBACV,MAAM,EAAE,OAAO,OAAO;AAAA,kBACtB,MAAM,EAAE,OAAO,MAAM;AAAA,kBACrB,MAAM,EAAE,MAAM,UAAU,WAAW,EAAE;AAAA,kBACrC,OAAO,CAAC;AAAA,gBACV;AAAA,cACF;AAAA,cACA;AAAA,gBACE,MAAM;AAAA,gBACN,sBAAsB;AAAA,gBACtB,UAAU,CAAC,QAAQ,QAAQ,QAAQ,OAAO;AAAA,gBAC1C,YAAY;AAAA,kBACV,MAAM,EAAE,OAAO,OAAO;AAAA,kBACtB,MAAM,EAAE,OAAO,QAAQ;AAAA,kBACvB,MAAM,EAAE,MAAM,UAAU,WAAW,EAAE;AAAA,kBACrC,OAAO,CAAC;AAAA,gBACV;AAAA,cACF;AAAA,cACA;AAAA,gBACE,MAAM;AAAA,gBACN,sBAAsB;AAAA,gBACtB,UAAU,CAAC,QAAQ,QAAQ,MAAM;AAAA,gBACjC,YAAY;AAAA,kBACV,MAAM,EAAE,OAAO,OAAO;AAAA,kBACtB,MAAM,EAAE,OAAO,SAAS;AAAA,kBACxB,MAAM,EAAE,MAAM,UAAU,WAAW,EAAE;AAAA,gBACvC;AAAA,cACF;AAAA,YACF;AAAA,UACF;AAAA,UACA,OAAO,EAAE,MAAM,UAAU,WAAW,GAAG,WAAW,IAAM;AAAA,UACxD,cAAc;AAAA,YACZ,MAAM;AAAA,YACN,sBAAsB;AAAA,YACtB,UAAU,CAAC,UAAU,aAAa,UAAU,QAAQ,WAAW;AAAA,YAC/D,YAAY;AAAA,cACV,QAAQ,EAAE,MAAM,UAAU,WAAW,GAAG,WAAW,IAAI;AAAA,cACvD,WAAW,EAAE,MAAM,UAAU,MAAM,CAAC,YAAY,UAAU,EAAE;AAAA,cAC5D,QAAQ,EAAE,MAAM,UAAU,kBAAkB,EAAE;AAAA,cAC9C,MAAM;AAAA,gBACJ,MAAM,CAAC,UAAU,MAAM;AAAA,gBACvB,MAAM,CAAC,YAAY,YAAY,WAAW,SAAS,IAAI;AAAA,cACzD;AAAA,cACA,WAAW,EAAE,MAAM,CAAC,UAAU,MAAM,GAAG,WAAW,IAAM;AAAA,YAC1D;AAAA,UACF;AAAA,UACA,YAAY,EAAE,MAAM,UAAU,SAAS,GAAG,SAAS,EAAE;AAAA,UACrD,MAAM,EAAE,MAAM,UAAU,MAAM,CAAC,OAAO,UAAU,QAAQ,SAAS,EAAE;AAAA,UACnE,QAAQ;AAAA,YACN,MAAM;AAAA,YACN,sBAAsB;AAAA,YACtB,UAAU,CAAC,aAAa;AAAA,YACxB,YAAY;AAAA,cACV,aAAa;AAAA,gBACX,MAAM;AAAA,gBACN,UAAU;AAAA,gBACV,aAAa;AAAA,gBACb,OAAO,EAAE,MAAM,UAAU,WAAW,EAAE;AAAA,cACxC;AAAA,YACF;AAAA,UACF;AAAA,UACA,WAAW,EAAE,MAAM,CAAC,UAAU,MAAM,GAAG,WAAW,IAAM;AAAA,UACxD,gBAAgB,EAAE,MAAM,CAAC,UAAU,MAAM,GAAG,WAAW,IAAM;AAAA,QAC/D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,2BACP,UACA,eACA,kBACA,YACyB;AACzB,QAAM,SAAS,KAAK,MAAM,KAAK,UAAU,8BAA8B,CAAC;AAIxE,QAAM,aAAa,OAAO;AAC1B,QAAM,QAAQ,WAAW;AACzB,QAAM,WAAW;AACjB,QAAM,OAAO,MAAM;AACnB,QAAM,iBAAiB,KAAK;AAC5B,QAAM,SAAS,eAAe;AAC9B,QAAM,mBAAmB,OAAO;AAChC,mBAAiB,UAAU,EAAE,MAAM,UAAU,MAAM,CAAC,aAAa,EAAE;AACnE,mBAAiB,OAAO,EAAE,MAAM,UAAU,MAAM,CAAC,GAAG,gBAAgB,EAAE;AACtE,QAAM,SAAS,eAAe;AAC9B,aAAW,WAAW,OAAO,OAAO;AAClC,UAAM,oBAAoB,QAAQ;AAClC,sBAAkB,OAAO,EAAE,MAAM,UAAU,MAAM,CAAC,GAAG,gBAAgB,EAAE;AAAA,EACzE;AACA,QAAM,eAAe,eAAe;AACpC,QAAM,iBAAiB,aAAa;AACpC,iBAAe,SAAS,EAAE,MAAM,UAAU,MAAM,WAAW,IAAI,CAAC,cAAc,UAAU,GAAG,EAAE;AAC7F,iBAAe,YAAY;AAAA,IACzB,MAAM;AAAA,IACN,MAAM,CAAC,GAAG,IAAI,IAAI,WAAW,IAAI,CAAC,cAAc,UAAU,SAAS,CAAC,CAAC;AAAA,EACvE;AACA,iBAAe,OAAO;AAAA,IACpB,MAAM;AAAA,IACN,MAAM,CAAC,GAAG,IAAI,IAAI,WAAW,IAAI,CAAC,cAAc,UAAU,IAAI,CAAC,CAAC;AAAA,EAClE;AACA,SAAO;AACT;AAEO,IAAM,qCAAqC,OAAO,OAAO;AAAA,EAC9D,aAAa;AAAA,EACb,yBAAyB;AAAA,EACzB,uBAAuB;AAAA,EACvB,UAAU;AAAA,EACV,oBAAoB;AACtB,CAAC;AA6FD,IAAM,4BAA4B;AAAA,EAChC;AAAA,EACA;AAAA,EACA,wBAAwB,iBAAiB,KAAK,IAAI,CAAC;AAAA,EACnD,kCAAkC,4BAA4B,KAAK,IAAI,CAAC;AAAA,EACxE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,EAAE,KAAK,IAAI;AA6CJ,SAAS,sBACd,MACyC;AACzC,QAAM,mBAAmB,yBAAyB,KAAK,gBAAgB;AACvE,QAAM,iBAAiB,IAAI,IAAI,gBAAgB;AAC/C,QAAM,aAAa,mBAAmB,KAAK,UAAU;AACrD,QAAM,iBAAiB,IAAI,IAAI,WAAW,IAAI,CAAC,cAAc,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC;AACxF,kBAAgB,KAAK,OAAO,OAAO;AACnC,kBAAgB,KAAK,QAAQ,QAAQ;AACrC,MAAI,CAAE,iCAAuD,SAAS,KAAK,aAAa,GAAG;AACzF,UAAM,IAAI;AAAA,MACR,yCAAyC,KAAK,aAAa;AAAA,IAC7D;AAAA,EACF;AACA,MACE,KAAK,kBAAkB,WACtB,CAAC,OAAO,cAAc,KAAK,aAAa,KAAK,KAAK,gBAAgB,IACnE;AACA,UAAM,IAAI,MAAM,0EAA0E;AAAA,EAC5F;AACA,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,MAAI,kBAAkB,mBAAmB,kBAAkB,UAAU;AACnE,UAAM,IAAI,MAAM,0EAA0E;AAAA,EAC5F;AACA,MAAI,KAAK,aAAa,kBAAkB,UAAU;AAChD,UAAM,IAAI,MAAM,6EAA6E;AAAA,EAC/F;AACA,QAAM,gBAAgB,sBAAsB;AAAA,IAC1C,GAAI,KAAK,0BAA0B,SAC/B,CAAC,IACD,EAAE,gBAAgB,KAAK,sBAAsB;AAAA,IACjD,GAAI,KAAK,sCAAsC,SAC3C,CAAC,IACD,EAAE,4BAA4B,KAAK,kCAAkC;AAAA,IACzE,GAAI,KAAK,6BAA6B,SAClC,CAAC,IACD,EAAE,0BAA0B,KAAK,yBAAyB;AAAA,IAC9D,GAAI,KAAK,wBAAwB,SAC7B,CAAC,IACD,EAAE,qBAAqB,KAAK,oBAAoB;AAAA,EACtD,CAAC;AACD,QAAM,cAAc;AAAA,IAClB,KAAK,eAAe,mCAAmC;AAAA,IACvD;AAAA,EACF;AACA,QAAM,wBAAwB;AAAA,IAC5B,KAAK,yBAAyB,mCAAmC;AAAA,IACjE;AAAA,EACF;AACA,QAAM,mBAAmB,KAAK,cAAc,IAAI,WAAW;AAE3D,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,QACJ,KACoD;AACpD,YAAM,QAAQ,KAAK,IAAI,IAAI,gBAAgB,KAAK,iBAAiB,IAAI,cAAc;AACnF,UAAI,SAAS,EAAG,QAAO,CAAC;AAExB,YAAM,iBAAiB,iBAAiB,IAAI,cAAc;AAC1D,0BAAoB,IAAI,iBAAiB,iBAAiB;AAC1D,0BAAoB,IAAI,kBAAkB,kBAAkB;AAC5D,sCAAgC,KAAK,WAAW,CAAC,CAAE;AACnD,YAAM,cAAc,0BAA0B,cAAc,mBAAmB;AAC/E,iCAA2B,IAAI,iBAAiB,WAAW;AAC3D,iCAA2B,IAAI,kBAAkB,WAAW;AAC5D,iCAA2B,IAAI,QAAQ,MAAM,CAAC,cAAc,cAAc,GAAG,WAAW;AACxF;AAAA,QACE,EAAE,gBAAgB,kBAAkB,YAAY,eAAe,KAAK,cAAc;AAAA,QAClF;AAAA,MACF;AACA,YAAM,kBAAkB,2BAA2B,GAAG;AACtD,YAAM,WAAW,gBAAgB,IAAI,UAAU,iBAAiB,WAAW;AAC3E,YAAM,eAAe,IAAI;AAAA,QACvB,SAAS,IAAI,CAAC,SAAS,UAAU,CAAC,WAAW,QAAQ,CAAC,IAAI,OAAO,CAAC;AAAA,MACpE;AACA,YAAM,gBAAgB;AAAA,QACpB,QAAQ,YAAY,SAAS,KAAK,MAAM;AAAA,QACxC,eAAe,KAAK;AAAA,QACpB;AAAA,QACA;AAAA,QACA,gBAAgB;AAAA,QAChB,YAAY,IAAI;AAAA,QAChB;AAAA,QACA,UAAU,SAAS;AAAA,UAAI,CAAC,SAAS,UAC/B,cAAc,SAAS,WAAW,QAAQ,CAAC,IAAI,aAAa,eAAe;AAAA,QAC7E;AAAA,QACA,iBAAiB;AAAA,UACf,IAAI;AAAA,UACJ;AAAA,UACA,cAAc;AAAA,QAChB;AAAA,QACA,kBAAkB;AAAA,UAChB,IAAI;AAAA,UACJ;AAAA,UACA,cAAc;AAAA,UACd,IAAI;AAAA,QACN;AAAA,QACA,SAAS;AAAA,UACP,IAAI;AAAA,UACJ;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAAA,MACF;AACA,YAAM,iBAAiB;AAAA,QACrB;AAAA,QACA,KAAK;AAAA,QACL;AAAA,QACA;AAAA,MACF;AACA;AAAA,QACE,EAAE,QAAQ,2BAA2B,eAAe,eAAe;AAAA,QACnE;AAAA,MACF;AACA,YAAM,cAAc,KAAK,UAAU,aAAa;AAChD,YAAM,UAA0B;AAAA,QAC9B,OAAO,KAAK;AAAA,QACZ,UAAU;AAAA,UACR,EAAE,MAAM,UAAU,SAAS,0BAA0B;AAAA,UACrD,EAAE,MAAM,QAAQ,SAAS,YAAY;AAAA,QACvC;AAAA,QACA,YAAY;AAAA,UACV,MAAM;AAAA,UACN,QAAQ;AAAA,QACV;AAAA,QACA,aAAa,KAAK,eAAe;AAAA,QACjC,WAAW,KAAK,aAAa;AAAA,QAC7B,WAAW,KAAK;AAAA,MAClB;AACA,YAAM,OAAO,OAAO,IAAI,cAAc,kBAAkB,YAAY;AAAA,QAClE,SAAS;AAAA,QACT,OAAO,IAAI,aAAa;AAAA,QACxB,OAAO;AAAA,QACP,OAAO,KAAK;AAAA,QACZ,eAAe,2BAA2B,SAAS,KAAK,GAAG;AAAA,QAC3D,MAAM,EAAE,YAAY,OAAO,IAAI,UAAU,EAAE;AAAA,QAC3C,QAAQ,IAAI;AAAA,QACZ,SAAS,CAAC,QAAQ,WAChB,YAAqB,SAAS,EAAE,GAAG,KAAK,KAAK,QAAQ,gBAAgB,OAAO,CAAC;AAAA,QAC/E,SAAS,CAAC,EAAE,OAAO,MAAM,mBAAmB,MAAM;AAAA,QAClD,kBAAkB;AAAA,MACpB,CAAC;AACD,UAAI,CAAC,KAAK,UAAW,OAAM,KAAK;AAChC,YAAM,EAAE,MAAM,IAAI,KAAK;AACvB,YAAM,WAAW,oBAAoB,KAAK;AAC1C,UAAI,SAAS,MAAM,SAAS,OAAO;AACjC,cAAM,IAAI;AAAA,UACR,0CAA0C,SAAS,MAAM,MAAM,cAAc,KAAK;AAAA,QACpF;AAAA,MACF;AACA,YAAM,QAAQ,SAAS,MAAM;AAAA,QAAI,CAAC,UAChC;AAAA,UACE;AAAA,UACA;AAAA,UACA,KAAK;AAAA,UACL;AAAA,UACA;AAAA,UACA,IAAI,kBAAkB,aAAa,IAAI,iBAAiB;AAAA,QAC1D;AAAA,MACF;AACA,aAAO,mBAAmB;AAAA,QACxB;AAAA,QACA,WACE,kBAAkB,WACd,KAAK,YACL;AAAA,UACE,UAAU;AAAA,UACV,iBAAiB;AAAA,UACjB,eAAe;AAAA,UACf,iBAAiB;AAAA,QACnB;AAAA,QACN,eAAe;AAAA,QACf,aAAa,KAAK;AAAA,MACpB,CAAC,EAAE,QAAQ,GAAG;AAAA,IAChB;AAAA,EACF;AACF;AAOO,SAAS,yBACd,SACA,UAA8C,CAAC,GACT;AACtC,QAAM,SAAS,sBAAsB,OAAO;AAC5C,QAAM,iBAAiB,IAAI;AAAA,KACxB,QAAQ,aAAa,mBAAmB,QAAQ,UAAU,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc;AAAA,MACpF,UAAU;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EACH;AACA,QAAM,cAAc,0BAA0B,OAAO,mBAAmB;AACxE,6BAA2B,QAAQ,MAAM,CAAC,OAAO,cAAc,GAAG,WAAW;AAC7E,SAAO,sCAAsC,SAAS,QAAQ,aAAa,cAAc;AAC3F;AAEA,SAAS,sCACP,SACA,QACA,aACA,gBACsC;AACtC,QAAM,kBAAkB,QAAQ,MAAM,CAAC,OAAO,cAAc;AAC5D,QAAM,kBAAkB,IAAI;AAAA,IAC1B,gBAAgB;AAAA,MAAQ,CAAC,WACvB,OAAO,WAAW,IAAI,CAAC,cAAc,CAAC,UAAU,aAAa,SAAS,CAAU;AAAA,IAClF;AAAA,EACF;AACA,SAAO,gBAAgB,IAAI,CAAC,WAAW;AACrC,UAAM,aAAa,wBAAwB,QAAQ,OAAO,0BAA0B;AACpF,UAAM,SAAS,IAAI,IAAI,WAAW,IAAI,CAAC,cAAc,UAAU,WAAW,CAAC;AAC3E,WAAO;AAAA,MACL,iBAAiB,OAAO;AAAA,MACxB,UAAU,OAAO,SACd,OAAO,CAAC,SAAS,OAAO,IAAI,IAAI,CAAC,EACjC,IAAI,CAAC,SAAS,YAAY,SAAS,IAAI,CAAC;AAAA,MAC3C,YAAY,WAAW;AAAA,QAAI,CAAC,cAC1B;AAAA,UACE;AAAA,UACA;AAAA,UACA,OAAO;AAAA,UACP,UAAU,oBACN,gBAAgB,IAAI,UAAU,iBAAiB,GAAG,YAClD;AAAA,UACJ;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEA,SAAS,wBAAwB,QAA0B,OAAsC;AAC/F,QAAM,iBAAiB,IAAI,IAAI,OAAO,SAAS,IAAI,CAAC,MAAM,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;AAClF,QAAM,WAAW,CAAC,GAAG,OAAO,UAAU,EACnC,OAAO,CAAC,cAAc,eAAe,IAAI,UAAU,WAAW,CAAC,EAC/D,KAAK,CAAC,GAAG,MAAM,eAAe,IAAI,EAAE,WAAW,IAAK,eAAe,IAAI,EAAE,WAAW,CAAE;AACzF,QAAM,WAAW,SAAS,MAAM,GAAG,KAAK;AACxC,QAAM,iBAAiB,IAAI,IAAI,SAAS,IAAI,CAAC,cAAc,UAAU,WAAW,CAAC;AACjF,QAAM,YAAY,CAAC,GAAG,OAAO,UAAU,EACpC,OAAO,CAAC,cAAc,CAAC,eAAe,IAAI,UAAU,WAAW,CAAC,EAChE,KAAK,CAAC,GAAG,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,cAAc,EAAE,WAAW,CAAC;AACzF,MAAI,OAAO;AACX,MAAI,MAAM,UAAU,SAAS;AAC7B,MAAI,UAAU,SAAS,SAAS;AAChC,SAAO,SAAS,SAAS,SAAS,QAAQ,KAAK;AAC7C,UAAM,YAAY,UAAU,UAAU,KAAK,IAAI,UAAU,MAAM;AAC/D,cAAU,CAAC;AACX,QAAI,CAAC,aAAa,eAAe,IAAI,UAAU,WAAW,EAAG;AAC7D,aAAS,KAAK,SAAS;AACvB,mBAAe,IAAI,UAAU,WAAW;AAAA,EAC1C;AACA,SAAO;AACT;AAEA,SAAS,wBACP,WACA,aACA,cACA,iBACA,gBACmC;AACnC,QAAM,sBAAsB,kBACxB,IAAI,IAAI,gBAAgB,IAAI,CAAC,aAAa,CAAC,SAAS,YAAY,SAAS,SAAS,CAAC,CAAC,IACpF;AACJ,QAAM,oBAAoB,2BAA2B,UAAU,WAAW;AAAA,IACxE,OAAO;AAAA,IACP,GAAI,sBAAsB,EAAE,oBAAoB,IAAI,CAAC;AAAA,EACvD,CAAC;AACD,QAAM,kBAAkB,UAAU,kBAC9B,kCAAkC,UAAU,eAAe,IAC3D;AACJ,SAAO;AAAA,IACL,aAAa,YAAY,SAAS,UAAU,WAAW;AAAA,IACvD,mBAAmB,UAAU,oBACzB,YAAY,SAAS,UAAU,iBAAiB,IAChD;AAAA,IACJ,iBAAiB,UAAU,mBAAmB;AAAA,IAC9C,OAAO,UAAU,QAAQ,YAAY,SAAS,UAAU,KAAK,IAAI;AAAA,IACjE,WAAW,UAAU,YAAY,YAAY,SAAS,UAAU,SAAS,IAAI;AAAA,IAC7E,WAAW,UAAU;AAAA,IACrB,yBAAyB,UAAU,2BAA2B;AAAA,IAC9D,sBAAsB,UAAU,wBAAwB;AAAA,IACxD,UAAU,UAAU,WAChB;AAAA,MACE,eAAe,UAAU,SAAS;AAAA,MAClC,eAAe,UAAU,SAAS;AAAA;AAAA;AAAA,MAGlC,iBAAiB,CAAC,GAAG,UAAU,SAAS,eAAe,EACpD,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,cAAc,EAAE,MAAM,CAAC,EAC/C,MAAM,GAAG,YAAY,EACrB,IAAI,CAAC,UAAU,EAAE,QAAQ,YAAY,SAAS,KAAK,MAAM,EAAE,EAAE;AAAA,IAClE,IACA;AAAA;AAAA;AAAA,IAGJ,YAAY,mBAAmB,UAAU,YAAY,WAAW;AAAA,IAChE,WAAW,kBAAkB,IAAI,CAAC,aAAa;AAC7C,aAAO;AAAA,QACL,YAAY,YAAY,QAAQ,SAAS,UAAU;AAAA,QACnD,WAAW,SAAS;AAAA,QACpB,OAAO,SAAS,QAAQ,YAAY,SAAS,SAAS,KAAK,IAAI;AAAA,MACjE;AAAA,IACF,CAAC;AAAA,IACD,eAAe,kBAAkB,uBAAuB,iBAAiB,WAAW,IAAI;AAAA,IACxF,qBAAqB,oBAAoB,WAAW,iBAAiB,cAAc;AAAA,EACrF;AACF;AAEA,SAAS,eACP,SACA,aACA,cACA,YAA8C,QACb;AACjC,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,sBAAsB,YACxB,IAAI,IAAI,UAAU,UAAU,IAAI,CAAC,aAAa,CAAC,SAAS,YAAY,SAAS,SAAS,CAAC,CAAC,IACxF;AACJ,QAAM,oBAAoB,2BAA2B,QAAQ,WAAW;AAAA,IACtE,OAAO;AAAA,IACP,GAAI,sBAAsB,EAAE,oBAAoB,IAAI,CAAC;AAAA,EACvD,CAAC;AACD,SAAO;AAAA,IACL,OAAO;AAAA,IACP,YAAY,QAAQ;AAAA,IACpB,aAAa,YAAY,SAAS,QAAQ,WAAW;AAAA,IACrD,WAAW,QAAQ;AAAA,IACnB,YAAY,mBAAmB,QAAQ,YAAY,WAAW;AAAA,IAC9D,WAAW,kBAAkB,IAAI,CAAC,aAAa;AAC7C,aAAO;AAAA,QACL,YAAY,YAAY,QAAQ,SAAS,UAAU;AAAA,QACnD,WAAW,SAAS;AAAA,QACpB,OAAO,SAAS,QAAQ,YAAY,SAAS,SAAS,KAAK,IAAI;AAAA,MACjE;AAAA,IACF,CAAC;AAAA,IACD,UAAU,EAAE,GAAG,QAAQ,SAAS;AAAA,EAClC;AACF;AAOA,SAAS,0BAA0B,WAAgE;AACjG,QAAM,UAAU,oBAAI,IAAoB;AACxC,QAAM,YAAY,oBAAI,IAAoB;AAC1C,SAAO;AAAA,IACL,QAAQ,YAAY;AAClB,YAAM,QAAQ,QAAQ,IAAI,UAAU;AACpC,UAAI,MAAO,QAAO;AAClB,YAAM,QAAQ,UAAU,UAAU;AAClC,UAAI,CAAC,SAAS,MAAM,KAAK,MAAM,OAAO;AACpC,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,YAAM,YAAY,UAAU,IAAI,KAAK;AACrC,UAAI,aAAa,cAAc,YAAY;AACzC,cAAM,IAAI;AAAA,UACR,6DAA6D,SAAS,UAAU,UAAU;AAAA,QAC5F;AAAA,MACF;AACA,YAAM,yBAAyB,QAAQ,IAAI,KAAK,KAAK,UAAU;AAC/D,YAAM,yBACJ,UAAU,IAAI,UAAU,KAAK,UAAU,IAAI,UAAU,MAAM;AAC7D,UAAI,0BAA0B,wBAAwB;AACpD,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AACA,cAAQ,IAAI,YAAY,KAAK;AAC7B,gBAAU,IAAI,OAAO,UAAU;AAC/B,aAAO;AAAA,IACT;AAAA,IACA,SAAS,MAAM;AACb,YAAM,oBAAoB,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,MAAM;AAChF,UAAI,kBAAkB,WAAW,EAAG,QAAO;AAC3C,YAAM,UAAU,IAAI;AAAA,QAClB,sBAAsB,kBAAkB,IAAI,YAAY,EAAE,KAAK,GAAG,CAAC;AAAA,QACnE;AAAA,MACF;AACA,aAAO,KAAK;AAAA,QACV;AAAA,QACA,CAAC,QAAQ,QAAgB,aACvB,GAAG,MAAM,GAAG,QAAQ,IAAI,QAAQ,KAAK,QAAQ;AAAA,MACjD;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,aAAa,OAAuB;AAC3C,SAAO,MAAM,QAAQ,uBAAuB,MAAM;AACpD;AAYA,SAAS,UAAUC,cAAqB,YAA4B;AAClE,SAAO,GAAGA,YAAW,IAAI,UAAU;AACrC;AAEA,SAAS,2BACP,KAC2C;AAC3C,QAAM,eAAe,oBAAI,IAA0C;AACnE,QAAM,MAAM,CAAC,gBAA8C;AACzD,iBAAa,IAAI,UAAU,YAAY,aAAa,YAAY,UAAU,GAAG,WAAW;AAAA,EAC1F;AACA,MAAI,IAAI,iBAAiB;AACvB,QAAI;AAAA,MACF,aAAa,IAAI,gBAAgB;AAAA,MACjC,YAAY,IAAI,gBAAgB;AAAA,MAChC,WAAW,IAAI,gBAAgB;AAAA,MAC/B,iBAAiB;AAAA,MACjB,yBAAyB;AAAA,MACzB,sBAAsB;AAAA,MACtB,UAAU,EAAE,GAAG,IAAI,gBAAgB,SAAS;AAAA,IAC9C,CAAC;AAAA,EACH;AACA,aAAW,UAAU,IAAI,SAAS;AAChC,eAAW,aAAa,OAAO,YAAY;AACzC,UAAI;AAAA,QACF,aAAa,UAAU;AAAA,QACvB,YAAY,OAAO;AAAA,QACnB,WAAW,UAAU;AAAA,QACrB,iBAAiB,UAAU,mBAAmB;AAAA,QAC9C,yBAAyB,UAAU,2BAA2B;AAAA,QAC9D,sBAAsB,UAAU,yBAAyB;AAAA,QACzD,UAAU,UAAU,WAChB;AAAA,UACE,eAAe,UAAU,SAAS;AAAA,UAClC,eAAe,UAAU,SAAS;AAAA,QACpC,IACA,EAAE,eAAe,GAAG,eAAe,EAAE;AAAA,MAC3C,CAAC;AAAA,IACH;AAAA,EACF;AACA,MAAI,IAAI,kBAAkB;AACxB,UAAM,aAAa,IAAI,iBAAiB;AACxC,UAAM,MAAM,UAAU,IAAI,iBAAiB,aAAa,UAAU;AAClE,QAAI,CAAC,aAAa,IAAI,GAAG,GAAG;AAC1B,UAAI;AAAA,QACF,aAAa,IAAI,iBAAiB;AAAA,QAClC;AAAA,QACA,WAAW,IAAI,iBAAiB;AAAA,QAChC,iBAAiB;AAAA,QACjB,yBAAyB;AAAA,QACzB,sBAAsB;AAAA,QACtB,UAAU,EAAE,GAAG,IAAI,iBAAiB,SAAS;AAAA,MAC/C,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,sBACP,QACA,UACM;AACN,MAAI,OAAO,SAAS,UAAU;AAC5B,oBAAgB,OAAO,OAAO,6BAA6B;AAC3D;AAAA,EACF;AACA,MAAI,CAAC,SAAS,IAAI,UAAU,OAAO,aAAa,OAAO,UAAU,CAAC,GAAG;AACnE,UAAM,IAAI;AAAA,MACR,yCAAyC,OAAO,WAAW,IAAI,OAAO,UAAU;AAAA,IAClF;AAAA,EACF;AACF;AAEA,SAAS,kBAAkB,GAA4B,GAAqC;AAC1F,MAAI,EAAE,SAAS,EAAE,KAAM,QAAO;AAC9B,SAAO,EAAE,SAAS,aAAa,EAAE,SAAS,YACtC,EAAE,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,aACtD,EAAE,SAAS,YAAY,EAAE,SAAS,YAAY,EAAE,UAAU,EAAE;AAClE;AAEA,SAAS,uBACP,QACA,aAC4B;AAC5B,QAAM,OAAO,OAAO;AACpB,SAAO;AAAA,IACL,QAAQ,KAAK;AAAA,IACb,MAAM,KAAK;AAAA,IACX,QAAQ,oBAAoB,KAAK,QAAQ,WAAW;AAAA,IACpD,QAAQ,oBAAoB,KAAK,QAAQ,WAAW;AAAA,IACpD,OAAO,YAAY,SAAS,KAAK,KAAK;AAAA,IACtC,cAAc,oBAAoB,KAAK,cAAc,WAAW;AAAA,IAChE,YAAY,KAAK;AAAA,IACjB,MAAM,KAAK;AAAA,IACX,kBAAkB,KAAK,OAAO,WAAW,IAAI,CAAC,OAAO,YAAY,SAAS,EAAE,CAAC;AAAA,IAC7E,WAAW,KAAK,YAAY,YAAY,SAAS,KAAK,SAAS,IAAI;AAAA,IACnE,gBAAgB,KAAK,iBAAiB,YAAY,SAAS,KAAK,cAAc,IAAI;AAAA,EACpF;AACF;AAEA,SAAS,oBAAoB,OAAgB,aAA2C;AACtF,MAAI,OAAO,UAAU,SAAU,QAAO,YAAY,SAAS,KAAK;AAChE,MAAI,MAAM,QAAQ,KAAK,EAAG,QAAO,MAAM,IAAI,CAAC,SAAS,oBAAoB,MAAM,WAAW,CAAC;AAC3F,MAAI,SAAS,OAAO,UAAU,UAAU;AACtC,WAAO,OAAO;AAAA,MACZ,OAAO,QAAQ,KAAK,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM;AAAA,QAC1C,YAAY,SAAS,GAAG;AAAA,QACxB,oBAAoB,OAAO,WAAW;AAAA,MACxC,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBACP,YACA,aACwB;AACxB,QAAM,YAAY,oBAAI,IAAiD;AACvE,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,UAAU,GAAG;AACrD,UAAM,YAAY,YAAY,SAAS,GAAG;AAC1C,UAAM,QAAQ,UAAU,IAAI,SAAS;AACrC,QAAI,SAAS,MAAM,aAAa,KAAK;AACnC,YAAM,IAAI;AAAA,QACR,qEAAqE,MAAM,QAAQ,UAAU,GAAG;AAAA,MAClG;AAAA,IACF;AACA,cAAU,IAAI,WAAW,EAAE,UAAU,KAAK,MAAM,CAAC;AAAA,EACnD;AACA,SAAO,OAAO,YAAY,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,MAAM,KAAK,CAAC,CAAC;AACpF;AAEA,SAAS,oBACP,WACA,QACA,gBAC0D;AAC1D,MAAI,CAAC,UAAU,UAAU,4BAA4B,OAAW,QAAO;AACvE,QAAM,WAAW,OAAO,WAAW;AACnC,QAAM,YAAY,eAAe,IAAI,SAAS,MAAM;AACpD,MAAI,CAAC,aAAa,UAAU,QAAQ,mBAAoB,QAAO;AAC/D,MAAI,SAAS,cAAc,UAAU,aAAa,SAAS,SAAS,UAAU,KAAM,QAAO;AAC3F,MAAI,SAAS,SAAS,UAAU,MAAM,MAAM,UAAU,MAAM,IAAK,QAAO;AACxE,QAAM,iBAAiB,SAAS;AAChC,SAAO;AAAA,IACL,cAAc,UAAU;AAAA,IACxB;AAAA,IACA,eAAe,UAAU;AAAA,IACzB,UAAU,UAAU,0BAA0B;AAAA,EAChD;AACF;AAEA,SAAS,oBAAoB,SAA2C,OAAqB;AAC3F,MAAI,WAAY,QAAgC,UAAU,UAAU;AAClE,UAAM,IAAI,MAAM,0BAA0B,KAAK,iCAAiC;AAAA,EAClF;AACF;AAEA,SAAS,gCACP,KACA,WACM;AACN,QAAM,gBAAgB,CAAC,OAAe,UAAkB;AACtD,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,UAAU,MAAM,OAAO,QAAQ,UAAU,MAAM,KAAK;AACzF,YAAM,IAAI;AAAA,QACR,0BAA0B,KAAK,IAAI,KAAK,0BAA0B,UAAU,GAAG,YAAY,UAAU,MAAM,GAAG,KAAK,UAAU,MAAM,GAAG;AAAA,MACxI;AAAA,IACF;AAAA,EACF;AACA,QAAM,gBAAgB,CAAC,SAA2C,UAAkB;AAClF,QAAI,CAAC,QAAS;AACd,kBAAc,QAAQ,WAAW,GAAG,KAAK,YAAY;AACrD,eAAW,CAAC,OAAO,QAAQ,KAAK,QAAQ,UAAU,QAAQ,GAAG;AAC3D,oBAAc,SAAS,WAAW,GAAG,KAAK,cAAc,KAAK,aAAa;AAAA,IAC5E;AAAA,EACF;AACA,gBAAc,IAAI,iBAAiB,iBAAiB;AACpD,gBAAc,IAAI,kBAAkB,kBAAkB;AACtD,aAAW,CAAC,iBAAiB,UAAU,KAAK,IAAI,QAAQ,QAAQ,GAAG;AACjE,eAAW,CAAC,gBAAgB,SAAS,KAAK,WAAW,WAAW,QAAQ,GAAG;AACzE,YAAM,QAAQ,WAAW,eAAe,gBAAgB,cAAc;AACtE,oBAAc,UAAU,WAAW,GAAG,KAAK,YAAY;AACvD,UAAI,UAAU,oBAAoB,QAAW;AAC3C,sBAAc,UAAU,iBAAiB,GAAG,KAAK,kBAAkB;AAAA,MACrE;AACA,iBAAW,CAAC,eAAe,QAAQ,KAAK,UAAU,UAAU,QAAQ,GAAG;AACrE,sBAAc,SAAS,WAAW,GAAG,KAAK,cAAc,aAAa,aAAa;AAAA,MACpF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,4BAA4B,OAAgB,aAAwC;AAC3F,QAAM,aAAa,KAAK,UAAU,KAAK;AACvC,MAAI,YAAY,SAAS,UAAU,MAAM,YAAY;AACnD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,2BACP,SACA,aACM;AACN,aAAW,YAAY,SAAS,aAAa,CAAC,EAAG,aAAY,QAAQ,SAAS,UAAU;AAC1F;AAEA,SAAS,2BACP,SACA,aACM;AACN,aAAW,UAAU,SAAS;AAC5B,eAAW,aAAa,OAAO,YAAY;AACzC,iBAAW,YAAY,UAAU,UAAW,aAAY,QAAQ,SAAS,UAAU;AACnF,iBAAW,QAAQ,UAAU,UAAU,mBAAmB,CAAC,GAAG;AAC5D,cAAM,YAAY,KAAK,OAAO,YAAY,GAAG;AAC7C,YAAI,aAAa,KAAK,CAAC,QAAQ,KAAK,KAAK,OAAO,MAAM,YAAY,CAAC,CAAC,EAAG;AACvE,oBAAY,QAAQ,KAAK,OAAO,MAAM,GAAG,SAAS,CAAC;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,sBAAsB,SAK7B;AACA,QAAM,iBAAiB,QAAQ,kBAAkB,mCAAmC;AACpF,QAAM,6BACJ,QAAQ,8BAA8B,mCAAmC;AAC3E,QAAM,2BACJ,QAAQ,4BAA4B,mCAAmC;AACzE,MAAI,CAAC,OAAO,cAAc,cAAc,KAAK,kBAAkB,GAAG;AAChE,UAAM,IAAI,MAAM,8EAA8E;AAAA,EAChG;AACA,MAAI,CAAC,OAAO,cAAc,0BAA0B,KAAK,8BAA8B,GAAG;AACxF,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,OAAO,cAAc,wBAAwB,KAAK,4BAA4B,GAAG;AACpF,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,qBAAqB,QAAQ,wBAAwB,CAAC,eAAe;AAAA,EACvE;AACF;AAEA,SAAS,mBAAmB,QAA+D;AACzF,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,MAAM,qDAAqD;AAAA,EACvE;AACA,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,OAAO,IAAI,CAAC,UAAU;AAC3B,oBAAgB,MAAM,KAAK,eAAe;AAC1C,QAAI,KAAK,IAAI,MAAM,GAAG,GAAG;AACvB,YAAM,IAAI,MAAM,+CAA+C,MAAM,GAAG,GAAG;AAAA,IAC7E;AACA,SAAK,IAAI,MAAM,GAAG;AAClB,QAAI,MAAM,UAAU,UAAU;AAC5B,YAAM,IAAI,MAAM,qCAAqC,MAAM,GAAG,6BAA6B;AAAA,IAC7F;AACA,QAAI,MAAM,QAAQ,oBAAoB;AACpC,YAAM,IAAI;AAAA,QACR,qCAAqC,MAAM,GAAG;AAAA,MAChD;AAAA,IACF;AACA,QAAI,MAAM,cAAc,YAAY;AAClC,YAAM,IAAI;AAAA,QACR,qCAAqC,MAAM,GAAG;AAAA,MAChD;AAAA,IACF;AACA,QACE,CAAC,OAAO,SAAS,MAAM,MAAM,GAAG,KAChC,CAAC,OAAO,SAAS,MAAM,MAAM,GAAG,KAChC,MAAM,MAAM,OAAO,MAAM,MAAM,KAC/B;AACA,YAAM,IAAI,MAAM,qCAAqC,MAAM,GAAG,wBAAwB;AAAA,IACxF;AACA,QAAI,MAAM,SAAS,SAAS;AAC1B,YAAM,IAAI,MAAM,qCAAqC,MAAM,GAAG,6BAA6B;AAAA,IAC7F;AACA,WAAO;AAAA,MACL,KAAK,MAAM;AAAA,MACX,OAAO;AAAA,MACP,WAAW,MAAM;AAAA,MACjB,OAAO,EAAE,GAAG,MAAM,MAAM;AAAA,MACxB,MAAM,MAAM;AAAA,IACd;AAAA,EACF,CAAC;AACH;AAEA,SAAS,cAAc,OAAe,OAAuB;AAC3D,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,SAAS,GAAG;AAC9C,UAAM,IAAI,MAAM,0BAA0B,KAAK,kCAAkC;AAAA,EACnF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAAgE;AAC3F,QAAM,SAAS,+BAA+B,UAAU,KAAK;AAC7D,MAAI,OAAO,QAAS,QAAO,OAAO;AAClC,QAAM,SAAS,OAAO,MAAM,OACzB,IAAI,CAAC,UAAU,GAAG,MAAM,KAAK,KAAK,GAAG,KAAK,QAAQ,KAAK,MAAM,OAAO,EAAE,EACtE,KAAK,IAAI;AACZ,QAAM,IAAI,MAAM,uDAAuD,MAAM,EAAE;AACjF;AAEA,SAAS,iBACP,OACA,cACA,eACA,cACA,gBACA,kBACY;AACZ,MAAI,MAAM,OAAO,YAAY,eAAe;AAC1C,UAAM,IAAI;AAAA,MACR,0CAA0C,MAAM,OAAO,OAAO,qBAAqB,aAAa;AAAA,IAClG;AAAA,EACF;AACA,MAAI,MAAM,OAAO,SAAS,MAAM,OAAO,MAAM;AAC3C,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AACA,MAAI,CAAC,aAAa,IAAI,MAAM,OAAO,IAAI,GAAG;AACxC,UAAM,IAAI;AAAA,MACR,qCAAqC,MAAM,OAAO,IAAI;AAAA,IACxD;AAAA,EACF;AAEA,QAAM,QAAQ,MAAM,OAAO,YAAY,IAAI,CAAC,eAAe;AACzD,UAAM,UAAU,aAAa,IAAI,UAAU;AAC3C,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI;AAAA,QACR,uEAAuE,UAAU;AAAA,MACnF;AAAA,IACF;AACA,WAAO;AAAA,EACT,CAAC;AACD,QAAM,eAAe,mBAAmB,MAAM,QAAQ,CAAC,YAAY,QAAQ,YAAY,CAAC;AACxF,MAAI,aAAa,WAAW,GAAG;AAC7B,UAAM,IAAI,MAAM,4DAA4D;AAAA,EAC9E;AAEA,QAAM,YAAY,eAAe,IAAI,MAAM,aAAa,MAAM;AAC9D,MAAI,CAAC,WAAW;AACd,UAAM,IAAI;AAAA,MACR,sDAAsD,MAAM,aAAa,MAAM;AAAA,IACjF;AAAA,EACF;AACA,MAAI,MAAM,aAAa,cAAc,UAAU,WAAW;AACxD,UAAM,IAAI;AAAA,MACR,kDAAkD,UAAU,GAAG,cAAc,UAAU,SAAS;AAAA,IAClG;AAAA,EACF;AACA,MAAI,MAAM,aAAa,SAAS,UAAU,MAAM;AAC9C,UAAM,IAAI;AAAA,MACR,6CAA6C,UAAU,GAAG,cAAc,UAAU,IAAI;AAAA,IACxF;AAAA,EACF;AACA,QAAM,UACJ,qBAAqB,SACjB,UAAU,MAAM,MAAM,UAAU,MAAM,MACtC,UAAU,MAAM,MAAM;AAC5B,MAAI,MAAM,aAAa,SAAS,SAAS;AACvC,UAAM,IAAI;AAAA,MACR,+CAA+C,UAAU,GAAG;AAAA,IAC9D;AAAA,EACF;AAEA,QAAM,eAAuC;AAAA,IAC3C,QAAQ,MAAM,aAAa;AAAA,IAC3B,WAAW,MAAM,aAAa;AAAA,IAC9B,QAAQ,MAAM,aAAa;AAAA,IAC3B,GAAI,MAAM,aAAa,OAAO,EAAE,MAAM,MAAM,aAAa,KAAK,IAAI,CAAC;AAAA,IACnE,GAAI,MAAM,aAAa,YAAY,EAAE,WAAW,MAAM,aAAa,UAAU,IAAI,CAAC;AAAA,EACpF;AACA,QAAM,OAAuB;AAAA,IAC3B,MAAM,MAAM;AAAA,IACZ,QAAQ;AAAA,MACN,SAAS,MAAM,OAAO;AAAA,MACtB,MAAM,MAAM,OAAO;AAAA,MACnB,GAAI,MAAM,OAAO,QAAQ,EAAE,OAAO,MAAM,OAAO,MAAM,IAAI,CAAC;AAAA,IAC5D;AAAA,IACA,QAAQ,MAAM;AAAA,IACd,OAAO,MAAM;AAAA,IACb;AAAA,IACA,YAAY,MAAM;AAAA,IAClB,MAAM,MAAM;AAAA,IACZ,QAAQ;AAAA,MACN,YAAY,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,YAAY,QAAQ,QAAQ,UAAU,CAAC,CAAC;AAAA,MAC3E,YAAY,CAAC,GAAG,IAAI,IAAI,MAAM,IAAI,CAAC,YAAY,QAAQ,QAAQ,UAAU,CAAC,CAAC;AAAA,MAC3E;AAAA,IACF;AAAA,IACA,GAAI,MAAM,YAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;AAAA,IACxD,GAAI,MAAM,iBAAiB,EAAE,gBAAgB,MAAM,eAAe,IAAI,CAAC;AAAA,EACzE;AACA,SAAO,eAAe,IAAI;AAC5B;AAEA,SAAS,iBAAiB,SAA2C;AACnE,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM,IAAI,MAAM,+DAA+D;AAAA,EACjF;AACA,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,OAAO;AAAA,EAC7B,QAAQ;AACN,UAAM,IAAI,MAAM,0DAA0D;AAAA,EAC5E;AACA,MAAI,CAAC,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GAAG;AAClE,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,SAAO;AACT;AAQA,SAAS,gBACP,QACA,iBACA,OACkB;AAClB,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,MAAM,iEAAiE;AAAA,EACnF;AACA,QAAM,WAA6B,CAAC;AACpC,aAAW,SAAS,QAAQ;AAC1B,QAAI,CAAC,yBAAyB,KAAK,GAAG;AACpC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,aAAS,KAAK,MAAM,OAAO;AAAA,EAC7B;AACA,uBAAqB,UAAU,uBAAuB;AACtD,QAAM,UAAU,oBAAI,IAA4B;AAChD,aAAW,SAAS,QAAQ;AAC1B,0BAAsB,MAAM,QAAQ,eAAe;AACnD,QAAI,MAAM,QAAQ,cAAc,WAAW,EAAG;AAC9C,UAAM,WAAW,QAAQ,IAAI,MAAM,QAAQ,UAAU;AACrD,QAAI,UAAU;AACZ,UACE,SAAS,QAAQ,eAAe,MAAM,QAAQ,cAC9C,SAAS,QAAQ,SAAS,MAAM,QAAQ,QACxC,SAAS,QAAQ,UAAU,MAAM,QAAQ,SACzC,SAAS,QAAQ,YAAY,MAAM,QAAQ,SAC3C;AACA,cAAM,IAAI;AAAA,UACR,mCAAmC,MAAM,QAAQ,UAAU;AAAA,QAC7D;AAAA,MACF;AACA,UAAI,CAAC,SAAS,QAAQ,KAAK,CAAC,WAAW,kBAAkB,QAAQ,MAAM,MAAM,CAAC,GAAG;AAC/E,iBAAS,QAAQ,KAAK,MAAM,MAAM;AAAA,MACpC;AACA,eAAS,eAAe,mBAAmB;AAAA,QACzC,GAAG,SAAS;AAAA,QACZ,GAAG,MAAM,QAAQ;AAAA,MACnB,CAAC;AACD;AAAA,IACF;AACA,YAAQ,IAAI,MAAM,QAAQ,YAAY;AAAA,MACpC,SAAS,MAAM;AAAA,MACf,SAAS,CAAC,MAAM,MAAM;AAAA,MACtB,cAAc,mBAAmB,MAAM,QAAQ,aAAa;AAAA,IAC9D,CAAC;AAAA,EACH;AACA,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI,MAAM,mEAAmE;AAAA,EACrF;AACA,QAAM,eAA2D;AAAA,IAC/D,UAAU;AAAA,IACV,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,KAAK;AAAA,IACL,MAAM;AAAA,EACR;AACA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,EACxB;AAAA,IACC,CAAC,GAAG,MACF,aAAa,EAAE,QAAQ,QAAQ,IAAI,aAAa,EAAE,QAAQ,QAAQ,KAClE,EAAE,QAAQ,aAAa,EAAE,QAAQ,cACjC,EAAE,QAAQ,WAAW,cAAc,EAAE,QAAQ,UAAU;AAAA,EAC3D,EACC,MAAM,GAAG,KAAK;AACnB;AAEA,SAASC,sBAAqB,OAAyC;AACrE,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,QAAQ;AACd,SACE,OAAO,MAAM,eAAe,YAC5B,OAAO,MAAM,eAAe,YAC5B,OAAO,MAAM,UAAU,YACvB,MAAM,QAAQ,MAAM,aAAa;AAErC;AAEA,SAAS,yBAAyB,OAAiD;AACjF,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,QAAQ;AACd,SAAOA,sBAAqB,MAAM,OAAO,KAAK,gBAAgB,MAAM,MAAM;AAC5E;AAEA,SAAS,gBAAgB,OAAkD;AACzE,MAAI,CAAC,SAAS,OAAO,UAAU,SAAU,QAAO;AAChD,QAAM,QAAQ;AACd,MAAI,MAAM,SAAS,WAAW;AAC5B,WAAO,OAAO,MAAM,gBAAgB,YAAY,OAAO,cAAc,MAAM,UAAU;AAAA,EACvF;AACA,SAAO,MAAM,SAAS,YAAY,OAAO,MAAM,UAAU,YAAY,MAAM,MAAM,KAAK,EAAE,SAAS;AACnG;AAEA,SAAS,cACP,SACA,YACA,aACA,iBACyB;AACzB,QAAM,EAAE,QAAQ,IAAI;AACpB,SAAO;AAAA,IACL;AAAA,IACA,SAAS,QAAQ,QAAQ;AAAA,MAAI,CAAC,WAC5B,OAAO,SAAS,YACZ;AAAA,QACE,GAAG,gBAAgB,IAAI,UAAU,OAAO,aAAa,OAAO,UAAU,CAAC;AAAA,QACvE,aAAa,YAAY,SAAS,OAAO,WAAW;AAAA,QACpD,MAAM;AAAA,MACR,IACA,EAAE,MAAM,UAAU,OAAO,YAAY,SAAS,OAAO,KAAK,EAAE;AAAA,IAClE;AAAA,IACA,WAAW,YAAY,SAAS,QAAQ,UAAU;AAAA,IAClD,MAAM,YAAY,SAAS,QAAQ,IAAI;AAAA,IACvC,UAAU,QAAQ;AAAA,IAClB,SAAS,QAAQ,UAAU,YAAY,SAAS,QAAQ,OAAO,IAAI;AAAA,IACnE,OAAO,YAAY,SAAS,QAAQ,KAAK;AAAA,IACzC,WAAW,QAAQ,YAAY,YAAY,SAAS,QAAQ,SAAS,IAAI;AAAA,IACzE,mBAAmB,QAAQ,qBACvB,YAAY,SAAS,QAAQ,kBAAkB,IAC/C;AAAA,IACJ,gBAAgB,QAAQ,kBAAkB,YAAY,SAAS,QAAQ,eAAe,IAAI;AAAA,IAC1F,YAAY,QAAQ;AAAA,IACpB,cAAc,QAAQ,aAAa,IAAI,CAAC,SAAS;AAAA,MAC/C,MAAM,IAAI;AAAA,MACV,KAAK,YAAY,SAAS,IAAI,GAAG;AAAA,MACjC,SAAS,IAAI,UAAU,YAAY,SAAS,IAAI,OAAO,IAAI;AAAA,IAC7D,EAAE;AAAA,EACJ;AACF;AAEA,SAAS,mBAAmB,MAA6C;AACvE,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,KAAK,OAAO,CAAC,QAAQ;AAC1B,UAAM,MAAM,KAAK,UAAU,CAAC,IAAI,MAAM,IAAI,KAAK,IAAI,WAAW,IAAI,CAAC;AACnE,QAAI,KAAK,IAAI,GAAG,EAAG,QAAO;AAC1B,SAAK,IAAI,GAAG;AACZ,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,yBAAyB,OAAoC;AACpE,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,IAAI,MAAM,2DAA2D;AAAA,EAC7E;AACA,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,QAAQ,KAAK,KAAK,MAAM,MAAM;AACjC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,IAAI,IAAI,KAAK,EAAE,SAAS,MAAM,QAAQ;AACxC,UAAM,IAAI,MAAM,wDAAwD;AAAA,EAC1E;AACA,SAAO,CAAC,GAAG,KAAK;AAClB;AAEA,SAAS,gBAAgB,OAAe,OAAqB;AAC3D,MAAI,CAAC,SAAS,MAAM,KAAK,MAAM,OAAO;AACpC,UAAM,IAAI,MAAM,0BAA0B,KAAK,qCAAqC;AAAA,EACtF;AACF;;;AGj3CA,IAAMC,eAAc;AACpB,IAAMC,aAAY;AAsBlB,IAAMC,mBAAkB;AAExB,IAAM,iBACJ;AAMF,SAAS,uBAAuB,MAAwB;AACtD,SAAO,iBAAiB,MAAMF,cAAaC,UAAS,EACjD,MAAM,IAAI,EACV,IAAI,CAAC,MAAM,EAAE,QAAQ,YAAY,EAAE,EAAE,KAAK,CAAC,EAC3C,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,WAAW,GAAG,CAAC;AAC1C;AAEA,eAAe,eACb,KACA,SACA,KACA,YACmB;AACnB,QAAM,UAA0B;AAAA,IAC9B,OAAO,QAAQ;AAAA,IACf,UAAU;AAAA,MACR,EAAE,MAAM,UAAU,SAAS,eAAe;AAAA,MAC1C,EAAE,MAAM,QAAQ,SAAS;AAAA,EAAc,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,EAAE,KAAK,IAAI,CAAC,GAAG;AAAA,IAC/E;AAAA,IACA,WAAW,QAAQ,aAAa;AAAA,EAClC;AACA,QAAM,MAAwB;AAAA,IAC5B,SAAS,QAAQ;AAAA,IACjB,QAAQ,QAAQ;AAAA,IAChB,OAAO,QAAQ;AAAA,EACjB;AACA,QAAM,OAAO,MAAM,WAAW,YAAY;AAAA,IACxC,SAAS;AAAA,IACT,OAAO,IAAI,aAAa;AAAA,IACxB,OAAO;AAAA,IACP,OAAO,QAAQ;AAAA,IACf,eAAe,2BAA2B,SAAS,GAAG;AAAA,IACtD,MAAM,EAAE,YAAY,OAAO,IAAI,UAAU,EAAE;AAAA,IAC3C,QAAQ,IAAI;AAAA,IACZ,SAAS,CAAC,QAAQ,WAAW,QAAQ,SAAS,EAAE,GAAG,KAAK,QAAQ,gBAAgB,OAAO,CAAC;AAAA,IACxF,SAAS;AAAA,IACT,kBAAkB;AAAA,EACpB,CAAC;AACD,MAAI,CAAC,KAAK,UAAW,OAAM,KAAK;AAChC,QAAM,MAAM,KAAK;AACjB,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,IAAI,QAAQ,KAAK,CAAC;AAC5C,QAAI,MAAM,QAAQ,MAAM,GAAG;AACzB,YAAM,UAAU,OAAO;AAAA,QACrB,CAAC,MAAmB,OAAO,MAAM,YAAY,EAAE,KAAK,EAAE,SAAS;AAAA,MACjE;AACA,UAAI,QAAQ,SAAS,EAAG,QAAO;AAAA,IACjC;AAAA,EACF,QAAQ;AAAA,EAGR;AACA,SAAO;AACT;AAGO,SAAS,uBAAuB,OAAsC,CAAC,GAAoB;AAChG,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,UAAU,KAAK,kBAAkBC;AACvC,QAAM,mBAAmB,KAAK,cAAc,IAAI,WAAW;AAC3D,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,QAAQ,KAAmD;AAC/D,YAAM,SAASC,eAAc,IAAI,cAAc;AAI/C,YAAM,QAAkB,CAAC;AACzB,iBAAW,KAAK,IAAI,YAAY,CAAC,GAAG;AAClC,cAAM,IAAI,gBAAgB,CAAC;AAC3B,YAAI,EAAG,OAAM,KAAK,CAAC;AAAA,MACrB;AACA,YAAM,UAAU,uBAAuB,MAAM;AAC7C,UAAI,MAAM,WAAW,KAAK,QAAQ,WAAW,EAAG,QAAO,CAAC;AAExD,YAAM,YACJ,KAAK,WAAW,MAAM,SAAS,IAC3B,MAAM,eAAe,OAAO,KAAK,SAAS,KAAK,IAAI,cAAc,gBAAgB,IACjF;AAIN,YAAM,QAAQ,oBAAI,IAA6C;AAC/D,iBAAW,KAAK,SAAS;AACvB,cAAM,IAAI,QAAQ,CAAC;AACnB,YAAI,EAAG,OAAM,IAAI,GAAG,EAAE,MAAM,GAAG,OAAO,EAAE,CAAC;AAAA,MAC3C;AACA,iBAAW,KAAK,WAAW;AACzB,cAAM,IAAI,QAAQ,CAAC;AACnB,YAAI,CAAC,EAAG;AACR,cAAM,IAAI,MAAM,IAAI,CAAC;AACrB,YAAI,EAAG,GAAE,SAAS;AAAA,YACb,OAAM,IAAI,GAAG,EAAE,MAAM,GAAG,OAAO,EAAE,CAAC;AAAA,MACzC;AAGA,YAAM,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,EAC9B,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC,EAChE,MAAM,GAAG,UAAU;AACtB,UAAI,OAAO,WAAW,EAAG,QAAO,CAAC;AAEjC,YAAM,QAAQ,CAACH,cAAa,SAAS,GAAG,OAAO,IAAI,CAAC,MAAM,KAAK,EAAE,IAAI,EAAE,GAAGC,UAAS,EAAE;AAAA,QACnF;AAAA,MACF;AACA,YAAM,OAAO,GAAG,WAAW,QAAQD,cAAaC,UAAS,CAAC;AAAA;AAAA,EAAO,KAAK;AAAA;AACtE,UAAI,SAAS,OAAQ,QAAO,CAAC;AAE7B,aAAO;AAAA,QACL;AAAA,UACE,SAAS;AAAA,UACT,OAAO;AAAA,UACP,WAAW,WAAW,OAAO,MAAM,kBAAkB,MAAM,MAAM,qBAAqB,QAAQ,MAAM;AAAA,QACtG;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;;;AChLA,SAAS,UAAU;AA4CnB,SAAS,eAAe,UAAiD;AACvE,SAAO,SACJ,IAAI,CAAC,GAAG,MAAM;AACb,UAAM,SAAS,EAAE,qBAAqB;AAAA,UAAa,EAAE,kBAAkB,KAAK;AAC5E,UAAM,UAAU,EAAE,UAAU,KAAK,EAAE,OAAO,MAAM;AAChD,WAAO,GAAG,IAAI,CAAC,MAAM,EAAE,QAAQ,IAAI,EAAE,IAAI,IAAI,OAAO,IAAI,EAAE,KAAK,GAAG,MAAM;AAAA,EAC1E,CAAC,EACA,KAAK,IAAI;AACd;AAGO,SAAS,qBAAqB,MAAoD;AACvF,MAAI,CAAC,KAAK,OAAQ,OAAM,IAAI,MAAM,0CAA0C;AAC5E,MAAI,CAAC,KAAK,MAAO,OAAM,IAAI,MAAM,yCAAyC;AAC1E,QAAM,QAAQ,KAAK,SAAS;AAE5B,QAAM,kBACJ,KAAK,YACJ,OAAO,MAAc,MAA8D;AAClF,UAAM,YAAY,GAAG;AAAA,MACnB,MAAM,KAAK,YAAY;AAAA,MACvB,QAAQ,KAAK;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,QAAQ,EAAE,OAAO,KAAK,MAAM;AAAA,IAC9B,CAAC;AACD,UAAM,WAAW,IAAI,gBAAgB;AACrC,eAAW,QAAQ,OAAO;AACxB,eAAS,SAAS,uBAAuB,MAAM,EAAE,IAAI,WAAW,OAAO,KAAK,MAAM,CAAC,CAAC;AAAA,IACtF;AACA,UAAM,SAAS,MAAM,SAAS;AAAA,MAC5B,qBAAqB,EAAE,UAAU;AAAA,MACjC,EAAE,YAAY,IAAI,mBAAmB,EAAE,KAAK,CAAC,EAAE;AAAA,MAC/C,EAAE,QAAQ,EAAE,OAAO;AAAA,IACrB;AACA,WAAO,OAAO;AAAA,EAChB;AAEF,SAAO,qBAAqB;AAAA,IAC1B,MAAM;AAAA,IACN,OAAO;AAAA,IACP,SAAS,KAAK;AAAA,IACd,QAAQ,KAAK;AAAA,IACb,eAAe,KAAK;AAAA,IACpB,YAAY,KAAK,cAAc,KAAK;AAAA,IACpC,YAAY,KAAK;AAAA,IACjB,uBAAuB,KAAK;AAAA,IAC5B,iBAAiB,KAAK;AAAA,IACtB,gBAAgB,KAAK;AAAA,IACrB,WAAW,KAAK;AAAA,IAChB,eAAe,KAAK;AAAA,IACpB,eACE;AAAA,IACF,WAAW,CAAC,WAAW;AAAA,EAA4B,OAAO,MAAM,GAAG,GAAG,CAAC;AAAA,IACvE,SAAS,OAAO,WAAW,QAAQ;AACjC,UAAI;AACJ,UAAI;AACF,mBAAW,MAAM,gBAAgB,WAAW,GAAG;AAAA,MACjD,SAAS,GAAG;AACV,cAAM,IAAI;AAAA,UACR,sDAAiD,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC,CAAC;AAAA,QAC7F;AAAA,MACF;AACA,UAAI,SAAS,WAAW,GAAG;AACzB,cAAM,IAAI,MAAM,2DAA2D;AAAA,MAC7E;AACA,aAAO,eAAe,QAAQ;AAAA,IAChC;AAAA,EACF,CAAC;AACH;;;ACjGA,IAAM,6BAA6B;AAEnC,IAAM,mBAAmB;AASzB,SAAS,QAAQ,QAA2B;AAC1C,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,EAAG,QAAO,EAAE,WAAW,GAAG,UAAU,EAAE;AAChD,MAAI,MAAM;AACV,aAAW,KAAK,OAAQ,QAAO;AAC/B,QAAM,YAAY,MAAM;AACxB,MAAI,QAAQ;AACZ,aAAW,KAAK,QAAQ;AACtB,UAAM,IAAI,IAAI;AACd,aAAS,IAAI;AAAA,EACf;AACA,SAAO,EAAE,WAAW,UAAU,QAAQ,EAAE;AAC1C;AAIA,SAAS,sBAAsB,GAAwB,GAAgC;AACrF,MAAI,EAAE,mBAAmB,EAAE,eAAgB,QAAO,EAAE,iBAAiB,EAAE;AACvE,MAAI,EAAE,cAAc,EAAE,UAAW,QAAO,EAAE,YAAY,EAAE;AACxD,SAAO,EAAE,aAAa,EAAE,aAAa,KAAK,EAAE,aAAa,EAAE,aAAa,IAAI;AAC9E;AAUO,SAAS,oBACd,SACA,MACuB;AACvB,QAAM,oBAAoB,MAAM,qBAAqB;AACrD,QAAM,SAAS,QAAQ,IAAI,CAAC,WAAgC;AAC1D,UAAM,EAAE,WAAW,SAAS,IAAI,QAAQ,OAAO,MAAM;AACrD,UAAM,OAAO,WAAW,oBAAoB,aAAa;AACzD,WAAO;AAAA,MACL,YAAY,OAAO;AAAA,MACnB,gBAAgB;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF,CAAC;AACD,SAAO,OAAO,KAAK,qBAAqB;AAC1C;AAYO,SAAS,qBACd,SACA,GACA,MACU;AACV,MAAI,IAAI,EAAG,OAAM,IAAI,MAAM,6CAA6C,CAAC,GAAG;AAC5E,QAAM,SAAS,oBAAoB,SAAS,IAAI;AAChD,MAAI,OAAO,UAAU,EAAG,QAAO,OAAO,IAAI,CAAC,MAAM,EAAE,UAAU;AAC7D,QAAM,UAAU,OAAO,OAAO,CAAC,MAAM,CAAC,EAAE,IAAI;AAC5C,MAAI,QAAQ,UAAU,EAAG,QAAO,QAAQ,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU;AAC3E,QAAM,OAAO,OAAO,OAAO,CAAC,MAAM,EAAE,IAAI;AACxC,QAAM,OAAO,KAAK,MAAM,GAAG,IAAI,QAAQ,MAAM;AAC7C,SAAO,CAAC,GAAG,SAAS,GAAG,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU;AACtD;;;AClGA,SAAS,cAAAG,mBAAkB;AAC3B,SAAS,cAAAC,aAAY,gBAAAC,qBAAoB;AACzC,SAAS,WAAAC,gBAAe;AACxB,SAAS,KAAAC,UAAS;AAaX,IAAM,uBAAuB;AA6UpC,IAAM,YAAYC,GACf,OAAO,EACP,IAAI,CAAC,EACL,OAAO,CAAC,UAAU,MAAM,KAAK,MAAM,OAAO,yCAAyC;AACtF,IAAM,OAAOA,GAAE,OAAO,EAAE,MAAM,uBAAuB;AACrD,IAAM,kBAAkBA,GAAE,OAAO,EAAE,MAAM,gBAAgB;AACzD,IAAM,qBAAqBA,GACxB,OAAO,EACP,MAAM,4EAA4E;AACrF,IAAM,gBAAgBA,GACnB,OAAO,EACP,MAAM,oDAAoD,EAC1D,OAAO,CAAC,UAAU,OAAO,SAAS,KAAK,MAAM,KAAK,CAAC,GAAG,mBAAmB;AAC5E,IAAM,mBAAmBA,GAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK;AAC7D,IAAM,gBAAgBA,GAAE,OAAO,EAAE,OAAO;AAExC,IAAM,oBAAoBA,GACvB,OAAO;AAAA,EACN,MAAM;AAAA,EACN,KAAK;AAAA,EACL,QAAQ;AAAA,EACR,YAAY;AACd,CAAC,EACA,OAAO;AAEV,IAAM,kBAAkBA,GACrB,OAAO;AAAA,EACN,KAAK;AAAA,EACL,UAAU;AACZ,CAAC,EACA,OAAO;AAEV,IAAM,sBAAsBA,GACzB,OAAO;AAAA,EACN,MAAM;AAAA,EACN,SAAS;AACX,CAAC,EACA,OAAO;AAEV,IAAM,iBAAiB;AAAA,EACrB,SAAS;AAAA,EACT,YAAY;AAAA,EACZ,WAAWA,GAAE,MAAM,iBAAiB,EAAE,IAAI,CAAC;AAC7C;AAEA,IAAM,sBAAsBA,GAAE,KAAK;AAAA,EACjC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,sBAAsBA,GACzB,OAAO;AAAA,EACN,GAAG;AAAA,EACH,MAAMA,GAAE,QAAQ,gBAAgB;AAAA,EAChC,MAAMA,GACH,OAAO;AAAA,IACN,gBAAgBA,GACb;AAAA,MACCA,GACG,OAAO;AAAA,QACN,QAAQ;AAAA,QACR,uBAAuB;AAAA,MACzB,CAAC,EACA,OAAO;AAAA,IACZ,EACC,IAAI,CAAC;AAAA,IACR,OAAOA,GACJ;AAAA,MACCA,GACG,OAAO;AAAA,QACN,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,aAAaA,GAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK;AAAA,MAChD,CAAC,EACA,OAAO;AAAA,IACZ,EACC,IAAI,CAAC;AAAA,IACR,YAAYA,GACT;AAAA,MACCA,GACG,OAAO;AAAA,QACN,aAAa;AAAA,QACb,MAAM;AAAA,MACR,CAAC,EACA,OAAO;AAAA,IACZ,EACC,IAAI,CAAC;AAAA,EACV,CAAC,EACA,OAAO;AACZ,CAAC,EACA,OAAO;AAEV,IAAM,4BAA4BA,GAC/B,OAAO;AAAA,EACN,GAAG;AAAA,EACH,MAAMA,GAAE,QAAQ,sBAAsB;AAAA,EACtC,QAAQ;AAAA,EACR,uBAAuB;AAAA,EACvB,aAAa;AAAA,EACb,SAASA,GACN,OAAO;AAAA,IACN,eAAe;AAAA,IACf,oBAAoBA,GAAE,MAAM,SAAS;AAAA,IACrC,YAAY;AAAA,IACZ,UAAU;AAAA,IACV,gBAAgB;AAAA,EAClB,CAAC,EACA,OAAO;AAAA,EACV,UAAUA,GACP;AAAA,IACCA,GACG,OAAO;AAAA,MACN,WAAW;AAAA,MACX,MAAMA,GAAE,KAAK;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,MACD,UAAU;AAAA,IACZ,CAAC,EACA,OAAO;AAAA,EACZ,EACC,IAAI,CAAC;AACV,CAAC,EACA,OAAO;AAEV,IAAM,4BAA4BA,GAC/B,OAAO;AAAA,EACN,GAAG;AAAA,EACH,MAAMA,GAAE,QAAQ,uBAAuB;AAAA,EACvC,QAAQ;AAAA,EACR,uBAAuB;AAAA,EACvB,QAAQ;AACV,CAAC,EACA,OAAO;AAEV,IAAM,oBAAoBA,GACvB,OAAO;AAAA,EACN,QAAQA,GAAE,QAAQ,OAAO;AAAA,EACzB,aAAa;AAAA,EACb,cAAc;AAAA,EACd,cAAc;AAChB,CAAC,EACA,OAAO;AAEV,IAAM,gBAAgBA,GACnB,OAAO;AAAA,EACN,QAAQA,GAAE,QAAQ,SAAS;AAAA,EAC3B,QAAQ;AACV,CAAC,EACA,OAAO;AAEV,IAAM,kBAAkBA,GACrB,OAAO;AAAA,EACN,QAAQA,GAAE,QAAQ,OAAO;AAAA,EACzB,KAAKA,GAAE,OAAO,EAAE,OAAO,EAAE,YAAY;AAAA,EACrC,QAAQA,GAAE,KAAK,CAAC,YAAY,iBAAiB,MAAM,CAAC;AACtD,CAAC,EACA,OAAO,EACP,YAAY,CAAC,MAAM,QAAQ;AAC1B,MAAI,KAAK,WAAW,UAAU,KAAK,QAAQ,GAAG;AAC5C,QAAI,SAAS,EAAE,MAAM,UAAU,SAAS,mCAAmC,CAAC;AAAA,EAC9E;AACF,CAAC;AAEH,IAAM,oBAAoBA,GACvB,OAAO;AAAA,EACN,QAAQA,GAAE,QAAQ,SAAS;AAAA,EAC3B,oBAAoBA,GAAE,OAAO,EAAE,OAAO,EAAE,YAAY;AAAA,EACpD,QAAQ;AACV,CAAC,EACA,OAAO;AAEV,IAAM,mBAAmBA,GACtB,OAAO;AAAA,EACN,QAAQA,GAAE,mBAAmB,UAAU,CAAC,mBAAmB,aAAa,CAAC;AAAA,EACzE,MAAMA,GAAE,mBAAmB,UAAU,CAAC,iBAAiB,iBAAiB,CAAC;AAC3E,CAAC,EACA,OAAO;AAEV,IAAM,gBAAgBA,GAAE,OAAO,WAAW,aAAa,EAAE,YAAY,CAAC,SAAS,QAAQ;AACrF,aAAW,OAAO,OAAO,KAAK,OAAO,GAAG;AACtC,QAAI,QAAQ,eAAe,QAAQ,iBAAiB,QAAQ,aAAa;AACvE,UAAI,SAAS,EAAE,MAAM,UAAU,SAAS,qBAAqB,GAAG,GAAG,CAAC;AAAA,IACtE;AAAA,EACF;AACF,CAAC;AAED,IAAM,gBAAgBA,GAAE,mBAAmB,UAAU;AAAA,EACnDA,GACG,OAAO;AAAA,IACN,QAAQA,GAAE,QAAQ,QAAQ;AAAA,IAC1B,OAAO;AAAA,IACP,SAAS;AAAA,EACX,CAAC,EACA,OAAO;AAAA,EACVA,GACG,OAAO;AAAA,IACN,QAAQA,GAAE,QAAQ,QAAQ;AAAA,IAC1B,OAAO;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,EACX,CAAC,EACA,OAAO;AAAA,EACVA,GACG,OAAO;AAAA,IACN,QAAQA,GAAE,QAAQ,SAAS;AAAA,IAC3B,SAAS;AAAA,IACT,OAAO,oBAAoB,OAAO,EAAE,WAAWA,GAAE,QAAQ,EAAE,CAAC,EAAE,OAAO;AAAA,EACvE,CAAC,EACA,OAAO;AACZ,CAAC;AAED,IAAM,eAAeA,GAAE,mBAAmB,UAAU;AAAA,EAClDA,GACG,OAAO;AAAA,IACN,QAAQA,GAAE,QAAQ,UAAU;AAAA,IAC5B,QAAQ;AAAA,IACR,eAAe;AAAA,IACf,gBAAgB;AAAA,IAChB,OAAO;AAAA,EACT,CAAC,EACA,OAAO,EACP,YAAY,CAAC,QAAQ,QAAQ;AAC5B,UAAM,WAAW,OAAO,iBAAiB,OAAO;AAChD,UAAM,YAAY,OAAO,UAAU,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,GAAG,KAAK,IAAI,OAAO,KAAK,CAAC,IAAI;AAC7F,QAAI,KAAK,IAAI,OAAO,QAAQ,QAAQ,IAAI,WAAW;AACjD,UAAI,SAAS,EAAE,MAAM,UAAU,SAAS,kDAAkD,CAAC;AAAA,IAC7F;AAAA,EACF,CAAC;AAAA,EACHA,GACG,OAAO;AAAA,IACN,QAAQA,GAAE,QAAQ,cAAc;AAAA,IAChC,QAAQ;AAAA,EACV,CAAC,EACA,OAAO;AACZ,CAAC;AAED,IAAM,wBAAwBA,GAC3B,OAAO;AAAA,EACN,WAAW;AAAA,EACX,OAAOA,GAAE,QAAQ;AAAA,EACjB,aAAa;AAAA,EACb,QAAQ;AAAA,EACR,UAAUA,GAAE,MAAM,iBAAiB,EAAE,IAAI,CAAC;AAC5C,CAAC,EACA,OAAO,EACP,YAAY,CAAC,UAAU,QAAQ;AAC9B,MAAI,SAAS,SAAS,SAAS,gBAAgB,GAAG;AAChD,QAAI,SAAS,EAAE,MAAM,UAAU,SAAS,6CAA6C,CAAC;AAAA,EACxF;AACA,MAAI,CAAC,SAAS,SAAS,SAAS,gBAAgB,GAAG;AACjD,QAAI,SAAS;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACA,MAAI,CAAC,SAAS,SAAS,SAAS,OAAO,WAAW,cAAc,SAAS,OAAO,UAAU,GAAG;AAC3F,QAAI,SAAS;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF,CAAC;AAEH,IAAM,sBAAsBA,GACzB,OAAO;AAAA,EACN,GAAG;AAAA,EACH,MAAMA,GAAE,QAAQ,gBAAgB;AAAA,EAChC,aAAa;AAAA,EACb,OAAO;AAAA,EACP,cAAc;AAAA,EACd,MAAMA,GAAE,OAAO,EAAE,QAAQ,WAAW,QAAQ,gBAAgB,CAAC,EAAE,OAAO;AAAA,EACtE,UAAUA,GACP,OAAO;AAAA,IACN,OAAOA,GACJ,OAAO;AAAA,MACN,UAAU;AAAA,MACV,UAAU,UAAU;AAAA,QAClB;AAAA,QACA;AAAA,MACF;AAAA,IACF,CAAC,EACA,OAAO;AAAA,IACV,OAAO;AAAA,IACP,WAAW;AAAA,EACb,CAAC,EACA,OAAO;AAAA,EACV,SAAS;AAAA,EACT,YAAY;AAAA,EACZ,iBAAiBA,GAAE,MAAM,qBAAqB,EAAE,IAAI,CAAC;AACvD,CAAC,EACA,OAAO;AAEV,IAAM,gCAAgCA,GACnC,OAAO;AAAA,EACN,GAAG;AAAA,EACH,MAAMA,GAAE,QAAQ,2BAA2B;AAAA,EAC3C,aAAa;AAAA,EACb,eAAe;AAAA,EACf,WAAWA,GAAE,mBAAmB,QAAQ;AAAA,IACtCA,GACG,OAAO;AAAA,MACN,MAAMA,GAAE,QAAQ,OAAO;AAAA,MACvB,OAAOA,GACJ,OAAO;AAAA,QACN,UAAU;AAAA,QACV,UAAU,UAAU;AAAA,UAClB;AAAA,UACA;AAAA,QACF;AAAA,MACF,CAAC,EACA,OAAO;AAAA,MACV,QAAQ;AAAA,IACV,CAAC,EACA,OAAO;AAAA,IACVA,GACG,OAAO;AAAA,MACN,MAAMA,GAAE,QAAQ,eAAe;AAAA,MAC/B,QAAQ;AAAA,IACV,CAAC,EACA,OAAO;AAAA,EACZ,CAAC;AAAA,EACD,SAASA,GAAE,mBAAmB,UAAU;AAAA,IACtCA,GAAE,OAAO,EAAE,QAAQA,GAAE,QAAQ,WAAW,EAAE,CAAC,EAAE,OAAO;AAAA,IACpDA,GACG,OAAO;AAAA,MACN,QAAQA,GAAE,QAAQ,SAAS;AAAA,MAC3B,SAAS;AAAA,IACX,CAAC,EACA,OAAO;AAAA,IACVA,GACG,OAAO;AAAA,MACN,QAAQA,GAAE,QAAQ,QAAQ;AAAA,MAC1B,SAAS;AAAA,IACX,CAAC,EACA,OAAO;AAAA,EACZ,CAAC;AAAA,EACD,YAAY;AACd,CAAC,EACA,OAAO;AAEV,IAAM,yBAAyBA,GAC5B,OAAO;AAAA,EACN,GAAG;AAAA,EACH,MAAMA,GAAE,QAAQ,mBAAmB;AAAA,EACnC,aAAa;AAAA,EACb,UAAUA,GAAE,mBAAmB,UAAU;AAAA,IACvCA,GAAE,OAAO,EAAE,QAAQA,GAAE,QAAQ,UAAU,EAAE,CAAC,EAAE,OAAO;AAAA,IACnDA,GACG,OAAO;AAAA,MACN,QAAQA,GAAE,QAAQ,UAAU;AAAA,MAC5B,QAAQ;AAAA,IACV,CAAC,EACA,OAAO;AAAA,EACZ,CAAC;AACH,CAAC,EACA,OAAO;AAEV,IAAM,wBAAwBA,GAC3B,OAAO;AAAA,EACN,GAAG;AAAA,EACH,MAAMA,GAAE,QAAQ,kBAAkB;AAAA,EAClC,QAAQA,GAAE,mBAAmB,UAAU;AAAA,IACrCA,GACG,OAAO;AAAA,MACN,QAAQA,GAAE,QAAQ,UAAU;AAAA,MAC5B,aAAa;AAAA,IACf,CAAC,EACA,OAAO;AAAA,IACVA,GACG,OAAO;AAAA,MACN,QAAQA,GAAE,QAAQ,cAAc;AAAA,MAChC,QAAQ;AAAA,IACV,CAAC,EACA,OAAO;AAAA,EACZ,CAAC;AACH,CAAC,EACA,OAAO;AAEV,IAAM,cAAcA,GAAE,mBAAmB,QAAQ;AAAA,EAC/C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,cAAcA,GACjB,OAAO;AAAA,EACN,QAAQA,GAAE,QAAQ,oBAAoB;AAAA,EACtC,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,cAAcA,GAAE,MAAM,CAAC,MAAMA,GAAE,KAAK,CAAC,CAAC;AAAA,EACtC,OAAO;AAAA,EACP,WAAW;AACb,CAAC,EACA,OAAO;AAIH,SAAS,0BAA0B,OAAmC;AAC3E,QAAM,SAAS,YAAY,UAAU,KAAK;AAC1C,MAAI,CAAC,OAAO,SAAS;AACnB,UAAM,IAAI,kBAAkB,gCAAgC,eAAe,OAAO,KAAK,CAAC,EAAE;AAAA,EAC5F;AACA,SAAO,eAAe,OAAO,IAAyB;AACxD;AAgBO,SAAS,iBAAiB,SAAgD;AAC/E,MAAI,QAAQ,KAAK,KAAK,EAAE,WAAW,EAAG,OAAM,IAAI,kBAAkB,sBAAsB;AACxF,SAAO,IAAI,iBAAiB,QAAQ,MAAM,QAAQ,UAAU;AAC9D;AAEA,IAAM,gBAAgB,oBAAI,IAAmB;AAE7C,SAAS,SAAS,MAAqB;AACrC,QAAM,WAAW,cAAc,IAAI,IAAI;AACvC,MAAI,SAAU,QAAO;AACrB,QAAM,QAAQ,IAAI,MAAM;AACxB,gBAAc,IAAI,MAAM,KAAK;AAC7B,SAAO;AACT;AAEO,IAAM,mBAAN,MAA+C;AAAA,EAC3C;AAAA,EACA;AAAA,EACQ;AAAA,EAEjB,YAAY,MAAc,YAAoB;AAC5C,QAAI,KAAK,KAAK,EAAE,WAAW,EAAG,OAAM,IAAI,kBAAkB,sBAAsB;AAChF,QAAI,WAAW,WAAW,EAAG,OAAM,IAAI,kBAAkB,qBAAqB;AAC9E,QAAI,WAAW,KAAK,MAAM,YAAY;AACpC,YAAM,IAAI,kBAAkB,oDAAoD;AAAA,IAClF;AACA,SAAK,OAAOC,SAAQ,IAAI;AACxB,SAAK,aAAa;AAClB,SAAK,QAAQ,SAAS,KAAK,IAAI;AAAA,EACjC;AAAA,EAEA,MAAM,SAAsC;AAC1C,WAAO,KAAK,MAAM;AAAA,MAAa,MAC7B,yBAAyB,KAAK,MAAM,MAAM,WAAW,KAAK,MAAM,KAAK,UAAU,CAAC;AAAA,IAClF;AAAA,EACF;AAAA,EAEA,MAAM,OAAO,OAA6D;AACxE,UAAM,QAAQ,0BAA0B,KAAK;AAC7C,WAAO,KAAK,MAAM;AAAA,MAAa,MAC7B,yBAAyB,KAAK,MAAM,MAAM;AACxC,cAAM,SAAS,WAAW,KAAK,MAAM,KAAK,UAAU;AACpD,cAAM,WAAW,OAAO,QAAQ,KAAK,CAACC,WAAUA,OAAM,MAAM,YAAY,MAAM,OAAO;AACrF,YAAI,UAAU;AACZ,cAAI,gBAAgB,SAAS,KAAK,MAAM,gBAAgB,KAAK,GAAG;AAC9D,kBAAM,IAAI;AAAA,cACR,WAAW,MAAM,OAAO;AAAA,YAC1B;AAAA,UACF;AACA,iBAAO,EAAE,OAAO,UAAU,UAAU,OAAO,QAAQ,OAAO;AAAA,QAC5D;AAEA,cAAM,eAAe,OAAO,MAAM;AAClC,cAAM,WAAW;AAAA,UACf,QAAQ;AAAA,UACR,YAAY,KAAK;AAAA,UACjB,UAAU,OAAO,QAAQ;AAAA,UACzB;AAAA,UACA;AAAA,QACF;AACA,cAAM,QAA2B;AAAA,UAC/B,GAAG;AAAA,UACH,WAAW,cAAc,QAAQ;AAAA,QACnC;AAKA,cAAM,SAAS,cAAc,CAAC,GAAG,OAAO,SAAS,KAAK,GAAG,KAAK,UAAU;AACxE,+BAAuB,KAAK,MAAM,GAAG,gBAAgB,KAAK,CAAC;AAAA,CAAI;AAC/D,eAAO,EAAE,OAAO,UAAU,MAAM,OAAO;AAAA,MACzC,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,WAAW,MAAc,YAAwC;AACxE,MAAI,CAACC,YAAW,IAAI,EAAG,QAAO,cAAc,CAAC,GAAG,UAAU;AAC1D,QAAM,OAAOC,cAAa,MAAM,MAAM;AACtC,MAAI,KAAK,WAAW,EAAG,QAAO,cAAc,CAAC,GAAG,UAAU;AAC1D,MAAI,CAAC,KAAK,SAAS,IAAI,GAAG;AACxB,UAAM,IAAI;AAAA,MACR,iBAAiB,IAAI;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,QAAQ,KAAK,MAAM,GAAG,EAAE,EAAE,MAAM,IAAI;AAC1C,QAAM,UAA+B,CAAC;AACtC,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,UAAM,OAAO,MAAM,KAAK;AACxB,QAAI,KAAK,WAAW,GAAG;AACrB,YAAM,IAAI;AAAA,QACR,iBAAiB,IAAI,4BAA4B,QAAQ,CAAC;AAAA,MAC5D;AAAA,IACF;AACA,QAAI;AACJ,QAAI;AACF,YAAM,KAAK,MAAM,IAAI;AAAA,IACvB,SAAS,OAAO;AACd,YAAM,IAAI;AAAA,QACR,iBAAiB,IAAI,6BAA6B,QAAQ,CAAC;AAAA,QAC3D,EAAE,OAAO,MAAM;AAAA,MACjB;AAAA,IACF;AACA,UAAM,SAAS,YAAY,UAAU,GAAG;AACxC,QAAI,CAAC,OAAO,SAAS;AACnB,YAAM,IAAI;AAAA,QACR,iBAAiB,IAAI,kCAAkC,QAAQ,CAAC,KAAK,eAAe,OAAO,KAAK,CAAC;AAAA,MACnG;AAAA,IACF;AACA,UAAM,QAAQ,OAAO;AACrB,UAAM,kBAAkB,0BAA0B,MAAM,KAAK;AAC7D,QAAI,gBAAgB,eAAe,MAAM,gBAAgB,MAAM,KAAK,GAAG;AACrE,YAAM,IAAI;AAAA,QACR,iBAAiB,IAAI,6CAA6C,QAAQ,CAAC;AAAA,MAC7E;AAAA,IACF;AACA,QAAI,SAAS,gBAAgB,KAAK,GAAG;AACnC,YAAM,IAAI;AAAA,QACR,iBAAiB,IAAI,oCAAoC,QAAQ,CAAC;AAAA,MACpE;AAAA,IACF;AACA,YAAQ,KAAK,KAAK;AAAA,EACpB;AACA,SAAO,cAAc,SAAS,UAAU;AAC1C;AAQA,SAAS,cAAc,SAA8B,YAAwC;AAC3F,QAAM,aAAa,oBAAI,IAA4B;AACnD,QAAM,kBAAkB,oBAAI,IAAoB;AAChD,QAAM,cAAc,oBAAI,IAA4C;AACpE,QAAM,eAAe,oBAAI,IAAoB;AAC7C,QAAM,WAAW,oBAAI,IAAY;AACjC,QAAM,SAAS,oBAAI,IAAY;AAC/B,QAAM,cAAc,oBAAI,IAAY;AACpC,QAAM,kBAAoD,CAAC;AAC3D,QAAM,mBAAqD,CAAC;AAC5D,QAAM,WAAuC,CAAC;AAC9C,QAAM,kBAAkD,CAAC;AACzD,QAAM,iBAAiB,oBAAI,IAA0C;AACrE,QAAM,YAA2C,CAAC;AAClD,MAAI,YAAuC;AAC3C,MAAI,aAA0C;AAC9C,MAAI,mBAA4C;AAChD,MAAI,qBAAqB,OAAO;AAEhC,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAI,MAAM,eAAe,YAAY;AACnC,YAAM,IAAI;AAAA,QACR,SAAS,KAAK,wBAAwB,MAAM,UAAU,cAAc,UAAU;AAAA,MAChF;AAAA,IACF;AACA,QAAI,MAAM,aAAa,OAAO;AAC5B,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,MAAM,OAAO,iBAAiB,MAAM,QAAQ,cAAc,KAAK;AAAA,MAChF;AAAA,IACF;AACA,QAAI,MAAM,iBAAiB,kBAAkB;AAC3C,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,MAAM,OAAO;AAAA,MAC9B;AAAA,IACF;AACA,UAAM,EAAE,WAAW,YAAY,GAAG,SAAS,IAAI;AAC/C,UAAM,eAAe,cAAc,QAAQ;AAC3C,QAAI,MAAM,cAAc,cAAc;AACpC,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,MAAM,OAAO,4BAA4B,YAAY,SAAS,MAAM,SAAS;AAAA,MAC9F;AAAA,IACF;AACA,uBAAmB,MAAM;AAEzB,UAAM,QAAQ,MAAM;AACpB,QAAI,SAAS,IAAI,MAAM,OAAO,GAAG;AAC/B,YAAM,IAAI,2BAA2B,qBAAqB,MAAM,OAAO,oBAAoB;AAAA,IAC7F;AACA,aAAS,IAAI,MAAM,OAAO;AAC1B,QAAI,YAAY;AACd,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,OAAO,iCAAiC,WAAW,OAAO;AAAA,MAC3E;AAAA,IACF;AACA,UAAM,aAAa,KAAK,MAAM,MAAM,UAAU;AAC9C,QAAI,aAAa,oBAAoB;AACnC,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,OAAO;AAAA,MACxB;AAAA,IACF;AACA,yBAAqB;AACrB,IAAAC,cAAa,MAAM,UAAU,IAAI,WAAW,GAAG,oBAAoB,MAAM,OAAO;AAEhF,QAAI,MAAM,SAAS,kBAAkB;AACnC,UAAI,UAAU,KAAK,WAAW;AAC5B,cAAM,IAAI,2BAA2B,mDAAmD;AAAA,MAC1F;AACA,MAAAA;AAAA,QACE,MAAM,KAAK,eAAe,IAAI,CAAC,SAAS,KAAK,MAAM;AAAA,QACnD;AAAA,QACA,MAAM;AAAA,MACR;AACA,MAAAA;AAAA,QACE,MAAM,KAAK,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM;AAAA,QAC1C;AAAA,QACA,MAAM;AAAA,MACR;AACA,MAAAA;AAAA,QACE,MAAM,KAAK,WAAW,IAAI,CAAC,cAAc,UAAU,WAAW;AAAA,QAC9D;AAAA,QACA,MAAM;AAAA,MACR;AACA,iBAAW,QAAQ,MAAM,KAAK,gBAAgB;AAC5C,cAAM,sBAAsB,MAAM,KAAK,WAAW;AAAA,UAChD,CAAC,cAAc,UAAU,gBAAgB,KAAK;AAAA,QAChD;AACA,YAAI,CAAC,uBAAuB,oBAAoB,SAAS,wBAAwB;AAC/E,gBAAM,IAAI;AAAA,YACR,kBAAkB,KAAK,MAAM,wDAAwD,KAAK,qBAAqB;AAAA,UACjH;AAAA,QACF;AAAA,MACF;AACA,kBAAY;AACZ;AAAA,IACF;AAEA,QAAI,CAAC,WAAW;AACd,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,OAAO;AAAA,MACxB;AAAA,IACF;AAEA,QAAI,MAAM,SAAS,wBAAwB;AACzC,UAAI,WAAW,IAAI,MAAM,WAAW,GAAG;AACrC,cAAM,IAAI,2BAA2B,aAAa,MAAM,WAAW,uBAAuB;AAAA,MAC5F;AACA,YAAM,cAAc,UAAU,KAAK,eAAe,KAAK,CAAC,SAAS,KAAK,WAAW,MAAM,MAAM;AAC7F,UAAI,CAAC,aAAa;AAChB,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,uBAAuB,MAAM,MAAM;AAAA,QACnE;AAAA,MACF;AACA,UAAI,gBAAgB,IAAI,MAAM,MAAM,GAAG;AACrC,cAAM,IAAI,2BAA2B,kBAAkB,MAAM,MAAM,kBAAkB;AAAA,MACvF;AACA,UAAI,YAAY,IAAI,MAAM,MAAM,GAAG;AACjC,cAAM,IAAI,2BAA2B,kBAAkB,MAAM,MAAM,qBAAqB;AAAA,MAC1F;AACA,UAAI,MAAM,0BAA0B,YAAY,uBAAuB;AACrE,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,yBAAyB,MAAM,qBAAqB,wBAAwB,MAAM,MAAM,SAAS,YAAY,qBAAqB;AAAA,QAClK;AAAA,MACF;AACA,YAAM,sBAAsB,eAAe,IAAI,MAAM,qBAAqB;AAC1E,UAAI,CAAC,qBAAqB;AACxB,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,kCAAkC,MAAM,qBAAqB;AAAA,QAC7F;AAAA,MACF;AACA,UAAI,oBAAoB,QAAQ,WAAW,UAAU;AACnD,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,4CAA4C,MAAM,qBAAqB;AAAA,QACvG;AAAA,MACF;AACA,YAAM,oBAAoB,aAAa,IAAI,MAAM,QAAQ,aAAa;AACtE,UAAI,mBAAmB;AACrB,cAAM,IAAI;AAAA,UACR,gBAAgB,MAAM,QAAQ,aAAa,wBAAwB,iBAAiB;AAAA,QACtF;AAAA,MACF;AACA,MAAAA,cAAa,MAAM,QAAQ,oBAAoB,qBAAqB,MAAM,OAAO;AACjF,YAAM,UAAU,MAAM,QAAQ,mBAAmB,IAAI,CAAC,OAAO;AAC3D,cAAM,SAAS,WAAW,IAAI,EAAE;AAChC,YAAI,CAAC,QAAQ;AACX,gBAAM,IAAI;AAAA,YACR,aAAa,MAAM,WAAW,8BAA8B,EAAE;AAAA,UAChE;AAAA,QACF;AACA,eAAO;AAAA,MACT,CAAC;AACD,YAAM,qBACJ,QAAQ,WAAW,IACf,IACA,KAAK,IAAI,GAAG,QAAQ,IAAI,CAAC,WAAW,OAAO,WAAW,QAAQ,UAAU,CAAC,IAAI;AACnF,UAAI,MAAM,QAAQ,eAAe,oBAAoB;AACnD,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,eAAe,MAAM,QAAQ,UAAU,0CAA0C,kBAAkB;AAAA,QACnI;AAAA,MACF;AACA,MAAAA;AAAA,QACE,MAAM,SAAS,IAAI,CAAC,YAAY,QAAQ,SAAS;AAAA,QACjD;AAAA,QACA,MAAM;AAAA,MACR;AACA,iBAAW,IAAI,MAAM,aAAa,EAAE,YAAY,OAAO,UAAU,CAAC,GAAG,UAAU,KAAK,CAAC;AACrF,sBAAgB,IAAI,MAAM,QAAQ,MAAM,WAAW;AACnD,mBAAa,IAAI,MAAM,QAAQ,eAAe,MAAM,WAAW;AAC/D,sBAAgB,KAAK,KAAK;AAC1B;AAAA,IACF;AAEA,QAAI,MAAM,SAAS,kBAAkB;AACnC,YAAM,YAAY,WAAW,IAAI,MAAM,WAAW;AAClD,UAAI,CAAC,WAAW;AACd,cAAM,IAAI;AAAA,UACR,WAAW,MAAM,OAAO,iCAAiC,MAAM,WAAW;AAAA,QAC5E;AAAA,MACF;AACA,UAAI,UAAU,UAAU;AACtB,cAAM,IAAI;AAAA,UACR,WAAW,MAAM,OAAO,4BAA4B,MAAM,WAAW;AAAA,QACvE;AAAA,MACF;AACA,YAAM,cAAc,UAAU,KAAK,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,MAAM,KAAK,MAAM;AACzF,UAAI,CAAC,aAAa;AAChB,cAAM,IAAI;AAAA,UACR,WAAW,MAAM,OAAO,8BAA8B,MAAM,KAAK,MAAM;AAAA,QACzE;AAAA,MACF;AACA,UACE,gBAAgB,YAAY,MAAM,MAAM,gBAAgB,MAAM,KAAK,MAAM,KACzE,gBAAgB,YAAY,SAAS,MAAM,gBAAgB,MAAM,SAAS,SAAS,GACnF;AACA,cAAM,IAAI;AAAA,UACR,QAAQ,MAAM,KAAK,MAAM;AAAA,QAC3B;AAAA,MACF;AACA,UAAI,MAAM,gBAAgB,YAAY,aAAa;AACjD,cAAM,IAAI;AAAA,UACR,QAAQ,MAAM,KAAK,MAAM,YAAY,MAAM,YAAY,gCAAgC,YAAY,WAAW;AAAA,QAChH;AAAA,MACF;AACA,UAAI,OAAO,IAAI,MAAM,KAAK,GAAG;AAC3B,cAAM,IAAI,2BAA2B,SAAS,MAAM,KAAK,qBAAqB;AAAA,MAChF;AACA,aAAO,IAAI,MAAM,KAAK;AACtB,YAAM,aAAa,gBAAgB,CAAC,MAAM,aAAa,MAAM,KAAK,QAAQ,MAAM,YAAY,CAAC;AAC7F,UAAI,YAAY,IAAI,UAAU,GAAG;AAC/B,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,SAAS,MAAM,KAAK,MAAM,YAAY,MAAM,YAAY;AAAA,QACxF;AAAA,MACF;AACA,YAAM,uBAAuB,UAAU,SAAS;AAAA,QAC9C,CAAC,YAAY,QAAQ,KAAK,WAAW,MAAM,KAAK;AAAA,MAClD,EAAE;AACF,UAAI,MAAM,iBAAiB,sBAAsB;AAC/C,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,SAAS,MAAM,KAAK,MAAM,kBAAkB,MAAM,YAAY,gCAAgC,oBAAoB;AAAA,QAClJ;AAAA,MACF;AACA,YAAM,kBAAkB,UAAU,SAAS;AAAA,QACzC,CAAC,YAAY,QAAQ,KAAK,WAAW,MAAM,KAAK;AAAA,MAClD;AACA,UACE,iBAAiB,QAAQ,WAAW,UACpC,gBAAgB,QAAQ,WAAW,WACnC;AACA,cAAM,IAAI;AAAA,UACR,QAAQ,MAAM,KAAK,MAAM;AAAA,QAC3B;AAAA,MACF;AACA,UACE,mBACA,gBAAgB,EAAE,MAAM,gBAAgB,MAAM,UAAU,gBAAgB,SAAS,CAAC,MAChF,gBAAgB,EAAE,MAAM,MAAM,MAAM,UAAU,MAAM,SAAS,CAAC,GAChE;AACA,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,SAAS,MAAM,KAAK,MAAM;AAAA,QAC1D;AAAA,MACF;AACA,kBAAY,IAAI,UAAU;AAE1B,YAAM,WAAW,UAAU,WAAW,SAAS,IAAI,CAAC,YAAY,QAAQ,SAAS,EAAE,KAAK;AACxF,YAAM,WAAW,MAAM,gBAAgB,IAAI,CAAC,YAAY,QAAQ,SAAS,EAAE,KAAK;AAChF,MAAAA,cAAa,UAAU,oBAAoB,MAAM,OAAO;AACxD,iBAAW,YAAY,MAAM,iBAAiB;AAC5C,QAAAA,cAAa,SAAS,SAAS,IAAI,WAAW,GAAG,4BAA4B,MAAM,OAAO;AAAA,MAC5F;AACA,UAAI,gBAAgB,QAAQ,MAAM,gBAAgB,QAAQ,GAAG;AAC3D,cAAM,IAAI;AAAA,UACR,WAAW,MAAM,OAAO,sDAAsD,MAAM,WAAW;AAAA,QACjG;AAAA,MACF;AACA,gBAAU,SAAS,KAAK,KAAK;AAC7B,eAAS,KAAK,KAAK;AACnB;AAAA,IACF;AAEA,QAAI,MAAM,SAAS,6BAA6B;AAC9C,YAAM,mBAAmB,UAAU,KAAK,WAAW;AAAA,QACjD,CAAC,cAAc,UAAU,gBAAgB,MAAM;AAAA,MACjD;AACA,UAAI,CAAC,kBAAkB;AACrB,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW;AAAA,QAChC;AAAA,MACF;AACA,UAAI,iBAAiB,SAAS,MAAM,eAAe;AACjD,cAAM,IAAI;AAAA,UACR,aAAa,MAAM,WAAW,SAAS,MAAM,aAAa,2BAA2B,iBAAiB,IAAI;AAAA,QAC5G;AAAA,MACF;AACA,UAAI,eAAe,IAAI,MAAM,WAAW,GAAG;AACzC,cAAM,IAAI,2BAA2B,aAAa,MAAM,WAAW,qBAAqB;AAAA,MAC1F;AACA,qBAAe,IAAI,MAAM,aAAa,KAAK;AAC3C,sBAAgB,KAAK,KAAK;AAC1B;AAAA,IACF;AAEA,QAAI,MAAM,SAAS,yBAAyB;AAC1C,YAAM,cAAc,UAAU,KAAK,eAAe,KAAK,CAAC,SAAS,KAAK,WAAW,MAAM,MAAM;AAC7F,UAAI,CAAC,aAAa;AAChB,cAAM,IAAI;AAAA,UACR,0BAA0B,MAAM,OAAO,4BAA4B,MAAM,MAAM;AAAA,QACjF;AAAA,MACF;AACA,UAAI,MAAM,0BAA0B,YAAY,uBAAuB;AACrE,cAAM,IAAI;AAAA,UACR,0BAA0B,MAAM,OAAO,yBAAyB,MAAM,qBAAqB,wBAAwB,MAAM,MAAM,SAAS,YAAY,qBAAqB;AAAA,QAC3K;AAAA,MACF;AACA,UAAI,gBAAgB,IAAI,MAAM,MAAM,GAAG;AACrC,cAAM,IAAI;AAAA,UACR,kBAAkB,MAAM,MAAM;AAAA,QAChC;AAAA,MACF;AACA,UAAI,YAAY,IAAI,MAAM,MAAM,GAAG;AACjC,cAAM,IAAI,2BAA2B,kBAAkB,MAAM,MAAM,mBAAmB;AAAA,MACxF;AACA,YAAM,YAAY,eAAe,IAAI,MAAM,qBAAqB;AAChE,UAAI,CAAC,WAAW;AACd,cAAM,IAAI;AAAA,UACR,0BAA0B,MAAM,OAAO,uBAAuB,MAAM,qBAAqB;AAAA,QAC3F;AAAA,MACF;AACA,UAAI,UAAU,QAAQ,WAAW,aAAa;AAC5C,cAAM,IAAI;AAAA,UACR,kBAAkB,MAAM,MAAM,0CAA0C,MAAM,qBAAqB;AAAA,QACrG;AAAA,MACF;AACA,kBAAY,IAAI,MAAM,QAAQ,KAAK;AACnC,uBAAiB,KAAK,KAAK;AAC3B;AAAA,IACF;AAEA,QAAI,MAAM,SAAS,qBAAqB;AACtC,YAAM,YAAY,WAAW,IAAI,MAAM,WAAW;AAClD,UAAI,CAAC,WAAW;AACd,cAAM,IAAI;AAAA,UACR,YAAY,MAAM,OAAO,iCAAiC,MAAM,WAAW;AAAA,QAC7E;AAAA,MACF;AACA,UAAI,UAAU,UAAU;AACtB,cAAM,IAAI,2BAA2B,aAAa,MAAM,WAAW,oBAAoB;AAAA,MACzF;AACA,UAAI,MAAM,SAAS,WAAW,YAAY;AACxC,YAAI,CAAC,UAAU,SAAS,KAAK,CAAC,YAAY,QAAQ,QAAQ,WAAW,SAAS,GAAG;AAC/E,gBAAM,IAAI;AAAA,YACR,aAAa,MAAM,WAAW;AAAA,UAChC;AAAA,QACF;AACA,YAAI,UAAU,KAAK,CAAC,aAAa,SAAS,SAAS,WAAW,UAAU,GAAG;AACzE,gBAAM,IAAI,2BAA2B,sCAAsC;AAAA,QAC7E;AAAA,MACF;AACA,gBAAU,WAAW;AACrB,gBAAU,KAAK,KAAK;AACpB;AAAA,IACF;AAEA,UAAMC,yBAAwB,UAAU,KAAK,eAC1C,OAAO,CAAC,SAAS,CAAC,gBAAgB,IAAI,KAAK,MAAM,KAAK,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC,EACnF,IAAI,CAAC,SAAS,KAAK,MAAM;AAC5B,QAAIA,uBAAsB,SAAS,GAAG;AACpC,YAAM,IAAI;AAAA,QACR,kDAAkDA,uBAAsB,KAAK,IAAI,CAAC;AAAA,MACpF;AAAA,IACF;AACA,UAAMC,uBAAsB,uBAAuB,WAAW,UAAU;AACxE,QAAIA,qBAAoB,SAAS,GAAG;AAClC,YAAM,IAAI;AAAA,QACR,gDAAgDA,qBAAoB,KAAK,IAAI,CAAC;AAAA,MAChF;AAAA,IACF;AACA,UAAMC,qBAAoB,UAAU,KAAK,WACtC,OAAO,CAAC,cAAc,CAAC,eAAe,IAAI,UAAU,WAAW,CAAC,EAChE,IAAI,CAAC,cAAc,UAAU,WAAW;AAC3C,QAAIA,mBAAkB,SAAS,GAAG;AAChC,YAAM,IAAI;AAAA,QACR,oDAAoDA,mBAAkB,KAAK,IAAI,CAAC;AAAA,MAClF;AAAA,IACF;AACA,eAAW,aAAa,UAAU,KAAK,YAAY;AACjD,UAAI,UAAU,SAAS,uBAAwB;AAC/C,YAAM,oBAAoB,eAAe,IAAI,UAAU,WAAW,EAAG,QAAQ;AAC7E,YAAM,QAAQ,UAAU,KAAK,eAAe;AAAA,QAC1C,CAAC,SAAS,KAAK,0BAA0B,UAAU;AAAA,MACrD;AACA,UAAI,MAAM,WAAW,EAAG;AACxB,YAAM,kBAAkB,MAAM,OAAO,CAAC,SAAS,gBAAgB,IAAI,KAAK,MAAM,CAAC,EAAE;AACjF,YAAM,cAAc,MAAM,OAAO,CAAC,SAAS,YAAY,IAAI,KAAK,MAAM,CAAC,EAAE;AACzE,UAAI,sBAAsB,eAAe,cAAc,GAAG;AACxD,cAAM,IAAI;AAAA,UACR,kCAAkC,UAAU,WAAW,aAAa,WAAW;AAAA,QACjF;AAAA,MACF;AACA,UAAI,sBAAsB,YAAY,kBAAkB,GAAG;AACzD,cAAM,IAAI;AAAA,UACR,+BAA+B,UAAU,WAAW,aAAa,eAAe;AAAA,QAClF;AAAA,MACF;AACA,UAAI,sBAAsB,cAAc,oBAAoB,KAAK,gBAAgB,IAAI;AACnF,cAAM,IAAI;AAAA,UACR,gCAAgC,UAAU,WAAW;AAAA,QACvD;AAAA,MACF;AAAA,IACF;AACA,UAAM,UAAU,CAAC,GAAG,WAAW,OAAO,CAAC,EAAE,OAAO,CAAC,cAAc,UAAU,aAAa,IAAI;AAC1F,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,yBAAyB,QAAQ,MAAM;AAAA,MACzC;AAAA,IACF;AACA,UAAM,WAAW,UAAU,OAAO,CAAC,aAAa,SAAS,SAAS,WAAW,UAAU;AACvF,QAAI,MAAM,OAAO,WAAW,YAAY;AACtC,UAAI,SAAS,WAAW,KAAK,SAAS,CAAC,EAAG,gBAAgB,MAAM,OAAO,aAAa;AAClF,cAAM,IAAI;AAAA,UACR,4BAA4B,MAAM,OAAO,WAAW;AAAA,QACtD;AAAA,MACF;AAAA,IACF,WAAW,SAAS,WAAW,GAAG;AAChC,YAAM,IAAI,2BAA2B,uDAAuD;AAAA,IAC9F;AACA,iBAAa;AAAA,EACf;AAEA,QAAM,oBAAoB,UAAU,OAAO,CAAC,aAAa,SAAS,SAAS,WAAW,UAAU;AAChG,QAAM,oBAAoB,UAAU,OAAO,CAAC,aAAa,SAAS,SAAS,WAAW,UAAU;AAChG,QAAM,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,EAAE;AACzD,QAAM,yBAAyB,EAAE,WAAW,GAAG,SAAS,GAAG,QAAQ,EAAE;AACrE,MAAI,cAAc;AAClB,MAAI,eAAe;AACnB,MAAI,eAAe;AACnB,MAAI,UAAU;AACd,QAAM,uBAAiC,CAAC;AACxC,QAAM,sBAAgC,CAAC;AACvC,aAAW,WAAW,UAAU;AAC9B,kBAAc,QAAQ,QAAQ,MAAM,KAAK;AAAA,EAC3C;AACA,aAAW,aAAa,iBAAiB;AACvC,2BAAuB,UAAU,QAAQ,MAAM,KAAK;AAAA,EACtD;AACA,aAAW,eAAe,CAAC,GAAG,UAAU,GAAG,eAAe,GAAG;AAC3D,QAAI,YAAY,WAAW,OAAO,WAAW,SAAS;AACpD,qBAAe,YAAY,WAAW,OAAO;AAC7C,sBAAgB,YAAY,WAAW,OAAO;AAC9C,sBAAgB,YAAY,WAAW,OAAO;AAAA,IAChD,OAAO;AACL,2BAAqB,KAAK,YAAY,OAAO;AAAA,IAC/C;AACA,QAAI,YAAY,WAAW,KAAK,WAAW,SAAS;AAClD,iBAAW,YAAY,WAAW,KAAK;AAAA,IACzC,OAAO;AACL,iBAAW,YAAY,WAAW,KAAK;AACvC,0BAAoB,KAAK,YAAY,OAAO;AAAA,IAC9C;AAAA,EACF;AACA,QAAM,aACJ,qBAAqB,WAAW,KAAK,oBAAoB,WAAW,IAChE;AAAA,IACE,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,IACA;AAAA,IACE,QAAQ;AAAA,IACR,kBAAkB;AAAA,IAClB,mBAAmB;AAAA,IACnB,mBAAmB;AAAA,IACnB,cAAc;AAAA,IACd;AAAA,IACA;AAAA,EACF;AAEN,QAAM,sBACJ,YAAY,OAAO,WAAW,aAAa,WAAW,OAAO,cAAc;AAC7E,QAAM,SACJ,YAAY,OAAO,WAAW,aAC1B,aACA,YAAY,OAAO,WAAW,iBAC5B,iBACA;AACR,QAAM,wBACJ,WAAW,KAAK,eACb,OAAO,CAAC,SAAS,CAAC,gBAAgB,IAAI,KAAK,MAAM,KAAK,CAAC,YAAY,IAAI,KAAK,MAAM,CAAC,EACnF,IAAI,CAAC,SAAS,KAAK,MAAM,KAAK,CAAC;AACpC,QAAM,sBAAsB,YAAY,uBAAuB,WAAW,UAAU,IAAI,CAAC;AACzF,QAAM,oBACJ,WAAW,KAAK,WACb,OAAO,CAAC,cAAc,CAAC,eAAe,IAAI,UAAU,WAAW,CAAC,EAChE,IAAI,CAAC,cAAc,UAAU,WAAW,KAAK,CAAC;AACnD,SAAO;AAAA,IACL,SAAS,CAAC,GAAG,OAAO;AAAA,IACpB,MAAM;AAAA,IACN,YAAY;AAAA,IACZ,sBAAsB;AAAA,IACtB;AAAA,IACA,YAAY;AAAA,IACZ;AAAA,IACA;AAAA,IACA,OAAO;AAAA,MACL;AAAA,MACA,YAAY,QAAQ;AAAA,MACpB,gBAAgB,WAAW;AAAA,MAC3B,0BAA0B,YAAY;AAAA,MACtC,cAAc,SAAS;AAAA,MACvB,gBAAgB,gBAAgB;AAAA,MAChC,UAAU;AAAA,MACV,mBAAmB;AAAA,MACnB,WAAW;AAAA,QACT,UAAU,kBAAkB;AAAA,QAC5B,UAAU,kBAAkB;AAAA,QAC5B,SAAS,WAAW,OAAO,UAAU;AAAA,MACvC;AAAA,MACA,UAAU;AAAA,QACR,gBAAgB,WAAW,KAAK,eAAe,UAAU;AAAA,QACzD,cAAc,WAAW,QAAQ,WAAW,KAAK,MAAM,UAAU;AAAA,QACjE,YAAY,WAAW,KAAK,WAAW,UAAU;AAAA,QACjD;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,UAAU,QAAQ,GAAG,EAAE,GAAG,aAAa;AAAA,IACzC;AAAA,EACF;AACF;AAEA,SAAS,uBACP,WACA,YACU;AACV,QAAM,UAAoB,CAAC;AAC3B,QAAM,uBAAuB,CAAC,GAAG,WAAW,OAAO,CAAC,EAAE;AAAA,IAAK,CAAC,GAAG,MAC7D,eAAe,EAAE,WAAW,QAAQ,EAAE,WAAW,MAAM;AAAA,EACzD;AACA,aAAW,aAAa,sBAAsB;AAC5C,UAAM,SAAS,UAAU,WAAW;AACpC,eAAW,QAAQ,UAAU,KAAK,OAAO;AACvC,YAAM,WAAW,UAAU,SAAS;AAAA,QAClC,CAAC,YAAY,QAAQ,KAAK,WAAW,KAAK,UAAU,QAAQ,QAAQ,WAAW;AAAA,MACjF;AACA,UAAI,CAAC,SAAU,SAAQ,KAAK,GAAG,MAAM,IAAI,KAAK,MAAM,EAAE;AAAA,IACxD;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eAAe,OAA6C;AACnE,QAAM,YAAY,cAAc,MAAM,SAAS;AAC/C,MAAI,MAAM,SAAS,kBAAkB;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA,MAAM;AAAA,QACJ,gBAAgB,CAAC,GAAG,MAAM,KAAK,cAAc,EAAE;AAAA,UAAK,CAAC,GAAG,MACtD,eAAe,EAAE,QAAQ,EAAE,MAAM;AAAA,QACnC;AAAA,QACA,OAAO,CAAC,GAAG,MAAM,KAAK,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,eAAe,EAAE,QAAQ,EAAE,MAAM,CAAC;AAAA,QAC9E,YAAY,CAAC,GAAG,MAAM,KAAK,UAAU,EAAE;AAAA,UAAK,CAAC,GAAG,MAC9C,eAAe,EAAE,aAAa,EAAE,WAAW;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,SAAS,wBAAwB;AACzC,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA,SAAS;AAAA,QACP,GAAG,MAAM;AAAA,QACT,oBAAoB,cAAc,MAAM,QAAQ,kBAAkB;AAAA,MACpE;AAAA,MACA,UAAU,CAAC,GAAG,MAAM,QAAQ,EACzB,IAAI,CAAC,aAAa,EAAE,GAAG,SAAS,UAAU,EAAE,GAAG,QAAQ,SAAS,EAAE,EAAE,EACpE,KAAK,CAAC,GAAG,MAAM,eAAe,EAAE,WAAW,EAAE,SAAS,CAAC;AAAA,IAC5D;AAAA,EACF;AACA,MAAI,MAAM,SAAS,kBAAkB;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA,iBAAiB,CAAC,GAAG,MAAM,eAAe,EACvC,IAAI,CAAC,cAAc,EAAE,GAAG,UAAU,UAAU,cAAc,SAAS,QAAQ,EAAE,EAAE,EAC/E,KAAK,CAAC,GAAG,MAAM,eAAe,EAAE,WAAW,EAAE,SAAS,CAAC;AAAA,IAC5D;AAAA,EACF;AACA,SAAO,EAAE,GAAG,OAAO,UAAU;AAC/B;AAEA,SAAS,cAAc,WAAqD;AAC1E,SAAO,CAAC,GAAG,SAAS,EACjB,IAAI,CAAC,cAAc,EAAE,GAAG,SAAS,EAAE,EACnC,KAAK,CAAC,GAAG,MAAM,eAAe,YAAY,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;AAClE;AAEA,SAAS,YAAY,UAAqC;AACxD,SAAO,gBAAgB,QAAQ;AACjC;AAEA,SAAS,eAAe,GAAW,GAAmB;AACpD,SAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;AAEA,SAAS,cAAc,QAA4B;AACjD,SAAO,CAAC,GAAG,MAAM,EAAE,KAAK;AAC1B;AAEA,SAASH,cAAa,QAAkB,OAAe,SAAuB;AAC5E,MAAI,IAAI,IAAI,MAAM,EAAE,SAAS,OAAO,QAAQ;AAC1C,UAAM,IAAI,2BAA2B,SAAS,OAAO,uBAAuB,KAAK,SAAS;AAAA,EAC5F;AACF;AAEA,SAAS,gBAAgB,OAAwB;AAC/C,SAAO,KAAK,UAAU,aAAa,KAAK,CAAC;AAC3C;AAEA,SAAS,cAAc,OAAkC;AACvD,SAAO,UAAUI,YAAW,QAAQ,EAAE,OAAO,gBAAgB,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC;AACpF;AAEA,SAAS,eAAe,OAA2B;AACjD,SAAO,MAAM,OACV,IAAI,CAAC,UAAU,GAAG,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,KAAK,GAAG,IAAI,QAAQ,KAAK,MAAM,OAAO,EAAE,EAC7F,KAAK,IAAI;AACd;;;ACz/CA,SAAS,cAAAC,aAAY,gBAAAC,eAAc,YAAY,iBAAAC,sBAAqB;AAkBpE,SAAS,WAAW,MAA6B;AAC/C,MAAI,CAACF,YAAW,IAAI,EAAG,QAAO;AAC9B,QAAM,SAAS,OAAOC,cAAa,MAAM,MAAM,EAAE,KAAK,CAAC;AACvD,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,EAAG,QAAO;AACpD,MAAI;AACF,YAAQ,KAAK,QAAQ,CAAC;AACtB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAMO,SAAS,qBAAqB,MAA2C;AAC9E,QAAM,MAAM,KAAK,OAAO,QAAQ;AAChC,aAAW,QAAQ,CAAC,KAAK,UAAU,GAAI,KAAK,aAAa,CAAC,CAAE,GAAG;AAC7D,UAAM,SAAS,WAAW,IAAI;AAC9B,QAAI,WAAW,QAAQ,WAAW,KAAK;AACrC,YAAM,IAAI;AAAA,QACR,oCAAoC,MAAM,KAAK,IAAI;AAAA,MACrD;AAAA,IACF;AAAA,EACF;AACA,EAAAC,eAAc,KAAK,UAAU,OAAO,GAAG,CAAC;AACxC,QAAM,UAAU,MAAY;AAC1B,QAAI;AACF,UAAIF,YAAW,KAAK,QAAQ,KAAKC,cAAa,KAAK,UAAU,MAAM,EAAE,KAAK,MAAM,OAAO,GAAG,GAAG;AAC3F,mBAAW,KAAK,QAAQ;AAAA,MAC1B;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACA,MAAI,KAAK,iBAAiB,KAAM,SAAQ,GAAG,QAAQ,OAAO;AAC1D,SAAO,EAAE,QAAQ;AACnB;;;ACzCA,IAAM,iBACJ;AAEF,IAAM,kBAAkB;AAMjB,SAAS,4BACd,SACA,OAAgC,CAAC,GACxB;AACT,MAAI,CAAC,QAAS,QAAO;AACrB,MAAI,eAAe,KAAK,OAAO,EAAG,QAAO;AACzC,OAAK,KAAK,6BAA6B,UAAU,gBAAgB,KAAK,OAAO,EAAG,QAAO;AACvF,aAAW,KAAK,KAAK,iBAAiB,CAAC,EAAG,KAAI,EAAE,KAAK,OAAO,EAAG,QAAO;AACtE,SAAO;AACT;;;ACrCA,SAAS,oBAAoB;AAC7B,SAAS,cAAAE,mBAAkB;AAC3B;AAAA,EACE;AAAA,EACA,cAAAC;AAAA,EACA,aAAa;AAAA,EACb;AAAA,EACA;AAAA,EACA,aAAAC;AAAA,EACA,eAAAC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,SAAS,UAAAC,eAAc;AAChC,SAAS,UAAU,WAAAC,UAAS,cAAAC,aAAY,QAAAC,OAAM,YAAAC,WAAU,WAAAC,UAAS,WAAW;AAI5E,IAAM,uBAAuB,MAAM,OAAO;AAC1C,IAAM,wBAAwB,OAAO;AAMrC,IAAM,qBAAqB,oBAAI,IAAI;AAAA,EACjC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AA0BM,IAAM,uBAAN,cAAmC,MAAM;AAAA,EAC9C,YACE,SACS,OACT;AACA,UAAM,OAAO;AAFJ;AAGT,SAAK,OAAO;AAAA,EACd;AAAA,EAJW;AAKb;AAeA,SAAS,WAAW,MAAgB,KAAa,WAAwC;AACvF,MAAI;AACF,UAAM,MAAM,EAAE,GAAG,QAAQ,IAAI;AAC7B,eAAW,OAAO,OAAO,KAAK,GAAG,GAAG;AAClC,UACE,mBAAmB,IAAI,GAAG,KAC1B,QAAQ,gBACR,IAAI,WAAW,aAAa,KAC5B,IAAI,WAAW,WAAW,KAC1B,QAAQ,mBACR,QAAQ,qBACR;AACA,eAAO,IAAI,GAAG;AAAA,MAChB;AAAA,IACF;AACA,WAAO,OAAO,KAAK,SAAS;AAC5B,QAAI,yBAAyB;AAC7B,QAAI,SAAS;AACb,QAAI,OAAO;AACX,WAAO,aAAa,OAAO,MAAM,EAAE,KAAK,KAAK,WAAW,qBAAqB,CAAC;AAAA,EAChF,SAAS,KAAK;AACZ,UAAM,SACJ,OAAO,OAAO,QAAQ,YAAY,YAAY,MAC1C,OAAQ,IAA4B,MAAM,IAC1C;AACN,UAAM,IAAI,qBAAqB,OAAO,KAAK,KAAK,GAAG,CAAC,YAAY,UAAU,OAAO,GAAG,CAAC,IAAI,GAAG;AAAA,EAC9F;AACF;AAEA,SAAS,SAAS,KAAgB,MAAgB,KAAa,KAA8B;AAC3F,MAAI;AACF,UAAM,SAAS,IAAI,MAAM,KAAK,GAAG;AACjC,WAAO,OAAO,WAAW,WAAW,OAAO,KAAK,QAAQ,MAAM,IAAI,OAAO,KAAK,MAAM;AAAA,EACtF,SAAS,KAAK;AACZ,QAAI,eAAe,qBAAsB,OAAM;AAC/C,UAAM,IAAI,qBAAqB,OAAO,KAAK,KAAK,GAAG,CAAC,YAAY,OAAO,GAAG,CAAC,IAAI,GAAG;AAAA,EACpF;AACF;AAEA,SAAS,QAAQ,KAAgB,MAAgB,KAAa,KAA8B;AAC1F,SAAO,SAAS,KAAK,MAAM,KAAK,GAAG,EAAE,SAAS,MAAM,EAAE,KAAK;AAC7D;AAEA,SAAS,sBAAsB,KAAgB,UAAkB,MAAuB;AACtF,QAAM,WAAW,OAAO,KAAK,YAAYC,SAAQ,IAAI,CAAC,IAAI,MAAM;AAChE,QAAM,UAAU,SAAS,KAAK,CAAC,YAAY,QAAQ,eAAe,IAAI,GAAG,QAAQ;AACjF,MAAI,QAAQ;AACZ,SAAO,QAAQ,QAAQ,QAAQ;AAC7B,UAAM,MAAM,QAAQ,QAAQ,GAAG,KAAK;AACpC,QAAI,MAAM,GAAG;AACX,YAAM,IAAI,qBAAqB,iDAAiD;AAAA,IAClF;AACA,QAAI,QAAQ,SAAS,OAAO,GAAG,EAAE,OAAO,QAAQ,EAAG,QAAO;AAC1D,YAAQ,MAAM;AAAA,EAChB;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAgB,UAAkB,QAAyB;AACjF,QAAM,MAAM,cAAc,MAAM;AAChC,SAAO,QAAQ,KAAK,CAAC,gBAAgB,uBAAuB,MAAM,GAAG,GAAG,QAAQ,EAC7E,MAAM,IAAI,EACV,KAAK,CAAC,cAAc,cAAc,GAAG;AAC1C;AAEA,SAAS,gBAAgB,QAAuB,QAAyC;AACvF,MAAI;AACF,QAAI,CAAC,OAAO,EAAG,QAAO;AAAA,EACxB,SAAS,KAAK;AACZ,WAAO;AAAA,EACT;AAEA,MAAI;AACF,WAAO;AACP,WAAO;AAAA,EACT,SAAS,aAAa;AACpB,QAAI;AAGF,UAAI,CAAC,OAAO,EAAG,QAAO;AAAA,IACxB,SAAS,cAAc;AACrB,aAAO,IAAI;AAAA,QACT,CAAC,aAAa,YAAY;AAAA,QAC1B;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,SAASC,QAAO,OAAuC;AACrD,SAAO,UAAUC,YAAW,QAAQ,EAAE,OAAO,KAAK,EAAE,OAAO,KAAK,CAAC;AACnE;AAEA,IAAM,aAAa;AAAA;AAAA;AAAA;AAAA,EAIjB;AAAA,EACA;AAAA,EACA;AAAA,EACA,uBAAuB,OAAO;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,KAAK,OAAO;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,oBAAoC;AAAA,EACxC,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,mBAAmB;AAAA,EACnB,qBAAqB;AAAA,EACrB,mBAAmB;AACrB;AAKA,SAAS,WACP,KACA,KACA,YACA,iBACQ;AACR,QAAM,UAAUC,aAAYC,MAAKC,QAAO,GAAG,mBAAmB,CAAC;AAC/D,QAAM,WAAWD,MAAK,SAAS,UAAU;AACzC,QAAM,gBAAgBA,MAAK,SAAS,gBAAgB;AACpD,EAAAE,WAAU,aAAa;AACvB,MAAI;AACF,UAAM,eAAe,uBAAuB,eAAe;AAC3D,UAAM,gBAAgB,aAAa,QAAQ,KAAK,CAAC,aAAa,cAAc,SAAS,GAAG,GAAG,CAAC;AAC5F;AAAA,MACE;AAAA,MACA;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA,GAAI,iBAAiB,WAAW,CAAC,wBAAwB,IAAI,CAAC;AAAA,QAC9D,cAAc,aAAa;AAAA,QAC3B;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,MACA,CAAC,aAAa,QAAQ,IAAI,GAAG,YAAY,YAAY,iBAAiB,IAAI;AAAA,MAC1E;AAAA,MACA;AAAA,QACE,GAAG;AAAA,QACH,kCAAkC;AAAA,MACpC;AAAA,IACF;AAAA,EACF,UAAE;AACA,WAAO,SAAS,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EAClD;AACF;AAEA,SAAS,cAAc,KAAgB,KAAa,KAAqB;AACvE,SAAO,QAAQ,KAAK,CAAC,aAAa,YAAY,GAAG,GAAG,WAAW,GAAG,GAAG;AACvE;AAEA,SAAS,uBAAuB,SAAsB,aAA8B;AAClF,MAAIC,YAAW,QAAQ,WAAW,EAAG,QAAO,QAAQ;AACpD,MAAI,YAAa,QAAOH,MAAK,aAAa,SAAS,QAAQ,WAAW,CAAC;AACvE,SAAO,QAAQ;AACjB;AAQA,SAAS,eAAe,MAAsB;AAC5C,SAAO,KAAK,UAAU,IAAI;AAC5B;AAEA,SAAS,oBAAoB,OAAmC;AAC9D,QAAM,QAAQ,OAAO,KAAK,KAAK;AAC/B,QAAM,UAA0B,CAAC;AACjC,MAAI,QAAQ;AACZ,SAAO,QAAQ,MAAM,QAAQ;AAC3B,UAAM,MAAM,MAAM,QAAQ,GAAG,KAAK;AAClC,QAAI,MAAM,EAAG,OAAM,IAAI,qBAAqB,wCAAwC;AACpF,UAAM,SAAS,MAAM,SAAS,OAAO,GAAG;AACxC,YAAQ,MAAM;AACd,QAAI,OAAO,WAAW,EAAG;AAEzB,UAAM,MAAM,OAAO,QAAQ,CAAI;AAC/B,QAAI,MAAM,EAAG,OAAM,IAAI,qBAAqB,uCAAuC;AACnF,UAAM,WAAW,OAAO,SAAS,GAAG,GAAG,EAAE,SAAS,OAAO,EAAE,MAAM,GAAG;AACpE,QAAI,SAAS,WAAW,EAAG,OAAM,IAAI,qBAAqB,8BAA8B;AACxF,UAAM,OAAO,SAAS,CAAC;AACvB,UAAM,OAAO,SAAS,CAAC;AACvB,UAAM,WAAW,SAAS,CAAC;AAC3B,QAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU;AAC/B,YAAM,IAAI,qBAAqB,8BAA8B;AAAA,IAC/D;AACA,UAAM,YAAY,OAAO,SAAS,MAAM,CAAC;AACzC,UAAM,OAAO,UAAU,SAAS,MAAM;AACtC,QAAI,CAAC,OAAO,KAAK,MAAM,MAAM,EAAE,OAAO,SAAS,GAAG;AAChD,YAAM,IAAI,qBAAqB,uCAAuC;AAAA,IACxE;AACA,QAAI,SAAS,UAAU,SAAS,UAAU;AACxC,YAAM,IAAI;AAAA,QACR,oDAAoD,IAAI,OAAO,eAAe,IAAI,CAAC;AAAA,MACrF;AAAA,IACF;AACA,YAAQ,KAAK,EAAE,MAAM,UAAU,KAAK,CAAC;AAAA,EACvC;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAA6B;AACrD,QAAM,QAAQ,OAAO,KAAK,KAAK;AAC/B,QAAM,QAAkB,CAAC;AACzB,MAAI,QAAQ;AACZ,SAAO,QAAQ,MAAM,QAAQ;AAC3B,UAAM,MAAM,MAAM,QAAQ,GAAG,KAAK;AAClC,QAAI,MAAM,EAAG,OAAM,IAAI,qBAAqB,wCAAwC;AACpF,UAAM,YAAY,MAAM,SAAS,OAAO,GAAG;AAC3C,YAAQ,MAAM;AACd,QAAI,UAAU,WAAW,EAAG;AAC5B,UAAM,OAAO,UAAU,SAAS,MAAM;AACtC,QAAI,CAAC,OAAO,KAAK,MAAM,MAAM,EAAE,OAAO,SAAS,GAAG;AAChD,YAAM,IAAI,qBAAqB,uCAAuC;AAAA,IACxE;AACA,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,SAAO;AACT;AAEA,SAAS,aAAa,MAAc,WAA4B;AAC9D,QAAM,MAAMI,UAAS,MAAM,SAAS;AACpC,SAAO,QAAQ,MAAO,CAACD,YAAW,GAAG,KAAK,QAAQ,QAAQ,CAAC,IAAI,WAAW,KAAK,GAAG,EAAE;AACtF;AAEA,SAAS,uBAAuB,MAAc,MAAsB;AAClE,MAAI,KAAK,WAAW,KAAKA,YAAW,IAAI,GAAG;AACzC,UAAM,IAAI,qBAAqB,oCAAoC,eAAe,IAAI,CAAC,EAAE;AAAA,EAC3F;AACA,QAAM,eAAeP,SAAQ,MAAM,IAAI;AACvC,MAAI,CAAC,aAAa,MAAM,YAAY,KAAK,iBAAiB,MAAM;AAC9D,UAAM,IAAI,qBAAqB,0CAA0C,eAAe,IAAI,CAAC,EAAE;AAAA,EACjG;AAEA,QAAM,WAAW,KAAK,MAAM,QAAQ;AACpC,MAAI,SAAS;AACb,aAAW,WAAW,SAAS,MAAM,GAAG,EAAE,GAAG;AAC3C,QAAI,QAAQ,WAAW,KAAK,YAAY,OAAO,YAAY,MAAM;AAC/D,YAAM,IAAI,qBAAqB,oCAAoC,eAAe,IAAI,CAAC,EAAE;AAAA,IAC3F;AACA,aAASI,MAAK,QAAQ,OAAO;AAC7B,UAAM,OAAO,UAAU,MAAM;AAC7B,QAAI,CAAC,KAAK,YAAY,KAAK,KAAK,eAAe,GAAG;AAChD,YAAM,IAAI;AAAA,QACR,gEAAgE,eAAe,IAAI,CAAC;AAAA,MACtF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,UAAqC;AACnE,MAAI,iBAAiB,KAAK,QAAQ,EAAG,QAAO;AAC5C,MAAI,iBAAiB,KAAK,QAAQ,EAAG,QAAO;AAC5C,QAAM,IAAI,qBAAqB,8BAA8B,QAAQ,EAAE;AACzE;AAEA,SAAS,iBAAiB,OAAmB,UAA0B;AACrE,QAAM,OAAOF,YAAW,uBAAuB,QAAQ,CAAC;AACxD,OAAK,OAAO,QAAQ,MAAM,UAAU,IAAI;AACxC,OAAK,OAAO,KAAK;AACjB,SAAO,KAAK,OAAO,KAAK;AAC1B;AAEA,SAAS,gBAAgB,MAAc,UAAyD;AAC9F,QAAM,SAAS,UAAU,IAAI;AAC7B,MAAI,CAAC,OAAO,OAAO,KAAK,OAAO,eAAe,GAAG;AAC/C,UAAM,IAAI,qBAAqB,0CAA0C,eAAe,IAAI,CAAC,EAAE;AAAA,EACjG;AAEA,QAAM,WAAW,QAAQ,aAAa,UAAU,IAAI,YAAY;AAChE,QAAM,KAAK,SAAS,MAAM,YAAY,WAAW,QAAQ;AACzD,MAAI;AACF,UAAM,SAAS,UAAU,EAAE;AAC3B,QACE,CAAC,OAAO,OAAO,KACf,OAAO,QAAQ,OAAO,OACtB,OAAO,QAAQ,OAAO,OACtB,OAAO,SAAS,OAAO,MACvB;AACA,YAAM,IAAI;AAAA,QACR,yDAAyD,eAAe,IAAI,CAAC;AAAA,MAC/E;AAAA,IACF;AAEA,UAAM,OAAOA,YAAW,uBAAuB,QAAQ,CAAC;AACxD,SAAK,OAAO,QAAQ,OAAO,IAAI,IAAI;AACnC,UAAM,QAAQ,OAAO,YAAY,qBAAqB;AACtD,QAAI,QAAQ;AACZ,WAAO,MAAM;AACX,YAAM,QAAQ,SAAS,IAAI,OAAO,GAAG,MAAM,QAAQ,IAAI;AACvD,UAAI,UAAU,EAAG;AACjB,eAAS;AACT,WAAK,OAAO,MAAM,SAAS,GAAG,KAAK,CAAC;AAAA,IACtC;AACA,QAAI,UAAU,OAAO,MAAM;AACzB,YAAM,IAAI;AAAA,QACR,yDAAyD,eAAe,IAAI,CAAC;AAAA,MAC/E;AAAA,IACF;AACA,WAAO,EAAE,MAAM,KAAK,OAAO,KAAK,GAAG,aAAa,OAAO,OAAO,QAAW,EAAE;AAAA,EAC7E,UAAE;AACA,cAAU,EAAE;AAAA,EACd;AACF;AAEA,SAAS,2BACP,MACA,UACA,cACM;AACN,QAAM,cAAc,aAAa,UAAU,EAAE,UAAU,SAAS,CAAC;AACjE,QAAM,SAAS,YAAY,SAAS,MAAM;AAC1C,MAAI,CAAC,OAAO,KAAK,QAAQ,MAAM,EAAE,OAAO,WAAW,GAAG;AACpD,UAAM,IAAI;AAAA,MACR,qDAAqD,eAAe,QAAQ,CAAC;AAAA,IAC/E;AAAA,EACF;AACA,MAAIK,YAAW,MAAM,GAAG;AACtB,UAAM,IAAI;AAAA,MACR,qDAAqD,eAAe,QAAQ,CAAC;AAAA,IAC/E;AAAA,EACF;AACA,QAAM,gBAAgBP,SAAQS,SAAQ,QAAQ,GAAG,MAAM;AACvD,MAAI,CAAC,aAAa,MAAM,aAAa,GAAG;AACtC,UAAM,IAAI;AAAA,MACR,qDAAqD,eAAe,QAAQ,CAAC;AAAA,IAC/E;AAAA,EACF;AACA,MAAI;AACJ,MAAI;AACF,qBAAiB,aAAa,QAAQ;AAAA,EACxC,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,4DAA4D,eAAe,QAAQ,CAAC;AAAA,MACpF;AAAA,IACF;AAAA,EACF;AACA,MAAI,CAAC,aAAa,MAAM,cAAc,GAAG;AACvC,UAAM,IAAI;AAAA,MACR,qDAAqD,eAAe,QAAQ,CAAC;AAAA,IAC/E;AAAA,EACF;AAEA,QAAM,iBAAiBD,UAAS,MAAM,cAAc,EAAE,MAAM,GAAG,EAAE,KAAK,GAAG;AACzE,QAAM,kBACJ,aAAa,IAAI,cAAc,KAC/B,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,gBAAgB,YAAY,WAAW,GAAG,cAAc,GAAG,CAAC;AACtF,MAAI,CAAC,iBAAiB;AACpB,UAAM,IAAI;AAAA,MACR,8DAA8D,eAAe,QAAQ,CAAC;AAAA,IACxF;AAAA,EACF;AACF;AAEA,SAAS,6BAA6B,KAAgB,MAAc,iBAA+B;AACjG,QAAM,UAAU;AAAA,IACd,SAAS,KAAK,CAAC,WAAW,MAAM,MAAM,eAAe,eAAe,GAAG,IAAI;AAAA,EAC7E;AACA,QAAM,eAAe,IAAI,IAAI,QAAQ,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC;AAE/D,aAAW,SAAS,SAAS;AAC3B,UAAM,eAAe,uBAAuB,MAAM,MAAM,IAAI;AAC5D,QAAI,MAAM,SAAS,YAAY,MAAM,SAAS,UAAU;AACtD,YAAM,IAAI;AAAA,QACR,8EAA8E,eAAe,MAAM,IAAI,CAAC;AAAA,MAC1G;AAAA,IACF;AACA,QAAI,MAAM,SAAS,UAAU;AAC3B,YAAM,OAAO,UAAU,YAAY;AACnC,UAAI,CAAC,KAAK,eAAe,GAAG;AAC1B,cAAM,IAAI;AAAA,UACR,2CAA2C,eAAe,MAAM,IAAI,CAAC;AAAA,QACvE;AAAA,MACF;AACA,YAAM,cAAc,aAAa,cAAc,EAAE,UAAU,SAAS,CAAC;AACrE,YAAM,iBAAiB,iBAAiB,aAAa,MAAM,QAAQ;AACnE,UAAI,mBAAmB,MAAM,UAAU;AACrC,cAAM,IAAI;AAAA,UACR,yEAAyE,eAAe,MAAM,IAAI,CAAC;AAAA,QACrG;AAAA,MACF;AACA,iCAA2B,MAAM,cAAc,YAAY;AAC3D;AAAA,IACF;AACA,QAAI,MAAM,SAAS,YAAY,MAAM,SAAS,UAAU;AACtD,YAAM,IAAI;AAAA,QACR,6CAA6C,MAAM,IAAI,OAAO,eAAe,MAAM,IAAI,CAAC;AAAA,MAC1F;AAAA,IACF;AAEA,UAAM,SAAS,gBAAgB,cAAc,MAAM,QAAQ;AAC3D,QAAI,OAAO,SAAS,MAAM,UAAU;AAClC,YAAM,IAAI;AAAA,QACR,mHAAmH,eAAe,MAAM,IAAI,CAAC;AAAA,MAC/I;AAAA,IACF;AACA,QAAI,QAAQ,aAAa,WAAW,OAAO,gBAAgB,MAAM,SAAS,WAAW;AACnF,YAAM,IAAI;AAAA,QACR,kEAAkE,eAAe,MAAM,IAAI,CAAC;AAAA,MAC9F;AAAA,IACF;AAAA,EACF;AACF;AAcA,SAAS,yBACP,SACA,MACA,KACyB;AACzB,4BAA0B,OAAO;AACjC,MAAI,CAACE,YAAW,IAAI,GAAG;AACrB,UAAM,IAAI,qBAAqB,wCAAwC,IAAI,EAAE;AAAA,EAC/E;AACA,QAAM,cAAcV,SAAQ,IAAI;AAChC,QAAM,gBAAgB,aAAa,IAAI;AACvC,MACE,UAAU,WAAW,EAAE,eAAe,KACrC,QAAQ,aAAa,WAAW,gBAAgB,eACjD;AACA,UAAM,IAAI;AAAA,MACR,kEAAkE,IAAI;AAAA,IACxE;AAAA,EACF;AACA,QAAM,WAAW,QAAQ,KAAK,CAAC,aAAa,iBAAiB,GAAG,IAAI;AACpE,QAAM,oBAAoB,aAAa,QAAQ;AAC/C,MAAI,sBAAsB,eAAe;AACvC,UAAM,IAAI;AAAA,MACR,qEAAqE,QAAQ,SAAS,IAAI;AAAA,IAC5F;AAAA,EACF;AAEA,QAAM,aAAa,QAAQ,KAAK,CAAC,YAAY,IAAI,GAAG,IAAI,EACrD,MAAM,IAAI,EACV,OAAO,CAAC,SAAS,KAAK,SAAS,MAAM,KAAK,WAAW,IAAI,KAAK,SAAS,KAAK,IAAI,EAAE;AACrF,MAAI,WAAW,SAAS,GAAG;AACzB,UAAM,IAAI;AAAA,MACR,2EAA2E,IAAI;AAAA,EAAK,WAAW,KAAK,IAAI,CAAC;AAAA,IAC3G;AAAA,EACF;AAEA,QAAM,aAAa;AAAA,IACjB,GAAG,iBAAiB,SAAS,KAAK,CAAC,YAAY,YAAY,sBAAsB,IAAI,GAAG,IAAI,CAAC;AAAA,IAC7F,GAAG;AAAA,MACD,SAAS,KAAK,CAAC,YAAY,YAAY,aAAa,sBAAsB,IAAI,GAAG,IAAI;AAAA,IACvF;AAAA,EACF;AACA,MAAI,WAAW,SAAS,GAAG;AACzB,UAAM,IAAI;AAAA,MACR,oDAAoD,IAAI;AAAA,EAAK,WAAW,KAAK,IAAI,CAAC;AAAA,IACpF;AAAA,EACF;AAEA,QAAM,kBAAkB,cAAc,KAAK,MAAM,MAAM;AACvD,MAAI,oBAAoB,QAAQ,iBAAiB;AAC/C,UAAM,IAAI;AAAA,MACR,mDAAmD,QAAQ,eAAe,SAAS,eAAe;AAAA,IACpG;AAAA,EACF;AAEA,QAAM,aAAa,cAAc,KAAK,MAAM,QAAQ,UAAU;AAC9D,MAAI,eAAe,QAAQ,YAAY;AACrC,UAAM,IAAI;AAAA,MACR,8CAA8C,QAAQ,UAAU,SAAS,UAAU;AAAA,IACrF;AAAA,EACF;AAEA,QAAM,WAAW,QAAQ,KAAK,CAAC,aAAa,YAAY,GAAG,QAAQ,UAAU,SAAS,GAAG,IAAI;AAC7F,MAAI,aAAa,QAAQ,UAAU;AACjC,UAAM,IAAI;AAAA,MACR,4CAA4C,QAAQ,QAAQ,SAAS,QAAQ;AAAA,IAC/E;AAAA,EACF;AAEA,QAAM,gBAAgB;AAAA,IACpB;AAAA,IACA,CAAC,aAAa,YAAY,GAAG,QAAQ,eAAe,SAAS;AAAA,IAC7D;AAAA,EACF;AACA,MAAI,kBAAkB,QAAQ,eAAe;AAC3C,UAAM,IAAI;AAAA,MACR,uCAAuC,QAAQ,aAAa,SAAS,aAAa;AAAA,IACpF;AAAA,EACF;AAEA,MAAI;AACF;AAAA,MACE;AAAA,MACA;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,MACF;AAAA,MACA;AAAA,IACF;AAAA,EACF,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,uDAAuD,IAAI;AAAA,MAC3D;AAAA,IACF;AAAA,EACF;AAEA,MAAI;AACF,iCAA6B,KAAK,mBAAmB,QAAQ,eAAe;AAAA,EAC9E,SAAS,KAAK;AACZ,QAAI,eAAe,qBAAsB,OAAM;AAC/C,UAAM,IAAI,qBAAqB,6CAA6C,IAAI,IAAI,GAAG;AAAA,EACzF;AAEA,QAAM,YAAY,QAAQ,KAAK,CAAC,cAAc,QAAQ,YAAY,QAAQ,eAAe,GAAG,IAAI;AAChG,MAAI,cAAc,QAAQ,YAAY;AACpC,UAAM,IAAI;AAAA,MACR,yBAAyB,QAAQ,eAAe,+BAA+B,QAAQ,UAAU;AAAA,IACnG;AAAA,EACF;AAEA,QAAM,QAAQ,WAAW,KAAK,MAAM,QAAQ,YAAY,QAAQ,eAAe;AAC/E,QAAM,kBAAkBC,QAAO,KAAK;AACpC,MAAI,oBAAoB,QAAQ,MAAM,UAAU,MAAM,eAAe,QAAQ,MAAM,YAAY;AAC7F,UAAM,IAAI;AAAA,MACR,wCAAwC,QAAQ,MAAM,MAAM,IAAI,QAAQ,MAAM,UAAU,eAAe,eAAe,IAAI,MAAM,UAAU;AAAA,IAC5I;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,UAAU;AAAA,IACV,aAAa,mBAAmB,OAAO;AAAA,IACvC,YAAY,IAAI,WAAW,KAAK;AAAA,EAClC;AACF;AAGA,SAASU,MAAK,OAAuB;AACnC,SACE,MACG,YAAY,EACZ,QAAQ,eAAe,GAAG,EAC1B,QAAQ,YAAY,EAAE,EACtB,MAAM,GAAG,EAAE,KAAK;AAEvB;AAKO,SAAS,mBAAmB,MAAkD;AACnF,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,cAAc,KAAK,eAAeP,MAAK,KAAK,UAAU,YAAY;AACxE,QAAM,eAAe,KAAK,gBAAgB;AAE1C,SAAO;AAAA,IACL,MAAM,OAAO,EAAE,SAAS,MAAM,GAAG;AAC/B,YAAM,KAAK,GAAGO,MAAK,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC;AAC9F,YAAM,SAAS,GAAG,YAAY,IAAI,EAAE;AACpC,YAAM,OAAOP,MAAK,aAAa,EAAE;AACjC,YAAM,aAAa,cAAc,KAAK,KAAK,UAAU,OAAO;AAC5D,YAAM,WAAW;AAAA,QACf;AAAA,QACA,CAAC,aAAa,YAAY,GAAG,UAAU,SAAS;AAAA,QAChD,KAAK;AAAA,MACP;AACA,cAAQ,KAAK,CAAC,YAAY,OAAO,MAAM,QAAQ,MAAM,UAAU,GAAG,KAAK,QAAQ;AAC/E,aAAO,EAAE,MAAM,QAAQ,SAAS,YAAY,SAAS;AAAA,IACvD;AAAA,IAEA,MAAM,SAAS,UAAU,SAAS;AAGhC,YAAM,SAAS;AAAA,QACb;AAAA,QACA,CAAC,UAAU,kBAAkB,uBAAuB;AAAA,QACpD,SAAS;AAAA,MACX;AACA,UAAI,OAAO,SAAS,GAAG;AACrB,gBAAQ,KAAK,CAAC,OAAO,IAAI,GAAG,SAAS,IAAI;AACzC,gBAAQ,KAAK,CAAC,UAAU,MAAM,OAAO,GAAG,SAAS,IAAI;AAAA,MACvD;AACA,YAAM,kBAAkB,cAAc,KAAK,SAAS,MAAM,MAAM;AAChE,YAAM,gBAAgB;AAAA,QACpB;AAAA,QACA,CAAC,aAAa,YAAY,GAAG,eAAe,SAAS;AAAA,QACrD,SAAS;AAAA,MACX;AACA,YAAM,QAAQ,WAAW,KAAK,SAAS,MAAM,SAAS,YAAY,eAAe;AACjF,YAAM,UAAuB;AAAA,QAC3B,MAAM;AAAA,QACN,aAAa,SAAS;AAAA,QACtB,SAAS,SAAS;AAAA,QAClB,YAAY,SAAS;AAAA,QACrB,UAAU,SAAS;AAAA,QACnB;AAAA,QACA;AAAA,QACA,OAAO;AAAA,UACL,QAAQ;AAAA,UACR,QAAQH,QAAO,KAAK;AAAA,UACpB,YAAY,MAAM;AAAA,QACpB;AAAA,QACA;AAAA,MACF;AACA,+BAAyB,SAAS,SAAS,MAAM,GAAG;AACpD,aAAO;AAAA,IACT;AAAA,IAEA,MAAM,QAAQ,UAAU;AAItB,YAAM,WAAW;AAAA,QACf;AAAA,UACE,MAAM,sBAAsB,KAAK,KAAK,UAAU,SAAS,IAAI;AAAA,UAC7D,MAAM,QAAQ,KAAK,CAAC,YAAY,UAAU,WAAW,MAAM,SAAS,IAAI,GAAG,KAAK,QAAQ;AAAA,QAC1F;AAAA,QACA;AAAA,UACE,MAAM,eAAe,KAAK,KAAK,UAAU,SAAS,MAAM;AAAA,UACxD,MAAM,QAAQ,KAAK,CAAC,UAAU,MAAM,MAAM,SAAS,MAAM,GAAG,KAAK,QAAQ;AAAA,QAC3E;AAAA,MACF,EAAE,OAAO,CAAC,YAAY,YAAY,MAAS;AAE3C,UAAI,SAAS,SAAS,GAAG;AACvB,cAAM,QACJ,SAAS,WAAW,IAChB,SAAS,CAAC,IACV,IAAI,eAAe,UAAU,6CAA6C;AAChF,cAAM,IAAI;AAAA,UACR,8BAA8B,SAAS,IAAI,eAAe,SAAS,MAAM;AAAA,UACzE;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;AAKO,SAAS,kBACd,SACA,aACyB;AACzB,QAAM,OAAO,uBAAuB,SAAS,WAAW;AACxD,SAAO,yBAAyB,SAAS,MAAM,UAAU;AAC3D;AAIO,SAAS,oBAAoB,SAAsB,aAA8B;AACtF,SAAO,kBAAkB,SAAS,WAAW,EAAE;AACjD;","names":["result","node","unobservedTaskIds","relative","createHash","createHash","createHash","contentHash","createHash","createHash","existsSync","readFileSync","join","existsSync","readFileSync","join","createHash","mean","truncate","createHash","join","createHash","createHash","createHash","mean","join","surfaceToText","surfaceToText","writeFileSync","join","join","writeFileSync","report","unique","surfaceHash","isAnalystFindingLike","BLOCK_START","BLOCK_END","DEFAULT_HEADING","surfaceToText","createHash","existsSync","readFileSync","resolve","z","z","resolve","entry","existsSync","readFileSync","assertUnique","missingCandidateSlots","missingTaskOutcomes","missingOperations","createHash","existsSync","readFileSync","writeFileSync","createHash","existsSync","mkdirSync","mkdtempSync","tmpdir","dirname","isAbsolute","join","relative","resolve","resolve","sha256","createHash","mkdtempSync","join","tmpdir","mkdirSync","isAbsolute","relative","dirname","existsSync","slug"]}