@tangle-network/agent-eval 0.216.1 → 0.218.1

package/dist/fuzz.js.map

@@ -1 +1 @@
-{"version":3,"file":"fuzz.js","names":[],"sources":["../src/fuzz/cube.ts","../src/fuzz/capsule.ts","../src/fuzz/policies.ts","../src/fuzz/explorer.ts","../src/fuzz/fuzz-agent.ts","../src/fuzz/gates.ts","../src/fuzz/tools.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, Finding } 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: Finding<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: Finding<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 * 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  Evaluation,\n  MutationProposer,\n  Objective,\n  ObjectiveContext,\n  ProposeContext,\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: ProposeContext<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): Objective {\n  return { kind: 'adversarial', threshold, interest: (ev) => clamp01(1 - ev.score) }\n}\n\nfunction hamming(\n  a: Record<string, string> | undefined,\n  b: Record<string, string> | undefined,\n): number {\n  if (!a || !b) return 1\n  const keys = new Set([...Object.keys(a), ...Object.keys(b)])\n  if (keys.size === 0) return 0\n  let diff = 0\n  for (const k of keys) if (a[k] !== b[k]) diff++\n  return diff / keys.size\n}\n\n/**\n * Novelty: interesting when far from the archive in score AND measured behavior\n * descriptor — quality-diversity's diversity pressure; drives corpus growth\n * rather than re-finding the same hole.\n */\nexport function noveltyObjective(threshold = 0.3): Objective {\n  return {\n    kind: 'novelty',\n    threshold,\n    interest: (ev: Evaluation, ctx: ObjectiveContext) => {\n      const scoreNovelty =\n        ctx.archiveScores.length === 0\n          ? 1\n          : Math.min(...ctx.archiveScores.map((s) => Math.abs(s - ev.score)))\n      const descNovelty =\n        ctx.archiveDescriptors.length === 0\n          ? 1\n          : Math.min(...ctx.archiveDescriptors.map((d) => hamming(d, ev.descriptor)))\n      return clamp01(0.5 * scoreNovelty + 0.5 * descNovelty)\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  Finding,\n  Objective,\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: Objective\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: Finding<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: Finding<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: Finding<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: Finding<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(): Finding<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","/**\n * Agent-drivable surface over a live exploration session.\n *\n * Framework-neutral tool defs ({name, description, parameters: JSON Schema,\n * handler}) so the on-demand agent — not a batch script — drives the search:\n * step it, read coverage, inspect findings, render the capsule. Transport\n * encodings (OpenAI function shape, MCP) are one-line mappings the host owns.\n */\n\nimport { renderCapsuleHtml } from './capsule'\nimport type { BehaviorExplorer } from './explorer'\n\nexport interface ExploreToolDef {\n  name: string\n  description: string\n  /** JSON Schema (draft-07+) for the arguments. */\n  parameters: Record<string, unknown>\n  handler: (args: unknown, ctx?: { signal?: AbortSignal }) => Promise<unknown>\n}\n\nconst NO_ARGS = { type: 'object', properties: {}, additionalProperties: false }\n\nexport function makeExploreTools<S>(explorer: BehaviorExplorer<S>): ExploreToolDef[] {\n  return [\n    {\n      name: 'explore_step',\n      description:\n        'Run one exploration round: allocate budget across cells, propose + evaluate scenarios, archive elites, admit gate-verified findings. Returns runs spent and new findings.',\n      parameters: NO_ARGS,\n      handler: async () => {\n        const { runs, findings } = await explorer.step()\n        return { runs, newFindings: findings.length, findings }\n      },\n    },\n    {\n      name: 'explore_coverage',\n      description:\n        'Read the live coverage map: per planned cell — runs, robustness (null = uncovered), finding rate, per-dimension means.',\n      parameters: NO_ARGS,\n      handler: async () => explorer.coverage(),\n    },\n    {\n      name: 'explore_findings',\n      description: 'List gate-verified findings so far, sorted by descending interest.',\n      parameters: {\n        type: 'object',\n        properties: { limit: { type: 'number', description: 'max findings to return' } },\n        additionalProperties: false,\n      },\n      handler: async (args) => {\n        const limit = (args as { limit?: number } | undefined)?.limit\n        const all = explorer.findings()\n        return typeof limit === 'number' ? all.slice(0, limit) : all\n      },\n    },\n    {\n      name: 'explore_capsule',\n      description:\n        'Build the capsule artifact from the current session state. format \"data\" returns the structured CapsuleData; \"html\" returns the standalone page.',\n      parameters: {\n        type: 'object',\n        properties: {\n          format: { type: 'string', enum: ['data', 'html'] },\n          generatedAt: { type: 'string', description: 'ISO timestamp to stamp into the page' },\n        },\n        additionalProperties: false,\n      },\n      handler: async (args) => {\n        const a = (args ?? {}) as { format?: string; generatedAt?: string }\n        const capsule = explorer.capsule()\n        if (a.format === 'html') return renderCapsuleHtml(capsule, { generatedAt: a.generatedAt })\n        return capsule\n      },\n    },\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,UAAwB,OAAuB;CACtE,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;;;AChPA,MAAM,WAAW,MAAsB,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;;;;;;AASjE,SAAgB,iBAAoB,MAGZ;CACtB,OAAO,OAAO,QAAyC;EACrD,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,IAAgB;CAC/D,OAAO;EAAE,MAAM;EAAe;EAAW,WAAW,OAAO,QAAQ,IAAI,GAAG,KAAK;CAAE;AACnF;AAEA,SAAS,QACP,GACA,GACQ;CACR,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO;CACrB,MAAM,uBAAO,IAAI,IAAI,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC;CAC3D,IAAI,KAAK,SAAS,GAAG,OAAO;CAC5B,IAAI,OAAO;CACX,KAAK,MAAM,KAAK,MAAM,IAAI,EAAE,OAAO,EAAE,IAAI;CACzC,OAAO,OAAO,KAAK;AACrB;;;;;;AAOA,SAAgB,iBAAiB,YAAY,IAAgB;CAC3D,OAAO;EACL,MAAM;EACN;EACA,WAAW,IAAgB,QAA0B;GACnD,MAAM,eACJ,IAAI,cAAc,WAAW,IACzB,IACA,KAAK,IAAI,GAAG,IAAI,cAAc,KAAK,MAAM,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;GACtE,MAAM,cACJ,IAAI,mBAAmB,WAAW,IAC9B,IACA,KAAK,IAAI,GAAG,IAAI,mBAAmB,KAAK,MAAM,QAAQ,GAAG,GAAG,UAAU,CAAC,CAAC;GAC9E,OAAO,QAAQ,KAAM,eAAe,KAAM,WAAW;EACvD;CACF;AACF;;;;;;;;;;;;;;;;;AC9DA,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,YAA2C,CAAC;CAC5C,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,OAA0D;EAC9D,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,cAA4B,CAAC;EACnC,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,UAAsB;MAC1B,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,WAAyB;EACvB,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;;;;;;;;;;;AC/CA,MAAM,UAAU;CAAE,MAAM;CAAU,YAAY,CAAC;CAAG,sBAAsB;AAAM;AAE9E,SAAgB,iBAAoB,UAAiD;CACnF,OAAO;EACL;GACE,MAAM;GACN,aACE;GACF,YAAY;GACZ,SAAS,YAAY;IACnB,MAAM,EAAE,MAAM,aAAa,MAAM,SAAS,KAAK;IAC/C,OAAO;KAAE;KAAM,aAAa,SAAS;KAAQ;IAAS;GACxD;EACF;EACA;GACE,MAAM;GACN,aACE;GACF,YAAY;GACZ,SAAS,YAAY,SAAS,SAAS;EACzC;EACA;GACE,MAAM;GACN,aAAa;GACb,YAAY;IACV,MAAM;IACN,YAAY,EAAE,OAAO;KAAE,MAAM;KAAU,aAAa;IAAyB,EAAE;IAC/E,sBAAsB;GACxB;GACA,SAAS,OAAO,SAAS;IACvB,MAAM,QAAS,MAAyC;IACxD,MAAM,MAAM,SAAS,SAAS;IAC9B,OAAO,OAAO,UAAU,WAAW,IAAI,MAAM,GAAG,KAAK,IAAI;GAC3D;EACF;EACA;GACE,MAAM;GACN,aACE;GACF,YAAY;IACV,MAAM;IACN,YAAY;KACV,QAAQ;MAAE,MAAM;MAAU,MAAM,CAAC,QAAQ,MAAM;KAAE;KACjD,aAAa;MAAE,MAAM;MAAU,aAAa;KAAuC;IACrF;IACA,sBAAsB;GACxB;GACA,SAAS,OAAO,SAAS;IACvB,MAAM,IAAK,QAAQ,CAAC;IACpB,MAAM,UAAU,SAAS,QAAQ;IACjC,IAAI,EAAE,WAAW,QAAQ,OAAO,kBAAkB,SAAS,EAAE,aAAa,EAAE,YAAY,CAAC;IACzF,OAAO;GACT;EACF;CACF;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 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"}

package/dist/{hf-dataset-BR2yhuNn.js → hf-dataset-CKxIJQba.js}

@@ -1,5 +1,5 @@
-import { a as assertMinted, c as assertRolloutLine, d as isTrainableSplit, h as GATE_POLICIES, m as GATE_CHECK_IDS, n as ROLLOUT_ROLES, r as ROLLOUT_SCHEMA, v as undeclaredStepPayload } from "./schema-BuiujZ-g.js";
-import { l as toVerifiersRolloutOutputs, o as toRftItems, r as toJsonl, s as toSftRows } from "./exporters-X4xwla8A.js";
+import { a as assertMinted, c as assertRolloutLine, d as isTrainableSplit, h as GATE_POLICIES, m as GATE_CHECK_IDS, n as ROLLOUT_ROLES, r as ROLLOUT_SCHEMA, v as undeclaredStepPayload } from "./schema-CvhfLjtZ.js";
+import { a as toRftItems, o as toSftRows, r as toJsonl, s as toVerifiersRolloutOutputs } from "./exporters-DWvM16LE.js";
 import { basename, dirname, join } from "node:path";
 import { spawnSync } from "node:child_process";
 import { appendFile, mkdir, readFile, writeFile } from "node:fs/promises";
@@ -49,26 +49,6 @@ async function appendRolloutLines(path, lines) {
 async function readRolloutLedger(path) {
 	return readLines(path, (parsed, context) => assertMinted(parsed, context));
 }
-/**
-* Read a ledger under the WRITE-side policy (`validateRolloutLine`), which
-* omits the unscreened-reward check. `writeRolloutLedger` accepts a
-* supervision-journal row (`realness_screened: false` with a positive reward
-* — the documented `unscreenedRewardFields` shape), and `GATE_POLICIES` says
-* such rows "must stay writable, readable and reportable"; a read API that
-* only re-validated under `assertMinted` made every such file unreadable —
-* write-accepted but read-refused is a data-loss trap.
-*
-* The result is `RolloutLine[]`, NOT `MintedRolloutLine[]`: nothing read here
-* can reach a training exporter without passing `assertMinted`, so the
-* promotion gate (which DOES enforce unscreened-reward) is exactly as closed
-* as before. Use `readRolloutLedger` when the file is training data.
-*/
-async function readRolloutJournal(path) {
-	return readLines(path, (parsed, context) => {
-		assertRolloutLine(parsed, context);
-		return parsed;
-	});
-}
 async function readLines(path, admit) {
 	const raw = await readFile(path, "utf8");
 	const lines = [];
@@ -758,6 +738,6 @@ async function runRolloutReleaseCli(argv) {
 	return 0;
 }
 //#endregion
-export { writeRolloutLedger as S, measureFormatGate as _, addScrubCounts as a, readRolloutJournal as b, scrubLines as c, FORMAT_FILES as d, RELEASE_FORMATS as f, gatedRolloutIds as g, assertGateReport as h, runRolloutReleaseCli as i, scrubRolloutLine as l, FORMAT_GATE_DISPOSITION as m, parseRolloutReleaseArgs as n, defaultRolloutScrubber as o, buildDatasetCard as p, planPushCommand as r, emptyScrubCounts as s, buildHfDataset as t, scrubText as u, releaseRowRefs as v, readRolloutLedger as x, appendRolloutLines as y };
+export { scrubText as a, appendRolloutLines as c, scrubLines as i, readRolloutLedger as l, runRolloutReleaseCli as n, buildDatasetCard as o, defaultRolloutScrubber as r, assertGateReport as s, buildHfDataset as t, writeRolloutLedger as u };
 
-//# sourceMappingURL=hf-dataset-BR2yhuNn.js.map
+//# sourceMappingURL=hf-dataset-CKxIJQba.js.map

package/dist/hf-dataset-CKxIJQba.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hf-dataset-CKxIJQba.js","names":[],"sources":["../src/rollout/ledger.ts","../src/rollout/release/gate-report.ts","../src/rollout/release/card.ts","../src/rollout/release/scrub.ts","../src/rollout/release/hf-dataset.ts"],"sourcesContent":["/**\n * Rollout-ledger file API — append-only JSONL of validated `tangle.rollout.v1`\n * lines. Writes validate BEFORE touching disk (a bad line never lands);\n * reads validate line-by-line and fail loud with the line number, because a\n * silently-skipped rollout is a corrupted dataset.\n *\n * \"Validate\" includes the anti-Goodhart invariant (a realness-gated line may\n * not carry a positive reward), so a poisoned line can neither enter a ledger\n * nor leave one.\n *\n * Two read modes, matching the two write-side row classes: `readRolloutLedger`\n * re-validates under the mint policy (training data), `readRolloutJournal`\n * under the write policy (supervision journals, whose unscreened positive\n * rewards are writable and must stay readable).\n */\n\nimport { appendFile, mkdir, readFile, writeFile } from 'node:fs/promises'\nimport { dirname } from 'node:path'\nimport { assertMinted, assertRolloutLine, type MintedRolloutLine, type RolloutLine } from './schema'\n\nfunction serialize(lines: RolloutLine[]): string {\n  for (const [i, line] of lines.entries()) assertRolloutLine(line, `rollout line [${i}]`)\n  return lines.map((line) => JSON.stringify(line)).join('\\n') + (lines.length > 0 ? '\\n' : '')\n}\n\n/** Replace the ledger file with exactly `lines`. */\nexport async function writeRolloutLedger(path: string, lines: RolloutLine[]): Promise<void> {\n  const payload = serialize(lines)\n  await mkdir(dirname(path), { recursive: true })\n  await writeFile(path, payload)\n}\n\n/** Append `lines` to the ledger file (created if absent). */\nexport async function appendRolloutLines(path: string, lines: RolloutLine[]): Promise<void> {\n  if (lines.length === 0) return\n  const payload = serialize(lines)\n  await mkdir(dirname(path), { recursive: true })\n  await appendFile(path, payload)\n}\n\n/**\n * Read and validate every line. Throws on the first malformed/invalid line\n * (with its 1-based line number) — fail-closed, never a silent drop.\n *\n * Validation includes the anti-Goodhart invariant, which is why the result is\n * `MintedRolloutLine[]`: a ledger file is the main way a rollout reaches this\n * process from outside the type system (another run, another machine, a\n * hand-edited JSONL), so this read is the runtime boundary where a poisoned\n * line is refused rather than exported.\n */\nexport async function readRolloutLedger(path: string): Promise<MintedRolloutLine[]> {\n  return readLines(path, (parsed, context) => assertMinted(parsed, context))\n}\n\n\n\nasync function readLines<T>(\n  path: string,\n  admit: (parsed: unknown, context: string) => T,\n): Promise<T[]> {\n  const raw = await readFile(path, 'utf8')\n  const lines: T[] = []\n  const rawLines = raw.split('\\n')\n  for (let i = 0; i < rawLines.length; i++) {\n    const text = rawLines[i]\n    if (!text?.trim()) continue\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(text)\n    } catch (error) {\n      throw new Error(\n        `${path}:${i + 1}: malformed JSON — ${error instanceof Error ? error.message : String(error)}`,\n      )\n    }\n    lines.push(admit(parsed, `${path}:${i + 1}`))\n  }\n  return lines\n}\n","/**\n * Per-format accounting of the anti-Goodhart gate for one dataset release.\n *\n * The defect this exists to make impossible: a dataset card that STATES what\n * the gate does while the build does something else. A sentence in a README is\n * a claim about bytes it never reads, so it drifts the moment an exporter\n * changes — and the drift ships to whoever downloads the dataset.\n *\n * So the card is not allowed to assert anything about the gate. The build\n * measures the rows it is ABOUT TO WRITE (`measureFormatGate`), the measurement\n * is checked against the declared per-format disposition (`assertGateReport`,\n * which throws rather than warns), and the card renders only numbers handed to\n * it. A card that disagrees with its own data files cannot be produced without\n * failing the build first.\n *\n * The dispositions themselves are the release policy, stated once as data:\n *\n *   sft       EXCLUDE       — an SFT row is an imitation target. A gamed\n *                             trajectory must never be imitated, at any weight.\n *   verifiers ZERO_AND_FLAG — reward is a signed learning signal here, so a\n *                             gamed trajectory at reward 0 is a correct\n *                             negative. Dropping it would bias the negative\n *                             population toward honest failures and leave a\n *                             trainer no example of what gaming looks like\n *                             when it is penalized.\n *   rft       ZERO_AND_FLAG — RFT re-samples the completion; only the prompt\n *                             and the grader's `reference.*` verdict ship, so\n *                             nothing gamed is imitated. The flag is what lets\n *                             a grader author skip the instance.\n *   raw       ZERO_AND_FLAG — a faithful audit dump. Removing rows from it\n *                             would defeat its only purpose, and the gated\n *                             row is the one an auditor most wants.\n *\n * `ZERO_AND_FLAG` is never `reward: 0` alone. Zeroing without the label makes a\n * faked success indistinguishable from an honest failure — it hides the gamed\n * population from the buyer instead of disclosing it. Every included format\n * carries `realness_gated` on the row itself.\n *\n * And `ZERO_AND_FLAG` means the whole outcome, not the scalar. A gated row that\n * ships `reward: 0` beside the per-layer verifier scores the reward was\n * computed from has not been zeroed in any sense a trainer respects; the\n * accounting therefore measures every reward-derived number each format writes,\n * not just the one field.\n */\n\nimport type { RftItem, SftRow, VerifiersRolloutOutput } from '../exporters'\nimport {\n  GATE_CHECK_IDS,\n  GATE_POLICIES,\n  type GateCheckId,\n  undeclaredStepPayload,\n} from '../gate-checks'\nimport type { MintedRolloutLine } from '../schema'\nimport type { ReleaseFormat } from './card'\n\n/** What a format does with a line the realness gate flagged. */\nexport type GateDisposition = 'exclude' | 'zero-and-flag'\n\nexport const FORMAT_GATE_DISPOSITION: Record<ReleaseFormat, GateDisposition> = {\n  sft: 'exclude',\n  verifiers: 'zero-and-flag',\n  rft: 'zero-and-flag',\n  raw: 'zero-and-flag',\n}\n\n/** What the gate accounting reads off an emitted row, per format. */\nexport interface ReleaseRowRef {\n  rollout_id: string\n  reward: number | null\n  /**\n   * The rest of the row that was DERIVED from the reward — the per-layer score\n   * dict, the judge verdict record, whatever this format ships beside the\n   * scalar. Walked for positive numbers, so the certification is about the\n   * whole outcome rather than one field.\n   *\n   * Absent when the format's row carries nothing but the scalar. NOT the whole\n   * row: `cost.tokens_in`, `wall_s` and `total_steps` are positive numbers that\n   * have nothing to do with the reward, and a certification that flags them is\n   * a certification nobody can act on.\n   */\n  evidence?: unknown\n  /**\n   * The screen claim AS EMITTED — read off the row, not off the line it came\n   * from, because what ships is what matters. Required, not optional: an\n   * optional field is how a format quietly opts out of the check that reads it,\n   * and every emitted row shape carries `RealnessLabels` precisely so no adapter\n   * has to.\n   */\n  realness_screened: boolean | null\n  /**\n   * The part of an emitted `steps[]` the wire format does not declare.\n   *\n   * Separate from `evidence` because the declared step fields are FULL of\n   * legitimate positive numbers — `durationMs`, `llm_call_count`,\n   * `prompt_token_ids` — and a certification that flags those is one nobody can\n   * act on. Only the undeclared remainder is unclassified reward-bearing\n   * payload, which is the same partition the check applies.\n   *\n   * Set only by formats whose row carries steps: today `raw` alone.\n   */\n  stepEvidence?: unknown\n}\n\n/** A positive number found inside an emitted gated row, with where it was. */\nexport interface EmittedEvidence {\n  /** JSON-ish path from the row's evidence root, e.g. `metrics['layer.tests']`. */\n  path: string\n  value: number\n}\n\nexport interface FormatGateCounts {\n  /** Gated lines that reached this format's exporter. */\n  input: number\n  /** Gated rows the format actually wrote. */\n  emitted: number\n  /**\n   * Gated lines this format did not write. Not all of these are the gate:\n   * `verifiers` also drops gap lines (empty transcript) and `rft` drops lines\n   * with no prompt turn, so an excluded count can mix both causes.\n   */\n  excluded: number\n  /** Highest reward on an emitted gated row; `null` when none was emitted. */\n  maxEmittedReward: number | null\n  /**\n   * The largest positive number found in the reward-DERIVED payload of an\n   * emitted gated row, and its path; `null` when there is none.\n   *\n   * This column exists because the release once certified CLEAN while leaking.\n   * `assertGateReport` inspected `outcome.reward` alone, so a gated row shipping\n   * `reward: 0` next to `metrics['layer.tests']: 1` — the deterministic verifier\n   * score the reward was computed from, and the per-rubric score dict of the\n   * Prime Intellect verifiers format — passed, and the card rendered \"max reward\n   * | 0\" over a file that carried the gamed signal at full value. A wrong\n   * certification is worse than the leak: it is the leak plus a document saying\n   * there isn't one.\n   */\n  maxEmittedEvidence: EmittedEvidence | null\n  /**\n   * Rows this format wrote carrying a positive reward whose producer DECLARED\n   * that no authenticity screen ever ran on it (`realness_screened: false`).\n   *\n   * Measured over EVERY emitted row, not just the gated ones: an unscreened\n   * reward is by definition one the gate never had a verdict on, so it is not in\n   * the gated set and a measurement scoped to that set would report 0 forever.\n   * `assertMinted` already refuses these, which is exactly why the release still\n   * measures them — the last door before a public dataset does not get to assume\n   * the earlier doors held.\n   */\n  unscreenedPositiveRows: number\n  /** Highest reward on such a row; `null` when there is none. */\n  maxUnscreenedReward: number | null\n  /**\n   * The largest positive number found in an emitted gated row's UNDECLARED\n   * per-step payload, and its path; `null` when there is none.\n   *\n   * The column exists because the gate read `outcome` and nothing else for\n   * three rounds, so a gated line shipping `steps: [{kind, name, reward: 0.86}]`\n   * certified clean — the release accounting agreed with the exporter that a\n   * per-step reward was not a reward.\n   */\n  maxEmittedStepEvidence: EmittedEvidence | null\n}\n\nexport interface GateReport {\n  /** Gated lines in the release input, after the split/proposer filters. */\n  gatedLines: number\n  byFormat: Partial<Record<ReleaseFormat, FormatGateCounts>>\n}\n\n/** Rollout ids of every gated line, the key the emitted rows are matched on. */\nexport function gatedRolloutIds(lines: readonly MintedRolloutLine[]): Set<string> {\n  return new Set(lines.filter((line) => line.outcome.realness_gated).map((line) => line.rollout_id))\n}\n\n/**\n * Row refs per format. Written as one adapter per format so that the knowledge\n * of WHERE the id and reward live in each published shape sits next to the\n * assertion that uses it — an exporter that moves either field breaks here\n * rather than silently reporting zero gated rows.\n */\nexport const releaseRowRefs = {\n  // An SFT row is `{messages, metadata}` and `metadata` holds ids plus the\n  // scalar — no reward-derived payload beyond `reward` itself, and the gated\n  // disposition is EXCLUDE anyway.\n  sft: (rows: readonly SftRow[]): ReleaseRowRef[] =>\n    rows.map((row) => ({\n      rollout_id: row.metadata.rollout_id,\n      reward: row.metadata.reward,\n      realness_screened: row.metadata.realness_screened,\n    })),\n  // `metrics` IS the per-rubric score dict in the Prime Intellect verifiers\n  // format — the same numbers the reward was computed from. This is the leak\n  // that shipped.\n  verifiers: (rows: readonly VerifiersRolloutOutput[]): ReleaseRowRef[] =>\n    rows.map((row) => ({\n      rollout_id: row.info.rollout_id,\n      reward: row.reward,\n      evidence: row.metrics,\n      realness_screened: row.info.realness_screened,\n    })),\n  // RFT re-samples the completion, but the grader reads `item.reference.*`, so\n  // the verbatim judge verdict is a reward-bearing field on the row.\n  rft: (rows: readonly RftItem[]): ReleaseRowRef[] =>\n    rows.map((row) => ({\n      rollout_id: row.reference.rollout_id,\n      reward: row.reference.reward,\n      evidence: row.reference.verdict,\n      realness_screened: row.reference.realness_screened,\n    })),\n  raw: (lines: readonly MintedRolloutLine[]): ReleaseRowRef[] =>\n    lines.map((line) => ({\n      rollout_id: line.rollout_id,\n      reward: line.outcome.reward,\n      // `provenance.gated_evidence` is deliberately NOT walked: relocating the\n      // diagnostics there is what the gate DOES, and the raw config is the\n      // audit dump those diagnostics exist for.\n      evidence: { metrics: line.outcome.metrics, verdict: line.outcome.verdict },\n      // `raw` is the only config that writes the whole line, so it is the only\n      // one whose rows can carry a per-step reward.\n      stepEvidence: undeclaredStepPayload(line.steps),\n      realness_screened: line.outcome.realness_screened ?? null,\n    })),\n}\n\n/** Every positive finite number inside a row's reward-derived payload, with its path. */\nfunction positiveNumbersIn(value: unknown, path: string): EmittedEvidence[] {\n  if (typeof value === 'number') {\n    return Number.isFinite(value) && value > 0 ? [{ path, value }] : []\n  }\n  if (Array.isArray(value)) {\n    return value.flatMap((item, i) => positiveNumbersIn(item, `${path}[${i}]`))\n  }\n  if (typeof value === 'object' && value !== null) {\n    return Object.entries(value).flatMap(([key, child]) =>\n      positiveNumbersIn(child, path === '' ? key : `${path}.${key}`),\n    )\n  }\n  return []\n}\n\n/** Measure one format's gated rows from the refs of the rows about to be written. */\nexport function measureFormatGate(\n  gated: ReadonlySet<string>,\n  refs: readonly ReleaseRowRef[],\n): FormatGateCounts {\n  const emitted = refs.filter((ref) => gated.has(ref.rollout_id))\n  const rewards = emitted.map((ref) => ref.reward).filter((r): r is number => r !== null)\n  const evidence = emitted.flatMap((ref) => positiveNumbersIn(ref.evidence, ''))\n  const stepEvidence = emitted.flatMap((ref) => positiveNumbersIn(ref.stepEvidence, 'steps'))\n  const unscreened = refs\n    .filter((ref) => ref.realness_screened === false)\n    .map((ref) => ref.reward)\n    .filter((r): r is number => r !== null && r > 0)\n  return {\n    input: gated.size,\n    emitted: emitted.length,\n    excluded: gated.size - emitted.length,\n    maxEmittedReward: rewards.length === 0 ? null : Math.max(...rewards),\n    maxEmittedEvidence: evidence.reduce<EmittedEvidence | null>(\n      (best, found) => (best === null || found.value > best.value ? found : best),\n      null,\n    ),\n    unscreenedPositiveRows: unscreened.length,\n    maxUnscreenedReward: unscreened.length === 0 ? null : Math.max(...unscreened),\n    maxEmittedStepEvidence: stepEvidence.reduce<EmittedEvidence | null>(\n      (best, found) => (best === null || found.value > best.value ? found : best),\n      null,\n    ),\n  }\n}\n\n/**\n * The measured form of each canonical gate check, over the rows a release is\n * ABOUT TO WRITE. Returns the failure message, or `null` when the format is\n * clean on that check.\n *\n * TOTAL over `GateCheckId` — this map and `GATE_POLICIES.assertGateReport` are\n * the two things a new check breaks here, so the release certifier cannot be\n * left behind by a check added anywhere else in the package. That is the whole\n * point: for four rounds each guard composed its own subset by hand, and a\n * release certifying CLEAN while leaking is the most expensive version of that\n * mistake, because it is the leak plus a document saying there isn't one.\n */\nconst REPORT_MEASURES: {\n  readonly [K in GateCheckId]: (format: ReleaseFormat, counts: FormatGateCounts) => string | null\n} = {\n  'reward-relationship': (format, counts) =>\n    counts.maxEmittedReward === null || counts.maxEmittedReward <= 0\n      ? null\n      : `release format \"${format}\": ${counts.emitted} realness-gated row(s) carry a positive ` +\n        `reward (max ${counts.maxEmittedReward}). A run flagged as gamed may not ship a ` +\n        'positive reward in any config.',\n  'gated-evidence': (format, counts) => {\n    if (counts.maxEmittedEvidence === null) return null\n    const { path, value } = counts.maxEmittedEvidence\n    return (\n      `release format \"${format}\": ${counts.emitted} realness-gated row(s) carry a positive ` +\n      `reward-derived number (${path} = ${value}). Zeroing the scalar is not enough — the ` +\n      'per-layer scores and judge verdict a fabricated reward was computed FROM are the ' +\n      'same signal in component form, and in this format they are read as training input. ' +\n      'They belong in `provenance.gated_evidence` (see `gateGamedOutcome`), not on the row.'\n    )\n  },\n  'undeclared-step-payload': (format, counts) => {\n    if (counts.maxEmittedStepEvidence === null) return null\n    const { path, value } = counts.maxEmittedStepEvidence\n    return (\n      `release format \"${format}\": ${counts.emitted} realness-gated row(s) carry a positive ` +\n      `per-step number under a field \\`tangle.rollout.v1\\` does not declare (${path} = ${value}). ` +\n      'A per-step reward is the same training signal as the scalar, in credit-assignment form, ' +\n      'and the exporters copy `steps` through verbatim — so the row ships it beside a `reward` ' +\n      'of 0. It belongs in `provenance.gated_evidence.steps` (see `gateGamedOutcome`).'\n    )\n  },\n  'unscreened-reward': (format, counts) =>\n    counts.maxUnscreenedReward === null\n      ? null\n      : `release format \"${format}\": ${counts.unscreenedPositiveRows} row(s) carry a positive ` +\n        `reward (max ${counts.maxUnscreenedReward}) whose producer declares that NO authenticity ` +\n        'screen ran on it (`realness_screened: false`). Nothing has established those successes ' +\n        'are real, and a published dataset may not present an unqualified verdict as a measured ' +\n        'one. Screen the runs, or publish them at `reward: null`.',\n}\n\n/**\n * Fail the build when the measurement disagrees with the declared policy.\n *\n * Throws, never filters: an emitted positive reward on a gated row means an\n * exporter upstream stopped applying the gate, and silently dropping the row\n * would hide the producer that made it — the producer is the actual defect.\n *\n * Certifies the whole emitted outcome, not `reward` alone. The earlier version\n * checked one field and therefore certified a release CLEAN while its\n * `verifiers/train.jsonl` shipped the gamed run's per-layer scores at 1.0 in\n * the top-level `metrics` dict — the card then rendered \"max reward | 0\" over\n * exactly that file. A certification that is wrong is worse than an\n * uncertified leak, so the checks it runs are no longer written down here at\n * all: it iterates `GATE_CHECK_IDS` under its own declared policy.\n */\nexport function assertGateReport(report: GateReport): void {\n  for (const [format, counts] of Object.entries(report.byFormat) as Array<\n    [ReleaseFormat, FormatGateCounts]\n  >) {\n    for (const id of GATE_CHECK_IDS) {\n      if (GATE_POLICIES.assertGateReport[id].kind !== 'enforce') continue\n      const failure = REPORT_MEASURES[id](format, counts)\n      if (failure !== null) throw new Error(failure)\n    }\n    // Not a gate check: this one is the RELEASE POLICY (`FORMAT_GATE_DISPOSITION`)\n    // rather than the anti-Goodhart invariant — it asks whether the format did\n    // what it said it would with gated rows, not whether a row is poisoned.\n    if (FORMAT_GATE_DISPOSITION[format] === 'exclude' && counts.emitted > 0) {\n      throw new Error(\n        `release format \"${format}\" declares gated lines EXCLUDED but wrote ${counts.emitted} ` +\n          'of them.',\n      )\n    }\n  }\n}\n","/**\n * HuggingFace dataset-card (README.md) generation for a rollout-ledger release.\n *\n * The card is a pure function of the SCRUBBED lines plus the release options —\n * no timestamps, no environment reads — so rebuilding from the same ledger\n * yields byte-identical output. It documents the schema, provenance (run ids,\n * generations, the official judge), per-role reward semantics including the\n * inherited/contribution caveat, and a role × reward counts table.\n */\n\nimport { type MintedRolloutLine, ROLLOUT_ROLES, ROLLOUT_SCHEMA, type RolloutRole } from '../schema'\nimport { assertGateReport, FORMAT_GATE_DISPOSITION, type GateReport } from './gate-report'\nimport type { ScrubCounts } from './scrub'\n\nexport const RELEASE_FORMATS = ['sft', 'verifiers', 'rft', 'raw'] as const\nexport type ReleaseFormat = (typeof RELEASE_FORMATS)[number]\n\n/** Format → data file path inside the dataset dir (train split only). */\nexport const FORMAT_FILES: Record<ReleaseFormat, string> = {\n  sft: 'sft/train.jsonl',\n  verifiers: 'verifiers/train.jsonl',\n  rft: 'rft/train.jsonl',\n  raw: 'raw/train.jsonl',\n}\n\nconst FORMAT_DESCRIPTIONS: Record<ReleaseFormat, string> = {\n  sft: 'Successful trainable-split transcripts (`reward >= 1`, never realness-gated) as `{messages, metadata}` chat JSONL.',\n  verifiers:\n    'Prime Intellect verifiers `RolloutOutput`: prompt/completion split at the first assistant turn, plus reward, metrics, tool defs, and token usage.',\n  rft: 'OpenAI RFT items: prompt turns plus `reference.*` verdict fields for a grader (completions are re-sampled during RFT).',\n  raw: `Full \\`${ROLLOUT_SCHEMA}\\` ledger lines (scrubbed), one per agent invocation.`,\n}\n\nexport interface DatasetCardInputs {\n  /** Scrubbed, release-filtered lines (what actually ships). */\n  lines: MintedRolloutLine[]\n  formats: ReleaseFormat[]\n  includeProposers: boolean\n  /** Source ledger basenames, for provenance. */\n  sourceFiles: string[]\n  scrubTotals: ScrubCounts\n  excluded: { proposers: number; nonTrain: number }\n  formatCounts: Partial<Record<ReleaseFormat, number>>\n  /**\n   * Per-format anti-Goodhart accounting MEASURED on the rows the build wrote.\n   * Required, not optional: the card's only statement about the gate is a\n   * render of these numbers, so a card cannot be produced without them and\n   * cannot drift from the data files it ships beside.\n   */\n  gate: GateReport\n}\n\nfunction unique(values: Array<string | null>): string[] {\n  return [...new Set(values.filter((v): v is string => v !== null))].sort()\n}\n\nfunction formatReward(reward: number | null): string {\n  if (reward === null) return 'null'\n  return Number.isInteger(reward) ? String(reward) : reward.toFixed(4)\n}\n\nfunction markdownTable(header: string[], rows: string[][]): string {\n  return [\n    `| ${header.join(' | ')} |`,\n    `| ${header.map(() => '---').join(' | ')} |`,\n    ...rows.map((row) => `| ${row.join(' | ')} |`),\n  ].join('\\n')\n}\n\n/** Where the anti-Goodhart flag lives on each format's emitted row. */\nconst GATE_FLAG_FIELD: Record<ReleaseFormat, string> = {\n  sft: '— (no gated row is written)',\n  verifiers: '`info.realness_gated`',\n  rft: '`reference.realness_gated`',\n  raw: '`outcome.realness_gated`',\n}\n\nconst GATE_POLICY_LABEL: Record<ReleaseFormat, string> = {\n  sft: 'EXCLUDED — an SFT row is an imitation target',\n  verifiers: 'INCLUDED, reward forced to 0, flagged',\n  rft: 'INCLUDED, reward forced to 0, flagged',\n  raw: 'INCLUDED verbatim, flagged',\n}\n\nfunction gateSection(formats: ReleaseFormat[], gate: GateReport, totalLines: number): string {\n  const rows = formats.map((format) => {\n    const counts = gate.byFormat[format]\n    return [\n      format,\n      GATE_POLICY_LABEL[format],\n      String(counts?.emitted ?? 0),\n      String(counts?.excluded ?? 0),\n      counts?.maxEmittedReward === null || counts === undefined\n        ? '—'\n        : formatReward(counts.maxEmittedReward),\n      counts?.maxEmittedEvidence == null\n        ? '—'\n        : `${counts.maxEmittedEvidence.path} = ${counts.maxEmittedEvidence.value}`,\n      GATE_FLAG_FIELD[format],\n    ]\n  })\n  const mixedExclusion = formats.some(\n    (format) => FORMAT_GATE_DISPOSITION[format] === 'zero-and-flag',\n  )\n  return [\n    `\\`outcome.realness_gated: true\\` marks a run whose success signal was faked (it satisfied the proxy without doing the work). **${gate.gatedLines} of ${totalLines} lines in this release are gated.**`,\n    '',\n    'The gate is enforced, not asserted. A line pairing `realness_gated: true` with a reward above 0 is rejected by the schema validator, so it cannot be read out of a source ledger or written into `raw/train.jsonl` at all; on a gated line the numbers the reward was computed from (`outcome.metrics`, the verbatim judge `outcome.verdict`, and any per-step field the schema does not declare — a per-step reward is the same signal in credit-assignment form) are moved out of `outcome` and `steps[]` and into `provenance.gated_evidence`, where no config reads them as training input; the exporters re-check the same invariant on every line; and the release build measures the rows it is about to write and refuses to write ANY file if a gated row carries a positive reward — or any positive number derived from one — in ANY config.',\n    '',\n    'The table below is **measured on the rows in this release**, not a description of intent — the build counts the emitted rows and this card renders those counts:',\n    '',\n    markdownTable(\n      [\n        'config',\n        'policy',\n        'gated rows written',\n        'gated rows not written',\n        'max reward',\n        'max reward-derived number',\n        'flag',\n      ],\n      rows,\n    ),\n    '',\n    'Why gated rows are kept where they are kept: an SFT row is imitated verbatim, so a gamed trajectory must never appear in one at any weight. In `verifiers` the reward is a signed learning signal, and a gamed trajectory at reward 0 is a correct negative — dropping it would bias the negative population toward honest failures and leave a trainer no example of gaming being penalized. `rft` re-samples the completion, so only the prompt and the grader reference ship. `raw` is a faithful audit dump, where the gated row is the one an auditor most wants.',\n    '',\n    \"Reward 0 is never the only label: every included config carries the flag on the row itself, because zeroing alone makes a faked success indistinguishable from an honest failure. Filter on the flag to drop the gamed population, or select on it to mine it. The gated run's own measurements are not destroyed either — they are parked verbatim under `provenance.gated_evidence` in `raw/train.jsonl`, which is where an auditor can see what the run claimed and why it was flagged.\",\n    mixedExclusion\n      ? '\\n\"Gated rows not written\" is not all gate: `verifiers` also drops gap lines (empty transcript) and `rft` drops lines with no prompt turn, so that column can mix both causes.'\n      : '',\n  ]\n    .join('\\n')\n    .trimEnd()\n}\n\nfunction roleRewardRows(lines: MintedRolloutLine[]): string[][] {\n  const counts = new Map<RolloutRole, Map<string, number>>()\n  for (const line of lines) {\n    const byReward = counts.get(line.role) ?? new Map<string, number>()\n    const key = formatReward(line.outcome.reward)\n    byReward.set(key, (byReward.get(key) ?? 0) + 1)\n    counts.set(line.role, byReward)\n  }\n  const rows: string[][] = []\n  for (const role of ROLLOUT_ROLES) {\n    const byReward = counts.get(role)\n    if (!byReward) continue\n    const keys = [...byReward.keys()].sort((a, b) => {\n      if (a === 'null') return 1\n      if (b === 'null') return -1\n      return Number(b) - Number(a)\n    })\n    for (const key of keys) rows.push([role, key, String(byReward.get(key))])\n  }\n  return rows\n}\n\nexport function buildDatasetCard(inputs: DatasetCardInputs): string {\n  const {\n    lines,\n    formats,\n    includeProposers,\n    sourceFiles,\n    scrubTotals,\n    excluded,\n    formatCounts,\n    gate,\n  } = inputs\n  // The card is the artifact a buyer reads; it may not render a gate report\n  // that violates the release policy even when called outside the build.\n  assertGateReport(gate)\n\n  const runIds = unique(lines.map((line) => line.run_id))\n  const generations = [...new Set(lines.map((line) => line.generation))]\n    .filter((g): g is number => g !== null)\n    .sort((a, b) => a - b)\n  const models = unique(lines.map((line) => line.policy.model))\n  const harnesses = unique(lines.map((line) => line.policy.harness))\n  const captures = unique(lines.map((line) => line.provenance.capture))\n  const rewardSources = unique(lines.map((line) => line.outcome.reward_source))\n  const gapLines = lines.filter((line) => line.messages.length === 0).length\n  const gatedLines = lines.filter((line) => line.outcome.realness_gated).length\n  if (gatedLines !== gate.gatedLines) {\n    throw new Error(\n      `dataset card: gate report claims ${gate.gatedLines} realness-gated line(s) but the lines ` +\n        `it describes contain ${gatedLines} — the card and the build measured different data.`,\n    )\n  }\n\n  const configs = formats\n    .map((format) =>\n      [\n        `  - config_name: ${format}`,\n        '    data_files:',\n        '      - split: train',\n        `        path: ${FORMAT_FILES[format]}`,\n      ].join('\\n'),\n    )\n    .join('\\n')\n\n  const frontmatter = [\n    '---',\n    'license: unknown',\n    'pretty_name: Tangle rollout ledger — agent trajectories',\n    'configs:',\n    configs,\n    '---',\n  ].join('\\n')\n\n  const formatsTable = markdownTable(\n    ['config', 'path', 'rows', 'contents'],\n    formats.map((format) => [\n      format,\n      `\\`${FORMAT_FILES[format]}\\``,\n      String(formatCounts[format] ?? 0),\n      FORMAT_DESCRIPTIONS[format],\n    ]),\n  )\n\n  const countsTable = markdownTable(['role', 'reward', 'lines'], roleRewardRows(lines))\n\n  const scrubTable = markdownTable(\n    ['rule', 'rewrites'],\n    Object.entries(scrubTotals).map(([rule, count]) => [rule, String(count)]),\n  )\n\n  const proposerNote = includeProposers\n    ? 'Proposer sessions are INCLUDED (`--include-proposers`); their transcripts contain improvement-loop harness source.'\n    : `Proposer sessions are excluded by default (${excluded.proposers} lines dropped); they contain improvement-loop harness source. Rebuild with \\`--include-proposers\\` to keep them.`\n\n  return `${frontmatter}\n\n# Tangle rollout ledger — agent trajectories\n\nOne line per agent invocation (supervisor episode, worker session, proposer shot, judge call, analyst pass) captured by the \\`${ROLLOUT_SCHEMA}\\` rollout ledger, labeled with improvement-loop coordinates and the official-judge reward, with the full message transcript inline.\n\nThis release contains the **trainable split only** (\\`search\\`). Holdout, dev, and canary splits are structurally excluded at build time, and the build additionally drops any non-trainable line as a fail-closed filter (${excluded.nonTrain} dropped here).\n\n## Formats\n\n${formatsTable}\n\n## Anti-Goodhart gate (\\`realness_gated\\`)\n\n${gateSection(formats, gate, lines.length)}\n\n## Schema (\\`${ROLLOUT_SCHEMA}\\`)\n\nEach raw line carries:\n\n- \\`rollout_id\\` / \\`parent_rollout_id\\` — invocation identity; workers point at their spawning supervisor episode.\n- \\`run_id\\`, \\`experiment_id\\`, \\`candidate_id\\` — run/experiment/candidate identity from the producing RunRecord, when present.\n- \\`generation\\`, \\`candidate_index\\` — improvement-loop coordinates (\\`-1\\` = baseline campaign; \\`null\\` = not an improvement loop).\n- \\`role\\` — one of ${ROLLOUT_ROLES.map((role) => `\\`${role}\\``).join(', ')}.\n- \\`task\\` — suite, instance id, split, seed, replicate index.\n- \\`policy\\` — harness, model, provider, profile commit, prompt/config hashes, sampling params.\n- \\`messages\\` / \\`tool_defs\\` — full transcript in canonical OpenAI chat-with-tools form (including \\`reasoning_content\\`). An empty \\`messages\\` array is a labeled gap line; \\`provenance.gap\\` says why the transcript could not be recovered (${gapLines} gap lines in this release).\n- \\`outcome\\` — \\`reward\\` (the single scalar), \\`reward_source\\`, the verbatim judge \\`verdict\\`, non-scalar \\`metrics\\`, and \\`realness_gated\\` (anti-Goodhart flag; see [Anti-Goodhart gate](#anti-goodhart-gate-realness_gated) for the per-config treatment and the measured counts).\n- \\`cost\\` — usd, token counts, wall time.\n- \\`artifacts\\` / \\`provenance\\` — patch/run-dir/transcript pointers (scrubbed) and capture metadata.\n\n## Provenance\n\n- Source ledgers: ${sourceFiles.map((file) => `\\`${file}\\``).join(', ')}\n- Run ids: ${runIds.map((id) => `\\`${id}\\``).join(', ')}\n- Generations: ${generations.join(', ')} (\\`-1\\` = baseline campaign)\n- Models: ${models.map((m) => `\\`${m}\\``).join(', ')}\n- Harnesses: ${harnesses.map((h) => `\\`${h}\\``).join(', ')}\n- Capture modes: ${captures.join(', ')}\n- Every reward traces to a named source (reward sources in this release: ${rewardSources.map((s) => `\\`${s}\\``).join(', ')}).\n\n${proposerNote}\n\n## Reward semantics per role\n\n- **agent** — the producing RunRecord's holdout/search score, with the realness gate forcing gamed successes to 0.\n- **supervisor** — the official-judge verdict on the episode's delivered artifact (1 = resolved, 0 = not).\n- **worker** — INHERITED from the parent supervisor episode (\\`…/inherited\\`). Caveat: reward 1 does not establish this worker's individual contribution (sibling workers in the same episode share the episode outcome), and reward 0 does not prove this worker failed.\n- **proposer** — the fraction of improvement-set instances the proposed candidate resolved (\\`…/candidate-resolved-fraction\\`); a scalar in [0, 1], not a binary verdict.\n- **judge / analyst** — carry the episode verdict where one applies; otherwise \\`reward: null\\` (a labeled gap, never 0).\n\n## Counts\n\n${countsTable}\n\nTotal lines: ${lines.length}\n\n## Scrubbing\n\nAbsolute home paths were rewritten to \\`$WORK\\`, credential-shaped strings were replaced with \\`[REDACTED:<kind>]\\` markers, internal hostnames were normalized to \\`*.internal.example\\`, and username-bearing incidentals (\\`ls -l\\` owner columns, per-user pytest tmpdirs) were normalized to \\`user\\` / \\`$USER\\`. Rewrite counts for this release (full per-file breakdown in \\`scrub-report.json\\`):\n\n${scrubTable}\n\n## License\n\n\\`license: unknown\\` is a placeholder — the releasing operator must set the real SPDX license id in the frontmatter above before publishing.\n\n## Citation\n\n\\`\\`\\`bibtex\n@misc{tangle_rollout_ledger,\n  title = {Tangle rollout ledger — agent trajectories},\n  author = {{Tangle Network}},\n  howpublished = {HuggingFace Datasets},\n  note = {Operator: fill in the repository URL, authors, and year before publishing}\n}\n\\`\\`\\`\n`\n}\n","/**\n * Deterministic scrubbing pass over rollout-ledger lines before public release.\n *\n * Every rule is a pure regex rewrite applied to every string value in a line\n * (messages, artifacts, run ids, tool arguments — everywhere), so the scrubbed\n * line is still a valid `tangle.rollout.v1` line. Rules are idempotent:\n * scrub(scrub(x)) === scrub(x), and a second pass counts zero hits — that is\n * the property the release pipeline relies on to prove nothing half-scrubbed\n * ships. Rule order matters: whole `KEY=value` env pairs are redacted before\n * the bare-key rule so one secret is never counted twice.\n */\n\nimport { assertMinted, type MintedRolloutLine } from '../schema'\n\nexport interface ScrubRule {\n  name: string\n  pattern: RegExp\n  /** Rewrite for one match; `g1` is the first capture group when present. */\n  rewrite: (match: string, g1?: string) => string\n}\n\nconst SCRUB_RULES: readonly ScrubRule[] = [\n  {\n    // /home/<user> and /Users/<user> prefixes → $WORK ($HOME-derived paths).\n    name: 'home-path',\n    pattern: /\\/(?:home|Users)\\/[A-Za-z0-9._-]+/g,\n    rewrite: () => '$WORK',\n  },\n  {\n    // Harness stores encode cwd as a dashed path segment (-home-drew-…);\n    // strip the leading -home-<user> so the username never ships.\n    name: 'home-path-encoded',\n    pattern: /(?<=\\/)-(?:home|Users)-[A-Za-z0-9_.]+/g,\n    rewrite: () => '$WORK',\n  },\n  {\n    // pytest names its tmpdir after the invoking user (/tmp/pytest-of-drew).\n    name: 'tmp-user-dir',\n    pattern: /\\/tmp\\/pytest-of-[A-Za-z0-9._-]+/g,\n    rewrite: () => '/tmp/pytest-of-$USER',\n  },\n  {\n    // `ls -l` owner/group columns leak the username in captured tool output.\n    // The `(?!user user…)` guard keeps a second pass at zero rewrites.\n    name: 'ls-owner',\n    pattern:\n      /([-bcdlps][-rwxsStT]{9}[.+@]?\\s+\\d+\\s+)(?!user user(?=\\s))[A-Za-z0-9._-]+\\s+[A-Za-z0-9._-]+(?=\\s)/g,\n    rewrite: (_match, prefix) => `${prefix}user user`,\n  },\n  {\n    // Env-var-shaped secrets: NAME=value where NAME looks credential-bearing.\n    // The (?!\\[REDACTED:) guard keeps the rule idempotent on its own output.\n    name: 'env-secret',\n    pattern:\n      /\\b([A-Z][A-Z0-9_]*(?:KEY|TOKEN|SECRET|PASSWORD|PASSWD|CREDENTIALS?))=(?!\\[REDACTED:)(\"[^\"]*\"|'[^']*'|[^\\s\"']+)/g,\n    rewrite: (_match, name) => `${name}=[REDACTED:env]`,\n  },\n  {\n    name: 'bearer-token',\n    pattern: /\\b(Bearer|Basic)\\s+(?!\\[REDACTED:)[A-Za-z0-9\\-._~+/=]{8,}/g,\n    rewrite: (_match, scheme) => `${scheme} [REDACTED:bearer]`,\n  },\n  {\n    // Bare provider-prefixed keys (OpenAI/Anthropic sk-, GitHub ghp_/gho_/…,\n    // fine-grained PATs, HuggingFace hf_, Slack xox*, AWS AKIA).\n    name: 'api-key',\n    pattern:\n      /\\b(?:sk-[A-Za-z0-9_-]{16,}|gh[pousr]_[A-Za-z0-9]{16,}|github_pat_[A-Za-z0-9_]{20,}|hf_[A-Za-z0-9]{16,}|xox[baprs]-[A-Za-z0-9-]{10,}|AKIA[0-9A-Z]{16})\\b/g,\n    rewrite: () => '[REDACTED:api-key]',\n  },\n  {\n    // Our infra hostnames → placeholder domain, subdomain preserved\n    // (router.tangle.tools → router.internal.example).\n    name: 'infra-host',\n    pattern: /(?<![A-Za-z0-9.-])((?:[A-Za-z0-9-]+\\.)*)tangle\\.(?:tools|network)(?![A-Za-z0-9-])/g,\n    rewrite: (_match, prefix) => `${prefix ?? ''}internal.example`,\n  },\n  {\n    // Known workstation hostnames leak through email Message-IDs and fqdn\n    // lookups inside captured test output; extend the list as machines join.\n    name: 'machine-host',\n    pattern: /\\b[A-Za-z0-9]+-GTR-Pro\\b/g,\n    rewrite: () => 'workstation',\n  },\n]\n\n/** Rule name → number of matches rewritten. Always carries every rule (0 is data). */\nexport type ScrubCounts = Record<string, number>\n\nexport function emptyScrubCounts(): ScrubCounts {\n  return Object.fromEntries(SCRUB_RULES.map((rule) => [rule.name, 0]))\n}\n\nexport function addScrubCounts(into: ScrubCounts, from: ScrubCounts): ScrubCounts {\n  for (const [name, count] of Object.entries(from)) into[name] = (into[name] ?? 0) + count\n  return into\n}\n\nexport function scrubText(text: string, counts: ScrubCounts): string {\n  let out = text\n  for (const rule of SCRUB_RULES) {\n    out = out.replace(rule.pattern, (match: string, ...rest: unknown[]) => {\n      counts[rule.name] = (counts[rule.name] ?? 0) + 1\n      return rule.rewrite(match, typeof rest[0] === 'string' ? rest[0] : undefined)\n    })\n  }\n  return out\n}\n\nfunction scrubValue(value: unknown, counts: ScrubCounts): unknown {\n  if (typeof value === 'string') return scrubText(value, counts)\n  if (Array.isArray(value)) return value.map((item) => scrubValue(item, counts))\n  if (value !== null && typeof value === 'object') {\n    const out: Record<string, unknown> = {}\n    for (const [key, item] of Object.entries(value)) out[key] = scrubValue(item, counts)\n    return out\n  }\n  return value\n}\n\n/**\n * Scrub every string value in a line; structure and key order are preserved.\n *\n * `assertMinted` on the way out rather than a cast: scrubbing rebuilds the\n * object, so the brand has to be re-earned, and re-validating proves the rules\n * did not rewrite a field the schema constrains (`reward` is a number, not a\n * string, so no rule should ever touch it — this is what checks that).\n */\nfunction scrubRolloutLine(line: MintedRolloutLine, counts: ScrubCounts): MintedRolloutLine {\n  return assertMinted(scrubValue(line, counts), `scrubbed rollout line ${line.rollout_id}`)\n}\n\nexport function scrubLines(lines: MintedRolloutLine[]): {\n  lines: MintedRolloutLine[]\n  counts: ScrubCounts\n} {\n  const counts = emptyScrubCounts()\n  return { lines: lines.map((line) => scrubRolloutLine(line, counts)), counts }\n}\n\n/**\n * A `RolloutScrubber` (text → text) applying the full rule set — the\n * default hook to pass to `mintRolloutRows({ scrub })` so lines are\n * scrubbed at mint time, before they ever reach a ledger file. Release\n * builds re-run `scrubLines` regardless (idempotent), so double-scrubbing\n * is safe and counted as zero.\n */\nexport function defaultRolloutScrubber(text: string): string {\n  return scrubText(text, emptyScrubCounts())\n}\n","/**\n * One-command HuggingFace dataset release from rollout ledgers:\n *\n *   agent-eval rollout-release <ledger.jsonl...> --out <dir> \\\n *     [--formats sft,verifiers,rft,raw] [--include-proposers] [--push <org/name>]\n *\n * Pipeline per input ledger: read + validate → fail-closed filters\n * (trainable split only; proposer sessions dropped unless\n * --include-proposers, they contain improvement-loop harness source) →\n * deterministic scrub → export the requested formats + scrub-report.json +\n * auto-generated README.md card. Deterministic: same inputs and flags →\n * byte-identical output dir.\n *\n * --push uploads the built dir with `huggingface-cli upload` only when the\n * CLI exists on PATH and HF_TOKEN is present in the env; the token is\n * never printed. Everything else runs fully offline.\n */\n\nimport { spawnSync } from 'node:child_process'\nimport { mkdir, writeFile } from 'node:fs/promises'\nimport { basename, dirname, join } from 'node:path'\nimport { toJsonl, toRftItems, toSftRows, toVerifiersRolloutOutputs } from '../exporters'\nimport { readRolloutLedger, writeRolloutLedger } from '../ledger'\nimport { isTrainableSplit, type MintedRolloutLine } from '../schema'\nimport { buildDatasetCard, FORMAT_FILES, RELEASE_FORMATS, type ReleaseFormat } from './card'\nimport {\n  assertGateReport,\n  FORMAT_GATE_DISPOSITION,\n  type GateReport,\n  gatedRolloutIds,\n  measureFormatGate,\n  releaseRowRefs,\n} from './gate-report'\nimport { addScrubCounts, emptyScrubCounts, type ScrubCounts, scrubLines } from './scrub'\n\nexport interface BuildOptions {\n  out: string\n  formats: ReleaseFormat[]\n  includeProposers: boolean\n}\n\nexport interface ScrubReport {\n  /** Input ledger path → rule → rewrite count (only shipped lines are scrubbed). */\n  files: Record<string, ScrubCounts>\n  totals: ScrubCounts\n  excluded: { proposers: number; nonTrain: number }\n}\n\nexport interface BuildSummary {\n  inputs: string[]\n  read: number\n  kept: number\n  scrub: ScrubReport\n  formatCounts: Partial<Record<ReleaseFormat, number>>\n  /** Per-format anti-Goodhart accounting, measured on the rows written. */\n  gate: GateReport\n  files: string[]\n}\n\nexport async function buildHfDataset(\n  inputs: string[],\n  options: BuildOptions,\n): Promise<BuildSummary> {\n  if (inputs.length === 0) throw new Error('no input ledgers given')\n  if (options.formats.length === 0) throw new Error('no formats selected')\n\n  const report: ScrubReport = {\n    files: {},\n    totals: emptyScrubCounts(),\n    excluded: { proposers: 0, nonTrain: 0 },\n  }\n  const kept: MintedRolloutLine[] = []\n  let read = 0\n\n  for (const input of inputs) {\n    const lines = await readRolloutLedger(input)\n    read += lines.length\n    const shippable = lines.filter((line) => {\n      if (!isTrainableSplit(line.task.split)) {\n        report.excluded.nonTrain += 1\n        return false\n      }\n      if (!options.includeProposers && line.role === 'proposer') {\n        report.excluded.proposers += 1\n        return false\n      }\n      return true\n    })\n    const scrubbed = scrubLines(shippable)\n    report.files[input] = scrubbed.counts\n    addScrubCounts(report.totals, scrubbed.counts)\n    kept.push(...scrubbed.lines)\n  }\n\n  const formatCounts: Partial<Record<ReleaseFormat, number>> = {}\n  const files: string[] = []\n  const gated = gatedRolloutIds(kept)\n  const gate: GateReport = { gatedLines: gated.size, byFormat: {} }\n\n  // Every selected format's rows are exported and gate-measured BEFORE the\n  // first byte is written. A build that would ship a gamed run at a positive\n  // reward fails with nothing on disk, rather than leaving a poisoned config\n  // behind for someone to `--push`.\n  const pending: Array<{ path: string; write: () => Promise<void> }> = []\n\n  for (const format of options.formats) {\n    const path = join(options.out, FORMAT_FILES[format])\n    if (format === 'raw') {\n      // writeRolloutLedger re-validates every scrubbed line before it lands.\n      gate.byFormat.raw = measureFormatGate(gated, releaseRowRefs.raw(kept))\n      formatCounts.raw = kept.length\n      pending.push({ path, write: () => writeRolloutLedger(path, kept) })\n    } else if (format === 'sft') {\n      const rows = toSftRows(kept)\n      gate.byFormat.sft = measureFormatGate(gated, releaseRowRefs.sft(rows))\n      formatCounts.sft = rows.length\n      pending.push({ path, write: () => writeFile(path, toJsonl(rows)) })\n    } else if (format === 'verifiers') {\n      // The declared disposition drives the exporter: 'zero-and-flag' ships\n      // gated lines and honest failures as labeled negatives at reward 0.\n      const outputs = toVerifiersRolloutOutputs(kept, {\n        gatedLines: FORMAT_GATE_DISPOSITION.verifiers,\n      })\n      gate.byFormat.verifiers = measureFormatGate(gated, releaseRowRefs.verifiers(outputs))\n      formatCounts.verifiers = outputs.length\n      pending.push({ path, write: () => writeFile(path, toJsonl(outputs)) })\n    } else {\n      const items = toRftItems(kept, { gatedLines: FORMAT_GATE_DISPOSITION.rft })\n      gate.byFormat.rft = measureFormatGate(gated, releaseRowRefs.rft(items))\n      formatCounts.rft = items.length\n      pending.push({ path, write: () => writeFile(path, toJsonl(items)) })\n    }\n  }\n\n  assertGateReport(gate)\n\n  for (const { path, write } of pending) {\n    await mkdir(dirname(path), { recursive: true })\n    await write()\n    files.push(path)\n  }\n\n  const reportPath = join(options.out, 'scrub-report.json')\n  await writeFile(reportPath, `${JSON.stringify(report, null, 2)}\\n`)\n  files.push(reportPath)\n\n  const cardPath = join(options.out, 'README.md')\n  await writeFile(\n    cardPath,\n    buildDatasetCard({\n      lines: kept,\n      formats: options.formats,\n      includeProposers: options.includeProposers,\n      sourceFiles: inputs.map((input) => basename(input)),\n      scrubTotals: report.totals,\n      excluded: report.excluded,\n      formatCounts,\n      gate,\n    }),\n  )\n  files.push(cardPath)\n\n  return { inputs, read, kept: kept.length, scrub: report, formatCounts, gate, files }\n}\n\nfunction planPushCommand(repo: string, outDir: string): string[] {\n  return ['huggingface-cli', 'upload', repo, outDir, '.', '--repo-type', 'dataset']\n}\n\nfunction pushDataset(repo: string, outDir: string): void {\n  const found = spawnSync('which', ['huggingface-cli'], { stdio: 'ignore' })\n  if (found.status !== 0) {\n    throw new Error(\n      'huggingface-cli not found on PATH — install huggingface_hub[cli] before --push',\n    )\n  }\n  if (!process.env.HF_TOKEN) {\n    throw new Error('HF_TOKEN not present in env — refusing to push')\n  }\n  const [command, ...args] = planPushCommand(repo, outDir) as [string, ...string[]]\n  // Token stays in the inherited env; it is never echoed or interpolated.\n  const run = spawnSync(command, args, { stdio: 'inherit' })\n  if (run.status !== 0) throw new Error(`huggingface-cli upload exited ${String(run.status)}`)\n}\n\nexport interface RolloutReleaseCliArgs extends BuildOptions {\n  inputs: string[]\n  push: string | null\n}\n\nconst ROLLOUT_RELEASE_USAGE =\n  'usage: agent-eval rollout-release <ledger.jsonl...> --out <dir> [--formats sft,verifiers,rft,raw] [--include-proposers] [--push <org/name>]'\n\nfunction parseRolloutReleaseArgs(argv: string[]): RolloutReleaseCliArgs {\n  const args: RolloutReleaseCliArgs = {\n    inputs: [],\n    out: '',\n    formats: [...RELEASE_FORMATS],\n    includeProposers: false,\n    push: null,\n  }\n  for (let i = 0; i < argv.length; i++) {\n    const arg = argv[i]!\n    if (arg === '--out') {\n      args.out = argv[++i] ?? ''\n    } else if (arg === '--formats') {\n      const raw = (argv[++i] ?? '').split(',').filter(Boolean)\n      for (const format of raw) {\n        if (!RELEASE_FORMATS.includes(format as ReleaseFormat)) {\n          throw new Error(\n            `unknown format \"${format}\" — expected one of ${RELEASE_FORMATS.join(',')}`,\n          )\n        }\n      }\n      args.formats = raw as ReleaseFormat[]\n    } else if (arg === '--include-proposers') {\n      args.includeProposers = true\n    } else if (arg === '--push') {\n      args.push = argv[++i] ?? null\n    } else if (arg.startsWith('--')) {\n      throw new Error(`unknown flag \"${arg}\"`)\n    } else {\n      args.inputs.push(arg)\n    }\n  }\n  if (args.inputs.length === 0 || !args.out) {\n    throw new Error(ROLLOUT_RELEASE_USAGE)\n  }\n  if (args.push !== null && !/^[\\w.-]+\\/[\\w.-]+$/.test(args.push)) {\n    throw new Error(`--push expects <org/name>, got \"${args.push}\"`)\n  }\n  return args\n}\n\n/** CLI driver for `agent-eval rollout-release`. Returns the process exit code. */\nexport async function runRolloutReleaseCli(argv: string[]): Promise<number> {\n  let args: RolloutReleaseCliArgs\n  try {\n    args = parseRolloutReleaseArgs(argv)\n  } catch (error) {\n    process.stderr.write(`${error instanceof Error ? error.message : String(error)}\\n`)\n    return 2\n  }\n  const summary = await buildHfDataset(args.inputs, args)\n  process.stdout.write(\n    `${JSON.stringify(\n      {\n        read: summary.read,\n        kept: summary.kept,\n        formatCounts: summary.formatCounts,\n        gate: summary.gate,\n        scrub: summary.scrub,\n      },\n      null,\n      2,\n    )}\\n`,\n  )\n  process.stdout.write(`dataset → ${args.out} (${summary.files.length} files)\\n`)\n  if (args.push !== null) {\n    pushDataset(args.push, args.out)\n    process.stdout.write(`pushed → ${args.push}\\n`)\n  }\n  return 0\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAoBA,SAAS,UAAU,OAA8B;CAC/C,KAAK,MAAM,CAAC,GAAG,SAAS,MAAM,QAAQ,GAAG,kBAAkB,MAAM,iBAAiB,EAAE,EAAE;CACtF,OAAO,MAAM,KAAK,SAAS,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,KAAK,MAAM,SAAS,IAAI,OAAO;AAC3F;;AAGA,eAAsB,mBAAmB,MAAc,OAAqC;CAC1F,MAAM,UAAU,UAAU,KAAK;CAC/B,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9C,MAAM,UAAU,MAAM,OAAO;AAC/B;;AAGA,eAAsB,mBAAmB,MAAc,OAAqC;CAC1F,IAAI,MAAM,WAAW,GAAG;CACxB,MAAM,UAAU,UAAU,KAAK;CAC/B,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC9C,MAAM,WAAW,MAAM,OAAO;AAChC;;;;;;;;;;;AAYA,eAAsB,kBAAkB,MAA4C;CAClF,OAAO,UAAU,OAAO,QAAQ,YAAY,aAAa,QAAQ,OAAO,CAAC;AAC3E;AAIA,eAAe,UACb,MACA,OACc;CACd,MAAM,MAAM,MAAM,SAAS,MAAM,MAAM;CACvC,MAAM,QAAa,CAAC;CACpB,MAAM,WAAW,IAAI,MAAM,IAAI;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,OAAO,SAAS;EACtB,IAAI,CAAC,MAAM,KAAK,GAAG;EACnB,IAAI;EACJ,IAAI;GACF,SAAS,KAAK,MAAM,IAAI;EAC1B,SAAS,OAAO;GACd,MAAM,IAAI,MACR,GAAG,KAAK,GAAG,IAAI,EAAE,qBAAqB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,GAC7F;EACF;EACA,MAAM,KAAK,MAAM,QAAQ,GAAG,KAAK,GAAG,IAAI,GAAG,CAAC;CAC9C;CACA,OAAO;AACT;;;ACnBA,MAAa,0BAAkE;CAC7E,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;;AA2GA,SAAgB,gBAAgB,OAAkD;CAChF,OAAO,IAAI,IAAI,MAAM,QAAQ,SAAS,KAAK,QAAQ,cAAc,CAAC,CAAC,KAAK,SAAS,KAAK,UAAU,CAAC;AACnG;;;;;;;AAQA,MAAa,iBAAiB;CAI5B,MAAM,SACJ,KAAK,KAAK,SAAS;EACjB,YAAY,IAAI,SAAS;EACzB,QAAQ,IAAI,SAAS;EACrB,mBAAmB,IAAI,SAAS;CAClC,EAAE;CAIJ,YAAY,SACV,KAAK,KAAK,SAAS;EACjB,YAAY,IAAI,KAAK;EACrB,QAAQ,IAAI;EACZ,UAAU,IAAI;EACd,mBAAmB,IAAI,KAAK;CAC9B,EAAE;CAGJ,MAAM,SACJ,KAAK,KAAK,SAAS;EACjB,YAAY,IAAI,UAAU;EAC1B,QAAQ,IAAI,UAAU;EACtB,UAAU,IAAI,UAAU;EACxB,mBAAmB,IAAI,UAAU;CACnC,EAAE;CACJ,MAAM,UACJ,MAAM,KAAK,UAAU;EACnB,YAAY,KAAK;EACjB,QAAQ,KAAK,QAAQ;EAIrB,UAAU;GAAE,SAAS,KAAK,QAAQ;GAAS,SAAS,KAAK,QAAQ;EAAQ;EAGzE,cAAc,sBAAsB,KAAK,KAAK;EAC9C,mBAAmB,KAAK,QAAQ,qBAAqB;CACvD,EAAE;AACN;;AAGA,SAAS,kBAAkB,OAAgB,MAAiC;CAC1E,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,SAAS,KAAK,KAAK,QAAQ,IAAI,CAAC;EAAE;EAAM;CAAM,CAAC,IAAI,CAAC;CAEpE,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,SAAS,MAAM,MAAM,kBAAkB,MAAM,GAAG,KAAK,GAAG,EAAE,EAAE,CAAC;CAE5E,IAAI,OAAO,UAAU,YAAY,UAAU,MACzC,OAAO,OAAO,QAAQ,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,WAC1C,kBAAkB,OAAO,SAAS,KAAK,MAAM,GAAG,KAAK,GAAG,KAAK,CAC/D;CAEF,OAAO,CAAC;AACV;;AAGA,SAAgB,kBACd,OACA,MACkB;CAClB,MAAM,UAAU,KAAK,QAAQ,QAAQ,MAAM,IAAI,IAAI,UAAU,CAAC;CAC9D,MAAM,UAAU,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,CAAC,QAAQ,MAAmB,MAAM,IAAI;CACtF,MAAM,WAAW,QAAQ,SAAS,QAAQ,kBAAkB,IAAI,UAAU,EAAE,CAAC;CAC7E,MAAM,eAAe,QAAQ,SAAS,QAAQ,kBAAkB,IAAI,cAAc,OAAO,CAAC;CAC1F,MAAM,aAAa,KAChB,QAAQ,QAAQ,IAAI,sBAAsB,KAAK,CAAC,CAChD,KAAK,QAAQ,IAAI,MAAM,CAAC,CACxB,QAAQ,MAAmB,MAAM,QAAQ,IAAI,CAAC;CACjD,OAAO;EACL,OAAO,MAAM;EACb,SAAS,QAAQ;EACjB,UAAU,MAAM,OAAO,QAAQ;EAC/B,kBAAkB,QAAQ,WAAW,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO;EACnE,oBAAoB,SAAS,QAC1B,MAAM,UAAW,SAAS,QAAQ,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MACtE,IACF;EACA,wBAAwB,WAAW;EACnC,qBAAqB,WAAW,WAAW,IAAI,OAAO,KAAK,IAAI,GAAG,UAAU;EAC5E,wBAAwB,aAAa,QAClC,MAAM,UAAW,SAAS,QAAQ,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MACtE,IACF;CACF;AACF;;;;;;;;;;;;;AAcA,MAAM,kBAEF;CACF,wBAAwB,QAAQ,WAC9B,OAAO,qBAAqB,QAAQ,OAAO,oBAAoB,IAC3D,OACA,mBAAmB,OAAO,KAAK,OAAO,QAAQ,sDAC/B,OAAO,iBAAiB;CAE7C,mBAAmB,QAAQ,WAAW;EACpC,IAAI,OAAO,uBAAuB,MAAM,OAAO;EAC/C,MAAM,EAAE,MAAM,UAAU,OAAO;EAC/B,OACE,mBAAmB,OAAO,KAAK,OAAO,QAAQ,iEACpB,KAAK,KAAK,MAAM;CAK9C;CACA,4BAA4B,QAAQ,WAAW;EAC7C,IAAI,OAAO,2BAA2B,MAAM,OAAO;EACnD,MAAM,EAAE,MAAM,UAAU,OAAO;EAC/B,OACE,mBAAmB,OAAO,KAAK,OAAO,QAAQ,gHAC2B,KAAK,KAAK,MAAM;CAK7F;CACA,sBAAsB,QAAQ,WAC5B,OAAO,wBAAwB,OAC3B,OACA,mBAAmB,OAAO,KAAK,OAAO,uBAAuB,uCAC9C,OAAO,oBAAoB;AAIlD;;;;;;;;;;;;;;;;AAiBA,SAAgB,iBAAiB,QAA0B;CACzD,KAAK,MAAM,CAAC,QAAQ,WAAW,OAAO,QAAQ,OAAO,QAAQ,GAE1D;EACD,KAAK,MAAM,MAAM,gBAAgB;GAC/B,IAAI,cAAc,iBAAiB,GAAG,CAAC,SAAS,WAAW;GAC3D,MAAM,UAAU,gBAAgB,GAAG,CAAC,QAAQ,MAAM;GAClD,IAAI,YAAY,MAAM,MAAM,IAAI,MAAM,OAAO;EAC/C;EAIA,IAAI,wBAAwB,YAAY,aAAa,OAAO,UAAU,GACpE,MAAM,IAAI,MACR,mBAAmB,OAAO,4CAA4C,OAAO,QAAQ,UAEvF;CAEJ;AACF;;;;;;;;;;;;ACxVA,MAAa,kBAAkB;CAAC;CAAO;CAAa;CAAO;AAAK;;AAIhE,MAAa,eAA8C;CACzD,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;AAEA,MAAM,sBAAqD;CACzD,KAAK;CACL,WACE;CACF,KAAK;CACL,KAAK,UAAU,eAAe;AAChC;AAqBA,SAAS,OAAO,QAAwC;CACtD,OAAO,CAAC,GAAG,IAAI,IAAI,OAAO,QAAQ,MAAmB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;AAC1E;AAEA,SAAS,aAAa,QAA+B;CACnD,IAAI,WAAW,MAAM,OAAO;CAC5B,OAAO,OAAO,UAAU,MAAM,IAAI,OAAO,MAAM,IAAI,OAAO,QAAQ,CAAC;AACrE;AAEA,SAAS,cAAc,QAAkB,MAA0B;CACjE,OAAO;EACL,KAAK,OAAO,KAAK,KAAK,EAAE;EACxB,KAAK,OAAO,UAAU,KAAK,CAAC,CAAC,KAAK,KAAK,EAAE;EACzC,GAAG,KAAK,KAAK,QAAQ,KAAK,IAAI,KAAK,KAAK,EAAE,GAAG;CAC/C,CAAC,CAAC,KAAK,IAAI;AACb;;AAGA,MAAM,kBAAiD;CACrD,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;AAEA,MAAM,oBAAmD;CACvD,KAAK;CACL,WAAW;CACX,KAAK;CACL,KAAK;AACP;AAEA,SAAS,YAAY,SAA0B,MAAkB,YAA4B;CAC3F,MAAM,OAAO,QAAQ,KAAK,WAAW;EACnC,MAAM,SAAS,KAAK,SAAS;EAC7B,OAAO;GACL;GACA,kBAAkB;GAClB,OAAO,QAAQ,WAAW,CAAC;GAC3B,OAAO,QAAQ,YAAY,CAAC;GAC5B,QAAQ,qBAAqB,QAAQ,WAAW,KAAA,IAC5C,MACA,aAAa,OAAO,gBAAgB;GACxC,QAAQ,sBAAsB,OAC1B,MACA,GAAG,OAAO,mBAAmB,KAAK,KAAK,OAAO,mBAAmB;GACrE,gBAAgB;EAClB;CACF,CAAC;CACD,MAAM,iBAAiB,QAAQ,MAC5B,WAAW,wBAAwB,YAAY,eAClD;CACA,OAAO;EACL,kIAAkI,KAAK,WAAW,MAAM,WAAW;EACnK;EACA;EACA;EACA;EACA;EACA,cACE;GACE;GACA;GACA;GACA;GACA;GACA;GACA;EACF,GACA,IACF;EACA;EACA;EACA;EACA;EACA,iBACI,qLACA;CACN,CAAC,CACE,KAAK,IAAI,CAAC,CACV,QAAQ;AACb;AAEA,SAAS,eAAe,OAAwC;CAC9D,MAAM,yBAAS,IAAI,IAAsC;CACzD,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,WAAW,OAAO,IAAI,KAAK,IAAI,qBAAK,IAAI,IAAoB;EAClE,MAAM,MAAM,aAAa,KAAK,QAAQ,MAAM;EAC5C,SAAS,IAAI,MAAM,SAAS,IAAI,GAAG,KAAK,KAAK,CAAC;EAC9C,OAAO,IAAI,KAAK,MAAM,QAAQ;CAChC;CACA,MAAM,OAAmB,CAAC;CAC1B,KAAK,MAAM,QAAQ,eAAe;EAChC,MAAM,WAAW,OAAO,IAAI,IAAI;EAChC,IAAI,CAAC,UAAU;EACf,MAAM,OAAO,CAAC,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM;GAC/C,IAAI,MAAM,QAAQ,OAAO;GACzB,IAAI,MAAM,QAAQ,OAAO;GACzB,OAAO,OAAO,CAAC,IAAI,OAAO,CAAC;EAC7B,CAAC;EACD,KAAK,MAAM,OAAO,MAAM,KAAK,KAAK;GAAC;GAAM;GAAK,OAAO,SAAS,IAAI,GAAG,CAAC;EAAC,CAAC;CAC1E;CACA,OAAO;AACT;AAEA,SAAgB,iBAAiB,QAAmC;CAClE,MAAM,EACJ,OACA,SACA,kBACA,aACA,aACA,UACA,cACA,SACE;CAGJ,iBAAiB,IAAI;CAErB,MAAM,SAAS,OAAO,MAAM,KAAK,SAAS,KAAK,MAAM,CAAC;CACtD,MAAM,cAAc,CAAC,GAAG,IAAI,IAAI,MAAM,KAAK,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CACnE,QAAQ,MAAmB,MAAM,IAAI,CAAC,CACtC,MAAM,GAAG,MAAM,IAAI,CAAC;CACvB,MAAM,SAAS,OAAO,MAAM,KAAK,SAAS,KAAK,OAAO,KAAK,CAAC;CAC5D,MAAM,YAAY,OAAO,MAAM,KAAK,SAAS,KAAK,OAAO,OAAO,CAAC;CACjE,MAAM,WAAW,OAAO,MAAM,KAAK,SAAS,KAAK,WAAW,OAAO,CAAC;CACpE,MAAM,gBAAgB,OAAO,MAAM,KAAK,SAAS,KAAK,QAAQ,aAAa,CAAC;CAC5E,MAAM,WAAW,MAAM,QAAQ,SAAS,KAAK,SAAS,WAAW,CAAC,CAAC,CAAC;CACpE,MAAM,aAAa,MAAM,QAAQ,SAAS,KAAK,QAAQ,cAAc,CAAC,CAAC;CACvE,IAAI,eAAe,KAAK,YACtB,MAAM,IAAI,MACR,oCAAoC,KAAK,WAAW,6DAC1B,WAAW,mDACvC;CAcF,MAAM,cAAc;EAClB;EACA;EACA;EACA;EAfc,QACb,KAAK,WACJ;GACE,oBAAoB;GACpB;GACA;GACA,iBAAiB,aAAa;EAChC,CAAC,CAAC,KAAK,IAAI,CACb,CAAC,CACA,KAAK,IAOA;EACN;CACF,CAAC,CAAC,KAAK,IAAI;CAEX,MAAM,eAAe,cACnB;EAAC;EAAU;EAAQ;EAAQ;CAAU,GACrC,QAAQ,KAAK,WAAW;EACtB;EACA,KAAK,aAAa,QAAQ;EAC1B,OAAO,aAAa,WAAW,CAAC;EAChC,oBAAoB;CACtB,CAAC,CACH;CAEA,MAAM,cAAc,cAAc;EAAC;EAAQ;EAAU;CAAO,GAAG,eAAe,KAAK,CAAC;CAEpF,MAAM,aAAa,cACjB,CAAC,QAAQ,UAAU,GACnB,OAAO,QAAQ,WAAW,CAAC,CAAC,KAAK,CAAC,MAAM,WAAW,CAAC,MAAM,OAAO,KAAK,CAAC,CAAC,CAC1E;CAEA,MAAM,eAAe,mBACjB,uHACA,8CAA8C,SAAS,UAAU;CAErE,OAAO,GAAG,YAAY;;;;gIAIwG,eAAe;;6NAE8E,SAAS,SAAS;;;;EAI7O,aAAa;;;;EAIb,YAAY,SAAS,MAAM,MAAM,MAAM,EAAE;;eAE5B,eAAe;;;;;;;sBAOR,cAAc,KAAK,SAAS,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;;;qPAGyK,SAAS;;;;;;;oBAO1O,YAAY,KAAK,SAAS,KAAK,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;aAC3D,OAAO,KAAK,OAAO,KAAK,GAAG,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;iBACvC,YAAY,KAAK,IAAI,EAAE;YAC5B,OAAO,KAAK,MAAM,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;eACtC,UAAU,KAAK,MAAM,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;mBACxC,SAAS,KAAK,IAAI,EAAE;2EACoC,cAAc,KAAK,MAAM,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;;EAEzH,aAAa;;;;;;;;;;;;EAYb,YAAY;;eAEC,MAAM,OAAO;;;;;;EAM1B,WAAW;;;;;;;;;;;;;;;;;AAiBb;;;;;;;;;;;;;;AC/RA,MAAM,cAAoC;CACxC;EAEE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;CACA;EAGE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;CACA;EAEE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;CACA;EAGE,MAAM;EACN,SACE;EACF,UAAU,QAAQ,WAAW,GAAG,OAAO;CACzC;CACA;EAGE,MAAM;EACN,SACE;EACF,UAAU,QAAQ,SAAS,GAAG,KAAK;CACrC;CACA;EACE,MAAM;EACN,SAAS;EACT,UAAU,QAAQ,WAAW,GAAG,OAAO;CACzC;CACA;EAGE,MAAM;EACN,SACE;EACF,eAAe;CACjB;CACA;EAGE,MAAM;EACN,SAAS;EACT,UAAU,QAAQ,WAAW,GAAG,UAAU,GAAG;CAC/C;CACA;EAGE,MAAM;EACN,SAAS;EACT,eAAe;CACjB;AACF;AAKA,SAAgB,mBAAgC;CAC9C,OAAO,OAAO,YAAY,YAAY,KAAK,SAAS,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;AACrE;AAEA,SAAgB,eAAe,MAAmB,MAAgC;CAChF,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,IAAI,GAAG,KAAK,SAAS,KAAK,SAAS,KAAK;CACnF,OAAO;AACT;AAEA,SAAgB,UAAU,MAAc,QAA6B;CACnE,IAAI,MAAM;CACV,KAAK,MAAM,QAAQ,aACjB,MAAM,IAAI,QAAQ,KAAK,UAAU,OAAe,GAAG,SAAoB;EACrE,OAAO,KAAK,SAAS,OAAO,KAAK,SAAS,KAAK;EAC/C,OAAO,KAAK,QAAQ,OAAO,OAAO,KAAK,OAAO,WAAW,KAAK,KAAK,KAAA,CAAS;CAC9E,CAAC;CAEH,OAAO;AACT;AAEA,SAAS,WAAW,OAAgB,QAA8B;CAChE,IAAI,OAAO,UAAU,UAAU,OAAO,UAAU,OAAO,MAAM;CAC7D,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,KAAK,SAAS,WAAW,MAAM,MAAM,CAAC;CAC7E,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;EAC/C,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,GAAG,IAAI,OAAO,WAAW,MAAM,MAAM;EACnF,OAAO;CACT;CACA,OAAO;AACT;;;;;;;;;AAUA,SAAS,iBAAiB,MAAyB,QAAwC;CACzF,OAAO,aAAa,WAAW,MAAM,MAAM,GAAG,yBAAyB,KAAK,YAAY;AAC1F;AAEA,SAAgB,WAAW,OAGzB;CACA,MAAM,SAAS,iBAAiB;CAChC,OAAO;EAAE,OAAO,MAAM,KAAK,SAAS,iBAAiB,MAAM,MAAM,CAAC;EAAG;CAAO;AAC9E;;;;;;;;AASA,SAAgB,uBAAuB,MAAsB;CAC3D,OAAO,UAAU,MAAM,iBAAiB,CAAC;AAC3C;;;;;;;;;;;;;;;;;;;;AC1FA,eAAsB,eACpB,QACA,SACuB;CACvB,IAAI,OAAO,WAAW,GAAG,MAAM,IAAI,MAAM,wBAAwB;CACjE,IAAI,QAAQ,QAAQ,WAAW,GAAG,MAAM,IAAI,MAAM,qBAAqB;CAEvE,MAAM,SAAsB;EAC1B,OAAO,CAAC;EACR,QAAQ,iBAAiB;EACzB,UAAU;GAAE,WAAW;GAAG,UAAU;EAAE;CACxC;CACA,MAAM,OAA4B,CAAC;CACnC,IAAI,OAAO;CAEX,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,QAAQ,MAAM,kBAAkB,KAAK;EAC3C,QAAQ,MAAM;EAYd,MAAM,WAAW,WAXC,MAAM,QAAQ,SAAS;GACvC,IAAI,CAAC,iBAAiB,KAAK,KAAK,KAAK,GAAG;IACtC,OAAO,SAAS,YAAY;IAC5B,OAAO;GACT;GACA,IAAI,CAAC,QAAQ,oBAAoB,KAAK,SAAS,YAAY;IACzD,OAAO,SAAS,aAAa;IAC7B,OAAO;GACT;GACA,OAAO;EACT,CAC4B,CAAS;EACrC,OAAO,MAAM,SAAS,SAAS;EAC/B,eAAe,OAAO,QAAQ,SAAS,MAAM;EAC7C,KAAK,KAAK,GAAG,SAAS,KAAK;CAC7B;CAEA,MAAM,eAAuD,CAAC;CAC9D,MAAM,QAAkB,CAAC;CACzB,MAAM,QAAQ,gBAAgB,IAAI;CAClC,MAAM,OAAmB;EAAE,YAAY,MAAM;EAAM,UAAU,CAAC;CAAE;CAMhE,MAAM,UAA+D,CAAC;CAEtE,KAAK,MAAM,UAAU,QAAQ,SAAS;EACpC,MAAM,OAAO,KAAK,QAAQ,KAAK,aAAa,OAAO;EACnD,IAAI,WAAW,OAAO;GAEpB,KAAK,SAAS,MAAM,kBAAkB,OAAO,eAAe,IAAI,IAAI,CAAC;GACrE,aAAa,MAAM,KAAK;GACxB,QAAQ,KAAK;IAAE;IAAM,aAAa,mBAAmB,MAAM,IAAI;GAAE,CAAC;EACpE,OAAO,IAAI,WAAW,OAAO;GAC3B,MAAM,OAAO,UAAU,IAAI;GAC3B,KAAK,SAAS,MAAM,kBAAkB,OAAO,eAAe,IAAI,IAAI,CAAC;GACrE,aAAa,MAAM,KAAK;GACxB,QAAQ,KAAK;IAAE;IAAM,aAAa,UAAU,MAAM,QAAQ,IAAI,CAAC;GAAE,CAAC;EACpE,OAAO,IAAI,WAAW,aAAa;GAGjC,MAAM,UAAU,0BAA0B,MAAM,EAC9C,YAAY,wBAAwB,UACtC,CAAC;GACD,KAAK,SAAS,YAAY,kBAAkB,OAAO,eAAe,UAAU,OAAO,CAAC;GACpF,aAAa,YAAY,QAAQ;GACjC,QAAQ,KAAK;IAAE;IAAM,aAAa,UAAU,MAAM,QAAQ,OAAO,CAAC;GAAE,CAAC;EACvE,OAAO;GACL,MAAM,QAAQ,WAAW,MAAM,EAAE,YAAY,wBAAwB,IAAI,CAAC;GAC1E,KAAK,SAAS,MAAM,kBAAkB,OAAO,eAAe,IAAI,KAAK,CAAC;GACtE,aAAa,MAAM,MAAM;GACzB,QAAQ,KAAK;IAAE;IAAM,aAAa,UAAU,MAAM,QAAQ,KAAK,CAAC;GAAE,CAAC;EACrE;CACF;CAEA,iBAAiB,IAAI;CAErB,KAAK,MAAM,EAAE,MAAM,WAAW,SAAS;EACrC,MAAM,MAAM,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;EAC9C,MAAM,MAAM;EACZ,MAAM,KAAK,IAAI;CACjB;CAEA,MAAM,aAAa,KAAK,QAAQ,KAAK,mBAAmB;CACxD,MAAM,UAAU,YAAY,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,GAAG;CAClE,MAAM,KAAK,UAAU;CAErB,MAAM,WAAW,KAAK,QAAQ,KAAK,WAAW;CAC9C,MAAM,UACJ,UACA,iBAAiB;EACf,OAAO;EACP,SAAS,QAAQ;EACjB,kBAAkB,QAAQ;EAC1B,aAAa,OAAO,KAAK,UAAU,SAAS,KAAK,CAAC;EAClD,aAAa,OAAO;EACpB,UAAU,OAAO;EACjB;EACA;CACF,CAAC,CACH;CACA,MAAM,KAAK,QAAQ;CAEnB,OAAO;EAAE;EAAQ;EAAM,MAAM,KAAK;EAAQ,OAAO;EAAQ;EAAc;EAAM;CAAM;AACrF;AAEA,SAAS,gBAAgB,MAAc,QAA0B;CAC/D,OAAO;EAAC;EAAmB;EAAU;EAAM;EAAQ;EAAK;EAAe;CAAS;AAClF;AAEA,SAAS,YAAY,MAAc,QAAsB;CAEvD,IADc,UAAU,SAAS,CAAC,iBAAiB,GAAG,EAAE,OAAO,SAAS,CAChE,CAAC,CAAC,WAAW,GACnB,MAAM,IAAI,MACR,gFACF;CAEF,IAAI,CAAC,QAAQ,IAAI,UACf,MAAM,IAAI,MAAM,gDAAgD;CAElE,MAAM,CAAC,SAAS,GAAG,QAAQ,gBAAgB,MAAM,MAAM;CAEvD,MAAM,MAAM,UAAU,SAAS,MAAM,EAAE,OAAO,UAAU,CAAC;CACzD,IAAI,IAAI,WAAW,GAAG,MAAM,IAAI,MAAM,iCAAiC,OAAO,IAAI,MAAM,GAAG;AAC7F;AAOA,MAAM,wBACJ;AAEF,SAAS,wBAAwB,MAAuC;CACtE,MAAM,OAA8B;EAClC,QAAQ,CAAC;EACT,KAAK;EACL,SAAS,CAAC,GAAG,eAAe;EAC5B,kBAAkB;EAClB,MAAM;CACR;CACA,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,SACV,KAAK,MAAM,KAAK,EAAE,MAAM;OACnB,IAAI,QAAQ,aAAa;GAC9B,MAAM,OAAO,KAAK,EAAE,MAAM,GAAA,CAAI,MAAM,GAAG,CAAC,CAAC,OAAO,OAAO;GACvD,KAAK,MAAM,UAAU,KACnB,IAAI,CAAC,gBAAgB,SAAS,MAAuB,GACnD,MAAM,IAAI,MACR,mBAAmB,OAAO,sBAAsB,gBAAgB,KAAK,GAAG,GAC1E;GAGJ,KAAK,UAAU;EACjB,OAAO,IAAI,QAAQ,uBACjB,KAAK,mBAAmB;OACnB,IAAI,QAAQ,UACjB,KAAK,OAAO,KAAK,EAAE,MAAM;OACpB,IAAI,IAAI,WAAW,IAAI,GAC5B,MAAM,IAAI,MAAM,iBAAiB,IAAI,EAAE;OAEvC,KAAK,OAAO,KAAK,GAAG;CAExB;CACA,IAAI,KAAK,OAAO,WAAW,KAAK,CAAC,KAAK,KACpC,MAAM,IAAI,MAAM,qBAAqB;CAEvC,IAAI,KAAK,SAAS,QAAQ,CAAC,qBAAqB,KAAK,KAAK,IAAI,GAC5D,MAAM,IAAI,MAAM,mCAAmC,KAAK,KAAK,EAAE;CAEjE,OAAO;AACT;;AAGA,eAAsB,qBAAqB,MAAiC;CAC1E,IAAI;CACJ,IAAI;EACF,OAAO,wBAAwB,IAAI;CACrC,SAAS,OAAO;EACd,QAAQ,OAAO,MAAM,GAAG,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,EAAE,GAAG;EAClF,OAAO;CACT;CACA,MAAM,UAAU,MAAM,eAAe,KAAK,QAAQ,IAAI;CACtD,QAAQ,OAAO,MACb,GAAG,KAAK,UACN;EACE,MAAM,QAAQ;EACd,MAAM,QAAQ;EACd,cAAc,QAAQ;EACtB,MAAM,QAAQ;EACd,OAAO,QAAQ;CACjB,GACA,MACA,CACF,EAAE,GACJ;CACA,QAAQ,OAAO,MAAM,aAAa,KAAK,IAAI,IAAI,QAAQ,MAAM,OAAO,UAAU;CAC9E,IAAI,KAAK,SAAS,MAAM;EACtB,YAAY,KAAK,MAAM,KAAK,GAAG;EAC/B,QAAQ,OAAO,MAAM,YAAY,KAAK,KAAK,GAAG;CAChD;CACA,OAAO;AACT"}

package/dist/hosted/index.d.ts

@@ -1,5 +1,5 @@
 import { A as SearchLedgerHash } from "../search-ledger-types-p2xKfiDJ.js";
-import { A as admitSearchLedgerBatch, C as SearchLedgerBatchAdmission, D as SearchLedgerHeadSchema, E as SearchLedgerHead, M as searchLedgerArtifactRefs, N as searchLedgerHeadPath, O as SearchRunKind, S as SearchBlobPutResponseSchema, T as SearchLedgerConflictSchema, _ as IngestSearchLedgerRequestSchema, a as createHostedClient, b as SEARCH_LEDGER_INGEST_PATH, c as HOSTED_WIRE_VERSION, d as IngestResponse, f as IngestTracesRequest, g as IngestSearchLedgerRequest, h as AdmitSearchLedgerBatchInput, i as SearchLedgerIngestOutcome, j as searchBlobPath, k as SearchRunKindSchema, l as HostedIngestHeaders, m as UnixNanoTimestamp, n as HostedRequestError, o as hostedClientFromEnv, p as TraceSpanEvent, r as HostedTenant, s as hostedTenantFromEnv, t as HostedClient, u as HostedWireVersion, v as SEARCH_LEDGER_BATCH_MAX_BYTES, w as SearchLedgerConflict, x as SearchBlobPutResponse, y as SEARCH_LEDGER_BATCH_MAX_LINES } from "../client-BzL9niqi.js";
+import { C as SearchLedgerConflictSchema, D as admitSearchLedgerBatch, E as SearchRunKind, S as SearchLedgerConflict, T as SearchLedgerHeadSchema, _ as SEARCH_LEDGER_BATCH_MAX_BYTES, a as hostedClientFromEnv, b as SearchBlobPutResponseSchema, c as HostedIngestHeaders, d as IngestTracesRequest, f as TraceSpanEvent, g as IngestSearchLedgerRequestSchema, h as IngestSearchLedgerRequest, i as createHostedClient, l as HostedWireVersion, m as AdmitSearchLedgerBatchInput, n as HostedTenant, o as hostedTenantFromEnv, p as UnixNanoTimestamp, r as SearchLedgerIngestOutcome, s as HOSTED_WIRE_VERSION, t as HostedClient, u as IngestResponse, v as SEARCH_LEDGER_INGEST_PATH, w as SearchLedgerHead, x as SearchLedgerBatchAdmission, y as SearchBlobPutResponse } from "../client-hwo3cJjR.js";
 import { z } from "zod";
 //#region src/hosted/schemas.d.ts
 export declare const UnixNanoTimestampSchema: z.ZodType<UnixNanoTimestamp>;
@@ -70,5 +70,5 @@ export declare function startSearchShipper(options: SearchShipOptions & {
   intervalMs?: number;
 }): SearchShipper;
 //#endregion
-export { type AdmitSearchLedgerBatchInput, HOSTED_WIRE_VERSION, type HostedClient, type HostedIngestHeaders, HostedRequestError, type HostedTenant, type HostedWireVersion, type IngestResponse, type IngestSearchLedgerRequest, IngestSearchLedgerRequestSchema, type IngestTracesRequest, SEARCH_LEDGER_BATCH_MAX_BYTES, SEARCH_LEDGER_BATCH_MAX_LINES, SEARCH_LEDGER_INGEST_PATH, type SearchBlobPutResponse, SearchBlobPutResponseSchema, type SearchLedgerBatchAdmission, type SearchLedgerConflict, SearchLedgerConflictSchema, type SearchLedgerHead, SearchLedgerHeadSchema, type SearchLedgerIngestOutcome, type SearchRunKind, SearchRunKindSchema, type SearchShipMissingBlob, type SearchShipOptions, type SearchShipResult, type SearchShipper, type TraceSpanEvent, type UnixNanoTimestamp, admitSearchLedgerBatch, createHostedClient, hostedClientFromEnv, hostedTenantFromEnv, searchBlobPath, searchLedgerArtifactRefs, searchLedgerHeadPath };
+export { type AdmitSearchLedgerBatchInput, HOSTED_WIRE_VERSION, type HostedClient, type HostedIngestHeaders, type HostedTenant, type HostedWireVersion, type IngestResponse, type IngestSearchLedgerRequest, IngestSearchLedgerRequestSchema, type IngestTracesRequest, SEARCH_LEDGER_BATCH_MAX_BYTES, SEARCH_LEDGER_INGEST_PATH, type SearchBlobPutResponse, SearchBlobPutResponseSchema, type SearchLedgerBatchAdmission, type SearchLedgerConflict, SearchLedgerConflictSchema, type SearchLedgerHead, SearchLedgerHeadSchema, type SearchLedgerIngestOutcome, type SearchRunKind, type SearchShipMissingBlob, type SearchShipOptions, type SearchShipResult, type SearchShipper, type TraceSpanEvent, type UnixNanoTimestamp, admitSearchLedgerBatch, createHostedClient, hostedClientFromEnv, hostedTenantFromEnv };
 //# sourceMappingURL=index.d.ts.map

package/dist/hosted/index.js

@@ -1,2 +1,2 @@
-import { C as TraceSpanEventSchema, S as IngestTracesRequestSchema, T as HOSTED_WIRE_VERSION, _ as admitSearchLedgerBatch, a as HostedRequestError, b as searchLedgerHeadPath, c as hostedTenantFromEnv, d as SEARCH_LEDGER_BATCH_MAX_LINES, f as SEARCH_LEDGER_INGEST_PATH, g as SearchRunKindSchema, h as SearchLedgerHeadSchema, i as startSearchShipper, l as IngestSearchLedgerRequestSchema, m as SearchLedgerConflictSchema, o as createHostedClient, p as SearchBlobPutResponseSchema, r as shipSearchLedger, s as hostedClientFromEnv, t as SearchShipConflictError, u as SEARCH_LEDGER_BATCH_MAX_BYTES, v as searchBlobPath, w as UnixNanoTimestampSchema, x as IngestResponseSchema, y as searchLedgerArtifactRefs } from "../search-shipper-BOSD46qv.js";
-export { HOSTED_WIRE_VERSION, HostedRequestError, IngestResponseSchema, IngestSearchLedgerRequestSchema, IngestTracesRequestSchema, SEARCH_LEDGER_BATCH_MAX_BYTES, SEARCH_LEDGER_BATCH_MAX_LINES, SEARCH_LEDGER_INGEST_PATH, SearchBlobPutResponseSchema, SearchLedgerConflictSchema, SearchLedgerHeadSchema, SearchRunKindSchema, SearchShipConflictError, TraceSpanEventSchema, UnixNanoTimestampSchema, admitSearchLedgerBatch, createHostedClient, hostedClientFromEnv, hostedTenantFromEnv, searchBlobPath, searchLedgerArtifactRefs, searchLedgerHeadPath, shipSearchLedger, startSearchShipper };
+import { _ as IngestTracesRequestSchema, a as createHostedClient, b as HOSTED_WIRE_VERSION, c as IngestSearchLedgerRequestSchema, d as SearchBlobPutResponseSchema, f as SearchLedgerConflictSchema, g as IngestResponseSchema, h as admitSearchLedgerBatch, i as startSearchShipper, l as SEARCH_LEDGER_BATCH_MAX_BYTES, o as hostedClientFromEnv, p as SearchLedgerHeadSchema, r as shipSearchLedger, s as hostedTenantFromEnv, t as SearchShipConflictError, u as SEARCH_LEDGER_INGEST_PATH, v as TraceSpanEventSchema, y as UnixNanoTimestampSchema } from "../search-shipper-Bg2HW3Uv.js";
+export { HOSTED_WIRE_VERSION, IngestResponseSchema, IngestSearchLedgerRequestSchema, IngestTracesRequestSchema, SEARCH_LEDGER_BATCH_MAX_BYTES, SEARCH_LEDGER_INGEST_PATH, SearchBlobPutResponseSchema, SearchLedgerConflictSchema, SearchLedgerHeadSchema, SearchShipConflictError, TraceSpanEventSchema, UnixNanoTimestampSchema, admitSearchLedgerBatch, createHostedClient, hostedClientFromEnv, hostedTenantFromEnv, shipSearchLedger, startSearchShipper };