@tangle-network/agent-eval 0.93.0 → 0.95.0

package/dist/chunk-E4GH6USR.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/action-policy.ts","../src/run-evidence.ts","../src/propose-review.ts","../src/propose-review-control.ts"],"sourcesContent":["import type { FeedbackLabel, ProposedSideEffect } from './feedback-trajectory'\n\nexport interface ActionExecutionPolicy {\n  allowedTypes?: string[]\n  blockedTypes?: string[]\n  alwaysRequireApprovalTypes?: string[]\n  autoApproveTypes?: string[]\n  requireApprovalForExternalSideEffects?: boolean\n  requireApprovalAboveCostUsd?: number\n  maxActionCostUsd?: number\n  remainingBudgetUsd?: number\n  expectedOutcomeRequired?: boolean\n  killCriteriaRequired?: boolean\n}\n\nexport interface ActionPolicyDecision {\n  allowed: boolean\n  blocked: boolean\n  requiresApproval: boolean\n  reasons: string[]\n  label?: FeedbackLabel\n}\n\nexport function evaluateActionPolicy(\n  action: ProposedSideEffect,\n  policy: ActionExecutionPolicy = {},\n  options: { createdAt?: string } = {},\n): ActionPolicyDecision {\n  const reasons: string[] = []\n  let blocked = false\n  let requiresApproval = Boolean(action.requiresApproval)\n\n  if (policy.allowedTypes?.length && !policy.allowedTypes.includes(action.type)) {\n    blocked = true\n    reasons.push(`action type \"${action.type}\" is not allowed`)\n  }\n  if (policy.blockedTypes?.includes(action.type)) {\n    blocked = true\n    reasons.push(`action type \"${action.type}\" is blocked`)\n  }\n  if (policy.alwaysRequireApprovalTypes?.includes(action.type)) {\n    requiresApproval = true\n    reasons.push(`action type \"${action.type}\" requires approval`)\n  }\n  if (policy.requireApprovalForExternalSideEffects && action.externalSideEffect) {\n    requiresApproval = true\n    reasons.push('external side effect requires approval')\n  }\n  if (\n    policy.requireApprovalAboveCostUsd !== undefined &&\n    (action.costUsd ?? 0) > policy.requireApprovalAboveCostUsd\n  ) {\n    requiresApproval = true\n    reasons.push(\n      `cost ${action.costUsd} exceeds approval threshold ${policy.requireApprovalAboveCostUsd}`,\n    )\n  }\n  if (policy.maxActionCostUsd !== undefined && (action.costUsd ?? 0) > policy.maxActionCostUsd) {\n    blocked = true\n    reasons.push(`cost ${action.costUsd} exceeds max action cost ${policy.maxActionCostUsd}`)\n  }\n  if (\n    policy.remainingBudgetUsd !== undefined &&\n    (action.costUsd ?? 0) > policy.remainingBudgetUsd\n  ) {\n    blocked = true\n    reasons.push(`cost ${action.costUsd} exceeds remaining budget ${policy.remainingBudgetUsd}`)\n  }\n  if (policy.expectedOutcomeRequired && !action.metadata?.expectedOutcome) {\n    blocked = true\n    reasons.push('expected outcome is required')\n  }\n  if (policy.killCriteriaRequired && !action.metadata?.killCriteria) {\n    blocked = true\n    reasons.push('kill criteria are required')\n  }\n  if (policy.autoApproveTypes?.includes(action.type) && requiresApproval) {\n    reasons.push(\n      `action type \"${action.type}\" is auto-approved only when no approval policy applies`,\n    )\n  }\n\n  if (!reasons.length) reasons.push(requiresApproval ? 'approval required' : 'action allowed')\n\n  const label =\n    blocked || requiresApproval\n      ? {\n          source: 'policy' as const,\n          kind: blocked ? ('policy_block' as const) : ('comment' as const),\n          value: { actionType: action.type, blocked, requiresApproval },\n          reason: reasons.join('; '),\n          severity: blocked ? ('critical' as const) : ('warning' as const),\n          createdAt: options.createdAt ?? new Date().toISOString(),\n          metadata: { action, policy },\n        }\n      : undefined\n\n  return {\n    allowed: !blocked,\n    blocked,\n    requiresApproval: !blocked && requiresApproval,\n    reasons,\n    label,\n  }\n}\n","import type { ControlEvalResult, ControlRunResult } from './control-runtime'\nimport {\n  type RunRecord,\n  type RunSplitTag,\n  type RunTokenUsage,\n  validateRunRecord,\n} from './run-record'\nimport type { FailureClass } from './trace/schema'\n\nexport interface RunEvidenceMetadata {\n  experimentId: string\n  candidateId: string\n  seed: number\n  model: string\n  promptHash: string\n  configHash: string\n  commitSha: string\n  splitTag: RunSplitTag\n  tokenUsage: RunTokenUsage\n  queueMs?: number\n  judgeMetadata?: RunRecord['judgeMetadata']\n  raw?: Record<string, number>\n}\n\nexport interface ControlRunToRunRecordOptions extends RunEvidenceMetadata {\n  runId?: string\n  score?: number\n  failureMode?: string\n}\n\n/**\n * Project a completed control-loop run into the strict RunRecord shape used by\n * release gates, optimizer tables, and research reports.\n *\n * The control loop owns live execution evidence. The caller still supplies the\n * experimental cell metadata because prompt/config hashes, split assignment,\n * model snapshot, and commit SHA are product/harness concerns.\n */\nexport function controlRunToRunRecord<\n  TState,\n  TAction,\n  TActionResult,\n  TEval extends ControlEvalResult = ControlEvalResult,\n>(\n  run: ControlRunResult<TState, TAction, TActionResult, TEval>,\n  options: ControlRunToRunRecordOptions,\n): RunRecord {\n  const score = clampScore(\n    options.score ?? run.score ?? scoreFromEvals(run.finalEvals) ?? (run.pass ? 1 : 0),\n  )\n  const outcome =\n    options.splitTag === 'holdout'\n      ? { holdoutScore: score, raw: normalizeRawMetrics(options.raw, run, score) }\n      : { searchScore: score, raw: normalizeRawMetrics(options.raw, run, score) }\n\n  return validateRunRecord({\n    runId:\n      options.runId ??\n      run.runId ??\n      `control:${options.experimentId}:${options.candidateId}:${options.seed}:${options.splitTag}`,\n    experimentId: options.experimentId,\n    candidateId: options.candidateId,\n    seed: options.seed,\n    model: options.model,\n    promptHash: options.promptHash,\n    configHash: options.configHash,\n    commitSha: options.commitSha,\n    wallMs: run.wallMs,\n    ...(options.queueMs !== undefined ? { queueMs: options.queueMs } : {}),\n    costUsd: run.spentCostUsd,\n    tokenUsage: options.tokenUsage,\n    ...(options.judgeMetadata ? { judgeMetadata: options.judgeMetadata } : {}),\n    outcome,\n    failureMode: options.failureMode ?? failureModeFromRun(run),\n    splitTag: options.splitTag,\n  })\n}\n\nexport function scoreFromEvals(evals: readonly ControlEvalResult[]): number | undefined {\n  const scores = evals\n    .map((e) => e.score)\n    .filter((score): score is number => typeof score === 'number' && Number.isFinite(score))\n  if (scores.length === 0) return undefined\n  return clampScore(scores.reduce((sum, score) => sum + score, 0) / scores.length)\n}\n\nfunction normalizeRawMetrics<TState, TAction, TActionResult, TEval extends ControlEvalResult>(\n  raw: Record<string, number> | undefined,\n  run: ControlRunResult<TState, TAction, TActionResult, TEval>,\n  score: number,\n): Record<string, number> {\n  return {\n    ...finiteOnly(raw ?? {}),\n    score,\n    pass: run.pass ? 1 : 0,\n    completed: run.completed ? 1 : 0,\n    steps: run.steps.length,\n    runtimeErrors: run.runtimeErrors.length,\n  }\n}\n\nfunction finiteOnly(values: Record<string, number>): Record<string, number> {\n  const out: Record<string, number> = {}\n  for (const [key, value] of Object.entries(values)) {\n    if (Number.isFinite(value)) out[key] = value\n  }\n  return out\n}\n\nfunction failureModeFromRun<TState, TAction, TActionResult, TEval extends ControlEvalResult>(\n  run: ControlRunResult<TState, TAction, TActionResult, TEval>,\n): FailureClass | undefined {\n  if (run.pass) return undefined\n  return run.failureClass ?? 'unknown'\n}\n\nfunction clampScore(value: number): number {\n  if (!Number.isFinite(value)) return 0\n  return Math.max(0, Math.min(1, value))\n}\n","/**\n * Propose / Verify / Review — the core multi-shot primitive.\n *\n *   shot N:  propose(state, priorReview) → new state\n *            verify(state)               → pass/fail, optional layers\n *            review(state, verification, memory) → observations + next-shot\n *                                                   instruction + shouldContinue\n *            memory.append(entry)\n *\n * Roles are strictly separated:\n *\n *   - The WORKER is whatever the caller wraps in `propose`. It is\n *     stateful — caller owns its resume/session mechanism.\n *   - The VERIFIER grades the state. It produces the ground truth.\n *     The reviewer cannot overturn or downgrade a verification layer.\n *   - The REVIEWER is stateless per call. Its continuity is the\n *     `ReviewMemoryStore` — durable JSONL by default, or any store\n *     implementing the interface. It reads memory + trace summary +\n *     verification and directs the NEXT proposer shot.\n *\n * This shape is load-bearing. The reviewer never grades; the verifier\n * never directs. Two processes, two prompts, two concerns — which is\n * what keeps the loop from confirmation-biasing itself into \"all\n * passed\" when it didn't.\n *\n * Short-circuits and soft-fails are both first-class:\n *   - verify.pass === true  → reviewer LLM call is skipped, memory\n *     records a success entry, loop exits.\n *   - review throws         → the shot still counts; the loop uses the\n *     last-known instruction (or `fallbackInstruction`) for the next\n *     propose call. A transient reviewer failure must NEVER abort a\n *     valid arc.\n *\n * Composable: `propose` itself can be another `runProposeReview` call.\n * That's the dogfooding path — a harness built on this primitive is in\n * turn evaluable by it.\n */\n\nimport { appendFileSync, existsSync, mkdirSync, readFileSync } from 'node:fs'\nimport { dirname } from 'node:path'\nimport { type SpanHandle, TraceEmitter } from './trace/emitter'\nimport type { FailureClass } from './trace/schema'\nimport type { TraceStore } from './trace/store'\n\n// ── Types ────────────────────────────────────────────────────────────\n\nexport interface Verification {\n  pass: boolean\n  score?: number\n  failingLayers?: string[]\n  details?: unknown\n}\n\nexport interface Review {\n  observations: string\n  diagnosis: string\n  nextShotInstruction: string\n  shouldContinue: boolean\n  confidence: number\n}\n\nexport interface ReviewMemoryEntry extends Review {\n  shot: number\n  timestamp: number\n  verification: {\n    pass: boolean\n    score?: number\n    failingLayers?: string[]\n  }\n}\n\nexport interface ProposeInput<State> {\n  shot: number\n  goal: string\n  state: State\n  priorReview: Review | null\n  abortSignal: AbortSignal\n  emitter?: TraceEmitter\n}\n\nexport interface ProposeOutput<State, Summary = unknown> {\n  state: State\n  traceSummary?: Summary\n}\n\nexport interface ReviewInput<State, Summary = unknown> {\n  shot: number\n  goal: string\n  state: State\n  verification: Verification\n  traceSummary: Summary | undefined\n  memory: ReviewMemoryEntry[]\n}\n\nexport type ProposeFn<State, Summary = unknown> = (\n  input: ProposeInput<State>,\n) => Promise<ProposeOutput<State, Summary>>\n\nexport type VerifyFn<State> = (state: State) => Promise<Verification>\n\nexport type ReviewFn<State, Summary = unknown> = (\n  input: ReviewInput<State, Summary>,\n) => Promise<Review>\n\nexport interface ReviewMemoryStore {\n  load(): Promise<ReviewMemoryEntry[]>\n  append(entry: ReviewMemoryEntry): Promise<void>\n}\n\nexport interface ProposeReviewConfig<State, Summary = unknown> {\n  goal: string\n  initialState: State\n  propose: ProposeFn<State, Summary>\n  verify: VerifyFn<State>\n  review: ReviewFn<State, Summary>\n  /** Hard shot cap. Default 10. */\n  maxShots?: number\n  /** Wall-clock cap in ms. Default 10 min. */\n  maxWallMs?: number\n  /**\n   * If the reviewer returns confidence ≤ floor on `confidenceFloorWindow`\n   * consecutive shots, terminate early. Default floor 0.3, window 2.\n   * Set window to 0 or floor to <0 to disable.\n   */\n  confidenceFloor?: number\n  confidenceFloorWindow?: number\n  /** Defaults to an in-memory store if omitted. */\n  memory?: ReviewMemoryStore\n  /** If provided, emit a Run + per-shot spans. */\n  store?: TraceStore\n  scenarioId?: string\n  projectId?: string\n  variantId?: string\n  /**\n   * Used when the reviewer soft-fails on shot 1 (no prior instruction to\n   * fall back to). Default is a generic \"inspect failures and fix\".\n   */\n  fallbackInstruction?: string\n}\n\nexport interface ProposeReviewShot<State, Summary = unknown> {\n  shot: number\n  state: State\n  verification: Verification\n  traceSummary: Summary | undefined\n  review: Review\n  reviewAvailable: boolean\n  reviewError?: string\n  durationMs: number\n}\n\nexport interface ProposeReviewReport<State, Summary = unknown> {\n  runId: string | null\n  completed: boolean\n  shots: ProposeReviewShot<State, Summary>[]\n  finalState: State\n  finalVerification: Verification\n  failureClass?: FailureClass\n  wallMs: number\n  score: number\n}\n\n// ── Memory stores ────────────────────────────────────────────────────\n\nexport function inMemoryReviewStore(initial: ReviewMemoryEntry[] = []): ReviewMemoryStore {\n  const entries: ReviewMemoryEntry[] = [...initial]\n  return {\n    async load() {\n      return [...entries]\n    },\n    async append(entry) {\n      entries.push(entry)\n    },\n  }\n}\n\nexport function jsonlReviewStore(path: string): ReviewMemoryStore {\n  return {\n    async load() {\n      if (!existsSync(path)) return []\n      const raw = readFileSync(path, 'utf8')\n      const out: ReviewMemoryEntry[] = []\n      for (const line of raw.split('\\n')) {\n        const trimmed = line.trim()\n        if (!trimmed) continue\n        try {\n          out.push(JSON.parse(trimmed) as ReviewMemoryEntry)\n        } catch {\n          // A corrupt line is an observability problem, not a correctness\n          // one — skip it rather than aborting the loop.\n        }\n      }\n      return out\n    },\n    async append(entry) {\n      mkdirSync(dirname(path), { recursive: true })\n      appendFileSync(path, `${JSON.stringify(entry)}\\n`)\n    },\n  }\n}\n\n// ── Core loop ────────────────────────────────────────────────────────\n\nconst DEFAULT_FALLBACK_INSTRUCTION =\n  'Inspect the verification failures above. Fix the critical issues first, then the major ones. Do not restate the failures — act on them.'\n\nexport async function runProposeReview<State, Summary = unknown>(\n  config: ProposeReviewConfig<State, Summary>,\n): Promise<ProposeReviewReport<State, Summary>> {\n  const maxShots = config.maxShots ?? 10\n  const maxWallMs = config.maxWallMs ?? 10 * 60 * 1000\n  const confidenceFloor = config.confidenceFloor ?? 0.3\n  const confidenceFloorWindow = config.confidenceFloorWindow ?? 2\n  const memory = config.memory ?? inMemoryReviewStore()\n  const fallbackInstruction = config.fallbackInstruction ?? DEFAULT_FALLBACK_INSTRUCTION\n\n  const emitter = config.store ? new TraceEmitter(config.store) : null\n  if (emitter) {\n    await emitter.startRun({\n      scenarioId: config.scenarioId ?? 'propose-review',\n      projectId: config.projectId,\n      variantId: config.variantId,\n      layer: 'meta',\n      tags: {\n        goal: config.goal.slice(0, 120),\n        maxShots: String(maxShots),\n      },\n    })\n  }\n\n  const abort = new AbortController()\n  const wallStart = Date.now()\n  const wallTimer = setTimeout(\n    () => abort.abort(new Error('propose-review wall timeout')),\n    maxWallMs,\n  )\n\n  const shots: ProposeReviewShot<State, Summary>[] = []\n  let state = config.initialState\n  let priorReview: Review | null = null\n  let lastVerification: Verification = { pass: false }\n  let failureClass: FailureClass | undefined\n  let completed = false\n  let lowConfidenceStreak = 0\n\n  try {\n    for (let shot = 1; shot <= maxShots; shot++) {\n      if (abort.signal.aborted) {\n        failureClass = 'timeout'\n        break\n      }\n\n      const shotStart = Date.now()\n      const shotHandle = emitter ? await emitter.span({ kind: 'tool', name: `shot-${shot}` }) : null\n\n      // 1. Propose.\n      let proposeOut: ProposeOutput<State, Summary>\n      try {\n        proposeOut = await config.propose({\n          shot,\n          goal: config.goal,\n          state,\n          priorReview,\n          abortSignal: abort.signal,\n          emitter: emitter ?? undefined,\n        })\n      } catch (err) {\n        await shotHandle?.fail(err instanceof Error ? err : String(err))\n        failureClass = 'unknown'\n        throw err\n      }\n      state = proposeOut.state\n      const traceSummary = proposeOut.traceSummary\n\n      // 2. Verify.\n      let verification: Verification\n      try {\n        verification = await config.verify(state)\n      } catch (err) {\n        await shotHandle?.fail(err instanceof Error ? err : String(err))\n        failureClass = 'unknown'\n        throw err\n      }\n      lastVerification = verification\n\n      // 3. Review — short-circuit on pass; soft-fail on throw.\n      const memorySnapshot = await memory.load()\n      const verificationDigest = {\n        pass: verification.pass,\n        score: verification.score,\n        failingLayers: verification.failingLayers ?? [],\n      }\n\n      let review: Review\n      let reviewAvailable = true\n      let reviewError: string | undefined\n\n      if (verification.pass) {\n        review = {\n          observations: 'verification passed — skipping reviewer LLM call',\n          diagnosis: 'no failures to diagnose',\n          nextShotInstruction: '(done)',\n          shouldContinue: false,\n          confidence: 1,\n        }\n      } else {\n        try {\n          review = await config.review({\n            shot,\n            goal: config.goal,\n            state,\n            verification,\n            traceSummary,\n            memory: memorySnapshot,\n          })\n          review = coerceReview(review)\n        } catch (err) {\n          reviewAvailable = false\n          reviewError = err instanceof Error ? err.message : String(err)\n          const lastInstruction =\n            memorySnapshot.length > 0\n              ? memorySnapshot[memorySnapshot.length - 1]!.nextShotInstruction\n              : fallbackInstruction\n          review = {\n            observations: '(reviewer unavailable — using last-known instruction)',\n            diagnosis: reviewError,\n            nextShotInstruction: lastInstruction,\n            shouldContinue: true,\n            confidence: 0.3,\n          }\n        }\n      }\n\n      const entry: ReviewMemoryEntry = {\n        shot,\n        timestamp: Date.now(),\n        ...review,\n        verification: verificationDigest,\n      }\n      await memory.append(entry)\n\n      const shotRecord: ProposeReviewShot<State, Summary> = {\n        shot,\n        state,\n        verification,\n        traceSummary,\n        review,\n        reviewAvailable,\n        reviewError,\n        durationMs: Date.now() - shotStart,\n      }\n      shots.push(shotRecord)\n\n      await shotHandle?.end({\n        attributes: {\n          verificationPass: verification.pass,\n          verificationScore: verification.score ?? null,\n          reviewShouldContinue: review.shouldContinue,\n          reviewConfidence: review.confidence,\n          reviewAvailable,\n        },\n      } as Partial<SpanHandle['span']>)\n\n      // 4. Exit rules.\n      if (verification.pass) {\n        completed = true\n        break\n      }\n      if (!review.shouldContinue) {\n        break\n      }\n      if (confidenceFloorWindow > 0 && review.confidence <= confidenceFloor) {\n        lowConfidenceStreak += 1\n        if (lowConfidenceStreak >= confidenceFloorWindow) break\n      } else {\n        lowConfidenceStreak = 0\n      }\n\n      priorReview = review\n    }\n\n    if (!completed && !failureClass) {\n      failureClass = shots.length >= maxShots ? 'budget_exceeded' : 'unknown'\n    }\n  } finally {\n    clearTimeout(wallTimer)\n  }\n\n  const score = lastVerification.pass\n    ? 1\n    : typeof lastVerification.score === 'number'\n      ? lastVerification.score\n      : 0\n\n  if (emitter) {\n    await emitter.endRun({\n      pass: completed,\n      score,\n      failureClass,\n      notes: `${shots.length} shot(s); final pass=${lastVerification.pass}`,\n    })\n  }\n\n  return {\n    runId: emitter?.runId ?? null,\n    completed,\n    shots,\n    finalState: state,\n    finalVerification: lastVerification,\n    failureClass,\n    wallMs: Date.now() - wallStart,\n    score,\n  }\n}\n\n// ── Reviewer helper (LLM-backed) ─────────────────────────────────────\n\nexport type LlmJsonCall = (req: { system: string; user: string }) => Promise<unknown>\n\nexport interface LlmReviewerConfig<State, Summary = unknown> {\n  callJson: LlmJsonCall\n  renderState?: (state: State) => string\n  renderTraceSummary?: (summary: Summary | undefined) => string\n  /** Appended to the default system prompt. */\n  systemPromptAddendum?: string\n}\n\nconst REVIEWER_SYSTEM_PROMPT = `You are a senior reviewer directing a multi-shot build loop.\nYou do NOT grade — the verifier already did. Your job is to direct the worker's next shot.\nYou are blind to the worker's inner monologue. You see what it DID, not what it thought.\nReturn STRICT JSON matching the schema. No prose outside the JSON.`\n\nexport function createLlmReviewer<State, Summary = unknown>(\n  cfg: LlmReviewerConfig<State, Summary>,\n): ReviewFn<State, Summary> {\n  const renderState = cfg.renderState ?? ((s: State) => safeJson(s))\n  const renderTraceSummary =\n    cfg.renderTraceSummary ??\n    ((s: Summary | undefined) => (s === undefined ? '(none)' : safeJson(s)))\n  const system = cfg.systemPromptAddendum\n    ? `${REVIEWER_SYSTEM_PROMPT}\\n\\n${cfg.systemPromptAddendum}`\n    : REVIEWER_SYSTEM_PROMPT\n\n  return async (input) => {\n    const memoryBlock =\n      input.memory.length === 0\n        ? '(no prior shots — this is shot 1)'\n        : input.memory\n            .map((m) =>\n              [\n                `shot ${m.shot} — verification.pass=${m.verification.pass}` +\n                  (typeof m.verification.score === 'number'\n                    ? ` score=${m.verification.score.toFixed(2)}`\n                    : '') +\n                  ` confidence=${m.confidence.toFixed(2)} failing=[${(m.verification.failingLayers ?? []).join(',')}]`,\n                `  observations: ${m.observations.slice(0, 400)}`,\n                `  diagnosis: ${m.diagnosis.slice(0, 400)}`,\n                `  instruction given: ${m.nextShotInstruction.slice(0, 400)}`,\n              ].join('\\n'),\n            )\n            .join('\\n\\n')\n\n    const user = [\n      `=== GOAL ===`,\n      input.goal,\n      ``,\n      `=== SHOT NUMBER ===`,\n      String(input.shot),\n      ``,\n      `=== CURRENT STATE ===`,\n      renderState(input.state),\n      ``,\n      `=== TRACE SUMMARY ===`,\n      renderTraceSummary(input.traceSummary),\n      ``,\n      `=== VERIFICATION ===`,\n      summarizeVerification(input.verification),\n      ``,\n      `=== REVIEWER MEMORY (prior shots) ===`,\n      memoryBlock,\n      ``,\n      `=== YOUR TASK ===`,\n      `Return STRICT JSON:`,\n      `{`,\n      `  \"observations\": string (20..2000 chars, first-person worker behavior — quote counts, errors, loops)`,\n      `  \"diagnosis\": string (20..1500 chars, root cause, NOT a restatement of verification)`,\n      `  \"nextShotInstruction\": string (40..3000 chars, concrete directive to the worker)`,\n      `  \"shouldContinue\": boolean (false if verification.pass, or if thrashing, or unachievable)`,\n      `  \"confidence\": number in [0,1]`,\n      `}`,\n    ].join('\\n')\n\n    const raw = await cfg.callJson({ system, user })\n    return coerceReview(raw as Partial<Review>)\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\nfunction coerceReview(raw: Partial<Review> | null | undefined): Review {\n  if (!raw || typeof raw !== 'object') {\n    throw new Error('reviewer returned non-object')\n  }\n  const observations = typeof raw.observations === 'string' ? raw.observations : ''\n  const diagnosis = typeof raw.diagnosis === 'string' ? raw.diagnosis : ''\n  const nextShotInstruction =\n    typeof raw.nextShotInstruction === 'string' ? raw.nextShotInstruction : ''\n  if (!observations || !diagnosis || !nextShotInstruction) {\n    throw new Error('reviewer missing required string fields')\n  }\n  if (typeof raw.shouldContinue !== 'boolean') {\n    throw new Error('reviewer missing shouldContinue boolean')\n  }\n  const confidenceRaw = Number(raw.confidence)\n  if (!Number.isFinite(confidenceRaw)) {\n    throw new Error('reviewer confidence not finite')\n  }\n  return {\n    observations,\n    diagnosis,\n    nextShotInstruction,\n    shouldContinue: raw.shouldContinue,\n    confidence: Math.max(0, Math.min(1, confidenceRaw)),\n  }\n}\n\nfunction summarizeVerification(v: Verification): string {\n  const header =\n    `pass=${v.pass}` +\n    (typeof v.score === 'number' ? ` score=${v.score.toFixed(3)}` : '') +\n    (v.failingLayers && v.failingLayers.length > 0\n      ? ` failing=[${v.failingLayers.join(', ')}]`\n      : '')\n  const details = v.details === undefined ? '' : `\\n${safeJson(v.details).slice(0, 1500)}`\n  return header + details\n}\n\nfunction safeJson(x: unknown): string {\n  try {\n    return JSON.stringify(x, null, 2)\n  } catch {\n    return String(x)\n  }\n}\n","import {\n  type ControlRunResult,\n  type ControlRuntimeConfig,\n  objectiveEval,\n  runAgentControlLoop,\n} from './control-runtime'\nimport {\n  inMemoryReviewStore,\n  type ProposeFn,\n  type ProposeOutput,\n  type Review,\n  type ReviewFn,\n  type ReviewMemoryEntry,\n  type ReviewMemoryStore,\n  type Verification,\n  type VerifyFn,\n} from './propose-review'\nimport type { FailureClass } from './trace/schema'\nimport type { TraceStore } from './trace/store'\n\nexport interface ProposeReviewControlState<State, Summary = unknown> {\n  shot: number\n  state: State\n  priorReview: Review | null\n  verification: Verification\n  traceSummary?: Summary\n  memory: ReviewMemoryEntry[]\n  completed: boolean\n  reviewAvailable: boolean\n  reviewError?: string\n}\n\nexport interface ProposeReviewControlAction {\n  type: 'propose-review-shot'\n  shot: number\n}\n\nexport interface ProposeReviewControlResult<State, Summary = unknown> {\n  state: State\n  verification: Verification\n  traceSummary?: Summary\n  review: Review | null\n  reviewAvailable: boolean\n  reviewError?: string\n}\n\nexport interface ProposeReviewControlConfig<State, Summary = unknown> {\n  goal: string\n  initialState: State\n  propose: ProposeFn<State, Summary>\n  verify: VerifyFn<State>\n  review: ReviewFn<State, Summary>\n  maxShots?: number\n  maxWallMs?: number\n  memory?: ReviewMemoryStore\n  store?: TraceStore\n  scenarioId?: string\n  projectId?: string\n  variantId?: string\n  fallbackInstruction?: string\n  confidenceFloor?: number\n  confidenceFloorWindow?: number\n  failureClassFromVerification?: (verification: Verification) => FailureClass | undefined\n  actionFailure?: ControlRuntimeConfig<\n    ProposeReviewControlState<State, Summary>,\n    ProposeReviewControlAction,\n    ProposeReviewControlResult<State, Summary>\n  >['actionFailure']\n}\n\nconst DEFAULT_FALLBACK_INSTRUCTION =\n  'Inspect the verification failures above. Fix the critical issues first, then the major ones. Do not restate the failures — act on them.'\n\nexport async function runProposeReviewAsControlLoop<State, Summary = unknown>(\n  config: ProposeReviewControlConfig<State, Summary>,\n): Promise<\n  ControlRunResult<\n    ProposeReviewControlState<State, Summary>,\n    ProposeReviewControlAction,\n    ProposeReviewControlResult<State, Summary>\n  >\n> {\n  const maxShots = config.maxShots ?? 10\n  const confidenceFloor = config.confidenceFloor ?? 0.3\n  const confidenceFloorWindow = config.confidenceFloorWindow ?? 2\n  const memory = config.memory ?? inMemoryReviewStore()\n  const fallbackInstruction = config.fallbackInstruction ?? DEFAULT_FALLBACK_INSTRUCTION\n  const failureClassFromVerification =\n    config.failureClassFromVerification ?? controlFailureClassFromVerification\n  let lowConfidenceStreak = 0\n\n  let current: ProposeReviewControlState<State, Summary> = {\n    shot: 0,\n    state: config.initialState,\n    priorReview: null,\n    verification: { pass: false },\n    memory: await memory.load(),\n    completed: false,\n    reviewAvailable: false,\n  }\n\n  return runAgentControlLoop({\n    intent: config.goal,\n    budget: { maxSteps: maxShots, maxWallMs: config.maxWallMs },\n    store: config.store,\n    scenarioId: config.scenarioId ?? 'propose-review-control',\n    projectId: config.projectId,\n    variantId: config.variantId,\n    actionFailure: config.actionFailure ?? 'stop',\n    observe: () => current,\n    validate: ({ state }) => [\n      objectiveEval({\n        id: 'verification',\n        passed: state.verification.pass,\n        score: state.verification.score,\n        severity: 'critical',\n        detail: state.verification.pass\n          ? 'verification passed'\n          : `verification failed${state.verification.failingLayers?.length ? `: ${state.verification.failingLayers.join(', ')}` : ''}`,\n      }),\n    ],\n    shouldStop: ({ state }) => {\n      if (state.verification.pass) {\n        return {\n          stop: true,\n          pass: true,\n          reason: 'verification passed',\n          score: state.verification.score,\n        }\n      }\n      if (state.completed) {\n        return {\n          stop: true,\n          pass: false,\n          reason: 'reviewer stopped continuation',\n          score: state.verification.score,\n          failureClass: failureClassFromVerification(state.verification),\n        }\n      }\n      return {\n        stop: false,\n        pass: false,\n        reason: 'verification still failing',\n        score: state.verification.score,\n      }\n    },\n    decide: ({ state }) => ({\n      type: 'continue',\n      action: { type: 'propose-review-shot', shot: state.shot + 1 },\n      reason: state.priorReview?.nextShotInstruction ?? fallbackInstruction,\n    }),\n    act: async (action, ctx) => {\n      const shot = action.shot\n      const proposeOut: ProposeOutput<State, Summary> = await config.propose({\n        shot,\n        goal: config.goal,\n        state: current.state,\n        priorReview: current.priorReview,\n        abortSignal: ctx.abortSignal,\n        emitter: ctx.emitter,\n      })\n\n      const nextState = proposeOut.state\n      const verification = await config.verify(nextState)\n      let review: Review | null = null\n      let reviewAvailable = false\n      let reviewError: string | undefined\n      let shouldContinue = !verification.pass\n\n      if (!verification.pass) {\n        try {\n          review = await config.review({\n            shot,\n            goal: config.goal,\n            state: nextState,\n            verification,\n            traceSummary: proposeOut.traceSummary,\n            memory: await memory.load(),\n          })\n          reviewAvailable = true\n          shouldContinue = review.shouldContinue\n          lowConfidenceStreak = review.confidence <= confidenceFloor ? lowConfidenceStreak + 1 : 0\n          if (confidenceFloorWindow > 0 && lowConfidenceStreak >= confidenceFloorWindow)\n            shouldContinue = false\n        } catch (err) {\n          reviewError = err instanceof Error ? err.message : String(err)\n          review = current.priorReview ?? {\n            observations: 'Reviewer unavailable.',\n            diagnosis: reviewError,\n            nextShotInstruction: fallbackInstruction,\n            shouldContinue: true,\n            confidence: 0,\n          }\n          shouldContinue = true\n        }\n      } else {\n        review = {\n          observations: 'Verification passed.',\n          diagnosis: 'No further revision needed.',\n          nextShotInstruction: '',\n          shouldContinue: false,\n          confidence: 1,\n        }\n      }\n\n      const entry: ReviewMemoryEntry = {\n        ...(review ?? {\n          observations: 'No review.',\n          diagnosis: '',\n          nextShotInstruction: fallbackInstruction,\n          shouldContinue,\n          confidence: 0,\n        }),\n        shot,\n        timestamp: Date.now(),\n        verification: {\n          pass: verification.pass,\n          score: verification.score,\n          failingLayers: verification.failingLayers,\n        },\n      }\n      await memory.append(entry)\n\n      current = {\n        shot,\n        state: nextState,\n        priorReview: review,\n        verification,\n        traceSummary: proposeOut.traceSummary,\n        memory: await memory.load(),\n        completed: verification.pass || !shouldContinue,\n        reviewAvailable,\n        reviewError,\n      }\n\n      return {\n        state: nextState,\n        verification,\n        traceSummary: proposeOut.traceSummary,\n        review,\n        reviewAvailable,\n        reviewError,\n      }\n    },\n  })\n}\n\nexport function controlFailureClassFromVerification(\n  verification: Verification,\n): FailureClass | undefined {\n  if (verification.pass) return undefined\n  return verification.failingLayers?.length ? 'instruction_following' : 'unknown'\n}\n"],"mappings":";;;;;;;;;;;;AAuBO,SAAS,qBACd,QACA,SAAgC,CAAC,GACjC,UAAkC,CAAC,GACb;AACtB,QAAM,UAAoB,CAAC;AAC3B,MAAI,UAAU;AACd,MAAI,mBAAmB,QAAQ,OAAO,gBAAgB;AAEtD,MAAI,OAAO,cAAc,UAAU,CAAC,OAAO,aAAa,SAAS,OAAO,IAAI,GAAG;AAC7E,cAAU;AACV,YAAQ,KAAK,gBAAgB,OAAO,IAAI,kBAAkB;AAAA,EAC5D;AACA,MAAI,OAAO,cAAc,SAAS,OAAO,IAAI,GAAG;AAC9C,cAAU;AACV,YAAQ,KAAK,gBAAgB,OAAO,IAAI,cAAc;AAAA,EACxD;AACA,MAAI,OAAO,4BAA4B,SAAS,OAAO,IAAI,GAAG;AAC5D,uBAAmB;AACnB,YAAQ,KAAK,gBAAgB,OAAO,IAAI,qBAAqB;AAAA,EAC/D;AACA,MAAI,OAAO,yCAAyC,OAAO,oBAAoB;AAC7E,uBAAmB;AACnB,YAAQ,KAAK,wCAAwC;AAAA,EACvD;AACA,MACE,OAAO,gCAAgC,WACtC,OAAO,WAAW,KAAK,OAAO,6BAC/B;AACA,uBAAmB;AACnB,YAAQ;AAAA,MACN,QAAQ,OAAO,OAAO,+BAA+B,OAAO,2BAA2B;AAAA,IACzF;AAAA,EACF;AACA,MAAI,OAAO,qBAAqB,WAAc,OAAO,WAAW,KAAK,OAAO,kBAAkB;AAC5F,cAAU;AACV,YAAQ,KAAK,QAAQ,OAAO,OAAO,4BAA4B,OAAO,gBAAgB,EAAE;AAAA,EAC1F;AACA,MACE,OAAO,uBAAuB,WAC7B,OAAO,WAAW,KAAK,OAAO,oBAC/B;AACA,cAAU;AACV,YAAQ,KAAK,QAAQ,OAAO,OAAO,6BAA6B,OAAO,kBAAkB,EAAE;AAAA,EAC7F;AACA,MAAI,OAAO,2BAA2B,CAAC,OAAO,UAAU,iBAAiB;AACvE,cAAU;AACV,YAAQ,KAAK,8BAA8B;AAAA,EAC7C;AACA,MAAI,OAAO,wBAAwB,CAAC,OAAO,UAAU,cAAc;AACjE,cAAU;AACV,YAAQ,KAAK,4BAA4B;AAAA,EAC3C;AACA,MAAI,OAAO,kBAAkB,SAAS,OAAO,IAAI,KAAK,kBAAkB;AACtE,YAAQ;AAAA,MACN,gBAAgB,OAAO,IAAI;AAAA,IAC7B;AAAA,EACF;AAEA,MAAI,CAAC,QAAQ,OAAQ,SAAQ,KAAK,mBAAmB,sBAAsB,gBAAgB;AAE3F,QAAM,QACJ,WAAW,mBACP;AAAA,IACE,QAAQ;AAAA,IACR,MAAM,UAAW,iBAA4B;AAAA,IAC7C,OAAO,EAAE,YAAY,OAAO,MAAM,SAAS,iBAAiB;AAAA,IAC5D,QAAQ,QAAQ,KAAK,IAAI;AAAA,IACzB,UAAU,UAAW,aAAwB;AAAA,IAC7C,WAAW,QAAQ,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,IACvD,UAAU,EAAE,QAAQ,OAAO;AAAA,EAC7B,IACA;AAEN,SAAO;AAAA,IACL,SAAS,CAAC;AAAA,IACV;AAAA,IACA,kBAAkB,CAAC,WAAW;AAAA,IAC9B;AAAA,IACA;AAAA,EACF;AACF;;;AClEO,SAAS,sBAMd,KACA,SACW;AACX,QAAM,QAAQ;AAAA,IACZ,QAAQ,SAAS,IAAI,SAAS,eAAe,IAAI,UAAU,MAAM,IAAI,OAAO,IAAI;AAAA,EAClF;AACA,QAAM,UACJ,QAAQ,aAAa,YACjB,EAAE,cAAc,OAAO,KAAK,oBAAoB,QAAQ,KAAK,KAAK,KAAK,EAAE,IACzE,EAAE,aAAa,OAAO,KAAK,oBAAoB,QAAQ,KAAK,KAAK,KAAK,EAAE;AAE9E,SAAO,kBAAkB;AAAA,IACvB,OACE,QAAQ,SACR,IAAI,SACJ,WAAW,QAAQ,YAAY,IAAI,QAAQ,WAAW,IAAI,QAAQ,IAAI,IAAI,QAAQ,QAAQ;AAAA,IAC5F,cAAc,QAAQ;AAAA,IACtB,aAAa,QAAQ;AAAA,IACrB,MAAM,QAAQ;AAAA,IACd,OAAO,QAAQ;AAAA,IACf,YAAY,QAAQ;AAAA,IACpB,YAAY,QAAQ;AAAA,IACpB,WAAW,QAAQ;AAAA,IACnB,QAAQ,IAAI;AAAA,IACZ,GAAI,QAAQ,YAAY,SAAY,EAAE,SAAS,QAAQ,QAAQ,IAAI,CAAC;AAAA,IACpE,SAAS,IAAI;AAAA,IACb,YAAY,QAAQ;AAAA,IACpB,GAAI,QAAQ,gBAAgB,EAAE,eAAe,QAAQ,cAAc,IAAI,CAAC;AAAA,IACxE;AAAA,IACA,aAAa,QAAQ,eAAe,mBAAmB,GAAG;AAAA,IAC1D,UAAU,QAAQ;AAAA,EACpB,CAAC;AACH;AAEO,SAAS,eAAe,OAAyD;AACtF,QAAM,SAAS,MACZ,IAAI,CAAC,MAAM,EAAE,KAAK,EAClB,OAAO,CAAC,UAA2B,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,CAAC;AACzF,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,SAAO,WAAW,OAAO,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO,MAAM;AACjF;AAEA,SAAS,oBACP,KACA,KACA,OACwB;AACxB,SAAO;AAAA,IACL,GAAG,WAAW,OAAO,CAAC,CAAC;AAAA,IACvB;AAAA,IACA,MAAM,IAAI,OAAO,IAAI;AAAA,IACrB,WAAW,IAAI,YAAY,IAAI;AAAA,IAC/B,OAAO,IAAI,MAAM;AAAA,IACjB,eAAe,IAAI,cAAc;AAAA,EACnC;AACF;AAEA,SAAS,WAAW,QAAwD;AAC1E,QAAM,MAA8B,CAAC;AACrC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACjD,QAAI,OAAO,SAAS,KAAK,EAAG,KAAI,GAAG,IAAI;AAAA,EACzC;AACA,SAAO;AACT;AAEA,SAAS,mBACP,KAC0B;AAC1B,MAAI,IAAI,KAAM,QAAO;AACrB,SAAO,IAAI,gBAAgB;AAC7B;AAEA,SAAS,WAAW,OAAuB;AACzC,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AACvC;;;ACjFA,SAAS,gBAAgB,YAAY,WAAW,oBAAoB;AACpE,SAAS,eAAe;AA6HjB,SAAS,oBAAoB,UAA+B,CAAC,GAAsB;AACxF,QAAM,UAA+B,CAAC,GAAG,OAAO;AAChD,SAAO;AAAA,IACL,MAAM,OAAO;AACX,aAAO,CAAC,GAAG,OAAO;AAAA,IACpB;AAAA,IACA,MAAM,OAAO,OAAO;AAClB,cAAQ,KAAK,KAAK;AAAA,IACpB;AAAA,EACF;AACF;AAEO,SAAS,iBAAiB,MAAiC;AAChE,SAAO;AAAA,IACL,MAAM,OAAO;AACX,UAAI,CAAC,WAAW,IAAI,EAAG,QAAO,CAAC;AAC/B,YAAM,MAAM,aAAa,MAAM,MAAM;AACrC,YAAM,MAA2B,CAAC;AAClC,iBAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,cAAM,UAAU,KAAK,KAAK;AAC1B,YAAI,CAAC,QAAS;AACd,YAAI;AACF,cAAI,KAAK,KAAK,MAAM,OAAO,CAAsB;AAAA,QACnD,QAAQ;AAAA,QAGR;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,IACA,MAAM,OAAO,OAAO;AAClB,gBAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;AAC5C,qBAAe,MAAM,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA,CAAI;AAAA,IACnD;AAAA,EACF;AACF;AAIA,IAAM,+BACJ;AAEF,eAAsB,iBACpB,QAC8C;AAC9C,QAAM,WAAW,OAAO,YAAY;AACpC,QAAM,YAAY,OAAO,aAAa,KAAK,KAAK;AAChD,QAAM,kBAAkB,OAAO,mBAAmB;AAClD,QAAM,wBAAwB,OAAO,yBAAyB;AAC9D,QAAM,SAAS,OAAO,UAAU,oBAAoB;AACpD,QAAM,sBAAsB,OAAO,uBAAuB;AAE1D,QAAM,UAAU,OAAO,QAAQ,IAAI,aAAa,OAAO,KAAK,IAAI;AAChE,MAAI,SAAS;AACX,UAAM,QAAQ,SAAS;AAAA,MACrB,YAAY,OAAO,cAAc;AAAA,MACjC,WAAW,OAAO;AAAA,MAClB,WAAW,OAAO;AAAA,MAClB,OAAO;AAAA,MACP,MAAM;AAAA,QACJ,MAAM,OAAO,KAAK,MAAM,GAAG,GAAG;AAAA,QAC9B,UAAU,OAAO,QAAQ;AAAA,MAC3B;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,QAAQ,IAAI,gBAAgB;AAClC,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,YAAY;AAAA,IAChB,MAAM,MAAM,MAAM,IAAI,MAAM,6BAA6B,CAAC;AAAA,IAC1D;AAAA,EACF;AAEA,QAAM,QAA6C,CAAC;AACpD,MAAI,QAAQ,OAAO;AACnB,MAAI,cAA6B;AACjC,MAAI,mBAAiC,EAAE,MAAM,MAAM;AACnD,MAAI;AACJ,MAAI,YAAY;AAChB,MAAI,sBAAsB;AAE1B,MAAI;AACF,aAAS,OAAO,GAAG,QAAQ,UAAU,QAAQ;AAC3C,UAAI,MAAM,OAAO,SAAS;AACxB,uBAAe;AACf;AAAA,MACF;AAEA,YAAM,YAAY,KAAK,IAAI;AAC3B,YAAM,aAAa,UAAU,MAAM,QAAQ,KAAK,EAAE,MAAM,QAAQ,MAAM,QAAQ,IAAI,GAAG,CAAC,IAAI;AAG1F,UAAI;AACJ,UAAI;AACF,qBAAa,MAAM,OAAO,QAAQ;AAAA,UAChC;AAAA,UACA,MAAM,OAAO;AAAA,UACb;AAAA,UACA;AAAA,UACA,aAAa,MAAM;AAAA,UACnB,SAAS,WAAW;AAAA,QACtB,CAAC;AAAA,MACH,SAAS,KAAK;AACZ,cAAM,YAAY,KAAK,eAAe,QAAQ,MAAM,OAAO,GAAG,CAAC;AAC/D,uBAAe;AACf,cAAM;AAAA,MACR;AACA,cAAQ,WAAW;AACnB,YAAM,eAAe,WAAW;AAGhC,UAAI;AACJ,UAAI;AACF,uBAAe,MAAM,OAAO,OAAO,KAAK;AAAA,MAC1C,SAAS,KAAK;AACZ,cAAM,YAAY,KAAK,eAAe,QAAQ,MAAM,OAAO,GAAG,CAAC;AAC/D,uBAAe;AACf,cAAM;AAAA,MACR;AACA,yBAAmB;AAGnB,YAAM,iBAAiB,MAAM,OAAO,KAAK;AACzC,YAAM,qBAAqB;AAAA,QACzB,MAAM,aAAa;AAAA,QACnB,OAAO,aAAa;AAAA,QACpB,eAAe,aAAa,iBAAiB,CAAC;AAAA,MAChD;AAEA,UAAI;AACJ,UAAI,kBAAkB;AACtB,UAAI;AAEJ,UAAI,aAAa,MAAM;AACrB,iBAAS;AAAA,UACP,cAAc;AAAA,UACd,WAAW;AAAA,UACX,qBAAqB;AAAA,UACrB,gBAAgB;AAAA,UAChB,YAAY;AAAA,QACd;AAAA,MACF,OAAO;AACL,YAAI;AACF,mBAAS,MAAM,OAAO,OAAO;AAAA,YAC3B;AAAA,YACA,MAAM,OAAO;AAAA,YACb;AAAA,YACA;AAAA,YACA;AAAA,YACA,QAAQ;AAAA,UACV,CAAC;AACD,mBAAS,aAAa,MAAM;AAAA,QAC9B,SAAS,KAAK;AACZ,4BAAkB;AAClB,wBAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC7D,gBAAM,kBACJ,eAAe,SAAS,IACpB,eAAe,eAAe,SAAS,CAAC,EAAG,sBAC3C;AACN,mBAAS;AAAA,YACP,cAAc;AAAA,YACd,WAAW;AAAA,YACX,qBAAqB;AAAA,YACrB,gBAAgB;AAAA,YAChB,YAAY;AAAA,UACd;AAAA,QACF;AAAA,MACF;AAEA,YAAM,QAA2B;AAAA,QAC/B;AAAA,QACA,WAAW,KAAK,IAAI;AAAA,QACpB,GAAG;AAAA,QACH,cAAc;AAAA,MAChB;AACA,YAAM,OAAO,OAAO,KAAK;AAEzB,YAAM,aAAgD;AAAA,QACpD;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY,KAAK,IAAI,IAAI;AAAA,MAC3B;AACA,YAAM,KAAK,UAAU;AAErB,YAAM,YAAY,IAAI;AAAA,QACpB,YAAY;AAAA,UACV,kBAAkB,aAAa;AAAA,UAC/B,mBAAmB,aAAa,SAAS;AAAA,UACzC,sBAAsB,OAAO;AAAA,UAC7B,kBAAkB,OAAO;AAAA,UACzB;AAAA,QACF;AAAA,MACF,CAAgC;AAGhC,UAAI,aAAa,MAAM;AACrB,oBAAY;AACZ;AAAA,MACF;AACA,UAAI,CAAC,OAAO,gBAAgB;AAC1B;AAAA,MACF;AACA,UAAI,wBAAwB,KAAK,OAAO,cAAc,iBAAiB;AACrE,+BAAuB;AACvB,YAAI,uBAAuB,sBAAuB;AAAA,MACpD,OAAO;AACL,8BAAsB;AAAA,MACxB;AAEA,oBAAc;AAAA,IAChB;AAEA,QAAI,CAAC,aAAa,CAAC,cAAc;AAC/B,qBAAe,MAAM,UAAU,WAAW,oBAAoB;AAAA,IAChE;AAAA,EACF,UAAE;AACA,iBAAa,SAAS;AAAA,EACxB;AAEA,QAAM,QAAQ,iBAAiB,OAC3B,IACA,OAAO,iBAAiB,UAAU,WAChC,iBAAiB,QACjB;AAEN,MAAI,SAAS;AACX,UAAM,QAAQ,OAAO;AAAA,MACnB,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA,OAAO,GAAG,MAAM,MAAM,wBAAwB,iBAAiB,IAAI;AAAA,IACrE,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,OAAO,SAAS,SAAS;AAAA,IACzB;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ,mBAAmB;AAAA,IACnB;AAAA,IACA,QAAQ,KAAK,IAAI,IAAI;AAAA,IACrB;AAAA,EACF;AACF;AAcA,IAAM,yBAAyB;AAAA;AAAA;AAAA;AAKxB,SAAS,kBACd,KAC0B;AAC1B,QAAM,cAAc,IAAI,gBAAgB,CAAC,MAAa,SAAS,CAAC;AAChE,QAAM,qBACJ,IAAI,uBACH,CAAC,MAA4B,MAAM,SAAY,WAAW,SAAS,CAAC;AACvE,QAAM,SAAS,IAAI,uBACf,GAAG,sBAAsB;AAAA;AAAA,EAAO,IAAI,oBAAoB,KACxD;AAEJ,SAAO,OAAO,UAAU;AACtB,UAAM,cACJ,MAAM,OAAO,WAAW,IACpB,2CACA,MAAM,OACH;AAAA,MAAI,CAAC,MACJ;AAAA,QACE,QAAQ,EAAE,IAAI,6BAAwB,EAAE,aAAa,IAAI,MACtD,OAAO,EAAE,aAAa,UAAU,WAC7B,UAAU,EAAE,aAAa,MAAM,QAAQ,CAAC,CAAC,KACzC,MACJ,eAAe,EAAE,WAAW,QAAQ,CAAC,CAAC,cAAc,EAAE,aAAa,iBAAiB,CAAC,GAAG,KAAK,GAAG,CAAC;AAAA,QACnG,mBAAmB,EAAE,aAAa,MAAM,GAAG,GAAG,CAAC;AAAA,QAC/C,gBAAgB,EAAE,UAAU,MAAM,GAAG,GAAG,CAAC;AAAA,QACzC,wBAAwB,EAAE,oBAAoB,MAAM,GAAG,GAAG,CAAC;AAAA,MAC7D,EAAE,KAAK,IAAI;AAAA,IACb,EACC,KAAK,MAAM;AAEpB,UAAM,OAAO;AAAA,MACX;AAAA,MACA,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA,OAAO,MAAM,IAAI;AAAA,MACjB;AAAA,MACA;AAAA,MACA,YAAY,MAAM,KAAK;AAAA,MACvB;AAAA,MACA;AAAA,MACA,mBAAmB,MAAM,YAAY;AAAA,MACrC;AAAA,MACA;AAAA,MACA,sBAAsB,MAAM,YAAY;AAAA,MACxC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,KAAK,IAAI;AAEX,UAAM,MAAM,MAAM,IAAI,SAAS,EAAE,QAAQ,KAAK,CAAC;AAC/C,WAAO,aAAa,GAAsB;AAAA,EAC5C;AACF;AAIA,SAAS,aAAa,KAAiD;AACrE,MAAI,CAAC,OAAO,OAAO,QAAQ,UAAU;AACnC,UAAM,IAAI,MAAM,8BAA8B;AAAA,EAChD;AACA,QAAM,eAAe,OAAO,IAAI,iBAAiB,WAAW,IAAI,eAAe;AAC/E,QAAM,YAAY,OAAO,IAAI,cAAc,WAAW,IAAI,YAAY;AACtE,QAAM,sBACJ,OAAO,IAAI,wBAAwB,WAAW,IAAI,sBAAsB;AAC1E,MAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,qBAAqB;AACvD,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AACA,MAAI,OAAO,IAAI,mBAAmB,WAAW;AAC3C,UAAM,IAAI,MAAM,yCAAyC;AAAA,EAC3D;AACA,QAAM,gBAAgB,OAAO,IAAI,UAAU;AAC3C,MAAI,CAAC,OAAO,SAAS,aAAa,GAAG;AACnC,UAAM,IAAI,MAAM,gCAAgC;AAAA,EAClD;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA,gBAAgB,IAAI;AAAA,IACpB,YAAY,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,aAAa,CAAC;AAAA,EACpD;AACF;AAEA,SAAS,sBAAsB,GAAyB;AACtD,QAAM,SACJ,QAAQ,EAAE,IAAI,MACb,OAAO,EAAE,UAAU,WAAW,UAAU,EAAE,MAAM,QAAQ,CAAC,CAAC,KAAK,OAC/D,EAAE,iBAAiB,EAAE,cAAc,SAAS,IACzC,aAAa,EAAE,cAAc,KAAK,IAAI,CAAC,MACvC;AACN,QAAM,UAAU,EAAE,YAAY,SAAY,KAAK;AAAA,EAAK,SAAS,EAAE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;AACtF,SAAO,SAAS;AAClB;AAEA,SAAS,SAAS,GAAoB;AACpC,MAAI;AACF,WAAO,KAAK,UAAU,GAAG,MAAM,CAAC;AAAA,EAClC,QAAQ;AACN,WAAO,OAAO,CAAC;AAAA,EACjB;AACF;;;ACzdA,IAAMA,gCACJ;AAEF,eAAsB,8BACpB,QAOA;AACA,QAAM,WAAW,OAAO,YAAY;AACpC,QAAM,kBAAkB,OAAO,mBAAmB;AAClD,QAAM,wBAAwB,OAAO,yBAAyB;AAC9D,QAAM,SAAS,OAAO,UAAU,oBAAoB;AACpD,QAAM,sBAAsB,OAAO,uBAAuBA;AAC1D,QAAM,+BACJ,OAAO,gCAAgC;AACzC,MAAI,sBAAsB;AAE1B,MAAI,UAAqD;AAAA,IACvD,MAAM;AAAA,IACN,OAAO,OAAO;AAAA,IACd,aAAa;AAAA,IACb,cAAc,EAAE,MAAM,MAAM;AAAA,IAC5B,QAAQ,MAAM,OAAO,KAAK;AAAA,IAC1B,WAAW;AAAA,IACX,iBAAiB;AAAA,EACnB;AAEA,SAAO,oBAAoB;AAAA,IACzB,QAAQ,OAAO;AAAA,IACf,QAAQ,EAAE,UAAU,UAAU,WAAW,OAAO,UAAU;AAAA,IAC1D,OAAO,OAAO;AAAA,IACd,YAAY,OAAO,cAAc;AAAA,IACjC,WAAW,OAAO;AAAA,IAClB,WAAW,OAAO;AAAA,IAClB,eAAe,OAAO,iBAAiB;AAAA,IACvC,SAAS,MAAM;AAAA,IACf,UAAU,CAAC,EAAE,MAAM,MAAM;AAAA,MACvB,cAAc;AAAA,QACZ,IAAI;AAAA,QACJ,QAAQ,MAAM,aAAa;AAAA,QAC3B,OAAO,MAAM,aAAa;AAAA,QAC1B,UAAU;AAAA,QACV,QAAQ,MAAM,aAAa,OACvB,wBACA,sBAAsB,MAAM,aAAa,eAAe,SAAS,KAAK,MAAM,aAAa,cAAc,KAAK,IAAI,CAAC,KAAK,EAAE;AAAA,MAC9H,CAAC;AAAA,IACH;AAAA,IACA,YAAY,CAAC,EAAE,MAAM,MAAM;AACzB,UAAI,MAAM,aAAa,MAAM;AAC3B,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,OAAO,MAAM,aAAa;AAAA,QAC5B;AAAA,MACF;AACA,UAAI,MAAM,WAAW;AACnB,eAAO;AAAA,UACL,MAAM;AAAA,UACN,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,OAAO,MAAM,aAAa;AAAA,UAC1B,cAAc,6BAA6B,MAAM,YAAY;AAAA,QAC/D;AAAA,MACF;AACA,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,OAAO,MAAM,aAAa;AAAA,MAC5B;AAAA,IACF;AAAA,IACA,QAAQ,CAAC,EAAE,MAAM,OAAO;AAAA,MACtB,MAAM;AAAA,MACN,QAAQ,EAAE,MAAM,uBAAuB,MAAM,MAAM,OAAO,EAAE;AAAA,MAC5D,QAAQ,MAAM,aAAa,uBAAuB;AAAA,IACpD;AAAA,IACA,KAAK,OAAO,QAAQ,QAAQ;AAC1B,YAAM,OAAO,OAAO;AACpB,YAAM,aAA4C,MAAM,OAAO,QAAQ;AAAA,QACrE;AAAA,QACA,MAAM,OAAO;AAAA,QACb,OAAO,QAAQ;AAAA,QACf,aAAa,QAAQ;AAAA,QACrB,aAAa,IAAI;AAAA,QACjB,SAAS,IAAI;AAAA,MACf,CAAC;AAED,YAAM,YAAY,WAAW;AAC7B,YAAM,eAAe,MAAM,OAAO,OAAO,SAAS;AAClD,UAAI,SAAwB;AAC5B,UAAI,kBAAkB;AACtB,UAAI;AACJ,UAAI,iBAAiB,CAAC,aAAa;AAEnC,UAAI,CAAC,aAAa,MAAM;AACtB,YAAI;AACF,mBAAS,MAAM,OAAO,OAAO;AAAA,YAC3B;AAAA,YACA,MAAM,OAAO;AAAA,YACb,OAAO;AAAA,YACP;AAAA,YACA,cAAc,WAAW;AAAA,YACzB,QAAQ,MAAM,OAAO,KAAK;AAAA,UAC5B,CAAC;AACD,4BAAkB;AAClB,2BAAiB,OAAO;AACxB,gCAAsB,OAAO,cAAc,kBAAkB,sBAAsB,IAAI;AACvF,cAAI,wBAAwB,KAAK,uBAAuB;AACtD,6BAAiB;AAAA,QACrB,SAAS,KAAK;AACZ,wBAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC7D,mBAAS,QAAQ,eAAe;AAAA,YAC9B,cAAc;AAAA,YACd,WAAW;AAAA,YACX,qBAAqB;AAAA,YACrB,gBAAgB;AAAA,YAChB,YAAY;AAAA,UACd;AACA,2BAAiB;AAAA,QACnB;AAAA,MACF,OAAO;AACL,iBAAS;AAAA,UACP,cAAc;AAAA,UACd,WAAW;AAAA,UACX,qBAAqB;AAAA,UACrB,gBAAgB;AAAA,UAChB,YAAY;AAAA,QACd;AAAA,MACF;AAEA,YAAM,QAA2B;AAAA,QAC/B,GAAI,UAAU;AAAA,UACZ,cAAc;AAAA,UACd,WAAW;AAAA,UACX,qBAAqB;AAAA,UACrB;AAAA,UACA,YAAY;AAAA,QACd;AAAA,QACA;AAAA,QACA,WAAW,KAAK,IAAI;AAAA,QACpB,cAAc;AAAA,UACZ,MAAM,aAAa;AAAA,UACnB,OAAO,aAAa;AAAA,UACpB,eAAe,aAAa;AAAA,QAC9B;AAAA,MACF;AACA,YAAM,OAAO,OAAO,KAAK;AAEzB,gBAAU;AAAA,QACR;AAAA,QACA,OAAO;AAAA,QACP,aAAa;AAAA,QACb;AAAA,QACA,cAAc,WAAW;AAAA,QACzB,QAAQ,MAAM,OAAO,KAAK;AAAA,QAC1B,WAAW,aAAa,QAAQ,CAAC;AAAA,QACjC;AAAA,QACA;AAAA,MACF;AAEA,aAAO;AAAA,QACL,OAAO;AAAA,QACP;AAAA,QACA,cAAc,WAAW;AAAA,QACzB;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAEO,SAAS,oCACd,cAC0B;AAC1B,MAAI,aAAa,KAAM,QAAO;AAC9B,SAAO,aAAa,eAAe,SAAS,0BAA0B;AACxE;","names":["DEFAULT_FALLBACK_INSTRUCTION"]}

