@tangle-network/agent-eval 0.161.1 → 0.170.0

package/dist/{sequential-rYW-Ophm.js.map → sequential-B51qAYE4.js.map}

@@ -1 +1 @@
-{"version":3,"file":"sequential-rYW-Ophm.js","names":[],"sources":["../src/campaign/gates/sequential.ts"],"sourcesContent":["/**\n * Anytime-valid sequential promotion gate — an e-process (betting\n * test-martingale, see `eProcess` in `statistics.ts`) over paired\n * per-scenario deltas, so a campaign stops the MOMENT evidence decides\n * instead of burning a fixed-n budget. Decisions remain valid at any\n * data-dependent stopping time (Ville's inequality), which is exactly what\n * fixed-n machinery cannot offer: peeking at a bootstrap CI after every\n * observation and stopping on the first significant peek inflates type-I\n * error far beyond alpha.\n *\n * REPLACES, never layers on, a fixed-n gate. Running `heldoutSignificance`\n * or `paretoSignificanceGate` repeatedly on a growing sample and stopping\n * early is optional stopping no matter how it is dressed up; this gate is\n * the valid way to stop early. Use one or the other per evidence stream.\n *\n * Pre-registration binding: anytime validity holds only for the\n * PRE-REGISTERED statistic. When a `SignedManifest` is bound, the gate takes\n * alpha from `manifest.alpha`, the observation budget from\n * `manifest.preRegisteredN`, orients deltas by `manifest.direction`, and\n * shifts the null boundary by `manifest.minEffect` — re-deciding the same\n * stream under different parameters after seeing data would reopen optional\n * stopping under a fancier name. The manifest's content hash is verified at\n * construction (sync, same `sha256-content` scheme as `signManifest`).\n *\n * Non-iid caveat (stated honestly): the supermartingale guarantee needs each\n * delta's conditional mean under H0 to stay ≤ the null boundary given the\n * past — exchangeable scenario deltas suffice. Scenario streams ordered by\n * difficulty or by scenario family violate this; `decide(ctx)` therefore\n * shuffles the paired deltas with a SEEDED permutation by default (the\n * permutation is data-independent, so bet predictability is preserved).\n * Stratified betting (per-stratum λ) is future work, not implemented here.\n */\n\nimport { manifestContentDigest, type SignedManifest } from '../../pre-registration'\nimport { type EProcessState, eProcess, mulberry32 } from '../../statistics'\nimport type { Gate, GateContext, GateResult, GenerationRecord, Scenario } from '../types'\nimport { pairHoldout } from './statistical-heldout'\n\nexport type SequentialDecision = 'promote' | 'continue' | 'undecided-at-maxN'\n\nexport interface SequentialObservation {\n  decision: SequentialDecision\n  /** Current e-value (the betting wealth) against H0. */\n  eValue: number\n  /** Paired deltas consumed so far. */\n  n: number\n  /** Names the decision basis. For 'undecided-at-maxN' it states explicitly\n   *  that exhausting the budget is NOT evidence of no effect. */\n  reason: string\n}\n\nexport interface SequentialPairedGateOptions {\n  /** Type-I budget. With `preRegistration` bound this MUST match\n   *  `manifest.alpha` (conflict throws). Default 0.05. */\n  alpha?: number\n  /** Minimum paired deltas before a promote may fire. The stopping rule is\n   *  \"first n ≥ minN with e-value ≥ 1/alpha\" — still a valid stopping time.\n   *  Default 5. */\n  minN?: number\n  /** Pre-registered observation budget. Required unless `preRegistration`\n   *  supplies it via `preRegisteredN` (conflict throws). */\n  maxN?: number\n  /** Bet truncation forwarded to `eProcess`. Default 0.5. */\n  maxBet?: number\n  /** Bound on |delta| in the judge's native scale; deltas are mapped to\n   *  x = (d/scale + 1)/2 ∈ [0,1]. A delta outside ±scale throws (use\n   *  `detectScale` to pick 1 vs 100 BEFORE streaming). Default 1. */\n  scale?: number\n  /** Seed for the data-independent shuffle of paired deltas in `decide(ctx)`\n   *  (exchangeability guard). Default 1337. */\n  shuffleSeed?: number\n  /** Bind the pre-registered hypothesis. Verified (content hash) at\n   *  construction; alpha/maxN/direction/minEffect come FROM the manifest. */\n  preRegistration?: SignedManifest\n  /** Override the gate name in reports. */\n  name?: string\n  /** Continue the observe-stream from a `state()` snapshot taken before a\n   *  restart. The gate's parameters still resolve from this options object\n   *  (and the manifest); the snapshot must have been recorded under the same\n   *  alpha, maxBet, and null boundary, and its decision must be one this\n   *  configuration could have reached at its n, or construction throws.\n   *  `decide(ctx)` is unaffected — it always runs on a fresh stream. */\n  resume?: SequentialStreamState\n}\n\n/** Snapshot of one observe-stream: the e-process state plus the gate's own\n *  decision, which applies `minN` and `maxN` on top of the core latch. A\n *  gate rebuilt with `resume` from this value continues exactly where the\n *  snapshot was taken. */\nexport type SequentialStreamState = EProcessState & { decision: SequentialDecision }\n\nexport interface SequentialPairedGate<TArtifact = unknown, TScenario extends Scenario = Scenario>\n  extends Gate<TArtifact, TScenario> {\n  /** Streaming entry point: feed one paired per-scenario delta\n   *  (candidate − baseline, native scale). Each gate instance carries ONE\n   *  observe-stream; `decide(ctx)` runs on its own fresh stream and never\n   *  consumes or advances this one. 'promote' is sticky; observing past the\n   *  pre-registered maxN throws (extending a finished stream after seeing\n   *  the result reopens optional stopping — start a NEW pre-registered\n   *  test). */\n  observe(delta: number): SequentialObservation\n  /** Read-only snapshot of the observe-stream. Pass it back as\n   *  `resume` to continue the stream after a restart. */\n  state(): SequentialStreamState\n}\n\ninterface ResolvedConfig {\n  alpha: number\n  minN: number\n  maxN: number\n  maxBet: number\n  scale: number\n  shuffleSeed: number\n  /** 'decrease' negates deltas so \"better\" is always positive. */\n  direction: 'increase' | 'decrease'\n  /** H0 boundary in x-space: 1/2 + minEffect/(2·scale). */\n  nullMean: number\n  minEffect: number\n}\n\n/** Sync twin of `verifyManifest`, so gate construction stays synchronous and\n *  fails loud before any observation is consumed. The digest scheme belongs to\n *  `pre-registration`; this gate only compares. */\nfunction verifyManifestSync(m: SignedManifest): boolean {\n  return manifestContentDigest(m) === m.contentHash\n}\n\nfunction resolveConfig(opts: SequentialPairedGateOptions): ResolvedConfig {\n  const m = opts.preRegistration\n  let alpha: number\n  let maxN: number\n  let direction: 'increase' | 'decrease'\n  let minEffect: number\n  if (m) {\n    if (!verifyManifestSync(m)) {\n      throw new Error(\n        `sequentialPairedGate: pre-registration manifest '${m.id}' content hash mismatch (tampered)`,\n      )\n    }\n    if (opts.alpha !== undefined && opts.alpha !== m.alpha) {\n      throw new Error(\n        `sequentialPairedGate: alpha ${opts.alpha} conflicts with pre-registered alpha ${m.alpha} — ` +\n          `the registered statistic is the only one anytime validity covers`,\n      )\n    }\n    if (opts.maxN !== undefined && opts.maxN !== m.preRegisteredN) {\n      throw new Error(\n        `sequentialPairedGate: maxN ${opts.maxN} conflicts with pre-registered N ${m.preRegisteredN}`,\n      )\n    }\n    alpha = m.alpha\n    maxN = m.preRegisteredN\n    direction = m.direction\n    minEffect = m.minEffect\n  } else {\n    alpha = opts.alpha ?? 0.05\n    if (opts.maxN === undefined) {\n      throw new Error(\n        'sequentialPairedGate: maxN is required (or bind a preRegistration manifest whose ' +\n          'preRegisteredN is the budget) — an unbounded stream has no pre-registered budget',\n      )\n    }\n    maxN = opts.maxN\n    direction = 'increase'\n    minEffect = 0\n  }\n  const scale = opts.scale ?? 1\n  if (!Number.isFinite(scale) || scale <= 0) {\n    throw new Error(`sequentialPairedGate: scale must be > 0, got ${scale}`)\n  }\n  if (!Number.isInteger(maxN) || maxN < 1) {\n    throw new Error(`sequentialPairedGate: maxN must be a positive integer, got ${maxN}`)\n  }\n  const minN = opts.minN ?? 5\n  if (!Number.isInteger(minN) || minN < 1 || minN > maxN) {\n    throw new Error(\n      `sequentialPairedGate: minN must be an integer in [1, maxN=${maxN}], got ${minN}`,\n    )\n  }\n  if (!Number.isFinite(minEffect) || minEffect < 0 || minEffect >= scale) {\n    throw new Error(\n      `sequentialPairedGate: minEffect must be in [0, scale=${scale}), got ${minEffect}`,\n    )\n  }\n  // H0: mean delta ≤ minEffect. In x = (d/scale + 1)/2 space that is\n  // E[x] ≤ 1/2 + minEffect/(2·scale) — a shifted null boundary, NOT a clamp\n  // of the observations (clamping is mean-distorting for skewed deltas).\n  const nullMean = 0.5 + minEffect / (2 * scale)\n  return {\n    alpha,\n    minN,\n    maxN,\n    maxBet: opts.maxBet ?? 0.5,\n    scale,\n    shuffleSeed: opts.shuffleSeed ?? 1337,\n    direction,\n    nullMean,\n    minEffect,\n  }\n}\n\ninterface SequentialStream {\n  observe(delta: number): SequentialObservation\n  state(): SequentialStreamState\n}\n\nconst SEQUENTIAL_DECISIONS: readonly SequentialDecision[] = [\n  'promote',\n  'continue',\n  'undecided-at-maxN',\n]\n\n/** Refuse a snapshot whose gate decision this configuration could not have\n *  reached at the snapshot's n. The e-process parameters are checked by\n *  `eProcess` itself; this covers the gate's own stopping rule. */\nfunction assertResumableStream(resume: SequentialStreamState, cfg: ResolvedConfig): void {\n  const fail = (detail: string): never => {\n    throw new Error(`sequentialPairedGate: cannot resume — ${detail}`)\n  }\n  if (!SEQUENTIAL_DECISIONS.includes(resume.decision)) {\n    fail(`unknown decision '${String(resume.decision)}'`)\n  }\n  if (resume.n > cfg.maxN) {\n    fail(`snapshot n=${resume.n} exceeds the pre-registered maxN=${cfg.maxN}`)\n  }\n  const threshold = 1 / cfg.alpha\n  switch (resume.decision) {\n    case 'promote':\n      if (resume.n < cfg.minN) {\n        fail(`decision 'promote' at n=${resume.n} is below minN=${cfg.minN}`)\n      }\n      break\n    case 'undecided-at-maxN':\n      if (resume.n !== cfg.maxN) {\n        fail(`decision 'undecided-at-maxN' at n=${resume.n} does not match maxN=${cfg.maxN}`)\n      }\n      break\n    case 'continue':\n      if (resume.n >= cfg.maxN) {\n        fail(`decision 'continue' at n=${resume.n} with maxN=${cfg.maxN}; the stream is finished`)\n      }\n      if (resume.n >= cfg.minN && resume.wealth >= threshold) {\n        fail(\n          `decision 'continue' at n=${resume.n} ≥ minN=${cfg.minN} with e-value ` +\n            `${resume.wealth} ≥ 1/α=${threshold}; this stream would have promoted`,\n        )\n      }\n      break\n  }\n}\n\nfunction makeStream(cfg: ResolvedConfig, resume?: SequentialStreamState): SequentialStream {\n  if (resume !== undefined) assertResumableStream(resume, cfg)\n  const proc = eProcess({\n    alpha: cfg.alpha,\n    maxBet: cfg.maxBet,\n    nullMean: cfg.nullMean,\n    ...(resume === undefined ? {} : { resume }),\n  })\n  const threshold = 1 / cfg.alpha\n  let terminal: SequentialDecision | undefined =\n    resume === undefined || resume.decision === 'continue' ? undefined : resume.decision\n  return {\n    observe(delta: number): SequentialObservation {\n      if (terminal === 'undecided-at-maxN') {\n        throw new Error(\n          `sequentialPairedGate: pre-registered maxN=${cfg.maxN} exhausted — extending the ` +\n            'stream after seeing the result reopens optional stopping; start a NEW ' +\n            'pre-registered test',\n        )\n      }\n      if (!Number.isFinite(delta) || Math.abs(delta) > cfg.scale) {\n        throw new Error(\n          `sequentialPairedGate: delta ${delta} outside ±scale=${cfg.scale} — pass the judge's ` +\n            `native scale explicitly (detectScale helps pick 1 vs 100)`,\n        )\n      }\n      const d = cfg.direction === 'decrease' ? -delta : delta\n      const step = proc.update((d / cfg.scale + 1) / 2)\n      // Stopping rule: FIRST n ≥ minN with current wealth ≥ 1/alpha — a valid\n      // stopping time (measurable w.r.t. the past), sticky once latched. The\n      // core's own `decided` latch ignores minN, so the gate re-derives the\n      // decision from current wealth here.\n      if (terminal === undefined && step.n >= cfg.minN && step.wealth >= threshold) {\n        terminal = 'promote'\n      }\n      if (terminal === 'promote') {\n        return {\n          decision: 'promote',\n          eValue: step.wealth,\n          n: step.n,\n          reason:\n            `e-value ${step.wealth.toFixed(2)} ≥ 1/α=${threshold.toFixed(2)} at n=${step.n} ` +\n            `(minN=${cfg.minN}): the paired improvement exceeds ${cfg.minEffect} at anytime-valid ` +\n            `level α=${cfg.alpha}`,\n        }\n      }\n      if (step.n >= cfg.maxN) {\n        terminal = 'undecided-at-maxN'\n        return {\n          decision: 'undecided-at-maxN',\n          eValue: step.wealth,\n          n: step.n,\n          reason:\n            `undecided at pre-registered maxN=${cfg.maxN} (e-value ${step.wealth.toFixed(2)} < ` +\n            `1/α=${threshold.toFixed(2)}). This is NOT evidence of no effect — the effect may be ` +\n            'real but smaller than this budget can detect; re-register with a larger N to test that',\n        }\n      }\n      return {\n        decision: 'continue',\n        eValue: step.wealth,\n        n: step.n,\n        reason: `e-value ${step.wealth.toFixed(2)} < 1/α=${threshold.toFixed(2)} at n=${step.n}/${cfg.maxN} — keep observing`,\n      }\n    },\n    state() {\n      return { ...proc.state(), decision: terminal ?? 'continue' }\n    },\n  }\n}\n\n/** Data-independent in-place Fisher–Yates with a seeded PRNG — the permutation\n *  depends only on the seed, never the values, so bet predictability survives. */\nfunction seededShuffle<T>(items: T[], seed: number): T[] {\n  const rng = mulberry32(seed)\n  for (let i = items.length - 1; i > 0; i--) {\n    const j = Math.floor(rng() * (i + 1))\n    const tmp = items[i]!\n    items[i] = items[j]!\n    items[j] = tmp\n  }\n  return items\n}\n\n/**\n * Anytime-valid sequential paired gate. Conforms to the existing `Gate`\n * contract (`decide(ctx)` consumes candidate vs baseline judge scores via\n * `pairHoldout` — same pairing granularity as the fixed-n gates: full cellId,\n * never scenarioId) and adds a streaming `observe(delta)` entry for campaigns\n * that score cells incrementally and want to stop mid-stream.\n *\n * Decision mapping onto the substrate's five-valued `GateDecision`:\n *   - 'promote'            → 'ship'\n *   - 'continue'           → 'need_more_work' (stream ended before maxN with\n *                            the e-value undecided — more reps could decide)\n *   - 'undecided-at-maxN'  → 'hold', with the reason stating it is NOT\n *                            evidence of no effect (never a silent default)\n */\nexport function sequentialPairedGate<TArtifact = unknown, TScenario extends Scenario = Scenario>(\n  options: SequentialPairedGateOptions,\n): SequentialPairedGate<TArtifact, TScenario> {\n  const cfg = resolveConfig(options)\n  const name = options.name ?? 'sequentialPairedGate'\n  const manifest = options.preRegistration\n  const observeStream = makeStream(cfg, options.resume)\n\n  return {\n    name,\n    observe(delta: number): SequentialObservation {\n      return observeStream.observe(delta)\n    },\n    state() {\n      return observeStream.state()\n    },\n    async decide(ctx: GateContext<TArtifact, TScenario>): Promise<GateResult> {\n      if (!ctx.baselineJudgeScores) {\n        throw new Error(\n          `${name}: ctx.baselineJudgeScores is required — falling back to the candidate's own ` +\n            'scores would compare the candidate against itself (delta 0, silent no-op)',\n        )\n      }\n      const scenarioIds = new Set(ctx.scenarios.map((s) => s.id))\n      const paired = pairHoldout(\n        ctx.judgeScores,\n        ctx.baselineJudgeScores,\n        scenarioIds,\n        (s) => s.composite,\n      )\n      const deltas = paired.after.map((a, i) => a - paired.before[i]!)\n      seededShuffle(deltas, cfg.shuffleSeed)\n\n      const stream = makeStream(cfg)\n      let last: SequentialObservation | undefined\n      for (const d of deltas) {\n        last = stream.observe(d)\n        if (last.decision !== 'continue') break\n      }\n\n      const detail = {\n        ...stream.state(),\n        minN: cfg.minN,\n        maxN: cfg.maxN,\n        scale: cfg.scale,\n        shuffleSeed: cfg.shuffleSeed,\n        direction: cfg.direction,\n        minEffect: cfg.minEffect,\n        pairedN: deltas.length,\n        ...(manifest ? { preRegisteredId: manifest.id, metric: manifest.metric } : {}),\n      }\n      const meanDelta =\n        deltas.length === 0 ? undefined : deltas.reduce((s, d) => s + d, 0) / deltas.length\n\n      if (last === undefined) {\n        return {\n          decision: 'need_more_work',\n          reasons: [`${name}: no paired holdout observations — nothing to test`],\n          contributingGates: [{ name, status: 'not_evaluated', detail }],\n        }\n      }\n      const decision =\n        last.decision === 'promote'\n          ? 'ship'\n          : last.decision === 'continue'\n            ? 'need_more_work'\n            : 'hold'\n      return {\n        decision,\n        reasons: [`${name}: ${last.reason}`],\n        contributingGates: [\n          {\n            name,\n            status:\n              decision === 'ship'\n                ? 'pass'\n                : decision === 'need_more_work'\n                  ? 'not_evaluated'\n                  : 'fail',\n            detail,\n          },\n        ],\n        delta: meanDelta,\n      }\n    },\n  }\n}\n\nexport interface SequentialDecideOptions {\n  /** Type-I budget for the early-stop evidence. Default 0.05. */\n  alpha?: number\n  /** Minimum paired deltas before a stop may fire. Default 5. */\n  minN?: number\n  /** Bet truncation forwarded to `eProcess`. Default 0.5. */\n  maxBet?: number\n  /** Bound on |per-scenario composite delta|. Default 1. */\n  scale?: number\n}\n\nexport interface SequentialDecideFn {\n  (args: { history: GenerationRecord[] }): { stop: boolean; reason?: string }\n  /** Read-only snapshot of the accumulated e-process (observability + tests). */\n  state(): EProcessState\n}\n\n/**\n * `SurfaceProposer.decide` adapter — stops the optimization loop the moment\n * the e-process decides the loop has produced a real improvement, instead of\n * always running `maxGenerations`.\n *\n * Stream: for each generation g ≥ 1, the per-scenario composite deltas of\n * generation g's top candidate vs the generation-0 top candidate (the\n * incumbent the loop set out to beat), paired by scenarioId. H0: no proposed\n * surface improves any scenario's expected composite over the incumbent —\n * under it every delta has conditional mean ≤ 0 and the e-process is valid.\n * Once wealth ≥ 1/alpha the loop stops and hands the winner to the promotion\n * gate (which re-scores on HELD-OUT data — this adapter only spends the\n * exploration budget, it never promotes).\n *\n * Honesty caveats: (1) the incumbent's scores are measured once and shared\n * across all generations' deltas, so type-I control is exact only insofar as\n * those scores approximate the incumbent's true per-scenario means (more reps\n * → tighter); (2) an UNDECIDED process never stops the loop — absence of a\n * crossing is NOT evidence of no effect, so the loop simply runs its normal\n * course. Calling the adapter repeatedly with a growing history consumes each\n * generation exactly once (re-feeding an already-seen record would double-count\n * evidence).\n */\nexport function sequentialDecide(options: SequentialDecideOptions = {}): SequentialDecideFn {\n  const alpha = options.alpha ?? 0.05\n  const minN = options.minN ?? 5\n  const scale = options.scale ?? 1\n  if (!Number.isFinite(scale) || scale <= 0) {\n    throw new Error(`sequentialDecide: scale must be > 0, got ${scale}`)\n  }\n  const proc = eProcess({ alpha, maxBet: options.maxBet ?? 0.5, nullMean: 0.5 })\n  const threshold = 1 / alpha\n  let processedGenerations = 0\n  let reference: Map<string, number> | undefined\n  let stopped: { stop: true; reason: string } | undefined\n\n  const topCandidate = (record: GenerationRecord) => {\n    if (record.candidates.length === 0) {\n      throw new Error(\n        `sequentialDecide: generation ${record.generationIndex} has no candidates — ` +\n          'cannot extract a top candidate',\n      )\n    }\n    return record.candidates.reduce((best, candidate) => {\n      if (best.composite === null) return candidate\n      if (candidate.composite === null) return best\n      return candidate.composite > best.composite ? candidate : best\n    })\n  }\n\n  const decide: SequentialDecideFn = ({ history }) => {\n    if (stopped) return stopped\n    if (history.length === 0) return { stop: false }\n    if (reference === undefined) {\n      reference = new Map(\n        topCandidate(history[0]!).scenarios.map((s) => [s.scenarioId, s.composite]),\n      )\n    }\n    // Consume only generations not yet seen; start at 1 — generation 0 IS the\n    // reference and would contribute all-zero deltas (pure wealth dilution).\n    for (let g = Math.max(1, processedGenerations); g < history.length; g++) {\n      const top = topCandidate(history[g]!)\n      const byScenario = new Map(top.scenarios.map((s) => [s.scenarioId, s.composite]))\n      for (const [scenarioId, refComposite] of reference) {\n        const candComposite = byScenario.get(scenarioId)\n        if (candComposite === undefined) {\n          throw new Error(\n            `sequentialDecide: generation ${history[g]!.generationIndex} top candidate is missing ` +\n              `scenario '${scenarioId}' — generations must score the same scenario set to pair`,\n          )\n        }\n        const delta = candComposite - refComposite\n        if (!Number.isFinite(delta) || Math.abs(delta) > scale) {\n          throw new Error(\n            `sequentialDecide: paired delta ${delta} outside ±scale=${scale} on scenario ` +\n              `'${scenarioId}' — pass the composite scale explicitly`,\n          )\n        }\n        const step = proc.update((delta / scale + 1) / 2)\n        if (step.n >= minN && step.wealth >= threshold) {\n          stopped = {\n            stop: true,\n            reason:\n              `sequential e-process decided at generation ${history[g]!.generationIndex}: ` +\n              `e-value ${step.wealth.toFixed(2)} ≥ 1/α=${threshold.toFixed(2)} after n=${step.n} ` +\n              'paired deltas vs the generation-0 incumbent — the improvement is real at ' +\n              `α=${alpha}; stop exploring and promote via the gate`,\n          }\n          processedGenerations = history.length\n          return stopped\n        }\n      }\n    }\n    processedGenerations = history.length\n    return { stop: false }\n  }\n  decide.state = () => proc.state()\n  return decide\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2HA,SAAS,mBAAmB,GAA4B;CACtD,OAAO,sBAAsB,CAAC,MAAM,EAAE;AACxC;AAEA,SAAS,cAAc,MAAmD;CACxE,MAAM,IAAI,KAAK;CACf,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,GAAG;EACL,IAAI,CAAC,mBAAmB,CAAC,GACvB,MAAM,IAAI,MACR,oDAAoD,EAAE,GAAG,mCAC3D;EAEF,IAAI,KAAK,UAAU,KAAA,KAAa,KAAK,UAAU,EAAE,OAC/C,MAAM,IAAI,MACR,+BAA+B,KAAK,MAAM,uCAAuC,EAAE,MAAM,oEAE3F;EAEF,IAAI,KAAK,SAAS,KAAA,KAAa,KAAK,SAAS,EAAE,gBAC7C,MAAM,IAAI,MACR,8BAA8B,KAAK,KAAK,mCAAmC,EAAE,gBAC/E;EAEF,QAAQ,EAAE;EACV,OAAO,EAAE;EACT,YAAY,EAAE;EACd,YAAY,EAAE;CAChB,OAAO;EACL,QAAQ,KAAK,SAAS;EACtB,IAAI,KAAK,SAAS,KAAA,GAChB,MAAM,IAAI,MACR,mKAEF;EAEF,OAAO,KAAK;EACZ,YAAY;EACZ,YAAY;CACd;CACA,MAAM,QAAQ,KAAK,SAAS;CAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GACtC,MAAM,IAAI,MAAM,gDAAgD,OAAO;CAEzE,IAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,GACpC,MAAM,IAAI,MAAM,8DAA8D,MAAM;CAEtF,MAAM,OAAO,KAAK,QAAQ;CAC1B,IAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,KAAK,OAAO,MAChD,MAAM,IAAI,MACR,6DAA6D,KAAK,SAAS,MAC7E;CAEF,IAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,KAAK,aAAa,OAC/D,MAAM,IAAI,MACR,wDAAwD,MAAM,SAAS,WACzE;CAKF,MAAM,WAAW,KAAM,aAAa,IAAI;CACxC,OAAO;EACL;EACA;EACA;EACA,QAAQ,KAAK,UAAU;EACvB;EACA,aAAa,KAAK,eAAe;EACjC;EACA;EACA;CACF;AACF;AAOA,MAAM,uBAAsD;CAC1D;CACA;CACA;AACF;;;;AAKA,SAAS,sBAAsB,QAA+B,KAA2B;CACvF,MAAM,QAAQ,WAA0B;EACtC,MAAM,IAAI,MAAM,yCAAyC,QAAQ;CACnE;CACA,IAAI,CAAC,qBAAqB,SAAS,OAAO,QAAQ,GAChD,KAAK,qBAAqB,OAAO,OAAO,QAAQ,EAAE,EAAE;CAEtD,IAAI,OAAO,IAAI,IAAI,MACjB,KAAK,cAAc,OAAO,EAAE,mCAAmC,IAAI,MAAM;CAE3E,MAAM,YAAY,IAAI,IAAI;CAC1B,QAAQ,OAAO,UAAf;EACE,KAAK;GACH,IAAI,OAAO,IAAI,IAAI,MACjB,KAAK,2BAA2B,OAAO,EAAE,iBAAiB,IAAI,MAAM;GAEtE;EACF,KAAK;GACH,IAAI,OAAO,MAAM,IAAI,MACnB,KAAK,qCAAqC,OAAO,EAAE,uBAAuB,IAAI,MAAM;GAEtF;EACF,KAAK;GACH,IAAI,OAAO,KAAK,IAAI,MAClB,KAAK,4BAA4B,OAAO,EAAE,aAAa,IAAI,KAAK,yBAAyB;GAE3F,IAAI,OAAO,KAAK,IAAI,QAAQ,OAAO,UAAU,WAC3C,KACE,4BAA4B,OAAO,EAAE,UAAU,IAAI,KAAK,gBACnD,OAAO,OAAO,SAAS,UAAU,kCACxC;GAEF;CACJ;AACF;AAEA,SAAS,WAAW,KAAqB,QAAkD;CACzF,IAAI,WAAW,KAAA,GAAW,sBAAsB,QAAQ,GAAG;CAC3D,MAAM,OAAO,SAAS;EACpB,OAAO,IAAI;EACX,QAAQ,IAAI;EACZ,UAAU,IAAI;EACd,GAAI,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO;CAC3C,CAAC;CACD,MAAM,YAAY,IAAI,IAAI;CAC1B,IAAI,WACF,WAAW,KAAA,KAAa,OAAO,aAAa,aAAa,KAAA,IAAY,OAAO;CAC9E,OAAO;EACL,QAAQ,OAAsC;GAC5C,IAAI,aAAa,qBACf,MAAM,IAAI,MACR,6CAA6C,IAAI,KAAK,qHAGxD;GAEF,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,OACnD,MAAM,IAAI,MACR,+BAA+B,MAAM,kBAAkB,IAAI,MAAM,8EAEnE;GAEF,MAAM,IAAI,IAAI,cAAc,aAAa,CAAC,QAAQ;GAClD,MAAM,OAAO,KAAK,QAAQ,IAAI,IAAI,QAAQ,KAAK,CAAC;GAKhD,IAAI,aAAa,KAAA,KAAa,KAAK,KAAK,IAAI,QAAQ,KAAK,UAAU,WACjE,WAAW;GAEb,IAAI,aAAa,WACf,OAAO;IACL,UAAU;IACV,QAAQ,KAAK;IACb,GAAG,KAAK;IACR,QACE,WAAW,KAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,QAAQ,CAAC,EAAE,QAAQ,KAAK,EAAE,SACtE,IAAI,KAAK,oCAAoC,IAAI,UAAU,4BACzD,IAAI;GACnB;GAEF,IAAI,KAAK,KAAK,IAAI,MAAM;IACtB,WAAW;IACX,OAAO;KACL,UAAU;KACV,QAAQ,KAAK;KACb,GAAG,KAAK;KACR,QACE,oCAAoC,IAAI,KAAK,YAAY,KAAK,OAAO,QAAQ,CAAC,EAAE,SACzE,UAAU,QAAQ,CAAC,EAAE;IAEhC;GACF;GACA,OAAO;IACL,UAAU;IACV,QAAQ,KAAK;IACb,GAAG,KAAK;IACR,QAAQ,WAAW,KAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,QAAQ,CAAC,EAAE,QAAQ,KAAK,EAAE,GAAG,IAAI,KAAK;GACrG;EACF;EACA,QAAQ;GACN,OAAO;IAAE,GAAG,KAAK,MAAM;IAAG,UAAU,YAAY;GAAW;EAC7D;CACF;AACF;;;AAIA,SAAS,cAAiB,OAAY,MAAmB;CACvD,MAAM,MAAM,WAAW,IAAI;CAC3B,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;EACzC,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,EAAE;EACpC,MAAM,MAAM,MAAM;EAClB,MAAM,KAAK,MAAM;EACjB,MAAM,KAAK;CACb;CACA,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,qBACd,SAC4C;CAC5C,MAAM,MAAM,cAAc,OAAO;CACjC,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,WAAW,QAAQ;CACzB,MAAM,gBAAgB,WAAW,KAAK,QAAQ,MAAM;CAEpD,OAAO;EACL;EACA,QAAQ,OAAsC;GAC5C,OAAO,cAAc,QAAQ,KAAK;EACpC;EACA,QAAQ;GACN,OAAO,cAAc,MAAM;EAC7B;EACA,MAAM,OAAO,KAA6D;GACxE,IAAI,CAAC,IAAI,qBACP,MAAM,IAAI,MACR,GAAG,KAAK,sJAEV;GAEF,MAAM,cAAc,IAAI,IAAI,IAAI,UAAU,KAAK,MAAM,EAAE,EAAE,CAAC;GAC1D,MAAM,SAAS,YACb,IAAI,aACJ,IAAI,qBACJ,cACC,MAAM,EAAE,SACX;GACA,MAAM,SAAS,OAAO,MAAM,KAAK,GAAG,MAAM,IAAI,OAAO,OAAO,EAAG;GAC/D,cAAc,QAAQ,IAAI,WAAW;GAErC,MAAM,SAAS,WAAW,GAAG;GAC7B,IAAI;GACJ,KAAK,MAAM,KAAK,QAAQ;IACtB,OAAO,OAAO,QAAQ,CAAC;IACvB,IAAI,KAAK,aAAa,YAAY;GACpC;GAEA,MAAM,SAAS;IACb,GAAG,OAAO,MAAM;IAChB,MAAM,IAAI;IACV,MAAM,IAAI;IACV,OAAO,IAAI;IACX,aAAa,IAAI;IACjB,WAAW,IAAI;IACf,WAAW,IAAI;IACf,SAAS,OAAO;IAChB,GAAI,WAAW;KAAE,iBAAiB,SAAS;KAAI,QAAQ,SAAS;IAAO,IAAI,CAAC;GAC9E;GACA,MAAM,YACJ,OAAO,WAAW,IAAI,KAAA,IAAY,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;GAE/E,IAAI,SAAS,KAAA,GACX,OAAO;IACL,UAAU;IACV,SAAS,CAAC,GAAG,KAAK,mDAAmD;IACrE,mBAAmB,CAAC;KAAE;KAAM,QAAQ;KAAiB;IAAO,CAAC;GAC/D;GAEF,MAAM,WACJ,KAAK,aAAa,YACd,SACA,KAAK,aAAa,aAChB,mBACA;GACR,OAAO;IACL;IACA,SAAS,CAAC,GAAG,KAAK,IAAI,KAAK,QAAQ;IACnC,mBAAmB,CACjB;KACE;KACA,QACE,aAAa,SACT,SACA,aAAa,mBACX,kBACA;KACR;IACF,CACF;IACA,OAAO;GACT;EACF;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;AA0CA,SAAgB,iBAAiB,UAAmC,CAAC,GAAuB;CAC1F,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,QAAQ,QAAQ,SAAS;CAC/B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GACtC,MAAM,IAAI,MAAM,4CAA4C,OAAO;CAErE,MAAM,OAAO,SAAS;EAAE;EAAO,QAAQ,QAAQ,UAAU;EAAK,UAAU;CAAI,CAAC;CAC7E,MAAM,YAAY,IAAI;CACtB,IAAI,uBAAuB;CAC3B,IAAI;CACJ,IAAI;CAEJ,MAAM,gBAAgB,WAA6B;EACjD,IAAI,OAAO,WAAW,WAAW,GAC/B,MAAM,IAAI,MACR,gCAAgC,OAAO,gBAAgB,oDAEzD;EAEF,OAAO,OAAO,WAAW,QAAQ,MAAM,cAAc;GACnD,IAAI,KAAK,cAAc,MAAM,OAAO;GACpC,IAAI,UAAU,cAAc,MAAM,OAAO;GACzC,OAAO,UAAU,YAAY,KAAK,YAAY,YAAY;EAC5D,CAAC;CACH;CAEA,MAAM,UAA8B,EAAE,cAAc;EAClD,IAAI,SAAS,OAAO;EACpB,IAAI,QAAQ,WAAW,GAAG,OAAO,EAAE,MAAM,MAAM;EAC/C,IAAI,cAAc,KAAA,GAChB,YAAY,IAAI,IACd,aAAa,QAAQ,EAAG,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAC5E;EAIF,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,oBAAoB,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvE,MAAM,MAAM,aAAa,QAAQ,EAAG;GACpC,MAAM,aAAa,IAAI,IAAI,IAAI,UAAU,KAAK,MAAM,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;GAChF,KAAK,MAAM,CAAC,YAAY,iBAAiB,WAAW;IAClD,MAAM,gBAAgB,WAAW,IAAI,UAAU;IAC/C,IAAI,kBAAkB,KAAA,GACpB,MAAM,IAAI,MACR,gCAAgC,QAAQ,EAAE,CAAE,gBAAgB,sCAC7C,WAAW,yDAC5B;IAEF,MAAM,QAAQ,gBAAgB;IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,OAC/C,MAAM,IAAI,MACR,kCAAkC,MAAM,kBAAkB,MAAM,gBAC1D,WAAW,wCACnB;IAEF,MAAM,OAAO,KAAK,QAAQ,QAAQ,QAAQ,KAAK,CAAC;IAChD,IAAI,KAAK,KAAK,QAAQ,KAAK,UAAU,WAAW;KAC9C,UAAU;MACR,MAAM;MACN,QACE,8CAA8C,QAAQ,EAAE,CAAE,gBAAgB,YAC/D,KAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,QAAQ,CAAC,EAAE,WAAW,KAAK,EAAE,8EAE7E,MAAM;KACf;KACA,uBAAuB,QAAQ;KAC/B,OAAO;IACT;GACF;EACF;EACA,uBAAuB,QAAQ;EAC/B,OAAO,EAAE,MAAM,MAAM;CACvB;CACA,OAAO,cAAc,KAAK,MAAM;CAChC,OAAO;AACT"}
+{"version":3,"file":"sequential-B51qAYE4.js","names":[],"sources":["../src/campaign/gates/sequential.ts"],"sourcesContent":["/**\n * Anytime-valid sequential promotion gate — an e-process (betting\n * test-martingale, see `eProcess` in `statistics.ts`) over paired\n * per-scenario deltas, so a campaign stops the MOMENT evidence decides\n * instead of burning a fixed-n budget. Decisions remain valid at any\n * data-dependent stopping time (Ville's inequality), which is exactly what\n * fixed-n machinery cannot offer: peeking at a bootstrap CI after every\n * observation and stopping on the first significant peek inflates type-I\n * error far beyond alpha.\n *\n * REPLACES, never layers on, a fixed-n gate. Running `heldoutSignificance`\n * or `paretoSignificanceGate` repeatedly on a growing sample and stopping\n * early is optional stopping no matter how it is dressed up; this gate is\n * the valid way to stop early. Use one or the other per evidence stream.\n *\n * Pre-registration binding: anytime validity holds only for the\n * PRE-REGISTERED statistic. When a `SignedManifest` is bound, the gate takes\n * alpha from `manifest.alpha`, the observation budget from\n * `manifest.preRegisteredN`, orients deltas by `manifest.direction`, and\n * shifts the null boundary by `manifest.minEffect` — re-deciding the same\n * stream under different parameters after seeing data would reopen optional\n * stopping under a fancier name. The manifest's content hash is verified at\n * construction (sync, same `sha256-content` scheme as `signManifest`).\n *\n * Non-iid caveat (stated honestly): the supermartingale guarantee needs each\n * delta's conditional mean under H0 to stay ≤ the null boundary given the\n * past — exchangeable scenario deltas suffice. Scenario streams ordered by\n * difficulty or by scenario family violate this; `decide(ctx)` therefore\n * shuffles the paired deltas with a SEEDED permutation by default (the\n * permutation is data-independent, so bet predictability is preserved).\n * Stratified betting (per-stratum λ) is future work, not implemented here.\n */\n\nimport { manifestContentDigest, type SignedManifest } from '../../pre-registration'\nimport { type EProcessState, eProcess, mulberry32 } from '../../statistics'\nimport type { Gate, GateContext, GateResult, GenerationRecord, Scenario } from '../types'\nimport { pairHoldout } from './statistical-heldout'\n\nexport type SequentialDecision = 'promote' | 'continue' | 'undecided-at-maxN'\n\nexport interface SequentialObservation {\n  decision: SequentialDecision\n  /** Current e-value (the betting wealth) against H0. */\n  eValue: number\n  /** Paired deltas consumed so far. */\n  n: number\n  /** Names the decision basis. For 'undecided-at-maxN' it states explicitly\n   *  that exhausting the budget is NOT evidence of no effect. */\n  reason: string\n}\n\nexport interface SequentialPairedGateOptions {\n  /** Type-I budget. With `preRegistration` bound this MUST match\n   *  `manifest.alpha` (conflict throws). Default 0.05. */\n  alpha?: number\n  /** Minimum paired deltas before a promote may fire. The stopping rule is\n   *  \"first n ≥ minN with e-value ≥ 1/alpha\" — still a valid stopping time.\n   *  Default 5. */\n  minN?: number\n  /** Pre-registered observation budget. Required unless `preRegistration`\n   *  supplies it via `preRegisteredN` (conflict throws). */\n  maxN?: number\n  /** Bet truncation forwarded to `eProcess`. Default 0.5. */\n  maxBet?: number\n  /** Bound on |delta| in the judge's native scale; deltas are mapped to\n   *  x = (d/scale + 1)/2 ∈ [0,1]. A delta outside ±scale throws (use\n   *  `detectScale` to pick 1 vs 100 BEFORE streaming). Default 1. */\n  scale?: number\n  /** Seed for the data-independent shuffle of paired deltas in `decide(ctx)`\n   *  (exchangeability guard). Default 1337. */\n  shuffleSeed?: number\n  /** Bind the pre-registered hypothesis. Verified (content hash) at\n   *  construction; alpha/maxN/direction/minEffect come FROM the manifest. */\n  preRegistration?: SignedManifest\n  /** Override the gate name in reports. */\n  name?: string\n  /** Continue the observe-stream from a `state()` snapshot taken before a\n   *  restart. The gate's parameters still resolve from this options object\n   *  (and the manifest); the snapshot must have been recorded under the same\n   *  alpha, maxBet, and null boundary, and its decision must be one this\n   *  configuration could have reached at its n, or construction throws.\n   *  `decide(ctx)` is unaffected — it always runs on a fresh stream. */\n  resume?: SequentialStreamState\n}\n\n/** Snapshot of one observe-stream: the e-process state plus the gate's own\n *  decision, which applies `minN` and `maxN` on top of the core latch. A\n *  gate rebuilt with `resume` from this value continues exactly where the\n *  snapshot was taken. */\nexport type SequentialStreamState = EProcessState & { decision: SequentialDecision }\n\nexport interface SequentialPairedGate<TArtifact = unknown, TScenario extends Scenario = Scenario>\n  extends Gate<TArtifact, TScenario> {\n  /** Streaming entry point: feed one paired per-scenario delta\n   *  (candidate − baseline, native scale). Each gate instance carries ONE\n   *  observe-stream; `decide(ctx)` runs on its own fresh stream and never\n   *  consumes or advances this one. 'promote' is sticky; observing past the\n   *  pre-registered maxN throws (extending a finished stream after seeing\n   *  the result reopens optional stopping — start a NEW pre-registered\n   *  test). */\n  observe(delta: number): SequentialObservation\n  /** Read-only snapshot of the observe-stream. Pass it back as\n   *  `resume` to continue the stream after a restart. */\n  state(): SequentialStreamState\n}\n\ninterface ResolvedConfig {\n  alpha: number\n  minN: number\n  maxN: number\n  maxBet: number\n  scale: number\n  shuffleSeed: number\n  /** 'decrease' negates deltas so \"better\" is always positive. */\n  direction: 'increase' | 'decrease'\n  /** H0 boundary in x-space: 1/2 + minEffect/(2·scale). */\n  nullMean: number\n  minEffect: number\n}\n\n/** Sync twin of `verifyManifest`, so gate construction stays synchronous and\n *  fails loud before any observation is consumed. The digest scheme belongs to\n *  `pre-registration`; this gate only compares. */\nfunction verifyManifestSync(m: SignedManifest): boolean {\n  return manifestContentDigest(m) === m.contentHash\n}\n\nfunction resolveConfig(opts: SequentialPairedGateOptions): ResolvedConfig {\n  const m = opts.preRegistration\n  let alpha: number\n  let maxN: number\n  let direction: 'increase' | 'decrease'\n  let minEffect: number\n  if (m) {\n    if (!verifyManifestSync(m)) {\n      throw new Error(\n        `sequentialPairedGate: pre-registration manifest '${m.id}' content hash mismatch (tampered)`,\n      )\n    }\n    if (opts.alpha !== undefined && opts.alpha !== m.alpha) {\n      throw new Error(\n        `sequentialPairedGate: alpha ${opts.alpha} conflicts with pre-registered alpha ${m.alpha} — ` +\n          `the registered statistic is the only one anytime validity covers`,\n      )\n    }\n    if (opts.maxN !== undefined && opts.maxN !== m.preRegisteredN) {\n      throw new Error(\n        `sequentialPairedGate: maxN ${opts.maxN} conflicts with pre-registered N ${m.preRegisteredN}`,\n      )\n    }\n    alpha = m.alpha\n    maxN = m.preRegisteredN\n    direction = m.direction\n    minEffect = m.minEffect\n  } else {\n    alpha = opts.alpha ?? 0.05\n    if (opts.maxN === undefined) {\n      throw new Error(\n        'sequentialPairedGate: maxN is required (or bind a preRegistration manifest whose ' +\n          'preRegisteredN is the budget) — an unbounded stream has no pre-registered budget',\n      )\n    }\n    maxN = opts.maxN\n    direction = 'increase'\n    minEffect = 0\n  }\n  const scale = opts.scale ?? 1\n  if (!Number.isFinite(scale) || scale <= 0) {\n    throw new Error(`sequentialPairedGate: scale must be > 0, got ${scale}`)\n  }\n  if (!Number.isInteger(maxN) || maxN < 1) {\n    throw new Error(`sequentialPairedGate: maxN must be a positive integer, got ${maxN}`)\n  }\n  const minN = opts.minN ?? 5\n  if (!Number.isInteger(minN) || minN < 1 || minN > maxN) {\n    throw new Error(\n      `sequentialPairedGate: minN must be an integer in [1, maxN=${maxN}], got ${minN}`,\n    )\n  }\n  if (!Number.isFinite(minEffect) || minEffect < 0 || minEffect >= scale) {\n    throw new Error(\n      `sequentialPairedGate: minEffect must be in [0, scale=${scale}), got ${minEffect}`,\n    )\n  }\n  // H0: mean delta ≤ minEffect. In x = (d/scale + 1)/2 space that is\n  // E[x] ≤ 1/2 + minEffect/(2·scale) — a shifted null boundary, NOT a clamp\n  // of the observations (clamping is mean-distorting for skewed deltas).\n  const nullMean = 0.5 + minEffect / (2 * scale)\n  return {\n    alpha,\n    minN,\n    maxN,\n    maxBet: opts.maxBet ?? 0.5,\n    scale,\n    shuffleSeed: opts.shuffleSeed ?? 1337,\n    direction,\n    nullMean,\n    minEffect,\n  }\n}\n\ninterface SequentialStream {\n  observe(delta: number): SequentialObservation\n  state(): SequentialStreamState\n}\n\nconst SEQUENTIAL_DECISIONS: readonly SequentialDecision[] = [\n  'promote',\n  'continue',\n  'undecided-at-maxN',\n]\n\n/** Refuse a snapshot whose gate decision this configuration could not have\n *  reached at the snapshot's n. The e-process parameters are checked by\n *  `eProcess` itself; this covers the gate's own stopping rule. */\nfunction assertResumableStream(resume: SequentialStreamState, cfg: ResolvedConfig): void {\n  const fail = (detail: string): never => {\n    throw new Error(`sequentialPairedGate: cannot resume — ${detail}`)\n  }\n  if (!SEQUENTIAL_DECISIONS.includes(resume.decision)) {\n    fail(`unknown decision '${String(resume.decision)}'`)\n  }\n  if (resume.n > cfg.maxN) {\n    fail(`snapshot n=${resume.n} exceeds the pre-registered maxN=${cfg.maxN}`)\n  }\n  const threshold = 1 / cfg.alpha\n  switch (resume.decision) {\n    case 'promote':\n      if (resume.n < cfg.minN) {\n        fail(`decision 'promote' at n=${resume.n} is below minN=${cfg.minN}`)\n      }\n      break\n    case 'undecided-at-maxN':\n      if (resume.n !== cfg.maxN) {\n        fail(`decision 'undecided-at-maxN' at n=${resume.n} does not match maxN=${cfg.maxN}`)\n      }\n      break\n    case 'continue':\n      if (resume.n >= cfg.maxN) {\n        fail(`decision 'continue' at n=${resume.n} with maxN=${cfg.maxN}; the stream is finished`)\n      }\n      if (resume.n >= cfg.minN && resume.wealth >= threshold) {\n        fail(\n          `decision 'continue' at n=${resume.n} ≥ minN=${cfg.minN} with e-value ` +\n            `${resume.wealth} ≥ 1/α=${threshold}; this stream would have promoted`,\n        )\n      }\n      break\n  }\n}\n\nfunction makeStream(cfg: ResolvedConfig, resume?: SequentialStreamState): SequentialStream {\n  if (resume !== undefined) assertResumableStream(resume, cfg)\n  const proc = eProcess({\n    alpha: cfg.alpha,\n    maxBet: cfg.maxBet,\n    nullMean: cfg.nullMean,\n    ...(resume === undefined ? {} : { resume }),\n  })\n  const threshold = 1 / cfg.alpha\n  let terminal: SequentialDecision | undefined =\n    resume === undefined || resume.decision === 'continue' ? undefined : resume.decision\n  return {\n    observe(delta: number): SequentialObservation {\n      if (terminal === 'undecided-at-maxN') {\n        throw new Error(\n          `sequentialPairedGate: pre-registered maxN=${cfg.maxN} exhausted — extending the ` +\n            'stream after seeing the result reopens optional stopping; start a NEW ' +\n            'pre-registered test',\n        )\n      }\n      if (!Number.isFinite(delta) || Math.abs(delta) > cfg.scale) {\n        throw new Error(\n          `sequentialPairedGate: delta ${delta} outside ±scale=${cfg.scale} — pass the judge's ` +\n            `native scale explicitly (detectScale helps pick 1 vs 100)`,\n        )\n      }\n      const d = cfg.direction === 'decrease' ? -delta : delta\n      const step = proc.update((d / cfg.scale + 1) / 2)\n      // Stopping rule: FIRST n ≥ minN with current wealth ≥ 1/alpha — a valid\n      // stopping time (measurable w.r.t. the past), sticky once latched. The\n      // core's own `decided` latch ignores minN, so the gate re-derives the\n      // decision from current wealth here.\n      if (terminal === undefined && step.n >= cfg.minN && step.wealth >= threshold) {\n        terminal = 'promote'\n      }\n      if (terminal === 'promote') {\n        return {\n          decision: 'promote',\n          eValue: step.wealth,\n          n: step.n,\n          reason:\n            `e-value ${step.wealth.toFixed(2)} ≥ 1/α=${threshold.toFixed(2)} at n=${step.n} ` +\n            `(minN=${cfg.minN}): the paired improvement exceeds ${cfg.minEffect} at anytime-valid ` +\n            `level α=${cfg.alpha}`,\n        }\n      }\n      if (step.n >= cfg.maxN) {\n        terminal = 'undecided-at-maxN'\n        return {\n          decision: 'undecided-at-maxN',\n          eValue: step.wealth,\n          n: step.n,\n          reason:\n            `undecided at pre-registered maxN=${cfg.maxN} (e-value ${step.wealth.toFixed(2)} < ` +\n            `1/α=${threshold.toFixed(2)}). This is NOT evidence of no effect — the effect may be ` +\n            'real but smaller than this budget can detect; re-register with a larger N to test that',\n        }\n      }\n      return {\n        decision: 'continue',\n        eValue: step.wealth,\n        n: step.n,\n        reason: `e-value ${step.wealth.toFixed(2)} < 1/α=${threshold.toFixed(2)} at n=${step.n}/${cfg.maxN} — keep observing`,\n      }\n    },\n    state() {\n      return { ...proc.state(), decision: terminal ?? 'continue' }\n    },\n  }\n}\n\n/** Data-independent in-place Fisher–Yates with a seeded PRNG — the permutation\n *  depends only on the seed, never the values, so bet predictability survives. */\nfunction seededShuffle<T>(items: T[], seed: number): T[] {\n  const rng = mulberry32(seed)\n  for (let i = items.length - 1; i > 0; i--) {\n    const j = Math.floor(rng() * (i + 1))\n    const tmp = items[i]!\n    items[i] = items[j]!\n    items[j] = tmp\n  }\n  return items\n}\n\n/**\n * Anytime-valid sequential paired gate. Conforms to the existing `Gate`\n * contract (`decide(ctx)` consumes candidate vs baseline judge scores via\n * `pairHoldout` — same pairing granularity as the fixed-n gates: full cellId,\n * never scenarioId) and adds a streaming `observe(delta)` entry for campaigns\n * that score cells incrementally and want to stop mid-stream.\n *\n * Decision mapping onto the substrate's five-valued `GateDecision`:\n *   - 'promote'            → 'ship'\n *   - 'continue'           → 'need_more_work' (stream ended before maxN with\n *                            the e-value undecided — more reps could decide)\n *   - 'undecided-at-maxN'  → 'hold', with the reason stating it is NOT\n *                            evidence of no effect (never a silent default)\n */\nexport function sequentialPairedGate<TArtifact = unknown, TScenario extends Scenario = Scenario>(\n  options: SequentialPairedGateOptions,\n): SequentialPairedGate<TArtifact, TScenario> {\n  const cfg = resolveConfig(options)\n  const name = options.name ?? 'sequentialPairedGate'\n  const manifest = options.preRegistration\n  const observeStream = makeStream(cfg, options.resume)\n\n  return {\n    name,\n    observe(delta: number): SequentialObservation {\n      return observeStream.observe(delta)\n    },\n    state() {\n      return observeStream.state()\n    },\n    async decide(ctx: GateContext<TArtifact, TScenario>): Promise<GateResult> {\n      if (!ctx.baselineJudgeScores) {\n        throw new Error(\n          `${name}: ctx.baselineJudgeScores is required — falling back to the candidate's own ` +\n            'scores would compare the candidate against itself (delta 0, silent no-op)',\n        )\n      }\n      const scenarioIds = new Set(ctx.scenarios.map((s) => s.id))\n      const paired = pairHoldout(\n        ctx.judgeScores,\n        ctx.baselineJudgeScores,\n        scenarioIds,\n        (s) => s.composite,\n      )\n      const deltas = paired.after.map((a, i) => a - paired.before[i]!)\n      seededShuffle(deltas, cfg.shuffleSeed)\n\n      const stream = makeStream(cfg)\n      let last: SequentialObservation | undefined\n      for (const d of deltas) {\n        last = stream.observe(d)\n        if (last.decision !== 'continue') break\n      }\n\n      const detail = {\n        ...stream.state(),\n        minN: cfg.minN,\n        maxN: cfg.maxN,\n        scale: cfg.scale,\n        shuffleSeed: cfg.shuffleSeed,\n        direction: cfg.direction,\n        minEffect: cfg.minEffect,\n        pairedN: deltas.length,\n        ...(manifest ? { preRegisteredId: manifest.id, metric: manifest.metric } : {}),\n      }\n      const meanDelta =\n        deltas.length === 0 ? undefined : deltas.reduce((s, d) => s + d, 0) / deltas.length\n\n      if (last === undefined) {\n        return {\n          decision: 'need_more_work',\n          reasons: [`${name}: no paired holdout observations — nothing to test`],\n          contributingGates: [{ name, status: 'not_evaluated', detail }],\n        }\n      }\n      const decision =\n        last.decision === 'promote'\n          ? 'ship'\n          : last.decision === 'continue'\n            ? 'need_more_work'\n            : 'hold'\n      return {\n        decision,\n        reasons: [`${name}: ${last.reason}`],\n        contributingGates: [\n          {\n            name,\n            status:\n              decision === 'ship'\n                ? 'pass'\n                : decision === 'need_more_work'\n                  ? 'not_evaluated'\n                  : 'fail',\n            detail,\n          },\n        ],\n        delta: meanDelta,\n      }\n    },\n  }\n}\n\nexport interface SequentialDecideOptions {\n  /** Type-I budget for the early-stop evidence. Default 0.05. */\n  alpha?: number\n  /** Minimum paired deltas before a stop may fire. Default 5. */\n  minN?: number\n  /** Bet truncation forwarded to `eProcess`. Default 0.5. */\n  maxBet?: number\n  /** Bound on |per-scenario composite delta|. Default 1. */\n  scale?: number\n}\n\nexport interface SequentialDecideFn {\n  (args: { history: GenerationRecord[] }): { stop: boolean; reason?: string }\n  /** Read-only snapshot of the accumulated e-process (observability + tests). */\n  state(): EProcessState\n}\n\n/**\n * `SurfaceProposer.decide` adapter — stops the optimization loop the moment\n * the e-process decides the loop has produced a real improvement, instead of\n * always running `maxGenerations`.\n *\n * Stream: for each generation g ≥ 1, the per-scenario composite deltas of\n * generation g's top candidate vs the generation-0 top candidate (the\n * incumbent the loop set out to beat), paired by scenarioId. H0: no proposed\n * surface improves any scenario's expected composite over the incumbent —\n * under it every delta has conditional mean ≤ 0 and the e-process is valid.\n * Once wealth ≥ 1/alpha the loop stops and hands the winner to the promotion\n * gate (which re-scores on HELD-OUT data — this adapter only spends the\n * exploration budget, it never promotes).\n *\n * Honesty caveats: (1) the incumbent's scores are measured once and shared\n * across all generations' deltas, so type-I control is exact only insofar as\n * those scores approximate the incumbent's true per-scenario means (more reps\n * → tighter); (2) an UNDECIDED process never stops the loop — absence of a\n * crossing is NOT evidence of no effect, so the loop simply runs its normal\n * course. Calling the adapter repeatedly with a growing history consumes each\n * generation exactly once (re-feeding an already-seen record would double-count\n * evidence).\n */\nexport function sequentialDecide(options: SequentialDecideOptions = {}): SequentialDecideFn {\n  const alpha = options.alpha ?? 0.05\n  const minN = options.minN ?? 5\n  const scale = options.scale ?? 1\n  if (!Number.isFinite(scale) || scale <= 0) {\n    throw new Error(`sequentialDecide: scale must be > 0, got ${scale}`)\n  }\n  const proc = eProcess({ alpha, maxBet: options.maxBet ?? 0.5, nullMean: 0.5 })\n  const threshold = 1 / alpha\n  let processedGenerations = 0\n  let reference: Map<string, number> | undefined\n  let stopped: { stop: true; reason: string } | undefined\n\n  const topCandidate = (record: GenerationRecord) => {\n    if (record.candidates.length === 0) {\n      throw new Error(\n        `sequentialDecide: generation ${record.generationIndex} has no candidates — ` +\n          'cannot extract a top candidate',\n      )\n    }\n    return record.candidates.reduce((best, candidate) => {\n      if (best.composite === null) return candidate\n      if (candidate.composite === null) return best\n      return candidate.composite > best.composite ? candidate : best\n    })\n  }\n\n  const decide: SequentialDecideFn = ({ history }) => {\n    if (stopped) return stopped\n    if (history.length === 0) return { stop: false }\n    if (reference === undefined) {\n      reference = new Map(\n        topCandidate(history[0]!).scenarios.map((s) => [s.scenarioId, s.composite]),\n      )\n    }\n    // Consume only generations not yet seen; start at 1 — generation 0 IS the\n    // reference and would contribute all-zero deltas (pure wealth dilution).\n    for (let g = Math.max(1, processedGenerations); g < history.length; g++) {\n      const top = topCandidate(history[g]!)\n      const byScenario = new Map(top.scenarios.map((s) => [s.scenarioId, s.composite]))\n      for (const [scenarioId, refComposite] of reference) {\n        const candComposite = byScenario.get(scenarioId)\n        if (candComposite === undefined) {\n          throw new Error(\n            `sequentialDecide: generation ${history[g]!.generationIndex} top candidate is missing ` +\n              `scenario '${scenarioId}' — generations must score the same scenario set to pair`,\n          )\n        }\n        const delta = candComposite - refComposite\n        if (!Number.isFinite(delta) || Math.abs(delta) > scale) {\n          throw new Error(\n            `sequentialDecide: paired delta ${delta} outside ±scale=${scale} on scenario ` +\n              `'${scenarioId}' — pass the composite scale explicitly`,\n          )\n        }\n        const step = proc.update((delta / scale + 1) / 2)\n        if (step.n >= minN && step.wealth >= threshold) {\n          stopped = {\n            stop: true,\n            reason:\n              `sequential e-process decided at generation ${history[g]!.generationIndex}: ` +\n              `e-value ${step.wealth.toFixed(2)} ≥ 1/α=${threshold.toFixed(2)} after n=${step.n} ` +\n              'paired deltas vs the generation-0 incumbent — the improvement is real at ' +\n              `α=${alpha}; stop exploring and promote via the gate`,\n          }\n          processedGenerations = history.length\n          return stopped\n        }\n      }\n    }\n    processedGenerations = history.length\n    return { stop: false }\n  }\n  decide.state = () => proc.state()\n  return decide\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2HA,SAAS,mBAAmB,GAA4B;CACtD,OAAO,sBAAsB,CAAC,MAAM,EAAE;AACxC;AAEA,SAAS,cAAc,MAAmD;CACxE,MAAM,IAAI,KAAK;CACf,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,GAAG;EACL,IAAI,CAAC,mBAAmB,CAAC,GACvB,MAAM,IAAI,MACR,oDAAoD,EAAE,GAAG,mCAC3D;EAEF,IAAI,KAAK,UAAU,KAAA,KAAa,KAAK,UAAU,EAAE,OAC/C,MAAM,IAAI,MACR,+BAA+B,KAAK,MAAM,uCAAuC,EAAE,MAAM,oEAE3F;EAEF,IAAI,KAAK,SAAS,KAAA,KAAa,KAAK,SAAS,EAAE,gBAC7C,MAAM,IAAI,MACR,8BAA8B,KAAK,KAAK,mCAAmC,EAAE,gBAC/E;EAEF,QAAQ,EAAE;EACV,OAAO,EAAE;EACT,YAAY,EAAE;EACd,YAAY,EAAE;CAChB,OAAO;EACL,QAAQ,KAAK,SAAS;EACtB,IAAI,KAAK,SAAS,KAAA,GAChB,MAAM,IAAI,MACR,mKAEF;EAEF,OAAO,KAAK;EACZ,YAAY;EACZ,YAAY;CACd;CACA,MAAM,QAAQ,KAAK,SAAS;CAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GACtC,MAAM,IAAI,MAAM,gDAAgD,OAAO;CAEzE,IAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,GACpC,MAAM,IAAI,MAAM,8DAA8D,MAAM;CAEtF,MAAM,OAAO,KAAK,QAAQ;CAC1B,IAAI,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,KAAK,OAAO,MAChD,MAAM,IAAI,MACR,6DAA6D,KAAK,SAAS,MAC7E;CAEF,IAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,KAAK,aAAa,OAC/D,MAAM,IAAI,MACR,wDAAwD,MAAM,SAAS,WACzE;CAKF,MAAM,WAAW,KAAM,aAAa,IAAI;CACxC,OAAO;EACL;EACA;EACA;EACA,QAAQ,KAAK,UAAU;EACvB;EACA,aAAa,KAAK,eAAe;EACjC;EACA;EACA;CACF;AACF;AAOA,MAAM,uBAAsD;CAC1D;CACA;CACA;AACF;;;;AAKA,SAAS,sBAAsB,QAA+B,KAA2B;CACvF,MAAM,QAAQ,WAA0B;EACtC,MAAM,IAAI,MAAM,yCAAyC,QAAQ;CACnE;CACA,IAAI,CAAC,qBAAqB,SAAS,OAAO,QAAQ,GAChD,KAAK,qBAAqB,OAAO,OAAO,QAAQ,EAAE,EAAE;CAEtD,IAAI,OAAO,IAAI,IAAI,MACjB,KAAK,cAAc,OAAO,EAAE,mCAAmC,IAAI,MAAM;CAE3E,MAAM,YAAY,IAAI,IAAI;CAC1B,QAAQ,OAAO,UAAf;EACE,KAAK;GACH,IAAI,OAAO,IAAI,IAAI,MACjB,KAAK,2BAA2B,OAAO,EAAE,iBAAiB,IAAI,MAAM;GAEtE;EACF,KAAK;GACH,IAAI,OAAO,MAAM,IAAI,MACnB,KAAK,qCAAqC,OAAO,EAAE,uBAAuB,IAAI,MAAM;GAEtF;EACF,KAAK;GACH,IAAI,OAAO,KAAK,IAAI,MAClB,KAAK,4BAA4B,OAAO,EAAE,aAAa,IAAI,KAAK,yBAAyB;GAE3F,IAAI,OAAO,KAAK,IAAI,QAAQ,OAAO,UAAU,WAC3C,KACE,4BAA4B,OAAO,EAAE,UAAU,IAAI,KAAK,gBACnD,OAAO,OAAO,SAAS,UAAU,kCACxC;GAEF;CACJ;AACF;AAEA,SAAS,WAAW,KAAqB,QAAkD;CACzF,IAAI,WAAW,KAAA,GAAW,sBAAsB,QAAQ,GAAG;CAC3D,MAAM,OAAO,SAAS;EACpB,OAAO,IAAI;EACX,QAAQ,IAAI;EACZ,UAAU,IAAI;EACd,GAAI,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO;CAC3C,CAAC;CACD,MAAM,YAAY,IAAI,IAAI;CAC1B,IAAI,WACF,WAAW,KAAA,KAAa,OAAO,aAAa,aAAa,KAAA,IAAY,OAAO;CAC9E,OAAO;EACL,QAAQ,OAAsC;GAC5C,IAAI,aAAa,qBACf,MAAM,IAAI,MACR,6CAA6C,IAAI,KAAK,qHAGxD;GAEF,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,IAAI,OACnD,MAAM,IAAI,MACR,+BAA+B,MAAM,kBAAkB,IAAI,MAAM,8EAEnE;GAEF,MAAM,IAAI,IAAI,cAAc,aAAa,CAAC,QAAQ;GAClD,MAAM,OAAO,KAAK,QAAQ,IAAI,IAAI,QAAQ,KAAK,CAAC;GAKhD,IAAI,aAAa,KAAA,KAAa,KAAK,KAAK,IAAI,QAAQ,KAAK,UAAU,WACjE,WAAW;GAEb,IAAI,aAAa,WACf,OAAO;IACL,UAAU;IACV,QAAQ,KAAK;IACb,GAAG,KAAK;IACR,QACE,WAAW,KAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,QAAQ,CAAC,EAAE,QAAQ,KAAK,EAAE,SACtE,IAAI,KAAK,oCAAoC,IAAI,UAAU,4BACzD,IAAI;GACnB;GAEF,IAAI,KAAK,KAAK,IAAI,MAAM;IACtB,WAAW;IACX,OAAO;KACL,UAAU;KACV,QAAQ,KAAK;KACb,GAAG,KAAK;KACR,QACE,oCAAoC,IAAI,KAAK,YAAY,KAAK,OAAO,QAAQ,CAAC,EAAE,SACzE,UAAU,QAAQ,CAAC,EAAE;IAEhC;GACF;GACA,OAAO;IACL,UAAU;IACV,QAAQ,KAAK;IACb,GAAG,KAAK;IACR,QAAQ,WAAW,KAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,QAAQ,CAAC,EAAE,QAAQ,KAAK,EAAE,GAAG,IAAI,KAAK;GACrG;EACF;EACA,QAAQ;GACN,OAAO;IAAE,GAAG,KAAK,MAAM;IAAG,UAAU,YAAY;GAAW;EAC7D;CACF;AACF;;;AAIA,SAAS,cAAiB,OAAY,MAAmB;CACvD,MAAM,MAAM,WAAW,IAAI;CAC3B,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;EACzC,MAAM,IAAI,KAAK,MAAM,IAAI,KAAK,IAAI,EAAE;EACpC,MAAM,MAAM,MAAM;EAClB,MAAM,KAAK,MAAM;EACjB,MAAM,KAAK;CACb;CACA,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,SAAgB,qBACd,SAC4C;CAC5C,MAAM,MAAM,cAAc,OAAO;CACjC,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,WAAW,QAAQ;CACzB,MAAM,gBAAgB,WAAW,KAAK,QAAQ,MAAM;CAEpD,OAAO;EACL;EACA,QAAQ,OAAsC;GAC5C,OAAO,cAAc,QAAQ,KAAK;EACpC;EACA,QAAQ;GACN,OAAO,cAAc,MAAM;EAC7B;EACA,MAAM,OAAO,KAA6D;GACxE,IAAI,CAAC,IAAI,qBACP,MAAM,IAAI,MACR,GAAG,KAAK,sJAEV;GAEF,MAAM,cAAc,IAAI,IAAI,IAAI,UAAU,KAAK,MAAM,EAAE,EAAE,CAAC;GAC1D,MAAM,SAAS,YACb,IAAI,aACJ,IAAI,qBACJ,cACC,MAAM,EAAE,SACX;GACA,MAAM,SAAS,OAAO,MAAM,KAAK,GAAG,MAAM,IAAI,OAAO,OAAO,EAAG;GAC/D,cAAc,QAAQ,IAAI,WAAW;GAErC,MAAM,SAAS,WAAW,GAAG;GAC7B,IAAI;GACJ,KAAK,MAAM,KAAK,QAAQ;IACtB,OAAO,OAAO,QAAQ,CAAC;IACvB,IAAI,KAAK,aAAa,YAAY;GACpC;GAEA,MAAM,SAAS;IACb,GAAG,OAAO,MAAM;IAChB,MAAM,IAAI;IACV,MAAM,IAAI;IACV,OAAO,IAAI;IACX,aAAa,IAAI;IACjB,WAAW,IAAI;IACf,WAAW,IAAI;IACf,SAAS,OAAO;IAChB,GAAI,WAAW;KAAE,iBAAiB,SAAS;KAAI,QAAQ,SAAS;IAAO,IAAI,CAAC;GAC9E;GACA,MAAM,YACJ,OAAO,WAAW,IAAI,KAAA,IAAY,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;GAE/E,IAAI,SAAS,KAAA,GACX,OAAO;IACL,UAAU;IACV,SAAS,CAAC,GAAG,KAAK,mDAAmD;IACrE,mBAAmB,CAAC;KAAE;KAAM,QAAQ;KAAiB;IAAO,CAAC;GAC/D;GAEF,MAAM,WACJ,KAAK,aAAa,YACd,SACA,KAAK,aAAa,aAChB,mBACA;GACR,OAAO;IACL;IACA,SAAS,CAAC,GAAG,KAAK,IAAI,KAAK,QAAQ;IACnC,mBAAmB,CACjB;KACE;KACA,QACE,aAAa,SACT,SACA,aAAa,mBACX,kBACA;KACR;IACF,CACF;IACA,OAAO;GACT;EACF;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;AA0CA,SAAgB,iBAAiB,UAAmC,CAAC,GAAuB;CAC1F,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,QAAQ,QAAQ,SAAS;CAC/B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,GACtC,MAAM,IAAI,MAAM,4CAA4C,OAAO;CAErE,MAAM,OAAO,SAAS;EAAE;EAAO,QAAQ,QAAQ,UAAU;EAAK,UAAU;CAAI,CAAC;CAC7E,MAAM,YAAY,IAAI;CACtB,IAAI,uBAAuB;CAC3B,IAAI;CACJ,IAAI;CAEJ,MAAM,gBAAgB,WAA6B;EACjD,IAAI,OAAO,WAAW,WAAW,GAC/B,MAAM,IAAI,MACR,gCAAgC,OAAO,gBAAgB,oDAEzD;EAEF,OAAO,OAAO,WAAW,QAAQ,MAAM,cAAc;GACnD,IAAI,KAAK,cAAc,MAAM,OAAO;GACpC,IAAI,UAAU,cAAc,MAAM,OAAO;GACzC,OAAO,UAAU,YAAY,KAAK,YAAY,YAAY;EAC5D,CAAC;CACH;CAEA,MAAM,UAA8B,EAAE,cAAc;EAClD,IAAI,SAAS,OAAO;EACpB,IAAI,QAAQ,WAAW,GAAG,OAAO,EAAE,MAAM,MAAM;EAC/C,IAAI,cAAc,KAAA,GAChB,YAAY,IAAI,IACd,aAAa,QAAQ,EAAG,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAC5E;EAIF,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,oBAAoB,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvE,MAAM,MAAM,aAAa,QAAQ,EAAG;GACpC,MAAM,aAAa,IAAI,IAAI,IAAI,UAAU,KAAK,MAAM,CAAC,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;GAChF,KAAK,MAAM,CAAC,YAAY,iBAAiB,WAAW;IAClD,MAAM,gBAAgB,WAAW,IAAI,UAAU;IAC/C,IAAI,kBAAkB,KAAA,GACpB,MAAM,IAAI,MACR,gCAAgC,QAAQ,EAAE,CAAE,gBAAgB,sCAC7C,WAAW,yDAC5B;IAEF,MAAM,QAAQ,gBAAgB;IAC9B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,IAAI,OAC/C,MAAM,IAAI,MACR,kCAAkC,MAAM,kBAAkB,MAAM,gBAC1D,WAAW,wCACnB;IAEF,MAAM,OAAO,KAAK,QAAQ,QAAQ,QAAQ,KAAK,CAAC;IAChD,IAAI,KAAK,KAAK,QAAQ,KAAK,UAAU,WAAW;KAC9C,UAAU;MACR,MAAM;MACN,QACE,8CAA8C,QAAQ,EAAE,CAAE,gBAAgB,YAC/D,KAAK,OAAO,QAAQ,CAAC,EAAE,SAAS,UAAU,QAAQ,CAAC,EAAE,WAAW,KAAK,EAAE,8EAE7E,MAAM;KACf;KACA,uBAAuB,QAAQ;KAC/B,OAAO;IACT;GACF;EACF;EACA,uBAAuB,QAAQ;EAC/B,OAAO,EAAE,MAAM,MAAM;CACvB;CACA,OAAO,cAAc,KAAK,MAAM;CAChC,OAAO;AACT"}

package/dist/{server-BtFd4uzB.js → server-CCEnywOR.js}

@@ -1,6 +1,7 @@
+import { a as hashCanonical } from "./canonical-DPyQ_rpt.js";
 import { i as CostLedger } from "./cost-ledger-B1qx30B4.js";
 import { t as packageVersion } from "./package-version-D7lQHt_-.js";
-import { t as paidJsonChat } from "./chat-json-call-6g5sJobJ.js";
+import { t as paidJsonChat } from "./chat-json-call-5Jxna-aV.js";
 import { z } from "zod";
 import { OpenAPIRegistry, OpenApiGeneratorV31, extendZodWithOpenApi } from "@asteasolutions/zod-to-openapi";
 import { serve } from "@hono/node-server";
@@ -52,7 +53,7 @@ const JudgeResultSchema = z.object({
 	failureModes: z.array(z.string()).default([]).describe("Failure-mode ids detected in the content (subset of rubric.failureModes ids)."),
 	wins: z.array(z.string()).default([]).describe("Win ids detected in the content (subset of rubric.wins ids)."),
 	rationale: z.string().describe("Plain-English explanation of the score. Surfaced to the human reviewer."),
-	rubricVersion: z.string().describe("Stable hash of the rubric used. Scores are only comparable across runs when this matches."),
+	rubricVersion: z.string().describe("Stable identity of the rubric used, as `<name>@sha256-rfc8785:<hex>`. Scores are only comparable across runs when this matches exactly."),
 	model: z.string().describe("Model that produced the judgement, for reproducibility."),
 	durationMs: z.number().int().nonnegative().describe("End-to-end wall time for this call.")
 }).openapi("JudgeResult");
@@ -65,7 +66,7 @@ const RubricInfoSchema = z.object({
 		weight: z.number()
 	})).describe("The scoring axes this rubric uses, with weights."),
 	failureModes: z.array(z.string()).default([]).describe("Failure-mode ids this rubric detects."),
-	rubricVersion: z.string().describe("Stable hash — match this to compare scores across runs.")
+	rubricVersion: z.string().describe("Stable identity, as `<name>@sha256-rfc8785:<hex>` — match this to compare scores across runs.")
 }).openapi("RubricInfo");
 const ListRubricsResponseSchema = z.object({ rubrics: z.array(RubricInfoSchema) }).openapi("ListRubricsResponse");
 const VersionResponseSchema = z.object({
@@ -215,24 +216,31 @@ const ErrorResponseSchema = z.object({ error: z.object({
 	details: z.unknown().optional().describe("Optional structured detail.")
 }).describe("Errors are always wrapped in this shape across all endpoints.") }).openapi("ErrorResponse");
 /**
-* Bump on any breaking change to a request/response schema.
-* Non-breaking (additive) changes don't require a bump.
+* Bump the major on any breaking change to a request/response schema — the
+* Python client compares majors and refuses a mismatch. Bump the minor when a
+* response value changes meaning without changing its shape, which a client
+* can detect but does not have to act on.
 */
-const WIRE_VERSION = "1.0.0";
+const WIRE_VERSION = "1.1.0";
 /**
-* Stable hash of a rubric. Used to make scores comparable across runs:
-* if the rubricVersion matches, the rubric was identical.
+* The digest scheme `hashRubric` mints, named inside the value it produces.
+* A consumer holding a tag from an earlier release reads a different scheme
+* here and can tell "this package changed how it hashes" from "the rubric
+* changed" — the two are indistinguishable when the value is an untagged hex
+* string.
+*/
+const RUBRIC_VERSION_SCHEME = "sha256-rfc8785";
+/**
+* Stable identity of a rubric, as `<name>@sha256-rfc8785:<hex>`. Two scores
+* are comparable when this matches exactly.
+*
+* The digest comes from `hashCanonical`, this package's only canonical-JSON
+* encoder (RFC 8785). RFC 8785 orders keys by UTF-16 code unit, which is a
+* property of the value alone — so the same rubric produces the same tag on
+* every machine, which a locale-collated key order does not guarantee.
 */
 function hashRubric(rubric) {
-	const stable = stableStringify(rubric);
-	let h = 5381;
-	for (let i = 0; i < stable.length; i++) h = h * 33 ^ stable.charCodeAt(i);
-	return `${rubric.name}@${(h >>> 0).toString(16).padStart(8, "0")}`;
-}
-function stableStringify(value) {
-	if (Array.isArray(value)) return `[${value.map((item) => stableStringify(item)).join(",")}]`;
-	if (value && typeof value === "object") return `{${Object.entries(value).sort(([a], [b]) => a.localeCompare(b)).map(([key, item]) => `${JSON.stringify(key)}:${stableStringify(item)}`).join(",")}}`;
-	return JSON.stringify(value);
+	return `${rubric.name}@${RUBRIC_VERSION_SCHEME}:${hashCanonical(rubric).slice(7)}`;
 }
 //#endregion
 //#region src/wire/rubrics.ts
@@ -996,6 +1004,6 @@ function startServerAsync(opts = {}) {
 	});
 }
 //#endregion
