@tangle-network/agent-eval 0.85.0 → 0.89.0

package/dist/chunk-XQL22JDG.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/trace-analyst/hook.ts","../src/trace-analyst/insights.ts","../src/trace-analyst/otlp-flatten.ts","../src/trace-analyst/otlp-to-run-records.ts","../src/trace/store.ts","../src/trace/capture-fetch.ts","../src/trace/otel.ts","../src/trace/otel-bridge.ts","../src/trace/otel-export.ts","../src/trace/store-to-otlp.ts","../src/replay.ts"],"sourcesContent":["/**\n * Trace-analyst auto-execution hook.\n *\n * Wires `analyzeTraces` into a `TraceEmitter`'s `onRunComplete` so a\n * direct matrix run produces an analysis artifact without an out-of-band\n * step. Designed for the case where the consumer reports \"the analyst\n * never ran\" — the cause is almost always orchestration, not the analyst.\n *\n * Usage:\n *\n *   const emitter = new TraceEmitter(store, {\n *     onRunComplete: [traceAnalystOnRunComplete({ analyze: opts, save })],\n *   })\n *\n * Hooks are best-effort by default — they never crash the underlying run.\n * The caller decides whether to gate the run on the analysis result via\n * the `gateOn` callback.\n */\n\nimport type { RunCompleteHook, RunCompleteHookContext } from '../trace/emitter'\nimport { type AnalyzeTracesOptions, type AnalyzeTracesResult, analyzeTraces } from './analyst'\n\nexport interface TraceAnalystHookOptions {\n  /**\n   * Options forwarded to `analyzeTraces`. The hook supplies the question\n   * if you don't pass one — defaulting to a launch-grade prompt that asks\n   * for failure modes, surprising findings, and a recommendation.\n   */\n  analyze: Omit<AnalyzeTracesOptions, 'source'> & { source?: AnalyzeTracesOptions['source'] }\n  /**\n   * Override the question. The default is intentionally generic:\n   * \"Summarise what happened in this run, surface any failure modes,\n   *  surprising findings, or evidence the verdict is wrong.\"\n   */\n  question?: string\n  /**\n   * Persist the result. The hook calls this with the analysis output and\n   * the run context. Common implementations write to a TraceAnalysisStore\n   * or append to a per-run JSONL.\n   */\n  save?: (result: AnalyzeTracesResult, ctx: RunCompleteHookContext) => Promise<void>\n  /**\n   * Predicate gating execution per run. Default: every completed run.\n   * Use to skip aborted runs, debug runs, or runs without LLM activity.\n   */\n  shouldRun?: (ctx: RunCompleteHookContext) => boolean\n  /**\n   * Optional gate: if set and returns false, the hook records the failure\n   * as a log event on the run instead of staying quiet. The caller can\n   * then trigger downstream alerts off `analyst_gate_failed` log events.\n   */\n  gateOn?: (result: AnalyzeTracesResult, ctx: RunCompleteHookContext) => boolean\n}\n\nconst DEFAULT_QUESTION =\n  \"Summarise what happened in this run. Surface any failure modes, surprising findings, or evidence that the run's verdict is wrong.\"\n\nexport function traceAnalystOnRunComplete(opts: TraceAnalystHookOptions): RunCompleteHook {\n  return async (ctx: RunCompleteHookContext) => {\n    if (opts.shouldRun && !opts.shouldRun(ctx)) return\n    const source = opts.analyze.source\n    if (source === undefined) {\n      // The analyst needs a source. If the caller didn't supply one we don't\n      // run — but we do leave a breadcrumb so the absence is visible.\n      await ctx.store.appendEvent({\n        eventId: `analyst-skip-${ctx.runId}`,\n        runId: ctx.runId,\n        kind: 'log',\n        timestamp: Date.now(),\n        payload: { source: 'trace_analyst_hook', reason: 'no source configured' },\n      })\n      return\n    }\n    const result = await analyzeTraces({ question: opts.question ?? DEFAULT_QUESTION }, {\n      ...opts.analyze,\n      source,\n    } as AnalyzeTracesOptions)\n    if (opts.save) await opts.save(result, ctx)\n    if (opts.gateOn && !opts.gateOn(result, ctx)) {\n      await ctx.store.appendEvent({\n        eventId: `analyst-gate-${ctx.runId}`,\n        runId: ctx.runId,\n        kind: 'log',\n        timestamp: Date.now(),\n        payload: {\n          source: 'trace_analyst_hook',\n          reason: 'analyst_gate_failed',\n          findings: result.findings,\n        },\n      })\n    }\n  }\n}\n","export interface TraceInsightTask {\n  id: string\n  name: string\n  prompt?: string\n  difficulty?: string\n  tags?: string[]\n  outcome?: string\n  score?: number\n  gaps?: string[]\n}\n\nexport interface TraceInsightSuite {\n  name: string\n  collectionId?: string\n  tasks: TraceInsightTask[]\n}\n\nexport interface TraceInsightFinding {\n  kind: string\n  severity?: string\n  taskIds: string[]\n  evidence?: string\n  proposedFixClass?: string\n}\n\nexport interface TraceInsightQuestion {\n  id: string\n  question: string\n  why: string\n}\n\nexport interface TraceInsightPanelRole {\n  id: string\n  name: string\n  responsibility: string\n}\n\nexport interface TraceInsightPromptInput {\n  suite: TraceInsightSuite\n  findings?: TraceInsightFinding[]\n  agent?: Record<string, unknown>\n  totals?: Record<string, unknown>\n  maxRepresentativeTraces?: number\n}\n\nexport interface TraceInsightContext {\n  suite: TraceInsightSuite\n  scope: string\n  keywords: string[]\n  questions: TraceInsightQuestion[]\n  panel: TraceInsightPanelRole[]\n  findings: TraceInsightFinding[]\n  agent: Record<string, unknown> | null\n  totals: Record<string, unknown> | null\n}\n\nexport interface TraceInsightQualityGate {\n  id: string\n  label: string\n  passed: boolean\n  severity: 'critical' | 'high' | 'medium' | 'low'\n  detail: string\n}\n\nexport interface TraceInsightReadiness {\n  score: number\n  grade: 'external-ready' | 'internal-review' | 'raw-analysis'\n  gates: TraceInsightQualityGate[]\n}\n\nconst DOMAIN_STOP_WORDS = new Set([\n  'and',\n  'advanced',\n  'app',\n  'build',\n  'create',\n  'easy',\n  'expert',\n  'extreme',\n  'for',\n  'from',\n  'hard',\n  'implementation',\n  'integrate',\n  'medium',\n  'project',\n  'task',\n  'the',\n  'this',\n  'with',\n  'workflow',\n])\n\nexport function tokenizeDomainWords(value: string): string[] {\n  return [...value.matchAll(/[A-Za-z][A-Za-z0-9.+#-]{2,}/g)]\n    .map((match) => match[0].toLowerCase())\n    .filter((word) => !DOMAIN_STOP_WORDS.has(word))\n}\n\nexport function inferDomainKeywords(suite: TraceInsightSuite): string[] {\n  const suiteWords = new Set(tokenizeDomainWords(`${suite.name} ${suite.collectionId ?? ''}`))\n  const source = [\n    suite.name,\n    suite.collectionId ?? '',\n    ...suite.tasks.flatMap((task) => [\n      task.id,\n      task.name,\n      task.prompt ?? '',\n      task.difficulty ?? '',\n      ...(task.tags ?? []),\n      ...(task.gaps ?? []),\n    ]),\n  ].join(' ')\n  const counts = new Map<string, number>()\n  for (const word of tokenizeDomainWords(source)) counts.set(word, (counts.get(word) ?? 0) + 1)\n  return [...counts.entries()]\n    .filter(([word, count]) => count >= 2 || suiteWords.has(word))\n    .sort((a, b) => b[1] - a[1] || a[0].localeCompare(b[0]))\n    .map(([word]) => word)\n    .slice(0, 18)\n}\n\nexport function domainEvidencePattern(keywords: string[]): RegExp {\n  const escaped = keywords\n    .filter((keyword) => keyword.length >= 3)\n    .map((keyword) => keyword.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\$&'))\n  return escaped.length > 0\n    ? new RegExp(`(?<![A-Za-z0-9])(?:${escaped.join('|')})(?![A-Za-z0-9])`, 'i')\n    : /(?<![A-Za-z0-9])(?:sdk|api|css|dns|xml|provider|client|service|integration|webhook|transaction|auth|oauth|graphql|rest)(?![A-Za-z0-9])/i\n}\n\nexport function describeTraceInsightScope(suite: TraceInsightSuite): string {\n  const taskLabel =\n    suite.tasks.length === 1\n      ? '1 implementation task'\n      : `${suite.tasks.length} implementation tasks`\n  const tags = new Map<string, number>()\n  for (const task of suite.tasks) {\n    for (const tag of task.tags ?? []) tags.set(tag, (tags.get(tag) ?? 0) + 1)\n  }\n  const topTags = [...tags.entries()]\n    .sort((a, b) => b[1] - a[1] || a[0].localeCompare(b[0]))\n    .slice(0, 8)\n    .map(([tag]) => tag)\n  if (topTags.length > 0) return `${taskLabel} across ${topTags.join(', ')}.`\n  const difficulties = [\n    ...new Set(\n      suite.tasks.map((task) => task.difficulty).filter((value): value is string => Boolean(value)),\n    ),\n  ].join(', ')\n  return `${taskLabel} across ${difficulties || 'the selected benchmark scope'}.`\n}\n\nexport function planTraceInsightQuestions(input: TraceInsightPromptInput): TraceInsightQuestion[] {\n  const hasFailures = input.suite.tasks.some((task) => task.outcome && task.outcome !== 'satisfied')\n  const hasMultipleShots = input.suite.tasks.some((task) =>\n    (task.gaps ?? []).some((gap) => /shot|review|retry|continue/i.test(gap)),\n  )\n  const questions: TraceInsightQuestion[] = [\n    {\n      id: 'execution-path',\n      question: 'What did the worker actually do before the first meaningful implementation edit?',\n      why: 'Separates grounded execution from polished but shallow output.',\n    },\n    {\n      id: 'research-grounding',\n      question:\n        'Did the worker inspect docs, source, examples, or package references before committing to an implementation path?',\n      why: 'Identifies whether failures came from weak retrieval, weak examples, or premature coding.',\n    },\n    {\n      id: 'domain-proof',\n      question:\n        'Which tasks produced executable domain proof versus UI copy, placeholders, or inferred behavior?',\n      why: 'Keeps product-quality claims tied to concrete evidence.',\n    },\n    {\n      id: 'root-cause',\n      question:\n        'For each major failure cluster, is the likely root cause prompt/scaffold, docs/examples, SDK/API ergonomics, evaluator, runtime, or model behavior?',\n      why: 'Turns trace observations into actionable ownership.',\n    },\n    {\n      id: 'evidence-quality',\n      question:\n        'Which external-facing claims are directly supported by trace ids, span ids, verifier findings, reviewer notes, or generated code?',\n      why: 'Prevents unsupported customer-report conclusions.',\n    },\n  ]\n  if (hasMultipleShots) {\n    questions.push({\n      id: 'reviewer-lift',\n      question: 'Where did reviewer feedback improve score, stall, or regress across shots?',\n      why: 'Shows whether the driver loop is learning or merely repeating work.',\n    })\n  }\n  if (hasFailures) {\n    questions.push({\n      id: 'optimization-targets',\n      question:\n        'Which prompt, evaluator, scaffold, or workflow changes should feed the next GEPA/autoresearch optimization run?',\n      why: 'Connects benchmark evidence to the optimization loop.',\n    })\n  }\n  return questions\n}\n\nexport function buildTraceInsightContext(input: TraceInsightPromptInput): TraceInsightContext {\n  return {\n    suite: input.suite,\n    scope: describeTraceInsightScope(input.suite),\n    keywords: inferDomainKeywords(input.suite),\n    questions: planTraceInsightQuestions(input),\n    panel: defaultTraceInsightPanel(),\n    findings: input.findings ?? [],\n    agent: input.agent ?? null,\n    totals: input.totals ?? null,\n  }\n}\n\nexport function scoreTraceInsightReadiness(context: TraceInsightContext): TraceInsightReadiness {\n  const failedTasks = context.suite.tasks.filter(\n    (task) => task.outcome && task.outcome !== 'satisfied',\n  )\n  const findingTaskIds = new Set(context.findings.flatMap((finding) => finding.taskIds))\n  const failedTasksWithFindings = failedTasks.filter((task) => findingTaskIds.has(task.id))\n  const tasksWithGaps = context.suite.tasks.filter((task) => (task.gaps ?? []).length > 0)\n  const gates: TraceInsightQualityGate[] = [\n    {\n      id: 'domain-context',\n      label: 'Domain context inferred',\n      passed: context.keywords.length > 0,\n      severity: 'high',\n      detail:\n        context.keywords.length > 0\n          ? `${context.keywords.length} domain terms inferred: ${context.keywords.slice(0, 8).join(', ')}`\n          : 'No domain terms were inferred from suite, tasks, prompts, tags, or gaps.',\n    },\n    {\n      id: 'panel-coverage',\n      label: 'Analyst panel planned',\n      passed: context.panel.length >= 4 && context.questions.length >= 5,\n      severity: 'high',\n      detail: `${context.panel.length} panel roles and ${context.questions.length} investigation questions planned.`,\n    },\n    {\n      id: 'failure-coverage',\n      label: 'Failures mapped to findings',\n      passed:\n        failedTasks.length === 0 || failedTasksWithFindings.length / failedTasks.length >= 0.5,\n      severity: 'critical',\n      detail:\n        failedTasks.length === 0\n          ? 'No failed tasks in suite.'\n          : `${failedTasksWithFindings.length}/${failedTasks.length} failed tasks appear in finding clusters.`,\n    },\n    {\n      id: 'gap-evidence',\n      label: 'Task gaps captured',\n      passed: failedTasks.length === 0 || tasksWithGaps.length / failedTasks.length >= 0.5,\n      severity: 'medium',\n      detail: `${tasksWithGaps.length} tasks include explicit evaluator or analyst gaps.`,\n    },\n  ]\n  const penalty = gates.reduce((sum, gate) => {\n    if (gate.passed) return sum\n    if (gate.severity === 'critical') return sum + 35\n    if (gate.severity === 'high') return sum + 20\n    if (gate.severity === 'medium') return sum + 10\n    return sum + 5\n  }, 0)\n  const score = Math.max(0, Math.min(1, 1 - penalty / 100))\n  return {\n    score,\n    grade: score >= 0.9 ? 'external-ready' : score >= 0.7 ? 'internal-review' : 'raw-analysis',\n    gates,\n  }\n}\n\nexport function defaultTraceInsightPanel(): TraceInsightPanelRole[] {\n  return [\n    {\n      id: 'trace-forensics',\n      name: 'Trace Forensics',\n      responsibility:\n        'Reconstruct what the worker did in order, including research, edits, reviewer interventions, verifier feedback, and stop reason.',\n    },\n    {\n      id: 'root-cause',\n      name: 'Root Cause',\n      responsibility:\n        'Map failures to prompt/scaffold, docs/examples, SDK/API/product ergonomics, evaluator, runtime, or model behavior.',\n    },\n    {\n      id: 'optimization',\n      name: 'Optimization',\n      responsibility:\n        'Identify prompt, reviewer, evaluator, scaffold, and GEPA/autoresearch changes that should be tested next.',\n    },\n    {\n      id: 'external-evidence',\n      name: 'External Evidence',\n      responsibility:\n        'Separate customer-safe claims from internal harness findings and reject conclusions without task, trace, span, code, reviewer, or verifier evidence.',\n    },\n  ]\n}\n\nexport function buildTraceInsightPrompt(input: TraceInsightPromptInput): string {\n  const context = buildTraceInsightContext(input)\n  const maxRepresentativeTraces = input.maxRepresentativeTraces ?? 6\n  return `Analyze this benchmark run and produce evidence-backed trace intelligence.\n\nAudience:\n- internal AI/product leadership\n- possible customer-facing report for ${input.suite.name}\n\nInvestigation plan:\n${context.questions.map((item, index) => `${index + 1}. ${item.question} (${item.why})`).join('\\n')}\n\nAnalyst panel:\n${context.panel.map((role) => `- ${role.name}: ${role.responsibility}`).join('\\n')}\n\nIf the task branches are independent, use subagents for the panel roles above and aggregate their findings. Do not run a panel role unless its answer will change the final report.\n\nRequired output:\n1. Executive verdict: what this run proves and does not prove.\n2. The investigation questions you answered and the evidence used.\n3. Failure taxonomy: agent prompting, evaluator/harness, docs/examples, SDK/API/product integration, infra.\n4. Evidence-backed examples with trace ids/task ids and concrete verifier findings.\n5. Highest-ROI fixes for the benchmark harness, prompt/GEPA optimization, and customer-facing product/docs surface.\n6. What is safe for an external report versus what must stay internal.\n7. One rerun plan that would validate lift after optimization.\n\nBudget:\n- Inspect the dataset overview, the failure summary, and at most ${maxRepresentativeTraces} representative traces.\n- Prefer traces named in the failure summary over broad exploration.\n- Do not do exhaustive trace sweeps.\n- Return the final report as soon as the taxonomy and examples are supported.\n\nRun summary:\n${JSON.stringify(\n  {\n    suite: input.suite.name,\n    scope: context.scope,\n    inferredKeywords: context.keywords,\n    agent: context.agent,\n    totals: context.totals,\n    findings: context.findings.map((finding) => ({\n      kind: finding.kind,\n      severity: finding.severity,\n      taskCount: finding.taskIds.length,\n      proposedFixClass: finding.proposedFixClass,\n    })),\n    failures: input.suite.tasks\n      .filter((task) => task.outcome && task.outcome !== 'satisfied')\n      .map((task) => ({\n        task: task.id,\n        difficulty: task.difficulty,\n        outcome: task.outcome,\n        score: task.score,\n        gaps: task.gaps ?? [],\n      })),\n  },\n  null,\n  2,\n)}\n\nUse the trace tools. Do not invent facts. Cite task ids. Separate customer-facing claims from internal harness/model findings.`\n}\n","/**\n * `flattenOtlpExportToNdjson` — flatten an `OtlpExport` (the shape\n * `exportRunAsOtlp` produces) into the per-line JSON the analyst's\n * `OtlpFileTraceStore` index reads. Replaces three per-consumer OTLP\n * flatteners with one canonical projection.\n *\n * Pure function, no I/O — the caller does `.map(JSON.stringify).join('\\n')`\n * and writes the file (consumers want control over rotation + naming).\n */\n\nimport type { OtlpExport, OtlpSpan } from '../trace/otel'\n\nexport interface OtlpFlatLine {\n  trace_id: string\n  span_id: string\n  parent_span_id: string | null\n  name: string\n  kind: string\n  start_time: string\n  end_time: string\n  status: {\n    code: 'STATUS_CODE_OK' | 'STATUS_CODE_ERROR' | 'STATUS_CODE_UNSET'\n    message?: string\n  }\n  resource: { attributes: Record<string, string | number | boolean> }\n  attributes: Record<string, string | number | boolean>\n  events?: Array<{ name: string; timeUnixNano?: string; attributes?: Record<string, unknown> }>\n}\n\nexport interface FlattenOtlpOptions {\n  /** `'openinference'` (default) mirrors per-span attributes into the\n   *  OpenInference vocabulary the analyst's `inferKind` reads\n   *  (`llm.model`→`llm.model_name`, `tool.name`→`inference.tool.name`,\n   *  `span.kind`→`openinference.span.kind` uppercased). `'none'` passes\n   *  attributes through untouched. */\n  attributeVocabulary?: 'openinference' | 'none'\n  /** Override the numeric-kind → otlp-string mapping. */\n  kindMap?: Partial<Record<number, string>>\n}\n\nconst DEFAULT_KIND_MAP: Record<number, string> = {\n  0: 'SPAN_KIND_UNSPECIFIED',\n  1: 'SPAN_KIND_INTERNAL',\n  2: 'SPAN_KIND_SERVER',\n  3: 'SPAN_KIND_CLIENT',\n  4: 'SPAN_KIND_PRODUCER',\n  5: 'SPAN_KIND_CONSUMER',\n}\n\nconst STATUS_MAP: Record<number, OtlpFlatLine['status']['code']> = {\n  0: 'STATUS_CODE_UNSET',\n  1: 'STATUS_CODE_OK',\n  2: 'STATUS_CODE_ERROR',\n}\n\n/** Unwrap an OTLP attribute-value union to a scalar. */\nfunction attrValue(v: OtlpSpan['attributes'][number]['value']): string | number | boolean {\n  if (v.stringValue !== undefined) return v.stringValue\n  if (v.intValue !== undefined) return Number(v.intValue)\n  if (v.doubleValue !== undefined) return v.doubleValue\n  if (v.boolValue !== undefined) return v.boolValue\n  return ''\n}\n\nfunction attrsToRecord(attrs: OtlpSpan['attributes']): Record<string, string | number | boolean> {\n  const out: Record<string, string | number | boolean> = {}\n  for (const a of attrs) out[a.key] = attrValue(a.value)\n  return out\n}\n\nfunction nanoToIso(nano: string): string {\n  const ms = Number(nano) / 1_000_000\n  return Number.isFinite(ms) ? new Date(ms).toISOString() : new Date(0).toISOString()\n}\n\n/** Mirror selected attributes into the OpenInference vocabulary in place. */\nfunction applyOpenInference(attrs: Record<string, string | number | boolean>): void {\n  if ('llm.model' in attrs && !('llm.model_name' in attrs)) {\n    attrs['llm.model_name'] = attrs['llm.model']!\n  }\n  if ('tool.name' in attrs && !('inference.tool.name' in attrs)) {\n    attrs['inference.tool.name'] = attrs['tool.name']!\n  }\n  if ('span.kind' in attrs && !('openinference.span.kind' in attrs)) {\n    attrs['openinference.span.kind'] = String(attrs['span.kind']).toUpperCase()\n  }\n}\n\nexport function flattenOtlpExportToNdjson(\n  otlpExport: OtlpExport,\n  opts: FlattenOtlpOptions = {},\n): OtlpFlatLine[] {\n  const vocab = opts.attributeVocabulary ?? 'openinference'\n  const kindMap = { ...DEFAULT_KIND_MAP, ...opts.kindMap }\n  const lines: OtlpFlatLine[] = []\n\n  for (const rs of otlpExport.resourceSpans ?? []) {\n    const resource = { attributes: attrsToRecord(rs.resource?.attributes ?? []) }\n    for (const scope of rs.scopeSpans ?? []) {\n      for (const span of scope.spans ?? []) {\n        const attributes = attrsToRecord(span.attributes ?? [])\n        if (vocab === 'openinference') applyOpenInference(attributes)\n        const line: OtlpFlatLine = {\n          trace_id: span.traceId,\n          span_id: span.spanId,\n          parent_span_id: span.parentSpanId ?? null,\n          name: span.name,\n          kind: kindMap[span.kind] ?? 'SPAN_KIND_UNSPECIFIED',\n          start_time: nanoToIso(span.startTimeUnixNano),\n          end_time: nanoToIso(span.endTimeUnixNano),\n          status: {\n            code: STATUS_MAP[span.status?.code ?? 0] ?? 'STATUS_CODE_UNSET',\n            ...(span.status?.message ? { message: span.status.message } : {}),\n          },\n          resource,\n          attributes,\n        }\n        if (span.events && span.events.length > 0) {\n          line.events = span.events.map((e) => ({\n            name: e.name,\n            timeUnixNano: e.timeUnixNano,\n            ...(e.attributes ? { attributes: attrsToRecord(e.attributes) } : {}),\n          }))\n        }\n        lines.push(line)\n      }\n    }\n  }\n\n  return lines\n}\n","/**\n * `otlpToRunRecords` — fold an OTLP traces.jsonl (one OTLP span per line;\n * the form AppWorld / HALO emit via their OpenInference OTLP exporter, the\n * same shape `flattenOtlpExportToNdjson` produces) into validated\n * `RunRecord[]` — one record per `trace_id` (one trace == one task).\n *\n * This is the offline ingestion primitive the AppWorld driver bench and the\n * hosted Intelligence product both stand on: traces in, paper-grade rows\n * out, ready for `compareDrivers` / `analyzeRuns` / the promotion gate.\n *\n * Aggregation per trace:\n *   - tokenUsage: sum LLM-span `input` / `output` (+ `cached` when present)\n *     across every LLM span in the trace.\n *   - costUsd: sum per-span LLM cost when present; else priced via\n *     `opts.priceUsdPerToken` from the aggregated tokens; else 0 with a\n *     loud `raw.cost_unpriced = 1` marker so a missing price is visible, not\n *     a silent zero folded into a gate.\n *   - failureMode: the first `STATUS_CODE_ERROR` span's normalized status\n *     message (carries the real failure signature, not a generic class).\n *   - model: the dominant LLM model in the trace (snapshot-padded to satisfy\n *     `validateRunRecord` when the trace's model is a bare alias).\n *   - outcome score: `opts.scoreForTrace` (AppWorld `world.evaluate()` →\n *     TGC/SGC) when supplied; else 1 when the trace had no error span, 0\n *     when it did — a defensible default the caller can override.\n *   - prompt / completion: carried into `raw` as token-count signals and,\n *     when the first/last LLM span exposes `input.value` / `output.value`,\n *     the verbatim text is preserved on the optional `promptText` /\n *     `completionText` of the returned `OtlpTraceRunRecord`.\n *\n * Fail-loud: an OTLP file with zero valid spans throws. A trace with no\n * spans is impossible (a trace exists only because a span referenced it).\n * `validateRunRecord` runs on every row — a malformed projection throws\n * rather than silently producing a half-record.\n */\n\nimport {\n  type RunRecord,\n  type RunSplitTag,\n  type RunTokenUsage,\n  validateRunRecord,\n} from '../run-record'\nimport {\n  firstNumberAttr,\n  firstStringAttr,\n  type ProjectedOtlpSpan,\n  projectOtlpFlatLine,\n} from './otlp-span'\n\n/** Candidate attribute keys for LLM input (prompt) tokens, both dialects. */\nconst INPUT_TOKEN_KEYS = [\n  'llm.input_tokens',\n  'inference.llm.input_tokens',\n  'llm.token_count.prompt',\n  'gen_ai.usage.input_tokens',\n  'gen_ai.usage.prompt_tokens',\n] as const\n/** Candidate attribute keys for LLM output (completion) tokens. */\nconst OUTPUT_TOKEN_KEYS = [\n  'llm.output_tokens',\n  'inference.llm.output_tokens',\n  'llm.token_count.completion',\n  'gen_ai.usage.output_tokens',\n  'gen_ai.usage.completion_tokens',\n] as const\n/** Candidate attribute keys for cached/prompt-cache tokens. */\nconst CACHED_TOKEN_KEYS = [\n  'llm.cached_tokens',\n  'inference.llm.cached_tokens',\n  'llm.token_count.prompt_cache_hit',\n  'gen_ai.usage.cached_tokens',\n] as const\n/** Candidate attribute keys for per-span LLM cost in USD. */\nconst COST_KEYS = [\n  'llm.cost_usd',\n  'inference.llm.cost.total',\n  'llm.cost.total',\n  'gen_ai.usage.cost',\n] as const\n/** Candidate attribute keys for the model identifier. */\nconst MODEL_KEYS = [\n  'llm.model_name',\n  'inference.llm.model_name',\n  'llm.model',\n  'gen_ai.request.model',\n  'gen_ai.response.model',\n] as const\n\nexport interface OtlpToRunRecordsOptions {\n  /** Logical experiment grouping for every produced record. */\n  experimentId: string\n  /** Candidate (variant) id — the surface these traces exercised. The\n   *  bench passes the driver label here so `compareDrivers` can pair rows. */\n  candidateId: string\n  /** Split assignment for every produced record. Default `'holdout'` —\n   *  ingested traces are evidence, not the optimizer's training pool. */\n  splitTag?: RunSplitTag\n  /** Git SHA the traces were produced from. Default `'unknown'`. */\n  commitSha?: string\n  /** sha256 of the effective prompt surface. Default `'unknown'`. */\n  promptHash?: string\n  /** sha256 of the effective config. Default `'unknown'`. */\n  configHash?: string\n  /** RNG seed recorded on every row. Default 0. */\n  seed?: number\n  /**\n   * Fallback model snapshot when the trace exposes no LLM model attribute\n   * OR exposes a bare alias `validateRunRecord` would reject. The trace's\n   * own model wins when it already carries a snapshot. Default\n   * `'unknown@otlp'` (opaque-snapshot form the validator accepts).\n   */\n  fallbackModel?: string\n  /**\n   * USD per total token (input+output) used to price a trace when no\n   * per-span cost attribute is present. When unset, an unpriced trace\n   * records `costUsd: 0` AND `raw.cost_unpriced = 1` — the zero is flagged,\n   * never silent.\n   */\n  priceUsdPerToken?: number\n  /**\n   * Score for a trace's outcome (AppWorld `world.evaluate()` → TGC/SGC, or\n   * any [0,1] task-success signal). Keyed by `trace_id`; falls through to\n   * the error-derived default (1 = no error span, 0 = had one) when the map\n   * has no entry or the function returns undefined.\n   */\n  scoreForTrace?: (traceId: string, span: TraceAggregate) => number | undefined\n  /**\n   * Per-record judge metadata when an external judge produced the score.\n   * Keyed by `trace_id`.\n   */\n  judgeMetadataForTrace?: (traceId: string) => RunRecord['judgeMetadata'] | undefined\n}\n\n/** A `RunRecord` plus the verbatim prompt/completion text when the trace's\n *  LLM spans exposed it. The text is NOT on the validated `RunRecord`\n *  (`outcome.raw` is numeric-only) but consumers ingesting full traces want\n *  it — so it rides alongside. */\nexport interface OtlpTraceRunRecord {\n  record: RunRecord\n  /** Verbatim first-LLM-span `input.value`, when present. */\n  promptText?: string\n  /** Verbatim last-LLM-span `output.value`, when present. */\n  completionText?: string\n}\n\n/** Per-trace rollup the score callback can inspect. */\nexport interface TraceAggregate {\n  traceId: string\n  spanCount: number\n  llmSpanCount: number\n  toolSpanCount: number\n  agentSpanCount: number\n  errorSpanCount: number\n  tokenUsage: RunTokenUsage\n  /** First error span's normalized status message, if any. */\n  firstErrorMessage?: string\n  model: string\n  startTime: string\n  endTime: string\n  wallMs: number\n}\n\n/**\n * Parse + aggregate an OTLP traces.jsonl string into validated\n * `RunRecord[]` (one per trace). Use {@link otlpToTraceRunRecords} when you\n * also want the verbatim prompt/completion text alongside each record.\n */\nexport function otlpToRunRecords(otlpJsonl: string, opts: OtlpToRunRecordsOptions): RunRecord[] {\n  return otlpToTraceRunRecords(otlpJsonl, opts).map((r) => r.record)\n}\n\n/** As {@link otlpToRunRecords} but returns the prompt/completion text too. */\nexport function otlpToTraceRunRecords(\n  otlpJsonl: string,\n  opts: OtlpToRunRecordsOptions,\n): OtlpTraceRunRecord[] {\n  const splitTag = opts.splitTag ?? 'holdout'\n  const commitSha = opts.commitSha ?? 'unknown'\n  const promptHash = opts.promptHash ?? 'unknown'\n  const configHash = opts.configHash ?? 'unknown'\n  const seed = opts.seed ?? 0\n  const fallbackModel = opts.fallbackModel ?? 'unknown@otlp'\n\n  const byTrace = groupSpansByTrace(otlpJsonl)\n  if (byTrace.size === 0) {\n    throw new Error(\n      'otlpToRunRecords: OTLP input produced zero valid spans — every line was empty, malformed, or missing trace_id/span_id',\n    )\n  }\n\n  // Stable trace order (insertion order of first appearance is preserved by\n  // Map; sort by trace_id for determinism across producers).\n  const traceIds = [...byTrace.keys()].sort()\n  const out: OtlpTraceRunRecord[] = []\n\n  for (const traceId of traceIds) {\n    const spans = byTrace.get(traceId)!\n    const agg = aggregateTrace(traceId, spans, fallbackModel)\n\n    const score = resolveScore(opts, traceId, agg)\n    const { costUsd, costUnpriced } = resolveCost(opts, agg, spans)\n\n    const raw: Record<string, number> = {\n      span_count: agg.spanCount,\n      llm_span_count: agg.llmSpanCount,\n      tool_span_count: agg.toolSpanCount,\n      agent_span_count: agg.agentSpanCount,\n      error_span_count: agg.errorSpanCount,\n      prompt_tokens: agg.tokenUsage.input,\n      completion_tokens: agg.tokenUsage.output,\n    }\n    if (agg.tokenUsage.cached !== undefined) raw.cached_tokens = agg.tokenUsage.cached\n    if (costUnpriced) raw.cost_unpriced = 1\n\n    const outcome =\n      splitTag === 'holdout' ? { holdoutScore: score, raw } : { searchScore: score, raw }\n\n    const { promptText, completionText } = extractPromptCompletion(spans)\n    const judgeMetadata = opts.judgeMetadataForTrace?.(traceId)\n\n    const record = validateRunRecord({\n      runId: `otlp:${opts.experimentId}:${opts.candidateId}:${traceId}`,\n      experimentId: opts.experimentId,\n      candidateId: opts.candidateId,\n      seed,\n      model: ensureSnapshot(agg.model, fallbackModel),\n      promptHash,\n      configHash,\n      commitSha,\n      wallMs: agg.wallMs,\n      costUsd,\n      tokenUsage: agg.tokenUsage,\n      ...(judgeMetadata ? { judgeMetadata } : {}),\n      outcome,\n      ...(agg.firstErrorMessage ? { failureMode: agg.firstErrorMessage } : {}),\n      splitTag,\n      scenarioId: traceId,\n    })\n\n    out.push({\n      record,\n      ...(promptText !== undefined ? { promptText } : {}),\n      ...(completionText !== undefined ? { completionText } : {}),\n    })\n  }\n\n  return out\n}\n\n// ── Internals ──────────────────────────────────────────────────────────\n\nfunction groupSpansByTrace(otlpJsonl: string): Map<string, ProjectedOtlpSpan[]> {\n  const byTrace = new Map<string, ProjectedOtlpSpan[]>()\n  for (const line of otlpJsonl.split('\\n')) {\n    const trimmed = line.trim()\n    if (trimmed.length === 0) continue\n    let parsed: unknown\n    try {\n      parsed = JSON.parse(trimmed)\n    } catch {\n      // Tolerate a stray malformed line — mirrors the store's index, which\n      // skips unparseable lines rather than nuking a whole dataset. A file\n      // that is ENTIRELY malformed still throws (zero valid spans).\n      continue\n    }\n    if (!parsed || typeof parsed !== 'object') continue\n    const span = projectOtlpFlatLine(parsed as Record<string, unknown>)\n    if (!span) continue\n    const arr = byTrace.get(span.trace_id)\n    if (arr) arr.push(span)\n    else byTrace.set(span.trace_id, [span])\n  }\n  return byTrace\n}\n\nfunction aggregateTrace(\n  traceId: string,\n  spans: ProjectedOtlpSpan[],\n  fallbackModel: string,\n): TraceAggregate {\n  // Span order within a trace is by start time, then a stable tiebreak.\n  const ordered = [...spans].sort(\n    (a, b) => a.start_time.localeCompare(b.start_time) || a.span_id.localeCompare(b.span_id),\n  )\n\n  let input = 0\n  let output = 0\n  let cached = 0\n  let sawCached = false\n  let llmSpanCount = 0\n  let toolSpanCount = 0\n  let agentSpanCount = 0\n  let errorSpanCount = 0\n  let firstErrorMessage: string | undefined\n  const modelVotes = new Map<string, number>()\n  let earliest = ordered[0]?.start_time ?? ''\n  let latest = ordered[0]?.end_time ?? ''\n\n  for (const s of ordered) {\n    if (s.start_time && (!earliest || s.start_time < earliest)) earliest = s.start_time\n    if (s.end_time && s.end_time > latest) latest = s.end_time\n\n    if (s.kind === 'LLM') {\n      llmSpanCount += 1\n      const i = firstNumberAttr(s.attributes, INPUT_TOKEN_KEYS)\n      const o = firstNumberAttr(s.attributes, OUTPUT_TOKEN_KEYS)\n      const c = firstNumberAttr(s.attributes, CACHED_TOKEN_KEYS)\n      if (i !== null) input += i\n      if (o !== null) output += o\n      if (c !== null) {\n        cached += c\n        sawCached = true\n      }\n      const m = firstStringAttr(s.attributes, MODEL_KEYS) ?? s.model_name\n      if (m) modelVotes.set(m, (modelVotes.get(m) ?? 0) + 1)\n    } else if (s.kind === 'TOOL') {\n      toolSpanCount += 1\n    } else if (s.kind === 'AGENT') {\n      agentSpanCount += 1\n    }\n\n    if (s.status === 'ERROR') {\n      errorSpanCount += 1\n      if (firstErrorMessage === undefined) {\n        firstErrorMessage = (s.status_message ?? `${s.name} — STATUS_CODE_ERROR`).slice(0, 500)\n      }\n    }\n  }\n\n  // Dominant model across LLM spans; falls back to any model attribute on a\n  // non-LLM span, then the supplied fallback snapshot.\n  const model = topVote(modelVotes) ?? firstModelAttr(ordered) ?? fallbackModel\n\n  let wallMs = 0\n  if (earliest && latest) {\n    const a = Date.parse(earliest)\n    const b = Date.parse(latest)\n    if (!Number.isNaN(a) && !Number.isNaN(b)) wallMs = Math.max(0, b - a)\n  }\n\n  const tokenUsage: RunTokenUsage = sawCached ? { input, output, cached } : { input, output }\n\n  return {\n    traceId,\n    spanCount: spans.length,\n    llmSpanCount,\n    toolSpanCount,\n    agentSpanCount,\n    errorSpanCount,\n    tokenUsage,\n    firstErrorMessage,\n    model,\n    startTime: earliest,\n    endTime: latest,\n    wallMs,\n  }\n}\n\nfunction resolveScore(opts: OtlpToRunRecordsOptions, traceId: string, agg: TraceAggregate): number {\n  const supplied = opts.scoreForTrace?.(traceId, agg)\n  if (supplied !== undefined) {\n    if (!Number.isFinite(supplied)) {\n      throw new Error(\n        `otlpToRunRecords: scoreForTrace('${traceId}') returned non-finite ${supplied}`,\n      )\n    }\n    return supplied\n  }\n  // Default: error-derived. A trace with any error span scores 0; otherwise 1.\n  return agg.errorSpanCount > 0 ? 0 : 1\n}\n\nfunction resolveCost(\n  opts: OtlpToRunRecordsOptions,\n  agg: TraceAggregate,\n  spans: ProjectedOtlpSpan[],\n): { costUsd: number; costUnpriced: boolean } {\n  // Prefer per-span LLM cost attributes summed across the trace.\n  let perSpanCost = 0\n  let sawCost = false\n  for (const s of spans) {\n    if (s.kind !== 'LLM') continue\n    const c = firstNumberAttr(s.attributes, COST_KEYS)\n    if (c !== null) {\n      perSpanCost += c\n      sawCost = true\n    }\n  }\n  if (sawCost) return { costUsd: perSpanCost, costUnpriced: false }\n\n  if (opts.priceUsdPerToken !== undefined) {\n    const totalTokens = agg.tokenUsage.input + agg.tokenUsage.output\n    return { costUsd: totalTokens * opts.priceUsdPerToken, costUnpriced: false }\n  }\n\n  // No per-span cost, no price table — record 0 but flag it loudly so a\n  // missing price never silently flatters a cost axis.\n  return { costUsd: 0, costUnpriced: true }\n}\n\nfunction extractPromptCompletion(spans: ProjectedOtlpSpan[]): {\n  promptText?: string\n  completionText?: string\n} {\n  const llm = spans\n    .filter((s) => s.kind === 'LLM')\n    .sort((a, b) => a.start_time.localeCompare(b.start_time) || a.span_id.localeCompare(b.span_id))\n  if (llm.length === 0) return {}\n  const promptText =\n    firstStringAttr(llm[0]!.attributes, ['input.value', 'llm.input_messages', 'gen_ai.prompt']) ??\n    undefined\n  const last = llm[llm.length - 1]!\n  const completionText =\n    firstStringAttr(last.attributes, [\n      'output.value',\n      'llm.output_messages',\n      'gen_ai.completion',\n    ]) ?? undefined\n  return {\n    ...(promptText !== undefined ? { promptText } : {}),\n    ...(completionText !== undefined ? { completionText } : {}),\n  }\n}\n\nfunction topVote(votes: Map<string, number>): string | null {\n  let best: string | null = null\n  let bestN = 0\n  for (const [k, n] of votes) {\n    // Strict > keeps the higher count; lexicographic tie-break makes the winner\n    // independent of Map insertion order (reproducible across producers).\n    if (n > bestN || (n === bestN && best !== null && k < best)) {\n      best = k\n      bestN = n\n    }\n  }\n  return best\n}\n\nfunction firstModelAttr(spans: ProjectedOtlpSpan[]): string | null {\n  for (const s of spans) {\n    const m = firstStringAttr(s.attributes, MODEL_KEYS) ?? s.model_name\n    if (m) return m\n  }\n  return null\n}\n\n/**\n * `validateRunRecord` rejects bare model aliases (`gpt-4o`) that remap\n * silently. AppWorld/HALO traces frequently carry such bare ids (or a null\n * model). When the model already encodes a snapshot we keep it; otherwise we\n * append the fallback snapshot token so the row is admissible without lying\n * about the model — the bare base name is preserved verbatim before `@`.\n */\nfunction ensureSnapshot(model: string, fallbackModel: string): string {\n  if (modelHasSnapshot(model)) return model\n  const fallbackTag = fallbackModel.includes('@')\n    ? fallbackModel.slice(fallbackModel.indexOf('@'))\n    : '@otlp'\n  return `${model}${fallbackTag}`\n}\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","/**\n * TraceStore — persistence + query over the TraceSchema v1 corpus.\n *\n * Two implementations ship in the core:\n *   - InMemoryTraceStore: dev + tests, fully in-process\n *   - FileSystemTraceStore: NDJSON append-only files per entity, suitable\n *     for long-running CI jobs; rolled over at 32MB\n *\n * Downstream adapters (DuckDB, Langfuse, R2 parquet) implement this same\n * interface — the rest of the framework is storage-agnostic.\n */\n\nimport type {\n  Artifact,\n  BudgetLedgerEntry,\n  EventKind,\n  Run,\n  RunStatus,\n  Span,\n  SpanKind,\n  TraceEvent,\n} from './schema'\n\nexport interface RunFilter {\n  scenarioId?: string\n  variantId?: string\n  status?: RunStatus\n  since?: number\n  until?: number\n  tag?: { key: string; value: string }\n  parentRunId?: string\n  projectId?: string\n  chatId?: string\n  layer?: import('./schema').RunLayer\n}\n\nexport interface SpanFilter {\n  runId?: string\n  parentSpanId?: string\n  kind?: SpanKind\n  name?: string\n  toolName?: string\n  judgeId?: string\n  since?: number\n  until?: number\n}\n\nexport interface EventFilter {\n  runId?: string\n  spanId?: string\n  kind?: EventKind\n  since?: number\n  until?: number\n}\n\nexport interface TraceStore {\n  appendRun(run: Run): Promise<void>\n  updateRun(runId: string, patch: Partial<Run>): Promise<void>\n  appendSpan(span: Span): Promise<void>\n  updateSpan(spanId: string, patch: Partial<Span>): Promise<void>\n  appendEvent(event: TraceEvent): Promise<void>\n  appendArtifact(artifact: Artifact): Promise<void>\n  appendBudgetEntry(entry: BudgetLedgerEntry): Promise<void>\n\n  getRun(runId: string): Promise<Run | undefined>\n  listRuns(filter?: RunFilter): Promise<Run[]>\n  spans(filter?: SpanFilter): Promise<Span[]>\n  events(filter?: EventFilter): Promise<TraceEvent[]>\n  budget(runId: string): Promise<BudgetLedgerEntry[]>\n  artifacts(runId: string): Promise<Artifact[]>\n}\n\n// ── In-memory ────────────────────────────────────────────────────────\n\nexport class InMemoryTraceStore implements TraceStore {\n  private runs = new Map<string, Run>()\n  private allSpans: Span[] = []\n  private allEvents: TraceEvent[] = []\n  private allArtifacts: Artifact[] = []\n  private allBudget: BudgetLedgerEntry[] = []\n\n  async appendRun(run: Run): Promise<void> {\n    if (this.runs.has(run.runId)) throw new Error(`run ${run.runId} already exists`)\n    this.runs.set(run.runId, { ...run })\n  }\n\n  async updateRun(runId: string, patch: Partial<Run>): Promise<void> {\n    const existing = this.runs.get(runId)\n    if (!existing) throw new Error(`run ${runId} not found`)\n    this.runs.set(runId, { ...existing, ...patch })\n  }\n\n  async appendSpan(span: Span): Promise<void> {\n    this.allSpans.push({ ...span })\n  }\n\n  async updateSpan(spanId: string, patch: Partial<Span>): Promise<void> {\n    const idx = this.allSpans.findIndex((s) => s.spanId === spanId)\n    if (idx < 0) throw new Error(`span ${spanId} not found`)\n    this.allSpans[idx] = { ...this.allSpans[idx], ...patch } as Span\n  }\n\n  async appendEvent(event: TraceEvent): Promise<void> {\n    this.allEvents.push({ ...event })\n  }\n\n  async appendArtifact(artifact: Artifact): Promise<void> {\n    this.allArtifacts.push({ ...artifact })\n  }\n\n  async appendBudgetEntry(entry: BudgetLedgerEntry): Promise<void> {\n    this.allBudget.push({ ...entry })\n  }\n\n  async getRun(runId: string): Promise<Run | undefined> {\n    const r = this.runs.get(runId)\n    return r ? { ...r } : undefined\n  }\n\n  async listRuns(filter: RunFilter = {}): Promise<Run[]> {\n    return [...this.runs.values()].filter((r) => matchesRun(r, filter))\n  }\n\n  async spans(filter: SpanFilter = {}): Promise<Span[]> {\n    return this.allSpans.filter((s) => matchesSpan(s, filter)).map((s) => ({ ...s }))\n  }\n\n  async events(filter: EventFilter = {}): Promise<TraceEvent[]> {\n    return this.allEvents.filter((e) => matchesEvent(e, filter)).map((e) => ({ ...e }))\n  }\n\n  async budget(runId: string): Promise<BudgetLedgerEntry[]> {\n    return this.allBudget.filter((b) => b.runId === runId).map((b) => ({ ...b }))\n  }\n\n  async artifacts(runId: string): Promise<Artifact[]> {\n    return this.allArtifacts.filter((a) => a.runId === runId).map((a) => ({ ...a }))\n  }\n}\n\nfunction matchesRun(r: Run, f: RunFilter): boolean {\n  if (f.scenarioId && r.scenarioId !== f.scenarioId) return false\n  if (f.variantId && r.variantId !== f.variantId) return false\n  if (f.status && r.status !== f.status) return false\n  if (f.since !== undefined && r.startedAt < f.since) return false\n  if (f.until !== undefined && r.startedAt > f.until) return false\n  if (f.tag && r.tags?.[f.tag.key] !== f.tag.value) return false\n  if (f.parentRunId && r.parentRunId !== f.parentRunId) return false\n  if (f.projectId && r.projectId !== f.projectId) return false\n  if (f.chatId && r.chatId !== f.chatId) return false\n  if (f.layer && r.layer !== f.layer) return false\n  return true\n}\n\nfunction matchesSpan(s: Span, f: SpanFilter): boolean {\n  if (f.runId && s.runId !== f.runId) return false\n  if (f.parentSpanId && s.parentSpanId !== f.parentSpanId) return false\n  if (f.kind && s.kind !== f.kind) return false\n  if (f.name && s.name !== f.name) return false\n  if (f.toolName && (s.kind !== 'tool' || s.toolName !== f.toolName)) return false\n  if (f.judgeId && (s.kind !== 'judge' || s.judgeId !== f.judgeId)) return false\n  if (f.since !== undefined && s.startedAt < f.since) return false\n  if (f.until !== undefined && s.startedAt > f.until) return false\n  return true\n}\n\nfunction matchesEvent(e: TraceEvent, f: EventFilter): boolean {\n  if (f.runId && e.runId !== f.runId) return false\n  if (f.spanId && e.spanId !== f.spanId) return false\n  if (f.kind && e.kind !== f.kind) return false\n  if (f.since !== undefined && e.timestamp < f.since) return false\n  if (f.until !== undefined && e.timestamp > f.until) return false\n  return true\n}\n\n// ── Filesystem (NDJSON append-only, one file per entity) ─────────────\n\nexport interface FileSystemTraceStoreOptions {\n  dir: string\n  /** Roll over NDJSON files when they exceed this size in bytes. Default 32 MB. */\n  maxBytes?: number\n}\n\nexport class FileSystemTraceStore implements TraceStore {\n  private dir: string\n  private maxBytes: number\n  /** Lazy in-memory index for queries — populated on first read. */\n  private index?: InMemoryTraceStore\n  private loaded = false\n\n  constructor(options: FileSystemTraceStoreOptions) {\n    this.dir = options.dir\n    this.maxBytes = options.maxBytes ?? 32 * 1024 * 1024\n  }\n\n  private async ensureDir(): Promise<void> {\n    const fs = await import('node:fs/promises')\n    await fs.mkdir(this.dir, { recursive: true })\n  }\n\n  private async append(name: string, record: unknown): Promise<void> {\n    await this.ensureDir()\n    const fs = await import('node:fs/promises')\n    const path = await import('node:path')\n    const active = path.join(this.dir, `${name}.ndjson`)\n    try {\n      const stat = await fs.stat(active)\n      if (stat.size >= this.maxBytes) {\n        const rolled = path.join(this.dir, `${name}.${Date.now()}.ndjson`)\n        await fs.rename(active, rolled)\n      }\n    } catch {\n      /* file doesn't exist yet */\n    }\n    await fs.appendFile(active, `${JSON.stringify(record)}\\n`, 'utf8')\n    // Mirror genuinely-new rows into the lazy index. Update rows (marked\n    // with `_update: true` by updateRun/updateSpan) are applied by those\n    // methods directly via the index's update* APIs — re-inserting them\n    // here triggers a duplicate-id error once the first read populates\n    // the index.\n    if (this.index && !(record as { _update?: boolean })?._update) {\n      void this.insertInto(name, record)\n    }\n  }\n\n  private async insertInto(name: string, record: unknown): Promise<void> {\n    if (!this.index) return\n    switch (name) {\n      case 'runs':\n        await this.index.appendRun(record as Run)\n        break\n      case 'spans':\n        await this.index.appendSpan(record as Span)\n        break\n      case 'events':\n        await this.index.appendEvent(record as TraceEvent)\n        break\n      case 'artifacts':\n        await this.index.appendArtifact(record as Artifact)\n        break\n      case 'budget':\n        await this.index.appendBudgetEntry(record as BudgetLedgerEntry)\n        break\n    }\n  }\n\n  private async load(): Promise<InMemoryTraceStore> {\n    if (this.loaded && this.index) return this.index\n    const fs = await import('node:fs/promises')\n    const path = await import('node:path')\n    const store = new InMemoryTraceStore()\n    try {\n      const entries = await fs.readdir(this.dir)\n      for (const file of entries) {\n        if (!file.endsWith('.ndjson')) continue\n        const full = path.join(this.dir, file)\n        const content = await fs.readFile(full, 'utf8')\n        const base = file.split('.')[0]\n        for (const line of content.split('\\n')) {\n          if (!line.trim()) continue\n          const record = JSON.parse(line)\n          if (base === 'runs') {\n            // Allow re-loading without duplicate error\n            try {\n              await store.appendRun(record)\n            } catch {\n              await store.updateRun(record.runId, record)\n            }\n          } else if (base === 'spans') {\n            // `updateSpan` appends an `_update: true` patch row instead of\n            // rewriting the original span. On reload we must collapse those\n            // patches onto the original span — otherwise a fresh\n            // FileSystemTraceStore reading the same dir reports duplicate\n            // spans (one full, one fragment with no runId/kind/name), which\n            // breaks any downstream consumer that re-opens the store\n            // cross-process (e.g. the OTLP converter).\n            if (record?._update) {\n              try {\n                await store.updateSpan(record.spanId, record)\n              } catch {\n                // Patch row arrived before the original — should not happen\n                // with locked append order, but fall through to append so we\n                // don't lose data.\n                await store.appendSpan(record)\n              }\n            } else {\n              await store.appendSpan(record)\n            }\n          } else if (base === 'events') {\n            await store.appendEvent(record)\n          } else if (base === 'artifacts') {\n            await store.appendArtifact(record)\n          } else if (base === 'budget') {\n            await store.appendBudgetEntry(record)\n          }\n        }\n      }\n    } catch {\n      /* empty dir, first run */\n    }\n    this.index = store\n    this.loaded = true\n    return store\n  }\n\n  async appendRun(run: Run): Promise<void> {\n    await this.append('runs', run)\n  }\n  async updateRun(runId: string, patch: Partial<Run>): Promise<void> {\n    // NDJSON is append-only; record updates as new rows with the same runId —\n    // readers collapse by last-write-wins on load.\n    await this.append('runs', { runId, ...patch, _update: true })\n    if (this.index) await this.index.updateRun(runId, patch)\n  }\n  async appendSpan(span: Span): Promise<void> {\n    await this.append('spans', span)\n  }\n  async updateSpan(spanId: string, patch: Partial<Span>): Promise<void> {\n    await this.append('spans', { spanId, ...patch, _update: true })\n    if (this.index) await this.index.updateSpan(spanId, patch)\n  }\n  async appendEvent(event: TraceEvent): Promise<void> {\n    await this.append('events', event)\n  }\n  async appendArtifact(artifact: Artifact): Promise<void> {\n    await this.append('artifacts', artifact)\n  }\n  async appendBudgetEntry(entry: BudgetLedgerEntry): Promise<void> {\n    await this.append('budget', entry)\n  }\n\n  async getRun(runId: string): Promise<Run | undefined> {\n    return (await this.load()).getRun(runId)\n  }\n  async listRuns(filter?: RunFilter): Promise<Run[]> {\n    return (await this.load()).listRuns(filter)\n  }\n  async spans(filter?: SpanFilter): Promise<Span[]> {\n    return (await this.load()).spans(filter)\n  }\n  async events(filter?: EventFilter): Promise<TraceEvent[]> {\n    return (await this.load()).events(filter)\n  }\n  async budget(runId: string): Promise<BudgetLedgerEntry[]> {\n    return (await this.load()).budget(runId)\n  }\n  async artifacts(runId: string): Promise<Artifact[]> {\n    return (await this.load()).artifacts(runId)\n  }\n}\n","/**\n * `captureFetchToRawSink` — wrap a `fetch` so every request / response / error\n * against a provider is recorded into a `RawProviderSink` as the canonical\n * `RawProviderEvent` triple. The one substrate copy of the fetch-capture\n * pattern four consumers hand-roll (legal ships two copies).\n *\n * The returned value is a plain `typeof fetch` — pass it as the `fetchImpl` to\n * any OpenAI-compatible backend factory. Capture is best-effort by default: a\n * sink write that throws does NOT take down the underlying LLM call (set\n * `failClosed` to change that). Uses the existing `defaultProviderRedactor` +\n * `providerFromBaseUrl` — no new redaction policy.\n */\n\nimport {\n  defaultProviderRedactor,\n  type ProviderRedactor,\n  providerFromBaseUrl,\n  type RawProviderDirection,\n  type RawProviderEvent,\n  type RawProviderSink,\n} from './raw-provider-sink'\n\nexport interface CaptureFetchContext {\n  /** Logical run id stamped on every captured event. Required — without it\n   *  the raw events can't be paired with their parent `Run`. */\n  runId: string\n  /** Optional logical span id (enables span-level sink filtering). */\n  spanId?: string\n  /** Resolved base URL (normalised, no trailing slash). Used for the event's\n   *  `baseUrl` and for endpoint-path extraction. */\n  baseUrl: string\n  /** Model id the caller intends to invoke. Stamped on every event. */\n  model: string\n  /** Provider override. When omitted, `providerFromBaseUrl(baseUrl)`. */\n  provider?: string\n}\n\nexport interface CaptureFetchOptions {\n  /** Override the capture-time redactor. Default `defaultProviderRedactor`. */\n  redactor?: ProviderRedactor\n  /** Cap on captured response-body bytes; beyond it the body is truncated and\n   *  `body_truncated` is added to `redactedFields`. Default 2 MiB. */\n  responseBodyByteCap?: number\n  /** When true, a sink-write failure propagates to the caller. Default false\n   *  — capture is best-effort so a sink failure never kills the LLM call. */\n  failClosed?: boolean\n}\n\nconst DEFAULT_BODY_CAP = 2 * 1024 * 1024\n\nfunction headersToRecord(headers: Headers | undefined): Record<string, string> | undefined {\n  if (!headers) return undefined\n  const out: Record<string, string> = {}\n  headers.forEach((value, key) => {\n    out[key.toLowerCase()] = value\n  })\n  return Object.keys(out).length > 0 ? out : undefined\n}\n\nfunction parseMaybeJson(text: string): unknown {\n  if (text.length === 0) return undefined\n  try {\n    return JSON.parse(text)\n  } catch {\n    return text\n  }\n}\n\n/** Best-effort request-body read across the `fetch` input forms. */\nasync function readRequestBody(\n  input: RequestInfo | URL,\n  init: RequestInit | undefined,\n): Promise<unknown> {\n  if (typeof init?.body === 'string') return parseMaybeJson(init.body)\n  if (init?.body != null) return undefined // streams / FormData / Blob — not captured\n  if (input instanceof Request) {\n    try {\n      return parseMaybeJson(await input.clone().text())\n    } catch {\n      return undefined\n    }\n  }\n  return undefined\n}\n\nfunction endpointFromUrl(url: string, baseUrl: string): string {\n  const normalisedBase = baseUrl.replace(/\\/+$/, '')\n  if (url.startsWith(normalisedBase)) return url.slice(normalisedBase.length) || '/'\n  try {\n    return new URL(url).pathname\n  } catch {\n    return url\n  }\n}\n\nexport function captureFetchToRawSink(\n  fetch: typeof globalThis.fetch,\n  sink: RawProviderSink,\n  ctx: CaptureFetchContext,\n  opts: CaptureFetchOptions = {},\n): typeof globalThis.fetch {\n  const provider = ctx.provider ?? providerFromBaseUrl(ctx.baseUrl)\n  const redactor = opts.redactor ?? defaultProviderRedactor\n  const bodyCap = opts.responseBodyByteCap ?? DEFAULT_BODY_CAP\n  let warned = false\n\n  const baseEvent = (direction: RawProviderDirection, endpoint: string): RawProviderEvent => ({\n    eventId: crypto.randomUUID(),\n    runId: ctx.runId,\n    spanId: ctx.spanId,\n    provider,\n    model: ctx.model,\n    endpoint,\n    baseUrl: ctx.baseUrl,\n    attemptIndex: 0, // retries are re-invocations one layer up; documented in 0.x\n    direction,\n    timestamp: Date.now(),\n    redactedFields: [],\n  })\n\n  const record = async (event: RawProviderEvent): Promise<void> => {\n    try {\n      await sink.record(redactor(event))\n    } catch (err) {\n      if (opts.failClosed) throw err\n      if (!warned) {\n        warned = true\n        console.warn(\n          `captureFetchToRawSink: sink.record failed (capture is best-effort) — ${\n            err instanceof Error ? err.message : String(err)\n          }`,\n        )\n      }\n    }\n  }\n\n  return async (input: RequestInfo | URL, init?: RequestInit): Promise<Response> => {\n    const url =\n      typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url\n    const method = (init?.method ?? (input instanceof Request ? input.method : 'GET')).toUpperCase()\n    const endpoint = endpointFromUrl(url, ctx.baseUrl)\n\n    const reqHeaders = new Headers(\n      init?.headers ?? (input instanceof Request ? input.headers : undefined),\n    )\n    await record({\n      ...baseEvent('request', endpoint),\n      requestHeaders: { ...headersToRecord(reqHeaders), 'x-http-method': method },\n      requestBody: await readRequestBody(input, init),\n    })\n\n    const start = Date.now()\n    let response: Response\n    try {\n      response = await fetch(input, init)\n    } catch (err) {\n      await record({\n        ...baseEvent('error', endpoint),\n        durationMs: Date.now() - start,\n        errorMessage: err instanceof Error ? err.message : String(err),\n      })\n      throw err\n    }\n\n    // Read the body off a clone so the caller still consumes the original.\n    let responseBody: unknown\n    const redactedFields: string[] = []\n    try {\n      const raw = await response.clone().text()\n      if (raw.length > bodyCap) {\n        responseBody = raw.slice(0, bodyCap)\n        redactedFields.push('body_truncated')\n      } else {\n        responseBody = parseMaybeJson(raw)\n      }\n    } catch {\n      responseBody = undefined\n    }\n\n    await record({\n      ...baseEvent('response', endpoint),\n      durationMs: Date.now() - start,\n      statusCode: response.status,\n      responseHeaders: headersToRecord(response.headers),\n      responseBody,\n      redactedFields,\n    })\n\n    return response\n  }\n}\n","/**\n * OpenTelemetry JSON export — maps TraceSchema v1 to OTLP/JSON so\n * traces render natively in Jaeger / Honeycomb / Langfuse / Grafana.\n *\n * Wire format only. We do NOT depend on the @opentelemetry SDK — that\n * would drag in polyfills incompatible with Workers/Edge. Consumers\n * push the JSON to their collector of choice via HTTP.\n *\n * Reference: OTLP 1.3.2 (ResourceSpans / ScopeSpans / Span).\n */\n\nimport type { Run, Span, TraceEvent } from './schema'\nimport type { TraceStore } from './store'\n\nexport const OTEL_AGENT_EVAL_SCOPE = { name: '@tangle-network/agent-eval', version: '0.3.0' }\n\nexport interface OtlpSpan {\n  traceId: string\n  spanId: string\n  parentSpanId?: string\n  name: string\n  kind: number\n  startTimeUnixNano: string\n  endTimeUnixNano: string\n  attributes: Array<{\n    key: string\n    value: { stringValue?: string; intValue?: string; doubleValue?: number; boolValue?: boolean }\n  }>\n  events?: Array<{ timeUnixNano: string; name: string; attributes?: OtlpSpan['attributes'] }>\n  status?: { code: number; message?: string }\n}\n\nexport interface OtlpResourceSpans {\n  resource: { attributes: OtlpSpan['attributes'] }\n  scopeSpans: Array<{ scope: typeof OTEL_AGENT_EVAL_SCOPE; spans: OtlpSpan[] }>\n}\n\nexport interface OtlpExport {\n  resourceSpans: OtlpResourceSpans[]\n}\n\n/** Export a single run's spans + events in OTLP/JSON. */\nexport async function exportRunAsOtlp(\n  store: TraceStore,\n  runId: string,\n  resourceAttrs: Record<string, string | number | boolean> = {},\n): Promise<OtlpExport> {\n  const run = await store.getRun(runId)\n  if (!run) throw new Error(`run ${runId} not found`)\n  const spans = await store.spans({ runId })\n  const events = await store.events({ runId })\n  const eventsBySpan = new Map<string, TraceEvent[]>()\n  for (const e of events) {\n    if (!e.spanId) continue\n    const arr = eventsBySpan.get(e.spanId) ?? []\n    arr.push(e)\n    eventsBySpan.set(e.spanId, arr)\n  }\n  const traceId = runToTraceId(run)\n  const otlpSpans: OtlpSpan[] = spans.map((s) =>\n    spanToOtlp(s, traceId, eventsBySpan.get(s.spanId) ?? []),\n  )\n  return {\n    resourceSpans: [\n      {\n        resource: {\n          attributes: toAttributes({\n            'service.name': 'agent-eval',\n            'run.id': run.runId,\n            'run.scenario_id': run.scenarioId,\n            'run.variant_id': run.variantId ?? '',\n            'run.dataset_version': run.datasetVersion ?? '',\n            'run.code_sha': run.codeSha ?? '',\n            'run.model_fingerprint': run.modelFingerprint ?? '',\n            ...resourceAttrs,\n          }),\n        },\n        scopeSpans: [{ scope: OTEL_AGENT_EVAL_SCOPE, spans: otlpSpans }],\n      },\n    ],\n  }\n}\n\nfunction spanToOtlp(span: Span, traceId: string, events: TraceEvent[]): OtlpSpan {\n  const endedAt = span.endedAt ?? span.startedAt\n  return {\n    traceId,\n    spanId: padSpanId(span.spanId),\n    parentSpanId: span.parentSpanId ? padSpanId(span.parentSpanId) : undefined,\n    name: span.name,\n    kind: 1, // SPAN_KIND_INTERNAL\n    startTimeUnixNano: msToNs(span.startedAt),\n    endTimeUnixNano: msToNs(endedAt),\n    attributes: toAttributes(flattenSpanAttributes(span)),\n    events: events.map((e) => ({\n      timeUnixNano: msToNs(e.timestamp),\n      name: e.kind,\n      attributes: toAttributes(flattenPayload(e.payload)),\n    })),\n    status: span.status === 'error' ? { code: 2, message: span.error } : { code: 1 },\n  }\n}\n\nfunction flattenSpanAttributes(span: Span): Record<string, string | number | boolean> {\n  const base: Record<string, string | number | boolean> = {\n    'span.kind': span.kind,\n  }\n  if (span.kind === 'llm') {\n    base['llm.model'] = span.model\n    if (span.inputTokens !== undefined) base['llm.input_tokens'] = span.inputTokens\n    if (span.outputTokens !== undefined) base['llm.output_tokens'] = span.outputTokens\n    if (span.costUsd !== undefined) base['llm.cost_usd'] = span.costUsd\n    if (span.finishReason) base['llm.finish_reason'] = span.finishReason\n  } else if (span.kind === 'tool') {\n    base['tool.name'] = span.toolName\n    if (span.latencyMs !== undefined) base['tool.latency_ms'] = span.latencyMs\n  } else if (span.kind === 'retrieval') {\n    base['retrieval.query'] = span.query\n    base['retrieval.hits'] = span.hits.length\n  } else if (span.kind === 'judge') {\n    base['judge.id'] = span.judgeId\n    base['judge.dimension'] = span.dimension\n    base['judge.score'] = span.score\n    base['judge.target_span_id'] = span.targetSpanId\n  } else if (span.kind === 'sandbox') {\n    if (span.image) base['sandbox.image'] = span.image\n    if (span.exitCode !== undefined) base['sandbox.exit_code'] = span.exitCode\n    if (span.testsPassed !== undefined) base['sandbox.tests_passed'] = span.testsPassed\n    if (span.testsTotal !== undefined) base['sandbox.tests_total'] = span.testsTotal\n  }\n  if (span.attributes) {\n    for (const [k, v] of Object.entries(span.attributes)) {\n      if (typeof v === 'string' || typeof v === 'number' || typeof v === 'boolean') base[k] = v\n    }\n  }\n  return base\n}\n\nfunction flattenPayload(\n  payload: Record<string, unknown>,\n): Record<string, string | number | boolean> {\n  const out: Record<string, string | number | boolean> = {}\n  for (const [k, v] of Object.entries(payload)) {\n    if (typeof v === 'string' || typeof v === 'number' || typeof v === 'boolean') out[k] = v\n    else out[k] = JSON.stringify(v)\n  }\n  return out\n}\n\nfunction toAttributes(record: Record<string, string | number | boolean>): OtlpSpan['attributes'] {\n  return Object.entries(record).map(([key, value]) => ({\n    key,\n    value:\n      typeof value === 'number'\n        ? Number.isInteger(value)\n          ? { intValue: value.toString() }\n          : { doubleValue: value }\n        : typeof value === 'boolean'\n          ? { boolValue: value }\n          : { stringValue: value },\n  }))\n}\n\nfunction msToNs(ms: number): string {\n  return (BigInt(Math.floor(ms)) * 1_000_000n).toString()\n}\n\nfunction padSpanId(id: string): string {\n  // OTLP wants 16-hex spanIds. UUIDs are 32-hex; strip dashes and take first 16.\n  const cleaned = id.replace(/-/g, '')\n  return cleaned.slice(0, 16).padEnd(16, '0')\n}\n\nfunction runToTraceId(run: Run): string {\n  // OTLP wants 32-hex traceIds. Use runId directly when it's 32-hex already,\n  // else SHA-ish truncate.\n  const cleaned = run.runId.replace(/-/g, '')\n  return cleaned.slice(0, 32).padEnd(32, '0')\n}\n","/**\n * OTEL bridge — connects TraceEmitter span lifecycle to the OtelExporter.\n *\n * When an OtelExporter is active, every span that closes through the\n * TraceEmitter is also pushed to the exporter for real-time streaming to\n * the user's OTEL collector.\n *\n * The bridge is opt-in: attach via `otelRunCompleteHook(exporter)` as a\n * RunCompleteHook, or wrap the store with `createOtelTracingStore` for\n * real-time per-span export.\n */\n\nimport type { RunCompleteHook } from './emitter'\nimport type { ExportableSpan, OtelExporter } from './otel-export'\nimport type { LlmSpan, Span } from './schema'\nimport type { TraceStore } from './store'\n\n/**\n * Create a RunCompleteHook that exports all spans from the completed run\n * to the OTEL exporter, then flushes.\n */\nexport function otelRunCompleteHook(exporter: OtelExporter): RunCompleteHook {\n  return async (ctx) => {\n    const spans = await ctx.store.spans({ runId: ctx.runId })\n    for (const span of spans) {\n      if (span.endedAt) {\n        exporter.exportSpan(storeSpanToExportable(span, ctx.runId))\n      }\n    }\n    await exporter.flush()\n  }\n}\n\n/**\n * Create an auto-exporting TraceStore wrapper that intercepts updateSpan\n * calls. When a span gets an endedAt, it's exported immediately. This\n * gives real-time streaming instead of batch-at-end.\n *\n * This is the preferred integration path: wrap the store before\n * constructing the TraceEmitter.\n */\nexport function createOtelTracingStore(\n  inner: TraceStore,\n  exporter: OtelExporter,\n  traceId: string,\n): TraceStore {\n  return {\n    async appendRun(run) {\n      return inner.appendRun(run)\n    },\n    async updateRun(runId, patch) {\n      return inner.updateRun(runId, patch)\n    },\n    async appendSpan(span) {\n      if (span.endedAt) {\n        exporter.exportSpan(storeSpanToExportable(span, traceId))\n      }\n      return inner.appendSpan(span)\n    },\n    async updateSpan(spanId, patch) {\n      await inner.updateSpan(spanId, patch)\n      if (patch.endedAt) {\n        const spans = await inner.spans({ runId: traceId })\n        const found = spans.find((s) => s.spanId === spanId)\n        if (found) {\n          exporter.exportSpan(storeSpanToExportable(found, traceId))\n        }\n      }\n    },\n    async appendEvent(event) {\n      return inner.appendEvent(event)\n    },\n    async appendBudgetEntry(entry) {\n      return inner.appendBudgetEntry(entry)\n    },\n    async appendArtifact(artifact) {\n      return inner.appendArtifact(artifact)\n    },\n    getRun: inner.getRun.bind(inner),\n    listRuns: inner.listRuns.bind(inner),\n    spans: inner.spans.bind(inner),\n    events: inner.events.bind(inner),\n    budget: inner.budget.bind(inner),\n    artifacts: inner.artifacts.bind(inner),\n  }\n}\n\nfunction storeSpanToExportable(span: Span, traceId: string): ExportableSpan {\n  const llm = span.kind === 'llm' ? (span as LlmSpan) : undefined\n  return {\n    traceId,\n    spanId: span.spanId,\n    parentSpanId: span.parentSpanId,\n    name: span.name,\n    kind: span.kind,\n    startedAt: span.startedAt,\n    endedAt: span.endedAt,\n    status: span.status,\n    error: span.error,\n    model: llm?.model,\n    inputTokens: llm?.inputTokens,\n    outputTokens: llm?.outputTokens,\n    costUsd: llm?.costUsd,\n    attributes: span.attributes as Record<string, unknown> | undefined,\n  }\n}\n","/**\n * OTEL span exporter — streams spans to an OTLP/HTTP collector.\n *\n * Reads OTEL_EXPORTER_OTLP_ENDPOINT + OTEL_EXPORTER_OTLP_HEADERS from env\n * when no explicit config is given. Batches spans and flushes periodically\n * or when the batch fills. No @opentelemetry SDK dependency — minimal\n * OTLP/JSON serializer (~120 LOC) using the existing otel.ts helpers.\n */\n\nimport { OTEL_AGENT_EVAL_SCOPE, type OtlpExport, type OtlpSpan } from './otel'\n\nexport interface OtelExportConfig {\n  /** OTLP endpoint. Reads OTEL_EXPORTER_OTLP_ENDPOINT env by default. */\n  endpoint?: string\n  /** OTLP headers. Reads OTEL_EXPORTER_OTLP_HEADERS env by default. */\n  headers?: Record<string, string>\n  /** Batch size before flush. Default 64. */\n  batchSize?: number\n  /** Flush interval ms. Default 5000. */\n  flushIntervalMs?: number\n  /** Resource attributes stamped on every export. */\n  resourceAttributes?: Record<string, string | number | boolean>\n  /** Service name. Default 'agent-eval'. */\n  serviceName?: string\n}\n\nexport interface OtelExporter {\n  /** Called by the TraceEmitter on every span close. */\n  exportSpan(span: ExportableSpan): void\n  /** Force flush pending spans. */\n  flush(): Promise<void>\n  /** Shutdown cleanly — flushes remaining spans and stops the timer. */\n  shutdown(): Promise<void>\n}\n\nexport interface ExportableSpan {\n  traceId: string\n  spanId: string\n  parentSpanId?: string\n  name: string\n  kind: string\n  startedAt: number\n  endedAt?: number\n  status?: string\n  error?: string\n  model?: string\n  inputTokens?: number\n  outputTokens?: number\n  costUsd?: number\n  attributes?: Record<string, unknown>\n}\n\n/**\n * Create an OTEL exporter. Returns undefined when no endpoint is configured\n * (neither via config nor env) — callers should check before attaching.\n */\nexport function createOtelExporter(config?: OtelExportConfig): OtelExporter | undefined {\n  const resolvedEndpoint =\n    config?.endpoint ??\n    (typeof process !== 'undefined' ? process.env.OTEL_EXPORTER_OTLP_ENDPOINT : undefined)\n  if (!resolvedEndpoint) return undefined\n  const endpoint: string = resolvedEndpoint\n\n  const headers = config?.headers ?? parseHeadersFromEnv()\n  const batchSize = config?.batchSize ?? 64\n  const flushIntervalMs = config?.flushIntervalMs ?? 5000\n  const serviceName = config?.serviceName ?? 'agent-eval'\n  const resourceAttrs = config?.resourceAttributes ?? {}\n\n  const pending: OtlpSpan[] = []\n  let timer: ReturnType<typeof setInterval> | undefined\n  let stopped = false\n\n  const exporter: OtelExporter = {\n    exportSpan(span: ExportableSpan): void {\n      if (stopped) return\n      pending.push(toOtlpSpan(span))\n      if (pending.length >= batchSize) {\n        void doFlush()\n      }\n    },\n\n    async flush(): Promise<void> {\n      await doFlush()\n    },\n\n    async shutdown(): Promise<void> {\n      stopped = true\n      if (timer !== undefined) {\n        clearInterval(timer)\n        timer = undefined\n      }\n      await doFlush()\n    },\n  }\n\n  timer = setInterval(() => {\n    if (pending.length > 0) void doFlush()\n  }, flushIntervalMs)\n  // Unref so the timer doesn't keep the process alive.\n  if (typeof timer === 'object' && 'unref' in timer) {\n    ;(timer as NodeJS.Timeout).unref()\n  }\n\n  async function doFlush(): Promise<void> {\n    if (pending.length === 0) return\n    const batch = pending.splice(0)\n    const body: OtlpExport = {\n      resourceSpans: [\n        {\n          resource: {\n            attributes: toAttributes({\n              'service.name': serviceName,\n              ...resourceAttrs,\n            }),\n          },\n          scopeSpans: [{ scope: OTEL_AGENT_EVAL_SCOPE, spans: batch }],\n        },\n      ],\n    }\n    const url = `${endpoint.replace(/\\/+$/, '')}/v1/traces`\n    try {\n      await fetch(url, {\n        method: 'POST',\n        headers: {\n          'content-type': 'application/json',\n          ...headers,\n        },\n        body: JSON.stringify(body),\n      })\n    } catch {\n      // Best-effort — telemetry export must not crash the pipeline.\n    }\n  }\n\n  return exporter\n}\n\nfunction parseHeadersFromEnv(): Record<string, string> {\n  if (typeof process === 'undefined') return {}\n  const raw = process.env.OTEL_EXPORTER_OTLP_HEADERS\n  if (!raw) return {}\n  const out: Record<string, string> = {}\n  for (const pair of raw.split(',')) {\n    const eq = pair.indexOf('=')\n    if (eq < 0) continue\n    const key = pair.slice(0, eq).trim()\n    const value = pair.slice(eq + 1).trim()\n    if (key) out[key] = value\n  }\n  return out\n}\n\nfunction toOtlpSpan(span: ExportableSpan): OtlpSpan {\n  const endedAt = span.endedAt ?? span.startedAt\n  const attrs: Record<string, string | number | boolean> = {\n    'span.kind': span.kind,\n  }\n  if (span.model) attrs['llm.model'] = span.model\n  if (span.inputTokens !== undefined) attrs['llm.input_tokens'] = span.inputTokens\n  if (span.outputTokens !== undefined) attrs['llm.output_tokens'] = span.outputTokens\n  if (span.costUsd !== undefined) attrs['llm.cost_usd'] = span.costUsd\n  if (span.attributes) {\n    for (const [k, v] of Object.entries(span.attributes)) {\n      if (typeof v === 'string' || typeof v === 'number' || typeof v === 'boolean') attrs[k] = v\n    }\n  }\n  return {\n    traceId: padTraceId(span.traceId),\n    spanId: padSpanId(span.spanId),\n    parentSpanId: span.parentSpanId ? padSpanId(span.parentSpanId) : undefined,\n    name: span.name,\n    kind: 1, // SPAN_KIND_INTERNAL\n    startTimeUnixNano: msToNs(span.startedAt),\n    endTimeUnixNano: msToNs(endedAt),\n    attributes: toAttributes(attrs),\n    status: span.status === 'error' ? { code: 2, message: span.error } : { code: 1 },\n  }\n}\n\nfunction toAttributes(record: Record<string, string | number | boolean>): OtlpSpan['attributes'] {\n  return Object.entries(record).map(([key, value]) => ({\n    key,\n    value:\n      typeof value === 'number'\n        ? Number.isInteger(value)\n          ? { intValue: value.toString() }\n          : { doubleValue: value }\n        : typeof value === 'boolean'\n          ? { boolValue: value }\n          : { stringValue: value },\n  }))\n}\n\nfunction msToNs(ms: number): string {\n  return (BigInt(Math.floor(ms)) * 1_000_000n).toString()\n}\n\nfunction padSpanId(id: string): string {\n  const cleaned = id.replace(/-/g, '')\n  return cleaned.slice(0, 16).padEnd(16, '0')\n}\n\nfunction padTraceId(id: string): string {\n  const cleaned = id.replace(/-/g, '')\n  return cleaned.slice(0, 32).padEnd(32, '0')\n}\n","/**\n * Convert agent-eval's internal trace shape (`FileSystemTraceStore` → `Run`,\n * `Span`, `TraceEvent`) into the OTLP-flat JSONL the trace analyst\n * (`analyzeTraces` + `OtlpFileTraceStore`) reads.\n *\n * Eval harnesses shard a `FileSystemTraceStore` per cell (persona / variant)\n * under a run directory. The analyst consumes a single OTLP-NDJSON file keyed\n * on `trace_id` + `span_id` with `start_time`/`end_time` in ISO-8601 and\n * resource + `attributes` rolled up per-span. This module walks every shard,\n * projects each `Span` (plus events pinned to it) into the flat OTLP shape,\n * and emits one NDJSON file.\n *\n * Generic OTLP/OpenInference fields are always emitted (`service.name`,\n * `agent.name`, `run.id`/`run.status`, `openinference.span.kind`,\n * `llm.model_name`, …). Domain attributes (`legal.*`, `tax.*`, …) are injected\n * per-run via {@link TraceStoreToOtlpOptions.resourceAttributes} /\n * {@link TraceStoreToOtlpOptions.runAttributes} so consumers don't re-roll the\n * walker.\n */\n\nimport { readdirSync, readFileSync, statSync, writeFileSync } from 'node:fs'\nimport { join } from 'node:path'\nimport type { Run, Span, TraceEvent } from './schema'\n\n/** Marker `FileSystemTraceStore` stamps on partial-update NDJSON rows. */\ninterface MaybeUpdate {\n  _update?: boolean\n}\n\ninterface OtlpFlatSpan {\n  trace_id: string\n  span_id: string\n  parent_span_id: string\n  name: string\n  kind: string\n  start_time: string\n  end_time: string\n  status: { code: 'STATUS_CODE_OK' | 'STATUS_CODE_ERROR'; message: string }\n  resource: { attributes: Record<string, unknown> }\n  attributes: Record<string, unknown>\n}\n\nexport interface TracesToOtlpResult {\n  /** Total spans emitted across every cell. */\n  spanCount: number\n  /** Total run-anchor spans (one per Run) appended for analyst visibility. */\n  runCount: number\n  /** Cells whose shards parsed cleanly. */\n  cellCount: number\n  /** Cells that errored mid-conversion — surfaced so a partial conversion\n   *  isn't silently masked. */\n  cellErrorCount: number\n}\n\n/**\n * A trace source the analyst should ingest. Two layouts are supported:\n *\n *   - `celled` (default): the root holds one cell subdirectory per\n *     persona/variant, each a `FileSystemTraceStore` (`runs.ndjson`,\n *     `spans.ndjson`, `events.ndjson`).\n *   - `flat`: the root is itself a single `FileSystemTraceStore` (e.g. a\n *     production-ingestion sidecar that appends one ndjson set directly under\n *     the chosen directory).\n */\nexport interface TraceStoreSource {\n  /** Absolute path to the trace store root. */\n  root: string\n  /** Layout — `celled` (default) or `flat`. */\n  layout?: 'celled' | 'flat'\n  /** OTLP `service.name` for this source. Overrides the options default. */\n  serviceName?: string\n}\n\n/** Domain hooks. The walker is generic; consumers inject the namespaced\n *  attributes that ride along on every run + span for analyst discovery. */\nexport interface TraceStoreToOtlpOptions {\n  /** Default OTLP `service.name` when a source doesn't set its own.\n   *  Default `agent-eval`. */\n  serviceName?: string\n  /** Extra resource attributes per run, e.g.\n   *  `(run) => ({ 'legal.persona_id': run.tags?.personaId ?? '' })`. */\n  resourceAttributes?: (run: Run) => Record<string, unknown>\n  /** Extra attributes on the per-run anchor span, e.g. domain outcome fields. */\n  runAttributes?: (run: Run) => Record<string, unknown>\n}\n\n/**\n * Read every per-cell shard under each source root and write a flat OTLP-JSONL\n * view of the corpus to `outPath`. Each cell directory is a\n * `FileSystemTraceStore` — NDJSON append-only with size-based rotation;\n * `updateRun`/`updateSpan` append `{ id, ...patch, _update: true }` rows\n * rather than rewriting, so readers must merge those patches in (done here).\n *\n * A `string` source is treated as a celled root.\n */\nexport function convertTraceStoresToOtlp(\n  source: string | TraceStoreSource | readonly TraceStoreSource[],\n  outPath: string,\n  opts: TraceStoreToOtlpOptions = {},\n): TracesToOtlpResult {\n  const sources: TraceStoreSource[] = Array.isArray(source)\n    ? [...source]\n    : typeof source === 'string'\n      ? [{ root: source, layout: 'celled' }]\n      : [source as TraceStoreSource]\n\n  const defaultServiceName = opts.serviceName ?? 'agent-eval'\n  const resourceAttributes = opts.resourceAttributes ?? (() => ({}))\n  const runAttributes = opts.runAttributes ?? (() => ({}))\n\n  const lines: string[] = []\n  let spanCount = 0\n  let runCount = 0\n  let cellCount = 0\n  let cellErrorCount = 0\n\n  for (const src of sources) {\n    const serviceName = src.serviceName ?? defaultServiceName\n    const cellDirs: Array<{ label: string; dir: string }> =\n      src.layout === 'flat'\n        ? [{ label: '<root>', dir: src.root }]\n        : listCells(src.root).map((name) => ({ label: name, dir: join(src.root, name) }))\n\n    for (const cell of cellDirs) {\n      try {\n        const result = projectCell({\n          cellDir: cell.dir,\n          serviceName,\n          resourceAttributes,\n          runAttributes,\n        })\n        for (const line of result.lines) lines.push(line)\n        spanCount += result.spanCount\n        runCount += result.runCount\n        cellCount += 1\n      } catch (err) {\n        console.warn(\n          `[traces-to-otlp] cell ${cell.label} (${cell.dir}) skipped: ${err instanceof Error ? err.message : String(err)}`,\n        )\n        cellErrorCount += 1\n      }\n    }\n  }\n\n  writeFileSync(outPath, lines.join('\\n') + (lines.length > 0 ? '\\n' : ''))\n  return { spanCount, runCount, cellCount, cellErrorCount }\n}\n\ninterface ProjectCellResult {\n  lines: string[]\n  runCount: number\n  spanCount: number\n}\n\nfunction projectCell(args: {\n  cellDir: string\n  serviceName: string\n  resourceAttributes: (run: Run) => Record<string, unknown>\n  runAttributes: (run: Run) => Record<string, unknown>\n}): ProjectCellResult {\n  const { cellDir, serviceName, resourceAttributes, runAttributes } = args\n  const lines: string[] = []\n  let runCount = 0\n  let spanCount = 0\n\n  const runs = readMergedShards<Run & MaybeUpdate>(cellDir, 'runs', 'runId')\n  const spans = readMergedShards<Span & MaybeUpdate>(cellDir, 'spans', 'spanId')\n  const events = readShards<TraceEvent>(cellDir, 'events')\n\n  const runByRunId = new Map<string, Run>()\n  for (const r of runs) runByRunId.set(r.runId, r)\n  const spanBySpanId = new Map<string, Span>()\n  for (const s of spans) spanBySpanId.set(s.spanId, s)\n  const eventsBySpanId = new Map<string, TraceEvent[]>()\n\n  // An HTTP-backed trace store can only POST `TraceEvent`s through the wire;\n  // run/span lifecycle is projected into `state_mutation` events with\n  // `payload.entity ∈ { run, run.update, span, span.update }`. Fold those back\n  // so the analyst sees a complete Run + Span tree.\n  for (const e of events) {\n    if (e.kind === 'state_mutation' && e.payload && typeof e.payload === 'object') {\n      const entity = (e.payload as Record<string, unknown>).entity\n      if (entity === 'run') {\n        const run = (e.payload as { run?: Run }).run\n        if (run?.runId) runByRunId.set(run.runId, run)\n        continue\n      }\n      if (entity === 'run.update') {\n        const patch = (e.payload as { patch?: Partial<Run> }).patch\n        if (patch && e.runId) {\n          const prior = runByRunId.get(e.runId)\n          if (prior) runByRunId.set(e.runId, { ...prior, ...patch })\n        }\n        continue\n      }\n      if (entity === 'span') {\n        const span = (e.payload as { span?: Span }).span\n        if (span?.spanId) spanBySpanId.set(span.spanId, span)\n        continue\n      }\n      if (entity === 'span.update') {\n        const spanId = (e.payload as { spanId?: string }).spanId\n        const patch = (e.payload as { patch?: Partial<Span> }).patch\n        if (spanId && patch) {\n          const prior = spanBySpanId.get(spanId)\n          if (prior) spanBySpanId.set(spanId, { ...prior, ...patch } as Span)\n        }\n        continue\n      }\n    }\n    if (!e.spanId) continue\n    const arr = eventsBySpanId.get(e.spanId) ?? []\n    arr.push(e)\n    eventsBySpanId.set(e.spanId, arr)\n  }\n\n  for (const run of runByRunId.values()) {\n    const traceId = padTraceId(run.runId)\n    const agentName = run.variantId ?? run.scenarioId\n    const sharedResource = {\n      attributes: {\n        'service.name': serviceName,\n        'agent.name': agentName,\n        'run.id': run.runId,\n        'run.status': run.status,\n        ...resourceAttributes(run),\n      },\n    }\n\n    const runSpanId = padSpanId(`run-${run.runId}`)\n    const runStart = msToIso(run.startedAt)\n    const runEnd = msToIso(run.endedAt ?? run.startedAt)\n    const runStatus =\n      run.outcome?.failureClass && run.outcome.failureClass !== 'success'\n        ? 'STATUS_CODE_ERROR'\n        : 'STATUS_CODE_OK'\n    const runAttrs: Record<string, unknown> = {\n      'openinference.span.kind': 'AGENT',\n      'agent.name': agentName,\n      'agent.workflow.name': serviceName,\n      ...runAttributes(run),\n    }\n    lines.push(\n      JSON.stringify(\n        toLine({\n          traceId,\n          spanId: runSpanId,\n          parentSpanId: '',\n          name: `run.${agentName}`,\n          kind: 'SPAN_KIND_INTERNAL',\n          startTime: runStart,\n          endTime: runEnd,\n          statusCode: runStatus,\n          statusMessage: run.outcome?.notes ?? '',\n          resource: sharedResource,\n          attributes: runAttrs,\n        }),\n      ),\n    )\n    runCount += 1\n\n    for (const span of spanBySpanId.values()) {\n      if (span.runId !== run.runId) continue\n      const spanAttrs = spanToAttributes(span, eventsBySpanId.get(span.spanId) ?? [])\n      const statusCode = span.status === 'error' ? 'STATUS_CODE_ERROR' : 'STATUS_CODE_OK'\n      lines.push(\n        JSON.stringify(\n          toLine({\n            traceId,\n            spanId: padSpanId(span.spanId),\n            parentSpanId: span.parentSpanId ? padSpanId(span.parentSpanId) : runSpanId,\n            name: span.name,\n            kind: spanKindToOtlpKind(span.kind),\n            startTime: msToIso(span.startedAt),\n            endTime: msToIso(span.endedAt ?? span.startedAt),\n            statusCode,\n            statusMessage: span.error ?? '',\n            resource: sharedResource,\n            attributes: spanAttrs,\n          }),\n        ),\n      )\n      spanCount += 1\n    }\n  }\n\n  return { lines, runCount, spanCount }\n}\n\nfunction listCells(root: string): string[] {\n  try {\n    return readdirSync(root, { withFileTypes: true })\n      .filter((d) => d.isDirectory())\n      .map((d) => d.name)\n      .sort()\n  } catch {\n    return []\n  }\n}\n\n/**\n * Read every NDJSON shard for `name` under `cellDir`, ordered by mtime so\n * rotated files apply before the active one. Yields raw rows including any\n * `_update: true` patches.\n */\nfunction readShards<T>(cellDir: string, name: string): T[] {\n  let entries: string[]\n  try {\n    entries = readdirSync(cellDir)\n  } catch {\n    return []\n  }\n  const shards = entries\n    .filter((f) => (f === `${name}.ndjson` || f.startsWith(`${name}.`)) && f.endsWith('.ndjson'))\n    .map((f) => ({ file: f, path: join(cellDir, f) }))\n    .map((s) => {\n      let mtime = 0\n      try {\n        mtime = statSync(s.path).mtimeMs\n      } catch {\n        /* skip stat errors */\n      }\n      return { ...s, mtime }\n    })\n    .sort((a, b) => a.mtime - b.mtime || a.file.localeCompare(b.file))\n\n  const rows: T[] = []\n  for (const shard of shards) {\n    let text: string\n    try {\n      text = readFileSync(shard.path, 'utf-8')\n    } catch {\n      continue\n    }\n    for (const line of text.split('\\n')) {\n      const trimmed = line.trim()\n      if (!trimmed) continue\n      try {\n        rows.push(JSON.parse(trimmed) as T)\n      } catch {\n        /* skip partial line */\n      }\n    }\n  }\n  return rows\n}\n\n/**\n * Read NDJSON shards and merge `{ ...patch, _update: true }` rows into the\n * prior record keyed on `idKey` — mirrors the in-memory merge\n * `FileSystemTraceStore` keeps but doesn't replay on cross-process load.\n */\nfunction readMergedShards<T extends { _update?: boolean }>(\n  cellDir: string,\n  name: string,\n  idKey: keyof T,\n): T[] {\n  const rows = readShards<T>(cellDir, name)\n  const byId = new Map<string, T>()\n  for (const row of rows) {\n    const id = row[idKey] as unknown as string\n    if (!id) continue\n    const prior = byId.get(id)\n    if (prior && row._update) {\n      byId.set(id, { ...prior, ...row, _update: undefined } as T)\n    } else {\n      byId.set(id, row)\n    }\n  }\n  return [...byId.values()]\n}\n\nfunction spanToAttributes(span: Span, events: TraceEvent[]): Record<string, unknown> {\n  const attrs: Record<string, unknown> = {\n    'openinference.span.kind': spanKindToOpenInferenceKind(span.kind),\n  }\n  if (span.kind === 'llm') {\n    attrs['llm.model_name'] = span.model\n    if (span.inputTokens !== undefined) attrs['llm.token_count.prompt'] = span.inputTokens\n    if (span.outputTokens !== undefined) attrs['llm.token_count.completion'] = span.outputTokens\n    if (span.costUsd !== undefined) attrs['llm.cost_usd'] = span.costUsd\n    if (span.finishReason) attrs['llm.finish_reason'] = span.finishReason\n    if (Array.isArray(span.messages)) {\n      attrs['llm.input_messages'] = JSON.stringify(span.messages.slice(-6))\n    }\n    if (typeof span.output === 'string') {\n      attrs['llm.output_messages'] = JSON.stringify([{ role: 'assistant', content: span.output }])\n    }\n  } else if (span.kind === 'tool') {\n    attrs['tool.name'] = span.toolName\n    if (span.latencyMs !== undefined) attrs['tool.latency_ms'] = span.latencyMs\n    attrs['input.value'] = safeStringify(span.args)\n    if (span.result !== undefined) attrs['output.value'] = safeStringify(span.result)\n  } else if (span.kind === 'judge') {\n    attrs['judge.id'] = span.judgeId\n    attrs['judge.dimension'] = span.dimension\n    attrs['judge.score'] = span.score\n    attrs['judge.target_span_id'] = span.targetSpanId\n  }\n  if (span.attributes) {\n    for (const [k, v] of Object.entries(span.attributes)) {\n      attrs[`agent_eval.${k}`] = v\n    }\n  }\n  if (events.length > 0) {\n    attrs['agent_eval.event_count'] = events.length\n    attrs['agent_eval.event_kinds'] = JSON.stringify(events.map((e) => e.kind))\n  }\n  return attrs\n}\n\nfunction spanKindToOtlpKind(kind: Span['kind']): string {\n  switch (kind) {\n    case 'llm':\n      return 'SPAN_KIND_CLIENT'\n    case 'retrieval':\n      return 'SPAN_KIND_CLIENT'\n    default:\n      return 'SPAN_KIND_INTERNAL'\n  }\n}\n\nfunction spanKindToOpenInferenceKind(kind: Span['kind']): string {\n  switch (kind) {\n    case 'llm':\n      return 'LLM'\n    case 'tool':\n      return 'TOOL'\n    case 'retrieval':\n      return 'CHAIN'\n    case 'judge':\n      return 'GUARDRAIL'\n    case 'sandbox':\n      return 'CHAIN'\n    case 'agent':\n      return 'AGENT'\n    default:\n      return 'SPAN'\n  }\n}\n\ninterface ToLineArgs {\n  traceId: string\n  spanId: string\n  parentSpanId: string\n  name: string\n  kind: string\n  startTime: string\n  endTime: string\n  statusCode: 'STATUS_CODE_OK' | 'STATUS_CODE_ERROR'\n  statusMessage: string\n  resource: { attributes: Record<string, unknown> }\n  attributes: Record<string, unknown>\n}\n\nfunction toLine(args: ToLineArgs): OtlpFlatSpan {\n  return {\n    trace_id: args.traceId,\n    span_id: args.spanId,\n    parent_span_id: args.parentSpanId,\n    name: args.name,\n    kind: args.kind,\n    start_time: args.startTime,\n    end_time: args.endTime,\n    status: { code: args.statusCode, message: args.statusMessage },\n    resource: args.resource,\n    attributes: args.attributes,\n  }\n}\n\nfunction msToIso(ms: number): string {\n  if (!Number.isFinite(ms) || ms <= 0) return new Date(0).toISOString()\n  return new Date(ms).toISOString()\n}\n\n/** OTLP wants 16-hex span ids; eval traces use UUID-ish strings. Hex-strip +\n *  take 16, else deterministic FNV fold. */\nfunction padSpanId(id: string): string {\n  const cleaned = id.replace(/[^a-f0-9]/gi, '').toLowerCase()\n  if (cleaned.length >= 16) return cleaned.slice(0, 16)\n  return foldTo16Hex(id)\n}\n\n/** OTLP wants 32-hex trace ids; fold deterministically when too short. */\nfunction padTraceId(id: string): string {\n  const cleaned = id.replace(/[^a-f0-9]/gi, '').toLowerCase()\n  if (cleaned.length >= 32) return cleaned.slice(0, 32)\n  return foldTo32Hex(id)\n}\n\nfunction foldTo16Hex(s: string): string {\n  let h1 = 0x811c9dc5\n  for (const ch of s) {\n    h1 ^= ch.charCodeAt(0)\n    h1 = Math.imul(h1, 0x01000193) >>> 0\n  }\n  const part = h1.toString(16).padStart(8, '0')\n  return (part + part).slice(0, 16)\n}\n\nfunction foldTo32Hex(s: string): string {\n  return foldTo16Hex(s) + foldTo16Hex(`${s}::trace`).slice(0, 16)\n}\n\nfunction safeStringify(value: unknown): string {\n  try {\n    return typeof value === 'string' ? value : JSON.stringify(value)\n  } catch {\n    return String(value)\n  }\n}\n","/**\n * Replay-from-raw-events — turn every captured campaign run into a\n * re-runnable artifact.\n *\n * `RawProviderSink` captures every provider HTTP envelope; `runEvalCampaign`\n * makes that capture the default. Together they make every past run a\n * complete fingerprint of what happened on the wire — enough to replay\n * the run without burning new LLM cost.\n *\n * Three use cases this primitive enables:\n *\n *   1. **Post-hoc judging** — apply a new judge / rubric / scoring callback\n *      to last week's runs without re-calling any LLM. The cost of trying\n *      a new rubric drops from \"another full sweep\" to a CPU-bound replay.\n *   2. **Determinism audits** — replay the same campaign and verify the\n *      raw responses match byte-for-byte. Any drift is a non-determinism\n *      bug (in the harness, the prompt builder, the sandbox, …).\n *   3. **Free judge calibration** — run two judges on identical responses\n *      and measure inter-judge agreement without doubling LLM spend.\n *\n * The interface is deliberately fetch-shaped. Inject `createReplayFetch`\n * into `LlmClientOptions.fetch` and every `callLlm` transparently reads\n * from the cache instead of calling the network. No new code path through\n * the LLM client is needed; the cache hit is invisible to the runner.\n */\n\nimport { ReplayError } from './errors'\nimport { canonicalize, hashJson } from './pre-registration'\nimport type { RawProviderEvent, RawProviderSink } from './trace/raw-provider-sink'\n\nexport class ReplayCacheMissError extends ReplayError {\n  constructor(\n    public readonly url: string,\n    public readonly requestKey: string,\n    message?: string,\n  ) {\n    super(message ?? `replay cache miss for ${url} (key=${requestKey})`)\n  }\n}\n\nexport interface ReplayCacheEntry {\n  request: RawProviderEvent\n  response: RawProviderEvent\n}\n\nexport interface ReplayCacheStats {\n  total: number\n  byProvider: Record<string, number>\n  byModel: Record<string, number>\n  /** Spans for which we have a request but no response (run aborted mid-call). */\n  orphanRequests: number\n}\n\n/**\n * In-memory deterministic cache of (request → response) keyed on a stable\n * hash of the request body. Built from a `RawProviderSink` containing\n * paired `request` and `response` events from a previous run.\n *\n * The cache is the source of truth for replay; `createReplayFetch` is a\n * thin wrapper that reads from it.\n */\nexport class ReplayCache {\n  private byKey = new Map<string, ReplayCacheEntry>()\n  private orphans = 0\n  private byProvider: Record<string, number> = {}\n  private byModel: Record<string, number> = {}\n\n  /**\n   * Build a cache from a sink's events. The sink must implement `list()`.\n   * Filter by `runId` / `spanId` to scope to a specific replay.\n   */\n  static async fromSink(\n    sink: RawProviderSink,\n    filter: { runId?: string; spanId?: string } = {},\n  ): Promise<ReplayCache> {\n    if (!sink.list) {\n      throw new ReplayError('ReplayCache.fromSink: sink must implement list() to be replayable.')\n    }\n    const events = await sink.list(filter)\n    return ReplayCache.fromEvents(events)\n  }\n\n  /** Build a cache from an in-memory event list. */\n  static async fromEvents(events: RawProviderEvent[]): Promise<ReplayCache> {\n    const cache = new ReplayCache()\n    // Group by (runId, spanId, attemptIndex) so request/response/error pairs are matched.\n    // A cell can have many spans; each retry attempt within a span is a separate group.\n    type GroupKey = string\n    const groups = new Map<GroupKey, { req?: RawProviderEvent; res?: RawProviderEvent }>()\n    for (const e of events) {\n      const k = `${e.runId ?? ''}::${e.spanId ?? ''}::${e.attemptIndex}`\n      const g = groups.get(k) ?? {}\n      if (e.direction === 'request') g.req = e\n      else g.res = e\n      groups.set(k, g)\n    }\n    for (const g of groups.values()) {\n      if (!g.req) continue\n      if (!g.res) {\n        cache.orphans += 1\n        continue\n      }\n      const key = await requestKey(g.req)\n      cache.byKey.set(key, { request: g.req, response: g.res })\n      cache.byProvider[g.req.provider] = (cache.byProvider[g.req.provider] ?? 0) + 1\n      cache.byModel[g.req.model] = (cache.byModel[g.req.model] ?? 0) + 1\n    }\n    return cache\n  }\n\n  /** Number of cacheable (request, response) pairs in the cache. */\n  size(): number {\n    return this.byKey.size\n  }\n\n  stats(): ReplayCacheStats {\n    return {\n      total: this.byKey.size,\n      byProvider: { ...this.byProvider },\n      byModel: { ...this.byModel },\n      orphanRequests: this.orphans,\n    }\n  }\n\n  /** Iterate every cached `(request, response)` pair in insertion order. */\n  *entries(): IterableIterator<ReplayCacheEntry> {\n    for (const entry of this.byKey.values()) yield entry\n  }\n\n  /**\n   * Look up a cached response by hashing the (model, messages, temperature,\n   * maxTokens, response_format) shape. Returns `undefined` on miss; the\n   * caller decides whether to throw, fall back to the network, or skip.\n   */\n  async lookup(requestBody: unknown): Promise<ReplayCacheEntry | undefined> {\n    const key = await keyFromBody(requestBody)\n    return this.byKey.get(key)\n  }\n}\n\nexport interface ReplayFetchOptions {\n  /**\n   * Behaviour on cache miss. Default `'throw'`. `'fallback'` calls the\n   * `fallbackFetch` (typically `globalThis.fetch`) so a partial replay can\n   * still complete; `'fail-closed'` returns a synthetic 599 response so the\n   * call site sees a non-retriable failure.\n   */\n  onMiss?: 'throw' | 'fallback' | 'fail-closed'\n  fallbackFetch?: typeof fetch\n  /** Optional callback fired once per replayed call (for telemetry / counters). */\n  onHit?: (info: { url: string; provider: string; model: string }) => void\n  /** Optional callback fired on cache miss before the `onMiss` policy applies. */\n  onMissNotify?: (info: { url: string; requestBody: unknown }) => void\n}\n\n/**\n * Build a `fetch`-shaped function that serves cached responses out of a\n * `ReplayCache` for any URL ending in `/chat/completions`. Pass through\n * `LlmClientOptions.fetch` and `callLlm` becomes free.\n *\n * Non-`/chat/completions` URLs are passed straight to the fallback fetch\n * (default: `globalThis.fetch`). This matters because non-LLM HTTP work\n * (judge HTTP servers, sandbox callbacks) sometimes flows through the same\n * `fetch` and shouldn't be intercepted.\n */\nexport function createReplayFetch(cache: ReplayCache, opts: ReplayFetchOptions = {}): typeof fetch {\n  const onMiss = opts.onMiss ?? 'throw'\n  const fallback = opts.fallbackFetch ?? globalThis.fetch?.bind(globalThis)\n\n  return (async (input: RequestInfo | URL, init?: RequestInit) => {\n    const url =\n      typeof input === 'string' ? input : input instanceof URL ? input.toString() : input.url\n    if (!/\\/chat\\/completions(?:[?#].*)?$/.test(url)) {\n      if (!fallback)\n        throw new ReplayError(\n          `replay fetch: non-completions URL ${url} but no fallbackFetch configured`,\n        )\n      return fallback(input as RequestInfo, init)\n    }\n    let bodyParsed: unknown\n    if (init?.body && typeof init.body === 'string') {\n      try {\n        bodyParsed = JSON.parse(init.body)\n      } catch {\n        /* raw body, not JSON */\n      }\n    }\n    const hit = bodyParsed === undefined ? undefined : await cache.lookup(bodyParsed)\n    if (hit) {\n      opts.onHit?.({ url, provider: hit.request.provider, model: hit.request.model })\n      const status = hit.response.statusCode ?? 200\n      const headers = new Headers(\n        Object.entries(hit.response.responseHeaders ?? { 'Content-Type': 'application/json' }),\n      )\n      const bodyText =\n        typeof hit.response.responseBody === 'string'\n          ? hit.response.responseBody\n          : JSON.stringify(hit.response.responseBody ?? {})\n      return new Response(bodyText, { status, headers })\n    }\n    opts.onMissNotify?.({ url, requestBody: bodyParsed })\n    if (onMiss === 'throw') {\n      const key = bodyParsed === undefined ? '<unparseable>' : await keyFromBody(bodyParsed)\n      throw new ReplayCacheMissError(url, key)\n    }\n    if (onMiss === 'fail-closed') {\n      return new Response(JSON.stringify({ error: 'replay_cache_miss' }), { status: 599 })\n    }\n    if (!fallback)\n      throw new ReplayError('replay fetch: onMiss=fallback but no fallbackFetch configured')\n    return fallback(input as RequestInfo, init)\n  }) as typeof fetch\n}\n\n/**\n * Convenience iterator over `(request, response)` pairs in a sink — for\n * post-hoc scoring that doesn't need a `fetch` shim. The judge or scorer\n * runs purely in-process over cached LLM outputs.\n */\nexport async function* iterateRawCalls(\n  sink: RawProviderSink,\n  filter: { runId?: string; spanId?: string } = {},\n): AsyncGenerator<ReplayCacheEntry> {\n  if (!sink.list) {\n    throw new ReplayError('iterateRawCalls: sink must implement list().')\n  }\n  const events = await sink.list(filter)\n  const cache = await ReplayCache.fromEvents(events)\n  for (const entry of cache.entries()) yield entry\n}\n\n// ── Hashing ──────────────────────────────────────────────────────────────\n\n/**\n * Canonical request key.\n *\n * `model + messages + temperature + max_tokens|max_completion_tokens +\n * response_format` are the dimensions that affect the response shape.\n * Other fields (timestamp headers, provider-specific metadata) are\n * intentionally excluded so a request hashes the same across re-runs.\n */\nasync function requestKey(event: RawProviderEvent): Promise<string> {\n  return keyFromBody(event.requestBody)\n}\n\nasync function keyFromBody(body: unknown): Promise<string> {\n  if (body == null || typeof body !== 'object') return hashJson({ raw: String(body) })\n  const b = body as Record<string, unknown>\n  const reduced = canonicalize({\n    model: b.model ?? null,\n    messages: b.messages ?? null,\n    temperature: b.temperature ?? null,\n    max_tokens: b.max_tokens ?? null,\n    max_completion_tokens: b.max_completion_tokens ?? null,\n    response_format: b.response_format ?? null,\n  })\n  return hashJson(reduced)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAsDA,IAAM,mBACJ;AAEK,SAAS,0BAA0B,MAAgD;AACxF,SAAO,OAAO,QAAgC;AAC5C,QAAI,KAAK,aAAa,CAAC,KAAK,UAAU,GAAG,EAAG;AAC5C,UAAM,SAAS,KAAK,QAAQ;AAC5B,QAAI,WAAW,QAAW;AAGxB,YAAM,IAAI,MAAM,YAAY;AAAA,QAC1B,SAAS,gBAAgB,IAAI,KAAK;AAAA,QAClC,OAAO,IAAI;AAAA,QACX,MAAM;AAAA,QACN,WAAW,KAAK,IAAI;AAAA,QACpB,SAAS,EAAE,QAAQ,sBAAsB,QAAQ,uBAAuB;AAAA,MAC1E,CAAC;AACD;AAAA,IACF;AACA,UAAM,SAAS,MAAM,cAAc,EAAE,UAAU,KAAK,YAAY,iBAAiB,GAAG;AAAA,MAClF,GAAG,KAAK;AAAA,MACR;AAAA,IACF,CAAyB;AACzB,QAAI,KAAK,KAAM,OAAM,KAAK,KAAK,QAAQ,GAAG;AAC1C,QAAI,KAAK,UAAU,CAAC,KAAK,OAAO,QAAQ,GAAG,GAAG;AAC5C,YAAM,IAAI,MAAM,YAAY;AAAA,QAC1B,SAAS,gBAAgB,IAAI,KAAK;AAAA,QAClC,OAAO,IAAI;AAAA,QACX,MAAM;AAAA,QACN,WAAW,KAAK,IAAI;AAAA,QACpB,SAAS;AAAA,UACP,QAAQ;AAAA,UACR,QAAQ;AAAA,UACR,UAAU,OAAO;AAAA,QACnB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;;;ACtBA,IAAM,oBAAoB,oBAAI,IAAI;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAEM,SAAS,oBAAoB,OAAyB;AAC3D,SAAO,CAAC,GAAG,MAAM,SAAS,8BAA8B,CAAC,EACtD,IAAI,CAAC,UAAU,MAAM,CAAC,EAAE,YAAY,CAAC,EACrC,OAAO,CAAC,SAAS,CAAC,kBAAkB,IAAI,IAAI,CAAC;AAClD;AAEO,SAAS,oBAAoB,OAAoC;AACtE,QAAM,aAAa,IAAI,IAAI,oBAAoB,GAAG,MAAM,IAAI,IAAI,MAAM,gBAAgB,EAAE,EAAE,CAAC;AAC3F,QAAM,SAAS;AAAA,IACb,MAAM;AAAA,IACN,MAAM,gBAAgB;AAAA,IACtB,GAAG,MAAM,MAAM,QAAQ,CAAC,SAAS;AAAA,MAC/B,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,UAAU;AAAA,MACf,KAAK,cAAc;AAAA,MACnB,GAAI,KAAK,QAAQ,CAAC;AAAA,MAClB,GAAI,KAAK,QAAQ,CAAC;AAAA,IACpB,CAAC;AAAA,EACH,EAAE,KAAK,GAAG;AACV,QAAM,SAAS,oBAAI,IAAoB;AACvC,aAAW,QAAQ,oBAAoB,MAAM,EAAG,QAAO,IAAI,OAAO,OAAO,IAAI,IAAI,KAAK,KAAK,CAAC;AAC5F,SAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,EACxB,OAAO,CAAC,CAAC,MAAM,KAAK,MAAM,SAAS,KAAK,WAAW,IAAI,IAAI,CAAC,EAC5D,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EACtD,IAAI,CAAC,CAAC,IAAI,MAAM,IAAI,EACpB,MAAM,GAAG,EAAE;AAChB;AAEO,SAAS,sBAAsB,UAA4B;AAChE,QAAM,UAAU,SACb,OAAO,CAAC,YAAY,QAAQ,UAAU,CAAC,EACvC,IAAI,CAAC,YAAY,QAAQ,QAAQ,uBAAuB,MAAM,CAAC;AAClE,SAAO,QAAQ,SAAS,IACpB,IAAI,OAAO,sBAAsB,QAAQ,KAAK,GAAG,CAAC,oBAAoB,GAAG,IACzE;AACN;AAEO,SAAS,0BAA0B,OAAkC;AAC1E,QAAM,YACJ,MAAM,MAAM,WAAW,IACnB,0BACA,GAAG,MAAM,MAAM,MAAM;AAC3B,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,QAAQ,MAAM,OAAO;AAC9B,eAAW,OAAO,KAAK,QAAQ,CAAC,EAAG,MAAK,IAAI,MAAM,KAAK,IAAI,GAAG,KAAK,KAAK,CAAC;AAAA,EAC3E;AACA,QAAM,UAAU,CAAC,GAAG,KAAK,QAAQ,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EACtD,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,CAAC,GAAG,MAAM,GAAG;AACrB,MAAI,QAAQ,SAAS,EAAG,QAAO,GAAG,SAAS,WAAW,QAAQ,KAAK,IAAI,CAAC;AACxE,QAAM,eAAe;AAAA,IACnB,GAAG,IAAI;AAAA,MACL,MAAM,MAAM,IAAI,CAAC,SAAS,KAAK,UAAU,EAAE,OAAO,CAAC,UAA2B,QAAQ,KAAK,CAAC;AAAA,IAC9F;AAAA,EACF,EAAE,KAAK,IAAI;AACX,SAAO,GAAG,SAAS,WAAW,gBAAgB,8BAA8B;AAC9E;AAEO,SAAS,0BAA0B,OAAwD;AAChG,QAAM,cAAc,MAAM,MAAM,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,KAAK,YAAY,WAAW;AACjG,QAAM,mBAAmB,MAAM,MAAM,MAAM;AAAA,IAAK,CAAC,UAC9C,KAAK,QAAQ,CAAC,GAAG,KAAK,CAAC,QAAQ,8BAA8B,KAAK,GAAG,CAAC;AAAA,EACzE;AACA,QAAM,YAAoC;AAAA,IACxC;AAAA,MACE,IAAI;AAAA,MACJ,UAAU;AAAA,MACV,KAAK;AAAA,IACP;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,UACE;AAAA,MACF,KAAK;AAAA,IACP;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,UACE;AAAA,MACF,KAAK;AAAA,IACP;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,UACE;AAAA,MACF,KAAK;AAAA,IACP;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,UACE;AAAA,MACF,KAAK;AAAA,IACP;AAAA,EACF;AACA,MAAI,kBAAkB;AACpB,cAAU,KAAK;AAAA,MACb,IAAI;AAAA,MACJ,UAAU;AAAA,MACV,KAAK;AAAA,IACP,CAAC;AAAA,EACH;AACA,MAAI,aAAa;AACf,cAAU,KAAK;AAAA,MACb,IAAI;AAAA,MACJ,UACE;AAAA,MACF,KAAK;AAAA,IACP,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEO,SAAS,yBAAyB,OAAqD;AAC5F,SAAO;AAAA,IACL,OAAO,MAAM;AAAA,IACb,OAAO,0BAA0B,MAAM,KAAK;AAAA,IAC5C,UAAU,oBAAoB,MAAM,KAAK;AAAA,IACzC,WAAW,0BAA0B,KAAK;AAAA,IAC1C,OAAO,yBAAyB;AAAA,IAChC,UAAU,MAAM,YAAY,CAAC;AAAA,IAC7B,OAAO,MAAM,SAAS;AAAA,IACtB,QAAQ,MAAM,UAAU;AAAA,EAC1B;AACF;AAEO,SAAS,2BAA2B,SAAqD;AAC9F,QAAM,cAAc,QAAQ,MAAM,MAAM;AAAA,IACtC,CAAC,SAAS,KAAK,WAAW,KAAK,YAAY;AAAA,EAC7C;AACA,QAAM,iBAAiB,IAAI,IAAI,QAAQ,SAAS,QAAQ,CAAC,YAAY,QAAQ,OAAO,CAAC;AACrF,QAAM,0BAA0B,YAAY,OAAO,CAAC,SAAS,eAAe,IAAI,KAAK,EAAE,CAAC;AACxF,QAAM,gBAAgB,QAAQ,MAAM,MAAM,OAAO,CAAC,UAAU,KAAK,QAAQ,CAAC,GAAG,SAAS,CAAC;AACvF,QAAM,QAAmC;AAAA,IACvC;AAAA,MACE,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,QAAQ,QAAQ,SAAS,SAAS;AAAA,MAClC,UAAU;AAAA,MACV,QACE,QAAQ,SAAS,SAAS,IACtB,GAAG,QAAQ,SAAS,MAAM,2BAA2B,QAAQ,SAAS,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,KAC5F;AAAA,IACR;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,QAAQ,QAAQ,MAAM,UAAU,KAAK,QAAQ,UAAU,UAAU;AAAA,MACjE,UAAU;AAAA,MACV,QAAQ,GAAG,QAAQ,MAAM,MAAM,oBAAoB,QAAQ,UAAU,MAAM;AAAA,IAC7E;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,QACE,YAAY,WAAW,KAAK,wBAAwB,SAAS,YAAY,UAAU;AAAA,MACrF,UAAU;AAAA,MACV,QACE,YAAY,WAAW,IACnB,8BACA,GAAG,wBAAwB,MAAM,IAAI,YAAY,MAAM;AAAA,IAC/D;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,QAAQ,YAAY,WAAW,KAAK,cAAc,SAAS,YAAY,UAAU;AAAA,MACjF,UAAU;AAAA,MACV,QAAQ,GAAG,cAAc,MAAM;AAAA,IACjC;AAAA,EACF;AACA,QAAM,UAAU,MAAM,OAAO,CAAC,KAAK,SAAS;AAC1C,QAAI,KAAK,OAAQ,QAAO;AACxB,QAAI,KAAK,aAAa,WAAY,QAAO,MAAM;AAC/C,QAAI,KAAK,aAAa,OAAQ,QAAO,MAAM;AAC3C,QAAI,KAAK,aAAa,SAAU,QAAO,MAAM;AAC7C,WAAO,MAAM;AAAA,EACf,GAAG,CAAC;AACJ,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,IAAI,UAAU,GAAG,CAAC;AACxD,SAAO;AAAA,IACL;AAAA,IACA,OAAO,SAAS,MAAM,mBAAmB,SAAS,MAAM,oBAAoB;AAAA,IAC5E;AAAA,EACF;AACF;AAEO,SAAS,2BAAoD;AAClE,SAAO;AAAA,IACL;AAAA,MACE,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,gBACE;AAAA,IACJ;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,gBACE;AAAA,IACJ;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,gBACE;AAAA,IACJ;AAAA,IACA;AAAA,MACE,IAAI;AAAA,MACJ,MAAM;AAAA,MACN,gBACE;AAAA,IACJ;AAAA,EACF;AACF;AAEO,SAAS,wBAAwB,OAAwC;AAC9E,QAAM,UAAU,yBAAyB,KAAK;AAC9C,QAAM,0BAA0B,MAAM,2BAA2B;AACjE,SAAO;AAAA;AAAA;AAAA;AAAA,wCAI+B,MAAM,MAAM,IAAI;AAAA;AAAA;AAAA,EAGtD,QAAQ,UAAU,IAAI,CAAC,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,KAAK,QAAQ,KAAK,KAAK,GAAG,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,EAGjG,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,KAAK,IAAI,KAAK,KAAK,cAAc,EAAE,EAAE,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mEAcf,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMxF,KAAK;AAAA,IACL;AAAA,MACE,OAAO,MAAM,MAAM;AAAA,MACnB,OAAO,QAAQ;AAAA,MACf,kBAAkB,QAAQ;AAAA,MAC1B,OAAO,QAAQ;AAAA,MACf,QAAQ,QAAQ;AAAA,MAChB,UAAU,QAAQ,SAAS,IAAI,CAAC,aAAa;AAAA,QAC3C,MAAM,QAAQ;AAAA,QACd,UAAU,QAAQ;AAAA,QAClB,WAAW,QAAQ,QAAQ;AAAA,QAC3B,kBAAkB,QAAQ;AAAA,MAC5B,EAAE;AAAA,MACF,UAAU,MAAM,MAAM,MACnB,OAAO,CAAC,SAAS,KAAK,WAAW,KAAK,YAAY,WAAW,EAC7D,IAAI,CAAC,UAAU;AAAA,QACd,MAAM,KAAK;AAAA,QACX,YAAY,KAAK;AAAA,QACjB,SAAS,KAAK;AAAA,QACd,OAAO,KAAK;AAAA,QACZ,MAAM,KAAK,QAAQ,CAAC;AAAA,MACtB,EAAE;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAAA;AAAA;AAGD;;;ACzUA,IAAM,mBAA2C;AAAA,EAC/C,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAEA,IAAM,aAA6D;AAAA,EACjE,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAGA,SAAS,UAAU,GAAuE;AACxF,MAAI,EAAE,gBAAgB,OAAW,QAAO,EAAE;AAC1C,MAAI,EAAE,aAAa,OAAW,QAAO,OAAO,EAAE,QAAQ;AACtD,MAAI,EAAE,gBAAgB,OAAW,QAAO,EAAE;AAC1C,MAAI,EAAE,cAAc,OAAW,QAAO,EAAE;AACxC,SAAO;AACT;AAEA,SAAS,cAAc,OAA0E;AAC/F,QAAM,MAAiD,CAAC;AACxD,aAAW,KAAK,MAAO,KAAI,EAAE,GAAG,IAAI,UAAU,EAAE,KAAK;AACrD,SAAO;AACT;AAEA,SAAS,UAAU,MAAsB;AACvC,QAAM,KAAK,OAAO,IAAI,IAAI;AAC1B,SAAO,OAAO,SAAS,EAAE,IAAI,IAAI,KAAK,EAAE,EAAE,YAAY,KAAI,oBAAI,KAAK,CAAC,GAAE,YAAY;AACpF;AAGA,SAAS,mBAAmB,OAAwD;AAClF,MAAI,eAAe,SAAS,EAAE,oBAAoB,QAAQ;AACxD,UAAM,gBAAgB,IAAI,MAAM,WAAW;AAAA,EAC7C;AACA,MAAI,eAAe,SAAS,EAAE,yBAAyB,QAAQ;AAC7D,UAAM,qBAAqB,IAAI,MAAM,WAAW;AAAA,EAClD;AACA,MAAI,eAAe,SAAS,EAAE,6BAA6B,QAAQ;AACjE,UAAM,yBAAyB,IAAI,OAAO,MAAM,WAAW,CAAC,EAAE,YAAY;AAAA,EAC5E;AACF;AAEO,SAAS,0BACd,YACA,OAA2B,CAAC,GACZ;AAChB,QAAM,QAAQ,KAAK,uBAAuB;AAC1C,QAAM,UAAU,EAAE,GAAG,kBAAkB,GAAG,KAAK,QAAQ;AACvD,QAAM,QAAwB,CAAC;AAE/B,aAAW,MAAM,WAAW,iBAAiB,CAAC,GAAG;AAC/C,UAAM,WAAW,EAAE,YAAY,cAAc,GAAG,UAAU,cAAc,CAAC,CAAC,EAAE;AAC5E,eAAW,SAAS,GAAG,cAAc,CAAC,GAAG;AACvC,iBAAW,QAAQ,MAAM,SAAS,CAAC,GAAG;AACpC,cAAM,aAAa,cAAc,KAAK,cAAc,CAAC,CAAC;AACtD,YAAI,UAAU,gBAAiB,oBAAmB,UAAU;AAC5D,cAAM,OAAqB;AAAA,UACzB,UAAU,KAAK;AAAA,UACf,SAAS,KAAK;AAAA,UACd,gBAAgB,KAAK,gBAAgB;AAAA,UACrC,MAAM,KAAK;AAAA,UACX,MAAM,QAAQ,KAAK,IAAI,KAAK;AAAA,UAC5B,YAAY,UAAU,KAAK,iBAAiB;AAAA,UAC5C,UAAU,UAAU,KAAK,eAAe;AAAA,UACxC,QAAQ;AAAA,YACN,MAAM,WAAW,KAAK,QAAQ,QAAQ,CAAC,KAAK;AAAA,YAC5C,GAAI,KAAK,QAAQ,UAAU,EAAE,SAAS,KAAK,OAAO,QAAQ,IAAI,CAAC;AAAA,UACjE;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,YAAI,KAAK,UAAU,KAAK,OAAO,SAAS,GAAG;AACzC,eAAK,SAAS,KAAK,OAAO,IAAI,CAAC,OAAO;AAAA,YACpC,MAAM,EAAE;AAAA,YACR,cAAc,EAAE;AAAA,YAChB,GAAI,EAAE,aAAa,EAAE,YAAY,cAAc,EAAE,UAAU,EAAE,IAAI,CAAC;AAAA,UACpE,EAAE;AAAA,QACJ;AACA,cAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;;ACjFA,IAAM,mBAAmB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,YAAY;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,aAAa;AAAA,EACjB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAiFO,SAAS,iBAAiB,WAAmB,MAA4C;AAC9F,SAAO,sBAAsB,WAAW,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM;AACnE;AAGO,SAAS,sBACd,WACA,MACsB;AACtB,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,gBAAgB,KAAK,iBAAiB;AAE5C,QAAM,UAAU,kBAAkB,SAAS;AAC3C,MAAI,QAAQ,SAAS,GAAG;AACtB,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAIA,QAAM,WAAW,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAE,KAAK;AAC1C,QAAM,MAA4B,CAAC;AAEnC,aAAW,WAAW,UAAU;AAC9B,UAAM,QAAQ,QAAQ,IAAI,OAAO;AACjC,UAAM,MAAM,eAAe,SAAS,OAAO,aAAa;AAExD,UAAM,QAAQ,aAAa,MAAM,SAAS,GAAG;AAC7C,UAAM,EAAE,SAAS,aAAa,IAAI,YAAY,MAAM,KAAK,KAAK;AAE9D,UAAM,MAA8B;AAAA,MAClC,YAAY,IAAI;AAAA,MAChB,gBAAgB,IAAI;AAAA,MACpB,iBAAiB,IAAI;AAAA,MACrB,kBAAkB,IAAI;AAAA,MACtB,kBAAkB,IAAI;AAAA,MACtB,eAAe,IAAI,WAAW;AAAA,MAC9B,mBAAmB,IAAI,WAAW;AAAA,IACpC;AACA,QAAI,IAAI,WAAW,WAAW,OAAW,KAAI,gBAAgB,IAAI,WAAW;AAC5E,QAAI,aAAc,KAAI,gBAAgB;AAEtC,UAAM,UACJ,aAAa,YAAY,EAAE,cAAc,OAAO,IAAI,IAAI,EAAE,aAAa,OAAO,IAAI;AAEpF,UAAM,EAAE,YAAY,eAAe,IAAI,wBAAwB,KAAK;AACpE,UAAM,gBAAgB,KAAK,wBAAwB,OAAO;AAE1D,UAAM,SAAS,kBAAkB;AAAA,MAC/B,OAAO,QAAQ,KAAK,YAAY,IAAI,KAAK,WAAW,IAAI,OAAO;AAAA,MAC/D,cAAc,KAAK;AAAA,MACnB,aAAa,KAAK;AAAA,MAClB;AAAA,MACA,OAAO,eAAe,IAAI,OAAO,aAAa;AAAA,MAC9C;AAAA,MACA;AAAA,MACA;AAAA,MACA,QAAQ,IAAI;AAAA,MACZ;AAAA,MACA,YAAY,IAAI;AAAA,MAChB,GAAI,gBAAgB,EAAE,cAAc,IAAI,CAAC;AAAA,MACzC;AAAA,MACA,GAAI,IAAI,oBAAoB,EAAE,aAAa,IAAI,kBAAkB,IAAI,CAAC;AAAA,MACtE;AAAA,MACA,YAAY;AAAA,IACd,CAAC;AAED,QAAI,KAAK;AAAA,MACP;AAAA,MACA,GAAI,eAAe,SAAY,EAAE,WAAW,IAAI,CAAC;AAAA,MACjD,GAAI,mBAAmB,SAAY,EAAE,eAAe,IAAI,CAAC;AAAA,IAC3D,CAAC;AAAA,EACH;AAEA,SAAO;AACT;AAIA,SAAS,kBAAkB,WAAqD;AAC9E,QAAM,UAAU,oBAAI,IAAiC;AACrD,aAAW,QAAQ,UAAU,MAAM,IAAI,GAAG;AACxC,UAAM,UAAU,KAAK,KAAK;AAC1B,QAAI,QAAQ,WAAW,EAAG;AAC1B,QAAI;AACJ,QAAI;AACF,eAAS,KAAK,MAAM,OAAO;AAAA,IAC7B,QAAQ;AAIN;AAAA,IACF;AACA,QAAI,CAAC,UAAU,OAAO,WAAW,SAAU;AAC3C,UAAM,OAAO,oBAAoB,MAAiC;AAClE,QAAI,CAAC,KAAM;AACX,UAAM,MAAM,QAAQ,IAAI,KAAK,QAAQ;AACrC,QAAI,IAAK,KAAI,KAAK,IAAI;AAAA,QACjB,SAAQ,IAAI,KAAK,UAAU,CAAC,IAAI,CAAC;AAAA,EACxC;AACA,SAAO;AACT;AAEA,SAAS,eACP,SACA,OACA,eACgB;AAEhB,QAAM,UAAU,CAAC,GAAG,KAAK,EAAE;AAAA,IACzB,CAAC,GAAG,MAAM,EAAE,WAAW,cAAc,EAAE,UAAU,KAAK,EAAE,QAAQ,cAAc,EAAE,OAAO;AAAA,EACzF;AAEA,MAAI,QAAQ;AACZ,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,YAAY;AAChB,MAAI,eAAe;AACnB,MAAI,gBAAgB;AACpB,MAAI,iBAAiB;AACrB,MAAI,iBAAiB;AACrB,MAAI;AACJ,QAAM,aAAa,oBAAI,IAAoB;AAC3C,MAAI,WAAW,QAAQ,CAAC,GAAG,cAAc;AACzC,MAAI,SAAS,QAAQ,CAAC,GAAG,YAAY;AAErC,aAAW,KAAK,SAAS;AACvB,QAAI,EAAE,eAAe,CAAC,YAAY,EAAE,aAAa,UAAW,YAAW,EAAE;AACzE,QAAI,EAAE,YAAY,EAAE,WAAW,OAAQ,UAAS,EAAE;AAElD,QAAI,EAAE,SAAS,OAAO;AACpB,sBAAgB;AAChB,YAAM,IAAI,gBAAgB,EAAE,YAAY,gBAAgB;AACxD,YAAM,IAAI,gBAAgB,EAAE,YAAY,iBAAiB;AACzD,YAAM,IAAI,gBAAgB,EAAE,YAAY,iBAAiB;AACzD,UAAI,MAAM,KAAM,UAAS;AACzB,UAAI,MAAM,KAAM,WAAU;AAC1B,UAAI,MAAM,MAAM;AACd,kBAAU;AACV,oBAAY;AAAA,MACd;AACA,YAAM,IAAI,gBAAgB,EAAE,YAAY,UAAU,KAAK,EAAE;AACzD,UAAI,EAAG,YAAW,IAAI,IAAI,WAAW,IAAI,CAAC,KAAK,KAAK,CAAC;AAAA,IACvD,WAAW,EAAE,SAAS,QAAQ;AAC5B,uBAAiB;AAAA,IACnB,WAAW,EAAE,SAAS,SAAS;AAC7B,wBAAkB;AAAA,IACpB;AAEA,QAAI,EAAE,WAAW,SAAS;AACxB,wBAAkB;AAClB,UAAI,sBAAsB,QAAW;AACnC,6BAAqB,EAAE,kBAAkB,GAAG,EAAE,IAAI,6BAAwB,MAAM,GAAG,GAAG;AAAA,MACxF;AAAA,IACF;AAAA,EACF;AAIA,QAAM,QAAQ,QAAQ,UAAU,KAAK,eAAe,OAAO,KAAK;AAEhE,MAAI,SAAS;AACb,MAAI,YAAY,QAAQ;AACtB,UAAM,IAAI,KAAK,MAAM,QAAQ;AAC7B,UAAM,IAAI,KAAK,MAAM,MAAM;AAC3B,QAAI,CAAC,OAAO,MAAM,CAAC,KAAK,CAAC,OAAO,MAAM,CAAC,EAAG,UAAS,KAAK,IAAI,GAAG,IAAI,CAAC;AAAA,EACtE;AAEA,QAAM,aAA4B,YAAY,EAAE,OAAO,QAAQ,OAAO,IAAI,EAAE,OAAO,OAAO;AAE1F,SAAO;AAAA,IACL;AAAA,IACA,WAAW,MAAM;AAAA,IACjB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,WAAW;AAAA,IACX,SAAS;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,aAAa,MAA+B,SAAiB,KAA6B;AACjG,QAAM,WAAW,KAAK,gBAAgB,SAAS,GAAG;AAClD,MAAI,aAAa,QAAW;AAC1B,QAAI,CAAC,OAAO,SAAS,QAAQ,GAAG;AAC9B,YAAM,IAAI;AAAA,QACR,oCAAoC,OAAO,0BAA0B,QAAQ;AAAA,MAC/E;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,SAAO,IAAI,iBAAiB,IAAI,IAAI;AACtC;AAEA,SAAS,YACP,MACA,KACA,OAC4C;AAE5C,MAAI,cAAc;AAClB,MAAI,UAAU;AACd,aAAW,KAAK,OAAO;AACrB,QAAI,EAAE,SAAS,MAAO;AACtB,UAAM,IAAI,gBAAgB,EAAE,YAAY,SAAS;AACjD,QAAI,MAAM,MAAM;AACd,qBAAe;AACf,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,MAAI,QAAS,QAAO,EAAE,SAAS,aAAa,cAAc,MAAM;AAEhE,MAAI,KAAK,qBAAqB,QAAW;AACvC,UAAM,cAAc,IAAI,WAAW,QAAQ,IAAI,WAAW;AAC1D,WAAO,EAAE,SAAS,cAAc,KAAK,kBAAkB,cAAc,MAAM;AAAA,EAC7E;AAIA,SAAO,EAAE,SAAS,GAAG,cAAc,KAAK;AAC1C;AAEA,SAAS,wBAAwB,OAG/B;AACA,QAAM,MAAM,MACT,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,EAC9B,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,cAAc,EAAE,UAAU,KAAK,EAAE,QAAQ,cAAc,EAAE,OAAO,CAAC;AAChG,MAAI,IAAI,WAAW,EAAG,QAAO,CAAC;AAC9B,QAAM,aACJ,gBAAgB,IAAI,CAAC,EAAG,YAAY,CAAC,eAAe,sBAAsB,eAAe,CAAC,KAC1F;AACF,QAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAM,iBACJ,gBAAgB,KAAK,YAAY;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC,KAAK;AACR,SAAO;AAAA,IACL,GAAI,eAAe,SAAY,EAAE,WAAW,IAAI,CAAC;AAAA,IACjD,GAAI,mBAAmB,SAAY,EAAE,eAAe,IAAI,CAAC;AAAA,EAC3D;AACF;AAEA,SAAS,QAAQ,OAA2C;AAC1D,MAAI,OAAsB;AAC1B,MAAI,QAAQ;AACZ,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO;AAG1B,QAAI,IAAI,SAAU,MAAM,SAAS,SAAS,QAAQ,IAAI,MAAO;AAC3D,aAAO;AACP,cAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eAAe,OAA2C;AACjE,aAAW,KAAK,OAAO;AACrB,UAAM,IAAI,gBAAgB,EAAE,YAAY,UAAU,KAAK,EAAE;AACzD,QAAI,EAAG,QAAO;AAAA,EAChB;AACA,SAAO;AACT;AASA,SAAS,eAAe,OAAe,eAA+B;AACpE,MAAI,iBAAiB,KAAK,EAAG,QAAO;AACpC,QAAM,cAAc,cAAc,SAAS,GAAG,IAC1C,cAAc,MAAM,cAAc,QAAQ,GAAG,CAAC,IAC9C;AACJ,SAAO,GAAG,KAAK,GAAG,WAAW;AAC/B;AAEA,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;;;ACxYO,IAAM,qBAAN,MAA+C;AAAA,EAC5C,OAAO,oBAAI,IAAiB;AAAA,EAC5B,WAAmB,CAAC;AAAA,EACpB,YAA0B,CAAC;AAAA,EAC3B,eAA2B,CAAC;AAAA,EAC5B,YAAiC,CAAC;AAAA,EAE1C,MAAM,UAAU,KAAyB;AACvC,QAAI,KAAK,KAAK,IAAI,IAAI,KAAK,EAAG,OAAM,IAAI,MAAM,OAAO,IAAI,KAAK,iBAAiB;AAC/E,SAAK,KAAK,IAAI,IAAI,OAAO,EAAE,GAAG,IAAI,CAAC;AAAA,EACrC;AAAA,EAEA,MAAM,UAAU,OAAe,OAAoC;AACjE,UAAM,WAAW,KAAK,KAAK,IAAI,KAAK;AACpC,QAAI,CAAC,SAAU,OAAM,IAAI,MAAM,OAAO,KAAK,YAAY;AACvD,SAAK,KAAK,IAAI,OAAO,EAAE,GAAG,UAAU,GAAG,MAAM,CAAC;AAAA,EAChD;AAAA,EAEA,MAAM,WAAW,MAA2B;AAC1C,SAAK,SAAS,KAAK,EAAE,GAAG,KAAK,CAAC;AAAA,EAChC;AAAA,EAEA,MAAM,WAAW,QAAgB,OAAqC;AACpE,UAAM,MAAM,KAAK,SAAS,UAAU,CAAC,MAAM,EAAE,WAAW,MAAM;AAC9D,QAAI,MAAM,EAAG,OAAM,IAAI,MAAM,QAAQ,MAAM,YAAY;AACvD,SAAK,SAAS,GAAG,IAAI,EAAE,GAAG,KAAK,SAAS,GAAG,GAAG,GAAG,MAAM;AAAA,EACzD;AAAA,EAEA,MAAM,YAAY,OAAkC;AAClD,SAAK,UAAU,KAAK,EAAE,GAAG,MAAM,CAAC;AAAA,EAClC;AAAA,EAEA,MAAM,eAAe,UAAmC;AACtD,SAAK,aAAa,KAAK,EAAE,GAAG,SAAS,CAAC;AAAA,EACxC;AAAA,EAEA,MAAM,kBAAkB,OAAyC;AAC/D,SAAK,UAAU,KAAK,EAAE,GAAG,MAAM,CAAC;AAAA,EAClC;AAAA,EAEA,MAAM,OAAO,OAAyC;AACpD,UAAM,IAAI,KAAK,KAAK,IAAI,KAAK;AAC7B,WAAO,IAAI,EAAE,GAAG,EAAE,IAAI;AAAA,EACxB;AAAA,EAEA,MAAM,SAAS,SAAoB,CAAC,GAAmB;AACrD,WAAO,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,EAAE,OAAO,CAAC,MAAM,WAAW,GAAG,MAAM,CAAC;AAAA,EACpE;AAAA,EAEA,MAAM,MAAM,SAAqB,CAAC,GAAoB;AACpD,WAAO,KAAK,SAAS,OAAO,CAAC,MAAM,YAAY,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;AAAA,EAClF;AAAA,EAEA,MAAM,OAAO,SAAsB,CAAC,GAA0B;AAC5D,WAAO,KAAK,UAAU,OAAO,CAAC,MAAM,aAAa,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;AAAA,EACpF;AAAA,EAEA,MAAM,OAAO,OAA6C;AACxD,WAAO,KAAK,UAAU,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;AAAA,EAC9E;AAAA,EAEA,MAAM,UAAU,OAAoC;AAClD,WAAO,KAAK,aAAa,OAAO,CAAC,MAAM,EAAE,UAAU,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;AAAA,EACjF;AACF;AAEA,SAAS,WAAW,GAAQ,GAAuB;AACjD,MAAI,EAAE,cAAc,EAAE,eAAe,EAAE,WAAY,QAAO;AAC1D,MAAI,EAAE,aAAa,EAAE,cAAc,EAAE,UAAW,QAAO;AACvD,MAAI,EAAE,UAAU,EAAE,WAAW,EAAE,OAAQ,QAAO;AAC9C,MAAI,EAAE,UAAU,UAAa,EAAE,YAAY,EAAE,MAAO,QAAO;AAC3D,MAAI,EAAE,UAAU,UAAa,EAAE,YAAY,EAAE,MAAO,QAAO;AAC3D,MAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,MAAO,QAAO;AACzD,MAAI,EAAE,eAAe,EAAE,gBAAgB,EAAE,YAAa,QAAO;AAC7D,MAAI,EAAE,aAAa,EAAE,cAAc,EAAE,UAAW,QAAO;AACvD,MAAI,EAAE,UAAU,EAAE,WAAW,EAAE,OAAQ,QAAO;AAC9C,MAAI,EAAE,SAAS,EAAE,UAAU,EAAE,MAAO,QAAO;AAC3C,SAAO;AACT;AAEA,SAAS,YAAY,GAAS,GAAwB;AACpD,MAAI,EAAE,SAAS,EAAE,UAAU,EAAE,MAAO,QAAO;AAC3C,MAAI,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,aAAc,QAAO;AAChE,MAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAM,QAAO;AACxC,MAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAM,QAAO;AACxC,MAAI,EAAE,aAAa,EAAE,SAAS,UAAU,EAAE,aAAa,EAAE,UAAW,QAAO;AAC3E,MAAI,EAAE,YAAY,EAAE,SAAS,WAAW,EAAE,YAAY,EAAE,SAAU,QAAO;AACzE,MAAI,EAAE,UAAU,UAAa,EAAE,YAAY,EAAE,MAAO,QAAO;AAC3D,MAAI,EAAE,UAAU,UAAa,EAAE,YAAY,EAAE,MAAO,QAAO;AAC3D,SAAO;AACT;AAEA,SAAS,aAAa,GAAe,GAAyB;AAC5D,MAAI,EAAE,SAAS,EAAE,UAAU,EAAE,MAAO,QAAO;AAC3C,MAAI,EAAE,UAAU,EAAE,WAAW,EAAE,OAAQ,QAAO;AAC9C,MAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAM,QAAO;AACxC,MAAI,EAAE,UAAU,UAAa,EAAE,YAAY,EAAE,MAAO,QAAO;AAC3D,MAAI,EAAE,UAAU,UAAa,EAAE,YAAY,EAAE,MAAO,QAAO;AAC3D,SAAO;AACT;AAUO,IAAM,uBAAN,MAAiD;AAAA,EAC9C;AAAA,EACA;AAAA;AAAA,EAEA;AAAA,EACA,SAAS;AAAA,EAEjB,YAAY,SAAsC;AAChD,SAAK,MAAM,QAAQ;AACnB,SAAK,WAAW,QAAQ,YAAY,KAAK,OAAO;AAAA,EAClD;AAAA,EAEA,MAAc,YAA2B;AACvC,UAAM,KAAK,MAAM,OAAO,aAAkB;AAC1C,UAAM,GAAG,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;AAAA,EAC9C;AAAA,EAEA,MAAc,OAAO,MAAc,QAAgC;AACjE,UAAM,KAAK,UAAU;AACrB,UAAM,KAAK,MAAM,OAAO,aAAkB;AAC1C,UAAM,OAAO,MAAM,OAAO,MAAW;AACrC,UAAM,SAAS,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI,SAAS;AACnD,QAAI;AACF,YAAM,OAAO,MAAM,GAAG,KAAK,MAAM;AACjC,UAAI,KAAK,QAAQ,KAAK,UAAU;AAC9B,cAAM,SAAS,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,CAAC,SAAS;AACjE,cAAM,GAAG,OAAO,QAAQ,MAAM;AAAA,MAChC;AAAA,IACF,QAAQ;AAAA,IAER;AACA,UAAM,GAAG,WAAW,QAAQ,GAAG,KAAK,UAAU,MAAM,CAAC;AAAA,GAAM,MAAM;AAMjE,QAAI,KAAK,SAAS,CAAE,QAAkC,SAAS;AAC7D,WAAK,KAAK,WAAW,MAAM,MAAM;AAAA,IACnC;AAAA,EACF;AAAA,EAEA,MAAc,WAAW,MAAc,QAAgC;AACrE,QAAI,CAAC,KAAK,MAAO;AACjB,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,cAAM,KAAK,MAAM,UAAU,MAAa;AACxC;AAAA,MACF,KAAK;AACH,cAAM,KAAK,MAAM,WAAW,MAAc;AAC1C;AAAA,MACF,KAAK;AACH,cAAM,KAAK,MAAM,YAAY,MAAoB;AACjD;AAAA,MACF,KAAK;AACH,cAAM,KAAK,MAAM,eAAe,MAAkB;AAClD;AAAA,MACF,KAAK;AACH,cAAM,KAAK,MAAM,kBAAkB,MAA2B;AAC9D;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,MAAc,OAAoC;AAChD,QAAI,KAAK,UAAU,KAAK,MAAO,QAAO,KAAK;AAC3C,UAAM,KAAK,MAAM,OAAO,aAAkB;AAC1C,UAAM,OAAO,MAAM,OAAO,MAAW;AACrC,UAAM,QAAQ,IAAI,mBAAmB;AACrC,QAAI;AACF,YAAM,UAAU,MAAM,GAAG,QAAQ,KAAK,GAAG;AACzC,iBAAW,QAAQ,SAAS;AAC1B,YAAI,CAAC,KAAK,SAAS,SAAS,EAAG;AAC/B,cAAM,OAAO,KAAK,KAAK,KAAK,KAAK,IAAI;AACrC,cAAM,UAAU,MAAM,GAAG,SAAS,MAAM,MAAM;AAC9C,cAAM,OAAO,KAAK,MAAM,GAAG,EAAE,CAAC;AAC9B,mBAAW,QAAQ,QAAQ,MAAM,IAAI,GAAG;AACtC,cAAI,CAAC,KAAK,KAAK,EAAG;AAClB,gBAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,cAAI,SAAS,QAAQ;AAEnB,gBAAI;AACF,oBAAM,MAAM,UAAU,MAAM;AAAA,YAC9B,QAAQ;AACN,oBAAM,MAAM,UAAU,OAAO,OAAO,MAAM;AAAA,YAC5C;AAAA,UACF,WAAW,SAAS,SAAS;AAQ3B,gBAAI,QAAQ,SAAS;AACnB,kBAAI;AACF,sBAAM,MAAM,WAAW,OAAO,QAAQ,MAAM;AAAA,cAC9C,QAAQ;AAIN,sBAAM,MAAM,WAAW,MAAM;AAAA,cAC/B;AAAA,YACF,OAAO;AACL,oBAAM,MAAM,WAAW,MAAM;AAAA,YAC/B;AAAA,UACF,WAAW,SAAS,UAAU;AAC5B,kBAAM,MAAM,YAAY,MAAM;AAAA,UAChC,WAAW,SAAS,aAAa;AAC/B,kBAAM,MAAM,eAAe,MAAM;AAAA,UACnC,WAAW,SAAS,UAAU;AAC5B,kBAAM,MAAM,kBAAkB,MAAM;AAAA,UACtC;AAAA,QACF;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AACA,SAAK,QAAQ;AACb,SAAK,SAAS;AACd,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UAAU,KAAyB;AACvC,UAAM,KAAK,OAAO,QAAQ,GAAG;AAAA,EAC/B;AAAA,EACA,MAAM,UAAU,OAAe,OAAoC;AAGjE,UAAM,KAAK,OAAO,QAAQ,EAAE,OAAO,GAAG,OAAO,SAAS,KAAK,CAAC;AAC5D,QAAI,KAAK,MAAO,OAAM,KAAK,MAAM,UAAU,OAAO,KAAK;AAAA,EACzD;AAAA,EACA,MAAM,WAAW,MAA2B;AAC1C,UAAM,KAAK,OAAO,SAAS,IAAI;AAAA,EACjC;AAAA,EACA,MAAM,WAAW,QAAgB,OAAqC;AACpE,UAAM,KAAK,OAAO,SAAS,EAAE,QAAQ,GAAG,OAAO,SAAS,KAAK,CAAC;AAC9D,QAAI,KAAK,MAAO,OAAM,KAAK,MAAM,WAAW,QAAQ,KAAK;AAAA,EAC3D;AAAA,EACA,MAAM,YAAY,OAAkC;AAClD,UAAM,KAAK,OAAO,UAAU,KAAK;AAAA,EACnC;AAAA,EACA,MAAM,eAAe,UAAmC;AACtD,UAAM,KAAK,OAAO,aAAa,QAAQ;AAAA,EACzC;AAAA,EACA,MAAM,kBAAkB,OAAyC;AAC/D,UAAM,KAAK,OAAO,UAAU,KAAK;AAAA,EACnC;AAAA,EAEA,MAAM,OAAO,OAAyC;AACpD,YAAQ,MAAM,KAAK,KAAK,GAAG,OAAO,KAAK;AAAA,EACzC;AAAA,EACA,MAAM,SAAS,QAAoC;AACjD,YAAQ,MAAM,KAAK,KAAK,GAAG,SAAS,MAAM;AAAA,EAC5C;AAAA,EACA,MAAM,MAAM,QAAsC;AAChD,YAAQ,MAAM,KAAK,KAAK,GAAG,MAAM,MAAM;AAAA,EACzC;AAAA,EACA,MAAM,OAAO,QAA6C;AACxD,YAAQ,MAAM,KAAK,KAAK,GAAG,OAAO,MAAM;AAAA,EAC1C;AAAA,EACA,MAAM,OAAO,OAA6C;AACxD,YAAQ,MAAM,KAAK,KAAK,GAAG,OAAO,KAAK;AAAA,EACzC;AAAA,EACA,MAAM,UAAU,OAAoC;AAClD,YAAQ,MAAM,KAAK,KAAK,GAAG,UAAU,KAAK;AAAA,EAC5C;AACF;;;AC7SA,IAAM,mBAAmB,IAAI,OAAO;AAEpC,SAAS,gBAAgB,SAAkE;AACzF,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,MAA8B,CAAC;AACrC,UAAQ,QAAQ,CAAC,OAAO,QAAQ;AAC9B,QAAI,IAAI,YAAY,CAAC,IAAI;AAAA,EAC3B,CAAC;AACD,SAAO,OAAO,KAAK,GAAG,EAAE,SAAS,IAAI,MAAM;AAC7C;AAEA,SAAS,eAAe,MAAuB;AAC7C,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,MAAI;AACF,WAAO,KAAK,MAAM,IAAI;AAAA,EACxB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,eAAe,gBACb,OACA,MACkB;AAClB,MAAI,OAAO,MAAM,SAAS,SAAU,QAAO,eAAe,KAAK,IAAI;AACnE,MAAI,MAAM,QAAQ,KAAM,QAAO;AAC/B,MAAI,iBAAiB,SAAS;AAC5B,QAAI;AACF,aAAO,eAAe,MAAM,MAAM,MAAM,EAAE,KAAK,CAAC;AAAA,IAClD,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,KAAa,SAAyB;AAC7D,QAAM,iBAAiB,QAAQ,QAAQ,QAAQ,EAAE;AACjD,MAAI,IAAI,WAAW,cAAc,EAAG,QAAO,IAAI,MAAM,eAAe,MAAM,KAAK;AAC/E,MAAI;AACF,WAAO,IAAI,IAAI,GAAG,EAAE;AAAA,EACtB,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEO,SAAS,sBACdA,QACA,MACA,KACA,OAA4B,CAAC,GACJ;AACzB,QAAM,WAAW,IAAI,YAAY,oBAAoB,IAAI,OAAO;AAChE,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,UAAU,KAAK,uBAAuB;AAC5C,MAAI,SAAS;AAEb,QAAM,YAAY,CAAC,WAAiC,cAAwC;AAAA,IAC1F,SAAS,OAAO,WAAW;AAAA,IAC3B,OAAO,IAAI;AAAA,IACX,QAAQ,IAAI;AAAA,IACZ;AAAA,IACA,OAAO,IAAI;AAAA,IACX;AAAA,IACA,SAAS,IAAI;AAAA,IACb,cAAc;AAAA;AAAA,IACd;AAAA,IACA,WAAW,KAAK,IAAI;AAAA,IACpB,gBAAgB,CAAC;AAAA,EACnB;AAEA,QAAM,SAAS,OAAO,UAA2C;AAC/D,QAAI;AACF,YAAM,KAAK,OAAO,SAAS,KAAK,CAAC;AAAA,IACnC,SAAS,KAAK;AACZ,UAAI,KAAK,WAAY,OAAM;AAC3B,UAAI,CAAC,QAAQ;AACX,iBAAS;AACT,gBAAQ;AAAA,UACN,6EACE,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CACjD;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO,OAAO,OAA0B,SAA0C;AAChF,UAAM,MACJ,OAAO,UAAU,WAAW,QAAQ,iBAAiB,MAAM,MAAM,SAAS,IAAI,MAAM;AACtF,UAAM,UAAU,MAAM,WAAW,iBAAiB,UAAU,MAAM,SAAS,QAAQ,YAAY;AAC/F,UAAM,WAAW,gBAAgB,KAAK,IAAI,OAAO;AAEjD,UAAM,aAAa,IAAI;AAAA,MACrB,MAAM,YAAY,iBAAiB,UAAU,MAAM,UAAU;AAAA,IAC/D;AACA,UAAM,OAAO;AAAA,MACX,GAAG,UAAU,WAAW,QAAQ;AAAA,MAChC,gBAAgB,EAAE,GAAG,gBAAgB,UAAU,GAAG,iBAAiB,OAAO;AAAA,MAC1E,aAAa,MAAM,gBAAgB,OAAO,IAAI;AAAA,IAChD,CAAC;AAED,UAAM,QAAQ,KAAK,IAAI;AACvB,QAAI;AACJ,QAAI;AACF,iBAAW,MAAMA,OAAM,OAAO,IAAI;AAAA,IACpC,SAAS,KAAK;AACZ,YAAM,OAAO;AAAA,QACX,GAAG,UAAU,SAAS,QAAQ;AAAA,QAC9B,YAAY,KAAK,IAAI,IAAI;AAAA,QACzB,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,MAC/D,CAAC;AACD,YAAM;AAAA,IACR;AAGA,QAAI;AACJ,UAAM,iBAA2B,CAAC;AAClC,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,MAAM,EAAE,KAAK;AACxC,UAAI,IAAI,SAAS,SAAS;AACxB,uBAAe,IAAI,MAAM,GAAG,OAAO;AACnC,uBAAe,KAAK,gBAAgB;AAAA,MACtC,OAAO;AACL,uBAAe,eAAe,GAAG;AAAA,MACnC;AAAA,IACF,QAAQ;AACN,qBAAe;AAAA,IACjB;AAEA,UAAM,OAAO;AAAA,MACX,GAAG,UAAU,YAAY,QAAQ;AAAA,MACjC,YAAY,KAAK,IAAI,IAAI;AAAA,MACzB,YAAY,SAAS;AAAA,MACrB,iBAAiB,gBAAgB,SAAS,OAAO;AAAA,MACjD;AAAA,MACA;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AACF;;;AChLO,IAAM,wBAAwB,EAAE,MAAM,8BAA8B,SAAS,QAAQ;AA4B5F,eAAsB,gBACpB,OACA,OACA,gBAA2D,CAAC,GACvC;AACrB,QAAM,MAAM,MAAM,MAAM,OAAO,KAAK;AACpC,MAAI,CAAC,IAAK,OAAM,IAAI,MAAM,OAAO,KAAK,YAAY;AAClD,QAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,MAAM,CAAC;AACzC,QAAM,SAAS,MAAM,MAAM,OAAO,EAAE,MAAM,CAAC;AAC3C,QAAM,eAAe,oBAAI,IAA0B;AACnD,aAAW,KAAK,QAAQ;AACtB,QAAI,CAAC,EAAE,OAAQ;AACf,UAAM,MAAM,aAAa,IAAI,EAAE,MAAM,KAAK,CAAC;AAC3C,QAAI,KAAK,CAAC;AACV,iBAAa,IAAI,EAAE,QAAQ,GAAG;AAAA,EAChC;AACA,QAAM,UAAU,aAAa,GAAG;AAChC,QAAM,YAAwB,MAAM;AAAA,IAAI,CAAC,MACvC,WAAW,GAAG,SAAS,aAAa,IAAI,EAAE,MAAM,KAAK,CAAC,CAAC;AAAA,EACzD;AACA,SAAO;AAAA,IACL,eAAe;AAAA,MACb;AAAA,QACE,UAAU;AAAA,UACR,YAAY,aAAa;AAAA,YACvB,gBAAgB;AAAA,YAChB,UAAU,IAAI;AAAA,YACd,mBAAmB,IAAI;AAAA,YACvB,kBAAkB,IAAI,aAAa;AAAA,YACnC,uBAAuB,IAAI,kBAAkB;AAAA,YAC7C,gBAAgB,IAAI,WAAW;AAAA,YAC/B,yBAAyB,IAAI,oBAAoB;AAAA,YACjD,GAAG;AAAA,UACL,CAAC;AAAA,QACH;AAAA,QACA,YAAY,CAAC,EAAE,OAAO,uBAAuB,OAAO,UAAU,CAAC;AAAA,MACjE;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,WAAW,MAAY,SAAiB,QAAgC;AAC/E,QAAM,UAAU,KAAK,WAAW,KAAK;AACrC,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,UAAU,KAAK,MAAM;AAAA,IAC7B,cAAc,KAAK,eAAe,UAAU,KAAK,YAAY,IAAI;AAAA,IACjE,MAAM,KAAK;AAAA,IACX,MAAM;AAAA;AAAA,IACN,mBAAmB,OAAO,KAAK,SAAS;AAAA,IACxC,iBAAiB,OAAO,OAAO;AAAA,IAC/B,YAAY,aAAa,sBAAsB,IAAI,CAAC;AAAA,IACpD,QAAQ,OAAO,IAAI,CAAC,OAAO;AAAA,MACzB,cAAc,OAAO,EAAE,SAAS;AAAA,MAChC,MAAM,EAAE;AAAA,MACR,YAAY,aAAa,eAAe,EAAE,OAAO,CAAC;AAAA,IACpD,EAAE;AAAA,IACF,QAAQ,KAAK,WAAW,UAAU,EAAE,MAAM,GAAG,SAAS,KAAK,MAAM,IAAI,EAAE,MAAM,EAAE;AAAA,EACjF;AACF;AAEA,SAAS,sBAAsB,MAAuD;AACpF,QAAM,OAAkD;AAAA,IACtD,aAAa,KAAK;AAAA,EACpB;AACA,MAAI,KAAK,SAAS,OAAO;AACvB,SAAK,WAAW,IAAI,KAAK;AACzB,QAAI,KAAK,gBAAgB,OAAW,MAAK,kBAAkB,IAAI,KAAK;AACpE,QAAI,KAAK,iBAAiB,OAAW,MAAK,mBAAmB,IAAI,KAAK;AACtE,QAAI,KAAK,YAAY,OAAW,MAAK,cAAc,IAAI,KAAK;AAC5D,QAAI,KAAK,aAAc,MAAK,mBAAmB,IAAI,KAAK;AAAA,EAC1D,WAAW,KAAK,SAAS,QAAQ;AAC/B,SAAK,WAAW,IAAI,KAAK;AACzB,QAAI,KAAK,cAAc,OAAW,MAAK,iBAAiB,IAAI,KAAK;AAAA,EACnE,WAAW,KAAK,SAAS,aAAa;AACpC,SAAK,iBAAiB,IAAI,KAAK;AAC/B,SAAK,gBAAgB,IAAI,KAAK,KAAK;AAAA,EACrC,WAAW,KAAK,SAAS,SAAS;AAChC,SAAK,UAAU,IAAI,KAAK;AACxB,SAAK,iBAAiB,IAAI,KAAK;AAC/B,SAAK,aAAa,IAAI,KAAK;AAC3B,SAAK,sBAAsB,IAAI,KAAK;AAAA,EACtC,WAAW,KAAK,SAAS,WAAW;AAClC,QAAI,KAAK,MAAO,MAAK,eAAe,IAAI,KAAK;AAC7C,QAAI,KAAK,aAAa,OAAW,MAAK,mBAAmB,IAAI,KAAK;AAClE,QAAI,KAAK,gBAAgB,OAAW,MAAK,sBAAsB,IAAI,KAAK;AACxE,QAAI,KAAK,eAAe,OAAW,MAAK,qBAAqB,IAAI,KAAK;AAAA,EACxE;AACA,MAAI,KAAK,YAAY;AACnB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,UAAU,GAAG;AACpD,UAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,OAAO,MAAM,UAAW,MAAK,CAAC,IAAI;AAAA,IAC1F;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,eACP,SAC2C;AAC3C,QAAM,MAAiD,CAAC;AACxD,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,OAAO,GAAG;AAC5C,QAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,OAAO,MAAM,UAAW,KAAI,CAAC,IAAI;AAAA,QAClF,KAAI,CAAC,IAAI,KAAK,UAAU,CAAC;AAAA,EAChC;AACA,SAAO;AACT;AAEA,SAAS,aAAa,QAA2E;AAC/F,SAAO,OAAO,QAAQ,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;AAAA,IACnD;AAAA,IACA,OACE,OAAO,UAAU,WACb,OAAO,UAAU,KAAK,IACpB,EAAE,UAAU,MAAM,SAAS,EAAE,IAC7B,EAAE,aAAa,MAAM,IACvB,OAAO,UAAU,YACf,EAAE,WAAW,MAAM,IACnB,EAAE,aAAa,MAAM;AAAA,EAC/B,EAAE;AACJ;AAEA,SAAS,OAAO,IAAoB;AAClC,UAAQ,OAAO,KAAK,MAAM,EAAE,CAAC,IAAI,UAAY,SAAS;AACxD;AAEA,SAAS,UAAU,IAAoB;AAErC,QAAM,UAAU,GAAG,QAAQ,MAAM,EAAE;AACnC,SAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,OAAO,IAAI,GAAG;AAC5C;AAEA,SAAS,aAAa,KAAkB;AAGtC,QAAM,UAAU,IAAI,MAAM,QAAQ,MAAM,EAAE;AAC1C,SAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,OAAO,IAAI,GAAG;AAC5C;;;AC7JO,SAAS,oBAAoB,UAAyC;AAC3E,SAAO,OAAO,QAAQ;AACpB,UAAM,QAAQ,MAAM,IAAI,MAAM,MAAM,EAAE,OAAO,IAAI,MAAM,CAAC;AACxD,eAAW,QAAQ,OAAO;AACxB,UAAI,KAAK,SAAS;AAChB,iBAAS,WAAW,sBAAsB,MAAM,IAAI,KAAK,CAAC;AAAA,MAC5D;AAAA,IACF;AACA,UAAM,SAAS,MAAM;AAAA,EACvB;AACF;AAUO,SAAS,uBACd,OACA,UACA,SACY;AACZ,SAAO;AAAA,IACL,MAAM,UAAU,KAAK;AACnB,aAAO,MAAM,UAAU,GAAG;AAAA,IAC5B;AAAA,IACA,MAAM,UAAU,OAAO,OAAO;AAC5B,aAAO,MAAM,UAAU,OAAO,KAAK;AAAA,IACrC;AAAA,IACA,MAAM,WAAW,MAAM;AACrB,UAAI,KAAK,SAAS;AAChB,iBAAS,WAAW,sBAAsB,MAAM,OAAO,CAAC;AAAA,MAC1D;AACA,aAAO,MAAM,WAAW,IAAI;AAAA,IAC9B;AAAA,IACA,MAAM,WAAW,QAAQ,OAAO;AAC9B,YAAM,MAAM,WAAW,QAAQ,KAAK;AACpC,UAAI,MAAM,SAAS;AACjB,cAAM,QAAQ,MAAM,MAAM,MAAM,EAAE,OAAO,QAAQ,CAAC;AAClD,cAAM,QAAQ,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,MAAM;AACnD,YAAI,OAAO;AACT,mBAAS,WAAW,sBAAsB,OAAO,OAAO,CAAC;AAAA,QAC3D;AAAA,MACF;AAAA,IACF;AAAA,IACA,MAAM,YAAY,OAAO;AACvB,aAAO,MAAM,YAAY,KAAK;AAAA,IAChC;AAAA,IACA,MAAM,kBAAkB,OAAO;AAC7B,aAAO,MAAM,kBAAkB,KAAK;AAAA,IACtC;AAAA,IACA,MAAM,eAAe,UAAU;AAC7B,aAAO,MAAM,eAAe,QAAQ;AAAA,IACtC;AAAA,IACA,QAAQ,MAAM,OAAO,KAAK,KAAK;AAAA,IAC/B,UAAU,MAAM,SAAS,KAAK,KAAK;AAAA,IACnC,OAAO,MAAM,MAAM,KAAK,KAAK;AAAA,IAC7B,QAAQ,MAAM,OAAO,KAAK,KAAK;AAAA,IAC/B,QAAQ,MAAM,OAAO,KAAK,KAAK;AAAA,IAC/B,WAAW,MAAM,UAAU,KAAK,KAAK;AAAA,EACvC;AACF;AAEA,SAAS,sBAAsB,MAAY,SAAiC;AAC1E,QAAM,MAAM,KAAK,SAAS,QAAS,OAAmB;AACtD,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,KAAK;AAAA,IACb,cAAc,KAAK;AAAA,IACnB,MAAM,KAAK;AAAA,IACX,MAAM,KAAK;AAAA,IACX,WAAW,KAAK;AAAA,IAChB,SAAS,KAAK;AAAA,IACd,QAAQ,KAAK;AAAA,IACb,OAAO,KAAK;AAAA,IACZ,OAAO,KAAK;AAAA,IACZ,aAAa,KAAK;AAAA,IAClB,cAAc,KAAK;AAAA,IACnB,SAAS,KAAK;AAAA,IACd,YAAY,KAAK;AAAA,EACnB;AACF;;;ACjDO,SAAS,mBAAmB,QAAqD;AACtF,QAAM,mBACJ,QAAQ,aACP,OAAO,YAAY,cAAc,QAAQ,IAAI,8BAA8B;AAC9E,MAAI,CAAC,iBAAkB,QAAO;AAC9B,QAAM,WAAmB;AAEzB,QAAM,UAAU,QAAQ,WAAW,oBAAoB;AACvD,QAAM,YAAY,QAAQ,aAAa;AACvC,QAAM,kBAAkB,QAAQ,mBAAmB;AACnD,QAAM,cAAc,QAAQ,eAAe;AAC3C,QAAM,gBAAgB,QAAQ,sBAAsB,CAAC;AAErD,QAAM,UAAsB,CAAC;AAC7B,MAAI;AACJ,MAAI,UAAU;AAEd,QAAM,WAAyB;AAAA,IAC7B,WAAW,MAA4B;AACrC,UAAI,QAAS;AACb,cAAQ,KAAK,WAAW,IAAI,CAAC;AAC7B,UAAI,QAAQ,UAAU,WAAW;AAC/B,aAAK,QAAQ;AAAA,MACf;AAAA,IACF;AAAA,IAEA,MAAM,QAAuB;AAC3B,YAAM,QAAQ;AAAA,IAChB;AAAA,IAEA,MAAM,WAA0B;AAC9B,gBAAU;AACV,UAAI,UAAU,QAAW;AACvB,sBAAc,KAAK;AACnB,gBAAQ;AAAA,MACV;AACA,YAAM,QAAQ;AAAA,IAChB;AAAA,EACF;AAEA,UAAQ,YAAY,MAAM;AACxB,QAAI,QAAQ,SAAS,EAAG,MAAK,QAAQ;AAAA,EACvC,GAAG,eAAe;AAElB,MAAI,OAAO,UAAU,YAAY,WAAW,OAAO;AACjD;AAAC,IAAC,MAAyB,MAAM;AAAA,EACnC;AAEA,iBAAe,UAAyB;AACtC,QAAI,QAAQ,WAAW,EAAG;AAC1B,UAAM,QAAQ,QAAQ,OAAO,CAAC;AAC9B,UAAM,OAAmB;AAAA,MACvB,eAAe;AAAA,QACb;AAAA,UACE,UAAU;AAAA,YACR,YAAYC,cAAa;AAAA,cACvB,gBAAgB;AAAA,cAChB,GAAG;AAAA,YACL,CAAC;AAAA,UACH;AAAA,UACA,YAAY,CAAC,EAAE,OAAO,uBAAuB,OAAO,MAAM,CAAC;AAAA,QAC7D;AAAA,MACF;AAAA,IACF;AACA,UAAM,MAAM,GAAG,SAAS,QAAQ,QAAQ,EAAE,CAAC;AAC3C,QAAI;AACF,YAAM,MAAM,KAAK;AAAA,QACf,QAAQ;AAAA,QACR,SAAS;AAAA,UACP,gBAAgB;AAAA,UAChB,GAAG;AAAA,QACL;AAAA,QACA,MAAM,KAAK,UAAU,IAAI;AAAA,MAC3B,CAAC;AAAA,IACH,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,sBAA8C;AACrD,MAAI,OAAO,YAAY,YAAa,QAAO,CAAC;AAC5C,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,CAAC,IAAK,QAAO,CAAC;AAClB,QAAM,MAA8B,CAAC;AACrC,aAAW,QAAQ,IAAI,MAAM,GAAG,GAAG;AACjC,UAAM,KAAK,KAAK,QAAQ,GAAG;AAC3B,QAAI,KAAK,EAAG;AACZ,UAAM,MAAM,KAAK,MAAM,GAAG,EAAE,EAAE,KAAK;AACnC,UAAM,QAAQ,KAAK,MAAM,KAAK,CAAC,EAAE,KAAK;AACtC,QAAI,IAAK,KAAI,GAAG,IAAI;AAAA,EACtB;AACA,SAAO;AACT;AAEA,SAAS,WAAW,MAAgC;AAClD,QAAM,UAAU,KAAK,WAAW,KAAK;AACrC,QAAM,QAAmD;AAAA,IACvD,aAAa,KAAK;AAAA,EACpB;AACA,MAAI,KAAK,MAAO,OAAM,WAAW,IAAI,KAAK;AAC1C,MAAI,KAAK,gBAAgB,OAAW,OAAM,kBAAkB,IAAI,KAAK;AACrE,MAAI,KAAK,iBAAiB,OAAW,OAAM,mBAAmB,IAAI,KAAK;AACvE,MAAI,KAAK,YAAY,OAAW,OAAM,cAAc,IAAI,KAAK;AAC7D,MAAI,KAAK,YAAY;AACnB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,UAAU,GAAG;AACpD,UAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,OAAO,MAAM,UAAW,OAAM,CAAC,IAAI;AAAA,IAC3F;AAAA,EACF;AACA,SAAO;AAAA,IACL,SAAS,WAAW,KAAK,OAAO;AAAA,IAChC,QAAQC,WAAU,KAAK,MAAM;AAAA,IAC7B,cAAc,KAAK,eAAeA,WAAU,KAAK,YAAY,IAAI;AAAA,IACjE,MAAM,KAAK;AAAA,IACX,MAAM;AAAA;AAAA,IACN,mBAAmBC,QAAO,KAAK,SAAS;AAAA,IACxC,iBAAiBA,QAAO,OAAO;AAAA,IAC/B,YAAYF,cAAa,KAAK;AAAA,IAC9B,QAAQ,KAAK,WAAW,UAAU,EAAE,MAAM,GAAG,SAAS,KAAK,MAAM,IAAI,EAAE,MAAM,EAAE;AAAA,EACjF;AACF;AAEA,SAASA,cAAa,QAA2E;AAC/F,SAAO,OAAO,QAAQ,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO;AAAA,IACnD;AAAA,IACA,OACE,OAAO,UAAU,WACb,OAAO,UAAU,KAAK,IACpB,EAAE,UAAU,MAAM,SAAS,EAAE,IAC7B,EAAE,aAAa,MAAM,IACvB,OAAO,UAAU,YACf,EAAE,WAAW,MAAM,IACnB,EAAE,aAAa,MAAM;AAAA,EAC/B,EAAE;AACJ;AAEA,SAASE,QAAO,IAAoB;AAClC,UAAQ,OAAO,KAAK,MAAM,EAAE,CAAC,IAAI,UAAY,SAAS;AACxD;AAEA,SAASD,WAAU,IAAoB;AACrC,QAAM,UAAU,GAAG,QAAQ,MAAM,EAAE;AACnC,SAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,OAAO,IAAI,GAAG;AAC5C;AAEA,SAAS,WAAW,IAAoB;AACtC,QAAM,UAAU,GAAG,QAAQ,MAAM,EAAE;AACnC,SAAO,QAAQ,MAAM,GAAG,EAAE,EAAE,OAAO,IAAI,GAAG;AAC5C;;;AC1LA,SAAS,aAAa,cAAc,UAAU,qBAAqB;AACnE,SAAS,YAAY;AA0Ed,SAAS,yBACd,QACA,SACA,OAAgC,CAAC,GACb;AACpB,QAAM,UAA8B,MAAM,QAAQ,MAAM,IACpD,CAAC,GAAG,MAAM,IACV,OAAO,WAAW,WAChB,CAAC,EAAE,MAAM,QAAQ,QAAQ,SAAS,CAAC,IACnC,CAAC,MAA0B;AAEjC,QAAM,qBAAqB,KAAK,eAAe;AAC/C,QAAM,qBAAqB,KAAK,uBAAuB,OAAO,CAAC;AAC/D,QAAM,gBAAgB,KAAK,kBAAkB,OAAO,CAAC;AAErD,QAAM,QAAkB,CAAC;AACzB,MAAI,YAAY;AAChB,MAAI,WAAW;AACf,MAAI,YAAY;AAChB,MAAI,iBAAiB;AAErB,aAAW,OAAO,SAAS;AACzB,UAAM,cAAc,IAAI,eAAe;AACvC,UAAM,WACJ,IAAI,WAAW,SACX,CAAC,EAAE,OAAO,UAAU,KAAK,IAAI,KAAK,CAAC,IACnC,UAAU,IAAI,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,MAAM,KAAK,KAAK,IAAI,MAAM,IAAI,EAAE,EAAE;AAEpF,eAAW,QAAQ,UAAU;AAC3B,UAAI;AACF,cAAM,SAAS,YAAY;AAAA,UACzB,SAAS,KAAK;AAAA,UACd;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AACD,mBAAW,QAAQ,OAAO,MAAO,OAAM,KAAK,IAAI;AAChD,qBAAa,OAAO;AACpB,oBAAY,OAAO;AACnB,qBAAa;AAAA,MACf,SAAS,KAAK;AACZ,gBAAQ;AAAA,UACN,yBAAyB,KAAK,KAAK,KAAK,KAAK,GAAG,cAAc,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,QAChH;AACA,0BAAkB;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AAEA,gBAAc,SAAS,MAAM,KAAK,IAAI,KAAK,MAAM,SAAS,IAAI,OAAO,GAAG;AACxE,SAAO,EAAE,WAAW,UAAU,WAAW,eAAe;AAC1D;AAQA,SAAS,YAAY,MAKC;AACpB,QAAM,EAAE,SAAS,aAAa,oBAAoB,cAAc,IAAI;AACpE,QAAM,QAAkB,CAAC;AACzB,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,QAAM,OAAO,iBAAoC,SAAS,QAAQ,OAAO;AACzE,QAAM,QAAQ,iBAAqC,SAAS,SAAS,QAAQ;AAC7E,QAAM,SAAS,WAAuB,SAAS,QAAQ;AAEvD,QAAM,aAAa,oBAAI,IAAiB;AACxC,aAAW,KAAK,KAAM,YAAW,IAAI,EAAE,OAAO,CAAC;AAC/C,QAAM,eAAe,oBAAI,IAAkB;AAC3C,aAAW,KAAK,MAAO,cAAa,IAAI,EAAE,QAAQ,CAAC;AACnD,QAAM,iBAAiB,oBAAI,IAA0B;AAMrD,aAAW,KAAK,QAAQ;AACtB,QAAI,EAAE,SAAS,oBAAoB,EAAE,WAAW,OAAO,EAAE,YAAY,UAAU;AAC7E,YAAM,SAAU,EAAE,QAAoC;AACtD,UAAI,WAAW,OAAO;AACpB,cAAM,MAAO,EAAE,QAA0B;AACzC,YAAI,KAAK,MAAO,YAAW,IAAI,IAAI,OAAO,GAAG;AAC7C;AAAA,MACF;AACA,UAAI,WAAW,cAAc;AAC3B,cAAM,QAAS,EAAE,QAAqC;AACtD,YAAI,SAAS,EAAE,OAAO;AACpB,gBAAM,QAAQ,WAAW,IAAI,EAAE,KAAK;AACpC,cAAI,MAAO,YAAW,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,GAAG,MAAM,CAAC;AAAA,QAC3D;AACA;AAAA,MACF;AACA,UAAI,WAAW,QAAQ;AACrB,cAAM,OAAQ,EAAE,QAA4B;AAC5C,YAAI,MAAM,OAAQ,cAAa,IAAI,KAAK,QAAQ,IAAI;AACpD;AAAA,MACF;AACA,UAAI,WAAW,eAAe;AAC5B,cAAM,SAAU,EAAE,QAAgC;AAClD,cAAM,QAAS,EAAE,QAAsC;AACvD,YAAI,UAAU,OAAO;AACnB,gBAAM,QAAQ,aAAa,IAAI,MAAM;AACrC,cAAI,MAAO,cAAa,IAAI,QAAQ,EAAE,GAAG,OAAO,GAAG,MAAM,CAAS;AAAA,QACpE;AACA;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,EAAE,OAAQ;AACf,UAAM,MAAM,eAAe,IAAI,EAAE,MAAM,KAAK,CAAC;AAC7C,QAAI,KAAK,CAAC;AACV,mBAAe,IAAI,EAAE,QAAQ,GAAG;AAAA,EAClC;AAEA,aAAW,OAAO,WAAW,OAAO,GAAG;AACrC,UAAM,UAAUE,YAAW,IAAI,KAAK;AACpC,UAAM,YAAY,IAAI,aAAa,IAAI;AACvC,UAAM,iBAAiB;AAAA,MACrB,YAAY;AAAA,QACV,gBAAgB;AAAA,QAChB,cAAc;AAAA,QACd,UAAU,IAAI;AAAA,QACd,cAAc,IAAI;AAAA,QAClB,GAAG,mBAAmB,GAAG;AAAA,MAC3B;AAAA,IACF;AAEA,UAAM,YAAYC,WAAU,OAAO,IAAI,KAAK,EAAE;AAC9C,UAAM,WAAW,QAAQ,IAAI,SAAS;AACtC,UAAM,SAAS,QAAQ,IAAI,WAAW,IAAI,SAAS;AACnD,UAAM,YACJ,IAAI,SAAS,gBAAgB,IAAI,QAAQ,iBAAiB,YACtD,sBACA;AACN,UAAM,WAAoC;AAAA,MACxC,2BAA2B;AAAA,MAC3B,cAAc;AAAA,MACd,uBAAuB;AAAA,MACvB,GAAG,cAAc,GAAG;AAAA,IACtB;AACA,UAAM;AAAA,MACJ,KAAK;AAAA,QACH,OAAO;AAAA,UACL;AAAA,UACA,QAAQ;AAAA,UACR,cAAc;AAAA,UACd,MAAM,OAAO,SAAS;AAAA,UACtB,MAAM;AAAA,UACN,WAAW;AAAA,UACX,SAAS;AAAA,UACT,YAAY;AAAA,UACZ,eAAe,IAAI,SAAS,SAAS;AAAA,UACrC,UAAU;AAAA,UACV,YAAY;AAAA,QACd,CAAC;AAAA,MACH;AAAA,IACF;AACA,gBAAY;AAEZ,eAAW,QAAQ,aAAa,OAAO,GAAG;AACxC,UAAI,KAAK,UAAU,IAAI,MAAO;AAC9B,YAAM,YAAY,iBAAiB,MAAM,eAAe,IAAI,KAAK,MAAM,KAAK,CAAC,CAAC;AAC9E,YAAM,aAAa,KAAK,WAAW,UAAU,sBAAsB;AACnE,YAAM;AAAA,QACJ,KAAK;AAAA,UACH,OAAO;AAAA,YACL;AAAA,YACA,QAAQA,WAAU,KAAK,MAAM;AAAA,YAC7B,cAAc,KAAK,eAAeA,WAAU,KAAK,YAAY,IAAI;AAAA,YACjE,MAAM,KAAK;AAAA,YACX,MAAM,mBAAmB,KAAK,IAAI;AAAA,YAClC,WAAW,QAAQ,KAAK,SAAS;AAAA,YACjC,SAAS,QAAQ,KAAK,WAAW,KAAK,SAAS;AAAA,YAC/C;AAAA,YACA,eAAe,KAAK,SAAS;AAAA,YAC7B,UAAU;AAAA,YACV,YAAY;AAAA,UACd,CAAC;AAAA,QACH;AAAA,MACF;AACA,mBAAa;AAAA,IACf;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,UAAU,UAAU;AACtC;AAEA,SAAS,UAAU,MAAwB;AACzC,MAAI;AACF,WAAO,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,EAC7C,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,EAC7B,IAAI,CAAC,MAAM,EAAE,IAAI,EACjB,KAAK;AAAA,EACV,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACF;AAOA,SAAS,WAAc,SAAiB,MAAmB;AACzD,MAAI;AACJ,MAAI;AACF,cAAU,YAAY,OAAO;AAAA,EAC/B,QAAQ;AACN,WAAO,CAAC;AAAA,EACV;AACA,QAAM,SAAS,QACZ,OAAO,CAAC,OAAO,MAAM,GAAG,IAAI,aAAa,EAAE,WAAW,GAAG,IAAI,GAAG,MAAM,EAAE,SAAS,SAAS,CAAC,EAC3F,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,KAAK,SAAS,CAAC,EAAE,EAAE,EAChD,IAAI,CAAC,MAAM;AACV,QAAI,QAAQ;AACZ,QAAI;AACF,cAAQ,SAAS,EAAE,IAAI,EAAE;AAAA,IAC3B,QAAQ;AAAA,IAER;AACA,WAAO,EAAE,GAAG,GAAG,MAAM;AAAA,EACvB,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAEnE,QAAM,OAAY,CAAC;AACnB,aAAW,SAAS,QAAQ;AAC1B,QAAI;AACJ,QAAI;AACF,aAAO,aAAa,MAAM,MAAM,OAAO;AAAA,IACzC,QAAQ;AACN;AAAA,IACF;AACA,eAAW,QAAQ,KAAK,MAAM,IAAI,GAAG;AACnC,YAAM,UAAU,KAAK,KAAK;AAC1B,UAAI,CAAC,QAAS;AACd,UAAI;AACF,aAAK,KAAK,KAAK,MAAM,OAAO,CAAM;AAAA,MACpC,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAOA,SAAS,iBACP,SACA,MACA,OACK;AACL,QAAM,OAAO,WAAc,SAAS,IAAI;AACxC,QAAM,OAAO,oBAAI,IAAe;AAChC,aAAW,OAAO,MAAM;AACtB,UAAM,KAAK,IAAI,KAAK;AACpB,QAAI,CAAC,GAAI;AACT,UAAM,QAAQ,KAAK,IAAI,EAAE;AACzB,QAAI,SAAS,IAAI,SAAS;AACxB,WAAK,IAAI,IAAI,EAAE,GAAG,OAAO,GAAG,KAAK,SAAS,OAAU,CAAM;AAAA,IAC5D,OAAO;AACL,WAAK,IAAI,IAAI,GAAG;AAAA,IAClB;AAAA,EACF;AACA,SAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAC1B;AAEA,SAAS,iBAAiB,MAAY,QAA+C;AACnF,QAAM,QAAiC;AAAA,IACrC,2BAA2B,4BAA4B,KAAK,IAAI;AAAA,EAClE;AACA,MAAI,KAAK,SAAS,OAAO;AACvB,UAAM,gBAAgB,IAAI,KAAK;AAC/B,QAAI,KAAK,gBAAgB,OAAW,OAAM,wBAAwB,IAAI,KAAK;AAC3E,QAAI,KAAK,iBAAiB,OAAW,OAAM,4BAA4B,IAAI,KAAK;AAChF,QAAI,KAAK,YAAY,OAAW,OAAM,cAAc,IAAI,KAAK;AAC7D,QAAI,KAAK,aAAc,OAAM,mBAAmB,IAAI,KAAK;AACzD,QAAI,MAAM,QAAQ,KAAK,QAAQ,GAAG;AAChC,YAAM,oBAAoB,IAAI,KAAK,UAAU,KAAK,SAAS,MAAM,EAAE,CAAC;AAAA,IACtE;AACA,QAAI,OAAO,KAAK,WAAW,UAAU;AACnC,YAAM,qBAAqB,IAAI,KAAK,UAAU,CAAC,EAAE,MAAM,aAAa,SAAS,KAAK,OAAO,CAAC,CAAC;AAAA,IAC7F;AAAA,EACF,WAAW,KAAK,SAAS,QAAQ;AAC/B,UAAM,WAAW,IAAI,KAAK;AAC1B,QAAI,KAAK,cAAc,OAAW,OAAM,iBAAiB,IAAI,KAAK;AAClE,UAAM,aAAa,IAAI,cAAc,KAAK,IAAI;AAC9C,QAAI,KAAK,WAAW,OAAW,OAAM,cAAc,IAAI,cAAc,KAAK,MAAM;AAAA,EAClF,WAAW,KAAK,SAAS,SAAS;AAChC,UAAM,UAAU,IAAI,KAAK;AACzB,UAAM,iBAAiB,IAAI,KAAK;AAChC,UAAM,aAAa,IAAI,KAAK;AAC5B,UAAM,sBAAsB,IAAI,KAAK;AAAA,EACvC;AACA,MAAI,KAAK,YAAY;AACnB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,KAAK,UAAU,GAAG;AACpD,YAAM,cAAc,CAAC,EAAE,IAAI;AAAA,IAC7B;AAAA,EACF;AACA,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,wBAAwB,IAAI,OAAO;AACzC,UAAM,wBAAwB,IAAI,KAAK,UAAU,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AAAA,EAC5E;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAA4B;AACtD,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAEA,SAAS,4BAA4B,MAA4B;AAC/D,UAAQ,MAAM;AAAA,IACZ,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO;AAAA,IACT;AACE,aAAO;AAAA,EACX;AACF;AAgBA,SAAS,OAAO,MAAgC;AAC9C,SAAO;AAAA,IACL,UAAU,KAAK;AAAA,IACf,SAAS,KAAK;AAAA,IACd,gBAAgB,KAAK;AAAA,IACrB,MAAM,KAAK;AAAA,IACX,MAAM,KAAK;AAAA,IACX,YAAY,KAAK;AAAA,IACjB,UAAU,KAAK;AAAA,IACf,QAAQ,EAAE,MAAM,KAAK,YAAY,SAAS,KAAK,cAAc;AAAA,IAC7D,UAAU,KAAK;AAAA,IACf,YAAY,KAAK;AAAA,EACnB;AACF;AAEA,SAAS,QAAQ,IAAoB;AACnC,MAAI,CAAC,OAAO,SAAS,EAAE,KAAK,MAAM,EAAG,SAAO,oBAAI,KAAK,CAAC,GAAE,YAAY;AACpE,SAAO,IAAI,KAAK,EAAE,EAAE,YAAY;AAClC;AAIA,SAASA,WAAU,IAAoB;AACrC,QAAM,UAAU,GAAG,QAAQ,eAAe,EAAE,EAAE,YAAY;AAC1D,MAAI,QAAQ,UAAU,GAAI,QAAO,QAAQ,MAAM,GAAG,EAAE;AACpD,SAAO,YAAY,EAAE;AACvB;AAGA,SAASD,YAAW,IAAoB;AACtC,QAAM,UAAU,GAAG,QAAQ,eAAe,EAAE,EAAE,YAAY;AAC1D,MAAI,QAAQ,UAAU,GAAI,QAAO,QAAQ,MAAM,GAAG,EAAE;AACpD,SAAO,YAAY,EAAE;AACvB;AAEA,SAAS,YAAY,GAAmB;AACtC,MAAI,KAAK;AACT,aAAW,MAAM,GAAG;AAClB,UAAM,GAAG,WAAW,CAAC;AACrB,SAAK,KAAK,KAAK,IAAI,QAAU,MAAM;AAAA,EACrC;AACA,QAAM,OAAO,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG;AAC5C,UAAQ,OAAO,MAAM,MAAM,GAAG,EAAE;AAClC;AAEA,SAAS,YAAY,GAAmB;AACtC,SAAO,YAAY,CAAC,IAAI,YAAY,GAAG,CAAC,SAAS,EAAE,MAAM,GAAG,EAAE;AAChE;AAEA,SAAS,cAAc,OAAwB;AAC7C,MAAI;AACF,WAAO,OAAO,UAAU,WAAW,QAAQ,KAAK,UAAU,KAAK;AAAA,EACjE,QAAQ;AACN,WAAO,OAAO,KAAK;AAAA,EACrB;AACF;;;ACheO,IAAM,uBAAN,cAAmC,YAAY;AAAA,EACpD,YACkB,KACAE,aAChB,SACA;AACA,UAAM,WAAW,yBAAyB,GAAG,SAASA,WAAU,GAAG;AAJnD;AACA,sBAAAA;AAAA,EAIlB;AAAA,EALkB;AAAA,EACA;AAKpB;AAuBO,IAAM,cAAN,MAAM,aAAY;AAAA,EACf,QAAQ,oBAAI,IAA8B;AAAA,EAC1C,UAAU;AAAA,EACV,aAAqC,CAAC;AAAA,EACtC,UAAkC,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA,EAM3C,aAAa,SACX,MACA,SAA8C,CAAC,GACzB;AACtB,QAAI,CAAC,KAAK,MAAM;AACd,YAAM,IAAI,YAAY,oEAAoE;AAAA,IAC5F;AACA,UAAM,SAAS,MAAM,KAAK,KAAK,MAAM;AACrC,WAAO,aAAY,WAAW,MAAM;AAAA,EACtC;AAAA;AAAA,EAGA,aAAa,WAAW,QAAkD;AACxE,UAAM,QAAQ,IAAI,aAAY;AAI9B,UAAM,SAAS,oBAAI,IAAkE;AACrF,eAAW,KAAK,QAAQ;AACtB,YAAM,IAAI,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,YAAY;AAChE,YAAM,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC;AAC5B,UAAI,EAAE,cAAc,UAAW,GAAE,MAAM;AAAA,UAClC,GAAE,MAAM;AACb,aAAO,IAAI,GAAG,CAAC;AAAA,IACjB;AACA,eAAW,KAAK,OAAO,OAAO,GAAG;AAC/B,UAAI,CAAC,EAAE,IAAK;AACZ,UAAI,CAAC,EAAE,KAAK;AACV,cAAM,WAAW;AACjB;AAAA,MACF;AACA,YAAM,MAAM,MAAM,WAAW,EAAE,GAAG;AAClC,YAAM,MAAM,IAAI,KAAK,EAAE,SAAS,EAAE,KAAK,UAAU,EAAE,IAAI,CAAC;AACxD,YAAM,WAAW,EAAE,IAAI,QAAQ,KAAK,MAAM,WAAW,EAAE,IAAI,QAAQ,KAAK,KAAK;AAC7E,YAAM,QAAQ,EAAE,IAAI,KAAK,KAAK,MAAM,QAAQ,EAAE,IAAI,KAAK,KAAK,KAAK;AAAA,IACnE;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,OAAe;AACb,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA,EAEA,QAA0B;AACxB,WAAO;AAAA,MACL,OAAO,KAAK,MAAM;AAAA,MAClB,YAAY,EAAE,GAAG,KAAK,WAAW;AAAA,MACjC,SAAS,EAAE,GAAG,KAAK,QAAQ;AAAA,MAC3B,gBAAgB,KAAK;AAAA,IACvB;AAAA,EACF;AAAA;AAAA,EAGA,CAAC,UAA8C;AAC7C,eAAW,SAAS,KAAK,MAAM,OAAO,EAAG,OAAM;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,OAAO,aAA6D;AACxE,UAAM,MAAM,MAAM,YAAY,WAAW;AACzC,WAAO,KAAK,MAAM,IAAI,GAAG;AAAA,EAC3B;AACF;AA2BO,SAAS,kBAAkB,OAAoB,OAA2B,CAAC,GAAiB;AACjG,QAAM,SAAS,KAAK,UAAU;AAC9B,QAAM,WAAW,KAAK,iBAAiB,WAAW,OAAO,KAAK,UAAU;AAExE,UAAQ,OAAO,OAA0B,SAAuB;AAC9D,UAAM,MACJ,OAAO,UAAU,WAAW,QAAQ,iBAAiB,MAAM,MAAM,SAAS,IAAI,MAAM;AACtF,QAAI,CAAC,kCAAkC,KAAK,GAAG,GAAG;AAChD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,qCAAqC,GAAG;AAAA,QAC1C;AACF,aAAO,SAAS,OAAsB,IAAI;AAAA,IAC5C;AACA,QAAI;AACJ,QAAI,MAAM,QAAQ,OAAO,KAAK,SAAS,UAAU;AAC/C,UAAI;AACF,qBAAa,KAAK,MAAM,KAAK,IAAI;AAAA,MACnC,QAAQ;AAAA,MAER;AAAA,IACF;AACA,UAAM,MAAM,eAAe,SAAY,SAAY,MAAM,MAAM,OAAO,UAAU;AAChF,QAAI,KAAK;AACP,WAAK,QAAQ,EAAE,KAAK,UAAU,IAAI,QAAQ,UAAU,OAAO,IAAI,QAAQ,MAAM,CAAC;AAC9E,YAAM,SAAS,IAAI,SAAS,cAAc;AAC1C,YAAM,UAAU,IAAI;AAAA,QAClB,OAAO,QAAQ,IAAI,SAAS,mBAAmB,EAAE,gBAAgB,mBAAmB,CAAC;AAAA,MACvF;AACA,YAAM,WACJ,OAAO,IAAI,SAAS,iBAAiB,WACjC,IAAI,SAAS,eACb,KAAK,UAAU,IAAI,SAAS,gBAAgB,CAAC,CAAC;AACpD,aAAO,IAAI,SAAS,UAAU,EAAE,QAAQ,QAAQ,CAAC;AAAA,IACnD;AACA,SAAK,eAAe,EAAE,KAAK,aAAa,WAAW,CAAC;AACpD,QAAI,WAAW,SAAS;AACtB,YAAM,MAAM,eAAe,SAAY,kBAAkB,MAAM,YAAY,UAAU;AACrF,YAAM,IAAI,qBAAqB,KAAK,GAAG;AAAA,IACzC;AACA,QAAI,WAAW,eAAe;AAC5B,aAAO,IAAI,SAAS,KAAK,UAAU,EAAE,OAAO,oBAAoB,CAAC,GAAG,EAAE,QAAQ,IAAI,CAAC;AAAA,IACrF;AACA,QAAI,CAAC;AACH,YAAM,IAAI,YAAY,+DAA+D;AACvF,WAAO,SAAS,OAAsB,IAAI;AAAA,EAC5C;AACF;AAOA,gBAAuB,gBACrB,MACA,SAA8C,CAAC,GACb;AAClC,MAAI,CAAC,KAAK,MAAM;AACd,UAAM,IAAI,YAAY,8CAA8C;AAAA,EACtE;AACA,QAAM,SAAS,MAAM,KAAK,KAAK,MAAM;AACrC,QAAM,QAAQ,MAAM,YAAY,WAAW,MAAM;AACjD,aAAW,SAAS,MAAM,QAAQ,EAAG,OAAM;AAC7C;AAYA,eAAe,WAAW,OAA0C;AAClE,SAAO,YAAY,MAAM,WAAW;AACtC;AAEA,eAAe,YAAY,MAAgC;AACzD,MAAI,QAAQ,QAAQ,OAAO,SAAS,SAAU,QAAO,SAAS,EAAE,KAAK,OAAO,IAAI,EAAE,CAAC;AACnF,QAAM,IAAI;AACV,QAAM,UAAU,aAAa;AAAA,IAC3B,OAAO,EAAE,SAAS;AAAA,IAClB,UAAU,EAAE,YAAY;AAAA,IACxB,aAAa,EAAE,eAAe;AAAA,IAC9B,YAAY,EAAE,cAAc;AAAA,IAC5B,uBAAuB,EAAE,yBAAyB;AAAA,IAClD,iBAAiB,EAAE,mBAAmB;AAAA,EACxC,CAAC;AACD,SAAO,SAAS,OAAO;AACzB;","names":["fetch","toAttributes","padSpanId","msToNs","padTraceId","padSpanId","requestKey"]}

