@tangle-network/agent-eval 0.216.0 → 0.216.1

package/dist/{judge-calibration-N44V04Se.js.map → judge-calibration-BpCy5XQl.js.map}

@@ -1 +1 @@
-{"version":3,"file":"judge-calibration-N44V04Se.js","names":["quantile"],"sources":["../src/judge-calibration.ts"],"sourcesContent":["/**\n * Judge calibration — measure judge quality against human gold + bias.\n *\n * Workflow:\n *   1. Build a golden set: {itemId, humanScore}[].\n *   2. Run candidate judges; each produces {itemId, score}.\n *   3. `calibrateJudge(golden, candidate)` reports κ + Pearson + MAE.\n *   4. `calibrateJudgeContinuous(golden, candidate)` adds quadratic-weighted\n *      κ over the un-rounded [0,1] scores plus ICC(2,1), Pearson, Spearman,\n *      and bootstrap CIs — use this for fine-grained judges where rounding\n *      to int discards information (e.g. 0.78 vs 0.81 both round to 1 and\n *      look \"perfectly agreed\" to integer κ).\n *   5. Run bias probes (positional, verbosity, self-preference) to\n *      detect systematic score inflation.\n *   6. For N≥2 judges on the same items, `continuousAgreement(scores)`\n *      reports ICC(2,1) + κ_w + Pearson + Spearman with bootstrap CIs.\n *\n * Returns actionable diagnostics, not a single number. Consumers then\n * decide whether to trust the judge, retrain it, or add a tie-breaker.\n */\n\nimport { interpolatedQuantile as quantile } from './math/quantile'\nimport { pearsonR, spearmanR } from './statistics/descriptive'\nimport { mulberry32 } from './statistics/random'\n\nexport interface GoldenItem {\n  itemId: string\n  humanScore: number\n  /** Optional group used for per-group bias audits (e.g. model-of-output family). */\n  group?: string\n}\n\nexport interface CandidateScore {\n  itemId: string\n  score: number\n  /** Optional — enables positional-bias analysis (did order matter?). */\n  positionOfAInput?: 'first' | 'second'\n}\n\nexport interface CalibrationResult {\n  n: number\n  pearson: number\n  /** Cohen's κ with quadratic weights over integer-rounded scores. */\n  kappa: number\n  /** Mean absolute error vs human. */\n  mae: number\n  /** Worst-5 miscalibrations (largest |judge - human|). */\n  worstItems: Array<{ itemId: string; judge: number; human: number; delta: number }>\n}\n\n/**\n * Measure judge quality against human gold labels: computes Cohen's κ, Pearson correlation, and MAE over matched item ids.\n */\nexport function calibrateJudge(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n): CalibrationResult {\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const common = [...map.values()].filter((v) => Number.isFinite(v.j))\n  const n = common.length\n  if (n < 2) {\n    return { n, pearson: NaN, kappa: NaN, mae: NaN, worstItems: [] }\n  }\n  const humans = common.map((c) => c.h)\n  const judges = common.map((c) => c.j)\n  const pearson = pearsonR(humans, judges)\n  const kappa = weightedKappa(humans.map(Math.round), judges.map(Math.round))\n  const absDiffs = common.map((c) => Math.abs(c.j - c.h))\n  const mae = absDiffs.reduce((a, b) => a + b, 0) / n\n  const worst = [...map.entries()]\n    .filter(([, v]) => Number.isFinite(v.j))\n    .map(([itemId, v]) => ({ itemId, judge: v.j, human: v.h, delta: Math.abs(v.j - v.h) }))\n    .sort((a, b) => b.delta - a.delta)\n    .slice(0, 5)\n  return { n, pearson, kappa, mae, worstItems: worst }\n}\n\nexport interface PositionalBiasResult {\n  /**\n   * Score delta (first-position - second-position) averaged across items\n   * presented in both positions. Non-zero = positional bias.\n   */\n  avgDelta: number\n  n: number\n}\n\n/**\n * Feed the same items to the judge twice with A/B swapped and pass all\n * results here. Items that don't appear in both positions are ignored.\n */\nexport function positionalBias(scores: CandidateScore[]): PositionalBiasResult {\n  const pairs = new Map<string, { first?: number; second?: number }>()\n  for (const s of scores) {\n    const slot = pairs.get(s.itemId) ?? {}\n    if (s.positionOfAInput === 'first') slot.first = s.score\n    else if (s.positionOfAInput === 'second') slot.second = s.score\n    pairs.set(s.itemId, slot)\n  }\n  const deltas: number[] = []\n  for (const { first, second } of pairs.values()) {\n    if (first !== undefined && second !== undefined) deltas.push(first - second)\n  }\n  if (deltas.length === 0) return { avgDelta: 0, n: 0 }\n  return { avgDelta: deltas.reduce((a, b) => a + b, 0) / deltas.length, n: deltas.length }\n}\n\nexport interface VerbosityBiasResult {\n  /** Pearson correlation between output length and score. Strong positive = verbosity bias. */\n  pearson: number\n  n: number\n}\n\nexport function verbosityBias(\n  samples: Array<{ outputLen: number; score: number }>,\n): VerbosityBiasResult {\n  const n = samples.length\n  if (n < 3) return { pearson: NaN, n }\n  return {\n    pearson: pearsonR(\n      samples.map((s) => s.outputLen),\n      samples.map((s) => s.score),\n    ),\n    n,\n  }\n}\n\nexport interface SelfPreferenceResult {\n  /** Mean judge score when judge's family matches output's family. */\n  inFamilyMean: number\n  outOfFamilyMean: number\n  deltaMean: number\n  n: number\n}\n\n/**\n * Pass the same scenarios scored with judge-model X grading outputs from\n * model X (in-family) and model Y (out-of-family). Non-zero delta\n * indicates self-preference.\n */\nexport function selfPreference(\n  samples: Array<{ score: number; inFamily: boolean }>,\n): SelfPreferenceResult {\n  const inF = samples.filter((s) => s.inFamily).map((s) => s.score)\n  const outF = samples.filter((s) => !s.inFamily).map((s) => s.score)\n  if (inF.length === 0 || outF.length === 0)\n    return { inFamilyMean: 0, outOfFamilyMean: 0, deltaMean: 0, n: 0 }\n  const inMean = inF.reduce((a, b) => a + b, 0) / inF.length\n  const outMean = outF.reduce((a, b) => a + b, 0) / outF.length\n  return {\n    inFamilyMean: inMean,\n    outOfFamilyMean: outMean,\n    deltaMean: inMean - outMean,\n    n: samples.length,\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\n/** Quadratic weighted Cohen's κ over bounded integer scores. */\nfunction weightedKappa(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length === 0) return NaN\n  const min = Math.min(...a, ...b)\n  const max = Math.max(...a, ...b)\n  const K = max - min + 1\n  if (K < 2) return 1\n  const observed: number[][] = Array.from({ length: K }, () => new Array(K).fill(0))\n  const rowMarg = new Array(K).fill(0)\n  const colMarg = new Array(K).fill(0)\n  for (let i = 0; i < a.length; i++) {\n    const ai = a[i]! - min\n    const bi = b[i]! - min\n    const row = observed[ai]!\n    row[bi] = (row[bi] ?? 0) + 1\n    rowMarg[ai]++\n    colMarg[bi]++\n  }\n  let num = 0\n  let den = 0\n  for (let i = 0; i < K; i++) {\n    for (let j = 0; j < K; j++) {\n      const w = (i - j) ** 2 / (K - 1) ** 2\n      const expected = (rowMarg[i] * colMarg[j]) / a.length\n      num += w * observed[i]![j]!\n      den += w * expected\n    }\n  }\n  if (den === 0) return 1\n  return 1 - num / den\n}\n\n// ── Continuous-value inter-rater agreement ──────────────────────────\n//\n// `weightedKappa` above quantises to integers. For [0,1] judges that is\n// lossy: 0.78 and 0.81 both round to 1 and look identical to integer κ.\n// `continuousAgreement` keeps the original magnitudes:\n//\n//   - κ_w   : Cohen's weighted κ generalised to continuous scores. For two\n//             raters, weighted κ = 1 − Σ w_ij·o_ij / Σ w_ij·e_ij collapses\n//             into the closed form below when each \"category\" is the score\n//             itself (Janson & Olsson 2001; Cohen 1968 quadratic weights).\n//   - ICC   : Intraclass Correlation Coefficient, ICC(2,1) per Shrout &\n//             Fleiss (1979) — two-way random effects, absolute agreement,\n//             single rater. The right reliability coefficient when judges\n//             are a random sample of the judge population.\n//   - r, ρ  : Pearson + Spearman for sanity-check. Pearson catches linear\n//             association regardless of scale; Spearman catches monotone\n//             association regardless of distribution.\n//   - CIs   : Bootstrap percentile CIs over items (rows). Bias is preserved\n//             because we resample the full row, i.e. a judge's vector\n//             stays internally consistent within each bootstrap replicate.\n//\n// References:\n//   - Shrout, P. E. & Fleiss, J. L. (1979). Intraclass correlations: uses\n//     in assessing rater reliability. Psychological Bulletin, 86(2), 420.\n//   - McGraw, K. O. & Wong, S. P. (1996). Forming inferences about some\n//     intraclass correlation coefficients. Psychological Methods, 1, 30.\n//   - Janson, H. & Olsson, U. (2001). A measure of agreement for interval\n//     or nominal multivariate observations. Educ. Psychol. Meas., 61, 277.\n\nexport interface ContinuousAgreement {\n  /** Cohen's κ_w with quadratic weights, computed on raw [0,1] scores. */\n  weightedKappa: number\n  /** ICC(2,1): two-way random effects, absolute agreement, single rater. */\n  icc: number\n  /** Pearson product-moment correlation (averaged over rater pairs if N>2). */\n  pearson: number\n  /** Spearman rank correlation (averaged over rater pairs if N>2). */\n  spearman: number\n  /** 95% bootstrap percentile CIs over items. */\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n  /** Number of complete items (no NaN across raters). */\n  n: number\n  /** Number of raters. */\n  raters: number\n}\n\nexport interface ContinuousAgreementOptions {\n  /** Bootstrap iterations. Default 1000. Set to 0 to skip CIs (CI = [NaN, NaN]). */\n  bootstrap?: number\n  /** κ weighting scheme. Default 'quadratic'. */\n  weights?: 'linear' | 'quadratic'\n  /** PRNG seed for reproducible bootstrap. Default 0xC0FFEE. */\n  seed?: number\n  /** Confidence level for percentile CI. Default 0.95. */\n  ciLevel?: number\n}\n\n/**\n * Inter-rater agreement on continuous (typically [0,1]) scores.\n *\n * `scores` has shape [n_items][n_raters]. Rows with any non-finite entry\n * are dropped. Returns NaN metrics if fewer than 2 raters or 2 complete\n * items remain.\n */\nexport function continuousAgreement(\n  scores: number[][],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousAgreement {\n  const bootstrap = opts.bootstrap ?? 1000\n  const weights = opts.weights ?? 'quadratic'\n  const seed = opts.seed ?? 0xc0ffee\n  const ciLevel = opts.ciLevel ?? 0.95\n\n  const matrix = scores.filter((row) => row.length >= 2 && row.every((v) => Number.isFinite(v)))\n  const raters = matrix[0]?.length ?? 0\n  // All rows must have the same rater count, else drop the offenders.\n  const clean = matrix.filter((row) => row.length === raters)\n  const nClean = clean.length\n\n  if (nClean < 2 || raters < 2) {\n    return {\n      weightedKappa: NaN,\n      icc: NaN,\n      pearson: NaN,\n      spearman: NaN,\n      ci: { icc: [NaN, NaN], weightedKappa: [NaN, NaN] },\n      n: nClean,\n      raters,\n    }\n  }\n\n  const kappa = continuousWeightedKappa(clean, weights)\n  const icc = icc21(clean)\n  const pearson = avgPairwise(clean, pearsonR)\n  const spearman = avgPairwise(clean, spearmanR)\n\n  const ciIcc: [number, number] = [NaN, NaN]\n  const ciKappa: [number, number] = [NaN, NaN]\n  if (bootstrap > 0) {\n    const rng = mulberry32(seed)\n    const iccs: number[] = []\n    const kappas: number[] = []\n    for (let b = 0; b < bootstrap; b++) {\n      const sample: number[][] = new Array(nClean)\n      for (let i = 0; i < nClean; i++) {\n        sample[i] = clean[Math.floor(rng() * nClean)]!\n      }\n      const iccB = icc21(sample)\n      const kB = continuousWeightedKappa(sample, weights)\n      if (Number.isFinite(iccB)) iccs.push(iccB)\n      if (Number.isFinite(kB)) kappas.push(kB)\n    }\n    const [lo, hi] = percentileBounds(ciLevel)\n    if (iccs.length > 0) {\n      iccs.sort((a, b) => a - b)\n      ciIcc[0] = quantile(iccs, lo)\n      ciIcc[1] = quantile(iccs, hi)\n    }\n    if (kappas.length > 0) {\n      kappas.sort((a, b) => a - b)\n      ciKappa[0] = quantile(kappas, lo)\n      ciKappa[1] = quantile(kappas, hi)\n    }\n  }\n\n  return {\n    weightedKappa: kappa,\n    icc,\n    pearson,\n    spearman,\n    ci: { icc: ciIcc, weightedKappa: ciKappa },\n    n: nClean,\n    raters,\n  }\n}\n\nexport interface ContinuousCalibrationResult extends CalibrationResult {\n  /** Cohen's κ_w computed on raw (un-rounded) scores. */\n  weightedKappaContinuous: number\n  /** ICC(2,1) treating golden + candidate as two raters. */\n  icc: number\n  spearman: number\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n}\n\n/**\n * Extends `calibrateJudge` with continuous-value agreement metrics while\n * retaining its base calibration summary.\n */\nexport function calibrateJudgeContinuous(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousCalibrationResult {\n  const base = calibrateJudge(golden, candidate)\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const rows: number[][] = []\n  for (const v of map.values()) {\n    if (Number.isFinite(v.j)) rows.push([v.h, v.j])\n  }\n  const agreement = continuousAgreement(rows, opts)\n  return {\n    ...base,\n    weightedKappaContinuous: agreement.weightedKappa,\n    icc: agreement.icc,\n    spearman: agreement.spearman,\n    ci: agreement.ci,\n  }\n}\n\n// ── Continuous-agreement internals ──────────────────────────────────\n\n/**\n * Quadratic-weighted κ on continuous scores. With weights w(x,y) = (x-y)^2\n * (or |x-y| for linear) the formula collapses to:\n *\n *   κ_w = 1 − E_obs[w] / E_exp[w]\n *\n * where E_obs averages w over paired (a_i, b_i) and E_exp averages w over\n * the independent product distribution (sum_{i,j} w(a_i, b_j) / n^2).\n * The normalisation by (max-min)^2 in the integer version cancels in the\n * ratio, so we don't need it here. Generalises to N raters by averaging κ_w\n * over all rater pairs (mean pairwise weighted agreement).\n */\nfunction continuousWeightedKappa(rows: number[][], scheme: 'linear' | 'quadratic'): number {\n  if (rows.length === 0) return NaN\n  const raters = rows[0]!.length\n  if (raters < 2) return NaN\n  const wFn =\n    scheme === 'linear'\n      ? (x: number, y: number) => Math.abs(x - y)\n      : (x: number, y: number) => (x - y) ** 2\n  let sum = 0\n  let pairs = 0\n  for (let r1 = 0; r1 < raters; r1++) {\n    for (let r2 = r1 + 1; r2 < raters; r2++) {\n      const a = rows.map((row) => row[r1]!)\n      const b = rows.map((row) => row[r2]!)\n      const n = a.length\n      let obs = 0\n      for (let i = 0; i < n; i++) obs += wFn(a[i]!, b[i]!)\n      obs /= n\n      // Expected under independence: average of w over all i,j cross pairs.\n      let exp = 0\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) exp += wFn(a[i]!, b[j]!)\n      }\n      exp /= n * n\n      if (exp === 0) {\n        // Degenerate: at least one rater is constant. Convention: perfect\n        // agreement iff observed disagreement is also zero, else 0.\n        sum += obs === 0 ? 1 : 0\n      } else {\n        sum += 1 - obs / exp\n      }\n      pairs++\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/**\n * ICC(2,1) — two-way random effects, absolute agreement, single rater.\n *\n *   ICC(2,1) = (MSR − MSE) / (MSR + (k−1)·MSE + k·(MSC − MSE)/n)\n *\n * where MSR = between-rows MS, MSC = between-columns MS, MSE = residual MS,\n * n = rows (items), k = columns (raters).\n */\nfunction icc21(rows: number[][]): number {\n  const n = rows.length\n  if (n < 2) return NaN\n  const k = rows[0]!.length\n  if (k < 2) return NaN\n\n  // Row means.\n  const rowMeans = rows.map((row) => row.reduce((s, v) => s + v, 0) / k)\n  // Column means.\n  const colMeans = new Array(k).fill(0)\n  for (let j = 0; j < k; j++) {\n    let s = 0\n    for (let i = 0; i < n; i++) s += rows[i]![j]!\n    colMeans[j] = s / n\n  }\n  // Grand mean.\n  let grand = 0\n  for (let i = 0; i < n; i++) grand += rowMeans[i]!\n  grand /= n\n\n  let ssR = 0\n  for (let i = 0; i < n; i++) ssR += (rowMeans[i]! - grand) ** 2\n  ssR *= k\n  let ssC = 0\n  for (let j = 0; j < k; j++) ssC += (colMeans[j]! - grand) ** 2\n  ssC *= n\n  let ssT = 0\n  for (let i = 0; i < n; i++) {\n    for (let j = 0; j < k; j++) ssT += (rows[i]![j]! - grand) ** 2\n  }\n  const ssE = ssT - ssR - ssC\n\n  const dfR = n - 1\n  const dfC = k - 1\n  const dfE = (n - 1) * (k - 1)\n  const msR = ssR / dfR\n  const msC = ssC / dfC\n  const msE = dfE > 0 ? ssE / dfE : 0\n\n  const denom = msR + (k - 1) * msE + (k * (msC - msE)) / n\n  if (denom === 0) {\n    // Degenerate (all values equal): convention = 1 if rows identical,\n    // else 0. Identical rows ⇒ msR = 0 too, so msR − msE near 0.\n    return msR === 0 && msE === 0 ? 1 : 0\n  }\n  return (msR - msE) / denom\n}\n\n/** Average pairwise statistic over all rater pairs. */\nfunction avgPairwise(rows: number[][], fn: (a: number[], b: number[]) => number): number {\n  const k = rows[0]?.length ?? 0\n  if (k < 2) return NaN\n  let sum = 0\n  let pairs = 0\n  for (let i = 0; i < k; i++) {\n    for (let j = i + 1; j < k; j++) {\n      const a = rows.map((row) => row[i]!)\n      const b = rows.map((row) => row[j]!)\n      const r = fn(a, b)\n      if (Number.isFinite(r)) {\n        sum += r\n        pairs++\n      }\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\nfunction percentileBounds(ciLevel: number): [number, number] {\n  const tail = (1 - ciLevel) / 2\n  return [tail, 1 - tail]\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDA,SAAgB,eACd,QACA,WACmB;CACnB,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,SAAS,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC;CACnE,MAAM,IAAI,OAAO;CACjB,IAAI,IAAI,GACN,OAAO;EAAE;EAAG,SAAS;EAAK,OAAO;EAAK,KAAK;EAAK,YAAY,CAAC;CAAE;CAEjE,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CACpC,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CAUpC,OAAO;EAAE;EAAG,SATI,SAAS,QAAQ,MASf;EAAG,OARP,cAAc,OAAO,IAAI,KAAK,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,CAQhD;EAAG,KAPX,OAAO,KAAK,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAClC,CAAC,CAAC,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAMjB,YALnB,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,CAC7B,QAAQ,GAAG,OAAO,OAAO,SAAS,EAAE,CAAC,CAAC,CAAC,CACvC,KAAK,CAAC,QAAQ,QAAQ;GAAE;GAAQ,OAAO,EAAE;GAAG,OAAO,EAAE;GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;EAAE,EAAE,CAAC,CACtF,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CACjC,MAAM,GAAG,CACqC;CAAE;AACrD;;;;;AAeA,SAAgB,eAAe,QAAgD;CAC7E,MAAM,wBAAQ,IAAI,IAAiD;CACnE,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,OAAO,MAAM,IAAI,EAAE,MAAM,KAAK,CAAC;EACrC,IAAI,EAAE,qBAAqB,SAAS,KAAK,QAAQ,EAAE;OAC9C,IAAI,EAAE,qBAAqB,UAAU,KAAK,SAAS,EAAE;EAC1D,MAAM,IAAI,EAAE,QAAQ,IAAI;CAC1B;CACA,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,EAAE,OAAO,YAAY,MAAM,OAAO,GAC3C,IAAI,UAAU,KAAA,KAAa,WAAW,KAAA,GAAW,OAAO,KAAK,QAAQ,MAAM;CAE7E,IAAI,OAAO,WAAW,GAAG,OAAO;EAAE,UAAU;EAAG,GAAG;CAAE;CACpD,OAAO;EAAE,UAAU,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;EAAQ,GAAG,OAAO;CAAO;AACzF;AAQA,SAAgB,cACd,SACqB;CACrB,MAAM,IAAI,QAAQ;CAClB,IAAI,IAAI,GAAG,OAAO;EAAE,SAAS;EAAK;CAAE;CACpC,OAAO;EACL,SAAS,SACP,QAAQ,KAAK,MAAM,EAAE,SAAS,GAC9B,QAAQ,KAAK,MAAM,EAAE,KAAK,CAC5B;EACA;CACF;AACF;;;;;;AAeA,SAAgB,eACd,SACsB;CACtB,MAAM,MAAM,QAAQ,QAAQ,MAAM,EAAE,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,KAAK;CAChE,MAAM,OAAO,QAAQ,QAAQ,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,KAAK;CAClE,IAAI,IAAI,WAAW,KAAK,KAAK,WAAW,GACtC,OAAO;EAAE,cAAc;EAAG,iBAAiB;EAAG,WAAW;EAAG,GAAG;CAAE;CACnE,MAAM,SAAS,IAAI,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI;CACpD,MAAM,UAAU,KAAK,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK;CACvD,OAAO;EACL,cAAc;EACd,iBAAiB;EACjB,WAAW,SAAS;EACpB,GAAG,QAAQ;CACb;AACF;;AAKA,SAAS,cAAc,GAAa,GAAqB;CACvD,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,GAAG,OAAO;CACpD,MAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;CAE/B,MAAM,IADM,KAAK,IAAI,GAAG,GAAG,GAAG,CAClB,IAAI,MAAM;CACtB,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,WAAuB,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;CACjF,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,MAAM,SAAS;EACrB,IAAI,OAAO,IAAI,OAAO,KAAK;EAC3B,QAAQ,GAAG;EACX,QAAQ,GAAG;CACb;CACA,IAAI,MAAM;CACV,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM;EACpC,MAAM,WAAY,QAAQ,KAAK,QAAQ,KAAM,EAAE;EAC/C,OAAO,IAAI,SAAS,EAAE,CAAE;EACxB,OAAO,IAAI;CACb;CAEF,IAAI,QAAQ,GAAG,OAAO;CACtB,OAAO,IAAI,MAAM;AACnB;;;;;;;;AAqEA,SAAgB,oBACd,QACA,OAAmC,CAAC,GACf;CACrB,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,UAAU,KAAK,WAAW;CAChC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,UAAU,KAAK,WAAW;CAEhC,MAAM,SAAS,OAAO,QAAQ,QAAQ,IAAI,UAAU,KAAK,IAAI,OAAO,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC;CAC7F,MAAM,SAAS,OAAO,EAAE,EAAE,UAAU;CAEpC,MAAM,QAAQ,OAAO,QAAQ,QAAQ,IAAI,WAAW,MAAM;CAC1D,MAAM,SAAS,MAAM;CAErB,IAAI,SAAS,KAAK,SAAS,GACzB,OAAO;EACL,eAAe;EACf,KAAK;EACL,SAAS;EACT,UAAU;EACV,IAAI;GAAE,KAAK,CAAC,KAAK,GAAG;GAAG,eAAe,CAAC,KAAK,GAAG;EAAE;EACjD,GAAG;EACH;CACF;CAGF,MAAM,QAAQ,wBAAwB,OAAO,OAAO;CACpD,MAAM,MAAM,MAAM,KAAK;CACvB,MAAM,UAAU,YAAY,OAAO,QAAQ;CAC3C,MAAM,WAAW,YAAY,OAAO,SAAS;CAE7C,MAAM,QAA0B,CAAC,KAAK,GAAG;CACzC,MAAM,UAA4B,CAAC,KAAK,GAAG;CAC3C,IAAI,YAAY,GAAG;EACjB,MAAM,MAAM,WAAW,IAAI;EAC3B,MAAM,OAAiB,CAAC;EACxB,MAAM,SAAmB,CAAC;EAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAClC,MAAM,SAAqB,IAAI,MAAM,MAAM;GAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,OAAO,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM;GAE7C,MAAM,OAAO,MAAM,MAAM;GACzB,MAAM,KAAK,wBAAwB,QAAQ,OAAO;GAClD,IAAI,OAAO,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI;GACzC,IAAI,OAAO,SAAS,EAAE,GAAG,OAAO,KAAK,EAAE;EACzC;EACA,MAAM,CAAC,IAAI,MAAM,iBAAiB,OAAO;EACzC,IAAI,KAAK,SAAS,GAAG;GACnB,KAAK,MAAM,GAAG,MAAM,IAAI,CAAC;GACzB,MAAM,KAAKA,qBAAS,MAAM,EAAE;GAC5B,MAAM,KAAKA,qBAAS,MAAM,EAAE;EAC9B;EACA,IAAI,OAAO,SAAS,GAAG;GACrB,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;GAC3B,QAAQ,KAAKA,qBAAS,QAAQ,EAAE;GAChC,QAAQ,KAAKA,qBAAS,QAAQ,EAAE;EAClC;CACF;CAEA,OAAO;EACL,eAAe;EACf;EACA;EACA;EACA,IAAI;GAAE,KAAK;GAAO,eAAe;EAAQ;EACzC,GAAG;EACH;CACF;AACF;;;;;AAkBA,SAAgB,yBACd,QACA,WACA,OAAmC,CAAC,GACP;CAC7B,MAAM,OAAO,eAAe,QAAQ,SAAS;CAC7C,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,OAAmB,CAAC;CAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,GACzB,IAAI,OAAO,SAAS,EAAE,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;CAEhD,MAAM,YAAY,oBAAoB,MAAM,IAAI;CAChD,OAAO;EACL,GAAG;EACH,yBAAyB,UAAU;EACnC,KAAK,UAAU;EACf,UAAU,UAAU;EACpB,IAAI,UAAU;CAChB;AACF;;;;;;;;;;;;;AAgBA,SAAS,wBAAwB,MAAkB,QAAwC;CACzF,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,MAAM,SAAS,KAAK,EAAE,CAAE;CACxB,IAAI,SAAS,GAAG,OAAO;CACvB,MAAM,MACJ,WAAW,YACN,GAAW,MAAc,KAAK,IAAI,IAAI,CAAC,KACvC,GAAW,OAAe,IAAI,MAAM;CAC3C,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,KAAK,GAAG,KAAK,QAAQ,MAC5B,KAAK,IAAI,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;EACvC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,EAAE;EACZ,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EACnD,OAAO;EAEP,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EAErD,OAAO,IAAI;EACX,IAAI,QAAQ,GAGV,OAAO,QAAQ,IAAI,IAAI;OAEvB,OAAO,IAAI,MAAM;EAEnB;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;;;;;;;;;AAUA,SAAS,MAAM,MAA0B;CACvC,MAAM,IAAI,KAAK;CACf,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,IAAI,KAAK,EAAE,CAAE;CACnB,IAAI,IAAI,GAAG,OAAO;CAGlB,MAAM,WAAW,KAAK,KAAK,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC;CAErE,MAAM,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,KAAK,EAAE,CAAE;EAC1C,SAAS,KAAK,IAAI;CACpB;CAEA,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,SAAS,SAAS;CAC9C,SAAS;CAET,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,KAAK,EAAE,CAAE,KAAM,UAAU;CAE/D,MAAM,MAAM,MAAM,MAAM;CAExB,MAAM,MAAM,IAAI;CAChB,MAAM,MAAM,IAAI;CAChB,MAAM,OAAO,IAAI,MAAM,IAAI;CAC3B,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM,IAAI,MAAM,MAAM;CAElC,MAAM,QAAQ,OAAO,IAAI,KAAK,MAAO,KAAK,MAAM,OAAQ;CACxD,IAAI,UAAU,GAGZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI;CAEtC,QAAQ,MAAM,OAAO;AACvB;;AAGA,SAAS,YAAY,MAAkB,IAAkD;CACvF,MAAM,IAAI,KAAK,EAAE,EAAE,UAAU;CAC7B,IAAI,IAAI,GAAG,OAAO;CAClB,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAG9B,MAAM,IAAI,GAFA,KAAK,KAAK,QAAQ,IAAI,EAEnB,GADH,KAAK,KAAK,QAAQ,IAAI,EAChB,CAAC;EACjB,IAAI,OAAO,SAAS,CAAC,GAAG;GACtB,OAAO;GACP;EACF;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;AAEA,SAAS,iBAAiB,SAAmC;CAC3D,MAAM,QAAQ,IAAI,WAAW;CAC7B,OAAO,CAAC,MAAM,IAAI,IAAI;AACxB"}
+{"version":3,"file":"judge-calibration-BpCy5XQl.js","names":["quantile"],"sources":["../src/judge-calibration.ts"],"sourcesContent":["/**\n * Judge calibration — measure judge quality against human gold + bias.\n *\n * Workflow:\n *   1. Build a golden set: {itemId, humanScore}[].\n *   2. Run candidate judges; each produces {itemId, score}.\n *   3. `calibrateJudge(golden, candidate)` reports κ + Pearson + MAE.\n *   4. `calibrateJudgeContinuous(golden, candidate)` adds quadratic-weighted\n *      κ over the un-rounded [0,1] scores plus ICC(2,1), Pearson, Spearman,\n *      and bootstrap CIs — use this for fine-grained judges where rounding\n *      to int discards information (e.g. 0.78 vs 0.81 both round to 1 and\n *      look \"perfectly agreed\" to integer κ).\n *   5. Run bias probes (positional, verbosity, self-preference) to\n *      detect systematic score inflation.\n *   6. For N≥2 judges on the same items, `continuousAgreement(scores)`\n *      reports ICC(2,1) + κ_w + Pearson + Spearman with bootstrap CIs.\n *\n * Returns actionable diagnostics, not a single number. Consumers then\n * decide whether to trust the judge, retrain it, or add a tie-breaker.\n */\n\nimport { interpolatedQuantile as quantile } from './math/quantile'\nimport { pearsonR, spearmanR } from './statistics/descriptive'\nimport { mulberry32 } from './statistics/random'\n\nexport interface GoldenItem {\n  itemId: string\n  humanScore: number\n  /** Optional group used for per-group bias audits (e.g. model-of-output family). */\n  group?: string\n}\n\nexport interface CandidateScore {\n  itemId: string\n  score: number\n  /** Optional — enables positional-bias analysis (did order matter?). */\n  positionOfAInput?: 'first' | 'second'\n}\n\nexport interface CalibrationResult {\n  n: number\n  pearson: number\n  /** Cohen's κ with quadratic weights over integer-rounded scores. */\n  kappa: number\n  /** Mean absolute error vs human. */\n  mae: number\n  /** Worst-5 miscalibrations (largest |judge - human|). */\n  worstItems: Array<{ itemId: string; judge: number; human: number; delta: number }>\n}\n\n/**\n * Measure judge quality against human gold labels: computes Cohen's κ, Pearson correlation, and MAE over matched item ids.\n */\nexport function calibrateJudge(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n): CalibrationResult {\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const common = [...map.values()].filter((v) => Number.isFinite(v.j))\n  const n = common.length\n  if (n < 2) {\n    return { n, pearson: NaN, kappa: NaN, mae: NaN, worstItems: [] }\n  }\n  const humans = common.map((c) => c.h)\n  const judges = common.map((c) => c.j)\n  const pearson = pearsonR(humans, judges)\n  const kappa = weightedKappa(humans.map(Math.round), judges.map(Math.round))\n  const absDiffs = common.map((c) => Math.abs(c.j - c.h))\n  const mae = absDiffs.reduce((a, b) => a + b, 0) / n\n  const worst = [...map.entries()]\n    .filter(([, v]) => Number.isFinite(v.j))\n    .map(([itemId, v]) => ({ itemId, judge: v.j, human: v.h, delta: Math.abs(v.j - v.h) }))\n    .sort((a, b) => b.delta - a.delta)\n    .slice(0, 5)\n  return { n, pearson, kappa, mae, worstItems: worst }\n}\n\nexport interface PositionalBiasResult {\n  /**\n   * Score delta (first-position - second-position) averaged across items\n   * presented in both positions. Non-zero = positional bias.\n   */\n  avgDelta: number\n  n: number\n}\n\n/**\n * Feed the same items to the judge twice with A/B swapped and pass all\n * results here. Items that don't appear in both positions are ignored.\n */\nexport function positionalBias(scores: CandidateScore[]): PositionalBiasResult {\n  const pairs = new Map<string, { first?: number; second?: number }>()\n  for (const s of scores) {\n    const slot = pairs.get(s.itemId) ?? {}\n    if (s.positionOfAInput === 'first') slot.first = s.score\n    else if (s.positionOfAInput === 'second') slot.second = s.score\n    pairs.set(s.itemId, slot)\n  }\n  const deltas: number[] = []\n  for (const { first, second } of pairs.values()) {\n    if (first !== undefined && second !== undefined) deltas.push(first - second)\n  }\n  if (deltas.length === 0) return { avgDelta: 0, n: 0 }\n  return { avgDelta: deltas.reduce((a, b) => a + b, 0) / deltas.length, n: deltas.length }\n}\n\nexport interface VerbosityBiasResult {\n  /** Pearson correlation between output length and score. Strong positive = verbosity bias. */\n  pearson: number\n  n: number\n}\n\nexport function verbosityBias(\n  samples: Array<{ outputLen: number; score: number }>,\n): VerbosityBiasResult {\n  const n = samples.length\n  if (n < 3) return { pearson: NaN, n }\n  return {\n    pearson: pearsonR(\n      samples.map((s) => s.outputLen),\n      samples.map((s) => s.score),\n    ),\n    n,\n  }\n}\n\nexport interface SelfPreferenceResult {\n  /** Mean judge score when judge's family matches output's family. */\n  inFamilyMean: number\n  outOfFamilyMean: number\n  deltaMean: number\n  n: number\n}\n\n/**\n * Pass the same scenarios scored with judge-model X grading outputs from\n * model X (in-family) and model Y (out-of-family). Non-zero delta\n * indicates self-preference.\n */\nexport function selfPreference(\n  samples: Array<{ score: number; inFamily: boolean }>,\n): SelfPreferenceResult {\n  const inF = samples.filter((s) => s.inFamily).map((s) => s.score)\n  const outF = samples.filter((s) => !s.inFamily).map((s) => s.score)\n  if (inF.length === 0 || outF.length === 0)\n    return { inFamilyMean: 0, outOfFamilyMean: 0, deltaMean: 0, n: 0 }\n  const inMean = inF.reduce((a, b) => a + b, 0) / inF.length\n  const outMean = outF.reduce((a, b) => a + b, 0) / outF.length\n  return {\n    inFamilyMean: inMean,\n    outOfFamilyMean: outMean,\n    deltaMean: inMean - outMean,\n    n: samples.length,\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────\n\n/** Quadratic weighted Cohen's κ over bounded integer scores. */\nfunction weightedKappa(a: number[], b: number[]): number {\n  if (a.length !== b.length || a.length === 0) return NaN\n  const min = Math.min(...a, ...b)\n  const max = Math.max(...a, ...b)\n  const K = max - min + 1\n  if (K < 2) return 1\n  const observed: number[][] = Array.from({ length: K }, () => new Array(K).fill(0))\n  const rowMarg = new Array(K).fill(0)\n  const colMarg = new Array(K).fill(0)\n  for (let i = 0; i < a.length; i++) {\n    const ai = a[i]! - min\n    const bi = b[i]! - min\n    const row = observed[ai]!\n    row[bi] = (row[bi] ?? 0) + 1\n    rowMarg[ai]++\n    colMarg[bi]++\n  }\n  let num = 0\n  let den = 0\n  for (let i = 0; i < K; i++) {\n    for (let j = 0; j < K; j++) {\n      const w = (i - j) ** 2 / (K - 1) ** 2\n      const expected = (rowMarg[i] * colMarg[j]) / a.length\n      num += w * observed[i]![j]!\n      den += w * expected\n    }\n  }\n  if (den === 0) return 1\n  return 1 - num / den\n}\n\n// ── Continuous-value inter-rater agreement ──────────────────────────\n//\n// `weightedKappa` above quantises to integers. For [0,1] judges that is\n// lossy: 0.78 and 0.81 both round to 1 and look identical to integer κ.\n// `continuousAgreement` keeps the original magnitudes:\n//\n//   - κ_w   : Cohen's weighted κ generalised to continuous scores. For two\n//             raters, weighted κ = 1 − Σ w_ij·o_ij / Σ w_ij·e_ij collapses\n//             into the closed form below when each \"category\" is the score\n//             itself (Janson & Olsson 2001; Cohen 1968 quadratic weights).\n//   - ICC   : Intraclass Correlation Coefficient, ICC(2,1) per Shrout &\n//             Fleiss (1979) — two-way random effects, absolute agreement,\n//             single rater. The right reliability coefficient when judges\n//             are a random sample of the judge population.\n//   - r, ρ  : Pearson + Spearman for sanity-check. Pearson catches linear\n//             association regardless of scale; Spearman catches monotone\n//             association regardless of distribution.\n//   - CIs   : Bootstrap percentile CIs over items (rows). Bias is preserved\n//             because we resample the full row, i.e. a judge's vector\n//             stays internally consistent within each bootstrap replicate.\n//\n// References:\n//   - Shrout, P. E. & Fleiss, J. L. (1979). Intraclass correlations: uses\n//     in assessing rater reliability. Psychological Bulletin, 86(2), 420.\n//   - McGraw, K. O. & Wong, S. P. (1996). Forming inferences about some\n//     intraclass correlation coefficients. Psychological Methods, 1, 30.\n//   - Janson, H. & Olsson, U. (2001). A measure of agreement for interval\n//     or nominal multivariate observations. Educ. Psychol. Meas., 61, 277.\n\nexport interface ContinuousAgreement {\n  /** Cohen's κ_w with quadratic weights, computed on raw [0,1] scores. */\n  weightedKappa: number\n  /** ICC(2,1): two-way random effects, absolute agreement, single rater. */\n  icc: number\n  /** Pearson product-moment correlation (averaged over rater pairs if N>2). */\n  pearson: number\n  /** Spearman rank correlation (averaged over rater pairs if N>2). */\n  spearman: number\n  /** 95% bootstrap percentile CIs over items. */\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n  /** Number of complete items (no NaN across raters). */\n  n: number\n  /** Number of raters. */\n  raters: number\n}\n\nexport interface ContinuousAgreementOptions {\n  /** Bootstrap iterations. Default 1000. Set to 0 to skip CIs (CI = [NaN, NaN]). */\n  bootstrap?: number\n  /** κ weighting scheme. Default 'quadratic'. */\n  weights?: 'linear' | 'quadratic'\n  /** PRNG seed for reproducible bootstrap. Default 0xC0FFEE. */\n  seed?: number\n  /** Confidence level for percentile CI. Default 0.95. */\n  ciLevel?: number\n}\n\n/**\n * Inter-rater agreement on continuous (typically [0,1]) scores.\n *\n * `scores` has shape [n_items][n_raters]. Rows with any non-finite entry\n * are dropped. Returns NaN metrics if fewer than 2 raters or 2 complete\n * items remain.\n */\nexport function continuousAgreement(\n  scores: number[][],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousAgreement {\n  const bootstrap = opts.bootstrap ?? 1000\n  const weights = opts.weights ?? 'quadratic'\n  const seed = opts.seed ?? 0xc0ffee\n  const ciLevel = opts.ciLevel ?? 0.95\n\n  const matrix = scores.filter((row) => row.length >= 2 && row.every((v) => Number.isFinite(v)))\n  const raters = matrix[0]?.length ?? 0\n  // All rows must have the same rater count, else drop the offenders.\n  const clean = matrix.filter((row) => row.length === raters)\n  const nClean = clean.length\n\n  if (nClean < 2 || raters < 2) {\n    return {\n      weightedKappa: NaN,\n      icc: NaN,\n      pearson: NaN,\n      spearman: NaN,\n      ci: { icc: [NaN, NaN], weightedKappa: [NaN, NaN] },\n      n: nClean,\n      raters,\n    }\n  }\n\n  const kappa = continuousWeightedKappa(clean, weights)\n  const icc = icc21(clean)\n  const pearson = avgPairwise(clean, pearsonR)\n  const spearman = avgPairwise(clean, spearmanR)\n\n  const ciIcc: [number, number] = [NaN, NaN]\n  const ciKappa: [number, number] = [NaN, NaN]\n  if (bootstrap > 0) {\n    const rng = mulberry32(seed)\n    const iccs: number[] = []\n    const kappas: number[] = []\n    for (let b = 0; b < bootstrap; b++) {\n      const sample: number[][] = new Array(nClean)\n      for (let i = 0; i < nClean; i++) {\n        sample[i] = clean[Math.floor(rng() * nClean)]!\n      }\n      const iccB = icc21(sample)\n      const kB = continuousWeightedKappa(sample, weights)\n      if (Number.isFinite(iccB)) iccs.push(iccB)\n      if (Number.isFinite(kB)) kappas.push(kB)\n    }\n    const [lo, hi] = percentileBounds(ciLevel)\n    if (iccs.length > 0) {\n      iccs.sort((a, b) => a - b)\n      ciIcc[0] = quantile(iccs, lo)\n      ciIcc[1] = quantile(iccs, hi)\n    }\n    if (kappas.length > 0) {\n      kappas.sort((a, b) => a - b)\n      ciKappa[0] = quantile(kappas, lo)\n      ciKappa[1] = quantile(kappas, hi)\n    }\n  }\n\n  return {\n    weightedKappa: kappa,\n    icc,\n    pearson,\n    spearman,\n    ci: { icc: ciIcc, weightedKappa: ciKappa },\n    n: nClean,\n    raters,\n  }\n}\n\nexport interface ContinuousCalibrationResult extends CalibrationResult {\n  /** Cohen's κ_w computed on raw (un-rounded) scores. */\n  weightedKappaContinuous: number\n  /** ICC(2,1) treating golden + candidate as two raters. */\n  icc: number\n  spearman: number\n  ci: {\n    icc: [number, number]\n    weightedKappa: [number, number]\n  }\n}\n\n/**\n * Extends `calibrateJudge` with continuous-value agreement metrics while\n * retaining its base calibration summary.\n */\nexport function calibrateJudgeContinuous(\n  golden: GoldenItem[],\n  candidate: CandidateScore[],\n  opts: ContinuousAgreementOptions = {},\n): ContinuousCalibrationResult {\n  const base = calibrateJudge(golden, candidate)\n  const map = new Map<string, { h: number; j: number }>()\n  for (const g of golden) map.set(g.itemId, { h: g.humanScore, j: NaN })\n  for (const c of candidate) {\n    const entry = map.get(c.itemId)\n    if (entry) entry.j = c.score\n  }\n  const rows: number[][] = []\n  for (const v of map.values()) {\n    if (Number.isFinite(v.j)) rows.push([v.h, v.j])\n  }\n  const agreement = continuousAgreement(rows, opts)\n  return {\n    ...base,\n    weightedKappaContinuous: agreement.weightedKappa,\n    icc: agreement.icc,\n    spearman: agreement.spearman,\n    ci: agreement.ci,\n  }\n}\n\n// ── Continuous-agreement internals ──────────────────────────────────\n\n/**\n * Quadratic-weighted κ on continuous scores. With weights w(x,y) = (x-y)^2\n * (or |x-y| for linear) the formula collapses to:\n *\n *   κ_w = 1 − E_obs[w] / E_exp[w]\n *\n * where E_obs averages w over paired (a_i, b_i) and E_exp averages w over\n * the independent product distribution (sum_{i,j} w(a_i, b_j) / n^2).\n * The normalisation by (max-min)^2 in the integer version cancels in the\n * ratio, so we don't need it here. Generalises to N raters by averaging κ_w\n * over all rater pairs (mean pairwise weighted agreement).\n */\nfunction continuousWeightedKappa(rows: number[][], scheme: 'linear' | 'quadratic'): number {\n  if (rows.length === 0) return NaN\n  const raters = rows[0]!.length\n  if (raters < 2) return NaN\n  const wFn =\n    scheme === 'linear'\n      ? (x: number, y: number) => Math.abs(x - y)\n      : (x: number, y: number) => (x - y) ** 2\n  let sum = 0\n  let pairs = 0\n  for (let r1 = 0; r1 < raters; r1++) {\n    for (let r2 = r1 + 1; r2 < raters; r2++) {\n      const a = rows.map((row) => row[r1]!)\n      const b = rows.map((row) => row[r2]!)\n      const n = a.length\n      let obs = 0\n      for (let i = 0; i < n; i++) obs += wFn(a[i]!, b[i]!)\n      obs /= n\n      // Expected under independence: average of w over all i,j cross pairs.\n      let exp = 0\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) exp += wFn(a[i]!, b[j]!)\n      }\n      exp /= n * n\n      if (exp === 0) {\n        // Degenerate: at least one rater is constant. Convention: perfect\n        // agreement iff observed disagreement is also zero, else 0.\n        sum += obs === 0 ? 1 : 0\n      } else {\n        sum += 1 - obs / exp\n      }\n      pairs++\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\n/**\n * ICC(2,1) — two-way random effects, absolute agreement, single rater.\n *\n *   ICC(2,1) = (MSR − MSE) / (MSR + (k−1)·MSE + k·(MSC − MSE)/n)\n *\n * where MSR = between-rows MS, MSC = between-columns MS, MSE = residual MS,\n * n = rows (items), k = columns (raters).\n */\nfunction icc21(rows: number[][]): number {\n  const n = rows.length\n  if (n < 2) return NaN\n  const k = rows[0]!.length\n  if (k < 2) return NaN\n\n  // Row means.\n  const rowMeans = rows.map((row) => row.reduce((s, v) => s + v, 0) / k)\n  // Column means.\n  const colMeans = new Array(k).fill(0)\n  for (let j = 0; j < k; j++) {\n    let s = 0\n    for (let i = 0; i < n; i++) s += rows[i]![j]!\n    colMeans[j] = s / n\n  }\n  // Grand mean.\n  let grand = 0\n  for (let i = 0; i < n; i++) grand += rowMeans[i]!\n  grand /= n\n\n  let ssR = 0\n  for (let i = 0; i < n; i++) ssR += (rowMeans[i]! - grand) ** 2\n  ssR *= k\n  let ssC = 0\n  for (let j = 0; j < k; j++) ssC += (colMeans[j]! - grand) ** 2\n  ssC *= n\n  let ssT = 0\n  for (let i = 0; i < n; i++) {\n    for (let j = 0; j < k; j++) ssT += (rows[i]![j]! - grand) ** 2\n  }\n  const ssE = ssT - ssR - ssC\n\n  const dfR = n - 1\n  const dfC = k - 1\n  const dfE = (n - 1) * (k - 1)\n  const msR = ssR / dfR\n  const msC = ssC / dfC\n  const msE = dfE > 0 ? ssE / dfE : 0\n\n  const denom = msR + (k - 1) * msE + (k * (msC - msE)) / n\n  if (denom === 0) {\n    // Degenerate (all values equal): convention = 1 if rows identical,\n    // else 0. Identical rows ⇒ msR = 0 too, so msR − msE near 0.\n    return msR === 0 && msE === 0 ? 1 : 0\n  }\n  return (msR - msE) / denom\n}\n\n/** Average pairwise statistic over all rater pairs. */\nfunction avgPairwise(rows: number[][], fn: (a: number[], b: number[]) => number): number {\n  const k = rows[0]?.length ?? 0\n  if (k < 2) return NaN\n  let sum = 0\n  let pairs = 0\n  for (let i = 0; i < k; i++) {\n    for (let j = i + 1; j < k; j++) {\n      const a = rows.map((row) => row[i]!)\n      const b = rows.map((row) => row[j]!)\n      const r = fn(a, b)\n      if (Number.isFinite(r)) {\n        sum += r\n        pairs++\n      }\n    }\n  }\n  return pairs === 0 ? NaN : sum / pairs\n}\n\nfunction percentileBounds(ciLevel: number): [number, number] {\n  const tail = (1 - ciLevel) / 2\n  return [tail, 1 - tail]\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDA,SAAgB,eACd,QACA,WACmB;CACnB,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,SAAS,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC;CACnE,MAAM,IAAI,OAAO;CACjB,IAAI,IAAI,GACN,OAAO;EAAE;EAAG,SAAS;EAAK,OAAO;EAAK,KAAK;EAAK,YAAY,CAAC;CAAE;CAEjE,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CACpC,MAAM,SAAS,OAAO,KAAK,MAAM,EAAE,CAAC;CAUpC,OAAO;EAAE;EAAG,SATI,SAAS,QAAQ,MASf;EAAG,OARP,cAAc,OAAO,IAAI,KAAK,KAAK,GAAG,OAAO,IAAI,KAAK,KAAK,CAQhD;EAAG,KAPX,OAAO,KAAK,MAAM,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC,CAClC,CAAC,CAAC,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAMjB,YALnB,CAAC,GAAG,IAAI,QAAQ,CAAC,CAAC,CAC7B,QAAQ,GAAG,OAAO,OAAO,SAAS,EAAE,CAAC,CAAC,CAAC,CACvC,KAAK,CAAC,QAAQ,QAAQ;GAAE;GAAQ,OAAO,EAAE;GAAG,OAAO,EAAE;GAAG,OAAO,KAAK,IAAI,EAAE,IAAI,EAAE,CAAC;EAAE,EAAE,CAAC,CACtF,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CACjC,MAAM,GAAG,CACqC;CAAE;AACrD;;;;;AAeA,SAAgB,eAAe,QAAgD;CAC7E,MAAM,wBAAQ,IAAI,IAAiD;CACnE,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,OAAO,MAAM,IAAI,EAAE,MAAM,KAAK,CAAC;EACrC,IAAI,EAAE,qBAAqB,SAAS,KAAK,QAAQ,EAAE;OAC9C,IAAI,EAAE,qBAAqB,UAAU,KAAK,SAAS,EAAE;EAC1D,MAAM,IAAI,EAAE,QAAQ,IAAI;CAC1B;CACA,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,EAAE,OAAO,YAAY,MAAM,OAAO,GAC3C,IAAI,UAAU,KAAA,KAAa,WAAW,KAAA,GAAW,OAAO,KAAK,QAAQ,MAAM;CAE7E,IAAI,OAAO,WAAW,GAAG,OAAO;EAAE,UAAU;EAAG,GAAG;CAAE;CACpD,OAAO;EAAE,UAAU,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;EAAQ,GAAG,OAAO;CAAO;AACzF;AAQA,SAAgB,cACd,SACqB;CACrB,MAAM,IAAI,QAAQ;CAClB,IAAI,IAAI,GAAG,OAAO;EAAE,SAAS;EAAK;CAAE;CACpC,OAAO;EACL,SAAS,SACP,QAAQ,KAAK,MAAM,EAAE,SAAS,GAC9B,QAAQ,KAAK,MAAM,EAAE,KAAK,CAC5B;EACA;CACF;AACF;;;;;;AAeA,SAAgB,eACd,SACsB;CACtB,MAAM,MAAM,QAAQ,QAAQ,MAAM,EAAE,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,KAAK;CAChE,MAAM,OAAO,QAAQ,QAAQ,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,KAAK,MAAM,EAAE,KAAK;CAClE,IAAI,IAAI,WAAW,KAAK,KAAK,WAAW,GACtC,OAAO;EAAE,cAAc;EAAG,iBAAiB;EAAG,WAAW;EAAG,GAAG;CAAE;CACnE,MAAM,SAAS,IAAI,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI;CACpD,MAAM,UAAU,KAAK,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK;CACvD,OAAO;EACL,cAAc;EACd,iBAAiB;EACjB,WAAW,SAAS;EACpB,GAAG,QAAQ;CACb;AACF;;AAKA,SAAS,cAAc,GAAa,GAAqB;CACvD,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,GAAG,OAAO;CACpD,MAAM,MAAM,KAAK,IAAI,GAAG,GAAG,GAAG,CAAC;CAE/B,MAAM,IADM,KAAK,IAAI,GAAG,GAAG,GAAG,CAClB,IAAI,MAAM;CACtB,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,WAAuB,MAAM,KAAK,EAAE,QAAQ,EAAE,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;CACjF,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,MAAM,UAAU,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACnC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,KAAK,EAAE,KAAM;EACnB,MAAM,MAAM,SAAS;EACrB,IAAI,OAAO,IAAI,OAAO,KAAK;EAC3B,QAAQ,GAAG;EACX,QAAQ,GAAG;CACb;CACA,IAAI,MAAM;CACV,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,IAAI,MAAM,KAAK,IAAI,MAAM;EACpC,MAAM,WAAY,QAAQ,KAAK,QAAQ,KAAM,EAAE;EAC/C,OAAO,IAAI,SAAS,EAAE,CAAE;EACxB,OAAO,IAAI;CACb;CAEF,IAAI,QAAQ,GAAG,OAAO;CACtB,OAAO,IAAI,MAAM;AACnB;;;;;;;;AAqEA,SAAgB,oBACd,QACA,OAAmC,CAAC,GACf;CACrB,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,UAAU,KAAK,WAAW;CAChC,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,UAAU,KAAK,WAAW;CAEhC,MAAM,SAAS,OAAO,QAAQ,QAAQ,IAAI,UAAU,KAAK,IAAI,OAAO,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC;CAC7F,MAAM,SAAS,OAAO,EAAE,EAAE,UAAU;CAEpC,MAAM,QAAQ,OAAO,QAAQ,QAAQ,IAAI,WAAW,MAAM;CAC1D,MAAM,SAAS,MAAM;CAErB,IAAI,SAAS,KAAK,SAAS,GACzB,OAAO;EACL,eAAe;EACf,KAAK;EACL,SAAS;EACT,UAAU;EACV,IAAI;GAAE,KAAK,CAAC,KAAK,GAAG;GAAG,eAAe,CAAC,KAAK,GAAG;EAAE;EACjD,GAAG;EACH;CACF;CAGF,MAAM,QAAQ,wBAAwB,OAAO,OAAO;CACpD,MAAM,MAAM,MAAM,KAAK;CACvB,MAAM,UAAU,YAAY,OAAO,QAAQ;CAC3C,MAAM,WAAW,YAAY,OAAO,SAAS;CAE7C,MAAM,QAA0B,CAAC,KAAK,GAAG;CACzC,MAAM,UAA4B,CAAC,KAAK,GAAG;CAC3C,IAAI,YAAY,GAAG;EACjB,MAAM,MAAM,WAAW,IAAI;EAC3B,MAAM,OAAiB,CAAC;EACxB,MAAM,SAAmB,CAAC;EAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;GAClC,MAAM,SAAqB,IAAI,MAAM,MAAM;GAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAC1B,OAAO,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,MAAM;GAE7C,MAAM,OAAO,MAAM,MAAM;GACzB,MAAM,KAAK,wBAAwB,QAAQ,OAAO;GAClD,IAAI,OAAO,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI;GACzC,IAAI,OAAO,SAAS,EAAE,GAAG,OAAO,KAAK,EAAE;EACzC;EACA,MAAM,CAAC,IAAI,MAAM,iBAAiB,OAAO;EACzC,IAAI,KAAK,SAAS,GAAG;GACnB,KAAK,MAAM,GAAG,MAAM,IAAI,CAAC;GACzB,MAAM,KAAKA,qBAAS,MAAM,EAAE;GAC5B,MAAM,KAAKA,qBAAS,MAAM,EAAE;EAC9B;EACA,IAAI,OAAO,SAAS,GAAG;GACrB,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;GAC3B,QAAQ,KAAKA,qBAAS,QAAQ,EAAE;GAChC,QAAQ,KAAKA,qBAAS,QAAQ,EAAE;EAClC;CACF;CAEA,OAAO;EACL,eAAe;EACf;EACA;EACA;EACA,IAAI;GAAE,KAAK;GAAO,eAAe;EAAQ;EACzC,GAAG;EACH;CACF;AACF;;;;;AAkBA,SAAgB,yBACd,QACA,WACA,OAAmC,CAAC,GACP;CAC7B,MAAM,OAAO,eAAe,QAAQ,SAAS;CAC7C,MAAM,sBAAM,IAAI,IAAsC;CACtD,KAAK,MAAM,KAAK,QAAQ,IAAI,IAAI,EAAE,QAAQ;EAAE,GAAG,EAAE;EAAY,GAAG;CAAI,CAAC;CACrE,KAAK,MAAM,KAAK,WAAW;EACzB,MAAM,QAAQ,IAAI,IAAI,EAAE,MAAM;EAC9B,IAAI,OAAO,MAAM,IAAI,EAAE;CACzB;CACA,MAAM,OAAmB,CAAC;CAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,GACzB,IAAI,OAAO,SAAS,EAAE,CAAC,GAAG,KAAK,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;CAEhD,MAAM,YAAY,oBAAoB,MAAM,IAAI;CAChD,OAAO;EACL,GAAG;EACH,yBAAyB,UAAU;EACnC,KAAK,UAAU;EACf,UAAU,UAAU;EACpB,IAAI,UAAU;CAChB;AACF;;;;;;;;;;;;;AAgBA,SAAS,wBAAwB,MAAkB,QAAwC;CACzF,IAAI,KAAK,WAAW,GAAG,OAAO;CAC9B,MAAM,SAAS,KAAK,EAAE,CAAE;CACxB,IAAI,SAAS,GAAG,OAAO;CACvB,MAAM,MACJ,WAAW,YACN,GAAW,MAAc,KAAK,IAAI,IAAI,CAAC,KACvC,GAAW,OAAe,IAAI,MAAM;CAC3C,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,KAAK,GAAG,KAAK,QAAQ,MAC5B,KAAK,IAAI,KAAK,KAAK,GAAG,KAAK,QAAQ,MAAM;EACvC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,KAAK,KAAK,QAAQ,IAAI,GAAI;EACpC,MAAM,IAAI,EAAE;EACZ,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EACnD,OAAO;EAEP,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,OAAO,IAAI,EAAE,IAAK,EAAE,EAAG;EAErD,OAAO,IAAI;EACX,IAAI,QAAQ,GAGV,OAAO,QAAQ,IAAI,IAAI;OAEvB,OAAO,IAAI,MAAM;EAEnB;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;;;;;;;;;AAUA,SAAS,MAAM,MAA0B;CACvC,MAAM,IAAI,KAAK;CACf,IAAI,IAAI,GAAG,OAAO;CAClB,MAAM,IAAI,KAAK,EAAE,CAAE;CACnB,IAAI,IAAI,GAAG,OAAO;CAGlB,MAAM,WAAW,KAAK,KAAK,QAAQ,IAAI,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC;CAErE,MAAM,WAAW,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,KAAK,EAAE,CAAE;EAC1C,SAAS,KAAK,IAAI;CACpB;CAEA,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,SAAS,SAAS;CAC9C,SAAS;CAET,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,SAAS,KAAM,UAAU;CAC7D,OAAO;CACP,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,QAAQ,KAAK,EAAE,CAAE,KAAM,UAAU;CAE/D,MAAM,MAAM,MAAM,MAAM;CAExB,MAAM,MAAM,IAAI;CAChB,MAAM,MAAM,IAAI;CAChB,MAAM,OAAO,IAAI,MAAM,IAAI;CAC3B,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM;CAClB,MAAM,MAAM,MAAM,IAAI,MAAM,MAAM;CAElC,MAAM,QAAQ,OAAO,IAAI,KAAK,MAAO,KAAK,MAAM,OAAQ;CACxD,IAAI,UAAU,GAGZ,OAAO,QAAQ,KAAK,QAAQ,IAAI,IAAI;CAEtC,QAAQ,MAAM,OAAO;AACvB;;AAGA,SAAS,YAAY,MAAkB,IAAkD;CACvF,MAAM,IAAI,KAAK,EAAE,EAAE,UAAU;CAC7B,IAAI,IAAI,GAAG,OAAO;CAClB,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAG9B,MAAM,IAAI,GAFA,KAAK,KAAK,QAAQ,IAAI,EAEnB,GADH,KAAK,KAAK,QAAQ,IAAI,EAChB,CAAC;EACjB,IAAI,OAAO,SAAS,CAAC,GAAG;GACtB,OAAO;GACP;EACF;CACF;CAEF,OAAO,UAAU,IAAI,MAAM,MAAM;AACnC;AAEA,SAAS,iBAAiB,SAAmC;CAC3D,MAAM,QAAQ,IAAI,WAAW;CAC7B,OAAO,CAAC,MAAM,IAAI,IAAI;AACxB"}

package/dist/{judge-gate-DNcUrRFA.d.ts → judge-gate-CE7CQAgt.d.ts}

@@ -1,7 +1,7 @@
 import { a as JudgeError } from "./errors-DEE6u6ot.js";
-import { u as JudgeScore } from "./types-DBZ7keha.js";
+import { u as JudgeScore } from "./types-C02qtnG8.js";
 import { a as ContinuousCalibrationResult, i as ContinuousAgreementOptions, n as CandidateScore, o as GoldenItem, r as ContinuousAgreement, t as CalibrationResult } from "./judge-calibration-DFtEMlde.js";
-import { a as ComputedInterval } from "./ast-hI-vjW6J.js";
+import { t as ComputedInterval } from "./interval-ohuOJurX.js";
 //#region src/statistics/agreement-irr.d.ts
 /**
  * Inter-rater reliability — Krippendorff's α under the squared-difference
@@ -451,4 +451,4 @@ declare function snapshotFromJudgeAgreement(agreement: JudgeAgreement, options?:
 }): SentinelSnapshot;
 //#endregion
 export { SentinelThresholds as A, validateSentinelSnapshot as B, JudgeSentinelOptions as C, SentinelSetOptions as D, SentinelReport as E, inMemorySentinelStore as F, CorpusAgreementPerDimension as G, SeriesConvergenceResult as H, judgeSentinelReport as I, corpusInterRaterAgreement as J, CorpusAgreementReport as K, snapshotFromAgreement as L, SnapshotMeta as M, evalHealthStamp as N, SentinelSnapshot as O, fileSentinelStore as P, snapshotFromCalibration as R, EvalHealthStamp as S, SentinelMetrics as T, analyzeSeries as U, SeriesConvergenceOptions as V, CorpusAgreementOptions as W, interRaterReliability as X, corpusInterRaterAgreementFromJudgeScores as Y, assertJudgeMayGate as _, JudgeCalibrationSet as a, registerCalibrationSet as b, JudgeGateDecision as c, JudgeGateRefusedError as d, JudgeGateStatus as f, addCalibrationVerdicts as g, OwnerVerdict as h, JudgeAgreement as i, SentinelTrend as j, SentinelStore as k, JudgeGateInput as l, JudgeRunMeta as m, CalibrationMerge as n, JudgeConfusion as o, JudgeRun as p, CorpusScoreRecord as q, DEFAULT_JUDGE_GATE_POLICY as r, JudgeExampleAgreement as s, CalibrationExample as t, JudgeGatePolicy as u, judgeGateDecision as v, SentinelMetricName as w, snapshotFromJudgeAgreement as x, measureJudgeAgreement as y, snapshotFromSentinelSet as z };
-//# sourceMappingURL=judge-gate-DNcUrRFA.d.ts.map
+//# sourceMappingURL=judge-gate-CE7CQAgt.d.ts.map

package/dist/{judge-gate-DNcUrRFA.d.ts.map → judge-gate-CE7CQAgt.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"judge-gate-DNcUrRFA.d.ts","names":[],"sources":["../src/statistics/agreement-irr.ts","../src/series-convergence.ts","../src/meta-eval/sentinel.ts","../src/meta-eval/judge-gate.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;iBAyBgB,sBAAsB,aAAa;UA0ElC;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe,oCAAoC;EACnD;;EAEA;;EAEA;;UAGe;;EAEf,cAAc;;EAEd;;EAEA;;EAEA;;EAEA;;UAGe,+BAA+B;;;;;;EAM9C;;;;;;EAMA;;;;;;;;;;;;;;;;;;iBAmBc,0BACd,SAAS,qBACT,OAAM,yBACL;;;;;;;;;iBA0Ha,yCACd,aAAa;EAAQ;EAAgB,QAAQ;IAC7C,OAAM,yBACL;;;;;;;;;;;;;UCvRc;;EAEf;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;;EAEA;;EAEA;;iBAGc,cACd,kBACA,UAAS,2BACR;;;cCoBG;KAEM,6BAA6B;UAExB;;EAEf;;EAEA;;EAEA;;UAGe;;EAEf;EACA;;EAEA;;;;;;;EAOA,SAAS;;;UAIM;EACf;EACA;EACA;;;iBAcc,yBAAyB,UAAU,kBAAkB;;;;;;iBAiCrD,wBACd,QAAQ,oBAAoB,6BAC5B,MAAM,eACL;;;;;;;;iBAmBa,sBACd,QAAQ,wBAAwB,qBAChC,MAAM,eACL;UAYc;;EAEf;;;;;;;;;iBAUc,wBACd,QAAQ,kBACR,QAAQ,cACR,MAAM,cACN,UAAS,qBACR;UA4Cc;EACf,OAAO,UAAU,mBAAmB;;EAEpC,QAAQ,mBAAmB,QAAQ;;iBAGrB,sBAAsB,UAAS,qBAA0B;;;;;;;iBAqBzD,kBAAkB,eAAe;UA0ChC;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe;;EAEf;EACA,aAAa;;EAEb,cAAc;;UAGC;EACf;EACA,QAAQ;;EAER,OAAO;;EAEP;;EAEA;;EAEA;EACA;EACA;;UAGe;EACf,UAAU;EACV;EACA;;;;;;;EAOA;;iBAKc,oBACd,SAAS,oBACT,MAAM,uBACL;UA6Gc;EACf;EACA;;;;;;;;;;iBAWc,gBAAgB,QAAQ,iBAAiB;;;KChb7C;;UAGK;;EAEf;EACA,SAAS;;EAET;;EAEA;;EAEA;;EAEA;EACA;;UAGe;EACf;;EAEA;EACA,mBAAmB;;;;;;iBAuDL,uBAAuB,KAAK,sBAAsB;UAwBjD;EACf,KAAK;;EAEL;;EAEA;;EAEA;;;;;;;;iBASc,uBACd,KAAK,qBACL,mBAAmB,uBAClB;;UAkCc;EACf;;EAEA,SAAS;;EAET,mBAAmB;;UAGJ;EACf;;EAEA;EACA;EACA;;UAGe;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA,SAAS;EACT;;EAEA;;EAEA;;UAGe,uBAAuB;EACtC;;EAEA;;EAEA;;EAEA,iBAAiB,OAAO;EACxB;;EAEA;;;;;;EAMA;IAAmB;IAAgB;IAAgB,UAAU;;;;;;EAK7D;;EAEA;;EAEA;EACA,WAAW;EACX;;IAEE;;IAEA;;IAEA;;;EAGF,eAAe;;EAEf;;;;;;;iBAyBc,sBACd,KAAK,qBACL,eAAe,YACf,MAAM,eACL;UA+Gc;;;;;EAKf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,QAAQ;;cAGG,2BAA2B,SAAS;KAUrC;UAEK;EACf;EACA;EACA;;EAEA;EACA,QAAQ;;EAER;EACA,WAAW;EACX,QAAQ;;UAGO;EACf;;EAEA;;EAEA;;EAEA,WAAW;EACX;;EAEA,mBAAmB;EACnB,SAAS,QAAQ;;;iBAUH,kBAAkB,OAAO,iBAAiB;;cA2G7C,8BAA8B;WAChC,UAAU;EAEnB,YAAY,UAAU;;;iBASR,mBAAmB,UAAU;;;;;;;;iBAW7B,2BACd,WAAW,gBACX;EAAW,UAAU;IACpB"}
+{"version":3,"file":"judge-gate-CE7CQAgt.d.ts","names":[],"sources":["../src/statistics/agreement-irr.ts","../src/series-convergence.ts","../src/meta-eval/sentinel.ts","../src/meta-eval/judge-gate.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;iBAyBgB,sBAAsB,aAAa;UA0ElC;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe,oCAAoC;EACnD;;EAEA;;EAEA;;UAGe;;EAEf,cAAc;;EAEd;;EAEA;;EAEA;;EAEA;;UAGe,+BAA+B;;;;;;EAM9C;;;;;;EAMA;;;;;;;;;;;;;;;;;;iBAmBc,0BACd,SAAS,qBACT,OAAM,yBACL;;;;;;;;;iBA0Ha,yCACd,aAAa;EAAQ;EAAgB,QAAQ;IAC7C,OAAM,yBACL;;;;;;;;;;;;;UCvRc;;EAEf;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;;EAEA;;EAEA;;iBAGc,cACd,kBACA,UAAS,2BACR;;;cCoBG;KAEM,6BAA6B;UAExB;;EAEf;;EAEA;;EAEA;;UAGe;;EAEf;EACA;;EAEA;;;;;;;EAOA,SAAS;;;UAIM;EACf;EACA;EACA;;;iBAcc,yBAAyB,UAAU,kBAAkB;;;;;;iBAiCrD,wBACd,QAAQ,oBAAoB,6BAC5B,MAAM,eACL;;;;;;;;iBAmBa,sBACd,QAAQ,wBAAwB,qBAChC,MAAM,eACL;UAYc;;EAEf;;;;;;;;;iBAUc,wBACd,QAAQ,kBACR,QAAQ,cACR,MAAM,cACN,UAAS,qBACR;UA4Cc;EACf,OAAO,UAAU,mBAAmB;;EAEpC,QAAQ,mBAAmB,QAAQ;;iBAGrB,sBAAsB,UAAS,qBAA0B;;;;;;;iBAqBzD,kBAAkB,eAAe;UA0ChC;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe;;EAEf;EACA,aAAa;;EAEb,cAAc;;UAGC;EACf;EACA,QAAQ;;EAER,OAAO;;EAEP;;EAEA;;EAEA;EACA;EACA;;UAGe;EACf,UAAU;EACV;EACA;;;;;;;EAOA;;iBAKc,oBACd,SAAS,oBACT,MAAM,uBACL;UA6Gc;EACf;EACA;;;;;;;;;;iBAWc,gBAAgB,QAAQ,iBAAiB;;;KChb7C;;UAGK;;EAEf;EACA,SAAS;;EAET;;EAEA;;EAEA;;EAEA;EACA;;UAGe;EACf;;EAEA;EACA,mBAAmB;;;;;;iBAuDL,uBAAuB,KAAK,sBAAsB;UAwBjD;EACf,KAAK;;EAEL;;EAEA;;EAEA;;;;;;;;iBASc,uBACd,KAAK,qBACL,mBAAmB,uBAClB;;UAkCc;EACf;;EAEA,SAAS;;EAET,mBAAmB;;UAGJ;EACf;;EAEA;EACA;EACA;;UAGe;;EAEf;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA,SAAS;EACT;;EAEA;;EAEA;;UAGe,uBAAuB;EACtC;;EAEA;;EAEA;;EAEA,iBAAiB,OAAO;EACxB;;EAEA;;;;;;EAMA;IAAmB;IAAgB;IAAgB,UAAU;;;;;;EAK7D;;EAEA;;EAEA;EACA,WAAW;EACX;;IAEE;;IAEA;;IAEA;;;EAGF,eAAe;;EAEf;;;;;;;iBAyBc,sBACd,KAAK,qBACL,eAAe,YACf,MAAM,eACL;UA+Gc;;;;;EAKf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA,QAAQ;;cAGG,2BAA2B,SAAS;KAUrC;UAEK;EACf;EACA;EACA;;EAEA;EACA,QAAQ;;EAER;EACA,WAAW;EACX,QAAQ;;UAGO;EACf;;EAEA;;EAEA;;EAEA,WAAW;EACX;;EAEA,mBAAmB;EACnB,SAAS,QAAQ;;;iBAUH,kBAAkB,OAAO,iBAAiB;;cA2G7C,8BAA8B;WAChC,UAAU;EAEnB,YAAY,UAAU;;;iBASR,mBAAmB,UAAU;;;;;;;;iBAW7B,2BACd,WAAW,gBACX;EAAW,UAAU;IACpB"}

package/dist/{judge-gate-B1qYnkpi.js → judge-gate-iY9s4L44.js}

@@ -1,5 +1,5 @@
-import { i as JudgeError, s as ValidationError } from "./errors-Dngq5h35.js";
-import { r as computeInterval } from "./ast-DJ6Bc7ab.js";
+import { i as JudgeError, s as ValidationError } from "./errors-DVZiqS7K.js";
+import { t as computeInterval } from "./interval-CELpye1n.js";
 //#region src/series-convergence.ts
 function analyzeSeries(values, options = {}) {
 	const window = options.window ?? 5;
@@ -655,4 +655,4 @@ function snapshotFromJudgeAgreement(agreement, options = {}) {
 //#endregion
 export { analyzeSeries as _, judgeGateDecision as a, snapshotFromJudgeAgreement as c, inMemorySentinelStore as d, judgeSentinelReport as f, validateSentinelSnapshot as g, snapshotFromSentinelSet as h, assertJudgeMayGate as i, evalHealthStamp as l, snapshotFromCalibration as m, JudgeGateRefusedError as n, measureJudgeAgreement as o, snapshotFromAgreement as p, addCalibrationVerdicts as r, registerCalibrationSet as s, DEFAULT_JUDGE_GATE_POLICY as t, fileSentinelStore as u };
 
-//# sourceMappingURL=judge-gate-B1qYnkpi.js.map
+//# sourceMappingURL=judge-gate-iY9s4L44.js.map

package/dist/judge-gate-iY9s4L44.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"judge-gate-iY9s4L44.js","names":["parseIso"],"sources":["../src/series-convergence.ts","../src/meta-eval/sentinel.ts","../src/meta-eval/judge-gate.ts"],"sourcesContent":["/**\n * Series convergence — detects whether a sequence of scalar measurements\n * is stabilizing, drifting, or noisy. It reads drift *across* runs, e.g.\n * \"are my nightly eval scores stabilizing?\".\n *\n * Three signals:\n *   - stabilized: last K values have low variance (< epsilon) — done\n *   - drifting:   recent trend is monotonic and beyond noise — regressing or improving\n *   - noisy:      neither — keep iterating, but flag as untrustworthy for gating\n */\n\nexport interface SeriesConvergenceOptions {\n  /** Window size for \"recent\" analysis (default 5). */\n  window?: number\n  /** Coefficient-of-variation threshold below which the window is stabilized (default 0.05 = 5%). */\n  stableCv?: number\n  /** Minimum monotone run length to call drift (default 3). */\n  driftRun?: number\n}\n\nexport interface SeriesConvergenceResult {\n  state: 'stabilized' | 'drifting-up' | 'drifting-down' | 'noisy' | 'insufficient-data'\n  windowMean: number\n  windowCv: number\n  /** Longest monotonic run at the tail of the series (positive for up, negative for down). */\n  tailRun: number\n  /** True when n ≥ window AND windowCv ≤ stableCv. */\n  stable: boolean\n}\n\nexport function analyzeSeries(\n  values: number[],\n  options: SeriesConvergenceOptions = {},\n): SeriesConvergenceResult {\n  const window = options.window ?? 5\n  const stableCv = options.stableCv ?? 0.05\n  const driftRun = options.driftRun ?? 3\n\n  if (values.length < Math.max(2, Math.min(window, 3))) {\n    return { state: 'insufficient-data', windowMean: 0, windowCv: 0, tailRun: 0, stable: false }\n  }\n\n  const tail = values.slice(-window)\n  const mean = tail.reduce((a, b) => a + b, 0) / tail.length\n  const variance = tail.reduce((acc, v) => acc + (v - mean) ** 2, 0) / tail.length\n  const stdDev = Math.sqrt(variance)\n  const refMean = Math.abs(mean) > 1e-9 ? Math.abs(mean) : 1\n  const cv = stdDev / refMean\n  const stable = tail.length >= window && cv <= stableCv\n\n  // Tail monotonic run: count how many consecutive strictly-increasing (or decreasing)\n  // steps end at the final value.\n  let tailRun = 0\n  let direction: 1 | -1 | 0 = 0\n  for (let i = values.length - 1; i > 0; i--) {\n    const delta = values[i]! - values[i - 1]!\n    if (delta === 0) break\n    const dir = delta > 0 ? 1 : -1\n    if (direction === 0) direction = dir\n    if (dir !== direction) break\n    tailRun += dir\n  }\n\n  let state: SeriesConvergenceResult['state']\n  if (stable) {\n    state = 'stabilized'\n  } else if (Math.abs(tailRun) >= driftRun) {\n    state = tailRun > 0 ? 'drifting-up' : 'drifting-down'\n  } else {\n    state = 'noisy'\n  }\n\n  return { state, windowMean: mean, windowCv: cv, tailRun, stable }\n}\n","/**\n * Judge sentinel — eval trustworthiness as a continuously measured,\n * alarmed trend.\n *\n * Judges are models; models change underneath us; calibration decays.\n * This module composes three existing instruments into one loop:\n *\n *   snapshot — adapters turn real instrument outputs (`calibrateJudge` /\n *              `calibrateJudgeContinuous`, `corpusInterRaterAgreement` /\n *              `continuousAgreement`, a rerun sentinel golden set) into\n *              `SentinelSnapshot`s\n *   series   — `analyzeSeries` (src/series-convergence) classifies each\n *              judge×metric history as stabilized / drifting / noisy\n *   alarm    — `judgeSentinelReport` turns trends + thresholds into named\n *              alarms; `evalHealthStamp` is the tiny object a campaign\n *              attaches to its verdicts\n *\n * Alarm conditions:\n *   - convergence state `drifting-down` on any tracked metric\n *   - irr below `minIrr`\n *   - calibrationKappa / sentinelPassRate dropped vs the series baseline\n *     beyond `maxKappaDrop` / `maxSentinelDrop`\n *   - judge model changed with no post-change golden-grounded snapshot\n *     (the silent-upgrade trap: judges agreeing with each other after a\n *     model swap proves nothing — only re-measuring against gold does)\n *   - newest snapshot older than `staleAfterDays` relative to `asOf`\n *\n * Wire-in: run the snapshot adapters from a post-campaign hook or a\n * nightly job, append to a `SentinelStore`, then compute\n * `judgeSentinelReport(await store.history(), { asOf })` with `asOf` =\n * the campaign timestamp. Attach `evalHealthStamp(report)` to campaign\n * verdicts: an alarmed sentinel means every downstream verdict carries\n * an integrity warning until the judge is recalibrated.\n *\n * The module is clock-free — every timestamp (`at`, `asOf`) is\n * caller-supplied ISO-8601, so reports are reproducible.\n */\n\nimport { ValidationError } from '../errors'\nimport type {\n  CalibrationResult,\n  CandidateScore,\n  ContinuousAgreement,\n  ContinuousCalibrationResult,\n  GoldenItem,\n} from '../judge-calibration'\nimport {\n  analyzeSeries,\n  type SeriesConvergenceOptions,\n  type SeriesConvergenceResult,\n} from '../series-convergence'\nimport type { CorpusAgreementReport } from '../statistics'\n\nconst SENTINEL_METRIC_NAMES = ['irr', 'calibrationKappa', 'sentinelPassRate'] as const\n\nexport type SentinelMetricName = (typeof SENTINEL_METRIC_NAMES)[number]\n\nexport interface SentinelMetrics {\n  /** Inter-rater reliability — ICC(2,1) from agreement instruments. */\n  irr?: number\n  /** Weighted κ vs the human golden set (`calibrateJudge*`). */\n  calibrationKappa?: number\n  /** Fraction of a fixed sentinel golden set the judge still scores within tolerance. */\n  sentinelPassRate?: number\n}\n\nexport interface SentinelSnapshot {\n  /** Caller-supplied ISO-8601 timestamp — the module never reads a clock. */\n  at: string\n  judgeId: string\n  /** Exact model identity behind the judge (pin the full version string). */\n  judgeModel: string\n  /**\n   * Metrics measured at `at`. May be empty: an empty-metrics snapshot is a\n   * model-change marker — it records the new `judgeModel` immediately and\n   * the silent-upgrade alarm stays raised until a golden-grounded snapshot\n   * (calibrationKappa or sentinelPassRate) follows.\n   */\n  metrics: SentinelMetrics\n}\n\n/** Identity + timestamp the caller supplies alongside an instrument output. */\nexport interface SnapshotMeta {\n  at: string\n  judgeId: string\n  judgeModel: string\n}\n\nfunction parseIso(value: string, label: string): number {\n  const ms = typeof value === 'string' ? Date.parse(value) : NaN\n  if (!Number.isFinite(ms)) {\n    throw new ValidationError(\n      `judge-sentinel: ${label} is not a parseable ISO timestamp: ${JSON.stringify(value)}`,\n    )\n  }\n  return ms\n}\n\n/** Shape guard for snapshots crossing a boundary (store append, JSONL load, report input). */\nexport function validateSentinelSnapshot(snapshot: SentinelSnapshot, source = 'snapshot'): void {\n  parseIso(snapshot.at, `${source}.at`)\n  if (typeof snapshot.judgeId !== 'string' || snapshot.judgeId.length === 0) {\n    throw new ValidationError(`judge-sentinel: ${source}.judgeId must be a non-empty string`)\n  }\n  if (typeof snapshot.judgeModel !== 'string' || snapshot.judgeModel.length === 0) {\n    throw new ValidationError(`judge-sentinel: ${source}.judgeModel must be a non-empty string`)\n  }\n  if (snapshot.metrics === null || typeof snapshot.metrics !== 'object') {\n    throw new ValidationError(`judge-sentinel: ${source}.metrics must be an object (may be empty)`)\n  }\n  for (const [key, value] of Object.entries(snapshot.metrics)) {\n    if (!(SENTINEL_METRIC_NAMES as readonly string[]).includes(key)) {\n      // A typo'd key would silently never trend — reject instead.\n      throw new ValidationError(\n        `judge-sentinel: ${source}.metrics carries unknown key \"${key}\" — known: ${SENTINEL_METRIC_NAMES.join(', ')}`,\n      )\n    }\n    if (value !== undefined && !Number.isFinite(value)) {\n      throw new ValidationError(\n        `judge-sentinel: ${source}.metrics.${key} is not a finite number: ${String(value)}`,\n      )\n    }\n  }\n}\n\n// ── Snapshot adapters — real instrument output → SentinelSnapshot ───\n\n/**\n * From `calibrateJudge` / `calibrateJudgeContinuous` output. Prefers the\n * un-rounded continuous κ_w when the report carries one (integer κ\n * discards information for [0,1] judges).\n */\nexport function snapshotFromCalibration(\n  report: CalibrationResult | ContinuousCalibrationResult,\n  meta: SnapshotMeta,\n): SentinelSnapshot {\n  const kappa = 'weightedKappaContinuous' in report ? report.weightedKappaContinuous : report.kappa\n  if (!Number.isFinite(kappa)) {\n    throw new ValidationError(\n      `snapshotFromCalibration: κ is not finite (n=${report.n}) — calibrate against ≥2 joined golden items before snapshotting`,\n    )\n  }\n  const snapshot: SentinelSnapshot = { ...meta, metrics: { calibrationKappa: kappa } }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n\n/**\n * From `corpusInterRaterAgreement` (statistics.ts) or `continuousAgreement`\n * (judge-calibration.ts) output. IRR = ICC(2,1) — the reliability\n * coefficient both instruments compute. For ensemble-level agreement,\n * `meta.judgeId` names the ensemble and `meta.judgeModel` pins its\n * composition (e.g. a joined list of member model strings).\n */\nexport function snapshotFromAgreement(\n  report: CorpusAgreementReport | ContinuousAgreement,\n  meta: SnapshotMeta,\n): SentinelSnapshot {\n  const irr = 'overallIcc' in report ? report.overallIcc : report.icc\n  if (!Number.isFinite(irr)) {\n    throw new ValidationError(\n      'snapshotFromAgreement: ICC is not finite — agreement needs ≥2 raters and ≥2 complete items',\n    )\n  }\n  const snapshot: SentinelSnapshot = { ...meta, metrics: { irr } }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n\nexport interface SentinelSetOptions {\n  /** Max |judge − human| for an item to count as passed. Default 0.1 (tuned for [0,1] scores). */\n  tolerance?: number\n}\n\n/**\n * From a rerun of a fixed sentinel golden set: the same `GoldenItem`s the\n * judge was originally calibrated on, re-scored periodically. Pass rate =\n * fraction of joined items where the judge stays within `tolerance` of the\n * human score. Items the judge didn't score are excluded from the\n * denominator; zero joined items is an error, not a 0% pass rate.\n */\nexport function snapshotFromSentinelSet(\n  scores: CandidateScore[],\n  golden: GoldenItem[],\n  meta: SnapshotMeta,\n  options: SentinelSetOptions = {},\n): SentinelSnapshot {\n  const tolerance = options.tolerance ?? 0.1\n  if (!Number.isFinite(tolerance) || tolerance < 0) {\n    throw new ValidationError(\n      `snapshotFromSentinelSet: tolerance must be a finite number ≥ 0, got ${tolerance}`,\n    )\n  }\n  const goldenById = new Map<string, number>()\n  for (const item of golden) {\n    if (!Number.isFinite(item.humanScore)) {\n      throw new ValidationError(\n        `snapshotFromSentinelSet: golden item \"${item.itemId}\" has a non-finite humanScore`,\n      )\n    }\n    if (goldenById.has(item.itemId)) {\n      throw new ValidationError(`snapshotFromSentinelSet: duplicate golden itemId \"${item.itemId}\"`)\n    }\n    goldenById.set(item.itemId, item.humanScore)\n  }\n  let joined = 0\n  let passed = 0\n  for (const s of scores) {\n    const human = goldenById.get(s.itemId)\n    if (human === undefined) continue\n    if (!Number.isFinite(s.score)) {\n      throw new ValidationError(\n        `snapshotFromSentinelSet: judge score for item \"${s.itemId}\" is not finite`,\n      )\n    }\n    joined++\n    if (Math.abs(s.score - human) <= tolerance) passed++\n  }\n  if (joined === 0) {\n    throw new ValidationError(\n      'snapshotFromSentinelSet: no judge scores joined the golden set — itemIds mismatch or empty sentinel run',\n    )\n  }\n  const snapshot: SentinelSnapshot = { ...meta, metrics: { sentinelPassRate: passed / joined } }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n\n// ── Persistence ──────────────────────────────────────────────────────\n\nexport interface SentinelStore {\n  append(snapshot: SentinelSnapshot): Promise<void>\n  /** All snapshots (optionally for one judge), in append order. */\n  history(judgeId?: string): Promise<SentinelSnapshot[]>\n}\n\nexport function inMemorySentinelStore(initial: SentinelSnapshot[] = []): SentinelStore {\n  for (const s of initial) validateSentinelSnapshot(s)\n  const items = initial.map((s) => ({ ...s, metrics: { ...s.metrics } }))\n  return {\n    async append(snapshot) {\n      validateSentinelSnapshot(snapshot)\n      items.push({ ...snapshot, metrics: { ...snapshot.metrics } })\n    },\n    async history(judgeId) {\n      const all = items.map((s) => ({ ...s, metrics: { ...s.metrics } }))\n      return judgeId === undefined ? all : all.filter((s) => s.judgeId === judgeId)\n    },\n  }\n}\n\n/**\n * JSONL store — one snapshot per line, appended atomically per call.\n * A corrupt or shape-invalid line is a loud error naming the file and\n * line number: a sentinel history that silently drops records would\n * defeat the drift detection it exists to provide.\n */\nexport function fileSentinelStore(path: string): SentinelStore {\n  return {\n    async append(snapshot) {\n      validateSentinelSnapshot(snapshot)\n      const fs = await import('node:fs/promises')\n      const pathMod = await import('node:path')\n      await fs.mkdir(pathMod.dirname(path), { recursive: true })\n      await fs.appendFile(path, `${JSON.stringify(snapshot)}\\n`, 'utf8')\n    },\n    async history(judgeId) {\n      const fs = await import('node:fs/promises')\n      let raw: string\n      try {\n        raw = await fs.readFile(path, 'utf8')\n      } catch (err) {\n        if ((err as NodeJS.ErrnoException).code === 'ENOENT') return []\n        throw err\n      }\n      const lines = raw.split('\\n')\n      const snapshots: SentinelSnapshot[] = []\n      for (let i = 0; i < lines.length; i++) {\n        const line = lines[i]!\n        if (line.trim().length === 0) continue\n        let parsed: unknown\n        try {\n          parsed = JSON.parse(line)\n        } catch (err) {\n          throw new ValidationError(\n            `judge-sentinel: store at ${path} has a corrupt JSONL line ${i + 1}: ${(err as Error).message}`,\n          )\n        }\n        const snapshot = parsed as SentinelSnapshot\n        validateSentinelSnapshot(snapshot, `${path}:${i + 1}`)\n        snapshots.push(snapshot)\n      }\n      return judgeId === undefined ? snapshots : snapshots.filter((s) => s.judgeId === judgeId)\n    },\n  }\n}\n\n// ── Trend report ─────────────────────────────────────────────────────\n\nexport interface SentinelThresholds {\n  /** Floor for irr — below it the judge ensemble is unreliable regardless of trend. Default 0.6. */\n  minIrr?: number\n  /** Max tolerated calibrationKappa drop vs the series baseline. Default 0.15. */\n  maxKappaDrop?: number\n  /** Max tolerated sentinelPassRate drop vs the series baseline. Default 0.1. */\n  maxSentinelDrop?: number\n  /** Newest snapshot older than this (days, vs asOf) = the sentinel itself went blind. Default 30. */\n  staleAfterDays?: number\n}\n\nexport interface JudgeSentinelOptions {\n  /** Caller-supplied ISO timestamp staleness is measured against. */\n  asOf: string\n  thresholds?: SentinelThresholds\n  /** Forwarded to `analyzeSeries` (window, stableCv, driftRun). */\n  convergence?: SeriesConvergenceOptions\n}\n\nexport interface SentinelTrend {\n  judgeId: string\n  metric: SentinelMetricName\n  /** Verbatim `analyzeSeries` state for this judge×metric history. */\n  state: SeriesConvergenceResult['state']\n  /** Newest value in the series. */\n  current: number\n  /** Oldest value in the series — the reference the drop thresholds compare against. */\n  baseline: number\n  /** current − baseline (signed; negative = decayed). */\n  drift: number\n  alarmed: boolean\n  reason?: string\n}\n\nexport interface SentinelReport {\n  perJudge: SentinelTrend[]\n  alarms: string[]\n  healthy: boolean\n  /**\n   * `judgeId:metric` pairs with too few snapshots for the convergence\n   * machine. Named, not counted — a blind spot you can't see is a blind\n   * spot you won't fix. Floor/drop checks still apply to thin series, so\n   * insufficient history alone never masks an alarm.\n   */\n  insufficientHistory: string[]\n}\n\nconst MS_PER_DAY = 86_400_000\n\nexport function judgeSentinelReport(\n  history: SentinelSnapshot[],\n  opts: JudgeSentinelOptions,\n): SentinelReport {\n  const asOfMs = parseIso(opts.asOf, 'asOf')\n  const minIrr = opts.thresholds?.minIrr ?? 0.6\n  const maxKappaDrop = opts.thresholds?.maxKappaDrop ?? 0.15\n  const maxSentinelDrop = opts.thresholds?.maxSentinelDrop ?? 0.1\n  const staleAfterDays = opts.thresholds?.staleAfterDays ?? 30\n\n  const byJudge = new Map<string, Array<SentinelSnapshot & { atMs: number }>>()\n  for (const snapshot of history) {\n    validateSentinelSnapshot(snapshot)\n    const atMs = parseIso(snapshot.at, `snapshot.at (judge \"${snapshot.judgeId}\")`)\n    const arr = byJudge.get(snapshot.judgeId) ?? []\n    arr.push({ ...snapshot, atMs })\n    byJudge.set(snapshot.judgeId, arr)\n  }\n\n  const perJudge: SentinelTrend[] = []\n  const alarms: string[] = []\n  const insufficientHistory: string[] = []\n\n  for (const judgeId of [...byJudge.keys()].sort()) {\n    const snaps = byJudge.get(judgeId)!.sort((a, b) => a.atMs - b.atMs)\n    const newest = snaps[snaps.length - 1]!\n\n    const ageDays = (asOfMs - newest.atMs) / MS_PER_DAY\n    if (ageDays > staleAfterDays) {\n      alarms.push(\n        `judge \"${judgeId}\": stale — newest snapshot ${newest.at} is ${ageDays.toFixed(1)}d old vs asOf (limit ${staleAfterDays}d)`,\n      )\n    }\n\n    // Silent-upgrade trap: only the latest model change matters for current\n    // trust, and only golden-grounded metrics clear it — irr alone proves\n    // judges still agree with each other, not that they're still right.\n    let changeIdx = -1\n    for (let i = 1; i < snaps.length; i++) {\n      if (snaps[i]!.judgeModel !== snaps[i - 1]!.judgeModel) changeIdx = i\n    }\n    if (changeIdx >= 0) {\n      const recalibrated = snaps\n        .slice(changeIdx)\n        .some(\n          (s) =>\n            Number.isFinite(s.metrics.calibrationKappa) ||\n            Number.isFinite(s.metrics.sentinelPassRate),\n        )\n      if (!recalibrated) {\n        alarms.push(\n          `judge \"${judgeId}\": model changed \"${snaps[changeIdx - 1]!.judgeModel}\" → \"${snaps[changeIdx]!.judgeModel}\" at ${snaps[changeIdx]!.at} with no post-change calibration snapshot — silent-upgrade trap; rerun calibrateJudge or the sentinel set against the new model`,\n        )\n      }\n    }\n\n    for (const metric of SENTINEL_METRIC_NAMES) {\n      const values = snaps\n        .filter((s) => typeof s.metrics[metric] === 'number')\n        .map((s) => s.metrics[metric]!)\n      if (values.length === 0) continue\n\n      const convergence = analyzeSeries(values, opts.convergence)\n      if (convergence.state === 'insufficient-data')\n        insufficientHistory.push(`${judgeId}:${metric}`)\n\n      const current = values[values.length - 1]!\n      const baseline = values[0]!\n      const drift = current - baseline\n      const reasons: string[] = []\n      if (convergence.state === 'drifting-down') {\n        reasons.push(\n          `convergence state drifting-down (tail run ${convergence.tailRun}, window mean ${convergence.windowMean.toFixed(3)})`,\n        )\n      }\n      if (metric === 'irr' && current < minIrr) {\n        reasons.push(`irr ${current.toFixed(3)} below floor ${minIrr}`)\n      }\n      if (metric === 'calibrationKappa' && baseline - current > maxKappaDrop) {\n        reasons.push(\n          `calibrationKappa dropped ${(baseline - current).toFixed(3)} from baseline ${baseline.toFixed(3)} (limit ${maxKappaDrop})`,\n        )\n      }\n      if (metric === 'sentinelPassRate' && baseline - current > maxSentinelDrop) {\n        reasons.push(\n          `sentinelPassRate dropped ${(baseline - current).toFixed(3)} from baseline ${baseline.toFixed(3)} (limit ${maxSentinelDrop})`,\n        )\n      }\n\n      const alarmed = reasons.length > 0\n      const trend: SentinelTrend = {\n        judgeId,\n        metric,\n        state: convergence.state,\n        current,\n        baseline,\n        drift,\n        alarmed,\n      }\n      if (alarmed) {\n        trend.reason = reasons.join('; ')\n        alarms.push(`judge \"${judgeId}\" ${metric}: ${trend.reason}`)\n      }\n      perJudge.push(trend)\n    }\n  }\n\n  return { perJudge, alarms, healthy: alarms.length === 0, insufficientHistory }\n}\n\n// ── Verdict stamp ────────────────────────────────────────────────────\n\nexport interface EvalHealthStamp {\n  healthy: boolean\n  alarms: string[]\n}\n\n/**\n * The object a campaign attaches to its verdicts. Compute it from the\n * sentinel report in a post-campaign hook (or a nightly job feeding the\n * next day's campaigns) and store it alongside the verdict payload.\n * `healthy: false` means the judges that produced those verdicts have an\n * unresolved drift / decay / silent-upgrade / staleness alarm — treat the\n * verdicts as carrying an integrity warning until recalibration clears it.\n */\nexport function evalHealthStamp(report: SentinelReport): EvalHealthStamp {\n  return { healthy: report.healthy, alarms: [...report.alarms] }\n}\n","/**\n * Judge calibration gate: a judge may gate only while its measured agreement\n * with its owner's verdicts holds.\n *\n * A judge (a model judge or a deterministic grader) registers a calibration\n * set: items its owner has decided, each verdict with its provenance. A\n * calibration run replays the judge on those items, once or several times, and\n * `measureJudgeAgreement` reports how often it reached the owner's verdict\n * (accuracy, and Cohen's κ for the pass/fail pair), how much its own verdict\n * moves between runs and between samples, and where it disagreed.\n *\n * `judgeGateDecision` turns that report into the one decision a consumer acts\n * on. A judge either decides (`decides: 'verdict'`, the default: it passes and\n * blocks, so it must reach the owner's verdict) or only vetoes\n * (`decides: 'veto'`: a necessary-condition check such as a copy or policy\n * check, which blocks but never passes work on its own; owners also reject\n * for reasons it does not cover, so its error is blocking what they approved).\n * It refuses when the judge has no measured agreement, too few decided\n * items of either verdict, a report measured on a different model or rubric\n * than the one the judge now runs, a report older than the policy allows,\n * agreement below the policy floors, or an alarmed drift history. A refused\n * judge's verdict is advisory: the consumer reports it but does not let it\n * pass or block anything.\n *\n * Drift is the judge sentinel (`./sentinel`): `snapshotFromJudgeAgreement`\n * records accuracy as `sentinelPassRate` and κ as `calibrationKappa`, so each\n * calibration run appends one snapshot to a `SentinelStore` and the gate reads\n * the alarms `judgeSentinelReport` raises over that history.\n *\n * Every timestamp is caller-supplied ISO-8601, so decisions are reproducible.\n */\n\nimport { JudgeError, ValidationError } from '../errors'\nimport { type ComputedInterval, computeInterval } from '../experiment/ast/interval'\nimport {\n  judgeSentinelReport,\n  type SentinelSnapshot,\n  type SentinelThresholds,\n  validateSentinelSnapshot,\n} from './sentinel'\n\nexport type OwnerVerdict = 'pass' | 'fail'\n\n/** One item the owner decided, with where that decision is recorded. */\nexport interface CalibrationExample {\n  /** Stable id of the decided item; a judge run names it in `exampleId`. */\n  id: string\n  verdict: OwnerVerdict\n  /** The person whose verdict this is. Never a model. */\n  labeledBy: string\n  /** ISO-8601 time the verdict was given. */\n  labeledAt: string\n  /** Where the verdict is recorded, e.g. `gtm:asset_decision:<id>`. */\n  source: string\n  /** What the owner judged (an image digest, a run id), so a replay judges the same thing. */\n  evidenceRef?: string\n  note?: string\n}\n\nexport interface JudgeCalibrationSet {\n  judgeId: string\n  /** Whose verdicts the judge stands in for. */\n  owner: string\n  examples: readonly CalibrationExample[]\n}\n\nfunction parseIso(value: unknown, label: string): number {\n  const ms = typeof value === 'string' ? Date.parse(value) : Number.NaN\n  if (!Number.isFinite(ms)) {\n    throw new ValidationError(\n      `judge-gate: ${label} is not a parseable ISO timestamp: ${JSON.stringify(value)}`,\n    )\n  }\n  return ms\n}\n\nfunction requireText(value: unknown, label: string): string {\n  if (typeof value !== 'string' || value.trim().length === 0) {\n    throw new ValidationError(`judge-gate: ${label} must be a non-empty string`)\n  }\n  return value\n}\n\nfunction requireVerdict(value: unknown, label: string): OwnerVerdict {\n  if (value !== 'pass' && value !== 'fail') {\n    throw new ValidationError(\n      `judge-gate: ${label} must be 'pass' or 'fail', got ${JSON.stringify(value)}`,\n    )\n  }\n  return value\n}\n\nfunction checkExample(example: CalibrationExample, label: string): CalibrationExample {\n  if (example === null || typeof example !== 'object') {\n    throw new ValidationError(`judge-gate: ${label} must be an object`)\n  }\n  requireText(example.id, `${label}.id`)\n  requireVerdict(example.verdict, `${label}.verdict`)\n  requireText(example.labeledBy, `${label}.labeledBy`)\n  parseIso(example.labeledAt, `${label}.labeledAt`)\n  requireText(example.source, `${label}.source`)\n  if (example.evidenceRef !== undefined) requireText(example.evidenceRef, `${label}.evidenceRef`)\n  const copy: CalibrationExample = {\n    id: example.id,\n    verdict: example.verdict,\n    labeledBy: example.labeledBy,\n    labeledAt: example.labeledAt,\n    source: example.source,\n  }\n  if (example.evidenceRef !== undefined) copy.evidenceRef = example.evidenceRef\n  if (example.note !== undefined) copy.note = example.note\n  return copy\n}\n\n/**\n * Validate a calibration set and return a normalized copy ordered by example\n * id. Every verdict needs its person, time and source; ids are unique.\n */\nexport function registerCalibrationSet(set: JudgeCalibrationSet): JudgeCalibrationSet {\n  if (set === null || typeof set !== 'object') {\n    throw new ValidationError('judge-gate: calibration set must be an object')\n  }\n  const judgeId = requireText(set.judgeId, 'calibration set judgeId')\n  const owner = requireText(set.owner, `calibration set \"${judgeId}\" owner`)\n  if (!Array.isArray(set.examples)) {\n    throw new ValidationError(`judge-gate: calibration set \"${judgeId}\" examples must be an array`)\n  }\n  const seen = new Set<string>()\n  const examples = set.examples.map((example, index) => {\n    const checked = checkExample(example, `calibration set \"${judgeId}\" example ${index}`)\n    if (seen.has(checked.id)) {\n      throw new ValidationError(\n        `judge-gate: calibration set \"${judgeId}\" has duplicate example id \"${checked.id}\"`,\n      )\n    }\n    seen.add(checked.id)\n    return checked\n  })\n  examples.sort((a, b) => (a.id < b.id ? -1 : a.id > b.id ? 1 : 0))\n  return { judgeId, owner, examples }\n}\n\nexport interface CalibrationMerge {\n  set: JudgeCalibrationSet\n  /** Ids that joined the set. */\n  added: string[]\n  /** Ids whose verdict a later decision replaced. */\n  superseded: string[]\n  /** Ids whose incoming verdict was already recorded, or older than the recorded one. */\n  unchanged: string[]\n}\n\n/**\n * Join new owner verdicts to a set. A verdict already recorded from the same\n * source is unchanged, so ingestion can rerun. A later verdict on an item\n * replaces an earlier one: the owner changed their mind, and the set keeps\n * what they decided last.\n */\nexport function addCalibrationVerdicts(\n  set: JudgeCalibrationSet,\n  verdicts: readonly CalibrationExample[],\n): CalibrationMerge {\n  const base = registerCalibrationSet(set)\n  const byId = new Map(base.examples.map((example) => [example.id, example]))\n  const added: string[] = []\n  const superseded: string[] = []\n  const unchanged: string[] = []\n  for (const [index, verdict] of verdicts.entries()) {\n    const incoming = checkExample(verdict, `incoming verdict ${index} for \"${base.judgeId}\"`)\n    const current = byId.get(incoming.id)\n    if (!current) {\n      byId.set(incoming.id, incoming)\n      added.push(incoming.id)\n      continue\n    }\n    const sameDecision = current.source === incoming.source && current.verdict === incoming.verdict\n    if (\n      sameDecision ||\n      parseIso(incoming.labeledAt, 'labeledAt') <= parseIso(current.labeledAt, 'labeledAt')\n    ) {\n      unchanged.push(incoming.id)\n      continue\n    }\n    byId.set(incoming.id, incoming)\n    superseded.push(incoming.id)\n  }\n  return {\n    set: registerCalibrationSet({ ...base, examples: [...byId.values()] }),\n    added,\n    superseded,\n    unchanged,\n  }\n}\n\n/** One gate decision the judge made on a calibration example. */\nexport interface JudgeRun {\n  exampleId: string\n  /** The judge's decision after its own sample aggregation (median, majority). */\n  verdict: OwnerVerdict\n  /** The per-sample verdicts behind that decision, when the judge samples. */\n  samples?: readonly OwnerVerdict[]\n}\n\nexport interface JudgeRunMeta {\n  judgeId: string\n  /** Exact model identity, or `deterministic` for a grader without one. */\n  judgeModel: string\n  rubricVersion: string\n  measuredAt: string\n}\n\nexport interface JudgeConfusion {\n  /** Judge pass, owner pass. */\n  truePass: number\n  /** Judge fail, owner fail. */\n  trueFail: number\n  /** Judge pass, owner fail: the judge let through what the owner rejected. */\n  falsePass: number\n  /** Judge fail, owner pass: the judge blocked what the owner accepted. */\n  falseFail: number\n}\n\nexport interface JudgeExampleAgreement {\n  id: string\n  verdict: OwnerVerdict\n  runs: number\n  /** Share of runs that passed. */\n  passRate: number\n  /** Share of runs that reached the owner's verdict. */\n  agreement: number\n}\n\nexport interface JudgeAgreement extends JudgeRunMeta {\n  owner: string\n  /** Examples in the calibration set. */\n  examples: number\n  /** Examples the judge ran on at least once. */\n  judged: number\n  /** Judged examples per owner verdict. */\n  judgedByVerdict: Record<OwnerVerdict, number>\n  runs: number\n  /** Runs that reached the owner's verdict, over all runs; null with no runs. */\n  accuracy: number | null\n  /**\n   * Exact (Clopper-Pearson) 95% interval for the share of judged examples on\n   * which every run reached the owner's verdict. Examples, not runs, are the\n   * independent units.\n   */\n  exampleAccuracy: { agreed: number; judged: number; interval: ComputedInterval } | null\n  /**\n   * Cohen's κ between the judge and the owner over runs. Null when undefined:\n   * no runs, or both sides used a single verdict.\n   */\n  kappa: number | null\n  /** Runs that failed what the owner passed, over runs on owner passes; null with none. A veto judge is held to this. */\n  falseFailRate: number | null\n  /** Runs that failed what the owner failed, over runs on owner fails; null with none. */\n  catchRate: number | null\n  confusion: JudgeConfusion\n  variance: {\n    /** Mean over judged examples of p(1 − p), p the example's run pass rate. 0 = no run changed its mind. */\n    betweenRuns: number | null\n    /** Mean over runs that reported samples of p(1 − p) across those samples; null when none did. */\n    withinRun: number | null\n    /** Examples whose runs disagree with each other. */\n    unstable: string[]\n  }\n  /** Examples with at least one run against the owner, least agreement first. */\n  disagreements: JudgeExampleAgreement[]\n  /** Examples without any run. */\n  unjudged: string[]\n}\n\nfunction bernoulliVariance(passes: number, n: number): number {\n  const p = passes / n\n  return p * (1 - p)\n}\n\n/** Cohen's κ for two raters over a binary pass/fail table. */\nfunction binaryKappa(confusion: JudgeConfusion): number | null {\n  const n = confusion.truePass + confusion.trueFail + confusion.falsePass + confusion.falseFail\n  if (n === 0) return null\n  const observed = (confusion.truePass + confusion.trueFail) / n\n  const judgePass = (confusion.truePass + confusion.falsePass) / n\n  const ownerPass = (confusion.truePass + confusion.falseFail) / n\n  const expected = judgePass * ownerPass + (1 - judgePass) * (1 - ownerPass)\n  if (expected === 1) return null\n  return (observed - expected) / (1 - expected)\n}\n\n/**\n * Agreement between a judge's runs and the owner's verdicts on one\n * calibration set. A run that names an example outside the set is an error:\n * a silently dropped run would overstate agreement.\n */\nexport function measureJudgeAgreement(\n  set: JudgeCalibrationSet,\n  runs: readonly JudgeRun[],\n  meta: JudgeRunMeta,\n): JudgeAgreement {\n  const registered = registerCalibrationSet(set)\n  if (meta.judgeId !== registered.judgeId) {\n    throw new ValidationError(\n      `judge-gate: runs are for judge \"${meta.judgeId}\" but the set belongs to \"${registered.judgeId}\"`,\n    )\n  }\n  requireText(meta.judgeModel, 'judgeModel')\n  requireText(meta.rubricVersion, 'rubricVersion')\n  parseIso(meta.measuredAt, 'measuredAt')\n  const byId = new Map(registered.examples.map((example) => [example.id, example]))\n  const runsById = new Map<string, JudgeRun[]>()\n  const confusion: JudgeConfusion = { truePass: 0, trueFail: 0, falsePass: 0, falseFail: 0 }\n  const withinRun: number[] = []\n  for (const [index, run] of runs.entries()) {\n    const example = byId.get(run?.exampleId)\n    if (!example) {\n      throw new ValidationError(\n        `judge-gate: run ${index} names example ${JSON.stringify(run?.exampleId)}, which is not in \"${registered.judgeId}\"'s calibration set`,\n      )\n    }\n    const verdict = requireVerdict(run.verdict, `run ${index} verdict`)\n    if (run.samples !== undefined) {\n      if (!Array.isArray(run.samples) || run.samples.length === 0) {\n        throw new ValidationError(`judge-gate: run ${index} samples must be a non-empty array`)\n      }\n      const samples = run.samples.map((sample, s) =>\n        requireVerdict(sample, `run ${index} sample ${s}`),\n      )\n      withinRun.push(\n        bernoulliVariance(samples.filter((sample) => sample === 'pass').length, samples.length),\n      )\n    }\n    const list = runsById.get(example.id) ?? []\n    list.push({ ...run, verdict })\n    runsById.set(example.id, list)\n    if (verdict === 'pass') {\n      if (example.verdict === 'pass') confusion.truePass++\n      else confusion.falsePass++\n    } else if (example.verdict === 'fail') confusion.trueFail++\n    else confusion.falseFail++\n  }\n\n  const perExample: JudgeExampleAgreement[] = []\n  const unjudged: string[] = []\n  const judgedByVerdict: Record<OwnerVerdict, number> = { pass: 0, fail: 0 }\n  for (const example of registered.examples) {\n    const list = runsById.get(example.id)\n    if (!list) {\n      unjudged.push(example.id)\n      continue\n    }\n    judgedByVerdict[example.verdict]++\n    const passes = list.filter((run) => run.verdict === 'pass').length\n    perExample.push({\n      id: example.id,\n      verdict: example.verdict,\n      runs: list.length,\n      passRate: passes / list.length,\n      agreement: list.filter((run) => run.verdict === example.verdict).length / list.length,\n    })\n  }\n\n  const total = runs.length\n  const agreedRuns = confusion.truePass + confusion.trueFail\n  const agreedExamples = perExample.filter((example) => example.agreement === 1).length\n  const mean = (values: readonly number[]) =>\n    values.length === 0 ? null : values.reduce((sum, value) => sum + value, 0) / values.length\n  return {\n    ...meta,\n    owner: registered.owner,\n    examples: registered.examples.length,\n    judged: perExample.length,\n    judgedByVerdict,\n    runs: total,\n    accuracy: total === 0 ? null : agreedRuns / total,\n    exampleAccuracy:\n      perExample.length === 0\n        ? null\n        : {\n            agreed: agreedExamples,\n            judged: perExample.length,\n            interval: computeInterval(\n              { kind: 'clopper-pearson', level: 0.95 },\n              { kind: 'binomial', successes: agreedExamples, trials: perExample.length },\n            ),\n          },\n    kappa: binaryKappa(confusion),\n    falseFailRate:\n      confusion.truePass + confusion.falseFail === 0\n        ? null\n        : confusion.falseFail / (confusion.truePass + confusion.falseFail),\n    catchRate:\n      confusion.trueFail + confusion.falsePass === 0\n        ? null\n        : confusion.trueFail / (confusion.trueFail + confusion.falsePass),\n    confusion,\n    variance: {\n      betweenRuns: mean(perExample.map((example) => example.passRate * (1 - example.passRate))),\n      withinRun: mean(withinRun),\n      unstable: perExample\n        .filter((example) => example.passRate > 0 && example.passRate < 1)\n        .map((example) => example.id),\n    },\n    disagreements: perExample\n      .filter((example) => example.agreement < 1)\n      .sort((a, b) => a.agreement - b.agreement || (a.id < b.id ? -1 : 1)),\n    unjudged,\n  }\n}\n\nexport interface JudgeGatePolicy {\n  /**\n   * `verdict`: the judge passes and blocks, so accuracy and κ must hold.\n   * `veto`: it only blocks, so its false-fail rate on owner passes must hold.\n   */\n  decides: 'verdict' | 'veto'\n  /** Judged examples required before the judge may gate; for a veto judge, owner passes. */\n  minExamples: number\n  /** Judged examples required of each owner verdict, so κ is defined. */\n  minPerVerdict: number\n  /** Floor on run accuracy. */\n  minAccuracy: number\n  /** Floor on Cohen's κ. */\n  minKappa: number\n  /** Ceiling on a veto judge's false-fail rate. */\n  maxFalseFailRate: number\n  /** A report older than this (days, vs `asOf`) no longer calibrates the judge. */\n  maxAgeDays: number\n  /** Drift thresholds forwarded to `judgeSentinelReport` over the history. */\n  drift?: SentinelThresholds\n}\n\nexport const DEFAULT_JUDGE_GATE_POLICY: Readonly<JudgeGatePolicy> = Object.freeze({\n  decides: 'verdict',\n  minExamples: 10,\n  minPerVerdict: 1,\n  minAccuracy: 0.9,\n  minKappa: 0.6,\n  maxFalseFailRate: 0.1,\n  maxAgeDays: 30,\n})\n\nexport type JudgeGateStatus = 'calibrated' | 'uncalibrated' | 'below-threshold' | 'drifted'\n\nexport interface JudgeGateDecision {\n  judgeId: string\n  judgeModel: string\n  rubricVersion: string\n  /** True only for `calibrated`. */\n  mayGate: boolean\n  status: JudgeGateStatus\n  /** Why the judge may not gate; empty when it may. */\n  reasons: string[]\n  agreement: JudgeAgreement | null\n  policy: JudgeGatePolicy\n}\n\nexport interface JudgeGateInput {\n  judgeId: string\n  /** The model the judge runs now. */\n  judgeModel: string\n  /** The rubric the judge runs now. */\n  rubricVersion: string\n  /** The latest calibration report; null when the judge was never measured. */\n  agreement: JudgeAgreement | null\n  asOf: string\n  /** Sentinel snapshots for this judge, oldest first or in any order. */\n  history?: readonly SentinelSnapshot[]\n  policy?: Partial<JudgeGatePolicy>\n}\n\nconst DAY_MS = 86_400_000\n\nfunction percent(value: number): string {\n  return `${(value * 100).toFixed(1)}%`\n}\n\n/** Whether a judge may gate now, and every reason it may not. */\nexport function judgeGateDecision(input: JudgeGateInput): JudgeGateDecision {\n  const judgeId = requireText(input.judgeId, 'judgeId')\n  const judgeModel = requireText(input.judgeModel, 'judgeModel')\n  const rubricVersion = requireText(input.rubricVersion, 'rubricVersion')\n  const asOf = parseIso(input.asOf, 'asOf')\n  const policy: JudgeGatePolicy = {\n    ...DEFAULT_JUDGE_GATE_POLICY,\n    ...Object.fromEntries(\n      Object.entries(input.policy ?? {}).filter(([, value]) => value !== undefined),\n    ),\n  }\n  if (policy.decides !== 'verdict' && policy.decides !== 'veto') {\n    throw new ValidationError(\n      `judge-gate: policy.decides must be 'verdict' or 'veto', got ${JSON.stringify(policy.decides)}`,\n    )\n  }\n  const agreement = input.agreement\n  const decide = (status: JudgeGateStatus, reasons: string[]): JudgeGateDecision => ({\n    judgeId,\n    judgeModel,\n    rubricVersion,\n    mayGate: status === 'calibrated',\n    status,\n    reasons,\n    agreement,\n    policy,\n  })\n\n  if (!agreement) return decide('uncalibrated', ['no measured agreement with owner verdicts'])\n  if (agreement.judgeId !== judgeId) {\n    throw new ValidationError(\n      `judge-gate: agreement belongs to \"${agreement.judgeId}\", not \"${judgeId}\"`,\n    )\n  }\n\n  const uncalibrated: string[] = []\n  if (agreement.judgeModel !== judgeModel) {\n    uncalibrated.push(\n      `agreement was measured on model ${agreement.judgeModel}; the judge now runs ${judgeModel}`,\n    )\n  }\n  if (agreement.rubricVersion !== rubricVersion) {\n    uncalibrated.push(\n      `agreement was measured on rubric ${agreement.rubricVersion}; the judge now runs ${rubricVersion}`,\n    )\n  }\n  const ageDays = (asOf - parseIso(agreement.measuredAt, 'agreement.measuredAt')) / DAY_MS\n  if (ageDays > policy.maxAgeDays) {\n    uncalibrated.push(`agreement is ${ageDays.toFixed(1)} days old (limit ${policy.maxAgeDays})`)\n  }\n  if (policy.decides === 'veto') {\n    // Only owner passes can show a veto judge blocking what it should not.\n    if (agreement.judgedByVerdict.pass < policy.minExamples) {\n      uncalibrated.push(\n        `${agreement.judgedByVerdict.pass} judged examples the owner marked pass; a veto judge needs at least ${policy.minExamples}`,\n      )\n    }\n  } else {\n    if (agreement.judged < policy.minExamples) {\n      uncalibrated.push(\n        `${agreement.judged} judged ${agreement.judged === 1 ? 'example' : 'examples'}; at least ${policy.minExamples} required`,\n      )\n    }\n    for (const verdict of ['pass', 'fail'] as const) {\n      if (agreement.judgedByVerdict[verdict] < policy.minPerVerdict) {\n        uncalibrated.push(\n          `${agreement.judgedByVerdict[verdict]} judged examples the owner marked ${verdict}; at least ${policy.minPerVerdict} required`,\n        )\n      }\n    }\n  }\n  if (uncalibrated.length > 0) return decide('uncalibrated', uncalibrated)\n\n  const below: string[] = []\n  if (policy.decides === 'veto') {\n    if (agreement.falseFailRate === null || agreement.falseFailRate > policy.maxFalseFailRate) {\n      below.push(\n        `it fails ${agreement.falseFailRate === null ? 'an unmeasured share' : percent(agreement.falseFailRate)} of what the owner passed (limit ${percent(policy.maxFalseFailRate)})`,\n      )\n    }\n  } else if (agreement.accuracy === null || agreement.accuracy < policy.minAccuracy) {\n    below.push(\n      `accuracy ${agreement.accuracy === null ? 'unmeasured' : percent(agreement.accuracy)} is below ${percent(policy.minAccuracy)}`,\n    )\n  }\n  if (\n    policy.decides === 'verdict' &&\n    (agreement.kappa === null || agreement.kappa < policy.minKappa)\n  ) {\n    below.push(\n      `kappa ${agreement.kappa === null ? 'undefined' : agreement.kappa.toFixed(2)} is below ${policy.minKappa}`,\n    )\n  }\n  if (below.length > 0) return decide('below-threshold', below)\n\n  const history = (input.history ?? []).filter((snapshot) => snapshot.judgeId === judgeId)\n  if (history.length > 0) {\n    const report = judgeSentinelReport([...history], {\n      asOf: input.asOf,\n      ...(policy.drift ? { thresholds: policy.drift } : {}),\n    })\n    if (!report.healthy) return decide('drifted', report.alarms)\n  }\n  return decide('calibrated', [])\n}\n\n/** Thrown by `assertJudgeMayGate`; carries the refused decision. */\nexport class JudgeGateRefusedError extends JudgeError {\n  readonly decision: JudgeGateDecision\n\n  constructor(decision: JudgeGateDecision) {\n    super(\n      `judge \"${decision.judgeId}\" may not gate (${decision.status}): ${decision.reasons.join('; ')}`,\n    )\n    this.decision = decision\n  }\n}\n\n/** Throw unless the decision lets the judge gate. */\nexport function assertJudgeMayGate(decision: JudgeGateDecision): void {\n  if (!decision.mayGate) throw new JudgeGateRefusedError(decision)\n}\n\n/**\n * The sentinel snapshot for one calibration run. A deciding judge records\n * accuracy as `sentinelPassRate` and κ as `calibrationKappa` when it is\n * defined; a veto judge records the share of owner passes it let through as\n * `sentinelPassRate`. Append it to the judge's `SentinelStore`; the gate reads\n * drift from that history.\n */\nexport function snapshotFromJudgeAgreement(\n  agreement: JudgeAgreement,\n  options: { decides?: JudgeGatePolicy['decides'] } = {},\n): SentinelSnapshot {\n  const veto = options.decides === 'veto'\n  const rate = veto\n    ? agreement.falseFailRate === null\n      ? null\n      : 1 - agreement.falseFailRate\n    : agreement.accuracy\n  if (rate === null) {\n    throw new ValidationError(\n      `snapshotFromJudgeAgreement: judge \"${agreement.judgeId}\" has no ${veto ? 'runs on owner passes' : 'runs'} to snapshot`,\n    )\n  }\n  const snapshot: SentinelSnapshot = {\n    at: agreement.measuredAt,\n    judgeId: agreement.judgeId,\n    judgeModel: agreement.judgeModel,\n    metrics: {\n      sentinelPassRate: rate,\n      ...(veto || agreement.kappa === null ? {} : { calibrationKappa: agreement.kappa }),\n    },\n  }\n  validateSentinelSnapshot(snapshot)\n  return snapshot\n}\n"],"mappings":";;;AA8BA,SAAgB,cACd,QACA,UAAoC,CAAC,GACZ;CACzB,MAAM,SAAS,QAAQ,UAAU;CACjC,MAAM,WAAW,QAAQ,YAAY;CACrC,MAAM,WAAW,QAAQ,YAAY;CAErC,IAAI,OAAO,SAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,CAAC,CAAC,GACjD,OAAO;EAAE,OAAO;EAAqB,YAAY;EAAG,UAAU;EAAG,SAAS;EAAG,QAAQ;CAAM;CAG7F,MAAM,OAAO,OAAO,MAAM,CAAC,MAAM;CACjC,MAAM,OAAO,KAAK,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,KAAK;CACpD,MAAM,WAAW,KAAK,QAAQ,KAAK,MAAM,OAAO,IAAI,SAAS,GAAG,CAAC,IAAI,KAAK;CAG1E,MAAM,KAFS,KAAK,KAAK,QAET,KADA,KAAK,IAAI,IAAI,IAAI,OAAO,KAAK,IAAI,IAAI,IAAI;CAEzD,MAAM,SAAS,KAAK,UAAU,UAAU,MAAM;CAI9C,IAAI,UAAU;CACd,IAAI,YAAwB;CAC5B,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,IAAI,GAAG,KAAK;EAC1C,MAAM,QAAQ,OAAO,KAAM,OAAO,IAAI;EACtC,IAAI,UAAU,GAAG;EACjB,MAAM,MAAM,QAAQ,IAAI,IAAI;EAC5B,IAAI,cAAc,GAAG,YAAY;EACjC,IAAI,QAAQ,WAAW;EACvB,WAAW;CACb;CAEA,IAAI;CACJ,IAAI,QACF,QAAQ;MACH,IAAI,KAAK,IAAI,OAAO,KAAK,UAC9B,QAAQ,UAAU,IAAI,gBAAgB;MAEtC,QAAQ;CAGV,OAAO;EAAE;EAAO,YAAY;EAAM,UAAU;EAAI;EAAS;CAAO;AAClE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpBA,MAAM,wBAAwB;CAAC;CAAO;CAAoB;AAAkB;AAmC5E,SAASA,WAAS,OAAe,OAAuB;CACtD,MAAM,KAAK,OAAO,UAAU,WAAW,KAAK,MAAM,KAAK,IAAI;CAC3D,IAAI,CAAC,OAAO,SAAS,EAAE,GACrB,MAAM,IAAI,gBACR,mBAAmB,MAAM,qCAAqC,KAAK,UAAU,KAAK,GACpF;CAEF,OAAO;AACT;;AAGA,SAAgB,yBAAyB,UAA4B,SAAS,YAAkB;CAC9F,WAAS,SAAS,IAAI,GAAG,OAAO,IAAI;CACpC,IAAI,OAAO,SAAS,YAAY,YAAY,SAAS,QAAQ,WAAW,GACtE,MAAM,IAAI,gBAAgB,mBAAmB,OAAO,oCAAoC;CAE1F,IAAI,OAAO,SAAS,eAAe,YAAY,SAAS,WAAW,WAAW,GAC5E,MAAM,IAAI,gBAAgB,mBAAmB,OAAO,uCAAuC;CAE7F,IAAI,SAAS,YAAY,QAAQ,OAAO,SAAS,YAAY,UAC3D,MAAM,IAAI,gBAAgB,mBAAmB,OAAO,0CAA0C;CAEhG,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,SAAS,OAAO,GAAG;EAC3D,IAAI,CAAE,sBAA4C,SAAS,GAAG,GAE5D,MAAM,IAAI,gBACR,mBAAmB,OAAO,gCAAgC,IAAI,aAAa,sBAAsB,KAAK,IAAI,GAC5G;EAEF,IAAI,UAAU,KAAA,KAAa,CAAC,OAAO,SAAS,KAAK,GAC/C,MAAM,IAAI,gBACR,mBAAmB,OAAO,WAAW,IAAI,2BAA2B,OAAO,KAAK,GAClF;CAEJ;AACF;;;;;;AASA,SAAgB,wBACd,QACA,MACkB;CAClB,MAAM,QAAQ,6BAA6B,SAAS,OAAO,0BAA0B,OAAO;CAC5F,IAAI,CAAC,OAAO,SAAS,KAAK,GACxB,MAAM,IAAI,gBACR,+CAA+C,OAAO,EAAE,iEAC1D;CAEF,MAAM,WAA6B;EAAE,GAAG;EAAM,SAAS,EAAE,kBAAkB,MAAM;CAAE;CACnF,yBAAyB,QAAQ;CACjC,OAAO;AACT;;;;;;;;AASA,SAAgB,sBACd,QACA,MACkB;CAClB,MAAM,MAAM,gBAAgB,SAAS,OAAO,aAAa,OAAO;CAChE,IAAI,CAAC,OAAO,SAAS,GAAG,GACtB,MAAM,IAAI,gBACR,4FACF;CAEF,MAAM,WAA6B;EAAE,GAAG;EAAM,SAAS,EAAE,IAAI;CAAE;CAC/D,yBAAyB,QAAQ;CACjC,OAAO;AACT;;;;;;;;AAcA,SAAgB,wBACd,QACA,QACA,MACA,UAA8B,CAAC,GACb;CAClB,MAAM,YAAY,QAAQ,aAAa;CACvC,IAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,GAC7C,MAAM,IAAI,gBACR,uEAAuE,WACzE;CAEF,MAAM,6BAAa,IAAI,IAAoB;CAC3C,KAAK,MAAM,QAAQ,QAAQ;EACzB,IAAI,CAAC,OAAO,SAAS,KAAK,UAAU,GAClC,MAAM,IAAI,gBACR,yCAAyC,KAAK,OAAO,8BACvD;EAEF,IAAI,WAAW,IAAI,KAAK,MAAM,GAC5B,MAAM,IAAI,gBAAgB,qDAAqD,KAAK,OAAO,EAAE;EAE/F,WAAW,IAAI,KAAK,QAAQ,KAAK,UAAU;CAC7C;CACA,IAAI,SAAS;CACb,IAAI,SAAS;CACb,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,QAAQ,WAAW,IAAI,EAAE,MAAM;EACrC,IAAI,UAAU,KAAA,GAAW;EACzB,IAAI,CAAC,OAAO,SAAS,EAAE,KAAK,GAC1B,MAAM,IAAI,gBACR,kDAAkD,EAAE,OAAO,gBAC7D;EAEF;EACA,IAAI,KAAK,IAAI,EAAE,QAAQ,KAAK,KAAK,WAAW;CAC9C;CACA,IAAI,WAAW,GACb,MAAM,IAAI,gBACR,yGACF;CAEF,MAAM,WAA6B;EAAE,GAAG;EAAM,SAAS,EAAE,kBAAkB,SAAS,OAAO;CAAE;CAC7F,yBAAyB,QAAQ;CACjC,OAAO;AACT;AAUA,SAAgB,sBAAsB,UAA8B,CAAC,GAAkB;CACrF,KAAK,MAAM,KAAK,SAAS,yBAAyB,CAAC;CACnD,MAAM,QAAQ,QAAQ,KAAK,OAAO;EAAE,GAAG;EAAG,SAAS,EAAE,GAAG,EAAE,QAAQ;CAAE,EAAE;CACtE,OAAO;EACL,MAAM,OAAO,UAAU;GACrB,yBAAyB,QAAQ;GACjC,MAAM,KAAK;IAAE,GAAG;IAAU,SAAS,EAAE,GAAG,SAAS,QAAQ;GAAE,CAAC;EAC9D;EACA,MAAM,QAAQ,SAAS;GACrB,MAAM,MAAM,MAAM,KAAK,OAAO;IAAE,GAAG;IAAG,SAAS,EAAE,GAAG,EAAE,QAAQ;GAAE,EAAE;GAClE,OAAO,YAAY,KAAA,IAAY,MAAM,IAAI,QAAQ,MAAM,EAAE,YAAY,OAAO;EAC9E;CACF;AACF;;;;;;;AAQA,SAAgB,kBAAkB,MAA6B;CAC7D,OAAO;EACL,MAAM,OAAO,UAAU;GACrB,yBAAyB,QAAQ;GACjC,MAAM,KAAK,MAAM,OAAO;GACxB,MAAM,UAAU,MAAM,OAAO;GAC7B,MAAM,GAAG,MAAM,QAAQ,QAAQ,IAAI,GAAG,EAAE,WAAW,KAAK,CAAC;GACzD,MAAM,GAAG,WAAW,MAAM,GAAG,KAAK,UAAU,QAAQ,EAAE,KAAK,MAAM;EACnE;EACA,MAAM,QAAQ,SAAS;GACrB,MAAM,KAAK,MAAM,OAAO;GACxB,IAAI;GACJ,IAAI;IACF,MAAM,MAAM,GAAG,SAAS,MAAM,MAAM;GACtC,SAAS,KAAK;IACZ,IAAK,IAA8B,SAAS,UAAU,OAAO,CAAC;IAC9D,MAAM;GACR;GACA,MAAM,QAAQ,IAAI,MAAM,IAAI;GAC5B,MAAM,YAAgC,CAAC;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IACnB,IAAI,KAAK,KAAK,CAAC,CAAC,WAAW,GAAG;IAC9B,IAAI;IACJ,IAAI;KACF,SAAS,KAAK,MAAM,IAAI;IAC1B,SAAS,KAAK;KACZ,MAAM,IAAI,gBACR,4BAA4B,KAAK,4BAA4B,IAAI,EAAE,IAAK,IAAc,SACxF;IACF;IACA,MAAM,WAAW;IACjB,yBAAyB,UAAU,GAAG,KAAK,GAAG,IAAI,GAAG;IACrD,UAAU,KAAK,QAAQ;GACzB;GACA,OAAO,YAAY,KAAA,IAAY,YAAY,UAAU,QAAQ,MAAM,EAAE,YAAY,OAAO;EAC1F;CACF;AACF;AAmDA,MAAM,aAAa;AAEnB,SAAgB,oBACd,SACA,MACgB;CAChB,MAAM,SAASA,WAAS,KAAK,MAAM,MAAM;CACzC,MAAM,SAAS,KAAK,YAAY,UAAU;CAC1C,MAAM,eAAe,KAAK,YAAY,gBAAgB;CACtD,MAAM,kBAAkB,KAAK,YAAY,mBAAmB;CAC5D,MAAM,iBAAiB,KAAK,YAAY,kBAAkB;CAE1D,MAAM,0BAAU,IAAI,IAAwD;CAC5E,KAAK,MAAM,YAAY,SAAS;EAC9B,yBAAyB,QAAQ;EACjC,MAAM,OAAOA,WAAS,SAAS,IAAI,uBAAuB,SAAS,QAAQ,GAAG;EAC9E,MAAM,MAAM,QAAQ,IAAI,SAAS,OAAO,KAAK,CAAC;EAC9C,IAAI,KAAK;GAAE,GAAG;GAAU;EAAK,CAAC;EAC9B,QAAQ,IAAI,SAAS,SAAS,GAAG;CACnC;CAEA,MAAM,WAA4B,CAAC;CACnC,MAAM,SAAmB,CAAC;CAC1B,MAAM,sBAAgC,CAAC;CAEvC,KAAK,MAAM,WAAW,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG;EAChD,MAAM,QAAQ,QAAQ,IAAI,OAAO,CAAC,CAAE,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;EAClE,MAAM,SAAS,MAAM,MAAM,SAAS;EAEpC,MAAM,WAAW,SAAS,OAAO,QAAQ;EACzC,IAAI,UAAU,gBACZ,OAAO,KACL,UAAU,QAAQ,6BAA6B,OAAO,GAAG,MAAM,QAAQ,QAAQ,CAAC,EAAE,uBAAuB,eAAe,GAC1H;EAMF,IAAI,YAAY;EAChB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,IAAI,MAAM,EAAE,CAAE,eAAe,MAAM,IAAI,EAAE,CAAE,YAAY,YAAY;EAErE,IAAI,aAAa,GAQX;OAAA,CAPiB,MAClB,MAAM,SAAS,CAAC,CAChB,MACE,MACC,OAAO,SAAS,EAAE,QAAQ,gBAAgB,KAC1C,OAAO,SAAS,EAAE,QAAQ,gBAAgB,CAEhC,GACd,OAAO,KACL,UAAU,QAAQ,oBAAoB,MAAM,YAAY,EAAE,CAAE,WAAW,OAAO,MAAM,UAAU,CAAE,WAAW,OAAO,MAAM,UAAU,CAAE,GAAG,gIACzI;EAAA;EAIJ,KAAK,MAAM,UAAU,uBAAuB;GAC1C,MAAM,SAAS,MACZ,QAAQ,MAAM,OAAO,EAAE,QAAQ,YAAY,QAAQ,CAAC,CACpD,KAAK,MAAM,EAAE,QAAQ,OAAQ;GAChC,IAAI,OAAO,WAAW,GAAG;GAEzB,MAAM,cAAc,cAAc,QAAQ,KAAK,WAAW;GAC1D,IAAI,YAAY,UAAU,qBACxB,oBAAoB,KAAK,GAAG,QAAQ,GAAG,QAAQ;GAEjD,MAAM,UAAU,OAAO,OAAO,SAAS;GACvC,MAAM,WAAW,OAAO;GACxB,MAAM,QAAQ,UAAU;GACxB,MAAM,UAAoB,CAAC;GAC3B,IAAI,YAAY,UAAU,iBACxB,QAAQ,KACN,6CAA6C,YAAY,QAAQ,gBAAgB,YAAY,WAAW,QAAQ,CAAC,EAAE,EACrH;GAEF,IAAI,WAAW,SAAS,UAAU,QAChC,QAAQ,KAAK,OAAO,QAAQ,QAAQ,CAAC,EAAE,eAAe,QAAQ;GAEhE,IAAI,WAAW,sBAAsB,WAAW,UAAU,cACxD,QAAQ,KACN,6BAA6B,WAAW,QAAA,CAAS,QAAQ,CAAC,EAAE,iBAAiB,SAAS,QAAQ,CAAC,EAAE,UAAU,aAAa,EAC1H;GAEF,IAAI,WAAW,sBAAsB,WAAW,UAAU,iBACxD,QAAQ,KACN,6BAA6B,WAAW,QAAA,CAAS,QAAQ,CAAC,EAAE,iBAAiB,SAAS,QAAQ,CAAC,EAAE,UAAU,gBAAgB,EAC7H;GAGF,MAAM,UAAU,QAAQ,SAAS;GACjC,MAAM,QAAuB;IAC3B;IACA;IACA,OAAO,YAAY;IACnB;IACA;IACA;IACA;GACF;GACA,IAAI,SAAS;IACX,MAAM,SAAS,QAAQ,KAAK,IAAI;IAChC,OAAO,KAAK,UAAU,QAAQ,IAAI,OAAO,IAAI,MAAM,QAAQ;GAC7D;GACA,SAAS,KAAK,KAAK;EACrB;CACF;CAEA,OAAO;EAAE;EAAU;EAAQ,SAAS,OAAO,WAAW;EAAG;CAAoB;AAC/E;;;;;;;;;AAiBA,SAAgB,gBAAgB,QAAyC;CACvE,OAAO;EAAE,SAAS,OAAO;EAAS,QAAQ,CAAC,GAAG,OAAO,MAAM;CAAE;AAC/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACzZA,SAAS,SAAS,OAAgB,OAAuB;CACvD,MAAM,KAAK,OAAO,UAAU,WAAW,KAAK,MAAM,KAAK,IAAI;CAC3D,IAAI,CAAC,OAAO,SAAS,EAAE,GACrB,MAAM,IAAI,gBACR,eAAe,MAAM,qCAAqC,KAAK,UAAU,KAAK,GAChF;CAEF,OAAO;AACT;AAEA,SAAS,YAAY,OAAgB,OAAuB;CAC1D,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,CAAC,CAAC,WAAW,GACvD,MAAM,IAAI,gBAAgB,eAAe,MAAM,4BAA4B;CAE7E,OAAO;AACT;AAEA,SAAS,eAAe,OAAgB,OAA6B;CACnE,IAAI,UAAU,UAAU,UAAU,QAChC,MAAM,IAAI,gBACR,eAAe,MAAM,iCAAiC,KAAK,UAAU,KAAK,GAC5E;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,SAA6B,OAAmC;CACpF,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,MAAM,IAAI,gBAAgB,eAAe,MAAM,mBAAmB;CAEpE,YAAY,QAAQ,IAAI,GAAG,MAAM,IAAI;CACrC,eAAe,QAAQ,SAAS,GAAG,MAAM,SAAS;CAClD,YAAY,QAAQ,WAAW,GAAG,MAAM,WAAW;CACnD,SAAS,QAAQ,WAAW,GAAG,MAAM,WAAW;CAChD,YAAY,QAAQ,QAAQ,GAAG,MAAM,QAAQ;CAC7C,IAAI,QAAQ,gBAAgB,KAAA,GAAW,YAAY,QAAQ,aAAa,GAAG,MAAM,aAAa;CAC9F,MAAM,OAA2B;EAC/B,IAAI,QAAQ;EACZ,SAAS,QAAQ;EACjB,WAAW,QAAQ;EACnB,WAAW,QAAQ;EACnB,QAAQ,QAAQ;CAClB;CACA,IAAI,QAAQ,gBAAgB,KAAA,GAAW,KAAK,cAAc,QAAQ;CAClE,IAAI,QAAQ,SAAS,KAAA,GAAW,KAAK,OAAO,QAAQ;CACpD,OAAO;AACT;;;;;AAMA,SAAgB,uBAAuB,KAA+C;CACpF,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UACjC,MAAM,IAAI,gBAAgB,+CAA+C;CAE3E,MAAM,UAAU,YAAY,IAAI,SAAS,yBAAyB;CAClE,MAAM,QAAQ,YAAY,IAAI,OAAO,oBAAoB,QAAQ,QAAQ;CACzE,IAAI,CAAC,MAAM,QAAQ,IAAI,QAAQ,GAC7B,MAAM,IAAI,gBAAgB,gCAAgC,QAAQ,4BAA4B;CAEhG,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,WAAW,IAAI,SAAS,KAAK,SAAS,UAAU;EACpD,MAAM,UAAU,aAAa,SAAS,oBAAoB,QAAQ,YAAY,OAAO;EACrF,IAAI,KAAK,IAAI,QAAQ,EAAE,GACrB,MAAM,IAAI,gBACR,gCAAgC,QAAQ,8BAA8B,QAAQ,GAAG,EACnF;EAEF,KAAK,IAAI,QAAQ,EAAE;EACnB,OAAO;CACT,CAAC;CACD,SAAS,MAAM,GAAG,MAAO,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,CAAE;CAChE,OAAO;EAAE;EAAS;EAAO;CAAS;AACpC;;;;;;;AAkBA,SAAgB,uBACd,KACA,UACkB;CAClB,MAAM,OAAO,uBAAuB,GAAG;CACvC,MAAM,OAAO,IAAI,IAAI,KAAK,SAAS,KAAK,YAAY,CAAC,QAAQ,IAAI,OAAO,CAAC,CAAC;CAC1E,MAAM,QAAkB,CAAC;CACzB,MAAM,aAAuB,CAAC;CAC9B,MAAM,YAAsB,CAAC;CAC7B,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,QAAQ,GAAG;EACjD,MAAM,WAAW,aAAa,SAAS,oBAAoB,MAAM,QAAQ,KAAK,QAAQ,EAAE;EACxF,MAAM,UAAU,KAAK,IAAI,SAAS,EAAE;EACpC,IAAI,CAAC,SAAS;GACZ,KAAK,IAAI,SAAS,IAAI,QAAQ;GAC9B,MAAM,KAAK,SAAS,EAAE;GACtB;EACF;EAEA,IADqB,QAAQ,WAAW,SAAS,UAAU,QAAQ,YAAY,SAAS,WAGtF,SAAS,SAAS,WAAW,WAAW,KAAK,SAAS,QAAQ,WAAW,WAAW,GACpF;GACA,UAAU,KAAK,SAAS,EAAE;GAC1B;EACF;EACA,KAAK,IAAI,SAAS,IAAI,QAAQ;EAC9B,WAAW,KAAK,SAAS,EAAE;CAC7B;CACA,OAAO;EACL,KAAK,uBAAuB;GAAE,GAAG;GAAM,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC;EAAE,CAAC;EACrE;EACA;EACA;CACF;AACF;AAiFA,SAAS,kBAAkB,QAAgB,GAAmB;CAC5D,MAAM,IAAI,SAAS;CACnB,OAAO,KAAK,IAAI;AAClB;;AAGA,SAAS,YAAY,WAA0C;CAC7D,MAAM,IAAI,UAAU,WAAW,UAAU,WAAW,UAAU,YAAY,UAAU;CACpF,IAAI,MAAM,GAAG,OAAO;CACpB,MAAM,YAAY,UAAU,WAAW,UAAU,YAAY;CAC7D,MAAM,aAAa,UAAU,WAAW,UAAU,aAAa;CAC/D,MAAM,aAAa,UAAU,WAAW,UAAU,aAAa;CAC/D,MAAM,WAAW,YAAY,aAAa,IAAI,cAAc,IAAI;CAChE,IAAI,aAAa,GAAG,OAAO;CAC3B,QAAQ,WAAW,aAAa,IAAI;AACtC;;;;;;AAOA,SAAgB,sBACd,KACA,MACA,MACgB;CAChB,MAAM,aAAa,uBAAuB,GAAG;CAC7C,IAAI,KAAK,YAAY,WAAW,SAC9B,MAAM,IAAI,gBACR,mCAAmC,KAAK,QAAQ,4BAA4B,WAAW,QAAQ,EACjG;CAEF,YAAY,KAAK,YAAY,YAAY;CACzC,YAAY,KAAK,eAAe,eAAe;CAC/C,SAAS,KAAK,YAAY,YAAY;CACtC,MAAM,OAAO,IAAI,IAAI,WAAW,SAAS,KAAK,YAAY,CAAC,QAAQ,IAAI,OAAO,CAAC,CAAC;CAChF,MAAM,2BAAW,IAAI,IAAwB;CAC7C,MAAM,YAA4B;EAAE,UAAU;EAAG,UAAU;EAAG,WAAW;EAAG,WAAW;CAAE;CACzF,MAAM,YAAsB,CAAC;CAC7B,KAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,QAAQ,GAAG;EACzC,MAAM,UAAU,KAAK,IAAI,KAAK,SAAS;EACvC,IAAI,CAAC,SACH,MAAM,IAAI,gBACR,mBAAmB,MAAM,iBAAiB,KAAK,UAAU,KAAK,SAAS,EAAE,qBAAqB,WAAW,QAAQ,oBACnH;EAEF,MAAM,UAAU,eAAe,IAAI,SAAS,OAAO,MAAM,SAAS;EAClE,IAAI,IAAI,YAAY,KAAA,GAAW;GAC7B,IAAI,CAAC,MAAM,QAAQ,IAAI,OAAO,KAAK,IAAI,QAAQ,WAAW,GACxD,MAAM,IAAI,gBAAgB,mBAAmB,MAAM,mCAAmC;GAExF,MAAM,UAAU,IAAI,QAAQ,KAAK,QAAQ,MACvC,eAAe,QAAQ,OAAO,MAAM,UAAU,GAAG,CACnD;GACA,UAAU,KACR,kBAAkB,QAAQ,QAAQ,WAAW,WAAW,MAAM,CAAC,CAAC,QAAQ,QAAQ,MAAM,CACxF;EACF;EACA,MAAM,OAAO,SAAS,IAAI,QAAQ,EAAE,KAAK,CAAC;EAC1C,KAAK,KAAK;GAAE,GAAG;GAAK;EAAQ,CAAC;EAC7B,SAAS,IAAI,QAAQ,IAAI,IAAI;EAC7B,IAAI,YAAY,QAAQ;GACtB,IAAI,QAAQ,YAAY,QAAQ,UAAU;QACrC,UAAU;EACjB,OAAO,IAAI,QAAQ,YAAY,QAAQ,UAAU;OAC5C,UAAU;CACjB;CAEA,MAAM,aAAsC,CAAC;CAC7C,MAAM,WAAqB,CAAC;CAC5B,MAAM,kBAAgD;EAAE,MAAM;EAAG,MAAM;CAAE;CACzE,KAAK,MAAM,WAAW,WAAW,UAAU;EACzC,MAAM,OAAO,SAAS,IAAI,QAAQ,EAAE;EACpC,IAAI,CAAC,MAAM;GACT,SAAS,KAAK,QAAQ,EAAE;GACxB;EACF;EACA,gBAAgB,QAAQ,QAAQ;EAChC,MAAM,SAAS,KAAK,QAAQ,QAAQ,IAAI,YAAY,MAAM,CAAC,CAAC;EAC5D,WAAW,KAAK;GACd,IAAI,QAAQ;GACZ,SAAS,QAAQ;GACjB,MAAM,KAAK;GACX,UAAU,SAAS,KAAK;GACxB,WAAW,KAAK,QAAQ,QAAQ,IAAI,YAAY,QAAQ,OAAO,CAAC,CAAC,SAAS,KAAK;EACjF,CAAC;CACH;CAEA,MAAM,QAAQ,KAAK;CACnB,MAAM,aAAa,UAAU,WAAW,UAAU;CAClD,MAAM,iBAAiB,WAAW,QAAQ,YAAY,QAAQ,cAAc,CAAC,CAAC,CAAC;CAC/E,MAAM,QAAQ,WACZ,OAAO,WAAW,IAAI,OAAO,OAAO,QAAQ,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI,OAAO;CACtF,OAAO;EACL,GAAG;EACH,OAAO,WAAW;EAClB,UAAU,WAAW,SAAS;EAC9B,QAAQ,WAAW;EACnB;EACA,MAAM;EACN,UAAU,UAAU,IAAI,OAAO,aAAa;EAC5C,iBACE,WAAW,WAAW,IAClB,OACA;GACE,QAAQ;GACR,QAAQ,WAAW;GACnB,UAAU,gBACR;IAAE,MAAM;IAAmB,OAAO;GAAK,GACvC;IAAE,MAAM;IAAY,WAAW;IAAgB,QAAQ,WAAW;GAAO,CAC3E;EACF;EACN,OAAO,YAAY,SAAS;EAC5B,eACE,UAAU,WAAW,UAAU,cAAc,IACzC,OACA,UAAU,aAAa,UAAU,WAAW,UAAU;EAC5D,WACE,UAAU,WAAW,UAAU,cAAc,IACzC,OACA,UAAU,YAAY,UAAU,WAAW,UAAU;EAC3D;EACA,UAAU;GACR,aAAa,KAAK,WAAW,KAAK,YAAY,QAAQ,YAAY,IAAI,QAAQ,SAAS,CAAC;GACxF,WAAW,KAAK,SAAS;GACzB,UAAU,WACP,QAAQ,YAAY,QAAQ,WAAW,KAAK,QAAQ,WAAW,CAAC,CAAC,CACjE,KAAK,YAAY,QAAQ,EAAE;EAChC;EACA,eAAe,WACZ,QAAQ,YAAY,QAAQ,YAAY,CAAC,CAAC,CAC1C,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE;EACrE;CACF;AACF;AAwBA,MAAa,4BAAuD,OAAO,OAAO;CAChF,SAAS;CACT,aAAa;CACb,eAAe;CACf,aAAa;CACb,UAAU;CACV,kBAAkB;CAClB,YAAY;AACd,CAAC;AA+BD,MAAM,SAAS;AAEf,SAAS,QAAQ,OAAuB;CACtC,OAAO,IAAI,QAAQ,IAAA,CAAK,QAAQ,CAAC,EAAE;AACrC;;AAGA,SAAgB,kBAAkB,OAA0C;CAC1E,MAAM,UAAU,YAAY,MAAM,SAAS,SAAS;CACpD,MAAM,aAAa,YAAY,MAAM,YAAY,YAAY;CAC7D,MAAM,gBAAgB,YAAY,MAAM,eAAe,eAAe;CACtE,MAAM,OAAO,SAAS,MAAM,MAAM,MAAM;CACxC,MAAM,SAA0B;EAC9B,GAAG;EACH,GAAG,OAAO,YACR,OAAO,QAAQ,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,WAAW,UAAU,KAAA,CAAS,CAC9E;CACF;CACA,IAAI,OAAO,YAAY,aAAa,OAAO,YAAY,QACrD,MAAM,IAAI,gBACR,+DAA+D,KAAK,UAAU,OAAO,OAAO,GAC9F;CAEF,MAAM,YAAY,MAAM;CACxB,MAAM,UAAU,QAAyB,aAA0C;EACjF;EACA;EACA;EACA,SAAS,WAAW;EACpB;EACA;EACA;EACA;CACF;CAEA,IAAI,CAAC,WAAW,OAAO,OAAO,gBAAgB,CAAC,2CAA2C,CAAC;CAC3F,IAAI,UAAU,YAAY,SACxB,MAAM,IAAI,gBACR,qCAAqC,UAAU,QAAQ,UAAU,QAAQ,EAC3E;CAGF,MAAM,eAAyB,CAAC;CAChC,IAAI,UAAU,eAAe,YAC3B,aAAa,KACX,mCAAmC,UAAU,WAAW,uBAAuB,YACjF;CAEF,IAAI,UAAU,kBAAkB,eAC9B,aAAa,KACX,oCAAoC,UAAU,cAAc,uBAAuB,eACrF;CAEF,MAAM,WAAW,OAAO,SAAS,UAAU,YAAY,sBAAsB,KAAK;CAClF,IAAI,UAAU,OAAO,YACnB,aAAa,KAAK,gBAAgB,QAAQ,QAAQ,CAAC,EAAE,mBAAmB,OAAO,WAAW,EAAE;CAE9F,IAAI,OAAO,YAAY,QAEjB;MAAA,UAAU,gBAAgB,OAAO,OAAO,aAC1C,aAAa,KACX,GAAG,UAAU,gBAAgB,KAAK,sEAAsE,OAAO,aACjH;CAAA,OAEG;EACL,IAAI,UAAU,SAAS,OAAO,aAC5B,aAAa,KACX,GAAG,UAAU,OAAO,UAAU,UAAU,WAAW,IAAI,YAAY,WAAW,aAAa,OAAO,YAAY,UAChH;EAEF,KAAK,MAAM,WAAW,CAAC,QAAQ,MAAM,GACnC,IAAI,UAAU,gBAAgB,WAAW,OAAO,eAC9C,aAAa,KACX,GAAG,UAAU,gBAAgB,SAAS,oCAAoC,QAAQ,aAAa,OAAO,cAAc,UACtH;CAGN;CACA,IAAI,aAAa,SAAS,GAAG,OAAO,OAAO,gBAAgB,YAAY;CAEvE,MAAM,QAAkB,CAAC;CACzB,IAAI,OAAO,YAAY,QACjB;MAAA,UAAU,kBAAkB,QAAQ,UAAU,gBAAgB,OAAO,kBACvE,MAAM,KACJ,YAAY,UAAU,kBAAkB,OAAO,wBAAwB,QAAQ,UAAU,aAAa,EAAE,mCAAmC,QAAQ,OAAO,gBAAgB,EAAE,EAC9K;CAAA,OAEG,IAAI,UAAU,aAAa,QAAQ,UAAU,WAAW,OAAO,aACpE,MAAM,KACJ,YAAY,UAAU,aAAa,OAAO,eAAe,QAAQ,UAAU,QAAQ,EAAE,YAAY,QAAQ,OAAO,WAAW,GAC7H;CAEF,IACE,OAAO,YAAY,cAClB,UAAU,UAAU,QAAQ,UAAU,QAAQ,OAAO,WAEtD,MAAM,KACJ,SAAS,UAAU,UAAU,OAAO,cAAc,UAAU,MAAM,QAAQ,CAAC,EAAE,YAAY,OAAO,UAClG;CAEF,IAAI,MAAM,SAAS,GAAG,OAAO,OAAO,mBAAmB,KAAK;CAE5D,MAAM,WAAW,MAAM,WAAW,CAAC,EAAA,CAAG,QAAQ,aAAa,SAAS,YAAY,OAAO;CACvF,IAAI,QAAQ,SAAS,GAAG;EACtB,MAAM,SAAS,oBAAoB,CAAC,GAAG,OAAO,GAAG;GAC/C,MAAM,MAAM;GACZ,GAAI,OAAO,QAAQ,EAAE,YAAY,OAAO,MAAM,IAAI,CAAC;EACrD,CAAC;EACD,IAAI,CAAC,OAAO,SAAS,OAAO,OAAO,WAAW,OAAO,MAAM;CAC7D;CACA,OAAO,OAAO,cAAc,CAAC,CAAC;AAChC;;AAGA,IAAa,wBAAb,cAA2C,WAAW;CACpD;CAEA,YAAY,UAA6B;EACvC,MACE,UAAU,SAAS,QAAQ,kBAAkB,SAAS,OAAO,KAAK,SAAS,QAAQ,KAAK,IAAI,GAC9F;EACA,KAAK,WAAW;CAClB;AACF;;AAGA,SAAgB,mBAAmB,UAAmC;CACpE,IAAI,CAAC,SAAS,SAAS,MAAM,IAAI,sBAAsB,QAAQ;AACjE;;;;;;;;AASA,SAAgB,2BACd,WACA,UAAoD,CAAC,GACnC;CAClB,MAAM,OAAO,QAAQ,YAAY;CACjC,MAAM,OAAO,OACT,UAAU,kBAAkB,OAC1B,OACA,IAAI,UAAU,gBAChB,UAAU;CACd,IAAI,SAAS,MACX,MAAM,IAAI,gBACR,sCAAsC,UAAU,QAAQ,WAAW,OAAO,yBAAyB,OAAO,aAC5G;CAEF,MAAM,WAA6B;EACjC,IAAI,UAAU;EACd,SAAS,UAAU;EACnB,YAAY,UAAU;EACtB,SAAS;GACP,kBAAkB;GAClB,GAAI,QAAQ,UAAU,UAAU,OAAO,CAAC,IAAI,EAAE,kBAAkB,UAAU,MAAM;EAClF;CACF;CACA,yBAAyB,QAAQ;CACjC,OAAO;AACT"}

package/dist/{kind-factory-CbZ-6tvu.js → kind-factory-BobI5Jy3.js}

@@ -1,6 +1,6 @@
-import { a as LimitExceededError, n as CaptureIntegrityError, o as NotFoundError, s as ValidationError, t as AgentEvalError } from "./errors-Dngq5h35.js";
-import { a as hashCanonical, r as canonicalString } from "./canonical-BsZVgBhW.js";
-import { i as CostLedger } from "./cost-ledger-D2FnJPBF.js";
+import { a as LimitExceededError, n as CaptureIntegrityError, o as NotFoundError, s as ValidationError, t as AgentEvalError } from "./errors-DVZiqS7K.js";
+import { a as hashCanonical, r as canonicalString } from "./canonical-B2RqLofv.js";
+import { t as CostLedger } from "./cost-ledger-BP8V4kUQ.js";
 import { t as deepFreezeCanonicalJson } from "./deep-freeze-CurcOQg3.js";
 import { a as makeFinding, n as ANALYST_SEVERITIES } from "./types-IXD2HJzu.js";
 import { i as validateUsageSettlementTimeout, n as settleUsageReceiptFromCostLedger } from "./usage-receipt-Cx3xNeyB.js";
@@ -2081,4 +2081,4 @@ function truncateForContext(value, max) {
 //#endregion
 export { spanEpochMillis as A, FINDING_SUBJECT_SYNTAX as B, TraceFileTooLargeError as C, extractOtlpAttributes as D, compareSpanTime as E, parseRawFinding as F, DEFAULT_TRACE_ANALYST_OUTPUT_TOKENS as G, findingSubjectGrammarPromptFor as H, parseTraceSpanEvidenceUri as I, snapshotExactExecutionPlan as J, resolveTraceAnalystLimits as K, coerceJson as L, RAW_FINDING_SCHEMA_PROMPT as M, RawAnalystFindingSchema as N, firstStringAttr$1 as O, evidenceRefsFromRawFinding as P, stripCodeFences as R, TraceFileMissingError as S, asString as T, parseFindingSubject as U, KIND_EXPECTED_SUBJECTS as V, renderFindingSubject as W, SpanNotFoundError as _, TRACE_ANALYST_TOOL_NAMESPACE as a, TraceAnalysisValidationError as b, bindSpanSourceReader as c, compileSearchRegex as d, truncateForBudget as f, TRACE_ANALYSIS_LIMITS as g, TRACE_ANALYST_TRUNCATION_MARKER_PREFIX as h, buildTraceToolsForGroup as i, stringField as j, projectOtlpFlatLine as k, createBoundedTraceAnalysisStore as l, DEFAULT_TRACE_ANALYST_BUDGETS as m, renderPriorFindings as n, UNTRUSTED_TRACE_TEXT as o, validateInteger as p, snapshotExactExecutionComponentIdentity as q, runTraceAnalyst as r, buildTraceAnalysisToolDescriptors as s, createTraceAnalyst as t, traceSpanSchema as u, TraceAnalysisLimitError as v, TraceNotFoundError as w, TraceFileMalformedError as x, TraceAnalysisStoreContractError as y, FINDING_SUBJECT_KINDS as z };
 
-//# sourceMappingURL=kind-factory-CbZ-6tvu.js.map
+//# sourceMappingURL=kind-factory-BobI5Jy3.js.map