-export { hashRubric as A, RubricDimensionSchema as C, TracesIngestResponseSchema as D, TracesIngestRequestSchema as E, VersionResponseSchema as O, ListRubricsResponseSchema as S, TraceEventSchema as T, FeedbackIngestResponseSchema as _, runRpcBatch as a, JudgeRequestSchema as b, WireError as c, handleListRubrics as d, handleTracesIngest as f, ErrorResponseSchema as g, listBuiltinRubrics as h, dispatchRpc as i, WIRE_VERSION as k, handleFeedbackIngest as l, getBuiltinRubric as m, startServer as n, runRpcOnce as o, handleVersion as p, startServerAsync as r, buildOpenApi as s, createApp as t, handleJudge as u, FeedbackTrajectorySchema as v, RubricSchema as w, JudgeResultSchema as x, HealthResponseSchema as y };
+export { WIRE_VERSION as A, RUBRIC_VERSION_SCHEME as C, TracesIngestRequestSchema as D, TraceEventSchema as E, TracesIngestResponseSchema as O, ListRubricsResponseSchema as S, RubricSchema as T, FeedbackIngestResponseSchema as _, runRpcBatch as a, JudgeRequestSchema as b, WireError as c, handleListRubrics as d, handleTracesIngest as f, ErrorResponseSchema as g, listBuiltinRubrics as h, dispatchRpc as i, hashRubric as j, VersionResponseSchema as k, handleFeedbackIngest as l, getBuiltinRubric as m, startServer as n, runRpcOnce as o, handleVersion as p, startServerAsync as r, buildOpenApi as s, createApp as t, handleJudge as u, FeedbackTrajectorySchema as v, RubricDimensionSchema as w, JudgeResultSchema as x, HealthResponseSchema as y };
 