package/dist/chunk-GSH6QNNS.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/eval-campaign.ts"],"sourcesContent":["/**\n * EvalCampaign — opinionated matrix runner that wires the four\n * capture-integrity directives by construction.\n *\n * The canonical benchmark shape — matrix runner → for each\n * (variant, scenario, seed) → start a TraceEmitter → call LLMs → end the\n * run → analyze — has a bug class at the integration boundary: raw\n * events not captured, route silently wrong, integrity not asserted,\n * analyst never run. The directives in `SKILL.md § Capture integrity`\n * are the mitigations.\n *\n * `EvalCampaign` is the structural fix — consumers don't wire the\n * integrity surface themselves; the campaign owns it. Specifically:\n *\n *   - calls `assertLlmRoute` once at preflight before any work runs\n *   - constructs a per-run `TraceStore` and `RawProviderSink` via factories\n *   - constructs the `TraceEmitter` with `onRunComplete: [analyst hook]`\n *   - hands the runner an `LlmClientOptions` pre-wired with the sink and\n *     trace context — the runner can't accidentally call an LLM without\n *     capturing the raw HTTP envelope\n *   - calls `assertRunCaptured` after every `endRun` and routes failures\n *     through a configurable policy (`throw` / `mark_failed` / `log`)\n *   - assembles per-run `RunRecord`s and runs `researchReport` at the end\n *     so the campaign artifact is launch-decision-grade by default\n *   - embeds the campaign fingerprint (a SHA-256 over the canonicalised\n *     run set) and optional `preregistrationHash` in the report\n *\n * The runner contract is intentionally narrow: produce a `CampaignRunOutcome`\n * given a fully-wired `CampaignRunContext`. Everything orchestration-shaped\n * lives in the campaign. This is the inversion-of-control point — consumers\n * stop writing matrix runners and start writing scenario-runners.\n *\n * Out of scope for v1 (tracked in `docs/research-report-methodology.md`):\n *\n *   - Distributed/cluster execution (concurrency is local async)\n *   - Adaptive sampling / sequential interim looks\n *   - Resume from partial state across crashes\n *   - LLM-call retry beyond what `LlmClient` already does\n */\n\nimport {\n  type AgentProfileCell,\n  type AgentProfileCellInput,\n  buildAgentProfileCell,\n  verifyAgentProfileCell,\n} from './agent-profile-cell'\nimport { assertLlmRoute, type LlmClientOptions, type LlmRouteRequirements } from './llm-client'\nimport { canonicalize, hashJson } from './pre-registration'\nimport type {\n  JudgeScoresRecord,\n  RunJudgeMetadata,\n  RunOutcome,\n  RunRecord,\n  RunSplitTag,\n  RunTokenUsage,\n} from './run-record'\nimport { validateRunRecord } from './run-record'\nimport { type ResearchReport, type ResearchReportOptions, researchReport } from './summary-report'\nimport type { RunCompleteHook } from './trace/emitter'\nimport { TraceEmitter } from './trace/emitter'\nimport {\n  assertRunCaptured,\n  RunIntegrityError,\n  type RunIntegrityExpectations,\n  type RunIntegrityReport,\n} from './trace/integrity'\nimport { FileSystemRawProviderSink, type RawProviderSink } from './trace/raw-provider-sink'\nimport type { FailureClass } from './trace/schema'\nimport type { TraceStore } from './trace/store'\n\n// ── Public types ─────────────────────────────────────────────────────────\n\nexport interface CampaignVariant<V> {\n  id: string\n  payload: V\n}\n\nexport interface CampaignScenario {\n  scenarioId: string\n  /** Free-form metadata propagated to runs and reports. */\n  tags?: Record<string, string>\n}\n\nexport interface CampaignRunContext<V> {\n  /** Stable run id. The campaign generates this; the runner does not. */\n  runId: string\n  /** Logical experiment id (campaignId by default; overridable per-run via opts). */\n  experimentId: string\n  variant: V\n  variantId: string\n  scenarioId: string\n  scenarioTags: Record<string, string>\n  seed: number\n  splitTag: RunSplitTag\n  /**\n   * The TraceEmitter for this run, with `onRunComplete` hooks pre-wired\n   * (analyst auto-execution if configured, plus integrity check). The\n   * runner MUST call `emitter.startRun` before doing any work and either\n   * `emitter.endRun` or `emitter.abortRun` before returning.\n   */\n  emitter: TraceEmitter\n  store: TraceStore\n  rawSink: RawProviderSink\n  /**\n   * Pre-wired LLM client options — `rawSink` and `traceContext` are populated\n   * so any `callLlm(req, ctx.llmOpts)` automatically captures raw HTTP. The\n   * runner can spread additional fields if needed.\n   */\n  llmOpts: LlmClientOptions\n}\n\nexport interface CampaignRunOutcome {\n  /** Did the run pass? Mirrors `RunOutcome.pass` semantics. */\n  pass: boolean\n  /** Score for the run on its split. Maps to `searchScore` or `holdoutScore`. */\n  score: number\n  /** Mandatory cost in USD. Use 0 + raw.cost_unknown=1 only if truly unknown. */\n  costUsd: number\n  tokenUsage: RunTokenUsage\n  /** Snapshot model id (e.g. `claude-sonnet-4-6@2025-04-15`). */\n  model: string\n  /** sha256 of the effective prompt sent to the model. */\n  promptHash: string\n  /** sha256 of the effective config (model, temperature, tools, judges, splits). */\n  configHash: string\n  /** Optional extra numeric metrics to land in `outcome.raw`. */\n  raw?: Record<string, number>\n  /** Canonical cross-agent failure class from the shared `FAILURE_CLASSES`\n   *  taxonomy. Propagated to `RunRecord.failureClass` so campaign runs\n   *  aggregate failures in the same vocabulary as every other producer. */\n  failureClass?: FailureClass\n  /** Optional free-form failure detail, scoped under `failureClass`. */\n  failureMode?: string\n  /** Optional judge metadata when a judge was used. */\n  judgeMetadata?: RunJudgeMetadata\n  /**\n   * Optional per-judge / per-dim breakdown for ensemble-judged runs.\n   * Propagated to `outcome.judgeScores` on the resulting `RunRecord`.\n   * Single-judge or scalar-only runs leave this unset.\n   */\n  judgeScores?: JudgeScoresRecord\n  /**\n   * Agent profile cell observed by the runner. When supplied, it overrides\n   * `EvalCampaignOptions.agentProfile` for this run and must match the\n   * outcome's `model` and `promptHash`.\n   */\n  agentProfile?: AgentProfileCell | AgentProfileCellInput\n}\n\nexport type CampaignRunner<V> = (ctx: CampaignRunContext<V>) => Promise<CampaignRunOutcome>\n\nexport type CampaignIntegrityPolicy = 'throw' | 'mark_failed' | 'log'\n\nexport interface EvalCampaignOptions<V> {\n  /**\n   * Stable id for the campaign. Used as the default `experimentId` on\n   * every run, and folded into the campaign fingerprint.\n   */\n  campaignId: string\n  variants: CampaignVariant<V>[]\n  scenarios: CampaignScenario[]\n  /** Default `[0, 1, 2]`. */\n  seeds?: number[]\n  /** Default `'holdout'` — the split that anchors a launch decision. */\n  splitTag?: RunSplitTag\n  /** Git SHA the campaign is run against. Mandatory; `RunRecord` rejects unset. */\n  commitSha: string\n  /**\n   * LLM client config. Augmented per-run with `rawSink` and `traceContext`\n   * before being passed to the runner. The campaign asserts this config\n   * matches `routeRequirements` once at preflight.\n   */\n  llmOpts: LlmClientOptions\n  /**\n   * Default `{ requireExplicitBaseUrl: true, requireAuth: true }` — fail\n   * loud if the campaign would silently fall back to the public router or\n   * run unauthenticated. Override with an empty object to disable.\n   */\n  routeRequirements?: LlmRouteRequirements\n  /**\n   * Per-run TraceStore factory. Common shape: a fresh store per run keyed\n   * on `runId`. Implementations that share a store across the campaign\n   * are valid — the campaign only writes through `emitter`.\n   */\n  storeFactory: (params: CampaignFactoryParams) => TraceStore\n  /**\n   * Per-run RawProviderSink factory. Defaults to `FileSystemRawProviderSink`\n   * rooted at `${workDir}/raw-events/${runId}` if `workDir` is supplied;\n   * otherwise required. Forensic capture is non-negotiable in a campaign\n   * run — pass `NoopRawProviderSink` explicitly if you want to opt out.\n   */\n  rawSinkFactory?: (params: CampaignFactoryParams) => RawProviderSink\n  /**\n   * Filesystem root for default `rawSinkFactory`. Ignored if\n   * `rawSinkFactory` is supplied.\n   */\n  workDir?: string\n  /**\n   * Extra `onRunComplete` hooks the campaign appends (after its own\n   * integrity-check hook). Pass `traceAnalystOnRunComplete(...)` here.\n   */\n  onRunComplete?: RunCompleteHook[]\n  /**\n   * Per-run integrity expectations. Defaults to:\n   *   `{ llmSpansMin: 1, requireRawCoverageOfLlmSpans: true, requireOutcome: true }`.\n   * Override (e.g. `{ llmSpansMin: 0 }`) for runs that don't call LLMs.\n   */\n  integrity?: RunIntegrityExpectations\n  /** Behaviour when integrity fails. Default `'mark_failed'`. */\n  onIntegrityFailure?: CampaignIntegrityPolicy\n  /**\n   * Per-run runner. Receives a fully-wired context; produces an outcome\n   * the campaign converts into a `RunRecord`.\n   */\n  runner: CampaignRunner<V>\n  /**\n   * If set, the campaign computes `researchReport` at the end. `comparator`\n   * is a `variantId`. Other fields are forwarded verbatim.\n   */\n  report?: { comparator?: string } & Omit<\n    ResearchReportOptions,\n    'comparator' | 'preregistrationHash' | 'generatedAt'\n  >\n  /**\n   * Hash of a signed `HypothesisManifest` (see `pre-registration.ts`).\n   * Embedded in the campaign fingerprint and the research report.\n   */\n  preregistrationHash?: string\n  /** Local concurrency. Default `1` (sequential). */\n  concurrency?: number\n  /**\n   * Override the time source. Tests pass a mock to make wallMs deterministic.\n   */\n  now?: () => number\n  /** Override the runId generator. Tests pin this. */\n  runId?: (params: CampaignFactoryParams) => string\n  /**\n   * Agent profile cell for campaign runs. Static profiles can pass an object;\n   * routers or variant-specific harnesses can pass a factory. The campaign\n   * stamps the built cell onto every `RunRecord` and rejects profile/model or\n   * profile/prompt contradictions.\n   */\n  agentProfile?:\n    | AgentProfileCell\n    | AgentProfileCellInput\n    | ((\n        params: CampaignFactoryParams & {\n          variant: V\n          scenarioTags: Record<string, string>\n        },\n      ) =>\n        | AgentProfileCell\n        | AgentProfileCellInput\n        | Promise<AgentProfileCell | AgentProfileCellInput>)\n}\n\nexport interface CampaignFactoryParams {\n  campaignId: string\n  runId: string\n  variantId: string\n  scenarioId: string\n  seed: number\n}\n\nexport interface FailedRun {\n  runId: string\n  variantId: string\n  scenarioId: string\n  seed: number\n  reason: string\n  error?: string\n}\n\nexport interface EvalCampaignResult {\n  campaignId: string\n  /** SHA-256 over canonicalised `(variantIds, scenarioIds, seeds, comparator, splitTag, baseUrl, provider, preregistrationHash)`. */\n  campaignFingerprint: string\n  preregistrationHash: string | null\n  /** Successful runs only. Failed runs land in `failedRuns`. */\n  runs: RunRecord[]\n  /** Integrity reports for every successful run. */\n  integrityReports: RunIntegrityReport[]\n  failedRuns: FailedRun[]\n  /** Computed when `report` is set on options. */\n  report?: ResearchReport\n  startedAt: string\n  endedAt: string\n}\n\n// ── Implementation ───────────────────────────────────────────────────────\n\nconst DEFAULT_INTEGRITY: RunIntegrityExpectations = {\n  llmSpansMin: 1,\n  requireRawCoverageOfLlmSpans: true,\n  requireOutcome: true,\n}\n\nconst DEFAULT_ROUTE: LlmRouteRequirements = {\n  requireExplicitBaseUrl: true,\n  requireAuth: true,\n}\n\nexport async function runEvalCampaign<V>(\n  opts: EvalCampaignOptions<V>,\n): Promise<EvalCampaignResult> {\n  // ── Preflight ──────────────────────────────────────────────────────\n  assertLlmRoute(opts.llmOpts, opts.routeRequirements ?? DEFAULT_ROUTE)\n\n  if (opts.variants.length === 0) {\n    throw new Error('runEvalCampaign: variants must be non-empty.')\n  }\n  if (opts.scenarios.length === 0) {\n    throw new Error('runEvalCampaign: scenarios must be non-empty.')\n  }\n  const variantIds = new Set<string>()\n  for (const v of opts.variants) {\n    if (variantIds.has(v.id)) {\n      throw new Error(`runEvalCampaign: duplicate variant id \"${v.id}\".`)\n    }\n    variantIds.add(v.id)\n  }\n  const scenarioIds = new Set<string>()\n  for (const s of opts.scenarios) {\n    if (scenarioIds.has(s.scenarioId)) {\n      throw new Error(`runEvalCampaign: duplicate scenarioId \"${s.scenarioId}\".`)\n    }\n    scenarioIds.add(s.scenarioId)\n  }\n  if (opts.report?.comparator && !variantIds.has(opts.report.comparator)) {\n    throw new Error(\n      `runEvalCampaign: report.comparator \"${opts.report.comparator}\" is not a configured variantId.`,\n    )\n  }\n  if (!opts.commitSha) {\n    throw new Error('runEvalCampaign: commitSha is required (every RunRecord needs it).')\n  }\n\n  const seeds = opts.seeds ?? [0, 1, 2]\n  const splitTag: RunSplitTag = opts.splitTag ?? 'holdout'\n  const concurrency = Math.max(1, opts.concurrency ?? 1)\n  const integrity = { ...DEFAULT_INTEGRITY, ...(opts.integrity ?? {}) }\n  const onIntegrityFailure: CampaignIntegrityPolicy = opts.onIntegrityFailure ?? 'mark_failed'\n  const now = opts.now ?? (() => Date.now())\n  const baseUrl = (opts.llmOpts.baseUrl ?? '').replace(/\\/+$/, '')\n  const provider = opts.llmOpts.provider ?? null\n  const preregistrationHash = opts.preregistrationHash ?? null\n\n  const rawSinkFactory = opts.rawSinkFactory ?? defaultRawSinkFactory(opts.workDir)\n\n  // ── Fingerprint ────────────────────────────────────────────────────\n  const campaignFingerprint = await hashJson(\n    canonicalize({\n      campaignId: opts.campaignId,\n      variants: opts.variants.map((v) => v.id).sort(),\n      scenarios: opts.scenarios.map((s) => s.scenarioId).sort(),\n      seeds: [...seeds].sort((a, b) => a - b),\n      splitTag,\n      comparator: opts.report?.comparator ?? null,\n      baseUrl,\n      provider,\n      preregistrationHash,\n    }),\n  )\n\n  // ── Plan the matrix ────────────────────────────────────────────────\n  type Cell = { variant: CampaignVariant<V>; scenario: CampaignScenario; seed: number }\n  const cells: Cell[] = []\n  for (const variant of opts.variants) {\n    for (const scenario of opts.scenarios) {\n      for (const seed of seeds) {\n        cells.push({ variant, scenario, seed })\n      }\n    }\n  }\n\n  const startedAt = new Date(now()).toISOString()\n  const runs: RunRecord[] = []\n  const integrityReports: RunIntegrityReport[] = []\n  const failedRuns: FailedRun[] = []\n\n  // ── Execute (bounded-concurrency worker pool) ──────────────────────\n  let cursor = 0\n  async function worker(): Promise<void> {\n    while (true) {\n      const i = cursor++\n      if (i >= cells.length) return\n      const cell = cells[i]!\n      try {\n        const result = await runOneCell(cell)\n        runs.push(result.record)\n        integrityReports.push(result.integrity)\n      } catch (err) {\n        if (err instanceof CellExecutionError) {\n          failedRuns.push(err.failed)\n          if (err.integrity) integrityReports.push(err.integrity)\n        } else {\n          // Genuine bug — not a runner failure, not an integrity failure.\n          // Surface it; don't silently mask.\n          throw err\n        }\n      }\n    }\n  }\n\n  async function runOneCell(\n    cell: Cell,\n  ): Promise<{ record: RunRecord; integrity: RunIntegrityReport }> {\n    const runId = (opts.runId ?? defaultRunId)({\n      campaignId: opts.campaignId,\n      runId: '', // unused by default generator\n      variantId: cell.variant.id,\n      scenarioId: cell.scenario.scenarioId,\n      seed: cell.seed,\n    })\n    const factoryParams: CampaignFactoryParams = {\n      campaignId: opts.campaignId,\n      runId,\n      variantId: cell.variant.id,\n      scenarioId: cell.scenario.scenarioId,\n      seed: cell.seed,\n    }\n    const store = opts.storeFactory(factoryParams)\n    const rawSink = rawSinkFactory(factoryParams)\n\n    const emitter = new TraceEmitter(store, {\n      runId,\n      now: opts.now,\n      onRunComplete: opts.onRunComplete,\n    })\n\n    const llmOpts: LlmClientOptions = {\n      ...opts.llmOpts,\n      rawSink,\n      traceContext: { runId },\n    }\n\n    const ctx: CampaignRunContext<V> = {\n      runId,\n      experimentId: opts.campaignId,\n      variant: cell.variant.payload,\n      variantId: cell.variant.id,\n      scenarioId: cell.scenario.scenarioId,\n      scenarioTags: cell.scenario.tags ?? {},\n      seed: cell.seed,\n      splitTag,\n      emitter,\n      store,\n      rawSink,\n      llmOpts,\n    }\n\n    const wallStart = now()\n    let outcome: CampaignRunOutcome\n    try {\n      outcome = await opts.runner(ctx)\n    } catch (err) {\n      const message = err instanceof Error ? err.message : String(err)\n      // The runner threw mid-execution; give it a chance to have aborted.\n      try {\n        await emitter.abortRun(message)\n      } catch {\n        // Already aborted/ended; ignore.\n      }\n      throw new CellExecutionError({\n        runId,\n        variantId: cell.variant.id,\n        scenarioId: cell.scenario.scenarioId,\n        seed: cell.seed,\n        reason: 'runner_threw',\n        error: message,\n      })\n    }\n    const wallMs = now() - wallStart\n\n    const integrityReport = await assertRunCaptured(store, runId, { ...integrity, rawSink })\n    if (!integrityReport.ok) {\n      switch (onIntegrityFailure) {\n        case 'throw':\n          throw new RunIntegrityError(integrityReport)\n        case 'mark_failed':\n          throw new CellExecutionError(\n            {\n              runId,\n              variantId: cell.variant.id,\n              scenarioId: cell.scenario.scenarioId,\n              seed: cell.seed,\n              reason: 'integrity_failed',\n              error: integrityReport.issues.map((i) => i.code).join(', '),\n            },\n            integrityReport,\n          )\n        case 'log':\n          // Caller wants the run admitted with a flagged report; fall through.\n          break\n      }\n    }\n\n    const recordOutcome: RunOutcome = {\n      raw: outcome.raw ?? {},\n    }\n    if (splitTag === 'holdout') recordOutcome.holdoutScore = outcome.score\n    else recordOutcome.searchScore = outcome.score\n    if (outcome.judgeScores !== undefined) recordOutcome.judgeScores = outcome.judgeScores\n\n    const record: RunRecord = {\n      runId,\n      experimentId: opts.campaignId,\n      candidateId: cell.variant.id,\n      seed: cell.seed,\n      model: outcome.model,\n      promptHash: outcome.promptHash,\n      configHash: outcome.configHash,\n      commitSha: opts.commitSha,\n      wallMs,\n      costUsd: outcome.costUsd,\n      tokenUsage: outcome.tokenUsage,\n      judgeMetadata: outcome.judgeMetadata,\n      outcome: recordOutcome,\n      ...(outcome.failureClass ? { failureClass: outcome.failureClass } : {}),\n      failureMode: outcome.failureMode,\n      splitTag,\n      scenarioId: cell.scenario.scenarioId,\n    }\n    const profileSource =\n      outcome.agentProfile ??\n      (typeof opts.agentProfile === 'function'\n        ? await opts.agentProfile({\n            campaignId: opts.campaignId,\n            runId,\n            variantId: cell.variant.id,\n            scenarioId: cell.scenario.scenarioId,\n            seed: cell.seed,\n            variant: cell.variant.payload,\n            scenarioTags: cell.scenario.tags ?? {},\n          })\n        : opts.agentProfile)\n    if (profileSource !== undefined) {\n      const agentProfile = await resolveAgentProfileCell(profileSource)\n      assertAgentProfileMatchesRun(agentProfile, outcome.model, outcome.promptHash)\n      record.agentProfile = agentProfile\n    }\n    return { record: validateRunRecord(record), integrity: integrityReport }\n  }\n\n  const workers = Array.from({ length: Math.min(concurrency, cells.length) }, () => worker())\n  await Promise.all(workers)\n\n  // ── Optional research report ───────────────────────────────────────\n  let report: ResearchReport | undefined\n  if (opts.report) {\n    const reportOpts: ResearchReportOptions = {\n      ...opts.report,\n      comparator: opts.report.comparator,\n      split: splitTag === 'dev' ? 'search' : splitTag,\n      generatedAt: new Date(now()).toISOString(),\n      preregistrationHash: preregistrationHash ?? undefined,\n    }\n    report = await researchReport(runs, reportOpts)\n  }\n\n  const endedAt = new Date(now()).toISOString()\n\n  return {\n    campaignId: opts.campaignId,\n    campaignFingerprint,\n    preregistrationHash,\n    runs,\n    integrityReports,\n    failedRuns,\n    report,\n    startedAt,\n    endedAt,\n  }\n}\n\n// ── Internal ─────────────────────────────────────────────────────────────\n\nclass CellExecutionError extends Error {\n  readonly failed: FailedRun\n  readonly integrity?: RunIntegrityReport\n  constructor(failed: FailedRun, integrity?: RunIntegrityReport) {\n    super(`cell ${failed.variantId}/${failed.scenarioId}@${failed.seed} failed: ${failed.reason}`)\n    this.failed = failed\n    this.integrity = integrity\n  }\n}\n\nfunction defaultRawSinkFactory(workDir: string | undefined) {\n  return (params: CampaignFactoryParams): RawProviderSink => {\n    if (!workDir) {\n      throw new Error(\n        'runEvalCampaign: rawSinkFactory not supplied and workDir not set. Pass either to enable raw provider capture, or pass `new NoopRawProviderSink()` via rawSinkFactory to opt out explicitly.',\n      )\n    }\n    return new FileSystemRawProviderSink({\n      dir: `${workDir}/raw-events/${params.runId}`,\n    })\n  }\n}\n\nasync function resolveAgentProfileCell(\n  input: AgentProfileCell | AgentProfileCellInput,\n): Promise<AgentProfileCell> {\n  if (isAgentProfileCell(input)) {\n    if (!(await verifyAgentProfileCell(input))) {\n      throw new Error(`runEvalCampaign: agentProfile.cellId does not match its content`)\n    }\n    return input\n  }\n  return buildAgentProfileCell(input)\n}\n\nfunction isAgentProfileCell(\n  input: AgentProfileCell | AgentProfileCellInput,\n): input is AgentProfileCell {\n  return 'schemaVersion' in input && 'cellId' in input\n}\n\nfunction assertAgentProfileMatchesRun(\n  profile: AgentProfileCell,\n  model: string,\n  promptHash: string,\n): void {\n  if (profile.model !== undefined && profile.model !== model) {\n    throw new Error(\n      `runEvalCampaign: agentProfile.model \"${profile.model}\" does not match outcome.model \"${model}\"`,\n    )\n  }\n  if (profile.promptHash !== undefined && profile.promptHash !== promptHash) {\n    throw new Error(\n      `runEvalCampaign: agentProfile.promptHash \"${profile.promptHash}\" does not match outcome.promptHash \"${promptHash}\"`,\n    )\n  }\n}\n\nfunction defaultRunId(params: CampaignFactoryParams): string {\n  // Stable across re-runs: fingerprint of (campaignId, variantId, scenarioId, seed).\n  // Caller can override via opts.runId for non-deterministic IDs.\n  const base = `${params.campaignId}::${params.variantId}::${params.scenarioId}::${params.seed}`\n  // Lightweight hex: we don't need crypto-grade here, just stability + uniqueness.\n  let h1 = 0x811c9dc5\n  let h2 = 0x12345678\n  for (let i = 0; i < base.length; i++) {\n    const c = base.charCodeAt(i)\n    h1 = Math.imul(h1 ^ c, 0x01000193) >>> 0\n    h2 = Math.imul(h2 ^ c, 0x9e3779b1) >>> 0\n  }\n  return `run-${h1.toString(16).padStart(8, '0')}${h2.toString(16).padStart(8, '0')}`\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAmSA,IAAM,oBAA8C;AAAA,EAClD,aAAa;AAAA,EACb,8BAA8B;AAAA,EAC9B,gBAAgB;AAClB;AAEA,IAAM,gBAAsC;AAAA,EAC1C,wBAAwB;AAAA,EACxB,aAAa;AACf;AAEA,eAAsB,gBACpB,MAC6B;AAE7B,iBAAe,KAAK,SAAS,KAAK,qBAAqB,aAAa;AAEpE,MAAI,KAAK,SAAS,WAAW,GAAG;AAC9B,UAAM,IAAI,MAAM,8CAA8C;AAAA,EAChE;AACA,MAAI,KAAK,UAAU,WAAW,GAAG;AAC/B,UAAM,IAAI,MAAM,+CAA+C;AAAA,EACjE;AACA,QAAM,aAAa,oBAAI,IAAY;AACnC,aAAW,KAAK,KAAK,UAAU;AAC7B,QAAI,WAAW,IAAI,EAAE,EAAE,GAAG;AACxB,YAAM,IAAI,MAAM,0CAA0C,EAAE,EAAE,IAAI;AAAA,IACpE;AACA,eAAW,IAAI,EAAE,EAAE;AAAA,EACrB;AACA,QAAM,cAAc,oBAAI,IAAY;AACpC,aAAW,KAAK,KAAK,WAAW;AAC9B,QAAI,YAAY,IAAI,EAAE,UAAU,GAAG;AACjC,YAAM,IAAI,MAAM,0CAA0C,EAAE,UAAU,IAAI;AAAA,IAC5E;AACA,gBAAY,IAAI,EAAE,UAAU;AAAA,EAC9B;AACA,MAAI,KAAK,QAAQ,cAAc,CAAC,WAAW,IAAI,KAAK,OAAO,UAAU,GAAG;AACtE,UAAM,IAAI;AAAA,MACR,uCAAuC,KAAK,OAAO,UAAU;AAAA,IAC/D;AAAA,EACF;AACA,MAAI,CAAC,KAAK,WAAW;AACnB,UAAM,IAAI,MAAM,oEAAoE;AAAA,EACtF;AAEA,QAAM,QAAQ,KAAK,SAAS,CAAC,GAAG,GAAG,CAAC;AACpC,QAAM,WAAwB,KAAK,YAAY;AAC/C,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK,eAAe,CAAC;AACrD,QAAM,YAAY,EAAE,GAAG,mBAAmB,GAAI,KAAK,aAAa,CAAC,EAAG;AACpE,QAAM,qBAA8C,KAAK,sBAAsB;AAC/E,QAAM,MAAM,KAAK,QAAQ,MAAM,KAAK,IAAI;AACxC,QAAM,WAAW,KAAK,QAAQ,WAAW,IAAI,QAAQ,QAAQ,EAAE;AAC/D,QAAM,WAAW,KAAK,QAAQ,YAAY;AAC1C,QAAM,sBAAsB,KAAK,uBAAuB;AAExD,QAAM,iBAAiB,KAAK,kBAAkB,sBAAsB,KAAK,OAAO;AAGhF,QAAM,sBAAsB,MAAM;AAAA,IAChC,aAAa;AAAA,MACX,YAAY,KAAK;AAAA,MACjB,UAAU,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK;AAAA,MAC9C,WAAW,KAAK,UAAU,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK;AAAA,MACxD,OAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAAA,MACtC;AAAA,MACA,YAAY,KAAK,QAAQ,cAAc;AAAA,MACvC;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAIA,QAAM,QAAgB,CAAC;AACvB,aAAW,WAAW,KAAK,UAAU;AACnC,eAAW,YAAY,KAAK,WAAW;AACrC,iBAAW,QAAQ,OAAO;AACxB,cAAM,KAAK,EAAE,SAAS,UAAU,KAAK,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAEA,QAAM,YAAY,IAAI,KAAK,IAAI,CAAC,EAAE,YAAY;AAC9C,QAAM,OAAoB,CAAC;AAC3B,QAAM,mBAAyC,CAAC;AAChD,QAAM,aAA0B,CAAC;AAGjC,MAAI,SAAS;AACb,iBAAe,SAAwB;AACrC,WAAO,MAAM;AACX,YAAM,IAAI;AACV,UAAI,KAAK,MAAM,OAAQ;AACvB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI;AACF,cAAM,SAAS,MAAM,WAAW,IAAI;AACpC,aAAK,KAAK,OAAO,MAAM;AACvB,yBAAiB,KAAK,OAAO,SAAS;AAAA,MACxC,SAAS,KAAK;AACZ,YAAI,eAAe,oBAAoB;AACrC,qBAAW,KAAK,IAAI,MAAM;AAC1B,cAAI,IAAI,UAAW,kBAAiB,KAAK,IAAI,SAAS;AAAA,QACxD,OAAO;AAGL,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,iBAAe,WACb,MAC+D;AAC/D,UAAM,SAAS,KAAK,SAAS,cAAc;AAAA,MACzC,YAAY,KAAK;AAAA,MACjB,OAAO;AAAA;AAAA,MACP,WAAW,KAAK,QAAQ;AAAA,MACxB,YAAY,KAAK,SAAS;AAAA,MAC1B,MAAM,KAAK;AAAA,IACb,CAAC;AACD,UAAM,gBAAuC;AAAA,MAC3C,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,WAAW,KAAK,QAAQ;AAAA,MACxB,YAAY,KAAK,SAAS;AAAA,MAC1B,MAAM,KAAK;AAAA,IACb;AACA,UAAM,QAAQ,KAAK,aAAa,aAAa;AAC7C,UAAM,UAAU,eAAe,aAAa;AAE5C,UAAM,UAAU,IAAI,aAAa,OAAO;AAAA,MACtC;AAAA,MACA,KAAK,KAAK;AAAA,MACV,eAAe,KAAK;AAAA,IACtB,CAAC;AAED,UAAM,UAA4B;AAAA,MAChC,GAAG,KAAK;AAAA,MACR;AAAA,MACA,cAAc,EAAE,MAAM;AAAA,IACxB;AAEA,UAAM,MAA6B;AAAA,MACjC;AAAA,MACA,cAAc,KAAK;AAAA,MACnB,SAAS,KAAK,QAAQ;AAAA,MACtB,WAAW,KAAK,QAAQ;AAAA,MACxB,YAAY,KAAK,SAAS;AAAA,MAC1B,cAAc,KAAK,SAAS,QAAQ,CAAC;AAAA,MACrC,MAAM,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,UAAM,YAAY,IAAI;AACtB,QAAI;AACJ,QAAI;AACF,gBAAU,MAAM,KAAK,OAAO,GAAG;AAAA,IACjC,SAAS,KAAK;AACZ,YAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAE/D,UAAI;AACF,cAAM,QAAQ,SAAS,OAAO;AAAA,MAChC,QAAQ;AAAA,MAER;AACA,YAAM,IAAI,mBAAmB;AAAA,QAC3B;AAAA,QACA,WAAW,KAAK,QAAQ;AAAA,QACxB,YAAY,KAAK,SAAS;AAAA,QAC1B,MAAM,KAAK;AAAA,QACX,QAAQ;AAAA,QACR,OAAO;AAAA,MACT,CAAC;AAAA,IACH;AACA,UAAM,SAAS,IAAI,IAAI;AAEvB,UAAM,kBAAkB,MAAM,kBAAkB,OAAO,OAAO,EAAE,GAAG,WAAW,QAAQ,CAAC;AACvF,QAAI,CAAC,gBAAgB,IAAI;AACvB,cAAQ,oBAAoB;AAAA,QAC1B,KAAK;AACH,gBAAM,IAAI,kBAAkB,eAAe;AAAA,QAC7C,KAAK;AACH,gBAAM,IAAI;AAAA,YACR;AAAA,cACE;AAAA,cACA,WAAW,KAAK,QAAQ;AAAA,cACxB,YAAY,KAAK,SAAS;AAAA,cAC1B,MAAM,KAAK;AAAA,cACX,QAAQ;AAAA,cACR,OAAO,gBAAgB,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,IAAI;AAAA,YAC5D;AAAA,YACA;AAAA,UACF;AAAA,QACF,KAAK;AAEH;AAAA,MACJ;AAAA,IACF;AAEA,UAAM,gBAA4B;AAAA,MAChC,KAAK,QAAQ,OAAO,CAAC;AAAA,IACvB;AACA,QAAI,aAAa,UAAW,eAAc,eAAe,QAAQ;AAAA,QAC5D,eAAc,cAAc,QAAQ;AACzC,QAAI,QAAQ,gBAAgB,OAAW,eAAc,cAAc,QAAQ;AAE3E,UAAM,SAAoB;AAAA,MACxB;AAAA,MACA,cAAc,KAAK;AAAA,MACnB,aAAa,KAAK,QAAQ;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,OAAO,QAAQ;AAAA,MACf,YAAY,QAAQ;AAAA,MACpB,YAAY,QAAQ;AAAA,MACpB,WAAW,KAAK;AAAA,MAChB;AAAA,MACA,SAAS,QAAQ;AAAA,MACjB,YAAY,QAAQ;AAAA,MACpB,eAAe,QAAQ;AAAA,MACvB,SAAS;AAAA,MACT,GAAI,QAAQ,eAAe,EAAE,cAAc,QAAQ,aAAa,IAAI,CAAC;AAAA,MACrE,aAAa,QAAQ;AAAA,MACrB;AAAA,MACA,YAAY,KAAK,SAAS;AAAA,IAC5B;AACA,UAAM,gBACJ,QAAQ,iBACP,OAAO,KAAK,iBAAiB,aAC1B,MAAM,KAAK,aAAa;AAAA,MACtB,YAAY,KAAK;AAAA,MACjB;AAAA,MACA,WAAW,KAAK,QAAQ;AAAA,MACxB,YAAY,KAAK,SAAS;AAAA,MAC1B,MAAM,KAAK;AAAA,MACX,SAAS,KAAK,QAAQ;AAAA,MACtB,cAAc,KAAK,SAAS,QAAQ,CAAC;AAAA,IACvC,CAAC,IACD,KAAK;AACX,QAAI,kBAAkB,QAAW;AAC/B,YAAM,eAAe,MAAM,wBAAwB,aAAa;AAChE,mCAA6B,cAAc,QAAQ,OAAO,QAAQ,UAAU;AAC5E,aAAO,eAAe;AAAA,IACxB;AACA,WAAO,EAAE,QAAQ,kBAAkB,MAAM,GAAG,WAAW,gBAAgB;AAAA,EACzE;AAEA,QAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,aAAa,MAAM,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC;AAC1F,QAAM,QAAQ,IAAI,OAAO;AAGzB,MAAI;AACJ,MAAI,KAAK,QAAQ;AACf,UAAM,aAAoC;AAAA,MACxC,GAAG,KAAK;AAAA,MACR,YAAY,KAAK,OAAO;AAAA,MACxB,OAAO,aAAa,QAAQ,WAAW;AAAA,MACvC,aAAa,IAAI,KAAK,IAAI,CAAC,EAAE,YAAY;AAAA,MACzC,qBAAqB,uBAAuB;AAAA,IAC9C;AACA,aAAS,MAAM,eAAe,MAAM,UAAU;AAAA,EAChD;AAEA,QAAM,UAAU,IAAI,KAAK,IAAI,CAAC,EAAE,YAAY;AAE5C,SAAO;AAAA,IACL,YAAY,KAAK;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAIA,IAAM,qBAAN,cAAiC,MAAM;AAAA,EAC5B;AAAA,EACA;AAAA,EACT,YAAY,QAAmB,WAAgC;AAC7D,UAAM,QAAQ,OAAO,SAAS,IAAI,OAAO,UAAU,IAAI,OAAO,IAAI,YAAY,OAAO,MAAM,EAAE;AAC7F,SAAK,SAAS;AACd,SAAK,YAAY;AAAA,EACnB;AACF;AAEA,SAAS,sBAAsB,SAA6B;AAC1D,SAAO,CAAC,WAAmD;AACzD,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,WAAO,IAAI,0BAA0B;AAAA,MACnC,KAAK,GAAG,OAAO,eAAe,OAAO,KAAK;AAAA,IAC5C,CAAC;AAAA,EACH;AACF;AAEA,eAAe,wBACb,OAC2B;AAC3B,MAAI,mBAAmB,KAAK,GAAG;AAC7B,QAAI,CAAE,MAAM,uBAAuB,KAAK,GAAI;AAC1C,YAAM,IAAI,MAAM,iEAAiE;AAAA,IACnF;AACA,WAAO;AAAA,EACT;AACA,SAAO,sBAAsB,KAAK;AACpC;AAEA,SAAS,mBACP,OAC2B;AAC3B,SAAO,mBAAmB,SAAS,YAAY;AACjD;AAEA,SAAS,6BACP,SACA,OACA,YACM;AACN,MAAI,QAAQ,UAAU,UAAa,QAAQ,UAAU,OAAO;AAC1D,UAAM,IAAI;AAAA,MACR,wCAAwC,QAAQ,KAAK,mCAAmC,KAAK;AAAA,IAC/F;AAAA,EACF;AACA,MAAI,QAAQ,eAAe,UAAa,QAAQ,eAAe,YAAY;AACzE,UAAM,IAAI;AAAA,MACR,6CAA6C,QAAQ,UAAU,wCAAwC,UAAU;AAAA,IACnH;AAAA,EACF;AACF;AAEA,SAAS,aAAa,QAAuC;AAG3D,QAAM,OAAO,GAAG,OAAO,UAAU,KAAK,OAAO,SAAS,KAAK,OAAO,UAAU,KAAK,OAAO,IAAI;AAE5F,MAAI,KAAK;AACT,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,IAAI,KAAK,WAAW,CAAC;AAC3B,SAAK,KAAK,KAAK,KAAK,GAAG,QAAU,MAAM;AACvC,SAAK,KAAK,KAAK,KAAK,GAAG,UAAU,MAAM;AAAA,EACzC;AACA,SAAO,OAAO,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC;AACnF;","names":[]}

