@tangle-network/agent-eval 0.161.1 → 0.170.0

package/dist/{backend-integrity-DxuQCu_A.d.ts.map → backend-integrity-e79K3UPD.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"backend-integrity-DxuQCu_A.d.ts","names":[],"sources":["../src/artifact-validator.ts","../src/completion-verifier.ts","../src/produced-state.ts","../src/integrity/backend-integrity.ts"],"mappings":";;;;;;;;;;;;;;;;;;;UAaiB;;EAEf;;EAEA;;EAEA;;EAEA,QAAQ;;EAER,WAAW;;;;;KCsBD;UAEK;;EAEf;;EAEA;;EAEA;;EAEA,cAAc;;UAGC;EACf;EACA,cAAc;;UAGC;EACf;EACA;EACA;;EAEA;;;UAIe;;EAEf,WAAW;;EAEX,WAAW;;EAEX;;UAGe;EACf;EACA;;EAEA;;;;;;EAMA;;EAEA;;;;;;;;;EASA;;EAEA;;EAEA;;;;;UAMe,0BAA0B;EACzC;EACA,cAAc;;EAEd;;EAEA;;EAEA;;;;;;;;;iBAUc,kBAAkB;EAChC;EACA,cAAc;;;EAGd,gBAAgB;IACd;;;;;;UAqCa;EACf,UAAU;EACV,SAAS;EACT;;;;;;;;;;;;UAae;GAEb,aAAa,uBACb,kBACC;IAAU;IAAkB;;EAC/B,cAAc;;;;;;;;;iBAsLM,iBACpB,MAAM,UACN,OAAO,eACP,kBAAkB,qBACjB,QAAQ;UAyGM;EACf;;EAEA,aAAa;EACb;EACA,WAAW;EACX,SAAS;;EAET;;;;;;EAMA;;;;;;EAMA,UAAU;;;;;;;;iBA2CI,4BACd,MAAM,YACN,OAAM,4BACL;;;;UCnhBc;EACf;EACA;;;;;;;UAQe;EACf;EACA;EACA;EACA;EACA;EACA;;;UAIe;EACf;EACA;EACA;EACA;EAIA;;;;;;;;KASU,mBACR,oBACA,oBACA;EACE;;;;;;;;;;;;iBAmBU,qBAAqB,iBAAiB,qBAAqB;;;UCpD1D;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;;;;cAQW,8BAA8B;WAGvB,QAAQ;EAF1B,YACE,iBACgB,QAAQ;;;;;;;iBAWZ,0BACd,SAAS,cAAc,aACtB;;;;;;;;iBAuHa,kBACd,SAAS,cAAc,YACvB;EAAQ;IACP"}
+{"version":3,"file":"backend-integrity-e79K3UPD.d.ts","names":[],"sources":["../src/artifact-validator.ts","../src/completion-verifier.ts","../src/produced-state.ts","../src/integrity/backend-integrity.ts"],"mappings":";;;;;;;;;;;;;;;;;;;UAaiB;;EAEf;;EAEA;;EAEA;;EAEA,QAAQ;;EAER,WAAW;;;;;KCsBD;UAEK;;EAEf;;EAEA;;EAEA;;EAEA,cAAc;;UAGC;EACf;EACA,cAAc;;UAGC;EACf;EACA;EACA;;EAEA;;;UAIe;;EAEf,WAAW;;EAEX,WAAW;;EAEX;;UAGe;EACf;EACA;;EAEA;;;;;;EAMA;;EAEA;;;;;;;;;EASA;;EAEA;;EAEA;;;;;UAMe,0BAA0B;EACzC;EACA,cAAc;;EAEd;;EAEA;;EAEA;;;;;;;;;iBAUc,kBAAkB;EAChC;EACA,cAAc;;;EAGd,gBAAgB;IACd;;;;;;UAqCa;EACf,UAAU;EACV,SAAS;EACT;;;;;;;;;;;;UAae;GAEb,aAAa,uBACb,kBACC;IAAU;IAAkB;;EAC/B,cAAc;;;;;;;;;iBAsLM,iBACpB,MAAM,UACN,OAAO,eACP,kBAAkB,qBACjB,QAAQ;UAyGM;EACf;;EAEA,aAAa;EACb;EACA,WAAW;EACX,SAAS;;EAET;;;;;;EAMA;;;;;;EAMA,UAAU;;;;;;;;iBA2CI,4BACd,MAAM,YACN,OAAM,4BACL;;;;UCnhBc;EACf;EACA;;;;;;;UAQe;EACf;EACA;EACA;EACA;EACA;EACA;;;UAIe;EACf;EACA;EACA;EACA;EAIA;;;;;;;;KASU,mBACR,oBACA,oBACA;EACE;;;;;;;;;;;;iBAmBU,qBAAqB,iBAAiB,qBAAqB;;;UCpD1D;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;;;;;;cAQW,8BAA8B;WAGvB,QAAQ;EAF1B,YACE,iBACgB,QAAQ;;;;;;;iBAWZ,0BACd,SAAS,cAAc,aACtB;;;;;;;;iBAuHa,kBACd,SAAS,cAAc,YACvB;EAAQ;IACP"}

package/dist/{baseline-BhPRQBVn.js → baseline-BC-eBZ7U.js}

