@tangle-network/agent-eval 0.133.1 → 0.133.3

package/dist/analyze-runs-B-afTpCv.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"analyze-runs-B-afTpCv.js","names":[],"sources":["../src/contamination-guard.ts","../src/contract/analyze-runs.ts"],"sourcesContent":["/**\n * ContaminationGuard — ensures held-out scenarios don't leak into\n * training/prompt paths, and flags model memorization.\n *\n * Three probes:\n *   1. `checkCanaries(output, scenario)` — if the scenario carries a\n *      canary token, it MUST NOT appear in the agent's output.\n *      Canaries are strings that are statistically impossible to\n *      reconstruct from the scenario description alone — so if they\n *      echo back, the model memorized them.\n *   2. `canaryLeakView(store)` — cross-corpus view of every run whose\n *      output contained a canary, with the offending scenario + run.\n *   3. `HoldoutAuditor` — wraps a Dataset and emits a structured error\n *      on any code path that reads holdout scenarios but doesn't flag\n *      `purpose: 'evaluation'`. Keeps engineers honest.\n */\n\nimport type { DatasetScenario } from './dataset'\nimport { llmSpans } from './trace/query'\nimport type { TraceStore } from './trace/store'\n\nexport interface CanaryLeak {\n  scenarioId: string\n  canary: string\n  runId?: string\n  evidence: string\n}\n\nexport function checkCanaries(output: string, scenarios: DatasetScenario[]): CanaryLeak[] {\n  const leaks: CanaryLeak[] = []\n  for (const s of scenarios) {\n    if (!s.canary) continue\n    if (output.includes(s.canary)) {\n      leaks.push({ scenarioId: s.id, canary: s.canary, evidence: excerpt(output, s.canary) })\n    }\n  }\n  return leaks\n}\n\n/**\n * Behavioral canary: tests the AGENT, not the eval grep.\n *\n *   - `forbiddenPattern` PRESENT in output ⇒ AGENT EMITTED BAD CONTENT ⇒ LEAK.\n *   - `forbiddenPattern` ABSENT from output ⇒ AGENT HELD THE LINE       ⇒ PASS.\n *\n * Use when running known-bad-prompt scenarios against the agent under\n * test and you want to know if the agent misbehaved. The classical\n * {@link checkCanaries} / {@link import('./canary').runCanaries | runCanaries}\n * test whether the eval check fires when the bad output is forced\n * into the eval flow — different question, different answer.\n *\n * Pattern resolution order (first match wins):\n *   1. `scenario.forbiddenPattern` — if it parses as `/body/flags`,\n *      treated as a regex; otherwise a literal substring.\n *   2. `scenario.canary` — literal substring fallback so the helper\n *      works on existing scenario fixtures.\n *\n * Returns `null` when nothing forbidden was found OR the scenario\n * declared no pattern.\n */\nexport function checkBehavioralCanary(\n  output: string,\n  scenario: DatasetScenario,\n): CanaryLeak | null {\n  const pattern = scenario.forbiddenPattern ?? scenario.canary\n  if (!pattern) return null\n  const hit = matchForbidden(output, pattern)\n  if (!hit) return null\n  return {\n    scenarioId: scenario.id,\n    canary: pattern,\n    evidence: excerpt(output, hit),\n  }\n}\n\n/**\n * Behavioral canary over many (scenario, output) pairs. Sibling to\n * {@link import('./canary').runCanaries | runCanaries} — same idea\n * (run-many → report) but the question being answered is \"did the\n * AGENT misbehave?\" rather than \"did the EVAL grep fire?\".\n *\n * Returns one `CanaryLeak` per pair where the agent's output\n * contained its scenario's `forbiddenPattern` (or `canary` fallback).\n */\nexport function runBehavioralCanaries(\n  cases: Array<{ scenario: DatasetScenario; output: string; runId?: string }>,\n): CanaryLeak[] {\n  const leaks: CanaryLeak[] = []\n  for (const c of cases) {\n    const leak = checkBehavioralCanary(c.output, c.scenario)\n    if (leak) leaks.push({ ...leak, runId: c.runId ?? leak.runId })\n  }\n  return leaks\n}\n\n/**\n * Resolve a forbidden-pattern string to the matched substring inside\n * `output`. `/body/flags` notation is interpreted as a regex; anything\n * else is a literal substring.\n */\nfunction matchForbidden(output: string, pattern: string): string | null {\n  const re = tryParseRegex(pattern)\n  if (re) {\n    const m = output.match(re)\n    return m && m[0].length > 0 ? m[0] : null\n  }\n  return output.includes(pattern) ? pattern : null\n}\n\nfunction tryParseRegex(pattern: string): RegExp | null {\n  if (pattern.length < 2 || pattern[0] !== '/') return null\n  const last = pattern.lastIndexOf('/')\n  if (last <= 0) return null\n  const body = pattern.slice(1, last)\n  const flags = pattern.slice(last + 1)\n  if (!/^[gimsuy]*$/.test(flags)) return null\n  try {\n    return new RegExp(body, flags)\n  } catch {\n    return null\n  }\n}\n\n/**\n * Scan the LLM-output history in a corpus; returns every case where a\n * canary from a known scenario appeared in agent output. Pass the full\n * set of scenarios whose canaries you care about (typically the whole\n * held-out slice).\n */\nexport async function canaryLeakView(\n  store: TraceStore,\n  scenarios: DatasetScenario[],\n): Promise<CanaryLeak[]> {\n  const targets = scenarios.filter((s) => !!s.canary)\n  if (targets.length === 0) return []\n  const spans = await llmSpans(store)\n  const leaks: CanaryLeak[] = []\n  for (const span of spans) {\n    const output = span.output ?? ''\n    for (const s of targets) {\n      if (s.canary && output.includes(s.canary)) {\n        leaks.push({\n          scenarioId: s.id,\n          canary: s.canary,\n          runId: span.runId,\n          evidence: excerpt(output, s.canary),\n        })\n      }\n    }\n  }\n  return leaks\n}\n\nexport class HoldoutAuditor {\n  private scenarios: DatasetScenario[]\n  private accessLog: Array<{ scenarioId: string; purpose: string; at: number }> = []\n\n  constructor(scenarios: DatasetScenario[]) {\n    this.scenarios = scenarios\n  }\n\n  /** Retrieve a holdout scenario for a declared purpose. Non-'evaluation' throws. */\n  get(scenarioId: string, purpose: 'evaluation' | 'debugging'): DatasetScenario {\n    if (purpose !== 'evaluation' && purpose !== 'debugging') {\n      throw new Error(\n        `HoldoutAuditor.get: purpose must be 'evaluation' or 'debugging', got ${purpose}`,\n      )\n    }\n    const s = this.scenarios.find((x) => x.id === scenarioId)\n    if (!s) throw new Error(`holdout scenario \"${scenarioId}\" not found`)\n    this.accessLog.push({ scenarioId, purpose, at: Date.now() })\n    return s\n  }\n\n  getAccessLog(): ReadonlyArray<{ scenarioId: string; purpose: string; at: number }> {\n    return this.accessLog\n  }\n}\n\nfunction excerpt(source: string, needle: string): string {\n  const at = source.indexOf(needle)\n  if (at < 0) return ''\n  const start = Math.max(0, at - 30)\n  const end = Math.min(source.length, at + needle.length + 30)\n  return (start > 0 ? '…' : '') + source.slice(start, end) + (end < source.length ? '…' : '')\n}\n","/**\n * # `analyzeRuns()` — turn a set of agent runs into an actionable decision packet.\n *\n * Wires the substrate's statistical, calibration, clustering, Pareto, and\n * release-confidence primitives into one `InsightReport`. Two top-level\n * entry points use this function:\n *\n *   - `selfImprove()` calls it on the campaign output to attach a packet\n *     to every run.\n *   - Consumers with observed `RunRecord[]` (production traces, gold\n *     corpora, approve/reject tables) call it directly via `analyzeRuns()`\n *     for analysis without a closed loop.\n *\n * Every section is opt-in based on what the input data supports — the\n * function never invents signal. If runs carry no judge scores, `judges`\n * is empty. If there's no baseline/candidate split, `lift` is undefined.\n * If no `analyst` is wired, `failureClusters` is undefined.\n *\n * The `recommendations` array is the human-readable layer; everything\n * else is the evidence backing each recommendation.\n */\n\nimport type { AnalystRegistry } from '../analyst/registry'\nimport type { AnalystFinding } from '../analyst/types'\nimport { checkCanaries } from '../contamination-guard'\nimport type { DatasetScenario } from '../dataset'\nimport { continuousAgreement } from '../judge-calibration'\nimport { normalCdf } from '../math/normal'\nimport { pairRunRecords } from '../paired-arms'\nimport { observedSplitScore } from '../rollout/reward'\nimport {\n  type RunRecord,\n  type RunTerminalOutcome,\n  type RunTokenUsage,\n  validateRunRecord,\n} from '../run-record'\nimport {\n  pairedBootstrap,\n  pairedCohensDz,\n  pairedMde,\n  pairedTTest,\n  pearsonR,\n  requiredPairedSampleSize,\n  spearmanR,\n} from '../statistics'\nimport { type ParetoFigureSpec, paretoChart } from '../summary-report'\nimport type { FailureClass } from '../trace/schema'\n\nimport type {\n  CostProvenanceSummary,\n  ExecutionInsight,\n  FailureClassTally,\n  FailureClusterInsight,\n  InsightReport,\n  InterRaterInsight,\n  JudgeInsight,\n  LiftInsight,\n  MetricDelta,\n  OutcomeCorrelationInsight,\n  PriorPeriodComparison,\n  Recommendation,\n  ScalarDistribution,\n  TokenUsageInsight,\n} from './insight-report'\n\n// ── Public API ───────────────────────────────────────────────────────\n\nexport interface AnalyzeRunsOptions {\n  /** The runs to analyze. */\n  runs: RunRecord[]\n  /** Which split to score against when reading composite from RunOutcome.\n   *  Default: holdout when ANY run has a `holdoutScore`, else search. */\n  split?: 'search' | 'holdout' | 'auto'\n  /** Pairwise analysis configuration. When both `baselineCandidateId` and\n   *  `candidateCandidateId` are present, lift is computed on paired\n   *  (experimentId, scenarioId, seed) identities shared between the two sides.\n   *  Unmatched rows remain visible in the lift result. */\n  baselineCandidateId?: string\n  candidateCandidateId?: string\n  /** Canary scenarios — checked against every run's raw output for\n   *  holdout contamination. */\n  canaryScenarios?: DatasetScenario[]\n  /** Analyst registry for failure clustering. When omitted, the\n   *  `failureClusters` section is left undefined. */\n  analyst?: AnalystRegistry\n  /** Downstream outcome metric per run (e.g. engagement rate, approval\n   *  rate, downstream pass rate). When present, the report includes\n   *  `outcomeCorrelation` + a simple linear reward model fit. */\n  outcomeSignal?: {\n    metric: string\n    valueByRunId: Record<string, number>\n  }\n  /** Multi-rater feedback for inter-rater agreement. Each entry is one\n   *  rater's score for one run. Two or more raters → kappa + disagreement\n   *  triage list. */\n  raterScores?: Array<{ runId: string; rater: string; score: number }>\n  /** Number of histogram bins for distributional summaries. Default 12. */\n  histogramBins?: number\n  /** Decision threshold — the smallest composite lift the caller cares\n   *  about. Used by the recommendations engine to call ship vs hold.\n   *  Default 0.02. */\n  decisionThreshold?: number\n  /** Optional prior-period runs. When set, the report includes\n   *  `priorPeriodComparison` with per-metric Welch-CI deltas and\n   *  recommendations fire on statistically significant regressions.\n   *  The two windows do NOT have to share scenarios — the comparison\n   *  is two-sample unpaired (the substrate's `lift` field uses paired\n   *  bootstrap on shared (experimentId, scenarioId, seed) identities; this is the\n   *  shape for \"this week vs last week\" rather than \"candidate vs\n   *  baseline within a campaign\"). */\n  baselineRuns?: RunRecord[]\n  /** Human-readable label for the baseline window, e.g. \"vs prior 7\n   *  days\", \"vs v3.1 release\". Surfaces in recommendations + UI. */\n  baselineLabel?: string\n}\n\nexport interface SummarizeExecutionOptions {\n  runs: RunRecord[]\n  histogramBins?: number\n}\n\nexport interface ExecutionReport {\n  execution: ExecutionInsight\n  costProvenance: CostProvenanceSummary\n}\n\n/** Summarize runtime facts without interpreting task quality or promotion readiness. */\nexport function summarizeExecution(opts: SummarizeExecutionOptions): ExecutionReport {\n  const runs = opts.runs.map(validateRunRecord)\n  const bins = opts.histogramBins ?? 12\n  return {\n    execution: computeExecutionInsight(runs, bins),\n    costProvenance: summarizeCostProvenance(runs),\n  }\n}\n\nexport async function analyzeRuns(opts: AnalyzeRunsOptions): Promise<InsightReport> {\n  const runs = opts.runs.map(validateRunRecord)\n  const bins = opts.histogramBins ?? 12\n  const threshold = opts.decisionThreshold ?? 0.02\n  const split = resolveSplit(runs, opts.split ?? 'auto')\n\n  const compositeWithIds = runs\n    .map((r) => ({ runId: r.runId, score: compositeOf(r, split) }))\n    .filter((p) => Number.isFinite(p.score))\n  const composite = distributionOf(\n    compositeWithIds.map((p) => p.score),\n    bins,\n    compositeWithIds,\n  )\n\n  const perDimension = computePerDimension(runs, bins)\n  const { execution, costProvenance: provenance } = summarizeExecution({\n    runs,\n    histogramBins: bins,\n  })\n  const knownCostRuns = runs.filter((run) => run.costProvenance.kind !== 'uncaptured')\n  const costs = knownCostRuns.map((r) => r.costUsd).filter(isFiniteNumber)\n  const costDist = distributionOf(costs, bins)\n  const pareto = paretoChart(knownCostRuns, { split })\n  const degraded: { cost?: string; pareto?: string } = {}\n  if (provenance.uncaptured.n > 0) {\n    degraded.cost = diagnoseCostCoverage(runs, provenance)\n  } else if (costs.length === 0 || costs.every((c) => c === 0)) {\n    degraded.cost = `all ${runs.length} explicitly observed or estimated USD values are $0`\n  }\n  if (pareto.points.length < 2) {\n    degraded.pareto =\n      pareto.points.length === 0\n        ? 'no candidates — Pareto unavailable'\n        : 'single candidate — Pareto is a single point, not a frontier'\n  }\n  const costQuality = {\n    cost: costDist,\n    pareto,\n    provenance,\n    ...(degraded.cost || degraded.pareto ? { degraded } : {}),\n  }\n\n  const judges = computeJudgeInsights(runs)\n\n  const interRater = opts.raterScores ? computeInterRater(opts.raterScores) : undefined\n\n  const lift = computeLift(runs, opts.baselineCandidateId, opts.candidateCandidateId, split)\n\n  const failureClusters = opts.analyst\n    ? await computeFailureClusters(runs, opts.analyst, split)\n    : undefined\n\n  const failureClasses = computeFailureClasses(runs, split)\n\n  const contamination = opts.canaryScenarios\n    ? computeContamination(runs, opts.canaryScenarios)\n    : undefined\n\n  const outcomeCorrelation = opts.outcomeSignal\n    ? computeOutcomeCorrelation(runs, opts.outcomeSignal, split)\n    : undefined\n\n  const release = buildReleaseScorecard(composite, lift, contamination)\n\n  const priorPeriodComparison = opts.baselineRuns\n    ? computePriorPeriodComparison(runs, opts.baselineRuns, split, opts.baselineLabel)\n    : undefined\n\n  const recommendations = buildRecommendations({\n    composite,\n    judges,\n    interRater,\n    lift,\n    failureClusters,\n    failureClasses,\n    contamination,\n    outcomeCorrelation,\n    priorPeriodComparison,\n    threshold,\n  })\n\n  return {\n    n: runs.length,\n    execution,\n    composite,\n    perDimension,\n    costQuality,\n    judges,\n    interRater,\n    lift,\n    failureClusters,\n    contamination,\n    outcomeCorrelation,\n    release,\n    ...(failureClasses ? { failureClasses } : {}),\n    ...(priorPeriodComparison ? { priorPeriodComparison } : {}),\n    recommendations,\n  }\n}\n\nfunction computeExecutionInsight(runs: RunRecord[], bins: number): ExecutionInsight {\n  const aggregateRows = runs.flatMap((run) => {\n    const usage = aggregateTokenUsage(run)\n    return usage ? [{ usage, costUsd: finiteRaw(run, 'aggregate_cost_usd') }] : []\n  })\n  const aggregateCosts = aggregateRows.flatMap((row) =>\n    row.costUsd !== undefined ? [row.costUsd] : [],\n  )\n  const modelCounts = new Map<string, number>()\n  let executionErrorRuns = 0\n  let executionErrorEvents = 0\n  let errorReportingRuns = 0\n  let errorSpanEvents = 0\n  let errorSpanReportingRuns = 0\n  const terminalOutcomes: Record<RunTerminalOutcome, number> = {\n    succeeded: 0,\n    failed: 0,\n    cancelled: 0,\n    incomplete: 0,\n    unknown: 0,\n  }\n  const errorsByTerminalOutcome: ExecutionInsight['executionErrors']['byTerminalOutcome'] = {\n    succeeded: { withErrors: 0, withoutErrors: 0, unreported: 0 },\n    failed: { withErrors: 0, withoutErrors: 0, unreported: 0 },\n    cancelled: { withErrors: 0, withoutErrors: 0, unreported: 0 },\n    incomplete: { withErrors: 0, withoutErrors: 0, unreported: 0 },\n    unknown: { withErrors: 0, withoutErrors: 0, unreported: 0 },\n  }\n  let modelCallRuns = 0\n  let modelCallEvents = 0\n  let modelCallReportingRuns = 0\n\n  for (const run of runs) {\n    modelCounts.set(run.model, (modelCounts.get(run.model) ?? 0) + 1)\n    const terminalOutcome = run.terminalOutcome\n    terminalOutcomes[terminalOutcome] += 1\n    const modelCalls = nonNegativeCountRaw(run, 'llm_span_count')\n    if (modelCalls !== undefined) {\n      modelCallEvents += modelCalls\n      modelCallReportingRuns += 1\n    }\n    const usage = run.tokenUsage\n    if (\n      (modelCalls ?? 0) > 0 ||\n      usage.input > 0 ||\n      usage.output > 0 ||\n      (usage.cached ?? 0) > 0 ||\n      (usage.cacheWrite ?? 0) > 0\n    ) {\n      modelCallRuns += 1\n    }\n    const errorEvents = reportedExecutionErrorEvents(run)\n    if (errorEvents !== undefined) {\n      executionErrorEvents += errorEvents\n      errorReportingRuns += 1\n      if (errorEvents > 0) {\n        executionErrorRuns += 1\n        errorsByTerminalOutcome[terminalOutcome].withErrors += 1\n      } else errorsByTerminalOutcome[terminalOutcome].withoutErrors += 1\n    } else errorsByTerminalOutcome[terminalOutcome].unreported += 1\n    const reportedErrorSpans = nonNegativeCountRaw(run, 'error_span_count')\n    if (reportedErrorSpans !== undefined) {\n      errorSpanEvents += reportedErrorSpans\n      errorSpanReportingRuns += 1\n    }\n  }\n\n  return {\n    durationMs: distributionOf(\n      runs.map((run) => run.wallMs),\n      bins,\n    ),\n    queueMs: distributionOf(\n      runs.filter((run) => run.queueMs !== undefined).map((run) => run.queueMs!),\n      bins,\n    ),\n    tokenUsage: summarizeTokenUsage(\n      runs.map((run) => run.tokenUsage),\n      bins,\n    ),\n    aggregateUsage: {\n      runs: aggregateRows.length,\n      tokenUsage: summarizeTokenUsage(\n        aggregateRows.map((row) => row.usage),\n        bins,\n      ),\n      costUsd: distributionOf(aggregateCosts, bins),\n      totalCostUsd: aggregateCosts.reduce((total, value) => total + value, 0),\n    },\n    models: [...modelCounts.entries()]\n      .map(([model, count]) => ({ model, runs: count }))\n      .sort((left, right) => right.runs - left.runs || left.model.localeCompare(right.model)),\n    modelCalls: {\n      runs: modelCallRuns,\n      events: modelCallEvents,\n      reportingRuns: modelCallReportingRuns,\n    },\n    executionErrors: {\n      runs: executionErrorRuns,\n      fraction: errorReportingRuns > 0 ? executionErrorRuns / errorReportingRuns : null,\n      events: executionErrorEvents,\n      reportingRuns: errorReportingRuns,\n      errorSpanEvents,\n      errorSpanReportingRuns,\n      byTerminalOutcome: errorsByTerminalOutcome,\n    },\n    terminalOutcomes,\n  }\n}\n\nfunction reportedExecutionErrorEvents(run: RunRecord): number | undefined {\n  return nonNegativeCountRaw(run, 'execution_error_count')\n}\n\nfunction nonNegativeCountRaw(run: RunRecord, key: string): number | undefined {\n  const value = finiteRaw(run, key)\n  return value !== undefined && Number.isInteger(value) && value >= 0 ? value : undefined\n}\n\nfunction summarizeTokenUsage(usages: RunTokenUsage[], bins: number): TokenUsageInsight {\n  const reasoning = usages.flatMap((usage) =>\n    usage.reasoning !== undefined ? [usage.reasoning] : [],\n  )\n  const cached = usages.flatMap((usage) => (usage.cached !== undefined ? [usage.cached] : []))\n  const cacheWrite = usages.flatMap((usage) =>\n    usage.cacheWrite !== undefined ? [usage.cacheWrite] : [],\n  )\n  return {\n    input: distributionOf(\n      usages.map((usage) => usage.input),\n      bins,\n    ),\n    output: distributionOf(\n      usages.map((usage) => usage.output),\n      bins,\n    ),\n    reasoning: distributionOf(reasoning, bins),\n    cached: distributionOf(cached, bins),\n    cacheWrite: distributionOf(cacheWrite, bins),\n    totals: {\n      input: usages.reduce((total, usage) => total + usage.input, 0),\n      output: usages.reduce((total, usage) => total + usage.output, 0),\n      reasoning: reasoning.reduce((total, value) => total + value, 0),\n      cached: cached.reduce((total, value) => total + value, 0),\n      cacheWrite: cacheWrite.reduce((total, value) => total + value, 0),\n    },\n  }\n}\n\nfunction aggregateTokenUsage(run: RunRecord): RunTokenUsage | undefined {\n  const input = finiteRaw(run, 'aggregate_prompt_tokens')\n  const output = finiteRaw(run, 'aggregate_completion_tokens')\n  const reasoning = finiteRaw(run, 'aggregate_reasoning_tokens')\n  const cached = finiteRaw(run, 'aggregate_cached_tokens')\n  const cacheWrite = finiteRaw(run, 'aggregate_cache_write_tokens')\n  if (\n    input === undefined &&\n    output === undefined &&\n    reasoning === undefined &&\n    cached === undefined &&\n    cacheWrite === undefined\n  )\n    return undefined\n  return {\n    input: input ?? 0,\n    output: output ?? 0,\n    ...(reasoning !== undefined ? { reasoning } : {}),\n    ...(cached !== undefined ? { cached } : {}),\n    ...(cacheWrite !== undefined ? { cacheWrite } : {}),\n  }\n}\n\nfunction finiteRaw(run: RunRecord, key: string): number | undefined {\n  const value = run.outcome.raw[key]\n  return typeof value === 'number' && Number.isFinite(value) && value >= 0 ? value : undefined\n}\n\nfunction summarizeCostProvenance(runs: RunRecord[]): CostProvenanceSummary {\n  const summary: CostProvenanceSummary = {\n    observed: { n: 0, totalUsd: 0 },\n    estimated: { n: 0, totalUsd: 0 },\n    uncaptured: { n: 0 },\n    knownFraction: 0,\n  }\n  for (const run of runs) {\n    const cost = run.costProvenance\n    if (cost.kind === 'uncaptured') {\n      summary.uncaptured.n += 1\n    } else {\n      summary[cost.kind].n += 1\n      summary[cost.kind].totalUsd += cost.usd\n    }\n  }\n  const known = summary.observed.n + summary.estimated.n\n  summary.knownFraction = runs.length > 0 ? known / runs.length : 0\n  return summary\n}\n\nfunction diagnoseCostCoverage(runs: RunRecord[], provenance: CostProvenanceSummary): string {\n  const uncaptured = provenance.uncaptured.n\n  const known = provenance.observed.n + provenance.estimated.n\n  if (uncaptured === runs.length) {\n    return `USD cost uncaptured for all ${runs.length} runs — no observed or estimated USD values; token and wall-time metrics remain available.`\n  }\n  return `USD cost uncaptured for ${uncaptured}/${runs.length} runs; excluded those rows from cost statistics (${known}/${runs.length} retained: ${provenance.observed.n} observed, ${provenance.estimated.n} estimated).`\n}\n\n/**\n * Model-free task-failure tally.\n *\n * Explicit non-success classes are task-failure evidence.\n * A low task score without a class is counted as `unknown`.\n */\nfunction computeFailureClasses(\n  runs: RunRecord[],\n  split: 'search' | 'holdout',\n): FailureClassTally[] | undefined {\n  const counts = new Map<FailureClass, number>()\n  for (const r of runs) {\n    if (!isTaskFailure(r, split)) continue\n    const key =\n      r.failureClass !== undefined && r.failureClass !== 'success' ? r.failureClass : 'unknown'\n    counts.set(key, (counts.get(key) ?? 0) + 1)\n  }\n  if (counts.size === 0) return undefined\n  const n = runs.length\n  return [...counts.entries()]\n    .map(([failureClass, count]) => ({\n      failureClass,\n      count,\n      share: n > 0 ? count / n : 0,\n    }))\n    .sort((a, b) => b.count - a.count || a.failureClass.localeCompare(b.failureClass))\n}\n\n// ── Prior-period comparison ─────────────────────────────────────────\n\n/** Direction of the metric — does \"higher current\" mean better or worse?\n *  Composite + judge dimensions: higher is better. Cost + duration: lower\n *  is better. The recommendations engine flips the sign before judging\n *  regressed vs improved. */\ntype MetricDirection = 'higher-is-better' | 'lower-is-better'\n\nfunction computePriorPeriodComparison(\n  current: RunRecord[],\n  baseline: RunRecord[],\n  split: 'search' | 'holdout',\n  windowLabel: string | undefined,\n): PriorPeriodComparison | undefined {\n  if (current.length === 0 || baseline.length === 0) return undefined\n\n  const metrics: Record<string, MetricDelta> = {}\n  const directions: Record<string, MetricDirection> = {}\n\n  const compositeCurrent = current\n    .map((r) => compositeOf(r, split))\n    .filter(Number.isFinite) as number[]\n  const compositeBaseline = baseline\n    .map((r) => compositeOf(r, split))\n    .filter(Number.isFinite) as number[]\n  if (compositeCurrent.length > 0 && compositeBaseline.length > 0) {\n    metrics.composite = welchCompare(compositeBaseline, compositeCurrent)\n    directions.composite = 'higher-is-better'\n  }\n\n  const costCurrent = knownCostValues(current)\n  const costBaseline = knownCostValues(baseline)\n  if (costCurrent.length > 0 && costBaseline.length > 0) {\n    metrics.cost = welchCompare(costBaseline, costCurrent)\n    directions.cost = 'lower-is-better'\n  }\n\n  const durCurrent = current.map((r) => r.wallMs).filter(Number.isFinite)\n  const durBaseline = baseline.map((r) => r.wallMs).filter(Number.isFinite)\n  if (durCurrent.length > 0 && durBaseline.length > 0) {\n    metrics.duration = welchCompare(durBaseline, durCurrent)\n    directions.duration = 'lower-is-better'\n  }\n\n  const tokCurrent = current\n    .map((r) => (r.tokenUsage.input ?? 0) + (r.tokenUsage.output ?? 0))\n    .filter(Number.isFinite)\n  const tokBaseline = baseline\n    .map((r) => (r.tokenUsage.input ?? 0) + (r.tokenUsage.output ?? 0))\n    .filter(Number.isFinite)\n  if (tokCurrent.length > 0 && tokBaseline.length > 0) {\n    metrics.tokenUsage = welchCompare(tokBaseline, tokCurrent)\n    directions.tokenUsage = 'lower-is-better'\n  }\n\n  // Per-dimension judge comparisons — only for dimensions present in BOTH\n  // windows. We use perDimMean since per-judge nesting is finicky for\n  // two-sample comparisons across different judge configurations.\n  const dimsCurrent = collectPerDimension(current)\n  const dimsBaseline = collectPerDimension(baseline)\n  for (const dim of Object.keys(dimsCurrent)) {\n    const b = dimsBaseline[dim]\n    const c = dimsCurrent[dim]\n    if (!b || b.length === 0 || !c || c.length === 0) continue\n    metrics[`dim.${dim}`] = welchCompare(b, c)\n    directions[`dim.${dim}`] = 'higher-is-better'\n  }\n\n  const regressedMetrics: string[] = []\n  const improvedMetrics: string[] = []\n  for (const [name, delta] of Object.entries(metrics)) {\n    if (!delta.significant) continue\n    const dir = directions[name] ?? 'higher-is-better'\n    const better = dir === 'higher-is-better' ? delta.delta > 0 : delta.delta < 0\n    if (better) improvedMetrics.push(name)\n    else regressedMetrics.push(name)\n  }\n\n  return {\n    baselineN: baseline.length,\n    currentN: current.length,\n    ...(windowLabel ? { windowLabel } : {}),\n    metrics,\n    regressedMetrics,\n    improvedMetrics,\n  }\n}\n\nfunction knownCostValues(runs: RunRecord[]): number[] {\n  return runs\n    .filter((run) => run.costProvenance.kind !== 'uncaptured')\n    .map((run) => run.costUsd)\n    .filter(isFiniteNumber)\n}\n\nfunction isFiniteNumber(value: unknown): value is number {\n  return typeof value === 'number' && Number.isFinite(value)\n}\n\n/** Collect per-dimension values across runs (from outcome.judgeScores.perDimMean). */\nfunction collectPerDimension(runs: RunRecord[]): Record<string, number[]> {\n  const out: Record<string, number[]> = {}\n  for (const r of runs) {\n    const perDim = r.outcome.judgeScores?.perDimMean\n    if (!perDim) continue\n    for (const [dim, value] of Object.entries(perDim)) {\n      if (!Number.isFinite(value)) continue\n      if (!out[dim]) out[dim] = []\n      out[dim].push(value as number)\n    }\n  }\n  return out\n}\n\n/** Two-sample Welch comparison: unequal-variance t-test + CI on the delta\n *  + Cohen's d (pooled stddev). Significance = p < 0.05 AND |d| >= 0.2. */\nfunction welchCompare(baseline: number[], current: number[]): MetricDelta {\n  const baselineMean = mean(baseline)\n  const currentMean = mean(current)\n  const baselineVar = sampleVariance(baseline, baselineMean)\n  const currentVar = sampleVariance(current, currentMean)\n  const baselineN = baseline.length\n  const currentN = current.length\n  const delta = currentMean - baselineMean\n\n  // Welch standard error\n  const se = Math.sqrt(baselineVar / baselineN + currentVar / currentN)\n  // For 95% CI we use z=1.96 (large-n approximation). Customers running\n  // analyzeRuns will typically have n >= 30; the t-correction is\n  // negligible vs the practical noise floor.\n  const halfWidth = 1.96 * (se > 0 ? se : 0)\n  const ci95: [number, number] = [delta - halfWidth, delta + halfWidth]\n\n  // p-value via normal approximation to the t-statistic.\n  const t = se > 0 ? delta / se : 0\n  const pValue = se > 0 ? 2 * (1 - normalCdf(Math.abs(t))) : 1\n\n  // Cohen's d — pooled stddev.\n  const pooledStddev = Math.sqrt(\n    ((baselineN - 1) * baselineVar + (currentN - 1) * currentVar) /\n      Math.max(1, baselineN + currentN - 2),\n  )\n  const cohensD = pooledStddev > 0 ? delta / pooledStddev : 0\n\n  // Significance: BOTH p < 0.05 AND |d| >= 0.2 (small-effect threshold).\n  const significant = pValue < 0.05 && Math.abs(cohensD) >= 0.2\n\n  return {\n    current: currentMean,\n    baseline: baselineMean,\n    delta,\n    ci95,\n    pValue,\n    cohensD,\n    baselineN,\n    currentN,\n    significant,\n  }\n}\n\nfunction sampleVariance(xs: number[], xsMean: number): number {\n  if (xs.length < 2) return 0\n  let s = 0\n  for (const x of xs) s += (x - xsMean) ** 2\n  return s / (xs.length - 1)\n}\n\n// ── Composite + split selection ─────────────────────────────────────\n\nfunction resolveSplit(\n  runs: RunRecord[],\n  pref: 'search' | 'holdout' | 'auto',\n): 'search' | 'holdout' {\n  if (pref !== 'auto') return pref\n  const hasHoldout = runs.some((r) => Number.isFinite(observedSplitScore(r, 'holdout')))\n  return hasHoldout ? 'holdout' : 'search'\n}\n\n/**\n * RAW (`observedSplitScore`): `analyzeRuns` describes what a set of runs\n * reported, and every downstream reader of this composite — distributions,\n * per-candidate summaries, the reward-hacking correlation — needs the ungated\n * number to see an inflated run at all.\n */\nfunction compositeOf(run: RunRecord, split: 'search' | 'holdout'): number {\n  // Split-exact, no cross-split fallthrough: answering \"what did this run\n  // score on the split I am summarising\" with the other split's number\n  // silently mixes populations.\n  const score = observedSplitScore(run, split)\n  return Number.isFinite(score) ? (score as number) : Number.NaN\n}\n\n// ── Distribution helpers ────────────────────────────────────────────\n\nfunction distributionOf(\n  values: number[],\n  bins: number,\n  withIds?: Array<{ runId: string; score: number }>,\n): ScalarDistribution {\n  if (values.length === 0) {\n    return {\n      n: 0,\n      mean: null,\n      p50: null,\n      p95: null,\n      stddev: null,\n      min: null,\n      max: null,\n      histogram: [],\n    }\n  }\n  const sorted = [...values].sort((a, b) => a - b)\n  const n = sorted.length\n  const mean = sorted.reduce((s, v) => s + v, 0) / n\n  const variance = sorted.reduce((s, v) => s + (v - mean) ** 2, 0) / n\n  const stddev = Math.sqrt(variance)\n  const tailRuns = withIds\n    ? [...withIds].sort((a, b) => a.score - b.score).slice(0, Math.min(5, withIds.length))\n    : undefined\n  return {\n    n,\n    mean,\n    p50: percentile(sorted, 0.5),\n    p95: percentile(sorted, 0.95),\n    stddev,\n    min: sorted[0]!,\n    max: sorted[n - 1]!,\n    histogram: histogram(sorted, bins),\n    ...(tailRuns ? { tailRuns } : {}),\n  }\n}\n\nfunction percentile(sorted: number[], q: number): number {\n  if (sorted.length === 0) return 0\n  if (sorted.length === 1) return sorted[0]!\n  const idx = (sorted.length - 1) * q\n  const lo = Math.floor(idx)\n  const hi = Math.ceil(idx)\n  if (lo === hi) return sorted[lo]!\n  const w = idx - lo\n  return sorted[lo]! * (1 - w) + sorted[hi]! * w\n}\n\n/** Even-width histogram over the value range. Returns inclusive-lo /\n *  exclusive-hi bins (closed on right for the last bin) compatible with\n *  the substrate's `GainDistributionBin` shape. */\nfunction histogram(sorted: number[], bins: number): ScalarDistribution['histogram'] {\n  if (sorted.length === 0 || bins < 1) return []\n  const min = sorted[0]!\n  const max = sorted[sorted.length - 1]!\n  if (min === max) return [{ lo: min, hi: max, count: sorted.length }]\n  const width = (max - min) / bins\n  const out: ScalarDistribution['histogram'] = []\n  for (let i = 0; i < bins; i++) {\n    const lo = min + i * width\n    const hi = i === bins - 1 ? max : lo + width\n    out.push({ lo, hi, count: 0 })\n  }\n  for (const v of sorted) {\n    const idx = Math.min(bins - 1, Math.floor((v - min) / width))\n    out[idx]!.count++\n  }\n  return out\n}\n\nfunction computePerDimension(runs: RunRecord[], bins: number): Record<string, ScalarDistribution> {\n  // JudgeScoresRecord pre-aggregates `perDimMean` (mean across judges per\n  // dimension). We collect those means across runs to produce a per-dim\n  // distribution at the corpus level. Consumers who want per-judge\n  // dimension values reach into `perJudge[judgeId][dim]` themselves.\n  const byDim = new Map<string, number[]>()\n  for (const run of runs) {\n    const scores = run.outcome.judgeScores\n    if (!scores) continue\n    for (const [dim, value] of Object.entries(scores.perDimMean ?? {})) {\n      if (!Number.isFinite(value)) continue\n      const arr = byDim.get(dim) ?? []\n      arr.push(value)\n      byDim.set(dim, arr)\n    }\n  }\n  const out: Record<string, ScalarDistribution> = {}\n  for (const [dim, values] of byDim) out[dim] = distributionOf(values, bins)\n  return out\n}\n\n// ── Judge insights ──────────────────────────────────────────────────\n\nfunction computeJudgeInsights(runs: RunRecord[]): Record<string, JudgeInsight> {\n  // Each judge's per-run mean is the average of its per-dimension scores\n  // for that run. We aggregate those means across all runs each judge\n  // scored — giving consumers a \"this judge's typical verdict\" reading.\n  const out: Record<string, JudgeInsight> = {}\n  const byJudge = new Map<string, number[]>()\n  for (const run of runs) {\n    const scores = run.outcome.judgeScores\n    if (!scores?.perJudge) continue\n    for (const [judgeId, dims] of Object.entries(scores.perJudge)) {\n      const dimValues = Object.values(dims).filter(Number.isFinite) as number[]\n      if (dimValues.length === 0) continue\n      const judgeMean = dimValues.reduce((s, v) => s + v, 0) / dimValues.length\n      const arr = byJudge.get(judgeId) ?? []\n      arr.push(judgeMean)\n      byJudge.set(judgeId, arr)\n    }\n  }\n  for (const [judgeId, values] of byJudge) {\n    out[judgeId] = {\n      n: values.length,\n      meanScore: values.reduce((s, v) => s + v, 0) / values.length,\n    }\n  }\n  return out\n}\n\n// ── Inter-rater agreement ───────────────────────────────────────────\n\nfunction computeInterRater(\n  ratings: Array<{ runId: string; rater: string; score: number }>,\n): InterRaterInsight | undefined {\n  const byRun = new Map<string, Array<{ rater: string; score: number }>>()\n  for (const r of ratings) {\n    if (!Number.isFinite(r.score)) continue\n    const list = byRun.get(r.runId) ?? []\n    list.push({ rater: r.rater, score: r.score })\n    byRun.set(r.runId, list)\n  }\n  const raters = new Set(ratings.map((r) => r.rater))\n  const jointlyRated: string[] = []\n  for (const [runId, ratersForRun] of byRun) {\n    const seen = new Set(ratersForRun.map((r) => r.rater))\n    let all = true\n    for (const r of raters) if (!seen.has(r)) all = false\n    if (all) jointlyRated.push(runId)\n  }\n  if (raters.size < 2 || jointlyRated.length === 0) return undefined\n\n  const raterList = [...raters].sort()\n  const perPair: Record<string, number> = {}\n  for (let i = 0; i < raterList.length; i++) {\n    for (let j = i + 1; j < raterList.length; j++) {\n      const a = raterList[i]!\n      const b = raterList[j]!\n      const aScores: number[] = []\n      const bScores: number[] = []\n      for (const runId of jointlyRated) {\n        const ratersForRun = byRun.get(runId)!\n        const sa = ratersForRun.find((r) => r.rater === a)?.score\n        const sb = ratersForRun.find((r) => r.rater === b)?.score\n        if (sa !== undefined && sb !== undefined) {\n          aScores.push(sa)\n          bScores.push(sb)\n        }\n      }\n      const agreement = continuousAgreement(\n        aScores.map((score, index) => [score, bScores[index]!]),\n        { bootstrap: 0 },\n      )\n      perPair[`${a}::${b}`] = agreement.weightedKappa\n    }\n  }\n  const matrix = jointlyRated.map((runId) => {\n    const ratingsByRater = new Map(byRun.get(runId)!.map((rating) => [rating.rater, rating.score]))\n    return raterList.map((rater) => ratingsByRater.get(rater)!)\n  })\n  const agreement = continuousAgreement(matrix, { bootstrap: 0 })\n\n  const disagreementCases = jointlyRated\n    .map((runId) => {\n      const ratersForRun = byRun.get(runId)!\n      const scores = ratersForRun.map((r) => r.score)\n      const range = Math.max(...scores) - Math.min(...scores)\n      return { runId, ratings: ratersForRun, range }\n    })\n    .sort((a, b) => b.range - a.range)\n    .slice(0, 20)\n\n  return {\n    raters: raters.size,\n    jointlyRated: jointlyRated.length,\n    kappa: Number.isFinite(agreement.weightedKappa) ? agreement.weightedKappa : 0,\n    icc: agreement.icc,\n    pearson: agreement.pearson,\n    spearman: agreement.spearman,\n    perPair,\n    disagreementCases,\n  }\n}\n\n// ── Lift ────────────────────────────────────────────────────────────\n\nfunction computeLift(\n  runs: RunRecord[],\n  baselineId: string | undefined,\n  candidateId: string | undefined,\n  split: 'search' | 'holdout',\n): LiftInsight | undefined {\n  let bId = baselineId\n  let cId = candidateId\n  if (!bId || !cId) {\n    // Auto-detect: when exactly two distinct candidateIds appear, treat the\n    // lower-mean side as baseline.\n    const ids = [...new Set(runs.map((r) => r.candidateId))]\n    if (ids.length !== 2) return undefined\n    const [idA, idB] = ids as [string, string]\n    const scoresA = finiteCompositeScores(\n      runs.filter((run) => run.candidateId === idA),\n      split,\n    )\n    const scoresB = finiteCompositeScores(\n      runs.filter((run) => run.candidateId === idB),\n      split,\n    )\n    if (scoresA.length === 0 || scoresB.length === 0) return undefined\n    const meanA = mean(scoresA)\n    const meanB = mean(scoresB)\n    bId = meanA <= meanB ? idA : idB\n    cId = meanA <= meanB ? idB : idA\n  }\n\n  const baseline = runs.filter((r) => r.candidateId === bId)\n  const candidate = runs.filter((r) => r.candidateId === cId)\n  if (baseline.length === 0 || candidate.length === 0) return undefined\n\n  const scoredBaseline = baseline.filter((run) => Number.isFinite(compositeOf(run, split)))\n  const scoredCandidate = candidate.filter((run) => Number.isFinite(compositeOf(run, split)))\n  const pairing = pairRunRecords(scoredBaseline, scoredCandidate)\n  const pairedBaseline = pairing.pairs.map((pair) => compositeOf(pair.baseline, split))\n  const pairedCandidate = pairing.pairs.map((pair) => compositeOf(pair.treatment, split))\n  if (pairedBaseline.length === 0) return undefined\n\n  const baselineMean = mean(pairedBaseline)\n  const candidateMean = mean(pairedCandidate)\n  const delta = candidateMean - baselineMean\n\n  const bootstrap = pairedBootstrap(pairedBaseline, pairedCandidate, {\n    confidence: 0.95,\n    resamples: 2000,\n    statistic: 'mean',\n  })\n  const tTest = pairedTTest(pairedBaseline, pairedCandidate)\n  const d = pairedCohensDz(pairedBaseline, pairedCandidate)\n  const mde = pairedMde({ nPaired: pairedBaseline.length, power: 0.8, alpha: 0.05 })\n  const requiredN =\n    d === null || d === 0\n      ? null\n      : requiredPairedSampleSize({\n          effect: Math.abs(d),\n          power: 0.8,\n          alpha: 0.05,\n        })\n\n  return {\n    baselineMean,\n    candidateMean,\n    delta,\n    ci95: [bootstrap.low, bootstrap.high],\n    pValue: tTest.p,\n    n: pairedBaseline.length,\n    unpairedBaseline: pairing.unpairedBaseline.length,\n    unpairedCandidate: pairing.unpairedTreatment.length,\n    cohensD: d,\n    mde,\n    requiredN,\n  }\n}\n\nfunction mean(arr: number[]): number {\n  return arr.length === 0 ? 0 : arr.reduce((s, v) => s + v, 0) / arr.length\n}\n\n// ── Failure clustering ──────────────────────────────────────────────\n\nasync function computeFailureClusters(\n  runs: RunRecord[],\n  analyst: AnalystRegistry,\n  split: 'search' | 'holdout',\n): Promise<FailureClusterInsight | undefined> {\n  const failed = runs.filter((run) => isTaskFailure(run, split))\n  if (failed.length === 0) return { clusters: [], totalFailures: 0 }\n\n  const clusters = new Map<string, { exemplars: string[]; share: number }>()\n  for (const run of failed) {\n    try {\n      // AnalystRunInputs routes by field name: run-record analysts read\n      // `runRecord`. Any other shape makes every analyst skip with\n      // \"missing input\" and the clusters come back silently empty.\n      const result = await analyst.run(run.runId, { runRecord: run })\n      for (const finding of result.findings as AnalystFinding[]) {\n        const key = finding.area || finding.analyst_id || 'unclassified'\n        const c = clusters.get(key) ?? { exemplars: [], share: 0 }\n        if (c.exemplars.length < 5) c.exemplars.push(run.runId)\n        clusters.set(key, c)\n      }\n    } catch {\n      const c = clusters.get('analyst-error') ?? { exemplars: [], share: 0 }\n      if (c.exemplars.length < 5) c.exemplars.push(run.runId)\n      clusters.set('analyst-error', c)\n    }\n  }\n  const clusterList = [...clusters.entries()].map(([id, c]) => ({\n    id,\n    name: id,\n    share: c.exemplars.length / failed.length,\n    exemplars: c.exemplars,\n  }))\n  clusterList.sort((a, b) => b.share - a.share)\n  return { clusters: clusterList, totalFailures: failed.length }\n}\n\nfunction finiteCompositeScores(runs: readonly RunRecord[], split: 'search' | 'holdout'): number[] {\n  return runs.map((run) => compositeOf(run, split)).filter(Number.isFinite)\n}\n\nfunction isTaskFailure(run: RunRecord, split: 'search' | 'holdout'): boolean {\n  if (run.failureClass !== undefined && run.failureClass !== 'success') return true\n  const score = compositeOf(run, split)\n  return Number.isFinite(score) && score < 0.5\n}\n\n// ── Contamination ──────────────────────────────────────────────────\n\nfunction computeContamination(\n  runs: RunRecord[],\n  canaries: DatasetScenario[],\n): InsightReport['contamination'] {\n  let leaks = 0\n  const details: Array<{ runId: string; canary: string; matched: string }> = []\n  for (const run of runs) {\n    const output = stringifyOutput(run)\n    if (!output) continue\n    const leaksHere = checkCanaries(output, canaries)\n    for (const leak of leaksHere) {\n      leaks++\n      details.push({ runId: run.runId, canary: leak.canary, matched: leak.evidence })\n    }\n  }\n  return { leaks, holdoutAuditPassed: leaks === 0, details }\n}\n\nfunction stringifyOutput(run: RunRecord): string | undefined {\n  // RunRecord doesn't fix where \"the agent's output\" lives — different\n  // consumers stash it differently. We probe the common shapes: the\n  // outcome.raw map (numeric only by design — unlikely to contain text),\n  // and any string-valued fields tucked under metadata via type casting.\n  // Consumers with bespoke shapes pass canaryScenarios only when they\n  // know their runs carry a stringifiable surface.\n  const metadata = (run as unknown as { metadata?: Record<string, unknown> }).metadata\n  if (typeof metadata?.output === 'string') return metadata.output\n  if (typeof metadata?.text === 'string') return metadata.text\n  return undefined\n}\n\n// ── Outcome correlation + linear reward model ──────────────────────\n\nfunction computeOutcomeCorrelation(\n  runs: RunRecord[],\n  outcome: { metric: string; valueByRunId: Record<string, number> },\n  split: 'search' | 'holdout',\n): OutcomeCorrelationInsight | undefined {\n  const xs: number[] = []\n  const ys: number[] = []\n  for (const run of runs) {\n    const y = outcome.valueByRunId[run.runId]\n    if (y === undefined || !Number.isFinite(y)) continue\n    const x = compositeOf(run, split)\n    if (!Number.isFinite(x)) continue\n    xs.push(x)\n    ys.push(y)\n  }\n  if (xs.length < 3) return undefined\n\n  const p = pearsonR(xs, ys)\n  const s = spearmanR(xs, ys)\n  const meanX = mean(xs)\n  const meanY = mean(ys)\n  let num = 0\n  let denom = 0\n  for (let i = 0; i < xs.length; i++) {\n    num += (xs[i]! - meanX) * (ys[i]! - meanY)\n    denom += (xs[i]! - meanX) ** 2\n  }\n  const slope = denom === 0 ? 0 : num / denom\n  const intercept = meanY - slope * meanX\n  const ssTot = ys.reduce((a, y) => a + (y - meanY) ** 2, 0)\n  const ssRes = ys.reduce((a, y, i) => a + (y - (intercept + slope * xs[i]!)) ** 2, 0)\n  const r2 = ssTot === 0 ? 0 : 1 - ssRes / ssTot\n\n  return {\n    metric: outcome.metric,\n    n: xs.length,\n    pearson: p,\n    spearman: s,\n    rewardModel: { intercept, slope, r2 },\n  }\n}\n\n// ── Release confidence scorecard ───────────────────────────────────\n\nfunction buildReleaseScorecard(\n  composite: ScalarDistribution,\n  lift: LiftInsight | undefined,\n  contamination: InsightReport['contamination'],\n): InsightReport['release'] {\n  // Synthesise a minimal scorecard from the rolled-up signal. The\n  // substrate's `evaluateReleaseConfidence` primitive consumes a richer\n  // input shape that callers can produce by wiring SLO definitions; the\n  // shape here is the contract `selfImprove`/`analyzeRuns` consumers\n  // receive automatically. They can call `evaluateReleaseConfidence`\n  // directly when they want SLO-based axis evaluation.\n  const axes: InsightReport['release']['axes'] = []\n  const liftPass =\n    lift === undefined\n      ? ('not_evaluated' as const)\n      : lift.ci95[0] > 0\n        ? ('pass' as const)\n        : lift.delta > 0\n          ? ('warn' as const)\n          : ('fail' as const)\n  axes.push({\n    name: 'quality-lift',\n    status: liftPass,\n    detail: lift\n      ? `delta=${lift.delta.toFixed(3)}, CI95=[${lift.ci95[0].toFixed(3)}, ${lift.ci95[1].toFixed(3)}], n=${lift.n}`\n      : 'no baseline/candidate pair available',\n  })\n  const contamPass =\n    contamination === undefined\n      ? ('not_evaluated' as const)\n      : contamination.leaks === 0\n        ? ('pass' as const)\n        : ('fail' as const)\n  axes.push({\n    name: 'contamination',\n    status: contamPass,\n    detail: contamination ? `${contamination.leaks} canary leak(s)` : 'no canaries supplied',\n  })\n  axes.push(\n    composite.n === 0\n      ? {\n          name: 'composite-distribution',\n          status: 'not_evaluated',\n          detail: 'no task-quality scores available',\n        }\n      : {\n          name: 'composite-distribution',\n          status:\n            composite.mean !== null && composite.mean >= 0.5\n              ? 'pass'\n              : composite.mean !== null && composite.mean >= 0.3\n                ? 'warn'\n                : 'fail',\n          detail:\n            composite.mean === null || composite.p50 === null || composite.p95 === null\n              ? 'task-quality distribution is internally incomplete'\n              : `mean=${composite.mean.toFixed(3)}, p50=${composite.p50.toFixed(3)}, p95=${composite.p95.toFixed(3)} over n=${composite.n}`,\n        },\n  )\n  const status = axes.some((a) => a.status === 'fail')\n    ? 'fail'\n    : axes.some((a) => a.status === 'warn' || a.status === 'not_evaluated')\n      ? 'warn'\n      : 'pass'\n  return {\n    status,\n    axes,\n    issues: [],\n  }\n}\n\n// ── Recommendations engine ─────────────────────────────────────────\n\ninterface RecommendationContext {\n  composite: ScalarDistribution\n  judges: Record<string, JudgeInsight>\n  interRater?: InterRaterInsight\n  lift?: LiftInsight\n  failureClusters?: FailureClusterInsight\n  failureClasses?: FailureClassTally[]\n  contamination?: InsightReport['contamination']\n  outcomeCorrelation?: OutcomeCorrelationInsight\n  priorPeriodComparison?: PriorPeriodComparison\n  threshold: number\n}\n\nfunction buildRecommendations(ctx: RecommendationContext): Recommendation[] {\n  const out: Recommendation[] = []\n\n  // Prior-period regressions — highest customer-impact signal when present.\n  // \"Did my last change help?\" with a falsifiable answer.\n  if (ctx.priorPeriodComparison) {\n    const ppc = ctx.priorPeriodComparison\n    const label = ppc.windowLabel ?? 'baseline period'\n    for (const name of ppc.regressedMetrics) {\n      const d = ppc.metrics[name]\n      if (!d) continue\n      out.push({\n        priority: 'critical',\n        kind: 'investigate',\n        title: `${name} regressed from ${d.baseline.toFixed(3)} → ${d.current.toFixed(3)} vs ${label}`,\n        detail: `Welch CI95 = [${d.ci95[0].toFixed(3)}, ${d.ci95[1].toFixed(3)}], p=${d.pValue.toFixed(4)}, Cohen's d=${d.cohensD.toFixed(2)} (n_current=${d.currentN}, n_baseline=${d.baselineN}). The regression is statistically significant at p<0.05 with at-least-small effect size.`,\n        evidencePath: `priorPeriodComparison.metrics.${name}`,\n      })\n    }\n    for (const name of ppc.improvedMetrics) {\n      const d = ppc.metrics[name]\n      if (!d) continue\n      out.push({\n        priority: 'low',\n        kind: 'ship',\n        title: `${name} improved from ${d.baseline.toFixed(3)} → ${d.current.toFixed(3)} vs ${label}`,\n        detail: `Welch CI95 = [${d.ci95[0].toFixed(3)}, ${d.ci95[1].toFixed(3)}], p=${d.pValue.toFixed(4)}, Cohen's d=${d.cohensD.toFixed(2)} (n_current=${d.currentN}, n_baseline=${d.baselineN}). Statistically significant improvement worth flagging.`,\n        evidencePath: `priorPeriodComparison.metrics.${name}`,\n      })\n    }\n  }\n\n  // Composite-distribution branch. Fires when the overall quality signal is\n  // poor regardless of lift / contamination / clusters — the customer needs\n  // to know they have a problem AND which specific runs to inspect.\n  if (\n    ctx.composite.n > 0 &&\n    ctx.composite.mean !== null &&\n    ctx.composite.p50 !== null &&\n    ctx.composite.p95 !== null\n  ) {\n    if (ctx.composite.mean < 0.3) {\n      const tail = ctx.composite.tailRuns ?? []\n      const names = tail\n        .slice(0, 5)\n        .map((t) => `${t.runId}=${t.score.toFixed(3)}`)\n        .join(', ')\n      out.push({\n        priority: 'critical',\n        kind: 'investigate',\n        title: `Composite mean ${ctx.composite.mean.toFixed(3)} is below the 0.3 floor — the agent is broken on this corpus`,\n        detail:\n          tail.length > 0\n            ? `Worst ${tail.length} run${tail.length === 1 ? '' : 's'} to inspect first: ${names}. Histogram p50=${ctx.composite.p50.toFixed(3)}, p95=${ctx.composite.p95.toFixed(3)}.`\n            : `Histogram p50=${ctx.composite.p50.toFixed(3)}, p95=${ctx.composite.p95.toFixed(3)}.`,\n        evidencePath: 'composite.tailRuns',\n      })\n    } else if (ctx.composite.mean < 0.5) {\n      const tail = ctx.composite.tailRuns ?? []\n      const names = tail\n        .slice(0, 3)\n        .map((t) => `${t.runId}=${t.score.toFixed(3)}`)\n        .join(', ')\n      out.push({\n        priority: 'high',\n        kind: 'investigate',\n        title: `Composite mean ${ctx.composite.mean.toFixed(3)} is below 0.5 — investigate the lower tail before claiming the agent is healthy`,\n        detail:\n          tail.length > 0\n            ? `Worst ${tail.length} run${tail.length === 1 ? '' : 's'}: ${names}. Histogram p50=${ctx.composite.p50.toFixed(3)}, p95=${ctx.composite.p95.toFixed(3)}.`\n            : `Histogram p50=${ctx.composite.p50.toFixed(3)}, p95=${ctx.composite.p95.toFixed(3)}.`,\n        evidencePath: 'composite.tailRuns',\n      })\n    }\n  }\n\n  // A healthy-looking mean can hide a group of failed tasks sharing one\n  // producer-reported cause. This path does not require an analyst.\n  if (ctx.failureClasses && ctx.failureClasses.length > 0) {\n    const top = ctx.failureClasses[0]!\n    if (top.count >= 3 && top.share >= 0.15) {\n      out.push({\n        priority: top.share >= 0.25 ? 'high' : 'medium',\n        kind: 'investigate',\n        title: `'${top.failureClass}' is the dominant failure class — ${top.count} runs (${(top.share * 100).toFixed(0)}% of the corpus)`,\n        detail: `The mean composite can look acceptable while one failure class dominates the lower tail. ${top.count} of ${ctx.composite.n} runs failed with '${top.failureClass}'${ctx.failureClasses.length > 1 ? ` (next: '${ctx.failureClasses[1]!.failureClass}' ×${ctx.failureClasses[1]!.count})` : ''}. Fix this cause first.`,\n        evidencePath: 'failureClasses',\n      })\n    }\n  }\n\n  // Missing-judges branch. The report can't surface per-dimension or\n  // calibration signal when `outcome.judgeScores` is empty across the\n  // corpus. Tell the customer how to enrich.\n  if (Object.keys(ctx.judges).length === 0 && ctx.composite.n > 0) {\n    out.push({\n      priority: 'medium',\n      kind: 'expand-corpus',\n      title: 'No judge scores recorded — per-dimension + calibration insights unavailable',\n      detail:\n        'Records have no `outcome.judgeScores`. To unlock perDimension, judges, and calibration, attach a Judge run during your eval pass and populate `outcome.judgeScores.perJudge[judgeName][dimension] = score`. See `docs/insight-report.md` for the expected shape.',\n      evidencePath: 'judges',\n    })\n  }\n\n  if (ctx.lift) {\n    const pairedEffect =\n      ctx.lift.cohensD === null ? 'undefined (zero delta variance)' : ctx.lift.cohensD.toFixed(2)\n    const requiredRuns =\n      ctx.lift.requiredN === null ? 'not estimable' : `~${ctx.lift.requiredN} paired runs`\n    const decisive = ctx.lift.ci95[0] > ctx.threshold\n    const inconclusive = ctx.lift.ci95[0] <= ctx.threshold && ctx.lift.ci95[1] > ctx.threshold\n    if (decisive) {\n      out.push({\n        priority: 'critical',\n        kind: 'ship',\n        title: `Ship — lift ${ctx.lift.delta.toFixed(3)} (95% CI ${ctx.lift.ci95[0].toFixed(3)}..${ctx.lift.ci95[1].toFixed(3)})`,\n        detail: `Holdout lift exceeds threshold ${ctx.threshold} with 95% bootstrap confidence (n=${ctx.lift.n}, p=${ctx.lift.pValue.toFixed(4)}, paired d=${pairedEffect}).`,\n        evidencePath: 'lift',\n      })\n    } else if (inconclusive) {\n      out.push({\n        priority: 'high',\n        kind: 'expand-corpus',\n        title: `Inconclusive — required sample is ${requiredRuns} (have ${ctx.lift.n}) at current effect size`,\n        detail: `CI straddles threshold. Current MDE at 80% power is ${ctx.lift.mde.toFixed(3)}; observed delta is ${ctx.lift.delta.toFixed(3)}.`,\n        evidencePath: 'lift',\n      })\n    } else {\n      out.push({\n        priority: 'critical',\n        kind: 'hold',\n        title: `Hold — lift CI lower bound ${ctx.lift.ci95[0].toFixed(3)} is at or below threshold ${ctx.threshold}`,\n        detail: `Bootstrap CI provides no statistical evidence the candidate is better. Consider tightening the mutation or expanding the holdout.`,\n        evidencePath: 'lift',\n      })\n    }\n  }\n\n  if (ctx.contamination && ctx.contamination.leaks > 0) {\n    out.push({\n      priority: 'critical',\n      kind: 'fix',\n      title: `${ctx.contamination.leaks} canary leak${ctx.contamination.leaks === 1 ? '' : 's'} detected`,\n      detail: `Holdout integrity is compromised. The lift number is unreliable until you investigate.`,\n      evidencePath: 'contamination',\n    })\n  }\n\n  if (ctx.interRater && ctx.interRater.kappa < 0.5) {\n    out.push({\n      priority: 'high',\n      kind: 'recalibrate',\n      title: `Inter-rater weighted kappa ${ctx.interRater.kappa.toFixed(2)} is below 0.5`,\n      detail:\n        'Raters disagree on what good looks like. Review the largest disagreement cases and refine the rubric before automating these decisions.',\n      evidencePath: 'interRater',\n    })\n  }\n\n  if (ctx.failureClusters && ctx.failureClusters.clusters.length > 0) {\n    const top = ctx.failureClusters.clusters[0]!\n    out.push({\n      priority: 'high',\n      kind: 'investigate',\n      title: `Top failure cluster: ${top.name} (${(top.share * 100).toFixed(0)}% of failures)`,\n      detail: `${ctx.failureClusters.totalFailures} runs failed. The largest cluster groups ${top.exemplars.length} exemplars under '${top.name}'.`,\n      evidencePath: 'failureClusters.clusters[0]',\n    })\n  }\n\n  if (ctx.outcomeCorrelation && Math.abs(ctx.outcomeCorrelation.spearman) < 0.3) {\n    out.push({\n      priority: 'medium',\n      kind: 'recalibrate',\n      title: `Judge scores decoupled from ${ctx.outcomeCorrelation.metric} (Spearman ρ=${ctx.outcomeCorrelation.spearman.toFixed(2)})`,\n      detail: `Your judges score what they were trained to score, but it isn't predicting downstream ${ctx.outcomeCorrelation.metric}. Consider retraining the judge against ${ctx.outcomeCorrelation.metric} as the gold signal.`,\n      evidencePath: 'outcomeCorrelation',\n    })\n  }\n\n  return out\n}\n\n// ── Re-export pareto figure spec for hosted-side rendering ─────────\n\nexport type { ParetoFigureSpec }\n"],"mappings":";;;;;;;AA4BA,SAAgB,cAAc,QAAgB,WAA4C;CACxF,MAAM,QAAsB,CAAC;CAC7B,KAAK,MAAM,KAAK,WAAW;EACzB,IAAI,CAAC,EAAE,QAAQ;EACf,IAAI,OAAO,SAAS,EAAE,MAAM,GAC1B,MAAM,KAAK;GAAE,YAAY,EAAE;GAAI,QAAQ,EAAE;GAAQ,UAAU,QAAQ,QAAQ,EAAE,MAAM;EAAE,CAAC;CAE1F;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAAgB,sBACd,QACA,UACmB;CACnB,MAAM,UAAU,SAAS,oBAAoB,SAAS;CACtD,IAAI,CAAC,SAAS,OAAO;CACrB,MAAM,MAAM,eAAe,QAAQ,OAAO;CAC1C,IAAI,CAAC,KAAK,OAAO;CACjB,OAAO;EACL,YAAY,SAAS;EACrB,QAAQ;EACR,UAAU,QAAQ,QAAQ,GAAG;CAC/B;AACF;;;;;;;;;;AAWA,SAAgB,sBACd,OACc;CACd,MAAM,QAAsB,CAAC;CAC7B,KAAK,MAAM,KAAK,OAAO;EACrB,MAAM,OAAO,sBAAsB,EAAE,QAAQ,EAAE,QAAQ;EACvD,IAAI,MAAM,MAAM,KAAK;GAAE,GAAG;GAAM,OAAO,EAAE,SAAS,KAAK;EAAM,CAAC;CAChE;CACA,OAAO;AACT;;;;;;AAOA,SAAS,eAAe,QAAgB,SAAgC;CACtE,MAAM,KAAK,cAAc,OAAO;CAChC,IAAI,IAAI;EACN,MAAM,IAAI,OAAO,MAAM,EAAE;EACzB,OAAO,KAAK,EAAE,EAAE,CAAC,SAAS,IAAI,EAAE,KAAK;CACvC;CACA,OAAO,OAAO,SAAS,OAAO,IAAI,UAAU;AAC9C;AAEA,SAAS,cAAc,SAAgC;CACrD,IAAI,QAAQ,SAAS,KAAK,QAAQ,OAAO,KAAK,OAAO;CACrD,MAAM,OAAO,QAAQ,YAAY,GAAG;CACpC,IAAI,QAAQ,GAAG,OAAO;CACtB,MAAM,OAAO,QAAQ,MAAM,GAAG,IAAI;CAClC,MAAM,QAAQ,QAAQ,MAAM,OAAO,CAAC;CACpC,IAAI,CAAC,cAAc,KAAK,KAAK,GAAG,OAAO;CACvC,IAAI;EACF,OAAO,IAAI,OAAO,MAAM,KAAK;CAC/B,QAAQ;EACN,OAAO;CACT;AACF;;;;;;;AAQA,eAAsB,eACpB,OACA,WACuB;CACvB,MAAM,UAAU,UAAU,QAAQ,MAAM,CAAC,CAAC,EAAE,MAAM;CAClD,IAAI,QAAQ,WAAW,GAAG,OAAO,CAAC;CAClC,MAAM,QAAQ,MAAM,SAAS,KAAK;CAClC,MAAM,QAAsB,CAAC;CAC7B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,KAAK,UAAU;EAC9B,KAAK,MAAM,KAAK,SACd,IAAI,EAAE,UAAU,OAAO,SAAS,EAAE,MAAM,GACtC,MAAM,KAAK;GACT,YAAY,EAAE;GACd,QAAQ,EAAE;GACV,OAAO,KAAK;GACZ,UAAU,QAAQ,QAAQ,EAAE,MAAM;EACpC,CAAC;CAGP;CACA,OAAO;AACT;AAEA,IAAa,iBAAb,MAA4B;CAC1B;CACA,YAAgF,CAAC;CAEjF,YAAY,WAA8B;EACxC,KAAK,YAAY;CACnB;;CAGA,IAAI,YAAoB,SAAsD;EAC5E,IAAI,YAAY,gBAAgB,YAAY,aAC1C,MAAM,IAAI,MACR,wEAAwE,SAC1E;EAEF,MAAM,IAAI,KAAK,UAAU,MAAM,MAAM,EAAE,OAAO,UAAU;EACxD,IAAI,CAAC,GAAG,MAAM,IAAI,MAAM,qBAAqB,WAAW,YAAY;EACpE,KAAK,UAAU,KAAK;GAAE;GAAY;GAAS,IAAI,KAAK,IAAI;EAAE,CAAC;EAC3D,OAAO;CACT;CAEA,eAAmF;EACjF,OAAO,KAAK;CACd;AACF;AAEA,SAAS,QAAQ,QAAgB,QAAwB;CACvD,MAAM,KAAK,OAAO,QAAQ,MAAM;CAChC,IAAI,KAAK,GAAG,OAAO;CACnB,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,EAAE;CACjC,MAAM,MAAM,KAAK,IAAI,OAAO,QAAQ,KAAK,OAAO,SAAS,EAAE;CAC3D,QAAQ,QAAQ,IAAI,MAAM,MAAM,OAAO,MAAM,OAAO,GAAG,KAAK,MAAM,OAAO,SAAS,MAAM;AAC1F;;;;AC1DA,SAAgB,mBAAmB,MAAkD;CACnF,MAAM,OAAO,KAAK,KAAK,IAAI,iBAAiB;CAE5C,OAAO;EACL,WAAW,wBAAwB,MAFxB,KAAK,iBAAiB,EAEY;EAC7C,gBAAgB,wBAAwB,IAAI;CAC9C;AACF;AAEA,eAAsB,YAAY,MAAkD;CAClF,MAAM,OAAO,KAAK,KAAK,IAAI,iBAAiB;CAC5C,MAAM,OAAO,KAAK,iBAAiB;CACnC,MAAM,YAAY,KAAK,qBAAqB;CAC5C,MAAM,QAAQ,aAAa,MAAM,KAAK,SAAS,MAAM;CAErD,MAAM,mBAAmB,KACtB,KAAK,OAAO;EAAE,OAAO,EAAE;EAAO,OAAO,YAAY,GAAG,KAAK;CAAE,EAAE,CAAC,CAC9D,QAAQ,MAAM,OAAO,SAAS,EAAE,KAAK,CAAC;CACzC,MAAM,YAAY,eAChB,iBAAiB,KAAK,MAAM,EAAE,KAAK,GACnC,MACA,gBACF;CAEA,MAAM,eAAe,oBAAoB,MAAM,IAAI;CACnD,MAAM,EAAE,WAAW,gBAAgB,eAAe,mBAAmB;EACnE;EACA,eAAe;CACjB,CAAC;CACD,MAAM,gBAAgB,KAAK,QAAQ,QAAQ,IAAI,eAAe,SAAS,YAAY;CACnF,MAAM,QAAQ,cAAc,KAAK,MAAM,EAAE,OAAO,CAAC,CAAC,OAAO,cAAc;CACvE,MAAM,WAAW,eAAe,OAAO,IAAI;CAC3C,MAAM,SAAS,YAAY,eAAe,EAAE,MAAM,CAAC;CACnD,MAAM,WAA+C,CAAC;CACtD,IAAI,WAAW,WAAW,IAAI,GAC5B,SAAS,OAAO,qBAAqB,MAAM,UAAU;MAChD,IAAI,MAAM,WAAW,KAAK,MAAM,OAAO,MAAM,MAAM,CAAC,GACzD,SAAS,OAAO,OAAO,KAAK,OAAO;CAErC,IAAI,OAAO,OAAO,SAAS,GACzB,SAAS,SACP,OAAO,OAAO,WAAW,IACrB,uCACA;CAER,MAAM,cAAc;EAClB,MAAM;EACN;EACA;EACA,GAAI,SAAS,QAAQ,SAAS,SAAS,EAAE,SAAS,IAAI,CAAC;CACzD;CAEA,MAAM,SAAS,qBAAqB,IAAI;CAExC,MAAM,aAAa,KAAK,cAAc,kBAAkB,KAAK,WAAW,IAAI,KAAA;CAE5E,MAAM,OAAO,YAAY,MAAM,KAAK,qBAAqB,KAAK,sBAAsB,KAAK;CAEzF,MAAM,kBAAkB,KAAK,UACzB,MAAM,uBAAuB,MAAM,KAAK,SAAS,KAAK,IACtD,KAAA;CAEJ,MAAM,iBAAiB,sBAAsB,MAAM,KAAK;CAExD,MAAM,gBAAgB,KAAK,kBACvB,qBAAqB,MAAM,KAAK,eAAe,IAC/C,KAAA;CAEJ,MAAM,qBAAqB,KAAK,gBAC5B,0BAA0B,MAAM,KAAK,eAAe,KAAK,IACzD,KAAA;CAEJ,MAAM,UAAU,sBAAsB,WAAW,MAAM,aAAa;CAEpE,MAAM,wBAAwB,KAAK,eAC/B,6BAA6B,MAAM,KAAK,cAAc,OAAO,KAAK,aAAa,IAC/E,KAAA;CAEJ,MAAM,kBAAkB,qBAAqB;EAC3C;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CAED,OAAO;EACL,GAAG,KAAK;EACR;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,GAAI,iBAAiB,EAAE,eAAe,IAAI,CAAC;EAC3C,GAAI,wBAAwB,EAAE,sBAAsB,IAAI,CAAC;EACzD;CACF;AACF;AAEA,SAAS,wBAAwB,MAAmB,MAAgC;CAClF,MAAM,gBAAgB,KAAK,SAAS,QAAQ;EAC1C,MAAM,QAAQ,oBAAoB,GAAG;EACrC,OAAO,QAAQ,CAAC;GAAE;GAAO,SAAS,UAAU,KAAK,oBAAoB;EAAE,CAAC,IAAI,CAAC;CAC/E,CAAC;CACD,MAAM,iBAAiB,cAAc,SAAS,QAC5C,IAAI,YAAY,KAAA,IAAY,CAAC,IAAI,OAAO,IAAI,CAAC,CAC/C;CACA,MAAM,8BAAc,IAAI,IAAoB;CAC5C,IAAI,qBAAqB;CACzB,IAAI,uBAAuB;CAC3B,IAAI,qBAAqB;CACzB,IAAI,kBAAkB;CACtB,IAAI,yBAAyB;CAC7B,MAAM,mBAAuD;EAC3D,WAAW;EACX,QAAQ;EACR,WAAW;EACX,YAAY;EACZ,SAAS;CACX;CACA,MAAM,0BAAoF;EACxF,WAAW;GAAE,YAAY;GAAG,eAAe;GAAG,YAAY;EAAE;EAC5D,QAAQ;GAAE,YAAY;GAAG,eAAe;GAAG,YAAY;EAAE;EACzD,WAAW;GAAE,YAAY;GAAG,eAAe;GAAG,YAAY;EAAE;EAC5D,YAAY;GAAE,YAAY;GAAG,eAAe;GAAG,YAAY;EAAE;EAC7D,SAAS;GAAE,YAAY;GAAG,eAAe;GAAG,YAAY;EAAE;CAC5D;CACA,IAAI,gBAAgB;CACpB,IAAI,kBAAkB;CACtB,IAAI,yBAAyB;CAE7B,KAAK,MAAM,OAAO,MAAM;EACtB,YAAY,IAAI,IAAI,QAAQ,YAAY,IAAI,IAAI,KAAK,KAAK,KAAK,CAAC;EAChE,MAAM,kBAAkB,IAAI;EAC5B,iBAAiB,oBAAoB;EACrC,MAAM,aAAa,oBAAoB,KAAK,gBAAgB;EAC5D,IAAI,eAAe,KAAA,GAAW;GAC5B,mBAAmB;GACnB,0BAA0B;EAC5B;EACA,MAAM,QAAQ,IAAI;EAClB,KACG,cAAc,KAAK,KACpB,MAAM,QAAQ,KACd,MAAM,SAAS,MACd,MAAM,UAAU,KAAK,MACrB,MAAM,cAAc,KAAK,GAE1B,iBAAiB;EAEnB,MAAM,cAAc,6BAA6B,GAAG;EACpD,IAAI,gBAAgB,KAAA,GAAW;GAC7B,wBAAwB;GACxB,sBAAsB;GACtB,IAAI,cAAc,GAAG;IACnB,sBAAsB;IACtB,wBAAwB,gBAAgB,CAAC,cAAc;GACzD,OAAO,wBAAwB,gBAAgB,CAAC,iBAAiB;EACnE,OAAO,wBAAwB,gBAAgB,CAAC,cAAc;EAC9D,MAAM,qBAAqB,oBAAoB,KAAK,kBAAkB;EACtE,IAAI,uBAAuB,KAAA,GAAW;GACpC,mBAAmB;GACnB,0BAA0B;EAC5B;CACF;CAEA,OAAO;EACL,YAAY,eACV,KAAK,KAAK,QAAQ,IAAI,MAAM,GAC5B,IACF;EACA,SAAS,eACP,KAAK,QAAQ,QAAQ,IAAI,YAAY,KAAA,CAAS,CAAC,CAAC,KAAK,QAAQ,IAAI,OAAQ,GACzE,IACF;EACA,YAAY,oBACV,KAAK,KAAK,QAAQ,IAAI,UAAU,GAChC,IACF;EACA,gBAAgB;GACd,MAAM,cAAc;GACpB,YAAY,oBACV,cAAc,KAAK,QAAQ,IAAI,KAAK,GACpC,IACF;GACA,SAAS,eAAe,gBAAgB,IAAI;GAC5C,cAAc,eAAe,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC;EACxE;EACA,QAAQ,CAAC,GAAG,YAAY,QAAQ,CAAC,CAAC,CAC/B,KAAK,CAAC,OAAO,YAAY;GAAE;GAAO,MAAM;EAAM,EAAE,CAAC,CACjD,MAAM,MAAM,UAAU,MAAM,OAAO,KAAK,QAAQ,KAAK,MAAM,cAAc,MAAM,KAAK,CAAC;EACxF,YAAY;GACV,MAAM;GACN,QAAQ;GACR,eAAe;EACjB;EACA,iBAAiB;GACf,MAAM;GACN,UAAU,qBAAqB,IAAI,qBAAqB,qBAAqB;GAC7E,QAAQ;GACR,eAAe;GACf;GACA;GACA,mBAAmB;EACrB;EACA;CACF;AACF;AAEA,SAAS,6BAA6B,KAAoC;CACxE,OAAO,oBAAoB,KAAK,uBAAuB;AACzD;AAEA,SAAS,oBAAoB,KAAgB,KAAiC;CAC5E,MAAM,QAAQ,UAAU,KAAK,GAAG;CAChC,OAAO,UAAU,KAAA,KAAa,OAAO,UAAU,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAA;AAChF;AAEA,SAAS,oBAAoB,QAAyB,MAAiC;CACrF,MAAM,YAAY,OAAO,SAAS,UAChC,MAAM,cAAc,KAAA,IAAY,CAAC,MAAM,SAAS,IAAI,CAAC,CACvD;CACA,MAAM,SAAS,OAAO,SAAS,UAAW,MAAM,WAAW,KAAA,IAAY,CAAC,MAAM,MAAM,IAAI,CAAC,CAAE;CAC3F,MAAM,aAAa,OAAO,SAAS,UACjC,MAAM,eAAe,KAAA,IAAY,CAAC,MAAM,UAAU,IAAI,CAAC,CACzD;CACA,OAAO;EACL,OAAO,eACL,OAAO,KAAK,UAAU,MAAM,KAAK,GACjC,IACF;EACA,QAAQ,eACN,OAAO,KAAK,UAAU,MAAM,MAAM,GAClC,IACF;EACA,WAAW,eAAe,WAAW,IAAI;EACzC,QAAQ,eAAe,QAAQ,IAAI;EACnC,YAAY,eAAe,YAAY,IAAI;EAC3C,QAAQ;GACN,OAAO,OAAO,QAAQ,OAAO,UAAU,QAAQ,MAAM,OAAO,CAAC;GAC7D,QAAQ,OAAO,QAAQ,OAAO,UAAU,QAAQ,MAAM,QAAQ,CAAC;GAC/D,WAAW,UAAU,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC;GAC9D,QAAQ,OAAO,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC;GACxD,YAAY,WAAW,QAAQ,OAAO,UAAU,QAAQ,OAAO,CAAC;EAClE;CACF;AACF;AAEA,SAAS,oBAAoB,KAA2C;CACtE,MAAM,QAAQ,UAAU,KAAK,yBAAyB;CACtD,MAAM,SAAS,UAAU,KAAK,6BAA6B;CAC3D,MAAM,YAAY,UAAU,KAAK,4BAA4B;CAC7D,MAAM,SAAS,UAAU,KAAK,yBAAyB;CACvD,MAAM,aAAa,UAAU,KAAK,8BAA8B;CAChE,IACE,UAAU,KAAA,KACV,WAAW,KAAA,KACX,cAAc,KAAA,KACd,WAAW,KAAA,KACX,eAAe,KAAA,GAEf,OAAO,KAAA;CACT,OAAO;EACL,OAAO,SAAS;EAChB,QAAQ,UAAU;EAClB,GAAI,cAAc,KAAA,IAAY,EAAE,UAAU,IAAI,CAAC;EAC/C,GAAI,WAAW,KAAA,IAAY,EAAE,OAAO,IAAI,CAAC;EACzC,GAAI,eAAe,KAAA,IAAY,EAAE,WAAW,IAAI,CAAC;CACnD;AACF;AAEA,SAAS,UAAU,KAAgB,KAAiC;CAClE,MAAM,QAAQ,IAAI,QAAQ,IAAI;CAC9B,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAA;AACrF;AAEA,SAAS,wBAAwB,MAA0C;CACzE,MAAM,UAAiC;EACrC,UAAU;GAAE,GAAG;GAAG,UAAU;EAAE;EAC9B,WAAW;GAAE,GAAG;GAAG,UAAU;EAAE;EAC/B,YAAY,EAAE,GAAG,EAAE;EACnB,eAAe;CACjB;CACA,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,OAAO,IAAI;EACjB,IAAI,KAAK,SAAS,cAChB,QAAQ,WAAW,KAAK;OACnB;GACL,QAAQ,KAAK,KAAK,CAAC,KAAK;GACxB,QAAQ,KAAK,KAAK,CAAC,YAAY,KAAK;EACtC;CACF;CACA,MAAM,QAAQ,QAAQ,SAAS,IAAI,QAAQ,UAAU;CACrD,QAAQ,gBAAgB,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS;CAChE,OAAO;AACT;AAEA,SAAS,qBAAqB,MAAmB,YAA2C;CAC1F,MAAM,aAAa,WAAW,WAAW;CACzC,MAAM,QAAQ,WAAW,SAAS,IAAI,WAAW,UAAU;CAC3D,IAAI,eAAe,KAAK,QACtB,OAAO,+BAA+B,KAAK,OAAO;CAEpD,OAAO,2BAA2B,WAAW,GAAG,KAAK,OAAO,mDAAmD,MAAM,GAAG,KAAK,OAAO,aAAa,WAAW,SAAS,EAAE,aAAa,WAAW,UAAU,EAAE;AAC7M;;;;;;;AAQA,SAAS,sBACP,MACA,OACiC;CACjC,MAAM,yBAAS,IAAI,IAA0B;CAC7C,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,cAAc,GAAG,KAAK,GAAG;EAC9B,MAAM,MACJ,EAAE,iBAAiB,KAAA,KAAa,EAAE,iBAAiB,YAAY,EAAE,eAAe;EAClF,OAAO,IAAI,MAAM,OAAO,IAAI,GAAG,KAAK,KAAK,CAAC;CAC5C;CACA,IAAI,OAAO,SAAS,GAAG,OAAO,KAAA;CAC9B,MAAM,IAAI,KAAK;CACf,OAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CACzB,KAAK,CAAC,cAAc,YAAY;EAC/B;EACA;EACA,OAAO,IAAI,IAAI,QAAQ,IAAI;CAC7B,EAAE,CAAC,CACF,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,cAAc,EAAE,YAAY,CAAC;AACrF;AAUA,SAAS,6BACP,SACA,UACA,OACA,aACmC;CACnC,IAAI,QAAQ,WAAW,KAAK,SAAS,WAAW,GAAG,OAAO,KAAA;CAE1D,MAAM,UAAuC,CAAC;CAC9C,MAAM,aAA8C,CAAC;CAErD,MAAM,mBAAmB,QACtB,KAAK,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,CACjC,OAAO,OAAO,QAAQ;CACzB,MAAM,oBAAoB,SACvB,KAAK,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,CACjC,OAAO,OAAO,QAAQ;CACzB,IAAI,iBAAiB,SAAS,KAAK,kBAAkB,SAAS,GAAG;EAC/D,QAAQ,YAAY,aAAa,mBAAmB,gBAAgB;EACpE,WAAW,YAAY;CACzB;CAEA,MAAM,cAAc,gBAAgB,OAAO;CAC3C,MAAM,eAAe,gBAAgB,QAAQ;CAC7C,IAAI,YAAY,SAAS,KAAK,aAAa,SAAS,GAAG;EACrD,QAAQ,OAAO,aAAa,cAAc,WAAW;EACrD,WAAW,OAAO;CACpB;CAEA,MAAM,aAAa,QAAQ,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,OAAO,OAAO,QAAQ;CACtE,MAAM,cAAc,SAAS,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,OAAO,OAAO,QAAQ;CACxE,IAAI,WAAW,SAAS,KAAK,YAAY,SAAS,GAAG;EACnD,QAAQ,WAAW,aAAa,aAAa,UAAU;EACvD,WAAW,WAAW;CACxB;CAEA,MAAM,aAAa,QAChB,KAAK,OAAO,EAAE,WAAW,SAAS,MAAM,EAAE,WAAW,UAAU,EAAE,CAAC,CAClE,OAAO,OAAO,QAAQ;CACzB,MAAM,cAAc,SACjB,KAAK,OAAO,EAAE,WAAW,SAAS,MAAM,EAAE,WAAW,UAAU,EAAE,CAAC,CAClE,OAAO,OAAO,QAAQ;CACzB,IAAI,WAAW,SAAS,KAAK,YAAY,SAAS,GAAG;EACnD,QAAQ,aAAa,aAAa,aAAa,UAAU;EACzD,WAAW,aAAa;CAC1B;CAKA,MAAM,cAAc,oBAAoB,OAAO;CAC/C,MAAM,eAAe,oBAAoB,QAAQ;CACjD,KAAK,MAAM,OAAO,OAAO,KAAK,WAAW,GAAG;EAC1C,MAAM,IAAI,aAAa;EACvB,MAAM,IAAI,YAAY;EACtB,IAAI,CAAC,KAAK,EAAE,WAAW,KAAK,CAAC,KAAK,EAAE,WAAW,GAAG;EAClD,QAAQ,OAAO,SAAS,aAAa,GAAG,CAAC;EACzC,WAAW,OAAO,SAAS;CAC7B;CAEA,MAAM,mBAA6B,CAAC;CACpC,MAAM,kBAA4B,CAAC;CACnC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,GAAG;EACnD,IAAI,CAAC,MAAM,aAAa;EAGxB,KAFY,WAAW,SAAS,wBACT,qBAAqB,MAAM,QAAQ,IAAI,MAAM,QAAQ,GAChE,gBAAgB,KAAK,IAAI;OAChC,iBAAiB,KAAK,IAAI;CACjC;CAEA,OAAO;EACL,WAAW,SAAS;EACpB,UAAU,QAAQ;EAClB,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;EACrC;EACA;EACA;CACF;AACF;AAEA,SAAS,gBAAgB,MAA6B;CACpD,OAAO,KACJ,QAAQ,QAAQ,IAAI,eAAe,SAAS,YAAY,CAAC,CACzD,KAAK,QAAQ,IAAI,OAAO,CAAC,CACzB,OAAO,cAAc;AAC1B;AAEA,SAAS,eAAe,OAAiC;CACvD,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;AAC3D;;AAGA,SAAS,oBAAoB,MAA6C;CACxE,MAAM,MAAgC,CAAC;CACvC,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,SAAS,EAAE,QAAQ,aAAa;EACtC,IAAI,CAAC,QAAQ;EACb,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAAG;GACjD,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;GAC7B,IAAI,CAAC,IAAI,MAAM,IAAI,OAAO,CAAC;GAC3B,IAAI,IAAI,CAAC,KAAK,KAAe;EAC/B;CACF;CACA,OAAO;AACT;;;AAIA,SAAS,aAAa,UAAoB,SAAgC;CACxE,MAAM,eAAe,KAAK,QAAQ;CAClC,MAAM,cAAc,KAAK,OAAO;CAChC,MAAM,cAAc,eAAe,UAAU,YAAY;CACzD,MAAM,aAAa,eAAe,SAAS,WAAW;CACtD,MAAM,YAAY,SAAS;CAC3B,MAAM,WAAW,QAAQ;CACzB,MAAM,QAAQ,cAAc;CAG5B,MAAM,KAAK,KAAK,KAAK,cAAc,YAAY,aAAa,QAAQ;CAIpE,MAAM,YAAY,QAAQ,KAAK,IAAI,KAAK;CACxC,MAAM,OAAyB,CAAC,QAAQ,WAAW,QAAQ,SAAS;CAGpE,MAAM,IAAI,KAAK,IAAI,QAAQ,KAAK;CAChC,MAAM,SAAS,KAAK,IAAI,KAAK,IAAI,UAAU,KAAK,IAAI,CAAC,CAAC,KAAK;CAG3D,MAAM,eAAe,KAAK,OACtB,YAAY,KAAK,eAAe,WAAW,KAAK,cAChD,KAAK,IAAI,GAAG,YAAY,WAAW,CAAC,CACxC;CACA,MAAM,UAAU,eAAe,IAAI,QAAQ,eAAe;CAK1D,OAAO;EACL,SAAS;EACT,UAAU;EACV;EACA;EACA;EACA;EACA;EACA;EACA,aAXkB,SAAS,OAAQ,KAAK,IAAI,OAAO,KAAK;CAY1D;AACF;AAEA,SAAS,eAAe,IAAc,QAAwB;CAC5D,IAAI,GAAG,SAAS,GAAG,OAAO;CAC1B,IAAI,IAAI;CACR,KAAK,MAAM,KAAK,IAAI,MAAM,IAAI,WAAW;CACzC,OAAO,KAAK,GAAG,SAAS;AAC1B;AAIA,SAAS,aACP,MACA,MACsB;CACtB,IAAI,SAAS,QAAQ,OAAO;CAE5B,OADmB,KAAK,MAAM,MAAM,OAAO,SAAS,mBAAmB,GAAG,SAAS,CAAC,CACpE,IAAI,YAAY;AAClC;;;;;;;AAQA,SAAS,YAAY,KAAgB,OAAqC;CAIxE,MAAM,QAAQ,mBAAmB,KAAK,KAAK;CAC3C,OAAO,OAAO,SAAS,KAAK,IAAK,QAAmB;AACtD;AAIA,SAAS,eACP,QACA,MACA,SACoB;CACpB,IAAI,OAAO,WAAW,GACpB,OAAO;EACL,GAAG;EACH,MAAM;EACN,KAAK;EACL,KAAK;EACL,QAAQ;EACR,KAAK;EACL,KAAK;EACL,WAAW,CAAC;CACd;CAEF,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAC/C,MAAM,IAAI,OAAO;CACjB,MAAM,OAAO,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CACjD,MAAM,WAAW,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,SAAS,GAAG,CAAC,IAAI;CACnE,MAAM,SAAS,KAAK,KAAK,QAAQ;CACjC,MAAM,WAAW,UACb,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,KAAK,IAAI,GAAG,QAAQ,MAAM,CAAC,IACnF,KAAA;CACJ,OAAO;EACL;EACA;EACA,KAAK,WAAW,QAAQ,EAAG;EAC3B,KAAK,WAAW,QAAQ,GAAI;EAC5B;EACA,KAAK,OAAO;EACZ,KAAK,OAAO,IAAI;EAChB,WAAW,UAAU,QAAQ,IAAI;EACjC,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;CACjC;AACF;AAEA,SAAS,WAAW,QAAkB,GAAmB;CACvD,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,IAAI,OAAO,WAAW,GAAG,OAAO,OAAO;CACvC,MAAM,OAAO,OAAO,SAAS,KAAK;CAClC,MAAM,KAAK,KAAK,MAAM,GAAG;CACzB,MAAM,KAAK,KAAK,KAAK,GAAG;CACxB,IAAI,OAAO,IAAI,OAAO,OAAO;CAC7B,MAAM,IAAI,MAAM;CAChB,OAAO,OAAO,OAAQ,IAAI,KAAK,OAAO,MAAO;AAC/C;;;;AAKA,SAAS,UAAU,QAAkB,MAA+C;CAClF,IAAI,OAAO,WAAW,KAAK,OAAO,GAAG,OAAO,CAAC;CAC7C,MAAM,MAAM,OAAO;CACnB,MAAM,MAAM,OAAO,OAAO,SAAS;CACnC,IAAI,QAAQ,KAAK,OAAO,CAAC;EAAE,IAAI;EAAK,IAAI;EAAK,OAAO,OAAO;CAAO,CAAC;CACnE,MAAM,SAAS,MAAM,OAAO;CAC5B,MAAM,MAAuC,CAAC;CAC9C,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK;EAC7B,MAAM,KAAK,MAAM,IAAI;EACrB,MAAM,KAAK,MAAM,OAAO,IAAI,MAAM,KAAK;EACvC,IAAI,KAAK;GAAE;GAAI;GAAI,OAAO;EAAE,CAAC;CAC/B;CACA,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,MAAM,KAAK,IAAI,OAAO,GAAG,KAAK,OAAO,IAAI,OAAO,KAAK,CAAC;EAC5D,IAAI,IAAI,CAAE;CACZ;CACA,OAAO;AACT;AAEA,SAAS,oBAAoB,MAAmB,MAAkD;CAKhG,MAAM,wBAAQ,IAAI,IAAsB;CACxC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,SAAS,IAAI,QAAQ;EAC3B,IAAI,CAAC,QAAQ;EACb,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,OAAO,cAAc,CAAC,CAAC,GAAG;GAClE,IAAI,CAAC,OAAO,SAAS,KAAK,GAAG;GAC7B,MAAM,MAAM,MAAM,IAAI,GAAG,KAAK,CAAC;GAC/B,IAAI,KAAK,KAAK;GACd,MAAM,IAAI,KAAK,GAAG;EACpB;CACF;CACA,MAAM,MAA0C,CAAC;CACjD,KAAK,MAAM,CAAC,KAAK,WAAW,OAAO,IAAI,OAAO,eAAe,QAAQ,IAAI;CACzE,OAAO;AACT;AAIA,SAAS,qBAAqB,MAAiD;CAI7E,MAAM,MAAoC,CAAC;CAC3C,MAAM,0BAAU,IAAI,IAAsB;CAC1C,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,SAAS,IAAI,QAAQ;EAC3B,IAAI,CAAC,QAAQ,UAAU;EACvB,KAAK,MAAM,CAAC,SAAS,SAAS,OAAO,QAAQ,OAAO,QAAQ,GAAG;GAC7D,MAAM,YAAY,OAAO,OAAO,IAAI,CAAC,CAAC,OAAO,OAAO,QAAQ;GAC5D,IAAI,UAAU,WAAW,GAAG;GAC5B,MAAM,YAAY,UAAU,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,UAAU;GACnE,MAAM,MAAM,QAAQ,IAAI,OAAO,KAAK,CAAC;GACrC,IAAI,KAAK,SAAS;GAClB,QAAQ,IAAI,SAAS,GAAG;EAC1B;CACF;CACA,KAAK,MAAM,CAAC,SAAS,WAAW,SAC9B,IAAI,WAAW;EACb,GAAG,OAAO;EACV,WAAW,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;CACxD;CAEF,OAAO;AACT;AAIA,SAAS,kBACP,SAC+B;CAC/B,MAAM,wBAAQ,IAAI,IAAqD;CACvE,KAAK,MAAM,KAAK,SAAS;EACvB,IAAI,CAAC,OAAO,SAAS,EAAE,KAAK,GAAG;EAC/B,MAAM,OAAO,MAAM,IAAI,EAAE,KAAK,KAAK,CAAC;EACpC,KAAK,KAAK;GAAE,OAAO,EAAE;GAAO,OAAO,EAAE;EAAM,CAAC;EAC5C,MAAM,IAAI,EAAE,OAAO,IAAI;CACzB;CACA,MAAM,SAAS,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,KAAK,CAAC;CAClD,MAAM,eAAyB,CAAC;CAChC,KAAK,MAAM,CAAC,OAAO,iBAAiB,OAAO;EACzC,MAAM,OAAO,IAAI,IAAI,aAAa,KAAK,MAAM,EAAE,KAAK,CAAC;EACrD,IAAI,MAAM;EACV,KAAK,MAAM,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,MAAM;EAChD,IAAI,KAAK,aAAa,KAAK,KAAK;CAClC;CACA,IAAI,OAAO,OAAO,KAAK,aAAa,WAAW,GAAG,OAAO,KAAA;CAEzD,MAAM,YAAY,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK;CACnC,MAAM,UAAkC,CAAC;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KACpC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;EAC7C,MAAM,IAAI,UAAU;EACpB,MAAM,IAAI,UAAU;EACpB,MAAM,UAAoB,CAAC;EAC3B,MAAM,UAAoB,CAAC;EAC3B,KAAK,MAAM,SAAS,cAAc;GAChC,MAAM,eAAe,MAAM,IAAI,KAAK;GACpC,MAAM,KAAK,aAAa,MAAM,MAAM,EAAE,UAAU,CAAC,CAAC,EAAE;GACpD,MAAM,KAAK,aAAa,MAAM,MAAM,EAAE,UAAU,CAAC,CAAC,EAAE;GACpD,IAAI,OAAO,KAAA,KAAa,OAAO,KAAA,GAAW;IACxC,QAAQ,KAAK,EAAE;IACf,QAAQ,KAAK,EAAE;GACjB;EACF;EACA,MAAM,YAAY,oBAChB,QAAQ,KAAK,OAAO,UAAU,CAAC,OAAO,QAAQ,MAAO,CAAC,GACtD,EAAE,WAAW,EAAE,CACjB;EACA,QAAQ,GAAG,EAAE,IAAI,OAAO,UAAU;CACpC;CAMF,MAAM,YAAY,oBAJH,aAAa,KAAK,UAAU;EACzC,MAAM,iBAAiB,IAAI,IAAI,MAAM,IAAI,KAAK,CAAC,CAAE,KAAK,WAAW,CAAC,OAAO,OAAO,OAAO,KAAK,CAAC,CAAC;EAC9F,OAAO,UAAU,KAAK,UAAU,eAAe,IAAI,KAAK,CAAE;CAC5D,CAC2C,GAAG,EAAE,WAAW,EAAE,CAAC;CAE9D,MAAM,oBAAoB,aACvB,KAAK,UAAU;EACd,MAAM,eAAe,MAAM,IAAI,KAAK;EACpC,MAAM,SAAS,aAAa,KAAK,MAAM,EAAE,KAAK;EAE9C,OAAO;GAAE;GAAO,SAAS;GAAc,OADzB,KAAK,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,GAAG,MAAM;EACT;CAC/C,CAAC,CAAC,CACD,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CACjC,MAAM,GAAG,EAAE;CAEd,OAAO;EACL,QAAQ,OAAO;EACf,cAAc,aAAa;EAC3B,OAAO,OAAO,SAAS,UAAU,aAAa,IAAI,UAAU,gBAAgB;EAC5E,KAAK,UAAU;EACf,SAAS,UAAU;EACnB,UAAU,UAAU;EACpB;EACA;CACF;AACF;AAIA,SAAS,YACP,MACA,YACA,aACA,OACyB;CACzB,IAAI,MAAM;CACV,IAAI,MAAM;CACV,IAAI,CAAC,OAAO,CAAC,KAAK;EAGhB,MAAM,MAAM,CAAC,GAAG,IAAI,IAAI,KAAK,KAAK,MAAM,EAAE,WAAW,CAAC,CAAC;EACvD,IAAI,IAAI,WAAW,GAAG,OAAO,KAAA;EAC7B,MAAM,CAAC,KAAK,OAAO;EACnB,MAAM,UAAU,sBACd,KAAK,QAAQ,QAAQ,IAAI,gBAAgB,GAAG,GAC5C,KACF;EACA,MAAM,UAAU,sBACd,KAAK,QAAQ,QAAQ,IAAI,gBAAgB,GAAG,GAC5C,KACF;EACA,IAAI,QAAQ,WAAW,KAAK,QAAQ,WAAW,GAAG,OAAO,KAAA;EACzD,MAAM,QAAQ,KAAK,OAAO;EAC1B,MAAM,QAAQ,KAAK,OAAO;EAC1B,MAAM,SAAS,QAAQ,MAAM;EAC7B,MAAM,SAAS,QAAQ,MAAM;CAC/B;CAEA,MAAM,WAAW,KAAK,QAAQ,MAAM,EAAE,gBAAgB,GAAG;CACzD,MAAM,YAAY,KAAK,QAAQ,MAAM,EAAE,gBAAgB,GAAG;CAC1D,IAAI,SAAS,WAAW,KAAK,UAAU,WAAW,GAAG,OAAO,KAAA;CAI5D,MAAM,UAAU,eAFO,SAAS,QAAQ,QAAQ,OAAO,SAAS,YAAY,KAAK,KAAK,CAAC,CAE3C,GADpB,UAAU,QAAQ,QAAQ,OAAO,SAAS,YAAY,KAAK,KAAK,CAAC,CAC5B,CAAC;CAC9D,MAAM,iBAAiB,QAAQ,MAAM,KAAK,SAAS,YAAY,KAAK,UAAU,KAAK,CAAC;CACpF,MAAM,kBAAkB,QAAQ,MAAM,KAAK,SAAS,YAAY,KAAK,WAAW,KAAK,CAAC;CACtF,IAAI,eAAe,WAAW,GAAG,OAAO,KAAA;CAExC,MAAM,eAAe,KAAK,cAAc;CACxC,MAAM,gBAAgB,KAAK,eAAe;CAC1C,MAAM,QAAQ,gBAAgB;CAE9B,MAAM,YAAY,gBAAgB,gBAAgB,iBAAiB;EACjE,YAAY;EACZ,WAAW;EACX,WAAW;CACb,CAAC;CACD,MAAM,QAAQ,YAAY,gBAAgB,eAAe;CACzD,MAAM,IAAI,eAAe,gBAAgB,eAAe;CACxD,MAAM,MAAM,UAAU;EAAE,SAAS,eAAe;EAAQ,OAAO;EAAK,OAAO;CAAK,CAAC;CACjF,MAAM,YACJ,MAAM,QAAQ,MAAM,IAChB,OACA,yBAAyB;EACvB,QAAQ,KAAK,IAAI,CAAC;EAClB,OAAO;EACP,OAAO;CACT,CAAC;CAEP,OAAO;EACL;EACA;EACA;EACA,MAAM,CAAC,UAAU,KAAK,UAAU,IAAI;EACpC,QAAQ,MAAM;EACd,GAAG,eAAe;EAClB,kBAAkB,QAAQ,iBAAiB;EAC3C,mBAAmB,QAAQ,kBAAkB;EAC7C,SAAS;EACT;EACA;CACF;AACF;AAEA,SAAS,KAAK,KAAuB;CACnC,OAAO,IAAI,WAAW,IAAI,IAAI,IAAI,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI;AACrE;AAIA,eAAe,uBACb,MACA,SACA,OAC4C;CAC5C,MAAM,SAAS,KAAK,QAAQ,QAAQ,cAAc,KAAK,KAAK,CAAC;CAC7D,IAAI,OAAO,WAAW,GAAG,OAAO;EAAE,UAAU,CAAC;EAAG,eAAe;CAAE;CAEjE,MAAM,2BAAW,IAAI,IAAoD;CACzE,KAAK,MAAM,OAAO,QAChB,IAAI;EAIF,MAAM,SAAS,MAAM,QAAQ,IAAI,IAAI,OAAO,EAAE,WAAW,IAAI,CAAC;EAC9D,KAAK,MAAM,WAAW,OAAO,UAA8B;GACzD,MAAM,MAAM,QAAQ,QAAQ,QAAQ,cAAc;GAClD,MAAM,IAAI,SAAS,IAAI,GAAG,KAAK;IAAE,WAAW,CAAC;IAAG,OAAO;GAAE;GACzD,IAAI,EAAE,UAAU,SAAS,GAAG,EAAE,UAAU,KAAK,IAAI,KAAK;GACtD,SAAS,IAAI,KAAK,CAAC;EACrB;CACF,QAAQ;EACN,MAAM,IAAI,SAAS,IAAI,eAAe,KAAK;GAAE,WAAW,CAAC;GAAG,OAAO;EAAE;EACrE,IAAI,EAAE,UAAU,SAAS,GAAG,EAAE,UAAU,KAAK,IAAI,KAAK;EACtD,SAAS,IAAI,iBAAiB,CAAC;CACjC;CAEF,MAAM,cAAc,CAAC,GAAG,SAAS,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,QAAQ;EAC5D;EACA,MAAM;EACN,OAAO,EAAE,UAAU,SAAS,OAAO;EACnC,WAAW,EAAE;CACf,EAAE;CACF,YAAY,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CAC5C,OAAO;EAAE,UAAU;EAAa,eAAe,OAAO;CAAO;AAC/D;AAEA,SAAS,sBAAsB,MAA4B,OAAuC;CAChG,OAAO,KAAK,KAAK,QAAQ,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,QAAQ;AAC1E;AAEA,SAAS,cAAc,KAAgB,OAAsC;CAC3E,IAAI,IAAI,iBAAiB,KAAA,KAAa,IAAI,iBAAiB,WAAW,OAAO;CAC7E,MAAM,QAAQ,YAAY,KAAK,KAAK;CACpC,OAAO,OAAO,SAAS,KAAK,KAAK,QAAQ;AAC3C;AAIA,SAAS,qBACP,MACA,UACgC;CAChC,IAAI,QAAQ;CACZ,MAAM,UAAqE,CAAC;CAC5E,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,SAAS,gBAAgB,GAAG;EAClC,IAAI,CAAC,QAAQ;EACb,MAAM,YAAY,cAAc,QAAQ,QAAQ;EAChD,KAAK,MAAM,QAAQ,WAAW;GAC5B;GACA,QAAQ,KAAK;IAAE,OAAO,IAAI;IAAO,QAAQ,KAAK;IAAQ,SAAS,KAAK;GAAS,CAAC;EAChF;CACF;CACA,OAAO;EAAE;EAAO,oBAAoB,UAAU;EAAG;CAAQ;AAC3D;AAEA,SAAS,gBAAgB,KAAoC;CAO3D,MAAM,WAAY,IAA0D;CAC5E,IAAI,OAAO,UAAU,WAAW,UAAU,OAAO,SAAS;CAC1D,IAAI,OAAO,UAAU,SAAS,UAAU,OAAO,SAAS;AAE1D;AAIA,SAAS,0BACP,MACA,SACA,OACuC;CACvC,MAAM,KAAe,CAAC;CACtB,MAAM,KAAe,CAAC;CACtB,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,IAAI,QAAQ,aAAa,IAAI;EACnC,IAAI,MAAM,KAAA,KAAa,CAAC,OAAO,SAAS,CAAC,GAAG;EAC5C,MAAM,IAAI,YAAY,KAAK,KAAK;EAChC,IAAI,CAAC,OAAO,SAAS,CAAC,GAAG;EACzB,GAAG,KAAK,CAAC;EACT,GAAG,KAAK,CAAC;CACX;CACA,IAAI,GAAG,SAAS,GAAG,OAAO,KAAA;CAE1B,MAAM,IAAI,SAAS,IAAI,EAAE;CACzB,MAAM,IAAI,UAAU,IAAI,EAAE;CAC1B,MAAM,QAAQ,KAAK,EAAE;CACrB,MAAM,QAAQ,KAAK,EAAE;CACrB,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;EAClC,QAAQ,GAAG,KAAM,UAAU,GAAG,KAAM;EACpC,UAAU,GAAG,KAAM,UAAU;CAC/B;CACA,MAAM,QAAQ,UAAU,IAAI,IAAI,MAAM;CACtC,MAAM,YAAY,QAAQ,QAAQ;CAClC,MAAM,QAAQ,GAAG,QAAQ,GAAG,MAAM,KAAK,IAAI,UAAU,GAAG,CAAC;CACzD,MAAM,QAAQ,GAAG,QAAQ,GAAG,GAAG,MAAM,KAAK,KAAK,YAAY,QAAQ,GAAG,QAAS,GAAG,CAAC;CACnF,MAAM,KAAK,UAAU,IAAI,IAAI,IAAI,QAAQ;CAEzC,OAAO;EACL,QAAQ,QAAQ;EAChB,GAAG,GAAG;EACN,SAAS;EACT,UAAU;EACV,aAAa;GAAE;GAAW;GAAO;EAAG;CACtC;AACF;AAIA,SAAS,sBACP,WACA,MACA,eAC0B;CAO1B,MAAM,OAAyC,CAAC;CAChD,MAAM,WACJ,SAAS,KAAA,IACJ,kBACD,KAAK,KAAK,KAAK,IACZ,SACD,KAAK,QAAQ,IACV,SACA;CACX,KAAK,KAAK;EACR,MAAM;EACN,QAAQ;EACR,QAAQ,OACJ,SAAS,KAAK,MAAM,QAAQ,CAAC,EAAE,UAAU,KAAK,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,KAAK,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,KAAK,MACzG;CACN,CAAC;CACD,MAAM,aACJ,kBAAkB,KAAA,IACb,kBACD,cAAc,UAAU,IACrB,SACA;CACT,KAAK,KAAK;EACR,MAAM;EACN,QAAQ;EACR,QAAQ,gBAAgB,GAAG,cAAc,MAAM,mBAAmB;CACpE,CAAC;CACD,KAAK,KACH,UAAU,MAAM,IACZ;EACE,MAAM;EACN,QAAQ;EACR,QAAQ;CACV,IACA;EACE,MAAM;EACN,QACE,UAAU,SAAS,QAAQ,UAAU,QAAQ,KACzC,SACA,UAAU,SAAS,QAAQ,UAAU,QAAQ,KAC3C,SACA;EACR,QACE,UAAU,SAAS,QAAQ,UAAU,QAAQ,QAAQ,UAAU,QAAQ,OACnE,uDACA,QAAQ,UAAU,KAAK,QAAQ,CAAC,EAAE,QAAQ,UAAU,IAAI,QAAQ,CAAC,EAAE,QAAQ,UAAU,IAAI,QAAQ,CAAC,EAAE,UAAU,UAAU;CAChI,CACN;CAMA,OAAO;EACL,QANa,KAAK,MAAM,MAAM,EAAE,WAAW,MAAM,IAC/C,SACA,KAAK,MAAM,MAAM,EAAE,WAAW,UAAU,EAAE,WAAW,eAAe,IAClE,SACA;EAGJ;EACA,QAAQ,CAAC;CACX;AACF;AAiBA,SAAS,qBAAqB,KAA8C;CAC1E,MAAM,MAAwB,CAAC;CAI/B,IAAI,IAAI,uBAAuB;EAC7B,MAAM,MAAM,IAAI;EAChB,MAAM,QAAQ,IAAI,eAAe;EACjC,KAAK,MAAM,QAAQ,IAAI,kBAAkB;GACvC,MAAM,IAAI,IAAI,QAAQ;GACtB,IAAI,CAAC,GAAG;GACR,IAAI,KAAK;IACP,UAAU;IACV,MAAM;IACN,OAAO,GAAG,KAAK,kBAAkB,EAAE,SAAS,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,QAAQ,CAAC,EAAE,MAAM;IACvF,QAAQ,iBAAiB,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,OAAO,QAAQ,CAAC,EAAE,cAAc,EAAE,QAAQ,QAAQ,CAAC,EAAE,cAAc,EAAE,SAAS,eAAe,EAAE,UAAU;IACzL,cAAc,iCAAiC;GACjD,CAAC;EACH;EACA,KAAK,MAAM,QAAQ,IAAI,iBAAiB;GACtC,MAAM,IAAI,IAAI,QAAQ;GACtB,IAAI,CAAC,GAAG;GACR,IAAI,KAAK;IACP,UAAU;IACV,MAAM;IACN,OAAO,GAAG,KAAK,iBAAiB,EAAE,SAAS,QAAQ,CAAC,EAAE,KAAK,EAAE,QAAQ,QAAQ,CAAC,EAAE,MAAM;IACtF,QAAQ,iBAAiB,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,OAAO,QAAQ,CAAC,EAAE,cAAc,EAAE,QAAQ,QAAQ,CAAC,EAAE,cAAc,EAAE,SAAS,eAAe,EAAE,UAAU;IACzL,cAAc,iCAAiC;GACjD,CAAC;EACH;CACF;CAKA,IACE,IAAI,UAAU,IAAI,KAClB,IAAI,UAAU,SAAS,QACvB,IAAI,UAAU,QAAQ,QACtB,IAAI,UAAU,QAAQ,MAElB;MAAA,IAAI,UAAU,OAAO,IAAK;GAC5B,MAAM,OAAO,IAAI,UAAU,YAAY,CAAC;GACxC,MAAM,QAAQ,KACX,MAAM,GAAG,CAAC,CAAC,CACX,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,QAAQ,CAAC,GAAG,CAAC,CAC9C,KAAK,IAAI;GACZ,IAAI,KAAK;IACP,UAAU;IACV,MAAM;IACN,OAAO,kBAAkB,IAAI,UAAU,KAAK,QAAQ,CAAC,EAAE;IACvD,QACE,KAAK,SAAS,IACV,SAAS,KAAK,OAAO,MAAM,KAAK,WAAW,IAAI,KAAK,IAAI,qBAAqB,MAAM,kBAAkB,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE,QAAQ,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE,KACvK,iBAAiB,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE,QAAQ,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE;IACzF,cAAc;GAChB,CAAC;EACH,OAAO,IAAI,IAAI,UAAU,OAAO,IAAK;GACnC,MAAM,OAAO,IAAI,UAAU,YAAY,CAAC;GACxC,MAAM,QAAQ,KACX,MAAM,GAAG,CAAC,CAAC,CACX,KAAK,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,MAAM,QAAQ,CAAC,GAAG,CAAC,CAC9C,KAAK,IAAI;GACZ,IAAI,KAAK;IACP,UAAU;IACV,MAAM;IACN,OAAO,kBAAkB,IAAI,UAAU,KAAK,QAAQ,CAAC,EAAE;IACvD,QACE,KAAK,SAAS,IACV,SAAS,KAAK,OAAO,MAAM,KAAK,WAAW,IAAI,KAAK,IAAI,IAAI,MAAM,kBAAkB,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE,QAAQ,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE,KACtJ,iBAAiB,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE,QAAQ,IAAI,UAAU,IAAI,QAAQ,CAAC,EAAE;IACzF,cAAc;GAChB,CAAC;EACH;;CAKF,IAAI,IAAI,kBAAkB,IAAI,eAAe,SAAS,GAAG;EACvD,MAAM,MAAM,IAAI,eAAe;EAC/B,IAAI,IAAI,SAAS,KAAK,IAAI,SAAS,KACjC,IAAI,KAAK;GACP,UAAU,IAAI,SAAS,MAAO,SAAS;GACvC,MAAM;GACN,OAAO,IAAI,IAAI,aAAa,oCAAoC,IAAI,MAAM,UAAU,IAAI,QAAQ,IAAA,CAAK,QAAQ,CAAC,EAAE;GAChH,QAAQ,4FAA4F,IAAI,MAAM,MAAM,IAAI,UAAU,EAAE,qBAAqB,IAAI,aAAa,GAAG,IAAI,eAAe,SAAS,IAAI,YAAY,IAAI,eAAe,EAAE,CAAE,aAAa,KAAK,IAAI,eAAe,EAAE,CAAE,MAAM,KAAK,GAAG;GACvS,cAAc;EAChB,CAAC;CAEL;CAKA,IAAI,OAAO,KAAK,IAAI,MAAM,CAAC,CAAC,WAAW,KAAK,IAAI,UAAU,IAAI,GAC5D,IAAI,KAAK;EACP,UAAU;EACV,MAAM;EACN,OAAO;EACP,QACE;EACF,cAAc;CAChB,CAAC;CAGH,IAAI,IAAI,MAAM;EACZ,MAAM,eACJ,IAAI,KAAK,YAAY,OAAO,oCAAoC,IAAI,KAAK,QAAQ,QAAQ,CAAC;EAC5F,MAAM,eACJ,IAAI,KAAK,cAAc,OAAO,kBAAkB,IAAI,IAAI,KAAK,UAAU;EACzE,MAAM,WAAW,IAAI,KAAK,KAAK,KAAK,IAAI;EACxC,MAAM,eAAe,IAAI,KAAK,KAAK,MAAM,IAAI,aAAa,IAAI,KAAK,KAAK,KAAK,IAAI;EACjF,IAAI,UACF,IAAI,KAAK;GACP,UAAU;GACV,MAAM;GACN,OAAO,eAAe,IAAI,KAAK,MAAM,QAAQ,CAAC,EAAE,WAAW,IAAI,KAAK,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE;GACvH,QAAQ,kCAAkC,IAAI,UAAU,oCAAoC,IAAI,KAAK,EAAE,MAAM,IAAI,KAAK,OAAO,QAAQ,CAAC,EAAE,aAAa,aAAa;GAClK,cAAc;EAChB,CAAC;OACI,IAAI,cACT,IAAI,KAAK;GACP,UAAU;GACV,MAAM;GACN,OAAO,qCAAqC,aAAa,SAAS,IAAI,KAAK,EAAE;GAC7E,QAAQ,uDAAuD,IAAI,KAAK,IAAI,QAAQ,CAAC,EAAE,sBAAsB,IAAI,KAAK,MAAM,QAAQ,CAAC,EAAE;GACvI,cAAc;EAChB,CAAC;OAED,IAAI,KAAK;GACP,UAAU;GACV,MAAM;GACN,OAAO,8BAA8B,IAAI,KAAK,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,4BAA4B,IAAI;GACjG,QAAQ;GACR,cAAc;EAChB,CAAC;CAEL;CAEA,IAAI,IAAI,iBAAiB,IAAI,cAAc,QAAQ,GACjD,IAAI,KAAK;EACP,UAAU;EACV,MAAM;EACN,OAAO,GAAG,IAAI,cAAc,MAAM,cAAc,IAAI,cAAc,UAAU,IAAI,KAAK,IAAI;EACzF,QAAQ;EACR,cAAc;CAChB,CAAC;CAGH,IAAI,IAAI,cAAc,IAAI,WAAW,QAAQ,IAC3C,IAAI,KAAK;EACP,UAAU;EACV,MAAM;EACN,OAAO,8BAA8B,IAAI,WAAW,MAAM,QAAQ,CAAC,EAAE;EACrE,QACE;EACF,cAAc;CAChB,CAAC;CAGH,IAAI,IAAI,mBAAmB,IAAI,gBAAgB,SAAS,SAAS,GAAG;EAClE,MAAM,MAAM,IAAI,gBAAgB,SAAS;EACzC,IAAI,KAAK;GACP,UAAU;GACV,MAAM;GACN,OAAO,wBAAwB,IAAI,KAAK,KAAK,IAAI,QAAQ,IAAA,CAAK,QAAQ,CAAC,EAAE;GACzE,QAAQ,GAAG,IAAI,gBAAgB,cAAc,2CAA2C,IAAI,UAAU,OAAO,oBAAoB,IAAI,KAAK;GAC1I,cAAc;EAChB,CAAC;CACH;CAEA,IAAI,IAAI,sBAAsB,KAAK,IAAI,IAAI,mBAAmB,QAAQ,IAAI,IACxE,IAAI,KAAK;EACP,UAAU;EACV,MAAM;EACN,OAAO,+BAA+B,IAAI,mBAAmB,OAAO,eAAe,IAAI,mBAAmB,SAAS,QAAQ,CAAC,EAAE;EAC9H,QAAQ,yFAAyF,IAAI,mBAAmB,OAAO,0CAA0C,IAAI,mBAAmB,OAAO;EACvM,cAAc;CAChB,CAAC;CAGH,OAAO;AACT"}

package/dist/baseline-DcX5hQDv.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"baseline-DcX5hQDv.js","names":[],"sources":["../src/failure-taxonomy.ts","../src/tool-use-metrics.ts","../src/baseline.ts"],"sourcesContent":["/**\n * Failure taxonomy — canonical classes + a default classifier.\n *\n * Every failed run should end up in a named class. The classifier here\n * is rule-based (fast, deterministic); an LLM fallback can be added by\n * the consumer for novel cases and trained into the rule base over time.\n *\n * Consumers call `classifyFailure(run, spans, events)` and persist the\n * returned class as `Run.outcome.failureClass`.\n */\n\nimport type { FailureClass, Run, Span, TraceEvent } from './trace/schema'\nimport { FAILURE_CLASSES } from './trace/schema'\n\nexport { FAILURE_CLASSES, type FailureClass }\n\nexport interface FailureContext {\n  run: Run\n  spans: Span[]\n  events: TraceEvent[]\n}\n\nexport interface FailureClassification {\n  failureClass: FailureClass\n  reason: string\n  triggerSpanId?: string\n  triggerEventId?: string\n}\n\n/** Ordered rules — first match wins. */\nexport interface FailureRule {\n  id: string\n  match: (ctx: FailureContext) => {\n    failureClass: FailureClass\n    reason: string\n    triggerSpanId?: string\n    triggerEventId?: string\n  } | null\n}\n\nexport const DEFAULT_RULES: FailureRule[] = [\n  // Outcome already named? Respect it.\n  {\n    id: 'explicit-outcome',\n    match: ({ run }) => {\n      const fc = run.outcome?.failureClass\n      if (fc && fc !== 'unknown')\n        return { failureClass: fc, reason: 'outcome.failureClass set explicitly' }\n      return null\n    },\n  },\n  {\n    id: 'knowledge-readiness-blocked',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'readiness_scored' &&\n          e.payload.passed === false,\n      )\n      return event\n        ? {\n            failureClass: 'knowledge_readiness_blocked',\n            reason: 'knowledge readiness report blocked execution',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'bad-integration-manifest',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          ((e.payload.kind === 'integration_manifest_validated' && e.payload.valid === false) ||\n            (e.payload.kind === 'integration_invoke_failed' &&\n              e.payload.code === 'manifest_invalid')),\n      )\n      return event\n        ? {\n            failureClass: 'bad_integration_manifest',\n            reason: 'integration manifest validation failed before launch',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'missing-integration-connection',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'integration_manifest_resolved' &&\n          hasResolutionStatus(e.payload, 'missing_connection'),\n      )\n      return event\n        ? {\n            failureClass: 'missing_integration_connection',\n            reason: 'required integration connection was missing',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'missing-integration-scope',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          ((e.payload.kind === 'integration_manifest_resolved' && hasMissingScopes(e.payload)) ||\n            (e.payload.kind === 'integration_invoke_failed' && e.payload.code === 'scope_denied')),\n      )\n      return event\n        ? {\n            failureClass: 'missing_integration_scope',\n            reason: 'integration grant or connection lacks required scopes',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'integration-approval-required',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          ((e.payload.kind === 'integration_invoke' && e.payload.status === 'approval_required') ||\n            (e.payload.kind === 'integration_invoke_failed' &&\n              e.payload.code === 'approval_required') ||\n            e.payload.kind === 'integration_approval_required'),\n      )\n      return event\n        ? {\n            failureClass: 'integration_approval_required',\n            reason: 'integration write paused for user approval',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'integration-auth-expired',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'integration_invoke_failed' &&\n          (e.payload.code === 'auth_expired' ||\n            e.payload.code === 'connection_not_active' ||\n            e.payload.code === 'capability_expired' ||\n            e.payload.status === 'expired'),\n      )\n      return event\n        ? {\n            failureClass: 'integration_auth_expired',\n            reason: 'integration connection or capability expired',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'unsafe-integration-write-denied',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'integration_invoke_failed' &&\n          (e.payload.code === 'unsafe_write_denied' ||\n            e.payload.code === 'policy_denied' ||\n            e.payload.code === 'action_denied'),\n      )\n      return event\n        ? {\n            failureClass: 'unsafe_integration_write_denied',\n            reason: 'integration write was denied by policy or capability scope',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'integration-provider-failure',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'integration_invoke_failed' &&\n          ![\n            'scope_denied',\n            'approval_required',\n            'auth_expired',\n            'connection_not_active',\n            'capability_expired',\n            'unsafe_write_denied',\n            'policy_denied',\n            'action_denied',\n            'manifest_invalid',\n          ].includes(String(e.payload.code)),\n      )\n      return event\n        ? {\n            failureClass: 'integration_provider_failure',\n            reason: 'integration provider invocation failed',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'missing-credentials',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'knowledge_gap' &&\n          e.payload.category === 'credential_or_secret',\n      )\n      return event\n        ? {\n            failureClass: 'missing_credentials',\n            reason: 'required credential or secret was missing',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'bad-retrieval',\n    match: ({ run, spans }) => {\n      if (run.outcome?.pass !== false) return null\n      const retrieval = spans.find(\n        (s) =>\n          s.kind === 'retrieval' && (s.hits.length === 0 || s.hits.every((hit) => hit.score <= 0)),\n      )\n      return retrieval\n        ? {\n            failureClass: 'bad_retrieval',\n            reason: 'retrieval returned no useful hits for a failed run',\n            triggerSpanId: retrieval.spanId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'insufficient-evidence',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'knowledge_gap' &&\n          e.payload.reason === 'insufficient_evidence',\n      )\n      return event\n        ? {\n            failureClass: 'insufficient_evidence',\n            reason: 'task proceeded with insufficient supporting evidence',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  {\n    id: 'contradictory-evidence',\n    match: ({ events }) => {\n      const event = events.find(\n        (e) =>\n          e.kind === 'custom' &&\n          e.payload.kind === 'knowledge_gap' &&\n          e.payload.reason === 'contradictory_evidence',\n      )\n      return event\n        ? {\n            failureClass: 'contradictory_evidence',\n            reason: 'supporting evidence contradicted itself',\n            triggerEventId: event.eventId,\n          }\n        : null\n    },\n  },\n  // Budget breach events\n  {\n    id: 'budget-breach',\n    match: ({ events }) => {\n      const breach = events.find((e) => e.kind === 'budget_breach')\n      return breach\n        ? {\n            failureClass: 'budget_exceeded',\n            reason: `budget breached on ${breach.payload.dimension ?? 'unknown dimension'}`,\n            triggerEventId: breach.eventId,\n          }\n        : null\n    },\n  },\n  // Policy violations\n  {\n    id: 'policy-violation',\n    match: ({ events }) => {\n      const e = events.find((x) => x.kind === 'policy_violation')\n      return e\n        ? {\n            failureClass: 'policy_violation',\n            reason: 'policy_violation event emitted',\n            triggerEventId: e.eventId,\n          }\n        : null\n    },\n  },\n  // Sandbox non-zero exit code\n  {\n    id: 'sandbox-failure',\n    match: ({ spans }) => {\n      const s = spans.find(\n        (x) => x.kind === 'sandbox' && typeof x.exitCode === 'number' && x.exitCode !== 0,\n      )\n      if (!s) return null\n      return {\n        failureClass: 'sandbox_failure',\n        reason: `sandbox exited ${(s as Extract<Span, { kind: 'sandbox' }>).exitCode}`,\n        triggerSpanId: s.spanId,\n      }\n    },\n  },\n  // Timeout: run aborted by external signal\n  {\n    id: 'timeout',\n    match: ({ run, events }) => {\n      if (run.status !== 'aborted') return null\n      const hasTimeout = events.some(\n        (e) =>\n          e.kind === 'error' &&\n          String(e.payload.reason ?? '')\n            .toLowerCase()\n            .includes('timeout'),\n      )\n      const note = (run.outcome?.notes ?? '').toLowerCase()\n      if (hasTimeout || note.includes('timeout') || note.includes('deadline')) {\n        return { failureClass: 'timeout', reason: 'timeout signal observed' }\n      }\n      return null\n    },\n  },\n  // Tool recovery failure: many consecutive tool errors on the same tool\n  {\n    id: 'tool-recovery-failure',\n    match: ({ spans }) => {\n      const tools = spans.filter((s) => s.kind === 'tool')\n      const byTool = new Map<string, Span[]>()\n      for (const t of tools) {\n        const name = (t as Extract<Span, { kind: 'tool' }>).toolName\n        const arr = byTool.get(name) ?? []\n        arr.push(t)\n        byTool.set(name, arr)\n      }\n      for (const [name, arr] of byTool) {\n        const errs = arr.filter((s) => s.status === 'error')\n        if (errs.length >= 3 && errs.length === arr.length) {\n          return {\n            failureClass: 'tool_recovery_failure',\n            reason: `${errs.length} consecutive errors on tool \"${name}\"`,\n            triggerSpanId: errs[errs.length - 1]!.spanId,\n          }\n        }\n      }\n      return null\n    },\n  },\n  // Tool selection error: the run failed and agent called zero tools despite having them\n  {\n    id: 'tool-selection-error',\n    match: ({ run, spans }) => {\n      if (run.outcome?.pass !== false) return null\n      const hasToolsAvailable = spans.some(\n        (s) =>\n          s.kind === 'agent' &&\n          (s.attributes?.toolsAvailable as number | undefined) !== undefined &&\n          (s.attributes?.toolsAvailable as number) > 0,\n      )\n      const tools = spans.filter((s) => s.kind === 'tool')\n      if (hasToolsAvailable && tools.length === 0) {\n        return {\n          failureClass: 'tool_selection_error',\n          reason: 'tools were available but none were called',\n        }\n      }\n      return null\n    },\n  },\n  // Format drift: scored by a judge with dimension='format' below threshold\n  {\n    id: 'format-drift',\n    match: ({ spans }) => {\n      const judge = spans.find(\n        (s) =>\n          s.kind === 'judge' &&\n          (s as Extract<Span, { kind: 'judge' }>).dimension === 'format' &&\n          (s as Extract<Span, { kind: 'judge' }>).score < 0.5,\n      )\n      return judge\n        ? {\n            failureClass: 'format_drift',\n            reason: 'format judge scored below 0.5',\n            triggerSpanId: judge.spanId,\n          }\n        : null\n    },\n  },\n]\n\nfunction hasResolutionStatus(payload: Record<string, unknown>, status: string): boolean {\n  if (status === 'missing_connection' && stringArray(payload.missingConnections).length > 0)\n    return true\n  return resolutionItems(payload).some((item) => item.status === status)\n}\n\nfunction hasMissingScopes(payload: Record<string, unknown>): boolean {\n  if (stringArray(payload.missingScopes).length > 0) return true\n  return resolutionItems(payload).some(\n    (item) => Array.isArray(item.missingScopes) && item.missingScopes.length > 0,\n  )\n}\n\nfunction resolutionItems(payload: Record<string, unknown>): Array<Record<string, unknown>> {\n  return [\n    ...records(payload.missing),\n    ...records(payload.optionalMissing),\n    ...records(payload.ready),\n  ]\n}\n\nfunction records(value: unknown): Array<Record<string, unknown>> {\n  if (!Array.isArray(value)) return []\n  return value.filter(\n    (item): item is Record<string, unknown> =>\n      Boolean(item) && typeof item === 'object' && !Array.isArray(item),\n  )\n}\n\nfunction stringArray(value: unknown): string[] {\n  return Array.isArray(value)\n    ? value.filter((item): item is string => typeof item === 'string')\n    : []\n}\n\n/** Classify the failure mode of a run using an ordered rule list. */\nexport function classifyFailure(\n  ctx: FailureContext,\n  rules: FailureRule[] = DEFAULT_RULES,\n): FailureClassification {\n  if (ctx.run.outcome?.pass !== false && ctx.run.status === 'completed') {\n    return { failureClass: 'success', reason: 'run completed with pass=true (or no explicit fail)' }\n  }\n  for (const rule of rules) {\n    const hit = rule.match(ctx)\n    if (hit) return hit\n  }\n  return { failureClass: 'unknown', reason: 'no rule matched; run failed for unclassified reason' }\n}\n","/**\n * Tool-use metrics — derived purely from trace data.\n *\n * No scoring assumptions: consumers supply optional ground-truth tool\n * selections per turn + optional \"information used downstream\" signals.\n * Without those, we still compute descriptive metrics (error rate,\n * retry rate, duplicate-call rate) that are useful on their own.\n */\n\nimport { argHash, groupBy, hasCapturedToolArgs, toolSpans } from './trace/query'\nimport type { Span } from './trace/schema'\nimport type { TraceStore } from './trace/store'\n\nexport interface ToolUseMetrics {\n  runId: string\n  totalCalls: number\n  /** Calls whose arguments were captured and can be compared for duplication. */\n  callsWithCapturedArgs: number\n  byTool: Record<string, ToolStats>\n  errorRate: number\n  /** Ratio of captured-argument calls already seen with the same tool name and arguments. */\n  duplicateRate: number\n  /** Ratio of error calls followed by ≥1 retry on same tool. */\n  retryRate: number\n  /** Optional: of the calls agent made, fraction the evaluator marked as \"correct selection\". */\n  selectionAccuracy?: number\n}\n\nexport interface ToolStats {\n  calls: number\n  callsWithCapturedArgs: number\n  errors: number\n  avgLatencyMs: number\n  duplicates: number\n}\n\nexport interface ToolUseOptions {\n  /** Map of spanId → whether the evaluator judged the tool selection correct. Optional. */\n  selectionLabels?: Record<string, boolean>\n}\n\nexport async function computeToolUseMetrics(\n  store: TraceStore,\n  runId: string,\n  options: ToolUseOptions = {},\n): Promise<ToolUseMetrics> {\n  const tools = await toolSpans(store, runId)\n  if (tools.length === 0) {\n    return {\n      runId,\n      totalCalls: 0,\n      callsWithCapturedArgs: 0,\n      byTool: {},\n      errorRate: 0,\n      duplicateRate: 0,\n      retryRate: 0,\n    }\n  }\n\n  const byTool: Record<string, ToolStats> = {}\n  let totalErrors = 0\n  let totalDuplicates = 0\n  let callsWithCapturedArgs = 0\n  const sortedTools = [...tools].sort((a, b) => a.startedAt - b.startedAt)\n  const seenSignatures = new Set<string>()\n\n  // duplicate detection + per-tool aggregation\n  for (const t of sortedTools) {\n    byTool[t.toolName] ??= {\n      calls: 0,\n      callsWithCapturedArgs: 0,\n      errors: 0,\n      avgLatencyMs: 0,\n      duplicates: 0,\n    }\n    const stat = byTool[t.toolName]!\n    stat.calls += 1\n    if (t.status === 'error') {\n      stat.errors += 1\n      totalErrors += 1\n    }\n    if (typeof t.latencyMs === 'number') stat.avgLatencyMs += t.latencyMs\n    if (hasCapturedToolArgs(t)) {\n      callsWithCapturedArgs += 1\n      stat.callsWithCapturedArgs += 1\n      const sig = `${t.toolName}|${argHash(t.args)}`\n      if (seenSignatures.has(sig)) {\n        stat.duplicates += 1\n        totalDuplicates += 1\n      }\n      seenSignatures.add(sig)\n    }\n  }\n\n  for (const stat of Object.values(byTool)) {\n    stat.avgLatencyMs = stat.calls > 0 ? stat.avgLatencyMs / stat.calls : 0\n  }\n\n  // retry detection: per-tool chronological adjacency where error → next same-tool call\n  let retryOpportunities = 0\n  let retriesFollowed = 0\n  for (const [, arr] of groupBy(sortedTools, (t) => t.toolName)) {\n    for (let i = 0; i < arr.length; i++) {\n      if (arr[i]!.status !== 'error') continue\n      retryOpportunities += 1\n      if (arr[i + 1]) retriesFollowed += 1\n    }\n  }\n  const retryRate = retryOpportunities > 0 ? retriesFollowed / retryOpportunities : 0\n\n  let selectionAccuracy: number | undefined\n  if (options.selectionLabels) {\n    const labeled = sortedTools.filter((t) => t.spanId in options.selectionLabels!)\n    if (labeled.length > 0) {\n      selectionAccuracy =\n        labeled.filter((t) => options.selectionLabels![t.spanId]).length / labeled.length\n    }\n  }\n\n  return {\n    runId,\n    totalCalls: sortedTools.length,\n    callsWithCapturedArgs,\n    byTool,\n    errorRate: totalErrors / sortedTools.length,\n    duplicateRate: callsWithCapturedArgs > 0 ? totalDuplicates / callsWithCapturedArgs : 0,\n    retryRate,\n    selectionAccuracy,\n  }\n}\n\nexport type { Span }\n","/**\n * Baseline regression detection.\n *\n * Lifted from ADC baseline.ts. Every promotion-blocking signal boils down\n * to: \"is this run measurably worse than baseline?\" — with enough\n * statistical rigor to distinguish noise from drift.\n *\n * Uses:\n *   - Welch's t-test (unequal variance) for per-metric mean comparison\n *   - Cohen's d for effect size magnitude\n *   - IQR for stability flag (unstable samples can't be trusted for comparisons)\n *\n * Returns a structured verdict: improved | regressed | stable | unstable.\n */\n\nimport { studentTCdf } from './math/student-t'\nimport { cohensD } from './statistics'\n\nexport interface MetricSamples {\n  /** Stable metric key (e.g. \"overallScore\", \"firstTokenMs\"). */\n  metric: string\n  /** Whether higher values are better. */\n  higherIsBetter: boolean\n  baseline: number[]\n  candidate: number[]\n}\n\nexport interface MetricVerdict {\n  metric: string\n  baselineMean: number\n  candidateMean: number\n  delta: number\n  cohensD: number\n  welchT: number\n  welchDf: number\n  welchP: number\n  stable: boolean\n  /** IQR of the combined samples — used as a rough stability indicator. */\n  iqr: number\n  verdict: 'improved' | 'regressed' | 'stable' | 'unstable'\n}\n\nexport interface BaselineReport {\n  metrics: MetricVerdict[]\n  /** True if any critical metric regressed. */\n  hasRegression: boolean\n  /** True if any metric is unstable (too noisy to judge). */\n  hasUnstable: boolean\n}\n\nexport interface BaselineOptions {\n  /** Effect size threshold for meaningful delta (default 0.5 — medium effect). */\n  effectThreshold?: number\n  /** p-value threshold for statistical significance (default 0.05). */\n  alpha?: number\n  /** IQR/mean ratio above which samples are flagged unstable (default 0.30). */\n  unstableCvThreshold?: number\n}\n\n/**\n * Compare candidate samples against baseline per metric. Verdict logic:\n *   - unstable: IQR/|mean| > threshold on either set — not enough signal\n *   - improved: meaningful effect in the \"better\" direction AND p < alpha\n *   - regressed: meaningful effect in the \"worse\" direction AND p < alpha\n *   - stable: otherwise (no significant change)\n */\nexport function compareToBaseline(\n  samples: MetricSamples[],\n  options: BaselineOptions = {},\n): BaselineReport {\n  const effectThreshold = options.effectThreshold ?? 0.5\n  const alpha = options.alpha ?? 0.05\n  const cvThreshold = options.unstableCvThreshold ?? 0.3\n\n  const metrics: MetricVerdict[] = samples.map((s) => {\n    if (s.baseline.length < 2 || s.candidate.length < 2) {\n      throw new Error(`compareToBaseline: need ≥2 samples per side for \"${s.metric}\"`)\n    }\n    const bMean = mean(s.baseline)\n    const cMean = mean(s.candidate)\n    const delta = cMean - bMean\n    const d = cohensD(s.baseline, s.candidate) // positive = candidate higher\n    const { t, df, p } = welchsTTest(s.baseline, s.candidate)\n    // Stability is per-side: a comparison is trustworthy only when BOTH\n    // samples are internally consistent. Combining the sides would flag\n    // large-but-real deltas as \"unstable\" which is exactly what we want\n    // to detect.\n    const baselineIqr = iqr(s.baseline)\n    const candidateIqr = iqr(s.candidate)\n    const baselineStable = baselineIqr / Math.max(Math.abs(bMean), 1e-9) <= cvThreshold\n    const candidateStable = candidateIqr / Math.max(Math.abs(cMean), 1e-9) <= cvThreshold\n    const stable = baselineStable && candidateStable\n    const reportedIqr = Math.max(baselineIqr, candidateIqr)\n\n    let verdict: MetricVerdict['verdict']\n    if (!stable) {\n      verdict = 'unstable'\n    } else if (p < alpha && Math.abs(d) >= effectThreshold) {\n      const candidateIsBetter = s.higherIsBetter ? delta > 0 : delta < 0\n      verdict = candidateIsBetter ? 'improved' : 'regressed'\n    } else {\n      verdict = 'stable'\n    }\n\n    return {\n      metric: s.metric,\n      baselineMean: bMean,\n      candidateMean: cMean,\n      delta,\n      cohensD: d,\n      welchT: t,\n      welchDf: df,\n      welchP: p,\n      stable,\n      iqr: reportedIqr,\n      verdict,\n    }\n  })\n\n  return {\n    metrics,\n    hasRegression: metrics.some((m) => m.verdict === 'regressed'),\n    hasUnstable: metrics.some((m) => m.verdict === 'unstable'),\n  }\n}\n\nfunction mean(xs: number[]): number {\n  return xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\n/** Inter-quartile range; 0 when the sample has no spread. */\nexport function iqr(xs: number[]): number {\n  if (xs.length === 0) return 0\n  const sorted = [...xs].sort((a, b) => a - b)\n  const q = (p: number) => {\n    const idx = p * (sorted.length - 1)\n    const lo = Math.floor(idx)\n    const hi = Math.ceil(idx)\n    return sorted[lo]! + (sorted[hi]! - sorted[lo]!) * (idx - lo)\n  }\n  return q(0.75) - q(0.25)\n}\n\n/**\n * Welch's t-test — unequal-variance two-sample t. Uses the same Student-t\n * CDF as `pairedTTest` (via incomplete beta); falls back to normal tail\n * when df is large.\n */\nexport function welchsTTest(a: number[], b: number[]): { t: number; df: number; p: number } {\n  if (a.length < 2 || b.length < 2) return { t: 0, df: 0, p: 1 }\n  const mA = mean(a)\n  const mB = mean(b)\n  const vA = variance(a, mA)\n  const vB = variance(b, mB)\n  const seSquared = vA / a.length + vB / b.length\n  if (seSquared === 0) return { t: mA === mB ? 0 : Infinity, df: 0, p: mA === mB ? 1 : 0 }\n  const t = (mB - mA) / Math.sqrt(seSquared)\n  const df =\n    (seSquared * seSquared) /\n    ((vA / a.length) ** 2 / (a.length - 1) + (vB / b.length) ** 2 / (b.length - 1))\n  const p = 2 * (1 - studentTCdf(Math.abs(t), df))\n  return { t, df, p }\n}\n\nfunction variance(xs: number[], m: number): number {\n  return xs.reduce((acc, x) => acc + (x - m) ** 2, 0) / (xs.length - 1)\n}\n"],"mappings":";;;AAwCA,MAAa,gBAA+B;CAE1C;EACE,IAAI;EACJ,QAAQ,EAAE,UAAU;GAClB,MAAM,KAAK,IAAI,SAAS;GACxB,IAAI,MAAM,OAAO,WACf,OAAO;IAAE,cAAc;IAAI,QAAQ;GAAsC;GAC3E,OAAO;EACT;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,sBACnB,EAAE,QAAQ,WAAW,KACzB;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,aACT,EAAE,QAAQ,SAAS,oCAAoC,EAAE,QAAQ,UAAU,SAC1E,EAAE,QAAQ,SAAS,+BAClB,EAAE,QAAQ,SAAS,mBAC3B;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,mCACnB,oBAAoB,EAAE,SAAS,oBAAoB,CACvD;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,aACT,EAAE,QAAQ,SAAS,mCAAmC,iBAAiB,EAAE,OAAO,KAC/E,EAAE,QAAQ,SAAS,+BAA+B,EAAE,QAAQ,SAAS,eAC5E;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,aACT,EAAE,QAAQ,SAAS,wBAAwB,EAAE,QAAQ,WAAW,uBAC/D,EAAE,QAAQ,SAAS,+BAClB,EAAE,QAAQ,SAAS,uBACrB,EAAE,QAAQ,SAAS,gCACzB;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,gCAClB,EAAE,QAAQ,SAAS,kBAClB,EAAE,QAAQ,SAAS,2BACnB,EAAE,QAAQ,SAAS,wBACnB,EAAE,QAAQ,WAAW,UAC3B;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,gCAClB,EAAE,QAAQ,SAAS,yBAClB,EAAE,QAAQ,SAAS,mBACnB,EAAE,QAAQ,SAAS,gBACzB;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,+BACnB,CAAC;IACC;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;GACF,CAAC,CAAC,SAAS,OAAO,EAAE,QAAQ,IAAI,CAAC,CACrC;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,mBACnB,EAAE,QAAQ,aAAa,sBAC3B;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,KAAK,YAAY;GACzB,IAAI,IAAI,SAAS,SAAS,OAAO,OAAO;GACxC,MAAM,YAAY,MAAM,MACrB,MACC,EAAE,SAAS,gBAAgB,EAAE,KAAK,WAAW,KAAK,EAAE,KAAK,OAAO,QAAQ,IAAI,SAAS,CAAC,EAC1F;GACA,OAAO,YACH;IACE,cAAc;IACd,QAAQ;IACR,eAAe,UAAU;GAC3B,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,mBACnB,EAAE,QAAQ,WAAW,uBACzB;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CACA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,QAAQ,OAAO,MAClB,MACC,EAAE,SAAS,YACX,EAAE,QAAQ,SAAS,mBACnB,EAAE,QAAQ,WAAW,wBACzB;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,MAAM;GACxB,IACA;EACN;CACF;CAEA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,SAAS,OAAO,MAAM,MAAM,EAAE,SAAS,eAAe;GAC5D,OAAO,SACH;IACE,cAAc;IACd,QAAQ,sBAAsB,OAAO,QAAQ,aAAa;IAC1D,gBAAgB,OAAO;GACzB,IACA;EACN;CACF;CAEA;EACE,IAAI;EACJ,QAAQ,EAAE,aAAa;GACrB,MAAM,IAAI,OAAO,MAAM,MAAM,EAAE,SAAS,kBAAkB;GAC1D,OAAO,IACH;IACE,cAAc;IACd,QAAQ;IACR,gBAAgB,EAAE;GACpB,IACA;EACN;CACF;CAEA;EACE,IAAI;EACJ,QAAQ,EAAE,YAAY;GACpB,MAAM,IAAI,MAAM,MACb,MAAM,EAAE,SAAS,aAAa,OAAO,EAAE,aAAa,YAAY,EAAE,aAAa,CAClF;GACA,IAAI,CAAC,GAAG,OAAO;GACf,OAAO;IACL,cAAc;IACd,QAAQ,kBAAmB,EAAyC;IACpE,eAAe,EAAE;GACnB;EACF;CACF;CAEA;EACE,IAAI;EACJ,QAAQ,EAAE,KAAK,aAAa;GAC1B,IAAI,IAAI,WAAW,WAAW,OAAO;GACrC,MAAM,aAAa,OAAO,MACvB,MACC,EAAE,SAAS,WACX,OAAO,EAAE,QAAQ,UAAU,EAAE,CAAC,CAC3B,YAAY,CAAC,CACb,SAAS,SAAS,CACzB;GACA,MAAM,QAAQ,IAAI,SAAS,SAAS,GAAA,CAAI,YAAY;GACpD,IAAI,cAAc,KAAK,SAAS,SAAS,KAAK,KAAK,SAAS,UAAU,GACpE,OAAO;IAAE,cAAc;IAAW,QAAQ;GAA0B;GAEtE,OAAO;EACT;CACF;CAEA;EACE,IAAI;EACJ,QAAQ,EAAE,YAAY;GACpB,MAAM,QAAQ,MAAM,QAAQ,MAAM,EAAE,SAAS,MAAM;GACnD,MAAM,yBAAS,IAAI,IAAoB;GACvC,KAAK,MAAM,KAAK,OAAO;IACrB,MAAM,OAAQ,EAAsC;IACpD,MAAM,MAAM,OAAO,IAAI,IAAI,KAAK,CAAC;IACjC,IAAI,KAAK,CAAC;IACV,OAAO,IAAI,MAAM,GAAG;GACtB;GACA,KAAK,MAAM,CAAC,MAAM,QAAQ,QAAQ;IAChC,MAAM,OAAO,IAAI,QAAQ,MAAM,EAAE,WAAW,OAAO;IACnD,IAAI,KAAK,UAAU,KAAK,KAAK,WAAW,IAAI,QAC1C,OAAO;KACL,cAAc;KACd,QAAQ,GAAG,KAAK,OAAO,+BAA+B,KAAK;KAC3D,eAAe,KAAK,KAAK,SAAS,EAAE,CAAE;IACxC;GAEJ;GACA,OAAO;EACT;CACF;CAEA;EACE,IAAI;EACJ,QAAQ,EAAE,KAAK,YAAY;GACzB,IAAI,IAAI,SAAS,SAAS,OAAO,OAAO;GACxC,MAAM,oBAAoB,MAAM,MAC7B,MACC,EAAE,SAAS,WACV,EAAE,YAAY,mBAA0C,KAAA,KACxD,EAAE,YAAY,iBAA4B,CAC/C;GACA,MAAM,QAAQ,MAAM,QAAQ,MAAM,EAAE,SAAS,MAAM;GACnD,IAAI,qBAAqB,MAAM,WAAW,GACxC,OAAO;IACL,cAAc;IACd,QAAQ;GACV;GAEF,OAAO;EACT;CACF;CAEA;EACE,IAAI;EACJ,QAAQ,EAAE,YAAY;GACpB,MAAM,QAAQ,MAAM,MACjB,MACC,EAAE,SAAS,WACV,EAAuC,cAAc,YACrD,EAAuC,QAAQ,EACpD;GACA,OAAO,QACH;IACE,cAAc;IACd,QAAQ;IACR,eAAe,MAAM;GACvB,IACA;EACN;CACF;AACF;AAEA,SAAS,oBAAoB,SAAkC,QAAyB;CACtF,IAAI,WAAW,wBAAwB,YAAY,QAAQ,kBAAkB,CAAC,CAAC,SAAS,GACtF,OAAO;CACT,OAAO,gBAAgB,OAAO,CAAC,CAAC,MAAM,SAAS,KAAK,WAAW,MAAM;AACvE;AAEA,SAAS,iBAAiB,SAA2C;CACnE,IAAI,YAAY,QAAQ,aAAa,CAAC,CAAC,SAAS,GAAG,OAAO;CAC1D,OAAO,gBAAgB,OAAO,CAAC,CAAC,MAC7B,SAAS,MAAM,QAAQ,KAAK,aAAa,KAAK,KAAK,cAAc,SAAS,CAC7E;AACF;AAEA,SAAS,gBAAgB,SAAkE;CACzF,OAAO;EACL,GAAG,QAAQ,QAAQ,OAAO;EAC1B,GAAG,QAAQ,QAAQ,eAAe;EAClC,GAAG,QAAQ,QAAQ,KAAK;CAC1B;AACF;AAEA,SAAS,QAAQ,OAAgD;CAC/D,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,CAAC;CACnC,OAAO,MAAM,QACV,SACC,QAAQ,IAAI,KAAK,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,IAAI,CACpE;AACF;AAEA,SAAS,YAAY,OAA0B;CAC7C,OAAO,MAAM,QAAQ,KAAK,IACtB,MAAM,QAAQ,SAAyB,OAAO,SAAS,QAAQ,IAC/D,CAAC;AACP;;AAGA,SAAgB,gBACd,KACA,QAAuB,eACA;CACvB,IAAI,IAAI,IAAI,SAAS,SAAS,SAAS,IAAI,IAAI,WAAW,aACxD,OAAO;EAAE,cAAc;EAAW,QAAQ;CAAqD;CAEjG,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,MAAM,KAAK,MAAM,GAAG;EAC1B,IAAI,KAAK,OAAO;CAClB;CACA,OAAO;EAAE,cAAc;EAAW,QAAQ;CAAsD;AAClG;;;;;;;;;;;ACpaA,eAAsB,sBACpB,OACA,OACA,UAA0B,CAAC,GACF;CACzB,MAAM,QAAQ,MAAM,UAAU,OAAO,KAAK;CAC1C,IAAI,MAAM,WAAW,GACnB,OAAO;EACL;EACA,YAAY;EACZ,uBAAuB;EACvB,QAAQ,CAAC;EACT,WAAW;EACX,eAAe;EACf,WAAW;CACb;CAGF,MAAM,SAAoC,CAAC;CAC3C,IAAI,cAAc;CAClB,IAAI,kBAAkB;CACtB,IAAI,wBAAwB;CAC5B,MAAM,cAAc,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;CACvE,MAAM,iCAAiB,IAAI,IAAY;CAGvC,KAAK,MAAM,KAAK,aAAa;EAC3B,OAAO,EAAE,cAAc;GACrB,OAAO;GACP,uBAAuB;GACvB,QAAQ;GACR,cAAc;GACd,YAAY;EACd;EACA,MAAM,OAAO,OAAO,EAAE;EACtB,KAAK,SAAS;EACd,IAAI,EAAE,WAAW,SAAS;GACxB,KAAK,UAAU;GACf,eAAe;EACjB;EACA,IAAI,OAAO,EAAE,cAAc,UAAU,KAAK,gBAAgB,EAAE;EAC5D,IAAI,oBAAoB,CAAC,GAAG;GAC1B,yBAAyB;GACzB,KAAK,yBAAyB;GAC9B,MAAM,MAAM,GAAG,EAAE,SAAS,GAAG,QAAQ,EAAE,IAAI;GAC3C,IAAI,eAAe,IAAI,GAAG,GAAG;IAC3B,KAAK,cAAc;IACnB,mBAAmB;GACrB;GACA,eAAe,IAAI,GAAG;EACxB;CACF;CAEA,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,GACrC,KAAK,eAAe,KAAK,QAAQ,IAAI,KAAK,eAAe,KAAK,QAAQ;CAIxE,IAAI,qBAAqB;CACzB,IAAI,kBAAkB;CACtB,KAAK,MAAM,GAAG,QAAQ,QAAQ,cAAc,MAAM,EAAE,QAAQ,GAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,IAAI,IAAI,EAAE,CAAE,WAAW,SAAS;EAChC,sBAAsB;EACtB,IAAI,IAAI,IAAI,IAAI,mBAAmB;CACrC;CAEF,MAAM,YAAY,qBAAqB,IAAI,kBAAkB,qBAAqB;CAElF,IAAI;CACJ,IAAI,QAAQ,iBAAiB;EAC3B,MAAM,UAAU,YAAY,QAAQ,MAAM,EAAE,UAAU,QAAQ,eAAgB;EAC9E,IAAI,QAAQ,SAAS,GACnB,oBACE,QAAQ,QAAQ,MAAM,QAAQ,gBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS,QAAQ;CAEjF;CAEA,OAAO;EACL;EACA,YAAY,YAAY;EACxB;EACA;EACA,WAAW,cAAc,YAAY;EACrC,eAAe,wBAAwB,IAAI,kBAAkB,wBAAwB;EACrF;EACA;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;AC/DA,SAAgB,kBACd,SACA,UAA2B,CAAC,GACZ;CAChB,MAAM,kBAAkB,QAAQ,mBAAmB;CACnD,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,cAAc,QAAQ,uBAAuB;CAEnD,MAAM,UAA2B,QAAQ,KAAK,MAAM;EAClD,IAAI,EAAE,SAAS,SAAS,KAAK,EAAE,UAAU,SAAS,GAChD,MAAM,IAAI,MAAM,oDAAoD,EAAE,OAAO,EAAE;EAEjF,MAAM,QAAQ,KAAK,EAAE,QAAQ;EAC7B,MAAM,QAAQ,KAAK,EAAE,SAAS;EAC9B,MAAM,QAAQ,QAAQ;EACtB,MAAM,IAAI,QAAQ,EAAE,UAAU,EAAE,SAAS;EACzC,MAAM,EAAE,GAAG,IAAI,MAAM,YAAY,EAAE,UAAU,EAAE,SAAS;EAKxD,MAAM,cAAc,IAAI,EAAE,QAAQ;EAClC,MAAM,eAAe,IAAI,EAAE,SAAS;EACpC,MAAM,iBAAiB,cAAc,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK;EACxE,MAAM,kBAAkB,eAAe,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK;EAC1E,MAAM,SAAS,kBAAkB;EACjC,MAAM,cAAc,KAAK,IAAI,aAAa,YAAY;EAEtD,IAAI;EACJ,IAAI,CAAC,QACH,UAAU;OACL,IAAI,IAAI,SAAS,KAAK,IAAI,CAAC,KAAK,iBAErC,WAD0B,EAAE,iBAAiB,QAAQ,IAAI,QAAQ,KACnC,aAAa;OAE3C,UAAU;EAGZ,OAAO;GACL,QAAQ,EAAE;GACV,cAAc;GACd,eAAe;GACf;GACA,SAAS;GACT,QAAQ;GACR,SAAS;GACT,QAAQ;GACR;GACA,KAAK;GACL;EACF;CACF,CAAC;CAED,OAAO;EACL;EACA,eAAe,QAAQ,MAAM,MAAM,EAAE,YAAY,WAAW;EAC5D,aAAa,QAAQ,MAAM,MAAM,EAAE,YAAY,UAAU;CAC3D;AACF;AAEA,SAAS,KAAK,IAAsB;CAClC,OAAO,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAC5C;;AAGA,SAAgB,IAAI,IAAsB;CACxC,IAAI,GAAG,WAAW,GAAG,OAAO;CAC5B,MAAM,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3C,MAAM,KAAK,MAAc;EACvB,MAAM,MAAM,KAAK,OAAO,SAAS;EACjC,MAAM,KAAK,KAAK,MAAM,GAAG;EACzB,MAAM,KAAK,KAAK,KAAK,GAAG;EACxB,OAAO,OAAO,OAAQ,OAAO,MAAO,OAAO,QAAS,MAAM;CAC5D;CACA,OAAO,EAAE,GAAI,IAAI,EAAE,GAAI;AACzB;;;;;;AAOA,SAAgB,YAAY,GAAa,GAAmD;CAC1F,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,GAAG,OAAO;EAAE,GAAG;EAAG,IAAI;EAAG,GAAG;CAAE;CAC7D,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,KAAK,SAAS,GAAG,EAAE;CACzB,MAAM,KAAK,SAAS,GAAG,EAAE;CACzB,MAAM,YAAY,KAAK,EAAE,SAAS,KAAK,EAAE;CACzC,IAAI,cAAc,GAAG,OAAO;EAAE,GAAG,OAAO,KAAK,IAAI;EAAU,IAAI;EAAG,GAAG,OAAO,KAAK,IAAI;CAAE;CACvF,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,SAAS;CACzC,MAAM,KACH,YAAY,cACX,KAAK,EAAE,WAAW,KAAK,EAAE,SAAS,MAAM,KAAK,EAAE,WAAW,KAAK,EAAE,SAAS;CAE9E,OAAO;EAAE;EAAG;EAAI,GADN,KAAK,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,EAAE;CAC5B;AACpB;AAEA,SAAS,SAAS,IAAc,GAAmB;CACjD,OAAO,GAAG,QAAQ,KAAK,MAAM,OAAO,IAAI,MAAM,GAAG,CAAC,KAAK,GAAG,SAAS;AACrE"}

package/dist/baseline-hG3K85h4.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"baseline-hG3K85h4.d.ts","names":[],"sources":["../src/tool-use-metrics.ts","../src/trajectory.ts","../src/baseline.ts"],"mappings":";;;UAaiB;EACf;EACA;;EAEA;EACA,QAAQ,eAAe;EACvB;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA;EACA;;UAGe;;EAEf,kBAAkB;;iBAGE,sBACpB,OAAO,YACP,eACA,UAAS,iBACR,QAAQ;;;UChCM;EACf;EACA,MAAM;;EAEN;;EAEA,QAAQ;;UAGO;EACf;EACA,OAAO;EACP;EACA;EACA;EACA;EACA;;iBAGoB,gBAAgB,OAAO,YAAY,gBAAgB,QAAQ;;;;;;;;;;;;;;;;;UCdhE;;EAEf;;EAEA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;EACA;;UAGe;EACf,SAAS;;EAET;;EAEA;;UAGe;;EAEf;;EAEA;;EAEA;;;;;;;;;iBAUc,kBACd,SAAS,iBACT,UAAS,kBACR;;iBA8Da,IAAI;;;;;;iBAiBJ,YAAY,aAAa;EAAgB;EAAW;EAAY"}

package/dist/client-CYzbdJOZ.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"client-CYzbdJOZ.js","names":[],"sources":["../src/hosted/types.ts","../src/hosted/schemas.ts","../src/hosted/client.ts"],"sourcesContent":["/**\n * # Hosted-tier wire format — the schema that EVERY orchestrator (ours,\n * a partner's self-hosted one, a future open implementation) must accept.\n *\n * This package implements exactly one wire version. Servers reject every\n * other version instead of translating old payloads.\n *\n * The wire format is two event streams in one transport:\n *\n *   1. **Eval-run events** (`POST /v1/ingest/eval-runs`). Posted when a\n *      campaign / improvement-loop completes (or per-generation if\n *      streaming). Carries the structured result + per-cell scores +\n *      surface diffs the orchestrator stores for the dashboard.\n *\n *   2. **Trace spans** (`POST /v1/ingest/traces`). Standard OTLP-shaped\n *      spans with a few additional attributes so the orchestrator can\n *      pivot from eval-run → underlying execution. Compatible with any\n *      OTel collector.\n *\n * Both endpoints are authenticated with a bearer token + a tenant id\n * header. Tenants isolate everything downstream of ingest; no tenant\n * ever sees another tenant's data.\n */\n\nimport type { GateDecision, MutableSurface } from '../campaign/types'\nimport type { InsightReport } from '../contract/insight-report'\nimport type { RunTerminalOutcome } from '../run-record'\n\n// re-export so wire-format consumers can import the optional payload type\n// from `@tangle-network/agent-eval/hosted` without reaching into /contract.\nexport type { InsightReport } from '../contract/insight-report'\n\nexport const HOSTED_WIRE_VERSION = '2026-07-24.v1' as const\nexport type HostedWireVersion = typeof HOSTED_WIRE_VERSION\n\n// ── Transport headers ───────────────────────────────────────────────\n\n/** Every ingest request carries these. */\nexport interface HostedIngestHeaders {\n  /** Bearer token. The orchestrator validates against the tenant key. */\n  authorization: `Bearer ${string}`\n  /** Stable tenant id (the orchestrator-side primary key for the tenant). */\n  'x-tangle-tenant-id': string\n  /** Wire-version pin so the server can reject incompatible payloads. */\n  'x-tangle-wire-version': HostedWireVersion\n  /** Stable request key generated once and reused across retries. */\n  'idempotency-key': string\n}\n\n// ── Eval-run event ──────────────────────────────────────────────────\n\n/** Lifecycle stages of an eval-run as the substrate reports them. */\nexport type EvalRunStatus =\n  | 'started'\n  | 'baseline-complete'\n  | 'generation-complete'\n  | 'gate-decided'\n  | 'finished'\n  | 'errored'\n\nexport interface EvalRunCellScore {\n  /** Stable scenario id from the consumer's scenario set. */\n  scenarioId: string\n  /** Repetition index when reps > 1; 0 for the default. */\n  rep: number\n  /** Composite score across successful judges, or null when unscored. */\n  compositeMean: number | null\n  /** Per-judge and per-dimension scores; failed or missing judges are absent. */\n  dimensions: Record<string, Record<string, number>>\n  /** Root execution result, kept separate from task quality. */\n  terminalOutcome: RunTerminalOutcome\n  /** Canonical execution-error count, or null when the producer did not measure it. */\n  executionErrorCount: number | null\n  /** Per-cell dispatch or judge error. Missing on success. */\n  errorMessage?: string\n}\n\nexport interface EvalRunGenerationSnapshot {\n  /** Generation index. 0 is baseline. */\n  index: number\n  /** Candidate surface fingerprint (stable hash) — pivot key into the\n   *  trace stream to fetch the underlying execution. */\n  surfaceHash: string\n  /** The candidate surface itself. May be omitted to avoid PII when the\n   *  consumer prefers not to ship verbatim prompts. */\n  surface?: MutableSurface\n  /** Per-cell scores for this generation. */\n  cells: EvalRunCellScore[]\n  /** Mean across scored cells, or null when no cell has a task-quality label. */\n  compositeMean: number | null\n  /** Total $ spent across this generation. */\n  costUsd: number\n  /** Wall-clock duration of this generation. */\n  durationMs: number\n}\n\n/**\n * The top-level eval-run event. One ingest call per logical eval-run;\n * generations stream in incrementally via repeated calls with the same\n * `runId`. The orchestrator deduplicates by `(runId, generation.index)`.\n */\nexport interface EvalRunEvent {\n  /** Stable run id (the substrate's `runId`). UUID or substrate-generated. */\n  runId: string\n  /** Where this run was happening — derived from `RunCampaignOptions.runDir`. */\n  runDir: string\n  /** ISO-8601 timestamp the substrate recorded the event. */\n  timestamp: string\n  /** Lifecycle stage this event represents. */\n  status: EvalRunStatus\n  /** Free-form consumer tags (env, branch, model id, etc.). Searchable. */\n  labels: Record<string, string>\n  /** Baseline campaign snapshot. Present when status >= baseline-complete. */\n  baseline?: EvalRunGenerationSnapshot\n  /** Per-generation snapshots. Streams in; orchestrator appends. */\n  generations: EvalRunGenerationSnapshot[]\n  /** Final gate decision. Present when status >= gate-decided. */\n  gateDecision?: GateDecision\n  /** Held-out lift = winner-on-holdout - baseline-on-holdout. */\n  holdoutLift?: number\n  /** Total $ spent across baseline + every generation. */\n  totalCostUsd: number\n  /** Total wall-clock duration. */\n  totalDurationMs: number\n  /** Error message if status === 'errored'. */\n  errorMessage?: string\n  /** Rigor packet emitted alongside the run — distributional summary,\n   *  paired-bootstrap lift CI, judge stats, inter-rater agreement,\n   *  contamination check, failure clusters (when an analyst is wired),\n   *  outcome correlation (when downstream signal is supplied), and the\n   *  recommendations the dashboard surfaces verbatim. */\n  insightReport?: InsightReport\n}\n\n// ── Trace span event ────────────────────────────────────────────────\n\n/**\n * Canonical unsigned 64-bit integer encoded as a base-10 string.\n * JSON numbers cannot represent OTLP nanosecond timestamps exactly.\n */\nexport type UnixNanoTimestamp = string\n\n/**\n * OTel-shape span with a few additional attributes for eval-run pivoting.\n * Compatible with any OTLP collector — `name`, `traceId`, `spanId`,\n * `startTimeUnixNano`, `endTimeUnixNano`, `attributes` are stock OTel.\n */\nexport interface TraceSpanEvent {\n  traceId: string\n  spanId: string\n  parentSpanId?: string\n  name: string\n  startTimeUnixNano: UnixNanoTimestamp\n  endTimeUnixNano: UnixNanoTimestamp\n  attributes: Record<string, string | number | boolean>\n  events?: Array<{\n    timeUnixNano: UnixNanoTimestamp\n    name: string\n    attributes?: Record<string, string | number | boolean>\n  }>\n  status?: { code: 'OK' | 'ERROR' | 'UNSET'; message?: string }\n  /** Pivot back into the eval-run stream. */\n  'tangle.runId'?: string\n  /** Pivot to the specific generation. */\n  'tangle.generation'?: number\n  /** Pivot to the specific cell. */\n  'tangle.cellId'?: string\n  /** Pivot to the specific scenario. */\n  'tangle.scenarioId'?: string\n}\n\n// ── Ingest request bodies ───────────────────────────────────────────\n\nexport interface IngestEvalRunsRequest {\n  wireVersion: HostedWireVersion\n  events: EvalRunEvent[]\n}\n\nexport interface IngestTracesRequest {\n  wireVersion: HostedWireVersion\n  spans: TraceSpanEvent[]\n}\n\nexport interface IngestResponse {\n  /** Accepted events / spans count. */\n  accepted: number\n  /** Rejected events with reasons (validation failures, dup idempotency key, etc.). */\n  rejected: Array<{ index: number; reason: string }>\n}\n","import { z } from 'zod'\nimport type { MutableSurface } from '../campaign/types'\nimport type { InsightReport } from '../contract/insight-report'\nimport { FAILURE_CLASSES, type FailureClass } from '../trace/schema'\nimport type {\n  EvalRunCellScore,\n  EvalRunEvent,\n  EvalRunGenerationSnapshot,\n  IngestEvalRunsRequest,\n  IngestResponse,\n  IngestTracesRequest,\n  TraceSpanEvent,\n  UnixNanoTimestamp,\n} from './types'\nimport { HOSTED_WIRE_VERSION } from './types'\n\nconst finiteNumber = z.number().finite()\nconst nonNegativeNumber = finiteNumber.nonnegative()\nconst nonNegativeInteger = z.number().int().nonnegative()\nconst nonEmptyString = z\n  .string()\n  .min(1)\n  .refine((value) => value.trim().length > 0, 'must not be blank')\nconst attributeValue = z.union([z.string(), finiteNumber, z.boolean()])\nconst attributes = z.record(z.string(), attributeValue)\nconst FailureClassSchema = z.custom<FailureClass>(\n  (value) => typeof value === 'string' && FAILURE_CLASSES.includes(value as FailureClass),\n  `expected one of ${FAILURE_CLASSES.join(', ')}`,\n)\nconst UINT64_MAX = 18_446_744_073_709_551_615n\n\nexport const UnixNanoTimestampSchema: z.ZodType<UnixNanoTimestamp> = z\n  .string()\n  .regex(/^(0|[1-9][0-9]*)$/, 'expected an unsigned base-10 integer string')\n  .refine((value) => BigInt(value) <= UINT64_MAX, 'must fit in an unsigned 64-bit integer')\n\nconst GainDistributionBinSchema = z\n  .object({\n    lo: finiteNumber,\n    hi: finiteNumber,\n    count: nonNegativeInteger,\n  })\n  .strict()\n\nconst ScalarDistributionSchema = z\n  .object({\n    n: nonNegativeInteger,\n    mean: finiteNumber.nullable(),\n    p50: finiteNumber.nullable(),\n    p95: finiteNumber.nullable(),\n    stddev: nonNegativeNumber.nullable(),\n    min: finiteNumber.nullable(),\n    max: finiteNumber.nullable(),\n    histogram: z.array(GainDistributionBinSchema),\n    tailRuns: z\n      .array(\n        z\n          .object({\n            runId: nonEmptyString,\n            score: finiteNumber,\n          })\n          .strict(),\n      )\n      .optional(),\n  })\n  .strict()\n  .superRefine((distribution, ctx) => {\n    const values = [\n      distribution.mean,\n      distribution.p50,\n      distribution.p95,\n      distribution.stddev,\n      distribution.min,\n      distribution.max,\n    ]\n    if (distribution.n === 0 && values.some((value) => value !== null)) {\n      ctx.addIssue({\n        code: 'custom',\n        message: 'distribution values must be null when n is 0',\n      })\n    }\n    if (distribution.n > 0 && values.some((value) => value === null)) {\n      ctx.addIssue({\n        code: 'custom',\n        message: 'distribution values must be numbers when n is greater than 0',\n      })\n    }\n    if (\n      distribution.min !== null &&\n      distribution.max !== null &&\n      distribution.min > distribution.max\n    ) {\n      ctx.addIssue({ code: 'custom', path: ['min'], message: 'min must not exceed max' })\n    }\n  })\n\nconst TokenUsageInsightSchema = z\n  .object({\n    input: ScalarDistributionSchema,\n    output: ScalarDistributionSchema,\n    reasoning: ScalarDistributionSchema,\n    cached: ScalarDistributionSchema,\n    cacheWrite: ScalarDistributionSchema,\n    totals: z\n      .object({\n        input: nonNegativeNumber,\n        output: nonNegativeNumber,\n        reasoning: nonNegativeNumber,\n        cached: nonNegativeNumber,\n        cacheWrite: nonNegativeNumber,\n      })\n      .strict(),\n  })\n  .strict()\n\nconst ExecutionErrorOutcomeCellSchema = z\n  .object({\n    withErrors: nonNegativeInteger,\n    withoutErrors: nonNegativeInteger,\n    unreported: nonNegativeInteger,\n  })\n  .strict()\n\nconst ExecutionInsightSchema = z\n  .object({\n    durationMs: ScalarDistributionSchema,\n    queueMs: ScalarDistributionSchema,\n    tokenUsage: TokenUsageInsightSchema,\n    aggregateUsage: z\n      .object({\n        runs: nonNegativeInteger,\n        tokenUsage: TokenUsageInsightSchema,\n        costUsd: ScalarDistributionSchema,\n        totalCostUsd: nonNegativeNumber,\n      })\n      .strict(),\n    models: z.array(\n      z\n        .object({\n          model: nonEmptyString,\n          runs: nonNegativeInteger,\n        })\n        .strict(),\n    ),\n    modelCalls: z\n      .object({\n        runs: nonNegativeInteger,\n        events: nonNegativeInteger,\n        reportingRuns: nonNegativeInteger,\n      })\n      .strict(),\n    executionErrors: z\n      .object({\n        runs: nonNegativeInteger,\n        fraction: finiteNumber.min(0).max(1).nullable(),\n        events: nonNegativeInteger,\n        reportingRuns: nonNegativeInteger,\n        errorSpanEvents: nonNegativeInteger,\n        errorSpanReportingRuns: nonNegativeInteger,\n        byTerminalOutcome: z\n          .object({\n            succeeded: ExecutionErrorOutcomeCellSchema,\n            failed: ExecutionErrorOutcomeCellSchema,\n            cancelled: ExecutionErrorOutcomeCellSchema,\n            incomplete: ExecutionErrorOutcomeCellSchema,\n            unknown: ExecutionErrorOutcomeCellSchema,\n          })\n          .strict(),\n      })\n      .strict(),\n    terminalOutcomes: z\n      .object({\n        succeeded: nonNegativeInteger,\n        failed: nonNegativeInteger,\n        cancelled: nonNegativeInteger,\n        incomplete: nonNegativeInteger,\n        unknown: nonNegativeInteger,\n      })\n      .strict(),\n  })\n  .strict()\n\nconst CostProvenanceSummarySchema = z\n  .object({\n    observed: z\n      .object({\n        n: nonNegativeInteger,\n        totalUsd: nonNegativeNumber,\n      })\n      .strict(),\n    estimated: z\n      .object({\n        n: nonNegativeInteger,\n        totalUsd: nonNegativeNumber,\n      })\n      .strict(),\n    uncaptured: z.object({ n: nonNegativeInteger }).strict(),\n    knownFraction: finiteNumber.min(0).max(1),\n  })\n  .strict()\n\nconst ParetoFigureSpecSchema = z\n  .object({\n    kind: z.literal('pareto-cost-quality'),\n    split: z.enum(['search', 'holdout']),\n    points: z.array(\n      z\n        .object({\n          candidateId: nonEmptyString,\n          cost: nonNegativeNumber,\n          quality: finiteNumber,\n          n: nonNegativeInteger,\n          onFrontier: z.boolean(),\n          gate: z.enum(['promote', 'reject']).optional(),\n        })\n        .strict(),\n    ),\n    axes: z.object({ x: z.literal('costUsd'), y: z.literal('score') }).strict(),\n  })\n  .strict()\n\nconst ContinuousAgreementSchema = z\n  .object({\n    weightedKappa: finiteNumber,\n    icc: finiteNumber,\n    pearson: finiteNumber,\n    spearman: finiteNumber,\n    ci: z\n      .object({\n        icc: z.tuple([finiteNumber, finiteNumber]),\n        weightedKappa: z.tuple([finiteNumber, finiteNumber]),\n      })\n      .strict(),\n    n: nonNegativeInteger,\n    raters: nonNegativeInteger,\n  })\n  .strict()\n\nconst JudgeInsightSchema = z\n  .object({\n    n: nonNegativeInteger,\n    meanScore: finiteNumber,\n    calibration: ContinuousAgreementSchema.optional(),\n    positionalBias: finiteNumber.optional(),\n    selfPreference: finiteNumber.optional(),\n    verbosityBias: finiteNumber.optional(),\n  })\n  .strict()\n\nconst InterRaterInsightSchema = z\n  .object({\n    raters: nonNegativeInteger,\n    jointlyRated: nonNegativeInteger,\n    kappa: finiteNumber,\n    icc: finiteNumber,\n    pearson: finiteNumber,\n    spearman: finiteNumber,\n    perPair: z.record(z.string(), finiteNumber),\n    disagreementCases: z.array(\n      z\n        .object({\n          runId: nonEmptyString,\n          ratings: z.array(\n            z\n              .object({\n                rater: nonEmptyString,\n                score: finiteNumber,\n              })\n              .strict(),\n          ),\n          range: nonNegativeNumber,\n        })\n        .strict(),\n    ),\n  })\n  .strict()\n\nconst LiftInsightSchema = z\n  .object({\n    baselineMean: finiteNumber,\n    candidateMean: finiteNumber,\n    delta: finiteNumber,\n    ci95: z.tuple([finiteNumber, finiteNumber]),\n    pValue: finiteNumber.min(0).max(1),\n    n: nonNegativeInteger,\n    unpairedBaseline: nonNegativeInteger,\n    unpairedCandidate: nonNegativeInteger,\n    cohensD: finiteNumber.nullable(),\n    mde: nonNegativeNumber,\n    requiredN: nonNegativeInteger.nullable(),\n  })\n  .strict()\n\nconst FailureClusterInsightSchema = z\n  .object({\n    clusters: z.array(\n      z\n        .object({\n          id: nonEmptyString,\n          name: nonEmptyString,\n          share: finiteNumber.min(0).max(1),\n          exemplars: z.array(nonEmptyString).max(5),\n          suggestedFix: nonEmptyString.optional(),\n        })\n        .strict(),\n    ),\n    totalFailures: nonNegativeInteger,\n  })\n  .strict()\n\nconst ContaminationInsightSchema = z\n  .object({\n    leaks: nonNegativeInteger,\n    holdoutAuditPassed: z.boolean(),\n    details: z\n      .array(\n        z\n          .object({\n            runId: nonEmptyString,\n            canary: nonEmptyString,\n            matched: nonEmptyString,\n          })\n          .strict(),\n      )\n      .optional(),\n  })\n  .strict()\n\nconst OutcomeCorrelationInsightSchema = z\n  .object({\n    metric: nonEmptyString,\n    n: nonNegativeInteger,\n    pearson: finiteNumber,\n    spearman: finiteNumber,\n    rewardModel: z\n      .object({\n        intercept: finiteNumber,\n        slope: finiteNumber,\n        r2: finiteNumber,\n      })\n      .strict()\n      .optional(),\n  })\n  .strict()\n\nconst ReleaseSummarySchema = z\n  .object({\n    status: z.enum(['pass', 'warn', 'fail']),\n    axes: z.array(\n      z\n        .object({\n          name: z.enum(['quality-lift', 'contamination', 'composite-distribution']),\n          status: z.enum(['pass', 'warn', 'fail', 'not_evaluated']),\n          detail: nonEmptyString,\n        })\n        .strict(),\n    ),\n    issues: z.array(z.string()),\n  })\n  .strict()\n\nconst MetricDeltaSchema = z\n  .object({\n    current: finiteNumber,\n    baseline: finiteNumber,\n    delta: finiteNumber,\n    ci95: z.tuple([finiteNumber, finiteNumber]),\n    pValue: finiteNumber.min(0).max(1),\n    cohensD: finiteNumber,\n    baselineN: nonNegativeInteger,\n    currentN: nonNegativeInteger,\n    significant: z.boolean(),\n  })\n  .strict()\n\nconst PriorPeriodComparisonSchema = z\n  .object({\n    baselineN: nonNegativeInteger,\n    currentN: nonNegativeInteger,\n    windowLabel: nonEmptyString.optional(),\n    metrics: z.record(z.string(), MetricDeltaSchema),\n    regressedMetrics: z.array(nonEmptyString),\n    improvedMetrics: z.array(nonEmptyString),\n  })\n  .strict()\n\nconst RecommendationSchema = z\n  .object({\n    priority: z.enum(['critical', 'high', 'medium', 'low']),\n    kind: z.enum(['ship', 'hold', 'investigate', 'fix', 'recalibrate', 'expand-corpus']),\n    title: nonEmptyString,\n    detail: nonEmptyString,\n    evidencePath: nonEmptyString.optional(),\n  })\n  .strict()\n\nexport const InsightReportSchema: z.ZodType<InsightReport> = z\n  .object({\n    n: nonNegativeInteger,\n    execution: ExecutionInsightSchema,\n    composite: ScalarDistributionSchema,\n    perDimension: z.record(z.string(), ScalarDistributionSchema),\n    costQuality: z\n      .object({\n        cost: ScalarDistributionSchema,\n        pareto: ParetoFigureSpecSchema,\n        provenance: CostProvenanceSummarySchema.optional(),\n        degraded: z\n          .object({\n            cost: nonEmptyString.optional(),\n            pareto: nonEmptyString.optional(),\n          })\n          .strict()\n          .optional(),\n      })\n      .strict(),\n    judges: z.record(z.string(), JudgeInsightSchema),\n    interRater: InterRaterInsightSchema.optional(),\n    lift: LiftInsightSchema.optional(),\n    failureClusters: FailureClusterInsightSchema.optional(),\n    contamination: ContaminationInsightSchema.optional(),\n    outcomeCorrelation: OutcomeCorrelationInsightSchema.optional(),\n    release: ReleaseSummarySchema,\n    priorPeriodComparison: PriorPeriodComparisonSchema.optional(),\n    failureClasses: z\n      .array(\n        z\n          .object({\n            failureClass: FailureClassSchema,\n            count: nonNegativeInteger,\n            share: finiteNumber.min(0).max(1),\n          })\n          .strict(),\n      )\n      .optional(),\n    recommendations: z.array(RecommendationSchema),\n  })\n  .strict()\n\nconst sha256Digest = z.custom<`sha256:${string}`>(\n  (value) => typeof value === 'string' && /^sha256:[0-9a-f]{64}$/.test(value),\n  'expected sha256:<64 lowercase hex characters>',\n)\n\nexport const MutableSurfaceSchema: z.ZodType<MutableSurface> = z.union([\n  z.string(),\n  z\n    .object({\n      kind: z.literal('components'),\n      components: z.record(z.string(), z.string()),\n    })\n    .strict(),\n  z\n    .object({\n      kind: z.literal('code'),\n      worktreeRef: nonEmptyString,\n      baseRef: nonEmptyString,\n      baseCommit: nonEmptyString,\n      baseTree: nonEmptyString,\n      candidateCommit: nonEmptyString,\n      candidateTree: nonEmptyString,\n      patch: z\n        .object({\n          format: z.literal('git-diff-binary'),\n          sha256: sha256Digest,\n          byteLength: nonNegativeInteger,\n        })\n        .strict(),\n      summary: z.string().optional(),\n    })\n    .strict(),\n])\n\nexport const RunTerminalOutcomeSchema = z.enum([\n  'succeeded',\n  'failed',\n  'cancelled',\n  'incomplete',\n  'unknown',\n])\n\nexport const EvalRunCellScoreSchema: z.ZodType<EvalRunCellScore> = z\n  .object({\n    scenarioId: nonEmptyString,\n    rep: nonNegativeInteger,\n    compositeMean: finiteNumber.nullable(),\n    dimensions: z.record(z.string(), z.record(z.string(), finiteNumber)),\n    terminalOutcome: RunTerminalOutcomeSchema,\n    executionErrorCount: nonNegativeInteger.nullable(),\n    errorMessage: z.string().optional(),\n  })\n  .strict()\n\nexport const EvalRunGenerationSnapshotSchema: z.ZodType<EvalRunGenerationSnapshot> = z\n  .object({\n    index: nonNegativeInteger,\n    surfaceHash: nonEmptyString,\n    surface: MutableSurfaceSchema.optional(),\n    cells: z.array(EvalRunCellScoreSchema),\n    compositeMean: finiteNumber.nullable(),\n    costUsd: nonNegativeNumber,\n    durationMs: nonNegativeNumber,\n  })\n  .strict()\n\nconst EvalRunStatusSchema = z.enum([\n  'started',\n  'baseline-complete',\n  'generation-complete',\n  'gate-decided',\n  'finished',\n  'errored',\n])\n\nconst GateDecisionSchema = z.enum([\n  'ship',\n  'hold',\n  'need_more_work',\n  'model_ceiling',\n  'arch_ceiling',\n])\n\nexport const EvalRunEventSchema: z.ZodType<EvalRunEvent> = z\n  .object({\n    runId: nonEmptyString,\n    runDir: nonEmptyString,\n    timestamp: z.string().datetime({ offset: true }),\n    status: EvalRunStatusSchema,\n    labels: z.record(z.string(), z.string()),\n    baseline: EvalRunGenerationSnapshotSchema.optional(),\n    generations: z.array(EvalRunGenerationSnapshotSchema),\n    gateDecision: GateDecisionSchema.optional(),\n    holdoutLift: finiteNumber.optional(),\n    totalCostUsd: nonNegativeNumber,\n    totalDurationMs: nonNegativeNumber,\n    errorMessage: z.string().optional(),\n    insightReport: InsightReportSchema.optional(),\n  })\n  .strict()\n  .superRefine((event, ctx) => {\n    if (event.baseline && event.baseline.index !== 0) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['baseline', 'index'],\n        message: 'baseline index must be 0',\n      })\n    }\n\n    const seen = new Set<number>()\n    for (let i = 0; i < event.generations.length; i++) {\n      const index = event.generations[i]!.index\n      if (seen.has(index)) {\n        ctx.addIssue({\n          code: 'custom',\n          path: ['generations', i, 'index'],\n          message: `duplicate generation index ${index}`,\n        })\n      }\n      seen.add(index)\n    }\n\n    if (event.status === 'errored' && !event.errorMessage?.trim()) {\n      ctx.addIssue({\n        code: 'custom',\n        path: ['errorMessage'],\n        message: 'errorMessage is required when status is errored',\n      })\n    }\n  })\n\nconst TraceSpanEventEntrySchema = z\n  .object({\n    timeUnixNano: UnixNanoTimestampSchema,\n    name: nonEmptyString,\n    attributes: attributes.optional(),\n  })\n  .strict()\n\nexport const TraceSpanEventSchema: z.ZodType<TraceSpanEvent> = z\n  .object({\n    traceId: nonEmptyString,\n    spanId: nonEmptyString,\n    parentSpanId: nonEmptyString.optional(),\n    name: nonEmptyString,\n    startTimeUnixNano: UnixNanoTimestampSchema,\n    endTimeUnixNano: UnixNanoTimestampSchema,\n    attributes,\n    events: z.array(TraceSpanEventEntrySchema).optional(),\n    status: z\n      .object({\n        code: z.enum(['OK', 'ERROR', 'UNSET']),\n        message: z.string().optional(),\n      })\n      .strict()\n      .optional(),\n    'tangle.runId': nonEmptyString.optional(),\n    'tangle.generation': nonNegativeInteger.optional(),\n    'tangle.cellId': nonEmptyString.optional(),\n    'tangle.scenarioId': nonEmptyString.optional(),\n  })\n  .strict()\n  .refine((span) => BigInt(span.endTimeUnixNano) >= BigInt(span.startTimeUnixNano), {\n    path: ['endTimeUnixNano'],\n    message: 'endTimeUnixNano must be greater than or equal to startTimeUnixNano',\n  })\n\nexport const IngestEvalRunsEnvelopeSchema = z\n  .object({\n    wireVersion: z.literal(HOSTED_WIRE_VERSION),\n    events: z.array(z.unknown()),\n  })\n  .strict()\n\nexport const IngestTracesEnvelopeSchema = z\n  .object({\n    wireVersion: z.literal(HOSTED_WIRE_VERSION),\n    spans: z.array(z.unknown()),\n  })\n  .strict()\n\nexport const IngestEvalRunsRequestSchema: z.ZodType<IngestEvalRunsRequest> = z\n  .object({\n    wireVersion: z.literal(HOSTED_WIRE_VERSION),\n    events: z.array(EvalRunEventSchema),\n  })\n  .strict()\n\nexport const IngestTracesRequestSchema: z.ZodType<IngestTracesRequest> = z\n  .object({\n    wireVersion: z.literal(HOSTED_WIRE_VERSION),\n    spans: z.array(TraceSpanEventSchema),\n  })\n  .strict()\n\nexport const IngestResponseSchema: z.ZodType<IngestResponse> = z\n  .object({\n    accepted: nonNegativeInteger,\n    rejected: z.array(\n      z\n        .object({\n          index: nonNegativeInteger,\n          reason: nonEmptyString,\n        })\n        .strict(),\n    ),\n  })\n  .strict()\n","/**\n * # Hosted-tier ingest client.\n *\n * Ships eval-run events + trace spans to any orchestrator (ours, a\n * partner's self-hosted one, or a future open implementation) that\n * speaks the wire format in `./types.ts`.\n *\n * Three modes:\n *   - **Ours:** point at `https://orchestrator.tangle.tools` (the host root —\n *     the client appends the versioned `/v1/ingest/...` path itself; a trailing\n *     `/v1` on the endpoint is tolerated and normalized away). We handle ingest\n *     + storage + dashboard.\n *   - **Self-hosted:** point at whatever URL runs the reference receiver\n *     from `examples/hosted-ingest-server/`.\n *   - **Off (default):** when `hostedTenant` is unset, nothing is sent.\n *     Everything stays local.\n */\n\nimport {\n  IngestEvalRunsRequestSchema,\n  IngestResponseSchema,\n  IngestTracesRequestSchema,\n} from './schemas'\nimport {\n  type EvalRunEvent,\n  HOSTED_WIRE_VERSION,\n  type HostedWireVersion,\n  type IngestEvalRunsRequest,\n  type IngestResponse,\n  type IngestTracesRequest,\n  type TraceSpanEvent,\n} from './types'\n\nexport interface HostedTenant {\n  /** Orchestrator endpoint base URL (no trailing slash). Required. */\n  endpoint: string\n  /** Bearer token issued by the orchestrator. Required. */\n  apiKey: string\n  /** Tenant id — the orchestrator's primary key for this consumer. Required. */\n  tenantId: string\n  /** Optional `fetch` override (auth wrappers, custom agent, test mocks). */\n  fetchImpl?: typeof fetch\n  /** Per-call timeout in ms. Default 30s. */\n  timeoutMs?: number\n  /** Retries on 5xx / network errors. Default 2. */\n  retries?: number\n}\n\nexport interface HostedClient {\n  ingestEvalRun(event: EvalRunEvent, idempotencyKey?: string): Promise<IngestResponse>\n  ingestEvalRuns(events: EvalRunEvent[], idempotencyKey?: string): Promise<IngestResponse>\n  ingestTraces(spans: TraceSpanEvent[], idempotencyKey?: string): Promise<IngestResponse>\n  readonly tenant: HostedTenant\n  readonly wireVersion: HostedWireVersion\n}\n\ninterface RequestOptions {\n  idempotencyKey?: string\n  signal?: AbortSignal\n}\n\nconst MAX_IDEMPOTENCY_KEY_LENGTH = 256\n\nfunction sleep(ms: number): Promise<void> {\n  return new Promise((resolve) => setTimeout(resolve, ms))\n}\n\nfunction normalizeHostedBase(endpoint: string): string {\n  return endpoint.trim().replace(/\\/+$/, '').replace(/\\/v1$/, '')\n}\n\nfunction resolveIdempotencyKey(key: string | undefined): string {\n  const resolved = key ?? globalThis.crypto.randomUUID()\n  if (resolved.trim().length === 0) throw new Error('idempotency key must not be blank')\n  if (resolved.length > MAX_IDEMPOTENCY_KEY_LENGTH) {\n    throw new Error(`idempotency key must be at most ${MAX_IDEMPOTENCY_KEY_LENGTH} characters`)\n  }\n  return resolved\n}\n\nfunction responseValidationReason(error: {\n  issues: Array<{ path: PropertyKey[]; message: string }>\n}) {\n  return error.issues\n    .map(\n      (issue) =>\n        `${issue.path.length > 0 ? issue.path.map(String).join('.') : 'value'}: ${issue.message}`,\n    )\n    .join('; ')\n}\n\nasync function post<TReq>(\n  tenant: HostedTenant,\n  path: string,\n  body: TReq,\n  opts: RequestOptions = {},\n): Promise<IngestResponse> {\n  const timeoutMs = tenant.timeoutMs ?? 30_000\n  const maxRetries = tenant.retries ?? 2\n  const f: typeof fetch = tenant.fetchImpl ?? ((...args) => fetch(...args))\n  const base = normalizeHostedBase(tenant.endpoint)\n  const url = `${base}${path}`\n  const idempotencyKey = resolveIdempotencyKey(opts.idempotencyKey)\n  const headers: Record<string, string> = {\n    'content-type': 'application/json',\n    authorization: `Bearer ${tenant.apiKey}`,\n    'x-tangle-tenant-id': tenant.tenantId,\n    'x-tangle-wire-version': HOSTED_WIRE_VERSION,\n    'idempotency-key': idempotencyKey,\n  }\n\n  let lastError: unknown\n  for (let attempt = 0; attempt <= maxRetries; attempt++) {\n    const ourTimeout = AbortSignal.timeout(timeoutMs)\n    const combinedSignal = opts.signal ? AbortSignal.any([opts.signal, ourTimeout]) : ourTimeout\n    let res: Response\n    try {\n      res = await f(url, {\n        method: 'POST',\n        headers,\n        body: JSON.stringify(body),\n        signal: combinedSignal,\n      })\n    } catch (err) {\n      if (opts.signal?.aborted) throw err\n      lastError = err\n      if (attempt === maxRetries) throw err\n      await sleep(2 ** attempt * 200 + Math.random() * 200)\n      continue\n    }\n\n    if (!res.ok) {\n      const text = await res.text().catch(() => '')\n      const error = new Error(`hosted ingest ${url} failed (${res.status}): ${text.slice(0, 500)}`)\n      const retryable = res.status >= 500 || res.status === 408 || res.status === 429\n      if (!retryable || attempt === maxRetries) throw error\n      lastError = error\n      await sleep(2 ** attempt * 200 + Math.random() * 200)\n      continue\n    }\n\n    let rawResponse: unknown\n    try {\n      rawResponse = await res.json()\n    } catch (error) {\n      throw new Error(`hosted ingest ${url} returned invalid JSON`, { cause: error })\n    }\n    const parsed = IngestResponseSchema.safeParse(rawResponse)\n    if (!parsed.success) {\n      throw new Error(\n        `hosted ingest ${url} returned an invalid response: ${responseValidationReason(parsed.error)}`,\n      )\n    }\n    return parsed.data\n  }\n  throw lastError ?? new Error('hosted ingest exhausted retries')\n}\n\nexport function createHostedClient(tenant: HostedTenant): HostedClient {\n  if (normalizeHostedBase(tenant.endpoint).length === 0) throw new Error('endpoint is required')\n  if (tenant.apiKey.trim().length === 0) throw new Error('apiKey is required')\n  if (tenant.tenantId.trim().length === 0) throw new Error('tenantId is required')\n  if (\n    tenant.timeoutMs !== undefined &&\n    (!Number.isFinite(tenant.timeoutMs) || tenant.timeoutMs <= 0)\n  ) {\n    throw new Error('timeoutMs must be greater than 0')\n  }\n  if (tenant.retries !== undefined && (!Number.isInteger(tenant.retries) || tenant.retries < 0)) {\n    throw new Error('retries must be a non-negative integer')\n  }\n\n  return {\n    tenant,\n    wireVersion: HOSTED_WIRE_VERSION,\n\n    async ingestEvalRun(event, idempotencyKey) {\n      return this.ingestEvalRuns([event], idempotencyKey)\n    },\n\n    async ingestEvalRuns(events, idempotencyKey) {\n      const body: IngestEvalRunsRequest = IngestEvalRunsRequestSchema.parse({\n        wireVersion: HOSTED_WIRE_VERSION,\n        events,\n      })\n      return post<IngestEvalRunsRequest>(tenant, '/v1/ingest/eval-runs', body, {\n        idempotencyKey,\n      })\n    },\n\n    async ingestTraces(spans, idempotencyKey) {\n      const body: IngestTracesRequest = IngestTracesRequestSchema.parse({\n        wireVersion: HOSTED_WIRE_VERSION,\n        spans,\n      })\n      return post<IngestTracesRequest>(tenant, '/v1/ingest/traces', body, {\n        idempotencyKey,\n      })\n    },\n  }\n}\n\n/**\n * Build a `HostedClient` from environment, or `undefined` when ingest is not\n * configured — the canonical, fail-soft wiring every product uses so eval-run +\n * trace provenance lands in the Intelligence dashboard with ONE call:\n *\n *   const hosted = hostedClientFromEnv()\n *   // ...run the loop...\n *   await emitLoopProvenance({ ..., hostedClient: hosted })  // no-op if undefined\n *\n * Returns `undefined` (NOT an error) when any of endpoint / apiKey / tenantId is\n * missing — so a product wires the ship call unconditionally and it stays a\n * no-op until the env is set. Env precedence:\n *   - endpoint:  `TANGLE_INGEST_URL` → `TANGLE_ORCHESTRATOR_URL`\n *   - apiKey:    `TANGLE_INGEST_API_KEY` → `TANGLE_API_KEY`\n *   - tenantId:  `TANGLE_TENANT_ID`\n * A trailing slash on the endpoint is stripped. Pass `overrides` to supply any\n * field directly (e.g. a fixed `tenantId` per product) — overrides win over env.\n */\n/**\n * Build a {@link HostedTenant} config from env — the input `selfImprove`'s\n * `hostedTenant` and `emitLoopProvenance` take. Same env precedence + overrides\n * as {@link hostedClientFromEnv}; returns `undefined` (not an error) when any of\n * endpoint / apiKey / tenantId is missing, so a product wires\n * `hostedTenant: hostedTenantFromEnv({ tenantId: 'my-agent' })` unconditionally\n * and it stays off until the env is set.\n */\nexport function hostedTenantFromEnv(\n  overrides: Partial<HostedTenant> & { env?: Record<string, string | undefined> } = {},\n): HostedTenant | undefined {\n  const env = overrides.env ?? process.env\n  const endpoint = (\n    overrides.endpoint ??\n    env.TANGLE_INGEST_URL ??\n    env.TANGLE_ORCHESTRATOR_URL\n  )?.trim()\n  const apiKey = (overrides.apiKey ?? env.TANGLE_INGEST_API_KEY ?? env.TANGLE_API_KEY)?.trim()\n  const tenantId = (overrides.tenantId ?? env.TANGLE_TENANT_ID)?.trim()\n  if (!endpoint || !apiKey || !tenantId) return undefined\n  const tenant: HostedTenant = { endpoint: endpoint.replace(/\\/+$/, ''), apiKey, tenantId }\n  if (overrides.fetchImpl) tenant.fetchImpl = overrides.fetchImpl\n  if (overrides.timeoutMs !== undefined) tenant.timeoutMs = overrides.timeoutMs\n  if (overrides.retries !== undefined) tenant.retries = overrides.retries\n  return tenant\n}\n\nexport function hostedClientFromEnv(\n  overrides: Partial<HostedTenant> & { env?: Record<string, string | undefined> } = {},\n): HostedClient | undefined {\n  const tenant = hostedTenantFromEnv(overrides)\n  return tenant ? createHostedClient(tenant) : undefined\n}\n"],"mappings":";;;AAgCA,MAAa,sBAAsB;;;AChBnC,MAAM,eAAe,EAAE,OAAO,CAAC,CAAC,OAAO;AACvC,MAAM,oBAAoB,aAAa,YAAY;AACnD,MAAM,qBAAqB,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,YAAY;AACxD,MAAM,iBAAiB,EACpB,OAAO,CAAC,CACR,IAAI,CAAC,CAAC,CACN,QAAQ,UAAU,MAAM,KAAK,CAAC,CAAC,SAAS,GAAG,mBAAmB;AACjE,MAAM,iBAAiB,EAAE,MAAM;CAAC,EAAE,OAAO;CAAG;CAAc,EAAE,QAAQ;AAAC,CAAC;AACtE,MAAM,aAAa,EAAE,OAAO,EAAE,OAAO,GAAG,cAAc;AACtD,MAAM,qBAAqB,EAAE,QAC1B,UAAU,OAAO,UAAU,YAAY,gBAAgB,SAAS,KAAqB,GACtF,mBAAmB,gBAAgB,KAAK,IAAI,GAC9C;AACA,MAAM,aAAa;AAEnB,MAAa,0BAAwD,EAClE,OAAO,CAAC,CACR,MAAM,qBAAqB,6CAA6C,CAAC,CACzE,QAAQ,UAAU,OAAO,KAAK,KAAK,YAAY,wCAAwC;AAE1F,MAAM,4BAA4B,EAC/B,OAAO;CACN,IAAI;CACJ,IAAI;CACJ,OAAO;AACT,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,2BAA2B,EAC9B,OAAO;CACN,GAAG;CACH,MAAM,aAAa,SAAS;CAC5B,KAAK,aAAa,SAAS;CAC3B,KAAK,aAAa,SAAS;CAC3B,QAAQ,kBAAkB,SAAS;CACnC,KAAK,aAAa,SAAS;CAC3B,KAAK,aAAa,SAAS;CAC3B,WAAW,EAAE,MAAM,yBAAyB;CAC5C,UAAU,EACP,MACC,EACG,OAAO;EACN,OAAO;EACP,OAAO;CACT,CAAC,CAAC,CACD,OAAO,CACZ,CAAC,CACA,SAAS;AACd,CAAC,CAAC,CACD,OAAO,CAAC,CACR,aAAa,cAAc,QAAQ;CAClC,MAAM,SAAS;EACb,aAAa;EACb,aAAa;EACb,aAAa;EACb,aAAa;EACb,aAAa;EACb,aAAa;CACf;CACA,IAAI,aAAa,MAAM,KAAK,OAAO,MAAM,UAAU,UAAU,IAAI,GAC/D,IAAI,SAAS;EACX,MAAM;EACN,SAAS;CACX,CAAC;CAEH,IAAI,aAAa,IAAI,KAAK,OAAO,MAAM,UAAU,UAAU,IAAI,GAC7D,IAAI,SAAS;EACX,MAAM;EACN,SAAS;CACX,CAAC;CAEH,IACE,aAAa,QAAQ,QACrB,aAAa,QAAQ,QACrB,aAAa,MAAM,aAAa,KAEhC,IAAI,SAAS;EAAE,MAAM;EAAU,MAAM,CAAC,KAAK;EAAG,SAAS;CAA0B,CAAC;AAEtF,CAAC;AAEH,MAAM,0BAA0B,EAC7B,OAAO;CACN,OAAO;CACP,QAAQ;CACR,WAAW;CACX,QAAQ;CACR,YAAY;CACZ,QAAQ,EACL,OAAO;EACN,OAAO;EACP,QAAQ;EACR,WAAW;EACX,QAAQ;EACR,YAAY;CACd,CAAC,CAAC,CACD,OAAO;AACZ,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,kCAAkC,EACrC,OAAO;CACN,YAAY;CACZ,eAAe;CACf,YAAY;AACd,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,yBAAyB,EAC5B,OAAO;CACN,YAAY;CACZ,SAAS;CACT,YAAY;CACZ,gBAAgB,EACb,OAAO;EACN,MAAM;EACN,YAAY;EACZ,SAAS;EACT,cAAc;CAChB,CAAC,CAAC,CACD,OAAO;CACV,QAAQ,EAAE,MACR,EACG,OAAO;EACN,OAAO;EACP,MAAM;CACR,CAAC,CAAC,CACD,OAAO,CACZ;CACA,YAAY,EACT,OAAO;EACN,MAAM;EACN,QAAQ;EACR,eAAe;CACjB,CAAC,CAAC,CACD,OAAO;CACV,iBAAiB,EACd,OAAO;EACN,MAAM;EACN,UAAU,aAAa,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;EAC9C,QAAQ;EACR,eAAe;EACf,iBAAiB;EACjB,wBAAwB;EACxB,mBAAmB,EAChB,OAAO;GACN,WAAW;GACX,QAAQ;GACR,WAAW;GACX,YAAY;GACZ,SAAS;EACX,CAAC,CAAC,CACD,OAAO;CACZ,CAAC,CAAC,CACD,OAAO;CACV,kBAAkB,EACf,OAAO;EACN,WAAW;EACX,QAAQ;EACR,WAAW;EACX,YAAY;EACZ,SAAS;CACX,CAAC,CAAC,CACD,OAAO;AACZ,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,8BAA8B,EACjC,OAAO;CACN,UAAU,EACP,OAAO;EACN,GAAG;EACH,UAAU;CACZ,CAAC,CAAC,CACD,OAAO;CACV,WAAW,EACR,OAAO;EACN,GAAG;EACH,UAAU;CACZ,CAAC,CAAC,CACD,OAAO;CACV,YAAY,EAAE,OAAO,EAAE,GAAG,mBAAmB,CAAC,CAAC,CAAC,OAAO;CACvD,eAAe,aAAa,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1C,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,yBAAyB,EAC5B,OAAO;CACN,MAAM,EAAE,QAAQ,qBAAqB;CACrC,OAAO,EAAE,KAAK,CAAC,UAAU,SAAS,CAAC;CACnC,QAAQ,EAAE,MACR,EACG,OAAO;EACN,aAAa;EACb,MAAM;EACN,SAAS;EACT,GAAG;EACH,YAAY,EAAE,QAAQ;EACtB,MAAM,EAAE,KAAK,CAAC,WAAW,QAAQ,CAAC,CAAC,CAAC,SAAS;CAC/C,CAAC,CAAC,CACD,OAAO,CACZ;CACA,MAAM,EAAE,OAAO;EAAE,GAAG,EAAE,QAAQ,SAAS;EAAG,GAAG,EAAE,QAAQ,OAAO;CAAE,CAAC,CAAC,CAAC,OAAO;AAC5E,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,4BAA4B,EAC/B,OAAO;CACN,eAAe;CACf,KAAK;CACL,SAAS;CACT,UAAU;CACV,IAAI,EACD,OAAO;EACN,KAAK,EAAE,MAAM,CAAC,cAAc,YAAY,CAAC;EACzC,eAAe,EAAE,MAAM,CAAC,cAAc,YAAY,CAAC;CACrD,CAAC,CAAC,CACD,OAAO;CACV,GAAG;CACH,QAAQ;AACV,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,qBAAqB,EACxB,OAAO;CACN,GAAG;CACH,WAAW;CACX,aAAa,0BAA0B,SAAS;CAChD,gBAAgB,aAAa,SAAS;CACtC,gBAAgB,aAAa,SAAS;CACtC,eAAe,aAAa,SAAS;AACvC,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,0BAA0B,EAC7B,OAAO;CACN,QAAQ;CACR,cAAc;CACd,OAAO;CACP,KAAK;CACL,SAAS;CACT,UAAU;CACV,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,YAAY;CAC1C,mBAAmB,EAAE,MACnB,EACG,OAAO;EACN,OAAO;EACP,SAAS,EAAE,MACT,EACG,OAAO;GACN,OAAO;GACP,OAAO;EACT,CAAC,CAAC,CACD,OAAO,CACZ;EACA,OAAO;CACT,CAAC,CAAC,CACD,OAAO,CACZ;AACF,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,oBAAoB,EACvB,OAAO;CACN,cAAc;CACd,eAAe;CACf,OAAO;CACP,MAAM,EAAE,MAAM,CAAC,cAAc,YAAY,CAAC;CAC1C,QAAQ,aAAa,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;CACjC,GAAG;CACH,kBAAkB;CAClB,mBAAmB;CACnB,SAAS,aAAa,SAAS;CAC/B,KAAK;CACL,WAAW,mBAAmB,SAAS;AACzC,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,8BAA8B,EACjC,OAAO;CACN,UAAU,EAAE,MACV,EACG,OAAO;EACN,IAAI;EACJ,MAAM;EACN,OAAO,aAAa,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;EAChC,WAAW,EAAE,MAAM,cAAc,CAAC,CAAC,IAAI,CAAC;EACxC,cAAc,eAAe,SAAS;CACxC,CAAC,CAAC,CACD,OAAO,CACZ;CACA,eAAe;AACjB,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,6BAA6B,EAChC,OAAO;CACN,OAAO;CACP,oBAAoB,EAAE,QAAQ;CAC9B,SAAS,EACN,MACC,EACG,OAAO;EACN,OAAO;EACP,QAAQ;EACR,SAAS;CACX,CAAC,CAAC,CACD,OAAO,CACZ,CAAC,CACA,SAAS;AACd,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,kCAAkC,EACrC,OAAO;CACN,QAAQ;CACR,GAAG;CACH,SAAS;CACT,UAAU;CACV,aAAa,EACV,OAAO;EACN,WAAW;EACX,OAAO;EACP,IAAI;CACN,CAAC,CAAC,CACD,OAAO,CAAC,CACR,SAAS;AACd,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,uBAAuB,EAC1B,OAAO;CACN,QAAQ,EAAE,KAAK;EAAC;EAAQ;EAAQ;CAAM,CAAC;CACvC,MAAM,EAAE,MACN,EACG,OAAO;EACN,MAAM,EAAE,KAAK;GAAC;GAAgB;GAAiB;EAAwB,CAAC;EACxE,QAAQ,EAAE,KAAK;GAAC;GAAQ;GAAQ;GAAQ;EAAe,CAAC;EACxD,QAAQ;CACV,CAAC,CAAC,CACD,OAAO,CACZ;CACA,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC;AAC5B,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,oBAAoB,EACvB,OAAO;CACN,SAAS;CACT,UAAU;CACV,OAAO;CACP,MAAM,EAAE,MAAM,CAAC,cAAc,YAAY,CAAC;CAC1C,QAAQ,aAAa,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;CACjC,SAAS;CACT,WAAW;CACX,UAAU;CACV,aAAa,EAAE,QAAQ;AACzB,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,8BAA8B,EACjC,OAAO;CACN,WAAW;CACX,UAAU;CACV,aAAa,eAAe,SAAS;CACrC,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,iBAAiB;CAC/C,kBAAkB,EAAE,MAAM,cAAc;CACxC,iBAAiB,EAAE,MAAM,cAAc;AACzC,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,uBAAuB,EAC1B,OAAO;CACN,UAAU,EAAE,KAAK;EAAC;EAAY;EAAQ;EAAU;CAAK,CAAC;CACtD,MAAM,EAAE,KAAK;EAAC;EAAQ;EAAQ;EAAe;EAAO;EAAe;CAAe,CAAC;CACnF,OAAO;CACP,QAAQ;CACR,cAAc,eAAe,SAAS;AACxC,CAAC,CAAC,CACD,OAAO;AAEV,MAAa,sBAAgD,EAC1D,OAAO;CACN,GAAG;CACH,WAAW;CACX,WAAW;CACX,cAAc,EAAE,OAAO,EAAE,OAAO,GAAG,wBAAwB;CAC3D,aAAa,EACV,OAAO;EACN,MAAM;EACN,QAAQ;EACR,YAAY,4BAA4B,SAAS;EACjD,UAAU,EACP,OAAO;GACN,MAAM,eAAe,SAAS;GAC9B,QAAQ,eAAe,SAAS;EAClC,CAAC,CAAC,CACD,OAAO,CAAC,CACR,SAAS;CACd,CAAC,CAAC,CACD,OAAO;CACV,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,kBAAkB;CAC/C,YAAY,wBAAwB,SAAS;CAC7C,MAAM,kBAAkB,SAAS;CACjC,iBAAiB,4BAA4B,SAAS;CACtD,eAAe,2BAA2B,SAAS;CACnD,oBAAoB,gCAAgC,SAAS;CAC7D,SAAS;CACT,uBAAuB,4BAA4B,SAAS;CAC5D,gBAAgB,EACb,MACC,EACG,OAAO;EACN,cAAc;EACd,OAAO;EACP,OAAO,aAAa,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;CAClC,CAAC,CAAC,CACD,OAAO,CACZ,CAAC,CACA,SAAS;CACZ,iBAAiB,EAAE,MAAM,oBAAoB;AAC/C,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,eAAe,EAAE,QACpB,UAAU,OAAO,UAAU,YAAY,wBAAwB,KAAK,KAAK,GAC1E,+CACF;AAEA,MAAa,uBAAkD,EAAE,MAAM;CACrE,EAAE,OAAO;CACT,EACG,OAAO;EACN,MAAM,EAAE,QAAQ,YAAY;EAC5B,YAAY,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;CAC7C,CAAC,CAAC,CACD,OAAO;CACV,EACG,OAAO;EACN,MAAM,EAAE,QAAQ,MAAM;EACtB,aAAa;EACb,SAAS;EACT,YAAY;EACZ,UAAU;EACV,iBAAiB;EACjB,eAAe;EACf,OAAO,EACJ,OAAO;GACN,QAAQ,EAAE,QAAQ,iBAAiB;GACnC,QAAQ;GACR,YAAY;EACd,CAAC,CAAC,CACD,OAAO;EACV,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,CAAC,CAAC,CACD,OAAO;AACZ,CAAC;AAED,MAAa,2BAA2B,EAAE,KAAK;CAC7C;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAa,yBAAsD,EAChE,OAAO;CACN,YAAY;CACZ,KAAK;CACL,eAAe,aAAa,SAAS;CACrC,YAAY,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,YAAY,CAAC;CACnE,iBAAiB;CACjB,qBAAqB,mBAAmB,SAAS;CACjD,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;AACpC,CAAC,CAAC,CACD,OAAO;AAEV,MAAa,kCAAwE,EAClF,OAAO;CACN,OAAO;CACP,aAAa;CACb,SAAS,qBAAqB,SAAS;CACvC,OAAO,EAAE,MAAM,sBAAsB;CACrC,eAAe,aAAa,SAAS;CACrC,SAAS;CACT,YAAY;AACd,CAAC,CAAC,CACD,OAAO;AAEV,MAAM,sBAAsB,EAAE,KAAK;CACjC;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAM,qBAAqB,EAAE,KAAK;CAChC;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAa,qBAA8C,EACxD,OAAO;CACN,OAAO;CACP,QAAQ;CACR,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS,EAAE,QAAQ,KAAK,CAAC;CAC/C,QAAQ;CACR,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;CACvC,UAAU,gCAAgC,SAAS;CACnD,aAAa,EAAE,MAAM,+BAA+B;CACpD,cAAc,mBAAmB,SAAS;CAC1C,aAAa,aAAa,SAAS;CACnC,cAAc;CACd,iBAAiB;CACjB,cAAc,EAAE,OAAO,CAAC,CAAC,SAAS;CAClC,eAAe,oBAAoB,SAAS;AAC9C,CAAC,CAAC,CACD,OAAO,CAAC,CACR,aAAa,OAAO,QAAQ;CAC3B,IAAI,MAAM,YAAY,MAAM,SAAS,UAAU,GAC7C,IAAI,SAAS;EACX,MAAM;EACN,MAAM,CAAC,YAAY,OAAO;EAC1B,SAAS;CACX,CAAC;CAGH,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,YAAY,QAAQ,KAAK;EACjD,MAAM,QAAQ,MAAM,YAAY,EAAE,CAAE;EACpC,IAAI,KAAK,IAAI,KAAK,GAChB,IAAI,SAAS;GACX,MAAM;GACN,MAAM;IAAC;IAAe;IAAG;GAAO;GAChC,SAAS,8BAA8B;EACzC,CAAC;EAEH,KAAK,IAAI,KAAK;CAChB;CAEA,IAAI,MAAM,WAAW,aAAa,CAAC,MAAM,cAAc,KAAK,GAC1D,IAAI,SAAS;EACX,MAAM;EACN,MAAM,CAAC,cAAc;EACrB,SAAS;CACX,CAAC;AAEL,CAAC;AAEH,MAAM,4BAA4B,EAC/B,OAAO;CACN,cAAc;CACd,MAAM;CACN,YAAY,WAAW,SAAS;AAClC,CAAC,CAAC,CACD,OAAO;AAEV,MAAa,uBAAkD,EAC5D,OAAO;CACN,SAAS;CACT,QAAQ;CACR,cAAc,eAAe,SAAS;CACtC,MAAM;CACN,mBAAmB;CACnB,iBAAiB;CACjB;CACA,QAAQ,EAAE,MAAM,yBAAyB,CAAC,CAAC,SAAS;CACpD,QAAQ,EACL,OAAO;EACN,MAAM,EAAE,KAAK;GAAC;GAAM;GAAS;EAAO,CAAC;EACrC,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,CAAC,CAAC,CACD,OAAO,CAAC,CACR,SAAS;CACZ,gBAAgB,eAAe,SAAS;CACxC,qBAAqB,mBAAmB,SAAS;CACjD,iBAAiB,eAAe,SAAS;CACzC,qBAAqB,eAAe,SAAS;AAC/C,CAAC,CAAC,CACD,OAAO,CAAC,CACR,QAAQ,SAAS,OAAO,KAAK,eAAe,KAAK,OAAO,KAAK,iBAAiB,GAAG;CAChF,MAAM,CAAC,iBAAiB;CACxB,SAAS;AACX,CAAC;AAEyC,EACzC,OAAO;CACN,aAAa,EAAE,QAAQ,mBAAmB;CAC1C,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC;AAC7B,CAAC,CAAC,CACD,OAAO;AAEgC,EACvC,OAAO;CACN,aAAa,EAAE,QAAQ,mBAAmB;CAC1C,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC;AAC5B,CAAC,CAAC,CACD,OAAO;AAEV,MAAa,8BAAgE,EAC1E,OAAO;CACN,aAAa,EAAE,QAAQ,mBAAmB;CAC1C,QAAQ,EAAE,MAAM,kBAAkB;AACpC,CAAC,CAAC,CACD,OAAO;AAEV,MAAa,4BAA4D,EACtE,OAAO;CACN,aAAa,EAAE,QAAQ,mBAAmB;CAC1C,OAAO,EAAE,MAAM,oBAAoB;AACrC,CAAC,CAAC,CACD,OAAO;AAEV,MAAa,uBAAkD,EAC5D,OAAO;CACN,UAAU;CACV,UAAU,EAAE,MACV,EACG,OAAO;EACN,OAAO;EACP,QAAQ;CACV,CAAC,CAAC,CACD,OAAO,CACZ;AACF,CAAC,CAAC,CACD,OAAO;;;;;;;;;;;;;;;;;;;;ACzkBV,MAAM,6BAA6B;AAEnC,SAAS,MAAM,IAA2B;CACxC,OAAO,IAAI,SAAS,YAAY,WAAW,SAAS,EAAE,CAAC;AACzD;AAEA,SAAS,oBAAoB,UAA0B;CACrD,OAAO,SAAS,KAAK,CAAC,CAAC,QAAQ,QAAQ,EAAE,CAAC,CAAC,QAAQ,SAAS,EAAE;AAChE;AAEA,SAAS,sBAAsB,KAAiC;CAC9D,MAAM,WAAW,OAAO,WAAW,OAAO,WAAW;CACrD,IAAI,SAAS,KAAK,CAAC,CAAC,WAAW,GAAG,MAAM,IAAI,MAAM,mCAAmC;CACrF,IAAI,SAAS,SAAS,4BACpB,MAAM,IAAI,MAAM,mCAAmC,2BAA2B,YAAY;CAE5F,OAAO;AACT;AAEA,SAAS,yBAAyB,OAE/B;CACD,OAAO,MAAM,OACV,KACE,UACC,GAAG,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,MAAM,CAAC,CAAC,KAAK,GAAG,IAAI,QAAQ,IAAI,MAAM,SACpF,CAAC,CACA,KAAK,IAAI;AACd;AAEA,eAAe,KACb,QACA,MACA,MACA,OAAuB,CAAC,GACC;CACzB,MAAM,YAAY,OAAO,aAAa;CACtC,MAAM,aAAa,OAAO,WAAW;CACrC,MAAM,IAAkB,OAAO,eAAe,GAAG,SAAS,MAAM,GAAG,IAAI;CAEvE,MAAM,MAAM,GADC,oBAAoB,OAAO,QACtB,IAAI;CACtB,MAAM,iBAAiB,sBAAsB,KAAK,cAAc;CAChE,MAAM,UAAkC;EACtC,gBAAgB;EAChB,eAAe,UAAU,OAAO;EAChC,sBAAsB,OAAO;EAC7B,yBAAyB;EACzB,mBAAmB;CACrB;CAEA,IAAI;CACJ,KAAK,IAAI,UAAU,GAAG,WAAW,YAAY,WAAW;EACtD,MAAM,aAAa,YAAY,QAAQ,SAAS;EAChD,MAAM,iBAAiB,KAAK,SAAS,YAAY,IAAI,CAAC,KAAK,QAAQ,UAAU,CAAC,IAAI;EAClF,IAAI;EACJ,IAAI;GACF,MAAM,MAAM,EAAE,KAAK;IACjB,QAAQ;IACR;IACA,MAAM,KAAK,UAAU,IAAI;IACzB,QAAQ;GACV,CAAC;EACH,SAAS,KAAK;GACZ,IAAI,KAAK,QAAQ,SAAS,MAAM;GAChC,YAAY;GACZ,IAAI,YAAY,YAAY,MAAM;GAClC,MAAM,MAAM,KAAK,UAAU,MAAM,KAAK,OAAO,IAAI,GAAG;GACpD;EACF;EAEA,IAAI,CAAC,IAAI,IAAI;GACX,MAAM,OAAO,MAAM,IAAI,KAAK,CAAC,CAAC,YAAY,EAAE;GAC5C,MAAM,wBAAQ,IAAI,MAAM,iBAAiB,IAAI,WAAW,IAAI,OAAO,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG;GAE5F,IAAI,EADc,IAAI,UAAU,OAAO,IAAI,WAAW,OAAO,IAAI,WAAW,QAC1D,YAAY,YAAY,MAAM;GAChD,YAAY;GACZ,MAAM,MAAM,KAAK,UAAU,MAAM,KAAK,OAAO,IAAI,GAAG;GACpD;EACF;EAEA,IAAI;EACJ,IAAI;GACF,cAAc,MAAM,IAAI,KAAK;EAC/B,SAAS,OAAO;GACd,MAAM,IAAI,MAAM,iBAAiB,IAAI,yBAAyB,EAAE,OAAO,MAAM,CAAC;EAChF;EACA,MAAM,SAAS,qBAAqB,UAAU,WAAW;EACzD,IAAI,CAAC,OAAO,SACV,MAAM,IAAI,MACR,iBAAiB,IAAI,iCAAiC,yBAAyB,OAAO,KAAK,GAC7F;EAEF,OAAO,OAAO;CAChB;CACA,MAAM,6BAAa,IAAI,MAAM,iCAAiC;AAChE;AAEA,SAAgB,mBAAmB,QAAoC;CACrE,IAAI,oBAAoB,OAAO,QAAQ,CAAC,CAAC,WAAW,GAAG,MAAM,IAAI,MAAM,sBAAsB;CAC7F,IAAI,OAAO,OAAO,KAAK,CAAC,CAAC,WAAW,GAAG,MAAM,IAAI,MAAM,oBAAoB;CAC3E,IAAI,OAAO,SAAS,KAAK,CAAC,CAAC,WAAW,GAAG,MAAM,IAAI,MAAM,sBAAsB;CAC/E,IACE,OAAO,cAAc,KAAA,MACpB,CAAC,OAAO,SAAS,OAAO,SAAS,KAAK,OAAO,aAAa,IAE3D,MAAM,IAAI,MAAM,kCAAkC;CAEpD,IAAI,OAAO,YAAY,KAAA,MAAc,CAAC,OAAO,UAAU,OAAO,OAAO,KAAK,OAAO,UAAU,IACzF,MAAM,IAAI,MAAM,wCAAwC;CAG1D,OAAO;EACL;EACA,aAAa;EAEb,MAAM,cAAc,OAAO,gBAAgB;GACzC,OAAO,KAAK,eAAe,CAAC,KAAK,GAAG,cAAc;EACpD;EAEA,MAAM,eAAe,QAAQ,gBAAgB;GAK3C,OAAO,KAA4B,QAAQ,wBAJP,4BAA4B,MAAM;IACpE,aAAa;IACb;GACF,CACsE,GAAG,EACvE,eACF,CAAC;EACH;EAEA,MAAM,aAAa,OAAO,gBAAgB;GAKxC,OAAO,KAA0B,QAAQ,qBAJP,0BAA0B,MAAM;IAChE,aAAa;IACb;GACF,CACiE,GAAG,EAClE,eACF,CAAC;EACH;CACF;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,oBACd,YAAkF,CAAC,GACzD;CAC1B,MAAM,MAAM,UAAU,OAAO,QAAQ;CACrC,MAAM,YACJ,UAAU,YACV,IAAI,qBACJ,IAAI,wBAAA,EACH,KAAK;CACR,MAAM,UAAU,UAAU,UAAU,IAAI,yBAAyB,IAAI,eAAA,EAAiB,KAAK;CAC3F,MAAM,YAAY,UAAU,YAAY,IAAI,iBAAA,EAAmB,KAAK;CACpE,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,UAAU,OAAO,KAAA;CAC9C,MAAM,SAAuB;EAAE,UAAU,SAAS,QAAQ,QAAQ,EAAE;EAAG;EAAQ;CAAS;CACxF,IAAI,UAAU,WAAW,OAAO,YAAY,UAAU;CACtD,IAAI,UAAU,cAAc,KAAA,GAAW,OAAO,YAAY,UAAU;CACpE,IAAI,UAAU,YAAY,KAAA,GAAW,OAAO,UAAU,UAAU;CAChE,OAAO;AACT;AAEA,SAAgB,oBACd,YAAkF,CAAC,GACzD;CAC1B,MAAM,SAAS,oBAAoB,SAAS;CAC5C,OAAO,SAAS,mBAAmB,MAAM,IAAI,KAAA;AAC/C"}

package/dist/client-D4F9hdzR.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"client-D4F9hdzR.d.ts","names":[],"sources":["../src/contract/insight-report.ts","../src/hosted/types.ts","../src/hosted/client.ts"],"mappings":";;;;;;UAqCiB;;EAEf;;;;EAKA,WAAW;;EAGX,WAAW;;;EAIX,cAAc,eAAe;;EAG7B;IACE,MAAM;IACN,QAAQ;;;;IAIR,aAAa;;;;;IAKb;MAAa;MAAe;;;;;;EAM9B,QAAQ,eAAe;;;;EAKvB,aAAa;;;;EAKb,OAAO;;;EAIP,kBAAkB;;;EAIlB,gBAAgB;;;;;EAMhB,qBAAqB;;;;;EAMrB,SAAS;;;;;;EAOT,wBAAwB;;;;EAKxB,iBAAiB;;;EAIjB,iBAAiB;;UAGF;EACf;IAAY;IAAW;;EACvB;IAAa;IAAW;;EACxB;IAAc;;EACd;;UAGe;;EAEf,YAAY;;EAEZ,SAAS;;;EAGT,YAAY;;;EAGZ;IACE;IACA,YAAY;IACZ,SAAS;IACT;;;EAGF,QAAQ;IAAQ;IAAe;;;;;EAI/B;IACE;IACA;IACA;;;;;EAKF;IACE;;;IAGA;;IAEA;;IAEA;;IAEA;;IAEA;;;;;IAKA,mBAAmB,OAAO,oBAAoB;;;;EAIhD;IACE;IACA;IACA;IACA;IACA;;;UAIa;;EAEf;;EAEA;;EAEA;;UAGe;EACf,OAAO;EACP,QAAQ;EACR,WAAW;EACX,QAAQ;EACR,YAAY;EACZ;IACE;IACA;IACA;IACA;IACA;;;;UAOa;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,WAAW;;;;;EAKX,WAAW;IAAQ;IAAe;;;UAGnB;;EAEf;;EAEA;;;EAGA,cAAc;;;EAGd;;;EAGA;;;EAGA;;UAGe;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,SAAS;;EAET,mBAAmB;IACjB;IACA,SAAS;MAAQ;MAAe;;IAChC;;;UAIa;EACf;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;UAGe;;EAEf,UAAU;IACR;IACA;;IAEA;;IAEA;;IAEA;;EAEF;;;;;UAMe;;EAEf,cAAc;;EAEd;;EAEA;;UAGe;;EAEf;;;EAGA;EACA,UAAU;IAAQ;IAAe;IAAgB;;;UAGlC;;;EAGf;;EAEA;;EAEA;;EAEA;;EAEA;IACE;IACA;IACA;;;UAIa;;;EAGf;EACA,MAAM;IACJ;IACA;IACA;;;;EAIF;;UAGe;;EAEf;;EAEA;;;;EAIA;;;EAGA;;EAEA;;EAEA;;EAEA;EACA;;;;EAIA;;UAGe;;EAEf;EACA;;EAEA;;;;EAIA,SAAS,eAAe;;;EAGxB;;EAEA;;UAGe;EACf;EACA;EACA;EACA;;EAEA;;;;cClYW;KACD,2BAA2B;;UAKtB;;EAEf;;EAEA;;EAEA,yBAAyB;;EAEzB;;;KAMU;UAQK;;EAEf;;EAEA;;EAEA;;EAEA,YAAY,eAAe;;EAE3B,iBAAiB;;EAEjB;;EAEA;;UAGe;;EAEf;;;EAGA;;;EAGA,UAAU;;EAEV,OAAO;;EAEP;;EAEA;;EAEA;;;;;;;UAQe;;EAEf;;EAEA;;EAEA;;EAEA,QAAQ;;EAER,QAAQ;;EAER,WAAW;;EAEX,aAAa;;EAEb,eAAe;;EAEf;;EAEA;;EAEA;;EAEA;;;;;;EAMA,gBAAgB;;;;;;KASN;;;;;;UAOK;EACf;EACA;EACA;EACA;EACA,mBAAmB;EACnB,iBAAiB;EACjB,YAAY;EACZ,SAAS;IACP,cAAc;IACd;IACA,aAAa;;EAEf;IAAW;IAAgC;;;EAE3C;;EAEA;;EAEA;;EAEA;;UAKe;EACf,aAAa;EACb,QAAQ;;UAGO;EACf,aAAa;EACb,OAAO;;UAGQ;;EAEf;;EAEA,UAAU;IAAQ;IAAe;;;;;UC1JlB;;EAEf;;EAEA;;EAEA;;EAEA,mBAAmB;;EAEnB;;EAEA;;UAGe;EACf,cAAc,OAAO,cAAc,0BAA0B,QAAQ;EACrE,eAAe,QAAQ,gBAAgB,0BAA0B,QAAQ;EACzE,aAAa,OAAO,kBAAkB,0BAA0B,QAAQ;WAC/D,QAAQ;WACR,aAAa;;iBAyGR,mBAAmB,QAAQ,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAsE1C,oBACd,YAAW,QAAQ;EAAkB,MAAM;IAC1C;iBAiBa,oBACd,YAAW,QAAQ;EAAkB,MAAM;IAC1C"}

package/dist/index-Ba636PKl.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-Ba636PKl.d.ts","names":[],"sources":["../src/campaign/analyst-surface.ts","../src/paired-arms.ts","../src/campaign/cross-surface-types.ts","../src/campaign/cross-surface-interaction.ts","../src/campaign/fixtures.ts","../src/campaign/gates/neutralization-gate.ts","../src/pre-registration.ts","../src/campaign/gates/sequential.ts","../src/campaign/gates/statistical-heldout.ts","../src/campaign/grounded-reflection.ts","../src/campaign/labeled-store/fs-adapter.ts","../src/campaign/neutralize.ts","../src/artifact-validator.ts","../src/completion-verifier.ts","../src/produced-state.ts","../src/agent-profile.ts","../src/integrity/backend-integrity.ts","../src/campaign/presets/run-profile-matrix.ts","../src/campaign/presets/playback.ts","../src/campaign/run-dir.ts","../src/campaign/scenario-selection.ts","../src/campaign/score-utils.ts","../src/campaign/search-ledger-errors.ts","../src/campaign/search-ledger.ts","../src/campaign/single-run-lock.ts","../src/campaign/surface-identity.ts","../src/campaign/transient-failure.ts","../src/campaign/worktree/index.ts"],"mappings":";;;;;;;;;;;;;;;;;;;UAoCiB,wBAAwB;EACvC;;EAEA,QAAQ;;;EAGR;;;;;;;EAOA,sBAAsB;IAAQ;IAAY;;;;;;;EAM1C;;;UAIe;EACf;EACA;;;EAGA;;UAGe;;;;;;EAMf,gBAAgB,KAAK;;EAErB,WACE,OAAO,oBACP,SAAS,yBACN,QAAQ;;;;;;;iBAkBC,4BACd,MAAM,sCAEN,SAAS,gBACT,UAAU,iBACV,KAAK,oBACF,QAAQ;UAgBI;;;EAGf;;;;;;;;;iBAUc,uBACd,OAAM,gCACL,YAAY,iBAAiB;;;;;UC7Ff;;;EAGf;;;;;EAKA;;EAEA;;EAEA;;EAEA,UAAU;;UAGK;;EAEf;;EAEA;;;UAIe;EACf;;;;EAIA;EACA,UAAU;EACV,WAAW;;UAGI;;EAEf,OAAO;;;EAGP,kBAAkB;;EAElB,mBAAmB;;;;;;;;;;;;;;;;;;;;iBAqBL,SAAS,eAAe,gBAAgB,MAAM,kBAAkB;;UA8G/D;;EAEf;;EAEA;;EAEA,SAAS;;EAET,gBAAgB;;;UAID;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;;;EAIA,aAAa;;EAEb;IAAY;IAAW;;;UAGR,iCAAiC;;;;EAIhD;;EAEA,YAAY;;UAGG;EACf;EACA;EACA;;;EAGA,aAAa;EACb,cAAc;;;;;;;;;;;;;;;iBAgBA,kBACd,eAAe,gBACf,MAAM,2BACL;UAmEc;EACf;EACA;EACA,UAAU;EACV,WAAW;;UAGI;EACf,OAAO;EACP,kBAAkB;EAClB,mBAAmB;;;;;;;;;iBAeL,eACd,uBAAuB,aACvB,wBAAwB,cACvB;;;;KCjXS;;UAGK;EACf;EACA;;EAEA;;;UAIe;EACf;EACA;EACA;EACA;;;UAIe;EACf;;EAEA;;EAEA;;;;;;;UAQe;EACf;EACA;;EAEA;EACA,cAAc;EACd;EACA;;;;;;EAMA,MAAM;EACN,mBAAmB;;EAEnB;;UAGe;EACf;EACA;EACA;;;UAIe;EACf;EACA;EACA;EACA;;EAEA,kCAAkC;;EAElC;;UAGe,qCACf,aAAa,sBAAsB;EAEnC,qBAAqB;EACrB,qBAAqB;EACrB,eAAe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;EACA,WAAW;EACX,WAAW;;UAGI;EACf;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;;UAGe;EACf,aAAa;EACb;EACA;EACA;EACA;;KAGU;UAWK;EACf;EACA,SAAS;;UAGM;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;EACf,WAAW;EACX,SAAS;EACT,OAAO;EACP,OAAO,eAAe;EACtB,QAAQ;EACR,QAAQ;;EAER,sBAAsB;;EAEtB,aAAa;;UAGE;EACf;EACA;EACA;;EAEA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA,QAAQ;EACR,cAAc,eAAe;;UAGd;EACf;EACA;EACA;EACA;EACA;;UAGe;EACf;;EAEA;EACA;;UAGe;EACf,SAAS;EACT;EACA;EACA;EACA;EACA,eAAe;EACf,gBAAgB;;KAGN;UAYK;EACf;EACA,SAAS;EACT;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA,4BAA4B,iCAAiC;EAC7D,wBAAwB,eAAe;EACvC,QAAQ;EACR,QAAQ;EACR,aAAa;EACb,eAAe;;UAGA;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA,SAAS;;UAGM;;EAEf;EACA;;KAGU;UAaK;EACf;EACA;EACA;EACA;EACA;EACA,uBAAuB;EACvB;EACA;EACA,SAAS;;UAGM;EACf;EACA;EACA,YAAY;EACZ;;;UAIe;EACf;EACA;EACA;EACA;EACA,OAAO;;UAGQ;;EAEf;;EAEA;EACA;;EAEA;EACA;;EAEA,gBAAgB;;EAEhB,OAAO;;UAGQ;EACf,YAAY;EACZ,YAAY;EACZ,kBAAkB;;UAGH,8BACf,aAAa,sBAAsB;EAEnC;EACA;EACA;EACA;;EAEA,MAAM;EACN,iBAAiB;EACjB,iBAAiB;EACjB,YAAY;EACZ,UAAU;EACV,YAAY;;;;;;;;;iBCnRE,gCAAgC,aAAa,qBAC3D,OAAO,qCAAqC,QAC3C,8BAA8B;;;KC7CrB;UAEK;EACf;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;EACA,OAAO;EACP;;UAGe,4BAA4B;EAC3C;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe;;EAEf,aAAa;;EAEb;;UAGe,wCAAwC;EACvD;;UAGe,0BAA0B,6BACjC,KACN,uBAAuB,qBAAqB;EAG9C;EACA,aAAa;EACb;EACA;EACA,UAAU;;KAGA,qBAAqB;EAC/B,UAAU,MAAM,KAAK;;;iBAIP,qBAAqB;;;;;iBA4BrB,gBACd,kBACA,cACA,UAAS,yBACR;;iBA4Ca,yBACd,kBACA,UAAS,kCACR;;;;;iBAuBa,mBAAmB,qBACjC,SAAS,0BAA0B,aAClC;;;UChJc,0BAA0B,kBAAkB,WAAW;EACtE,WAAW;;;;;EAKX;;;;;;iBAuBc,mBAAmB,WAAW,kBAAkB,UAC9D,SAAS,0BAA0B,aAClC,KAAK,WAAW;;;;;;;;;;;;;UC9CF;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;EACA;;;;;;;;;;KAWU;UAEK,uBAAuB;;EAEtC;;;;;;;;;EASA,OAAO;;UAGQ;EACf,UAAU;EACV;EACA;EACA;;;EAGA;;EAEA,kBAAkB;EAGlB;;;;;;;;;;;iBAYc,aAAa;;;;;;;;;;;;;;;;;;;;;;iBA8BP,SAAS,GAAG,KAAK,IAAI;;;;;;;;;;iBAkBrB,aAAa,GAAG,qBAAqB,QAAQ;;;;;;;iBAW7C,eAAe,GAAG,iBAAiB;;;;;iBAWnC,mBACpB,UAAU,gBACV;EAAY;EAAW;EAAgB;IACtC,QAAQ;;;KCpHC;UAEK;EACf,UAAU;;EAEV;;EAEA;;;EAGA;;UAGe;;;EAGf;;;;EAIA;;;EAGA;;EAEA;;;;EAIA;;;EAGA;;;EAGA,kBAAkB;;EAElB;;UAGe,qBAAqB,qBAAqB,kBAAkB,WAAW,kBAC9E,KAAK,WAAW;;;;;;;;EAQxB,QAAQ,gBAAgB;;EAExB,SAAS;IAAkB,UAAU;;;;;;;;;;;;;;;;;iBA0MvB,qBAAqB,qBAAqB,kBAAkB,WAAW,UACrF,SAAS,8BACR,qBAAqB,WAAW;UAsFlB;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe;GACd;IAAQ,SAAS;;IAAyB;IAAe;;;EAE1D,SAAS;;;;;;;;;;;;;;;;;;;;;;;;;iBA0BK,iBAAiB,UAAS,0BAA+B;;;UCjYxD;;EAEf;;EAEA;;EAEA;;;;;;;;;;;;;iBAcc,YACd,WAAW,YAAY,eAAe,cACtC,UAAU,YAAY,eAAe,cACrC,aAAa,aACb,SAAS,GAAG,oCACX;UAsDc;EACf,QAAQ;;;EAGR,WAAW;;;;EAIX,iBAAiB;;;;EAIjB;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA;;EAEA;EACA;;;;;;;;iBASc,oBACd,QAAQ,eACR,OAAM,6BACL;UA+Cc;EACf;EACA,WAAW;;;EAGX;EACA;EACA;;;;;iBAMc,YAAY;;;;;;;iBAUZ,qBACd,WAAW,YAAY,eAAe,cACtC,UAAU,YAAY,eAAe,cACrC,aAAa,aACb,8BACA;EAAQ;EAAoB;EAAqB;EAAoB;IACpE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;UC3Mc;WACN;WACA,MAAM,SAAS;;;UAIT;;WAEN;;WAEA;WACA,gBAAgB;;UAGV;;WAEN;;WAEA;;UAGM;;WAEN;;WAEA,eAAe;;WAEf,eAAe;;;;;;;;iBASV,oBACd,mBAAmB,iBACnB,OAAM,6BACL;UAsCc;;WAEN;;WAEA;;;;;;;;;iBAUK,2BACd,cACA,MAAM,KAAK,0DACV;;;UCjFc;;EAEf;;;EAGA;;EAEA;;;cAIW,kCAAkC;WAE3B;EADlB,YACkB,cAChB;;;;;;cAiBS,kCAAkC;mBAIhB;mBAHZ;mBACA;EAEjB,YAA6B,SAAS;EAKhC,QAAQ,OAAO,uBAAuB;EAYtC,OAAO,MAAM,4BAA4B,QAAQ;EA8CjD,QAAQ;IACZ;IACA;IACA,UAAU;IACV,SAAS,OAAO;;UAkCV;UAiCA;UAmBA;UAkBA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBCtNM,eAAe;;;;;;;;;;;;;;;;UClBd;;EAEf;;EAEA;;EAEA;;EAEA,QAAQ;;EAER,WAAW;;UAGI;EACf;EACA;;EAEA,iBAAiB;;EAEjB,QAAQ;;UAGO;EACf;EACA;;EAEA;;UAGe;EACf;;EAEA;EACA,QAAQ;;EAER,WAAW;;UAGI;;EAEf;;EAEA;;EAEA,SAAS,UAAU,UAAU,SAAS,oBAAoB,QAAQ;;;;;;iBAWpD,kBACd,YAAY,qBACZ;EAAY;EAAe;IAC1B;;iBAgCa,WAAW,cAAc,SAAS,SAAS;;iBAkB3C,YAAY,cAAc,0BAA0B;;iBAuCpD,gBAAgB,cAAc,aAAa,cAAc;;iBAoBzD,YACd,cACA,oBACA;EAAY;IACX;;;;KCnJS;UAEK;;EAEf;;EAEA;;EAEA;;EAEA,cAAc;;UAGC;EACf;EACA,cAAc;;UAGC;EACf;EACA;EACA;;EAEA;;;UAIe;;EAEf,WAAW;;EAEX,WAAW;;EAEX;;UAGe;EACf;EACA;;EAEA;;;;;;EAMA;;EAEA;;;;;;;;;EASA;;EAEA;;EAEA;;;;;UAMe,0BAA0B;EACzC;EACA,cAAc;;EAEd;;EAEA;;EAEA;;;;;;;;;iBAUc,kBAAkB;EAChC;EACA,cAAc;IACZ;;;;;;KAoCQ,sBACV,aAAa,uBACb,oBACG;EAAU;EAAkB;;;;;;;;;iBAqLX,iBACpB,MAAM,UACN,OAAO,eACP,kBAAkB,qBACjB,QAAQ;UAoFM;EACf;;EAEA,aAAa;EACb;EACA,WAAW;EACX,SAAS;;EAET;;;;;;EAMA;;;;;;EAMA,UAAU;;;;;;;;;iBAUI,yBAAyB;EAAgB;EAAkB;;;;;;;;iBAiC3D,4BACd,MAAM,YACN,OAAM,4BACL;;;;;;;;;;;;;;;iBA6Ia,yBACd;EAAQ;EAAoB;IAC3B;;;;UC/mBc;EACf;EACA;;;;;;;UAQe;EACf;EACA;EACA;EACA;EACA;EACA;;;UAIe;EACf;EACA;EACA;EACA;EAIA;;;;;;;;KASU,mBACR,oBACA,oBACA;EACE;;;;;;;;;;;;iBAmBU,qBAAqB,iBAAiB,qBAAqB;;;;;;;;;;cCjE9D,2BAA2B;UAOvB;;;EAGf,MAAM;;EAEN,qBAAqB;;;EAGrB;;;;;;EAMA;;;;;;;cAQW;;;;;;;;;;;;;;;;;;iBAmBG,kBAAkB,MAAM,kBAAkB;;;;;;;;iBAuD1C,cACd,SAAS,KAAK;EACX,SAAS;EAAa;;;;;;;;;iBAiBX,eAAe,SAAS;;;;;iBASxB,oBAAoB,SAAS;;;;;;;;;;;iBA0C7B,iBAAiB,SAAS;;;UChKzB;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;;;;cAQW,8BAA8B;WAGvB,QAAQ;EAF1B,YACE,iBACgB,QAAQ;;;;;;;iBAWZ,0BACd,SAAS,cAAc,aACtB;;iBAWa,+BACd,UAAU,cAAc,eACvB;;;;;;;;iBA0Ga,kBACd,SAAS,cAAc,YACvB;EAAQ;IACP;;iBAMa,wBACd,UAAU,cAAc,cACxB;EAAQ;IACP;;;;;;cC/HU,2BAA2B;EACtC,YAAY;;;;;KAQF,kBAAkB,kBAAkB,UAAU,cACxD,SAAS,gBACT,UAAU,WACV,KAAK,oBACF,QAAQ;UAEI,wBAAwB,kBAAkB,UAAU;;EAEnE,UAAU;;EAEV,WAAW;;EAEX,UAAU,kBAAkB,WAAW;;EAEvC,SAAS,YAAY,WAAW;;;EAGhC;;;EAGA;;;;EAIA;;EAEA,WAAW;;EAEX;;EAEA;;;;;;;;EAQA;;;EAGA;;;EAGA;;EAEA;;EAEA,eAAe;EACf,gBAAgB;;;EAGhB,UAAU;;EAEV,YAAY;;;EAGZ,aAAa,UAAU;;;;EAIvB;;;;;;;EAOA,cACE,UAAU,WACV,UAAU;IACL;IAAgB;;;UAGR;EACf;EACA;EACA;;EAEA;;EAEA;EACA;;;EAGA,WAAW;;UAGI;EACf;EACA;;UAGe,uBAAuB,WAAW,kBAAkB;EACnE;EACA;;;;EAIA,SAAS;EACT,WAAW,eAAe;EAC1B,YAAY,eAAe;;EAE3B,YAAY,eAAe;;EAE3B,WAAW;;EAEX,WAAW,eAAe,eAAe,WAAW;;;;;iBA0GhC,iBAAiB,kBAAkB,UAAU,WACjE,MAAM,wBAAwB,WAAW,aACxC,QAAQ,uBAAuB,WAAW;;;;;UC/Q5B;;EAEf;;EAEA,UAAU;;;;;;;UAQK,kBAAkB;;EAEjC;;EAEA,OAAO;;EAEP,cAAc;;;UAIC,wBAAwB;EACvC,SAAS;;;;;;;;;;;UAYM,eAAe,eAAe,YAAY;EACzD,IAAI,OAAO,QAAQ,KAAK,kBAAkB,iBAAiB;;;;;;;iBAQ7C,qBAAqB,eAAe,WAClD,QAAQ,eAAe,UACtB,kBAAkB,QAAQ;;UAQZ,yBAAyB;EACxC;;;;;;;;iBASoB,eACpB,OAAO,WACP,OAAO,eACP,kBAAkB,qBACjB,QAAQ;;UAUM;EACf;EACA;EACA;EACA;EACA;EACA;;;;;;;iBAQc,oBAAoB,mBAAmB,qBAAqB;;UAkB3D;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;iBAIc,kBAAkB,eAAe,kBAAkB;UAwBlD;;EAEf;;EAEA,OAAO;;EAEP;;;;;;;;;iBAkBc,yBACd,eAAe,iBACf,OAAM;;;;;;;;iBCnMQ;;;;;iBAQA,cAAc,gBAAgB;;;;;;;;;;;;;;;;;UCD7B;EACf;;EAEA;;UAGe;EACf;;EAEA;;EAEA;EACA;;EAEA;;;;;;;;;;iBA4Cc,oBACd,SAAS,kBACT;EAAS;IACR;;;;;;;;;;;iBA0Ba,qBACd,SAAS,kBACT,WACA;EAAS;;;;;;;iBC3FK,sBAAsB,WAAW,kBAAkB,UACjE,UAAU,eAAe,WAAW;;;;iBA0CtB,gBAAgB,sBAAsB;UAWrC;;EAEf,YAAY;;;;;EAKZ,WAAW;IAAQ;IAAoB;IAAmB;IAAgB;;;;;iBAK5D,kBAAkB,WAAW,kBAAkB,UAC7D,UAAU,eAAe,WAAW,aACnC;;;;cC/EU,0BAA0B;;cAG1B,mCAAmC;;cAGnC,kCAAkC;;;cC+BlC;KAED,mBAAmB;KAEnB;;;UAYK;EACf;EACA;EACA,QAAQ;EACR;;;;UAKe;EACf;EACA;;UAGe;EACf;EACA;;UAGe;EACf;EACA,MAAM;EACN,UAAU;;UAGK;;EAEf;EACA;EACA;EACA;EACA,gBAAgB;;KAGN;UAOK;EACf;EACA,QAAQ;EACR,WAAW;;;EAGX;;UAGe;EACf;EACA,MAAM;;UAGS;EACf;;;EAGA;;UAGe;;EAEf,gBAAgB;;EAEhB,OAAO;;EAEP,YAAY;;KAGF;EAEN;EACA;EACA;EACA;;EAGA;EACA;;KAGM;EAEN;EACA;EACA;;EAGA;;EAEA;EACA;;UAGW;EACf,QAAQ;EACR,MAAM;;UAGS;EACf;EACA;;KAGU;EAEN;EACA;EACA,SAAS;;EAGT;EACA;EACA,SAAS;EACT,SAAS;;EAGT;EACA,SAAS;EACT,OAAO;IAAwB;;;KAGzB;EAEN;EACA;EACA;EACA;EACA;;EAGA;EACA;;;;UAKW;EACf;EACA;EACA;EACA,QAAQ;EACR,UAAU;;UAGF;EACR;EACA;EACA,WAAW;;UAGI,2BAA2B;EAC1C;EACA,MAAM;;UAGS,uCAAuC;EACtD;EACA;EACA;EACA;EACA,SAAS;EACT,UAAU;;UAGK,uCAAuC;EACtD;EACA;EACA;EACA,QAAQ;;UAGO,iCAAiC;EAChD;EACA;EACA;EACA;EACA;IACE;IACA,QAAQ;;EAEV;IACE,OAAO;IACP,OAAO;IACP,WAAW;;EAEb,SAAS;EACT,YAAY;EACZ,iBAAiB;;UAGF,qCAAqC;EACpD;EACA;EACA,eAAe;EACf;IAEM;IACA,OAAO;IACP,QAAQ;;IAGR;IACA,QAAQ;;EAEd;IACM;;IACA;IAAmB,SAAS;;IAC5B;IAAkB,SAAS;;EACjC,YAAY;;UAGG,oCAAoC;EACnD;EACA;EACA;IACM;;IAEA;IACA,QAAQ;;;UAIC,6BAA6B;EAC5C;EACA;IAEM;IACA;;IAGA;IACA,QAAQ;;;KAIJ,oBACR,qBACA,iCACA,iCACA,2BACA,+BACA,8BACA;UAEa;EACf,eAAe;EACf;EACA;EACA,cAAc;EACd,OAAO;EACP,WAAW;;KAGD;EAEN;EACA;EACA;EACA;EACA;;EAGA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGW;EACf;EACA;EACA;EACA;EACA;EACA;EACA;IAAY;IAAgB;IAAgB;;EAC5C;IAAqB;IAAmB;IAAiB;;EACzD;IAAa;IAAkB;IAAkB;;EACjD;IACE;IACA;IACA;IACA;IACA;IACA;;EAEF;EACA;EACA,YAAY;EACZ,UAAU;;UAGK;EACf,SAAS;EACT,MAAM;EACN,YAAY;EACZ,sBAAsB;EACtB,UAAU;EACV,YAAY;EACZ,WAAW;EACX,YAAY;EACZ,OAAO;;UAGQ;EACf,OAAO;;EAEP;EACA,QAAQ;;;;iBA+ZM,0BAA0B,iBAAiB;;;;;;;;;;;;;;;KAsB/C;UAEK;EACf;EACA;EACA,cAAc;;UAGC;WACN;WACA;;WAEA;EACT,OAAO,OAAO,oBAAoB,QAAQ;EAC1C,UAAU,QAAQ;;EAElB,eAAe,QAAQ;;;;iBAKT,iBAAiB,SAAS,0BAA0B;;cA8BvD,4BAA4B;WAC9B;WACA;WACA;mBACQ;mBACA;EAMjB,YAAY,cAAc,oBAAoB,cAAa;EAerD,UAAU,QAAQ;EAIlB,OAAO,OAAO,oBAAoB,QAAQ;EAU1C,eAAe,QAAQ;;;;;;;;;;;;;;;;;;;UC52Bd;;WAEN;;WAEA;;WAEA;;WAEA;;UAGM;;EAEf;;;;;;;iBAwBc,qBAAqB,MAAM,uBAAuB;;;;iBCpDlD,0BAA0B,2BAA2B,WAAW;;iBAmChE,uBAAuB,2BAA2B,WAAW;;iBA8B7D,iCAAiC,SAAS;;;;iBAa1C,4BAA4B,SAAS;;iBAgBrC,mBAAmB,SAAS;;iBAW5B,YAAY,SAAS;;iBAKrB,kBACd,eAAe,gBACf,iBAAiB;;;;;;;;;;;;;;;;;;;;;UCpGF;;;;;;;WAON;;WAEA,yBAAyB;;;;;;iBAYpB,4BACd,oCACA,OAAM;;;KCNH,qBAAqB;KACrB,iBAAiB,SAAS;KAC1B,aAAa,gBAAgB,aAAa,MAAM,mBAAmB;UAcvD;;WAEN;;WAEA;;WAEA;;WAEA;;WAEA;;UAGM;;EAEf,OAAO;IAAQ;IAAiB;MAAkB,QAAQ;;;EAG1D,SAAS,UAAU,UAAU,kBAAkB,QAAQ;;EAEvD,QAAQ,UAAU,WAAW;;;cAIlB,6BAA6B;WAG7B;EAFX,YACE,iBACS;;UAOI;;EAEf;;EAEA;;EAEA;;;;EAIA,MAAM;;UAobS;;EAEf;;EAEA;;EAEA;;;EAGA,YAAY;;;;;iBAoJE,mBAAmB,MAAM,4BAA4B;;;;iBA0FrD,kBACd,SAAS,aACT,uBACC;;;iBAOa,oBAAoB,SAAS,aAAa"}

package/dist/index-DSC51roc.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-DSC51roc.d.ts","names":[],"sources":["../src/matrix/types.ts","../src/matrix/runner.ts"],"mappings":";;;;UAgBiB,WAAW;;EAE1B;;EAEA,QAAQ;IAAQ;IAAY,OAAO;;;;EAGnC,SAAS,OAAO,GAAG;;;UAIJ;EACf,MAAM;IAAiB;IAAY;;;EAEnC;;EAEA;;UAGe,WAAW;EAC1B,QAAQ;EACR,SAAS;EACT;EACA;EACA;;;EAGA;IAAU;IAAiB;;;UAGZ;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;UAGe,aAAa;EAC5B,OAAO;IAAQ,MAAM;IAAY,MAAM,WAAW;;;;EAGlD,QAAQ,eAAe,eAAe;EACtC;IACE;IACA;;;IAGA;IACA;IACA;IACA;IACA;;;EAGF;;UAGe,sBAAsB;EACrC,MAAM;;;EAGN,UAAU,MAAM,eAAe,QAAQ,WAAW;;EAElD;;EAEA,UAAU,MAAM,KAAK;;EAErB;;EAEA;;;;EAIA;;EAEA,kBAAkB,MAAM,YAAY,QAAQ,WAAW;;;EAGvD,SAAS;;;;iBCjBW,eAAe,QACnC,MAAM,sBAAsB,UAC3B,QAAQ,aAAa"}

package/dist/index-nhIYz9hn.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-nhIYz9hn.d.ts","names":[],"sources":["../src/ledger-core/atomic-file-lock.ts","../src/ledger-core/canonical.ts","../src/ledger-core/journal-file.ts","../src/ledger-core/trusted-head.ts","../src/ledger-core/journal.ts"],"mappings":";;;UAiBiB;WACN;WACA;WACA;;UAGM;WACN,OAAO;EAChB;;KAGU;WACG;WAA0B;WAAyB,QAAQ;;WAC3D;WAA0B;;KAE7B;WACG;WAAyB,MAAM;IAC1C;UAEa;WACN;WACA;;cAGE,4BAA4B;WACrB;;;iBASJ,oBACd,SAAS,wBACR;;;;;;;iBAea,yBACd,SAAS,wBACR;;;KCjDS;;cAGC,qBAAmB;;cAGnB,oCAAoC;;;;iBAKjC,gBAAgB;iBAQhB,cAAc,iBAAiB;;;;;UCzB9B;;EAEf;EACA,eAAe,iBAAiB;IAAY;MAAoB;;;;iBAKlD,iBAAiB,cAAc,cAAc,SAAS;;;;iBAetD,0BACd,cACA,kBACA,SAAS;iBAoBK,mBAAmB,GAAG,cAAc,SAAS,mBAAmB,WAAW,IAAI;KAQnF,eAAe;EAAO;EAAgB,OAAO;;EAAQ;;iBAEjD,sBAAsB,GACpC,cACA,SAAS,mBACT,WAAW,IACV,eAAe;;;;UC7BD;EACf;EACA,WAAW;;;UAII;EACf;EACA,WAAW;;;;iBAKG,mBAAmB;;;;iBA4DnB,gCACd,kBAAkB,uBAClB,MAAM,mBACN,SAAS,mBACT;;;;UCtFe;EACf;;;;;UAMe,kBAAkB,cAAc;EAC/C;EACA,cAAc;EACd,OAAO;EACP,WAAW;;KAGD,cAAc,uBAAuB,cAAc,mBAAmB,SAChF,kBAAkB;UAEH;EACf;EACA;;;;;UAMe,gBAAgB,OAAO;EACtC,MAAM,OAAO,OAAO;EACpB,OAAO,SAAS,UAAU;;UAGX,mBACf,uBACA,cAAc,iBACd,oBACQ;;EAER,QAAQ;EACR,cAAc,kBAAkB;;;;EAIhC,WAAW,cAAc,SAAS,oBAAoB,cAAc,QAAQ;;EAE5E,iBAAiB,OAAO,cAAc,QAAQ,QAAQ;EACtD,mBAAmB,gBAAgB,cAAc,QAAQ,QAAQ;;UAGlD,mBAAmB,OAAO;EACzC,SAAS;EACT,YAAY;;UAGG,mBAAmB,OAAO;EACzC,OAAO;;EAEP;EACA,YAAY;;UAGG;;;;;;EAMf;;UAGe;;;;;;;EAOf;;;;cAiBW,kBAAkB,uBAAuB,cAAc,iBAAiB;WAC1E;;WAEA;mBACQ;mBACA;mBACA;EAEjB,YACE,cACA,OAAO,mBAAmB,QAAQ,OAAO,aACzC,UAAS;EASL,UAAU,QAAQ,mBAAmB,cAAc,QAAQ,QAAQ;EAMnE,OACJ,OAAO,OACP,UAAS,sBACR,QAAQ,mBAAmB,cAAc,QAAQ,QAAQ;;EA2CtD,eAAe,QAAQ;;;;EAWvB,kBAAkB,QAAQ;UAqBxB;UAUA;UAkBA;UAgDA"}

package/dist/ledger-core-CPZfcrC2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ledger-core-CPZfcrC2.js","names":[],"sources":["../src/ledger-core/atomic-file-lock.ts","../src/ledger-core/canonical.ts","../src/ledger-core/journal-file.ts","../src/ledger-core/trusted-head.ts","../src/ledger-core/journal.ts"],"sourcesContent":["/** Crash-safe filesystem lock shared by campaign persistence and run exclusion. */\n\nimport { randomUUID } from 'node:crypto'\nimport {\n  closeSync,\n  constants,\n  existsSync,\n  fsyncSync,\n  linkSync,\n  openSync,\n  readFileSync,\n  renameSync,\n  unlinkSync,\n  writeFileSync,\n} from 'node:fs'\nimport { hostname } from 'node:os'\n\nexport interface AtomicFileLockOwner {\n  readonly pid: number\n  readonly host: string\n  readonly nonce: string\n}\n\nexport interface AtomicFileLock {\n  readonly owner: AtomicFileLockOwner\n  release(): void\n}\n\nexport type AtomicFileLockUnavailable =\n  | { readonly acquired: false; readonly reason: 'held'; readonly holder: AtomicFileLockOwner }\n  | { readonly acquired: false; readonly reason: 'recovery' }\n\nexport type AtomicFileLockAcquisition =\n  | { readonly acquired: true; readonly lock: AtomicFileLock }\n  | AtomicFileLockUnavailable\n\nexport interface AtomicFileLockOptions {\n  readonly lockPath: string\n  readonly pid?: number\n}\n\nexport class AtomicFileLockError extends Error {\n  override readonly name = 'AtomicFileLockError'\n}\n\ntype OwnerState =\n  | { readonly state: 'missing' }\n  | { readonly state: 'stale'; readonly owner: AtomicFileLockOwner }\n  | { readonly state: 'held'; readonly owner: AtomicFileLockOwner }\n\n/** Report whether another lock path prevents acquisition without modifying it. */\nexport function probeAtomicFileLock(\n  options: AtomicFileLockOptions,\n): AtomicFileLockUnavailable | null {\n  if (existsSync(recoveryPath(options.lockPath))) return { acquired: false, reason: 'recovery' }\n  const state = ownerState(options.lockPath)\n  if (state.state === 'held') {\n    return { acquired: false, reason: 'held', holder: state.owner }\n  }\n  return null\n}\n\n/**\n * Try to acquire a complete, uniquely-owned lock inode.\n *\n * A hard link publishes fully-written owner metadata atomically. Stale-owner\n * removal is serialized so one reclaimer cannot delete a new owner's lock.\n */\nexport function tryAcquireAtomicFileLock(\n  options: AtomicFileLockOptions,\n): AtomicFileLockAcquisition {\n  const pid = options.pid ?? process.pid\n  if (!Number.isSafeInteger(pid) || pid <= 0) {\n    throw new AtomicFileLockError('atomic file lock pid must be a positive integer')\n  }\n  const owner: AtomicFileLockOwner = { pid, host: hostname(), nonce: randomUUID() }\n  for (let attempt = 0; attempt < 8; attempt += 1) {\n    if (existsSync(recoveryPath(options.lockPath))) {\n      return { acquired: false, reason: 'recovery' }\n    }\n    if (tryLinkOwner(options.lockPath, owner, `acquire.${attempt}`)) {\n      return acquired(options.lockPath, owner)\n    }\n\n    const holder = ownerState(options.lockPath)\n    if (holder.state === 'missing') continue\n    if (holder.state === 'held') {\n      return { acquired: false, reason: 'held', holder: holder.owner }\n    }\n\n    const reclaimPath = recoveryPath(options.lockPath)\n    if (!tryLinkOwner(reclaimPath, owner, `reclaim.${attempt}`)) {\n      return { acquired: false, reason: 'recovery' }\n    }\n    try {\n      const current = ownerState(options.lockPath)\n      if (current.state === 'held') {\n        return { acquired: false, reason: 'held', holder: current.owner }\n      }\n      if (current.state === 'stale') {\n        const tombstone = `${options.lockPath}.stale.${owner.nonce}.${attempt}`\n        try {\n          renameSync(options.lockPath, tombstone)\n          unlinkSync(tombstone)\n        } catch (error) {\n          if (!isMissing(error)) throw error\n        }\n      }\n      if (tryLinkOwner(options.lockPath, owner, `recovered.${attempt}`)) {\n        return acquired(options.lockPath, owner)\n      }\n    } finally {\n      releaseOwnedPath(reclaimPath, owner)\n    }\n  }\n\n  throw new AtomicFileLockError(`could not acquire atomic file lock ${options.lockPath}`)\n}\n\nfunction acquired(lockPath: string, owner: AtomicFileLockOwner): AtomicFileLockAcquisition {\n  return {\n    acquired: true,\n    lock: {\n      owner,\n      release: () => releaseOwnedPath(lockPath, owner),\n    },\n  }\n}\n\nfunction tryLinkOwner(lockPath: string, owner: AtomicFileLockOwner, suffix: string): boolean {\n  const ownerPath = `${lockPath}.${owner.pid}.${owner.nonce}.${suffix}.owner`\n  const descriptor = openSync(\n    ownerPath,\n    constants.O_CREAT | constants.O_EXCL | constants.O_WRONLY,\n    0o600,\n  )\n  try {\n    writeFileSync(descriptor, `${canonicalOwner(owner)}\\n`, 'utf8')\n    fsyncSync(descriptor)\n  } catch (error) {\n    closeSync(descriptor)\n    unlinkIfExists(ownerPath)\n    throw error\n  }\n  closeSync(descriptor)\n\n  try {\n    linkSync(ownerPath, lockPath)\n    return true\n  } catch (error) {\n    if (!isAlreadyExists(error)) throw error\n    return false\n  } finally {\n    unlinkIfExists(ownerPath)\n  }\n}\n\nfunction ownerState(lockPath: string): OwnerState {\n  const owner = readOwner(lockPath)\n  if (!owner) return { state: 'missing' }\n  if (owner.host !== hostname()) return { state: 'held', owner }\n  try {\n    process.kill(owner.pid, 0)\n    return { state: 'held', owner }\n  } catch (error) {\n    if (isNoSuchProcess(error)) return { state: 'stale', owner }\n    return { state: 'held', owner }\n  }\n}\n\nfunction readOwner(lockPath: string): AtomicFileLockOwner | undefined {\n  let contents: string\n  try {\n    contents = readFileSync(lockPath, 'utf8').trim()\n  } catch (error) {\n    if (isMissing(error)) return undefined\n    throw error\n  }\n\n  let value: unknown\n  try {\n    value = JSON.parse(contents)\n  } catch (error) {\n    throw invalidOwner(lockPath, error)\n  }\n  if (!isOwner(value)) throw invalidOwner(lockPath)\n  return value\n}\n\nfunction isOwner(value: unknown): value is AtomicFileLockOwner {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) return false\n  const record = value as Record<string, unknown>\n  return (\n    Object.keys(record).length === 3 &&\n    Number.isSafeInteger(record.pid) &&\n    Number(record.pid) > 0 &&\n    typeof record.host === 'string' &&\n    record.host.trim().length > 0 &&\n    typeof record.nonce === 'string' &&\n    record.nonce.trim().length > 0\n  )\n}\n\nfunction invalidOwner(lockPath: string, cause?: unknown): AtomicFileLockError {\n  const error = new AtomicFileLockError(\n    `atomic file lock has an invalid owner (${lockPath}); refusing unsafe recovery`,\n  )\n  if (cause !== undefined) Object.defineProperty(error, 'cause', { value: cause })\n  return error\n}\n\nfunction releaseOwnedPath(lockPath: string, owner: AtomicFileLockOwner): void {\n  const current = readOwner(lockPath)\n  if (!current) return\n  if (canonicalOwner(current) !== canonicalOwner(owner)) {\n    throw new AtomicFileLockError(`atomic file lock owner changed before release (${lockPath})`)\n  }\n  try {\n    unlinkSync(lockPath)\n  } catch (error) {\n    if (!isMissing(error)) throw error\n  }\n}\n\nfunction canonicalOwner(owner: AtomicFileLockOwner): string {\n  return JSON.stringify({ host: owner.host, nonce: owner.nonce, pid: owner.pid })\n}\n\nfunction recoveryPath(lockPath: string): string {\n  return `${lockPath}.reclaim`\n}\n\nfunction isAlreadyExists(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'EEXIST'\n}\n\nfunction isMissing(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ENOENT'\n}\n\nfunction isNoSuchProcess(error: unknown): boolean {\n  return error instanceof Error && 'code' in error && error.code === 'ESRCH'\n}\n\nfunction unlinkIfExists(path: string): void {\n  try {\n    unlinkSync(path)\n  } catch (error) {\n    if (!isMissing(error)) throw error\n  }\n}\n","/**\n * Canonical bytes and digests for durable journal rows.\n *\n * Serialization is RFC 8785 through `@tangle-network/agent-interface` — the\n * stack's single identity scheme — so a value carries the same digest in every\n * package that produces or verifies one.\n *\n * Values canonical JSON cannot represent faithfully are refused, never coerced.\n * `NaN`, `Infinity`, `undefined`, class instances, cycles, and unpaired\n * surrogates each have a lossy encoding that maps distinct records onto one\n * digest, and in a hash chain the digest IS the record's identity: a coercion\n * there is a collision, not a convenience.\n */\n\nimport {\n  canonicalCandidateBytes,\n  canonicalCandidateJson,\n  sha256Bytes,\n} from '@tangle-network/agent-interface'\nimport { ValidationError } from '../errors'\n\nexport type LedgerHash = `sha256:${string}`\n\n/** Shape of every ledger digest: `sha256:` followed by 64 lowercase hex chars. */\nexport const LEDGER_HASH_PATTERN = /^sha256:[a-f0-9]{64}$/\n\n/** A value has no faithful canonical-JSON form, so it cannot be stored or hashed. */\nexport class LedgerCanonicalizationError extends ValidationError {}\n\n/** Canonical JSON encoding (RFC 8785): object keys sorted by UTF-16 code unit,\n * recursively. This is the byte form that is hashed and stored, so equal values\n * always encode identically. */\nexport function canonicalString(value: unknown): string {\n  try {\n    return canonicalCandidateJson(value)\n  } catch (error) {\n    throw canonicalizationError(value, error)\n  }\n}\n\nexport function hashCanonical(value: unknown): LedgerHash {\n  try {\n    return sha256Bytes(canonicalCandidateBytes(value))\n  } catch (error) {\n    throw canonicalizationError(value, error)\n  }\n}\n\n/** Name the offending value and path so a refusal is actionable. The RFC 8785\n * encoder above is the sole authority on acceptance; this walk only explains a\n * rejection it already made. */\nfunction canonicalizationError(value: unknown, cause: unknown): LedgerCanonicalizationError {\n  const defect = firstNonCanonicalDefect(value, '$', new Set())\n  const reason = defect !== '' ? defect : cause instanceof Error ? cause.message : String(cause)\n  return new LedgerCanonicalizationError(`value has no canonical JSON form: ${reason}`, {\n    cause,\n  })\n}\n\nfunction firstNonCanonicalDefect(value: unknown, path: string, ancestors: Set<object>): string {\n  if (value === null) return ''\n  if (value === undefined) return `${path} is undefined`\n  const type = typeof value\n  if (type === 'number') {\n    return Number.isFinite(value) ? '' : `${path} is ${String(value)}`\n  }\n  if (type === 'string') {\n    return isWellFormedUtf16(value as string) ? '' : `${path} contains an unpaired surrogate`\n  }\n  if (type === 'boolean') return ''\n  if (type !== 'object') return `${path} is a ${type}`\n  const object = value as object\n  if (ancestors.has(object)) return `${path} closes a reference cycle`\n  const prototype = Object.getPrototypeOf(object)\n  if (!Array.isArray(object) && prototype !== Object.prototype && prototype !== null) {\n    return `${path} is a ${object.constructor?.name ?? 'non-plain'} instance, not plain JSON data`\n  }\n  const nested = new Set(ancestors).add(object)\n  if (Array.isArray(object)) {\n    for (let index = 0; index < object.length; index += 1) {\n      const defect = firstNonCanonicalDefect(object[index], `${path}[${index}]`, nested)\n      if (defect !== '') return defect\n    }\n    return ''\n  }\n  for (const [key, entry] of Object.entries(object)) {\n    if (!isWellFormedUtf16(key)) return `${path}.${key} has a key with an unpaired surrogate`\n    const defect = firstNonCanonicalDefect(entry, `${path}.${key}`, nested)\n    if (defect !== '') return defect\n  }\n  return ''\n}\n\nfunction isWellFormedUtf16(value: string): boolean {\n  for (let index = 0; index < value.length; index += 1) {\n    const code = value.charCodeAt(index)\n    if (code >= 0xd800 && code <= 0xdbff) {\n      const next = value.charCodeAt(index + 1)\n      if (!(next >= 0xdc00 && next <= 0xdfff)) return false\n      index += 1\n    } else if (code >= 0xdc00 && code <= 0xdfff) {\n      return false\n    }\n  }\n  return true\n}\n","/** Filesystem durability and cross-process exclusion for append-only journal files. */\n\nimport {\n  closeSync,\n  constants,\n  fsyncSync,\n  mkdirSync,\n  openSync,\n  renameSync,\n  writeSync,\n} from 'node:fs'\nimport { dirname } from 'node:path'\nimport { AtomicFileLockError, tryAcquireAtomicFileLock } from './atomic-file-lock'\n\n/** How a journal binding reports file-layer faults in its own error taxonomy. */\nexport interface LedgerFileContext {\n  /** Noun used in error messages, e.g. 'search ledger'. */\n  subject: string\n  integrityError(message: string, options?: { cause?: unknown }): Error\n}\n\n/** Append one already-serialized line; the write is fsynced (file and directory)\n * before returning so an acknowledged append survives a crash. */\nexport function appendLedgerLine(path: string, line: string, context: LedgerFileContext): void {\n  mkdirSync(dirname(path), { recursive: true })\n  const fd = openSync(path, constants.O_CREAT | constants.O_WRONLY | constants.O_APPEND, 0o600)\n  try {\n    writeAll(fd, Buffer.from(line, 'utf8'), context)\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n  fsyncDirectory(dirname(path))\n}\n\n/** Replace a small sidecar file whole: write a temporary sibling, fsync it,\n * then rename over the target. A reader therefore sees the previous contents\n * or the new ones, never a partial file. */\nexport function writeLedgerFileAtomically(\n  path: string,\n  contents: string,\n  context: LedgerFileContext,\n): void {\n  const directory = dirname(path)\n  mkdirSync(directory, { recursive: true })\n  const temporaryPath = `${path}.tmp`\n  const fd = openSync(\n    temporaryPath,\n    constants.O_CREAT | constants.O_WRONLY | constants.O_TRUNC,\n    0o600,\n  )\n  try {\n    writeAll(fd, Buffer.from(contents, 'utf8'), context)\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n  renameSync(temporaryPath, path)\n  fsyncDirectory(directory)\n}\n\nexport function withLedgerFileLock<T>(path: string, context: LedgerFileContext, run: () => T): T {\n  const result = tryWithLedgerFileLock(path, context, run)\n  if (!result.acquired) {\n    throw context.integrityError(`${context.subject} lock is held (${path})`)\n  }\n  return result.value\n}\n\nexport type FileLockResult<T> = { acquired: true; value: T } | { acquired: false }\n\nexport function tryWithLedgerFileLock<T>(\n  path: string,\n  context: LedgerFileContext,\n  run: () => T,\n): FileLockResult<T> {\n  mkdirSync(dirname(path), { recursive: true })\n  const lockPath = `${path}.lock`\n  try {\n    const acquisition = tryAcquireAtomicFileLock({ lockPath })\n    if (!acquisition.acquired) return { acquired: false }\n    try {\n      return { acquired: true, value: run() }\n    } finally {\n      acquisition.lock.release()\n    }\n  } catch (error) {\n    if (error instanceof AtomicFileLockError) {\n      throw context.integrityError(error.message, { cause: error })\n    }\n    throw error\n  }\n}\n\nfunction writeAll(fd: number, bytes: Buffer, context: LedgerFileContext): void {\n  let offset = 0\n  while (offset < bytes.byteLength) {\n    const written = writeSync(fd, bytes, offset, bytes.byteLength - offset)\n    if (written <= 0) throw context.integrityError('filesystem wrote zero bytes')\n    offset += written\n  }\n}\n\nfunction fsyncDirectory(path: string): void {\n  const fd = openSync(path, constants.O_RDONLY)\n  try {\n    fsyncSync(fd)\n  } finally {\n    closeSync(fd)\n  }\n}\n","/**\n * Trusted head — the pin that makes deletion detectable.\n *\n * ## What the chain binds\n *\n * Every entry hashes the journal header, its sequence, the previous entry's\n * hash, and its event, so editing, reordering, or removing an entry in the\n * middle of a journal invalidates every hash after it. What a hash chain\n * cannot bind is its own length. Dropping entries off the END leaves a shorter\n * journal that is internally perfect, and rebuilding a journal from sequence 0\n * with recomputed hashes produces a different, equally perfect chain. For an\n * audit log of candidate registrations and promotion decisions that is the\n * difference between a record of a search that happened and a record of one\n * that did not.\n *\n * ## What the pin binds\n *\n * `<journal>.head` holds `{sequence, entryHash}` for one entry a writer\n * actually appended, in a file separate from the journal it attests. Each\n * entry hash commits to the entire prefix before it, so checking that the\n * entry at exactly `sequence` still carries `entryHash` proves two things at\n * once: the journal is at least `sequence + 1` entries long, and those entries\n * are byte-for-byte the ones the writer saw. A journal that merely grew past\n * the pin still verifies; a truncated, rolled-back, or wholesale-rewritten one\n * cannot.\n *\n * ## What the pin does NOT defend against\n *\n * The pin is a second file, not a signature. A writer with access to BOTH the\n * journal and its pin can rewrite both consistently, and the result verifies.\n * Pinning raises the cost of undetected tampering from one file to two and\n * nothing more; defending against a writer who holds both requires an anchor\n * outside this store entirely — a signed head, or a digest published to an\n * append-only service the tamperer does not control.\n *\n * Deleting the pin file downgrades a pinned journal to an unpinned one, which\n * cannot be distinguished from a journal written before pinning existed. That\n * is what `requireTrustedHead` is for: a journal opened under it refuses to\n * read at all once a non-empty journal has no pin.\n */\n\nimport { existsSync, readFileSync } from 'node:fs'\nimport { canonicalString, LEDGER_HASH_PATTERN, type LedgerHash } from './canonical'\nimport { type LedgerFileContext, writeLedgerFileAtomically } from './journal-file'\n\n/** A `(sequence, entryHash)` pair a writer pinned outside the journal. */\nexport interface LedgerTrustedHead {\n  sequence: number\n  entryHash: LedgerHash\n}\n\n/** Minimum entry shape the anchor check needs. */\nexport interface LedgerAnchoredEntry {\n  sequence: number\n  entryHash: LedgerHash\n}\n\n/** Sibling pin file for a journal — deliberately NOT the journal, so rewriting\n * the log is not enough to rewrite the trust recorded about it. */\nexport function trustedHeadPathFor(journalPath: string): string {\n  return `${journalPath}.head`\n}\n\n/** The pin, or null when this journal has never been pinned. A pin that exists\n * but does not parse is corruption or tamper of the trust record itself and\n * fails loudly: reporting it as \"no pin\" would silently downgrade what the\n * journal can prove. */\nexport function readTrustedHeadFile(\n  path: string,\n  context: LedgerFileContext,\n): LedgerTrustedHead | null {\n  if (!existsSync(path)) return null\n  const text = readFileSync(path, 'utf8')\n  let raw: unknown\n  try {\n    raw = JSON.parse(text)\n  } catch (error) {\n    throw context.integrityError(`${context.subject} trusted head ${path} is not valid JSON`, {\n      cause: error,\n    })\n  }\n  if (typeof raw !== 'object' || raw === null || Array.isArray(raw)) {\n    throw context.integrityError(`${context.subject} trusted head ${path} is not an object`)\n  }\n  const record = raw as Record<string, unknown>\n  const keys = Object.keys(record).sort()\n  if (keys.length !== 2 || keys[0] !== 'entryHash' || keys[1] !== 'sequence') {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} has keys [${keys.join(', ')}], expected [entryHash, sequence]`,\n    )\n  }\n  const { sequence, entryHash } = record\n  if (typeof sequence !== 'number' || !Number.isSafeInteger(sequence) || sequence < 0) {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} sequence is not a non-negative integer`,\n    )\n  }\n  if (typeof entryHash !== 'string' || !LEDGER_HASH_PATTERN.test(entryHash)) {\n    throw context.integrityError(\n      `${context.subject} trusted head ${path} entryHash is not a sha256 digest`,\n    )\n  }\n  return { sequence, entryHash: entryHash as LedgerHash }\n}\n\n/** Publish a pin by write-then-rename, so a crash leaves either the previous\n * pin or the new one and never a torn file that would lock a journal out of\n * its own trust record. */\nexport function writeTrustedHeadFile(\n  path: string,\n  head: LedgerTrustedHead,\n  context: LedgerFileContext,\n): void {\n  writeLedgerFileAtomically(path, `${canonicalString(head)}\\n`, context)\n}\n\n/** The entry at exactly `head.sequence` must still carry `head.entryHash`.\n * Entries must already have passed chain verification, which is what makes\n * index and sequence interchangeable here. */\nexport function verifyEntriesAgainstTrustedHead(\n  entries: readonly LedgerAnchoredEntry[],\n  head: LedgerTrustedHead,\n  context: LedgerFileContext,\n  subject: string,\n): void {\n  const pinned = entries[head.sequence]\n  if (pinned === undefined) {\n    throw context.integrityError(\n      `${subject} trusted head pins sequence ${head.sequence} (${head.entryHash}) but the journal has ${entries.length} entries — pinned history is missing (truncation, rollback, or rewrite)`,\n    )\n  }\n  if (pinned.sequence !== head.sequence) {\n    throw context.integrityError(\n      `${subject} entry at index ${head.sequence} carries sequence ${pinned.sequence}; the chain was not verified before the trusted head`,\n    )\n  }\n  if (pinned.entryHash !== head.entryHash) {\n    throw context.integrityError(\n      `${subject} entry at pinned sequence ${head.sequence} carries ${pinned.entryHash} but the trusted head recorded ${head.entryHash} — the journal was rewritten`,\n    )\n  }\n}\n","/**\n * Generic durable append-only journal with a SHA-256 hash chain.\n *\n * The file format is canonical JSONL: every row is the canonical JSON encoding\n * (RFC 8785, object keys sorted recursively) of one entry, and every entry\n * hashes the previous entry's hash so the log is tamper-evident. Appends are\n * serialized in-process per path and across processes via a lock file, fsynced\n * before acknowledgement, and idempotent by `eventId`. A malformed,\n * non-canonical, truncated, reordered, or conflicting log fails loudly; a bad\n * row is never skipped.\n *\n * A hash chain binds each entry to its predecessor, which cannot prove that no\n * entry was removed from the end: a valid shorter prefix is still a valid\n * chain. `pinHead` records the appended entry in a sibling `<journal>.head`\n * file and every read re-verifies the journal against a pin that is present,\n * so truncation and wholesale rewrite are refused. `trusted-head.ts` carries\n * the full threat model, including what a pin does not defend against.\n *\n * Domain vocabulary lives entirely in the consumer's codec: entry schema\n * validation, the constant header fields stamped into every entry, the error\n * taxonomy, and the state machine replayed over verified entries.\n */\n\nimport { existsSync, readFileSync } from 'node:fs'\nimport { resolve } from 'node:path'\nimport { Mutex } from '../concurrency'\nimport { canonicalString, hashCanonical, type LedgerHash } from './canonical'\nimport { appendLedgerLine, type LedgerFileContext, withLedgerFileLock } from './journal-file'\nimport {\n  type LedgerTrustedHead,\n  readTrustedHeadFile,\n  trustedHeadPathFor,\n  verifyEntriesAgainstTrustedHead,\n  writeTrustedHeadFile,\n} from './trusted-head'\n\n/** Minimum shape of a journal event: the idempotency key. */\nexport interface LedgerEventBase {\n  eventId: string\n}\n\n/** Chain envelope every entry carries in addition to the journal's constant\n * header fields. `entryHash` covers the header, sequence, previous hash, and\n * event, so any rewrite of history invalidates every later entry. */\nexport interface LedgerChainFields<Event extends LedgerEventBase> {\n  sequence: number\n  previousHash: LedgerHash | null\n  event: Event\n  entryHash: LedgerHash\n}\n\nexport type LedgerEntryOf<Header extends object, Event extends LedgerEventBase> = Header &\n  LedgerChainFields<Event>\n\nexport interface LedgerLineContext {\n  path: string\n  line: number\n}\n\n/** Domain state machine replayed over chain-verified entries in order.\n * `apply` throws (via the codec's error taxonomy) on an invalid transition;\n * `finish` builds the consumer's projection once every entry was applied. */\nexport interface LedgerProjector<Entry, Projection> {\n  apply(entry: Entry, index: number): void\n  finish(entries: Entry[]): Projection\n}\n\nexport interface LedgerJournalCodec<\n  Header extends object,\n  Event extends LedgerEventBase,\n  Projection,\n> extends LedgerFileContext {\n  /** Constant fields stamped into every entry and covered by its hash. */\n  header: Header\n  conflictError(message: string): Error\n  /** Validate one parsed JSON row into a typed entry. Must reject malformed\n   * rows and non-canonical event encodings with the binding's own errors;\n   * the journal itself verifies the stored bytes and the hash chain. */\n  parseEntry(raw: unknown, context: LedgerLineContext): LedgerEntryOf<Header, Event>\n  /** Reject an entry whose constant header fields do not match this journal. */\n  checkEntryHeader(entry: LedgerEntryOf<Header, Event>, index: number): void\n  createProjector(): LedgerProjector<LedgerEntryOf<Header, Event>, Projection>\n}\n\nexport interface LedgerReplayResult<Entry, Projection> {\n  entries: Entry[]\n  projection: Projection\n}\n\nexport interface LedgerAppendResult<Entry, Projection> {\n  entry: Entry\n  /** False when the exact event was already durably present. */\n  appended: boolean\n  projection: Projection\n}\n\nexport interface LedgerAppendOptions {\n  /** Record the appended entry as this journal's trusted head, so a later read\n   * can prove nothing was deleted from the end. Ignored on the idempotent\n   * path: acknowledging an event that was already durable writes nothing, and\n   * moving the pin there would jump trust forward past entries this caller\n   * never saw. */\n  pinHead?: boolean\n}\n\nexport interface FileLedgerJournalOptions {\n  /** Refuse to read a non-empty journal that has no trusted head.\n   *\n   * Off by default because journals written before pinning have no pin and\n   * must keep opening. Turn it on for a journal this process pins: without it,\n   * deleting the sibling pin file silently downgrades the journal back to a\n   * chain that cannot detect deletion. */\n  requireTrustedHead?: boolean\n}\n\n// One async mutex per resolved journal path so concurrent appends from a single\n// process queue up instead of failing on the held cross-process lock file.\nconst journalMutexes = new Map<string, Mutex>()\n\nfunction mutexFor(path: string): Mutex {\n  const existing = journalMutexes.get(path)\n  if (existing) return existing\n  const mutex = new Mutex()\n  journalMutexes.set(path, mutex)\n  return mutex\n}\n\n/** Durable filesystem journal. Construction performs no I/O; `append` and\n * `replay` validate the complete existing file under the locks. */\nexport class FileLedgerJournal<Header extends object, Event extends LedgerEventBase, Projection> {\n  readonly path: string\n  /** Sibling file holding this journal's trusted head. */\n  readonly trustedHeadPath: string\n  private readonly codec: LedgerJournalCodec<Header, Event, Projection>\n  private readonly mutex: Mutex\n  private readonly requireTrustedHead: boolean\n\n  constructor(\n    path: string,\n    codec: LedgerJournalCodec<Header, Event, Projection>,\n    options: FileLedgerJournalOptions = {},\n  ) {\n    this.path = resolve(path)\n    this.trustedHeadPath = trustedHeadPathFor(this.path)\n    this.codec = codec\n    this.mutex = mutexFor(this.path)\n    this.requireTrustedHead = options.requireTrustedHead === true\n  }\n\n  async replay(): Promise<LedgerReplayResult<LedgerEntryOf<Header, Event>, Projection>> {\n    return this.mutex.runExclusive(() =>\n      withLedgerFileLock(this.path, this.codec, () => this.replayLocked()),\n    )\n  }\n\n  async append(\n    event: Event,\n    options: LedgerAppendOptions = {},\n  ): Promise<LedgerAppendResult<LedgerEntryOf<Header, Event>, Projection>> {\n    return this.mutex.runExclusive(() =>\n      withLedgerFileLock(this.path, this.codec, () => {\n        const before = this.replayLocked()\n        const existing = before.entries.find((entry) => entry.event.eventId === event.eventId)\n        if (existing) {\n          if (canonicalString(existing.event) !== canonicalString(event)) {\n            throw this.codec.conflictError(\n              `eventId ${event.eventId} already exists with different content`,\n            )\n          }\n          return { entry: existing, appended: false, projection: before.projection }\n        }\n\n        const material = {\n          ...this.codec.header,\n          sequence: before.entries.length,\n          previousHash: before.entries.at(-1)?.entryHash ?? null,\n          event,\n        }\n        const entry = { ...material, entryHash: hashCanonical(material) }\n\n        // Apply the state transition before spending an append: an entry the\n        // projector rejects must never reach the durable file.\n        const projection = this.project([...before.entries, entry])\n        appendLedgerLine(this.path, `${canonicalString(entry)}\\n`, this.codec)\n        if (options.pinHead === true) {\n          // Journal first, pin second: a crash between them leaves the pin one\n          // entry behind, which still verifies and is healed by the next\n          // pinning append. The reverse order would leave a pin naming an\n          // entry the journal does not carry, locking the journal out.\n          writeTrustedHeadFile(\n            this.trustedHeadPath,\n            { sequence: entry.sequence, entryHash: entry.entryHash },\n            this.codec,\n          )\n        }\n        return { entry, appended: true, projection }\n      }),\n    )\n  }\n\n  /** The pinned head, or null when this journal has never been pinned. */\n  async trustedHead(): Promise<LedgerTrustedHead | null> {\n    return this.mutex.runExclusive(() =>\n      withLedgerFileLock(this.path, this.codec, () =>\n        readTrustedHeadFile(this.trustedHeadPath, this.codec),\n      ),\n    )\n  }\n\n  /** Pin the current verified head. The chain and any existing pin are checked\n   * first, so the pin only ever moves forward along a journal that still\n   * carries the history it already recorded. */\n  async pinTrustedHead(): Promise<LedgerTrustedHead> {\n    return this.mutex.runExclusive(() =>\n      withLedgerFileLock(this.path, this.codec, () => {\n        const entries = this.readEntries()\n        this.project(entries)\n        // `requireTrustedHead` is deliberately not applied here: pinning is how\n        // a journal that lacks a pin acquires one.\n        this.verifyTrustedHead(entries, false)\n        const last = entries.at(-1)\n        if (last === undefined) {\n          throw this.codec.integrityError(\n            `${this.codec.subject} ${this.path} is empty; there is no head to pin`,\n          )\n        }\n        const head: LedgerTrustedHead = { sequence: last.sequence, entryHash: last.entryHash }\n        writeTrustedHeadFile(this.trustedHeadPath, head, this.codec)\n        return head\n      }),\n    )\n  }\n\n  private replayLocked(): LedgerReplayResult<LedgerEntryOf<Header, Event>, Projection> {\n    const entries = this.readEntries()\n    const projection = this.project(entries)\n    // The anchor is meaningful only over a chain that already verified, so it\n    // is checked last — and on every read path, so a violated pin is refused\n    // before an append can extend the journal over it.\n    this.verifyTrustedHead(entries, this.requireTrustedHead)\n    return { entries, projection }\n  }\n\n  private verifyTrustedHead(entries: LedgerEntryOf<Header, Event>[], requirePin: boolean): void {\n    const pinned = readTrustedHeadFile(this.trustedHeadPath, this.codec)\n    if (pinned === null) {\n      if (requirePin && entries.length > 0) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has ${entries.length} entries but no trusted head at ${this.trustedHeadPath} — without its pin the journal cannot prove nothing was deleted`,\n        )\n      }\n      return\n    }\n    verifyEntriesAgainstTrustedHead(\n      entries,\n      pinned,\n      this.codec,\n      `${this.codec.subject} ${this.path}`,\n    )\n  }\n\n  private readEntries(): LedgerEntryOf<Header, Event>[] {\n    if (!existsSync(this.path)) return []\n    const text = readFileSync(this.path, 'utf8')\n    if (text.length === 0) return []\n    if (!text.endsWith('\\n')) {\n      throw this.codec.integrityError(\n        `${this.codec.subject} ${this.path} has a truncated final record (missing newline)`,\n      )\n    }\n\n    const lines = text.slice(0, -1).split('\\n')\n    const entries: LedgerEntryOf<Header, Event>[] = []\n    for (let index = 0; index < lines.length; index += 1) {\n      const line = lines[index]!\n      if (line.length === 0) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has a blank row at line ${index + 1}`,\n        )\n      }\n      let raw: unknown\n      try {\n        raw = JSON.parse(line)\n      } catch (error) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has invalid JSON at line ${index + 1}`,\n          { cause: error },\n        )\n      }\n      const entry = this.codec.parseEntry(raw, { path: this.path, line: index + 1 })\n      let canonical: string\n      try {\n        canonical = canonicalString(entry)\n      } catch (error) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has a row with no canonical JSON form at line ${index + 1}`,\n          { cause: error },\n        )\n      }\n      if (line !== canonical) {\n        throw this.codec.integrityError(\n          `${this.codec.subject} ${this.path} has non-canonical bytes at line ${index + 1}`,\n        )\n      }\n      entries.push(entry)\n    }\n    return entries\n  }\n\n  private project(entries: LedgerEntryOf<Header, Event>[]): Projection {\n    const projector = this.codec.createProjector()\n    const eventIds = new Set<string>()\n    let expectedPrevious: LedgerHash | null = null\n    for (let index = 0; index < entries.length; index += 1) {\n      const entry = entries[index]!\n      this.codec.checkEntryHeader(entry, index)\n      if (entry.sequence !== index) {\n        throw this.codec.integrityError(\n          `entry ${entry.event.eventId} has sequence ${entry.sequence}, expected ${index}`,\n        )\n      }\n      if (entry.previousHash !== expectedPrevious) {\n        throw this.codec.integrityError(\n          `entry ${entry.event.eventId} does not extend the previous hash`,\n        )\n      }\n      const { entryHash: _entryHash, ...material } = entry\n      const expectedHash = hashCanonical(material)\n      if (entry.entryHash !== expectedHash) {\n        throw this.codec.integrityError(\n          `entry ${entry.event.eventId} hash mismatch: expected ${expectedHash}, got ${entry.entryHash}`,\n        )\n      }\n      expectedPrevious = entry.entryHash\n      if (eventIds.has(entry.event.eventId)) {\n        throw this.codec.integrityError(\n          `duplicate eventId ${entry.event.eventId} in durable ledger`,\n        )\n      }\n      eventIds.add(entry.event.eventId)\n      projector.apply(entry, index)\n    }\n    return projector.finish(entries)\n  }\n}\n"],"mappings":";;;;;;;;;AAyCA,IAAa,sBAAb,cAAyC,MAAM;CAC7C,OAAyB;AAC3B;;AAQA,SAAgB,oBACd,SACkC;CAClC,IAAI,WAAW,aAAa,QAAQ,QAAQ,CAAC,GAAG,OAAO;EAAE,UAAU;EAAO,QAAQ;CAAW;CAC7F,MAAM,QAAQ,WAAW,QAAQ,QAAQ;CACzC,IAAI,MAAM,UAAU,QAClB,OAAO;EAAE,UAAU;EAAO,QAAQ;EAAQ,QAAQ,MAAM;CAAM;CAEhE,OAAO;AACT;;;;;;;AAQA,SAAgB,yBACd,SAC2B;CAC3B,MAAM,MAAM,QAAQ,OAAO,QAAQ;CACnC,IAAI,CAAC,OAAO,cAAc,GAAG,KAAK,OAAO,GACvC,MAAM,IAAI,oBAAoB,iDAAiD;CAEjF,MAAM,QAA6B;EAAE;EAAK,MAAM,SAAS;EAAG,OAAO,WAAW;CAAE;CAChF,KAAK,IAAI,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG;EAC/C,IAAI,WAAW,aAAa,QAAQ,QAAQ,CAAC,GAC3C,OAAO;GAAE,UAAU;GAAO,QAAQ;EAAW;EAE/C,IAAI,aAAa,QAAQ,UAAU,OAAO,WAAW,SAAS,GAC5D,OAAO,SAAS,QAAQ,UAAU,KAAK;EAGzC,MAAM,SAAS,WAAW,QAAQ,QAAQ;EAC1C,IAAI,OAAO,UAAU,WAAW;EAChC,IAAI,OAAO,UAAU,QACnB,OAAO;GAAE,UAAU;GAAO,QAAQ;GAAQ,QAAQ,OAAO;EAAM;EAGjE,MAAM,cAAc,aAAa,QAAQ,QAAQ;EACjD,IAAI,CAAC,aAAa,aAAa,OAAO,WAAW,SAAS,GACxD,OAAO;GAAE,UAAU;GAAO,QAAQ;EAAW;EAE/C,IAAI;GACF,MAAM,UAAU,WAAW,QAAQ,QAAQ;GAC3C,IAAI,QAAQ,UAAU,QACpB,OAAO;IAAE,UAAU;IAAO,QAAQ;IAAQ,QAAQ,QAAQ;GAAM;GAElE,IAAI,QAAQ,UAAU,SAAS;IAC7B,MAAM,YAAY,GAAG,QAAQ,SAAS,SAAS,MAAM,MAAM,GAAG;IAC9D,IAAI;KACF,WAAW,QAAQ,UAAU,SAAS;KACtC,WAAW,SAAS;IACtB,SAAS,OAAO;KACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;IAC/B;GACF;GACA,IAAI,aAAa,QAAQ,UAAU,OAAO,aAAa,SAAS,GAC9D,OAAO,SAAS,QAAQ,UAAU,KAAK;EAE3C,UAAU;GACR,iBAAiB,aAAa,KAAK;EACrC;CACF;CAEA,MAAM,IAAI,oBAAoB,sCAAsC,QAAQ,UAAU;AACxF;AAEA,SAAS,SAAS,UAAkB,OAAuD;CACzF,OAAO;EACL,UAAU;EACV,MAAM;GACJ;GACA,eAAe,iBAAiB,UAAU,KAAK;EACjD;CACF;AACF;AAEA,SAAS,aAAa,UAAkB,OAA4B,QAAyB;CAC3F,MAAM,YAAY,GAAG,SAAS,GAAG,MAAM,IAAI,GAAG,MAAM,MAAM,GAAG,OAAO;CACpE,MAAM,aAAa,SACjB,WACA,UAAU,UAAU,UAAU,SAAS,UAAU,UACjD,GACF;CACA,IAAI;EACF,cAAc,YAAY,GAAG,eAAe,KAAK,EAAE,KAAK,MAAM;EAC9D,UAAU,UAAU;CACtB,SAAS,OAAO;EACd,UAAU,UAAU;EACpB,eAAe,SAAS;EACxB,MAAM;CACR;CACA,UAAU,UAAU;CAEpB,IAAI;EACF,SAAS,WAAW,QAAQ;EAC5B,OAAO;CACT,SAAS,OAAO;EACd,IAAI,CAAC,gBAAgB,KAAK,GAAG,MAAM;EACnC,OAAO;CACT,UAAU;EACR,eAAe,SAAS;CAC1B;AACF;AAEA,SAAS,WAAW,UAA8B;CAChD,MAAM,QAAQ,UAAU,QAAQ;CAChC,IAAI,CAAC,OAAO,OAAO,EAAE,OAAO,UAAU;CACtC,IAAI,MAAM,SAAS,SAAS,GAAG,OAAO;EAAE,OAAO;EAAQ;CAAM;CAC7D,IAAI;EACF,QAAQ,KAAK,MAAM,KAAK,CAAC;EACzB,OAAO;GAAE,OAAO;GAAQ;EAAM;CAChC,SAAS,OAAO;EACd,IAAI,gBAAgB,KAAK,GAAG,OAAO;GAAE,OAAO;GAAS;EAAM;EAC3D,OAAO;GAAE,OAAO;GAAQ;EAAM;CAChC;AACF;AAEA,SAAS,UAAU,UAAmD;CACpE,IAAI;CACJ,IAAI;EACF,WAAW,aAAa,UAAU,MAAM,CAAC,CAAC,KAAK;CACjD,SAAS,OAAO;EACd,IAAI,UAAU,KAAK,GAAG,OAAO,KAAA;EAC7B,MAAM;CACR;CAEA,IAAI;CACJ,IAAI;EACF,QAAQ,KAAK,MAAM,QAAQ;CAC7B,SAAS,OAAO;EACd,MAAM,aAAa,UAAU,KAAK;CACpC;CACA,IAAI,CAAC,QAAQ,KAAK,GAAG,MAAM,aAAa,QAAQ;CAChD,OAAO;AACT;AAEA,SAAS,QAAQ,OAA8C;CAC7D,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG,OAAO;CAChF,MAAM,SAAS;CACf,OACE,OAAO,KAAK,MAAM,CAAC,CAAC,WAAW,KAC/B,OAAO,cAAc,OAAO,GAAG,KAC/B,OAAO,OAAO,GAAG,IAAI,KACrB,OAAO,OAAO,SAAS,YACvB,OAAO,KAAK,KAAK,CAAC,CAAC,SAAS,KAC5B,OAAO,OAAO,UAAU,YACxB,OAAO,MAAM,KAAK,CAAC,CAAC,SAAS;AAEjC;AAEA,SAAS,aAAa,UAAkB,OAAsC;CAC5E,MAAM,QAAQ,IAAI,oBAChB,0CAA0C,SAAS,4BACrD;CACA,IAAI,UAAU,KAAA,GAAW,OAAO,eAAe,OAAO,SAAS,EAAE,OAAO,MAAM,CAAC;CAC/E,OAAO;AACT;AAEA,SAAS,iBAAiB,UAAkB,OAAkC;CAC5E,MAAM,UAAU,UAAU,QAAQ;CAClC,IAAI,CAAC,SAAS;CACd,IAAI,eAAe,OAAO,MAAM,eAAe,KAAK,GAClD,MAAM,IAAI,oBAAoB,kDAAkD,SAAS,EAAE;CAE7F,IAAI;EACF,WAAW,QAAQ;CACrB,SAAS,OAAO;EACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;CAC/B;AACF;AAEA,SAAS,eAAe,OAAoC;CAC1D,OAAO,KAAK,UAAU;EAAE,MAAM,MAAM;EAAM,OAAO,MAAM;EAAO,KAAK,MAAM;CAAI,CAAC;AAChF;AAEA,SAAS,aAAa,UAA0B;CAC9C,OAAO,GAAG,SAAS;AACrB;AAEA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,UAAU,OAAyB;CAC1C,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,iBAAiB,SAAS,UAAU,SAAS,MAAM,SAAS;AACrE;AAEA,SAAS,eAAe,MAAoB;CAC1C,IAAI;EACF,WAAW,IAAI;CACjB,SAAS,OAAO;EACd,IAAI,CAAC,UAAU,KAAK,GAAG,MAAM;CAC/B;AACF;;;;;;;;;;;;;;;;;AClOA,MAAa,sBAAsB;;AAGnC,IAAa,8BAAb,cAAiD,gBAAgB,CAAC;;;;AAKlE,SAAgB,gBAAgB,OAAwB;CACtD,IAAI;EACF,OAAO,uBAAuB,KAAK;CACrC,SAAS,OAAO;EACd,MAAM,sBAAsB,OAAO,KAAK;CAC1C;AACF;AAEA,SAAgB,cAAc,OAA4B;CACxD,IAAI;EACF,OAAO,YAAY,wBAAwB,KAAK,CAAC;CACnD,SAAS,OAAO;EACd,MAAM,sBAAsB,OAAO,KAAK;CAC1C;AACF;;;;AAKA,SAAS,sBAAsB,OAAgB,OAA6C;CAC1F,MAAM,SAAS,wBAAwB,OAAO,qBAAK,IAAI,IAAI,CAAC;CAE5D,OAAO,IAAI,4BAA4B,qCADxB,WAAW,KAAK,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,KACP,EACpF,MACF,CAAC;AACH;AAEA,SAAS,wBAAwB,OAAgB,MAAc,WAAgC;CAC7F,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,UAAU,KAAA,GAAW,OAAO,GAAG,KAAK;CACxC,MAAM,OAAO,OAAO;CACpB,IAAI,SAAS,UACX,OAAO,OAAO,SAAS,KAAK,IAAI,KAAK,GAAG,KAAK,MAAM,OAAO,KAAK;CAEjE,IAAI,SAAS,UACX,OAAO,kBAAkB,KAAe,IAAI,KAAK,GAAG,KAAK;CAE3D,IAAI,SAAS,WAAW,OAAO;CAC/B,IAAI,SAAS,UAAU,OAAO,GAAG,KAAK,QAAQ;CAC9C,MAAM,SAAS;CACf,IAAI,UAAU,IAAI,MAAM,GAAG,OAAO,GAAG,KAAK;CAC1C,MAAM,YAAY,OAAO,eAAe,MAAM;CAC9C,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,cAAc,OAAO,aAAa,cAAc,MAC5E,OAAO,GAAG,KAAK,QAAQ,OAAO,aAAa,QAAQ,YAAY;CAEjE,MAAM,SAAS,IAAI,IAAI,SAAS,CAAC,CAAC,IAAI,MAAM;CAC5C,IAAI,MAAM,QAAQ,MAAM,GAAG;EACzB,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;GACrD,MAAM,SAAS,wBAAwB,OAAO,QAAQ,GAAG,KAAK,GAAG,MAAM,IAAI,MAAM;GACjF,IAAI,WAAW,IAAI,OAAO;EAC5B;EACA,OAAO;CACT;CACA,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,MAAM,GAAG;EACjD,IAAI,CAAC,kBAAkB,GAAG,GAAG,OAAO,GAAG,KAAK,GAAG,IAAI;EACnD,MAAM,SAAS,wBAAwB,OAAO,GAAG,KAAK,GAAG,OAAO,MAAM;EACtE,IAAI,WAAW,IAAI,OAAO;CAC5B;CACA,OAAO;AACT;AAEA,SAAS,kBAAkB,OAAwB;CACjD,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;EACpD,MAAM,OAAO,MAAM,WAAW,KAAK;EACnC,IAAI,QAAQ,SAAU,QAAQ,OAAQ;GACpC,MAAM,OAAO,MAAM,WAAW,QAAQ,CAAC;GACvC,IAAI,EAAE,QAAQ,SAAU,QAAQ,QAAS,OAAO;GAChD,SAAS;EACX,OAAO,IAAI,QAAQ,SAAU,QAAQ,OACnC,OAAO;CAEX;CACA,OAAO;AACT;;;;;;AClFA,SAAgB,iBAAiB,MAAc,MAAc,SAAkC;CAC7F,UAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC5C,MAAM,KAAK,SAAS,MAAM,UAAU,UAAU,UAAU,WAAW,UAAU,UAAU,GAAK;CAC5F,IAAI;EACF,SAAS,IAAI,OAAO,KAAK,MAAM,MAAM,GAAG,OAAO;EAC/C,UAAU,EAAE;CACd,UAAU;EACR,UAAU,EAAE;CACd;CACA,eAAe,QAAQ,IAAI,CAAC;AAC9B;;;;AAKA,SAAgB,0BACd,MACA,UACA,SACM;CACN,MAAM,YAAY,QAAQ,IAAI;CAC9B,UAAU,WAAW,EAAE,WAAW,KAAK,CAAC;CACxC,MAAM,gBAAgB,GAAG,KAAK;CAC9B,MAAM,KAAK,SACT,eACA,UAAU,UAAU,UAAU,WAAW,UAAU,SACnD,GACF;CACA,IAAI;EACF,SAAS,IAAI,OAAO,KAAK,UAAU,MAAM,GAAG,OAAO;EACnD,UAAU,EAAE;CACd,UAAU;EACR,UAAU,EAAE;CACd;CACA,WAAW,eAAe,IAAI;CAC9B,eAAe,SAAS;AAC1B;AAEA,SAAgB,mBAAsB,MAAc,SAA4B,KAAiB;CAC/F,MAAM,SAAS,sBAAsB,MAAM,SAAS,GAAG;CACvD,IAAI,CAAC,OAAO,UACV,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,iBAAiB,KAAK,EAAE;CAE1E,OAAO,OAAO;AAChB;AAIA,SAAgB,sBACd,MACA,SACA,KACmB;CACnB,UAAU,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;CAC5C,MAAM,WAAW,GAAG,KAAK;CACzB,IAAI;EACF,MAAM,cAAc,yBAAyB,EAAE,SAAS,CAAC;EACzD,IAAI,CAAC,YAAY,UAAU,OAAO,EAAE,UAAU,MAAM;EACpD,IAAI;GACF,OAAO;IAAE,UAAU;IAAM,OAAO,IAAI;GAAE;EACxC,UAAU;GACR,YAAY,KAAK,QAAQ;EAC3B;CACF,SAAS,OAAO;EACd,IAAI,iBAAiB,qBACnB,MAAM,QAAQ,eAAe,MAAM,SAAS,EAAE,OAAO,MAAM,CAAC;EAE9D,MAAM;CACR;AACF;AAEA,SAAS,SAAS,IAAY,OAAe,SAAkC;CAC7E,IAAI,SAAS;CACb,OAAO,SAAS,MAAM,YAAY;EAChC,MAAM,UAAU,UAAU,IAAI,OAAO,QAAQ,MAAM,aAAa,MAAM;EACtE,IAAI,WAAW,GAAG,MAAM,QAAQ,eAAe,6BAA6B;EAC5E,UAAU;CACZ;AACF;AAEA,SAAS,eAAe,MAAoB;CAC1C,MAAM,KAAK,SAAS,MAAM,UAAU,QAAQ;CAC5C,IAAI;EACF,UAAU,EAAE;CACd,UAAU;EACR,UAAU,EAAE;CACd;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACnDA,SAAgB,mBAAmB,aAA6B;CAC9D,OAAO,GAAG,YAAY;AACxB;;;;;AAMA,SAAgB,oBACd,MACA,SAC0B;CAC1B,IAAI,CAAC,WAAW,IAAI,GAAG,OAAO;CAC9B,MAAM,OAAO,aAAa,MAAM,MAAM;CACtC,IAAI;CACJ,IAAI;EACF,MAAM,KAAK,MAAM,IAAI;CACvB,SAAS,OAAO;EACd,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,qBAAqB,EACxF,OAAO,MACT,CAAC;CACH;CACA,IAAI,OAAO,QAAQ,YAAY,QAAQ,QAAQ,MAAM,QAAQ,GAAG,GAC9D,MAAM,QAAQ,eAAe,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,kBAAkB;CAEzF,MAAM,SAAS;CACf,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK;CACtC,IAAI,KAAK,WAAW,KAAK,KAAK,OAAO,eAAe,KAAK,OAAO,YAC9D,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,aAAa,KAAK,KAAK,IAAI,EAAE,kCACvE;CAEF,MAAM,EAAE,UAAU,cAAc;CAChC,IAAI,OAAO,aAAa,YAAY,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,GAChF,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,wCAC1C;CAEF,IAAI,OAAO,cAAc,YAAY,CAAC,oBAAoB,KAAK,SAAS,GACtE,MAAM,QAAQ,eACZ,GAAG,QAAQ,QAAQ,gBAAgB,KAAK,kCAC1C;CAEF,OAAO;EAAE;EAAqB;CAAwB;AACxD;;;;AAKA,SAAgB,qBACd,MACA,MACA,SACM;CACN,0BAA0B,MAAM,GAAG,gBAAgB,IAAI,EAAE,KAAK,OAAO;AACvE;;;;AAKA,SAAgB,gCACd,SACA,MACA,SACA,SACM;CACN,MAAM,SAAS,QAAQ,KAAK;CAC5B,IAAI,WAAW,KAAA,GACb,MAAM,QAAQ,eACZ,GAAG,QAAQ,8BAA8B,KAAK,SAAS,IAAI,KAAK,UAAU,wBAAwB,QAAQ,OAAO,wEACnH;CAEF,IAAI,OAAO,aAAa,KAAK,UAC3B,MAAM,QAAQ,eACZ,GAAG,QAAQ,kBAAkB,KAAK,SAAS,oBAAoB,OAAO,SAAS,qDACjF;CAEF,IAAI,OAAO,cAAc,KAAK,WAC5B,MAAM,QAAQ,eACZ,GAAG,QAAQ,4BAA4B,KAAK,SAAS,WAAW,OAAO,UAAU,iCAAiC,KAAK,UAAU,6BACnI;AAEJ;;;;;;;;;;;;;;;;;;;;;;;;;ACxBA,MAAM,iCAAiB,IAAI,IAAmB;AAE9C,SAAS,SAAS,MAAqB;CACrC,MAAM,WAAW,eAAe,IAAI,IAAI;CACxC,IAAI,UAAU,OAAO;CACrB,MAAM,QAAQ,IAAI,MAAM;CACxB,eAAe,IAAI,MAAM,KAAK;CAC9B,OAAO;AACT;;;AAIA,IAAa,oBAAb,MAAiG;CAC/F;;CAEA;CACA;CACA;CACA;CAEA,YACE,MACA,OACA,UAAoC,CAAC,GACrC;EACA,KAAK,OAAO,QAAQ,IAAI;EACxB,KAAK,kBAAkB,mBAAmB,KAAK,IAAI;EACnD,KAAK,QAAQ;EACb,KAAK,QAAQ,SAAS,KAAK,IAAI;EAC/B,KAAK,qBAAqB,QAAQ,uBAAuB;CAC3D;CAEA,MAAM,SAAgF;EACpF,OAAO,KAAK,MAAM,mBAChB,mBAAmB,KAAK,MAAM,KAAK,aAAa,KAAK,aAAa,CAAC,CACrE;CACF;CAEA,MAAM,OACJ,OACA,UAA+B,CAAC,GACuC;EACvE,OAAO,KAAK,MAAM,mBAChB,mBAAmB,KAAK,MAAM,KAAK,aAAa;GAC9C,MAAM,SAAS,KAAK,aAAa;GACjC,MAAM,WAAW,OAAO,QAAQ,MAAM,UAAU,MAAM,MAAM,YAAY,MAAM,OAAO;GACrF,IAAI,UAAU;IACZ,IAAI,gBAAgB,SAAS,KAAK,MAAM,gBAAgB,KAAK,GAC3D,MAAM,KAAK,MAAM,cACf,WAAW,MAAM,QAAQ,uCAC3B;IAEF,OAAO;KAAE,OAAO;KAAU,UAAU;KAAO,YAAY,OAAO;IAAW;GAC3E;GAEA,MAAM,WAAW;IACf,GAAG,KAAK,MAAM;IACd,UAAU,OAAO,QAAQ;IACzB,cAAc,OAAO,QAAQ,GAAG,EAAE,CAAC,EAAE,aAAa;IAClD;GACF;GACA,MAAM,QAAQ;IAAE,GAAG;IAAU,WAAW,cAAc,QAAQ;GAAE;GAIhE,MAAM,aAAa,KAAK,QAAQ,CAAC,GAAG,OAAO,SAAS,KAAK,CAAC;GAC1D,iBAAiB,KAAK,MAAM,GAAG,gBAAgB,KAAK,EAAE,KAAK,KAAK,KAAK;GACrE,IAAI,QAAQ,YAAY,MAKtB,qBACE,KAAK,iBACL;IAAE,UAAU,MAAM;IAAU,WAAW,MAAM;GAAU,GACvD,KAAK,KACP;GAEF,OAAO;IAAE;IAAO,UAAU;IAAM;GAAW;EAC7C,CAAC,CACH;CACF;;CAGA,MAAM,cAAiD;EACrD,OAAO,KAAK,MAAM,mBAChB,mBAAmB,KAAK,MAAM,KAAK,aACjC,oBAAoB,KAAK,iBAAiB,KAAK,KAAK,CACtD,CACF;CACF;;;;CAKA,MAAM,iBAA6C;EACjD,OAAO,KAAK,MAAM,mBAChB,mBAAmB,KAAK,MAAM,KAAK,aAAa;GAC9C,MAAM,UAAU,KAAK,YAAY;GACjC,KAAK,QAAQ,OAAO;GAGpB,KAAK,kBAAkB,SAAS,KAAK;GACrC,MAAM,OAAO,QAAQ,GAAG,EAAE;GAC1B,IAAI,SAAS,KAAA,GACX,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,mCACrC;GAEF,MAAM,OAA0B;IAAE,UAAU,KAAK;IAAU,WAAW,KAAK;GAAU;GACrF,qBAAqB,KAAK,iBAAiB,MAAM,KAAK,KAAK;GAC3D,OAAO;EACT,CAAC,CACH;CACF;CAEA,eAAqF;EACnF,MAAM,UAAU,KAAK,YAAY;EACjC,MAAM,aAAa,KAAK,QAAQ,OAAO;EAIvC,KAAK,kBAAkB,SAAS,KAAK,kBAAkB;EACvD,OAAO;GAAE;GAAS;EAAW;CAC/B;CAEA,kBAA0B,SAAyC,YAA2B;EAC5F,MAAM,SAAS,oBAAoB,KAAK,iBAAiB,KAAK,KAAK;EACnE,IAAI,WAAW,MAAM;GACnB,IAAI,cAAc,QAAQ,SAAS,GACjC,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,OAAO,QAAQ,OAAO,kCAAkC,KAAK,gBAAgB,gEAClH;GAEF;EACF;EACA,gCACE,SACA,QACA,KAAK,OACL,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,MAChC;CACF;CAEA,cAAsD;EACpD,IAAI,CAAC,WAAW,KAAK,IAAI,GAAG,OAAO,CAAC;EACpC,MAAM,OAAO,aAAa,KAAK,MAAM,MAAM;EAC3C,IAAI,KAAK,WAAW,GAAG,OAAO,CAAC;EAC/B,IAAI,CAAC,KAAK,SAAS,IAAI,GACrB,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,gDACrC;EAGF,MAAM,QAAQ,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC,MAAM,IAAI;EAC1C,MAAM,UAA0C,CAAC;EACjD,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;GACpD,MAAM,OAAO,MAAM;GACnB,IAAI,KAAK,WAAW,GAClB,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,2BAA2B,QAAQ,GACxE;GAEF,IAAI;GACJ,IAAI;IACF,MAAM,KAAK,MAAM,IAAI;GACvB,SAAS,OAAO;IACd,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,4BAA4B,QAAQ,KACvE,EAAE,OAAO,MAAM,CACjB;GACF;GACA,MAAM,QAAQ,KAAK,MAAM,WAAW,KAAK;IAAE,MAAM,KAAK;IAAM,MAAM,QAAQ;GAAE,CAAC;GAC7E,IAAI;GACJ,IAAI;IACF,YAAY,gBAAgB,KAAK;GACnC,SAAS,OAAO;IACd,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,iDAAiD,QAAQ,KAC5F,EAAE,OAAO,MAAM,CACjB;GACF;GACA,IAAI,SAAS,WACX,MAAM,KAAK,MAAM,eACf,GAAG,KAAK,MAAM,QAAQ,GAAG,KAAK,KAAK,mCAAmC,QAAQ,GAChF;GAEF,QAAQ,KAAK,KAAK;EACpB;EACA,OAAO;CACT;CAEA,QAAgB,SAAqD;EACnE,MAAM,YAAY,KAAK,MAAM,gBAAgB;EAC7C,MAAM,2BAAW,IAAI,IAAY;EACjC,IAAI,mBAAsC;EAC1C,KAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;GACtD,MAAM,QAAQ,QAAQ;GACtB,KAAK,MAAM,iBAAiB,OAAO,KAAK;GACxC,IAAI,MAAM,aAAa,OACrB,MAAM,KAAK,MAAM,eACf,SAAS,MAAM,MAAM,QAAQ,gBAAgB,MAAM,SAAS,aAAa,OAC3E;GAEF,IAAI,MAAM,iBAAiB,kBACzB,MAAM,KAAK,MAAM,eACf,SAAS,MAAM,MAAM,QAAQ,mCAC/B;GAEF,MAAM,EAAE,WAAW,YAAY,GAAG,aAAa;GAC/C,MAAM,eAAe,cAAc,QAAQ;GAC3C,IAAI,MAAM,cAAc,cACtB,MAAM,KAAK,MAAM,eACf,SAAS,MAAM,MAAM,QAAQ,2BAA2B,aAAa,QAAQ,MAAM,WACrF;GAEF,mBAAmB,MAAM;GACzB,IAAI,SAAS,IAAI,MAAM,MAAM,OAAO,GAClC,MAAM,KAAK,MAAM,eACf,qBAAqB,MAAM,MAAM,QAAQ,mBAC3C;GAEF,SAAS,IAAI,MAAM,MAAM,OAAO;GAChC,UAAU,MAAM,OAAO,KAAK;EAC9B;EACA,OAAO,UAAU,OAAO,OAAO;CACjC;AACF"}