-//# sourceMappingURL=server-BtFd4uzB.js.map
+//# sourceMappingURL=server-CCEnywOR.js.map

package/dist/server-CCEnywOR.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"server-CCEnywOR.js","names":[],"sources":["../src/wire/schemas.ts","../src/wire/rubrics.ts","../src/wire/handlers.ts","../src/wire/openapi.ts","../src/wire/rpc.ts","../src/wire/server.ts"],"sourcesContent":["/**\n * Wire-protocol schemas.\n *\n * These Zod schemas are the contract between the agent-eval runtime and\n * any non-TypeScript client (Python, Rust, Go, …). They get rendered to\n * OpenAPI by `wire/openapi.ts` and code-generators consume that spec to\n * produce typed clients in other languages.\n *\n * Rule: if it's not in this file, it isn't on the wire. Keep names and\n * shapes self-explanatory — every field has a `.describe()` so the\n * generated docs are useful without reading the source.\n */\nimport { extendZodWithOpenApi } from '@asteasolutions/zod-to-openapi'\nimport { z } from 'zod'\nimport { hashCanonical } from '../ledger-core/canonical'\n\nextendZodWithOpenApi(z)\n\n// ── Building blocks ─────────────────────────────────────────────────\n\nexport const RubricDimensionSchema = z\n  .object({\n    id: z\n      .string()\n      .min(1)\n      .describe('Short stable id like \"buyer_quality\" — used as the key in scoring output.'),\n    description: z\n      .string()\n      .min(1)\n      .describe('One-line plain-English meaning. Read by humans reviewing low scores.'),\n    weight: z\n      .number()\n      .min(0)\n      .default(1)\n      .describe('Relative weight in the composite score. Default 1; 0 disables.'),\n    min: z.number().default(0).describe('Lower bound of valid score for this dimension.'),\n    max: z.number().default(1).describe('Upper bound of valid score for this dimension.'),\n  })\n  .openapi('RubricDimension')\n\nconst FailureModeSchema = z\n  .object({\n    id: z.string().min(1).describe('Short stable id like \"ai-cadence\" — used in detection lists.'),\n    description: z.string().min(1).describe('Plain-English description of the failure pattern.'),\n  })\n  .openapi('FailureMode')\n\n// ── Rubric ──────────────────────────────────────────────────────────\n\nexport const RubricSchema = z\n  .object({\n    name: z\n      .string()\n      .min(1)\n      .describe('Stable name like \"anti-slop\" — used by clients to invoke this rubric.'),\n    description: z\n      .string()\n      .min(1)\n      .describe('What this rubric measures. Shown in /v1/rubrics listing.'),\n    systemPrompt: z\n      .string()\n      .min(1)\n      .describe(\n        'Instructs the judging LLM. Should explain the persona (e.g. \"senior engineer reviewing voice\"), what to score on, and what to return.',\n      ),\n    dimensions: z\n      .array(RubricDimensionSchema)\n      .min(1)\n      .describe('Scoring axes. The composite score is a weighted sum of these.'),\n    failureModes: z\n      .array(FailureModeSchema)\n      .default([])\n      .describe('Patterns to detect; each detected mode appears in the result.failureModes list.'),\n    wins: z\n      .array(FailureModeSchema)\n      .default([])\n      .describe('Positive patterns; each detected one appears in the result.wins list.'),\n  })\n  .openapi('Rubric')\n\n// ── Judge call ──────────────────────────────────────────────────────\n\nexport const JudgeRequestSchema = z\n  .object({\n    rubricName: z\n      .string()\n      .optional()\n      .describe('Use a built-in rubric by name. Mutually exclusive with `rubric`.'),\n    rubric: RubricSchema.optional().describe(\n      'Inline rubric definition. Mutually exclusive with `rubricName`.',\n    ),\n    content: z\n      .string()\n      .min(1)\n      .describe('The text being judged — a tweet, a blog post, a code snippet, anything stringly.'),\n    context: z\n      .record(z.string(), z.unknown())\n      .optional()\n      .describe(\n        'Free-form metadata for the rubric to use — analytics, source URL, author, etc. Surfaced to the LLM.',\n      ),\n    model: z.string().optional().describe('Override the judge model configured by the server.'),\n  })\n  .refine((v) => Boolean(v.rubricName) !== Boolean(v.rubric), {\n    message: 'Provide exactly one of `rubricName` or `rubric`.',\n  })\n  .openapi('JudgeRequest')\n\nexport const JudgeResultSchema = z\n  .object({\n    composite: z\n      .number()\n      .min(0)\n      .max(1)\n      .describe('Weighted combination of dimension scores in 0..1. The single number to gate on.'),\n    dimensions: z\n      .record(z.string(), z.number())\n      .describe('Per-dimension score, keyed by RubricDimension.id.'),\n    failureModes: z\n      .array(z.string())\n      .default([])\n      .describe('Failure-mode ids detected in the content (subset of rubric.failureModes ids).'),\n    wins: z\n      .array(z.string())\n      .default([])\n      .describe('Win ids detected in the content (subset of rubric.wins ids).'),\n    rationale: z\n      .string()\n      .describe('Plain-English explanation of the score. Surfaced to the human reviewer.'),\n    rubricVersion: z\n      .string()\n      .describe(\n        'Stable identity of the rubric used, as `<name>@sha256-rfc8785:<hex>`. Scores are only comparable across runs when this matches exactly.',\n      ),\n    model: z.string().describe('Model that produced the judgement, for reproducibility.'),\n    durationMs: z.number().int().nonnegative().describe('End-to-end wall time for this call.'),\n  })\n  .openapi('JudgeResult')\n\n// ── Rubric listing ──────────────────────────────────────────────────\n\nconst RubricInfoSchema = z\n  .object({\n    name: z.string().describe('Pass this to /v1/judge as `rubricName`.'),\n    description: z.string().describe('What this rubric measures.'),\n    dimensions: z\n      .array(z.object({ id: z.string(), description: z.string(), weight: z.number() }))\n      .describe('The scoring axes this rubric uses, with weights.'),\n    failureModes: z.array(z.string()).default([]).describe('Failure-mode ids this rubric detects.'),\n    rubricVersion: z\n      .string()\n      .describe(\n        'Stable identity, as `<name>@sha256-rfc8785:<hex>` — match this to compare scores across runs.',\n      ),\n  })\n  .openapi('RubricInfo')\n\nexport const ListRubricsResponseSchema = z\n  .object({\n    rubrics: z.array(RubricInfoSchema),\n  })\n  .openapi('ListRubricsResponse')\n\n// ── Version / health ────────────────────────────────────────────────\n\nexport const VersionResponseSchema = z\n  .object({\n    package: z.string().describe('Package name (always \"@tangle-network/agent-eval\").'),\n    version: z.string().describe('Semver of the running server. Match your client to this.'),\n    wireVersion: z\n      .string()\n      .describe(\n        'Wire-protocol semver. Bumps separately from package version when the schema changes.',\n      ),\n    apiSurface: z.array(z.string()).describe('List of supported method names.'),\n  })\n  .openapi('VersionResponse')\n\nexport const HealthResponseSchema = z\n  .object({\n    status: z.literal('ok'),\n    uptimeSec: z.number(),\n  })\n  .openapi('HealthResponse')\n\n// ── Ingestion: production traces + user feedback ────────────────────\n\n/**\n * Minimal `TraceEvent` shape that the production runtime emits.\n * Matches `trace/schema.ts` `TraceEvent` but is duplicated here as a\n * wire schema so non-TypeScript clients can validate without depending\n * on internal types.\n */\nexport const TraceEventSchema = z\n  .object({\n    eventId: z.string().min(1).describe('Stable id for the event. Use ULID or UUID.'),\n    runId: z.string().min(1).describe('Run this event belongs to.'),\n    spanId: z.string().optional().describe('Span that emitted the event, if any.'),\n    kind: z\n      .enum([\n        'log',\n        'error',\n        'budget_decrement',\n        'budget_breach',\n        'state_mutation',\n        'policy_violation',\n        'redaction_applied',\n        'custom',\n      ])\n      .describe('Coarse event category — matches the TraceSchema v1 EventKind enum.'),\n    timestamp: z\n      .number()\n      .int()\n      .nonnegative()\n      .describe('Unix millis. Must be monotonically non-decreasing within a span.'),\n    payload: z\n      .record(z.string(), z.unknown())\n      .describe('Free-form payload — the runtime owns the shape.'),\n  })\n  .openapi('TraceEvent')\n\nexport const TracesIngestRequestSchema = z\n  .object({\n    events: z\n      .array(TraceEventSchema)\n      .min(1)\n      .max(10_000)\n      .describe('Batch of events. Max 10k per call — bigger streams should be chunked.'),\n  })\n  .openapi('TracesIngestRequest')\n\nexport const TracesIngestResponseSchema = z\n  .object({\n    accepted: z.number().int().nonnegative().describe('Number of events persisted.'),\n    rejected: z\n      .number()\n      .int()\n      .nonnegative()\n      .describe('Number of events the store refused — see `errors[]` for reasons.'),\n    errors: z\n      .array(\n        z.object({\n          eventId: z.string().describe('Event id this error applies to.'),\n          message: z.string().describe('Why the event was rejected.'),\n        }),\n      )\n      .default([]),\n  })\n  .openapi('TracesIngestResponse')\n\nconst FeedbackLabelSchema = z\n  .object({\n    id: z.string().optional(),\n    source: z.enum(['user', 'judge', 'environment', 'metric', 'policy', 'system']),\n    kind: z.enum([\n      'approve',\n      'reject',\n      'select',\n      'edit',\n      'rank',\n      'rate',\n      'comment',\n      'metric_outcome',\n      'policy_block',\n      'revision_request',\n    ]),\n    value: z.unknown(),\n    reason: z.string().optional(),\n    severity: z.enum(['info', 'warning', 'error', 'critical']).optional(),\n    createdAt: z.string().describe('ISO-8601 UTC.'),\n    metadata: z.record(z.string(), z.unknown()).optional(),\n  })\n  .openapi('FeedbackLabel')\n\nconst FeedbackAttemptSchema = z\n  .object({\n    id: z.string().min(1),\n    stepIndex: z.number().int().nonnegative(),\n    artifactType: z.enum([\n      'text',\n      'code',\n      'plan',\n      'research',\n      'action',\n      'ui',\n      'decision',\n      'data',\n      'other',\n    ]),\n    artifact: z.unknown(),\n    options: z.array(z.unknown()).optional(),\n    proposedAction: z\n      .object({\n        type: z.string(),\n        risk: z.enum(['low', 'medium', 'high']).optional(),\n        costUsd: z.number().optional(),\n        externalSideEffect: z.boolean().optional(),\n        requiresApproval: z.boolean().optional(),\n        metadata: z.record(z.string(), z.unknown()).optional(),\n      })\n      .optional(),\n    feedback: z.array(FeedbackLabelSchema).optional(),\n    createdAt: z.string(),\n    metadata: z.record(z.string(), z.unknown()).optional(),\n  })\n  .openapi('FeedbackAttempt')\n\nexport const FeedbackTrajectorySchema = z\n  .object({\n    id: z.string().min(1).describe('Stable id; idempotency key for the trajectory.'),\n    projectId: z.string().optional(),\n    scenarioId: z.string().optional(),\n    task: z.object({\n      intent: z.string().min(1),\n      context: z.unknown().optional(),\n    }),\n    attempts: z.array(FeedbackAttemptSchema).default([]),\n    labels: z.array(FeedbackLabelSchema).default([]),\n    outcome: z\n      .object({\n        success: z.boolean().optional(),\n        score: z.number().optional(),\n        metrics: z.record(z.string(), z.number()).optional(),\n        costUsd: z.number().optional(),\n        detail: z.string().optional(),\n        observedAt: z.string().optional(),\n        metadata: z.record(z.string(), z.unknown()).optional(),\n      })\n      .optional(),\n    split: z.enum(['train', 'dev', 'test', 'holdout']).optional(),\n    tags: z.record(z.string(), z.string()).optional(),\n    createdAt: z.string().describe('ISO-8601 UTC.'),\n    updatedAt: z.string().optional(),\n    metadata: z.record(z.string(), z.unknown()).optional(),\n  })\n  .openapi('FeedbackTrajectory')\n\nexport const FeedbackIngestResponseSchema = z\n  .object({\n    id: z.string().describe('Trajectory id that was persisted.'),\n    persisted: z.boolean().describe('True when the trajectory was saved (idempotent on id).'),\n  })\n  .openapi('FeedbackIngestResponse')\n\nexport type TraceEvent = z.infer<typeof TraceEventSchema>\nexport type TracesIngestRequest = z.infer<typeof TracesIngestRequestSchema>\nexport type TracesIngestResponse = z.infer<typeof TracesIngestResponseSchema>\nexport type FeedbackTrajectory = z.infer<typeof FeedbackTrajectorySchema>\nexport type FeedbackIngestResponse = z.infer<typeof FeedbackIngestResponseSchema>\n\n// ── Errors ──────────────────────────────────────────────────────────\n\nexport const ErrorResponseSchema = z\n  .object({\n    error: z\n      .object({\n        code: z\n          .string()\n          .describe(\n            'Machine-readable code: \"validation_error\", \"rubric_not_found\", \"judge_error\".',\n          ),\n        message: z.string().describe('Human-readable message.'),\n        details: z.unknown().optional().describe('Optional structured detail.'),\n      })\n      .describe('Errors are always wrapped in this shape across all endpoints.'),\n  })\n  .openapi('ErrorResponse')\n\n// ── Type exports for callers in the same package ────────────────────\n\nexport type RubricDimension = z.infer<typeof RubricDimensionSchema>\nexport type FailureMode = z.infer<typeof FailureModeSchema>\nexport type Rubric = z.infer<typeof RubricSchema>\nexport type JudgeRequest = z.infer<typeof JudgeRequestSchema>\nexport type JudgeResult = z.infer<typeof JudgeResultSchema>\nexport type RubricInfo = z.infer<typeof RubricInfoSchema>\nexport type ListRubricsResponse = z.infer<typeof ListRubricsResponseSchema>\nexport type VersionResponse = z.infer<typeof VersionResponseSchema>\nexport type ErrorResponse = z.infer<typeof ErrorResponseSchema>\n\n// ── Wire-protocol version ───────────────────────────────────────────\n\n/**\n * Bump the major on any breaking change to a request/response schema — the\n * Python client compares majors and refuses a mismatch. Bump the minor when a\n * response value changes meaning without changing its shape, which a client\n * can detect but does not have to act on.\n */\nexport const WIRE_VERSION = '1.1.0'\n\n/**\n * The digest scheme `hashRubric` mints, named inside the value it produces.\n * A consumer holding a tag from an earlier release reads a different scheme\n * here and can tell \"this package changed how it hashes\" from \"the rubric\n * changed\" — the two are indistinguishable when the value is an untagged hex\n * string.\n */\nexport const RUBRIC_VERSION_SCHEME = 'sha256-rfc8785'\n\n/**\n * Stable identity of a rubric, as `<name>@sha256-rfc8785:<hex>`. Two scores\n * are comparable when this matches exactly.\n *\n * The digest comes from `hashCanonical`, this package's only canonical-JSON\n * encoder (RFC 8785). RFC 8785 orders keys by UTF-16 code unit, which is a\n * property of the value alone — so the same rubric produces the same tag on\n * every machine, which a locale-collated key order does not guarantee.\n */\nexport function hashRubric(rubric: Rubric): string {\n  return `${rubric.name}@${RUBRIC_VERSION_SCHEME}:${hashCanonical(rubric).slice('sha256:'.length)}`\n}\n","/**\n * Built-in rubrics shipped with agent-eval.\n *\n * A rubric is a set of scoring axes plus a system prompt that tells the\n * judging LLM how to grade against those axes. Built-in rubrics are\n * curated for use cases that recur across Tangle projects — call them\n * by name from any client.\n *\n * Adding a rubric:\n *   1. Define the Rubric object below with a clear `description` and\n *      named `dimensions`.\n *   2. Register it in `BUILTIN_RUBRICS` at the bottom.\n *   3. Add a test in `tests/wire/rubrics.test.ts`.\n *\n * Custom rubrics: callers pass `rubric` inline to /v1/judge instead of\n * `rubricName` — see schemas.ts.\n */\nimport type { Rubric } from './schemas'\nimport { hashRubric } from './schemas'\n\n// ── anti-slop ───────────────────────────────────────────────────────\n// Voice/style judge tuned for technical-buyer audiences. Used by the\n// Postiz autoresearch loop and any content-quality gate.\n\nconst ANTI_SLOP: Rubric = {\n  name: 'anti-slop',\n  description:\n    'Voice and signal quality for content aimed at senior engineers. Catches AI cadence, marketing tone, and engagement-bait shapes.',\n  systemPrompt: `You are evaluating a piece of content written for senior engineers and technical founders.\n\nYou score three things:\n- buyer_quality (0..1): would a senior engineer in the target ICP find this worth their attention? High = specific, earned, technically interesting. Low = generic, hyped, off-target.\n- voice (0..1): does it read like a person who built the thing, or like AI/marketing copy?\n- signal (0..1): does it contain a non-obvious detail, constraint, or claim a reader couldn't get from the public docs?\n\nDetect failure modes (return ids matching):\n- ai-cadence: rule-of-three openings, em-dash flourish, \"Let me explain\", \"Here's the thing\", AI rhythm\n- marketing-tone: \"We're excited to announce\", \"thrilled\", \"delighted\", \"game-changer\", buzzword stack\n- vague-claim: technical claim without a specific component, file, or measurement\n- no-hook: opening doesn't earn attention from the target reader\n- engagement-bait: \"agree?\", \"thoughts?\", listicles, controversy-fishing, hook-detail-pitch\n- off-icp: content shape would attract motivational/grift/hype audiences instead of buyers\n- stale-claim: repeats a positioning line we've used many times this month\n\nDetect wins (return ids matching):\n- specific-component: names a real file, component, or measurement\n- earned-detail: shares a non-obvious detail not derivable from public docs\n- constraint-articulated: names a real tradeoff and the side chosen\n- honest-failure: describes a real failure mode and what was done about it\n\nReturn ONLY JSON matching the response schema. Be conservative — most content has 0-1 wins and 1-2 failure modes, not many of each.`,\n  dimensions: [\n    {\n      id: 'buyer_quality',\n      description: 'Would the target buyer find this worth attention?',\n      weight: 0.5,\n      min: 0,\n      max: 1,\n    },\n    {\n      id: 'voice',\n      description: 'Does it sound like a builder, not AI or marketing?',\n      weight: 0.3,\n      min: 0,\n      max: 1,\n    },\n    {\n      id: 'signal',\n      description: 'Non-obvious detail, constraint, or claim?',\n      weight: 0.2,\n      min: 0,\n      max: 1,\n    },\n  ],\n  failureModes: [\n    { id: 'ai-cadence', description: 'AI-rhythm openings and transitions' },\n    { id: 'marketing-tone', description: 'Buzzwords, hype, corporate-PR voice' },\n    { id: 'vague-claim', description: 'Technical claim without specifics' },\n    { id: 'no-hook', description: 'Opening fails to earn attention' },\n    { id: 'engagement-bait', description: 'Listicle/controversy/agree-pattern' },\n    { id: 'off-icp', description: 'Voice attracts the wrong audience' },\n    { id: 'stale-claim', description: 'Reuses an over-used positioning line' },\n  ],\n  wins: [\n    { id: 'specific-component', description: 'Names a real file/component/number' },\n    { id: 'earned-detail', description: 'Detail not in public docs' },\n    { id: 'constraint-articulated', description: 'Names a real tradeoff' },\n    { id: 'honest-failure', description: 'Describes a real failure honestly' },\n  ],\n}\n\n// ── Registry ────────────────────────────────────────────────────────\n\nconst BUILTIN_RUBRICS: Record<string, Rubric> = {\n  'anti-slop': ANTI_SLOP,\n}\n\n/** Get a built-in rubric by name, or undefined. */\nexport function getBuiltinRubric(name: string): Rubric | undefined {\n  return BUILTIN_RUBRICS[name]\n}\n\n/** List built-in rubrics with their stable versions. */\nexport function listBuiltinRubrics() {\n  return Object.values(BUILTIN_RUBRICS).map((r) => ({\n    name: r.name,\n    description: r.description,\n    dimensions: r.dimensions.map((d) => ({\n      id: d.id,\n      description: d.description,\n      weight: d.weight,\n    })),\n    failureModes: r.failureModes.map((f) => f.id),\n    rubricVersion: hashRubric(r),\n  }))\n}\n","/**\n * Pure handler functions — the \"business logic\" behind every wire-protocol\n * method. The HTTP server (`server.ts`) and the stdio RPC (`rpc.ts`) both\n * call these. Tests call these directly without spinning a server.\n *\n * Each handler:\n *   - Takes a parsed request (already Zod-validated by the transport).\n *   - Returns a result that matches the response schema.\n *   - Throws `WireError` for caller-fixable errors (404, 400, 422).\n *   - Lets unexpected errors bubble — the transport maps them to 500.\n */\n\nimport type { ChatClient } from '../analyst/chat-client'\nimport { paidJsonChat } from '../chat-json-call'\nimport { CostLedger, type CostLedgerHandle, type CustomTokenPricing } from '../cost-ledger'\nimport type { FeedbackTrajectoryStore } from '../feedback-trajectory'\nimport type { LlmCallRequest } from '../llm-client'\nimport { packageVersion } from '../package-version'\nimport type { TraceEvent as InternalTraceEvent } from '../trace/schema'\nimport type { TraceStore } from '../trace/store'\nimport { getBuiltinRubric, listBuiltinRubrics } from './rubrics'\nimport {\n  type FeedbackIngestResponse,\n  hashRubric,\n  type JudgeRequest,\n  type JudgeResult,\n  type ListRubricsResponse,\n  type Rubric,\n  type TracesIngestRequest,\n  type TracesIngestResponse,\n  type VersionResponse,\n  WIRE_VERSION,\n  type FeedbackTrajectory as WireFeedbackTrajectory,\n} from './schemas'\n\n/** Caller-fixable error. The transport renders this to 4xx + ErrorResponse. */\nexport class WireError extends Error {\n  constructor(\n    public readonly code: string,\n    message: string,\n    public readonly status: number = 400,\n    public readonly details?: unknown,\n  ) {\n    super(message)\n    this.name = 'WireError'\n  }\n}\n\n// ── judge ───────────────────────────────────────────────────────────\n\n/** The JSON schema we ask the judging LLM to fill in. */\nfunction judgeOutputSchema(rubric: Rubric) {\n  return {\n    name: 'JudgeOutput',\n    schema: {\n      type: 'object',\n      additionalProperties: false,\n      properties: {\n        dimensions: {\n          type: 'object',\n          additionalProperties: false,\n          properties: Object.fromEntries(\n            rubric.dimensions.map((d) => [\n              d.id,\n              { type: 'number', minimum: d.min, maximum: d.max },\n            ]),\n          ),\n          required: rubric.dimensions.map((d) => d.id),\n        },\n        failureModes: {\n          type: 'array',\n          items: { type: 'string', enum: rubric.failureModes.map((f) => f.id) },\n        },\n        wins: {\n          type: 'array',\n          items: { type: 'string', enum: rubric.wins.map((w) => w.id) },\n        },\n        rationale: { type: 'string' },\n      },\n      required: ['dimensions', 'rationale'],\n    } as Record<string, unknown>,\n  }\n}\n\ninterface JudgeOutput {\n  dimensions: Record<string, number>\n  failureModes?: string[]\n  wins?: string[]\n  rationale: string\n}\n\nfunction validateJudgeOutput(value: unknown, rubric: Rubric): JudgeOutput {\n  if (!value || typeof value !== 'object') {\n    throw new WireError('judge_error', 'Judge returned malformed output.', 500, value)\n  }\n  const raw = value as Record<string, unknown>\n  const rawDimensions = raw.dimensions\n  if (!rawDimensions || typeof rawDimensions !== 'object' || Array.isArray(rawDimensions)) {\n    throw new WireError('judge_error', 'Judge returned malformed dimensions.', 500, value)\n  }\n\n  const dimensions: Record<string, number> = {}\n  const dimensionRecord = rawDimensions as Record<string, unknown>\n  for (const dim of rubric.dimensions) {\n    const score = dimensionRecord[dim.id]\n    if (\n      typeof score !== 'number' ||\n      !Number.isFinite(score) ||\n      score < dim.min ||\n      score > dim.max\n    ) {\n      throw new WireError(\n        'judge_error',\n        `Judge returned invalid score for dimension \"${dim.id}\".`,\n        500,\n        value,\n      )\n    }\n    dimensions[dim.id] = score\n  }\n\n  const allowedFailures = new Set(rubric.failureModes.map((mode) => mode.id))\n  const allowedWins = new Set(rubric.wins.map((win) => win.id))\n  const failureModes = validateIdArray(raw.failureModes, allowedFailures, 'failureModes', value)\n  const wins = validateIdArray(raw.wins, allowedWins, 'wins', value)\n  if (typeof raw.rationale !== 'string' || raw.rationale.trim().length === 0) {\n    throw new WireError('judge_error', 'Judge returned missing rationale.', 500, value)\n  }\n\n  return { dimensions, failureModes, wins, rationale: raw.rationale }\n}\n\nfunction validateIdArray(\n  raw: unknown,\n  allowed: Set<string>,\n  field: 'failureModes' | 'wins',\n  original: unknown,\n): string[] {\n  if (raw === undefined) return []\n  if (!Array.isArray(raw)) {\n    throw new WireError('judge_error', `Judge returned non-array ${field}.`, 500, original)\n  }\n  const out: string[] = []\n  for (const item of raw) {\n    if (typeof item !== 'string' || !allowed.has(item)) {\n      throw new WireError(\n        'judge_error',\n        `Judge returned unknown ${field} id \"${String(item)}\".`,\n        500,\n        original,\n      )\n    }\n    out.push(item)\n  }\n  return out\n}\n\nfunction compositeScore(dimensions: Record<string, number>, rubric: Rubric): number {\n  let weighted = 0\n  let totalWeight = 0\n  for (const dim of rubric.dimensions) {\n    const raw = dimensions[dim.id] ?? 0\n    const range = dim.max - dim.min || 1\n    const normalized = Math.max(0, Math.min(1, (raw - dim.min) / range))\n    weighted += normalized * dim.weight\n    totalWeight += dim.weight\n  }\n  return totalWeight > 0 ? weighted / totalWeight : 0\n}\n\nfunction buildJudgePrompt(content: string, context: unknown): string {\n  const ctx = context && Object.keys(context as object).length ? JSON.stringify(context) : ''\n  return [\n    `CONTENT TO JUDGE:`,\n    content,\n    '',\n    ctx ? `CONTEXT (metadata, analytics, etc.):` : '',\n    ctx ? ctx : '',\n  ]\n    .filter(Boolean)\n    .join('\\n')\n}\n\nconst DEFAULT_JUDGE_MODEL = 'claude-sonnet-4-6'\n\nexport interface HandleJudgeOptions {\n  costLedger?: CostLedgerHandle\n  costPhase?: string\n  /**\n   * Caller-owned transport for the judge call. agent-eval holds no provider\n   * credential: the process that serves this endpoint binds its own client.\n   * Omitting it makes `/v1/judge` refuse with `llm_not_configured`.\n   */\n  chat?: ChatClient\n  defaultModel?: string\n  /** Endpoint rates used when the transport reports no billed amount. */\n  pricing?: CustomTokenPricing\n  signal?: AbortSignal\n}\n\nexport async function handleJudge(\n  req: JudgeRequest,\n  options: HandleJudgeOptions = {},\n): Promise<JudgeResult> {\n  // Resolve rubric\n  let rubric: Rubric\n  if (req.rubricName) {\n    const found = getBuiltinRubric(req.rubricName)\n    if (!found) {\n      throw new WireError('rubric_not_found', `No built-in rubric named \"${req.rubricName}\".`, 404)\n    }\n    rubric = found\n  } else if (req.rubric) {\n    rubric = req.rubric\n  } else {\n    // refine() in the schema should already have caught this — defense in depth\n    throw new WireError('validation_error', 'Provide either `rubricName` or `rubric`.', 422)\n  }\n\n  if (!options.chat) {\n    throw new WireError(\n      'llm_not_configured',\n      'No model transport is configured. Pass a ChatClient, or configure the CLI provider environment variables.',\n      503,\n    )\n  }\n\n  const startedAt = Date.now()\n  const model =\n    req.model ?? options.defaultModel ?? options.chat.defaultModel ?? DEFAULT_JUDGE_MODEL\n\n  const request = {\n    model,\n    messages: [\n      { role: 'system', content: rubric.systemPrompt },\n      { role: 'user', content: buildJudgePrompt(req.content, req.context) },\n    ],\n    jsonSchema: judgeOutputSchema(rubric),\n    temperature: 0.0,\n    maxTokens: 4_000,\n    timeoutMs: 60_000,\n  } satisfies LlmCallRequest\n  const paid = await paidJsonChat<JudgeOutput>({\n    chat: options.chat,\n    request,\n    ledger: options.costLedger ?? new CostLedger(),\n    channel: 'judge',\n    phase: options.costPhase ?? 'wire.judge',\n    actor: `wire.${req.rubricName ?? 'inline'}`,\n    ...(options.signal ? { signal: options.signal } : {}),\n    ...(options.pricing ? { pricing: options.pricing } : {}),\n  })\n  if (!paid.succeeded) throw paid.error\n  const { value, response } = paid\n\n  const output = validateJudgeOutput(value, rubric)\n\n  const composite = compositeScore(output.dimensions, rubric)\n  const durationMs = Date.now() - startedAt\n\n  return {\n    composite,\n    dimensions: output.dimensions,\n    failureModes: output.failureModes ?? [],\n    wins: output.wins ?? [],\n    rationale: output.rationale,\n    rubricVersion: hashRubric(rubric),\n    model: response.model,\n    durationMs,\n  }\n}\n\n// ── listRubrics ─────────────────────────────────────────────────────\n\nexport function handleListRubrics(): ListRubricsResponse {\n  return { rubrics: listBuiltinRubrics() }\n}\n\n// ── version ─────────────────────────────────────────────────────────\n\nexport function handleVersion(): VersionResponse {\n  return {\n    package: '@tangle-network/agent-eval',\n    version: packageVersion(),\n    wireVersion: WIRE_VERSION,\n    apiSurface: ['judge', 'listRubrics', 'version', 'feedback.ingest', 'traces.ingest'],\n  }\n}\n\n// ── Ingestion handlers ───────────────────────────────────────────────\n\n/**\n * Pluggable stores the wire layer routes ingestion writes into. Both\n * are optional — when omitted, the corresponding endpoint returns 503.\n *\n * Production deployments wire a `FileSystemTraceStore` and\n * `FileSystemFeedbackTrajectoryStore` here. Tests substitute in-memory\n * stores.\n */\nexport interface IngestionStores {\n  traceStore?: TraceStore\n  feedbackStore?: FeedbackTrajectoryStore\n}\n\n/**\n * `POST /v1/traces/ingest` — accept a batch of `TraceEvent`s from the\n * production runtime. Best-effort: each event is appended independently;\n * one bad event does not poison the batch.\n *\n * Idempotency: the underlying store is append-only; consumers retrying\n * the same payload will get duplicate events. Consumers should\n * de-duplicate by `eventId` downstream — production traces frequently\n * land via at-least-once buses (Kafka, SQS) where dedup is unavoidable.\n */\nexport async function handleTracesIngest(\n  req: TracesIngestRequest,\n  stores: IngestionStores,\n): Promise<TracesIngestResponse> {\n  if (!stores.traceStore) {\n    throw new WireError(\n      'service_unavailable',\n      'No trace store configured on this server. Pass `traceStore` to `createApp`.',\n      503,\n    )\n  }\n  const errors: Array<{ eventId: string; message: string }> = []\n  let accepted = 0\n  for (const event of req.events) {\n    try {\n      // The wire `TraceEvent` is structurally identical to the internal one.\n      await stores.traceStore.appendEvent(event as InternalTraceEvent)\n      accepted++\n    } catch (err) {\n      errors.push({\n        eventId: event.eventId,\n        message: err instanceof Error ? err.message : String(err),\n      })\n    }\n  }\n  return { accepted, rejected: errors.length, errors }\n}\n\n/**\n * `POST /v1/feedback` — accept a single `FeedbackTrajectory` from the\n * production runtime. Idempotent on `id`: re-posting the same trajectory\n * replaces the prior record.\n */\nexport async function handleFeedbackIngest(\n  req: WireFeedbackTrajectory,\n  stores: IngestionStores,\n): Promise<FeedbackIngestResponse> {\n  if (!stores.feedbackStore) {\n    throw new WireError(\n      'service_unavailable',\n      'No feedback store configured on this server. Pass `feedbackStore` to `createApp`.',\n      503,\n    )\n  }\n  // The wire `FeedbackTrajectory` aligns 1:1 with the internal type;\n  // cast through `unknown` since the wire schema is a Zod-inferred\n  // structural type with optional fields the internal store consumes.\n  await stores.feedbackStore.save(req as unknown as Parameters<FeedbackTrajectoryStore['save']>[0])\n  return { id: req.id, persisted: true }\n}\n","/**\n * Build an OpenAPI spec from the wire schemas.\n *\n * The spec is the contract that other-language clients (Python, Rust,\n * Go, …) generate from. There is no hand-written client — clients are\n * derived artifacts of this file plus `schemas.ts`.\n *\n * Run `pnpm openapi` (defined in package.json) to write the spec to\n * `dist/openapi.json`. CI uses that file to regenerate the Python\n * client and gate the dual-publish workflow.\n */\nimport { OpenAPIRegistry, OpenApiGeneratorV31 } from '@asteasolutions/zod-to-openapi'\nimport type { OpenAPIObject } from 'openapi3-ts/oas31'\n\nimport {\n  ErrorResponseSchema,\n  FeedbackIngestResponseSchema,\n  FeedbackTrajectorySchema,\n  HealthResponseSchema,\n  JudgeRequestSchema,\n  JudgeResultSchema,\n  ListRubricsResponseSchema,\n  TracesIngestRequestSchema,\n  TracesIngestResponseSchema,\n  VersionResponseSchema,\n  WIRE_VERSION,\n} from './schemas'\n\nexport function buildOpenApi(packageVersion: string): OpenAPIObject {\n  const registry = new OpenAPIRegistry()\n\n  // Components — each schema becomes a $ref-able component\n  registry.register('JudgeRequest', JudgeRequestSchema)\n  registry.register('JudgeResult', JudgeResultSchema)\n  registry.register('ListRubricsResponse', ListRubricsResponseSchema)\n  registry.register('VersionResponse', VersionResponseSchema)\n  registry.register('HealthResponse', HealthResponseSchema)\n  registry.register('ErrorResponse', ErrorResponseSchema)\n  registry.register('TracesIngestRequest', TracesIngestRequestSchema)\n  registry.register('TracesIngestResponse', TracesIngestResponseSchema)\n  registry.register('FeedbackTrajectory', FeedbackTrajectorySchema)\n  registry.register('FeedbackIngestResponse', FeedbackIngestResponseSchema)\n\n  // Routes\n  registry.registerPath({\n    method: 'post',\n    path: '/v1/judge',\n    summary: 'Score a piece of content against a rubric',\n    description:\n      'Runs the judging LLM with the named (or inline) rubric and returns dimension scores, detected failure modes, wins, and a composite score in 0..1.',\n    request: {\n      body: {\n        content: {\n          'application/json': { schema: JudgeRequestSchema },\n        },\n      },\n    },\n    responses: {\n      200: {\n        description: 'Successful judgement',\n        content: { 'application/json': { schema: JudgeResultSchema } },\n      },\n      400: {\n        description: 'Validation error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      404: {\n        description: 'Rubric not found',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      500: {\n        description: 'Judge error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'get',\n    path: '/v1/rubrics',\n    summary: 'List built-in rubrics',\n    description:\n      'Returns every rubric registered server-side, with their dimensions and stable rubricVersion hash.',\n    responses: {\n      200: {\n        description: 'Listing',\n        content: { 'application/json': { schema: ListRubricsResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'get',\n    path: '/v1/version',\n    summary: 'Server and wire-protocol version',\n    description: 'Match your client version to `version`; check `wireVersion` for compatibility.',\n    responses: {\n      200: {\n        description: 'Version info',\n        content: { 'application/json': { schema: VersionResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'get',\n    path: '/healthz',\n    summary: 'Liveness check',\n    responses: {\n      200: {\n        description: 'OK',\n        content: { 'application/json': { schema: HealthResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'post',\n    path: '/v1/traces/ingest',\n    summary: 'Ingest a batch of production TraceEvents',\n    description:\n      'Append a batch of TraceEvents to the configured TraceStore. Accepts application/json ({events:[...]}) or application/x-ndjson (one event per line). Returns counts of accepted + rejected events.',\n    request: {\n      body: {\n        content: {\n          'application/json': { schema: TracesIngestRequestSchema },\n          'application/x-ndjson': { schema: TracesIngestRequestSchema },\n        },\n      },\n    },\n    responses: {\n      200: {\n        description: 'Ingestion summary',\n        content: { 'application/json': { schema: TracesIngestResponseSchema } },\n      },\n      400: {\n        description: 'Validation error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      401: {\n        description: 'Unauthorized (when bearer auth is configured)',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      503: {\n        description: 'No trace store configured',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n    },\n  })\n\n  registry.registerPath({\n    method: 'post',\n    path: '/v1/feedback',\n    summary: 'Ingest a FeedbackTrajectory from production',\n    description:\n      'Persist a single FeedbackTrajectory. Idempotent on trajectory.id — re-posting replaces the prior record. Used by production runtimes to forward user 👍/👎/edits into the eval substrate.',\n    request: {\n      body: {\n        content: {\n          'application/json': { schema: FeedbackTrajectorySchema },\n        },\n      },\n    },\n    responses: {\n      200: {\n        description: 'Persisted',\n        content: { 'application/json': { schema: FeedbackIngestResponseSchema } },\n      },\n      400: {\n        description: 'Validation error',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      401: {\n        description: 'Unauthorized (when bearer auth is configured)',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n      503: {\n        description: 'No feedback store configured',\n        content: { 'application/json': { schema: ErrorResponseSchema } },\n      },\n    },\n  })\n\n  const generator = new OpenApiGeneratorV31(registry.definitions)\n  const doc = generator.generateDocument({\n    openapi: '3.1.0',\n    info: {\n      title: '@tangle-network/agent-eval — wire protocol',\n      version: packageVersion,\n      description: `HTTP and stdio RPC interface to agent-eval. The TypeScript runtime is the source of truth; this spec is the contract that cross-language clients (Python, Rust, Go) generate from.\n\nWire-protocol version: ${WIRE_VERSION}. Bumps on breaking changes to request/response schemas.`,\n      contact: { name: 'Tangle Network', url: 'https://github.com/tangle-network/agent-eval' },\n      license: { name: 'MIT' },\n    },\n    servers: [{ url: 'http://localhost:5005', description: 'Local agent-eval serve' }],\n  })\n  const rubricRef = { $ref: '#/components/schemas/Rubric' } as const\n  const commonJudgeFields = {\n    content: { type: 'string', minLength: 1 },\n    context: { type: 'object', additionalProperties: true },\n    model: { type: 'string' },\n  } as const\n  doc.components ??= {}\n  doc.components.schemas ??= {}\n  doc.components.schemas.JudgeRequest = {\n    oneOf: [\n      {\n        type: 'object',\n        additionalProperties: false,\n        required: ['rubricName', 'content'],\n        properties: {\n          rubricName: { type: 'string', minLength: 1 },\n          ...commonJudgeFields,\n        },\n      },\n      {\n        type: 'object',\n        additionalProperties: false,\n        required: ['rubric', 'content'],\n        properties: {\n          rubric: rubricRef,\n          ...commonJudgeFields,\n        },\n      },\n    ],\n    description: 'Judge request. Provide exactly one of rubricName or rubric.',\n  }\n  return doc\n}\n","/**\n * stdio RPC transport.\n *\n * For batch / cron use without a running server. The Python client falls\n * back to this when no server is reachable.\n *\n * Protocol (line-delimited JSON over stdin/stdout):\n *   IN:  one JSON object on stdin: {\"method\":\"judge\",\"params\":{...}}\n *   OUT: one JSON object on stdout: {\"result\":{...}} or {\"error\":{...}}\n *\n * One request per process invocation. To pipeline many calls, the client\n * writes JSONL to stdin and reads JSONL from stdout — see batch mode below.\n */\nimport type { ChatClient } from '../analyst/chat-client'\nimport { handleJudge, handleListRubrics, handleVersion, WireError } from './handlers'\nimport { JudgeRequestSchema } from './schemas'\n\ninterface RpcRequest {\n  method: 'judge' | 'listRubrics' | 'version'\n  params?: unknown\n}\n\ninterface RpcSuccess {\n  result: unknown\n}\n\ninterface RpcError {\n  error: { code: string; message: string; details?: unknown }\n}\n\nexport interface RpcOptions {\n  /** Caller-owned transport for `/v1/judge`. Without it the method refuses. */\n  chat?: ChatClient\n  judgeModel?: string\n}\n\nexport async function dispatchRpc(\n  req: RpcRequest,\n  options: RpcOptions = {},\n): Promise<RpcSuccess | RpcError> {\n  try {\n    switch (req.method) {\n      case 'judge': {\n        const parsed = JudgeRequestSchema.safeParse(req.params)\n        if (!parsed.success) {\n          return {\n            error: {\n              code: 'validation_error',\n              message: 'params did not match JudgeRequest schema.',\n              details: parsed.error.issues,\n            },\n          }\n        }\n        return {\n          result: await handleJudge(parsed.data, {\n            chat: options.chat,\n            defaultModel: options.judgeModel,\n          }),\n        }\n      }\n      case 'listRubrics':\n        return { result: handleListRubrics() }\n      case 'version':\n        return { result: handleVersion() }\n      default:\n        return {\n          error: {\n            code: 'unknown_method',\n            message: `No such method: ${(req as { method: string }).method}`,\n          },\n        }\n    }\n  } catch (err) {\n    if (err instanceof WireError) {\n      return { error: { code: err.code, message: err.message, details: err.details } }\n    }\n    const message = err instanceof Error ? err.message : String(err)\n    return { error: { code: 'internal_error', message } }\n  }\n}\n\n// ── stdin/stdout driver ─────────────────────────────────────────────\n\nasync function readAll(stream: NodeJS.ReadableStream): Promise<string> {\n  const chunks: Buffer[] = []\n  for await (const chunk of stream) {\n    chunks.push(Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk as string))\n  }\n  return Buffer.concat(chunks).toString('utf-8')\n}\n\n/** Read one JSON request from stdin, write one JSON response to stdout. */\nexport async function runRpcOnce(method?: string, options: RpcOptions = {}): Promise<number> {\n  const raw = await readAll(process.stdin)\n  let req: RpcRequest\n  try {\n    const body = JSON.parse(raw)\n    req = method ? { method: method as RpcRequest['method'], params: body } : (body as RpcRequest)\n  } catch (err) {\n    process.stdout.write(\n      `${JSON.stringify({\n        error: {\n          code: 'parse_error',\n          message: `stdin was not valid JSON: ${err instanceof Error ? err.message : String(err)}`,\n        },\n      })}\\n`,\n    )\n    return 1\n  }\n  const out = await dispatchRpc(req, options)\n  process.stdout.write(`${JSON.stringify(out)}\\n`)\n  return 'error' in out ? 1 : 0\n}\n\n/** Read JSONL requests from stdin, write JSONL responses to stdout. */\nexport async function runRpcBatch(method?: string, options: RpcOptions = {}): Promise<number> {\n  const raw = await readAll(process.stdin)\n  const lines = raw.split('\\n').filter((l) => l.trim().length > 0)\n  let exitCode = 0\n  for (const line of lines) {\n    let req: RpcRequest\n    try {\n      const body = JSON.parse(line)\n      req = method ? { method: method as RpcRequest['method'], params: body } : (body as RpcRequest)\n    } catch (err) {\n      process.stdout.write(\n        `${JSON.stringify({\n          error: {\n            code: 'parse_error',\n            message: `line was not valid JSON: ${err instanceof Error ? err.message : String(err)}`,\n          },\n        })}\\n`,\n      )\n      exitCode = 1\n      continue\n    }\n    const out = await dispatchRpc(req, options)\n    process.stdout.write(`${JSON.stringify(out)}\\n`)\n    if ('error' in out) exitCode = 1\n  }\n  return exitCode\n}\n","/**\n * HTTP transport for the wire protocol.\n *\n * Hono + @hono/node-server. Every endpoint:\n *   1. Validates the request against its Zod schema.\n *   2. Calls the matching handler in `handlers.ts`.\n *   3. Renders 4xx for `WireError` with structured body, 500 for unexpected.\n *\n * The server holds optional `IngestionStores` (passed to `createApp`)\n * to receive production traces and user feedback. With no stores wired,\n * the ingestion endpoints return 503 — read endpoints (`/v1/judge`,\n * `/v1/rubrics`, `/v1/version`) remain fully functional.\n *\n * Run via `agent-eval serve --port 5005`.\n */\nimport { type ServerType, serve } from '@hono/node-server'\nimport { Hono } from 'hono'\nimport { cors } from 'hono/cors'\nimport type { ChatClient } from '../analyst/chat-client'\nimport {\n  handleFeedbackIngest,\n  handleJudge,\n  handleListRubrics,\n  handleTracesIngest,\n  handleVersion,\n  type IngestionStores,\n  WireError,\n} from './handlers'\nimport { buildOpenApi } from './openapi'\nimport { FeedbackTrajectorySchema, JudgeRequestSchema, TracesIngestRequestSchema } from './schemas'\n\nconst STARTED_AT = Date.now()\n\nexport interface CreateAppOptions {\n  /** Stores wired to the ingestion endpoints. */\n  stores?: IngestionStores\n  /**\n   * Caller-owned transport used by `/v1/judge`. agent-eval holds no provider\n   * credential; without a client the endpoint refuses with\n   * `llm_not_configured`.\n   */\n  chat?: ChatClient\n  /** Default judge model when a request does not provide one. */\n  judgeModel?: string\n  /**\n   * Bearer-token auth. When provided, every endpoint EXCEPT `/healthz`\n   * and `/v1/version` requires `Authorization: Bearer <token>`. The\n   * token may be a static string OR a function for time-bounded /\n   * rotating tokens.\n   *\n   * Recommended for any server that accepts ingestion writes from the\n   * public internet. Read-only deployments may omit it.\n   */\n  auth?: {\n    bearer: string | ((token: string) => boolean | Promise<boolean>)\n  }\n}\n\nconst AUTH_EXEMPT_PATHS = new Set(['/healthz', '/v1/version', '/openapi.json'])\n\nexport function createApp(opts: CreateAppOptions = {}) {\n  const app = new Hono()\n\n  app.use('*', cors())\n\n  // Bearer-token middleware (only attached when configured).\n  if (opts.auth) {\n    const verify = opts.auth.bearer\n    app.use('*', async (c, next) => {\n      const path = new URL(c.req.url).pathname\n      if (AUTH_EXEMPT_PATHS.has(path)) return next()\n      const raw = c.req.header('authorization') ?? ''\n      const match = raw.match(/^Bearer\\s+(.+)$/i)\n      if (!match) {\n        throw new WireError('unauthorized', 'Missing or malformed Authorization header.', 401)\n      }\n      const token = match[1] as string\n      const ok = typeof verify === 'string' ? token === verify : await verify(token)\n      if (!ok) {\n        throw new WireError('unauthorized', 'Invalid bearer token.', 401)\n      }\n      return next()\n    })\n  }\n\n  app.onError((err, c) => {\n    if (err instanceof WireError) {\n      const status = err.status as 400 | 401 | 404 | 422 | 500 | 503\n      return c.json(\n        { error: { code: err.code, message: err.message, details: err.details } },\n        status,\n      )\n    }\n    // Unexpected — log and return generic 500 without leaking internals.\n    console.error('[agent-eval] unhandled error:', err)\n    return c.json({ error: { code: 'internal_error', message: 'Internal server error.' } }, 500)\n  })\n\n  // ── Health ──\n  app.get('/healthz', (c) =>\n    c.json({ status: 'ok' as const, uptimeSec: (Date.now() - STARTED_AT) / 1000 }),\n  )\n\n  // ── Version ──\n  app.get('/v1/version', (c) => c.json(handleVersion()))\n\n  // ── Rubrics ──\n  app.get('/v1/rubrics', (c) => c.json(handleListRubrics()))\n\n  // ── Judge ──\n  app.post('/v1/judge', async (c) => {\n    const raw = await c.req.json().catch(() => null)\n    if (raw == null) {\n      throw new WireError('validation_error', 'Request body must be JSON.', 400)\n    }\n    const parsed = JudgeRequestSchema.safeParse(raw)\n    if (!parsed.success) {\n      throw new WireError(\n        'validation_error',\n        'Request did not match JudgeRequest schema.',\n        400,\n        parsed.error.issues,\n      )\n    }\n    const result = await handleJudge(parsed.data, {\n      chat: opts.chat,\n      defaultModel: opts.judgeModel,\n    })\n    return c.json(result)\n  })\n\n  // ── Traces ingest (NDJSON-friendly: accepts either {events:[...]} or NDJSON) ──\n  app.post('/v1/traces/ingest', async (c) => {\n    const contentType = c.req.header('content-type') ?? ''\n    let payload: unknown\n    if (contentType.includes('application/x-ndjson')) {\n      const text = await c.req.text()\n      const events = text\n        .split('\\n')\n        .map((line) => line.trim())\n        .filter((line) => line.length > 0)\n        .map((line) => {\n          try {\n            return JSON.parse(line)\n          } catch {\n            throw new WireError(\n              'validation_error',\n              'NDJSON line did not parse as JSON.',\n              400,\n              line.slice(0, 200),\n            )\n          }\n        })\n      payload = { events }\n    } else {\n      payload = await c.req.json().catch(() => null)\n    }\n    if (payload == null) {\n      throw new WireError('validation_error', 'Request body must be JSON or NDJSON.', 400)\n    }\n    const parsed = TracesIngestRequestSchema.safeParse(payload)\n    if (!parsed.success) {\n      throw new WireError(\n        'validation_error',\n        'Request did not match TracesIngestRequest schema.',\n        400,\n        parsed.error.issues,\n      )\n    }\n    const result = await handleTracesIngest(parsed.data, opts.stores ?? {})\n    return c.json(result)\n  })\n\n  // ── Feedback ingest ──\n  app.post('/v1/feedback', async (c) => {\n    const raw = await c.req.json().catch(() => null)\n    if (raw == null) {\n      throw new WireError('validation_error', 'Request body must be JSON.', 400)\n    }\n    const parsed = FeedbackTrajectorySchema.safeParse(raw)\n    if (!parsed.success) {\n      throw new WireError(\n        'validation_error',\n        'Request did not match FeedbackTrajectory schema.',\n        400,\n        parsed.error.issues,\n      )\n    }\n    const result = await handleFeedbackIngest(parsed.data, opts.stores ?? {})\n    return c.json(result)\n  })\n\n  // ── OpenAPI spec ──\n  app.get('/openapi.json', (c) => c.json(buildOpenApi(handleVersion().version)))\n\n  return app\n}\n\nexport interface ServeOptions extends CreateAppOptions {\n  /** Default 5005. */\n  port?: number\n  /** Default '127.0.0.1'. Set to '0.0.0.0' to listen on all interfaces. */\n  host?: string\n}\n\nexport function startServer(opts: ServeOptions = {}): ServerType {\n  const app = createApp(opts)\n  const port = opts.port ?? 5005\n  const host = opts.host ?? '127.0.0.1'\n  return serve({ fetch: app.fetch, port, hostname: host }, ({ address, port: actualPort }) => {\n    // eslint-disable-next-line no-console\n    console.log(`[agent-eval] serving on http://${address}:${actualPort}`)\n  })\n}\n\nexport interface StartedServer {\n  server: ServerType\n  /** The OS-assigned port. When opts.port was 0, this is the actual port the\n   *  kernel bound — callers that need to dial back (smoke tests, sidecars\n   *  registering with a parent) read this rather than guessing a free port. */\n  port: number\n  /** Resolved host the server bound to (defaults to 127.0.0.1). */\n  host: string\n  /** Close the server. Resolves once active connections have drained. */\n  close(): Promise<void>\n}\n\n/**\n * Promise-returning variant of `startServer` that resolves once the server is\n * listening and surfaces the resolved bound port. Use this from smoke tests\n * (`startServerAsync({ port: 0 })`) and any caller that needs to dial back.\n */\nexport function startServerAsync(opts: ServeOptions = {}): Promise<StartedServer> {\n  const app = createApp(opts)\n  const port = opts.port ?? 5005\n  const host = opts.host ?? '127.0.0.1'\n  return new Promise((resolve, reject) => {\n    let settled = false\n    let server: ServerType | undefined\n    server = serve({ fetch: app.fetch, port, hostname: host }, ({ address, port: actualPort }) => {\n      if (settled) return\n      settled = true\n      // eslint-disable-next-line no-console\n      console.log(`[agent-eval] serving on http://${address}:${actualPort}`)\n      resolve({\n        server: server!,\n        port: actualPort,\n        host: address,\n        close: () =>\n          new Promise<void>((res, rej) => {\n            server!.close((err) => (err ? rej(err) : res()))\n          }),\n      })\n    })\n    server.on('error', (err) => {\n      if (settled) return\n      settled = true\n      reject(err)\n    })\n  })\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAgBA,qBAAqB,CAAC;AAItB,MAAa,wBAAwB,EAClC,OAAO;CACN,IAAI,EACD,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,6EAA2E;CACvF,aAAa,EACV,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,sEAAsE;CAClF,QAAQ,EACL,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,QAAQ,CAAC,CAAC,CACV,SAAS,gEAAgE;CAC5E,KAAK,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,gDAAgD;CACpF,KAAK,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,gDAAgD;AACtF,CAAC,CAAC,CACD,QAAQ,iBAAiB;AAE5B,MAAM,oBAAoB,EACvB,OAAO;CACN,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,gEAA8D;CAC7F,aAAa,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,mDAAmD;AAC7F,CAAC,CAAC,CACD,QAAQ,aAAa;AAIxB,MAAa,eAAe,EACzB,OAAO;CACN,MAAM,EACH,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,yEAAuE;CACnF,aAAa,EACV,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,0DAA0D;CACtE,cAAc,EACX,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SACC,yIACF;CACF,YAAY,EACT,MAAM,qBAAqB,CAAC,CAC5B,IAAI,CAAC,CAAC,CACN,SAAS,+DAA+D;CAC3E,cAAc,EACX,MAAM,iBAAiB,CAAC,CACxB,QAAQ,CAAC,CAAC,CAAC,CACX,SAAS,iFAAiF;CAC7F,MAAM,EACH,MAAM,iBAAiB,CAAC,CACxB,QAAQ,CAAC,CAAC,CAAC,CACX,SAAS,uEAAuE;AACrF,CAAC,CAAC,CACD,QAAQ,QAAQ;AAInB,MAAa,qBAAqB,EAC/B,OAAO;CACN,YAAY,EACT,OAAO,CAAC,CACR,SAAS,CAAC,CACV,SAAS,kEAAkE;CAC9E,QAAQ,aAAa,SAAS,CAAC,CAAC,SAC9B,iEACF;CACA,SAAS,EACN,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,SAAS,kFAAkF;CAC9F,SAAS,EACN,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAC/B,SAAS,CAAC,CACV,SACC,qGACF;CACF,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,oDAAoD;AAC5F,CAAC,CAAC,CACD,QAAQ,MAAM,QAAQ,EAAE,UAAU,MAAM,QAAQ,EAAE,MAAM,GAAG,EAC1D,SAAS,mDACX,CAAC,CAAC,CACD,QAAQ,cAAc;AAEzB,MAAa,oBAAoB,EAC9B,OAAO;CACN,WAAW,EACR,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,IAAI,CAAC,CAAC,CACN,SAAS,iFAAiF;CAC7F,YAAY,EACT,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAC9B,SAAS,mDAAmD;CAC/D,cAAc,EACX,MAAM,EAAE,OAAO,CAAC,CAAC,CACjB,QAAQ,CAAC,CAAC,CAAC,CACX,SAAS,+EAA+E;CAC3F,MAAM,EACH,MAAM,EAAE,OAAO,CAAC,CAAC,CACjB,QAAQ,CAAC,CAAC,CAAC,CACX,SAAS,8DAA8D;CAC1E,WAAW,EACR,OAAO,CAAC,CACR,SAAS,yEAAyE;CACrF,eAAe,EACZ,OAAO,CAAC,CACR,SACC,yIACF;CACF,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS,yDAAyD;CACpF,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,SAAS,qCAAqC;AAC3F,CAAC,CAAC,CACD,QAAQ,aAAa;AAIxB,MAAM,mBAAmB,EACtB,OAAO;CACN,MAAM,EAAE,OAAO,CAAC,CAAC,SAAS,yCAAyC;CACnE,aAAa,EAAE,OAAO,CAAC,CAAC,SAAS,4BAA4B;CAC7D,YAAY,EACT,MAAM,EAAE,OAAO;EAAE,IAAI,EAAE,OAAO;EAAG,aAAa,EAAE,OAAO;EAAG,QAAQ,EAAE,OAAO;CAAE,CAAC,CAAC,CAAC,CAChF,SAAS,kDAAkD;CAC9D,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,uCAAuC;CAC9F,eAAe,EACZ,OAAO,CAAC,CACR,SACC,+FACF;AACJ,CAAC,CAAC,CACD,QAAQ,YAAY;AAEvB,MAAa,4BAA4B,EACtC,OAAO,EACN,SAAS,EAAE,MAAM,gBAAgB,EACnC,CAAC,CAAC,CACD,QAAQ,qBAAqB;AAIhC,MAAa,wBAAwB,EAClC,OAAO;CACN,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,uDAAqD;CAClF,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,0DAA0D;CACvF,aAAa,EACV,OAAO,CAAC,CACR,SACC,sFACF;CACF,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,iCAAiC;AAC5E,CAAC,CAAC,CACD,QAAQ,iBAAiB;AAE5B,MAAa,uBAAuB,EACjC,OAAO;CACN,QAAQ,EAAE,QAAQ,IAAI;CACtB,WAAW,EAAE,OAAO;AACtB,CAAC,CAAC,CACD,QAAQ,gBAAgB;;;;;;;AAU3B,MAAa,mBAAmB,EAC7B,OAAO;CACN,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,4CAA4C;CAChF,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,4BAA4B;CAC9D,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,sCAAsC;CAC7E,MAAM,EACH,KAAK;EACJ;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC,CAAC,CACD,SAAS,oEAAoE;CAChF,WAAW,EACR,OAAO,CAAC,CACR,IAAI,CAAC,CACL,YAAY,CAAC,CACb,SAAS,kEAAkE;CAC9E,SAAS,EACN,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAC/B,SAAS,iDAAiD;AAC/D,CAAC,CAAC,CACD,QAAQ,YAAY;AAEvB,MAAa,4BAA4B,EACtC,OAAO,EACN,QAAQ,EACL,MAAM,gBAAgB,CAAC,CACvB,IAAI,CAAC,CAAC,CACN,IAAI,GAAM,CAAC,CACX,SAAS,uEAAuE,EACrF,CAAC,CAAC,CACD,QAAQ,qBAAqB;AAEhC,MAAa,6BAA6B,EACvC,OAAO;CACN,UAAU,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,SAAS,6BAA6B;CAC/E,UAAU,EACP,OAAO,CAAC,CACR,IAAI,CAAC,CACL,YAAY,CAAC,CACb,SAAS,kEAAkE;CAC9E,QAAQ,EACL,MACC,EAAE,OAAO;EACP,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,iCAAiC;EAC9D,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,6BAA6B;CAC5D,CAAC,CACH,CAAC,CACA,QAAQ,CAAC,CAAC;AACf,CAAC,CAAC,CACD,QAAQ,sBAAsB;AAEjC,MAAM,sBAAsB,EACzB,OAAO;CACN,IAAI,EAAE,OAAO,CAAC,CAAC,SAAS;CACxB,QAAQ,EAAE,KAAK;EAAC;EAAQ;EAAS;EAAe;EAAU;EAAU;CAAQ,CAAC;CAC7E,MAAM,EAAE,KAAK;EACX;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,OAAO,EAAE,QAAQ;CACjB,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;CAC5B,UAAU,EAAE,KAAK;EAAC;EAAQ;EAAW;EAAS;CAAU,CAAC,CAAC,CAAC,SAAS;CACpE,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS,eAAe;CAC9C,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS;AACvD,CAAC,CAAC,CACD,QAAQ,eAAe;AAE1B,MAAM,wBAAwB,EAC3B,OAAO;CACN,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACpB,WAAW,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY;CACxC,cAAc,EAAE,KAAK;EACnB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CACD,UAAU,EAAE,QAAQ;CACpB,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS;CACvC,gBAAgB,EACb,OAAO;EACN,MAAM,EAAE,OAAO;EACf,MAAM,EAAE,KAAK;GAAC;GAAO;GAAU;EAAM,CAAC,CAAC,CAAC,SAAS;EACjD,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS;EAC7B,oBAAoB,EAAE,QAAQ,CAAC,CAAC,SAAS;EACzC,kBAAkB,EAAE,QAAQ,CAAC,CAAC,SAAS;EACvC,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS;CACvD,CAAC,CAAC,CACD,SAAS;CACZ,UAAU,EAAE,MAAM,mBAAmB,CAAC,CAAC,SAAS;CAChD,WAAW,EAAE,OAAO;CACpB,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS;AACvD,CAAC,CAAC,CACD,QAAQ,iBAAiB;AAE5B,MAAa,2BAA2B,EACrC,OAAO;CACN,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,gDAAgD;CAC/E,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;CAChC,MAAM,EAAE,OAAO;EACb,QAAQ,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACxB,SAAS,EAAE,QAAQ,CAAC,CAAC,SAAS;CAChC,CAAC;CACD,UAAU,EAAE,MAAM,qBAAqB,CAAC,CAAC,QAAQ,CAAC,CAAC;CACnD,QAAQ,EAAE,MAAM,mBAAmB,CAAC,CAAC,QAAQ,CAAC,CAAC;CAC/C,SAAS,EACN,OAAO;EACN,SAAS,EAAE,QAAQ,CAAC,CAAC,SAAS;EAC9B,OAAO,EAAE,OAAO,CAAC,CAAC,SAAS;EAC3B,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;EACnD,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS;EAC7B,QAAQ,EAAE,OAAO,CAAC,CAAC,SAAS;EAC5B,YAAY,EAAE,OAAO,CAAC,CAAC,SAAS;EAChC,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS;CACvD,CAAC,CAAC,CACD,SAAS;CACZ,OAAO,EAAE,KAAK;EAAC;EAAS;EAAO;EAAQ;CAAS,CAAC,CAAC,CAAC,SAAS;CAC5D,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS;CAChD,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS,eAAe;CAC9C,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS;AACvD,CAAC,CAAC,CACD,QAAQ,oBAAoB;AAE/B,MAAa,+BAA+B,EACzC,OAAO;CACN,IAAI,EAAE,OAAO,CAAC,CAAC,SAAS,mCAAmC;CAC3D,WAAW,EAAE,QAAQ,CAAC,CAAC,SAAS,wDAAwD;AAC1F,CAAC,CAAC,CACD,QAAQ,wBAAwB;AAUnC,MAAa,sBAAsB,EAChC,OAAO,EACN,OAAO,EACJ,OAAO;CACN,MAAM,EACH,OAAO,CAAC,CACR,SACC,qFACF;CACF,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS,yBAAyB;CACtD,SAAS,EAAE,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,6BAA6B;AACxE,CAAC,CAAC,CACD,SAAS,+DAA+D,EAC7E,CAAC,CAAC,CACD,QAAQ,eAAe;;;;;;;AAsB1B,MAAa,eAAe;;;;;;;;AAS5B,MAAa,wBAAwB;;;;;;;;;;AAWrC,SAAgB,WAAW,QAAwB;CACjD,OAAO,GAAG,OAAO,KAAK,GAAG,sBAAsB,GAAG,cAAc,MAAM,CAAC,CAAC,MAAM,CAAgB;AAChG;;;AC7TA,MAAM,kBAA0C,EAC9C,aAAa;CArEb,MAAM;CACN,aACE;CACF,cAAc;;;;;;;;;;;;;;;;;;;;;;;CAuBd,YAAY;EACV;GACE,IAAI;GACJ,aAAa;GACb,QAAQ;GACR,KAAK;GACL,KAAK;EACP;EACA;GACE,IAAI;GACJ,aAAa;GACb,QAAQ;GACR,KAAK;GACL,KAAK;EACP;EACA;GACE,IAAI;GACJ,aAAa;GACb,QAAQ;GACR,KAAK;GACL,KAAK;EACP;CACF;CACA,cAAc;EACZ;GAAE,IAAI;GAAc,aAAa;EAAqC;EACtE;GAAE,IAAI;GAAkB,aAAa;EAAsC;EAC3E;GAAE,IAAI;GAAe,aAAa;EAAoC;EACtE;GAAE,IAAI;GAAW,aAAa;EAAkC;EAChE;GAAE,IAAI;GAAmB,aAAa;EAAqC;EAC3E;GAAE,IAAI;GAAW,aAAa;EAAoC;EAClE;GAAE,IAAI;GAAe,aAAa;EAAuC;CAC3E;CACA,MAAM;EACJ;GAAE,IAAI;GAAsB,aAAa;EAAqC;EAC9E;GAAE,IAAI;GAAiB,aAAa;EAA4B;EAChE;GAAE,IAAI;GAA0B,aAAa;EAAwB;EACrE;GAAE,IAAI;GAAkB,aAAa;EAAoC;CAC3E;AAMqB,EACvB;;AAGA,SAAgB,iBAAiB,MAAkC;CACjE,OAAO,gBAAgB;AACzB;;AAGA,SAAgB,qBAAqB;CACnC,OAAO,OAAO,OAAO,eAAe,CAAC,CAAC,KAAK,OAAO;EAChD,MAAM,EAAE;EACR,aAAa,EAAE;EACf,YAAY,EAAE,WAAW,KAAK,OAAO;GACnC,IAAI,EAAE;GACN,aAAa,EAAE;GACf,QAAQ,EAAE;EACZ,EAAE;EACF,cAAc,EAAE,aAAa,KAAK,MAAM,EAAE,EAAE;EAC5C,eAAe,WAAW,CAAC;CAC7B,EAAE;AACJ;;;;AC/EA,IAAa,YAAb,cAA+B,MAAM;CAEjB;CAEA;CACA;CAJlB,YACE,MACA,SACA,SAAiC,KACjC,SACA;EACA,MAAM,OAAO;EALG,KAAA,OAAA;EAEA,KAAA,SAAA;EACA,KAAA,UAAA;EAGhB,KAAK,OAAO;CACd;AACF;;AAKA,SAAS,kBAAkB,QAAgB;CACzC,OAAO;EACL,MAAM;EACN,QAAQ;GACN,MAAM;GACN,sBAAsB;GACtB,YAAY;IACV,YAAY;KACV,MAAM;KACN,sBAAsB;KACtB,YAAY,OAAO,YACjB,OAAO,WAAW,KAAK,MAAM,CAC3B,EAAE,IACF;MAAE,MAAM;MAAU,SAAS,EAAE;MAAK,SAAS,EAAE;KAAI,CACnD,CAAC,CACH;KACA,UAAU,OAAO,WAAW,KAAK,MAAM,EAAE,EAAE;IAC7C;IACA,cAAc;KACZ,MAAM;KACN,OAAO;MAAE,MAAM;MAAU,MAAM,OAAO,aAAa,KAAK,MAAM,EAAE,EAAE;KAAE;IACtE;IACA,MAAM;KACJ,MAAM;KACN,OAAO;MAAE,MAAM;MAAU,MAAM,OAAO,KAAK,KAAK,MAAM,EAAE,EAAE;KAAE;IAC9D;IACA,WAAW,EAAE,MAAM,SAAS;GAC9B;GACA,UAAU,CAAC,cAAc,WAAW;EACtC;CACF;AACF;AASA,SAAS,oBAAoB,OAAgB,QAA6B;CACxE,IAAI,CAAC,SAAS,OAAO,UAAU,UAC7B,MAAM,IAAI,UAAU,eAAe,oCAAoC,KAAK,KAAK;CAEnF,MAAM,MAAM;CACZ,MAAM,gBAAgB,IAAI;CAC1B,IAAI,CAAC,iBAAiB,OAAO,kBAAkB,YAAY,MAAM,QAAQ,aAAa,GACpF,MAAM,IAAI,UAAU,eAAe,wCAAwC,KAAK,KAAK;CAGvF,MAAM,aAAqC,CAAC;CAC5C,MAAM,kBAAkB;CACxB,KAAK,MAAM,OAAO,OAAO,YAAY;EACnC,MAAM,QAAQ,gBAAgB,IAAI;EAClC,IACE,OAAO,UAAU,YACjB,CAAC,OAAO,SAAS,KAAK,KACtB,QAAQ,IAAI,OACZ,QAAQ,IAAI,KAEZ,MAAM,IAAI,UACR,eACA,+CAA+C,IAAI,GAAG,KACtD,KACA,KACF;EAEF,WAAW,IAAI,MAAM;CACvB;CAEA,MAAM,kBAAkB,IAAI,IAAI,OAAO,aAAa,KAAK,SAAS,KAAK,EAAE,CAAC;CAC1E,MAAM,cAAc,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,EAAE,CAAC;CAC5D,MAAM,eAAe,gBAAgB,IAAI,cAAc,iBAAiB,gBAAgB,KAAK;CAC7F,MAAM,OAAO,gBAAgB,IAAI,MAAM,aAAa,QAAQ,KAAK;CACjE,IAAI,OAAO,IAAI,cAAc,YAAY,IAAI,UAAU,KAAK,CAAC,CAAC,WAAW,GACvE,MAAM,IAAI,UAAU,eAAe,qCAAqC,KAAK,KAAK;CAGpF,OAAO;EAAE;EAAY;EAAc;EAAM,WAAW,IAAI;CAAU;AACpE;AAEA,SAAS,gBACP,KACA,SACA,OACA,UACU;CACV,IAAI,QAAQ,KAAA,GAAW,OAAO,CAAC;CAC/B,IAAI,CAAC,MAAM,QAAQ,GAAG,GACpB,MAAM,IAAI,UAAU,eAAe,4BAA4B,MAAM,IAAI,KAAK,QAAQ;CAExF,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,QAAQ,KAAK;EACtB,IAAI,OAAO,SAAS,YAAY,CAAC,QAAQ,IAAI,IAAI,GAC/C,MAAM,IAAI,UACR,eACA,0BAA0B,MAAM,OAAO,OAAO,IAAI,EAAE,KACpD,KACA,QACF;EAEF,IAAI,KAAK,IAAI;CACf;CACA,OAAO;AACT;AAEA,SAAS,eAAe,YAAoC,QAAwB;CAClF,IAAI,WAAW;CACf,IAAI,cAAc;CAClB,KAAK,MAAM,OAAO,OAAO,YAAY;EACnC,MAAM,MAAM,WAAW,IAAI,OAAO;EAClC,MAAM,QAAQ,IAAI,MAAM,IAAI,OAAO;EACnC,MAAM,aAAa,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK,CAAC;EACnE,YAAY,aAAa,IAAI;EAC7B,eAAe,IAAI;CACrB;CACA,OAAO,cAAc,IAAI,WAAW,cAAc;AACpD;AAEA,SAAS,iBAAiB,SAAiB,SAA0B;CACnE,MAAM,MAAM,WAAW,OAAO,KAAK,OAAiB,CAAC,CAAC,SAAS,KAAK,UAAU,OAAO,IAAI;CACzF,OAAO;EACL;EACA;EACA;EACA,MAAM,yCAAyC;EAC/C,MAAM,MAAM;CACd,CAAC,CACE,OAAO,OAAO,CAAC,CACf,KAAK,IAAI;AACd;AAEA,MAAM,sBAAsB;AAiB5B,eAAsB,YACpB,KACA,UAA8B,CAAC,GACT;CAEtB,IAAI;CACJ,IAAI,IAAI,YAAY;EAClB,MAAM,QAAQ,iBAAiB,IAAI,UAAU;EAC7C,IAAI,CAAC,OACH,MAAM,IAAI,UAAU,oBAAoB,6BAA6B,IAAI,WAAW,KAAK,GAAG;EAE9F,SAAS;CACX,OAAO,IAAI,IAAI,QACb,SAAS,IAAI;MAGb,MAAM,IAAI,UAAU,oBAAoB,4CAA4C,GAAG;CAGzF,IAAI,CAAC,QAAQ,MACX,MAAM,IAAI,UACR,sBACA,6GACA,GACF;CAGF,MAAM,YAAY,KAAK,IAAI;CAI3B,MAAM,UAAU;EACd,OAHA,IAAI,SAAS,QAAQ,gBAAgB,QAAQ,KAAK,gBAAgB;EAIlE,UAAU,CACR;GAAE,MAAM;GAAU,SAAS,OAAO;EAAa,GAC/C;GAAE,MAAM;GAAQ,SAAS,iBAAiB,IAAI,SAAS,IAAI,OAAO;EAAE,CACtE;EACA,YAAY,kBAAkB,MAAM;EACpC,aAAa;EACb,WAAW;EACX,WAAW;CACb;CACA,MAAM,OAAO,MAAM,aAA0B;EAC3C,MAAM,QAAQ;EACd;EACA,QAAQ,QAAQ,cAAc,IAAI,WAAW;EAC7C,SAAS;EACT,OAAO,QAAQ,aAAa;EAC5B,OAAO,QAAQ,IAAI,cAAc;EACjC,GAAI,QAAQ,SAAS,EAAE,QAAQ,QAAQ,OAAO,IAAI,CAAC;EACnD,GAAI,QAAQ,UAAU,EAAE,SAAS,QAAQ,QAAQ,IAAI,CAAC;CACxD,CAAC;CACD,IAAI,CAAC,KAAK,WAAW,MAAM,KAAK;CAChC,MAAM,EAAE,OAAO,aAAa;CAE5B,MAAM,SAAS,oBAAoB,OAAO,MAAM;CAEhD,MAAM,YAAY,eAAe,OAAO,YAAY,MAAM;CAC1D,MAAM,aAAa,KAAK,IAAI,IAAI;CAEhC,OAAO;EACL;EACA,YAAY,OAAO;EACnB,cAAc,OAAO,gBAAgB,CAAC;EACtC,MAAM,OAAO,QAAQ,CAAC;EACtB,WAAW,OAAO;EAClB,eAAe,WAAW,MAAM;EAChC,OAAO,SAAS;EAChB;CACF;AACF;AAIA,SAAgB,oBAAyC;CACvD,OAAO,EAAE,SAAS,mBAAmB,EAAE;AACzC;AAIA,SAAgB,gBAAiC;CAC/C,OAAO;EACL,SAAS;EACT,SAAS,eAAe;EACxB,aAAa;EACb,YAAY;GAAC;GAAS;GAAe;GAAW;GAAmB;EAAe;CACpF;AACF;;;;;;;;;;;AA2BA,eAAsB,mBACpB,KACA,QAC+B;CAC/B,IAAI,CAAC,OAAO,YACV,MAAM,IAAI,UACR,uBACA,+EACA,GACF;CAEF,MAAM,SAAsD,CAAC;CAC7D,IAAI,WAAW;CACf,KAAK,MAAM,SAAS,IAAI,QACtB,IAAI;EAEF,MAAM,OAAO,WAAW,YAAY,KAA2B;EAC/D;CACF,SAAS,KAAK;EACZ,OAAO,KAAK;GACV,SAAS,MAAM;GACf,SAAS,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EAC1D,CAAC;CACH;CAEF,OAAO;EAAE;EAAU,UAAU,OAAO;EAAQ;CAAO;AACrD;;;;;;AAOA,eAAsB,qBACpB,KACA,QACiC;CACjC,IAAI,CAAC,OAAO,eACV,MAAM,IAAI,UACR,uBACA,qFACA,GACF;CAKF,MAAM,OAAO,cAAc,KAAK,GAAgE;CAChG,OAAO;EAAE,IAAI,IAAI;EAAI,WAAW;CAAK;AACvC;;;;;;;;;;;;;;AC/UA,SAAgB,aAAa,gBAAuC;CAClE,MAAM,WAAW,IAAI,gBAAgB;CAGrC,SAAS,SAAS,gBAAgB,kBAAkB;CACpD,SAAS,SAAS,eAAe,iBAAiB;CAClD,SAAS,SAAS,uBAAuB,yBAAyB;CAClE,SAAS,SAAS,mBAAmB,qBAAqB;CAC1D,SAAS,SAAS,kBAAkB,oBAAoB;CACxD,SAAS,SAAS,iBAAiB,mBAAmB;CACtD,SAAS,SAAS,uBAAuB,yBAAyB;CAClE,SAAS,SAAS,wBAAwB,0BAA0B;CACpE,SAAS,SAAS,sBAAsB,wBAAwB;CAChE,SAAS,SAAS,0BAA0B,4BAA4B;CAGxE,SAAS,aAAa;EACpB,QAAQ;EACR,MAAM;EACN,SAAS;EACT,aACE;EACF,SAAS,EACP,MAAM,EACJ,SAAS,EACP,oBAAoB,EAAE,QAAQ,mBAAmB,EACnD,EACF,EACF;EACA,WAAW;GACT,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,kBAAkB,EAAE;GAC/D;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;EACF;CACF,CAAC;CAED,SAAS,aAAa;EACpB,QAAQ;EACR,MAAM;EACN,SAAS;EACT,aACE;EACF,WAAW,EACT,KAAK;GACH,aAAa;GACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,0BAA0B,EAAE;EACvE,EACF;CACF,CAAC;CAED,SAAS,aAAa;EACpB,QAAQ;EACR,MAAM;EACN,SAAS;EACT,aAAa;EACb,WAAW,EACT,KAAK;GACH,aAAa;GACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,sBAAsB,EAAE;EACnE,EACF;CACF,CAAC;CAED,SAAS,aAAa;EACpB,QAAQ;EACR,MAAM;EACN,SAAS;EACT,WAAW,EACT,KAAK;GACH,aAAa;GACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,qBAAqB,EAAE;EAClE,EACF;CACF,CAAC;CAED,SAAS,aAAa;EACpB,QAAQ;EACR,MAAM;EACN,SAAS;EACT,aACE;EACF,SAAS,EACP,MAAM,EACJ,SAAS;GACP,oBAAoB,EAAE,QAAQ,0BAA0B;GACxD,wBAAwB,EAAE,QAAQ,0BAA0B;EAC9D,EACF,EACF;EACA,WAAW;GACT,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,2BAA2B,EAAE;GACxE;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;EACF;CACF,CAAC;CAED,SAAS,aAAa;EACpB,QAAQ;EACR,MAAM;EACN,SAAS;EACT,aACE;EACF,SAAS,EACP,MAAM,EACJ,SAAS,EACP,oBAAoB,EAAE,QAAQ,yBAAyB,EACzD,EACF,EACF;EACA,WAAW;GACT,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,6BAA6B,EAAE;GAC1E;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;GACA,KAAK;IACH,aAAa;IACb,SAAS,EAAE,oBAAoB,EAAE,QAAQ,oBAAoB,EAAE;GACjE;EACF;CACF,CAAC;CAGD,MAAM,MAAM,IADU,oBAAoB,SAAS,WAC/B,CAAC,CAAC,iBAAiB;EACrC,SAAS;EACT,MAAM;GACJ,OAAO;GACP,SAAS;GACT,aAAa;;yBAEM,aAAa;GAChC,SAAS;IAAE,MAAM;IAAkB,KAAK;GAA+C;GACvF,SAAS,EAAE,MAAM,MAAM;EACzB;EACA,SAAS,CAAC;GAAE,KAAK;GAAyB,aAAa;EAAyB,CAAC;CACnF,CAAC;CACD,MAAM,YAAY,EAAE,MAAM,8BAA8B;CACxD,MAAM,oBAAoB;EACxB,SAAS;GAAE,MAAM;GAAU,WAAW;EAAE;EACxC,SAAS;GAAE,MAAM;GAAU,sBAAsB;EAAK;EACtD,OAAO,EAAE,MAAM,SAAS;CAC1B;CACA,IAAI,eAAe,CAAC;CACpB,IAAI,WAAW,YAAY,CAAC;CAC5B,IAAI,WAAW,QAAQ,eAAe;EACpC,OAAO,CACL;GACE,MAAM;GACN,sBAAsB;GACtB,UAAU,CAAC,cAAc,SAAS;GAClC,YAAY;IACV,YAAY;KAAE,MAAM;KAAU,WAAW;IAAE;IAC3C,GAAG;GACL;EACF,GACA;GACE,MAAM;GACN,sBAAsB;GACtB,UAAU,CAAC,UAAU,SAAS;GAC9B,YAAY;IACV,QAAQ;IACR,GAAG;GACL;EACF,CACF;EACA,aAAa;CACf;CACA,OAAO;AACT;;;ACjMA,eAAsB,YACpB,KACA,UAAsB,CAAC,GACS;CAChC,IAAI;EACF,QAAQ,IAAI,QAAZ;GACE,KAAK,SAAS;IACZ,MAAM,SAAS,mBAAmB,UAAU,IAAI,MAAM;IACtD,IAAI,CAAC,OAAO,SACV,OAAO,EACL,OAAO;KACL,MAAM;KACN,SAAS;KACT,SAAS,OAAO,MAAM;IACxB,EACF;IAEF,OAAO,EACL,QAAQ,MAAM,YAAY,OAAO,MAAM;KACrC,MAAM,QAAQ;KACd,cAAc,QAAQ;IACxB,CAAC,EACH;GACF;GACA,KAAK,eACH,OAAO,EAAE,QAAQ,kBAAkB,EAAE;GACvC,KAAK,WACH,OAAO,EAAE,QAAQ,cAAc,EAAE;GACnC,SACE,OAAO,EACL,OAAO;IACL,MAAM;IACN,SAAS,mBAAoB,IAA2B;GAC1D,EACF;EACJ;CACF,SAAS,KAAK;EACZ,IAAI,eAAe,WACjB,OAAO,EAAE,OAAO;GAAE,MAAM,IAAI;GAAM,SAAS,IAAI;GAAS,SAAS,IAAI;EAAQ,EAAE;EAGjF,OAAO,EAAE,OAAO;GAAE,MAAM;GAAkB,SAD1B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EACb,EAAE;CACtD;AACF;AAIA,eAAe,QAAQ,QAAgD;CACrE,MAAM,SAAmB,CAAC;CAC1B,WAAW,MAAM,SAAS,QACxB,OAAO,KAAK,OAAO,SAAS,KAAK,IAAI,QAAQ,OAAO,KAAK,KAAe,CAAC;CAE3E,OAAO,OAAO,OAAO,MAAM,CAAC,CAAC,SAAS,OAAO;AAC/C;;AAGA,eAAsB,WAAW,QAAiB,UAAsB,CAAC,GAAoB;CAC3F,MAAM,MAAM,MAAM,QAAQ,QAAQ,KAAK;CACvC,IAAI;CACJ,IAAI;EACF,MAAM,OAAO,KAAK,MAAM,GAAG;EAC3B,MAAM,SAAS;GAAU;GAAgC,QAAQ;EAAK,IAAK;CAC7E,SAAS,KAAK;EACZ,QAAQ,OAAO,MACb,GAAG,KAAK,UAAU,EAChB,OAAO;GACL,MAAM;GACN,SAAS,6BAA6B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;EACvF,EACF,CAAC,EAAE,GACL;EACA,OAAO;CACT;CACA,MAAM,MAAM,MAAM,YAAY,KAAK,OAAO;CAC1C,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,GAAG,EAAE,GAAG;CAC/C,OAAO,WAAW,MAAM,IAAI;AAC9B;;AAGA,eAAsB,YAAY,QAAiB,UAAsB,CAAC,GAAoB;CAE5F,MAAM,SAAQ,MADI,QAAQ,QAAQ,KAAK,EAAA,CACrB,MAAM,IAAI,CAAC,CAAC,QAAQ,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC;CAC/D,IAAI,WAAW;CACf,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI;EACJ,IAAI;GACF,MAAM,OAAO,KAAK,MAAM,IAAI;GAC5B,MAAM,SAAS;IAAU;IAAgC,QAAQ;GAAK,IAAK;EAC7E,SAAS,KAAK;GACZ,QAAQ,OAAO,MACb,GAAG,KAAK,UAAU,EAChB,OAAO;IACL,MAAM;IACN,SAAS,4BAA4B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;GACtF,EACF,CAAC,EAAE,GACL;GACA,WAAW;GACX;EACF;EACA,MAAM,MAAM,MAAM,YAAY,KAAK,OAAO;EAC1C,QAAQ,OAAO,MAAM,GAAG,KAAK,UAAU,GAAG,EAAE,GAAG;EAC/C,IAAI,WAAW,KAAK,WAAW;CACjC;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;;AC9GA,MAAM,aAAa,KAAK,IAAI;AA2B5B,MAAM,oCAAoB,IAAI,IAAI;CAAC;CAAY;CAAe;AAAe,CAAC;AAE9E,SAAgB,UAAU,OAAyB,CAAC,GAAG;CACrD,MAAM,MAAM,IAAI,KAAK;CAErB,IAAI,IAAI,KAAK,KAAK,CAAC;CAGnB,IAAI,KAAK,MAAM;EACb,MAAM,SAAS,KAAK,KAAK;EACzB,IAAI,IAAI,KAAK,OAAO,GAAG,SAAS;GAC9B,MAAM,OAAO,IAAI,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC;GAChC,IAAI,kBAAkB,IAAI,IAAI,GAAG,OAAO,KAAK;GAE7C,MAAM,SADM,EAAE,IAAI,OAAO,eAAe,KAAK,GAAA,CAC3B,MAAM,kBAAkB;GAC1C,IAAI,CAAC,OACH,MAAM,IAAI,UAAU,gBAAgB,8CAA8C,GAAG;GAEvF,MAAM,QAAQ,MAAM;GAEpB,IAAI,EADO,OAAO,WAAW,WAAW,UAAU,SAAS,MAAM,OAAO,KAAK,IAE3E,MAAM,IAAI,UAAU,gBAAgB,yBAAyB,GAAG;GAElE,OAAO,KAAK;EACd,CAAC;CACH;CAEA,IAAI,SAAS,KAAK,MAAM;EACtB,IAAI,eAAe,WAAW;GAC5B,MAAM,SAAS,IAAI;GACnB,OAAO,EAAE,KACP,EAAE,OAAO;IAAE,MAAM,IAAI;IAAM,SAAS,IAAI;IAAS,SAAS,IAAI;GAAQ,EAAE,GACxE,MACF;EACF;EAEA,QAAQ,MAAM,iCAAiC,GAAG;EAClD,OAAO,EAAE,KAAK,EAAE,OAAO;GAAE,MAAM;GAAkB,SAAS;EAAyB,EAAE,GAAG,GAAG;CAC7F,CAAC;CAGD,IAAI,IAAI,aAAa,MACnB,EAAE,KAAK;EAAE,QAAQ;EAAe,YAAY,KAAK,IAAI,IAAI,cAAc;CAAK,CAAC,CAC/E;CAGA,IAAI,IAAI,gBAAgB,MAAM,EAAE,KAAK,cAAc,CAAC,CAAC;CAGrD,IAAI,IAAI,gBAAgB,MAAM,EAAE,KAAK,kBAAkB,CAAC,CAAC;CAGzD,IAAI,KAAK,aAAa,OAAO,MAAM;EACjC,MAAM,MAAM,MAAM,EAAE,IAAI,KAAK,CAAC,CAAC,YAAY,IAAI;EAC/C,IAAI,OAAO,MACT,MAAM,IAAI,UAAU,oBAAoB,8BAA8B,GAAG;EAE3E,MAAM,SAAS,mBAAmB,UAAU,GAAG;EAC/C,IAAI,CAAC,OAAO,SACV,MAAM,IAAI,UACR,oBACA,8CACA,KACA,OAAO,MAAM,MACf;EAEF,MAAM,SAAS,MAAM,YAAY,OAAO,MAAM;GAC5C,MAAM,KAAK;GACX,cAAc,KAAK;EACrB,CAAC;EACD,OAAO,EAAE,KAAK,MAAM;CACtB,CAAC;CAGD,IAAI,KAAK,qBAAqB,OAAO,MAAM;EACzC,MAAM,cAAc,EAAE,IAAI,OAAO,cAAc,KAAK;EACpD,IAAI;EACJ,IAAI,YAAY,SAAS,sBAAsB,GAkB7C,UAAU,EAAE,SAhBG,MADI,EAAE,IAAI,KAAK,EAAA,CAE3B,MAAM,IAAI,CAAC,CACX,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC,CAC1B,QAAQ,SAAS,KAAK,SAAS,CAAC,CAAC,CACjC,KAAK,SAAS;GACb,IAAI;IACF,OAAO,KAAK,MAAM,IAAI;GACxB,QAAQ;IACN,MAAM,IAAI,UACR,oBACA,sCACA,KACA,KAAK,MAAM,GAAG,GAAG,CACnB;GACF;EACF,CACe,EAAE;OAEnB,UAAU,MAAM,EAAE,IAAI,KAAK,CAAC,CAAC,YAAY,IAAI;EAE/C,IAAI,WAAW,MACb,MAAM,IAAI,UAAU,oBAAoB,wCAAwC,GAAG;EAErF,MAAM,SAAS,0BAA0B,UAAU,OAAO;EAC1D,IAAI,CAAC,OAAO,SACV,MAAM,IAAI,UACR,oBACA,qDACA,KACA,OAAO,MAAM,MACf;EAEF,MAAM,SAAS,MAAM,mBAAmB,OAAO,MAAM,KAAK,UAAU,CAAC,CAAC;EACtE,OAAO,EAAE,KAAK,MAAM;CACtB,CAAC;CAGD,IAAI,KAAK,gBAAgB,OAAO,MAAM;EACpC,MAAM,MAAM,MAAM,EAAE,IAAI,KAAK,CAAC,CAAC,YAAY,IAAI;EAC/C,IAAI,OAAO,MACT,MAAM,IAAI,UAAU,oBAAoB,8BAA8B,GAAG;EAE3E,MAAM,SAAS,yBAAyB,UAAU,GAAG;EACrD,IAAI,CAAC,OAAO,SACV,MAAM,IAAI,UACR,oBACA,oDACA,KACA,OAAO,MAAM,MACf;EAEF,MAAM,SAAS,MAAM,qBAAqB,OAAO,MAAM,KAAK,UAAU,CAAC,CAAC;EACxE,OAAO,EAAE,KAAK,MAAM;CACtB,CAAC;CAGD,IAAI,IAAI,kBAAkB,MAAM,EAAE,KAAK,aAAa,cAAc,CAAC,CAAC,OAAO,CAAC,CAAC;CAE7E,OAAO;AACT;AASA,SAAgB,YAAY,OAAqB,CAAC,GAAe;CAC/D,MAAM,MAAM,UAAU,IAAI;CAC1B,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,OAAO,KAAK,QAAQ;CAC1B,OAAO,MAAM;EAAE,OAAO,IAAI;EAAO;EAAM,UAAU;CAAK,IAAI,EAAE,SAAS,MAAM,iBAAiB;EAE1F,QAAQ,IAAI,kCAAkC,QAAQ,GAAG,YAAY;CACvE,CAAC;AACH;;;;;;AAmBA,SAAgB,iBAAiB,OAAqB,CAAC,GAA2B;CAChF,MAAM,MAAM,UAAU,IAAI;CAC1B,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,OAAO,KAAK,QAAQ;CAC1B,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,IAAI,UAAU;EACd,IAAI;EACJ,SAAS,MAAM;GAAE,OAAO,IAAI;GAAO;GAAM,UAAU;EAAK,IAAI,EAAE,SAAS,MAAM,iBAAiB;GAC5F,IAAI,SAAS;GACb,UAAU;GAEV,QAAQ,IAAI,kCAAkC,QAAQ,GAAG,YAAY;GACrE,QAAQ;IACE;IACR,MAAM;IACN,MAAM;IACN,aACE,IAAI,SAAe,KAAK,QAAQ;KAC9B,OAAQ,OAAO,QAAS,MAAM,IAAI,GAAG,IAAI,IAAI,CAAE;IACjD,CAAC;GACL,CAAC;EACH,CAAC;EACD,OAAO,GAAG,UAAU,QAAQ;GAC1B,IAAI,SAAS;GACb,UAAU;GACV,OAAO,GAAG;EACZ,CAAC;CACH,CAAC;AACH"}