@@ -1,4 +1,4 @@
-import { n as studentTQuantile, t as studentTCdf } from "./student-t-CvBq2mve.js";
+import { n as studentTQuantile, t as studentTCdf } from "./student-t-BA-Uy51p.js";
 import { n as cohensD } from "./effect-sizes-DiH8MGOH.js";
 //#region src/baseline.ts
 /**
@@ -147,4 +147,4 @@ function assertFiniteSample(name, sample) {
 //#endregion
 export { iqr as n, welchsTTest as r, compareToBaseline as t };
 
-//# sourceMappingURL=baseline-BhPRQBVn.js.map
+//# sourceMappingURL=baseline-BC-eBZ7U.js.map

package/dist/{baseline-BhPRQBVn.js.map → baseline-BC-eBZ7U.js.map}

@@ -1 +1 @@
-{"version":3,"file":"baseline-BhPRQBVn.js","names":[],"sources":["../src/baseline.ts"],"sourcesContent":["/**\n * Baseline regression detection.\n *\n * Lifted from ADC baseline.ts. Every promotion-blocking signal boils down\n * to: \"is this run measurably worse than baseline?\" — with enough\n * statistical rigor to distinguish noise from drift.\n *\n * Uses:\n *   - Welch's t-test (unequal variance) for per-metric mean comparison\n *   - Cohen's d for effect size magnitude\n *   - IQR for stability flag (unstable samples can't be trusted for comparisons)\n *\n * Returns a structured verdict: improved | regressed | stable | unstable.\n */\n\nimport { studentTCdf, studentTQuantile } from './math/student-t'\nimport { cohensD } from './statistics'\n\nexport interface MetricSamples {\n  /** Stable metric key (e.g. \"overallScore\", \"firstTokenMs\"). */\n  metric: string\n  /** Whether higher values are better. */\n  higherIsBetter: boolean\n  baseline: number[]\n  candidate: number[]\n}\n\nexport interface MetricVerdict {\n  metric: string\n  baselineMean: number\n  candidateMean: number\n  delta: number\n  /** Null when both samples are constant with unequal means — the\n   *  standardized effect is unbounded there, not zero. */\n  cohensD: number | null\n  welchT: number\n  welchDf: number\n  welchP: number\n  stable: boolean\n  /** IQR of the combined samples — used as a rough stability indicator. */\n  iqr: number\n  verdict: 'improved' | 'regressed' | 'stable' | 'unstable'\n}\n\nexport interface BaselineReport {\n  metrics: MetricVerdict[]\n  /** True if any critical metric regressed. */\n  hasRegression: boolean\n  /** True if any metric is unstable (too noisy to judge). */\n  hasUnstable: boolean\n}\n\nexport interface BaselineOptions {\n  /** Effect size threshold for meaningful delta (default 0.5 — medium effect). */\n  effectThreshold?: number\n  /** p-value threshold for statistical significance (default 0.05). */\n  alpha?: number\n  /** IQR/mean ratio above which samples are flagged unstable (default 0.30). */\n  unstableCvThreshold?: number\n}\n\nexport type WelchTestStatus = 'ok' | 'insufficient-sample' | 'zero-variance'\n\n/**\n * Full unequal-variance comparison for two independent samples.\n *\n * `meanB`, `delta`, `t`, and `cohensD` are oriented as `b - a`. Inferential\n * fields are `NaN` and `ci95` is null when the sample count or observed\n * variance cannot define a Student-t result. `status` makes that state\n * explicit so callers cannot mistake it for evidence of no difference.\n */\ninterface WelchTestResultBase {\n  meanA: number\n  meanB: number\n  delta: number\n}\n\nexport type WelchTestResult =\n  | (WelchTestResultBase & {\n      status: 'ok'\n      standardError: number\n      t: number\n      df: number\n      p: number\n      ci95: [number, number]\n      cohensD: number\n    })\n  | (WelchTestResultBase & {\n      status: 'insufficient-sample' | 'zero-variance'\n      standardError: number\n      t: number\n      df: number\n      p: number\n      ci95: null\n      cohensD: null\n    })\n\n/**\n * Compare candidate samples against baseline per metric. Verdict logic:\n *   - unstable: IQR/|mean| > threshold on either set — not enough signal\n *   - improved: meaningful effect in the \"better\" direction AND p < alpha\n *   - regressed: meaningful effect in the \"worse\" direction AND p < alpha\n *   - stable: otherwise (no significant change)\n */\nexport function compareToBaseline(\n  samples: MetricSamples[],\n  options: BaselineOptions = {},\n): BaselineReport {\n  const effectThreshold = options.effectThreshold ?? 0.5\n  const alpha = options.alpha ?? 0.05\n  const cvThreshold = options.unstableCvThreshold ?? 0.3\n\n  const metrics: MetricVerdict[] = samples.map((s) => {\n    const comparison = welchsTTest(s.baseline, s.candidate)\n    if (comparison.status === 'insufficient-sample') {\n      throw new Error(`compareToBaseline: need ≥2 samples per side for \"${s.metric}\"`)\n    }\n    const { meanA: bMean, meanB: cMean, delta, cohensD: d, t, df, p } = comparison\n    // Stability is per-side: a comparison is trustworthy only when BOTH\n    // samples are internally consistent. Combining the sides would flag\n    // large-but-real deltas as \"unstable\" which is exactly what we want\n    // to detect.\n    const baselineIqr = iqr(s.baseline)\n    const candidateIqr = iqr(s.candidate)\n    const baselineStable = baselineIqr / Math.max(Math.abs(bMean), 1e-9) <= cvThreshold\n    const candidateStable = candidateIqr / Math.max(Math.abs(cMean), 1e-9) <= cvThreshold\n    const stable = baselineStable && candidateStable\n    const reportedIqr = Math.max(baselineIqr, candidateIqr)\n\n    // Both sides are guaranteed ≥ 2 samples above, so a null d means zero\n    // pooled spread across a real mean gap: an unbounded standardized effect,\n    // which clears any finite threshold.\n    const effectClears = d === null || Math.abs(d) >= effectThreshold\n\n    let verdict: MetricVerdict['verdict']\n    if (!stable) {\n      verdict = 'unstable'\n    } else if (comparison.status === 'ok' && p < alpha && effectClears) {\n      const candidateIsBetter = s.higherIsBetter ? delta > 0 : delta < 0\n      verdict = candidateIsBetter ? 'improved' : 'regressed'\n    } else {\n      verdict = 'stable'\n    }\n\n    return {\n      metric: s.metric,\n      baselineMean: bMean,\n      candidateMean: cMean,\n      delta,\n      cohensD: d,\n      welchT: t,\n      welchDf: df,\n      welchP: p,\n      stable,\n      iqr: reportedIqr,\n      verdict,\n    }\n  })\n\n  return {\n    metrics,\n    hasRegression: metrics.some((m) => m.verdict === 'regressed'),\n    hasUnstable: metrics.some((m) => m.verdict === 'unstable'),\n  }\n}\n\nfunction mean(xs: number[]): number {\n  return xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\n/** Inter-quartile range; 0 when the sample has no spread. */\nexport function iqr(xs: number[]): number {\n  if (xs.length === 0) return 0\n  const sorted = [...xs].sort((a, b) => a - b)\n  const q = (p: number) => {\n    const idx = p * (sorted.length - 1)\n    const lo = Math.floor(idx)\n    const hi = Math.ceil(idx)\n    return sorted[lo]! + (sorted[hi]! - sorted[lo]!) * (idx - lo)\n  }\n  return q(0.75) - q(0.25)\n}\n\n/**\n * Welch's t-test and 95% interval for two independent samples.\n *\n * Uses the Student-t distribution at every finite degree of freedom. Fewer\n * than two observations per side and zero observed standard error cannot\n * define a t reference distribution; those cases return an explicit status,\n * `NaN` inferential fields, and no interval rather than fabricated certainty.\n */\nexport function welchsTTest(a: number[], b: number[]): WelchTestResult {\n  assertFiniteSample('a', a)\n  assertFiniteSample('b', b)\n  const mA = mean(a)\n  const mB = mean(b)\n  const delta = mB - mA\n  if (a.length < 2 || b.length < 2) {\n    return {\n      status: 'insufficient-sample',\n      meanA: mA,\n      meanB: mB,\n      delta,\n      standardError: Number.NaN,\n      t: Number.NaN,\n      df: Number.NaN,\n      p: Number.NaN,\n      ci95: null,\n      cohensD: null,\n    }\n  }\n\n  const vA = variance(a, mA)\n  const vB = variance(b, mB)\n  const seSquared = vA / a.length + vB / b.length\n  const d = cohensD(a, b)\n  if (seSquared === 0) {\n    return {\n      status: 'zero-variance',\n      meanA: mA,\n      meanB: mB,\n      delta,\n      standardError: 0,\n      t: delta === 0 ? 0 : Math.sign(delta) * Number.POSITIVE_INFINITY,\n      df: Number.NaN,\n      p: Number.NaN,\n      ci95: null,\n      cohensD: null,\n    }\n  }\n\n  const standardError = Math.sqrt(seSquared)\n  const t = delta / standardError\n  const df =\n    (seSquared * seSquared) /\n    ((vA / a.length) ** 2 / (a.length - 1) + (vB / b.length) ** 2 / (b.length - 1))\n  const p = 2 * (1 - studentTCdf(Math.abs(t), df))\n  if (d === null) {\n    throw new Error('welchsTTest: non-zero standard error produced no pooled effect size')\n  }\n  const halfWidth = studentTQuantile(0.975, df) * standardError\n  return {\n    status: 'ok',\n    meanA: mA,\n    meanB: mB,\n    delta,\n    standardError,\n    t,\n    df,\n    p,\n    ci95: [delta - halfWidth, delta + halfWidth],\n    cohensD: d,\n  }\n}\n\nfunction variance(xs: number[], m: number): number {\n  return xs.reduce((acc, x) => acc + (x - m) ** 2, 0) / (xs.length - 1)\n}\n\nfunction assertFiniteSample(name: string, sample: readonly number[]): void {\n  const invalid = sample.find((value) => !Number.isFinite(value))\n  if (invalid !== undefined) {\n    throw new RangeError(\n      `welchsTTest: sample ${name} must contain only finite values, got ${invalid}`,\n    )\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAwGA,SAAgB,kBACd,SACA,UAA2B,CAAC,GACZ;CAChB,MAAM,kBAAkB,QAAQ,mBAAmB;CACnD,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,cAAc,QAAQ,uBAAuB;CAEnD,MAAM,UAA2B,QAAQ,KAAK,MAAM;EAClD,MAAM,aAAa,YAAY,EAAE,UAAU,EAAE,SAAS;EACtD,IAAI,WAAW,WAAW,uBACxB,MAAM,IAAI,MAAM,oDAAoD,EAAE,OAAO,EAAE;EAEjF,MAAM,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,SAAS,GAAG,GAAG,IAAI,MAAM;EAKpE,MAAM,cAAc,IAAI,EAAE,QAAQ;EAClC,MAAM,eAAe,IAAI,EAAE,SAAS;EACpC,MAAM,iBAAiB,cAAc,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK;EACxE,MAAM,kBAAkB,eAAe,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK;EAC1E,MAAM,SAAS,kBAAkB;EACjC,MAAM,cAAc,KAAK,IAAI,aAAa,YAAY;EAKtD,MAAM,eAAe,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK;EAElD,IAAI;EACJ,IAAI,CAAC,QACH,UAAU;OACL,IAAI,WAAW,WAAW,QAAQ,IAAI,SAAS,cAEpD,WAD0B,EAAE,iBAAiB,QAAQ,IAAI,QAAQ,KACnC,aAAa;OAE3C,UAAU;EAGZ,OAAO;GACL,QAAQ,EAAE;GACV,cAAc;GACd,eAAe;GACf;GACA,SAAS;GACT,QAAQ;GACR,SAAS;GACT,QAAQ;GACR;GACA,KAAK;GACL;EACF;CACF,CAAC;CAED,OAAO;EACL;EACA,eAAe,QAAQ,MAAM,MAAM,EAAE,YAAY,WAAW;EAC5D,aAAa,QAAQ,MAAM,MAAM,EAAE,YAAY,UAAU;CAC3D;AACF;AAEA,SAAS,KAAK,IAAsB;CAClC,OAAO,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAC5C;;AAGA,SAAgB,IAAI,IAAsB;CACxC,IAAI,GAAG,WAAW,GAAG,OAAO;CAC5B,MAAM,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3C,MAAM,KAAK,MAAc;EACvB,MAAM,MAAM,KAAK,OAAO,SAAS;EACjC,MAAM,KAAK,KAAK,MAAM,GAAG;EACzB,MAAM,KAAK,KAAK,KAAK,GAAG;EACxB,OAAO,OAAO,OAAQ,OAAO,MAAO,OAAO,QAAS,MAAM;CAC5D;CACA,OAAO,EAAE,GAAI,IAAI,EAAE,GAAI;AACzB;;;;;;;;;AAUA,SAAgB,YAAY,GAAa,GAA8B;CACrE,mBAAmB,KAAK,CAAC;CACzB,mBAAmB,KAAK,CAAC;CACzB,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,QAAQ,KAAK;CACnB,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,GAC7B,OAAO;EACL,QAAQ;EACR,OAAO;EACP,OAAO;EACP;EACA,eAAe;EACf,GAAG;EACH,IAAI;EACJ,GAAG;EACH,MAAM;EACN,SAAS;CACX;CAGF,MAAM,KAAK,SAAS,GAAG,EAAE;CACzB,MAAM,KAAK,SAAS,GAAG,EAAE;CACzB,MAAM,YAAY,KAAK,EAAE,SAAS,KAAK,EAAE;CACzC,MAAM,IAAI,QAAQ,GAAG,CAAC;CACtB,IAAI,cAAc,GAChB,OAAO;EACL,QAAQ;EACR,OAAO;EACP,OAAO;EACP;EACA,eAAe;EACf,GAAG,UAAU,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,OAAO;EAC/C,IAAI;EACJ,GAAG;EACH,MAAM;EACN,SAAS;CACX;CAGF,MAAM,gBAAgB,KAAK,KAAK,SAAS;CACzC,MAAM,IAAI,QAAQ;CAClB,MAAM,KACH,YAAY,cACX,KAAK,EAAE,WAAW,KAAK,EAAE,SAAS,MAAM,KAAK,EAAE,WAAW,KAAK,EAAE,SAAS;CAC9E,MAAM,IAAI,KAAK,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,EAAE;CAC9C,IAAI,MAAM,MACR,MAAM,IAAI,MAAM,qEAAqE;CAEvF,MAAM,YAAY,iBAAiB,MAAO,EAAE,IAAI;CAChD,OAAO;EACL,QAAQ;EACR,OAAO;EACP,OAAO;EACP;EACA;EACA;EACA;EACA;EACA,MAAM,CAAC,QAAQ,WAAW,QAAQ,SAAS;EAC3C,SAAS;CACX;AACF;AAEA,SAAS,SAAS,IAAc,GAAmB;CACjD,OAAO,GAAG,QAAQ,KAAK,MAAM,OAAO,IAAI,MAAM,GAAG,CAAC,KAAK,GAAG,SAAS;AACrE;AAEA,SAAS,mBAAmB,MAAc,QAAiC;CACzE,MAAM,UAAU,OAAO,MAAM,UAAU,CAAC,OAAO,SAAS,KAAK,CAAC;CAC9D,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,WACR,uBAAuB,KAAK,wCAAwC,SACtE;AAEJ"}
+{"version":3,"file":"baseline-BC-eBZ7U.js","names":[],"sources":["../src/baseline.ts"],"sourcesContent":["/**\n * Baseline regression detection.\n *\n * Lifted from ADC baseline.ts. Every promotion-blocking signal boils down\n * to: \"is this run measurably worse than baseline?\" — with enough\n * statistical rigor to distinguish noise from drift.\n *\n * Uses:\n *   - Welch's t-test (unequal variance) for per-metric mean comparison\n *   - Cohen's d for effect size magnitude\n *   - IQR for stability flag (unstable samples can't be trusted for comparisons)\n *\n * Returns a structured verdict: improved | regressed | stable | unstable.\n */\n\nimport { studentTCdf, studentTQuantile } from './math/student-t'\nimport { cohensD } from './statistics'\n\nexport interface MetricSamples {\n  /** Stable metric key (e.g. \"overallScore\", \"firstTokenMs\"). */\n  metric: string\n  /** Whether higher values are better. */\n  higherIsBetter: boolean\n  baseline: number[]\n  candidate: number[]\n}\n\nexport interface MetricVerdict {\n  metric: string\n  baselineMean: number\n  candidateMean: number\n  delta: number\n  /** Null when both samples are constant with unequal means — the\n   *  standardized effect is unbounded there, not zero. */\n  cohensD: number | null\n  welchT: number\n  welchDf: number\n  welchP: number\n  stable: boolean\n  /** IQR of the combined samples — used as a rough stability indicator. */\n  iqr: number\n  verdict: 'improved' | 'regressed' | 'stable' | 'unstable'\n}\n\nexport interface BaselineReport {\n  metrics: MetricVerdict[]\n  /** True if any critical metric regressed. */\n  hasRegression: boolean\n  /** True if any metric is unstable (too noisy to judge). */\n  hasUnstable: boolean\n}\n\nexport interface BaselineOptions {\n  /** Effect size threshold for meaningful delta (default 0.5 — medium effect). */\n  effectThreshold?: number\n  /** p-value threshold for statistical significance (default 0.05). */\n  alpha?: number\n  /** IQR/mean ratio above which samples are flagged unstable (default 0.30). */\n  unstableCvThreshold?: number\n}\n\nexport type WelchTestStatus = 'ok' | 'insufficient-sample' | 'zero-variance'\n\n/**\n * Full unequal-variance comparison for two independent samples.\n *\n * `meanB`, `delta`, `t`, and `cohensD` are oriented as `b - a`. Inferential\n * fields are `NaN` and `ci95` is null when the sample count or observed\n * variance cannot define a Student-t result. `status` makes that state\n * explicit so callers cannot mistake it for evidence of no difference.\n */\ninterface WelchTestResultBase {\n  meanA: number\n  meanB: number\n  delta: number\n}\n\nexport type WelchTestResult =\n  | (WelchTestResultBase & {\n      status: 'ok'\n      standardError: number\n      t: number\n      df: number\n      p: number\n      ci95: [number, number]\n      cohensD: number\n    })\n  | (WelchTestResultBase & {\n      status: 'insufficient-sample' | 'zero-variance'\n      standardError: number\n      t: number\n      df: number\n      p: number\n      ci95: null\n      cohensD: null\n    })\n\n/**\n * Compare candidate samples against baseline per metric. Verdict logic:\n *   - unstable: IQR/|mean| > threshold on either set — not enough signal\n *   - improved: meaningful effect in the \"better\" direction AND p < alpha\n *   - regressed: meaningful effect in the \"worse\" direction AND p < alpha\n *   - stable: otherwise (no significant change)\n */\nexport function compareToBaseline(\n  samples: MetricSamples[],\n  options: BaselineOptions = {},\n): BaselineReport {\n  const effectThreshold = options.effectThreshold ?? 0.5\n  const alpha = options.alpha ?? 0.05\n  const cvThreshold = options.unstableCvThreshold ?? 0.3\n\n  const metrics: MetricVerdict[] = samples.map((s) => {\n    const comparison = welchsTTest(s.baseline, s.candidate)\n    if (comparison.status === 'insufficient-sample') {\n      throw new Error(`compareToBaseline: need ≥2 samples per side for \"${s.metric}\"`)\n    }\n    const { meanA: bMean, meanB: cMean, delta, cohensD: d, t, df, p } = comparison\n    // Stability is per-side: a comparison is trustworthy only when BOTH\n    // samples are internally consistent. Combining the sides would flag\n    // large-but-real deltas as \"unstable\" which is exactly what we want\n    // to detect.\n    const baselineIqr = iqr(s.baseline)\n    const candidateIqr = iqr(s.candidate)\n    const baselineStable = baselineIqr / Math.max(Math.abs(bMean), 1e-9) <= cvThreshold\n    const candidateStable = candidateIqr / Math.max(Math.abs(cMean), 1e-9) <= cvThreshold\n    const stable = baselineStable && candidateStable\n    const reportedIqr = Math.max(baselineIqr, candidateIqr)\n\n    // Both sides are guaranteed ≥ 2 samples above, so a null d means zero\n    // pooled spread across a real mean gap: an unbounded standardized effect,\n    // which clears any finite threshold.\n    const effectClears = d === null || Math.abs(d) >= effectThreshold\n\n    let verdict: MetricVerdict['verdict']\n    if (!stable) {\n      verdict = 'unstable'\n    } else if (comparison.status === 'ok' && p < alpha && effectClears) {\n      const candidateIsBetter = s.higherIsBetter ? delta > 0 : delta < 0\n      verdict = candidateIsBetter ? 'improved' : 'regressed'\n    } else {\n      verdict = 'stable'\n    }\n\n    return {\n      metric: s.metric,\n      baselineMean: bMean,\n      candidateMean: cMean,\n      delta,\n      cohensD: d,\n      welchT: t,\n      welchDf: df,\n      welchP: p,\n      stable,\n      iqr: reportedIqr,\n      verdict,\n    }\n  })\n\n  return {\n    metrics,\n    hasRegression: metrics.some((m) => m.verdict === 'regressed'),\n    hasUnstable: metrics.some((m) => m.verdict === 'unstable'),\n  }\n}\n\nfunction mean(xs: number[]): number {\n  return xs.reduce((a, b) => a + b, 0) / xs.length\n}\n\n/** Inter-quartile range; 0 when the sample has no spread. */\nexport function iqr(xs: number[]): number {\n  if (xs.length === 0) return 0\n  const sorted = [...xs].sort((a, b) => a - b)\n  const q = (p: number) => {\n    const idx = p * (sorted.length - 1)\n    const lo = Math.floor(idx)\n    const hi = Math.ceil(idx)\n    return sorted[lo]! + (sorted[hi]! - sorted[lo]!) * (idx - lo)\n  }\n  return q(0.75) - q(0.25)\n}\n\n/**\n * Welch's t-test and 95% interval for two independent samples.\n *\n * Uses the Student-t distribution at every finite degree of freedom. Fewer\n * than two observations per side and zero observed standard error cannot\n * define a t reference distribution; those cases return an explicit status,\n * `NaN` inferential fields, and no interval rather than fabricated certainty.\n */\nexport function welchsTTest(a: number[], b: number[]): WelchTestResult {\n  assertFiniteSample('a', a)\n  assertFiniteSample('b', b)\n  const mA = mean(a)\n  const mB = mean(b)\n  const delta = mB - mA\n  if (a.length < 2 || b.length < 2) {\n    return {\n      status: 'insufficient-sample',\n      meanA: mA,\n      meanB: mB,\n      delta,\n      standardError: Number.NaN,\n      t: Number.NaN,\n      df: Number.NaN,\n      p: Number.NaN,\n      ci95: null,\n      cohensD: null,\n    }\n  }\n\n  const vA = variance(a, mA)\n  const vB = variance(b, mB)\n  const seSquared = vA / a.length + vB / b.length\n  const d = cohensD(a, b)\n  if (seSquared === 0) {\n    return {\n      status: 'zero-variance',\n      meanA: mA,\n      meanB: mB,\n      delta,\n      standardError: 0,\n      t: delta === 0 ? 0 : Math.sign(delta) * Number.POSITIVE_INFINITY,\n      df: Number.NaN,\n      p: Number.NaN,\n      ci95: null,\n      cohensD: null,\n    }\n  }\n\n  const standardError = Math.sqrt(seSquared)\n  const t = delta / standardError\n  const df =\n    (seSquared * seSquared) /\n    ((vA / a.length) ** 2 / (a.length - 1) + (vB / b.length) ** 2 / (b.length - 1))\n  const p = 2 * (1 - studentTCdf(Math.abs(t), df))\n  if (d === null) {\n    throw new Error('welchsTTest: non-zero standard error produced no pooled effect size')\n  }\n  const halfWidth = studentTQuantile(0.975, df) * standardError\n  return {\n    status: 'ok',\n    meanA: mA,\n    meanB: mB,\n    delta,\n    standardError,\n    t,\n    df,\n    p,\n    ci95: [delta - halfWidth, delta + halfWidth],\n    cohensD: d,\n  }\n}\n\nfunction variance(xs: number[], m: number): number {\n  return xs.reduce((acc, x) => acc + (x - m) ** 2, 0) / (xs.length - 1)\n}\n\nfunction assertFiniteSample(name: string, sample: readonly number[]): void {\n  const invalid = sample.find((value) => !Number.isFinite(value))\n  if (invalid !== undefined) {\n    throw new RangeError(\n      `welchsTTest: sample ${name} must contain only finite values, got ${invalid}`,\n    )\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAwGA,SAAgB,kBACd,SACA,UAA2B,CAAC,GACZ;CAChB,MAAM,kBAAkB,QAAQ,mBAAmB;CACnD,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,cAAc,QAAQ,uBAAuB;CAEnD,MAAM,UAA2B,QAAQ,KAAK,MAAM;EAClD,MAAM,aAAa,YAAY,EAAE,UAAU,EAAE,SAAS;EACtD,IAAI,WAAW,WAAW,uBACxB,MAAM,IAAI,MAAM,oDAAoD,EAAE,OAAO,EAAE;EAEjF,MAAM,EAAE,OAAO,OAAO,OAAO,OAAO,OAAO,SAAS,GAAG,GAAG,IAAI,MAAM;EAKpE,MAAM,cAAc,IAAI,EAAE,QAAQ;EAClC,MAAM,eAAe,IAAI,EAAE,SAAS;EACpC,MAAM,iBAAiB,cAAc,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK;EACxE,MAAM,kBAAkB,eAAe,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK;EAC1E,MAAM,SAAS,kBAAkB;EACjC,MAAM,cAAc,KAAK,IAAI,aAAa,YAAY;EAKtD,MAAM,eAAe,MAAM,QAAQ,KAAK,IAAI,CAAC,KAAK;EAElD,IAAI;EACJ,IAAI,CAAC,QACH,UAAU;OACL,IAAI,WAAW,WAAW,QAAQ,IAAI,SAAS,cAEpD,WAD0B,EAAE,iBAAiB,QAAQ,IAAI,QAAQ,KACnC,aAAa;OAE3C,UAAU;EAGZ,OAAO;GACL,QAAQ,EAAE;GACV,cAAc;GACd,eAAe;GACf;GACA,SAAS;GACT,QAAQ;GACR,SAAS;GACT,QAAQ;GACR;GACA,KAAK;GACL;EACF;CACF,CAAC;CAED,OAAO;EACL;EACA,eAAe,QAAQ,MAAM,MAAM,EAAE,YAAY,WAAW;EAC5D,aAAa,QAAQ,MAAM,MAAM,EAAE,YAAY,UAAU;CAC3D;AACF;AAEA,SAAS,KAAK,IAAsB;CAClC,OAAO,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAC5C;;AAGA,SAAgB,IAAI,IAAsB;CACxC,IAAI,GAAG,WAAW,GAAG,OAAO;CAC5B,MAAM,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3C,MAAM,KAAK,MAAc;EACvB,MAAM,MAAM,KAAK,OAAO,SAAS;EACjC,MAAM,KAAK,KAAK,MAAM,GAAG;EACzB,MAAM,KAAK,KAAK,KAAK,GAAG;EACxB,OAAO,OAAO,OAAQ,OAAO,MAAO,OAAO,QAAS,MAAM;CAC5D;CACA,OAAO,EAAE,GAAI,IAAI,EAAE,GAAI;AACzB;;;;;;;;;AAUA,SAAgB,YAAY,GAAa,GAA8B;CACrE,mBAAmB,KAAK,CAAC;CACzB,mBAAmB,KAAK,CAAC;CACzB,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,KAAK,KAAK,CAAC;CACjB,MAAM,QAAQ,KAAK;CACnB,IAAI,EAAE,SAAS,KAAK,EAAE,SAAS,GAC7B,OAAO;EACL,QAAQ;EACR,OAAO;EACP,OAAO;EACP;EACA,eAAe;EACf,GAAG;EACH,IAAI;EACJ,GAAG;EACH,MAAM;EACN,SAAS;CACX;CAGF,MAAM,KAAK,SAAS,GAAG,EAAE;CACzB,MAAM,KAAK,SAAS,GAAG,EAAE;CACzB,MAAM,YAAY,KAAK,EAAE,SAAS,KAAK,EAAE;CACzC,MAAM,IAAI,QAAQ,GAAG,CAAC;CACtB,IAAI,cAAc,GAChB,OAAO;EACL,QAAQ;EACR,OAAO;EACP,OAAO;EACP;EACA,eAAe;EACf,GAAG,UAAU,IAAI,IAAI,KAAK,KAAK,KAAK,IAAI,OAAO;EAC/C,IAAI;EACJ,GAAG;EACH,MAAM;EACN,SAAS;CACX;CAGF,MAAM,gBAAgB,KAAK,KAAK,SAAS;CACzC,MAAM,IAAI,QAAQ;CAClB,MAAM,KACH,YAAY,cACX,KAAK,EAAE,WAAW,KAAK,EAAE,SAAS,MAAM,KAAK,EAAE,WAAW,KAAK,EAAE,SAAS;CAC9E,MAAM,IAAI,KAAK,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,EAAE;CAC9C,IAAI,MAAM,MACR,MAAM,IAAI,MAAM,qEAAqE;CAEvF,MAAM,YAAY,iBAAiB,MAAO,EAAE,IAAI;CAChD,OAAO;EACL,QAAQ;EACR,OAAO;EACP,OAAO;EACP;EACA;EACA;EACA;EACA;EACA,MAAM,CAAC,QAAQ,WAAW,QAAQ,SAAS;EAC3C,SAAS;CACX;AACF;AAEA,SAAS,SAAS,IAAc,GAAmB;CACjD,OAAO,GAAG,QAAQ,KAAK,MAAM,OAAO,IAAI,MAAM,GAAG,CAAC,KAAK,GAAG,SAAS;AACrE;AAEA,SAAS,mBAAmB,MAAc,QAAiC;CACzE,MAAM,UAAU,OAAO,MAAM,UAAU,CAAC,OAAO,SAAS,KAAK,CAAC;CAC9D,IAAI,YAAY,KAAA,GACd,MAAM,IAAI,WACR,uBAAuB,KAAK,wCAAwC,SACtE;AAEJ"}

package/dist/{benchmark-BhT16ep9.js → benchmark-C4wk_Sjr.js}

@@ -1,4 +1,5 @@
-import { i as assertValidAnalystUsageReceipt } from "./types-BI4fT3HN.js";
+import { i as compareCodeUnits } from "./canonical-DPyQ_rpt.js";
+import { a as assertValidAnalystUsageReceipt } from "./types-CiWITkGo.js";
 import { performance } from "node:perf_hooks";
 import { linearSumAssignment } from "linear-sum-assignment";
 //#region src/analyst/benchmark-scoring.ts
@@ -226,7 +227,7 @@ function predictionSignature(observation) {
 		evidence.kind,
 		evidence.uri,
 		evidence.excerpt ?? null
-	]).sort((left, right) => JSON.stringify(left).localeCompare(JSON.stringify(right)))])).sort();
+	]).sort((left, right) => compareCodeUnits(JSON.stringify(left), JSON.stringify(right)))])).sort();
 }
 function jaccard(left, right) {
 	const a = new Set(left);
@@ -506,6 +507,12 @@ function assertUniqueNonEmpty(values, label) {
 		seen.add(value);
 	}
 }