package/dist/chunk-KWRRMR3J.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/agent-profile-cell.ts","../src/run-record.ts"],"sourcesContent":["import { ValidationError } from './errors'\nimport { hashJson } from './pre-registration'\n\nexport type AgentProfileCellSchemaVersion = 'agent-profile-cell/v1'\n\nexport type AgentProfileJson =\n  | string\n  | number\n  | boolean\n  | null\n  | AgentProfileJson[]\n  | { [key: string]: AgentProfileJson }\n\nexport type AgentProfileDimensionValue = string | number | boolean | null\n\nexport interface AgentProfileSource {\n  /** Runtime/profile contract being fingerprinted, e.g. `sandbox-agent-profile`. */\n  kind: string\n  /** sha256 over the canonical source profile object. */\n  hash: string\n}\n\nexport interface AgentProfileSourceInput {\n  kind: string\n  /** Precomputed sha256 for callers that already sign their profile artifact. */\n  hash?: string\n  /** Full canonical runtime profile; hashed and then discarded from the cell. */\n  profile?: AgentProfileJson\n}\n\nexport interface AgentProfileHarness {\n  id: string\n  version?: string\n  hash?: string\n}\n\nexport interface AgentProfileCellInput {\n  profileId: string\n  sourceProfile: AgentProfileSourceInput\n  harness?: AgentProfileHarness\n  model?: string\n  promptHash?: string\n  dimensions?: Record<string, AgentProfileDimensionValue>\n}\n\nexport interface AgentProfileCell {\n  schemaVersion: AgentProfileCellSchemaVersion\n  cellId: string\n  profileId: string\n  sourceProfile: AgentProfileSource\n  harness?: AgentProfileHarness\n  model?: string\n  promptHash?: string\n  dimensions?: Record<string, AgentProfileDimensionValue>\n}\n\nexport class AgentProfileCellValidationError extends ValidationError {\n  readonly path: string\n  constructor(message: string, path = '') {\n    super(path ? `${message} (at ${path})` : message)\n    this.path = path\n  }\n}\n\nconst SHA256_HEX = /^[0-9a-f]{64}$/\nconst CELL_ID = /^agent-profile-cell:sha256:[0-9a-f]{64}$/\n\nexport async function buildAgentProfileCell(\n  input: AgentProfileCellInput,\n): Promise<AgentProfileCell> {\n  const material = await normalizeAgentProfileCellInput(input)\n  const cellId = `agent-profile-cell:sha256:${await hashJson(material)}`\n  return { ...material, cellId }\n}\n\nexport function agentProfileCellHashMaterial(\n  cell: AgentProfileCell,\n): Omit<AgentProfileCell, 'cellId'> {\n  const { cellId: _cellId, ...material } = cell\n  void _cellId\n  return normalizeAgentProfileCell(material)\n}\n\nexport async function verifyAgentProfileCell(cell: AgentProfileCell): Promise<boolean> {\n  validateAgentProfileCell(cell)\n  return (\n    cell.cellId ===\n    `agent-profile-cell:sha256:${await hashJson(agentProfileCellHashMaterial(cell))}`\n  )\n}\n\nexport function validateAgentProfileCell(input: unknown): AgentProfileCell {\n  if (input === null || typeof input !== 'object') {\n    throw new AgentProfileCellValidationError('expected object')\n  }\n  const obj = input as Record<string, unknown>\n  expectLiteral(obj.schemaVersion, 'agent-profile-cell/v1', 'schemaVersion')\n  if (typeof obj.cellId !== 'string' || !CELL_ID.test(obj.cellId)) {\n    throw new AgentProfileCellValidationError(\n      'cellId must match agent-profile-cell:sha256:<64 lowercase hex chars>',\n      'cellId',\n    )\n  }\n  expectString(obj.profileId, 'profileId')\n  validateSource(obj.sourceProfile, 'sourceProfile')\n  if (obj.harness !== undefined) validateHarness(obj.harness, 'harness')\n  if (obj.model !== undefined) expectString(obj.model, 'model')\n  if (obj.promptHash !== undefined) expectString(obj.promptHash, 'promptHash')\n  if (obj.dimensions !== undefined) validateDimensions(obj.dimensions, 'dimensions')\n  return input as AgentProfileCell\n}\n\nexport function requireAgentProfileCell(record: {\n  runId: string\n  agentProfile?: AgentProfileCell\n}): AgentProfileCell {\n  if (!record.agentProfile) {\n    throw new AgentProfileCellValidationError(\n      `run \"${record.runId}\" is missing agentProfile; profile-cell grouping requires explicit profile identity`,\n      'agentProfile',\n    )\n  }\n  return validateAgentProfileCell(record.agentProfile)\n}\n\nexport function agentProfileCellKey(record: {\n  runId: string\n  agentProfile?: AgentProfileCell\n}): string {\n  return requireAgentProfileCell(record).cellId\n}\n\nexport async function assertRunAgentProfileCell(record: {\n  runId: string\n  model: string\n  promptHash: string\n  agentProfile?: AgentProfileCell\n}): Promise<AgentProfileCell> {\n  const profile = requireAgentProfileCell(record)\n  if (!(await verifyAgentProfileCell(profile))) {\n    throw new AgentProfileCellValidationError(\n      `run \"${record.runId}\" has an agentProfile.cellId that does not match its content`,\n      'agentProfile.cellId',\n    )\n  }\n  if (profile.model !== undefined && profile.model !== record.model) {\n    throw new AgentProfileCellValidationError(\n      `run \"${record.runId}\" agentProfile.model \"${profile.model}\" does not match model \"${record.model}\"`,\n      'agentProfile.model',\n    )\n  }\n  if (profile.promptHash !== undefined && profile.promptHash !== record.promptHash) {\n    throw new AgentProfileCellValidationError(\n      `run \"${record.runId}\" agentProfile.promptHash \"${profile.promptHash}\" does not match promptHash \"${record.promptHash}\"`,\n      'agentProfile.promptHash',\n    )\n  }\n  return profile\n}\n\nexport function groupRunsByAgentProfileCell<\n  T extends { runId: string; agentProfile?: AgentProfileCell },\n>(records: readonly T[]): Map<string, T[]> {\n  const groups = new Map<string, T[]>()\n  for (const record of records) {\n    const key = agentProfileCellKey(record)\n    const bucket = groups.get(key)\n    if (bucket) bucket.push(record)\n    else groups.set(key, [record])\n  }\n  return groups\n}\n\nasync function normalizeAgentProfileCellInput(\n  input: AgentProfileCellInput,\n): Promise<Omit<AgentProfileCell, 'cellId'>> {\n  return normalizeAgentProfileCell({\n    schemaVersion: 'agent-profile-cell/v1',\n    profileId: input.profileId,\n    sourceProfile: await normalizeSourceInput(input.sourceProfile),\n    harness: input.harness,\n    model: input.model,\n    promptHash: input.promptHash,\n    dimensions: input.dimensions,\n  })\n}\n\nfunction normalizeAgentProfileCell(\n  input: Omit<AgentProfileCell, 'cellId'>,\n): Omit<AgentProfileCell, 'cellId'> {\n  return compactObject({\n    schemaVersion: 'agent-profile-cell/v1' as const,\n    profileId: requireNonEmpty(input.profileId, 'profileId'),\n    sourceProfile: normalizeSource(input.sourceProfile),\n    harness: input.harness ? normalizeHarness(input.harness, 'harness') : undefined,\n    model: optionalNonEmpty(input.model, 'model'),\n    promptHash: optionalNonEmpty(input.promptHash, 'promptHash'),\n    dimensions: input.dimensions\n      ? nonEmptyRecord(normalizeDimensions(input.dimensions))\n      : undefined,\n  })\n}\n\nasync function normalizeSourceInput(input: AgentProfileSourceInput): Promise<AgentProfileSource> {\n  const kind = requireNonEmpty(input.kind, 'sourceProfile.kind')\n  if (input.hash !== undefined && input.profile !== undefined) {\n    throw new AgentProfileCellValidationError(\n      'sourceProfile must provide either hash or profile, not both',\n      'sourceProfile',\n    )\n  }\n  if (input.hash !== undefined) {\n    return { kind, hash: requireSha256Hex(input.hash, 'sourceProfile.hash') }\n  }\n  if (input.profile === undefined) {\n    throw new AgentProfileCellValidationError(\n      'sourceProfile must provide hash or profile',\n      'sourceProfile',\n    )\n  }\n  assertJson(input.profile, 'sourceProfile.profile')\n  return { kind, hash: await hashJson(input.profile) }\n}\n\nfunction normalizeSource(input: AgentProfileSource): AgentProfileSource {\n  return {\n    kind: requireNonEmpty(input.kind, 'sourceProfile.kind'),\n    hash: requireSha256Hex(input.hash, 'sourceProfile.hash'),\n  }\n}\n\nfunction normalizeHarness(input: AgentProfileHarness, path: string): AgentProfileHarness {\n  return compactObject({\n    id: requireNonEmpty(input.id, `${path}.id`),\n    version: optionalNonEmpty(input.version, `${path}.version`),\n    hash: optionalNonEmpty(input.hash, `${path}.hash`),\n  })\n}\n\nfunction normalizeDimensions(\n  input: Record<string, AgentProfileDimensionValue>,\n): Record<string, AgentProfileDimensionValue> {\n  const out: Record<string, AgentProfileDimensionValue> = {}\n  for (const key of Object.keys(input).sort()) {\n    const value = input[key]\n    requireNonEmpty(key, 'dimensions.<key>')\n    if (\n      value !== null &&\n      typeof value !== 'string' &&\n      typeof value !== 'number' &&\n      typeof value !== 'boolean'\n    ) {\n      throw new AgentProfileCellValidationError(\n        'expected primitive dimension value',\n        `dimensions.${key}`,\n      )\n    }\n    if (typeof value === 'number' && !Number.isFinite(value)) {\n      throw new AgentProfileCellValidationError('expected finite number', `dimensions.${key}`)\n    }\n    out[key] = value\n  }\n  return out\n}\n\nfunction compactObject<T extends Record<string, unknown>>(input: T): T {\n  const out: Record<string, unknown> = {}\n  for (const [key, value] of Object.entries(input)) {\n    if (value !== undefined) out[key] = value\n  }\n  return out as T\n}\n\nfunction nonEmptyRecord<T extends Record<string, unknown>>(input: T): T | undefined {\n  return Object.keys(input).length > 0 ? input : undefined\n}\n\nfunction validateSource(value: unknown, path: string): void {\n  if (value === null || typeof value !== 'object' || Array.isArray(value)) {\n    throw new AgentProfileCellValidationError('expected object', path)\n  }\n  const rec = value as Record<string, unknown>\n  expectString(rec.kind, `${path}.kind`)\n  requireSha256Hex(rec.hash, `${path}.hash`)\n}\n\nfunction validateHarness(value: unknown, path: string): void {\n  if (value === null || typeof value !== 'object' || Array.isArray(value)) {\n    throw new AgentProfileCellValidationError('expected object', path)\n  }\n  const rec = value as Record<string, unknown>\n  expectString(rec.id, `${path}.id`)\n  if (rec.version !== undefined) expectString(rec.version, `${path}.version`)\n  if (rec.hash !== undefined) expectString(rec.hash, `${path}.hash`)\n}\n\nfunction validateDimensions(value: unknown, path: string): void {\n  if (value === null || typeof value !== 'object' || Array.isArray(value)) {\n    throw new AgentProfileCellValidationError('expected object', path)\n  }\n  normalizeDimensions(value as Record<string, AgentProfileDimensionValue>)\n}\n\nfunction assertJson(value: AgentProfileJson, path: string): void {\n  if (value === null) return\n  const type = typeof value\n  if (type === 'string' || type === 'boolean') return\n  if (type === 'number') {\n    if (!Number.isFinite(value)) {\n      throw new AgentProfileCellValidationError('expected finite number', path)\n    }\n    return\n  }\n  if (Array.isArray(value)) {\n    value.forEach((item, index) => {\n      assertJson(item, `${path}[${index}]`)\n    })\n    return\n  }\n  if (type === 'object') {\n    for (const [key, nested] of Object.entries(value)) {\n      requireNonEmpty(key, `${path}.<key>`)\n      assertJson(nested, `${path}.${key}`)\n    }\n    return\n  }\n  throw new AgentProfileCellValidationError('expected JSON-compatible value', path)\n}\n\nfunction expectLiteral(value: unknown, expected: string, path: string): void {\n  if (value !== expected) {\n    throw new AgentProfileCellValidationError(`expected ${expected}`, path)\n  }\n}\n\nfunction expectString(value: unknown, path: string): void {\n  if (typeof value !== 'string' || value.length === 0) {\n    throw new AgentProfileCellValidationError('expected non-empty string', path)\n  }\n}\n\nfunction requireNonEmpty(value: string, path: string): string {\n  if (typeof value !== 'string' || value.length === 0) {\n    throw new AgentProfileCellValidationError('expected non-empty string', path)\n  }\n  return value\n}\n\nfunction optionalNonEmpty(value: string | undefined, path: string): string | undefined {\n  if (value === undefined) return undefined\n  return requireNonEmpty(value, path)\n}\n\nfunction requireSha256Hex(value: unknown, path: string): string {\n  if (typeof value !== 'string' || !SHA256_HEX.test(value)) {\n    throw new AgentProfileCellValidationError('expected 64 lowercase sha256 hex chars', path)\n  }\n  return value\n}\n\n// ── Consumer helpers ─────────────────────────────────────────────────\n//\n// Two pieces of boilerplate every product consuming `buildAgentProfileCell`\n// has been duplicating (gtm-agent #137, blueprint-agent #1756/#1757):\n//\n//   1. A `JSON.parse(JSON.stringify(value))` helper that canonicalizes an\n//      arbitrary sandbox-SDK `AgentProfile` into the recursive\n//      `AgentProfileJson` shape, with a fail-loud error when the profile\n//      is not JSON-serializable.\n//\n//   2. The magic string `'sandbox-agent-profile'` for `sourceProfile.kind`.\n//\n// Both belong here so the cross-product cell join (same canonical profile\n// hashes to the same `sourceProfile.hash` across products) is enforced by\n// the type system, not by every consumer remembering to do it right.\n// See blueprint-agent issue tangle-network/agent-eval#82.\n\n/** Canonical `sourceProfile.kind` values. Two products fingerprinting the\n *  same canonical profile MUST use the same kind for their cells to share\n *  `sourceProfile.hash`. Extend rather than create new strings — adding a\n *  new kind is a deliberate cross-product schema change. */\nexport const AGENT_PROFILE_KINDS = {\n  /** A profile declared via `defineAgentProfile(...)` from\n   *  `@tangle-network/sandbox`. The default kind for sandbox-hosted\n   *  products (gtm-agent, blueprint-agent, sandbox, evals). */\n  SANDBOX_AGENT_PROFILE: 'sandbox-agent-profile',\n} as const\n\nexport type AgentProfileKind = (typeof AGENT_PROFILE_KINDS)[keyof typeof AGENT_PROFILE_KINDS]\n\n/** Canonicalize an arbitrary value into `AgentProfileJson` by JSON\n *  round-trip. Throws when the value contains anything not representable\n *  as JSON (functions, BigInt, cycles) — non-portable profiles fail loud\n *  rather than silently dropping fields. */\nexport function toAgentProfileJson(value: unknown): AgentProfileJson {\n  let serialized: string | undefined\n  try {\n    serialized = JSON.stringify(value)\n  } catch (err) {\n    throw new AgentProfileCellValidationError(\n      `agent profile must be JSON-serializable: ${err instanceof Error ? err.message : String(err)}`,\n      'sourceProfile.profile',\n    )\n  }\n  if (serialized === undefined) {\n    throw new AgentProfileCellValidationError(\n      'agent profile must be JSON-serializable (got undefined after JSON.stringify)',\n      'sourceProfile.profile',\n    )\n  }\n  return JSON.parse(serialized) as AgentProfileJson\n}\n\n/** Minimal shape required of any sandbox-SDK `AgentProfile` — anything\n *  with a non-empty `name` and `version` plus JSON-serializable contents.\n *  Compatible with `defineAgentProfile(...)` output from\n *  `@tangle-network/sandbox`; products that have not yet declared a real\n *  profile can pass a `{ name, version, ...metadata }` stub. */\nexport interface SandboxAgentProfileLike {\n  name: string\n  version: string\n  [key: string]: unknown\n}\n\n/** Higher-level helper that hard-codes the canonical\n *  `sandbox-agent-profile` kind plus the JSON canonicalization. Equivalent\n *  to calling `buildAgentProfileCell` with `profileId = \\`${name}@${version}\\``\n *  and `sourceProfile = { kind: SANDBOX_AGENT_PROFILE, profile: <round-tripped> }`.\n *\n *  Use this from any product consuming a sandbox-SDK `AgentProfile`; the\n *  manual `buildAgentProfileCell` call is reserved for advanced cases\n *  (custom kinds, pre-computed source hashes, alternate profileId\n *  conventions). */\nexport async function buildSandboxAgentProfileCell(\n  profile: SandboxAgentProfileLike,\n  input: Omit<AgentProfileCellInput, 'profileId' | 'sourceProfile'>,\n): Promise<AgentProfileCell> {\n  if (!profile || typeof profile !== 'object') {\n    throw new AgentProfileCellValidationError('sandbox AgentProfile must be an object', 'profile')\n  }\n  if (typeof profile.name !== 'string' || profile.name.length === 0) {\n    throw new AgentProfileCellValidationError(\n      'sandbox AgentProfile must have a non-empty `name`',\n      'profile.name',\n    )\n  }\n  if (typeof profile.version !== 'string' || profile.version.length === 0) {\n    throw new AgentProfileCellValidationError(\n      'sandbox AgentProfile must have a non-empty `version`',\n      'profile.version',\n    )\n  }\n  return buildAgentProfileCell({\n    ...input,\n    profileId: `${profile.name}@${profile.version}`,\n    sourceProfile: {\n      kind: AGENT_PROFILE_KINDS.SANDBOX_AGENT_PROFILE,\n      profile: toAgentProfileJson(profile),\n    },\n  })\n}\n","/**\n * Paper-grade RunRecord schema + runtime validator.\n *\n * Every run that participates in a promotion gate, paper table, or\n * researcher loop SHOULD be recorded as a `RunRecord`. The mandatory\n * fields are exactly those the paper \"Two Loops, Three Roles\" requires\n * for reproducibility: who/what/when/cost/seed/hash, plus the search vs\n * holdout split tag and either a `searchScore` or a `holdoutScore`.\n *\n * This is intentionally NOT a replacement for the rich `Run` /\n * `ProposeReviewReport` / `ScenarioResult` types already in the\n * package. Those are runtime structures with full provenance. A\n * `RunRecord` is the analysis-time projection — the JSON-friendly\n * row you'd put in a parquet file or paste into a notebook.\n *\n * Validate at the boundary:\n *\n *   const rec = validateRunRecord(rawJson)         // throws on missing\n *   const ok  = isRunRecord(rawJson)               // boolean check\n *   const rec = parseRunRecordSafe(rawJson)        // { ok, value | error }\n *\n * The validator runs in pure TS — zod is intentionally NOT a\n * dependency. Round-trip tested in `tests/run-record.test.ts`.\n */\n\nimport type { AgentProfileCell } from './agent-profile-cell'\nimport { validateAgentProfileCell } from './agent-profile-cell'\nimport { ValidationError } from './errors'\nimport type { FailureClass } from './trace/schema'\n\n/** Search/dev/holdout split tag. 'search' is the paper-grade alias for the\n *  combined train+test pool that the optimizer is allowed to read. */\nexport type RunSplitTag = 'search' | 'dev' | 'holdout'\n\nexport interface RunTokenUsage {\n  input: number\n  output: number\n  cached?: number\n}\n\nexport interface RunJudgeMetadata {\n  model: string\n  promptVersion: string\n  /** [0,1] confidence the judge declared. Constant judge confidence\n   *  across many runs is a fallback signal (see `canary.ts`). */\n  confidence: number\n  /** True if the judge degraded to a fallback path (rules-only,\n   *  prior-call cache, etc.). The canary uses this to alert. */\n  fallback: boolean\n}\n\n/**\n * Per-judge / per-dimension breakdown for runs scored by an ensemble of\n * judges over a multi-dimensional rubric.\n *\n * The collapsed `outcome.searchScore` / `holdoutScore` carries the\n * composite the gate uses. The full breakdown belongs here so consumers\n * can answer \"which judge disagreed?\", \"which dimension dragged the\n * composite down?\", and \"did half the panel fail?\" without re-running.\n *\n * `perJudge[judgeId][dim]` is the canonical source; `perDimMean` and\n * `composite` are convenience projections — derivable but precomputed so\n * downstream IRR primitives (`interRaterReliability`,\n * `corpusInterRaterAgreement`) and reporters don't pay the same\n * aggregation twice.\n *\n * Fail-loud discipline: judges that errored out land in `failedJudges`\n * by id. A missing key in `perJudge` is ambiguous (silent zero vs not\n * run); the explicit list makes a partial-failure recorded as such.\n */\nexport interface JudgeScoresRecord {\n  /** Per-judge per-dimension scores. `{ \"kimi-k2.6\": { helpfulness: 0.8, clarity: 0.7 }, ... }`. */\n  perJudge: Record<string, Record<string, number>>\n  /** Per-dim mean across judges. Convenience — derivable from `perJudge`. */\n  perDimMean: Record<string, number>\n  /** Composite mean across all dims and judges. Mirrors the score\n   *  the gate sees on `outcome.searchScore` / `holdoutScore`. */\n  composite: number\n  /** Judges that errored or returned an unparseable verdict. Recorded\n   *  by id (e.g. `['glm-5.1']`) so a partial-failure case is explicit,\n   *  not inferred from missing keys in `perJudge`. */\n  failedJudges?: string[]\n  /** Free-form notes the judges emitted (joined across judges or\n   *  first-judge only — consumer's choice). */\n  notes?: string\n}\n\nexport interface RunOutcome {\n  /** Score on the search/optimization split. Optional because a\n   *  holdout-only evaluation only fills `holdoutScore`. */\n  searchScore?: number\n  /** Score on the held-out split. Optional because a search-only run\n   *  only fills `searchScore`. At least one must be present. */\n  holdoutScore?: number\n  /** Bag of any other metric the run produced — judge dimensions,\n   *  pass/fail counters, latency stats, etc. Numeric only — keeps\n   *  reporters honest. */\n  raw: Record<string, number>\n  /** Per-judge / per-dim breakdown. Consumers writing ensemble\n   *  judgements populate this; substrate primitives like\n   *  `interRaterReliability` and `corpusInterRaterAgreement` accept\n   *  these records as input. Optional — single-judge or scalar-only\n   *  runs leave it unset. */\n  judgeScores?: JudgeScoresRecord\n  /** Authenticity / realness verdict — did the run build the REAL thing on the\n   *  intended infra, or fake it (see `./authenticity`)? Optional: only domains\n   *  with an authenticity config populate it. Carried in the corpus so the\n   *  flywheel / off-policy learning can optimize for real completion, not gamed\n   *  pass-rate. `score` is 0-1; `gated` is the anti-Goodhart flag — a gated run\n   *  must not count as a real success regardless of `score`. */\n  realness?: { score: number; gated: boolean; reason?: string }\n}\n\n/**\n * Mandatory paper-grade fields for a single evaluation run. Optional\n * fields are extension points; mandatory fields throw if missing.\n *\n * Hash discipline:\n *   - `promptHash` is the sha256 of the EFFECTIVE prompt sent to the\n *     model (after any steering bundle merge).\n *   - `configHash` is the sha256 of the effective run config (model,\n *     temperature, tools, judges, splits). The pair (promptHash,\n *     configHash) uniquely identifies an experimental cell.\n *\n * Model snapshot discipline:\n *   - `model` MUST encode a snapshot version. Bare aliases like\n *     `claude-sonnet-4` or `gpt-4o` are banned — they remap silently.\n *     Use `claude-sonnet-4-6@2025-04-15` or `gpt-4o-2024-11-20`.\n */\nexport interface RunRecord {\n  /** UUID for the run. */\n  runId: string\n  /** Logical experiment grouping (a treatment vs a baseline within\n   *  the same sweep should share `experimentId`). */\n  experimentId: string\n  /** Stable identifier for the candidate (variant) being run. The\n   *  promotion gate compares two `candidateId`s on matched items. */\n  candidateId: string\n  /** RNG seed for the run. Always recorded — silent re-seeding is\n   *  the most common cause of non-reproducible numbers. */\n  seed: number\n  /** Model identifier WITH snapshot version. */\n  model: string\n  /** sha256 of the effective prompt (post-steering). */\n  promptHash: string\n  /** sha256 of the effective config. */\n  configHash: string\n  /** Git SHA the harness was run from. */\n  commitSha: string\n  /** End-to-end wall-clock duration in milliseconds. */\n  wallMs: number\n  /** Time spent queued before execution started, if known. */\n  queueMs?: number\n  /** Total USD cost. Mandatory — runs without a cost number are\n   *  unbounded by definition and must not be admitted into the gate. */\n  costUsd: number\n  /** Token usage breakdown. */\n  tokenUsage: RunTokenUsage\n  /** Judge-side metadata, if a judge was used. */\n  judgeMetadata?: RunJudgeMetadata\n  /** Per-split scores + raw bag. */\n  outcome: RunOutcome\n  /** Canonical, cross-agent failure class drawn from the shared\n   *  `FAILURE_CLASSES` taxonomy. This is the aggregation key that makes\n   *  \"which failure dominates across the whole fleet\" answerable in ONE\n   *  vocabulary — every agent classifies against the same enum. Producers\n   *  set it via the substrate classifier; leave unset only when the failure\n   *  genuinely can't be classified. */\n  failureClass?: FailureClass\n  /** Free-form domain-specific failure detail, scoped UNDER `failureClass`\n   *  (e.g. failureClass='tool_recovery_failure', failureMode='forge_build_unsatisfied').\n   *  The within-agent drill-down; `failureClass` is the cross-agent key. */\n  failureMode?: string\n  /** Which split this run was drawn from. */\n  splitTag: RunSplitTag\n  /**\n   * Stable scenario identifier the run was scored against. Optional for\n   * backwards compatibility, but **strongly recommended**: every primitive\n   * that pairs runs by scenario (preferences, paired stats, BT tournament)\n   * keys on this. The campaign artifact populates it canonically; legacy\n   * runs without it fall back to inference from `outcome.raw.scenario_id`\n   * or `experimentId`.\n   */\n  scenarioId?: string\n  /**\n   * Canonical identity for the agent profile cell that produced this row:\n   * profile artifact hash plus optional harness/model/prompt/reporting\n   * dimensions. Use `agentProfile.cellId` to group persona sweeps and\n   * longitudinal reports by the complete source profile, not by a loose\n   * candidate label or opaque config hash.\n   */\n  agentProfile?: AgentProfileCell\n}\n\n// ── Validation ───────────────────────────────────────────────────────\n\nconst MANDATORY_TOP_LEVEL = [\n  'runId',\n  'experimentId',\n  'candidateId',\n  'seed',\n  'model',\n  'promptHash',\n  'configHash',\n  'commitSha',\n  'wallMs',\n  'costUsd',\n  'tokenUsage',\n  'outcome',\n  'splitTag',\n] as const\n\nconst SPLIT_TAGS: ReadonlyArray<RunSplitTag> = ['search', 'dev', 'holdout']\n\nexport class RunRecordValidationError extends ValidationError {\n  readonly path: string\n  constructor(message: string, path = '') {\n    super(path ? `${message} (at ${path})` : message)\n    this.path = path\n  }\n}\n\n/**\n * Strict validator. Throws `RunRecordValidationError` on the first\n * missing or wrongly-typed field. Returns the input cast to\n * `RunRecord` on success — the validator does not coerce.\n */\nexport function validateRunRecord(input: unknown): RunRecord {\n  if (input === null || typeof input !== 'object') {\n    throw new RunRecordValidationError('expected object')\n  }\n  const obj = input as Record<string, unknown>\n\n  for (const key of MANDATORY_TOP_LEVEL) {\n    if (!(key in obj)) {\n      throw new RunRecordValidationError(`missing mandatory field \"${key}\"`)\n    }\n  }\n\n  expectString(obj.runId, 'runId')\n  expectString(obj.experimentId, 'experimentId')\n  expectString(obj.candidateId, 'candidateId')\n  expectFiniteNumber(obj.seed, 'seed')\n  expectString(obj.model, 'model')\n  expectString(obj.promptHash, 'promptHash')\n  expectString(obj.configHash, 'configHash')\n  expectString(obj.commitSha, 'commitSha')\n  expectFiniteNumber(obj.wallMs, 'wallMs')\n  if (obj.queueMs !== undefined) expectFiniteNumber(obj.queueMs, 'queueMs')\n  expectFiniteNumber(obj.costUsd, 'costUsd')\n\n  // Snapshot discipline: bare model aliases are not paper-grade.\n  if (!modelHasSnapshot(obj.model as string)) {\n    throw new RunRecordValidationError(\n      `model \"${obj.model}\" lacks a snapshot version (use 'name@YYYY-MM-DD' or 'name-YYYYMMDD')`,\n      'model',\n    )\n  }\n\n  // Token usage.\n  const tu = obj.tokenUsage\n  if (tu === null || typeof tu !== 'object') {\n    throw new RunRecordValidationError('tokenUsage must be an object', 'tokenUsage')\n  }\n  const tuRec = tu as Record<string, unknown>\n  expectFiniteNumber(tuRec.input, 'tokenUsage.input')\n  expectFiniteNumber(tuRec.output, 'tokenUsage.output')\n  if (tuRec.cached !== undefined) expectFiniteNumber(tuRec.cached, 'tokenUsage.cached')\n\n  // Judge metadata, optional.\n  if (obj.judgeMetadata !== undefined) {\n    const jm = obj.judgeMetadata\n    if (jm === null || typeof jm !== 'object') {\n      throw new RunRecordValidationError('judgeMetadata must be an object', 'judgeMetadata')\n    }\n    const jmRec = jm as Record<string, unknown>\n    expectString(jmRec.model, 'judgeMetadata.model')\n    expectString(jmRec.promptVersion, 'judgeMetadata.promptVersion')\n    expectFiniteNumber(jmRec.confidence, 'judgeMetadata.confidence')\n    if (typeof jmRec.fallback !== 'boolean') {\n      throw new RunRecordValidationError(\n        'judgeMetadata.fallback must be boolean',\n        'judgeMetadata.fallback',\n      )\n    }\n  }\n\n  // Outcome.\n  const out = obj.outcome\n  if (out === null || typeof out !== 'object') {\n    throw new RunRecordValidationError('outcome must be an object', 'outcome')\n  }\n  const outRec = out as Record<string, unknown>\n  if (outRec.searchScore !== undefined)\n    expectFiniteNumber(outRec.searchScore, 'outcome.searchScore')\n  if (outRec.holdoutScore !== undefined)\n    expectFiniteNumber(outRec.holdoutScore, 'outcome.holdoutScore')\n  if (outRec.searchScore === undefined && outRec.holdoutScore === undefined) {\n    throw new RunRecordValidationError(\n      'outcome must define searchScore or holdoutScore (or both)',\n      'outcome',\n    )\n  }\n  const raw = outRec.raw\n  if (raw === null || typeof raw !== 'object') {\n    throw new RunRecordValidationError('outcome.raw must be an object', 'outcome.raw')\n  }\n  for (const [k, v] of Object.entries(raw as Record<string, unknown>)) {\n    expectFiniteNumber(v, `outcome.raw.${k}`)\n  }\n  // Realness verdict, optional.\n  if (outRec.realness !== undefined) {\n    const r = outRec.realness\n    if (r === null || typeof r !== 'object') {\n      throw new RunRecordValidationError('outcome.realness must be an object', 'outcome.realness')\n    }\n    const rr = r as Record<string, unknown>\n    expectFiniteNumber(rr.score, 'outcome.realness.score')\n    if (typeof rr.gated !== 'boolean') {\n      throw new RunRecordValidationError(\n        'outcome.realness.gated must be a boolean',\n        'outcome.realness.gated',\n      )\n    }\n  }\n\n  // Per-judge / per-dim breakdown, optional.\n  if (outRec.judgeScores !== undefined) {\n    validateJudgeScores(outRec.judgeScores, 'outcome.judgeScores')\n  }\n\n  // Failure mode optional.\n  if (obj.failureMode !== undefined) expectString(obj.failureMode, 'failureMode')\n\n  if (obj.agentProfile !== undefined) {\n    try {\n      const profile = validateAgentProfileCell(obj.agentProfile)\n      if (profile.model !== undefined && profile.model !== obj.model) {\n        throw new RunRecordValidationError(\n          `agentProfile.model \"${profile.model}\" does not match model \"${obj.model}\"`,\n          'agentProfile.model',\n        )\n      }\n      if (profile.promptHash !== undefined && profile.promptHash !== obj.promptHash) {\n        throw new RunRecordValidationError(\n          `agentProfile.promptHash \"${profile.promptHash}\" does not match promptHash \"${obj.promptHash}\"`,\n          'agentProfile.promptHash',\n        )\n      }\n    } catch (error) {\n      if (error instanceof RunRecordValidationError) throw error\n      if (error instanceof Error) {\n        throw new RunRecordValidationError(error.message, 'agentProfile')\n      }\n      throw error\n    }\n  }\n\n  // Split tag.\n  if (typeof obj.splitTag !== 'string' || !SPLIT_TAGS.includes(obj.splitTag as RunSplitTag)) {\n    throw new RunRecordValidationError(\n      `splitTag must be one of ${SPLIT_TAGS.join(', ')}, got ${String(obj.splitTag)}`,\n      'splitTag',\n    )\n  }\n\n  return input as RunRecord\n}\n\n/** Boolean validator — convenience for filtering arrays. */\nexport function isRunRecord(input: unknown): input is RunRecord {\n  try {\n    validateRunRecord(input)\n    return true\n  } catch {\n    return false\n  }\n}\n\n/** Non-throwing validator — returns a discriminated union. */\nexport function parseRunRecordSafe(\n  input: unknown,\n): { ok: true; value: RunRecord } | { ok: false; error: RunRecordValidationError } {\n  try {\n    return { ok: true, value: validateRunRecord(input) }\n  } catch (e) {\n    if (e instanceof RunRecordValidationError) return { ok: false, error: e }\n    throw e\n  }\n}\n\n/** Round-trip helper — `JSON.parse(JSON.stringify(record))` then validate. */\nexport function roundTripRunRecord(record: RunRecord): RunRecord {\n  const json = JSON.stringify(record)\n  return validateRunRecord(JSON.parse(json))\n}\n\n// ── Internals ────────────────────────────────────────────────────────\n\nfunction expectString(value: unknown, path: string): void {\n  if (typeof value !== 'string' || value.length === 0) {\n    throw new RunRecordValidationError(`expected non-empty string`, path)\n  }\n}\n\nfunction expectFiniteNumber(value: unknown, path: string): void {\n  if (typeof value !== 'number' || !Number.isFinite(value)) {\n    throw new RunRecordValidationError(`expected finite number`, path)\n  }\n}\n\nfunction validateJudgeScores(value: unknown, path: string): void {\n  if (value === null || typeof value !== 'object') {\n    throw new RunRecordValidationError('judgeScores must be an object', path)\n  }\n  const rec = value as Record<string, unknown>\n\n  const perJudge = rec.perJudge\n  if (perJudge === null || typeof perJudge !== 'object') {\n    throw new RunRecordValidationError('perJudge must be an object', `${path}.perJudge`)\n  }\n  for (const [judgeId, dims] of Object.entries(perJudge as Record<string, unknown>)) {\n    if (dims === null || typeof dims !== 'object') {\n      throw new RunRecordValidationError(\n        'per-judge entry must be an object of dimension scores',\n        `${path}.perJudge.${judgeId}`,\n      )\n    }\n    for (const [dim, score] of Object.entries(dims as Record<string, unknown>)) {\n      expectFiniteNumber(score, `${path}.perJudge.${judgeId}.${dim}`)\n    }\n  }\n\n  const perDimMean = rec.perDimMean\n  if (perDimMean === null || typeof perDimMean !== 'object') {\n    throw new RunRecordValidationError('perDimMean must be an object', `${path}.perDimMean`)\n  }\n  for (const [dim, mean] of Object.entries(perDimMean as Record<string, unknown>)) {\n    expectFiniteNumber(mean, `${path}.perDimMean.${dim}`)\n  }\n\n  expectFiniteNumber(rec.composite, `${path}.composite`)\n\n  if (rec.failedJudges !== undefined) {\n    if (!Array.isArray(rec.failedJudges)) {\n      throw new RunRecordValidationError(\n        'failedJudges must be an array of strings',\n        `${path}.failedJudges`,\n      )\n    }\n    for (let i = 0; i < rec.failedJudges.length; i++) {\n      const id = rec.failedJudges[i]\n      if (typeof id !== 'string' || id.length === 0) {\n        throw new RunRecordValidationError(\n          'failedJudges entry must be a non-empty string',\n          `${path}.failedJudges[${i}]`,\n        )\n      }\n    }\n  }\n\n  if (rec.notes !== undefined && typeof rec.notes !== 'string') {\n    throw new RunRecordValidationError('notes must be a string', `${path}.notes`)\n  }\n}\n\n/**\n * Heuristic snapshot check. Accepts:\n *   - `name@YYYY-MM-DD` (Anthropic style: `claude-sonnet-4-6@2025-04-15`)\n *   - `name-YYYYMMDD`   (OpenAI style: `gpt-4o-2024-11-20`)\n *   - `name@<arbitrary-token>` (allow opaque snapshots like `@v3`)\n *   - explicit `:date-...` Vertex-style tags\n *\n * Rejects bare aliases like `claude-sonnet-4` or `gpt-4o` that remap\n * silently as providers ship new snapshots.\n */\nfunction modelHasSnapshot(model: string): boolean {\n  if (model.includes('@')) return true\n  if (/-\\d{8}$/.test(model)) return true\n  if (/-\\d{4}-\\d{2}-\\d{2}$/.test(model)) return true\n  if (/:date-/.test(model)) return true\n  return false\n}\n"],"mappings":";;;;;;;;AAwDO,IAAM,kCAAN,cAA8C,gBAAgB;AAAA,EAC1D;AAAA,EACT,YAAY,SAAiB,OAAO,IAAI;AACtC,UAAM,OAAO,GAAG,OAAO,QAAQ,IAAI,MAAM,OAAO;AAChD,SAAK,OAAO;AAAA,EACd;AACF;AAEA,IAAM,aAAa;AACnB,IAAM,UAAU;AAEhB,eAAsB,sBACpB,OAC2B;AAC3B,QAAM,WAAW,MAAM,+BAA+B,KAAK;AAC3D,QAAM,SAAS,6BAA6B,MAAM,SAAS,QAAQ,CAAC;AACpE,SAAO,EAAE,GAAG,UAAU,OAAO;AAC/B;AAEO,SAAS,6BACd,MACkC;AAClC,QAAM,EAAE,QAAQ,SAAS,GAAG,SAAS,IAAI;AACzC,OAAK;AACL,SAAO,0BAA0B,QAAQ;AAC3C;AAEA,eAAsB,uBAAuB,MAA0C;AACrF,2BAAyB,IAAI;AAC7B,SACE,KAAK,WACL,6BAA6B,MAAM,SAAS,6BAA6B,IAAI,CAAC,CAAC;AAEnF;AAEO,SAAS,yBAAyB,OAAkC;AACzE,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,UAAM,IAAI,gCAAgC,iBAAiB;AAAA,EAC7D;AACA,QAAM,MAAM;AACZ,gBAAc,IAAI,eAAe,yBAAyB,eAAe;AACzE,MAAI,OAAO,IAAI,WAAW,YAAY,CAAC,QAAQ,KAAK,IAAI,MAAM,GAAG;AAC/D,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,eAAa,IAAI,WAAW,WAAW;AACvC,iBAAe,IAAI,eAAe,eAAe;AACjD,MAAI,IAAI,YAAY,OAAW,iBAAgB,IAAI,SAAS,SAAS;AACrE,MAAI,IAAI,UAAU,OAAW,cAAa,IAAI,OAAO,OAAO;AAC5D,MAAI,IAAI,eAAe,OAAW,cAAa,IAAI,YAAY,YAAY;AAC3E,MAAI,IAAI,eAAe,OAAW,oBAAmB,IAAI,YAAY,YAAY;AACjF,SAAO;AACT;AAEO,SAAS,wBAAwB,QAGnB;AACnB,MAAI,CAAC,OAAO,cAAc;AACxB,UAAM,IAAI;AAAA,MACR,QAAQ,OAAO,KAAK;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACA,SAAO,yBAAyB,OAAO,YAAY;AACrD;AAEO,SAAS,oBAAoB,QAGzB;AACT,SAAO,wBAAwB,MAAM,EAAE;AACzC;AAEA,eAAsB,0BAA0B,QAKlB;AAC5B,QAAM,UAAU,wBAAwB,MAAM;AAC9C,MAAI,CAAE,MAAM,uBAAuB,OAAO,GAAI;AAC5C,UAAM,IAAI;AAAA,MACR,QAAQ,OAAO,KAAK;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ,UAAU,UAAa,QAAQ,UAAU,OAAO,OAAO;AACjE,UAAM,IAAI;AAAA,MACR,QAAQ,OAAO,KAAK,yBAAyB,QAAQ,KAAK,2BAA2B,OAAO,KAAK;AAAA,MACjG;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ,eAAe,UAAa,QAAQ,eAAe,OAAO,YAAY;AAChF,UAAM,IAAI;AAAA,MACR,QAAQ,OAAO,KAAK,8BAA8B,QAAQ,UAAU,gCAAgC,OAAO,UAAU;AAAA,MACrH;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,4BAEd,SAAyC;AACzC,QAAM,SAAS,oBAAI,IAAiB;AACpC,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,oBAAoB,MAAM;AACtC,UAAM,SAAS,OAAO,IAAI,GAAG;AAC7B,QAAI,OAAQ,QAAO,KAAK,MAAM;AAAA,QACzB,QAAO,IAAI,KAAK,CAAC,MAAM,CAAC;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,eAAe,+BACb,OAC2C;AAC3C,SAAO,0BAA0B;AAAA,IAC/B,eAAe;AAAA,IACf,WAAW,MAAM;AAAA,IACjB,eAAe,MAAM,qBAAqB,MAAM,aAAa;AAAA,IAC7D,SAAS,MAAM;AAAA,IACf,OAAO,MAAM;AAAA,IACb,YAAY,MAAM;AAAA,IAClB,YAAY,MAAM;AAAA,EACpB,CAAC;AACH;AAEA,SAAS,0BACP,OACkC;AAClC,SAAO,cAAc;AAAA,IACnB,eAAe;AAAA,IACf,WAAW,gBAAgB,MAAM,WAAW,WAAW;AAAA,IACvD,eAAe,gBAAgB,MAAM,aAAa;AAAA,IAClD,SAAS,MAAM,UAAU,iBAAiB,MAAM,SAAS,SAAS,IAAI;AAAA,IACtE,OAAO,iBAAiB,MAAM,OAAO,OAAO;AAAA,IAC5C,YAAY,iBAAiB,MAAM,YAAY,YAAY;AAAA,IAC3D,YAAY,MAAM,aACd,eAAe,oBAAoB,MAAM,UAAU,CAAC,IACpD;AAAA,EACN,CAAC;AACH;AAEA,eAAe,qBAAqB,OAA6D;AAC/F,QAAM,OAAO,gBAAgB,MAAM,MAAM,oBAAoB;AAC7D,MAAI,MAAM,SAAS,UAAa,MAAM,YAAY,QAAW;AAC3D,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,SAAS,QAAW;AAC5B,WAAO,EAAE,MAAM,MAAM,iBAAiB,MAAM,MAAM,oBAAoB,EAAE;AAAA,EAC1E;AACA,MAAI,MAAM,YAAY,QAAW;AAC/B,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,aAAW,MAAM,SAAS,uBAAuB;AACjD,SAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,OAAO,EAAE;AACrD;AAEA,SAAS,gBAAgB,OAA+C;AACtE,SAAO;AAAA,IACL,MAAM,gBAAgB,MAAM,MAAM,oBAAoB;AAAA,IACtD,MAAM,iBAAiB,MAAM,MAAM,oBAAoB;AAAA,EACzD;AACF;AAEA,SAAS,iBAAiB,OAA4B,MAAmC;AACvF,SAAO,cAAc;AAAA,IACnB,IAAI,gBAAgB,MAAM,IAAI,GAAG,IAAI,KAAK;AAAA,IAC1C,SAAS,iBAAiB,MAAM,SAAS,GAAG,IAAI,UAAU;AAAA,IAC1D,MAAM,iBAAiB,MAAM,MAAM,GAAG,IAAI,OAAO;AAAA,EACnD,CAAC;AACH;AAEA,SAAS,oBACP,OAC4C;AAC5C,QAAM,MAAkD,CAAC;AACzD,aAAW,OAAO,OAAO,KAAK,KAAK,EAAE,KAAK,GAAG;AAC3C,UAAM,QAAQ,MAAM,GAAG;AACvB,oBAAgB,KAAK,kBAAkB;AACvC,QACE,UAAU,QACV,OAAO,UAAU,YACjB,OAAO,UAAU,YACjB,OAAO,UAAU,WACjB;AACA,YAAM,IAAI;AAAA,QACR;AAAA,QACA,cAAc,GAAG;AAAA,MACnB;AAAA,IACF;AACA,QAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GAAG;AACxD,YAAM,IAAI,gCAAgC,0BAA0B,cAAc,GAAG,EAAE;AAAA,IACzF;AACA,QAAI,GAAG,IAAI;AAAA,EACb;AACA,SAAO;AACT;AAEA,SAAS,cAAiD,OAAa;AACrE,QAAM,MAA+B,CAAC;AACtC,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAChD,QAAI,UAAU,OAAW,KAAI,GAAG,IAAI;AAAA,EACtC;AACA,SAAO;AACT;AAEA,SAAS,eAAkD,OAAyB;AAClF,SAAO,OAAO,KAAK,KAAK,EAAE,SAAS,IAAI,QAAQ;AACjD;AAEA,SAAS,eAAe,OAAgB,MAAoB;AAC1D,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,gCAAgC,mBAAmB,IAAI;AAAA,EACnE;AACA,QAAM,MAAM;AACZ,eAAa,IAAI,MAAM,GAAG,IAAI,OAAO;AACrC,mBAAiB,IAAI,MAAM,GAAG,IAAI,OAAO;AAC3C;AAEA,SAAS,gBAAgB,OAAgB,MAAoB;AAC3D,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,gCAAgC,mBAAmB,IAAI;AAAA,EACnE;AACA,QAAM,MAAM;AACZ,eAAa,IAAI,IAAI,GAAG,IAAI,KAAK;AACjC,MAAI,IAAI,YAAY,OAAW,cAAa,IAAI,SAAS,GAAG,IAAI,UAAU;AAC1E,MAAI,IAAI,SAAS,OAAW,cAAa,IAAI,MAAM,GAAG,IAAI,OAAO;AACnE;AAEA,SAAS,mBAAmB,OAAgB,MAAoB;AAC9D,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,gCAAgC,mBAAmB,IAAI;AAAA,EACnE;AACA,sBAAoB,KAAmD;AACzE;AAEA,SAAS,WAAW,OAAyB,MAAoB;AAC/D,MAAI,UAAU,KAAM;AACpB,QAAM,OAAO,OAAO;AACpB,MAAI,SAAS,YAAY,SAAS,UAAW;AAC7C,MAAI,SAAS,UAAU;AACrB,QAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAC3B,YAAM,IAAI,gCAAgC,0BAA0B,IAAI;AAAA,IAC1E;AACA;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,UAAM,QAAQ,CAAC,MAAM,UAAU;AAC7B,iBAAW,MAAM,GAAG,IAAI,IAAI,KAAK,GAAG;AAAA,IACtC,CAAC;AACD;AAAA,EACF;AACA,MAAI,SAAS,UAAU;AACrB,eAAW,CAAC,KAAK,MAAM,KAAK,OAAO,QAAQ,KAAK,GAAG;AACjD,sBAAgB,KAAK,GAAG,IAAI,QAAQ;AACpC,iBAAW,QAAQ,GAAG,IAAI,IAAI,GAAG,EAAE;AAAA,IACrC;AACA;AAAA,EACF;AACA,QAAM,IAAI,gCAAgC,kCAAkC,IAAI;AAClF;AAEA,SAAS,cAAc,OAAgB,UAAkB,MAAoB;AAC3E,MAAI,UAAU,UAAU;AACtB,UAAM,IAAI,gCAAgC,YAAY,QAAQ,IAAI,IAAI;AAAA,EACxE;AACF;AAEA,SAAS,aAAa,OAAgB,MAAoB;AACxD,MAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG;AACnD,UAAM,IAAI,gCAAgC,6BAA6B,IAAI;AAAA,EAC7E;AACF;AAEA,SAAS,gBAAgB,OAAe,MAAsB;AAC5D,MAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG;AACnD,UAAM,IAAI,gCAAgC,6BAA6B,IAAI;AAAA,EAC7E;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,OAA2B,MAAkC;AACrF,MAAI,UAAU,OAAW,QAAO;AAChC,SAAO,gBAAgB,OAAO,IAAI;AACpC;AAEA,SAAS,iBAAiB,OAAgB,MAAsB;AAC9D,MAAI,OAAO,UAAU,YAAY,CAAC,WAAW,KAAK,KAAK,GAAG;AACxD,UAAM,IAAI,gCAAgC,0CAA0C,IAAI;AAAA,EAC1F;AACA,SAAO;AACT;AAuBO,IAAM,sBAAsB;AAAA;AAAA;AAAA;AAAA,EAIjC,uBAAuB;AACzB;AAQO,SAAS,mBAAmB,OAAkC;AACnE,MAAI;AACJ,MAAI;AACF,iBAAa,KAAK,UAAU,KAAK;AAAA,EACnC,SAAS,KAAK;AACZ,UAAM,IAAI;AAAA,MACR,4CAA4C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC5F;AAAA,IACF;AAAA,EACF;AACA,MAAI,eAAe,QAAW;AAC5B,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,KAAK,MAAM,UAAU;AAC9B;AAsBA,eAAsB,6BACpB,SACA,OAC2B;AAC3B,MAAI,CAAC,WAAW,OAAO,YAAY,UAAU;AAC3C,UAAM,IAAI,gCAAgC,0CAA0C,SAAS;AAAA,EAC/F;AACA,MAAI,OAAO,QAAQ,SAAS,YAAY,QAAQ,KAAK,WAAW,GAAG;AACjE,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,MAAI,OAAO,QAAQ,YAAY,YAAY,QAAQ,QAAQ,WAAW,GAAG;AACvE,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,sBAAsB;AAAA,IAC3B,GAAG;AAAA,IACH,WAAW,GAAG,QAAQ,IAAI,IAAI,QAAQ,OAAO;AAAA,IAC7C,eAAe;AAAA,MACb,MAAM,oBAAoB;AAAA,MAC1B,SAAS,mBAAmB,OAAO;AAAA,IACrC;AAAA,EACF,CAAC;AACH;;;ACxQA,IAAM,sBAAsB;AAAA,EAC1B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,aAAyC,CAAC,UAAU,OAAO,SAAS;AAEnE,IAAM,2BAAN,cAAuC,gBAAgB;AAAA,EACnD;AAAA,EACT,YAAY,SAAiB,OAAO,IAAI;AACtC,UAAM,OAAO,GAAG,OAAO,QAAQ,IAAI,MAAM,OAAO;AAChD,SAAK,OAAO;AAAA,EACd;AACF;AAOO,SAAS,kBAAkB,OAA2B;AAC3D,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,UAAM,IAAI,yBAAyB,iBAAiB;AAAA,EACtD;AACA,QAAM,MAAM;AAEZ,aAAW,OAAO,qBAAqB;AACrC,QAAI,EAAE,OAAO,MAAM;AACjB,YAAM,IAAI,yBAAyB,4BAA4B,GAAG,GAAG;AAAA,IACvE;AAAA,EACF;AAEA,EAAAA,cAAa,IAAI,OAAO,OAAO;AAC/B,EAAAA,cAAa,IAAI,cAAc,cAAc;AAC7C,EAAAA,cAAa,IAAI,aAAa,aAAa;AAC3C,qBAAmB,IAAI,MAAM,MAAM;AACnC,EAAAA,cAAa,IAAI,OAAO,OAAO;AAC/B,EAAAA,cAAa,IAAI,YAAY,YAAY;AACzC,EAAAA,cAAa,IAAI,YAAY,YAAY;AACzC,EAAAA,cAAa,IAAI,WAAW,WAAW;AACvC,qBAAmB,IAAI,QAAQ,QAAQ;AACvC,MAAI,IAAI,YAAY,OAAW,oBAAmB,IAAI,SAAS,SAAS;AACxE,qBAAmB,IAAI,SAAS,SAAS;AAGzC,MAAI,CAAC,iBAAiB,IAAI,KAAe,GAAG;AAC1C,UAAM,IAAI;AAAA,MACR,UAAU,IAAI,KAAK;AAAA,MACnB;AAAA,IACF;AAAA,EACF;AAGA,QAAM,KAAK,IAAI;AACf,MAAI,OAAO,QAAQ,OAAO,OAAO,UAAU;AACzC,UAAM,IAAI,yBAAyB,gCAAgC,YAAY;AAAA,EACjF;AACA,QAAM,QAAQ;AACd,qBAAmB,MAAM,OAAO,kBAAkB;AAClD,qBAAmB,MAAM,QAAQ,mBAAmB;AACpD,MAAI,MAAM,WAAW,OAAW,oBAAmB,MAAM,QAAQ,mBAAmB;AAGpF,MAAI,IAAI,kBAAkB,QAAW;AACnC,UAAM,KAAK,IAAI;AACf,QAAI,OAAO,QAAQ,OAAO,OAAO,UAAU;AACzC,YAAM,IAAI,yBAAyB,mCAAmC,eAAe;AAAA,IACvF;AACA,UAAM,QAAQ;AACd,IAAAA,cAAa,MAAM,OAAO,qBAAqB;AAC/C,IAAAA,cAAa,MAAM,eAAe,6BAA6B;AAC/D,uBAAmB,MAAM,YAAY,0BAA0B;AAC/D,QAAI,OAAO,MAAM,aAAa,WAAW;AACvC,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,QAAM,MAAM,IAAI;AAChB,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,yBAAyB,6BAA6B,SAAS;AAAA,EAC3E;AACA,QAAM,SAAS;AACf,MAAI,OAAO,gBAAgB;AACzB,uBAAmB,OAAO,aAAa,qBAAqB;AAC9D,MAAI,OAAO,iBAAiB;AAC1B,uBAAmB,OAAO,cAAc,sBAAsB;AAChE,MAAI,OAAO,gBAAgB,UAAa,OAAO,iBAAiB,QAAW;AACzE,UAAM,IAAI;AAAA,MACR;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,MAAM,OAAO;AACnB,MAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAC3C,UAAM,IAAI,yBAAyB,iCAAiC,aAAa;AAAA,EACnF;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,GAA8B,GAAG;AACnE,uBAAmB,GAAG,eAAe,CAAC,EAAE;AAAA,EAC1C;AAEA,MAAI,OAAO,aAAa,QAAW;AACjC,UAAM,IAAI,OAAO;AACjB,QAAI,MAAM,QAAQ,OAAO,MAAM,UAAU;AACvC,YAAM,IAAI,yBAAyB,sCAAsC,kBAAkB;AAAA,IAC7F;AACA,UAAM,KAAK;AACX,uBAAmB,GAAG,OAAO,wBAAwB;AACrD,QAAI,OAAO,GAAG,UAAU,WAAW;AACjC,YAAM,IAAI;AAAA,QACR;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,MAAI,OAAO,gBAAgB,QAAW;AACpC,wBAAoB,OAAO,aAAa,qBAAqB;AAAA,EAC/D;AAGA,MAAI,IAAI,gBAAgB,OAAW,CAAAA,cAAa,IAAI,aAAa,aAAa;AAE9E,MAAI,IAAI,iBAAiB,QAAW;AAClC,QAAI;AACF,YAAM,UAAU,yBAAyB,IAAI,YAAY;AACzD,UAAI,QAAQ,UAAU,UAAa,QAAQ,UAAU,IAAI,OAAO;AAC9D,cAAM,IAAI;AAAA,UACR,uBAAuB,QAAQ,KAAK,2BAA2B,IAAI,KAAK;AAAA,UACxE;AAAA,QACF;AAAA,MACF;AACA,UAAI,QAAQ,eAAe,UAAa,QAAQ,eAAe,IAAI,YAAY;AAC7E,cAAM,IAAI;AAAA,UACR,4BAA4B,QAAQ,UAAU,gCAAgC,IAAI,UAAU;AAAA,UAC5F;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,UAAI,iBAAiB,yBAA0B,OAAM;AACrD,UAAI,iBAAiB,OAAO;AAC1B,cAAM,IAAI,yBAAyB,MAAM,SAAS,cAAc;AAAA,MAClE;AACA,YAAM;AAAA,IACR;AAAA,EACF;AAGA,MAAI,OAAO,IAAI,aAAa,YAAY,CAAC,WAAW,SAAS,IAAI,QAAuB,GAAG;AACzF,UAAM,IAAI;AAAA,MACR,2BAA2B,WAAW,KAAK,IAAI,CAAC,SAAS,OAAO,IAAI,QAAQ,CAAC;AAAA,MAC7E;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAGO,SAAS,YAAY,OAAoC;AAC9D,MAAI;AACF,sBAAkB,KAAK;AACvB,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGO,SAAS,mBACd,OACiF;AACjF,MAAI;AACF,WAAO,EAAE,IAAI,MAAM,OAAO,kBAAkB,KAAK,EAAE;AAAA,EACrD,SAAS,GAAG;AACV,QAAI,aAAa,yBAA0B,QAAO,EAAE,IAAI,OAAO,OAAO,EAAE;AACxE,UAAM;AAAA,EACR;AACF;AAGO,SAAS,mBAAmB,QAA8B;AAC/D,QAAM,OAAO,KAAK,UAAU,MAAM;AAClC,SAAO,kBAAkB,KAAK,MAAM,IAAI,CAAC;AAC3C;AAIA,SAASA,cAAa,OAAgB,MAAoB;AACxD,MAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG;AACnD,UAAM,IAAI,yBAAyB,6BAA6B,IAAI;AAAA,EACtE;AACF;AAEA,SAAS,mBAAmB,OAAgB,MAAoB;AAC9D,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GAAG;AACxD,UAAM,IAAI,yBAAyB,0BAA0B,IAAI;AAAA,EACnE;AACF;AAEA,SAAS,oBAAoB,OAAgB,MAAoB;AAC/D,MAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;AAC/C,UAAM,IAAI,yBAAyB,iCAAiC,IAAI;AAAA,EAC1E;AACA,QAAM,MAAM;AAEZ,QAAM,WAAW,IAAI;AACrB,MAAI,aAAa,QAAQ,OAAO,aAAa,UAAU;AACrD,UAAM,IAAI,yBAAyB,8BAA8B,GAAG,IAAI,WAAW;AAAA,EACrF;AACA,aAAW,CAAC,SAAS,IAAI,KAAK,OAAO,QAAQ,QAAmC,GAAG;AACjF,QAAI,SAAS,QAAQ,OAAO,SAAS,UAAU;AAC7C,YAAM,IAAI;AAAA,QACR;AAAA,QACA,GAAG,IAAI,aAAa,OAAO;AAAA,MAC7B;AAAA,IACF;AACA,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,IAA+B,GAAG;AAC1E,yBAAmB,OAAO,GAAG,IAAI,aAAa,OAAO,IAAI,GAAG,EAAE;AAAA,IAChE;AAAA,EACF;AAEA,QAAM,aAAa,IAAI;AACvB,MAAI,eAAe,QAAQ,OAAO,eAAe,UAAU;AACzD,UAAM,IAAI,yBAAyB,gCAAgC,GAAG,IAAI,aAAa;AAAA,EACzF;AACA,aAAW,CAAC,KAAK,IAAI,KAAK,OAAO,QAAQ,UAAqC,GAAG;AAC/E,uBAAmB,MAAM,GAAG,IAAI,eAAe,GAAG,EAAE;AAAA,EACtD;AAEA,qBAAmB,IAAI,WAAW,GAAG,IAAI,YAAY;AAErD,MAAI,IAAI,iBAAiB,QAAW;AAClC,QAAI,CAAC,MAAM,QAAQ,IAAI,YAAY,GAAG;AACpC,YAAM,IAAI;AAAA,QACR;AAAA,QACA,GAAG,IAAI;AAAA,MACT;AAAA,IACF;AACA,aAAS,IAAI,GAAG,IAAI,IAAI,aAAa,QAAQ,KAAK;AAChD,YAAM,KAAK,IAAI,aAAa,CAAC;AAC7B,UAAI,OAAO,OAAO,YAAY,GAAG,WAAW,GAAG;AAC7C,cAAM,IAAI;AAAA,UACR;AAAA,UACA,GAAG,IAAI,iBAAiB,CAAC;AAAA,QAC3B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,IAAI,UAAU,UAAa,OAAO,IAAI,UAAU,UAAU;AAC5D,UAAM,IAAI,yBAAyB,0BAA0B,GAAG,IAAI,QAAQ;AAAA,EAC9E;AACF;AAYA,SAAS,iBAAiB,OAAwB;AAChD,MAAI,MAAM,SAAS,GAAG,EAAG,QAAO;AAChC,MAAI,UAAU,KAAK,KAAK,EAAG,QAAO;AAClC,MAAI,sBAAsB,KAAK,KAAK,EAAG,QAAO;AAC9C,MAAI,SAAS,KAAK,KAAK,EAAG,QAAO;AACjC,SAAO;AACT;","names":["expectString"]}