package/dist/{skillopt-optimization-method-DbaekMcn.js → skillopt-optimization-method-B2R9C5aG.js}

@@ -1,13 +1,13 @@
-import { r as canonicalString } from "./canonical-IL-Bu-14.js";
-import { i as modelHasSnapshot } from "./run-record-BC0ebuRP.js";
-import { n as contentHash, t as canonicalJson } from "./verdict-cache-CdVVTVmn.js";
-import { D as costFromLedgerSummary, J as readGepaCandidatePopulationArtifact, N as surfaceContentHash, O as optimizationTokenUsageFromSummary, T as combineComparisonCosts, V as campaignBreakdown, nt as runCampaign, q as assertGepaCandidatePopulationSummary, t as llmJudge, y as recordCandidatePopulationSearch } from "./llm-judge-BhasIPFT.js";
-import { t as FileLedgerJournal } from "./ledger-core-BOzlRygb.js";
-import { C as SEARCH_LEDGER_FILE_CONTEXT, E as SearchLedgerIntegrityError, T as SearchLedgerError, _ as resolveExternalOptimizerCallbackLimits, b as createRunCostLedger, d as assertJsonValue, f as assertNoCredentialValues, g as removeCredentialEnvironment, h as isRecord, i as startExternalOptimizerModelProxy, m as isExternalTextCandidate, n as closeExternalOptimizerResources, p as isCandidateText, r as runWithCleanup, t as runExternalOptimizerProcess, u as assertExternalOptimizerModelBudget, v as resolveExternalOptimizerProcessLimits, w as SearchLedgerConflictError, x as fsCampaignStorage, y as safePathComponent } from "./external-optimizer-subprocess-BIWbHpgD.js";
-import { a as heldoutSignificance, o as pairHoldout } from "./power-preflight-DEw-uC7q.js";
-import { c as deepFreezeCanonicalJson } from "./types-BI4fT3HN.js";
-import { g as assertServedModelPolicy } from "./llm-client-hgDieDNN.js";
-import { n as acquireSingleRunLock, t as startExternalOptimizerCallback } from "./external-optimizer-process-WosTBChy.js";
+import { r as canonicalString } from "./canonical-DPyQ_rpt.js";
+import { i as modelHasSnapshot } from "./run-record-DLORoL7t.js";
+import { n as contentHash, t as canonicalJson } from "./verdict-cache-B3eCVQtY.js";
+import { A as optimizationTokenUsageFromSummary, D as combineComparisonCosts, F as surfaceContentHash, U as campaignBreakdown, X as readGepaCandidatePopulationArtifact, Y as assertGepaCandidatePopulationSummary, it as runCampaign, k as costFromLedgerSummary, t as llmJudge, x as recordCandidatePopulationSearch } from "./llm-judge-DbJdo8Nj.js";
+import { t as FileLedgerJournal } from "./ledger-core-PIfjCbKn.js";
+import { D as SearchLedgerIntegrityError, E as SearchLedgerError, S as fsCampaignStorage, T as SearchLedgerConflictError, _ as removeCredentialEnvironment, b as safePathComponent, d as assertExternalOptimizerModelBudget, f as assertJsonValue, g as isRecord, h as isExternalTextCandidate, i as startExternalOptimizerModelProxy, m as isCandidateText, n as closeExternalOptimizerResources, p as assertNoCredentialValues, r as runWithCleanup, t as runExternalOptimizerProcess, v as resolveExternalOptimizerCallbackLimits, w as SEARCH_LEDGER_FILE_CONTEXT, x as createRunCostLedger, y as resolveExternalOptimizerProcessLimits } from "./external-optimizer-subprocess-Cex8Da2i.js";
+import { a as heldoutSignificance, o as pairHoldout } from "./power-preflight-CFXm0Vjo.js";
+import { l as deepFreezeCanonicalJson } from "./types-CiWITkGo.js";
+import { g as assertServedModelPolicy } from "./llm-client-BFMRpmqb.js";
+import { n as acquireSingleRunLock, t as startExternalOptimizerCallback } from "./external-optimizer-process-CQxylYeG.js";
 import { createHash, randomBytes } from "node:crypto";
 import { z } from "zod";
 import { mkdir } from "node:fs/promises";
@@ -2883,4 +2883,4 @@ function skillOptOptimizationMethod(config) {
 //#endregion
 export { validateSearchLedgerEvent as a, externalTextOptimizationMethod as c, REFERENCE_EQUIVALENCE_INPUT_LIMITS as d, REFERENCE_EQUIVALENCE_JUDGE_VERSION as f, openSearchLedger as i, decodeExternalTextCandidate as l, runReferenceEquivalenceJudge as m, gepaOptimizationMethod as n, heldOutGate as o, createReferenceEquivalenceJudge as p, FileSearchLedger as r, composeGate as s, skillOptOptimizationMethod as t, readExternalOptimizerObservationArtifact as u };
 
-//# sourceMappingURL=skillopt-optimization-method-DbaekMcn.js.map
+//# sourceMappingURL=skillopt-optimization-method-B2R9C5aG.js.map