+/** 32-bit FNV-1a over raw UTF-16 code units, left SIGNED so subtracting two
+*  results is a valid comparator.
+*
+*  Frozen: it fixes the runner order a benchmark reports. Adding the `>>> 0`
+*  the other variants carry would change that order, which is why this one
+*  does not have it. */
 function stableHash(value) {
 	let hash = 2166136261;
 	for (let index = 0; index < value.length; index += 1) {
@@ -551,4 +558,4 @@ function mergeRegistryUsage(result) {
 //#endregion
 export { scoreAnalystFindings as a, summarizeAnalystBenchmarkRunner as i, runAnalystBenchmark as n, traceStoreEvidenceResolver as r, registryBenchmarkRunner as t };
 
-//# sourceMappingURL=benchmark-BhT16ep9.js.map
+//# sourceMappingURL=benchmark-C4wk_Sjr.js.map

package/dist/benchmark-C4wk_Sjr.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmark-C4wk_Sjr.js","names":[],"sources":["../src/analyst/benchmark-scoring.ts","../src/analyst/benchmark-summary.ts","../src/analyst/benchmark.ts"],"sourcesContent":["import { linearSumAssignment } from 'linear-sum-assignment'\nimport type {\n  AnalystBenchmarkCase,\n  AnalystEvidenceExpectation,\n  AnalystFindingScore,\n  AnalystIssueExpectation,\n} from './benchmark'\nimport type { AnalystFinding, EvidenceRef } from './types'\n\nexport function scoreAnalystFindings(\n  testCase: Pick<AnalystBenchmarkCase, 'id' | 'expectedIssues' | 'labeledEvidence'>,\n  findings: readonly AnalystFinding[],\n): AnalystFindingScore {\n  assertValidAnalystScoringCase(testCase)\n  const matchedFindingByIssue = matchFindingsToIssues(testCase.expectedIssues, findings)\n  const matchedIssueIds = testCase.expectedIssues\n    .filter((_, index) => matchedFindingByIssue.has(index))\n    .map((issue) => issue.id)\n  const missedIssueIds = testCase.expectedIssues\n    .filter((_, index) => !matchedFindingByIssue.has(index))\n    .map((issue) => issue.id)\n  const supportedFindingIndexes = new Set(matchedFindingByIssue.values())\n\n  const unsupportedFindingIndexes = findings\n    .map((_, index) => index)\n    .filter((index) => !supportedFindingIndexes.has(index))\n  const expectedIssueCount = testCase.expectedIssues.length\n  const issueRecall = expectedIssueCount === 0 ? 1 : matchedIssueIds.length / expectedIssueCount\n  const findingPrecision =\n    findings.length === 0\n      ? expectedIssueCount === 0\n        ? 1\n        : 0\n      : supportedFindingIndexes.size / findings.length\n  const f1 = harmonicMeanScore(findingPrecision, issueRecall)\n  const allEvidence = findings.flatMap((finding) => finding.evidence_refs)\n\n  const criticalIssues = testCase.expectedIssues.filter(\n    (issue) => (issue.criticalEvidence?.length ?? 0) > 0,\n  )\n  const criticalHits = testCase.expectedIssues.filter((issue) => {\n    if ((issue.criticalEvidence?.length ?? 0) === 0) return false\n    return matchesEvidence(allEvidence, issue.criticalEvidence ?? [], 'any')\n  }).length\n\n  const findingsWithEvidence = findings.filter((finding) => finding.evidence_refs.length > 0).length\n  const unlabeledEvidence = testCase.labeledEvidence\n    ? allEvidence.filter(\n        (ref) => !testCase.labeledEvidence!.some((expected) => evidenceMatches(ref, expected)),\n      )\n    : []\n\n  return {\n    expectedIssueCount,\n    matchedIssueIds,\n    missedIssueIds,\n    supportedFindingIndexes: [...supportedFindingIndexes].sort((a, b) => a - b),\n    unsupportedFindingIndexes,\n    unlabeledEvidence,\n    issueRecall,\n    findingPrecision,\n    f1,\n    criticalStepAccuracy: criticalIssues.length === 0 ? null : criticalHits / criticalIssues.length,\n    citationCoverage: findings.length === 0 ? null : findingsWithEvidence / findings.length,\n    citationExcerptCoverage:\n      allEvidence.length === 0\n        ? null\n        : allEvidence.filter((evidence) => Boolean(evidence.excerpt?.trim())).length /\n          allEvidence.length,\n    citationLabelAgreement:\n      testCase.labeledEvidence === undefined\n        ? null\n        : allEvidence.length === 0\n          ? findings.length === 0\n            ? null\n            : 0\n          : (allEvidence.length - unlabeledEvidence.length) / allEvidence.length,\n    predictionOnLabelEmptyCase: expectedIssueCount === 0 && findings.length > 0,\n  }\n}\n\nexport function assertValidAnalystScoringCase(\n  testCase: Pick<AnalystBenchmarkCase, 'id' | 'expectedIssues' | 'labeledEvidence'>,\n): void {\n  if (!testCase.id.trim()) throw new TypeError('analyst benchmark case id must not be empty')\n  const ids = new Set<string>()\n  for (const issue of testCase.expectedIssues) {\n    if (!issue.id.trim()) throw new TypeError(`${testCase.id}: expected issue id must not be empty`)\n    if (ids.has(issue.id)) {\n      throw new TypeError(`${testCase.id}: duplicate expected issue id '${issue.id}'`)\n    }\n    ids.add(issue.id)\n    if (\n      !issue.findingIds?.length &&\n      !issue.areas?.length &&\n      !issue.subjects?.length &&\n      !issue.evidence?.length\n    ) {\n      throw new TypeError(\n        `${testCase.id}/${issue.id}: expected issue must identify a finding by id, area, subject, or evidence`,\n      )\n    }\n  }\n  for (const ref of testCase.labeledEvidence ?? []) {\n    if (!ref.uri.trim()) {\n      throw new TypeError(`${testCase.id}: labeled evidence URI must not be empty`)\n    }\n  }\n}\n\nexport function harmonicMeanScore(a: number, b: number): number {\n  return a + b === 0 ? 0 : (2 * a * b) / (a + b)\n}\n\nfunction matchFindingsToIssues(\n  issues: readonly AnalystIssueExpectation[],\n  findings: readonly AnalystFinding[],\n): Map<number, number> {\n  if (issues.length === 0) return new Map()\n  const cardinalityWeight = issues.length + 1\n  const scores = issues.map((issue) => [\n    ...findings.map((finding) => {\n      if (!findingMatchesIssue(finding, issue)) return -1\n      const criticalHit =\n        (issue.criticalEvidence?.length ?? 0) > 0 &&\n        matchesEvidence(finding.evidence_refs, issue.criticalEvidence ?? [], 'any')\n      return cardinalityWeight + Number(criticalHit)\n    }),\n    ...Array.from({ length: issues.length }, () => 0),\n  ])\n  const assignment = linearSumAssignment(scores, { maximaze: true }).rowAssignments\n  const matches = new Map<number, number>()\n  for (const [issueIndex, column] of assignment.entries()) {\n    if (column < 0 || column >= findings.length) continue\n    if (!findingMatchesIssue(findings[column]!, issues[issueIndex]!)) continue\n    matches.set(issueIndex, column)\n  }\n  return matches\n}\n\nfunction findingMatchesIssue(finding: AnalystFinding, issue: AnalystIssueExpectation): boolean {\n  if (issue.findingIds && !issue.findingIds.includes(finding.finding_id)) return false\n  if (issue.areas && !issue.areas.includes(finding.area)) return false\n  if (issue.subjects && (!finding.subject || !issue.subjects.includes(finding.subject))) {\n    return false\n  }\n  if (\n    issue.evidence &&\n    !matchesEvidence(finding.evidence_refs, issue.evidence, issue.evidenceMode ?? 'any')\n  ) {\n    return false\n  }\n  return true\n}\n\nfunction matchesEvidence(\n  actual: readonly EvidenceRef[],\n  expected: readonly AnalystEvidenceExpectation[],\n  mode: 'any' | 'all',\n): boolean {\n  if (expected.length === 0) return true\n  const match = (target: AnalystEvidenceExpectation) =>\n    actual.some((ref) => evidenceMatches(ref, target))\n  return mode === 'all' ? expected.every(match) : expected.some(match)\n}\n\nfunction evidenceMatches(actual: EvidenceRef, expected: AnalystEvidenceExpectation): boolean {\n  return (\n    actual.uri === expected.uri && (expected.kind === undefined || actual.kind === expected.kind)\n  )\n}\n","import { compareCodeUnits } from '../ledger-core/canonical'\nimport type {\n  AnalystBenchmarkObservation,\n  AnalystBenchmarkSummary,\n  AnalystLatencyDistribution,\n} from './benchmark'\n\nimport { harmonicMeanScore } from './benchmark-scoring'\n\nexport function summarizeAnalystBenchmarkRunner(\n  runnerId: string,\n  observations: readonly AnalystBenchmarkObservation[],\n): AnalystBenchmarkSummary {\n  const issueBearing = observations.filter((observation) => observation.labelState === 'positive')\n  const completed = observations.filter((observation) => !observation.error)\n  const expectedIssues = issueBearing.reduce(\n    (sum, observation) => sum + observation.score.expectedIssueCount,\n    0,\n  )\n  const matchedIssues = issueBearing.reduce(\n    (sum, observation) => sum + observation.score.matchedIssueIds.length,\n    0,\n  )\n  const issueFindings = issueBearing.reduce(\n    (sum, observation) => sum + (observation.error ? 0 : observation.findings.length),\n    0,\n  )\n  const supportedFindings = issueBearing.reduce(\n    (sum, observation) => sum + observation.score.supportedFindingIndexes.length,\n    0,\n  )\n  const issueRecall = expectedIssues === 0 ? null : matchedIssues / expectedIssues\n  const findingPrecision =\n    expectedIssues === 0 ? null : issueFindings === 0 ? 0 : supportedFindings / issueFindings\n  const macroIssueRecall =\n    issueBearing.length === 0\n      ? null\n      : mean(issueBearing.map((observation) => observation.score.issueRecall))\n  const macroFindingPrecision =\n    issueBearing.length === 0\n      ? null\n      : mean(issueBearing.map((observation) => observation.score.findingPrecision))\n  const macroF1 =\n    issueBearing.length === 0 ? null : mean(issueBearing.map((observation) => observation.score.f1))\n  const critical = observations\n    .map((observation) => observation.score.criticalStepAccuracy)\n    .filter((value): value is number => value !== null)\n  const findingsWithEvidence = completed.reduce(\n    (sum, observation) =>\n      sum + observation.findings.filter((finding) => finding.evidence_refs.length > 0).length,\n    0,\n  )\n  const allFindings = completed.reduce((sum, observation) => sum + observation.findings.length, 0)\n  const allCitations = completed.flatMap((observation) =>\n    observation.findings.flatMap((finding) => finding.evidence_refs),\n  )\n  const citationObservations = completed.filter(\n    (observation) => observation.score.citationLabelAgreement !== null,\n  )\n  const citationCount = citationObservations.reduce(\n    (sum, observation) =>\n      sum +\n      observation.findings.reduce((count, finding) => count + finding.evidence_refs.length, 0),\n    0,\n  )\n  const invalidCitationCount = citationObservations.reduce(\n    (sum, observation) => sum + observation.score.unlabeledEvidence.length,\n    0,\n  )\n  const trustedNegative = observations.filter(\n    (observation) => observation.labelState === 'trusted-negative',\n  )\n  const completedTrustedNegative = trustedNegative.filter((observation) => !observation.error)\n  const unlabeled = observations.filter((observation) => observation.labelState === 'unlabeled')\n  const completedUnlabeled = unlabeled.filter((observation) => !observation.error)\n  const resolvedCitations = completed.reduce(\n    (sum, observation) => sum + (observation.evidenceResolution?.resolved ?? 0),\n    0,\n  )\n  const unresolvedCitations = completed.reduce(\n    (sum, observation) => sum + (observation.evidenceResolution?.unresolvedEvidence.length ?? 0),\n    0,\n  )\n  const citationResolutionErrors = completed.reduce(\n    (sum, observation) => sum + (observation.evidenceResolution?.errors.length ?? 0),\n    0,\n  )\n  const resolutionAttempts = completed.filter((observation) =>\n    observation.findings.some((finding) => finding.evidence_refs.length > 0),\n  )\n  const citationResolutionUnknownRuns = resolutionAttempts.filter(\n    (observation) =>\n      !observation.evidenceResolution || observation.evidenceResolution.errors.length > 0,\n  ).length\n  const usages = observations.map((observation) => observation.usage)\n  const knownCostUsd = stableSum(\n    usages.map((usage) => {\n      if (!usage) return 0\n      return usage.cost.kind === 'uncaptured' ? (usage.knownCostUsd ?? 0) : usage.cost.usd\n    }),\n  )\n  const predictionAgreement = repeatedObservationAgreement(observations, predictionSignature)\n  const matchedLabelAgreement = repeatedObservationAgreement(\n    observations.filter((observation) => observation.labelState === 'positive'),\n    matchedLabelSignature,\n  )\n  return {\n    runnerId,\n    plannedRuns: observations.length,\n    completedRuns: observations.filter((observation) => !observation.error).length,\n    failedRuns: observations.filter((observation) => Boolean(observation.error)).length,\n    issueBearingRuns: issueBearing.length,\n    trustedNegativeRuns: trustedNegative.length,\n    unlabeledRuns: unlabeled.length,\n    issueRecall,\n    findingPrecision,\n    f1:\n      findingPrecision === null || issueRecall === null\n        ? null\n        : harmonicMeanScore(findingPrecision, issueRecall),\n    macroIssueRecall,\n    macroFindingPrecision,\n    macroF1,\n    criticalStepAccuracy: critical.length === 0 ? null : mean(critical),\n    citationCoverage: allFindings === 0 ? null : findingsWithEvidence / allFindings,\n    citationExcerptCoverage:\n      allCitations.length === 0\n        ? null\n        : allCitations.filter((evidence) => Boolean(evidence.excerpt?.trim())).length /\n          allCitations.length,\n    citationLabelAgreement:\n      citationObservations.length === 0\n        ? null\n        : citationCount === 0\n          ? 0\n          : (citationCount - invalidCitationCount) / citationCount,\n    citationResolution:\n      resolutionAttempts.length === 0 ||\n      citationResolutionUnknownRuns > 0 ||\n      resolvedCitations + unresolvedCitations === 0\n        ? null\n        : resolvedCitations / (resolvedCitations + unresolvedCitations),\n    citationResolutionUnknownRuns,\n    unresolvedCitations,\n    citationResolutionErrors,\n    trustedNegativeFalsePositiveRate:\n      completedTrustedNegative.length === 0\n        ? null\n        : completedTrustedNegative.filter(\n            (observation) => observation.score.predictionOnLabelEmptyCase,\n          ).length / completedTrustedNegative.length,\n    trustedNegativeFailureRate:\n      trustedNegative.length === 0\n        ? null\n        : trustedNegative.filter((observation) => Boolean(observation.error)).length /\n          trustedNegative.length,\n    unlabeledPredictionRate:\n      completedUnlabeled.length === 0\n        ? null\n        : completedUnlabeled.filter((observation) => observation.findings.length > 0).length /\n          completedUnlabeled.length,\n    unlabeledFailureRate:\n      unlabeled.length === 0\n        ? null\n        : unlabeled.filter((observation) => Boolean(observation.error)).length / unlabeled.length,\n    predictionAgreement: predictionAgreement.value,\n    predictionAgreementCases: predictionAgreement.cases,\n    matchedLabelAgreement: matchedLabelAgreement.value,\n    matchedLabelAgreementCases: matchedLabelAgreement.cases,\n    latencyMs: latencyDistribution(\n      observations\n        .map((observation) => observation.latencyMs)\n        .filter((value): value is number => value !== null),\n    ),\n    benchmarkClockLatencyRuns: observations.filter(\n      (observation) => observation.latencySource === 'benchmark-clock',\n    ).length,\n    runnerReportedLatencyRuns: observations.filter(\n      (observation) => observation.latencySource === 'runner-reported',\n    ).length,\n    latencyUnknownRuns: observations.filter(\n      (observation) => observation.latencySource === 'uncaptured',\n    ).length,\n    calls: usages.reduce((sum, usage) => sum + (usage?.calls ?? 0), 0),\n    callsUnknownRuns: usages.filter((usage) => !usage || usage.calls === null).length,\n    inputTokens: usages.reduce((sum, usage) => sum + (usage?.tokens?.input ?? 0), 0),\n    outputTokens: usages.reduce((sum, usage) => sum + (usage?.tokens?.output ?? 0), 0),\n    reasoningTokens: usages.reduce((sum, usage) => sum + (usage?.tokens?.reasoning ?? 0), 0),\n    cachedTokens: usages.reduce((sum, usage) => sum + (usage?.tokens?.cached ?? 0), 0),\n    cacheWriteTokens: usages.reduce((sum, usage) => sum + (usage?.tokens?.cacheWrite ?? 0), 0),\n    tokenUsageUnknownRuns: usages.filter((usage) => !usage?.tokens).length,\n    reasoningTokenUsageUnknownRuns: usages.filter((usage) => usage?.tokens?.reasoning === undefined)\n      .length,\n    cachedTokenUsageUnknownRuns: usages.filter((usage) => usage?.tokens?.cached === undefined)\n      .length,\n    cacheWriteTokenUsageUnknownRuns: usages.filter(\n      (usage) => usage?.tokens?.cacheWrite === undefined,\n    ).length,\n    knownCostUsd,\n    costUnknownRuns: usages.filter((usage) => !usage || usage.cost.kind === 'uncaptured').length,\n  }\n}\n\nfunction mean(values: readonly number[]): number {\n  return values.length === 0 ? 0 : stableSum(values) / values.length\n}\n\nfunction stableSum(values: readonly number[]): number {\n  const ordered = [...values].sort(\n    (left, right) => Math.abs(left) - Math.abs(right) || left - right,\n  )\n  let sum = 0\n  let correction = 0\n  for (const value of ordered) {\n    const next = sum + value\n    correction += Math.abs(sum) >= Math.abs(value) ? sum - next + value : value - next + sum\n    sum = next\n  }\n  return sum + correction\n}\n\nfunction latencyDistribution(values: readonly number[]): AnalystLatencyDistribution | null {\n  if (values.length === 0) return null\n  const sorted = [...values].sort((a, b) => a - b)\n  return {\n    min: sorted[0]!,\n    mean: mean(sorted),\n    p50: percentile(sorted, 0.5),\n    p95: percentile(sorted, 0.95),\n    max: sorted.at(-1)!,\n  }\n}\n\nfunction percentile(sorted: readonly number[], quantile: number): number {\n  if (sorted.length === 0) return 0\n  return sorted[Math.ceil(quantile * sorted.length) - 1] ?? sorted.at(-1) ?? 0\n}\n\nfunction repeatedObservationAgreement(\n  observations: readonly AnalystBenchmarkObservation[],\n  signature: (observation: AnalystBenchmarkObservation) => readonly string[],\n): { value: number | null; cases: number } {\n  const byCase = new Map<string, AnalystBenchmarkObservation[]>()\n  for (const observation of observations) {\n    const rows = byCase.get(observation.caseId) ?? []\n    rows.push(observation)\n    byCase.set(observation.caseId, rows)\n  }\n  const caseAgreements: number[] = []\n  for (const rows of byCase.values()) {\n    const agreements: number[] = []\n    for (let left = 0; left < rows.length; left++) {\n      for (let right = left + 1; right < rows.length; right++) {\n        agreements.push(jaccard(signature(rows[left]!), signature(rows[right]!)))\n      }\n    }\n    if (agreements.length > 0) caseAgreements.push(mean(agreements))\n  }\n  return {\n    value: caseAgreements.length === 0 ? null : mean(caseAgreements),\n    cases: caseAgreements.length,\n  }\n}\n\nfunction matchedLabelSignature(observation: AnalystBenchmarkObservation): readonly string[] {\n  if (observation.error) return [`error:${observation.error.class}`]\n  return observation.score.matchedIssueIds\n}\n\nfunction predictionSignature(observation: AnalystBenchmarkObservation): readonly string[] {\n  if (observation.error) return [`error:${observation.error.class}`]\n  return observation.findings\n    .map((finding) =>\n      JSON.stringify([\n        finding.finding_id,\n        finding.evidence_refs\n          .map((evidence) => [evidence.kind, evidence.uri, evidence.excerpt ?? null])\n          .sort((left, right) => compareCodeUnits(JSON.stringify(left), JSON.stringify(right))),\n      ]),\n    )\n    .sort()\n}\n\nfunction jaccard(left: readonly string[], right: readonly string[]): number {\n  const a = new Set(left)\n  const b = new Set(right)\n  const union = new Set([...a, ...b])\n  if (union.size === 0) return 1\n  let intersection = 0\n  for (const value of a) if (b.has(value)) intersection += 1\n  return intersection / union.size\n}\n","import { performance } from 'node:perf_hooks'\nimport type { TraceAnalysisStore } from '../trace-analyst/store'\nimport { assertValidAnalystScoringCase, scoreAnalystFindings } from './benchmark-scoring'\nimport { summarizeAnalystBenchmarkRunner } from './benchmark-summary'\nimport type { AnalystRegistry, RegistryRunOpts } from './registry'\nimport type {\n  AnalystFinding,\n  AnalystRunInputs,\n  AnalystRunResult,\n  AnalystUsageReceipt,\n  EvidenceRef,\n} from './types'\nimport { assertValidAnalystUsageReceipt } from './usage-receipt'\n\nexport { scoreAnalystFindings } from './benchmark-scoring'\n\nexport interface AnalystEvidenceExpectation {\n  uri: string\n  kind?: EvidenceRef['kind']\n}\n\nexport interface AnalystIssueExpectation {\n  id: string\n  findingIds?: readonly string[]\n  areas?: readonly string[]\n  subjects?: readonly string[]\n  evidence?: readonly AnalystEvidenceExpectation[]\n  evidenceMode?: 'any' | 'all'\n  /** Exact evidence location for the first unrecoverable or causal step. */\n  criticalEvidence?: readonly AnalystEvidenceExpectation[]\n}\n\nexport type AnalystBenchmarkLabelState = 'positive' | 'trusted-negative' | 'unlabeled'\n\nexport interface AnalystBenchmarkCase<TInput = unknown> {\n  id: string\n  /** Independent source unit used for resampling, such as a task or incident. */\n  clusterId: string\n  /** Whether labels prove an issue, prove no issue, or leave the outcome unknown. */\n  labelState: AnalystBenchmarkLabelState\n  input: TInput\n  expectedIssues: readonly AnalystIssueExpectation[]\n  /** Complete set of labeled locations used to measure label-location agreement. */\n  labeledEvidence?: readonly AnalystEvidenceExpectation[]\n  tags?: readonly string[]\n  metadata?: Record<string, unknown>\n}\n\nexport interface AnalystFindingScore {\n  expectedIssueCount: number\n  matchedIssueIds: string[]\n  missedIssueIds: string[]\n  supportedFindingIndexes: number[]\n  unsupportedFindingIndexes: number[]\n  unlabeledEvidence: EvidenceRef[]\n  issueRecall: number\n  findingPrecision: number\n  f1: number\n  criticalStepAccuracy: number | null\n  /** Share of findings that cite at least one evidence location. */\n  citationCoverage: number | null\n  /** Share of citations that include a non-empty source excerpt. */\n  citationExcerptCoverage: number | null\n  /** Share of citations that agree with a labeled case location. */\n  citationLabelAgreement: number | null\n  predictionOnLabelEmptyCase: boolean\n}\n\nexport interface AnalystEvidenceResolutionError {\n  evidence: EvidenceRef\n  class: string\n  message: string\n}\n\nexport interface AnalystEvidenceResolution {\n  checked: number\n  resolved: number\n  unresolvedEvidence: EvidenceRef[]\n  errors: AnalystEvidenceResolutionError[]\n  /** Null when no citations were checked or any resolution attempt failed. */\n  validity: number | null\n}\n\nexport type AnalystEvidenceResolver<TInput = unknown> = (input: {\n  caseId: string\n  caseInput: TInput\n  evidence: EvidenceRef\n  signal?: AbortSignal\n}) => boolean | Promise<boolean>\n\n/**\n * Resolve canonical `trace://<trace>/span/<span>` evidence against a trace store.\n * Other evidence kinds and URI schemes require a caller-supplied resolver.\n */\nexport function traceStoreEvidenceResolver<TInput>(\n  getStore: (input: TInput) => TraceAnalysisStore,\n): AnalystEvidenceResolver<TInput> {\n  return async ({ caseInput, evidence, signal }) => {\n    if (evidence.kind !== 'span') return false\n    const location = parseTraceSpanUri(evidence.uri)\n    if (!location) return false\n    const result = await getStore(caseInput).viewSpans(\n      {\n        trace_id: location.traceId,\n        span_ids: [location.spanId],\n      },\n      signal ? { signal } : undefined,\n    )\n    return (\n      result.trace_id === location.traceId &&\n      result.missing_span_ids.length === 0 &&\n      result.spans.some((span) => span.span_id === location.spanId)\n    )\n  }\n}\n\nexport interface AnalystBenchmarkOutput {\n  findings: readonly AnalystFinding[]\n  usage?: AnalystUsageReceipt\n  metadata?: Record<string, unknown>\n  /**\n   * End-to-end duration measured by an external runner before import.\n   * Use null when the source explicitly did not capture duration.\n   */\n  observedLatencyMs?: number | null\n  /** Marks a completed transport as a failed analyst run while retaining usage and metadata. */\n  error?: AnalystBenchmarkError\n}\n\nexport interface AnalystBenchmarkError {\n  class: string\n  message: string\n  code?: string\n  status?: number\n}\n\nexport interface AnalystBenchmarkRunner<TInput = unknown> {\n  id: string\n  analyze(\n    input: TInput,\n    context: { caseId: string; repetition: number; signal?: AbortSignal },\n  ): AnalystBenchmarkOutput | Promise<AnalystBenchmarkOutput>\n}\n\nexport interface AnalystBenchmarkObservation {\n  runnerId: string\n  caseId: string\n  clusterId: string\n  labelState: AnalystBenchmarkLabelState\n  repetition: number\n  executionIndex: number\n  latencyMs: number | null\n  latencySource: 'benchmark-clock' | 'runner-reported' | 'uncaptured'\n  findings: readonly AnalystFinding[]\n  score: AnalystFindingScore\n  evidenceResolution?: AnalystEvidenceResolution\n  caseTags: readonly string[]\n  caseMetadata?: Record<string, unknown>\n  usage?: AnalystUsageReceipt\n  runnerMetadata?: Record<string, unknown>\n  error?: AnalystBenchmarkError\n}\n\nexport interface AnalystLatencyDistribution {\n  min: number\n  mean: number\n  p50: number\n  p95: number\n  max: number\n}\n\nexport interface AnalystBenchmarkSummary {\n  runnerId: string\n  plannedRuns: number\n  completedRuns: number\n  failedRuns: number\n  issueBearingRuns: number\n  trustedNegativeRuns: number\n  unlabeledRuns: number\n  /** Pooled across all labeled issues and findings. */\n  issueRecall: number | null\n  /** Pooled across all labeled issues and findings. */\n  findingPrecision: number | null\n  /** Harmonic mean of the pooled precision and recall. */\n  f1: number | null\n  /** Mean of per-case recall over issue-bearing runs. */\n  macroIssueRecall: number | null\n  /** Mean of per-case precision over issue-bearing runs. */\n  macroFindingPrecision: number | null\n  /** Mean of per-case F1 over issue-bearing runs. */\n  macroF1: number | null\n  criticalStepAccuracy: number | null\n  citationCoverage: number | null\n  citationExcerptCoverage: number | null\n  citationLabelAgreement: number | null\n  citationResolution: number | null\n  citationResolutionUnknownRuns: number\n  unresolvedCitations: number\n  citationResolutionErrors: number\n  trustedNegativeFalsePositiveRate: number | null\n  trustedNegativeFailureRate: number | null\n  unlabeledPredictionRate: number | null\n  unlabeledFailureRate: number | null\n  /** Primary repeatability measure over complete finding identity and evidence. */\n  predictionAgreement: number | null\n  /** Repeated cases contributing equally to predictionAgreement. */\n  predictionAgreementCases: number\n  /** Secondary repeatability detail over matched expected labels. */\n  matchedLabelAgreement: number | null\n  /** Positive repeated cases contributing equally to matchedLabelAgreement. */\n  matchedLabelAgreementCases: number\n  latencyMs: AnalystLatencyDistribution | null\n  benchmarkClockLatencyRuns: number\n  runnerReportedLatencyRuns: number\n  latencyUnknownRuns: number\n  calls: number\n  callsUnknownRuns: number\n  inputTokens: number\n  outputTokens: number\n  reasoningTokens: number\n  cachedTokens: number\n  cacheWriteTokens: number\n  tokenUsageUnknownRuns: number\n  reasoningTokenUsageUnknownRuns: number\n  cachedTokenUsageUnknownRuns: number\n  cacheWriteTokenUsageUnknownRuns: number\n  knownCostUsd: number\n  costUnknownRuns: number\n}\n\nexport interface AnalystBenchmarkDatasetRef {\n  id: string\n  revision: string\n  split?: string\n}\n\nexport interface AnalystBenchmarkDescriptor {\n  id?: string\n  dataset?: AnalystBenchmarkDatasetRef\n  command?: string\n  environment?: Record<string, string>\n  metadata?: Record<string, unknown>\n}\n\nexport interface AnalystBenchmarkProvenance extends AnalystBenchmarkDescriptor {\n  startedAt: string\n  endedAt: string\n  caseCount: number\n  runnerIds: string[]\n  repetitions: number\n  maxConcurrency: number\n  runnerOrderSeed: number\n}\n\nexport interface AnalystBenchmarkResult {\n  provenance: AnalystBenchmarkProvenance\n  observations: AnalystBenchmarkObservation[]\n  summaries: AnalystBenchmarkSummary[]\n}\n\nexport interface RunAnalystBenchmarkOptions<TInput> {\n  cases: readonly AnalystBenchmarkCase<TInput>[]\n  runners: readonly AnalystBenchmarkRunner<TInput>[]\n  repetitions?: number\n  maxConcurrency?: number\n  runnerOrderSeed?: number\n  resolveEvidence?: AnalystEvidenceResolver<TInput>\n  benchmark?: AnalystBenchmarkDescriptor\n  /** Previously persisted rows. Exact case, runner, repetition, and execution identities are required. */\n  initialObservations?: readonly AnalystBenchmarkObservation[]\n  onObservation?: (observation: AnalystBenchmarkObservation) => void | Promise<void>\n  signal?: AbortSignal\n}\n\nexport async function runAnalystBenchmark<TInput>(\n  options: RunAnalystBenchmarkOptions<TInput>,\n): Promise<AnalystBenchmarkResult> {\n  validateBenchmarkOptions(options)\n  const startedAt = new Date().toISOString()\n  const repetitions = options.repetitions ?? 1\n  const runnerOrderSeed = options.runnerOrderSeed ?? 0\n  const allJobs = benchmarkJobs(options.cases, options.runners, repetitions, runnerOrderSeed)\n  const maxConcurrency = Math.min(options.maxConcurrency ?? 1, allJobs.length)\n  const initialObservations = validateInitialObservations(\n    options.initialObservations ?? [],\n    allJobs,\n  )\n  const completed = new Set(initialObservations.map(observationKey))\n  const jobs = allJobs.filter((job) => !completed.has(jobKey(job)))\n  const observations: AnalystBenchmarkObservation[] = [...initialObservations]\n  let cursor = 0\n  const worker = async (): Promise<void> => {\n    while (cursor < jobs.length) {\n      options.signal?.throwIfAborted()\n      const job = jobs[cursor++]!\n      const observation = await runBenchmarkJob(job, options.signal, options.resolveEvidence)\n      options.signal?.throwIfAborted()\n      await options.onObservation?.(observation)\n      options.signal?.throwIfAborted()\n      observations.push(observation)\n    }\n  }\n  await Promise.all(Array.from({ length: Math.min(maxConcurrency, jobs.length) }, worker))\n  options.signal?.throwIfAborted()\n  const runnerOrder = new Map(options.runners.map((runner, index) => [runner.id, index]))\n  const caseOrder = new Map(options.cases.map((testCase, index) => [testCase.id, index]))\n  observations.sort(\n    (a, b) =>\n      (runnerOrder.get(a.runnerId) ?? 0) - (runnerOrder.get(b.runnerId) ?? 0) ||\n      (caseOrder.get(a.caseId) ?? 0) - (caseOrder.get(b.caseId) ?? 0) ||\n      a.repetition - b.repetition,\n  )\n  return {\n    provenance: {\n      ...options.benchmark,\n      startedAt,\n      endedAt: new Date().toISOString(),\n      caseCount: options.cases.length,\n      runnerIds: options.runners.map((runner) => runner.id),\n      repetitions,\n      maxConcurrency,\n      runnerOrderSeed,\n    },\n    observations,\n    summaries: options.runners.map((runner) =>\n      summarizeAnalystBenchmarkRunner(\n        runner.id,\n        observations.filter((observation) => observation.runnerId === runner.id),\n      ),\n    ),\n  }\n}\n\nexport function registryBenchmarkRunner(options: {\n  id: string\n  registry: AnalystRegistry\n  runOptions?: Omit<RegistryRunOpts, 'signal'>\n  /** Count any selected analyst failure as a failed benchmark run. */\n  failOnAnalystFailure?: boolean\n}): AnalystBenchmarkRunner<AnalystRunInputs> {\n  return {\n    id: options.id,\n    async analyze(input, context) {\n      const result = await options.registry.run(\n        `${options.id}:${context.caseId}:${context.repetition}`,\n        input,\n        { ...options.runOptions, signal: context.signal },\n      )\n      return {\n        findings: result.findings,\n        usage: mergeRegistryUsage(result),\n        metadata: { analystRun: result },\n        ...(options.failOnAnalystFailure ? { error: registryRunFailure(result) } : {}),\n      }\n    },\n  }\n}\n\nasync function runBenchmarkJob<TInput>(\n  job: {\n    runner: AnalystBenchmarkRunner<TInput>\n    testCase: AnalystBenchmarkCase<TInput>\n    repetition: number\n    executionIndex: number\n  },\n  signal?: AbortSignal,\n  resolveEvidence?: AnalystEvidenceResolver<TInput>,\n): Promise<AnalystBenchmarkObservation> {\n  const started = performance.now()\n  try {\n    const output = await job.runner.analyze(job.testCase.input, {\n      caseId: job.testCase.id,\n      repetition: job.repetition,\n      signal,\n    })\n    if (output.usage) {\n      assertValidAnalystUsageReceipt(output.usage, 'analyst benchmark usage')\n    }\n    const benchmarkLatencyMs = performance.now() - started\n    const latency = resolveBenchmarkLatency(output.observedLatencyMs, benchmarkLatencyMs)\n    const scoredFindings = output.error ? [] : output.findings\n    return {\n      runnerId: job.runner.id,\n      caseId: job.testCase.id,\n      clusterId: job.testCase.clusterId,\n      labelState: job.testCase.labelState,\n      repetition: job.repetition,\n      executionIndex: job.executionIndex,\n      latencyMs: latency.value,\n      latencySource: latency.source,\n      findings: output.findings,\n      score: scoreAnalystFindings(job.testCase, scoredFindings),\n      evidenceResolution: resolveEvidence\n        ? await resolveFindingEvidence(job.testCase, output.findings, resolveEvidence, signal)\n        : undefined,\n      caseTags: [...(job.testCase.tags ?? [])],\n      caseMetadata: job.testCase.metadata,\n      usage: output.usage,\n      runnerMetadata: output.metadata,\n      ...(output.error ? { error: output.error } : {}),\n    }\n  } catch (error) {\n    if (signal?.aborted) throw error\n    const findings: AnalystFinding[] = []\n    return {\n      runnerId: job.runner.id,\n      caseId: job.testCase.id,\n      clusterId: job.testCase.clusterId,\n      labelState: job.testCase.labelState,\n      repetition: job.repetition,\n      executionIndex: job.executionIndex,\n      latencyMs: performance.now() - started,\n      latencySource: 'benchmark-clock',\n      findings,\n      score: scoreAnalystFindings(job.testCase, findings),\n      caseTags: [...(job.testCase.tags ?? [])],\n      caseMetadata: job.testCase.metadata,\n      error: {\n        class: error instanceof Error ? error.constructor.name : 'Error',\n        message: error instanceof Error ? error.message : String(error),\n      },\n    }\n  }\n}\n\nfunction resolveBenchmarkLatency(\n  observedLatencyMs: number | null | undefined,\n  fallbackMs: number,\n): {\n  value: number | null\n  source: AnalystBenchmarkObservation['latencySource']\n} {\n  if (observedLatencyMs === undefined) {\n    return { value: fallbackMs, source: 'benchmark-clock' }\n  }\n  if (observedLatencyMs === null) return { value: null, source: 'uncaptured' }\n  if (!Number.isFinite(observedLatencyMs) || observedLatencyMs < 0) {\n    throw new RangeError('analyst benchmark observedLatencyMs must be finite and non-negative')\n  }\n  return { value: observedLatencyMs, source: 'runner-reported' }\n}\n\nfunction registryRunFailure(result: AnalystRunResult): AnalystBenchmarkOutput['error'] | undefined {\n  const failed = result.per_analyst.filter((summary) => summary.status === 'failed')\n  if (failed.length === 0) return undefined\n  return {\n    class: 'AnalystRunFailure',\n    message: failed\n      .map(\n        (summary) =>\n          `${summary.analyst_id}: ${summary.error?.class ?? 'Error'}: ${summary.error?.message ?? 'analyst failed'}`,\n      )\n      .join('; '),\n  }\n}\n\nfunction benchmarkJobs<TInput>(\n  cases: readonly AnalystBenchmarkCase<TInput>[],\n  runners: readonly AnalystBenchmarkRunner<TInput>[],\n  repetitions: number,\n  runnerOrderSeed: number,\n): Array<{\n  runner: AnalystBenchmarkRunner<TInput>\n  testCase: AnalystBenchmarkCase<TInput>\n  repetition: number\n  executionIndex: number\n}> {\n  const seededRunners = [...runners].sort(\n    (left, right) =>\n      stableHash(`${runnerOrderSeed}\\u0000${left.id}`) -\n        stableHash(`${runnerOrderSeed}\\u0000${right.id}`) || left.id.localeCompare(right.id),\n  )\n  let executionIndex = 0\n  return cases.flatMap((testCase, caseIndex) =>\n    Array.from({ length: repetitions }, (_, repetition) => {\n      const blockIndex = caseIndex * repetitions + repetition\n      const rotation = blockIndex % seededRunners.length\n      const ordered = [...seededRunners.slice(rotation), ...seededRunners.slice(0, rotation)]\n      return ordered.map((runner) => ({\n        runner,\n        testCase,\n        repetition,\n        executionIndex: executionIndex++,\n      }))\n    }).flat(),\n  )\n}\n\nfunction validateInitialObservations<TInput>(\n  observations: readonly AnalystBenchmarkObservation[],\n  jobs: readonly {\n    runner: AnalystBenchmarkRunner<TInput>\n    testCase: AnalystBenchmarkCase<TInput>\n    repetition: number\n    executionIndex: number\n  }[],\n): AnalystBenchmarkObservation[] {\n  const expected = new Map(jobs.map((job) => [jobKey(job), job]))\n  const seen = new Set<string>()\n  return observations.map((observation) => {\n    const key = observationKey(observation)\n    if (seen.has(key)) {\n      throw new TypeError(\n        `duplicate initial analyst benchmark observation '${observation.runnerId}/${observation.caseId}/${observation.repetition}'`,\n      )\n    }\n    seen.add(key)\n    const job = expected.get(key)\n    if (!job) {\n      throw new TypeError(\n        `initial analyst benchmark observation does not match a planned job: '${observation.runnerId}/${observation.caseId}/${observation.repetition}'`,\n      )\n    }\n    if (observation.executionIndex !== job.executionIndex) {\n      throw new TypeError(\n        `initial analyst benchmark observation '${observation.runnerId}/${observation.caseId}/${observation.repetition}' has executionIndex ${observation.executionIndex}; expected ${job.executionIndex}`,\n      )\n    }\n    if (\n      observation.clusterId !== job.testCase.clusterId ||\n      observation.labelState !== job.testCase.labelState\n    ) {\n      throw new TypeError(\n        `initial analyst benchmark observation '${observation.runnerId}/${observation.caseId}/${observation.repetition}' does not match the current case labels`,\n      )\n    }\n    if (\n      JSON.stringify(observation.caseTags) !== JSON.stringify(job.testCase.tags ?? []) ||\n      JSON.stringify(observation.caseMetadata) !== JSON.stringify(job.testCase.metadata)\n    ) {\n      throw new TypeError(\n        `initial analyst benchmark observation '${observation.runnerId}/${observation.caseId}/${observation.repetition}' does not match the current case metadata`,\n      )\n    }\n    const expectedScore = scoreAnalystFindings(\n      job.testCase,\n      observation.error ? [] : observation.findings,\n    )\n    if (JSON.stringify(observation.score) !== JSON.stringify(expectedScore)) {\n      throw new TypeError(\n        `initial analyst benchmark observation '${observation.runnerId}/${observation.caseId}/${observation.repetition}' has stale or invalid scores`,\n      )\n    }\n    if (observation.usage) {\n      assertValidAnalystUsageReceipt(\n        observation.usage,\n        `initial analyst benchmark observation '${observation.runnerId}/${observation.caseId}/${observation.repetition}' usage`,\n      )\n    }\n    if (\n      !['benchmark-clock', 'runner-reported', 'uncaptured'].includes(observation.latencySource) ||\n      (observation.latencySource === 'uncaptured' && observation.latencyMs !== null) ||\n      (observation.latencySource !== 'uncaptured' &&\n        (observation.latencyMs === null ||\n          !Number.isFinite(observation.latencyMs) ||\n          observation.latencyMs < 0))\n    ) {\n      throw new TypeError(\n        `initial analyst benchmark observation '${observation.runnerId}/${observation.caseId}/${observation.repetition}' has invalid latency`,\n      )\n    }\n    return { ...observation }\n  })\n}\n\nfunction jobKey(job: {\n  runner: { id: string }\n  testCase: { id: string }\n  repetition: number\n}): string {\n  return `${job.runner.id}\\u0000${job.testCase.id}\\u0000${job.repetition}`\n}\n\nfunction observationKey(observation: {\n  runnerId: string\n  caseId: string\n  repetition: number\n}): string {\n  return `${observation.runnerId}\\u0000${observation.caseId}\\u0000${observation.repetition}`\n}\n\nasync function resolveFindingEvidence<TInput>(\n  testCase: AnalystBenchmarkCase<TInput>,\n  findings: readonly AnalystFinding[],\n  resolver: AnalystEvidenceResolver<TInput>,\n  signal?: AbortSignal,\n): Promise<AnalystEvidenceResolution> {\n  const evidence = findings.flatMap((finding) => finding.evidence_refs)\n  const resolved: EvidenceRef[] = []\n  const unresolvedEvidence: EvidenceRef[] = []\n  const errors: AnalystEvidenceResolutionError[] = []\n  for (const ref of evidence) {\n    signal?.throwIfAborted()\n    try {\n      if (\n        await resolver({\n          caseId: testCase.id,\n          caseInput: testCase.input,\n          evidence: ref,\n          signal,\n        })\n      ) {\n        resolved.push(ref)\n      } else {\n        unresolvedEvidence.push(ref)\n      }\n    } catch (error) {\n      if (signal?.aborted) throw error\n      errors.push({\n        evidence: ref,\n        class: error instanceof Error ? error.constructor.name : 'Error',\n        message: error instanceof Error ? error.message : String(error),\n      })\n    }\n  }\n  return {\n    checked: evidence.length,\n    resolved: resolved.length,\n    unresolvedEvidence,\n    errors,\n    validity: evidence.length === 0 || errors.length > 0 ? null : resolved.length / evidence.length,\n  }\n}\n\nfunction parseTraceSpanUri(uri: string): { traceId: string; spanId: string } | null {\n  const match = /^trace:\\/\\/([^/]+)\\/span\\/([^/]+)$/.exec(uri)\n  if (!match) return null\n  try {\n    const traceId = decodeURIComponent(match[1]!)\n    const spanId = decodeURIComponent(match[2]!)\n    return traceId && spanId ? { traceId, spanId } : null\n  } catch {\n    return null\n  }\n}\n\nfunction validateBenchmarkOptions<TInput>(options: RunAnalystBenchmarkOptions<TInput>): void {\n  if (options.cases.length === 0) throw new TypeError('runAnalystBenchmark requires cases')\n  if (options.runners.length === 0) throw new TypeError('runAnalystBenchmark requires runners')\n  const repetitions = options.repetitions ?? 1\n  const maxConcurrency = options.maxConcurrency ?? 1\n  if (!Number.isSafeInteger(repetitions) || repetitions < 1) {\n    throw new RangeError('runAnalystBenchmark repetitions must be a positive safe integer')\n  }\n  if (!Number.isSafeInteger(maxConcurrency) || maxConcurrency < 1) {\n    throw new RangeError('runAnalystBenchmark maxConcurrency must be a positive safe integer')\n  }\n  if (!Number.isSafeInteger(options.runnerOrderSeed ?? 0)) {\n    throw new RangeError('runAnalystBenchmark runnerOrderSeed must be a safe integer')\n  }\n  assertUniqueNonEmpty(\n    options.cases.map((testCase) => testCase.id),\n    'case',\n  )\n  assertUniqueNonEmpty(\n    options.runners.map((runner) => runner.id),\n    'runner',\n  )\n  for (const testCase of options.cases) validateBenchmarkCase(testCase)\n}\n\nfunction validateBenchmarkCase(testCase: AnalystBenchmarkCase): void {\n  assertValidAnalystScoringCase(testCase)\n  if (!testCase.clusterId.trim()) {\n    throw new TypeError(`${testCase.id}: analyst benchmark clusterId must not be empty`)\n  }\n  if (\n    testCase.labelState !== 'positive' &&\n    testCase.labelState !== 'trusted-negative' &&\n    testCase.labelState !== 'unlabeled'\n  ) {\n    throw new TypeError(`${testCase.id}: analyst benchmark labelState is invalid`)\n  }\n  if (testCase.labelState === 'positive' && testCase.expectedIssues.length === 0) {\n    throw new TypeError(`${testCase.id}: positive case requires at least one expected issue`)\n  }\n  if (testCase.labelState !== 'positive' && testCase.expectedIssues.length > 0) {\n    throw new TypeError(\n      `${testCase.id}: ${testCase.labelState} case cannot contain expected issues`,\n    )\n  }\n}\n\nfunction assertUniqueNonEmpty(values: readonly string[], label: string): void {\n  const seen = new Set<string>()\n  for (const value of values) {\n    if (!value.trim()) throw new TypeError(`analyst benchmark ${label} id must not be empty`)\n    if (seen.has(value)) throw new TypeError(`duplicate analyst benchmark ${label} id '${value}'`)\n    seen.add(value)\n  }\n}\n\n/** 32-bit FNV-1a over raw UTF-16 code units, left SIGNED so subtracting two\n *  results is a valid comparator.\n *\n *  Frozen: it fixes the runner order a benchmark reports. Adding the `>>> 0`\n *  the other variants carry would change that order, which is why this one\n *  does not have it. */\nfunction stableHash(value: string): number {\n  let hash = 2166136261\n  for (let index = 0; index < value.length; index += 1) {\n    hash ^= value.charCodeAt(index)\n    hash = Math.imul(hash, 16777619)\n  }\n  return hash >>> 0\n}\n\nfunction mergeRegistryUsage(result: AnalystRunResult): AnalystUsageReceipt {\n  const usages = result.per_analyst.map((summary) => summary.usage)\n  const calls = usages.every((usage) => usage.calls !== null)\n    ? usages.reduce((sum, usage) => sum + (usage.calls ?? 0), 0)\n    : null\n  const tokens = usages.every((usage) => usage.tokens !== null)\n    ? usages.reduce(\n        (sum, usage) => ({\n          input: sum.input + (usage.tokens?.input ?? 0),\n          output: sum.output + (usage.tokens?.output ?? 0),\n          reasoning: sum.reasoning + (usage.tokens?.reasoning ?? 0),\n          cached: sum.cached + (usage.tokens?.cached ?? 0),\n          cacheWrite: sum.cacheWrite + (usage.tokens?.cacheWrite ?? 0),\n        }),\n        { input: 0, output: 0, reasoning: 0, cached: 0, cacheWrite: 0 },\n      )\n    : null\n  const knownCostUsd = usages.reduce(\n    (sum, usage) =>\n      sum + (usage.cost.kind === 'uncaptured' ? (usage.knownCostUsd ?? 0) : usage.cost.usd),\n    0,\n  )\n  const cost = usages.some((usage) => usage.cost.kind === 'uncaptured')\n    ? ({ kind: 'uncaptured', usd: null } as const)\n    : usages.some((usage) => usage.cost.kind === 'estimated')\n      ? ({ kind: 'estimated', usd: knownCostUsd } as const)\n      : ({ kind: 'observed', usd: knownCostUsd } as const)\n  return {\n    calls,\n    tokens,\n    cost,\n    ...(cost.kind === 'uncaptured' ? { knownCostUsd } : {}),\n  }\n}\n"],"mappings":";;;;;AASA,SAAgB,qBACd,UACA,UACqB;CACrB,8BAA8B,QAAQ;CACtC,MAAM,wBAAwB,sBAAsB,SAAS,gBAAgB,QAAQ;CACrF,MAAM,kBAAkB,SAAS,eAC9B,QAAQ,GAAG,UAAU,sBAAsB,IAAI,KAAK,CAAC,CAAC,CACtD,KAAK,UAAU,MAAM,EAAE;CAC1B,MAAM,iBAAiB,SAAS,eAC7B,QAAQ,GAAG,UAAU,CAAC,sBAAsB,IAAI,KAAK,CAAC,CAAC,CACvD,KAAK,UAAU,MAAM,EAAE;CAC1B,MAAM,0BAA0B,IAAI,IAAI,sBAAsB,OAAO,CAAC;CAEtE,MAAM,4BAA4B,SAC/B,KAAK,GAAG,UAAU,KAAK,CAAC,CACxB,QAAQ,UAAU,CAAC,wBAAwB,IAAI,KAAK,CAAC;CACxD,MAAM,qBAAqB,SAAS,eAAe;CACnD,MAAM,cAAc,uBAAuB,IAAI,IAAI,gBAAgB,SAAS;CAC5E,MAAM,mBACJ,SAAS,WAAW,IAChB,uBAAuB,IACrB,IACA,IACF,wBAAwB,OAAO,SAAS;CAC9C,MAAM,KAAK,kBAAkB,kBAAkB,WAAW;CAC1D,MAAM,cAAc,SAAS,SAAS,YAAY,QAAQ,aAAa;CAEvE,MAAM,iBAAiB,SAAS,eAAe,QAC5C,WAAW,MAAM,kBAAkB,UAAU,KAAK,CACrD;CACA,MAAM,eAAe,SAAS,eAAe,QAAQ,UAAU;EAC7D,KAAK,MAAM,kBAAkB,UAAU,OAAO,GAAG,OAAO;EACxD,OAAO,gBAAgB,aAAa,MAAM,oBAAoB,CAAC,GAAG,KAAK;CACzE,CAAC,CAAC,CAAC;CAEH,MAAM,uBAAuB,SAAS,QAAQ,YAAY,QAAQ,cAAc,SAAS,CAAC,CAAC,CAAC;CAC5F,MAAM,oBAAoB,SAAS,kBAC/B,YAAY,QACT,QAAQ,CAAC,SAAS,gBAAiB,MAAM,aAAa,gBAAgB,KAAK,QAAQ,CAAC,CACvF,IACA,CAAC;CAEL,OAAO;EACL;EACA;EACA;EACA,yBAAyB,CAAC,GAAG,uBAAuB,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;EAC1E;EACA;EACA;EACA;EACA;EACA,sBAAsB,eAAe,WAAW,IAAI,OAAO,eAAe,eAAe;EACzF,kBAAkB,SAAS,WAAW,IAAI,OAAO,uBAAuB,SAAS;EACjF,yBACE,YAAY,WAAW,IACnB,OACA,YAAY,QAAQ,aAAa,QAAQ,SAAS,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,SACpE,YAAY;EAClB,wBACE,SAAS,oBAAoB,KAAA,IACzB,OACA,YAAY,WAAW,IACrB,SAAS,WAAW,IAClB,OACA,KACD,YAAY,SAAS,kBAAkB,UAAU,YAAY;EACtE,4BAA4B,uBAAuB,KAAK,SAAS,SAAS;CAC5E;AACF;AAEA,SAAgB,8BACd,UACM;CACN,IAAI,CAAC,SAAS,GAAG,KAAK,GAAG,MAAM,IAAI,UAAU,6CAA6C;CAC1F,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,SAAS,SAAS,gBAAgB;EAC3C,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,MAAM,IAAI,UAAU,GAAG,SAAS,GAAG,sCAAsC;EAC/F,IAAI,IAAI,IAAI,MAAM,EAAE,GAClB,MAAM,IAAI,UAAU,GAAG,SAAS,GAAG,iCAAiC,MAAM,GAAG,EAAE;EAEjF,IAAI,IAAI,MAAM,EAAE;EAChB,IACE,CAAC,MAAM,YAAY,UACnB,CAAC,MAAM,OAAO,UACd,CAAC,MAAM,UAAU,UACjB,CAAC,MAAM,UAAU,QAEjB,MAAM,IAAI,UACR,GAAG,SAAS,GAAG,GAAG,MAAM,GAAG,2EAC7B;CAEJ;CACA,KAAK,MAAM,OAAO,SAAS,mBAAmB,CAAC,GAC7C,IAAI,CAAC,IAAI,IAAI,KAAK,GAChB,MAAM,IAAI,UAAU,GAAG,SAAS,GAAG,yCAAyC;AAGlF;AAEA,SAAgB,kBAAkB,GAAW,GAAmB;CAC9D,OAAO,IAAI,MAAM,IAAI,IAAK,IAAI,IAAI,KAAM,IAAI;AAC9C;AAEA,SAAS,sBACP,QACA,UACqB;CACrB,IAAI,OAAO,WAAW,GAAG,uBAAO,IAAI,IAAI;CACxC,MAAM,oBAAoB,OAAO,SAAS;CAW1C,MAAM,aAAa,oBAVJ,OAAO,KAAK,UAAU,CACnC,GAAG,SAAS,KAAK,YAAY;EAC3B,IAAI,CAAC,oBAAoB,SAAS,KAAK,GAAG,OAAO;EACjD,MAAM,eACH,MAAM,kBAAkB,UAAU,KAAK,KACxC,gBAAgB,QAAQ,eAAe,MAAM,oBAAoB,CAAC,GAAG,KAAK;EAC5E,OAAO,oBAAoB,OAAO,WAAW;CAC/C,CAAC,GACD,GAAG,MAAM,KAAK,EAAE,QAAQ,OAAO,OAAO,SAAS,CAAC,CAClD,CAC4C,GAAG,EAAE,UAAU,KAAK,CAAC,CAAC,CAAC;CACnE,MAAM,0BAAU,IAAI,IAAoB;CACxC,KAAK,MAAM,CAAC,YAAY,WAAW,WAAW,QAAQ,GAAG;EACvD,IAAI,SAAS,KAAK,UAAU,SAAS,QAAQ;EAC7C,IAAI,CAAC,oBAAoB,SAAS,SAAU,OAAO,WAAY,GAAG;EAClE,QAAQ,IAAI,YAAY,MAAM;CAChC;CACA,OAAO;AACT;AAEA,SAAS,oBAAoB,SAAyB,OAAyC;CAC7F,IAAI,MAAM,cAAc,CAAC,MAAM,WAAW,SAAS,QAAQ,UAAU,GAAG,OAAO;CAC/E,IAAI,MAAM,SAAS,CAAC,MAAM,MAAM,SAAS,QAAQ,IAAI,GAAG,OAAO;CAC/D,IAAI,MAAM,aAAa,CAAC,QAAQ,WAAW,CAAC,MAAM,SAAS,SAAS,QAAQ,OAAO,IACjF,OAAO;CAET,IACE,MAAM,YACN,CAAC,gBAAgB,QAAQ,eAAe,MAAM,UAAU,MAAM,gBAAgB,KAAK,GAEnF,OAAO;CAET,OAAO;AACT;AAEA,SAAS,gBACP,QACA,UACA,MACS;CACT,IAAI,SAAS,WAAW,GAAG,OAAO;CAClC,MAAM,SAAS,WACb,OAAO,MAAM,QAAQ,gBAAgB,KAAK,MAAM,CAAC;CACnD,OAAO,SAAS,QAAQ,SAAS,MAAM,KAAK,IAAI,SAAS,KAAK,KAAK;AACrE;AAEA,SAAS,gBAAgB,QAAqB,UAA+C;CAC3F,OACE,OAAO,QAAQ,SAAS,QAAQ,SAAS,SAAS,KAAA,KAAa,OAAO,SAAS,SAAS;AAE5F;;;ACjKA,SAAgB,gCACd,UACA,cACyB;CACzB,MAAM,eAAe,aAAa,QAAQ,gBAAgB,YAAY,eAAe,UAAU;CAC/F,MAAM,YAAY,aAAa,QAAQ,gBAAgB,CAAC,YAAY,KAAK;CACzE,MAAM,iBAAiB,aAAa,QACjC,KAAK,gBAAgB,MAAM,YAAY,MAAM,oBAC9C,CACF;CACA,MAAM,gBAAgB,aAAa,QAChC,KAAK,gBAAgB,MAAM,YAAY,MAAM,gBAAgB,QAC9D,CACF;CACA,MAAM,gBAAgB,aAAa,QAChC,KAAK,gBAAgB,OAAO,YAAY,QAAQ,IAAI,YAAY,SAAS,SAC1E,CACF;CACA,MAAM,oBAAoB,aAAa,QACpC,KAAK,gBAAgB,MAAM,YAAY,MAAM,wBAAwB,QACtE,CACF;CACA,MAAM,cAAc,mBAAmB,IAAI,OAAO,gBAAgB;CAClE,MAAM,mBACJ,mBAAmB,IAAI,OAAO,kBAAkB,IAAI,IAAI,oBAAoB;CAC9E,MAAM,mBACJ,aAAa,WAAW,IACpB,OACA,KAAK,aAAa,KAAK,gBAAgB,YAAY,MAAM,WAAW,CAAC;CAC3E,MAAM,wBACJ,aAAa,WAAW,IACpB,OACA,KAAK,aAAa,KAAK,gBAAgB,YAAY,MAAM,gBAAgB,CAAC;CAChF,MAAM,UACJ,aAAa,WAAW,IAAI,OAAO,KAAK,aAAa,KAAK,gBAAgB,YAAY,MAAM,EAAE,CAAC;CACjG,MAAM,WAAW,aACd,KAAK,gBAAgB,YAAY,MAAM,oBAAoB,CAAC,CAC5D,QAAQ,UAA2B,UAAU,IAAI;CACpD,MAAM,uBAAuB,UAAU,QACpC,KAAK,gBACJ,MAAM,YAAY,SAAS,QAAQ,YAAY,QAAQ,cAAc,SAAS,CAAC,CAAC,CAAC,QACnF,CACF;CACA,MAAM,cAAc,UAAU,QAAQ,KAAK,gBAAgB,MAAM,YAAY,SAAS,QAAQ,CAAC;CAC/F,MAAM,eAAe,UAAU,SAAS,gBACtC,YAAY,SAAS,SAAS,YAAY,QAAQ,aAAa,CACjE;CACA,MAAM,uBAAuB,UAAU,QACpC,gBAAgB,YAAY,MAAM,2BAA2B,IAChE;CACA,MAAM,gBAAgB,qBAAqB,QACxC,KAAK,gBACJ,MACA,YAAY,SAAS,QAAQ,OAAO,YAAY,QAAQ,QAAQ,cAAc,QAAQ,CAAC,GACzF,CACF;CACA,MAAM,uBAAuB,qBAAqB,QAC/C,KAAK,gBAAgB,MAAM,YAAY,MAAM,kBAAkB,QAChE,CACF;CACA,MAAM,kBAAkB,aAAa,QAClC,gBAAgB,YAAY,eAAe,kBAC9C;CACA,MAAM,2BAA2B,gBAAgB,QAAQ,gBAAgB,CAAC,YAAY,KAAK;CAC3F,MAAM,YAAY,aAAa,QAAQ,gBAAgB,YAAY,eAAe,WAAW;CAC7F,MAAM,qBAAqB,UAAU,QAAQ,gBAAgB,CAAC,YAAY,KAAK;CAC/E,MAAM,oBAAoB,UAAU,QACjC,KAAK,gBAAgB,OAAO,YAAY,oBAAoB,YAAY,IACzE,CACF;CACA,MAAM,sBAAsB,UAAU,QACnC,KAAK,gBAAgB,OAAO,YAAY,oBAAoB,mBAAmB,UAAU,IAC1F,CACF;CACA,MAAM,2BAA2B,UAAU,QACxC,KAAK,gBAAgB,OAAO,YAAY,oBAAoB,OAAO,UAAU,IAC9E,CACF;CACA,MAAM,qBAAqB,UAAU,QAAQ,gBAC3C,YAAY,SAAS,MAAM,YAAY,QAAQ,cAAc,SAAS,CAAC,CACzE;CACA,MAAM,gCAAgC,mBAAmB,QACtD,gBACC,CAAC,YAAY,sBAAsB,YAAY,mBAAmB,OAAO,SAAS,CACtF,CAAC,CAAC;CACF,MAAM,SAAS,aAAa,KAAK,gBAAgB,YAAY,KAAK;CAClE,MAAM,eAAe,UACnB,OAAO,KAAK,UAAU;EACpB,IAAI,CAAC,OAAO,OAAO;EACnB,OAAO,MAAM,KAAK,SAAS,eAAgB,MAAM,gBAAgB,IAAK,MAAM,KAAK;CACnF,CAAC,CACH;CACA,MAAM,sBAAsB,6BAA6B,cAAc,mBAAmB;CAC1F,MAAM,wBAAwB,6BAC5B,aAAa,QAAQ,gBAAgB,YAAY,eAAe,UAAU,GAC1E,qBACF;CACA,OAAO;EACL;EACA,aAAa,aAAa;EAC1B,eAAe,aAAa,QAAQ,gBAAgB,CAAC,YAAY,KAAK,CAAC,CAAC;EACxE,YAAY,aAAa,QAAQ,gBAAgB,QAAQ,YAAY,KAAK,CAAC,CAAC,CAAC;EAC7E,kBAAkB,aAAa;EAC/B,qBAAqB,gBAAgB;EACrC,eAAe,UAAU;EACzB;EACA;EACA,IACE,qBAAqB,QAAQ,gBAAgB,OACzC,OACA,kBAAkB,kBAAkB,WAAW;EACrD;EACA;EACA;EACA,sBAAsB,SAAS,WAAW,IAAI,OAAO,KAAK,QAAQ;EAClE,kBAAkB,gBAAgB,IAAI,OAAO,uBAAuB;EACpE,yBACE,aAAa,WAAW,IACpB,OACA,aAAa,QAAQ,aAAa,QAAQ,SAAS,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,SACrE,aAAa;EACnB,wBACE,qBAAqB,WAAW,IAC5B,OACA,kBAAkB,IAChB,KACC,gBAAgB,wBAAwB;EACjD,oBACE,mBAAmB,WAAW,KAC9B,gCAAgC,KAChC,oBAAoB,wBAAwB,IACxC,OACA,qBAAqB,oBAAoB;EAC/C;EACA;EACA;EACA,kCACE,yBAAyB,WAAW,IAChC,OACA,yBAAyB,QACtB,gBAAgB,YAAY,MAAM,0BACrC,CAAC,CAAC,SAAS,yBAAyB;EAC1C,4BACE,gBAAgB,WAAW,IACvB,OACA,gBAAgB,QAAQ,gBAAgB,QAAQ,YAAY,KAAK,CAAC,CAAC,CAAC,SACpE,gBAAgB;EACtB,yBACE,mBAAmB,WAAW,IAC1B,OACA,mBAAmB,QAAQ,gBAAgB,YAAY,SAAS,SAAS,CAAC,CAAC,CAAC,SAC5E,mBAAmB;EACzB,sBACE,UAAU,WAAW,IACjB,OACA,UAAU,QAAQ,gBAAgB,QAAQ,YAAY,KAAK,CAAC,CAAC,CAAC,SAAS,UAAU;EACvF,qBAAqB,oBAAoB;EACzC,0BAA0B,oBAAoB;EAC9C,uBAAuB,sBAAsB;EAC7C,4BAA4B,sBAAsB;EAClD,WAAW,oBACT,aACG,KAAK,gBAAgB,YAAY,SAAS,CAAC,CAC3C,QAAQ,UAA2B,UAAU,IAAI,CACtD;EACA,2BAA2B,aAAa,QACrC,gBAAgB,YAAY,kBAAkB,iBACjD,CAAC,CAAC;EACF,2BAA2B,aAAa,QACrC,gBAAgB,YAAY,kBAAkB,iBACjD,CAAC,CAAC;EACF,oBAAoB,aAAa,QAC9B,gBAAgB,YAAY,kBAAkB,YACjD,CAAC,CAAC;EACF,OAAO,OAAO,QAAQ,KAAK,UAAU,OAAO,OAAO,SAAS,IAAI,CAAC;EACjE,kBAAkB,OAAO,QAAQ,UAAU,CAAC,SAAS,MAAM,UAAU,IAAI,CAAC,CAAC;EAC3E,aAAa,OAAO,QAAQ,KAAK,UAAU,OAAO,OAAO,QAAQ,SAAS,IAAI,CAAC;EAC/E,cAAc,OAAO,QAAQ,KAAK,UAAU,OAAO,OAAO,QAAQ,UAAU,IAAI,CAAC;EACjF,iBAAiB,OAAO,QAAQ,KAAK,UAAU,OAAO,OAAO,QAAQ,aAAa,IAAI,CAAC;EACvF,cAAc,OAAO,QAAQ,KAAK,UAAU,OAAO,OAAO,QAAQ,UAAU,IAAI,CAAC;EACjF,kBAAkB,OAAO,QAAQ,KAAK,UAAU,OAAO,OAAO,QAAQ,cAAc,IAAI,CAAC;EACzF,uBAAuB,OAAO,QAAQ,UAAU,CAAC,OAAO,MAAM,CAAC,CAAC;EAChE,gCAAgC,OAAO,QAAQ,UAAU,OAAO,QAAQ,cAAc,KAAA,CAAS,CAAC,CAC7F;EACH,6BAA6B,OAAO,QAAQ,UAAU,OAAO,QAAQ,WAAW,KAAA,CAAS,CAAC,CACvF;EACH,iCAAiC,OAAO,QACrC,UAAU,OAAO,QAAQ,eAAe,KAAA,CAC3C,CAAC,CAAC;EACF;EACA,iBAAiB,OAAO,QAAQ,UAAU,CAAC,SAAS,MAAM,KAAK,SAAS,YAAY,CAAC,CAAC;CACxF;AACF;AAEA,SAAS,KAAK,QAAmC;CAC/C,OAAO,OAAO,WAAW,IAAI,IAAI,UAAU,MAAM,IAAI,OAAO;AAC9D;AAEA,SAAS,UAAU,QAAmC;CACpD,MAAM,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,MACzB,MAAM,UAAU,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,OAAO,KAC9D;CACA,IAAI,MAAM;CACV,IAAI,aAAa;CACjB,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,OAAO,MAAM;EACnB,cAAc,KAAK,IAAI,GAAG,KAAK,KAAK,IAAI,KAAK,IAAI,MAAM,OAAO,QAAQ,QAAQ,OAAO;EACrF,MAAM;CACR;CACA,OAAO,MAAM;AACf;AAEA,SAAS,oBAAoB,QAA8D;CACzF,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC;CAC/C,OAAO;EACL,KAAK,OAAO;EACZ,MAAM,KAAK,MAAM;EACjB,KAAK,WAAW,QAAQ,EAAG;EAC3B,KAAK,WAAW,QAAQ,GAAI;EAC5B,KAAK,OAAO,GAAG,EAAE;CACnB;AACF;AAEA,SAAS,WAAW,QAA2B,UAA0B;CACvE,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,OAAO,OAAO,KAAK,KAAK,WAAW,OAAO,MAAM,IAAI,MAAM,OAAO,GAAG,EAAE,KAAK;AAC7E;AAEA,SAAS,6BACP,cACA,WACyC;CACzC,MAAM,yBAAS,IAAI,IAA2C;CAC9D,KAAK,MAAM,eAAe,cAAc;EACtC,MAAM,OAAO,OAAO,IAAI,YAAY,MAAM,KAAK,CAAC;EAChD,KAAK,KAAK,WAAW;EACrB,OAAO,IAAI,YAAY,QAAQ,IAAI;CACrC;CACA,MAAM,iBAA2B,CAAC;CAClC,KAAK,MAAM,QAAQ,OAAO,OAAO,GAAG;EAClC,MAAM,aAAuB,CAAC;EAC9B,KAAK,IAAI,OAAO,GAAG,OAAO,KAAK,QAAQ,QACrC,KAAK,IAAI,QAAQ,OAAO,GAAG,QAAQ,KAAK,QAAQ,SAC9C,WAAW,KAAK,QAAQ,UAAU,KAAK,KAAM,GAAG,UAAU,KAAK,MAAO,CAAC,CAAC;EAG5E,IAAI,WAAW,SAAS,GAAG,eAAe,KAAK,KAAK,UAAU,CAAC;CACjE;CACA,OAAO;EACL,OAAO,eAAe,WAAW,IAAI,OAAO,KAAK,cAAc;EAC/D,OAAO,eAAe;CACxB;AACF;AAEA,SAAS,sBAAsB,aAA6D;CAC1F,IAAI,YAAY,OAAO,OAAO,CAAC,SAAS,YAAY,MAAM,OAAO;CACjE,OAAO,YAAY,MAAM;AAC3B;AAEA,SAAS,oBAAoB,aAA6D;CACxF,IAAI,YAAY,OAAO,OAAO,CAAC,SAAS,YAAY,MAAM,OAAO;CACjE,OAAO,YAAY,SAChB,KAAK,YACJ,KAAK,UAAU,CACb,QAAQ,YACR,QAAQ,cACL,KAAK,aAAa;EAAC,SAAS;EAAM,SAAS;EAAK,SAAS,WAAW;CAAI,CAAC,CAAC,CAC1E,MAAM,MAAM,UAAU,iBAAiB,KAAK,UAAU,IAAI,GAAG,KAAK,UAAU,KAAK,CAAC,CAAC,CACxF,CAAC,CACH,CAAC,CACA,KAAK;AACV;AAEA,SAAS,QAAQ,MAAyB,OAAkC;CAC1E,MAAM,IAAI,IAAI,IAAI,IAAI;CACtB,MAAM,IAAI,IAAI,IAAI,KAAK;CACvB,MAAM,wBAAQ,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;CAClC,IAAI,MAAM,SAAS,GAAG,OAAO;CAC7B,IAAI,eAAe;CACnB,KAAK,MAAM,SAAS,GAAG,IAAI,EAAE,IAAI,KAAK,GAAG,gBAAgB;CACzD,OAAO,eAAe,MAAM;AAC9B;;;;;;;ACrMA,SAAgB,2BACd,UACiC;CACjC,OAAO,OAAO,EAAE,WAAW,UAAU,aAAa;EAChD,IAAI,SAAS,SAAS,QAAQ,OAAO;EACrC,MAAM,WAAW,kBAAkB,SAAS,GAAG;EAC/C,IAAI,CAAC,UAAU,OAAO;EACtB,MAAM,SAAS,MAAM,SAAS,SAAS,CAAC,CAAC,UACvC;GACE,UAAU,SAAS;GACnB,UAAU,CAAC,SAAS,MAAM;EAC5B,GACA,SAAS,EAAE,OAAO,IAAI,KAAA,CACxB;EACA,OACE,OAAO,aAAa,SAAS,WAC7B,OAAO,iBAAiB,WAAW,KACnC,OAAO,MAAM,MAAM,SAAS,KAAK,YAAY,SAAS,MAAM;CAEhE;AACF;AAgKA,eAAsB,oBACpB,SACiC;CACjC,yBAAyB,OAAO;CAChC,MAAM,6BAAY,IAAI,KAAK,EAAA,CAAE,YAAY;CACzC,MAAM,cAAc,QAAQ,eAAe;CAC3C,MAAM,kBAAkB,QAAQ,mBAAmB;CACnD,MAAM,UAAU,cAAc,QAAQ,OAAO,QAAQ,SAAS,aAAa,eAAe;CAC1F,MAAM,iBAAiB,KAAK,IAAI,QAAQ,kBAAkB,GAAG,QAAQ,MAAM;CAC3E,MAAM,sBAAsB,4BAC1B,QAAQ,uBAAuB,CAAC,GAChC,OACF;CACA,MAAM,YAAY,IAAI,IAAI,oBAAoB,IAAI,cAAc,CAAC;CACjE,MAAM,OAAO,QAAQ,QAAQ,QAAQ,CAAC,UAAU,IAAI,OAAO,GAAG,CAAC,CAAC;CAChE,MAAM,eAA8C,CAAC,GAAG,mBAAmB;CAC3E,IAAI,SAAS;CACb,MAAM,SAAS,YAA2B;EACxC,OAAO,SAAS,KAAK,QAAQ;GAC3B,QAAQ,QAAQ,eAAe;GAC/B,MAAM,MAAM,KAAK;GACjB,MAAM,cAAc,MAAM,gBAAgB,KAAK,QAAQ,QAAQ,QAAQ,eAAe;GACtF,QAAQ,QAAQ,eAAe;GAC/B,MAAM,QAAQ,gBAAgB,WAAW;GACzC,QAAQ,QAAQ,eAAe;GAC/B,aAAa,KAAK,WAAW;EAC/B;CACF;CACA,MAAM,QAAQ,IAAI,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,gBAAgB,KAAK,MAAM,EAAE,GAAG,MAAM,CAAC;CACvF,QAAQ,QAAQ,eAAe;CAC/B,MAAM,cAAc,IAAI,IAAI,QAAQ,QAAQ,KAAK,QAAQ,UAAU,CAAC,OAAO,IAAI,KAAK,CAAC,CAAC;CACtF,MAAM,YAAY,IAAI,IAAI,QAAQ,MAAM,KAAK,UAAU,UAAU,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CACtF,aAAa,MACV,GAAG,OACD,YAAY,IAAI,EAAE,QAAQ,KAAK,MAAM,YAAY,IAAI,EAAE,QAAQ,KAAK,OACpE,UAAU,IAAI,EAAE,MAAM,KAAK,MAAM,UAAU,IAAI,EAAE,MAAM,KAAK,MAC7D,EAAE,aAAa,EAAE,UACrB;CACA,OAAO;EACL,YAAY;GACV,GAAG,QAAQ;GACX;GACA,0BAAS,IAAI,KAAK,EAAA,CAAE,YAAY;GAChC,WAAW,QAAQ,MAAM;GACzB,WAAW,QAAQ,QAAQ,KAAK,WAAW,OAAO,EAAE;GACpD;GACA;GACA;EACF;EACA;EACA,WAAW,QAAQ,QAAQ,KAAK,WAC9B,gCACE,OAAO,IACP,aAAa,QAAQ,gBAAgB,YAAY,aAAa,OAAO,EAAE,CACzE,CACF;CACF;AACF;AAEA,SAAgB,wBAAwB,SAMK;CAC3C,OAAO;EACL,IAAI,QAAQ;EACZ,MAAM,QAAQ,OAAO,SAAS;GAC5B,MAAM,SAAS,MAAM,QAAQ,SAAS,IACpC,GAAG,QAAQ,GAAG,GAAG,QAAQ,OAAO,GAAG,QAAQ,cAC3C,OACA;IAAE,GAAG,QAAQ;IAAY,QAAQ,QAAQ;GAAO,CAClD;GACA,OAAO;IACL,UAAU,OAAO;IACjB,OAAO,mBAAmB,MAAM;IAChC,UAAU,EAAE,YAAY,OAAO;IAC/B,GAAI,QAAQ,uBAAuB,EAAE,OAAO,mBAAmB,MAAM,EAAE,IAAI,CAAC;GAC9E;EACF;CACF;AACF;AAEA,eAAe,gBACb,KAMA,QACA,iBACsC;CACtC,MAAM,UAAU,YAAY,IAAI;CAChC,IAAI;EACF,MAAM,SAAS,MAAM,IAAI,OAAO,QAAQ,IAAI,SAAS,OAAO;GAC1D,QAAQ,IAAI,SAAS;GACrB,YAAY,IAAI;GAChB;EACF,CAAC;EACD,IAAI,OAAO,OACT,+BAA+B,OAAO,OAAO,yBAAyB;EAExE,MAAM,qBAAqB,YAAY,IAAI,IAAI;EAC/C,MAAM,UAAU,wBAAwB,OAAO,mBAAmB,kBAAkB;EACpF,MAAM,iBAAiB,OAAO,QAAQ,CAAC,IAAI,OAAO;EAClD,OAAO;GACL,UAAU,IAAI,OAAO;GACrB,QAAQ,IAAI,SAAS;GACrB,WAAW,IAAI,SAAS;GACxB,YAAY,IAAI,SAAS;GACzB,YAAY,IAAI;GAChB,gBAAgB,IAAI;GACpB,WAAW,QAAQ;GACnB,eAAe,QAAQ;GACvB,UAAU,OAAO;GACjB,OAAO,qBAAqB,IAAI,UAAU,cAAc;GACxD,oBAAoB,kBAChB,MAAM,uBAAuB,IAAI,UAAU,OAAO,UAAU,iBAAiB,MAAM,IACnF,KAAA;GACJ,UAAU,CAAC,GAAI,IAAI,SAAS,QAAQ,CAAC,CAAE;GACvC,cAAc,IAAI,SAAS;GAC3B,OAAO,OAAO;GACd,gBAAgB,OAAO;GACvB,GAAI,OAAO,QAAQ,EAAE,OAAO,OAAO,MAAM,IAAI,CAAC;EAChD;CACF,SAAS,OAAO;EACd,IAAI,QAAQ,SAAS,MAAM;EAC3B,MAAM,WAA6B,CAAC;EACpC,OAAO;GACL,UAAU,IAAI,OAAO;GACrB,QAAQ,IAAI,SAAS;GACrB,WAAW,IAAI,SAAS;GACxB,YAAY,IAAI,SAAS;GACzB,YAAY,IAAI;GAChB,gBAAgB,IAAI;GACpB,WAAW,YAAY,IAAI,IAAI;GAC/B,eAAe;GACf;GACA,OAAO,qBAAqB,IAAI,UAAU,QAAQ;GAClD,UAAU,CAAC,GAAI,IAAI,SAAS,QAAQ,CAAC,CAAE;GACvC,cAAc,IAAI,SAAS;GAC3B,OAAO;IACL,OAAO,iBAAiB,QAAQ,MAAM,YAAY,OAAO;IACzD,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAChE;EACF;CACF;AACF;AAEA,SAAS,wBACP,mBACA,YAIA;CACA,IAAI,sBAAsB,KAAA,GACxB,OAAO;EAAE,OAAO;EAAY,QAAQ;CAAkB;CAExD,IAAI,sBAAsB,MAAM,OAAO;EAAE,OAAO;EAAM,QAAQ;CAAa;CAC3E,IAAI,CAAC,OAAO,SAAS,iBAAiB,KAAK,oBAAoB,GAC7D,MAAM,IAAI,WAAW,qEAAqE;CAE5F,OAAO;EAAE,OAAO;EAAmB,QAAQ;CAAkB;AAC/D;AAEA,SAAS,mBAAmB,QAAuE;CACjG,MAAM,SAAS,OAAO,YAAY,QAAQ,YAAY,QAAQ,WAAW,QAAQ;CACjF,IAAI,OAAO,WAAW,GAAG,OAAO,KAAA;CAChC,OAAO;EACL,OAAO;EACP,SAAS,OACN,KACE,YACC,GAAG,QAAQ,WAAW,IAAI,QAAQ,OAAO,SAAS,QAAQ,IAAI,QAAQ,OAAO,WAAW,kBAC5F,CAAC,CACA,KAAK,IAAI;CACd;AACF;AAEA,SAAS,cACP,OACA,SACA,aACA,iBAMC;CACD,MAAM,gBAAgB,CAAC,GAAG,OAAO,CAAC,CAAC,MAChC,MAAM,UACL,WAAW,GAAG,gBAAgB,QAAQ,KAAK,IAAI,IAC7C,WAAW,GAAG,gBAAgB,QAAQ,MAAM,IAAI,KAAK,KAAK,GAAG,cAAc,MAAM,EAAE,CACzF;CACA,IAAI,iBAAiB;CACrB,OAAO,MAAM,SAAS,UAAU,cAC9B,MAAM,KAAK,EAAE,QAAQ,YAAY,IAAI,GAAG,eAAe;EAErD,MAAM,YADa,YAAY,cAAc,cACf,cAAc;EAE5C,OAAO,CADU,GAAG,cAAc,MAAM,QAAQ,GAAG,GAAG,cAAc,MAAM,GAAG,QAAQ,CACxE,CAAC,CAAC,KAAK,YAAY;GAC9B;GACA;GACA;GACA,gBAAgB;EAClB,EAAE;CACJ,CAAC,CAAC,CAAC,KAAK,CACV;AACF;AAEA,SAAS,4BACP,cACA,MAM+B;CAC/B,MAAM,WAAW,IAAI,IAAI,KAAK,KAAK,QAAQ,CAAC,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;CAC9D,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,aAAa,KAAK,gBAAgB;EACvC,MAAM,MAAM,eAAe,WAAW;EACtC,IAAI,KAAK,IAAI,GAAG,GACd,MAAM,IAAI,UACR,oDAAoD,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,EAC3H;EAEF,KAAK,IAAI,GAAG;EACZ,MAAM,MAAM,SAAS,IAAI,GAAG;EAC5B,IAAI,CAAC,KACH,MAAM,IAAI,UACR,wEAAwE,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,EAC/I;EAEF,IAAI,YAAY,mBAAmB,IAAI,gBACrC,MAAM,IAAI,UACR,0CAA0C,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,uBAAuB,YAAY,eAAe,aAAa,IAAI,gBACpL;EAEF,IACE,YAAY,cAAc,IAAI,SAAS,aACvC,YAAY,eAAe,IAAI,SAAS,YAExC,MAAM,IAAI,UACR,0CAA0C,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,yCACjH;EAEF,IACE,KAAK,UAAU,YAAY,QAAQ,MAAM,KAAK,UAAU,IAAI,SAAS,QAAQ,CAAC,CAAC,KAC/E,KAAK,UAAU,YAAY,YAAY,MAAM,KAAK,UAAU,IAAI,SAAS,QAAQ,GAEjF,MAAM,IAAI,UACR,0CAA0C,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,2CACjH;EAEF,MAAM,gBAAgB,qBACpB,IAAI,UACJ,YAAY,QAAQ,CAAC,IAAI,YAAY,QACvC;EACA,IAAI,KAAK,UAAU,YAAY,KAAK,MAAM,KAAK,UAAU,aAAa,GACpE,MAAM,IAAI,UACR,0CAA0C,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,8BACjH;EAEF,IAAI,YAAY,OACd,+BACE,YAAY,OACZ,0CAA0C,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,QACjH;EAEF,IACE,CAAC;GAAC;GAAmB;GAAmB;EAAY,CAAC,CAAC,SAAS,YAAY,aAAa,KACvF,YAAY,kBAAkB,gBAAgB,YAAY,cAAc,QACxE,YAAY,kBAAkB,iBAC5B,YAAY,cAAc,QACzB,CAAC,OAAO,SAAS,YAAY,SAAS,KACtC,YAAY,YAAY,IAE5B,MAAM,IAAI,UACR,0CAA0C,YAAY,SAAS,GAAG,YAAY,OAAO,GAAG,YAAY,WAAW,sBACjH;EAEF,OAAO,EAAE,GAAG,YAAY;CAC1B,CAAC;AACH;AAEA,SAAS,OAAO,KAIL;CACT,OAAO,GAAG,IAAI,OAAO,GAAG,QAAQ,IAAI,SAAS,GAAG,QAAQ,IAAI;AAC9D;AAEA,SAAS,eAAe,aAIb;CACT,OAAO,GAAG,YAAY,SAAS,QAAQ,YAAY,OAAO,QAAQ,YAAY;AAChF;AAEA,eAAe,uBACb,UACA,UACA,UACA,QACoC;CACpC,MAAM,WAAW,SAAS,SAAS,YAAY,QAAQ,aAAa;CACpE,MAAM,WAA0B,CAAC;CACjC,MAAM,qBAAoC,CAAC;CAC3C,MAAM,SAA2C,CAAC;CAClD,KAAK,MAAM,OAAO,UAAU;EAC1B,QAAQ,eAAe;EACvB,IAAI;GACF,IACE,MAAM,SAAS;IACb,QAAQ,SAAS;IACjB,WAAW,SAAS;IACpB,UAAU;IACV;GACF,CAAC,GAED,SAAS,KAAK,GAAG;QAEjB,mBAAmB,KAAK,GAAG;EAE/B,SAAS,OAAO;GACd,IAAI,QAAQ,SAAS,MAAM;GAC3B,OAAO,KAAK;IACV,UAAU;IACV,OAAO,iBAAiB,QAAQ,MAAM,YAAY,OAAO;IACzD,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GAChE,CAAC;EACH;CACF;CACA,OAAO;EACL,SAAS,SAAS;EAClB,UAAU,SAAS;EACnB;EACA;EACA,UAAU,SAAS,WAAW,KAAK,OAAO,SAAS,IAAI,OAAO,SAAS,SAAS,SAAS;CAC3F;AACF;AAEA,SAAS,kBAAkB,KAAyD;CAClF,MAAM,QAAQ,qCAAqC,KAAK,GAAG;CAC3D,IAAI,CAAC,OAAO,OAAO;CACnB,IAAI;EACF,MAAM,UAAU,mBAAmB,MAAM,EAAG;EAC5C,MAAM,SAAS,mBAAmB,MAAM,EAAG;EAC3C,OAAO,WAAW,SAAS;GAAE;GAAS;EAAO,IAAI;CACnD,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,yBAAiC,SAAmD;CAC3F,IAAI,QAAQ,MAAM,WAAW,GAAG,MAAM,IAAI,UAAU,oCAAoC;CACxF,IAAI,QAAQ,QAAQ,WAAW,GAAG,MAAM,IAAI,UAAU,sCAAsC;CAC5F,MAAM,cAAc,QAAQ,eAAe;CAC3C,MAAM,iBAAiB,QAAQ,kBAAkB;CACjD,IAAI,CAAC,OAAO,cAAc,WAAW,KAAK,cAAc,GACtD,MAAM,IAAI,WAAW,iEAAiE;CAExF,IAAI,CAAC,OAAO,cAAc,cAAc,KAAK,iBAAiB,GAC5D,MAAM,IAAI,WAAW,oEAAoE;CAE3F,IAAI,CAAC,OAAO,cAAc,QAAQ,mBAAmB,CAAC,GACpD,MAAM,IAAI,WAAW,4DAA4D;CAEnF,qBACE,QAAQ,MAAM,KAAK,aAAa,SAAS,EAAE,GAC3C,MACF;CACA,qBACE,QAAQ,QAAQ,KAAK,WAAW,OAAO,EAAE,GACzC,QACF;CACA,KAAK,MAAM,YAAY,QAAQ,OAAO,sBAAsB,QAAQ;AACtE;AAEA,SAAS,sBAAsB,UAAsC;CACnE,8BAA8B,QAAQ;CACtC,IAAI,CAAC,SAAS,UAAU,KAAK,GAC3B,MAAM,IAAI,UAAU,GAAG,SAAS,GAAG,gDAAgD;CAErF,IACE,SAAS,eAAe,cACxB,SAAS,eAAe,sBACxB,SAAS,eAAe,aAExB,MAAM,IAAI,UAAU,GAAG,SAAS,GAAG,0CAA0C;CAE/E,IAAI,SAAS,eAAe,cAAc,SAAS,eAAe,WAAW,GAC3E,MAAM,IAAI,UAAU,GAAG,SAAS,GAAG,qDAAqD;CAE1F,IAAI,SAAS,eAAe,cAAc,SAAS,eAAe,SAAS,GACzE,MAAM,IAAI,UACR,GAAG,SAAS,GAAG,IAAI,SAAS,WAAW,qCACzC;AAEJ;AAEA,SAAS,qBAAqB,QAA2B,OAAqB;CAC5E,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,CAAC,MAAM,KAAK,GAAG,MAAM,IAAI,UAAU,qBAAqB,MAAM,sBAAsB;EACxF,IAAI,KAAK,IAAI,KAAK,GAAG,MAAM,IAAI,UAAU,+BAA+B,MAAM,OAAO,MAAM,EAAE;EAC7F,KAAK,IAAI,KAAK;CAChB;AACF;;;;;;;AAQA,SAAS,WAAW,OAAuB;CACzC,IAAI,OAAO;CACX,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;EACpD,QAAQ,MAAM,WAAW,KAAK;EAC9B,OAAO,KAAK,KAAK,MAAM,QAAQ;CACjC;CACA,OAAO,SAAS;AAClB;AAEA,SAAS,mBAAmB,QAA+C;CACzE,MAAM,SAAS,OAAO,YAAY,KAAK,YAAY,QAAQ,KAAK;CAChE,MAAM,QAAQ,OAAO,OAAO,UAAU,MAAM,UAAU,IAAI,IACtD,OAAO,QAAQ,KAAK,UAAU,OAAO,MAAM,SAAS,IAAI,CAAC,IACzD;CACJ,MAAM,SAAS,OAAO,OAAO,UAAU,MAAM,WAAW,IAAI,IACxD,OAAO,QACJ,KAAK,WAAW;EACf,OAAO,IAAI,SAAS,MAAM,QAAQ,SAAS;EAC3C,QAAQ,IAAI,UAAU,MAAM,QAAQ,UAAU;EAC9C,WAAW,IAAI,aAAa,MAAM,QAAQ,aAAa;EACvD,QAAQ,IAAI,UAAU,MAAM,QAAQ,UAAU;EAC9C,YAAY,IAAI,cAAc,MAAM,QAAQ,cAAc;CAC5D,IACA;EAAE,OAAO;EAAG,QAAQ;EAAG,WAAW;EAAG,QAAQ;EAAG,YAAY;CAAE,CAChE,IACA;CACJ,MAAM,eAAe,OAAO,QACzB,KAAK,UACJ,OAAO,MAAM,KAAK,SAAS,eAAgB,MAAM,gBAAgB,IAAK,MAAM,KAAK,MACnF,CACF;CACA,MAAM,OAAO,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS,YAAY,IAC/D;EAAE,MAAM;EAAc,KAAK;CAAK,IACjC,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS,WAAW,IACnD;EAAE,MAAM;EAAa,KAAK;CAAa,IACvC;EAAE,MAAM;EAAY,KAAK;CAAa;CAC7C,OAAO;EACL;EACA;EACA;EACA,GAAI,KAAK,SAAS,eAAe,EAAE,aAAa,IAAI,CAAC;CACvD;AACF"}