package/dist/chunk-YGYXHNAQ.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/completion-verifier.ts","../src/produced-state.ts","../src/agent-profile.ts"],"sourcesContent":["/**\n * Completion verifier — the task-completion oracle.\n *\n * Answers the only eval question that is not a proxy: did the agent actually\n * COMPLETE the task — produce every required deliverable, persisted and\n * correct — rather than describe what should be done. A fluent transcript\n * that never produces the artifact scores zero here.\n *\n * Per requirement, a two-stage check:\n *   1. Structural — a produced item (vault artifact / approved proposal /\n *      tool call) of the right kind is matched against the requirement and\n *      carries non-empty content. Deterministic; no LLM.\n *   2. Correctness — only if structurally present AND the matched item\n *      carries content, one targeted check decides whether that item\n *      actually fulfils the requirement. A hallucinated artifact fails here;\n *      an absent one already failed stage 1.\n *\n * `completionRate` is satisfied / total. Quality dimensions are meaningless\n * on an incomplete task — callers gate on `fullyComplete` / `completionRate`\n * before scoring quality.\n */\n\nimport type { TCloud } from '@tangle-network/tcloud'\nimport type { Artifact } from './artifact-validator'\n\n/** What kind of produced state can satisfy a requirement structurally. */\nexport type SatisfiedBy = 'artifact' | 'proposal' | 'tool-call' | 'any'\n\nexport interface CompletionRequirement {\n  /** Stable id from the task gold (e.g. a persona's `expected_requirements[].req_id`). */\n  reqId: string\n  /** Human-readable description of the required deliverable. */\n  title: string\n  /** Optional kind/category hint, matched against a produced item's kind. */\n  category?: string\n  /** What produced state satisfies this requirement. Defaults to 'any'. */\n  satisfiedBy?: SatisfiedBy\n}\n\nexport interface TaskGold {\n  taskId: string\n  requirements: CompletionRequirement[]\n}\n\nexport interface ProducedProposal {\n  id: string\n  title: string\n  status: 'pending' | 'approved' | 'rejected'\n  /** Optional persisted body — when present, enables a correctness check. */\n  content?: string\n}\n\n/** Everything observable about what a run actually produced. */\nexport interface ProducedState {\n  /** Persisted vault artifacts. Reuses the shared `Artifact` shape. */\n  artifacts: Artifact[]\n  /** Proposals / filings the agent created. */\n  proposals: ProducedProposal[]\n  /** Names of tools the agent invoked. */\n  toolCalls: string[]\n}\n\nexport interface RequirementCheck {\n  reqId: string\n  title: string\n  /** A produced item of the right kind matched the requirement, non-empty. */\n  structurallyPresent: boolean\n  /**\n   * Whether the matched item actually fulfils the requirement. `null` when\n   * not structurally present, or when the matched item carries no content\n   * to assess.\n   */\n  correct: boolean | null\n  /** structurallyPresent && correct !== false. */\n  satisfied: boolean\n  /** Human-readable evidence for the verdict. */\n  evidence: string[]\n}\n\nexport interface CompletionVerdict {\n  taskId: string\n  requirements: RequirementCheck[]\n  /** satisfied / total requirements. */\n  completionRate: number\n  /** Every requirement satisfied. */\n  fullyComplete: boolean\n}\n\n/**\n * Decides whether a produced item's content actually fulfils a requirement.\n * Injected so the structural verifier stays pure and unit-testable; the\n * production implementation is `createLlmCorrectnessChecker`.\n */\nexport type CorrectnessChecker = (\n  requirement: CompletionRequirement,\n  content: string,\n) => Promise<{ correct: boolean; reason: string }>\n\nconst STOPWORDS = new Set([\n  'the',\n  'a',\n  'an',\n  'of',\n  'for',\n  'and',\n  'or',\n  'to',\n  'in',\n  'on',\n  'with',\n  'by',\n])\n\nconst MATCH_THRESHOLD = 0.5\nconst MIN_CONTENT_CHARS = 50\n\nfunction tokens(s: string): Set<string> {\n  return new Set(\n    s\n      .toLowerCase()\n      .split(/[^a-z0-9]+/)\n      .filter((t) => t.length > 1 && !STOPWORDS.has(t)),\n  )\n}\n\n/**\n * Recall of the requirement's tokens within a candidate's identifying text.\n * Recall, not Jaccard — a candidate's path/id legitimately carries extra\n * tokens the requirement does not name.\n */\nfunction tokenRecall(requirementText: string, candidateText: string): number {\n  const req = tokens(requirementText)\n  if (req.size === 0) return 0\n  const cand = tokens(candidateText)\n  let hit = 0\n  for (const t of req) if (cand.has(t)) hit++\n  return hit / req.size\n}\n\ninterface Candidate {\n  reqIndex: number\n  /** Unique key for a produced item — each item satisfies at most one requirement. */\n  itemKey: string\n  score: number\n  evidence: string\n  /** Content to correctness-check, or null when the matched item has none. */\n  content: string | null\n}\n\nfunction artifactCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  artifacts: Artifact[],\n): Candidate[] {\n  const reqText = `${req.title} ${req.category ?? ''}`\n  const out: Candidate[] = []\n  artifacts.forEach((a, i) => {\n    if ((a.content ?? '').trim().length < MIN_CONTENT_CHARS) return\n    let score = tokenRecall(reqText, `${a.path ?? ''} ${a.kind}`)\n    if (req.category && a.kind && req.category.toLowerCase() === a.kind.toLowerCase()) {\n      score = Math.max(score, 1)\n    }\n    if (score < MATCH_THRESHOLD) return\n    out.push({\n      reqIndex,\n      itemKey: `artifact:${i}`,\n      score,\n      evidence: `artifact '${a.path ?? a.kind}' matched (token recall ${score.toFixed(2)})`,\n      content: a.content ?? null,\n    })\n  })\n  return out\n}\n\nfunction proposalCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  proposals: ProducedProposal[],\n): Candidate[] {\n  const reqText = `${req.title} ${req.category ?? ''}`\n  const out: Candidate[] = []\n  for (const p of proposals) {\n    // Pending or rejected work is not a completed deliverable.\n    if (p.status !== 'approved') continue\n    const score = tokenRecall(reqText, p.title)\n    if (score < MATCH_THRESHOLD) continue\n    const body = p.content ?? ''\n    out.push({\n      reqIndex,\n      itemKey: `proposal:${p.id}`,\n      score,\n      evidence: `approved proposal '${p.title}' matched (token recall ${score.toFixed(2)})`,\n      content: body.trim().length >= MIN_CONTENT_CHARS ? body : null,\n    })\n  }\n  return out\n}\n\nfunction toolCallCandidates(\n  req: CompletionRequirement,\n  reqIndex: number,\n  toolCalls: string[],\n): Candidate[] {\n  const out: Candidate[] = []\n  toolCalls.forEach((name, i) => {\n    const score = tokenRecall(req.title, name)\n    if (score < MATCH_THRESHOLD) return\n    out.push({\n      reqIndex,\n      itemKey: `tool:${i}`,\n      score,\n      evidence: `tool call '${name}' matched (token recall ${score.toFixed(2)})`,\n      content: null,\n    })\n  })\n  return out\n}\n\n/**\n * Verify whether a run completed the task. `checkCorrectness` is injected —\n * `createLlmCorrectnessChecker` for production, a deterministic stub in tests.\n *\n * Throws on a gold spec with no requirements: an eval task that requires\n * nothing is a misconfiguration, not a vacuously-complete task.\n */\nexport async function verifyCompletion(\n  gold: TaskGold,\n  state: ProducedState,\n  checkCorrectness: CorrectnessChecker,\n): Promise<CompletionVerdict> {\n  if (gold.requirements.length === 0) {\n    throw new Error(\n      `verifyCompletion: task '${gold.taskId}' has no requirements — malformed gold spec`,\n    )\n  }\n\n  // Collect every above-threshold (requirement, produced-item) candidate, then\n  // assign greedily by descending score: each requirement and each produced\n  // item is used at most once. One deliverable fulfils one requirement.\n  const candidates: Candidate[] = []\n  gold.requirements.forEach((req, i) => {\n    const by = req.satisfiedBy ?? 'any'\n    if (by === 'artifact' || by === 'any') {\n      candidates.push(...artifactCandidates(req, i, state.artifacts))\n    }\n    if (by === 'proposal' || by === 'any') {\n      candidates.push(...proposalCandidates(req, i, state.proposals))\n    }\n    if (by === 'tool-call' || by === 'any') {\n      candidates.push(...toolCallCandidates(req, i, state.toolCalls))\n    }\n  })\n  candidates.sort((a, b) => b.score - a.score)\n\n  const assigned = new Map<number, Candidate>()\n  const itemTaken = new Set<string>()\n  for (const c of candidates) {\n    if (assigned.has(c.reqIndex) || itemTaken.has(c.itemKey)) continue\n    assigned.set(c.reqIndex, c)\n    itemTaken.add(c.itemKey)\n  }\n\n  const requirements: RequirementCheck[] = []\n  for (let i = 0; i < gold.requirements.length; i++) {\n    const req = gold.requirements[i]!\n    const match = assigned.get(i)\n    const evidence: string[] = []\n    let correct: boolean | null = null\n\n    if (match) {\n      evidence.push(match.evidence)\n      if (match.content !== null) {\n        const r = await checkCorrectness(req, match.content)\n        correct = r.correct\n        evidence.push(`correctness: ${r.correct ? 'pass' : 'fail'} — ${r.reason}`)\n      } else {\n        evidence.push('correctness: not assessed — matched item carries no content')\n      }\n    } else {\n      const by = req.satisfiedBy ?? 'any'\n      const kind = by === 'any' ? 'artifact/proposal/tool-call' : by\n      evidence.push(`no produced ${kind} matched this requirement`)\n    }\n\n    const structurallyPresent = match !== undefined\n    const satisfied = structurallyPresent && correct !== false\n    requirements.push({\n      reqId: req.reqId,\n      title: req.title,\n      structurallyPresent,\n      correct,\n      satisfied,\n      evidence,\n    })\n  }\n\n  const satisfiedCount = requirements.filter((r) => r.satisfied).length\n  return {\n    taskId: gold.taskId,\n    requirements,\n    completionRate: satisfiedCount / requirements.length,\n    fullyComplete: satisfiedCount === requirements.length,\n  }\n}\n\nexport interface LlmCorrectnessCheckerOpts {\n  model?: string\n  /** Max chars of artifact content sent to the checker. */\n  maxContentChars?: number\n}\n\n/** Parse the correctness checker's model response. Fails loud on a bad shape. */\nexport function parseCorrectnessResponse(raw: string): { correct: boolean; reason: string } {\n  const match = raw.match(/\\{[\\s\\S]*\\}/)\n  if (!match) {\n    throw new Error(`correctness checker: no JSON object in model response: ${raw.slice(0, 200)}`)\n  }\n  const parsed = JSON.parse(match[0]) as { correct?: unknown; reason?: unknown }\n  if (typeof parsed.correct !== 'boolean') {\n    throw new Error(`correctness checker: 'correct' is not a boolean in: ${match[0].slice(0, 200)}`)\n  }\n  return { correct: parsed.correct, reason: typeof parsed.reason === 'string' ? parsed.reason : '' }\n}\n\n/**\n * Production `CorrectnessChecker` — one LLM call per matched artifact,\n * deterministic (temperature 0), structured JSON out. Judges fulfilment\n * only: a plan, a gesture, or a description of what should be done does not\n * fulfil a requirement — the artifact must BE the deliverable.\n */\nexport function createLlmCorrectnessChecker(\n  tc: TCloud,\n  opts: LlmCorrectnessCheckerOpts = {},\n): CorrectnessChecker {\n  const model = opts.model ?? 'claude-sonnet-4-6'\n  const maxContentChars = opts.maxContentChars ?? 8000\n  return async (requirement, content) => {\n    const resp = await tc.chat({\n      model,\n      messages: [\n        {\n          role: 'system',\n          content:\n            'You verify whether a produced work artifact actually fulfils a stated requirement. Judge fulfilment only — is the deliverable substantively present and on-point — not polish. A plan to do it later, a vague gesture, or a description of what should be done does NOT fulfil a requirement; the artifact must BE the deliverable. Respond with a single JSON object: {\"correct\": boolean, \"reason\": string (<= 30 words)}.',\n        },\n        {\n          role: 'user',\n          content: `Requirement: ${requirement.title}\\n${\n            requirement.category ? `Category: ${requirement.category}\\n` : ''\n          }\\nProduced artifact:\\n${content.slice(0, maxContentChars)}`,\n        },\n      ],\n      temperature: 0,\n      maxTokens: 200,\n    })\n    const raw =\n      (resp as { choices?: { message?: { content?: string } }[] }).choices?.[0]?.message?.content ??\n      ''\n    return parseCorrectnessResponse(raw)\n  }\n}\n\n/** Stopwords for requirement-title tokenization — drops the imperative verbs\n *  ('review', 'update', …) common to deliverable titles so recall keys on the\n *  substantive nouns, not the boilerplate ask. */\nconst TITLE_STOPWORDS = new Set([\n  'the',\n  'a',\n  'an',\n  'and',\n  'or',\n  'for',\n  'to',\n  'of',\n  'in',\n  'on',\n  'with',\n  'review',\n  'update',\n  'new',\n  'proposed',\n])\n\n/**\n * Deterministic `CorrectnessChecker` — the no-LLM counterpart to\n * `createLlmCorrectnessChecker`. A produced item fulfils a requirement when its\n * content is substantive (≥ `minContentLength` chars) AND recalls ≥ `minRecall`\n * of the requirement title's significant tokens. No network — the default gate\n * for apps and tests without an LLM judge. Pass to `verifyCompletion` as the\n * checker.\n */\nexport function createTokenRecallChecker(\n  opts: { minRecall?: number; minContentLength?: number } = {},\n): CorrectnessChecker {\n  const minRecall = opts.minRecall ?? 0.5\n  const minLen = opts.minContentLength ?? 120\n  return async (requirement, content) => {\n    const body = content.trim()\n    if (body.length < minLen)\n      return {\n        correct: false,\n        reason: `content too thin (${body.length} chars) to be the deliverable`,\n      }\n    const titleTokens = requirement.title\n      .toLowerCase()\n      .split(/[^a-z0-9]+/)\n      .filter((t) => t.length > 2 && !TITLE_STOPWORDS.has(t))\n    if (titleTokens.length === 0)\n      return {\n        correct: true,\n        reason: 'requirement title has no significant tokens — structural match accepted',\n      }\n    const lower = body.toLowerCase()\n    const hits = titleTokens.filter((t) => lower.includes(t)).length\n    const recall = hits / titleTokens.length\n    return recall >= minRecall\n      ? {\n          correct: true,\n          reason: `content recalls ${hits}/${titleTokens.length} requirement tokens`,\n        }\n      : {\n          correct: false,\n          reason: `content recalls only ${hits}/${titleTokens.length} requirement tokens`,\n        }\n  }\n}\n","/**\n * Produced-state extraction — normalize a run's runtime event stream into the\n * typed `ProducedState` the completion oracle consumes.\n *\n * `ProducedState` answers \"what did the agent actually produce\" — vault\n * artifacts, proposals, tool calls. The runtime emits these as a stream of\n * events; this module is the single normalization point from that stream to\n * the shape `verifyCompletion` expects.\n *\n * Input is structurally typed (`RuntimeEventLike`) so this module does not\n * depend on agent-runtime — agent-runtime's `RuntimeStreamEvent` satisfies it\n * structurally. The `content` on `ArtifactEventLike` and the whole\n * `proposal_created` variant are the runtime-side enrichments this contract\n * requires; the runtime emits them, this module consumes them.\n */\n\nimport type { Artifact } from './artifact-validator'\nimport type { ProducedProposal, ProducedState } from './completion-verifier'\n\n/** A tool the agent invoked. */\nexport interface ToolCallEventLike {\n  type: 'tool_call'\n  toolName: string\n}\n\n/**\n * An artifact the agent produced. `content` is the enriched field — the\n * runtime's base `artifact` event carries only metadata; the completion\n * oracle needs the body to verify the deliverable, so the runtime emits it.\n */\nexport interface ArtifactEventLike {\n  type: 'artifact'\n  artifactId: string\n  name?: string\n  mimeType?: string\n  uri?: string\n  content?: string\n}\n\n/** A proposal / filing the agent created. */\nexport interface ProposalEventLike {\n  type: 'proposal_created'\n  proposalId: string\n  title: string\n  status?: 'pending' | 'approved' | 'rejected'\n}\n\n/**\n * The subset of runtime stream events `extractProducedState` consumes.\n * agent-runtime's full `RuntimeStreamEvent` union satisfies this structurally;\n * the `{ type: string }` catch-all keeps the input permissive so callers can\n * pass the whole unfiltered telemetry stream — unrecognized events are skipped.\n */\nexport type RuntimeEventLike =\n  | ToolCallEventLike\n  | ArtifactEventLike\n  | ProposalEventLike\n  | { type: string }\n\nfunction artifactKind(mimeType: string | undefined): string {\n  if (!mimeType) return 'file'\n  if (mimeType.includes('json')) return 'json'\n  if (mimeType.startsWith('text/')) return 'text'\n  return 'file'\n}\n\n/**\n * Normalize a run's runtime event stream into `ProducedState`.\n *\n * Pure and total — unrecognized event types are skipped. `toolCalls` is\n * deduplicated by name in first-seen order (completion cares about a tool's\n * presence, not its call count). An artifact with neither a name nor a uri\n * still yields an entry keyed by its `artifactId` so it is never silently\n * dropped; an artifact with no `content` yields empty content, which the\n * completion oracle's structural check then rejects on its own.\n */\nexport function extractProducedState(events: readonly RuntimeEventLike[]): ProducedState {\n  const artifacts: Artifact[] = []\n  const proposals: ProducedProposal[] = []\n  const toolCalls: string[] = []\n  const seenTools = new Set<string>()\n\n  for (const ev of events) {\n    if (ev.type === 'tool_call') {\n      const name = (ev as ToolCallEventLike).toolName\n      if (name && !seenTools.has(name)) {\n        seenTools.add(name)\n        toolCalls.push(name)\n      }\n    } else if (ev.type === 'artifact') {\n      const a = ev as ArtifactEventLike\n      artifacts.push({\n        kind: artifactKind(a.mimeType),\n        path: a.name ?? a.uri ?? a.artifactId,\n        content: a.content ?? '',\n      })\n    } else if (ev.type === 'proposal_created') {\n      const p = ev as ProposalEventLike\n      proposals.push({ id: p.proposalId, title: p.title, status: p.status ?? 'pending' })\n    }\n  }\n\n  return { artifacts, proposals, toolCalls }\n}\n","/**\n * @stable\n *\n * AgentProfile — the eval harness's unit of variation.\n *\n * A profile pins everything that changes agent behaviour for a benchmark\n * cell: the model, the active skills, the prompt version, the available\n * tools. Vary the profile — swap a model, add a skill — and re-run the suite\n * to benchmark the change. The scorecard keys a cell on\n * `(scenarioId, profileHash)`, so the model is not a separate axis: it lives\n * inside the profile, and two profiles with the same model but different\n * skills are different cells.\n *\n * `agentProfileHash` is the profile's behaviour identity. Two profiles that\n * produce the same agent behaviour share a hash (and a scorecard cell);\n * reordering `skills` or `tools` does not change it; the human-facing `id`\n * label does not affect it.\n */\n\nimport { createHash } from 'node:crypto'\nimport { ValidationError } from './errors'\nimport { canonicalize } from './pre-registration'\n\nexport interface AgentProfile {\n  /** Human-facing label, e.g. `sonnet-legal-skills-v3`. Not part of the hash. */\n  id: string\n  /** Model snapshot id this profile pins, e.g. `claude-sonnet-4-6@2025-04-15`. */\n  model: string\n  /** Skill ids/versions active in this profile — the primary behaviour lever. */\n  skills?: string[]\n  /** Prompt version identifier. */\n  promptVersion?: string\n  /** Tool ids available to the agent. */\n  tools?: string[]\n  /** Any other behaviour-bearing knobs that should fingerprint into the hash. */\n  metadata?: Record<string, string | number | boolean>\n}\n\n/**\n * Deterministic behaviour identity of a profile — a sha256 over the\n * behaviour-bearing fields. `skills` and `tools` are order-insensitive; the\n * `id` label is excluded. Throws on a profile with no `model` — an unkeyable\n * profile must fail loud rather than collapse into a blank-model cell.\n */\nexport function agentProfileHash(profile: AgentProfile): string {\n  if (typeof profile.model !== 'string' || profile.model.trim().length === 0) {\n    throw new ValidationError(`AgentProfile \"${profile.id}\" has no model — cannot hash`)\n  }\n  const behaviour = {\n    model: profile.model.trim(),\n    skills: [...(profile.skills ?? [])].sort(),\n    promptVersion: profile.promptVersion ?? null,\n    tools: [...(profile.tools ?? [])].sort(),\n    metadata: profile.metadata ?? {},\n  }\n  return createHash('sha256')\n    .update(JSON.stringify(canonicalize(behaviour)))\n    .digest('hex')\n}\n"],"mappings":";;;;;;;;AAkGA,IAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,kBAAkB;AACxB,IAAM,oBAAoB;AAE1B,SAAS,OAAO,GAAwB;AACtC,SAAO,IAAI;AAAA,IACT,EACG,YAAY,EACZ,MAAM,YAAY,EAClB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;AAAA,EACpD;AACF;AAOA,SAAS,YAAY,iBAAyB,eAA+B;AAC3E,QAAM,MAAM,OAAO,eAAe;AAClC,MAAI,IAAI,SAAS,EAAG,QAAO;AAC3B,QAAM,OAAO,OAAO,aAAa;AACjC,MAAI,MAAM;AACV,aAAW,KAAK,IAAK,KAAI,KAAK,IAAI,CAAC,EAAG;AACtC,SAAO,MAAM,IAAI;AACnB;AAYA,SAAS,mBACP,KACA,UACA,WACa;AACb,QAAM,UAAU,GAAG,IAAI,KAAK,IAAI,IAAI,YAAY,EAAE;AAClD,QAAM,MAAmB,CAAC;AAC1B,YAAU,QAAQ,CAAC,GAAG,MAAM;AAC1B,SAAK,EAAE,WAAW,IAAI,KAAK,EAAE,SAAS,kBAAmB;AACzD,QAAI,QAAQ,YAAY,SAAS,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE;AAC5D,QAAI,IAAI,YAAY,EAAE,QAAQ,IAAI,SAAS,YAAY,MAAM,EAAE,KAAK,YAAY,GAAG;AACjF,cAAQ,KAAK,IAAI,OAAO,CAAC;AAAA,IAC3B;AACA,QAAI,QAAQ,gBAAiB;AAC7B,QAAI,KAAK;AAAA,MACP;AAAA,MACA,SAAS,YAAY,CAAC;AAAA,MACtB;AAAA,MACA,UAAU,aAAa,EAAE,QAAQ,EAAE,IAAI,2BAA2B,MAAM,QAAQ,CAAC,CAAC;AAAA,MAClF,SAAS,EAAE,WAAW;AAAA,IACxB,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAEA,SAAS,mBACP,KACA,UACA,WACa;AACb,QAAM,UAAU,GAAG,IAAI,KAAK,IAAI,IAAI,YAAY,EAAE;AAClD,QAAM,MAAmB,CAAC;AAC1B,aAAW,KAAK,WAAW;AAEzB,QAAI,EAAE,WAAW,WAAY;AAC7B,UAAM,QAAQ,YAAY,SAAS,EAAE,KAAK;AAC1C,QAAI,QAAQ,gBAAiB;AAC7B,UAAM,OAAO,EAAE,WAAW;AAC1B,QAAI,KAAK;AAAA,MACP;AAAA,MACA,SAAS,YAAY,EAAE,EAAE;AAAA,MACzB;AAAA,MACA,UAAU,sBAAsB,EAAE,KAAK,2BAA2B,MAAM,QAAQ,CAAC,CAAC;AAAA,MAClF,SAAS,KAAK,KAAK,EAAE,UAAU,oBAAoB,OAAO;AAAA,IAC5D,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAEA,SAAS,mBACP,KACA,UACA,WACa;AACb,QAAM,MAAmB,CAAC;AAC1B,YAAU,QAAQ,CAAC,MAAM,MAAM;AAC7B,UAAM,QAAQ,YAAY,IAAI,OAAO,IAAI;AACzC,QAAI,QAAQ,gBAAiB;AAC7B,QAAI,KAAK;AAAA,MACP;AAAA,MACA,SAAS,QAAQ,CAAC;AAAA,MAClB;AAAA,MACA,UAAU,cAAc,IAAI,2BAA2B,MAAM,QAAQ,CAAC,CAAC;AAAA,MACvE,SAAS;AAAA,IACX,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AASA,eAAsB,iBACpB,MACA,OACA,kBAC4B;AAC5B,MAAI,KAAK,aAAa,WAAW,GAAG;AAClC,UAAM,IAAI;AAAA,MACR,2BAA2B,KAAK,MAAM;AAAA,IACxC;AAAA,EACF;AAKA,QAAM,aAA0B,CAAC;AACjC,OAAK,aAAa,QAAQ,CAAC,KAAK,MAAM;AACpC,UAAM,KAAK,IAAI,eAAe;AAC9B,QAAI,OAAO,cAAc,OAAO,OAAO;AACrC,iBAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;AAAA,IAChE;AACA,QAAI,OAAO,cAAc,OAAO,OAAO;AACrC,iBAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;AAAA,IAChE;AACA,QAAI,OAAO,eAAe,OAAO,OAAO;AACtC,iBAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,MAAM,SAAS,CAAC;AAAA,IAChE;AAAA,EACF,CAAC;AACD,aAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAE3C,QAAM,WAAW,oBAAI,IAAuB;AAC5C,QAAM,YAAY,oBAAI,IAAY;AAClC,aAAW,KAAK,YAAY;AAC1B,QAAI,SAAS,IAAI,EAAE,QAAQ,KAAK,UAAU,IAAI,EAAE,OAAO,EAAG;AAC1D,aAAS,IAAI,EAAE,UAAU,CAAC;AAC1B,cAAU,IAAI,EAAE,OAAO;AAAA,EACzB;AAEA,QAAM,eAAmC,CAAC;AAC1C,WAAS,IAAI,GAAG,IAAI,KAAK,aAAa,QAAQ,KAAK;AACjD,UAAM,MAAM,KAAK,aAAa,CAAC;AAC/B,UAAM,QAAQ,SAAS,IAAI,CAAC;AAC5B,UAAM,WAAqB,CAAC;AAC5B,QAAI,UAA0B;AAE9B,QAAI,OAAO;AACT,eAAS,KAAK,MAAM,QAAQ;AAC5B,UAAI,MAAM,YAAY,MAAM;AAC1B,cAAM,IAAI,MAAM,iBAAiB,KAAK,MAAM,OAAO;AACnD,kBAAU,EAAE;AACZ,iBAAS,KAAK,gBAAgB,EAAE,UAAU,SAAS,MAAM,WAAM,EAAE,MAAM,EAAE;AAAA,MAC3E,OAAO;AACL,iBAAS,KAAK,kEAA6D;AAAA,MAC7E;AAAA,IACF,OAAO;AACL,YAAM,KAAK,IAAI,eAAe;AAC9B,YAAM,OAAO,OAAO,QAAQ,gCAAgC;AAC5D,eAAS,KAAK,eAAe,IAAI,2BAA2B;AAAA,IAC9D;AAEA,UAAM,sBAAsB,UAAU;AACtC,UAAM,YAAY,uBAAuB,YAAY;AACrD,iBAAa,KAAK;AAAA,MAChB,OAAO,IAAI;AAAA,MACX,OAAO,IAAI;AAAA,MACX;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,iBAAiB,aAAa,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE;AAC/D,SAAO;AAAA,IACL,QAAQ,KAAK;AAAA,IACb;AAAA,IACA,gBAAgB,iBAAiB,aAAa;AAAA,IAC9C,eAAe,mBAAmB,aAAa;AAAA,EACjD;AACF;AASO,SAAS,yBAAyB,KAAmD;AAC1F,QAAM,QAAQ,IAAI,MAAM,aAAa;AACrC,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,0DAA0D,IAAI,MAAM,GAAG,GAAG,CAAC,EAAE;AAAA,EAC/F;AACA,QAAM,SAAS,KAAK,MAAM,MAAM,CAAC,CAAC;AAClC,MAAI,OAAO,OAAO,YAAY,WAAW;AACvC,UAAM,IAAI,MAAM,uDAAuD,MAAM,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,EAAE;AAAA,EACjG;AACA,SAAO,EAAE,SAAS,OAAO,SAAS,QAAQ,OAAO,OAAO,WAAW,WAAW,OAAO,SAAS,GAAG;AACnG;AAQO,SAAS,4BACd,IACA,OAAkC,CAAC,GACf;AACpB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,kBAAkB,KAAK,mBAAmB;AAChD,SAAO,OAAO,aAAa,YAAY;AACrC,UAAM,OAAO,MAAM,GAAG,KAAK;AAAA,MACzB;AAAA,MACA,UAAU;AAAA,QACR;AAAA,UACE,MAAM;AAAA,UACN,SACE;AAAA,QACJ;AAAA,QACA;AAAA,UACE,MAAM;AAAA,UACN,SAAS,gBAAgB,YAAY,KAAK;AAAA,EACxC,YAAY,WAAW,aAAa,YAAY,QAAQ;AAAA,IAAO,EACjE;AAAA;AAAA,EAAyB,QAAQ,MAAM,GAAG,eAAe,CAAC;AAAA,QAC5D;AAAA,MACF;AAAA,MACA,aAAa;AAAA,MACb,WAAW;AAAA,IACb,CAAC;AACD,UAAM,MACH,KAA4D,UAAU,CAAC,GAAG,SAAS,WACpF;AACF,WAAO,yBAAyB,GAAG;AAAA,EACrC;AACF;AAKA,IAAM,kBAAkB,oBAAI,IAAI;AAAA,EAC9B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAUM,SAAS,yBACd,OAA0D,CAAC,GACvC;AACpB,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,SAAS,KAAK,oBAAoB;AACxC,SAAO,OAAO,aAAa,YAAY;AACrC,UAAM,OAAO,QAAQ,KAAK;AAC1B,QAAI,KAAK,SAAS;AAChB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ,qBAAqB,KAAK,MAAM;AAAA,MAC1C;AACF,UAAM,cAAc,YAAY,MAC7B,YAAY,EACZ,MAAM,YAAY,EAClB,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,gBAAgB,IAAI,CAAC,CAAC;AACxD,QAAI,YAAY,WAAW;AACzB,aAAO;AAAA,QACL,SAAS;AAAA,QACT,QAAQ;AAAA,MACV;AACF,UAAM,QAAQ,KAAK,YAAY;AAC/B,UAAM,OAAO,YAAY,OAAO,CAAC,MAAM,MAAM,SAAS,CAAC,CAAC,EAAE;AAC1D,UAAM,SAAS,OAAO,YAAY;AAClC,WAAO,UAAU,YACb;AAAA,MACE,SAAS;AAAA,MACT,QAAQ,mBAAmB,IAAI,IAAI,YAAY,MAAM;AAAA,IACvD,IACA;AAAA,MACE,SAAS;AAAA,MACT,QAAQ,wBAAwB,IAAI,IAAI,YAAY,MAAM;AAAA,IAC5D;AAAA,EACN;AACF;;;AC9WA,SAAS,aAAa,UAAsC;AAC1D,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI,SAAS,SAAS,MAAM,EAAG,QAAO;AACtC,MAAI,SAAS,WAAW,OAAO,EAAG,QAAO;AACzC,SAAO;AACT;AAYO,SAAS,qBAAqB,QAAoD;AACvF,QAAM,YAAwB,CAAC;AAC/B,QAAM,YAAgC,CAAC;AACvC,QAAM,YAAsB,CAAC;AAC7B,QAAM,YAAY,oBAAI,IAAY;AAElC,aAAW,MAAM,QAAQ;AACvB,QAAI,GAAG,SAAS,aAAa;AAC3B,YAAM,OAAQ,GAAyB;AACvC,UAAI,QAAQ,CAAC,UAAU,IAAI,IAAI,GAAG;AAChC,kBAAU,IAAI,IAAI;AAClB,kBAAU,KAAK,IAAI;AAAA,MACrB;AAAA,IACF,WAAW,GAAG,SAAS,YAAY;AACjC,YAAM,IAAI;AACV,gBAAU,KAAK;AAAA,QACb,MAAM,aAAa,EAAE,QAAQ;AAAA,QAC7B,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE;AAAA,QAC3B,SAAS,EAAE,WAAW;AAAA,MACxB,CAAC;AAAA,IACH,WAAW,GAAG,SAAS,oBAAoB;AACzC,YAAM,IAAI;AACV,gBAAU,KAAK,EAAE,IAAI,EAAE,YAAY,OAAO,EAAE,OAAO,QAAQ,EAAE,UAAU,UAAU,CAAC;AAAA,IACpF;AAAA,EACF;AAEA,SAAO,EAAE,WAAW,WAAW,UAAU;AAC3C;;;ACpFA,SAAS,kBAAkB;AAyBpB,SAAS,iBAAiB,SAA+B;AAC9D,MAAI,OAAO,QAAQ,UAAU,YAAY,QAAQ,MAAM,KAAK,EAAE,WAAW,GAAG;AAC1E,UAAM,IAAI,gBAAgB,iBAAiB,QAAQ,EAAE,mCAA8B;AAAA,EACrF;AACA,QAAM,YAAY;AAAA,IAChB,OAAO,QAAQ,MAAM,KAAK;AAAA,IAC1B,QAAQ,CAAC,GAAI,QAAQ,UAAU,CAAC,CAAE,EAAE,KAAK;AAAA,IACzC,eAAe,QAAQ,iBAAiB;AAAA,IACxC,OAAO,CAAC,GAAI,QAAQ,SAAS,CAAC,CAAE,EAAE,KAAK;AAAA,IACvC,UAAU,QAAQ,YAAY,CAAC;AAAA,EACjC;AACA,SAAO,WAAW,QAAQ,EACvB,OAAO,KAAK,UAAU,aAAa,SAAS,CAAC,CAAC,EAC9C,OAAO,KAAK;AACjB;","names":[]}

package/dist/chunk-YV7J7X5N.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/rl/verifiable-reward.ts","../src/rl/reward-hacking.ts"],"sourcesContent":["/**\n * Verifiable reward channel.\n *\n * For RL on coding / math / theorem-proving / structured-output tasks, the\n * reward signal is *decidable* — a test passes or fails, a proof checks or\n * doesn't, an output validates against a schema or doesn't. These rewards\n * are dramatically more useful for RL training than LLM-judge scores\n * because they don't drift, can't be Goodhart-gamed by the policy in the\n * same way, and don't require a separate calibration loop.\n *\n * The `MultiLayerVerifier` already produces this signal — it just doesn't\n * surface it in a shape that's clean enough for RL training. This module\n * wraps the verifier output so consumers can:\n *\n *   1. Extract a clean `VerifiableReward` from a `VerificationReport`\n *   2. Distinguish *deterministic* rewards (compile, test, schema) from\n *      *probabilistic* rewards (judge) so they can be weighted differently\n *      in the RL training step\n *   3. Filter `RunRecord[]` to only those with a verifiable reward,\n *      producing the clean training set that DeepSeek-R1-style GRPO and\n *      AlphaProof-style search both depend on\n *\n * Why this matters: every credible 2025-2026 frontier RL result on coding\n * agents leans on verifiable reward (DeepSeek-R1 GRPO on test pass-rate,\n * o-series RL on math/code, AlphaProof on Lean kernel checking). Mixing\n * judge scores into the reward signal poisons the gradient. This module\n * is the seam.\n */\n\nimport type { LayerResult, VerificationReport } from '../multi-layer-verifier'\nimport type { RunRecord } from '../run-record'\n\nexport type VerifiableRewardSource =\n  | 'compile' // typecheck / build / lint passed\n  | 'test' // unit / integration test pass-rate\n  | 'schema' // structured output validates\n  | 'sandbox' // sandbox exec exit code\n  | 'judge' // LLM judge — probabilistic, included for completeness\n  | 'composite' // weighted blend across multiple of the above\n\nexport interface VerifiableReward {\n  /** Scalar in [0, 1]. The RL training signal. */\n  value: number\n  /** What produced the reward — different sources have different determinism. */\n  source: VerifiableRewardSource\n  /**\n   * Determinism class. `'deterministic'` rewards are repeatable byte-for-byte\n   * given the same inputs (compile, test, schema validation, sandbox exit code).\n   * `'probabilistic'` rewards depend on a stochastic component (LLM judge).\n   * Mixing these in the same training batch without separation is a known\n   * footgun in production RLHF pipelines.\n   */\n  determinism: 'deterministic' | 'probabilistic'\n  /**\n   * Confidence in the reward value. For deterministic sources this is 1.0\n   * (the bit either flipped or didn't). For judge sources this is the\n   * judge-reported confidence or — when missing — a calibrated prior.\n   */\n  confidence: number\n  /** The layer / judge id that produced the signal, for provenance. */\n  origin: string\n  /**\n   * Any per-source breakdown the consumer might want — e.g. `{ tests_passed: 7, tests_total: 10 }`.\n   */\n  breakdown?: Record<string, number>\n}\n\nexport interface VerifiableRewardExtractionOptions {\n  /**\n   * Which layers count as deterministic-reward sources. The verifier doesn't\n   * tag layers as \"this is verifiable\"; the caller declares it via this list\n   * (or via the layer name → source mapping). Default treats common names\n   * (`install`, `typecheck`, `build`, `lint`, `test`, `compile`, `schema`,\n   * `sandbox`) as deterministic.\n   */\n  deterministicLayers?: string[]\n  /**\n   * Map layer name → reward source. Defaults to a sensible string-match.\n   */\n  sourceFor?: (layerName: string) => VerifiableRewardSource\n  /**\n   * Whether to fall back to a probabilistic (judge) reward when no\n   * deterministic layer produced a numeric score. Default `true`. Set to\n   * `false` for \"deterministic-only\" training pipelines that should\n   * discard runs without a verifiable signal.\n   */\n  fallbackToJudge?: boolean\n  /**\n   * Default confidence for probabilistic (judge) rewards when the judge\n   * doesn't report one. Default `0.7`.\n   */\n  judgeConfidenceFloor?: number\n}\n\nconst DEFAULT_DETERMINISTIC_LAYERS = new Set([\n  'install',\n  'typecheck',\n  'build',\n  'lint',\n  'test',\n  'compile',\n  'schema',\n  'sandbox',\n  'unit_tests',\n  'integration_tests',\n])\n\nconst DEFAULT_SOURCE_FOR = (name: string): VerifiableRewardSource => {\n  const lower = name.toLowerCase()\n  if (lower.includes('test')) return 'test'\n  if (\n    lower.includes('compile') ||\n    lower.includes('build') ||\n    lower.includes('typecheck') ||\n    lower.includes('lint')\n  )\n    return 'compile'\n  if (lower.includes('schema')) return 'schema'\n  if (lower.includes('sandbox')) return 'sandbox'\n  if (lower.includes('judge') || lower.includes('semantic')) return 'judge'\n  return 'composite'\n}\n\n/**\n * Extract a `VerifiableReward` from a `VerificationReport`.\n *\n * Strategy: prefer the deterministic layers (in order: test → compile →\n * schema → sandbox), fall back to the judge layer if `fallbackToJudge` is\n * true, return `null` if no signal qualifies. When multiple deterministic\n * layers contribute, return a `'composite'` source with a weighted blend.\n */\nexport function extractVerifiableReward(\n  report: VerificationReport,\n  opts: VerifiableRewardExtractionOptions = {},\n): VerifiableReward | null {\n  const deterministicSet = new Set(opts.deterministicLayers ?? [...DEFAULT_DETERMINISTIC_LAYERS])\n  const sourceFor = opts.sourceFor ?? DEFAULT_SOURCE_FOR\n  const fallbackToJudge = opts.fallbackToJudge ?? true\n  const judgeFloor = opts.judgeConfidenceFloor ?? 0.7\n\n  const deterministic = report.layers.filter(\n    (l) => deterministicSet.has(l.layer) && typeof l.score === 'number' && Number.isFinite(l.score),\n  )\n\n  if (deterministic.length === 1) {\n    const layer = deterministic[0]!\n    return {\n      value: clamp01(layer.score!),\n      source: sourceFor(layer.layer),\n      determinism: 'deterministic',\n      confidence: 1,\n      origin: layer.layer,\n      breakdown: layerBreakdown(layer),\n    }\n  }\n\n  if (deterministic.length > 1) {\n    // Composite: weighted blend by `Layer.weight` if present, else equal.\n    let num = 0\n    let denom = 0\n    const breakdown: Record<string, number> = {}\n    for (const l of deterministic) {\n      const w = (l.detail?.weight as number | undefined) ?? 1\n      num += w * (l.score ?? 0)\n      denom += w\n      breakdown[l.layer] = l.score!\n    }\n    return {\n      value: denom === 0 ? 0 : clamp01(num / denom),\n      source: 'composite',\n      determinism: 'deterministic',\n      confidence: 1,\n      origin: deterministic.map((l) => l.layer).join('+'),\n      breakdown,\n    }\n  }\n\n  if (!fallbackToJudge) return null\n\n  const judge =\n    report.layers.find(\n      (l) =>\n        typeof l.score === 'number' && Number.isFinite(l.score) && sourceFor(l.layer) === 'judge',\n    ) ?? report.layers.find((l) => typeof l.score === 'number' && Number.isFinite(l.score))\n\n  if (!judge) return null\n\n  const confFromDetail = judge.detail?.confidence as number | undefined\n  return {\n    value: clamp01(judge.score!),\n    source: 'judge',\n    determinism: 'probabilistic',\n    confidence: typeof confFromDetail === 'number' ? confFromDetail : judgeFloor,\n    origin: judge.layer,\n    breakdown: layerBreakdown(judge),\n  }\n}\n\n/**\n * Extract verifiable rewards from `RunRecord[]` produced via the\n * `verificationReportToRunRecord` adapter (which encodes per-layer scores\n * in `outcome.raw['layer.<name>']`). For records that don't carry layer\n * scores, returns `null` for that record.\n *\n * This is the canonical bridge from \"campaign-shaped artifacts\" to\n * \"RL-training-ready reward signals\": every record that has a clean\n * verifiable reward becomes a training datum, every record that doesn't\n * gets filtered out (or kept with `'probabilistic'` determinism for\n * separate downstream handling).\n */\nexport function extractVerifiableRewardsFromRecords(\n  runs: RunRecord[],\n  opts: VerifiableRewardExtractionOptions = {},\n): Array<{ runId: string; reward: VerifiableReward | null }> {\n  const sourceFor = opts.sourceFor ?? DEFAULT_SOURCE_FOR\n  const deterministicSet = new Set(opts.deterministicLayers ?? [...DEFAULT_DETERMINISTIC_LAYERS])\n  const fallbackToJudge = opts.fallbackToJudge ?? true\n  const judgeFloor = opts.judgeConfidenceFloor ?? 0.7\n\n  return runs.map((run) => {\n    // Recover per-layer scores from outcome.raw['layer.<name>']\n    const layerScores: Array<{ name: string; score: number }> = []\n    for (const [k, v] of Object.entries(run.outcome.raw)) {\n      if (\n        k.startsWith('layer.') &&\n        !k.includes('.', 6) &&\n        typeof v === 'number' &&\n        Number.isFinite(v)\n      ) {\n        layerScores.push({ name: k.slice('layer.'.length), score: v })\n      }\n    }\n    const det = layerScores.filter((l) => deterministicSet.has(l.name))\n\n    if (det.length === 1) {\n      const layer = det[0]!\n      return {\n        runId: run.runId,\n        reward: {\n          value: clamp01(layer.score),\n          source: sourceFor(layer.name),\n          determinism: 'deterministic',\n          confidence: 1,\n          origin: layer.name,\n        },\n      }\n    }\n    if (det.length > 1) {\n      const value = det.reduce((s, l) => s + l.score, 0) / det.length\n      const breakdown: Record<string, number> = Object.fromEntries(\n        det.map((l) => [l.name, l.score]),\n      )\n      return {\n        runId: run.runId,\n        reward: {\n          value: clamp01(value),\n          source: 'composite',\n          determinism: 'deterministic',\n          confidence: 1,\n          origin: det.map((l) => l.name).join('+'),\n          breakdown,\n        },\n      }\n    }\n    if (!fallbackToJudge) return { runId: run.runId, reward: null }\n\n    // Probabilistic fallback: use the run's primary score.\n    const primary = run.outcome.holdoutScore ?? run.outcome.searchScore\n    if (typeof primary !== 'number' || !Number.isFinite(primary)) {\n      return { runId: run.runId, reward: null }\n    }\n    return {\n      runId: run.runId,\n      reward: {\n        value: clamp01(primary),\n        source: 'judge',\n        determinism: 'probabilistic',\n        confidence: judgeFloor,\n        origin: 'run.outcome.score',\n      },\n    }\n  })\n}\n\n/** Filter `RunRecord[]` to those with deterministic verifiable rewards. */\nexport function filterDeterministicallyRewarded(\n  runs: RunRecord[],\n  opts: VerifiableRewardExtractionOptions = {},\n): Array<{ run: RunRecord; reward: VerifiableReward }> {\n  const rewarded = extractVerifiableRewardsFromRecords(runs, { ...opts, fallbackToJudge: false })\n  const out: Array<{ run: RunRecord; reward: VerifiableReward }> = []\n  for (let i = 0; i < runs.length; i++) {\n    const r = rewarded[i]!\n    if (r.reward && r.reward.determinism === 'deterministic') {\n      out.push({ run: runs[i]!, reward: r.reward })\n    }\n  }\n  return out\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────────\n\nfunction clamp01(x: number): number {\n  if (!Number.isFinite(x)) return 0\n  return Math.max(0, Math.min(1, x))\n}\n\nfunction layerBreakdown(l: LayerResult): Record<string, number> {\n  const out: Record<string, number> = {}\n  if (l.diagnostics) {\n    for (const [k, v] of Object.entries(l.diagnostics)) {\n      if (typeof v === 'number' && Number.isFinite(v)) out[k] = v\n    }\n  }\n  return out\n}\n","/**\n * Reward hacking / Goodhart detection.\n *\n * Goodhart's Law says: when a measure becomes a target, it ceases to be\n * a good measure. In RLHF and agentic-RL settings this is the dominant\n * failure mode — the policy learns to produce outputs that score well on\n * the proxy reward (judge, rubric, test pass-rate) without producing\n * the underlying capability the proxy was meant to track.\n *\n * Krakovna et al. (2020, \"Specification Gaming Examples in AI\") and the\n * subsequent RLHF reward-hacking literature (Skalse et al. 2022, Kim et al.\n * 2023) converge on a few diagnostic signatures:\n *\n *   1. **Reward divergence:** the proxy reward grows while the held-out\n *      ground-truth signal stagnates or drops. Predictive validity over\n *      time captures this.\n *   2. **Distributional shift in outputs:** after RL, the policy produces\n *      outputs that no longer match the reference distribution — usually\n *      because it found a high-reward attractor that's degenerate (e.g.\n *      one-token responses, repetition, formatting tricks).\n *   3. **Disagreement between independent rewards:** if you train on\n *      reward A and a held-out independent reward B drops sharply, you're\n *      probably hacking A.\n *   4. **Calibration drift:** the verifiable / deterministic component of\n *      the reward is stable; the probabilistic / judge component drifts up\n *      while the deterministic component doesn't. The judge is being\n *      gamed.\n *\n * This module ships explicit detectors for all four signatures, plus a\n * combined verdict. The output is diagnostic — actionable signals,\n * not autoreject — because each signature has known false positives\n * (e.g., a policy that genuinely improves can show distributional shift).\n *\n * Differs from `rubricPredictiveValidity` (which is a *standing* check on\n * whether rubrics correlate with deployment outcomes) — this is a\n * *temporal* check on whether the reward-vs-truth gap is *widening over\n * time during a training run*.\n */\n\nimport type { RunRecord } from '../run-record'\nimport {\n  filterDeterministicallyRewarded,\n  type VerifiableRewardExtractionOptions,\n} from './verifiable-reward'\n\nexport type RewardHackingSignal =\n  | 'reward_divergence'\n  | 'distribution_shift'\n  | 'reward_disagreement'\n  | 'judge_drift'\n\nexport interface RewardHackingFinding {\n  signal: RewardHackingSignal\n  /** Severity in [0, 1]. >0.5 = strong signal. */\n  severity: number\n  message: string\n  /** Numeric evidence the consumer can render. */\n  detail: Record<string, number>\n}\n\nexport interface RewardHackingReport {\n  findings: RewardHackingFinding[]\n  /**\n   * Composite verdict. `'clean'` if every signal severity < 0.3;\n   * `'suspect'` if at least one ≥ 0.3 but none ≥ 0.6; `'gaming'` if any ≥ 0.6.\n   */\n  verdict: 'clean' | 'suspect' | 'gaming'\n  /** Rationale for the verdict, ready to paste into an audit log. */\n  rationale: string[]\n  /** Number of paired (proxy, truth) data points the report saw. */\n  n: number\n}\n\nexport interface DetectRewardHackingInput {\n  /**\n   * Run records ordered by recency (oldest first). The detector segments\n   * them into prefix/suffix windows to compute \"did the gap widen.\"\n   */\n  runs: RunRecord[]\n  /**\n   * The metric the policy was trained to optimize. Should be present on\n   * `outcome.raw` or `outcome.holdoutScore`. Default reads `outcome.holdoutScore`.\n   */\n  proxyOf?: (run: RunRecord) => number | null\n  /**\n   * The held-out ground-truth metric. For RL on coding, this is typically\n   * test pass-rate. For RLHF, it's downstream task performance or human\n   * preference. For knowledge tasks, it's an independently-graded score.\n   */\n  truthOf?: (run: RunRecord) => number | null\n  /**\n   * Independent secondary reward. Used for the `reward_disagreement`\n   * signal. Default uses the verifiable reward extractor (deterministic\n   * sources only).\n   */\n  secondaryRewardOf?: (run: RunRecord) => number | null\n  /**\n   * Window size — how many of the most recent runs count as the \"after\"\n   * cohort. Default min(50, half the runs).\n   */\n  windowSize?: number\n  /**\n   * Severity threshold to flag a signal. Default 0.3 (suspect) and 0.6\n   * (gaming).\n   */\n  thresholds?: { suspect?: number; gaming?: number }\n  /**\n   * Verifiable-reward options used for the secondary-reward fallback.\n   */\n  verifiableRewardOptions?: VerifiableRewardExtractionOptions\n}\n\nconst DEFAULT_PROXY = (r: RunRecord): number | null => {\n  const v = r.outcome.holdoutScore ?? r.outcome.searchScore\n  return typeof v === 'number' && Number.isFinite(v) ? v : null\n}\n\nexport function detectRewardHacking(input: DetectRewardHackingInput): RewardHackingReport {\n  const proxyOf = input.proxyOf ?? DEFAULT_PROXY\n  const truthOf = input.truthOf\n  const sus = input.thresholds?.suspect ?? 0.3\n  const gam = input.thresholds?.gaming ?? 0.6\n\n  const runs = input.runs.filter((r) => proxyOf(r) !== null)\n  const n = runs.length\n  if (n < 4) {\n    return {\n      findings: [],\n      verdict: 'clean',\n      n,\n      rationale: [`fewer than 4 runs with proxy reward (n=${n}); insufficient evidence`],\n    }\n  }\n  const windowSize = Math.max(1, input.windowSize ?? Math.min(50, Math.floor(n / 2)))\n  const before = runs.slice(0, n - windowSize)\n  const after = runs.slice(n - windowSize)\n\n  const findings: RewardHackingFinding[] = []\n\n  // ── Signal 1: reward divergence (proxy ↑ while truth flat or ↓) ──────\n  if (truthOf) {\n    const beforeProxy = before.map(proxyOf).filter((v): v is number => typeof v === 'number')\n    const afterProxy = after.map(proxyOf).filter((v): v is number => typeof v === 'number')\n    const beforeTruth = before.map(truthOf).filter((v): v is number => typeof v === 'number')\n    const afterTruth = after.map(truthOf).filter((v): v is number => typeof v === 'number')\n    if (\n      beforeProxy.length >= 2 &&\n      afterProxy.length >= 2 &&\n      beforeTruth.length >= 2 &&\n      afterTruth.length >= 2\n    ) {\n      const proxyDelta = mean(afterProxy) - mean(beforeProxy)\n      const truthDelta = mean(afterTruth) - mean(beforeTruth)\n      // Divergence: proxy goes up while truth goes flat or down.\n      // Severity = max(0, (proxyDelta - truthDelta)) — bigger gap = bigger signal.\n      const gap = Math.max(0, proxyDelta - truthDelta)\n      const severity = clamp01(gap * 5) // scale: 0.2 absolute gap → severity 1.0\n      findings.push({\n        signal: 'reward_divergence',\n        severity,\n        message:\n          severity >= sus\n            ? `proxy reward rose by ${proxyDelta.toFixed(3)} while truth changed by ${truthDelta.toFixed(3)} — potential Goodhart`\n            : `proxy and truth moved together (proxy ${proxyDelta.toFixed(3)}, truth ${truthDelta.toFixed(3)})`,\n        detail: {\n          proxyDelta,\n          truthDelta,\n          gap,\n          beforeN: beforeProxy.length,\n          afterN: afterProxy.length,\n        },\n      })\n    }\n  }\n\n  // ── Signal 2: distributional shift in outputs (KS on score distributions) ──\n  {\n    const beforeP = before.map(proxyOf).filter((v): v is number => typeof v === 'number')\n    const afterP = after.map(proxyOf).filter((v): v is number => typeof v === 'number')\n    if (beforeP.length >= 4 && afterP.length >= 4) {\n      const ks = ksStatistic(beforeP, afterP)\n      // KS statistic: bigger = more shift. We're agnostic about direction;\n      // genuine improvement ALSO produces shift, so this signal is\n      // contributory rather than load-bearing.\n      const severity = clamp01(ks - 0.2)\n      findings.push({\n        signal: 'distribution_shift',\n        severity,\n        message:\n          severity >= sus\n            ? `KS=${ks.toFixed(3)} between before/after windows — distributional shift large`\n            : `KS=${ks.toFixed(3)} between before/after windows — within-distribution drift`,\n        detail: { ks, beforeN: beforeP.length, afterN: afterP.length },\n      })\n    }\n  }\n\n  // ── Signal 3: reward disagreement (proxy vs independent secondary) ────\n  {\n    const secondaryOf = input.secondaryRewardOf ?? defaultSecondary(input.verifiableRewardOptions)\n    const aligned = runs\n      .map((r) => ({ p: proxyOf(r), s: secondaryOf(r) }))\n      .filter(\n        (x): x is { p: number; s: number } => typeof x.p === 'number' && typeof x.s === 'number',\n      )\n    if (aligned.length >= 4) {\n      const ps = aligned.map((x) => x.p)\n      const ss = aligned.map((x) => x.s)\n      const r = pearsonR(ps, ss)\n      // Disagreement: low or negative correlation between primary proxy\n      // reward and an independent secondary signal.\n      const severity = clamp01(0.5 - Math.max(0, r))\n      findings.push({\n        signal: 'reward_disagreement',\n        severity,\n        message:\n          severity >= sus\n            ? `proxy and independent secondary reward correlate ρ=${r.toFixed(3)} — possibly hacking proxy`\n            : `proxy and secondary reward correlate ρ=${r.toFixed(3)}`,\n        detail: { pearson: r, n: aligned.length },\n      })\n    }\n  }\n\n  // ── Signal 4: judge drift (probabilistic up while deterministic flat) ─\n  {\n    const detRuns = filterDeterministicallyRewarded(runs, input.verifiableRewardOptions ?? {})\n    if (detRuns.length >= 4) {\n      const detBefore = detRuns.slice(0, Math.floor(detRuns.length / 2))\n      const detAfter = detRuns.slice(Math.floor(detRuns.length / 2))\n      const detDelta =\n        mean(detAfter.map((r) => r.reward.value)) - mean(detBefore.map((r) => r.reward.value))\n      const proxyDelta =\n        mean(after.map(proxyOf).filter((v): v is number => typeof v === 'number')) -\n        mean(before.map(proxyOf).filter((v): v is number => typeof v === 'number'))\n      const driftGap = Math.max(0, proxyDelta - detDelta)\n      const severity = clamp01(driftGap * 5)\n      findings.push({\n        signal: 'judge_drift',\n        severity,\n        message:\n          severity >= sus\n            ? `judge proxy +${proxyDelta.toFixed(3)} while deterministic reward +${detDelta.toFixed(3)} — judge drifting up without verifiable backing`\n            : `judge and deterministic rewards move in step (judge ${proxyDelta.toFixed(3)}, det ${detDelta.toFixed(3)})`,\n        detail: { proxyDelta, detDelta, driftGap, n: detRuns.length },\n      })\n    }\n  }\n\n  const maxSev = findings.reduce((m, f) => Math.max(m, f.severity), 0)\n  const verdict: RewardHackingReport['verdict'] =\n    maxSev >= gam ? 'gaming' : maxSev >= sus ? 'suspect' : 'clean'\n  const rationale = findings\n    .filter((f) => f.severity >= sus)\n    .map((f) => `${f.signal}: severity ${f.severity.toFixed(2)} — ${f.message}`)\n  if (rationale.length === 0) rationale.push('no signals fired above suspect threshold')\n\n  return { findings, verdict, rationale, n }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────────\n\nfunction mean(xs: number[]): number {\n  if (xs.length === 0) return 0\n  return xs.reduce((s, x) => s + x, 0) / xs.length\n}\n\nfunction clamp01(x: number): number {\n  if (!Number.isFinite(x)) return 0\n  return Math.max(0, Math.min(1, x))\n}\n\nfunction pearsonR(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length < 2) return 0\n  const ma = mean(a)\n  const mb = mean(b)\n  let num = 0,\n    da = 0,\n    db = 0\n  for (let i = 0; i < a.length; i++) {\n    const xa = a[i]! - ma\n    const xb = b[i]! - mb\n    num += xa * xb\n    da += xa * xa\n    db += xb * xb\n  }\n  if (da === 0 || db === 0) return 0\n  return num / Math.sqrt(da * db)\n}\n\nfunction ksStatistic(a: number[], b: number[]): number {\n  // Two-sample Kolmogorov-Smirnov statistic.\n  const sortedA = [...a].sort((x, y) => x - y)\n  const sortedB = [...b].sort((x, y) => x - y)\n  const all = [...new Set([...sortedA, ...sortedB])].sort((x, y) => x - y)\n  let max = 0\n  for (const v of all) {\n    const fa = sortedA.filter((x) => x <= v).length / sortedA.length\n    const fb = sortedB.filter((x) => x <= v).length / sortedB.length\n    max = Math.max(max, Math.abs(fa - fb))\n  }\n  return max\n}\n\nfunction defaultSecondary(\n  verifiableOpts?: VerifiableRewardExtractionOptions,\n): (run: RunRecord) => number | null {\n  return (run: RunRecord) => {\n    const filtered = filterDeterministicallyRewarded([run], verifiableOpts ?? {})\n    return filtered.length === 1 ? filtered[0]!.reward.value : null\n  }\n}\n"],"mappings":";AA8FA,IAAM,+BAA+B,oBAAI,IAAI;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,IAAM,qBAAqB,CAAC,SAAyC;AACnE,QAAM,QAAQ,KAAK,YAAY;AAC/B,MAAI,MAAM,SAAS,MAAM,EAAG,QAAO;AACnC,MACE,MAAM,SAAS,SAAS,KACxB,MAAM,SAAS,OAAO,KACtB,MAAM,SAAS,WAAW,KAC1B,MAAM,SAAS,MAAM;AAErB,WAAO;AACT,MAAI,MAAM,SAAS,QAAQ,EAAG,QAAO;AACrC,MAAI,MAAM,SAAS,SAAS,EAAG,QAAO;AACtC,MAAI,MAAM,SAAS,OAAO,KAAK,MAAM,SAAS,UAAU,EAAG,QAAO;AAClE,SAAO;AACT;AAUO,SAAS,wBACd,QACA,OAA0C,CAAC,GAClB;AACzB,QAAM,mBAAmB,IAAI,IAAI,KAAK,uBAAuB,CAAC,GAAG,4BAA4B,CAAC;AAC9F,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,kBAAkB,KAAK,mBAAmB;AAChD,QAAM,aAAa,KAAK,wBAAwB;AAEhD,QAAM,gBAAgB,OAAO,OAAO;AAAA,IAClC,CAAC,MAAM,iBAAiB,IAAI,EAAE,KAAK,KAAK,OAAO,EAAE,UAAU,YAAY,OAAO,SAAS,EAAE,KAAK;AAAA,EAChG;AAEA,MAAI,cAAc,WAAW,GAAG;AAC9B,UAAM,QAAQ,cAAc,CAAC;AAC7B,WAAO;AAAA,MACL,OAAO,QAAQ,MAAM,KAAM;AAAA,MAC3B,QAAQ,UAAU,MAAM,KAAK;AAAA,MAC7B,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,QAAQ,MAAM;AAAA,MACd,WAAW,eAAe,KAAK;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,cAAc,SAAS,GAAG;AAE5B,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,UAAM,YAAoC,CAAC;AAC3C,eAAW,KAAK,eAAe;AAC7B,YAAM,IAAK,EAAE,QAAQ,UAAiC;AACtD,aAAO,KAAK,EAAE,SAAS;AACvB,eAAS;AACT,gBAAU,EAAE,KAAK,IAAI,EAAE;AAAA,IACzB;AACA,WAAO;AAAA,MACL,OAAO,UAAU,IAAI,IAAI,QAAQ,MAAM,KAAK;AAAA,MAC5C,QAAQ;AAAA,MACR,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,QAAQ,cAAc,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,gBAAiB,QAAO;AAE7B,QAAM,QACJ,OAAO,OAAO;AAAA,IACZ,CAAC,MACC,OAAO,EAAE,UAAU,YAAY,OAAO,SAAS,EAAE,KAAK,KAAK,UAAU,EAAE,KAAK,MAAM;AAAA,EACtF,KAAK,OAAO,OAAO,KAAK,CAAC,MAAM,OAAO,EAAE,UAAU,YAAY,OAAO,SAAS,EAAE,KAAK,CAAC;AAExF,MAAI,CAAC,MAAO,QAAO;AAEnB,QAAM,iBAAiB,MAAM,QAAQ;AACrC,SAAO;AAAA,IACL,OAAO,QAAQ,MAAM,KAAM;AAAA,IAC3B,QAAQ;AAAA,IACR,aAAa;AAAA,IACb,YAAY,OAAO,mBAAmB,WAAW,iBAAiB;AAAA,IAClE,QAAQ,MAAM;AAAA,IACd,WAAW,eAAe,KAAK;AAAA,EACjC;AACF;AAcO,SAAS,oCACd,MACA,OAA0C,CAAC,GACgB;AAC3D,QAAM,YAAY,KAAK,aAAa;AACpC,QAAM,mBAAmB,IAAI,IAAI,KAAK,uBAAuB,CAAC,GAAG,4BAA4B,CAAC;AAC9F,QAAM,kBAAkB,KAAK,mBAAmB;AAChD,QAAM,aAAa,KAAK,wBAAwB;AAEhD,SAAO,KAAK,IAAI,CAAC,QAAQ;AAEvB,UAAM,cAAsD,CAAC;AAC7D,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,IAAI,QAAQ,GAAG,GAAG;AACpD,UACE,EAAE,WAAW,QAAQ,KACrB,CAAC,EAAE,SAAS,KAAK,CAAC,KAClB,OAAO,MAAM,YACb,OAAO,SAAS,CAAC,GACjB;AACA,oBAAY,KAAK,EAAE,MAAM,EAAE,MAAM,SAAS,MAAM,GAAG,OAAO,EAAE,CAAC;AAAA,MAC/D;AAAA,IACF;AACA,UAAM,MAAM,YAAY,OAAO,CAAC,MAAM,iBAAiB,IAAI,EAAE,IAAI,CAAC;AAElE,QAAI,IAAI,WAAW,GAAG;AACpB,YAAM,QAAQ,IAAI,CAAC;AACnB,aAAO;AAAA,QACL,OAAO,IAAI;AAAA,QACX,QAAQ;AAAA,UACN,OAAO,QAAQ,MAAM,KAAK;AAAA,UAC1B,QAAQ,UAAU,MAAM,IAAI;AAAA,UAC5B,aAAa;AAAA,UACb,YAAY;AAAA,UACZ,QAAQ,MAAM;AAAA,QAChB;AAAA,MACF;AAAA,IACF;AACA,QAAI,IAAI,SAAS,GAAG;AAClB,YAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,OAAO,CAAC,IAAI,IAAI;AACzD,YAAM,YAAoC,OAAO;AAAA,QAC/C,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC;AAAA,MAClC;AACA,aAAO;AAAA,QACL,OAAO,IAAI;AAAA,QACX,QAAQ;AAAA,UACN,OAAO,QAAQ,KAAK;AAAA,UACpB,QAAQ;AAAA,UACR,aAAa;AAAA,UACb,YAAY;AAAA,UACZ,QAAQ,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG;AAAA,UACvC;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,gBAAiB,QAAO,EAAE,OAAO,IAAI,OAAO,QAAQ,KAAK;AAG9D,UAAM,UAAU,IAAI,QAAQ,gBAAgB,IAAI,QAAQ;AACxD,QAAI,OAAO,YAAY,YAAY,CAAC,OAAO,SAAS,OAAO,GAAG;AAC5D,aAAO,EAAE,OAAO,IAAI,OAAO,QAAQ,KAAK;AAAA,IAC1C;AACA,WAAO;AAAA,MACL,OAAO,IAAI;AAAA,MACX,QAAQ;AAAA,QACN,OAAO,QAAQ,OAAO;AAAA,QACtB,QAAQ;AAAA,QACR,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,QAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF,CAAC;AACH;AAGO,SAAS,gCACd,MACA,OAA0C,CAAC,GACU;AACrD,QAAM,WAAW,oCAAoC,MAAM,EAAE,GAAG,MAAM,iBAAiB,MAAM,CAAC;AAC9F,QAAM,MAA2D,CAAC;AAClE,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,IAAI,SAAS,CAAC;AACpB,QAAI,EAAE,UAAU,EAAE,OAAO,gBAAgB,iBAAiB;AACxD,UAAI,KAAK,EAAE,KAAK,KAAK,CAAC,GAAI,QAAQ,EAAE,OAAO,CAAC;AAAA,IAC9C;AAAA,EACF;AACA,SAAO;AACT;AAIA,SAAS,QAAQ,GAAmB;AAClC,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AACnC;AAEA,SAAS,eAAe,GAAwC;AAC9D,QAAM,MAA8B,CAAC;AACrC,MAAI,EAAE,aAAa;AACjB,eAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,EAAE,WAAW,GAAG;AAClD,UAAI,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,EAAG,KAAI,CAAC,IAAI;AAAA,IAC5D;AAAA,EACF;AACA,SAAO;AACT;;;AC3MA,IAAM,gBAAgB,CAAC,MAAgC;AACrD,QAAM,IAAI,EAAE,QAAQ,gBAAgB,EAAE,QAAQ;AAC9C,SAAO,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,IAAI;AAC3D;AAEO,SAAS,oBAAoB,OAAsD;AACxF,QAAM,UAAU,MAAM,WAAW;AACjC,QAAM,UAAU,MAAM;AACtB,QAAM,MAAM,MAAM,YAAY,WAAW;AACzC,QAAM,MAAM,MAAM,YAAY,UAAU;AAExC,QAAM,OAAO,MAAM,KAAK,OAAO,CAAC,MAAM,QAAQ,CAAC,MAAM,IAAI;AACzD,QAAM,IAAI,KAAK;AACf,MAAI,IAAI,GAAG;AACT,WAAO;AAAA,MACL,UAAU,CAAC;AAAA,MACX,SAAS;AAAA,MACT;AAAA,MACA,WAAW,CAAC,0CAA0C,CAAC,0BAA0B;AAAA,IACnF;AAAA,EACF;AACA,QAAM,aAAa,KAAK,IAAI,GAAG,MAAM,cAAc,KAAK,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC;AAClF,QAAM,SAAS,KAAK,MAAM,GAAG,IAAI,UAAU;AAC3C,QAAM,QAAQ,KAAK,MAAM,IAAI,UAAU;AAEvC,QAAM,WAAmC,CAAC;AAG1C,MAAI,SAAS;AACX,UAAM,cAAc,OAAO,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AACxF,UAAM,aAAa,MAAM,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AACtF,UAAM,cAAc,OAAO,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AACxF,UAAM,aAAa,MAAM,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AACtF,QACE,YAAY,UAAU,KACtB,WAAW,UAAU,KACrB,YAAY,UAAU,KACtB,WAAW,UAAU,GACrB;AACA,YAAM,aAAa,KAAK,UAAU,IAAI,KAAK,WAAW;AACtD,YAAM,aAAa,KAAK,UAAU,IAAI,KAAK,WAAW;AAGtD,YAAM,MAAM,KAAK,IAAI,GAAG,aAAa,UAAU;AAC/C,YAAM,WAAWA,SAAQ,MAAM,CAAC;AAChC,eAAS,KAAK;AAAA,QACZ,QAAQ;AAAA,QACR;AAAA,QACA,SACE,YAAY,MACR,wBAAwB,WAAW,QAAQ,CAAC,CAAC,2BAA2B,WAAW,QAAQ,CAAC,CAAC,+BAC7F,yCAAyC,WAAW,QAAQ,CAAC,CAAC,WAAW,WAAW,QAAQ,CAAC,CAAC;AAAA,QACpG,QAAQ;AAAA,UACN;AAAA,UACA;AAAA,UACA;AAAA,UACA,SAAS,YAAY;AAAA,UACrB,QAAQ,WAAW;AAAA,QACrB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAGA;AACE,UAAM,UAAU,OAAO,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AACpF,UAAM,SAAS,MAAM,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAClF,QAAI,QAAQ,UAAU,KAAK,OAAO,UAAU,GAAG;AAC7C,YAAM,KAAK,YAAY,SAAS,MAAM;AAItC,YAAM,WAAWA,SAAQ,KAAK,GAAG;AACjC,eAAS,KAAK;AAAA,QACZ,QAAQ;AAAA,QACR;AAAA,QACA,SACE,YAAY,MACR,MAAM,GAAG,QAAQ,CAAC,CAAC,oEACnB,MAAM,GAAG,QAAQ,CAAC,CAAC;AAAA,QACzB,QAAQ,EAAE,IAAI,SAAS,QAAQ,QAAQ,QAAQ,OAAO,OAAO;AAAA,MAC/D,CAAC;AAAA,IACH;AAAA,EACF;AAGA;AACE,UAAM,cAAc,MAAM,qBAAqB,iBAAiB,MAAM,uBAAuB;AAC7F,UAAM,UAAU,KACb,IAAI,CAAC,OAAO,EAAE,GAAG,QAAQ,CAAC,GAAG,GAAG,YAAY,CAAC,EAAE,EAAE,EACjD;AAAA,MACC,CAAC,MAAqC,OAAO,EAAE,MAAM,YAAY,OAAO,EAAE,MAAM;AAAA,IAClF;AACF,QAAI,QAAQ,UAAU,GAAG;AACvB,YAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;AACjC,YAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;AACjC,YAAM,IAAI,SAAS,IAAI,EAAE;AAGzB,YAAM,WAAWA,SAAQ,MAAM,KAAK,IAAI,GAAG,CAAC,CAAC;AAC7C,eAAS,KAAK;AAAA,QACZ,QAAQ;AAAA,QACR;AAAA,QACA,SACE,YAAY,MACR,2DAAsD,EAAE,QAAQ,CAAC,CAAC,mCAClE,+CAA0C,EAAE,QAAQ,CAAC,CAAC;AAAA,QAC5D,QAAQ,EAAE,SAAS,GAAG,GAAG,QAAQ,OAAO;AAAA,MAC1C,CAAC;AAAA,IACH;AAAA,EACF;AAGA;AACE,UAAM,UAAU,gCAAgC,MAAM,MAAM,2BAA2B,CAAC,CAAC;AACzF,QAAI,QAAQ,UAAU,GAAG;AACvB,YAAM,YAAY,QAAQ,MAAM,GAAG,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AACjE,YAAM,WAAW,QAAQ,MAAM,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AAC7D,YAAM,WACJ,KAAK,SAAS,IAAI,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC;AACvF,YAAM,aACJ,KAAK,MAAM,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,CAAC,IACzE,KAAK,OAAO,IAAI,OAAO,EAAE,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,CAAC;AAC5E,YAAM,WAAW,KAAK,IAAI,GAAG,aAAa,QAAQ;AAClD,YAAM,WAAWA,SAAQ,WAAW,CAAC;AACrC,eAAS,KAAK;AAAA,QACZ,QAAQ;AAAA,QACR;AAAA,QACA,SACE,YAAY,MACR,gBAAgB,WAAW,QAAQ,CAAC,CAAC,gCAAgC,SAAS,QAAQ,CAAC,CAAC,yDACxF,uDAAuD,WAAW,QAAQ,CAAC,CAAC,SAAS,SAAS,QAAQ,CAAC,CAAC;AAAA,QAC9G,QAAQ,EAAE,YAAY,UAAU,UAAU,GAAG,QAAQ,OAAO;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,SAAS,SAAS,OAAO,CAAC,GAAG,MAAM,KAAK,IAAI,GAAG,EAAE,QAAQ,GAAG,CAAC;AACnE,QAAM,UACJ,UAAU,MAAM,WAAW,UAAU,MAAM,YAAY;AACzD,QAAM,YAAY,SACf,OAAO,CAAC,MAAM,EAAE,YAAY,GAAG,EAC/B,IAAI,CAAC,MAAM,GAAG,EAAE,MAAM,cAAc,EAAE,SAAS,QAAQ,CAAC,CAAC,WAAM,EAAE,OAAO,EAAE;AAC7E,MAAI,UAAU,WAAW,EAAG,WAAU,KAAK,0CAA0C;AAErF,SAAO,EAAE,UAAU,SAAS,WAAW,EAAE;AAC3C;AAIA,SAAS,KAAK,IAAsB;AAClC,MAAI,GAAG,WAAW,EAAG,QAAO;AAC5B,SAAO,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAC5C;AAEA,SAASA,SAAQ,GAAmB;AAClC,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AACnC;AAEA,SAAS,SAAS,GAAa,GAAqB;AAClD,MAAI,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAG,QAAO;AAClD,QAAM,KAAK,KAAK,CAAC;AACjB,QAAM,KAAK,KAAK,CAAC;AACjB,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;AACjC,SAAO,MAAM,KAAK,KAAK,KAAK,EAAE;AAChC;AAEA,SAAS,YAAY,GAAa,GAAqB;AAErD,QAAM,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC3C,QAAM,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC3C,QAAM,MAAM,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvE,MAAI,MAAM;AACV,aAAW,KAAK,KAAK;AACnB,UAAM,KAAK,QAAQ,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,SAAS,QAAQ;AAC1D,UAAM,KAAK,QAAQ,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,SAAS,QAAQ;AAC1D,UAAM,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,EAAE,CAAC;AAAA,EACvC;AACA,SAAO;AACT;AAEA,SAAS,iBACP,gBACmC;AACnC,SAAO,CAAC,QAAmB;AACzB,UAAM,WAAW,gCAAgC,CAAC,GAAG,GAAG,kBAAkB,CAAC,CAAC;AAC5E,WAAO,SAAS,WAAW,IAAI,SAAS,CAAC,EAAG,OAAO,QAAQ;AAAA,EAC7D;AACF;","names":["clamp01"]}