@tangle-network/agent-eval 0.221.8 → 0.222.1

package/dist/fuzz.js.map

@@ -1 +1 @@
-{"version":3,"file":"fuzz.js","names":[],"sources":["../src/fuzz/cube.ts","../src/fuzz/capsule.ts","../src/rl/active-curriculum.ts","../src/fuzz/policies.ts","../src/fuzz/explorer.ts","../src/fuzz/fuzz-agent.ts","../src/fuzz/gates.ts"],"sourcesContent":["/**\n * Input-space tiling + coverage projection.\n *\n * Cells are the cartesian product of the input axes — the stratification plan,\n * enumerable up front so the planned-vs-covered denominator is honest. Coverage\n * is projected from the evaluation log: per cell, the full DISTRIBUTION of the\n * headline score, of each scored dimension, and of evaluation latency — a bare\n * mean hides outliers, so every aggregate carries its spread. Per-cell cost is\n * split known-dollars vs unknown-runs, never folded into a fabricated $0.\n */\n\nimport type { BehaviorSpace, Cell, CoverageCell, Distribution, Evaluation } from './types'\n\n/** One recorded evaluation — the unit coverage and the capsule are built from. */\nexport interface EvalRecord {\n  cell: Cell\n  ev: Evaluation\n  /** The objective's interest score for this evaluation. */\n  interest: number\n  /** Evaluation wall-clock — engine-measured unless `ev.latencyMs` overrode it. */\n  latencyMs: number\n  /** Known dollars for this run. `null` = cost tracking was wired but this\n   *  run's cost was unknowable (counted apart). Absent = not tracked at all. */\n  costUsd?: number | null\n}\n\n/** Enumerate every input cell (cartesian product of the axes), in stable order. */\nexport function enumerateCells(space: BehaviorSpace): Cell[] {\n  if (space.axes.length === 0) return []\n  let partials: Array<Record<string, string>> = [{}]\n  for (const axis of space.axes) {\n    const next: Array<Record<string, string>> = []\n    for (const partial of partials) {\n      for (const value of axis.values) next.push({ ...partial, [axis.name]: value })\n    }\n    partials = next\n  }\n  return partials.map((coords) => ({ id: cellId(space, coords), coords }))\n}\n\n/** Deterministic id for a coordinate map, e.g. `matterType=nda|difficulty=hard`. */\nexport function cellId(space: BehaviorSpace, coords: Record<string, string>): string {\n  return space.axes.map((a) => `${a.name}=${coords[a.name]}`).join('|')\n}\n\n/** Nearest-rank percentile on a pre-sorted ascending sample. */\nfunction percentile(sorted: number[], p: number): number {\n  const idx = Math.min(sorted.length - 1, Math.max(0, Math.ceil(p * sorted.length) - 1))\n  return sorted[idx] as number\n}\n\n/** Summarize a sample. Throws on an empty sample — callers represent \"no data\"\n *  as `null`, never as a zeroed distribution. */\nexport function distribution(values: number[]): Distribution {\n  if (values.length === 0)\n    throw new Error('distribution: empty sample — represent missing data as null, not zeros')\n  const sorted = [...values].sort((a, b) => a - b)\n  const mean = sorted.reduce((a, b) => a + b, 0) / sorted.length\n  return {\n    mean,\n    median: percentile(sorted, 0.5),\n    p90: percentile(sorted, 0.9),\n    min: sorted[0] as number,\n    max: sorted[sorted.length - 1] as number,\n    n: sorted.length,\n  }\n}\n\n/**\n * Project the evaluation log into the per-input-cell coverage map. A cell with\n * no evaluations reports `score: null` (honestly uncovered), never zeros.\n */\nexport function buildCoverage(cells: Cell[], log: EvalRecord[], threshold: number): CoverageCell[] {\n  const byCell = new Map<string, EvalRecord[]>()\n  for (const r of log) {\n    const arr = byCell.get(r.cell.id) ?? []\n    arr.push(r)\n    byCell.set(r.cell.id, arr)\n  }\n  return cells.map((cell) => {\n    const recs = byCell.get(cell.id) ?? []\n    const runs = recs.length\n    if (runs === 0)\n      return { cell, runs: 0, score: null, findingRate: 0, dimensions: {}, latencyMs: null }\n\n    const score = distribution(recs.map((r) => r.ev.score))\n    const latencyMs = distribution(recs.map((r) => r.latencyMs))\n    const findingRate = recs.filter((r) => r.interest >= threshold).length / runs\n\n    const dimSamples: Record<string, number[]> = {}\n    for (const r of recs) {\n      for (const [k, v] of Object.entries(r.ev.scores ?? {})) {\n        const samples = dimSamples[k] ?? []\n        samples.push(v)\n        dimSamples[k] = samples\n      }\n    }\n    const dimensions: Record<string, Distribution> = {}\n    for (const [k, xs] of Object.entries(dimSamples)) dimensions[k] = distribution(xs)\n\n    // Cost fields appear only when tracking was wired: known dollars sum, and\n    // tracked-but-unknown runs counted apart — never folded in as $0.\n    const tracked = recs.filter((r) => r.costUsd !== undefined)\n    const known = tracked.filter((r) => r.costUsd !== null)\n    const cost =\n      tracked.length > 0\n        ? {\n            costUsd: known.reduce((a, r) => a + (r.costUsd as number), 0),\n            ...(tracked.length > known.length\n              ? { costUnknownRuns: tracked.length - known.length }\n              : {}),\n          }\n        : {}\n\n    return { cell, runs, score, findingRate, dimensions, latencyMs, ...cost }\n  })\n}\n","/**\n * The capsule — the artifact every exploration produces.\n *\n * `buildCapsule` assembles coverage + verified findings + the QD archive into a\n * pure `CapsuleData` (no clock, no I/O — deterministic and snapshot-testable).\n * `renderCapsuleHtml` turns it into a standalone page: the input-cell heat-map\n * (planned vs covered), per-dimension weakness chips, and the minimized finding\n * exemplars. One artifact — the hardening map and the shareable proof object.\n */\n\nimport type { EvalRecord } from './cube'\nimport { buildCoverage, distribution } from './cube'\nimport type { ArchiveEntry, CapsuleData, Cell, CoverageCell, Distribution, FuzzFinding } from './types'\n\nexport interface BuildCapsuleInput<S> {\n  target: string\n  objective: string\n  cells: Cell[]\n  log: EvalRecord[]\n  /** The objective's notable threshold — drives findingRate. */\n  threshold: number\n  archive: ArchiveEntry<S>[]\n  findings: FuzzFinding<S>[]\n  candidateFindings: number\n  runsUsed: number\n  /** Known-dollar / unknown-run split — present only when cost tracking was\n   *  wired; the capsule never fabricates a $0 total. */\n  cost?: { costUsd: number; costUnknownRuns: number }\n  /** Evaluations that threw — infra outcomes, never folded into robustness. */\n  evalErrors: number\n  /** Set when the consecutive-error circuit breaker stopped the run early. */\n  stoppedEarly?: { reason: 'eval-errors'; detail: string }\n}\n\nexport function buildCapsule<S>(input: BuildCapsuleInput<S>): CapsuleData<S> {\n  const coverage = buildCoverage(input.cells, input.log, input.threshold)\n  const covered = coverage.filter((c) => c.runs > 0)\n  // Cells weigh equally: variance steering sends more runs to weak cells, so a\n  // run-weighted average would bias the headline low.\n  const robustness =\n    covered.length === 0 ? null : distribution(covered.map((c) => (c.score as Distribution).mean))\n  const latencyMs = input.log.length === 0 ? null : distribution(input.log.map((r) => r.latencyMs))\n  // Measured-descriptor bins beyond the bare input cell — observed, never planned.\n  const behaviorBinsObserved = input.archive.filter((e) => e.binId !== e.cell.id).length\n\n  return {\n    target: input.target,\n    objective: input.objective,\n    coverage,\n    findings: [...input.findings].sort((a, b) => b.interest - a.interest),\n    archive: [...input.archive].sort((a, b) => b.interest - a.interest),\n    stats: {\n      totalRuns: input.runsUsed,\n      cellsTotal: input.cells.length,\n      cellsCovered: covered.length,\n      behaviorBinsObserved,\n      candidateFindings: input.candidateFindings,\n      verifiedFindings: input.findings.length,\n      robustness,\n      latencyMs,\n      ...(input.cost\n        ? { costUsd: input.cost.costUsd, costUnknownRuns: input.cost.costUnknownRuns }\n        : {}),\n      evalErrors: input.evalErrors,\n      ...(input.stoppedEarly ? { stoppedEarly: input.stoppedEarly } : {}),\n    },\n  }\n}\n\n// ── HTML capsule ──────────────────────────────────────────────────────────────\n\nfunction esc(s: string): string {\n  return s.replace(\n    /[&<>\"]/g,\n    (c) => ({ '&': '&amp;', '<': '&lt;', '>': '&gt;', '\"': '&quot;' })[c] as string,\n  )\n}\n\n/** red (0) → amber (.5) → green (1); uncovered cells render gray. */\nfunction robustnessColor(r: number | null): string {\n  if (r == null) return '#2a2a2e'\n  return `hsl(${Math.round(r * 120)} 70% 42%)`\n}\n\nfunction pct(x: number): string {\n  return `${Math.round(x * 100)}%`\n}\n\nfunction deriveAxes(coverage: CoverageCell[]): Array<{ name: string; values: string[] }> {\n  const order: string[] = []\n  const seen = new Map<string, Set<string>>()\n  for (const c of coverage) {\n    for (const [k, v] of Object.entries(c.cell.coords)) {\n      if (!seen.has(k)) {\n        seen.set(k, new Set())\n        order.push(k)\n      }\n      seen.get(k)?.add(v)\n    }\n  }\n  return order.map((name) => ({ name, values: [...(seen.get(name) ?? [])] }))\n}\n\n/** The weakest dimension chip for a cell, e.g. `safety 32%` — shown when scores exist. */\nfunction weakestDim(c: CoverageCell): string {\n  const entries = Object.entries(c.dimensions).map(([k, d]) => [k, d.mean] as [string, number])\n  if (entries.length === 0) return ''\n  const sorted = entries.sort((a, b) => a[1] - b[1])\n  const w = sorted[0]\n  if (!w) return ''\n  return `<span class=\"dim\">${esc(w[0])} ${pct(w[1])}</span>`\n}\n\nfunction heatmapHtml(coverage: CoverageCell[]): string {\n  const axes = deriveAxes(coverage)\n  const byId = new Map(coverage.map((c) => [c.cell.id, c]))\n  const tile = (c: CoverageCell | undefined, label: string): string => {\n    const r = c?.score?.mean ?? null\n    const title = c?.score\n      ? `${pct(c.score.mean)} robust (median ${pct(c.score.median)}, min ${pct(c.score.min)}) · ${c.runs} runs · ${pct(c.findingRate)} flagged${c.latencyMs ? ` · ${(c.latencyMs.median / 1000).toFixed(1)}s median` : ''}${c.costUsd !== undefined ? ` · $${c.costUsd.toFixed(2)}` : ''}`\n      : 'not covered'\n    return `<div class=\"tile\" style=\"background:${robustnessColor(r)}\" title=\"${esc(title)}\">${label ? `<span class=\"tl\">${esc(label)}</span>` : ''}<span class=\"tv\">${c && r != null ? pct(r) : '—'}</span>${c ? weakestDim(c) : ''}</div>`\n  }\n\n  const rowAxis = axes[0]\n  const colAxis = axes[1]\n  if (axes.length === 2 && rowAxis && colAxis) {\n    const head = `<tr><th></th>${colAxis.values.map((v) => `<th>${esc(v)}</th>`).join('')}</tr>`\n    const rows = rowAxis.values\n      .map((rv) => {\n        const cells = colAxis.values\n          .map((cv) => {\n            const id = `${rowAxis.name}=${rv}|${colAxis.name}=${cv}`\n            return `<td>${tile(byId.get(id), '')}</td>`\n          })\n          .join('')\n        return `<tr><th class=\"rh\">${esc(rv)}</th>${cells}</tr>`\n      })\n      .join('')\n    return `<div class=\"axis-label\">rows: <b>${esc(rowAxis.name)}</b> · cols: <b>${esc(colAxis.name)}</b></div><table class=\"heat\">${head}${rows}</table>`\n  }\n\n  const sorted = [...coverage].sort((a, b) => (a.score?.mean ?? 2) - (b.score?.mean ?? 2))\n  return `<div class=\"grid\">${sorted.map((c) => tile(c, Object.values(c.cell.coords).join(' · '))).join('')}</div>`\n}\n\nfunction findingsHtml<S>(findings: FuzzFinding<S>[], limit: number): string {\n  if (findings.length === 0)\n    return `<p class=\"none\">No verified findings — the target held across every covered cell.</p>`\n  return findings\n    .slice(0, limit)\n    .map((f) => {\n      const coords = Object.entries(f.cell.coords)\n        .map(([k, v]) => `${k}:${v}`)\n        .join(' · ')\n      const labels = (f.evaluation.labels ?? [])\n        .map((l) => `<span class=\"fclass\">${esc(l)}</span>`)\n        .join('')\n      const dims = Object.entries(f.evaluation.scores ?? {})\n        .sort((a, b) => a[1] - b[1])\n        .slice(0, 3)\n        .map(([k, v]) => `<span class=\"dim\">${esc(k)} ${pct(v)}</span>`)\n        .join('')\n      return `<div class=\"fail\"><div class=\"fmeta\"><span class=\"fcell\">${esc(coords)}</span>${labels}<span class=\"fsev\">interest ${pct(f.interest)}</span></div><div class=\"sevbar\"><div class=\"sevfill\" style=\"width:${pct(f.interest)}\"></div></div><div class=\"ftext\">${esc(f.text ?? '(scenario text not captured)')}</div>${dims ? `<div class=\"fdims\">${dims}</div>` : ''}</div>`\n    })\n    .join('')\n}\n\nexport interface RenderCapsuleOptions {\n  /** Max finding exemplars to show. Default 8. */\n  maxFindings?: number\n  /** ISO timestamp to stamp into the page (keeps the pure capsule clock-free). */\n  generatedAt?: string\n}\n\n/** Render a self-contained HTML capsule — heat-map + per-dimension chips + verified findings. */\nexport function renderCapsuleHtml<S>(\n  capsule: CapsuleData<S>,\n  opts: RenderCapsuleOptions = {},\n): string {\n  const s = capsule.stats\n  const kpi = (label: string, value: string, accent = '#e6e6e6'): string =>\n    `<div class=\"kpi\"><div class=\"kv\" style=\"color:${accent}\">${esc(value)}</div><div class=\"kl\">${esc(label)}</div></div>`\n  const lift = capsule.lift\n    ? kpi(\n        'hardening lift',\n        `${capsule.lift.before.toFixed(2)} → ${capsule.lift.after.toFixed(2)}`,\n        '#5ad17a',\n      )\n    : ''\n  // Cost KPI only when tracking was wired — an untracked run never shows $0.\n  // Unpriced runs are named in the label (amber): the total is a lower bound.\n  const cost =\n    s.costUsd !== undefined\n      ? kpi(\n          s.costUnknownRuns ? `cost · ${s.costUnknownRuns} runs unpriced` : 'cost',\n          `$${s.costUsd.toFixed(2)}`,\n          s.costUnknownRuns ? '#e5c07b' : '#e6e6e6',\n        )\n      : ''\n  const stamp = opts.generatedAt ?? capsule.generatedAt ?? ''\n\n  return `<!doctype html><html><head><meta charset=\"utf-8\"><meta name=\"viewport\" content=\"width=device-width,initial-scale=1\">\n<title>${esc(capsule.objective)} capsule — ${esc(capsule.target)}</title>\n<style>\n:root{color-scheme:dark}\n*{box-sizing:border-box}\nbody{margin:0;background:#0c0c0f;color:#e6e6e6;font:14px/1.5 ui-sans-serif,system-ui,-apple-system,Segoe UI,Roboto,sans-serif}\n.wrap{max-width:980px;margin:0 auto;padding:40px 24px}\nh1{font-size:22px;margin:0 0 2px;letter-spacing:-.01em}\n.sub{color:#8a8a93;font-size:13px;margin-bottom:28px}\n.kpis{display:flex;gap:14px;flex-wrap:wrap;margin-bottom:32px}\n.kpi{background:#16161b;border:1px solid #24242b;border-radius:12px;padding:14px 18px;min-width:120px}\n.kv{font-size:24px;font-weight:650;letter-spacing:-.02em}\n.kl{color:#8a8a93;font-size:12px;margin-top:2px}\nh2{font-size:13px;text-transform:uppercase;letter-spacing:.08em;color:#8a8a93;margin:34px 0 14px}\n.axis-label{color:#8a8a93;font-size:12px;margin-bottom:10px}\ntable.heat{border-collapse:separate;border-spacing:6px}\ntable.heat th{font-weight:500;color:#a8a8b0;font-size:12px;padding:4px 8px;text-align:center}\ntable.heat th.rh{text-align:right}\n.tile{position:relative;width:104px;height:66px;border-radius:10px;display:flex;flex-direction:column;justify-content:center;align-items:center;gap:1px;color:#06120a;font-weight:600}\n.tile .tv{font-size:17px}\n.tile .tl{font-size:10px;font-weight:600;opacity:.9;padding:0 6px;text-align:center}\n.tile .dim{font-size:9px;font-weight:600;opacity:.85;background:rgba(0,0,0,.22);padding:0 6px;border-radius:999px}\n.grid{display:flex;flex-wrap:wrap;gap:8px}\n.grid .tile{width:138px;height:74px}\n.fail{background:#16161b;border:1px solid #24242b;border-left:3px solid #d1495b;border-radius:10px;padding:12px 14px;margin-bottom:10px}\n.fmeta{display:flex;gap:10px;align-items:center;font-size:12px;color:#a8a8b0;margin-bottom:8px}\n.fcell{color:#cfcfd6}\n.fclass{background:#2a1a1d;color:#e58a96;padding:1px 8px;border-radius:999px;font-size:11px}\n.fsev{margin-left:auto;color:#e58a96}\n.sevbar{height:4px;background:#24242b;border-radius:2px;overflow:hidden;margin-bottom:10px}\n.sevfill{height:100%;background:#d1495b}\n.ftext{font-size:13px;color:#d8d8df;white-space:pre-wrap}\n.fdims{display:flex;gap:6px;margin-top:8px}\n.fdims .dim{background:#1d2530;color:#9fc1e8;padding:1px 8px;border-radius:999px;font-size:11px}\n.none{color:#5ad17a}\n.foot{color:#5a5a63;font-size:11px;margin-top:36px}\n</style></head><body><div class=\"wrap\">\n<h1>${esc(capsule.objective)} exploration · ${esc(capsule.target)}</h1>\n<div class=\"sub\">${s.totalRuns} scenarios across ${s.cellsCovered}/${s.cellsTotal} planned cells${s.behaviorBinsObserved > 0 ? ` · ${s.behaviorBinsObserved} measured behavior bins` : ''}${stamp ? ` · ${esc(stamp)}` : ''}</div>\n<div class=\"kpis\">\n${s.robustness ? kpi('robustness', `${pct(s.robustness.mean)}`, s.robustness.mean < 0.6 ? '#e58a96' : '#5ad17a') : ''}\n${s.robustness ? kpi('cell spread', `${pct(s.robustness.min)}–${pct(s.robustness.max)}`) : ''}\n${s.latencyMs ? kpi('median latency', `${(s.latencyMs.median / 1000).toFixed(1)}s`, s.latencyMs.p90 > 4 * s.latencyMs.median ? '#e5b566' : '#e6e6e6') : ''}\n${kpi('verified findings', String(s.verifiedFindings), s.verifiedFindings > 0 ? '#e58a96' : '#5ad17a')}\n${kpi('cells covered', `${s.cellsCovered}/${s.cellsTotal}`)}\n${kpi('scenarios run', String(s.totalRuns))}\n${cost}\n${s.evalErrors > 0 ? kpi('eval errors', String(s.evalErrors), '#e5b566') : ''}\n${lift}\n</div>\n${s.stoppedEarly ? `<div class=\"sub\" style=\"color:#e5b566\">stopped early: ${esc(s.stoppedEarly.detail)} — coverage below reflects the completed portion only</div>` : ''}\n<h2>Coverage map</h2>\n${heatmapHtml(capsule.coverage)}\n<h2>Verified findings${s.candidateFindings > s.verifiedFindings ? ` · ${s.verifiedFindings} of ${s.candidateFindings} candidates passed the validity gates` : ''}</h2>\n${findingsHtml(capsule.findings, opts.maxFindings ?? 8)}\n<div class=\"foot\">Findings are gate-verified: each is a fair, answerable task that reproduces under a meaning-preserving rephrase, minimized to the smallest trigger.</div>\n</div></body></html>`\n}\n","/**\n * Adaptive curriculum: active scenario selection by variance.\n *\n * Fixed scenario sets waste sample budget on cells whose outcome is already\n * settled. `varianceBasedCurriculum` scores each (variant, scenario) cell by\n * the empirical variance of past observations and allocates the next round's\n * budget toward the noisy and under-sampled cells. The output is a next-round\n * allocation, a list of (variant, scenario, count) triples, which the\n * consumer runs and feeds back.\n *\n * Choosing which search node to expand is not a curriculum; it belongs to the\n * search policy (`aide` draws parents by Thompson sampling over each node's\n * posterior, in `campaign/search-policy.ts`). Scenario generation belongs to\n * the adversarial primitive.\n */\n\nexport interface CellObservation {\n  variantId: string\n  scenarioId: string\n  /** Observed score in [0, 1]. */\n  score: number\n}\n\nexport interface CurriculumAllocation {\n  variantId: string\n  scenarioId: string\n  /** How many additional reps to run on this cell. */\n  count: number\n  /** Strategy-specific reason for the allocation. */\n  reason: string\n}\n\nexport interface VarianceCurriculumOptions {\n  /** Total reps to allocate across all cells. */\n  budget: number\n  /**\n   * Smoothing prior on variance — keeps the allocator from concentrating\n   * on a cell with one observation just because its 1-sample variance is\n   * 0. Default 0.05.\n   */\n  variancePrior?: number\n  /**\n   * Minimum reps per cell — even when the variance estimate is low, give\n   * every cell at least this many. Default 1.\n   */\n  floorPerCell?: number\n}\n\n/**\n * Variance-proportional allocation. For each cell, estimate variance from\n * past observations + a prior, then allocate the budget proportional to\n * (sqrt(variance) + 1/sqrt(n)) — a classical optimal-allocation rule\n * (Neyman 1934) that balances \"explore noisy cells\" with \"explore\n * under-sampled cells.\"\n */\nexport function varianceBasedCurriculum(\n  observations: CellObservation[],\n  candidateCells: Array<{ variantId: string; scenarioId: string }>,\n  opts: VarianceCurriculumOptions,\n): CurriculumAllocation[] {\n  const variancePrior = opts.variancePrior ?? 0.05\n  const floor = opts.floorPerCell ?? 1\n  const budget = opts.budget\n\n  const grouped = new Map<string, number[]>()\n  for (const o of observations) {\n    const k = `${o.variantId}::${o.scenarioId}`\n    const arr = grouped.get(k) ?? []\n    arr.push(o.score)\n    grouped.set(k, arr)\n  }\n\n  const cellStats = candidateCells.map((c) => {\n    const k = `${c.variantId}::${c.scenarioId}`\n    const samples = grouped.get(k) ?? []\n    const n = samples.length\n    const mean = n === 0 ? 0.5 : samples.reduce((s, v) => s + v, 0) / n\n    const variance =\n      n < 2\n        ? variancePrior\n        : samples.reduce((s, v) => s + (v - mean) ** 2, 0) / (n - 1) + variancePrior\n    // Neyman optimal allocation: weight ∝ √variance; add √(1/n) to break\n    // ties toward under-sampled cells.\n    const weight = Math.sqrt(variance) + 1 / Math.sqrt(Math.max(1, n))\n    return { variantId: c.variantId, scenarioId: c.scenarioId, n, mean, variance, weight }\n  })\n\n  // Reserve floor*N for the floor; allocate the rest proportional to weight.\n  const floorTotal = floor * cellStats.length\n  if (floorTotal >= budget) {\n    const each = Math.max(1, Math.floor(budget / Math.max(1, cellStats.length)))\n    return cellStats.map((c) => ({\n      variantId: c.variantId,\n      scenarioId: c.scenarioId,\n      count: each,\n      reason: `floor allocation (budget tight; n=${c.n})`,\n    }))\n  }\n  const remaining = budget - floorTotal\n  const totalWeight = cellStats.reduce((s, c) => s + c.weight, 0)\n  return cellStats.map((c) => {\n    const proportional = totalWeight === 0 ? 0 : Math.round((c.weight / totalWeight) * remaining)\n    return {\n      variantId: c.variantId,\n      scenarioId: c.scenarioId,\n      count: floor + proportional,\n      reason: `variance ${c.variance.toFixed(3)} (n=${c.n}, mean=${c.mean.toFixed(3)})`,\n    }\n  })\n}\n","/**\n * Shipped policies for the exploration engine.\n *\n * `MutationProposer` is a plain function type — an agent running a generator skill\n * IS a proposer (`(ctx) => dispatchToSkill(ctx)`), no wrapper needed. `mutationProposer`\n * builds the deterministic, LLM-free one from mutation operators. Objectives are\n * interfaces because the engine reads `kind` + `threshold` off them.\n */\n\nimport type { AdversarialMutation } from '../rl/adversarial'\nimport type {\n  Cell,\n  MutationProposer,\n  FuzzObjective,\n  FuzzProposeContext,\n} from './types'\n\nconst clamp01 = (x: number): number => Math.max(0, Math.min(1, x))\n\n// ── proposers ─────────────────────────────────────────────────────────────────\n\n/**\n * Perturbation-based search: apply the cell's mutation operators to the current\n * elites + seeds, deduping by id. Elites first — mutating the most interesting\n * scenario found so far is what makes the search deepen across rounds.\n */\nexport function mutationProposer<S>(opts: {\n  mutationsFor: (cell: Cell) => AdversarialMutation<S>[]\n  scenarioId: (s: S) => string\n}): MutationProposer<S> {\n  return async (ctx: FuzzProposeContext<S>): Promise<S[]> => {\n    const mutations = opts.mutationsFor(ctx.cell)\n    const parents = [...ctx.elites, ...ctx.seeds]\n    const seen = new Set(parents.map(opts.scenarioId))\n    const out: S[] = []\n    for (const parent of parents) {\n      if (out.length >= ctx.count) break\n      for (const m of mutations) {\n        const children = await m.mutate(parent, ctx.rng)\n        for (const child of children) {\n          const id = opts.scenarioId(child)\n          if (seen.has(id)) continue\n          seen.add(id)\n          out.push(child)\n          if (out.length >= ctx.count) break\n        }\n        if (out.length >= ctx.count) break\n      }\n    }\n    return out\n  }\n}\n\n// ── objectives ────────────────────────────────────────────────────────────────\n\n/** Adversarial: a low headline score is interesting — find where the agent fails. */\nexport function adversarialObjective(threshold = 0.5): FuzzObjective {\n  return { kind: 'adversarial', threshold, interest: (ev) => clamp01(1 - ev.score) }\n}\n\n\n\n\n","/**\n * The exploration engine — a stateful session over a behavior space.\n *\n * Each `step()`: allocate budget across INPUT cells (floor first, then variance\n * steering toward the least-certain cells), propose candidates (the proposer\n * reads current elites + findings, so the search deepens generationally),\n * evaluate with bounded concurrency, archive the most interesting scenario per\n * input×measured bin, and admit notable candidates that pass the validity gates.\n * `run()` loops to budget. `coverage()`/`findings()`/`capsule()` read live state —\n * the surface `makeExploreTools` exposes so an agent can drive the session.\n *\n * One evaluation log (`EvalRecord[]`) is the source of truth; allocation\n * observations and coverage are projections of it.\n */\n\nimport { CostLedger, type CostLedgerHandle, CostReceiptCaptureError } from '../cost-ledger'\nimport { ValidationError } from '../errors'\nimport { varianceBasedCurriculum } from '../rl/active-curriculum'\nimport { mulberry32 } from '../statistics/random'\nimport { buildCapsule } from './capsule'\nimport type { EvalRecord } from './cube'\nimport { enumerateCells } from './cube'\nimport { adversarialObjective } from './policies'\nimport type {\n  ArchiveEntry,\n  CapsuleData,\n  Cell,\n  CoverageCell,\n  ExploreOptions,\n  FuzzFinding,\n  FuzzObjective,\n} from './types'\n\nasync function pMap<T>(\n  items: T[],\n  fn: (item: T) => Promise<void>,\n  concurrency: number,\n  signal?: AbortSignal,\n): Promise<void> {\n  let i = 0\n  const workers = Array.from(\n    { length: Math.max(1, Math.min(concurrency, items.length)) },\n    async () => {\n      while (i < items.length) {\n        if (signal?.aborted) return\n        const item = items[i++]\n        if (item === undefined) return\n        await fn(item)\n      }\n    },\n  )\n  await Promise.all(workers)\n}\n\nexport class BehaviorExplorer<S> {\n  private readonly cells: Cell[]\n  private readonly cellById: Map<string, Cell>\n  private readonly objective: FuzzObjective\n  private readonly threshold: number\n  private readonly floorPerCell: number\n  private readonly perRoundBudget: number\n\n  /** The single evaluation log — coverage + allocation are projections of it. */\n  private readonly log: Array<EvalRecord & { scenarioId: string }> = []\n  /** binId (input × measured coords) → the most interesting entry seen. */\n  private readonly archiveByBin = new Map<string, ArchiveEntry<S>>()\n  private readonly _findings: FuzzFinding<S>[] = []\n  private runsUsed = 0\n  private candidateFindings = 0\n  private evalErrors = 0\n  private consecutiveEvalErrors = 0\n  private stoppedEarly: { reason: 'eval-errors'; detail: string } | undefined\n  private readonly rng: () => number\n  private readonly costLedger?: CostLedgerHandle\n  private readonly costPhase = 'fuzz.explore'\n\n  constructor(private readonly opts: ExploreOptions<S>) {\n    this.cells = enumerateCells(opts.space)\n    if (this.cells.length === 0)\n      throw new Error('BehaviorExplorer: space has no cells — every axis needs ≥1 value')\n    if (opts.costBudgetUsd !== undefined) {\n      if (\n        typeof opts.costBudgetUsd !== 'number' ||\n        !Number.isFinite(opts.costBudgetUsd) ||\n        opts.costBudgetUsd < 0\n      ) {\n        throw new RangeError(\n          `BehaviorExplorer: costBudgetUsd must be a nonnegative finite number, got ${String(opts.costBudgetUsd)}`,\n        )\n      }\n    }\n    if (!opts.costOf && (opts.costBudgetUsd !== undefined || opts.ledger || opts.onCost)) {\n      throw new ValidationError(\n        'BehaviorExplorer: costBudgetUsd/ledger/onCost require costOf — the explorer ' +\n          'cannot know run cost without it; supply costOf or drop the cost options',\n      )\n    }\n    if (\n      (opts.costBudgetUsd !== undefined || opts.ledger?.costCeilingUsd !== undefined) &&\n      !opts.maximumChargeOf\n    ) {\n      throw new ValidationError(\n        'BehaviorExplorer: capped cost tracking requires maximumChargeOf before evaluation',\n      )\n    }\n    if (\n      opts.ledger &&\n      opts.costBudgetUsd !== undefined &&\n      opts.ledger.costCeilingUsd !== opts.costBudgetUsd\n    ) {\n      throw new ValidationError(\n        'BehaviorExplorer: costBudgetUsd must match the supplied CostLedger ceiling',\n      )\n    }\n    if (opts.costOf) this.costLedger = opts.ledger ?? new CostLedger(opts.costBudgetUsd)\n    this.cellById = new Map(this.cells.map((c) => [c.id, c]))\n    this.objective = opts.objective ?? adversarialObjective(0.5)\n    this.threshold = this.objective.threshold ?? 0.5\n    this.floorPerCell = opts.floorPerCell ?? 2\n    this.perRoundBudget = Math.max(\n      this.cells.length * this.floorPerCell,\n      Math.ceil(opts.budget / 4),\n    )\n    this.rng = mulberry32(opts.seed ?? 1)\n  }\n\n  private binId(cell: Cell, descriptor: Record<string, string> | undefined): string {\n    if (!descriptor || Object.keys(descriptor).length === 0) return cell.id\n    const measured = Object.keys(descriptor)\n      .sort()\n      .map((k) => `${k}=${descriptor[k]}`)\n      .join('|')\n    return `${cell.id}|${measured}`\n  }\n\n  private allocate(budget: number): Array<{ cellId: string; count: number }> {\n    if ((this.opts.allocation ?? 'variance') === 'uniform') {\n      const per = Math.max(this.floorPerCell, Math.floor(budget / this.cells.length))\n      return this.cells.map((c) => ({ cellId: c.id, count: per }))\n    }\n    return varianceBasedCurriculum(\n      this.log.map((r) => ({\n        variantId: r.cell.id,\n        scenarioId: '*',\n        score: r.ev.score,\n      })),\n      this.cells.map((c) => ({ variantId: c.id, scenarioId: '*' })),\n      { budget, floorPerCell: this.floorPerCell },\n    ).map((a) => ({ cellId: a.variantId, count: a.count }))\n  }\n\n  private objectiveContext() {\n    const entries = [...this.archiveByBin.values()]\n    return {\n      archiveScores: entries.map((e) => e.evaluation.score),\n      archiveDescriptors: entries.map((e) => e.evaluation.descriptor),\n    }\n  }\n\n  /** Elites whose INPUT cell matches — what the proposer mutates/deepens from. */\n  private elitesFor(cellId: string): S[] {\n    const out: S[] = []\n    for (const e of this.archiveByBin.values()) if (e.cell.id === cellId) out.push(e.scenario)\n    return out\n  }\n\n  /** One allocate → propose → evaluate → gate → archive round. */\n  async step(): Promise<{ runs: number; findings: FuzzFinding<S>[] }> {\n    const remaining = this.opts.budget - this.runsUsed\n    if (remaining <= 0 || this.opts.signal?.aborted) return { runs: 0, findings: [] }\n\n    const allocations = this.allocate(Math.min(this.perRoundBudget, remaining))\n    const newFindings: FuzzFinding<S>[] = []\n    let runsThisStep = 0\n\n    for (const alloc of allocations) {\n      if (\n        this.runsUsed >= this.opts.budget ||\n        this.stoppedEarly !== undefined ||\n        this.opts.signal?.aborted\n      )\n        break\n      const cell = this.cellById.get(alloc.cellId)\n      if (!cell) continue\n      const cap = Math.min(alloc.count, this.opts.budget - this.runsUsed)\n      if (cap <= 0) continue\n      this.opts.onProgress?.({ type: 'cell-allocated', cell, count: cap })\n\n      const seeds = await this.opts.seedsFor(cell)\n      const elites = this.elitesFor(cell.id)\n      const proposed = await this.opts.proposer({\n        cell,\n        seeds,\n        elites,\n        findings: this._findings,\n        count: cap,\n        rng: this.rng,\n      })\n      // Cold cells evaluate their seeds first (the coverage floor); warm cells\n      // trust the proposer, which already saw the elites.\n      const cold = this.log.every((r) => r.cell.id !== cell.id)\n      const toEval = [...(cold ? seeds : []), ...proposed].slice(0, cap)\n\n      await pMap(\n        toEval,\n        async (scenario) => {\n          if (\n            this.runsUsed >= this.opts.budget ||\n            this.stoppedEarly !== undefined ||\n            this.opts.signal?.aborted\n          )\n            return\n          // evaluate/gates/minimize cross an external boundary (router, backend,\n          // judge). A throw there is an infra outcome: record it as a typed\n          // eval-error and keep exploring — one 5xx must not kill a campaign.\n          // Consecutive failures trip the circuit breaker instead, so a dead\n          // backend stops the run rather than burning the remaining budget.\n          try {\n            const startedAt = performance.now()\n            const paid = this.costLedger\n              ? await this.costLedger.runPaidCall({\n                  channel: 'agent',\n                  phase: this.costPhase,\n                  actor: 'fuzz.evaluate',\n                  tags: { target: this.opts.target, cell: cell.id },\n                  signal: this.opts.signal,\n                  maximumCharge: this.opts.maximumChargeOf?.(scenario, cell),\n                  execute: () => this.opts.evaluate(scenario, cell),\n                  receipt: (evaluation) => {\n                    const cost = this.opts.costOf!(scenario, cell, evaluation)\n                    if (cost === null) {\n                      return {\n                        model: 'unattributed',\n                        inputTokens: 0,\n                        outputTokens: 0,\n                        costUnknown: true,\n                      }\n                    }\n                    if (!Number.isFinite(cost.usd) || cost.usd < 0) {\n                      throw new RangeError(\n                        `BehaviorExplorer: costOf returned an invalid usd (${String(cost.usd)}) — ` +\n                          'return null when cost is unknown, never a fabricated number',\n                      )\n                    }\n                    return {\n                      model: cost.model ?? 'unattributed',\n                      inputTokens: 0,\n                      outputTokens: 0,\n                      actualCostUsd: cost.usd,\n                    }\n                  },\n                })\n              : undefined\n            if (paid && !paid.succeeded) {\n              if (\n                paid.error instanceof CostReceiptCaptureError &&\n                paid.error.receiptError instanceof RangeError\n              ) {\n                throw paid.error.receiptError\n              }\n              throw paid.error\n            }\n            const ev = paid ? paid.value : await this.opts.evaluate(scenario, cell)\n            // Consumer-measured latency wins (it can exclude judge time); the\n            // engine's wall-clock is the default so latency is never missing.\n            const latencyMs = ev.latencyMs ?? performance.now() - startedAt\n            this.runsUsed++\n            runsThisStep++\n            this.consecutiveEvalErrors = 0\n            const costUsd = paid\n              ? paid.receipt.costUnknown\n                ? null\n                : paid.receipt.costUsd\n              : undefined\n            if (paid?.receipt.actualCostUsd !== undefined) {\n              this.opts.onCost?.({ usd: paid.receipt.actualCostUsd, channel: 'agent' })\n            }\n            const interest = this.objective.interest(ev, this.objectiveContext())\n            this.log.push({\n              cell,\n              ev,\n              interest,\n              latencyMs,\n              ...(costUsd !== undefined ? { costUsd } : {}),\n              scenarioId: this.opts.scenarioId(scenario),\n            })\n            this.opts.onProgress?.({ type: 'evaluated', cell, scenario, evaluation: ev })\n\n            const bin = this.binId(cell, ev.descriptor)\n            const cur = this.archiveByBin.get(bin)\n            if (!cur || interest > cur.interest)\n              this.archiveByBin.set(bin, { binId: bin, cell, scenario, evaluation: ev, interest })\n\n            if (interest < this.threshold) return\n            this.candidateFindings++\n            if (this.opts.gates?.isValid && !(await this.opts.gates.isValid(scenario, ev, cell)))\n              return\n            if (\n              this.opts.gates?.isUncontaminated &&\n              !(await this.opts.gates.isUncontaminated(scenario, ev, cell))\n            )\n              return\n\n            const minimized = this.opts.minimize\n              ? await this.opts.minimize(scenario, this.opts.evaluate, cell)\n              : scenario\n            const finding: FuzzFinding<S> = {\n              id: this.opts.scenarioId(scenario),\n              cell,\n              scenario,\n              minimized,\n              text: this.opts.scenarioText?.(minimized),\n              evaluation: ev,\n              interest,\n              objective: this.objective.kind,\n            }\n            this._findings.push(finding)\n            newFindings.push(finding)\n            this.opts.onProgress?.({ type: 'finding', finding })\n          } catch (err) {\n            // Internal validation errors (e.g. a fabricated costOf number) are\n            // programming mistakes, not backend outcomes — they stay loud.\n            if (err instanceof RangeError) throw err\n            this.evalErrors++\n            this.consecutiveEvalErrors++\n            const message = err instanceof Error ? err.message : String(err)\n            this.opts.onProgress?.({\n              type: 'eval-error',\n              cell,\n              scenarioId: this.opts.scenarioId(scenario),\n              message,\n            })\n            const limit = this.opts.maxConsecutiveEvalErrors ?? 5\n            if (this.consecutiveEvalErrors >= limit) {\n              this.stoppedEarly = {\n                reason: 'eval-errors',\n                detail: `${this.consecutiveEvalErrors} consecutive eval errors (last: ${message})`,\n              }\n            }\n          }\n        },\n        this.opts.concurrency ?? 1,\n        this.opts.signal,\n      )\n    }\n\n    this.opts.onProgress?.({ type: 'round', runsUsed: this.runsUsed, budget: this.opts.budget })\n    return { runs: runsThisStep, findings: newFindings }\n  }\n\n  /** Loop `step()` until the run or dollar budget is spent, the signal aborts,\n   *  or no progress is made. */\n  async run(): Promise<CapsuleData<S>> {\n    while (\n      this.runsUsed < this.opts.budget &&\n      this.stoppedEarly === undefined &&\n      !this.opts.signal?.aborted\n    ) {\n      const { runs } = await this.step()\n      if (runs === 0 && this.stoppedEarly === undefined) break\n    }\n    return this.capsule()\n  }\n\n  coverage(): CoverageCell[] {\n    return this.capsule().coverage\n  }\n\n  findings(): FuzzFinding<S>[] {\n    return [...this._findings].sort((a, b) => b.interest - a.interest)\n  }\n\n  capsule(): CapsuleData<S> {\n    const cost = this.costLedger?.summary({\n      phase: this.costPhase,\n      tags: { target: this.opts.target },\n    })\n    return buildCapsule({\n      target: this.opts.target,\n      objective: this.objective.kind,\n      cells: this.cells,\n      log: this.log,\n      threshold: this.threshold,\n      archive: [...this.archiveByBin.values()],\n      findings: this._findings,\n      candidateFindings: this.candidateFindings,\n      runsUsed: this.runsUsed,\n      cost: cost\n        ? {\n            costUsd: cost.totalCostUsd,\n            costUnknownRuns: cost.byChannel.reduce((sum, row) => sum + row.unpricedCalls, 0),\n          }\n        : undefined,\n      evalErrors: this.evalErrors,\n      stoppedEarly: this.stoppedEarly,\n    })\n  }\n}\n","/**\n * `fuzzAgent` — the adversarial batch preset over `BehaviorExplorer`.\n *\n * One call: explore the space to budget with the adversarial objective and\n * return the capsule. For agent-driven, incremental, or multi-objective use,\n * construct a `BehaviorExplorer` and drive it via `makeExploreTools`.\n */\n\nimport { BehaviorExplorer } from './explorer'\nimport { adversarialObjective } from './policies'\nimport type { CapsuleData, ExploreOptions } from './types'\n\nexport type FuzzAgentOptions<S> = Omit<ExploreOptions<S>, 'objective'> & {\n  /** Score strictly below this is a candidate failure. Default 0.5. */\n  failureThreshold?: number\n}\n\nexport async function fuzzAgent<S>(\n  opts: FuzzAgentOptions<S>,\n): Promise<{ capsule: CapsuleData<S> }> {\n  const { failureThreshold, ...rest } = opts\n  const explorer = new BehaviorExplorer<S>({\n    ...rest,\n    objective: adversarialObjective(failureThreshold ?? 0.5),\n  })\n  return { capsule: await explorer.run() }\n}\n","/**\n * Validity gates — what separates a fuzzer from a slop generator.\n *\n * A notable candidate is admitted only when it is fair and reproducible. None of\n * these are on by default: the live wiring opts in, so reported findings carry\n * their proof.\n */\n\nimport type { Cell, Evaluation, Evaluator, ValidityGates } from './types'\n\n/** Combine gate sets; a candidate must pass every gate in every set. */\nexport function composeGates<S>(...sets: Array<ValidityGates<S> | undefined>): ValidityGates<S> {\n  const present = sets.filter((s): s is ValidityGates<S> => s != null)\n  return {\n    isValid: async (scenario, ev, cell) => {\n      for (const g of present) {\n        if (g.isValid && !(await g.isValid(scenario, ev, cell))) return false\n      }\n      return true\n    },\n    isUncontaminated: async (scenario, ev, cell) => {\n      for (const g of present) {\n        if (g.isUncontaminated && !(await g.isUncontaminated(scenario, ev, cell))) return false\n      }\n      return true\n    },\n  }\n}\n\n/**\n * Reproducibility gate. Re-run the target on a meaning-preserving rephrase of the\n * flagged scenario; keep the finding only when the rephrase ALSO scores below the\n * threshold. A finding that flips under a cosmetic rewrite was keyed to surface\n * form, not the task — a false signal we must not report. Costs one extra\n * evaluation per candidate (candidates are rare, so cheap).\n */\nexport function perturbationStabilityGate<S>(opts: {\n  evaluate: Evaluator<S>\n  /** Produce a semantic-preserving rephrase. Return null to skip (treated as pass). */\n  perturb: (scenario: S) => S | null\n  /** Score strictly below this still counts as failing. Default 0.5. */\n  failureThreshold?: number\n}): ValidityGates<S> {\n  const threshold = opts.failureThreshold ?? 0.5\n  return {\n    isUncontaminated: async (scenario: S, _ev: Evaluation, cell: Cell) => {\n      const rephrased = opts.perturb(scenario)\n      if (rephrased == null) return true\n      const re = await opts.evaluate(rephrased, cell)\n      return re.score < threshold\n    },\n  }\n}\n\n/**\n * Severity-floor gate. Reject borderline candidates whose score sits in a band\n * just under the threshold — judge noise, not a real defect.\n */\nexport function severityFloorGate<S>(opts: {\n  failureThreshold?: number\n  margin?: number\n}): ValidityGates<S> {\n  const threshold = opts.failureThreshold ?? 0.5\n  const margin = opts.margin ?? 0.1\n  return {\n    isValid: (_scenario, ev: Evaluation) => ev.score <= threshold - margin,\n  }\n}\n"],"mappings":";;;;;AA2BA,SAAgB,eAAe,OAA8B;CAC3D,IAAI,MAAM,KAAK,WAAW,GAAG,OAAO,CAAC;CACrC,IAAI,WAA0C,CAAC,CAAC,CAAC;CACjD,KAAK,MAAM,QAAQ,MAAM,MAAM;EAC7B,MAAM,OAAsC,CAAC;EAC7C,KAAK,MAAM,WAAW,UACpB,KAAK,MAAM,SAAS,KAAK,QAAQ,KAAK,KAAK;GAAE,GAAG;IAAU,KAAK,OAAO;EAAM,CAAC;EAE/E,WAAW;CACb;CACA,OAAO,SAAS,KAAK,YAAY;EAAE,IAAI,OAAO,OAAO,MAAM;EAAG;CAAO,EAAE;AACzE;;AAGA,SAAgB,OAAO,OAAsB,QAAwC;CACnF,OAAO,MAAM,KAAK,KAAK,MAAM,GAAG,EAAE,KAAK,GAAG,OAAO,EAAE,OAAO,CAAC,CAAC,KAAK,GAAG;AACtE;;AAGA,SAAS,WAAW,QAAkB,GAAmB;CAEvD,OAAO,OADK,KAAK,IAAI,OAAO,SAAS,GAAG,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,OAAO,MAAM,IAAI,CAAC,CACpE;AAClB;;;AAIA,SAAgB,aAAa,QAAgC;CAC3D,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,MAAM,wEAAwE;CAC1F,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAE/C,OAAO;EACL,MAFW,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;EAGtD,QAAQ,WAAW,QAAQ,EAAG;EAC9B,KAAK,WAAW,QAAQ,EAAG;EAC3B,KAAK,OAAO;EACZ,KAAK,OAAO,OAAO,SAAS;EAC5B,GAAG,OAAO;CACZ;AACF;;;;;AAMA,SAAgB,cAAc,OAAe,KAAmB,WAAmC;CACjG,MAAM,yBAAS,IAAI,IAA0B;CAC7C,KAAK,MAAM,KAAK,KAAK;EACnB,MAAM,MAAM,OAAO,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EACtC,IAAI,KAAK,CAAC;EACV,OAAO,IAAI,EAAE,KAAK,IAAI,GAAG;CAC3B;CACA,OAAO,MAAM,KAAK,SAAS;EACzB,MAAM,OAAO,OAAO,IAAI,KAAK,EAAE,KAAK,CAAC;EACrC,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,GACX,OAAO;GAAE;GAAM,MAAM;GAAG,OAAO;GAAM,aAAa;GAAG,YAAY,CAAC;GAAG,WAAW;EAAK;EAEvF,MAAM,QAAQ,aAAa,KAAK,KAAK,MAAM,EAAE,GAAG,KAAK,CAAC;EACtD,MAAM,YAAY,aAAa,KAAK,KAAK,MAAM,EAAE,SAAS,CAAC;EAC3D,MAAM,cAAc,KAAK,QAAQ,MAAM,EAAE,YAAY,SAAS,CAAC,CAAC,SAAS;EAEzE,MAAM,aAAuC,CAAC;EAC9C,KAAK,MAAM,KAAK,MACd,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG;GACtD,MAAM,UAAU,WAAW,MAAM,CAAC;GAClC,QAAQ,KAAK,CAAC;GACd,WAAW,KAAK;EAClB;EAEF,MAAM,aAA2C,CAAC;EAClD,KAAK,MAAM,CAAC,GAAG,OAAO,OAAO,QAAQ,UAAU,GAAG,WAAW,KAAK,aAAa,EAAE;EAIjF,MAAM,UAAU,KAAK,QAAQ,MAAM,EAAE,YAAY,KAAA,CAAS;EAC1D,MAAM,QAAQ,QAAQ,QAAQ,MAAM,EAAE,YAAY,IAAI;EAWtD,OAAO;GAAE;GAAM;GAAM;GAAO;GAAa;GAAY;GAAW,GAT9D,QAAQ,SAAS,IACb;IACE,SAAS,MAAM,QAAQ,GAAG,MAAM,IAAK,EAAE,SAAoB,CAAC;IAC5D,GAAI,QAAQ,SAAS,MAAM,SACvB,EAAE,iBAAiB,QAAQ,SAAS,MAAM,OAAO,IACjD,CAAC;GACP,IACA,CAAC;EAEiE;CAC1E,CAAC;AACH;;;AClFA,SAAgB,aAAgB,OAA6C;CAC3E,MAAM,WAAW,cAAc,MAAM,OAAO,MAAM,KAAK,MAAM,SAAS;CACtE,MAAM,UAAU,SAAS,QAAQ,MAAM,EAAE,OAAO,CAAC;CAGjD,MAAM,aACJ,QAAQ,WAAW,IAAI,OAAO,aAAa,QAAQ,KAAK,MAAO,EAAE,MAAuB,IAAI,CAAC;CAC/F,MAAM,YAAY,MAAM,IAAI,WAAW,IAAI,OAAO,aAAa,MAAM,IAAI,KAAK,MAAM,EAAE,SAAS,CAAC;CAEhG,MAAM,uBAAuB,MAAM,QAAQ,QAAQ,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;CAEhF,OAAO;EACL,QAAQ,MAAM;EACd,WAAW,MAAM;EACjB;EACA,UAAU,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;EACpE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;EAClE,OAAO;GACL,WAAW,MAAM;GACjB,YAAY,MAAM,MAAM;GACxB,cAAc,QAAQ;GACtB;GACA,mBAAmB,MAAM;GACzB,kBAAkB,MAAM,SAAS;GACjC;GACA;GACA,GAAI,MAAM,OACN;IAAE,SAAS,MAAM,KAAK;IAAS,iBAAiB,MAAM,KAAK;GAAgB,IAC3E,CAAC;GACL,YAAY,MAAM;GAClB,GAAI,MAAM,eAAe,EAAE,cAAc,MAAM,aAAa,IAAI,CAAC;EACnE;CACF;AACF;AAIA,SAAS,IAAI,GAAmB;CAC9B,OAAO,EAAE,QACP,YACC,OAAO;EAAE,KAAK;EAAS,KAAK;EAAQ,KAAK;EAAQ,MAAK;CAAS,EAAA,CAAG,EACrE;AACF;;AAGA,SAAS,gBAAgB,GAA0B;CACjD,IAAI,KAAK,MAAM,OAAO;CACtB,OAAO,OAAO,KAAK,MAAM,IAAI,GAAG,EAAE;AACpC;AAEA,SAAS,IAAI,GAAmB;CAC9B,OAAO,GAAG,KAAK,MAAM,IAAI,GAAG,EAAE;AAChC;AAEA,SAAS,WAAW,UAAqE;CACvF,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAyB;CAC1C,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,KAAK,MAAM,GAAG;EAClD,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG;GAChB,KAAK,IAAI,mBAAG,IAAI,IAAI,CAAC;GACrB,MAAM,KAAK,CAAC;EACd;EACA,KAAK,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC;CACpB;CAEF,OAAO,MAAM,KAAK,UAAU;EAAE;EAAM,QAAQ,CAAC,GAAI,KAAK,IAAI,IAAI,KAAK,CAAC,CAAE;CAAE,EAAE;AAC5E;;AAGA,SAAS,WAAW,GAAyB;CAC3C,MAAM,UAAU,OAAO,QAAQ,EAAE,UAAU,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAqB;CAC5F,IAAI,QAAQ,WAAW,GAAG,OAAO;CAEjC,MAAM,IADS,QAAQ,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAChC,CAAC,CAAC;CACjB,IAAI,CAAC,GAAG,OAAO;CACf,OAAO,qBAAqB,IAAI,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE;AACrD;AAEA,SAAS,YAAY,UAAkC;CACrD,MAAM,OAAO,WAAW,QAAQ;CAChC,MAAM,OAAO,IAAI,IAAI,SAAS,KAAK,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,QAAQ,GAA6B,UAA0B;EACnE,MAAM,IAAI,GAAG,OAAO,QAAQ;EAC5B,MAAM,QAAQ,GAAG,QACb,GAAG,IAAI,EAAE,MAAM,IAAI,EAAE,kBAAkB,IAAI,EAAE,MAAM,MAAM,EAAE,QAAQ,IAAI,EAAE,MAAM,GAAG,EAAE,MAAM,EAAE,KAAK,UAAU,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,OAAO,EAAE,UAAU,SAAS,IAAA,CAAM,QAAQ,CAAC,EAAE,YAAY,KAAK,EAAE,YAAY,KAAA,IAAY,OAAO,EAAE,QAAQ,QAAQ,CAAC,MAAM,OAC9Q;EACJ,OAAO,uCAAuC,gBAAgB,CAAC,EAAE,WAAW,IAAI,KAAK,EAAE,IAAI,QAAQ,oBAAoB,IAAI,KAAK,EAAE,WAAW,GAAG,mBAAmB,KAAK,KAAK,OAAO,IAAI,CAAC,IAAI,IAAI,SAAS,IAAI,WAAW,CAAC,IAAI,GAAG;CACnO;CAEA,MAAM,UAAU,KAAK;CACrB,MAAM,UAAU,KAAK;CACrB,IAAI,KAAK,WAAW,KAAK,WAAW,SAAS;EAC3C,MAAM,OAAO,gBAAgB,QAAQ,OAAO,KAAK,MAAM,OAAO,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;EACtF,MAAM,OAAO,QAAQ,OAClB,KAAK,OAAO;GACX,MAAM,QAAQ,QAAQ,OACnB,KAAK,OAAO;IACX,MAAM,KAAK,GAAG,QAAQ,KAAK,GAAG,GAAG,GAAG,QAAQ,KAAK,GAAG;IACpD,OAAO,OAAO,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE;GACvC,CAAC,CAAC,CACD,KAAK,EAAE;GACV,OAAO,sBAAsB,IAAI,EAAE,EAAE,OAAO,MAAM;EACpD,CAAC,CAAC,CACD,KAAK,EAAE;EACV,OAAO,oCAAoC,IAAI,QAAQ,IAAI,EAAE,kBAAkB,IAAI,QAAQ,IAAI,EAAE,gCAAgC,OAAO,KAAK;CAC/I;CAGA,OAAO,qBADQ,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE,OAAO,QAAQ,MAAM,EAAE,OAAO,QAAQ,EACpD,CAAC,CAAC,KAAK,MAAM,KAAK,GAAG,OAAO,OAAO,EAAE,KAAK,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;AAC5G;AAEA,SAAS,aAAgB,UAA4B,OAAuB;CAC1E,IAAI,SAAS,WAAW,GACtB,OAAO;CACT,OAAO,SACJ,MAAM,GAAG,KAAK,CAAC,CACf,KAAK,MAAM;EACV,MAAM,SAAS,OAAO,QAAQ,EAAE,KAAK,MAAM,CAAC,CACzC,KAAK,CAAC,GAAG,OAAO,GAAG,EAAE,GAAG,GAAG,CAAC,CAC5B,KAAK,KAAK;EACb,MAAM,UAAU,EAAE,WAAW,UAAU,CAAC,EAAA,CACrC,KAAK,MAAM,wBAAwB,IAAI,CAAC,EAAE,QAAQ,CAAC,CACnD,KAAK,EAAE;EACV,MAAM,OAAO,OAAO,QAAQ,EAAE,WAAW,UAAU,CAAC,CAAC,CAAC,CACnD,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAC3B,MAAM,GAAG,CAAC,CAAC,CACX,KAAK,CAAC,GAAG,OAAO,qBAAqB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,QAAQ,CAAC,CAC/D,KAAK,EAAE;EACV,OAAO,4DAA4D,IAAI,MAAM,EAAE,SAAS,OAAO,8BAA8B,IAAI,EAAE,QAAQ,EAAE,qEAAqE,IAAI,EAAE,QAAQ,EAAE,mCAAmC,IAAI,EAAE,QAAQ,8BAA8B,EAAE,QAAQ,OAAO,sBAAsB,KAAK,UAAU,GAAG;CAC5W,CAAC,CAAC,CACD,KAAK,EAAE;AACZ;;AAUA,SAAgB,kBACd,SACA,OAA6B,CAAC,GACtB;CACR,MAAM,IAAI,QAAQ;CAClB,MAAM,OAAO,OAAe,OAAe,SAAS,cAClD,iDAAiD,OAAO,IAAI,IAAI,KAAK,EAAE,wBAAwB,IAAI,KAAK,EAAE;CAC5G,MAAM,OAAO,QAAQ,OACjB,IACE,kBACA,GAAG,QAAQ,KAAK,OAAO,QAAQ,CAAC,EAAE,KAAK,QAAQ,KAAK,MAAM,QAAQ,CAAC,KACnE,SACF,IACA;CAGJ,MAAM,OACJ,EAAE,YAAY,KAAA,IACV,IACE,EAAE,kBAAkB,UAAU,EAAE,gBAAgB,kBAAkB,QAClE,IAAI,EAAE,QAAQ,QAAQ,CAAC,KACvB,EAAE,kBAAkB,YAAY,SAClC,IACA;CACN,MAAM,QAAQ,KAAK,eAAe,QAAQ,eAAe;CAEzD,OAAO;SACA,IAAI,QAAQ,SAAS,EAAE,aAAa,IAAI,QAAQ,MAAM,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MAoC3D,IAAI,QAAQ,SAAS,EAAE,iBAAiB,IAAI,QAAQ,MAAM,EAAE;mBAC/C,EAAE,UAAU,oBAAoB,EAAE,aAAa,GAAG,EAAE,WAAW,gBAAgB,EAAE,uBAAuB,IAAI,MAAM,EAAE,qBAAqB,2BAA2B,KAAK,QAAQ,MAAM,IAAI,KAAK,MAAM,GAAG;;EAE1N,EAAE,aAAa,IAAI,cAAc,GAAG,IAAI,EAAE,WAAW,IAAI,KAAK,EAAE,WAAW,OAAO,KAAM,YAAY,SAAS,IAAI,GAAG;EACpH,EAAE,aAAa,IAAI,eAAe,GAAG,IAAI,EAAE,WAAW,GAAG,EAAE,GAAG,IAAI,EAAE,WAAW,GAAG,GAAG,IAAI,GAAG;EAC5F,EAAE,YAAY,IAAI,kBAAkB,IAAI,EAAE,UAAU,SAAS,IAAA,CAAM,QAAQ,CAAC,EAAE,IAAI,EAAE,UAAU,MAAM,IAAI,EAAE,UAAU,SAAS,YAAY,SAAS,IAAI,GAAG;EACzJ,IAAI,qBAAqB,OAAO,EAAE,gBAAgB,GAAG,EAAE,mBAAmB,IAAI,YAAY,SAAS,EAAE;EACrG,IAAI,iBAAiB,GAAG,EAAE,aAAa,GAAG,EAAE,YAAY,EAAE;EAC1D,IAAI,iBAAiB,OAAO,EAAE,SAAS,CAAC,EAAE;EAC1C,KAAK;EACL,EAAE,aAAa,IAAI,IAAI,eAAe,OAAO,EAAE,UAAU,GAAG,SAAS,IAAI,GAAG;EAC5E,KAAK;;EAEL,EAAE,eAAe,yDAAyD,IAAI,EAAE,aAAa,MAAM,EAAE,+DAA+D,GAAG;;EAEvK,YAAY,QAAQ,QAAQ,EAAE;uBACT,EAAE,oBAAoB,EAAE,mBAAmB,MAAM,EAAE,iBAAiB,MAAM,EAAE,kBAAkB,yCAAyC,GAAG;EAC/J,aAAa,QAAQ,UAAU,KAAK,eAAe,CAAC,EAAE;;;AAGxD;;;;;;;;;;AC5MA,SAAgB,wBACd,cACA,gBACA,MACwB;CACxB,MAAM,gBAAgB,KAAK,iBAAiB;CAC5C,MAAM,QAAQ,KAAK,gBAAgB;CACnC,MAAM,SAAS,KAAK;CAEpB,MAAM,0BAAU,IAAI,IAAsB;CAC1C,KAAK,MAAM,KAAK,cAAc;EAC5B,MAAM,IAAI,GAAG,EAAE,UAAU,IAAI,EAAE;EAC/B,MAAM,MAAM,QAAQ,IAAI,CAAC,KAAK,CAAC;EAC/B,IAAI,KAAK,EAAE,KAAK;EAChB,QAAQ,IAAI,GAAG,GAAG;CACpB;CAEA,MAAM,YAAY,eAAe,KAAK,MAAM;EAC1C,MAAM,IAAI,GAAG,EAAE,UAAU,IAAI,EAAE;EAC/B,MAAM,UAAU,QAAQ,IAAI,CAAC,KAAK,CAAC;EACnC,MAAM,IAAI,QAAQ;EAClB,MAAM,OAAO,MAAM,IAAI,KAAM,QAAQ,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAClE,MAAM,WACJ,IAAI,IACA,gBACA,QAAQ,QAAQ,GAAG,MAAM,KAAK,IAAI,SAAS,GAAG,CAAC,KAAK,IAAI,KAAK;EAGnE,MAAM,SAAS,KAAK,KAAK,QAAQ,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;EACjE,OAAO;GAAE,WAAW,EAAE;GAAW,YAAY,EAAE;GAAY;GAAG;GAAM;GAAU;EAAO;CACvF,CAAC;CAGD,MAAM,aAAa,QAAQ,UAAU;CACrC,IAAI,cAAc,QAAQ;EACxB,MAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,KAAK,IAAI,GAAG,UAAU,MAAM,CAAC,CAAC;EAC3E,OAAO,UAAU,KAAK,OAAO;GAC3B,WAAW,EAAE;GACb,YAAY,EAAE;GACd,OAAO;GACP,QAAQ,qCAAqC,EAAE,EAAE;EACnD,EAAE;CACJ;CACA,MAAM,YAAY,SAAS;CAC3B,MAAM,cAAc,UAAU,QAAQ,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;CAC9D,OAAO,UAAU,KAAK,MAAM;EAC1B,MAAM,eAAe,gBAAgB,IAAI,IAAI,KAAK,MAAO,EAAE,SAAS,cAAe,SAAS;EAC5F,OAAO;GACL,WAAW,EAAE;GACb,YAAY,EAAE;GACd,OAAO,QAAQ;GACf,QAAQ,YAAY,EAAE,SAAS,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,KAAK,QAAQ,CAAC,EAAE;EACjF;CACF,CAAC;AACH;;;AC5FA,MAAM,WAAW,MAAsB,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;;;;;;AASjE,SAAgB,iBAAoB,MAGZ;CACtB,OAAO,OAAO,QAA6C;EACzD,MAAM,YAAY,KAAK,aAAa,IAAI,IAAI;EAC5C,MAAM,UAAU,CAAC,GAAG,IAAI,QAAQ,GAAG,IAAI,KAAK;EAC5C,MAAM,OAAO,IAAI,IAAI,QAAQ,IAAI,KAAK,UAAU,CAAC;EACjD,MAAM,MAAW,CAAC;EAClB,KAAK,MAAM,UAAU,SAAS;GAC5B,IAAI,IAAI,UAAU,IAAI,OAAO;GAC7B,KAAK,MAAM,KAAK,WAAW;IACzB,MAAM,WAAW,MAAM,EAAE,OAAO,QAAQ,IAAI,GAAG;IAC/C,KAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,KAAK,KAAK,WAAW,KAAK;KAChC,IAAI,KAAK,IAAI,EAAE,GAAG;KAClB,KAAK,IAAI,EAAE;KACX,IAAI,KAAK,KAAK;KACd,IAAI,IAAI,UAAU,IAAI,OAAO;IAC/B;IACA,IAAI,IAAI,UAAU,IAAI,OAAO;GAC/B;EACF;EACA,OAAO;CACT;AACF;;AAKA,SAAgB,qBAAqB,YAAY,IAAoB;CACnE,OAAO;EAAE,MAAM;EAAe;EAAW,WAAW,OAAO,QAAQ,IAAI,GAAG,KAAK;CAAE;AACnF;;;;;;;;;;;;;;;;;ACzBA,eAAe,KACb,OACA,IACA,aACA,QACe;CACf,IAAI,IAAI;CACR,MAAM,UAAU,MAAM,KACpB,EAAE,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,aAAa,MAAM,MAAM,CAAC,EAAE,GAC3D,YAAY;EACV,OAAO,IAAI,MAAM,QAAQ;GACvB,IAAI,QAAQ,SAAS;GACrB,MAAM,OAAO,MAAM;GACnB,IAAI,SAAS,KAAA,GAAW;GACxB,MAAM,GAAG,IAAI;EACf;CACF,CACF;CACA,MAAM,QAAQ,IAAI,OAAO;AAC3B;AAEA,IAAa,mBAAb,MAAiC;CAsBF;CArB7B;CACA;CACA;CACA;CACA;CACA;;CAGA,MAAmE,CAAC;;CAEpE,+BAAgC,IAAI,IAA6B;CACjE,YAA+C,CAAC;CAChD,WAAmB;CACnB,oBAA4B;CAC5B,aAAqB;CACrB,wBAAgC;CAChC;CACA;CACA;CACA,YAA6B;CAE7B,YAAY,MAA0C;EAAzB,KAAA,OAAA;EAC3B,KAAK,QAAQ,eAAe,KAAK,KAAK;EACtC,IAAI,KAAK,MAAM,WAAW,GACxB,MAAM,IAAI,MAAM,kEAAkE;EACpF,IAAI,KAAK,kBAAkB,KAAA,GAEvB;OAAA,OAAO,KAAK,kBAAkB,YAC9B,CAAC,OAAO,SAAS,KAAK,aAAa,KACnC,KAAK,gBAAgB,GAErB,MAAM,IAAI,WACR,4EAA4E,OAAO,KAAK,aAAa,GACvG;EAAA;EAGJ,IAAI,CAAC,KAAK,WAAW,KAAK,kBAAkB,KAAA,KAAa,KAAK,UAAU,KAAK,SAC3E,MAAM,IAAI,gBACR,qJAEF;EAEF,KACG,KAAK,kBAAkB,KAAA,KAAa,KAAK,QAAQ,mBAAmB,KAAA,MACrE,CAAC,KAAK,iBAEN,MAAM,IAAI,gBACR,mFACF;EAEF,IACE,KAAK,UACL,KAAK,kBAAkB,KAAA,KACvB,KAAK,OAAO,mBAAmB,KAAK,eAEpC,MAAM,IAAI,gBACR,4EACF;EAEF,IAAI,KAAK,QAAQ,KAAK,aAAa,KAAK,UAAU,IAAI,WAAW,KAAK,aAAa;EACnF,KAAK,WAAW,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;EACxD,KAAK,YAAY,KAAK,aAAa,qBAAqB,EAAG;EAC3D,KAAK,YAAY,KAAK,UAAU,aAAa;EAC7C,KAAK,eAAe,KAAK,gBAAgB;EACzC,KAAK,iBAAiB,KAAK,IACzB,KAAK,MAAM,SAAS,KAAK,cACzB,KAAK,KAAK,KAAK,SAAS,CAAC,CAC3B;EACA,KAAK,MAAM,WAAW,KAAK,QAAQ,CAAC;CACtC;CAEA,MAAc,MAAY,YAAwD;EAChF,IAAI,CAAC,cAAc,OAAO,KAAK,UAAU,CAAC,CAAC,WAAW,GAAG,OAAO,KAAK;EACrE,MAAM,WAAW,OAAO,KAAK,UAAU,CAAC,CACrC,KAAK,CAAC,CACN,KAAK,MAAM,GAAG,EAAE,GAAG,WAAW,IAAI,CAAC,CACnC,KAAK,GAAG;EACX,OAAO,GAAG,KAAK,GAAG,GAAG;CACvB;CAEA,SAAiB,QAA0D;EACzE,KAAK,KAAK,KAAK,cAAc,gBAAgB,WAAW;GACtD,MAAM,MAAM,KAAK,IAAI,KAAK,cAAc,KAAK,MAAM,SAAS,KAAK,MAAM,MAAM,CAAC;GAC9E,OAAO,KAAK,MAAM,KAAK,OAAO;IAAE,QAAQ,EAAE;IAAI,OAAO;GAAI,EAAE;EAC7D;EACA,OAAO,wBACL,KAAK,IAAI,KAAK,OAAO;GACnB,WAAW,EAAE,KAAK;GAClB,YAAY;GACZ,OAAO,EAAE,GAAG;EACd,EAAE,GACF,KAAK,MAAM,KAAK,OAAO;GAAE,WAAW,EAAE;GAAI,YAAY;EAAI,EAAE,GAC5D;GAAE;GAAQ,cAAc,KAAK;EAAa,CAC5C,CAAC,CAAC,KAAK,OAAO;GAAE,QAAQ,EAAE;GAAW,OAAO,EAAE;EAAM,EAAE;CACxD;CAEA,mBAA2B;EACzB,MAAM,UAAU,CAAC,GAAG,KAAK,aAAa,OAAO,CAAC;EAC9C,OAAO;GACL,eAAe,QAAQ,KAAK,MAAM,EAAE,WAAW,KAAK;GACpD,oBAAoB,QAAQ,KAAK,MAAM,EAAE,WAAW,UAAU;EAChE;CACF;;CAGA,UAAkB,QAAqB;EACrC,MAAM,MAAW,CAAC;EAClB,KAAK,MAAM,KAAK,KAAK,aAAa,OAAO,GAAG,IAAI,EAAE,KAAK,OAAO,QAAQ,IAAI,KAAK,EAAE,QAAQ;EACzF,OAAO;CACT;;CAGA,MAAM,OAA8D;EAClE,MAAM,YAAY,KAAK,KAAK,SAAS,KAAK;EAC1C,IAAI,aAAa,KAAK,KAAK,KAAK,QAAQ,SAAS,OAAO;GAAE,MAAM;GAAG,UAAU,CAAC;EAAE;EAEhF,MAAM,cAAc,KAAK,SAAS,KAAK,IAAI,KAAK,gBAAgB,SAAS,CAAC;EAC1E,MAAM,cAAgC,CAAC;EACvC,IAAI,eAAe;EAEnB,KAAK,MAAM,SAAS,aAAa;GAC/B,IACE,KAAK,YAAY,KAAK,KAAK,UAC3B,KAAK,iBAAiB,KAAA,KACtB,KAAK,KAAK,QAAQ,SAElB;GACF,MAAM,OAAO,KAAK,SAAS,IAAI,MAAM,MAAM;GAC3C,IAAI,CAAC,MAAM;GACX,MAAM,MAAM,KAAK,IAAI,MAAM,OAAO,KAAK,KAAK,SAAS,KAAK,QAAQ;GAClE,IAAI,OAAO,GAAG;GACd,KAAK,KAAK,aAAa;IAAE,MAAM;IAAkB;IAAM,OAAO;GAAI,CAAC;GAEnE,MAAM,QAAQ,MAAM,KAAK,KAAK,SAAS,IAAI;GAC3C,MAAM,SAAS,KAAK,UAAU,KAAK,EAAE;GACrC,MAAM,WAAW,MAAM,KAAK,KAAK,SAAS;IACxC;IACA;IACA;IACA,UAAU,KAAK;IACf,OAAO;IACP,KAAK,KAAK;GACZ,CAAC;GAMD,MAAM,KAFS,CAAC,GADH,KAAK,IAAI,OAAO,MAAM,EAAE,KAAK,OAAO,KAAK,EAC/B,IAAI,QAAQ,CAAC,GAAI,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,GAGvD,GACL,OAAO,aAAa;IAClB,IACE,KAAK,YAAY,KAAK,KAAK,UAC3B,KAAK,iBAAiB,KAAA,KACtB,KAAK,KAAK,QAAQ,SAElB;IAMF,IAAI;KACF,MAAM,YAAY,YAAY,IAAI;KAClC,MAAM,OAAO,KAAK,aACd,MAAM,KAAK,WAAW,YAAY;MAChC,SAAS;MACT,OAAO,KAAK;MACZ,OAAO;MACP,MAAM;OAAE,QAAQ,KAAK,KAAK;OAAQ,MAAM,KAAK;MAAG;MAChD,QAAQ,KAAK,KAAK;MAClB,eAAe,KAAK,KAAK,kBAAkB,UAAU,IAAI;MACzD,eAAe,KAAK,KAAK,SAAS,UAAU,IAAI;MAChD,UAAU,eAAe;OACvB,MAAM,OAAO,KAAK,KAAK,OAAQ,UAAU,MAAM,UAAU;OACzD,IAAI,SAAS,MACX,OAAO;QACL,OAAO;QACP,aAAa;QACb,cAAc;QACd,aAAa;OACf;OAEF,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,KAAK,KAAK,MAAM,GAC3C,MAAM,IAAI,WACR,qDAAqD,OAAO,KAAK,GAAG,EAAE,gEAExE;OAEF,OAAO;QACL,OAAO,KAAK,SAAS;QACrB,aAAa;QACb,cAAc;QACd,eAAe,KAAK;OACtB;MACF;KACF,CAAC,IACD,KAAA;KACJ,IAAI,QAAQ,CAAC,KAAK,WAAW;MAC3B,IACE,KAAK,iBAAiB,2BACtB,KAAK,MAAM,wBAAwB,YAEnC,MAAM,KAAK,MAAM;MAEnB,MAAM,KAAK;KACb;KACA,MAAM,KAAK,OAAO,KAAK,QAAQ,MAAM,KAAK,KAAK,SAAS,UAAU,IAAI;KAGtE,MAAM,YAAY,GAAG,aAAa,YAAY,IAAI,IAAI;KACtD,KAAK;KACL;KACA,KAAK,wBAAwB;KAC7B,MAAM,UAAU,OACZ,KAAK,QAAQ,cACX,OACA,KAAK,QAAQ,UACf,KAAA;KACJ,IAAI,MAAM,QAAQ,kBAAkB,KAAA,GAClC,KAAK,KAAK,SAAS;MAAE,KAAK,KAAK,QAAQ;MAAe,SAAS;KAAQ,CAAC;KAE1E,MAAM,WAAW,KAAK,UAAU,SAAS,IAAI,KAAK,iBAAiB,CAAC;KACpE,KAAK,IAAI,KAAK;MACZ;MACA;MACA;MACA;MACA,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;MAC3C,YAAY,KAAK,KAAK,WAAW,QAAQ;KAC3C,CAAC;KACD,KAAK,KAAK,aAAa;MAAE,MAAM;MAAa;MAAM;MAAU,YAAY;KAAG,CAAC;KAE5E,MAAM,MAAM,KAAK,MAAM,MAAM,GAAG,UAAU;KAC1C,MAAM,MAAM,KAAK,aAAa,IAAI,GAAG;KACrC,IAAI,CAAC,OAAO,WAAW,IAAI,UACzB,KAAK,aAAa,IAAI,KAAK;MAAE,OAAO;MAAK;MAAM;MAAU,YAAY;MAAI;KAAS,CAAC;KAErF,IAAI,WAAW,KAAK,WAAW;KAC/B,KAAK;KACL,IAAI,KAAK,KAAK,OAAO,WAAW,CAAE,MAAM,KAAK,KAAK,MAAM,QAAQ,UAAU,IAAI,IAAI,GAChF;KACF,IACE,KAAK,KAAK,OAAO,oBACjB,CAAE,MAAM,KAAK,KAAK,MAAM,iBAAiB,UAAU,IAAI,IAAI,GAE3D;KAEF,MAAM,YAAY,KAAK,KAAK,WACxB,MAAM,KAAK,KAAK,SAAS,UAAU,KAAK,KAAK,UAAU,IAAI,IAC3D;KACJ,MAAM,UAA0B;MAC9B,IAAI,KAAK,KAAK,WAAW,QAAQ;MACjC;MACA;MACA;MACA,MAAM,KAAK,KAAK,eAAe,SAAS;MACxC,YAAY;MACZ;MACA,WAAW,KAAK,UAAU;KAC5B;KACA,KAAK,UAAU,KAAK,OAAO;KAC3B,YAAY,KAAK,OAAO;KACxB,KAAK,KAAK,aAAa;MAAE,MAAM;MAAW;KAAQ,CAAC;IACrD,SAAS,KAAK;KAGZ,IAAI,eAAe,YAAY,MAAM;KACrC,KAAK;KACL,KAAK;KACL,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;KAC/D,KAAK,KAAK,aAAa;MACrB,MAAM;MACN;MACA,YAAY,KAAK,KAAK,WAAW,QAAQ;MACzC;KACF,CAAC;KACD,MAAM,QAAQ,KAAK,KAAK,4BAA4B;KACpD,IAAI,KAAK,yBAAyB,OAChC,KAAK,eAAe;MAClB,QAAQ;MACR,QAAQ,GAAG,KAAK,sBAAsB,kCAAkC,QAAQ;KAClF;IAEJ;GACF,GACA,KAAK,KAAK,eAAe,GACzB,KAAK,KAAK,MACZ;EACF;EAEA,KAAK,KAAK,aAAa;GAAE,MAAM;GAAS,UAAU,KAAK;GAAU,QAAQ,KAAK,KAAK;EAAO,CAAC;EAC3F,OAAO;GAAE,MAAM;GAAc,UAAU;EAAY;CACrD;;;CAIA,MAAM,MAA+B;EACnC,OACE,KAAK,WAAW,KAAK,KAAK,UAC1B,KAAK,iBAAiB,KAAA,KACtB,CAAC,KAAK,KAAK,QAAQ,SACnB;GACA,MAAM,EAAE,SAAS,MAAM,KAAK,KAAK;GACjC,IAAI,SAAS,KAAK,KAAK,iBAAiB,KAAA,GAAW;EACrD;EACA,OAAO,KAAK,QAAQ;CACtB;CAEA,WAA2B;EACzB,OAAO,KAAK,QAAQ,CAAC,CAAC;CACxB;CAEA,WAA6B;EAC3B,OAAO,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;CACnE;CAEA,UAA0B;EACxB,MAAM,OAAO,KAAK,YAAY,QAAQ;GACpC,OAAO,KAAK;GACZ,MAAM,EAAE,QAAQ,KAAK,KAAK,OAAO;EACnC,CAAC;EACD,OAAO,aAAa;GAClB,QAAQ,KAAK,KAAK;GAClB,WAAW,KAAK,UAAU;GAC1B,OAAO,KAAK;GACZ,KAAK,KAAK;GACV,WAAW,KAAK;GAChB,SAAS,CAAC,GAAG,KAAK,aAAa,OAAO,CAAC;GACvC,UAAU,KAAK;GACf,mBAAmB,KAAK;GACxB,UAAU,KAAK;GACf,MAAM,OACF;IACE,SAAS,KAAK;IACd,iBAAiB,KAAK,UAAU,QAAQ,KAAK,QAAQ,MAAM,IAAI,eAAe,CAAC;GACjF,IACA,KAAA;GACJ,YAAY,KAAK;GACjB,cAAc,KAAK;EACrB,CAAC;CACH;AACF;;;;;;;;;;AC5XA,eAAsB,UACpB,MACsC;CACtC,MAAM,EAAE,kBAAkB,GAAG,SAAS;CAKtC,OAAO,EAAE,SAAS,MAAM,IAJH,iBAAoB;EACvC,GAAG;EACH,WAAW,qBAAqB,oBAAoB,EAAG;CACzD,CAC+B,CAAC,CAAC,IAAI,EAAE;AACzC;;;;ACfA,SAAgB,aAAgB,GAAG,MAA6D;CAC9F,MAAM,UAAU,KAAK,QAAQ,MAA6B,KAAK,IAAI;CACnE,OAAO;EACL,SAAS,OAAO,UAAU,IAAI,SAAS;GACrC,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,WAAW,CAAE,MAAM,EAAE,QAAQ,UAAU,IAAI,IAAI,GAAI,OAAO;GAElE,OAAO;EACT;EACA,kBAAkB,OAAO,UAAU,IAAI,SAAS;GAC9C,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,oBAAoB,CAAE,MAAM,EAAE,iBAAiB,UAAU,IAAI,IAAI,GAAI,OAAO;GAEpF,OAAO;EACT;CACF;AACF;;;;;;;;AASA,SAAgB,0BAA6B,MAMxB;CACnB,MAAM,YAAY,KAAK,oBAAoB;CAC3C,OAAO,EACL,kBAAkB,OAAO,UAAa,KAAiB,SAAe;EACpE,MAAM,YAAY,KAAK,QAAQ,QAAQ;EACvC,IAAI,aAAa,MAAM,OAAO;EAE9B,QAAO,MADU,KAAK,SAAS,WAAW,IAAI,EAAA,CACpC,QAAQ;CACpB,EACF;AACF;;;;;AAMA,SAAgB,kBAAqB,MAGhB;CACnB,MAAM,YAAY,KAAK,oBAAoB;CAC3C,MAAM,SAAS,KAAK,UAAU;CAC9B,OAAO,EACL,UAAU,WAAW,OAAmB,GAAG,SAAS,YAAY,OAClE;AACF"}
+{"version":3,"file":"fuzz.js","names":[],"sources":["../src/fuzz/cube.ts","../src/fuzz/capsule.ts","../src/rl/active-curriculum.ts","../src/fuzz/policies.ts","../src/fuzz/explorer.ts","../src/fuzz/fuzz-agent.ts","../src/fuzz/gates.ts"],"sourcesContent":["/**\n * Input-space tiling + coverage projection.\n *\n * Cells are the cartesian product of the input axes — the stratification plan,\n * enumerable up front so the planned-vs-covered denominator is honest. Coverage\n * is projected from the evaluation log: per cell, the full DISTRIBUTION of the\n * headline score, of each scored dimension, and of evaluation latency — a bare\n * mean hides outliers, so every aggregate carries its spread. Per-cell cost is\n * split known-dollars vs unknown-runs, never folded into a fabricated $0.\n */\n\nimport { summarizeNumberSeries } from '../statistics'\nimport type { BehaviorSpace, Cell, CoverageCell, Distribution, Evaluation } from './types'\n\n/** One recorded evaluation — the unit coverage and the capsule are built from. */\nexport interface EvalRecord {\n  cell: Cell\n  ev: Evaluation\n  /** The objective's interest score for this evaluation. */\n  interest: number\n  /** Evaluation wall-clock — engine-measured unless `ev.latencyMs` overrode it. */\n  latencyMs: number\n  /** Known dollars for this run. `null` = cost tracking was wired but this\n   *  run's cost was unknowable (counted apart). Absent = not tracked at all. */\n  costUsd?: number | null\n}\n\n/** Enumerate every input cell (cartesian product of the axes), in stable order. */\nexport function enumerateCells(space: BehaviorSpace): Cell[] {\n  if (space.axes.length === 0) return []\n  let partials: Array<Record<string, string>> = [{}]\n  for (const axis of space.axes) {\n    const next: Array<Record<string, string>> = []\n    for (const partial of partials) {\n      for (const value of axis.values) next.push({ ...partial, [axis.name]: value })\n    }\n    partials = next\n  }\n  return partials.map((coords) => ({ id: cellId(space, coords), coords }))\n}\n\n/** Deterministic id for a coordinate map, e.g. `matterType=nda|difficulty=hard`. */\nexport function cellId(space: BehaviorSpace, coords: Record<string, string>): string {\n  return space.axes.map((a) => `${a.name}=${coords[a.name]}`).join('|')\n}\n\n/** Summarize a sample. Throws on an empty sample — callers represent \"no data\"\n *  as `null`, never as a zeroed distribution. */\nexport function distribution(values: number[]): Distribution {\n  const summary = summarizeNumberSeries(values)\n  if (!summary)\n    throw new Error('distribution: empty sample — represent missing data as null, not zeros')\n  const { n, min, p50: median, p90, max, sum } = summary\n  return { mean: sum / n, median, p90, min, max, n }\n}\n\n/**\n * Project the evaluation log into the per-input-cell coverage map. A cell with\n * no evaluations reports `score: null` (honestly uncovered), never zeros.\n */\nexport function buildCoverage(cells: Cell[], log: EvalRecord[], threshold: number): CoverageCell[] {\n  const byCell = new Map<string, EvalRecord[]>()\n  for (const r of log) {\n    const arr = byCell.get(r.cell.id) ?? []\n    arr.push(r)\n    byCell.set(r.cell.id, arr)\n  }\n  return cells.map((cell) => {\n    const recs = byCell.get(cell.id) ?? []\n    const runs = recs.length\n    if (runs === 0)\n      return { cell, runs: 0, score: null, findingRate: 0, dimensions: {}, latencyMs: null }\n\n    const score = distribution(recs.map((r) => r.ev.score))\n    const latencyMs = distribution(recs.map((r) => r.latencyMs))\n    const findingRate = recs.filter((r) => r.interest >= threshold).length / runs\n\n    const dimSamples: Record<string, number[]> = {}\n    for (const r of recs) {\n      for (const [k, v] of Object.entries(r.ev.scores ?? {})) {\n        const samples = dimSamples[k] ?? []\n        samples.push(v)\n        dimSamples[k] = samples\n      }\n    }\n    const dimensions: Record<string, Distribution> = {}\n    for (const [k, xs] of Object.entries(dimSamples)) dimensions[k] = distribution(xs)\n\n    // Cost fields appear only when tracking was wired: known dollars sum, and\n    // tracked-but-unknown runs counted apart — never folded in as $0.\n    const tracked = recs.filter((r) => r.costUsd !== undefined)\n    const known = tracked.filter((r) => r.costUsd !== null)\n    const cost =\n      tracked.length > 0\n        ? {\n            costUsd: known.reduce((a, r) => a + (r.costUsd as number), 0),\n            ...(tracked.length > known.length\n              ? { costUnknownRuns: tracked.length - known.length }\n              : {}),\n          }\n        : {}\n\n    return { cell, runs, score, findingRate, dimensions, latencyMs, ...cost }\n  })\n}\n","/**\n * The capsule — the artifact every exploration produces.\n *\n * `buildCapsule` assembles coverage + verified findings + the QD archive into a\n * pure `CapsuleData` (no clock, no I/O — deterministic and snapshot-testable).\n * `renderCapsuleHtml` turns it into a standalone page: the input-cell heat-map\n * (planned vs covered), per-dimension weakness chips, and the minimized finding\n * exemplars. One artifact — the hardening map and the shareable proof object.\n */\n\nimport type { EvalRecord } from './cube'\nimport { buildCoverage, distribution } from './cube'\nimport type { ArchiveEntry, CapsuleData, Cell, CoverageCell, Distribution, FuzzFinding } from './types'\n\nexport interface BuildCapsuleInput<S> {\n  target: string\n  objective: string\n  cells: Cell[]\n  log: EvalRecord[]\n  /** The objective's notable threshold — drives findingRate. */\n  threshold: number\n  archive: ArchiveEntry<S>[]\n  findings: FuzzFinding<S>[]\n  candidateFindings: number\n  runsUsed: number\n  /** Known-dollar / unknown-run split — present only when cost tracking was\n   *  wired; the capsule never fabricates a $0 total. */\n  cost?: { costUsd: number; costUnknownRuns: number }\n  /** Evaluations that threw — infra outcomes, never folded into robustness. */\n  evalErrors: number\n  /** Set when the consecutive-error circuit breaker stopped the run early. */\n  stoppedEarly?: { reason: 'eval-errors'; detail: string }\n}\n\nexport function buildCapsule<S>(input: BuildCapsuleInput<S>): CapsuleData<S> {\n  const coverage = buildCoverage(input.cells, input.log, input.threshold)\n  const covered = coverage.filter((c) => c.runs > 0)\n  // Cells weigh equally: variance steering sends more runs to weak cells, so a\n  // run-weighted average would bias the headline low.\n  const robustness =\n    covered.length === 0 ? null : distribution(covered.map((c) => (c.score as Distribution).mean))\n  const latencyMs = input.log.length === 0 ? null : distribution(input.log.map((r) => r.latencyMs))\n  // Measured-descriptor bins beyond the bare input cell — observed, never planned.\n  const behaviorBinsObserved = input.archive.filter((e) => e.binId !== e.cell.id).length\n\n  return {\n    target: input.target,\n    objective: input.objective,\n    coverage,\n    findings: [...input.findings].sort((a, b) => b.interest - a.interest),\n    archive: [...input.archive].sort((a, b) => b.interest - a.interest),\n    stats: {\n      totalRuns: input.runsUsed,\n      cellsTotal: input.cells.length,\n      cellsCovered: covered.length,\n      behaviorBinsObserved,\n      candidateFindings: input.candidateFindings,\n      verifiedFindings: input.findings.length,\n      robustness,\n      latencyMs,\n      ...(input.cost\n        ? { costUsd: input.cost.costUsd, costUnknownRuns: input.cost.costUnknownRuns }\n        : {}),\n      evalErrors: input.evalErrors,\n      ...(input.stoppedEarly ? { stoppedEarly: input.stoppedEarly } : {}),\n    },\n  }\n}\n\n// ── HTML capsule ──────────────────────────────────────────────────────────────\n\nfunction esc(s: string): string {\n  return s.replace(\n    /[&<>\"]/g,\n    (c) => ({ '&': '&amp;', '<': '&lt;', '>': '&gt;', '\"': '&quot;' })[c] as string,\n  )\n}\n\n/** red (0) → amber (.5) → green (1); uncovered cells render gray. */\nfunction robustnessColor(r: number | null): string {\n  if (r == null) return '#2a2a2e'\n  return `hsl(${Math.round(r * 120)} 70% 42%)`\n}\n\nfunction pct(x: number): string {\n  return `${Math.round(x * 100)}%`\n}\n\nfunction deriveAxes(coverage: CoverageCell[]): Array<{ name: string; values: string[] }> {\n  const order: string[] = []\n  const seen = new Map<string, Set<string>>()\n  for (const c of coverage) {\n    for (const [k, v] of Object.entries(c.cell.coords)) {\n      if (!seen.has(k)) {\n        seen.set(k, new Set())\n        order.push(k)\n      }\n      seen.get(k)?.add(v)\n    }\n  }\n  return order.map((name) => ({ name, values: [...(seen.get(name) ?? [])] }))\n}\n\n/** The weakest dimension chip for a cell, e.g. `safety 32%` — shown when scores exist. */\nfunction weakestDim(c: CoverageCell): string {\n  const entries = Object.entries(c.dimensions).map(([k, d]) => [k, d.mean] as [string, number])\n  if (entries.length === 0) return ''\n  const sorted = entries.sort((a, b) => a[1] - b[1])\n  const w = sorted[0]\n  if (!w) return ''\n  return `<span class=\"dim\">${esc(w[0])} ${pct(w[1])}</span>`\n}\n\nfunction heatmapHtml(coverage: CoverageCell[]): string {\n  const axes = deriveAxes(coverage)\n  const byId = new Map(coverage.map((c) => [c.cell.id, c]))\n  const tile = (c: CoverageCell | undefined, label: string): string => {\n    const r = c?.score?.mean ?? null\n    const title = c?.score\n      ? `${pct(c.score.mean)} robust (median ${pct(c.score.median)}, min ${pct(c.score.min)}) · ${c.runs} runs · ${pct(c.findingRate)} flagged${c.latencyMs ? ` · ${(c.latencyMs.median / 1000).toFixed(1)}s median` : ''}${c.costUsd !== undefined ? ` · $${c.costUsd.toFixed(2)}` : ''}`\n      : 'not covered'\n    return `<div class=\"tile\" style=\"background:${robustnessColor(r)}\" title=\"${esc(title)}\">${label ? `<span class=\"tl\">${esc(label)}</span>` : ''}<span class=\"tv\">${c && r != null ? pct(r) : '—'}</span>${c ? weakestDim(c) : ''}</div>`\n  }\n\n  const rowAxis = axes[0]\n  const colAxis = axes[1]\n  if (axes.length === 2 && rowAxis && colAxis) {\n    const head = `<tr><th></th>${colAxis.values.map((v) => `<th>${esc(v)}</th>`).join('')}</tr>`\n    const rows = rowAxis.values\n      .map((rv) => {\n        const cells = colAxis.values\n          .map((cv) => {\n            const id = `${rowAxis.name}=${rv}|${colAxis.name}=${cv}`\n            return `<td>${tile(byId.get(id), '')}</td>`\n          })\n          .join('')\n        return `<tr><th class=\"rh\">${esc(rv)}</th>${cells}</tr>`\n      })\n      .join('')\n    return `<div class=\"axis-label\">rows: <b>${esc(rowAxis.name)}</b> · cols: <b>${esc(colAxis.name)}</b></div><table class=\"heat\">${head}${rows}</table>`\n  }\n\n  const sorted = [...coverage].sort((a, b) => (a.score?.mean ?? 2) - (b.score?.mean ?? 2))\n  return `<div class=\"grid\">${sorted.map((c) => tile(c, Object.values(c.cell.coords).join(' · '))).join('')}</div>`\n}\n\nfunction findingsHtml<S>(findings: FuzzFinding<S>[], limit: number): string {\n  if (findings.length === 0)\n    return `<p class=\"none\">No verified findings — the target held across every covered cell.</p>`\n  return findings\n    .slice(0, limit)\n    .map((f) => {\n      const coords = Object.entries(f.cell.coords)\n        .map(([k, v]) => `${k}:${v}`)\n        .join(' · ')\n      const labels = (f.evaluation.labels ?? [])\n        .map((l) => `<span class=\"fclass\">${esc(l)}</span>`)\n        .join('')\n      const dims = Object.entries(f.evaluation.scores ?? {})\n        .sort((a, b) => a[1] - b[1])\n        .slice(0, 3)\n        .map(([k, v]) => `<span class=\"dim\">${esc(k)} ${pct(v)}</span>`)\n        .join('')\n      return `<div class=\"fail\"><div class=\"fmeta\"><span class=\"fcell\">${esc(coords)}</span>${labels}<span class=\"fsev\">interest ${pct(f.interest)}</span></div><div class=\"sevbar\"><div class=\"sevfill\" style=\"width:${pct(f.interest)}\"></div></div><div class=\"ftext\">${esc(f.text ?? '(scenario text not captured)')}</div>${dims ? `<div class=\"fdims\">${dims}</div>` : ''}</div>`\n    })\n    .join('')\n}\n\nexport interface RenderCapsuleOptions {\n  /** Max finding exemplars to show. Default 8. */\n  maxFindings?: number\n  /** ISO timestamp to stamp into the page (keeps the pure capsule clock-free). */\n  generatedAt?: string\n}\n\n/** Render a self-contained HTML capsule — heat-map + per-dimension chips + verified findings. */\nexport function renderCapsuleHtml<S>(\n  capsule: CapsuleData<S>,\n  opts: RenderCapsuleOptions = {},\n): string {\n  const s = capsule.stats\n  const kpi = (label: string, value: string, accent = '#e6e6e6'): string =>\n    `<div class=\"kpi\"><div class=\"kv\" style=\"color:${accent}\">${esc(value)}</div><div class=\"kl\">${esc(label)}</div></div>`\n  const lift = capsule.lift\n    ? kpi(\n        'hardening lift',\n        `${capsule.lift.before.toFixed(2)} → ${capsule.lift.after.toFixed(2)}`,\n        '#5ad17a',\n      )\n    : ''\n  // Cost KPI only when tracking was wired — an untracked run never shows $0.\n  // Unpriced runs are named in the label (amber): the total is a lower bound.\n  const cost =\n    s.costUsd !== undefined\n      ? kpi(\n          s.costUnknownRuns ? `cost · ${s.costUnknownRuns} runs unpriced` : 'cost',\n          `$${s.costUsd.toFixed(2)}`,\n          s.costUnknownRuns ? '#e5c07b' : '#e6e6e6',\n        )\n      : ''\n  const stamp = opts.generatedAt ?? capsule.generatedAt ?? ''\n\n  return `<!doctype html><html><head><meta charset=\"utf-8\"><meta name=\"viewport\" content=\"width=device-width,initial-scale=1\">\n<title>${esc(capsule.objective)} capsule — ${esc(capsule.target)}</title>\n<style>\n:root{color-scheme:dark}\n*{box-sizing:border-box}\nbody{margin:0;background:#0c0c0f;color:#e6e6e6;font:14px/1.5 ui-sans-serif,system-ui,-apple-system,Segoe UI,Roboto,sans-serif}\n.wrap{max-width:980px;margin:0 auto;padding:40px 24px}\nh1{font-size:22px;margin:0 0 2px;letter-spacing:-.01em}\n.sub{color:#8a8a93;font-size:13px;margin-bottom:28px}\n.kpis{display:flex;gap:14px;flex-wrap:wrap;margin-bottom:32px}\n.kpi{background:#16161b;border:1px solid #24242b;border-radius:12px;padding:14px 18px;min-width:120px}\n.kv{font-size:24px;font-weight:650;letter-spacing:-.02em}\n.kl{color:#8a8a93;font-size:12px;margin-top:2px}\nh2{font-size:13px;text-transform:uppercase;letter-spacing:.08em;color:#8a8a93;margin:34px 0 14px}\n.axis-label{color:#8a8a93;font-size:12px;margin-bottom:10px}\ntable.heat{border-collapse:separate;border-spacing:6px}\ntable.heat th{font-weight:500;color:#a8a8b0;font-size:12px;padding:4px 8px;text-align:center}\ntable.heat th.rh{text-align:right}\n.tile{position:relative;width:104px;height:66px;border-radius:10px;display:flex;flex-direction:column;justify-content:center;align-items:center;gap:1px;color:#06120a;font-weight:600}\n.tile .tv{font-size:17px}\n.tile .tl{font-size:10px;font-weight:600;opacity:.9;padding:0 6px;text-align:center}\n.tile .dim{font-size:9px;font-weight:600;opacity:.85;background:rgba(0,0,0,.22);padding:0 6px;border-radius:999px}\n.grid{display:flex;flex-wrap:wrap;gap:8px}\n.grid .tile{width:138px;height:74px}\n.fail{background:#16161b;border:1px solid #24242b;border-left:3px solid #d1495b;border-radius:10px;padding:12px 14px;margin-bottom:10px}\n.fmeta{display:flex;gap:10px;align-items:center;font-size:12px;color:#a8a8b0;margin-bottom:8px}\n.fcell{color:#cfcfd6}\n.fclass{background:#2a1a1d;color:#e58a96;padding:1px 8px;border-radius:999px;font-size:11px}\n.fsev{margin-left:auto;color:#e58a96}\n.sevbar{height:4px;background:#24242b;border-radius:2px;overflow:hidden;margin-bottom:10px}\n.sevfill{height:100%;background:#d1495b}\n.ftext{font-size:13px;color:#d8d8df;white-space:pre-wrap}\n.fdims{display:flex;gap:6px;margin-top:8px}\n.fdims .dim{background:#1d2530;color:#9fc1e8;padding:1px 8px;border-radius:999px;font-size:11px}\n.none{color:#5ad17a}\n.foot{color:#5a5a63;font-size:11px;margin-top:36px}\n</style></head><body><div class=\"wrap\">\n<h1>${esc(capsule.objective)} exploration · ${esc(capsule.target)}</h1>\n<div class=\"sub\">${s.totalRuns} scenarios across ${s.cellsCovered}/${s.cellsTotal} planned cells${s.behaviorBinsObserved > 0 ? ` · ${s.behaviorBinsObserved} measured behavior bins` : ''}${stamp ? ` · ${esc(stamp)}` : ''}</div>\n<div class=\"kpis\">\n${s.robustness ? kpi('robustness', `${pct(s.robustness.mean)}`, s.robustness.mean < 0.6 ? '#e58a96' : '#5ad17a') : ''}\n${s.robustness ? kpi('cell spread', `${pct(s.robustness.min)}–${pct(s.robustness.max)}`) : ''}\n${s.latencyMs ? kpi('median latency', `${(s.latencyMs.median / 1000).toFixed(1)}s`, s.latencyMs.p90 > 4 * s.latencyMs.median ? '#e5b566' : '#e6e6e6') : ''}\n${kpi('verified findings', String(s.verifiedFindings), s.verifiedFindings > 0 ? '#e58a96' : '#5ad17a')}\n${kpi('cells covered', `${s.cellsCovered}/${s.cellsTotal}`)}\n${kpi('scenarios run', String(s.totalRuns))}\n${cost}\n${s.evalErrors > 0 ? kpi('eval errors', String(s.evalErrors), '#e5b566') : ''}\n${lift}\n</div>\n${s.stoppedEarly ? `<div class=\"sub\" style=\"color:#e5b566\">stopped early: ${esc(s.stoppedEarly.detail)} — coverage below reflects the completed portion only</div>` : ''}\n<h2>Coverage map</h2>\n${heatmapHtml(capsule.coverage)}\n<h2>Verified findings${s.candidateFindings > s.verifiedFindings ? ` · ${s.verifiedFindings} of ${s.candidateFindings} candidates passed the validity gates` : ''}</h2>\n${findingsHtml(capsule.findings, opts.maxFindings ?? 8)}\n<div class=\"foot\">Findings are gate-verified: each is a fair, answerable task that reproduces under a meaning-preserving rephrase, minimized to the smallest trigger.</div>\n</div></body></html>`\n}\n","/**\n * Adaptive curriculum: active scenario selection by variance.\n *\n * Fixed scenario sets waste sample budget on cells whose outcome is already\n * settled. `varianceBasedCurriculum` scores each (variant, scenario) cell by\n * the empirical variance of past observations and allocates the next round's\n * budget toward the noisy and under-sampled cells. The output is a next-round\n * allocation, a list of (variant, scenario, count) triples, which the\n * consumer runs and feeds back.\n *\n * Choosing which search node to expand is not a curriculum; it belongs to the\n * search policy (`aide` draws parents by Thompson sampling over each node's\n * posterior, in `campaign/search-policy.ts`). Scenario generation belongs to\n * the adversarial primitive.\n */\n\nexport interface CellObservation {\n  variantId: string\n  scenarioId: string\n  /** Observed score in [0, 1]. */\n  score: number\n}\n\nexport interface CurriculumAllocation {\n  variantId: string\n  scenarioId: string\n  /** How many additional reps to run on this cell. */\n  count: number\n  /** Strategy-specific reason for the allocation. */\n  reason: string\n}\n\nexport interface VarianceCurriculumOptions {\n  /** Total reps to allocate across all cells. */\n  budget: number\n  /**\n   * Smoothing prior on variance — keeps the allocator from concentrating\n   * on a cell with one observation just because its 1-sample variance is\n   * 0. Default 0.05.\n   */\n  variancePrior?: number\n  /**\n   * Minimum reps per cell — even when the variance estimate is low, give\n   * every cell at least this many. Default 1.\n   */\n  floorPerCell?: number\n}\n\n/**\n * Variance-proportional allocation. For each cell, estimate variance from\n * past observations + a prior, then allocate the budget proportional to\n * (sqrt(variance) + 1/sqrt(n)) — a classical optimal-allocation rule\n * (Neyman 1934) that balances \"explore noisy cells\" with \"explore\n * under-sampled cells.\"\n */\nexport function varianceBasedCurriculum(\n  observations: CellObservation[],\n  candidateCells: Array<{ variantId: string; scenarioId: string }>,\n  opts: VarianceCurriculumOptions,\n): CurriculumAllocation[] {\n  const variancePrior = opts.variancePrior ?? 0.05\n  const floor = opts.floorPerCell ?? 1\n  const budget = opts.budget\n\n  const grouped = new Map<string, number[]>()\n  for (const o of observations) {\n    const k = `${o.variantId}::${o.scenarioId}`\n    const arr = grouped.get(k) ?? []\n    arr.push(o.score)\n    grouped.set(k, arr)\n  }\n\n  const cellStats = candidateCells.map((c) => {\n    const k = `${c.variantId}::${c.scenarioId}`\n    const samples = grouped.get(k) ?? []\n    const n = samples.length\n    const mean = n === 0 ? 0.5 : samples.reduce((s, v) => s + v, 0) / n\n    const variance =\n      n < 2\n        ? variancePrior\n        : samples.reduce((s, v) => s + (v - mean) ** 2, 0) / (n - 1) + variancePrior\n    // Neyman optimal allocation: weight ∝ √variance; add √(1/n) to break\n    // ties toward under-sampled cells.\n    const weight = Math.sqrt(variance) + 1 / Math.sqrt(Math.max(1, n))\n    return { variantId: c.variantId, scenarioId: c.scenarioId, n, mean, variance, weight }\n  })\n\n  // Reserve floor*N for the floor; allocate the rest proportional to weight.\n  const floorTotal = floor * cellStats.length\n  if (floorTotal >= budget) {\n    const each = Math.max(1, Math.floor(budget / Math.max(1, cellStats.length)))\n    return cellStats.map((c) => ({\n      variantId: c.variantId,\n      scenarioId: c.scenarioId,\n      count: each,\n      reason: `floor allocation (budget tight; n=${c.n})`,\n    }))\n  }\n  const remaining = budget - floorTotal\n  const totalWeight = cellStats.reduce((s, c) => s + c.weight, 0)\n  return cellStats.map((c) => {\n    const proportional = totalWeight === 0 ? 0 : Math.round((c.weight / totalWeight) * remaining)\n    return {\n      variantId: c.variantId,\n      scenarioId: c.scenarioId,\n      count: floor + proportional,\n      reason: `variance ${c.variance.toFixed(3)} (n=${c.n}, mean=${c.mean.toFixed(3)})`,\n    }\n  })\n}\n","/**\n * Shipped policies for the exploration engine.\n *\n * `MutationProposer` is a plain function type — an agent running a generator skill\n * IS a proposer (`(ctx) => dispatchToSkill(ctx)`), no wrapper needed. `mutationProposer`\n * builds the deterministic, LLM-free one from mutation operators. Objectives are\n * interfaces because the engine reads `kind` + `threshold` off them.\n */\n\nimport type { AdversarialMutation } from '../rl/adversarial'\nimport type {\n  Cell,\n  MutationProposer,\n  FuzzObjective,\n  FuzzProposeContext,\n} from './types'\n\nconst clamp01 = (x: number): number => Math.max(0, Math.min(1, x))\n\n// ── proposers ─────────────────────────────────────────────────────────────────\n\n/**\n * Perturbation-based search: apply the cell's mutation operators to the current\n * elites + seeds, deduping by id. Elites first — mutating the most interesting\n * scenario found so far is what makes the search deepen across rounds.\n */\nexport function mutationProposer<S>(opts: {\n  mutationsFor: (cell: Cell) => AdversarialMutation<S>[]\n  scenarioId: (s: S) => string\n}): MutationProposer<S> {\n  return async (ctx: FuzzProposeContext<S>): Promise<S[]> => {\n    const mutations = opts.mutationsFor(ctx.cell)\n    const parents = [...ctx.elites, ...ctx.seeds]\n    const seen = new Set(parents.map(opts.scenarioId))\n    const out: S[] = []\n    for (const parent of parents) {\n      if (out.length >= ctx.count) break\n      for (const m of mutations) {\n        const children = await m.mutate(parent, ctx.rng)\n        for (const child of children) {\n          const id = opts.scenarioId(child)\n          if (seen.has(id)) continue\n          seen.add(id)\n          out.push(child)\n          if (out.length >= ctx.count) break\n        }\n        if (out.length >= ctx.count) break\n      }\n    }\n    return out\n  }\n}\n\n// ── objectives ────────────────────────────────────────────────────────────────\n\n/** Adversarial: a low headline score is interesting — find where the agent fails. */\nexport function adversarialObjective(threshold = 0.5): FuzzObjective {\n  return { kind: 'adversarial', threshold, interest: (ev) => clamp01(1 - ev.score) }\n}\n\n\n\n\n","/**\n * The exploration engine — a stateful session over a behavior space.\n *\n * Each `step()`: allocate budget across INPUT cells (floor first, then variance\n * steering toward the least-certain cells), propose candidates (the proposer\n * reads current elites + findings, so the search deepens generationally),\n * evaluate with bounded concurrency, archive the most interesting scenario per\n * input×measured bin, and admit notable candidates that pass the validity gates.\n * `run()` loops to budget. `coverage()`/`findings()`/`capsule()` read live state —\n * the surface `makeExploreTools` exposes so an agent can drive the session.\n *\n * One evaluation log (`EvalRecord[]`) is the source of truth; allocation\n * observations and coverage are projections of it.\n */\n\nimport { CostLedger, type CostLedgerHandle, CostReceiptCaptureError } from '../cost-ledger'\nimport { ValidationError } from '../errors'\nimport { varianceBasedCurriculum } from '../rl/active-curriculum'\nimport { mulberry32 } from '../statistics/random'\nimport { buildCapsule } from './capsule'\nimport type { EvalRecord } from './cube'\nimport { enumerateCells } from './cube'\nimport { adversarialObjective } from './policies'\nimport type {\n  ArchiveEntry,\n  CapsuleData,\n  Cell,\n  CoverageCell,\n  ExploreOptions,\n  FuzzFinding,\n  FuzzObjective,\n} from './types'\n\nasync function pMap<T>(\n  items: T[],\n  fn: (item: T) => Promise<void>,\n  concurrency: number,\n  signal?: AbortSignal,\n): Promise<void> {\n  let i = 0\n  const workers = Array.from(\n    { length: Math.max(1, Math.min(concurrency, items.length)) },\n    async () => {\n      while (i < items.length) {\n        if (signal?.aborted) return\n        const item = items[i++]\n        if (item === undefined) return\n        await fn(item)\n      }\n    },\n  )\n  await Promise.all(workers)\n}\n\nexport class BehaviorExplorer<S> {\n  private readonly cells: Cell[]\n  private readonly cellById: Map<string, Cell>\n  private readonly objective: FuzzObjective\n  private readonly threshold: number\n  private readonly floorPerCell: number\n  private readonly perRoundBudget: number\n\n  /** The single evaluation log — coverage + allocation are projections of it. */\n  private readonly log: Array<EvalRecord & { scenarioId: string }> = []\n  /** binId (input × measured coords) → the most interesting entry seen. */\n  private readonly archiveByBin = new Map<string, ArchiveEntry<S>>()\n  private readonly _findings: FuzzFinding<S>[] = []\n  private runsUsed = 0\n  private candidateFindings = 0\n  private evalErrors = 0\n  private consecutiveEvalErrors = 0\n  private stoppedEarly: { reason: 'eval-errors'; detail: string } | undefined\n  private readonly rng: () => number\n  private readonly costLedger?: CostLedgerHandle\n  private readonly costPhase = 'fuzz.explore'\n\n  constructor(private readonly opts: ExploreOptions<S>) {\n    this.cells = enumerateCells(opts.space)\n    if (this.cells.length === 0)\n      throw new Error('BehaviorExplorer: space has no cells — every axis needs ≥1 value')\n    if (opts.costBudgetUsd !== undefined) {\n      if (\n        typeof opts.costBudgetUsd !== 'number' ||\n        !Number.isFinite(opts.costBudgetUsd) ||\n        opts.costBudgetUsd < 0\n      ) {\n        throw new RangeError(\n          `BehaviorExplorer: costBudgetUsd must be a nonnegative finite number, got ${String(opts.costBudgetUsd)}`,\n        )\n      }\n    }\n    if (!opts.costOf && (opts.costBudgetUsd !== undefined || opts.ledger || opts.onCost)) {\n      throw new ValidationError(\n        'BehaviorExplorer: costBudgetUsd/ledger/onCost require costOf — the explorer ' +\n          'cannot know run cost without it; supply costOf or drop the cost options',\n      )\n    }\n    if (\n      (opts.costBudgetUsd !== undefined || opts.ledger?.costCeilingUsd !== undefined) &&\n      !opts.maximumChargeOf\n    ) {\n      throw new ValidationError(\n        'BehaviorExplorer: capped cost tracking requires maximumChargeOf before evaluation',\n      )\n    }\n    if (\n      opts.ledger &&\n      opts.costBudgetUsd !== undefined &&\n      opts.ledger.costCeilingUsd !== opts.costBudgetUsd\n    ) {\n      throw new ValidationError(\n        'BehaviorExplorer: costBudgetUsd must match the supplied CostLedger ceiling',\n      )\n    }\n    if (opts.costOf) this.costLedger = opts.ledger ?? new CostLedger(opts.costBudgetUsd)\n    this.cellById = new Map(this.cells.map((c) => [c.id, c]))\n    this.objective = opts.objective ?? adversarialObjective(0.5)\n    this.threshold = this.objective.threshold ?? 0.5\n    this.floorPerCell = opts.floorPerCell ?? 2\n    this.perRoundBudget = Math.max(\n      this.cells.length * this.floorPerCell,\n      Math.ceil(opts.budget / 4),\n    )\n    this.rng = mulberry32(opts.seed ?? 1)\n  }\n\n  private binId(cell: Cell, descriptor: Record<string, string> | undefined): string {\n    if (!descriptor || Object.keys(descriptor).length === 0) return cell.id\n    const measured = Object.keys(descriptor)\n      .sort()\n      .map((k) => `${k}=${descriptor[k]}`)\n      .join('|')\n    return `${cell.id}|${measured}`\n  }\n\n  private allocate(budget: number): Array<{ cellId: string; count: number }> {\n    if ((this.opts.allocation ?? 'variance') === 'uniform') {\n      const per = Math.max(this.floorPerCell, Math.floor(budget / this.cells.length))\n      return this.cells.map((c) => ({ cellId: c.id, count: per }))\n    }\n    return varianceBasedCurriculum(\n      this.log.map((r) => ({\n        variantId: r.cell.id,\n        scenarioId: '*',\n        score: r.ev.score,\n      })),\n      this.cells.map((c) => ({ variantId: c.id, scenarioId: '*' })),\n      { budget, floorPerCell: this.floorPerCell },\n    ).map((a) => ({ cellId: a.variantId, count: a.count }))\n  }\n\n  private objectiveContext() {\n    const entries = [...this.archiveByBin.values()]\n    return {\n      archiveScores: entries.map((e) => e.evaluation.score),\n      archiveDescriptors: entries.map((e) => e.evaluation.descriptor),\n    }\n  }\n\n  /** Elites whose INPUT cell matches — what the proposer mutates/deepens from. */\n  private elitesFor(cellId: string): S[] {\n    const out: S[] = []\n    for (const e of this.archiveByBin.values()) if (e.cell.id === cellId) out.push(e.scenario)\n    return out\n  }\n\n  /** One allocate → propose → evaluate → gate → archive round. */\n  async step(): Promise<{ runs: number; findings: FuzzFinding<S>[] }> {\n    const remaining = this.opts.budget - this.runsUsed\n    if (remaining <= 0 || this.opts.signal?.aborted) return { runs: 0, findings: [] }\n\n    const allocations = this.allocate(Math.min(this.perRoundBudget, remaining))\n    const newFindings: FuzzFinding<S>[] = []\n    let runsThisStep = 0\n\n    for (const alloc of allocations) {\n      if (\n        this.runsUsed >= this.opts.budget ||\n        this.stoppedEarly !== undefined ||\n        this.opts.signal?.aborted\n      )\n        break\n      const cell = this.cellById.get(alloc.cellId)\n      if (!cell) continue\n      const cap = Math.min(alloc.count, this.opts.budget - this.runsUsed)\n      if (cap <= 0) continue\n      this.opts.onProgress?.({ type: 'cell-allocated', cell, count: cap })\n\n      const seeds = await this.opts.seedsFor(cell)\n      const elites = this.elitesFor(cell.id)\n      const proposed = await this.opts.proposer({\n        cell,\n        seeds,\n        elites,\n        findings: this._findings,\n        count: cap,\n        rng: this.rng,\n      })\n      // Cold cells evaluate their seeds first (the coverage floor); warm cells\n      // trust the proposer, which already saw the elites.\n      const cold = this.log.every((r) => r.cell.id !== cell.id)\n      const toEval = [...(cold ? seeds : []), ...proposed].slice(0, cap)\n\n      await pMap(\n        toEval,\n        async (scenario) => {\n          if (\n            this.runsUsed >= this.opts.budget ||\n            this.stoppedEarly !== undefined ||\n            this.opts.signal?.aborted\n          )\n            return\n          // evaluate/gates/minimize cross an external boundary (router, backend,\n          // judge). A throw there is an infra outcome: record it as a typed\n          // eval-error and keep exploring — one 5xx must not kill a campaign.\n          // Consecutive failures trip the circuit breaker instead, so a dead\n          // backend stops the run rather than burning the remaining budget.\n          try {\n            const startedAt = performance.now()\n            const paid = this.costLedger\n              ? await this.costLedger.runPaidCall({\n                  channel: 'agent',\n                  phase: this.costPhase,\n                  actor: 'fuzz.evaluate',\n                  tags: { target: this.opts.target, cell: cell.id },\n                  signal: this.opts.signal,\n                  maximumCharge: this.opts.maximumChargeOf?.(scenario, cell),\n                  execute: () => this.opts.evaluate(scenario, cell),\n                  receipt: (evaluation) => {\n                    const cost = this.opts.costOf!(scenario, cell, evaluation)\n                    if (cost === null) {\n                      return {\n                        model: 'unattributed',\n                        inputTokens: 0,\n                        outputTokens: 0,\n                        costUnknown: true,\n                      }\n                    }\n                    if (!Number.isFinite(cost.usd) || cost.usd < 0) {\n                      throw new RangeError(\n                        `BehaviorExplorer: costOf returned an invalid usd (${String(cost.usd)}) — ` +\n                          'return null when cost is unknown, never a fabricated number',\n                      )\n                    }\n                    return {\n                      model: cost.model ?? 'unattributed',\n                      inputTokens: 0,\n                      outputTokens: 0,\n                      actualCostUsd: cost.usd,\n                    }\n                  },\n                })\n              : undefined\n            if (paid && !paid.succeeded) {\n              if (\n                paid.error instanceof CostReceiptCaptureError &&\n                paid.error.receiptError instanceof RangeError\n              ) {\n                throw paid.error.receiptError\n              }\n              throw paid.error\n            }\n            const ev = paid ? paid.value : await this.opts.evaluate(scenario, cell)\n            // Consumer-measured latency wins (it can exclude judge time); the\n            // engine's wall-clock is the default so latency is never missing.\n            const latencyMs = ev.latencyMs ?? performance.now() - startedAt\n            this.runsUsed++\n            runsThisStep++\n            this.consecutiveEvalErrors = 0\n            const costUsd = paid\n              ? paid.receipt.costUnknown\n                ? null\n                : paid.receipt.costUsd\n              : undefined\n            if (paid?.receipt.actualCostUsd !== undefined) {\n              this.opts.onCost?.({ usd: paid.receipt.actualCostUsd, channel: 'agent' })\n            }\n            const interest = this.objective.interest(ev, this.objectiveContext())\n            this.log.push({\n              cell,\n              ev,\n              interest,\n              latencyMs,\n              ...(costUsd !== undefined ? { costUsd } : {}),\n              scenarioId: this.opts.scenarioId(scenario),\n            })\n            this.opts.onProgress?.({ type: 'evaluated', cell, scenario, evaluation: ev })\n\n            const bin = this.binId(cell, ev.descriptor)\n            const cur = this.archiveByBin.get(bin)\n            if (!cur || interest > cur.interest)\n              this.archiveByBin.set(bin, { binId: bin, cell, scenario, evaluation: ev, interest })\n\n            if (interest < this.threshold) return\n            this.candidateFindings++\n            if (this.opts.gates?.isValid && !(await this.opts.gates.isValid(scenario, ev, cell)))\n              return\n            if (\n              this.opts.gates?.isUncontaminated &&\n              !(await this.opts.gates.isUncontaminated(scenario, ev, cell))\n            )\n              return\n\n            const minimized = this.opts.minimize\n              ? await this.opts.minimize(scenario, this.opts.evaluate, cell)\n              : scenario\n            const finding: FuzzFinding<S> = {\n              id: this.opts.scenarioId(scenario),\n              cell,\n              scenario,\n              minimized,\n              text: this.opts.scenarioText?.(minimized),\n              evaluation: ev,\n              interest,\n              objective: this.objective.kind,\n            }\n            this._findings.push(finding)\n            newFindings.push(finding)\n            this.opts.onProgress?.({ type: 'finding', finding })\n          } catch (err) {\n            // Internal validation errors (e.g. a fabricated costOf number) are\n            // programming mistakes, not backend outcomes — they stay loud.\n            if (err instanceof RangeError) throw err\n            this.evalErrors++\n            this.consecutiveEvalErrors++\n            const message = err instanceof Error ? err.message : String(err)\n            this.opts.onProgress?.({\n              type: 'eval-error',\n              cell,\n              scenarioId: this.opts.scenarioId(scenario),\n              message,\n            })\n            const limit = this.opts.maxConsecutiveEvalErrors ?? 5\n            if (this.consecutiveEvalErrors >= limit) {\n              this.stoppedEarly = {\n                reason: 'eval-errors',\n                detail: `${this.consecutiveEvalErrors} consecutive eval errors (last: ${message})`,\n              }\n            }\n          }\n        },\n        this.opts.concurrency ?? 1,\n        this.opts.signal,\n      )\n    }\n\n    this.opts.onProgress?.({ type: 'round', runsUsed: this.runsUsed, budget: this.opts.budget })\n    return { runs: runsThisStep, findings: newFindings }\n  }\n\n  /** Loop `step()` until the run or dollar budget is spent, the signal aborts,\n   *  or no progress is made. */\n  async run(): Promise<CapsuleData<S>> {\n    while (\n      this.runsUsed < this.opts.budget &&\n      this.stoppedEarly === undefined &&\n      !this.opts.signal?.aborted\n    ) {\n      const { runs } = await this.step()\n      if (runs === 0 && this.stoppedEarly === undefined) break\n    }\n    return this.capsule()\n  }\n\n  coverage(): CoverageCell[] {\n    return this.capsule().coverage\n  }\n\n  findings(): FuzzFinding<S>[] {\n    return [...this._findings].sort((a, b) => b.interest - a.interest)\n  }\n\n  capsule(): CapsuleData<S> {\n    const cost = this.costLedger?.summary({\n      phase: this.costPhase,\n      tags: { target: this.opts.target },\n    })\n    return buildCapsule({\n      target: this.opts.target,\n      objective: this.objective.kind,\n      cells: this.cells,\n      log: this.log,\n      threshold: this.threshold,\n      archive: [...this.archiveByBin.values()],\n      findings: this._findings,\n      candidateFindings: this.candidateFindings,\n      runsUsed: this.runsUsed,\n      cost: cost\n        ? {\n            costUsd: cost.totalCostUsd,\n            costUnknownRuns: cost.byChannel.reduce((sum, row) => sum + row.unpricedCalls, 0),\n          }\n        : undefined,\n      evalErrors: this.evalErrors,\n      stoppedEarly: this.stoppedEarly,\n    })\n  }\n}\n","/**\n * `fuzzAgent` — the adversarial batch preset over `BehaviorExplorer`.\n *\n * One call: explore the space to budget with the adversarial objective and\n * return the capsule. For agent-driven, incremental, or multi-objective use,\n * construct a `BehaviorExplorer` and drive it via `makeExploreTools`.\n */\n\nimport { BehaviorExplorer } from './explorer'\nimport { adversarialObjective } from './policies'\nimport type { CapsuleData, ExploreOptions } from './types'\n\nexport type FuzzAgentOptions<S> = Omit<ExploreOptions<S>, 'objective'> & {\n  /** Score strictly below this is a candidate failure. Default 0.5. */\n  failureThreshold?: number\n}\n\nexport async function fuzzAgent<S>(\n  opts: FuzzAgentOptions<S>,\n): Promise<{ capsule: CapsuleData<S> }> {\n  const { failureThreshold, ...rest } = opts\n  const explorer = new BehaviorExplorer<S>({\n    ...rest,\n    objective: adversarialObjective(failureThreshold ?? 0.5),\n  })\n  return { capsule: await explorer.run() }\n}\n","/**\n * Validity gates — what separates a fuzzer from a slop generator.\n *\n * A notable candidate is admitted only when it is fair and reproducible. None of\n * these are on by default: the live wiring opts in, so reported findings carry\n * their proof.\n */\n\nimport type { Cell, Evaluation, Evaluator, ValidityGates } from './types'\n\n/** Combine gate sets; a candidate must pass every gate in every set. */\nexport function composeGates<S>(...sets: Array<ValidityGates<S> | undefined>): ValidityGates<S> {\n  const present = sets.filter((s): s is ValidityGates<S> => s != null)\n  return {\n    isValid: async (scenario, ev, cell) => {\n      for (const g of present) {\n        if (g.isValid && !(await g.isValid(scenario, ev, cell))) return false\n      }\n      return true\n    },\n    isUncontaminated: async (scenario, ev, cell) => {\n      for (const g of present) {\n        if (g.isUncontaminated && !(await g.isUncontaminated(scenario, ev, cell))) return false\n      }\n      return true\n    },\n  }\n}\n\n/**\n * Reproducibility gate. Re-run the target on a meaning-preserving rephrase of the\n * flagged scenario; keep the finding only when the rephrase ALSO scores below the\n * threshold. A finding that flips under a cosmetic rewrite was keyed to surface\n * form, not the task — a false signal we must not report. Costs one extra\n * evaluation per candidate (candidates are rare, so cheap).\n */\nexport function perturbationStabilityGate<S>(opts: {\n  evaluate: Evaluator<S>\n  /** Produce a semantic-preserving rephrase. Return null to skip (treated as pass). */\n  perturb: (scenario: S) => S | null\n  /** Score strictly below this still counts as failing. Default 0.5. */\n  failureThreshold?: number\n}): ValidityGates<S> {\n  const threshold = opts.failureThreshold ?? 0.5\n  return {\n    isUncontaminated: async (scenario: S, _ev: Evaluation, cell: Cell) => {\n      const rephrased = opts.perturb(scenario)\n      if (rephrased == null) return true\n      const re = await opts.evaluate(rephrased, cell)\n      return re.score < threshold\n    },\n  }\n}\n\n/**\n * Severity-floor gate. Reject borderline candidates whose score sits in a band\n * just under the threshold — judge noise, not a real defect.\n */\nexport function severityFloorGate<S>(opts: {\n  failureThreshold?: number\n  margin?: number\n}): ValidityGates<S> {\n  const threshold = opts.failureThreshold ?? 0.5\n  const margin = opts.margin ?? 0.1\n  return {\n    isValid: (_scenario, ev: Evaluation) => ev.score <= threshold - margin,\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA4BA,SAAgB,eAAe,OAA8B;CAC3D,IAAI,MAAM,KAAK,WAAW,GAAG,OAAO,CAAC;CACrC,IAAI,WAA0C,CAAC,CAAC,CAAC;CACjD,KAAK,MAAM,QAAQ,MAAM,MAAM;EAC7B,MAAM,OAAsC,CAAC;EAC7C,KAAK,MAAM,WAAW,UACpB,KAAK,MAAM,SAAS,KAAK,QAAQ,KAAK,KAAK;GAAE,GAAG;IAAU,KAAK,OAAO;EAAM,CAAC;EAE/E,WAAW;CACb;CACA,OAAO,SAAS,KAAK,YAAY;EAAE,IAAI,OAAO,OAAO,MAAM;EAAG;CAAO,EAAE;AACzE;;AAGA,SAAgB,OAAO,OAAsB,QAAwC;CACnF,OAAO,MAAM,KAAK,KAAK,MAAM,GAAG,EAAE,KAAK,GAAG,OAAO,EAAE,OAAO,CAAC,CAAC,KAAK,GAAG;AACtE;;;AAIA,SAAgB,aAAa,QAAgC;CAC3D,MAAM,UAAU,sBAAsB,MAAM;CAC5C,IAAI,CAAC,SACH,MAAM,IAAI,MAAM,wEAAwE;CAC1F,MAAM,EAAE,GAAG,KAAK,KAAK,QAAQ,KAAK,KAAK,QAAQ;CAC/C,OAAO;EAAE,MAAM,MAAM;EAAG;EAAQ;EAAK;EAAK;EAAK;CAAE;AACnD;;;;;AAMA,SAAgB,cAAc,OAAe,KAAmB,WAAmC;CACjG,MAAM,yBAAS,IAAI,IAA0B;CAC7C,KAAK,MAAM,KAAK,KAAK;EACnB,MAAM,MAAM,OAAO,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EACtC,IAAI,KAAK,CAAC;EACV,OAAO,IAAI,EAAE,KAAK,IAAI,GAAG;CAC3B;CACA,OAAO,MAAM,KAAK,SAAS;EACzB,MAAM,OAAO,OAAO,IAAI,KAAK,EAAE,KAAK,CAAC;EACrC,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,GACX,OAAO;GAAE;GAAM,MAAM;GAAG,OAAO;GAAM,aAAa;GAAG,YAAY,CAAC;GAAG,WAAW;EAAK;EAEvF,MAAM,QAAQ,aAAa,KAAK,KAAK,MAAM,EAAE,GAAG,KAAK,CAAC;EACtD,MAAM,YAAY,aAAa,KAAK,KAAK,MAAM,EAAE,SAAS,CAAC;EAC3D,MAAM,cAAc,KAAK,QAAQ,MAAM,EAAE,YAAY,SAAS,CAAC,CAAC,SAAS;EAEzE,MAAM,aAAuC,CAAC;EAC9C,KAAK,MAAM,KAAK,MACd,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG;GACtD,MAAM,UAAU,WAAW,MAAM,CAAC;GAClC,QAAQ,KAAK,CAAC;GACd,WAAW,KAAK;EAClB;EAEF,MAAM,aAA2C,CAAC;EAClD,KAAK,MAAM,CAAC,GAAG,OAAO,OAAO,QAAQ,UAAU,GAAG,WAAW,KAAK,aAAa,EAAE;EAIjF,MAAM,UAAU,KAAK,QAAQ,MAAM,EAAE,YAAY,KAAA,CAAS;EAC1D,MAAM,QAAQ,QAAQ,QAAQ,MAAM,EAAE,YAAY,IAAI;EAWtD,OAAO;GAAE;GAAM;GAAM;GAAO;GAAa;GAAY;GAAW,GAT9D,QAAQ,SAAS,IACb;IACE,SAAS,MAAM,QAAQ,GAAG,MAAM,IAAK,EAAE,SAAoB,CAAC;IAC5D,GAAI,QAAQ,SAAS,MAAM,SACvB,EAAE,iBAAiB,QAAQ,SAAS,MAAM,OAAO,IACjD,CAAC;GACP,IACA,CAAC;EAEiE;CAC1E,CAAC;AACH;;ACtEA,SAAgB,aAAgB,OAA6C;CAC3E,MAAM,WAAW,cAAc,MAAM,OAAO,MAAM,KAAK,MAAM,SAAS;CACtE,MAAM,UAAU,SAAS,QAAQ,MAAM,EAAE,OAAO,CAAC;CAGjD,MAAM,aACJ,QAAQ,WAAW,IAAI,OAAO,aAAa,QAAQ,KAAK,MAAO,EAAE,MAAuB,IAAI,CAAC;CAC/F,MAAM,YAAY,MAAM,IAAI,WAAW,IAAI,OAAO,aAAa,MAAM,IAAI,KAAK,MAAM,EAAE,SAAS,CAAC;CAEhG,MAAM,uBAAuB,MAAM,QAAQ,QAAQ,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;CAEhF,OAAO;EACL,QAAQ,MAAM;EACd,WAAW,MAAM;EACjB;EACA,UAAU,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;EACpE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;EAClE,OAAO;GACL,WAAW,MAAM;GACjB,YAAY,MAAM,MAAM;GACxB,cAAc,QAAQ;GACtB;GACA,mBAAmB,MAAM;GACzB,kBAAkB,MAAM,SAAS;GACjC;GACA;GACA,GAAI,MAAM,OACN;IAAE,SAAS,MAAM,KAAK;IAAS,iBAAiB,MAAM,KAAK;GAAgB,IAC3E,CAAC;GACL,YAAY,MAAM;GAClB,GAAI,MAAM,eAAe,EAAE,cAAc,MAAM,aAAa,IAAI,CAAC;EACnE;CACF;AACF;AAIA,SAAS,IAAI,GAAmB;CAC9B,OAAO,EAAE,QACP,YACC,OAAO;EAAE,KAAK;EAAS,KAAK;EAAQ,KAAK;EAAQ,MAAK;CAAS,EAAA,CAAG,EACrE;AACF;;AAGA,SAAS,gBAAgB,GAA0B;CACjD,IAAI,KAAK,MAAM,OAAO;CACtB,OAAO,OAAO,KAAK,MAAM,IAAI,GAAG,EAAE;AACpC;AAEA,SAAS,IAAI,GAAmB;CAC9B,OAAO,GAAG,KAAK,MAAM,IAAI,GAAG,EAAE;AAChC;AAEA,SAAS,WAAW,UAAqE;CACvF,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAyB;CAC1C,KAAK,MAAM,KAAK,UACd,KAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,EAAE,KAAK,MAAM,GAAG;EAClD,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG;GAChB,KAAK,IAAI,mBAAG,IAAI,IAAI,CAAC;GACrB,MAAM,KAAK,CAAC;EACd;EACA,KAAK,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC;CACpB;CAEF,OAAO,MAAM,KAAK,UAAU;EAAE;EAAM,QAAQ,CAAC,GAAI,KAAK,IAAI,IAAI,KAAK,CAAC,CAAE;CAAE,EAAE;AAC5E;;AAGA,SAAS,WAAW,GAAyB;CAC3C,MAAM,UAAU,OAAO,QAAQ,EAAE,UAAU,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAqB;CAC5F,IAAI,QAAQ,WAAW,GAAG,OAAO;CAEjC,MAAM,IADS,QAAQ,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAChC,CAAC,CAAC;CACjB,IAAI,CAAC,GAAG,OAAO;CACf,OAAO,qBAAqB,IAAI,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE;AACrD;AAEA,SAAS,YAAY,UAAkC;CACrD,MAAM,OAAO,WAAW,QAAQ;CAChC,MAAM,OAAO,IAAI,IAAI,SAAS,KAAK,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;CACxD,MAAM,QAAQ,GAA6B,UAA0B;EACnE,MAAM,IAAI,GAAG,OAAO,QAAQ;EAC5B,MAAM,QAAQ,GAAG,QACb,GAAG,IAAI,EAAE,MAAM,IAAI,EAAE,kBAAkB,IAAI,EAAE,MAAM,MAAM,EAAE,QAAQ,IAAI,EAAE,MAAM,GAAG,EAAE,MAAM,EAAE,KAAK,UAAU,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,OAAO,EAAE,UAAU,SAAS,IAAA,CAAM,QAAQ,CAAC,EAAE,YAAY,KAAK,EAAE,YAAY,KAAA,IAAY,OAAO,EAAE,QAAQ,QAAQ,CAAC,MAAM,OAC9Q;EACJ,OAAO,uCAAuC,gBAAgB,CAAC,EAAE,WAAW,IAAI,KAAK,EAAE,IAAI,QAAQ,oBAAoB,IAAI,KAAK,EAAE,WAAW,GAAG,mBAAmB,KAAK,KAAK,OAAO,IAAI,CAAC,IAAI,IAAI,SAAS,IAAI,WAAW,CAAC,IAAI,GAAG;CACnO;CAEA,MAAM,UAAU,KAAK;CACrB,MAAM,UAAU,KAAK;CACrB,IAAI,KAAK,WAAW,KAAK,WAAW,SAAS;EAC3C,MAAM,OAAO,gBAAgB,QAAQ,OAAO,KAAK,MAAM,OAAO,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;EACtF,MAAM,OAAO,QAAQ,OAClB,KAAK,OAAO;GACX,MAAM,QAAQ,QAAQ,OACnB,KAAK,OAAO;IACX,MAAM,KAAK,GAAG,QAAQ,KAAK,GAAG,GAAG,GAAG,QAAQ,KAAK,GAAG;IACpD,OAAO,OAAO,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,EAAE;GACvC,CAAC,CAAC,CACD,KAAK,EAAE;GACV,OAAO,sBAAsB,IAAI,EAAE,EAAE,OAAO,MAAM;EACpD,CAAC,CAAC,CACD,KAAK,EAAE;EACV,OAAO,oCAAoC,IAAI,QAAQ,IAAI,EAAE,kBAAkB,IAAI,QAAQ,IAAI,EAAE,gCAAgC,OAAO,KAAK;CAC/I;CAGA,OAAO,qBADQ,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE,OAAO,QAAQ,MAAM,EAAE,OAAO,QAAQ,EACpD,CAAC,CAAC,KAAK,MAAM,KAAK,GAAG,OAAO,OAAO,EAAE,KAAK,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;AAC5G;AAEA,SAAS,aAAgB,UAA4B,OAAuB;CAC1E,IAAI,SAAS,WAAW,GACtB,OAAO;CACT,OAAO,SACJ,MAAM,GAAG,KAAK,CAAC,CACf,KAAK,MAAM;EACV,MAAM,SAAS,OAAO,QAAQ,EAAE,KAAK,MAAM,CAAC,CACzC,KAAK,CAAC,GAAG,OAAO,GAAG,EAAE,GAAG,GAAG,CAAC,CAC5B,KAAK,KAAK;EACb,MAAM,UAAU,EAAE,WAAW,UAAU,CAAC,EAAA,CACrC,KAAK,MAAM,wBAAwB,IAAI,CAAC,EAAE,QAAQ,CAAC,CACnD,KAAK,EAAE;EACV,MAAM,OAAO,OAAO,QAAQ,EAAE,WAAW,UAAU,CAAC,CAAC,CAAC,CACnD,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAC3B,MAAM,GAAG,CAAC,CAAC,CACX,KAAK,CAAC,GAAG,OAAO,qBAAqB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,QAAQ,CAAC,CAC/D,KAAK,EAAE;EACV,OAAO,4DAA4D,IAAI,MAAM,EAAE,SAAS,OAAO,8BAA8B,IAAI,EAAE,QAAQ,EAAE,qEAAqE,IAAI,EAAE,QAAQ,EAAE,mCAAmC,IAAI,EAAE,QAAQ,8BAA8B,EAAE,QAAQ,OAAO,sBAAsB,KAAK,UAAU,GAAG;CAC5W,CAAC,CAAC,CACD,KAAK,EAAE;AACZ;;AAUA,SAAgB,kBACd,SACA,OAA6B,CAAC,GACtB;CACR,MAAM,IAAI,QAAQ;CAClB,MAAM,OAAO,OAAe,OAAe,SAAS,cAClD,iDAAiD,OAAO,IAAI,IAAI,KAAK,EAAE,wBAAwB,IAAI,KAAK,EAAE;CAC5G,MAAM,OAAO,QAAQ,OACjB,IACE,kBACA,GAAG,QAAQ,KAAK,OAAO,QAAQ,CAAC,EAAE,KAAK,QAAQ,KAAK,MAAM,QAAQ,CAAC,KACnE,SACF,IACA;CAGJ,MAAM,OACJ,EAAE,YAAY,KAAA,IACV,IACE,EAAE,kBAAkB,UAAU,EAAE,gBAAgB,kBAAkB,QAClE,IAAI,EAAE,QAAQ,QAAQ,CAAC,KACvB,EAAE,kBAAkB,YAAY,SAClC,IACA;CACN,MAAM,QAAQ,KAAK,eAAe,QAAQ,eAAe;CAEzD,OAAO;SACA,IAAI,QAAQ,SAAS,EAAE,aAAa,IAAI,QAAQ,MAAM,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MAoC3D,IAAI,QAAQ,SAAS,EAAE,iBAAiB,IAAI,QAAQ,MAAM,EAAE;mBAC/C,EAAE,UAAU,oBAAoB,EAAE,aAAa,GAAG,EAAE,WAAW,gBAAgB,EAAE,uBAAuB,IAAI,MAAM,EAAE,qBAAqB,2BAA2B,KAAK,QAAQ,MAAM,IAAI,KAAK,MAAM,GAAG;;EAE1N,EAAE,aAAa,IAAI,cAAc,GAAG,IAAI,EAAE,WAAW,IAAI,KAAK,EAAE,WAAW,OAAO,KAAM,YAAY,SAAS,IAAI,GAAG;EACpH,EAAE,aAAa,IAAI,eAAe,GAAG,IAAI,EAAE,WAAW,GAAG,EAAE,GAAG,IAAI,EAAE,WAAW,GAAG,GAAG,IAAI,GAAG;EAC5F,EAAE,YAAY,IAAI,kBAAkB,IAAI,EAAE,UAAU,SAAS,IAAA,CAAM,QAAQ,CAAC,EAAE,IAAI,EAAE,UAAU,MAAM,IAAI,EAAE,UAAU,SAAS,YAAY,SAAS,IAAI,GAAG;EACzJ,IAAI,qBAAqB,OAAO,EAAE,gBAAgB,GAAG,EAAE,mBAAmB,IAAI,YAAY,SAAS,EAAE;EACrG,IAAI,iBAAiB,GAAG,EAAE,aAAa,GAAG,EAAE,YAAY,EAAE;EAC1D,IAAI,iBAAiB,OAAO,EAAE,SAAS,CAAC,EAAE;EAC1C,KAAK;EACL,EAAE,aAAa,IAAI,IAAI,eAAe,OAAO,EAAE,UAAU,GAAG,SAAS,IAAI,GAAG;EAC5E,KAAK;;EAEL,EAAE,eAAe,yDAAyD,IAAI,EAAE,aAAa,MAAM,EAAE,+DAA+D,GAAG;;EAEvK,YAAY,QAAQ,QAAQ,EAAE;uBACT,EAAE,oBAAoB,EAAE,mBAAmB,MAAM,EAAE,iBAAiB,MAAM,EAAE,kBAAkB,yCAAyC,GAAG;EAC/J,aAAa,QAAQ,UAAU,KAAK,eAAe,CAAC,EAAE;;;AAGxD;;;;;;;;;AC5MA,SAAgB,wBACd,cACA,gBACA,MACwB;CACxB,MAAM,gBAAgB,KAAK,iBAAiB;CAC5C,MAAM,QAAQ,KAAK,gBAAgB;CACnC,MAAM,SAAS,KAAK;CAEpB,MAAM,0BAAU,IAAI,IAAsB;CAC1C,KAAK,MAAM,KAAK,cAAc;EAC5B,MAAM,IAAI,GAAG,EAAE,UAAU,IAAI,EAAE;EAC/B,MAAM,MAAM,QAAQ,IAAI,CAAC,KAAK,CAAC;EAC/B,IAAI,KAAK,EAAE,KAAK;EAChB,QAAQ,IAAI,GAAG,GAAG;CACpB;CAEA,MAAM,YAAY,eAAe,KAAK,MAAM;EAC1C,MAAM,IAAI,GAAG,EAAE,UAAU,IAAI,EAAE;EAC/B,MAAM,UAAU,QAAQ,IAAI,CAAC,KAAK,CAAC;EACnC,MAAM,IAAI,QAAQ;EAClB,MAAM,OAAO,MAAM,IAAI,KAAM,QAAQ,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAClE,MAAM,WACJ,IAAI,IACA,gBACA,QAAQ,QAAQ,GAAG,MAAM,KAAK,IAAI,SAAS,GAAG,CAAC,KAAK,IAAI,KAAK;EAGnE,MAAM,SAAS,KAAK,KAAK,QAAQ,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;EACjE,OAAO;GAAE,WAAW,EAAE;GAAW,YAAY,EAAE;GAAY;GAAG;GAAM;GAAU;EAAO;CACvF,CAAC;CAGD,MAAM,aAAa,QAAQ,UAAU;CACrC,IAAI,cAAc,QAAQ;EACxB,MAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,SAAS,KAAK,IAAI,GAAG,UAAU,MAAM,CAAC,CAAC;EAC3E,OAAO,UAAU,KAAK,OAAO;GAC3B,WAAW,EAAE;GACb,YAAY,EAAE;GACd,OAAO;GACP,QAAQ,qCAAqC,EAAE,EAAE;EACnD,EAAE;CACJ;CACA,MAAM,YAAY,SAAS;CAC3B,MAAM,cAAc,UAAU,QAAQ,GAAG,MAAM,IAAI,EAAE,QAAQ,CAAC;CAC9D,OAAO,UAAU,KAAK,MAAM;EAC1B,MAAM,eAAe,gBAAgB,IAAI,IAAI,KAAK,MAAO,EAAE,SAAS,cAAe,SAAS;EAC5F,OAAO;GACL,WAAW,EAAE;GACb,YAAY,EAAE;GACd,OAAO,QAAQ;GACf,QAAQ,YAAY,EAAE,SAAS,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,KAAK,QAAQ,CAAC,EAAE;EACjF;CACF,CAAC;AACH;;AC5FA,MAAM,WAAW,MAAsB,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;;;;;;AASjE,SAAgB,iBAAoB,MAGZ;CACtB,OAAO,OAAO,QAA6C;EACzD,MAAM,YAAY,KAAK,aAAa,IAAI,IAAI;EAC5C,MAAM,UAAU,CAAC,GAAG,IAAI,QAAQ,GAAG,IAAI,KAAK;EAC5C,MAAM,OAAO,IAAI,IAAI,QAAQ,IAAI,KAAK,UAAU,CAAC;EACjD,MAAM,MAAW,CAAC;EAClB,KAAK,MAAM,UAAU,SAAS;GAC5B,IAAI,IAAI,UAAU,IAAI,OAAO;GAC7B,KAAK,MAAM,KAAK,WAAW;IACzB,MAAM,WAAW,MAAM,EAAE,OAAO,QAAQ,IAAI,GAAG;IAC/C,KAAK,MAAM,SAAS,UAAU;KAC5B,MAAM,KAAK,KAAK,WAAW,KAAK;KAChC,IAAI,KAAK,IAAI,EAAE,GAAG;KAClB,KAAK,IAAI,EAAE;KACX,IAAI,KAAK,KAAK;KACd,IAAI,IAAI,UAAU,IAAI,OAAO;IAC/B;IACA,IAAI,IAAI,UAAU,IAAI,OAAO;GAC/B;EACF;EACA,OAAO;CACT;AACF;;AAKA,SAAgB,qBAAqB,YAAY,IAAoB;CACnE,OAAO;EAAE,MAAM;EAAe;EAAW,WAAW,OAAO,QAAQ,IAAI,GAAG,KAAK;CAAE;AACnF;;;;;;;;;;;;;;;;ACzBA,eAAe,KACb,OACA,IACA,aACA,QACe;CACf,IAAI,IAAI;CACR,MAAM,UAAU,MAAM,KACpB,EAAE,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,aAAa,MAAM,MAAM,CAAC,EAAE,GAC3D,YAAY;EACV,OAAO,IAAI,MAAM,QAAQ;GACvB,IAAI,QAAQ,SAAS;GACrB,MAAM,OAAO,MAAM;GACnB,IAAI,SAAS,KAAA,GAAW;GACxB,MAAM,GAAG,IAAI;EACf;CACF,CACF;CACA,MAAM,QAAQ,IAAI,OAAO;AAC3B;AAEA,IAAa,mBAAb,MAAiC;CAsBF;CArB7B;CACA;CACA;CACA;CACA;CACA;;CAGA,MAAmE,CAAC;;CAEpE,+BAAgC,IAAI,IAA6B;CACjE,YAA+C,CAAC;CAChD,WAAmB;CACnB,oBAA4B;CAC5B,aAAqB;CACrB,wBAAgC;CAChC;CACA;CACA;CACA,YAA6B;CAE7B,YAAY,MAA0C;EAAzB,KAAA,OAAA;EAC3B,KAAK,QAAQ,eAAe,KAAK,KAAK;EACtC,IAAI,KAAK,MAAM,WAAW,GACxB,MAAM,IAAI,MAAM,kEAAkE;EACpF,IAAI,KAAK,kBAAkB,KAAA,GAEvB;OAAA,OAAO,KAAK,kBAAkB,YAC9B,CAAC,OAAO,SAAS,KAAK,aAAa,KACnC,KAAK,gBAAgB,GAErB,MAAM,IAAI,WACR,4EAA4E,OAAO,KAAK,aAAa,GACvG;EAAA;EAGJ,IAAI,CAAC,KAAK,WAAW,KAAK,kBAAkB,KAAA,KAAa,KAAK,UAAU,KAAK,SAC3E,MAAM,IAAI,gBACR,qJAEF;EAEF,KACG,KAAK,kBAAkB,KAAA,KAAa,KAAK,QAAQ,mBAAmB,KAAA,MACrE,CAAC,KAAK,iBAEN,MAAM,IAAI,gBACR,mFACF;EAEF,IACE,KAAK,UACL,KAAK,kBAAkB,KAAA,KACvB,KAAK,OAAO,mBAAmB,KAAK,eAEpC,MAAM,IAAI,gBACR,4EACF;EAEF,IAAI,KAAK,QAAQ,KAAK,aAAa,KAAK,UAAU,IAAI,WAAW,KAAK,aAAa;EACnF,KAAK,WAAW,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;EACxD,KAAK,YAAY,KAAK,aAAa,qBAAqB,EAAG;EAC3D,KAAK,YAAY,KAAK,UAAU,aAAa;EAC7C,KAAK,eAAe,KAAK,gBAAgB;EACzC,KAAK,iBAAiB,KAAK,IACzB,KAAK,MAAM,SAAS,KAAK,cACzB,KAAK,KAAK,KAAK,SAAS,CAAC,CAC3B;EACA,KAAK,MAAM,WAAW,KAAK,QAAQ,CAAC;CACtC;CAEA,MAAc,MAAY,YAAwD;EAChF,IAAI,CAAC,cAAc,OAAO,KAAK,UAAU,CAAC,CAAC,WAAW,GAAG,OAAO,KAAK;EACrE,MAAM,WAAW,OAAO,KAAK,UAAU,CAAC,CACrC,KAAK,CAAC,CACN,KAAK,MAAM,GAAG,EAAE,GAAG,WAAW,IAAI,CAAC,CACnC,KAAK,GAAG;EACX,OAAO,GAAG,KAAK,GAAG,GAAG;CACvB;CAEA,SAAiB,QAA0D;EACzE,KAAK,KAAK,KAAK,cAAc,gBAAgB,WAAW;GACtD,MAAM,MAAM,KAAK,IAAI,KAAK,cAAc,KAAK,MAAM,SAAS,KAAK,MAAM,MAAM,CAAC;GAC9E,OAAO,KAAK,MAAM,KAAK,OAAO;IAAE,QAAQ,EAAE;IAAI,OAAO;GAAI,EAAE;EAC7D;EACA,OAAO,wBACL,KAAK,IAAI,KAAK,OAAO;GACnB,WAAW,EAAE,KAAK;GAClB,YAAY;GACZ,OAAO,EAAE,GAAG;EACd,EAAE,GACF,KAAK,MAAM,KAAK,OAAO;GAAE,WAAW,EAAE;GAAI,YAAY;EAAI,EAAE,GAC5D;GAAE;GAAQ,cAAc,KAAK;EAAa,CAC5C,CAAC,CAAC,KAAK,OAAO;GAAE,QAAQ,EAAE;GAAW,OAAO,EAAE;EAAM,EAAE;CACxD;CAEA,mBAA2B;EACzB,MAAM,UAAU,CAAC,GAAG,KAAK,aAAa,OAAO,CAAC;EAC9C,OAAO;GACL,eAAe,QAAQ,KAAK,MAAM,EAAE,WAAW,KAAK;GACpD,oBAAoB,QAAQ,KAAK,MAAM,EAAE,WAAW,UAAU;EAChE;CACF;;CAGA,UAAkB,QAAqB;EACrC,MAAM,MAAW,CAAC;EAClB,KAAK,MAAM,KAAK,KAAK,aAAa,OAAO,GAAG,IAAI,EAAE,KAAK,OAAO,QAAQ,IAAI,KAAK,EAAE,QAAQ;EACzF,OAAO;CACT;;CAGA,MAAM,OAA8D;EAClE,MAAM,YAAY,KAAK,KAAK,SAAS,KAAK;EAC1C,IAAI,aAAa,KAAK,KAAK,KAAK,QAAQ,SAAS,OAAO;GAAE,MAAM;GAAG,UAAU,CAAC;EAAE;EAEhF,MAAM,cAAc,KAAK,SAAS,KAAK,IAAI,KAAK,gBAAgB,SAAS,CAAC;EAC1E,MAAM,cAAgC,CAAC;EACvC,IAAI,eAAe;EAEnB,KAAK,MAAM,SAAS,aAAa;GAC/B,IACE,KAAK,YAAY,KAAK,KAAK,UAC3B,KAAK,iBAAiB,KAAA,KACtB,KAAK,KAAK,QAAQ,SAElB;GACF,MAAM,OAAO,KAAK,SAAS,IAAI,MAAM,MAAM;GAC3C,IAAI,CAAC,MAAM;GACX,MAAM,MAAM,KAAK,IAAI,MAAM,OAAO,KAAK,KAAK,SAAS,KAAK,QAAQ;GAClE,IAAI,OAAO,GAAG;GACd,KAAK,KAAK,aAAa;IAAE,MAAM;IAAkB;IAAM,OAAO;GAAI,CAAC;GAEnE,MAAM,QAAQ,MAAM,KAAK,KAAK,SAAS,IAAI;GAC3C,MAAM,SAAS,KAAK,UAAU,KAAK,EAAE;GACrC,MAAM,WAAW,MAAM,KAAK,KAAK,SAAS;IACxC;IACA;IACA;IACA,UAAU,KAAK;IACf,OAAO;IACP,KAAK,KAAK;GACZ,CAAC;GAMD,MAAM,KAFS,CAAC,GADH,KAAK,IAAI,OAAO,MAAM,EAAE,KAAK,OAAO,KAAK,EAC/B,IAAI,QAAQ,CAAC,GAAI,GAAG,QAAQ,CAAC,CAAC,MAAM,GAAG,GAGvD,GACL,OAAO,aAAa;IAClB,IACE,KAAK,YAAY,KAAK,KAAK,UAC3B,KAAK,iBAAiB,KAAA,KACtB,KAAK,KAAK,QAAQ,SAElB;IAMF,IAAI;KACF,MAAM,YAAY,YAAY,IAAI;KAClC,MAAM,OAAO,KAAK,aACd,MAAM,KAAK,WAAW,YAAY;MAChC,SAAS;MACT,OAAO,KAAK;MACZ,OAAO;MACP,MAAM;OAAE,QAAQ,KAAK,KAAK;OAAQ,MAAM,KAAK;MAAG;MAChD,QAAQ,KAAK,KAAK;MAClB,eAAe,KAAK,KAAK,kBAAkB,UAAU,IAAI;MACzD,eAAe,KAAK,KAAK,SAAS,UAAU,IAAI;MAChD,UAAU,eAAe;OACvB,MAAM,OAAO,KAAK,KAAK,OAAQ,UAAU,MAAM,UAAU;OACzD,IAAI,SAAS,MACX,OAAO;QACL,OAAO;QACP,aAAa;QACb,cAAc;QACd,aAAa;OACf;OAEF,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG,KAAK,KAAK,MAAM,GAC3C,MAAM,IAAI,WACR,qDAAqD,OAAO,KAAK,GAAG,EAAE,gEAExE;OAEF,OAAO;QACL,OAAO,KAAK,SAAS;QACrB,aAAa;QACb,cAAc;QACd,eAAe,KAAK;OACtB;MACF;KACF,CAAC,IACD,KAAA;KACJ,IAAI,QAAQ,CAAC,KAAK,WAAW;MAC3B,IACE,KAAK,iBAAiB,2BACtB,KAAK,MAAM,wBAAwB,YAEnC,MAAM,KAAK,MAAM;MAEnB,MAAM,KAAK;KACb;KACA,MAAM,KAAK,OAAO,KAAK,QAAQ,MAAM,KAAK,KAAK,SAAS,UAAU,IAAI;KAGtE,MAAM,YAAY,GAAG,aAAa,YAAY,IAAI,IAAI;KACtD,KAAK;KACL;KACA,KAAK,wBAAwB;KAC7B,MAAM,UAAU,OACZ,KAAK,QAAQ,cACX,OACA,KAAK,QAAQ,UACf,KAAA;KACJ,IAAI,MAAM,QAAQ,kBAAkB,KAAA,GAClC,KAAK,KAAK,SAAS;MAAE,KAAK,KAAK,QAAQ;MAAe,SAAS;KAAQ,CAAC;KAE1E,MAAM,WAAW,KAAK,UAAU,SAAS,IAAI,KAAK,iBAAiB,CAAC;KACpE,KAAK,IAAI,KAAK;MACZ;MACA;MACA;MACA;MACA,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;MAC3C,YAAY,KAAK,KAAK,WAAW,QAAQ;KAC3C,CAAC;KACD,KAAK,KAAK,aAAa;MAAE,MAAM;MAAa;MAAM;MAAU,YAAY;KAAG,CAAC;KAE5E,MAAM,MAAM,KAAK,MAAM,MAAM,GAAG,UAAU;KAC1C,MAAM,MAAM,KAAK,aAAa,IAAI,GAAG;KACrC,IAAI,CAAC,OAAO,WAAW,IAAI,UACzB,KAAK,aAAa,IAAI,KAAK;MAAE,OAAO;MAAK;MAAM;MAAU,YAAY;MAAI;KAAS,CAAC;KAErF,IAAI,WAAW,KAAK,WAAW;KAC/B,KAAK;KACL,IAAI,KAAK,KAAK,OAAO,WAAW,CAAE,MAAM,KAAK,KAAK,MAAM,QAAQ,UAAU,IAAI,IAAI,GAChF;KACF,IACE,KAAK,KAAK,OAAO,oBACjB,CAAE,MAAM,KAAK,KAAK,MAAM,iBAAiB,UAAU,IAAI,IAAI,GAE3D;KAEF,MAAM,YAAY,KAAK,KAAK,WACxB,MAAM,KAAK,KAAK,SAAS,UAAU,KAAK,KAAK,UAAU,IAAI,IAC3D;KACJ,MAAM,UAA0B;MAC9B,IAAI,KAAK,KAAK,WAAW,QAAQ;MACjC;MACA;MACA;MACA,MAAM,KAAK,KAAK,eAAe,SAAS;MACxC,YAAY;MACZ;MACA,WAAW,KAAK,UAAU;KAC5B;KACA,KAAK,UAAU,KAAK,OAAO;KAC3B,YAAY,KAAK,OAAO;KACxB,KAAK,KAAK,aAAa;MAAE,MAAM;MAAW;KAAQ,CAAC;IACrD,SAAS,KAAK;KAGZ,IAAI,eAAe,YAAY,MAAM;KACrC,KAAK;KACL,KAAK;KACL,MAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;KAC/D,KAAK,KAAK,aAAa;MACrB,MAAM;MACN;MACA,YAAY,KAAK,KAAK,WAAW,QAAQ;MACzC;KACF,CAAC;KACD,MAAM,QAAQ,KAAK,KAAK,4BAA4B;KACpD,IAAI,KAAK,yBAAyB,OAChC,KAAK,eAAe;MAClB,QAAQ;MACR,QAAQ,GAAG,KAAK,sBAAsB,kCAAkC,QAAQ;KAClF;IAEJ;GACF,GACA,KAAK,KAAK,eAAe,GACzB,KAAK,KAAK,MACZ;EACF;EAEA,KAAK,KAAK,aAAa;GAAE,MAAM;GAAS,UAAU,KAAK;GAAU,QAAQ,KAAK,KAAK;EAAO,CAAC;EAC3F,OAAO;GAAE,MAAM;GAAc,UAAU;EAAY;CACrD;;;CAIA,MAAM,MAA+B;EACnC,OACE,KAAK,WAAW,KAAK,KAAK,UAC1B,KAAK,iBAAiB,KAAA,KACtB,CAAC,KAAK,KAAK,QAAQ,SACnB;GACA,MAAM,EAAE,SAAS,MAAM,KAAK,KAAK;GACjC,IAAI,SAAS,KAAK,KAAK,iBAAiB,KAAA,GAAW;EACrD;EACA,OAAO,KAAK,QAAQ;CACtB;CAEA,WAA2B;EACzB,OAAO,KAAK,QAAQ,CAAC,CAAC;CACxB;CAEA,WAA6B;EAC3B,OAAO,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;CACnE;CAEA,UAA0B;EACxB,MAAM,OAAO,KAAK,YAAY,QAAQ;GACpC,OAAO,KAAK;GACZ,MAAM,EAAE,QAAQ,KAAK,KAAK,OAAO;EACnC,CAAC;EACD,OAAO,aAAa;GAClB,QAAQ,KAAK,KAAK;GAClB,WAAW,KAAK,UAAU;GAC1B,OAAO,KAAK;GACZ,KAAK,KAAK;GACV,WAAW,KAAK;GAChB,SAAS,CAAC,GAAG,KAAK,aAAa,OAAO,CAAC;GACvC,UAAU,KAAK;GACf,mBAAmB,KAAK;GACxB,UAAU,KAAK;GACf,MAAM,OACF;IACE,SAAS,KAAK;IACd,iBAAiB,KAAK,UAAU,QAAQ,KAAK,QAAQ,MAAM,IAAI,eAAe,CAAC;GACjF,IACA,KAAA;GACJ,YAAY,KAAK;GACjB,cAAc,KAAK;EACrB,CAAC;CACH;AACF;;;;;;;;;AC5XA,eAAsB,UACpB,MACsC;CACtC,MAAM,EAAE,kBAAkB,GAAG,SAAS;CAKtC,OAAO,EAAE,SAAS,MAAM,IAJH,iBAAoB;EACvC,GAAG;EACH,WAAW,qBAAqB,oBAAoB,EAAG;CACzD,CAC+B,CAAC,CAAC,IAAI,EAAE;AACzC;;;ACfA,SAAgB,aAAgB,GAAG,MAA6D;CAC9F,MAAM,UAAU,KAAK,QAAQ,MAA6B,KAAK,IAAI;CACnE,OAAO;EACL,SAAS,OAAO,UAAU,IAAI,SAAS;GACrC,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,WAAW,CAAE,MAAM,EAAE,QAAQ,UAAU,IAAI,IAAI,GAAI,OAAO;GAElE,OAAO;EACT;EACA,kBAAkB,OAAO,UAAU,IAAI,SAAS;GAC9C,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,oBAAoB,CAAE,MAAM,EAAE,iBAAiB,UAAU,IAAI,IAAI,GAAI,OAAO;GAEpF,OAAO;EACT;CACF;AACF;;;;;;;;AASA,SAAgB,0BAA6B,MAMxB;CACnB,MAAM,YAAY,KAAK,oBAAoB;CAC3C,OAAO,EACL,kBAAkB,OAAO,UAAa,KAAiB,SAAe;EACpE,MAAM,YAAY,KAAK,QAAQ,QAAQ;EACvC,IAAI,aAAa,MAAM,OAAO;EAE9B,QAAO,MADU,KAAK,SAAS,WAAW,IAAI,EAAA,CACpC,QAAQ;CACpB,EACF;AACF;;;;;AAMA,SAAgB,kBAAqB,MAGhB;CACnB,MAAM,YAAY,KAAK,oBAAoB;CAC3C,MAAM,SAAS,KAAK,UAAU;CAC9B,OAAO,EACL,UAAU,WAAW,OAAmB,GAAG,SAAS,YAAY,OAClE;AACF"}