package/dist/chunk-LMZQ2Z4U.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/judge-calibration.ts","../src/statistics.ts"],"sourcesContent":["/**\n * Judge calibration — measure judge quality against human gold + bias.\n *\n * Workflow:\n *   1. Build a golden set: {itemId, humanScore}[].\n *   2. Run candidate judges; each produces {itemId, score}.\n *   3. `calibrateJudge(golden, candidate)` reports κ + Pearson + MAE.\n *   4. `calibrateJudgeContinuous(golden, candidate)` adds quadratic-weighted\n *      κ over the un-rounded [0,1] scores plus ICC(2,1), Pearson, Spearman,\n *      and bootstrap CIs — use this for fine-grained judges where rounding\n *      to int discards information (e.g. 0.78 vs 0.81 both round to 1 and\n *      look \"perfectly agreed\" to integer κ).\n *   5. Run bias probes (positional, verbosity, self-preference) to\n *      detect systematic score inflation.\n *   6. For N≥2 judges on the same items, `continuousAgreement(scores)`\n *      reports ICC(2,1) + κ_w + Pearson + Spearman with bootstrap CIs.\n *\n * Returns actionable diagnostics, not a single number. Consumers then\n * decide whether to trust the judge, retrain it, or add a tie-breaker.\n */\n\nexport interface GoldenItem {\n  itemId: string\n  humanScore: number\n  /** Optional group used for per-group bias audits (e.g. model-of-output family). */\n  group?: string\n}\n\nexport interface CandidateScore {\n  itemId: string\n  score: number\n  /** Optional — enables positional-bias analysis (did order matter?). */\n  positionOfAInput?: 'first' | 'second'\n}\n\nexport interface CalibrationResult {\n  n: number\n  pearson: number\n  /** Cohen's κ with quadratic weights over integer-rounded scores. */\n  kappa: number\n  /** Mean absolute error vs human. */\n  mae: number\n  /** Worst-5 miscalibrations (largest |judge - human|). */\n  worstItems: Array<{ itemId: string; judge: number; human: number; delta: number }>\n}\n\nexport function calibrateJudge(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n): CalibrationResult {\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const common = [...map.values()].filter((v) => Number.isFinite(v.j))\n  const n = common.length\n  if (n < 2) {\n    return { n, pearson: NaN, kappa: NaN, mae: NaN, worstItems: [] }\n  }\n  const humans = common.map((c) => c.h)\n  const judges = common.map((c) => c.j)\n  const pearson = pearsonR(humans, judges)\n  const kappa = weightedKappa(humans.map(Math.round), judges.map(Math.round))\n  const absDiffs = common.map((c) => Math.abs(c.j - c.h))\n  const mae = absDiffs.reduce((a, b) => a + b, 0) / n\n  const worst = [...map.entries()]\n    .filter(([, v]) => Number.isFinite(v.j))\n    .map(([itemId, v]) => ({ itemId, judge: v.j, human: v.h, delta: Math.abs(v.j - v.h) }))\n    .sort((a, b) => b.delta - a.delta)\n    .slice(0, 5)\n  return { n, pearson, kappa, mae, worstItems: worst }\n}\n\nexport interface PositionalBiasResult {\n  /**\n   * Score delta (first-position - second-position) averaged across items\n   * presented in both positions. Non-zero = positional bias.\n   */\n  avgDelta: number\n  n: number\n}\n\n/**\n * Feed the same items to the judge twice with A/B swapped and pass all\n * results here. Items that don't appear in both positions are ignored.\n */\nexport function positionalBias(scores: CandidateScore[]): PositionalBiasResult {\n  const pairs = new Map<string, { first?: number; second?: number }>()\n  for (const s of scores) {\n    const slot = pairs.get(s.itemId) ?? {}\n    if (s.positionOfAInput === 'first') slot.first = s.score\n    else if (s.positionOfAInput === 'second') slot.second = s.score\n    pairs.set(s.itemId, slot)\n  }\n  const deltas: number[] = []\n  for (const { first, second } of pairs.values()) {\n    if (first !== undefined && second !== undefined) deltas.push(first - second)\n  }\n  if (deltas.length === 0) return { avgDelta: 0, n: 0 }\n  return { avgDelta: deltas.reduce((a, b) => a + b, 0) / deltas.length, n: deltas.length }\n}\n\nexport interface VerbosityBiasResult {\n  /** Pearson correlation between output length and score. Strong positive = verbosity bias. */\n  pearson: number\n  n: number\n}\n\nexport function verbosityBias(\n  samples: Array<{ outputLen: number; score: number }>,\n): VerbosityBiasResult {\n  const n = samples.length\n  if (n < 3) return { pearson: NaN, n }\n  return {\n    pearson: pearsonR(\n      samples.map((s) => s.outputLen),\n      samples.map((s) => s.score),\n    ),\n    n,\n  }\n}\n\nexport interface SelfPreferenceResult {\n  /** Mean judge score when judge's family matches output's family. */\n  inFamilyMean: number\n  outOfFamilyMean: number\n  deltaMean: number\n  n: number\n}\n\n/**\n * Pass the same scenarios scored with judge-model X grading outputs from\n * model X (in-family) and model Y (out-of-family). Non-zero delta\n * indicates self-preference.\n */\nexport function selfPreference(\n  samples: Array<{ score: number; inFamily: boolean }>,\n): SelfPreferenceResult {\n  const inF = samples.filter((s) => s.inFamily).map((s) => s.score)\n  const outF = samples.filter((s) => !s.inFamily).map((s) => s.score)\n  if (inF.length === 0 || outF.length === 0)\n    return { inFamilyMean: 0, outOfFamilyMean: 0, deltaMean: 0, n: 0 }\n  const inMean = inF.reduce((a, b) => a + b, 0) / inF.length\n  const outMean = outF.reduce((a, b) => a + b, 0) / outF.length\n  return {\n    inFamilyMean: inMean,\n    outOfFamilyMean: outMean,\n    deltaMean: inMean - outMean,\n    n: samples.length,\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\nfunction pearsonR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return NaN\n  const mA = a.reduce((s, v) => s + v, 0) / a.length\n  const mB = b.reduce((s, v) => s + v, 0) / b.length\n  let num = 0,\n    dA = 0,\n    dB = 0\n  for (let i = 0; i < a.length; i++) {\n    const da = a[i]! - mA\n    const db = b[i]! - mB\n    num += da * db\n    dA += da * da\n    dB += db * db\n  }\n  if (dA === 0 || dB === 0) return dA === 0 && dB === 0 ? 1 : 0\n  return num / Math.sqrt(dA * dB)\n}\n\n/** Quadratic weighted Cohen's κ over bounded integer scores. */\nfunction weightedKappa(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length === 0) return NaN\n  const min = Math.min(...a, ...b)\n  const max = Math.max(...a, ...b)\n  const K = max - min + 1\n  if (K < 2) return 1\n  const observed: number[][] = Array.from({ length: K }, () => new Array(K).fill(0))\n  const rowMarg = new Array(K).fill(0)\n  const colMarg = new Array(K).fill(0)\n  for (let i = 0; i < a.length; i++) {\n    const ai = a[i]! - min\n    const bi = b[i]! - min\n    const row = observed[ai]!\n    row[bi] = (row[bi] ?? 0) + 1\n    rowMarg[ai]++\n    colMarg[bi]++\n  }\n  let num = 0\n  let den = 0\n  for (let i = 0; i < K; i++) {\n    for (let j = 0; j < K; j++) {\n      const w = (i - j) ** 2 / (K - 1) ** 2\n      const expected = (rowMarg[i] * colMarg[j]) / a.length\n      num += w * observed[i]![j]!\n      den += w * expected\n    }\n  }\n  if (den === 0) return 1\n  return 1 - num / den\n}\n\n// ── Continuous-value inter-rater agreement ──────────────────────────\n//\n// `weightedKappa` above quantises to integers. For [0,1] judges that is\n// lossy: 0.78 and 0.81 both round to 1 and look identical to integer κ.\n// `continuousAgreement` keeps the original magnitudes:\n//\n//   - κ_w   : Cohen's weighted κ generalised to continuous scores. For two\n//             raters, weighted κ = 1 − Σ w_ij·o_ij / Σ w_ij·e_ij collapses\n//             into the closed form below when each \"category\" is the score\n//             itself (Janson & Olsson 2001; Cohen 1968 quadratic weights).\n//   - ICC   : Intraclass Correlation Coefficient, ICC(2,1) per Shrout &\n//             Fleiss (1979) — two-way random effects, absolute agreement,\n//             single rater. The right reliability coefficient when judges\n//             are a random sample of the judge population.\n//   - r, ρ  : Pearson + Spearman for sanity-check. Pearson catches linear\n//             association regardless of scale; Spearman catches monotone\n//             association regardless of distribution.\n//   - CIs   : Bootstrap percentile CIs over items (rows). Bias is preserved\n//             because we resample the full row, i.e. a judge's vector\n//             stays internally consistent within each bootstrap replicate.\n//\n// References:\n//   - Shrout, P. E. & Fleiss, J. L. (1979). Intraclass correlations: uses\n//     in assessing rater reliability. Psychological Bulletin, 86(2), 420.\n//   - McGraw, K. O. & Wong, S. P. (1996). Forming inferences about some\n//     intraclass correlation coefficients. Psychological Methods, 1, 30.\n//   - Janson, H. & Olsson, U. (2001). A measure of agreement for interval\n//     or nominal multivariate observations. Educ. Psychol. Meas., 61, 277.\n\nexport interface ContinuousAgreement {\n  /** Cohen's κ_w with quadratic weights, computed on raw [0,1] scores. */\n  weightedKappa: number\n  /** ICC(2,1): two-way random effects, absolute agreement, single rater. */\n  icc: number\n  /** Pearson product-moment correlation (averaged over rater pairs if N>2). */\n  pearson: number\n  /** Spearman rank correlation (averaged over rater pairs if N>2). */\n  spearman: number\n  /** 95% bootstrap percentile CIs over items. */\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n  /** Number of complete items (no NaN across raters). */\n  n: number\n  /** Number of raters. */\n  raters: number\n}\n\nexport interface ContinuousAgreementOptions {\n  /** Bootstrap iterations. Default 1000. Set to 0 to skip CIs (CI = [NaN, NaN]). */\n  bootstrap?: number\n  /** κ weighting scheme. Default 'quadratic'. */\n  weights?: 'linear' | 'quadratic'\n  /** PRNG seed for reproducible bootstrap. Default 0xC0FFEE. */\n  seed?: number\n  /** Confidence level for percentile CI. Default 0.95. */\n  ciLevel?: number\n}\n\n/**\n * Inter-rater agreement on continuous (typically [0,1]) scores.\n *\n * `scores` has shape [n_items][n_raters]. Rows with any non-finite entry\n * are dropped. Returns NaN metrics if fewer than 2 raters or 2 complete\n * items remain.\n */\nexport function continuousAgreement(\n  scores: number[][],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousAgreement {\n  const bootstrap = opts.bootstrap ?? 1000\n  const weights = opts.weights ?? 'quadratic'\n  const seed = opts.seed ?? 0xc0ffee\n  const ciLevel = opts.ciLevel ?? 0.95\n\n  const matrix = scores.filter((row) => row.length >= 2 && row.every((v) => Number.isFinite(v)))\n  const raters = matrix[0]?.length ?? 0\n  // All rows must have the same rater count, else drop the offenders.\n  const clean = matrix.filter((row) => row.length === raters)\n  const nClean = clean.length\n\n  if (nClean < 2 || raters < 2) {\n    return {\n      weightedKappa: NaN,\n      icc: NaN,\n      pearson: NaN,\n      spearman: NaN,\n      ci: { icc: [NaN, NaN], weightedKappa: [NaN, NaN] },\n      n: nClean,\n      raters,\n    }\n  }\n\n  const kappa = continuousWeightedKappa(clean, weights)\n  const icc = icc21(clean)\n  const pearson = avgPairwise(clean, pearsonR)\n  const spearman = avgPairwise(clean, spearmanR)\n\n  const ciIcc: [number, number] = [NaN, NaN]\n  const ciKappa: [number, number] = [NaN, NaN]\n  if (bootstrap > 0) {\n    const rng = mulberry32(seed)\n    const iccs: number[] = []\n    const kappas: number[] = []\n    for (let b = 0; b < bootstrap; b++) {\n      const sample: number[][] = new Array(nClean)\n      for (let i = 0; i < nClean; i++) {\n        sample[i] = clean[Math.floor(rng() * nClean)]!\n      }\n      const iccB = icc21(sample)\n      const kB = continuousWeightedKappa(sample, weights)\n      if (Number.isFinite(iccB)) iccs.push(iccB)\n      if (Number.isFinite(kB)) kappas.push(kB)\n    }\n    const [lo, hi] = percentileBounds(ciLevel)\n    if (iccs.length > 0) {\n      iccs.sort((a, b) => a - b)\n      ciIcc[0] = quantile(iccs, lo)\n      ciIcc[1] = quantile(iccs, hi)\n    }\n    if (kappas.length > 0) {\n      kappas.sort((a, b) => a - b)\n      ciKappa[0] = quantile(kappas, lo)\n      ciKappa[1] = quantile(kappas, hi)\n    }\n  }\n\n  return {\n    weightedKappa: kappa,\n    icc,\n    pearson,\n    spearman,\n    ci: { icc: ciIcc, weightedKappa: ciKappa },\n    n: nClean,\n    raters,\n  }\n}\n\nexport interface ContinuousCalibrationResult extends CalibrationResult {\n  /** Cohen's κ_w computed on raw (un-rounded) scores. */\n  weightedKappaContinuous: number\n  /** ICC(2,1) treating golden + candidate as two raters. */\n  icc: number\n  spearman: number\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n}\n\n/**\n * Drop-in superset of `calibrateJudge` that adds continuous-value\n * agreement metrics. The old fields (n, pearson, kappa, mae, worstItems)\n * are preserved unchanged so existing callers continue to work.\n */\nexport function calibrateJudgeContinuous(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousCalibrationResult {\n  const base = calibrateJudge(golden, candidate)\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const rows: number[][] = []\n  for (const v of map.values()) {\n    if (Number.isFinite(v.j)) rows.push([v.h, v.j])\n  }\n  const agreement = continuousAgreement(rows, opts)\n  return {\n    ...base,\n    weightedKappaContinuous: agreement.weightedKappa,\n    icc: agreement.icc,\n    spearman: agreement.spearman,\n    ci: agreement.ci,\n  }\n}\n\n// ── Continuous-agreement internals ──────────────────────────────────\n\n/**\n * Quadratic-weighted κ on continuous scores. With weights w(x,y) = (x-y)^2\n * (or |x-y| for linear) the formula collapses to:\n *\n *   κ_w = 1 − E_obs[w] / E_exp[w]\n *\n * where E_obs averages w over paired (a_i, b_i) and E_exp averages w over\n * the independent product distribution (sum_{i,j} w(a_i, b_j) / n^2).\n * The normalisation by (max-min)^2 in the integer version cancels in the\n * ratio, so we don't need it here. Generalises to N raters by averaging κ_w\n * over all rater pairs (mean pairwise weighted agreement).\n */\nfunction continuousWeightedKappa(rows: number[][], scheme: 'linear' | 'quadratic'): number {\n  if (rows.length === 0) return NaN\n  const raters = rows[0]!.length\n  if (raters < 2) return NaN\n  const wFn =\n    scheme === 'linear'\n      ? (x: number, y: number) => Math.abs(x - y)\n      : (x: number, y: number) => (x - y) ** 2\n  let sum = 0\n  let pairs = 0\n  for (let r1 = 0; r1 < raters; r1++) {\n    for (let r2 = r1 + 1; r2 < raters; r2++) {\n      const a = rows.map((row) => row[r1]!)\n      const b = rows.map((row) => row[r2]!)\n      const n = a.length\n      let obs = 0\n      for (let i = 0; i < n; i++) obs += wFn(a[i]!, b[i]!)\n      obs /= n\n      // Expected under independence: average of w over all i,j cross pairs.\n      let exp = 0\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) exp += wFn(a[i]!, b[j]!)\n      }\n      exp /= n * n\n      if (exp === 0) {\n        // Degenerate: at least one rater is constant. Convention: perfect\n        // agreement iff observed disagreement is also zero, else 0.\n        sum += obs === 0 ? 1 : 0\n      } else {\n        sum += 1 - obs / exp\n      }\n      pairs++\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/**\n * ICC(2,1) — two-way random effects, absolute agreement, single rater.\n *\n *   ICC(2,1) = (MSR − MSE) / (MSR + (k−1)·MSE + k·(MSC − MSE)/n)\n *\n * where MSR = between-rows MS, MSC = between-columns MS, MSE = residual MS,\n * n = rows (items), k = columns (raters).\n */\nfunction icc21(rows: number[][]): number {\n  const n = rows.length\n  if (n < 2) return NaN\n  const k = rows[0]!.length\n  if (k < 2) return NaN\n\n  // Row means.\n  const rowMeans = rows.map((row) => row.reduce((s, v) => s + v, 0) / k)\n  // Column means.\n  const colMeans = new Array(k).fill(0)\n  for (let j = 0; j < k; j++) {\n    let s = 0\n    for (let i = 0; i < n; i++) s += rows[i]![j]!\n    colMeans[j] = s / n\n  }\n  // Grand mean.\n  let grand = 0\n  for (let i = 0; i < n; i++) grand += rowMeans[i]!\n  grand /= n\n\n  let ssR = 0\n  for (let i = 0; i < n; i++) ssR += (rowMeans[i]! - grand) ** 2\n  ssR *= k\n  let ssC = 0\n  for (let j = 0; j < k; j++) ssC += (colMeans[j]! - grand) ** 2\n  ssC *= n\n  let ssT = 0\n  for (let i = 0; i < n; i++) {\n    for (let j = 0; j < k; j++) ssT += (rows[i]![j]! - grand) ** 2\n  }\n  const ssE = ssT - ssR - ssC\n\n  const dfR = n - 1\n  const dfC = k - 1\n  const dfE = (n - 1) * (k - 1)\n  const msR = ssR / dfR\n  const msC = ssC / dfC\n  const msE = dfE > 0 ? ssE / dfE : 0\n\n  const denom = msR + (k - 1) * msE + (k * (msC - msE)) / n\n  if (denom === 0) {\n    // Degenerate (all values equal): convention = 1 if rows identical,\n    // else 0. Identical rows ⇒ msR = 0 too, so msR − msE near 0.\n    return msR === 0 && msE === 0 ? 1 : 0\n  }\n  return (msR - msE) / denom\n}\n\n/** Average pairwise statistic over all rater pairs. */\nfunction avgPairwise(rows: number[][], fn: (a: number[], b: number[]) => number): number {\n  const k = rows[0]?.length ?? 0\n  if (k < 2) return NaN\n  let sum = 0\n  let pairs = 0\n  for (let i = 0; i < k; i++) {\n    for (let j = i + 1; j < k; j++) {\n      const a = rows.map((row) => row[i]!)\n      const b = rows.map((row) => row[j]!)\n      const r = fn(a, b)\n      if (Number.isFinite(r)) {\n        sum += r\n        pairs++\n      }\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/** Spearman rank correlation. Ties get average ranks. */\nfunction spearmanR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return NaN\n  return pearsonR(rankWithTies(a), rankWithTies(b))\n}\n\nfunction rankWithTies(xs: number[]): number[] {\n  const n = xs.length\n  const indexed = xs.map((v, i) => ({ v, i }))\n  indexed.sort((x, y) => x.v - y.v)\n  const ranks = new Array(n).fill(0)\n  let i = 0\n  while (i < n) {\n    let j = i\n    while (j + 1 < n && indexed[j + 1]!.v === indexed[i]!.v) j++\n    // Average rank for ties (ranks are 1-indexed).\n    const avg = (i + j) / 2 + 1\n    for (let k = i; k <= j; k++) ranks[indexed[k]!.i] = avg\n    i = j + 1\n  }\n  return ranks\n}\n\n/** Seeded PRNG — Mulberry32. Deterministic across platforms. */\nfunction mulberry32(seed: number): () => number {\n  let a = seed >>> 0\n  return () => {\n    a = (a + 0x6d2b79f5) >>> 0\n    let t = a\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n\nfunction percentileBounds(ciLevel: number): [number, number] {\n  const tail = (1 - ciLevel) / 2\n  return [tail, 1 - tail]\n}\n\n/** Linear-interpolated quantile of a pre-sorted ascending array. */\nfunction quantile(sorted: number[], q: number): number {\n  if (sorted.length === 0) return NaN\n  if (sorted.length === 1) return sorted[0]!\n  const pos = q * (sorted.length - 1)\n  const lo = Math.floor(pos)\n  const hi = Math.ceil(pos)\n  if (lo === hi) return sorted[lo]!\n  const frac = pos - lo\n  return sorted[lo]! * (1 - frac) + sorted[hi]! * frac\n}\n","import { ValidationError } from './errors'\nimport {\n  type ContinuousAgreement,\n  type ContinuousAgreementOptions,\n  continuousAgreement,\n} from './judge-calibration'\nimport type { JudgeScore } from './types'\n\n/** Identity: dimensions already follow \"higher = better\" by prompt convention\n *  (inverted dims like hallucination are scored 10 = best at the source). */\nexport const normalizeScores = (scores: JudgeScore[]): JudgeScore[] => scores\n\n/** Weighted mean — falls back to uniform weights when omitted */\nexport function weightedMean(scores: { score: number; weight?: number }[]): number {\n  if (scores.length === 0) return 0\n  let totalWeight = 0\n  let weightedSum = 0\n  for (const { score, weight } of scores) {\n    const w = weight ?? 1\n    weightedSum += score * w\n    totalWeight += w\n  }\n  return totalWeight > 0 ? weightedSum / totalWeight : 0\n}\n\n/** Bootstrap confidence interval */\nexport function confidenceInterval(\n  scores: number[],\n  confidence = 0.95,\n  opts: { seed?: number; resamples?: number } = {},\n): { mean: number; lower: number; upper: number } {\n  if (scores.length === 0) return { mean: 0, lower: 0, upper: 0 }\n  if (scores.length === 1) return { mean: scores[0]!, lower: scores[0]!, upper: scores[0]! }\n\n  const n = scores.length\n  const mean = scores.reduce((a, b) => a + b, 0) / n\n\n  const B = opts.resamples ?? 1000\n  const rng = makeRng(opts.seed)\n  const bootstrapMeans: number[] = []\n\n  for (let i = 0; i < B; i++) {\n    let sum = 0\n    for (let j = 0; j < n; j++) {\n      sum += scores[Math.floor(rng() * n)]!\n    }\n    bootstrapMeans.push(sum / n)\n  }\n\n  bootstrapMeans.sort((a, b) => a - b)\n\n  const alpha = 1 - confidence\n  const lowerIdx = Math.floor((alpha / 2) * B)\n  const upperIdx = Math.floor((1 - alpha / 2) * B) - 1\n\n  return {\n    mean,\n    lower: bootstrapMeans[lowerIdx]!,\n    upper: bootstrapMeans[Math.min(upperIdx, B - 1)]!,\n  }\n}\n\n/**\n * Inter-rater reliability — simplified Krippendorff's alpha.\n *\n * Each inner array is one judge's scores for all items.\n * All arrays must have the same length (same items scored).\n */\nexport function interRaterReliability(judgeScores: JudgeScore[][]): number {\n  if (judgeScores.length < 2) return 1\n\n  // Group scores by dimension across judges\n  const dimensionMap = new Map<string, number[][]>()\n  for (const judgeSet of judgeScores) {\n    for (const s of judgeSet) {\n      if (!dimensionMap.has(s.dimension)) dimensionMap.set(s.dimension, [])\n      const arr = dimensionMap.get(s.dimension)!\n      if (arr.length === 0 || arr[arr.length - 1]!.length >= judgeScores.length) {\n        arr.push([s.score])\n      } else {\n        arr[arr.length - 1]!.push(s.score)\n      }\n    }\n  }\n\n  // Collect all paired ratings\n  const allValues: number[] = []\n  const pairDiffs: number[] = []\n\n  for (const items of dimensionMap.values()) {\n    for (const ratings of items) {\n      if (ratings.length < 2) continue\n      for (const v of ratings) allValues.push(v)\n      for (let i = 0; i < ratings.length; i++) {\n        for (let j = i + 1; j < ratings.length; j++) {\n          pairDiffs.push((ratings[i]! - ratings[j]!) ** 2)\n        }\n      }\n    }\n  }\n\n  if (pairDiffs.length === 0 || allValues.length < 2) return 1\n\n  const observedDisagreement = pairDiffs.reduce((a, b) => a + b, 0) / pairDiffs.length\n\n  // Expected disagreement from all possible pairings of values\n  let expectedDisagreement = 0\n  let expectedCount = 0\n  for (let i = 0; i < allValues.length; i++) {\n    for (let j = i + 1; j < allValues.length; j++) {\n      expectedDisagreement += (allValues[i]! - allValues[j]!) ** 2\n      expectedCount++\n    }\n  }\n  expectedDisagreement = expectedCount > 0 ? expectedDisagreement / expectedCount : 0\n\n  if (expectedDisagreement === 0) return 1\n  return 1 - observedDisagreement / expectedDisagreement\n}\n\n/**\n * Mann-Whitney U test for comparing two independent groups.\n * Returns U statistic and approximate p-value (normal approximation).\n */\nexport function mannWhitneyU(a: number[], b: number[]): { u: number; p: number } {\n  if (a.length === 0 || b.length === 0) return { u: 0, p: 1 }\n\n  const n1 = a.length\n  const n2 = b.length\n\n  // Rank all values together\n  const combined = [\n    ...a.map((v) => ({ v, group: 'a' as const })),\n    ...b.map((v) => ({ v, group: 'b' as const })),\n  ].sort((x, y) => x.v - y.v)\n\n  // Assign ranks with tie handling\n  const ranks: number[] = new Array(combined.length)\n  let i = 0\n  while (i < combined.length) {\n    let j = i\n    while (j < combined.length && combined[j]!.v === combined[i]!.v) j++\n    const avgRank = (i + 1 + j) / 2\n    for (let k = i; k < j; k++) ranks[k] = avgRank\n    i = j\n  }\n\n  // Sum ranks for group a\n  let r1 = 0\n  for (let k = 0; k < combined.length; k++) {\n    if (combined[k]!.group === 'a') r1 += ranks[k]!\n  }\n\n  const u1 = r1 - (n1 * (n1 + 1)) / 2\n  const u2 = n1 * n2 - u1\n  const u = Math.min(u1, u2)\n\n  // Normal approximation for p-value\n  const mu = (n1 * n2) / 2\n  const sigma = Math.sqrt((n1 * n2 * (n1 + n2 + 1)) / 12)\n\n  if (sigma === 0) return { u, p: 1 }\n\n  const z = Math.abs(u - mu) / sigma\n  // Two-tailed p-value from z-score (approximation)\n  const p = 2 * (1 - normalCdf(z))\n\n  return { u, p }\n}\n\n/** Partial credit: returns 0-1 ratio of current toward target */\nexport function partialCredit(current: number, target: number): number {\n  if (target <= 0) return 1\n  return Math.min(1, Math.max(0, current / target))\n}\n\n/**\n * Paired t-test — before/after measurements on the SAME items.\n * Pairing removes inter-item variance, giving tighter significance than\n * an unpaired test when comparing prompt v1 vs prompt v2 on identical\n * scenarios.\n */\nexport function pairedTTest(\n  before: number[],\n  after: number[],\n): { t: number; df: number; p: number } {\n  if (before.length !== after.length) {\n    throw new ValidationError(\n      `pairedTTest: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  const n = before.length\n  if (n < 2) return { t: 0, df: 0, p: 1 }\n\n  const diffs = before.map((b, i) => after[i]! - b)\n  const mean = diffs.reduce((a, b) => a + b, 0) / n\n  const variance = diffs.reduce((acc, d) => acc + (d - mean) ** 2, 0) / (n - 1)\n  const se = Math.sqrt(variance / n)\n  if (se === 0) return { t: mean === 0 ? 0 : Infinity, df: n - 1, p: mean === 0 ? 1 : 0 }\n\n  const t = mean / se\n  const df = n - 1\n  const p = 2 * (1 - studentTCdf(Math.abs(t), df))\n  return { t, df, p }\n}\n\n/**\n * Wilcoxon signed-rank test — paired non-parametric alternative.\n * Use when the differences aren't normally distributed.\n */\nexport function wilcoxonSignedRank(before: number[], after: number[]): { w: number; p: number } {\n  if (before.length !== after.length) {\n    throw new ValidationError(\n      `wilcoxonSignedRank: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  const diffs = before.map((b, i) => after[i]! - b).filter((d) => d !== 0)\n  const n = diffs.length\n  if (n < 6) return { w: 0, p: 1 }\n\n  const absRanks = diffs\n    .map((d, i) => ({ abs: Math.abs(d), sign: Math.sign(d), i }))\n    .sort((a, b) => a.abs - b.abs)\n  const ranks: number[] = new Array(n)\n  let i = 0\n  while (i < n) {\n    let j = i\n    while (j < n && absRanks[j]!.abs === absRanks[i]!.abs) j++\n    const avg = (i + 1 + j) / 2\n    for (let k = i; k < j; k++) ranks[absRanks[k]!.i] = avg\n    i = j\n  }\n  let wPlus = 0\n  for (let k = 0; k < n; k++) if (diffs[k]! > 0) wPlus += ranks[k]!\n\n  const mean = (n * (n + 1)) / 4\n  const variance = (n * (n + 1) * (2 * n + 1)) / 24\n  const z = (wPlus - mean) / Math.sqrt(variance)\n  const p = 2 * (1 - normalCdf(Math.abs(z)))\n  return { w: wPlus, p }\n}\n\n/**\n * Cohen's d — standardized effect size for two independent groups.\n * Positive d means group b has higher mean than group a.\n * Rule of thumb: |d| < 0.2 negligible, 0.2–0.5 small, 0.5–0.8 medium, > 0.8 large.\n */\nexport function cohensD(a: number[], b: number[]): number {\n  if (a.length < 2 || b.length < 2) return 0\n  const meanA = a.reduce((x, y) => x + y, 0) / a.length\n  const meanB = b.reduce((x, y) => x + y, 0) / b.length\n  const varA = a.reduce((acc, x) => acc + (x - meanA) ** 2, 0) / (a.length - 1)\n  const varB = b.reduce((acc, x) => acc + (x - meanB) ** 2, 0) / (b.length - 1)\n  const pooled = Math.sqrt(\n    ((a.length - 1) * varA + (b.length - 1) * varB) / (a.length + b.length - 2),\n  )\n  if (pooled === 0) return 0\n  return (meanB - meanA) / pooled\n}\n\nexport type CliffsMagnitude = 'negligible' | 'small' | 'medium' | 'large'\n\n/**\n * Cliff's delta — a non-parametric effect size for two independent samples.\n * `δ = (#(after > before) − #(after < before)) / (n_before · n_after)`,\n * ranging [-1, 1]. Positive ⇒ `after` tends to exceed `before` (improvement).\n *\n * Distribution-free counterpart to Cohen's d: no normality assumption, robust\n * to the bounded/skewed score distributions judges produce. Pairs with\n * `pairedBootstrap` / `wilcoxonSignedRank` for the non-parametric reporting\n * path. Returns 0 when either sample is empty.\n */\nexport function cliffsDelta(before: number[], after: number[]): number {\n  const n = before.length * after.length\n  if (n === 0) return 0\n  let dominance = 0\n  for (const a of after) {\n    for (const b of before) {\n      if (a > b) dominance += 1\n      else if (a < b) dominance -= 1\n    }\n  }\n  return dominance / n\n}\n\n/**\n * Map a Cliff's delta to a qualitative magnitude using the standard\n * Romano et al. thresholds (|δ|): <0.147 negligible, <0.33 small,\n * <0.474 medium, else large.\n */\nexport function interpretCliffs(delta: number): CliffsMagnitude {\n  const d = Math.abs(delta)\n  if (d < 0.147) return 'negligible'\n  if (d < 0.33) return 'small'\n  if (d < 0.474) return 'medium'\n  return 'large'\n}\n\nexport interface WeightedCompositeInput {\n  /** Per-dimension scores (typically 0..1). */\n  dims: Record<string, number>\n  /** Weight per dimension. Every weighted dimension MUST be present in\n   *  `dims` — a weight for an absent dimension is a config error and throws,\n   *  because silently dropping it would renormalise the composite onto a\n   *  different denominator than intended. */\n  weights: Record<string, number>\n  /** Optional pass threshold; when set, the result reports `pass`. */\n  threshold?: number\n}\n\nexport interface WeightedCompositeResult {\n  composite: number\n  pass?: boolean\n}\n\n/**\n * Weighted composite over judge dimensions: `Σ(score_d · w_d) / Σ(w_d)` across\n * the weighted dimensions. The canonical replacement for the per-consumer\n * hand-rolled composite math (tax/legal/creative/gtm each ship a copy).\n *\n * Fail-loud: throws if a weighted dimension is missing from `dims`, if any\n * weight is negative, or if the weights sum to 0 — none of which can produce\n * a meaningful composite.\n */\nexport function weightedComposite(input: WeightedCompositeInput): WeightedCompositeResult {\n  const entries = Object.entries(input.weights)\n  if (entries.length === 0) {\n    throw new Error('weightedComposite: `weights` is empty — nothing to combine')\n  }\n  let weightedSum = 0\n  let weightTotal = 0\n  for (const [dim, weight] of entries) {\n    if (weight < 0) {\n      throw new Error(`weightedComposite: weight for '${dim}' is negative (${weight})`)\n    }\n    if (!(dim in input.dims)) {\n      throw new Error(\n        `weightedComposite: weighted dimension '${dim}' is absent from \\`dims\\` — ` +\n          'refusing to renormalise onto a different denominator',\n      )\n    }\n    weightedSum += input.dims[dim]! * weight\n    weightTotal += weight\n  }\n  if (weightTotal === 0) {\n    throw new Error('weightedComposite: weights sum to 0 — composite is undefined')\n  }\n  const composite = weightedSum / weightTotal\n  return input.threshold === undefined\n    ? { composite }\n    : { composite, pass: composite >= input.threshold }\n}\n\n// ── Corpus-wide inter-rater agreement ──────────────────────────────\n//\n// The legacy `interRaterReliability(judgeScores)` computes a within-item\n// Krippendorff α — multiple judges score *the same item* and we ask\n// \"how much do their scores agree on that item?\" Useful for a single\n// scenario, but it cannot answer \"how reliable are these judges across\n// the whole evaluation corpus?\"\n//\n// `corpusInterRaterAgreement` does the corpus-wide question properly.\n// Inputs are flat per-(item, judge, dimension) score records. For each\n// dimension we pivot to a complete [n_items × n_judges] matrix and feed\n// it to the ICC(2,1) + κ_w machinery already validated in\n// `judge-calibration.ts`. An overall pooled metric averages the\n// per-dimension ICC/κ across dimensions.\n\nexport interface CorpusScoreRecord {\n  /** Stable identifier for the rated item (scenario, span, turn, …). */\n  itemId: string\n  /** Identifier for the judge that produced this score. */\n  judgeName: string\n  /** Dimension name (matches `JudgeScore.dimension`). */\n  dimension: string\n  /** Numeric score; must be finite. */\n  score: number\n}\n\nexport interface CorpusAgreementPerDimension extends ContinuousAgreement {\n  dimension: string\n  /** Item IDs that contributed to this dimension's matrix (every judge scored them). */\n  itemIds: string[]\n  /** Judge IDs that contributed to this dimension's matrix. */\n  judgeIds: string[]\n}\n\nexport interface CorpusAgreementReport {\n  /** Per-dimension ICC(2,1) + κ_w + Pearson + Spearman + bootstrap CIs. */\n  perDimension: CorpusAgreementPerDimension[]\n  /** Mean ICC across dimensions (NaN if no dimension yielded a finite ICC). */\n  overallIcc: number\n  /** Mean weighted κ across dimensions (NaN if none finite). */\n  overallWeightedKappa: number\n  /** Dimensions evaluated (sorted). */\n  dimensions: string[]\n  /** Judges seen across the corpus (sorted). */\n  judgeIds: string[]\n}\n\nexport interface CorpusAgreementOptions extends ContinuousAgreementOptions {\n  /**\n   * Restrict the audit to these dimensions. Default = every dimension\n   * that appears in the input. A dimension named here but absent from\n   * the input throws — silent omission would corrupt the overall metric.\n   */\n  dimensions?: string[]\n  /**\n   * Restrict the audit to these judges. Default = every judge that\n   * appears in the input. A judge named here but absent from a\n   * dimension throws (see \"fail loud\" below).\n   */\n  judges?: string[]\n}\n\n/**\n * Corpus-wide inter-rater agreement across N items × M judges × D dimensions.\n *\n * For each dimension, builds the [n_items][n_judges] matrix of scores\n * (keeping only items every judge rated on that dimension), then runs\n * `continuousAgreement` to get ICC(2,1), κ_w, Pearson, Spearman, and\n * bootstrap CIs. Reports a pooled mean across dimensions as a single\n * \"is this judge panel reliable on this corpus?\" number.\n *\n * Fail-loud contract:\n *   - Empty input throws.\n *   - Fewer than 2 judges or fewer than 2 items per dimension throws.\n *   - A judge present in some dimensions but with zero scored items on\n *     another dimension throws (would silently shrink the matrix).\n *   - Duplicate (itemId, judgeName, dimension) records throw.\n */\nexport function corpusInterRaterAgreement(\n  records: CorpusScoreRecord[],\n  opts: CorpusAgreementOptions = {},\n): CorpusAgreementReport {\n  if (records.length === 0) {\n    throw new ValidationError('corpusInterRaterAgreement: no score records supplied')\n  }\n\n  const judgesSeen = new Set<string>()\n  const dimsSeen = new Set<string>()\n  // dimension → judge → itemId → score\n  const grid = new Map<string, Map<string, Map<string, number>>>()\n\n  for (const r of records) {\n    if (!Number.isFinite(r.score)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: non-finite score for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`,\n      )\n    }\n    judgesSeen.add(r.judgeName)\n    dimsSeen.add(r.dimension)\n    const byJudge = grid.get(r.dimension) ?? new Map<string, Map<string, number>>()\n    const byItem = byJudge.get(r.judgeName) ?? new Map<string, number>()\n    if (byItem.has(r.itemId)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: duplicate record for (item=${r.itemId}, judge=${r.judgeName}, dim=${r.dimension})`,\n      )\n    }\n    byItem.set(r.itemId, r.score)\n    byJudge.set(r.judgeName, byItem)\n    grid.set(r.dimension, byJudge)\n  }\n\n  const targetDims = opts.dimensions ?? [...dimsSeen].sort()\n  for (const d of targetDims) {\n    if (!dimsSeen.has(d)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${d}' was requested but no records carry it`,\n      )\n    }\n  }\n  const targetJudges = opts.judges ? [...opts.judges] : [...judgesSeen].sort()\n  for (const j of targetJudges) {\n    if (!judgesSeen.has(j)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: judge '${j}' was requested but produced no records`,\n      )\n    }\n  }\n  if (targetJudges.length < 2) {\n    throw new ValidationError(\n      `corpusInterRaterAgreement: need ≥2 judges, got ${targetJudges.length}`,\n    )\n  }\n\n  const perDimension: CorpusAgreementPerDimension[] = []\n  const iccs: number[] = []\n  const kappas: number[] = []\n\n  for (const dim of targetDims) {\n    const byJudge = grid.get(dim)!\n    // Fail loud: every requested judge must have scored ≥1 item on this dim.\n    const judgeItemCounts: Record<string, number> = {}\n    for (const j of targetJudges) {\n      const m = byJudge.get(j)\n      judgeItemCounts[j] = m?.size ?? 0\n    }\n    const emptyJudges = targetJudges.filter((j) => judgeItemCounts[j] === 0)\n    if (emptyJudges.length > 0) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${dim}' has no scores from judge(s) ${emptyJudges.join(', ')} (counts: ${JSON.stringify(judgeItemCounts)})`,\n      )\n    }\n\n    // Items rated by *every* requested judge on this dim.\n    let commonItems: Set<string> | null = null\n    for (const j of targetJudges) {\n      const ids = new Set(byJudge.get(j)!.keys())\n      if (commonItems === null) {\n        commonItems = ids\n      } else {\n        const prev: Set<string> = commonItems\n        commonItems = new Set([...prev].filter((x) => ids.has(x)))\n      }\n    }\n    const sortedItems = [...(commonItems ?? new Set<string>())].sort()\n    if (sortedItems.length < 2) {\n      throw new ValidationError(\n        `corpusInterRaterAgreement: dimension '${dim}' has ${sortedItems.length} item(s) rated by all ${targetJudges.length} judges (need ≥2)`,\n      )\n    }\n\n    const matrix: number[][] = sortedItems.map((itemId) =>\n      targetJudges.map((j) => byJudge.get(j)!.get(itemId)!),\n    )\n    const agreement = continuousAgreement(matrix, opts)\n    perDimension.push({\n      ...agreement,\n      dimension: dim,\n      itemIds: sortedItems,\n      judgeIds: [...targetJudges],\n    })\n    if (Number.isFinite(agreement.icc)) iccs.push(agreement.icc)\n    if (Number.isFinite(agreement.weightedKappa)) kappas.push(agreement.weightedKappa)\n  }\n\n  const mean = (xs: number[]) =>\n    xs.length === 0 ? Number.NaN : xs.reduce((a, b) => a + b, 0) / xs.length\n  return {\n    perDimension,\n    overallIcc: mean(iccs),\n    overallWeightedKappa: mean(kappas),\n    dimensions: targetDims,\n    judgeIds: targetJudges,\n  }\n}\n\n/**\n * Convenience adapter for `JudgeScore[]` data keyed externally by item.\n *\n * Use when you have per-item arrays of `JudgeScore[]` (e.g. one\n * `ScenarioResult.judgeScores` per scenario) and want corpus-wide\n * agreement without manually flattening. `itemId` must be unique per\n * row of `itemsScores`.\n */\nexport function corpusInterRaterAgreementFromJudgeScores(\n  itemsScores: Array<{ itemId: string; scores: JudgeScore[] }>,\n  opts: CorpusAgreementOptions = {},\n): CorpusAgreementReport {\n  const records: CorpusScoreRecord[] = []\n  const seen = new Set<string>()\n  for (const { itemId, scores } of itemsScores) {\n    if (seen.has(itemId)) {\n      throw new ValidationError(\n        `corpusInterRaterAgreementFromJudgeScores: duplicate itemId '${itemId}'`,\n      )\n    }\n    seen.add(itemId)\n    for (const s of scores) {\n      records.push({\n        itemId,\n        judgeName: s.judgeName,\n        dimension: s.dimension,\n        score: s.score,\n      })\n    }\n  }\n  return corpusInterRaterAgreement(records, opts)\n}\n\n/** Student-t CDF approximation via Abramowitz-Stegun series. */\nfunction studentTCdf(t: number, df: number): number {\n  if (df <= 0) return 0.5\n  if (df > 100) return normalCdf(t)\n  const x = df / (df + t * t)\n  const a = df / 2\n  const b = 0.5\n  const ib = incompleteBeta(x, a, b)\n  return t >= 0 ? 1 - 0.5 * ib : 0.5 * ib\n}\n\n/** Regularized incomplete beta function via continued fraction (Lentz). */\nfunction incompleteBeta(x: number, a: number, b: number): number {\n  if (x <= 0) return 0\n  if (x >= 1) return 1\n  const lnBeta = lnGamma(a) + lnGamma(b) - lnGamma(a + b)\n  const front = Math.exp(Math.log(x) * a + Math.log(1 - x) * b - lnBeta) / a\n  const maxIter = 200\n  const eps = 3e-7\n  let c = 1\n  let d = 1 - ((a + b) * x) / (a + 1)\n  if (Math.abs(d) < 1e-30) d = 1e-30\n  d = 1 / d\n  let f = d\n  for (let m = 1; m <= maxIter; m++) {\n    const m2 = 2 * m\n    let num = (m * (b - m) * x) / ((a + m2 - 1) * (a + m2))\n    d = 1 + num * d\n    if (Math.abs(d) < 1e-30) d = 1e-30\n    c = 1 + num / c\n    if (Math.abs(c) < 1e-30) c = 1e-30\n    d = 1 / d\n    f *= d * c\n    num = -((a + m) * (a + b + m) * x) / ((a + m2) * (a + m2 + 1))\n    d = 1 + num * d\n    if (Math.abs(d) < 1e-30) d = 1e-30\n    c = 1 + num / c\n    if (Math.abs(c) < 1e-30) c = 1e-30\n    d = 1 / d\n    const delta = d * c\n    f *= delta\n    if (Math.abs(delta - 1) < eps) break\n  }\n  return front * f\n}\n\n/** Lanczos approximation to ln Γ(z). */\nfunction lnGamma(z: number): number {\n  const g = 7\n  const coefs = [\n    0.99999999999980993, 676.5203681218851, -1259.1392167224028, 771.32342877765313,\n    -176.61502916214059, 12.507343278686905, -0.13857109526572012, 9.9843695780195716e-6,\n    1.5056327351493116e-7,\n  ]\n  if (z < 0.5) {\n    return Math.log(Math.PI / Math.sin(Math.PI * z)) - lnGamma(1 - z)\n  }\n  z -= 1\n  let x = coefs[0]!\n  for (let i = 1; i < g + 2; i++) x += coefs[i]! / (z + i)\n  const t = z + g + 0.5\n  return 0.5 * Math.log(2 * Math.PI) + (z + 0.5) * Math.log(t) - t + Math.log(x)\n}\n\n// Standard normal CDF approximation (Abramowitz and Stegun)\nfunction normalCdf(x: number): number {\n  const a1 = 0.254829592\n  const a2 = -0.284496736\n  const a3 = 1.421413741\n  const a4 = -1.453152027\n  const a5 = 1.061405429\n  const p = 0.3275911\n\n  const sign = x < 0 ? -1 : 1\n  const absX = Math.abs(x)\n  const t = 1 / (1 + p * absX)\n  const y = 1 - ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * Math.exp((-absX * absX) / 2)\n\n  return 0.5 * (1 + sign * y)\n}\n\n// ── Power analysis + multiple-comparison correction ──────────────────\n\n/**\n * Required N per arm for a two-sample comparison at target effect size,\n * alpha, and power. Normal-approximation formula:\n *   n = 2 * ( (z_{1-α/2} + z_{1-β}) / d )^2\n * where d is Cohen's d. Returns Infinity for effect ≤ 0.\n */\nexport function requiredSampleSize(opts: {\n  effect: number\n  alpha?: number\n  power?: number\n  twoSided?: boolean\n}): number {\n  const effect = opts.effect\n  if (!Number.isFinite(effect) || effect <= 0) return Infinity\n  const alpha = opts.alpha ?? 0.05\n  const power = opts.power ?? 0.8\n  const twoSided = opts.twoSided ?? true\n  const zAlpha = zQuantile(twoSided ? 1 - alpha / 2 : 1 - alpha)\n  const zBeta = zQuantile(power)\n  const n = 2 * ((zAlpha + zBeta) / effect) ** 2\n  return Math.ceil(n)\n}\n\n/**\n * Minimum detectable paired effect (standardised units) for a target paired\n * sample size: d_min = (z_{1-α/2} + z_β) / sqrt(n_paired). Multiply by\n * sd(deltas) for score units; treat as a lower bound — Wilcoxon and bootstrap\n * have asymptotic relative efficiency below 1 vs the t-test on heavy tails.\n */\nexport function pairedMde(opts: {\n  nPaired: number\n  alpha?: number\n  power?: number\n  twoSided?: boolean\n}): number {\n  if (!Number.isFinite(opts.nPaired) || opts.nPaired <= 0) return Infinity\n  const alpha = opts.alpha ?? 0.05\n  const power = opts.power ?? 0.8\n  const twoSided = opts.twoSided ?? true\n  const zAlpha = zQuantile(twoSided ? 1 - alpha / 2 : 1 - alpha)\n  const zBeta = zQuantile(power)\n  return (zAlpha + zBeta) / Math.sqrt(opts.nPaired)\n}\n\n/** Bonferroni adjustment: multiply every p-value by the test count, clamp at 1. */\nexport function bonferroni(\n  pValues: number[],\n  alpha = 0.05,\n): { adjusted: number[]; significant: boolean[] } {\n  const k = pValues.length\n  const adjusted = pValues.map((p) => Math.min(1, p * k))\n  const significant = adjusted.map((p) => p < alpha)\n  return { adjusted, significant }\n}\n\n/**\n * Benjamini–Hochberg false discovery rate. Returns adjusted q-values and\n * significance at the target FDR; handles ties and preserves q monotonicity.\n */\nexport function benjaminiHochberg(\n  pValues: number[],\n  fdr = 0.05,\n): { qValues: number[]; significant: boolean[] } {\n  const n = pValues.length\n  if (n === 0) return { qValues: [], significant: [] }\n  const indexed = pValues.map((p, i) => ({ p, i })).sort((a, b) => a.p - b.p)\n  const q = new Array<number>(n)\n  let minRight = 1\n  for (let k = n - 1; k >= 0; k--) {\n    const rank = k + 1\n    const entry = indexed[k]!\n    const raw = (entry.p * n) / rank\n    const bounded = Math.min(minRight, raw)\n    minRight = bounded\n    q[entry.i] = Math.min(1, bounded)\n  }\n  const significant = q.map((v) => v < fdr)\n  return { qValues: q, significant }\n}\n\n// ── Paired bootstrap (promotion-gate effect size) ────────────────────\n\nexport interface PairedBootstrapResult {\n  /** Number of paired observations. */\n  n: number\n  /** Median of paired deltas (after − before). */\n  median: number\n  /** Mean of paired deltas. */\n  mean: number\n  /** Lower bound of the bootstrap CI on the chosen statistic. */\n  low: number\n  /** Upper bound of the bootstrap CI on the chosen statistic. */\n  high: number\n  /** Confidence level used (e.g. 0.95). */\n  confidence: number\n  /** Number of bootstrap resamples used. */\n  resamples: number\n}\n\nexport interface PairedBootstrapOptions {\n  /** Confidence level. Default 0.95. */\n  confidence?: number\n  /** Bootstrap resample count. Default 2000. */\n  resamples?: number\n  /** Statistic to bootstrap. Default 'median'. */\n  statistic?: 'median' | 'mean'\n  /** Deterministic seed. If omitted, uses Math.random(). */\n  seed?: number\n}\n\n/**\n * Paired bootstrap on (after − before) deltas. Returns a CI on the chosen\n * statistic (median by default); pairs are resampled with replacement. The\n * lower bound is what the promotion gate checks — `low > threshold` means the\n * gain is real at the confidence level. Throws on unequal sample sizes.\n */\nexport function pairedBootstrap(\n  before: number[],\n  after: number[],\n  opts: PairedBootstrapOptions = {},\n): PairedBootstrapResult {\n  if (before.length !== after.length) {\n    throw new Error(`pairedBootstrap: unequal sample sizes (${before.length} vs ${after.length})`)\n  }\n  const confidence = opts.confidence ?? 0.95\n  const resamples = opts.resamples ?? 2000\n  const statistic = opts.statistic ?? 'median'\n  if (confidence <= 0 || confidence >= 1) {\n    throw new Error(`pairedBootstrap: confidence must be in (0,1), got ${confidence}`)\n  }\n\n  const n = before.length\n  const deltas = before.map((b, i) => after[i]! - b)\n  if (n === 0) {\n    return { n: 0, median: 0, mean: 0, low: 0, high: 0, confidence, resamples }\n  }\n  if (n === 1) {\n    const d = deltas[0]!\n    return { n: 1, median: d, mean: d, low: d, high: d, confidence, resamples }\n  }\n\n  const rng = makeRng(opts.seed)\n  const samples = new Array<number>(resamples)\n  for (let b = 0; b < resamples; b++) {\n    if (statistic === 'mean') {\n      let sum = 0\n      for (let k = 0; k < n; k++) {\n        sum += deltas[Math.floor(rng() * n)]!\n      }\n      samples[b] = sum / n\n    } else {\n      const acc = new Array<number>(n)\n      for (let k = 0; k < n; k++) {\n        acc[k] = deltas[Math.floor(rng() * n)]!\n      }\n      samples[b] = medianInPlace(acc)\n    }\n  }\n  samples.sort((a, b) => a - b)\n\n  const alpha = 1 - confidence\n  const lowIdx = Math.floor((alpha / 2) * resamples)\n  const highIdx = Math.min(resamples - 1, Math.ceil((1 - alpha / 2) * resamples) - 1)\n\n  return {\n    n,\n    median: medianInPlace([...deltas]),\n    mean: deltas.reduce((s, x) => s + x, 0) / n,\n    low: samples[lowIdx]!,\n    high: samples[Math.max(highIdx, lowIdx)]!,\n    confidence,\n    resamples,\n  }\n}\n\n// ── Anytime-valid e-process (betting test-martingale) ────────────────\n\nexport interface EProcessOptions {\n  /** Type-I error budget. The process decides when wealth ≥ 1/alpha\n   *  (Ville's inequality). Default 0.05. */\n  alpha?: number\n  /** Truncation bound on the predictable bet λ ∈ [0, maxBet]. Must satisfy\n   *  maxBet < 1/nullMean so every wealth factor stays strictly positive.\n   *  Default 0.5. */\n  maxBet?: number\n  /** The null boundary m₀ for H0: E[x] ≤ m₀ on x ∈ [0,1]. Default 0.5\n   *  (the paired-delta encoding x = (d+1)/2 maps \"no effect\" to 1/2).\n   *  A pre-registered minEffect shifts this — see `sequentialPairedGate`. */\n  nullMean?: number\n}\n\nexport interface EProcessStep {\n  /** Current wealth W_n — the e-value against H0 after n observations. */\n  wealth: number\n  /** Observations consumed so far. */\n  n: number\n  /** True from the first n where W_n ≥ 1/alpha onward (sticky). */\n  decided: boolean\n}\n\nexport interface EProcessState extends EProcessStep {\n  alpha: number\n  maxBet: number\n  nullMean: number\n  /** The decision boundary 1/alpha. */\n  threshold: number\n  /** Observation count at the first threshold crossing; undefined until decided. */\n  decidedAtN?: number\n}\n\nexport interface EProcess {\n  /** Consume one observation x ∈ [0,1]. Throws on non-finite / out-of-range\n   *  input — a silent clamp would corrupt the type-I guarantee. */\n  update(x: number): EProcessStep\n  state(): EProcessState\n}\n\n/**\n * Betting test-martingale for bounded observations — the e-process core of\n * anytime-valid sequential testing (Waudby-Smith & Ramdas, \"Estimating means\n * of bounded random variables by betting\", JRSS-B 2024).\n *\n * Observations x_i ∈ [0,1]; H0: E[x] ≤ m₀ (`nullMean`, default 1/2). Wealth\n *\n *   W_t = Π_{i≤t} (1 + λ_i (x_i − m₀)),  W_0 = 1\n *\n * with the truncated GROW-style plug-in bet computed from PRIOR observations:\n *\n *   λ_i = clamp((μ̂_{i−1} − m₀) / (σ̂²_{i−1} + (μ̂_{i−1} − m₀)²), 0, maxBet)\n *\n * where μ̂/σ̂² are the shrunk running estimates μ̂_t = (1/2 + Σx_i)/(t+1),\n * σ̂²_t = (1/4 + Σ(x_i − μ̂_i)²)/(t+1).\n *\n * PREDICTABILITY INVARIANT (load-bearing): λ_i is a function of x_1..x_{i−1}\n * ONLY — it may never see x_i. With λ_i ≥ 0 predictable, each factor has\n * E[1 + λ_i(x_i − m₀) | past] ≤ 1 under H0, so W is a nonnegative\n * supermartingale and Ville's inequality gives P(∃t: W_t ≥ 1/α) ≤ α — the\n * type-I guarantee holds at ANY data-dependent stopping time. λ_1 is always 0\n * (no prior evidence), so the first observation never moves wealth.\n *\n * `decided` latches at the first crossing W_t ≥ 1/α and never un-latches;\n * wealth keeps updating after the crossing (the e-process remains valid), but\n * the decision time is the first crossing.\n */\nexport function eProcess(opts: EProcessOptions = {}): EProcess {\n  const alpha = opts.alpha ?? 0.05\n  const maxBet = opts.maxBet ?? 0.5\n  const nullMean = opts.nullMean ?? 0.5\n  if (!Number.isFinite(alpha) || alpha <= 0 || alpha >= 1) {\n    throw new ValidationError(`eProcess: alpha must be in (0,1), got ${alpha}`)\n  }\n  if (!Number.isFinite(nullMean) || nullMean <= 0 || nullMean >= 1) {\n    throw new ValidationError(`eProcess: nullMean must be in (0,1), got ${nullMean}`)\n  }\n  if (!Number.isFinite(maxBet) || maxBet <= 0 || maxBet >= 1 / nullMean) {\n    throw new ValidationError(\n      `eProcess: maxBet must be in (0, 1/nullMean=${(1 / nullMean).toFixed(4)}) so wealth ` +\n        `factors stay positive, got ${maxBet}`,\n    )\n  }\n  const threshold = 1 / alpha\n  let wealth = 1\n  let n = 0\n  let decided = false\n  let decidedAtN: number | undefined\n  // Running sums over observations consumed so far — read BEFORE folding in\n  // the next x, so every bet is predictable.\n  let sumX = 0\n  let varSum = 0\n  return {\n    update(x: number): EProcessStep {\n      if (typeof x !== 'number' || !Number.isFinite(x) || x < 0 || x > 1) {\n        throw new ValidationError(\n          `eProcess: observation must be a finite number in [0,1], got ${x}`,\n        )\n      }\n      // λ from prior observations ONLY — x has not touched sumX/varSum yet.\n      const muPrev = (0.5 + sumX) / (n + 1)\n      const varPrev = (0.25 + varSum) / (n + 1)\n      const edge = muPrev - nullMean\n      const lambda = Math.min(maxBet, Math.max(0, edge / (varPrev + edge * edge)))\n      wealth *= 1 + lambda * (x - nullMean)\n      n += 1\n      sumX += x\n      const muNow = (0.5 + sumX) / (n + 1)\n      varSum += (x - muNow) ** 2\n      if (!decided && wealth >= threshold) {\n        decided = true\n        decidedAtN = n\n      }\n      return { wealth, n, decided }\n    },\n    state(): EProcessState {\n      return { wealth, n, decided, alpha, maxBet, nullMean, threshold, decidedAtN }\n    },\n  }\n}\n\n// ── private stats helpers ────────────────────────────────────────────\n\n/** Standard-normal inverse CDF (Acklam approximation). */\nfunction zQuantile(p: number): number {\n  if (p <= 0 || p >= 1) {\n    if (p === 0) return -Infinity\n    if (p === 1) return Infinity\n    return NaN\n  }\n  const a = [\n    -3.969683028665376e1, 2.209460984245205e2, -2.759285104469687e2, 1.38357751867269e2,\n    -3.066479806614716e1, 2.506628277459239,\n  ]\n  const b = [\n    -5.447609879822406e1, 1.615858368580409e2, -1.556989798598866e2, 6.680131188771972e1,\n    -1.328068155288572e1,\n  ]\n  const c = [\n    -7.784894002430293e-3, -3.223964580411365e-1, -2.400758277161838, -2.549732539343734,\n    4.374664141464968, 2.938163982698783,\n  ]\n  const d = [7.784695709041462e-3, 3.224671290700398e-1, 2.445134137142996, 3.754408661907416]\n  const pLow = 0.02425\n  const pHigh = 1 - pLow\n  let q: number\n  let r: number\n  if (p < pLow) {\n    q = Math.sqrt(-2 * Math.log(p))\n    return (\n      (((((c[0]! * q + c[1]!) * q + c[2]!) * q + c[3]!) * q + c[4]!) * q + c[5]!) /\n      ((((d[0]! * q + d[1]!) * q + d[2]!) * q + d[3]!) * q + 1)\n    )\n  }\n  if (p <= pHigh) {\n    q = p - 0.5\n    r = q * q\n    return (\n      ((((((a[0]! * r + a[1]!) * r + a[2]!) * r + a[3]!) * r + a[4]!) * r + a[5]!) * q) /\n      (((((b[0]! * r + b[1]!) * r + b[2]!) * r + b[3]!) * r + b[4]!) * r + 1)\n    )\n  }\n  q = Math.sqrt(-2 * Math.log(1 - p))\n  return (\n    -(((((c[0]! * q + c[1]!) * q + c[2]!) * q + c[3]!) * q + c[4]!) * q + c[5]!) /\n    ((((d[0]! * q + d[1]!) * q + d[2]!) * q + d[3]!) * q + 1)\n  )\n}\n\nfunction medianInPlace(xs: number[]): number {\n  if (xs.length === 0) return 0\n  xs.sort((a, b) => a - b)\n  const mid = Math.floor(xs.length / 2)\n  return xs.length % 2 === 0 ? (xs[mid - 1]! + xs[mid]!) / 2 : xs[mid]!\n}\n\nfunction makeRng(seed: number | undefined): () => number {\n  if (seed === undefined) return Math.random\n  return mulberry32(seed)\n}\n\n/** Tiny seedable PRNG (mulberry32) — deterministic resampling/shuffling, not\n *  cryptographic. Exported so e-process shuffles and bootstrap resampling\n *  share ONE PRNG implementation; a seed is REQUIRED (unseeded randomness in\n *  gate verdicts is non-reproducible by construction). */\nexport function mulberry32(seed: number): () => number {\n  let s = seed | 0 || 0x9e3779b9\n  return () => {\n    s = (s + 0x6d2b79f5) | 0\n    let t = s\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n"],"mappings":";;;;;AA8CO,SAAS,eACd,QACA,WACmB;AACnB,QAAM,MAAM,oBAAI,IAAsC;AACtD,aAAW,KAAK,OAAQ,KAAI,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAAC;AACrE,aAAW,KAAK,WAAW;AACzB,UAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;AAC9B,QAAI,MAAO,OAAM,IAAI,EAAE;AAAA,EACzB;AACA,QAAM,SAAS,CAAC,GAAG,IAAI,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC;AACnE,QAAM,IAAI,OAAO;AACjB,MAAI,IAAI,GAAG;AACT,WAAO,EAAE,GAAG,SAAS,KAAK,OAAO,KAAK,KAAK,KAAK,YAAY,CAAC,EAAE;AAAA,EACjE;AACA,QAAM,SAAS,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;AACpC,QAAM,SAAS,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;AACpC,QAAM,UAAU,SAAS,QAAQ,MAAM;AACvC,QAAM,QAAQ,cAAc,OAAO,IAAI,KAAK,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,CAAC;AAC1E,QAAM,WAAW,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;AACtD,QAAM,MAAM,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAClD,QAAM,QAAQ,CAAC,GAAG,IAAI,QAAQ,CAAC,EAC5B,OAAO,CAAC,CAAC,EAAE,CAAC,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC,EACtC,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,EACrF,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,CAAC;AACb,SAAO,EAAE,GAAG,SAAS,OAAO,KAAK,YAAY,MAAM;AACrD;AAeO,SAAS,eAAe,QAAgD;AAC7E,QAAM,QAAQ,oBAAI,IAAiD;AACnE,aAAW,KAAK,QAAQ;AACtB,UAAM,OAAO,MAAM,IAAI,EAAE,MAAM,KAAK,CAAC;AACrC,QAAI,EAAE,qBAAqB,QAAS,MAAK,QAAQ,EAAE;AAAA,aAC1C,EAAE,qBAAqB,SAAU,MAAK,SAAS,EAAE;AAC1D,UAAM,IAAI,EAAE,QAAQ,IAAI;AAAA,EAC1B;AACA,QAAM,SAAmB,CAAC;AAC1B,aAAW,EAAE,OAAO,OAAO,KAAK,MAAM,OAAO,GAAG;AAC9C,QAAI,UAAU,UAAa,WAAW,OAAW,QAAO,KAAK,QAAQ,MAAM;AAAA,EAC7E;AACA,MAAI,OAAO,WAAW,EAAG,QAAO,EAAE,UAAU,GAAG,GAAG,EAAE;AACpD,SAAO,EAAE,UAAU,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO,QAAQ,GAAG,OAAO,OAAO;AACzF;AAQO,SAAS,cACd,SACqB;AACrB,QAAM,IAAI,QAAQ;AAClB,MAAI,IAAI,EAAG,QAAO,EAAE,SAAS,KAAK,EAAE;AACpC,SAAO;AAAA,IACL,SAAS;AAAA,MACP,QAAQ,IAAI,CAAC,MAAM,EAAE,SAAS;AAAA,MAC9B,QAAQ,IAAI,CAAC,MAAM,EAAE,KAAK;AAAA,IAC5B;AAAA,IACA;AAAA,EACF;AACF;AAeO,SAAS,eACd,SACsB;AACtB,QAAM,MAAM,QAAQ,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AAChE,QAAM,OAAO,QAAQ,OAAO,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK;AAClE,MAAI,IAAI,WAAW,KAAK,KAAK,WAAW;AACtC,WAAO,EAAE,cAAc,GAAG,iBAAiB,GAAG,WAAW,GAAG,GAAG,EAAE;AACnE,QAAM,SAAS,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI;AACpD,QAAM,UAAU,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK;AACvD,SAAO;AAAA,IACL,cAAc;AAAA,IACd,iBAAiB;AAAA,IACjB,WAAW,SAAS;AAAA,IACpB,GAAG,QAAQ;AAAA,EACb;AACF;AAIA,SAAS,SAAS,GAAa,GAAqB;AAClD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAG,QAAO;AAClD,QAAM,KAAK,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE;AAC5C,QAAM,KAAK,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE;AAC5C,MAAI,MAAM,GACR,KAAK,GACL,KAAK;AACP,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,WAAO,KAAK;AACZ,UAAM,KAAK;AACX,UAAM,KAAK;AAAA,EACb;AACA,MAAI,OAAO,KAAK,OAAO,EAAG,QAAO,OAAO,KAAK,OAAO,IAAI,IAAI;AAC5D,SAAO,MAAM,KAAK,KAAK,KAAK,EAAE;AAChC;AAGA,SAAS,cAAc,GAAa,GAAqB;AACvD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAG,QAAO;AACpD,QAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;AAC/B,QAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;AAC/B,QAAM,IAAI,MAAM,MAAM;AACtB,MAAI,IAAI,EAAG,QAAO;AAClB,QAAM,WAAuB,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;AACjF,QAAM,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACnC,QAAM,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACnC,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,UAAM,KAAK,EAAE,CAAC,IAAK;AACnB,UAAM,MAAM,SAAS,EAAE;AACvB,QAAI,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK;AAC3B,YAAQ,EAAE;AACV,YAAQ,EAAE;AAAA,EACZ;AACA,MAAI,MAAM;AACV,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM;AACpC,YAAM,WAAY,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAK,EAAE;AAC/C,aAAO,IAAI,SAAS,CAAC,EAAG,CAAC;AACzB,aAAO,IAAI;AAAA,IACb;AAAA,EACF;AACA,MAAI,QAAQ,EAAG,QAAO;AACtB,SAAO,IAAI,MAAM;AACnB;AAqEO,SAAS,oBACd,QACA,OAAmC,CAAC,GACf;AACrB,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,UAAU,KAAK,WAAW;AAChC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,UAAU,KAAK,WAAW;AAEhC,QAAM,SAAS,OAAO,OAAO,CAAC,QAAQ,IAAI,UAAU,KAAK,IAAI,MAAM,CAAC,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC;AAC7F,QAAM,SAAS,OAAO,CAAC,GAAG,UAAU;AAEpC,QAAM,QAAQ,OAAO,OAAO,CAAC,QAAQ,IAAI,WAAW,MAAM;AAC1D,QAAM,SAAS,MAAM;AAErB,MAAI,SAAS,KAAK,SAAS,GAAG;AAC5B,WAAO;AAAA,MACL,eAAe;AAAA,MACf,KAAK;AAAA,MACL,SAAS;AAAA,MACT,UAAU;AAAA,MACV,IAAI,EAAE,KAAK,CAAC,KAAK,GAAG,GAAG,eAAe,CAAC,KAAK,GAAG,EAAE;AAAA,MACjD,GAAG;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,QAAM,QAAQ,wBAAwB,OAAO,OAAO;AACpD,QAAM,MAAM,MAAM,KAAK;AACvB,QAAM,UAAU,YAAY,OAAO,QAAQ;AAC3C,QAAM,WAAW,YAAY,OAAO,SAAS;AAE7C,QAAM,QAA0B,CAAC,KAAK,GAAG;AACzC,QAAM,UAA4B,CAAC,KAAK,GAAG;AAC3C,MAAI,YAAY,GAAG;AACjB,UAAM,MAAM,WAAW,IAAI;AAC3B,UAAM,OAAiB,CAAC;AACxB,UAAM,SAAmB,CAAC;AAC1B,aAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,YAAM,SAAqB,IAAI,MAAM,MAAM;AAC3C,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,eAAO,CAAC,IAAI,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC;AAAA,MAC9C;AACA,YAAM,OAAO,MAAM,MAAM;AACzB,YAAM,KAAK,wBAAwB,QAAQ,OAAO;AAClD,UAAI,OAAO,SAAS,IAAI,EAAG,MAAK,KAAK,IAAI;AACzC,UAAI,OAAO,SAAS,EAAE,EAAG,QAAO,KAAK,EAAE;AAAA,IACzC;AACA,UAAM,CAAC,IAAI,EAAE,IAAI,iBAAiB,OAAO;AACzC,QAAI,KAAK,SAAS,GAAG;AACnB,WAAK,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACzB,YAAM,CAAC,IAAI,SAAS,MAAM,EAAE;AAC5B,YAAM,CAAC,IAAI,SAAS,MAAM,EAAE;AAAA,IAC9B;AACA,QAAI,OAAO,SAAS,GAAG;AACrB,aAAO,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC3B,cAAQ,CAAC,IAAI,SAAS,QAAQ,EAAE;AAChC,cAAQ,CAAC,IAAI,SAAS,QAAQ,EAAE;AAAA,IAClC;AAAA,EACF;AAEA,SAAO;AAAA,IACL,eAAe;AAAA,IACf;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI,EAAE,KAAK,OAAO,eAAe,QAAQ;AAAA,IACzC,GAAG;AAAA,IACH;AAAA,EACF;AACF;AAmBO,SAAS,yBACd,QACA,WACA,OAAmC,CAAC,GACP;AAC7B,QAAM,OAAO,eAAe,QAAQ,SAAS;AAC7C,QAAM,MAAM,oBAAI,IAAsC;AACtD,aAAW,KAAK,OAAQ,KAAI,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,GAAG,IAAI,CAAC;AACrE,aAAW,KAAK,WAAW;AACzB,UAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;AAC9B,QAAI,MAAO,OAAM,IAAI,EAAE;AAAA,EACzB;AACA,QAAM,OAAmB,CAAC;AAC1B,aAAW,KAAK,IAAI,OAAO,GAAG;AAC5B,QAAI,OAAO,SAAS,EAAE,CAAC,EAAG,MAAK,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;AAAA,EAChD;AACA,QAAM,YAAY,oBAAoB,MAAM,IAAI;AAChD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,yBAAyB,UAAU;AAAA,IACnC,KAAK,UAAU;AAAA,IACf,UAAU,UAAU;AAAA,IACpB,IAAI,UAAU;AAAA,EAChB;AACF;AAgBA,SAAS,wBAAwB,MAAkB,QAAwC;AACzF,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,SAAS,KAAK,CAAC,EAAG;AACxB,MAAI,SAAS,EAAG,QAAO;AACvB,QAAM,MACJ,WAAW,WACP,CAAC,GAAW,MAAc,KAAK,IAAI,IAAI,CAAC,IACxC,CAAC,GAAW,OAAe,IAAI,MAAM;AAC3C,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,WAAS,KAAK,GAAG,KAAK,QAAQ,MAAM;AAClC,aAAS,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;AACvC,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAE;AACpC,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAE;AACpC,YAAM,IAAI,EAAE;AACZ,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAO,IAAI,EAAE,CAAC,GAAI,EAAE,CAAC,CAAE;AACnD,aAAO;AAEP,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,iBAAS,IAAI,GAAG,IAAI,GAAG,IAAK,QAAO,IAAI,EAAE,CAAC,GAAI,EAAE,CAAC,CAAE;AAAA,MACrD;AACA,aAAO,IAAI;AACX,UAAI,QAAQ,GAAG;AAGb,eAAO,QAAQ,IAAI,IAAI;AAAA,MACzB,OAAO;AACL,eAAO,IAAI,MAAM;AAAA,MACnB;AACA;AAAA,IACF;AAAA,EACF;AACA,SAAO,UAAU,IAAI,MAAM,MAAM;AACnC;AAUA,SAAS,MAAM,MAA0B;AACvC,QAAM,IAAI,KAAK;AACf,MAAI,IAAI,EAAG,QAAO;AAClB,QAAM,IAAI,KAAK,CAAC,EAAG;AACnB,MAAI,IAAI,EAAG,QAAO;AAGlB,QAAM,WAAW,KAAK,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC;AAErE,QAAM,WAAW,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACpC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,MAAK,KAAK,CAAC,EAAG,CAAC;AAC3C,aAAS,CAAC,IAAI,IAAI;AAAA,EACpB;AAEA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,UAAS,SAAS,CAAC;AAC/C,WAAS;AAET,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,SAAQ,SAAS,CAAC,IAAK,UAAU;AAC7D,SAAO;AACP,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,SAAQ,SAAS,CAAC,IAAK,UAAU;AAC7D,SAAO;AACP,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,SAAQ,KAAK,CAAC,EAAG,CAAC,IAAK,UAAU;AAAA,EAC/D;AACA,QAAM,MAAM,MAAM,MAAM;AAExB,QAAM,MAAM,IAAI;AAChB,QAAM,MAAM,IAAI;AAChB,QAAM,OAAO,IAAI,MAAM,IAAI;AAC3B,QAAM,MAAM,MAAM;AAClB,QAAM,MAAM,MAAM;AAClB,QAAM,MAAM,MAAM,IAAI,MAAM,MAAM;AAElC,QAAM,QAAQ,OAAO,IAAI,KAAK,MAAO,KAAK,MAAM,OAAQ;AACxD,MAAI,UAAU,GAAG;AAGf,WAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI;AAAA,EACtC;AACA,UAAQ,MAAM,OAAO;AACvB;AAGA,SAAS,YAAY,MAAkB,IAAkD;AACvF,QAAM,IAAI,KAAK,CAAC,GAAG,UAAU;AAC7B,MAAI,IAAI,EAAG,QAAO;AAClB,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAE;AACnC,YAAM,IAAI,KAAK,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAE;AACnC,YAAM,IAAI,GAAG,GAAG,CAAC;AACjB,UAAI,OAAO,SAAS,CAAC,GAAG;AACtB,eAAO;AACP;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,UAAU,IAAI,MAAM,MAAM;AACnC;AAGA,SAAS,UAAU,GAAa,GAAqB;AACnD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAG,QAAO;AAClD,SAAO,SAAS,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC;AAClD;AAEA,SAAS,aAAa,IAAwB;AAC5C,QAAM,IAAI,GAAG;AACb,QAAM,UAAU,GAAG,IAAI,CAAC,GAAGA,QAAO,EAAE,GAAG,GAAAA,GAAE,EAAE;AAC3C,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;AAChC,QAAM,QAAQ,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACjC,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACZ,QAAI,IAAI;AACR,WAAO,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,EAAG,MAAM,QAAQ,CAAC,EAAG,EAAG;AAEzD,UAAM,OAAO,IAAI,KAAK,IAAI;AAC1B,aAAS,IAAI,GAAG,KAAK,GAAG,IAAK,OAAM,QAAQ,CAAC,EAAG,CAAC,IAAI;AACpD,QAAI,IAAI;AAAA,EACV;AACA,SAAO;AACT;AAGA,SAAS,WAAW,MAA4B;AAC9C,MAAI,IAAI,SAAS;AACjB,SAAO,MAAM;AACX,QAAK,IAAI,eAAgB;AACzB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;AACnC,SAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;AACxC,aAAS,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;AAEA,SAAS,iBAAiB,SAAmC;AAC3D,QAAM,QAAQ,IAAI,WAAW;AAC7B,SAAO,CAAC,MAAM,IAAI,IAAI;AACxB;AAGA,SAAS,SAAS,QAAkB,GAAmB;AACrD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,OAAO,WAAW,EAAG,QAAO,OAAO,CAAC;AACxC,QAAM,MAAM,KAAK,OAAO,SAAS;AACjC,QAAM,KAAK,KAAK,MAAM,GAAG;AACzB,QAAM,KAAK,KAAK,KAAK,GAAG;AACxB,MAAI,OAAO,GAAI,QAAO,OAAO,EAAE;AAC/B,QAAM,OAAO,MAAM;AACnB,SAAO,OAAO,EAAE,KAAM,IAAI,QAAQ,OAAO,EAAE,IAAK;AAClD;;;AC3iBO,IAAM,kBAAkB,CAAC,WAAuC;AAGhE,SAAS,aAAa,QAAsD;AACjF,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,aAAW,EAAE,OAAO,OAAO,KAAK,QAAQ;AACtC,UAAM,IAAI,UAAU;AACpB,mBAAe,QAAQ;AACvB,mBAAe;AAAA,EACjB;AACA,SAAO,cAAc,IAAI,cAAc,cAAc;AACvD;AAGO,SAAS,mBACd,QACA,aAAa,MACb,OAA8C,CAAC,GACC;AAChD,MAAI,OAAO,WAAW,EAAG,QAAO,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,EAAE;AAC9D,MAAI,OAAO,WAAW,EAAG,QAAO,EAAE,MAAM,OAAO,CAAC,GAAI,OAAO,OAAO,CAAC,GAAI,OAAO,OAAO,CAAC,EAAG;AAEzF,QAAM,IAAI,OAAO;AACjB,QAAM,OAAO,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAEjD,QAAM,IAAI,KAAK,aAAa;AAC5B,QAAM,MAAM,QAAQ,KAAK,IAAI;AAC7B,QAAM,iBAA2B,CAAC;AAElC,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,IACrC;AACA,mBAAe,KAAK,MAAM,CAAC;AAAA,EAC7B;AAEA,iBAAe,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAEnC,QAAM,QAAQ,IAAI;AAClB,QAAM,WAAW,KAAK,MAAO,QAAQ,IAAK,CAAC;AAC3C,QAAM,WAAW,KAAK,OAAO,IAAI,QAAQ,KAAK,CAAC,IAAI;AAEnD,SAAO;AAAA,IACL;AAAA,IACA,OAAO,eAAe,QAAQ;AAAA,IAC9B,OAAO,eAAe,KAAK,IAAI,UAAU,IAAI,CAAC,CAAC;AAAA,EACjD;AACF;AAQO,SAAS,sBAAsB,aAAqC;AACzE,MAAI,YAAY,SAAS,EAAG,QAAO;AAGnC,QAAM,eAAe,oBAAI,IAAwB;AACjD,aAAW,YAAY,aAAa;AAClC,eAAW,KAAK,UAAU;AACxB,UAAI,CAAC,aAAa,IAAI,EAAE,SAAS,EAAG,cAAa,IAAI,EAAE,WAAW,CAAC,CAAC;AACpE,YAAM,MAAM,aAAa,IAAI,EAAE,SAAS;AACxC,UAAI,IAAI,WAAW,KAAK,IAAI,IAAI,SAAS,CAAC,EAAG,UAAU,YAAY,QAAQ;AACzE,YAAI,KAAK,CAAC,EAAE,KAAK,CAAC;AAAA,MACpB,OAAO;AACL,YAAI,IAAI,SAAS,CAAC,EAAG,KAAK,EAAE,KAAK;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAGA,QAAM,YAAsB,CAAC;AAC7B,QAAM,YAAsB,CAAC;AAE7B,aAAW,SAAS,aAAa,OAAO,GAAG;AACzC,eAAW,WAAW,OAAO;AAC3B,UAAI,QAAQ,SAAS,EAAG;AACxB,iBAAW,KAAK,QAAS,WAAU,KAAK,CAAC;AACzC,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,iBAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AAC3C,oBAAU,MAAM,QAAQ,CAAC,IAAK,QAAQ,CAAC,MAAO,CAAC;AAAA,QACjD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,UAAU,WAAW,KAAK,UAAU,SAAS,EAAG,QAAO;AAE3D,QAAM,uBAAuB,UAAU,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;AAG9E,MAAI,uBAAuB;AAC3B,MAAI,gBAAgB;AACpB,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,aAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,+BAAyB,UAAU,CAAC,IAAK,UAAU,CAAC,MAAO;AAC3D;AAAA,IACF;AAAA,EACF;AACA,yBAAuB,gBAAgB,IAAI,uBAAuB,gBAAgB;AAElF,MAAI,yBAAyB,EAAG,QAAO;AACvC,SAAO,IAAI,uBAAuB;AACpC;AAMO,SAAS,aAAa,GAAa,GAAuC;AAC/E,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,EAAG,QAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAE1D,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,EAAE;AAGb,QAAM,WAAW;AAAA,IACf,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,IAAa,EAAE;AAAA,IAC5C,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,IAAa,EAAE;AAAA,EAC9C,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;AAG1B,QAAM,QAAkB,IAAI,MAAM,SAAS,MAAM;AACjD,MAAI,IAAI;AACR,SAAO,IAAI,SAAS,QAAQ;AAC1B,QAAI,IAAI;AACR,WAAO,IAAI,SAAS,UAAU,SAAS,CAAC,EAAG,MAAM,SAAS,CAAC,EAAG,EAAG;AACjE,UAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,OAAM,CAAC,IAAI;AACvC,QAAI;AAAA,EACN;AAGA,MAAI,KAAK;AACT,WAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,QAAI,SAAS,CAAC,EAAG,UAAU,IAAK,OAAM,MAAM,CAAC;AAAA,EAC/C;AAEA,QAAM,KAAK,KAAM,MAAM,KAAK,KAAM;AAClC,QAAM,KAAK,KAAK,KAAK;AACrB,QAAM,IAAI,KAAK,IAAI,IAAI,EAAE;AAGzB,QAAM,KAAM,KAAK,KAAM;AACvB,QAAM,QAAQ,KAAK,KAAM,KAAK,MAAM,KAAK,KAAK,KAAM,EAAE;AAEtD,MAAI,UAAU,EAAG,QAAO,EAAE,GAAG,GAAG,EAAE;AAElC,QAAM,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAE7B,QAAM,IAAI,KAAK,IAAI,UAAU,CAAC;AAE9B,SAAO,EAAE,GAAG,EAAE;AAChB;AAGO,SAAS,cAAc,SAAiB,QAAwB;AACrE,MAAI,UAAU,EAAG,QAAO;AACxB,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,MAAM,CAAC;AAClD;AAQO,SAAS,YACd,QACA,OACsC;AACtC,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI;AAAA,MACR,sCAAsC,OAAO,MAAM,OAAO,MAAM,MAAM;AAAA,IACxE;AAAA,EACF;AACA,QAAM,IAAI,OAAO;AACjB,MAAI,IAAI,EAAG,QAAO,EAAE,GAAG,GAAG,IAAI,GAAG,GAAG,EAAE;AAEtC,QAAM,QAAQ,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AAChD,QAAM,OAAO,MAAM,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAChD,QAAM,WAAW,MAAM,OAAO,CAAC,KAAK,MAAM,OAAO,IAAI,SAAS,GAAG,CAAC,KAAK,IAAI;AAC3E,QAAM,KAAK,KAAK,KAAK,WAAW,CAAC;AACjC,MAAI,OAAO,EAAG,QAAO,EAAE,GAAG,SAAS,IAAI,IAAI,UAAU,IAAI,IAAI,GAAG,GAAG,SAAS,IAAI,IAAI,EAAE;AAEtF,QAAM,IAAI,OAAO;AACjB,QAAM,KAAK,IAAI;AACf,QAAM,IAAI,KAAK,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,EAAE;AAC9C,SAAO,EAAE,GAAG,IAAI,EAAE;AACpB;AAMO,SAAS,mBAAmB,QAAkB,OAA2C;AAC9F,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI;AAAA,MACR,6CAA6C,OAAO,MAAM,OAAO,MAAM,MAAM;AAAA,IAC/E;AAAA,EACF;AACA,QAAM,QAAQ,OAAO,IAAI,CAAC,GAAGC,OAAM,MAAMA,EAAC,IAAK,CAAC,EAAE,OAAO,CAAC,MAAM,MAAM,CAAC;AACvE,QAAM,IAAI,MAAM;AAChB,MAAI,IAAI,EAAG,QAAO,EAAE,GAAG,GAAG,GAAG,EAAE;AAE/B,QAAM,WAAW,MACd,IAAI,CAAC,GAAGA,QAAO,EAAE,KAAK,KAAK,IAAI,CAAC,GAAG,MAAM,KAAK,KAAK,CAAC,GAAG,GAAAA,GAAE,EAAE,EAC3D,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,GAAG;AAC/B,QAAM,QAAkB,IAAI,MAAM,CAAC;AACnC,MAAI,IAAI;AACR,SAAO,IAAI,GAAG;AACZ,QAAI,IAAI;AACR,WAAO,IAAI,KAAK,SAAS,CAAC,EAAG,QAAQ,SAAS,CAAC,EAAG,IAAK;AACvD,UAAM,OAAO,IAAI,IAAI,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,IAAK,OAAM,SAAS,CAAC,EAAG,CAAC,IAAI;AACpD,QAAI;AAAA,EACN;AACA,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,MAAM,CAAC,IAAK,EAAG,UAAS,MAAM,CAAC;AAE/D,QAAM,OAAQ,KAAK,IAAI,KAAM;AAC7B,QAAM,WAAY,KAAK,IAAI,MAAM,IAAI,IAAI,KAAM;AAC/C,QAAM,KAAK,QAAQ,QAAQ,KAAK,KAAK,QAAQ;AAC7C,QAAM,IAAI,KAAK,IAAI,UAAU,KAAK,IAAI,CAAC,CAAC;AACxC,SAAO,EAAE,GAAG,OAAO,EAAE;AACvB;AAOO,SAAS,QAAQ,GAAa,GAAqB;AACxD,MAAI,EAAE,SAAS,KAAK,EAAE,SAAS,EAAG,QAAO;AACzC,QAAM,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE;AAC/C,QAAM,QAAQ,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE;AAC/C,QAAM,OAAO,EAAE,OAAO,CAAC,KAAK,MAAM,OAAO,IAAI,UAAU,GAAG,CAAC,KAAK,EAAE,SAAS;AAC3E,QAAM,OAAO,EAAE,OAAO,CAAC,KAAK,MAAM,OAAO,IAAI,UAAU,GAAG,CAAC,KAAK,EAAE,SAAS;AAC3E,QAAM,SAAS,KAAK;AAAA,MAChB,EAAE,SAAS,KAAK,QAAQ,EAAE,SAAS,KAAK,SAAS,EAAE,SAAS,EAAE,SAAS;AAAA,EAC3E;AACA,MAAI,WAAW,EAAG,QAAO;AACzB,UAAQ,QAAQ,SAAS;AAC3B;AAcO,SAAS,YAAY,QAAkB,OAAyB;AACrE,QAAM,IAAI,OAAO,SAAS,MAAM;AAChC,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,YAAY;AAChB,aAAW,KAAK,OAAO;AACrB,eAAW,KAAK,QAAQ;AACtB,UAAI,IAAI,EAAG,cAAa;AAAA,eACf,IAAI,EAAG,cAAa;AAAA,IAC/B;AAAA,EACF;AACA,SAAO,YAAY;AACrB;AAOO,SAAS,gBAAgB,OAAgC;AAC9D,QAAM,IAAI,KAAK,IAAI,KAAK;AACxB,MAAI,IAAI,MAAO,QAAO;AACtB,MAAI,IAAI,KAAM,QAAO;AACrB,MAAI,IAAI,MAAO,QAAO;AACtB,SAAO;AACT;AA4BO,SAAS,kBAAkB,OAAwD;AACxF,QAAM,UAAU,OAAO,QAAQ,MAAM,OAAO;AAC5C,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,MAAM,iEAA4D;AAAA,EAC9E;AACA,MAAI,cAAc;AAClB,MAAI,cAAc;AAClB,aAAW,CAAC,KAAK,MAAM,KAAK,SAAS;AACnC,QAAI,SAAS,GAAG;AACd,YAAM,IAAI,MAAM,kCAAkC,GAAG,kBAAkB,MAAM,GAAG;AAAA,IAClF;AACA,QAAI,EAAE,OAAO,MAAM,OAAO;AACxB,YAAM,IAAI;AAAA,QACR,0CAA0C,GAAG;AAAA,MAE/C;AAAA,IACF;AACA,mBAAe,MAAM,KAAK,GAAG,IAAK;AAClC,mBAAe;AAAA,EACjB;AACA,MAAI,gBAAgB,GAAG;AACrB,UAAM,IAAI,MAAM,mEAA8D;AAAA,EAChF;AACA,QAAM,YAAY,cAAc;AAChC,SAAO,MAAM,cAAc,SACvB,EAAE,UAAU,IACZ,EAAE,WAAW,MAAM,aAAa,MAAM,UAAU;AACtD;AAgFO,SAAS,0BACd,SACA,OAA+B,CAAC,GACT;AACvB,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,gBAAgB,sDAAsD;AAAA,EAClF;AAEA,QAAM,aAAa,oBAAI,IAAY;AACnC,QAAM,WAAW,oBAAI,IAAY;AAEjC,QAAM,OAAO,oBAAI,IAA8C;AAE/D,aAAW,KAAK,SAAS;AACvB,QAAI,CAAC,OAAO,SAAS,EAAE,KAAK,GAAG;AAC7B,YAAM,IAAI;AAAA,QACR,yDAAyD,EAAE,MAAM,WAAW,EAAE,SAAS,SAAS,EAAE,SAAS;AAAA,MAC7G;AAAA,IACF;AACA,eAAW,IAAI,EAAE,SAAS;AAC1B,aAAS,IAAI,EAAE,SAAS;AACxB,UAAM,UAAU,KAAK,IAAI,EAAE,SAAS,KAAK,oBAAI,IAAiC;AAC9E,UAAM,SAAS,QAAQ,IAAI,EAAE,SAAS,KAAK,oBAAI,IAAoB;AACnE,QAAI,OAAO,IAAI,EAAE,MAAM,GAAG;AACxB,YAAM,IAAI;AAAA,QACR,yDAAyD,EAAE,MAAM,WAAW,EAAE,SAAS,SAAS,EAAE,SAAS;AAAA,MAC7G;AAAA,IACF;AACA,WAAO,IAAI,EAAE,QAAQ,EAAE,KAAK;AAC5B,YAAQ,IAAI,EAAE,WAAW,MAAM;AAC/B,SAAK,IAAI,EAAE,WAAW,OAAO;AAAA,EAC/B;AAEA,QAAM,aAAa,KAAK,cAAc,CAAC,GAAG,QAAQ,EAAE,KAAK;AACzD,aAAW,KAAK,YAAY;AAC1B,QAAI,CAAC,SAAS,IAAI,CAAC,GAAG;AACpB,YAAM,IAAI;AAAA,QACR,yCAAyC,CAAC;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AACA,QAAM,eAAe,KAAK,SAAS,CAAC,GAAG,KAAK,MAAM,IAAI,CAAC,GAAG,UAAU,EAAE,KAAK;AAC3E,aAAW,KAAK,cAAc;AAC5B,QAAI,CAAC,WAAW,IAAI,CAAC,GAAG;AACtB,YAAM,IAAI;AAAA,QACR,qCAAqC,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AACA,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,IAAI;AAAA,MACR,uDAAkD,aAAa,MAAM;AAAA,IACvE;AAAA,EACF;AAEA,QAAM,eAA8C,CAAC;AACrD,QAAM,OAAiB,CAAC;AACxB,QAAM,SAAmB,CAAC;AAE1B,aAAW,OAAO,YAAY;AAC5B,UAAM,UAAU,KAAK,IAAI,GAAG;AAE5B,UAAM,kBAA0C,CAAC;AACjD,eAAW,KAAK,cAAc;AAC5B,YAAM,IAAI,QAAQ,IAAI,CAAC;AACvB,sBAAgB,CAAC,IAAI,GAAG,QAAQ;AAAA,IAClC;AACA,UAAM,cAAc,aAAa,OAAO,CAAC,MAAM,gBAAgB,CAAC,MAAM,CAAC;AACvE,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,yCAAyC,GAAG,iCAAiC,YAAY,KAAK,IAAI,CAAC,aAAa,KAAK,UAAU,eAAe,CAAC;AAAA,MACjJ;AAAA,IACF;AAGA,QAAI,cAAkC;AACtC,eAAW,KAAK,cAAc;AAC5B,YAAM,MAAM,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAG,KAAK,CAAC;AAC1C,UAAI,gBAAgB,MAAM;AACxB,sBAAc;AAAA,MAChB,OAAO;AACL,cAAM,OAAoB;AAC1B,sBAAc,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC;AAAA,MAC3D;AAAA,IACF;AACA,UAAM,cAAc,CAAC,GAAI,eAAe,oBAAI,IAAY,CAAE,EAAE,KAAK;AACjE,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,IAAI;AAAA,QACR,yCAAyC,GAAG,SAAS,YAAY,MAAM,yBAAyB,aAAa,MAAM;AAAA,MACrH;AAAA,IACF;AAEA,UAAM,SAAqB,YAAY;AAAA,MAAI,CAAC,WAC1C,aAAa,IAAI,CAAC,MAAM,QAAQ,IAAI,CAAC,EAAG,IAAI,MAAM,CAAE;AAAA,IACtD;AACA,UAAM,YAAY,oBAAoB,QAAQ,IAAI;AAClD,iBAAa,KAAK;AAAA,MAChB,GAAG;AAAA,MACH,WAAW;AAAA,MACX,SAAS;AAAA,MACT,UAAU,CAAC,GAAG,YAAY;AAAA,IAC5B,CAAC;AACD,QAAI,OAAO,SAAS,UAAU,GAAG,EAAG,MAAK,KAAK,UAAU,GAAG;AAC3D,QAAI,OAAO,SAAS,UAAU,aAAa,EAAG,QAAO,KAAK,UAAU,aAAa;AAAA,EACnF;AAEA,QAAM,OAAO,CAAC,OACZ,GAAG,WAAW,IAAI,OAAO,MAAM,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AACpE,SAAO;AAAA,IACL;AAAA,IACA,YAAY,KAAK,IAAI;AAAA,IACrB,sBAAsB,KAAK,MAAM;AAAA,IACjC,YAAY;AAAA,IACZ,UAAU;AAAA,EACZ;AACF;AAUO,SAAS,yCACd,aACA,OAA+B,CAAC,GACT;AACvB,QAAM,UAA+B,CAAC;AACtC,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,EAAE,QAAQ,OAAO,KAAK,aAAa;AAC5C,QAAI,KAAK,IAAI,MAAM,GAAG;AACpB,YAAM,IAAI;AAAA,QACR,+DAA+D,MAAM;AAAA,MACvE;AAAA,IACF;AACA,SAAK,IAAI,MAAM;AACf,eAAW,KAAK,QAAQ;AACtB,cAAQ,KAAK;AAAA,QACX;AAAA,QACA,WAAW,EAAE;AAAA,QACb,WAAW,EAAE;AAAA,QACb,OAAO,EAAE;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,0BAA0B,SAAS,IAAI;AAChD;AAGA,SAAS,YAAY,GAAW,IAAoB;AAClD,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,KAAK,IAAK,QAAO,UAAU,CAAC;AAChC,QAAM,IAAI,MAAM,KAAK,IAAI;AACzB,QAAM,IAAI,KAAK;AACf,QAAM,IAAI;AACV,QAAM,KAAK,eAAe,GAAG,GAAG,CAAC;AACjC,SAAO,KAAK,IAAI,IAAI,MAAM,KAAK,MAAM;AACvC;AAGA,SAAS,eAAe,GAAW,GAAW,GAAmB;AAC/D,MAAI,KAAK,EAAG,QAAO;AACnB,MAAI,KAAK,EAAG,QAAO;AACnB,QAAM,SAAS,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,QAAQ,IAAI,CAAC;AACtD,QAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,IAAI;AACzE,QAAM,UAAU;AAChB,QAAM,MAAM;AACZ,MAAI,IAAI;AACR,MAAI,IAAI,KAAM,IAAI,KAAK,KAAM,IAAI;AACjC,MAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,MAAI,IAAI;AACR,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,KAAK,SAAS,KAAK;AACjC,UAAM,KAAK,IAAI;AACf,QAAI,MAAO,KAAK,IAAI,KAAK,MAAO,IAAI,KAAK,MAAM,IAAI;AACnD,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI;AACR,SAAK,IAAI;AACT,UAAM,GAAG,IAAI,MAAM,IAAI,IAAI,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK;AAC3D,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI,MAAM;AACd,QAAI,KAAK,IAAI,CAAC,IAAI,MAAO,KAAI;AAC7B,QAAI,IAAI;AACR,UAAM,QAAQ,IAAI;AAClB,SAAK;AACL,QAAI,KAAK,IAAI,QAAQ,CAAC,IAAI,IAAK;AAAA,EACjC;AACA,SAAO,QAAQ;AACjB;AAGA,SAAS,QAAQ,GAAmB;AAClC,QAAM,IAAI;AACV,QAAM,QAAQ;AAAA,IACZ;AAAA,IAAqB;AAAA,IAAmB;AAAA,IAAqB;AAAA,IAC7D;AAAA,IAAqB;AAAA,IAAoB;AAAA,IAAsB;AAAA,IAC/D;AAAA,EACF;AACA,MAAI,IAAI,KAAK;AACX,WAAO,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC,IAAI,QAAQ,IAAI,CAAC;AAAA,EAClE;AACA,OAAK;AACL,MAAI,IAAI,MAAM,CAAC;AACf,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,IAAK,MAAK,MAAM,CAAC,KAAM,IAAI;AACtD,QAAM,IAAI,IAAI,IAAI;AAClB,SAAO,MAAM,KAAK,IAAI,IAAI,KAAK,EAAE,KAAK,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC;AAC/E;AAGA,SAAS,UAAU,GAAmB;AACpC,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,KAAK;AACX,QAAM,IAAI;AAEV,QAAM,OAAO,IAAI,IAAI,KAAK;AAC1B,QAAM,OAAO,KAAK,IAAI,CAAC;AACvB,QAAM,IAAI,KAAK,IAAI,IAAI;AACvB,QAAM,IAAI,QAAQ,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,KAAK,IAAK,CAAC,OAAO,OAAQ,CAAC;AAE9F,SAAO,OAAO,IAAI,OAAO;AAC3B;AAUO,SAAS,mBAAmB,MAKxB;AACT,QAAM,SAAS,KAAK;AACpB,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,EAAG,QAAO;AACpD,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,SAAS,UAAU,WAAW,IAAI,QAAQ,IAAI,IAAI,KAAK;AAC7D,QAAM,QAAQ,UAAU,KAAK;AAC7B,QAAM,IAAI,MAAM,SAAS,SAAS,WAAW;AAC7C,SAAO,KAAK,KAAK,CAAC;AACpB;AAQO,SAAS,UAAU,MAKf;AACT,MAAI,CAAC,OAAO,SAAS,KAAK,OAAO,KAAK,KAAK,WAAW,EAAG,QAAO;AAChE,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,SAAS,UAAU,WAAW,IAAI,QAAQ,IAAI,IAAI,KAAK;AAC7D,QAAM,QAAQ,UAAU,KAAK;AAC7B,UAAQ,SAAS,SAAS,KAAK,KAAK,KAAK,OAAO;AAClD;AAGO,SAAS,WACd,SACA,QAAQ,MACwC;AAChD,QAAM,IAAI,QAAQ;AAClB,QAAM,WAAW,QAAQ,IAAI,CAAC,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC,CAAC;AACtD,QAAM,cAAc,SAAS,IAAI,CAAC,MAAM,IAAI,KAAK;AACjD,SAAO,EAAE,UAAU,YAAY;AACjC;AAMO,SAAS,kBACd,SACA,MAAM,MACyC;AAC/C,QAAM,IAAI,QAAQ;AAClB,MAAI,MAAM,EAAG,QAAO,EAAE,SAAS,CAAC,GAAG,aAAa,CAAC,EAAE;AACnD,QAAM,UAAU,QAAQ,IAAI,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,CAAC;AAC1E,QAAM,IAAI,IAAI,MAAc,CAAC;AAC7B,MAAI,WAAW;AACf,WAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,UAAM,OAAO,IAAI;AACjB,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,MAAO,MAAM,IAAI,IAAK;AAC5B,UAAM,UAAU,KAAK,IAAI,UAAU,GAAG;AACtC,eAAW;AACX,MAAE,MAAM,CAAC,IAAI,KAAK,IAAI,GAAG,OAAO;AAAA,EAClC;AACA,QAAM,cAAc,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG;AACxC,SAAO,EAAE,SAAS,GAAG,YAAY;AACnC;AAsCO,SAAS,gBACd,QACA,OACA,OAA+B,CAAC,GACT;AACvB,MAAI,OAAO,WAAW,MAAM,QAAQ;AAClC,UAAM,IAAI,MAAM,0CAA0C,OAAO,MAAM,OAAO,MAAM,MAAM,GAAG;AAAA,EAC/F;AACA,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,YAAY,KAAK,aAAa;AACpC,MAAI,cAAc,KAAK,cAAc,GAAG;AACtC,UAAM,IAAI,MAAM,qDAAqD,UAAU,EAAE;AAAA,EACnF;AAEA,QAAM,IAAI,OAAO;AACjB,QAAM,SAAS,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AACjD,MAAI,MAAM,GAAG;AACX,WAAO,EAAE,GAAG,GAAG,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,YAAY,UAAU;AAAA,EAC5E;AACA,MAAI,MAAM,GAAG;AACX,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,EAAE,GAAG,GAAG,QAAQ,GAAG,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,YAAY,UAAU;AAAA,EAC5E;AAEA,QAAM,MAAM,QAAQ,KAAK,IAAI;AAC7B,QAAM,UAAU,IAAI,MAAc,SAAS;AAC3C,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,cAAc,QAAQ;AACxB,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,eAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,MACrC;AACA,cAAQ,CAAC,IAAI,MAAM;AAAA,IACrB,OAAO;AACL,YAAM,MAAM,IAAI,MAAc,CAAC;AAC/B,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,IAAI,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC;AAAA,MACvC;AACA,cAAQ,CAAC,IAAI,cAAc,GAAG;AAAA,IAChC;AAAA,EACF;AACA,UAAQ,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAE5B,QAAM,QAAQ,IAAI;AAClB,QAAM,SAAS,KAAK,MAAO,QAAQ,IAAK,SAAS;AACjD,QAAM,UAAU,KAAK,IAAI,YAAY,GAAG,KAAK,MAAM,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC;AAElF,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,cAAc,CAAC,GAAG,MAAM,CAAC;AAAA,IACjC,MAAM,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAAA,IAC1C,KAAK,QAAQ,MAAM;AAAA,IACnB,MAAM,QAAQ,KAAK,IAAI,SAAS,MAAM,CAAC;AAAA,IACvC;AAAA,IACA;AAAA,EACF;AACF;AAuEO,SAAS,SAAS,OAAwB,CAAC,GAAa;AAC7D,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,SAAS,KAAK,UAAU;AAC9B,QAAM,WAAW,KAAK,YAAY;AAClC,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,KAAK,SAAS,GAAG;AACvD,UAAM,IAAI,gBAAgB,yCAAyC,KAAK,EAAE;AAAA,EAC5E;AACA,MAAI,CAAC,OAAO,SAAS,QAAQ,KAAK,YAAY,KAAK,YAAY,GAAG;AAChE,UAAM,IAAI,gBAAgB,4CAA4C,QAAQ,EAAE;AAAA,EAClF;AACA,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,KAAK,UAAU,IAAI,UAAU;AACrE,UAAM,IAAI;AAAA,MACR,+CAA+C,IAAI,UAAU,QAAQ,CAAC,CAAC,0CACvC,MAAM;AAAA,IACxC;AAAA,EACF;AACA,QAAM,YAAY,IAAI;AACtB,MAAI,SAAS;AACb,MAAI,IAAI;AACR,MAAI,UAAU;AACd,MAAI;AAGJ,MAAI,OAAO;AACX,MAAI,SAAS;AACb,SAAO;AAAA,IACL,OAAO,GAAyB;AAC9B,UAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,GAAG;AAClE,cAAM,IAAI;AAAA,UACR,+DAA+D,CAAC;AAAA,QAClE;AAAA,MACF;AAEA,YAAM,UAAU,MAAM,SAAS,IAAI;AACnC,YAAM,WAAW,OAAO,WAAW,IAAI;AACvC,YAAM,OAAO,SAAS;AACtB,YAAM,SAAS,KAAK,IAAI,QAAQ,KAAK,IAAI,GAAG,QAAQ,UAAU,OAAO,KAAK,CAAC;AAC3E,gBAAU,IAAI,UAAU,IAAI;AAC5B,WAAK;AACL,cAAQ;AACR,YAAM,SAAS,MAAM,SAAS,IAAI;AAClC,iBAAW,IAAI,UAAU;AACzB,UAAI,CAAC,WAAW,UAAU,WAAW;AACnC,kBAAU;AACV,qBAAa;AAAA,MACf;AACA,aAAO,EAAE,QAAQ,GAAG,QAAQ;AAAA,IAC9B;AAAA,IACA,QAAuB;AACrB,aAAO,EAAE,QAAQ,GAAG,SAAS,OAAO,QAAQ,UAAU,WAAW,WAAW;AAAA,IAC9E;AAAA,EACF;AACF;AAKA,SAAS,UAAU,GAAmB;AACpC,MAAI,KAAK,KAAK,KAAK,GAAG;AACpB,QAAI,MAAM,EAAG,QAAO;AACpB,QAAI,MAAM,EAAG,QAAO;AACpB,WAAO;AAAA,EACT;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IAAsB;AAAA,IAAqB;AAAA,IAAsB;AAAA,IACjE;AAAA,IAAsB;AAAA,EACxB;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IAAsB;AAAA,IAAqB;AAAA,IAAsB;AAAA,IACjE;AAAA,EACF;AACA,QAAM,IAAI;AAAA,IACR;AAAA,IAAuB;AAAA,IAAuB;AAAA,IAAoB;AAAA,IAClE;AAAA,IAAmB;AAAA,EACrB;AACA,QAAM,IAAI,CAAC,sBAAsB,oBAAsB,mBAAmB,iBAAiB;AAC3F,QAAM,OAAO;AACb,QAAM,QAAQ,IAAI;AAClB,MAAI;AACJ,MAAI;AACJ,MAAI,IAAI,MAAM;AACZ,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AAC9B,gBACO,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,SACpE,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;AAAA,EAE3D;AACA,MAAI,KAAK,OAAO;AACd,QAAI,IAAI;AACR,QAAI,IAAI;AACR,gBACQ,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,SAC1E,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;AAAA,EAEzE;AACA,MAAI,KAAK,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;AAClC,SACE,MAAM,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,SACrE,EAAE,CAAC,IAAK,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI,EAAE,CAAC,KAAM,IAAI;AAE3D;AAEA,SAAS,cAAc,IAAsB;AAC3C,MAAI,GAAG,WAAW,EAAG,QAAO;AAC5B,KAAG,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvB,QAAM,MAAM,KAAK,MAAM,GAAG,SAAS,CAAC;AACpC,SAAO,GAAG,SAAS,MAAM,KAAK,GAAG,MAAM,CAAC,IAAK,GAAG,GAAG,KAAM,IAAI,GAAG,GAAG;AACrE;AAEA,SAAS,QAAQ,MAAwC;AACvD,MAAI,SAAS,OAAW,QAAO,KAAK;AACpC,SAAOC,YAAW,IAAI;AACxB;AAMO,SAASA,YAAW,MAA4B;AACrD,MAAI,IAAI,OAAO,KAAK;AACpB,SAAO,MAAM;AACX,QAAK,IAAI,aAAc;AACvB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;AACnC,SAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;AACxC,aAAS,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;","names":["i","i","mulberry32"]}