@tangle-network/agent-eval 0.188.0 → 0.190.0

package/dist/analyst/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../src/analyst/adapters.ts","../../src/analyst/bind.ts","../../src/analyst/define.ts","../../src/analyst/kinds/skill-usage.ts"],"sourcesContent":["/**\n * Adapter factory — lifts the semantic-concept judge into the Analyst\n * contract without re-implementing it.\n *\n * It builds an Analyst with a stable id (caller chooses; a default is given),\n * a version derived from the judge's version plus an adapter revision, and an\n * `analyze()` that calls the judge and lifts its output to `AnalystFinding[]`\n * through `makeFinding()`. The judge's `Severity` ('critical' | 'major' |\n * 'minor' | 'info') projects onto `AnalystSeverity`: 'major' becomes 'high'\n * and 'minor' becomes 'medium'.\n *\n * The adapter owns no state. Calling the factory twice is safe.\n */\n\nimport { CostLedger } from '../cost-ledger'\nimport type { Severity as LayerSeverity } from '../multi-layer-verifier'\nimport {\n  runSemanticConceptJudge,\n  SEMANTIC_CONCEPT_JUDGE_VERSION,\n  type SemanticConceptJudgeInput,\n  type SemanticConceptJudgeOptions,\n  type SemanticConceptJudgeResult,\n} from '../semantic-concept-judge'\nimport type { Analyst, AnalystFinding, AnalystSeverity } from './types'\nimport { makeFinding } from './types'\nimport { settleUsageReceiptFromCostLedger, validateUsageSettlementTimeout } from './usage-receipt'\n\nconst ADAPTER_REV = '1'\n\n// ── Severity bridges ───────────────────────────────────────────────\n\nfunction liftSeverity(s: LayerSeverity): AnalystSeverity {\n  switch (s) {\n    case 'critical':\n      return 'critical'\n    case 'major':\n      return 'high'\n    case 'minor':\n      return 'medium'\n    case 'info':\n      return 'info'\n  }\n}\n\n// ── SemanticConceptJudge → Analyst ─────────────────────────────────\n\nexport interface SemanticConceptJudgeAdapterOpts {\n  id?: string\n  area?: string\n  /** Registry context owns cancellation and the per-analyst cost ledger. */\n  options: Omit<SemanticConceptJudgeOptions, 'costLedger' | 'signal'>\n  /** Maximum post-cancellation wait for a provider receipt. Default 5 seconds. */\n  settlementTimeoutMs?: number\n}\n\nexport function createSemanticConceptJudgeAdapter(\n  opts: SemanticConceptJudgeAdapterOpts,\n): Analyst<SemanticConceptJudgeInput> {\n  const id = opts.id ?? 'semantic-concept-judge'\n  const area = opts.area ?? 'concept-coverage'\n  const settlementTimeoutMs = validateUsageSettlementTimeout(opts.settlementTimeoutMs)\n  return {\n    id,\n    description:\n      'Runs the semantic-concept judge and surfaces missing / weak concepts as findings.',\n    inputKind: 'custom',\n    cost: {\n      kind: 'llm',\n      models: opts.options.model ? [opts.options.model] : undefined,\n      settlement_timeout_ms: settlementTimeoutMs,\n    },\n    version: `${SEMANTIC_CONCEPT_JUDGE_VERSION}-adapter-${ADAPTER_REV}`,\n    async analyze(input, ctx) {\n      const costLedger = new CostLedger(ctx.budgetUsd)\n      let result: SemanticConceptJudgeResult\n      try {\n        result = await runSemanticConceptJudge(input, {\n          ...opts.options,\n          costLedger,\n          signal: ctx.signal,\n        })\n      } finally {\n        const usage = await settleUsageReceiptFromCostLedger(costLedger, {\n          channel: 'judge',\n          timeoutMs: settlementTimeoutMs,\n        })\n        if (!usage.settled) {\n          ctx.log?.('semantic-concept judge provider settlement timed out', {\n            pending_calls: usage.pendingCalls,\n            timeout_ms: settlementTimeoutMs,\n          })\n        }\n        ctx.recordUsage?.(usage.receipt)\n      }\n      if (!result.available) {\n        return [\n          makeFinding({\n            analyst_id: id,\n            area,\n            claim: 'semantic-concept judge unavailable',\n            rationale: result.error,\n            severity: 'info',\n            confidence: 1,\n            evidence_refs: [],\n            metadata: { reason: result.error },\n          }),\n        ]\n      }\n      const out: AnalystFinding[] = []\n      for (const f of result.findings) {\n        // Only surface gaps: missing concepts or low scores. Concepts at\n        // 7+/10 with present=true are not findings — they're successes.\n        if (f.present && f.score >= 7) continue\n        out.push(\n          makeFinding({\n            analyst_id: id,\n            area,\n            subject: f.concept,\n            claim: f.present\n              ? `concept \"${f.concept}\" is weak (${f.score}/10)`\n              : `concept \"${f.concept}\" is missing`,\n            rationale: f.evidence,\n            severity: liftSeverity(f.severity),\n            confidence: 0.85,\n            evidence_refs: [{ kind: 'artifact', uri: 'inline:evidence', excerpt: f.evidence }],\n            metadata: {\n              concept: f.concept,\n              present: f.present,\n              score_10: f.score,\n            },\n          }),\n        )\n      }\n      return out\n    },\n  }\n}\n","/**\n * bindAnalyst — compile an `AnalystDefinition` into a runnable arm.\n *\n * The definition declares protocol (question, task text, reply grammar,\n * evidence projection, budget, repair turns); the transport binding supplies\n * execution (a bridge endpoint, or the caller-owned model path). Each\n * projection mode dispatches to the same strategy its arm's entry point runs,\n * so a compiled definition and the historical creator send byte-identical\n * requests — the definition parity suite asserts this per arm.\n *\n * A projection × transport pair with no strategy fails loud with\n * `AnalystExpressivenessError` naming the pair: an arm shape this layer cannot\n * express must be reported, never approximated.\n */\n\nimport type { CustomTokenPricing } from '../cost-ledger'\nimport type { AnalystBenchmarkRunner } from './benchmark'\nimport { runChunkedAnalystDefinition } from './benchmark-public-model'\nimport { runReplVariableAnalystDefinition } from './benchmark-public-rlm'\nimport type { PublicAnalystBenchmarkModelConfig } from './benchmark-public-types'\nimport { runInlineAnalystDefinition } from './benchmark-runner-prime'\nimport { type AnalystDefinition, AnalystExpressivenessError } from './definition'\nimport type { PrimeBridgeTransport } from './prime-bridge-transport'\nimport type { AnalystRunInputs } from './types'\n\n/** Execution half of a binding: who actually reaches the model. */\nexport type AnalystTransportBinding =\n  | {\n      /** An OpenAI-compatible cli-bridge endpoint (inline projections). */\n      readonly kind: 'prime-bridge'\n      readonly baseUrl: string\n      readonly model: string\n      readonly transport?: PrimeBridgeTransport\n      readonly pricing?: CustomTokenPricing\n    }\n  | {\n      /** The caller-owned model path (chunked and repl-variable projections). */\n      readonly kind: 'model-owner'\n      readonly config: PublicAnalystBenchmarkModelConfig\n    }\n\n/**\n * Compile a definition plus a transport binding into a runnable arm. Dispatch\n * is total over the expressible pairs; everything else is a loud refusal.\n */\nexport function bindAnalyst<TRow, TAssignment, TBlock>(\n  definition: AnalystDefinition<TRow, TAssignment, TBlock>,\n  transports: AnalystTransportBinding,\n): AnalystBenchmarkRunner<AnalystRunInputs> {\n  const mode = definition.projection.mode\n  if (mode === 'inline' && transports.kind === 'prime-bridge') {\n    return runInlineAnalystDefinition(definition, {\n      baseUrl: transports.baseUrl,\n      model: transports.model,\n      ...(transports.transport ? { transport: transports.transport } : {}),\n      ...(transports.pricing ? { pricing: transports.pricing } : {}),\n    })\n  }\n  if (mode === 'chunked' && transports.kind === 'model-owner') {\n    return runChunkedAnalystDefinition(definition, transports.config)\n  }\n  if (mode === 'repl-variable' && transports.kind === 'model-owner') {\n    return runReplVariableAnalystDefinition(\n      // The repl-variable strategy is written against the engine's raw-finding\n      // row type; the definition's own row declaration carries it.\n      definition as Parameters<typeof runReplVariableAnalystDefinition>[0],\n      transports.config,\n    )\n  }\n  throw new AnalystExpressivenessError(\n    `no strategy compiles a '${mode}' projection over a '${transports.kind}' transport; ` +\n      `definition '${definition.id}' cannot be expressed by this layer yet`,\n  )\n}\n","import type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { ExactCapableAnalyst } from './exact-types'\nimport type { TraceAnalystDefinition } from './kind-factory'\nimport type { Analyst, AnalystCost } from './types'\n\n/**\n * Define a reusable trace-research question.\n *\n * The returned value contains no model, credentials, or execution state. Bind\n * it to any TraceAnalysisEngine with `runTraceAnalyst` or\n * `createTraceAnalyst`.\n */\nexport function defineTraceAnalyst(definition: TraceAnalystDefinition): TraceAnalystDefinition {\n  for (const [name, value] of [\n    ['id', definition.id],\n    ['description', definition.description],\n    ['area', definition.area],\n    ['version', definition.version],\n    ['instructions', definition.instructions],\n  ] as const) {\n    if (typeof value !== 'string' || !value.trim()) {\n      throw new TypeError(`defineTraceAnalyst: ${name} must be a non-empty string`)\n    }\n  }\n  return {\n    ...definition,\n    limits: definition.limits ? { ...definition.limits } : undefined,\n  }\n}\n\nexport interface DefineCustomAnalystOptions {\n  id: string\n  description: string\n  version?: string\n  cost: AnalystCost\n  analyze: Analyst<TraceAnalysisStore>['analyze']\n}\n\nexport interface DefineExactCustomAnalystOptions extends DefineCustomAnalystOptions {\n  /** Canonical JSON for behavior knobs not already bound by `version`. */\n  executionConfig: Readonly<Record<string, unknown>>\n}\n\n/** Construct a registrable analyst from a hand-written analyze function. */\nexport function defineCustomAnalyst(\n  options: DefineExactCustomAnalystOptions,\n): ExactCapableAnalyst<TraceAnalysisStore>\nexport function defineCustomAnalyst(\n  options: DefineCustomAnalystOptions,\n): Analyst<TraceAnalysisStore>\nexport function defineCustomAnalyst(\n  options: DefineCustomAnalystOptions | DefineExactCustomAnalystOptions,\n): Analyst<TraceAnalysisStore> | ExactCapableAnalyst<TraceAnalysisStore> {\n  if (!options.id.trim()) throw new TypeError('defineCustomAnalyst: id must not be empty')\n  if (!options.description.trim()) {\n    throw new TypeError('defineCustomAnalyst: description must not be empty')\n  }\n  if (options.cost === undefined) {\n    throw new TypeError('defineCustomAnalyst: cost must be declared')\n  }\n  if (\n    'executionConfig' in options &&\n    (!options.executionConfig ||\n      typeof options.executionConfig !== 'object' ||\n      Array.isArray(options.executionConfig))\n  ) {\n    throw new TypeError('defineCustomAnalyst: executionConfig must be an object')\n  }\n  return {\n    id: options.id,\n    description: options.description,\n    version: options.version ?? '1.0.0',\n    inputKind: 'trace-store',\n    cost: options.cost,\n    analyze: options.analyze,\n    ...('executionConfig' in options ? { executionConfig: options.executionConfig } : {}),\n  }\n}\n","/**\n * Skill-usage analyst — a DETERMINISTIC `Analyst` over a Claude/Codex skill\n * library + its trace corpus. Unlike the trace-store kinds (failure-mode,\n * improvement, ...) this kind calls no LLM: it mines real usage and skill\n * structure and emits findings by rule.\n *\n * It exists because the naive \"Skill-tool invocation count\" lies low — it\n * misses orchestrated sub-dispatch (a leaf skill run BY /pursue or /governor\n * logs under the parent), slash-command entry, local-script bypass, and\n * on-disk artifacts. The 2026-05-30 skill audit found 39/53 skills at zero\n * direct invocations, yet only one was a genuine cut: the rest were\n * measurement-invisible or discovery-limited. This analyst encodes that\n * lesson as a multi-signal usage model so a cheap repeatable pass can keep\n * the library honest, and so the expensive audit workflow's verdicts can\n * GEPA-distill it toward agreement (see `gold/skill-verdicts.gold.jsonl`).\n *\n * Report-building (`buildSkillUsageReport`, an fs scan) is separated from\n * finding emission (`SkillUsageAnalyst.analyze`, pure) so the slow scan runs\n * once at the registry boundary and the rule logic stays unit-testable.\n */\n\nimport { type Dirent, existsSync, readdirSync, readFileSync, statSync } from 'node:fs'\nimport { join } from 'node:path'\nimport type { ExactCapableAnalyst } from '../exact-types'\nimport type { AnalystContext, AnalystFinding, AnalystSeverity } from '../types'\nimport { computeFindingId } from '../types'\n\n// ── Input model ──────────────────────────────────────────────────────\n\nexport type SkillKind = 'public' | 'private'\n\n/** One skill's multi-signal usage + structure. All counts are deterministic. */\nexport interface SkillUsageRecord {\n  name: string\n  kind: SkillKind\n  /** Absolute path to the skill's SKILL.md. */\n  path: string\n  lines: number\n  /** `\"skill\":\"<name>\"` Skill-tool invocations across the trace corpus. */\n  directInvocations: number\n  /** `<command-name>/<name>` slash invocations across the trace corpus. */\n  slashInvocations: number\n  /** Sibling skills whose SKILL.md dispatches to this one (`/<name>`). Proxy\n   *  for orchestrated sub-dispatch the per-skill counter cannot see. */\n  inboundRefs: number\n  /** On-disk artifacts attributable to the skill (e.g. `.evolve/<name>/**`). */\n  artifactCount: number\n  /** Tangle-private reference count in the body (leak signal for public skills). */\n  tanglePrivateRefs: number\n  hasReferencesDir: boolean\n  hasEvalsDir: boolean\n  /** Body mentions `skill-runs.jsonl` (visible to /reflect + /governor). */\n  logsRuns: boolean\n  /** Description carries an explicit `Triggers:` clause / trigger phrases. */\n  hasTriggerPhrases: boolean\n}\n\nexport interface SkillUsageReport {\n  generatedFromTraces: number\n  records: SkillUsageRecord[]\n}\n\nexport interface SkillUsageScanConfig {\n  /** Dirs holding `*.jsonl` transcripts (Claude `~/.claude/projects`, Codex sessions). */\n  transcriptDirs: string[]\n  /** Skill roots to scan; each dir directly under `root` with a `SKILL.md` is a skill. */\n  skillRoots: { root: string; kind: SkillKind }[]\n  /** Roots scanned for `<root>/.evolve/<skill>` artifact dirs. */\n  artifactRoots?: string[]\n  /** Token-prefixed mappings: skill name → extra artifact subpaths under an artifactRoot\n   *  (e.g. reflect → `.evolve/reflections`). Catches non-eponymous artifact dirs. */\n  artifactAliases?: Record<string, string[]>\n  /** Cap files read per transcript dir (bounds a huge corpus); 0 = unbounded. */\n  maxTranscriptsPerDir?: number\n}\n\n// ── Deterministic thresholds ─────────────────────────────────────────\n\n/** Anthropic's authoring guidance keeps SKILL.md short; past this with no\n *  `references/` split the body burns context budget every session. */\nconst BLOAT_LINE_THRESHOLD = 300\n\nconst TANGLE_PRIVATE_RE =\n  /\\b(cli-bridge|tangletools|ops-board|drew-gtr-pro|@tangle-network\\/|~\\/company|tangle\\.tools|gtm-agent)\\b|\\bkimi\\b|\\btcloud\\b/gi\nconst TRIGGER_RE = /triggers?\\s*[:-]/i\n\n// ── Report builder (fs scan — slow, runs once at the registry boundary) ──\n\nfunction listSkillDirs(root: string): { name: string; path: string }[] {\n  if (!existsSync(root)) return []\n  const out: { name: string; path: string }[] = []\n  for (const entry of readdirSync(root, { withFileTypes: true })) {\n    if (!entry.isDirectory() && !entry.isSymbolicLink()) continue\n    const skillMd = join(root, entry.name, 'SKILL.md')\n    if (existsSync(skillMd)) out.push({ name: entry.name, path: skillMd })\n  }\n  return out\n}\n\nfunction walkJsonl(dir: string, cap: number): string[] {\n  if (!existsSync(dir)) return []\n  const files: string[] = []\n  const stack = [dir]\n  while (stack.length) {\n    const cur = stack.pop()!\n    let entries: Dirent[]\n    try {\n      entries = readdirSync(cur, { withFileTypes: true })\n    } catch {\n      continue\n    }\n    for (const e of entries) {\n      const full = join(cur, e.name)\n      if (e.isDirectory()) stack.push(full)\n      else if (e.name.endsWith('.jsonl')) {\n        files.push(full)\n        if (cap > 0 && files.length >= cap) return files\n      }\n    }\n  }\n  return files\n}\n\nfunction frontmatterDescription(body: string): string {\n  const fm = /^---\\n([\\s\\S]*?)\\n---/.exec(body)\n  const block = fm?.[1] ?? ''\n  const m = /description:\\s*(.+)/i.exec(block)\n  return m?.[1] ?? ''\n}\n\nfunction countArtifacts(roots: string[], name: string, aliases: string[]): number {\n  let n = 0\n  for (const root of roots) {\n    const candidates = [join(root, '.evolve', name), ...aliases.map((a) => join(root, a))]\n    for (const dir of candidates) {\n      if (!existsSync(dir)) continue\n      try {\n        if (statSync(dir).isDirectory()) n += readdirSync(dir).length\n        else n += 1\n      } catch {\n        /* unreadable — skip */\n      }\n    }\n  }\n  return n\n}\n\n/** Scan the corpus + skill roots into a {@link SkillUsageReport}. Deterministic. */\nexport function buildSkillUsageReport(config: SkillUsageScanConfig): SkillUsageReport {\n  const skills = config.skillRoots.flatMap(({ root, kind }) =>\n    listSkillDirs(root).map((s) => ({ ...s, kind })),\n  )\n  const names = skills.map((s) => s.name)\n\n  // One pass over the corpus accumulating direct + slash counts per skill.\n  const direct = new Map<string, number>(names.map((n) => [n, 0]))\n  const slash = new Map<string, number>(names.map((n) => [n, 0]))\n  const skillRe = /\"skill\"\\s*:\\s*\"([a-z0-9_:-]+)\"/g\n  const cmdRe = /<command-name>\\/?([a-z0-9_:-]+)<\\/command-name>/g\n  let transcripts = 0\n  for (const dir of config.transcriptDirs) {\n    for (const file of walkJsonl(dir, config.maxTranscriptsPerDir ?? 0)) {\n      transcripts += 1\n      let data: string\n      try {\n        data = readFileSync(file, 'utf8')\n      } catch {\n        continue\n      }\n      for (const m of data.matchAll(skillRe)) {\n        const g = m[1]\n        if (!g) continue\n        const n = g.split(':').pop() ?? g\n        const prev = direct.get(n)\n        if (prev !== undefined) direct.set(n, prev + 1)\n      }\n      for (const m of data.matchAll(cmdRe)) {\n        const g = m[1]\n        if (g === undefined) continue\n        const prev = slash.get(g)\n        if (prev !== undefined) slash.set(g, prev + 1)\n      }\n    }\n  }\n\n  // Read each skill body once; compute structure + inbound refs across siblings.\n  const bodies = new Map<string, string>()\n  for (const s of skills) {\n    try {\n      bodies.set(s.name, readFileSync(s.path, 'utf8'))\n    } catch {\n      bodies.set(s.name, '')\n    }\n  }\n  const inbound = new Map<string, number>(names.map((n) => [n, 0]))\n  for (const target of names) {\n    const ref = new RegExp(`/${target}\\\\b|\\\\[\\\\[${target}\\\\]\\\\]`)\n    for (const s of skills) {\n      if (s.name === target) continue\n      if (ref.test(bodies.get(s.name) ?? '')) inbound.set(target, inbound.get(target)! + 1)\n    }\n  }\n\n  const records: SkillUsageRecord[] = skills.map((s) => {\n    const body = bodies.get(s.name) ?? ''\n    const dir = s.path.replace(/\\/SKILL\\.md$/, '')\n    return {\n      name: s.name,\n      kind: s.kind,\n      path: s.path,\n      lines: body ? body.split('\\n').length : 0,\n      directInvocations: direct.get(s.name) ?? 0,\n      slashInvocations: slash.get(s.name) ?? 0,\n      inboundRefs: inbound.get(s.name) ?? 0,\n      artifactCount: countArtifacts(\n        config.artifactRoots ?? [],\n        s.name,\n        config.artifactAliases?.[s.name] ?? [],\n      ),\n      tanglePrivateRefs: (body.match(TANGLE_PRIVATE_RE) ?? []).length,\n      hasReferencesDir: existsSync(join(dir, 'references')),\n      hasEvalsDir: existsSync(join(dir, 'evals')),\n      logsRuns: body.includes('skill-runs.jsonl'),\n      hasTriggerPhrases: TRIGGER_RE.test(frontmatterDescription(body) || body.slice(0, 600)),\n    }\n  })\n  return { generatedFromTraces: transcripts, records }\n}\n\n// ── Finding emission (pure — unit-testable, no LLM, no fs) ────────────\n\nconst ANALYST_ID = 'skill-usage'\n\nfunction finding(\n  area: string,\n  subject: string,\n  claim: string,\n  severity: AnalystSeverity,\n  confidence: number,\n  producedAt: string,\n  recommended: string,\n  evidenceUri: string,\n  rationale?: string,\n): AnalystFinding {\n  return {\n    schema_version: '1.0.0',\n    finding_id: computeFindingId({ analyst_id: ANALYST_ID, area, subject, claim }),\n    analyst_id: ANALYST_ID,\n    produced_at: producedAt,\n    severity,\n    area,\n    claim,\n    rationale,\n    evidence_refs: [{ kind: 'artifact', uri: evidenceUri }],\n    recommended_action: recommended,\n    confidence,\n    subject,\n  }\n}\n\n/** Pure rule pass over a report → findings. Exported for direct/unit use. */\nexport function emitSkillUsageFindings(\n  report: SkillUsageReport,\n  producedAt: string,\n): AnalystFinding[] {\n  const out: AnalystFinding[] = []\n  for (const r of report.records) {\n    const directTotal = r.directInvocations + r.slashInvocations\n    const trueUsage = directTotal + r.inboundRefs + r.artifactCount\n\n    // 1. Dead: no usage signal of ANY kind. The only real deprecation candidate.\n    if (trueUsage === 0) {\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' has zero usage across all signals (direct, slash, inbound-refs, artifacts)`,\n          'high',\n          0.6,\n          producedAt,\n          'Confirm the skill covers a real recurring job; if not, deprecate. Zero true usage is the only deterministic deprecation candidate.',\n          r.path,\n          'No Skill-tool call, no slash invocation, no sibling dispatches to it, and no on-disk artifacts.',\n        ),\n      )\n    } else if (directTotal === 0 && r.inboundRefs + r.artifactCount > 0) {\n      // 2. Measurement-invisible: real use via orchestration/artifacts, never invoked directly.\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' shows 0 direct invocations but is used via orchestration/artifacts (inbound=${r.inboundRefs}, artifacts=${r.artifactCount})`,\n          'info',\n          0.8,\n          producedAt,\n          'Do NOT treat as unused — usage is real but logged under parent skills or on disk. Strengthen direct-invocation discovery only if direct use is desired.',\n          r.path,\n          'The Skill-tool counter undercounts orchestrated/chained leaf skills.',\n        ),\n      )\n    }\n\n    // 3. Discovery gap: low direct use AND weak trigger surface.\n    if (directTotal <= 2 && !r.hasTriggerPhrases) {\n      out.push(\n        finding(\n          'discoverability',\n          r.name,\n          `Skill '${r.name}' is rarely invoked directly and its description has no explicit trigger phrases`,\n          'medium',\n          0.7,\n          producedAt,\n          'Add a `Triggers:` clause with verbatim user phrases to the frontmatter description so the model auto-invokes it.',\n          r.path,\n        ),\n      )\n    }\n\n    // 4. Public-repo leak.\n    if (r.kind === 'public' && r.tanglePrivateRefs > 0) {\n      out.push(\n        finding(\n          'safety',\n          r.name,\n          `Public skill '${r.name}' carries ${r.tanglePrivateRefs} Tangle-private reference(s)`,\n          'high',\n          0.75,\n          producedAt,\n          'Sanitize incidental internal refs (cli-bridge/kimi/tcloud/~company/private repos) or relocate to a private repo. Verify @tangle-network/* refs are to PUBLISHED packages before treating as a leak.',\n          r.path,\n        ),\n      )\n    }\n\n    // 5. Bloat / no progressive disclosure.\n    if (r.lines > BLOAT_LINE_THRESHOLD && !r.hasReferencesDir) {\n      out.push(\n        finding(\n          'maintainability',\n          r.name,\n          `Skill '${r.name}' is ${r.lines} lines with no references/ split (progressive disclosure)`,\n          'medium',\n          0.8,\n          producedAt,\n          `Split detail into references/ loaded on demand; keep SKILL.md a short overview. ${r.lines} lines load into every session's context budget.`,\n          r.path,\n        ),\n      )\n    }\n\n    // 6. No evals (Anthropic's \">=3 evals before docs\" rule).\n    if (!r.hasEvalsDir) {\n      out.push(\n        finding(\n          'data-quality',\n          r.name,\n          `Skill '${r.name}' ships no evals/`,\n          'low',\n          0.6,\n          producedAt,\n          'Add evals/evals.json with >=3 scenarios proving the skill beats baseline; gives regression coverage.',\n          r.path,\n        ),\n      )\n    }\n\n    // 7. No run logging → invisible to /reflect and /governor.\n    if (!r.logsRuns) {\n      out.push(\n        finding(\n          'observability',\n          r.name,\n          `Skill '${r.name}' never appends to .evolve/skill-runs.jsonl`,\n          'low',\n          0.55,\n          producedAt,\n          'Append one run line to .evolve/skill-runs.jsonl on completion, or declare it a non-logging leaf, so the self-improvement loop can see it ran.',\n          r.path,\n        ),\n      )\n    }\n  }\n  return out\n}\n\n// ── The Analyst ──────────────────────────────────────────────────────\n\nclass SkillUsageAnalyst implements ExactCapableAnalyst<SkillUsageReport> {\n  readonly id = ANALYST_ID\n  readonly description =\n    'Deterministic multi-signal skill-usage analysis: flags dead skills, measurement-invisible (orchestrated) usage, discovery gaps, public-repo leaks, bloat, missing evals, and missing run-logging.'\n  readonly inputKind = 'custom' as const\n  readonly cost = { kind: 'deterministic' as const, est_usd_per_run: 0 }\n  readonly version = '1.0.0'\n  readonly executionConfig = {\n    kind: 'skill-usage',\n    bloat_line_threshold: BLOAT_LINE_THRESHOLD,\n    produced_at_source: 'tags.producedAt-or-system-clock',\n  } as const\n\n  async analyze(input: SkillUsageReport, ctx: AnalystContext): Promise<AnalystFinding[]> {\n    const producedAt = ctx.tags?.producedAt ?? new Date().toISOString()\n    ctx.log?.(\n      `skill-usage: ${input.records.length} skills over ${input.generatedFromTraces} transcripts`,\n    )\n    return emitSkillUsageFindings(input, producedAt)\n  }\n}\n\nexport const SKILL_USAGE_ANALYST = new SkillUsageAnalyst()\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,MAAM,cAAc;AAIpB,SAAS,aAAa,GAAmC;CACvD,QAAQ,GAAR;EACE,KAAK,YACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,QACH,OAAO;CACX;AACF;AAaA,SAAgB,kCACd,MACoC;CACpC,MAAM,KAAK,KAAK,MAAM;CACtB,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,sBAAsB,+BAA+B,KAAK,mBAAmB;CACnF,OAAO;EACL;EACA,aACE;EACF,WAAW;EACX,MAAM;GACJ,MAAM;GACN,QAAQ,KAAK,QAAQ,QAAQ,CAAC,KAAK,QAAQ,KAAK,IAAI,KAAA;GACpD,uBAAuB;EACzB;EACA,SAAS,GAAG,+BAA+B,WAAW;EACtD,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,aAAa,IAAI,WAAW,IAAI,SAAS;GAC/C,IAAI;GACJ,IAAI;IACF,SAAS,MAAM,wBAAwB,OAAO;KAC5C,GAAG,KAAK;KACR;KACA,QAAQ,IAAI;IACd,CAAC;GACH,UAAU;IACR,MAAM,QAAQ,MAAM,iCAAiC,YAAY;KAC/D,SAAS;KACT,WAAW;IACb,CAAC;IACD,IAAI,CAAC,MAAM,SACT,IAAI,MAAM,wDAAwD;KAChE,eAAe,MAAM;KACrB,YAAY;IACd,CAAC;IAEH,IAAI,cAAc,MAAM,OAAO;GACjC;GACA,IAAI,CAAC,OAAO,WACV,OAAO,CACL,YAAY;IACV,YAAY;IACZ;IACA,OAAO;IACP,WAAW,OAAO;IAClB,UAAU;IACV,YAAY;IACZ,eAAe,CAAC;IAChB,UAAU,EAAE,QAAQ,OAAO,MAAM;GACnC,CAAC,CACH;GAEF,MAAM,MAAwB,CAAC;GAC/B,KAAK,MAAM,KAAK,OAAO,UAAU;IAG/B,IAAI,EAAE,WAAW,EAAE,SAAS,GAAG;IAC/B,IAAI,KACF,YAAY;KACV,YAAY;KACZ;KACA,SAAS,EAAE;KACX,OAAO,EAAE,UACL,YAAY,EAAE,QAAQ,aAAa,EAAE,MAAM,QAC3C,YAAY,EAAE,QAAQ;KAC1B,WAAW,EAAE;KACb,UAAU,aAAa,EAAE,QAAQ;KACjC,YAAY;KACZ,eAAe,CAAC;MAAE,MAAM;MAAY,KAAK;MAAmB,SAAS,EAAE;KAAS,CAAC;KACjF,UAAU;MACR,SAAS,EAAE;MACX,SAAS,EAAE;MACX,UAAU,EAAE;KACd;IACF,CAAC,CACH;GACF;GACA,OAAO;EACT;CACF;AACF;;;;;;;AC3FA,SAAgB,YACd,YACA,YAC0C;CAC1C,MAAM,OAAO,WAAW,WAAW;CACnC,IAAI,SAAS,YAAY,WAAW,SAAS,gBAC3C,OAAO,2BAA2B,YAAY;EAC5C,SAAS,WAAW;EACpB,OAAO,WAAW;EAClB,GAAI,WAAW,YAAY,EAAE,WAAW,WAAW,UAAU,IAAI,CAAC;EAClE,GAAI,WAAW,UAAU,EAAE,SAAS,WAAW,QAAQ,IAAI,CAAC;CAC9D,CAAC;CAEH,IAAI,SAAS,aAAa,WAAW,SAAS,eAC5C,OAAO,4BAA4B,YAAY,WAAW,MAAM;CAElE,IAAI,SAAS,mBAAmB,WAAW,SAAS,eAClD,OAAO,iCAGL,YACA,WAAW,MACb;CAEF,MAAM,IAAI,2BACR,2BAA2B,KAAK,uBAAuB,WAAW,KAAK,2BACtD,WAAW,GAAG,wCACjC;AACF;;;;;;;;;;AC7DA,SAAgB,mBAAmB,YAA4D;CAC7F,KAAK,MAAM,CAAC,MAAM,UAAU;EAC1B,CAAC,MAAM,WAAW,EAAE;EACpB,CAAC,eAAe,WAAW,WAAW;EACtC,CAAC,QAAQ,WAAW,IAAI;EACxB,CAAC,WAAW,WAAW,OAAO;EAC9B,CAAC,gBAAgB,WAAW,YAAY;CAC1C,GACE,IAAI,OAAO,UAAU,YAAY,CAAC,MAAM,KAAK,GAC3C,MAAM,IAAI,UAAU,uBAAuB,KAAK,4BAA4B;CAGhF,OAAO;EACL,GAAG;EACH,QAAQ,WAAW,SAAS,EAAE,GAAG,WAAW,OAAO,IAAI,KAAA;CACzD;AACF;AAsBA,SAAgB,oBACd,SACuE;CACvE,IAAI,CAAC,QAAQ,GAAG,KAAK,GAAG,MAAM,IAAI,UAAU,2CAA2C;CACvF,IAAI,CAAC,QAAQ,YAAY,KAAK,GAC5B,MAAM,IAAI,UAAU,oDAAoD;CAE1E,IAAI,QAAQ,SAAS,KAAA,GACnB,MAAM,IAAI,UAAU,4CAA4C;CAElE,IACE,qBAAqB,YACpB,CAAC,QAAQ,mBACR,OAAO,QAAQ,oBAAoB,YACnC,MAAM,QAAQ,QAAQ,eAAe,IAEvC,MAAM,IAAI,UAAU,wDAAwD;CAE9E,OAAO;EACL,IAAI,QAAQ;EACZ,aAAa,QAAQ;EACrB,SAAS,QAAQ,WAAW;EAC5B,WAAW;EACX,MAAM,QAAQ;EACd,SAAS,QAAQ;EACjB,GAAI,qBAAqB,UAAU,EAAE,iBAAiB,QAAQ,gBAAgB,IAAI,CAAC;CACrF;AACF;;;;;;;;;;;;;;;;;;;;;;;;;ACGA,MAAM,uBAAuB;AAE7B,MAAM,oBACJ;AACF,MAAM,aAAa;AAInB,SAAS,cAAc,MAAgD;CACrE,IAAI,CAAC,WAAW,IAAI,GAAG,OAAO,CAAC;CAC/B,MAAM,MAAwC,CAAC;CAC/C,KAAK,MAAM,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;EAC9D,IAAI,CAAC,MAAM,YAAY,KAAK,CAAC,MAAM,eAAe,GAAG;EACrD,MAAM,UAAU,KAAK,MAAM,MAAM,MAAM,UAAU;EACjD,IAAI,WAAW,OAAO,GAAG,IAAI,KAAK;GAAE,MAAM,MAAM;GAAM,MAAM;EAAQ,CAAC;CACvE;CACA,OAAO;AACT;AAEA,SAAS,UAAU,KAAa,KAAuB;CACrD,IAAI,CAAC,WAAW,GAAG,GAAG,OAAO,CAAC;CAC9B,MAAM,QAAkB,CAAC;CACzB,MAAM,QAAQ,CAAC,GAAG;CAClB,OAAO,MAAM,QAAQ;EACnB,MAAM,MAAM,MAAM,IAAI;EACtB,IAAI;EACJ,IAAI;GACF,UAAU,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;EACpD,QAAQ;GACN;EACF;EACA,KAAK,MAAM,KAAK,SAAS;GACvB,MAAM,OAAO,KAAK,KAAK,EAAE,IAAI;GAC7B,IAAI,EAAE,YAAY,GAAG,MAAM,KAAK,IAAI;QAC/B,IAAI,EAAE,KAAK,SAAS,QAAQ,GAAG;IAClC,MAAM,KAAK,IAAI;IACf,IAAI,MAAM,KAAK,MAAM,UAAU,KAAK,OAAO;GAC7C;EACF;CACF;CACA,OAAO;AACT;AAEA,SAAS,uBAAuB,MAAsB;CAEpD,MAAM,QADK,wBAAwB,KAAK,IACzB,CAAC,GAAG,MAAM;CAEzB,OADU,uBAAuB,KAAK,KAC/B,CAAC,GAAG,MAAM;AACnB;AAEA,SAAS,eAAe,OAAiB,MAAc,SAA2B;CAChF,IAAI,IAAI;CACR,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,aAAa,CAAC,KAAK,MAAM,WAAW,IAAI,GAAG,GAAG,QAAQ,KAAK,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC;EACrF,KAAK,MAAM,OAAO,YAAY;GAC5B,IAAI,CAAC,WAAW,GAAG,GAAG;GACtB,IAAI;IACF,IAAI,SAAS,GAAG,CAAC,CAAC,YAAY,GAAG,KAAK,YAAY,GAAG,CAAC,CAAC;SAClD,KAAK;GACZ,QAAQ,CAER;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,sBAAsB,QAAgD;CACpF,MAAM,SAAS,OAAO,WAAW,SAAS,EAAE,MAAM,WAChD,cAAc,IAAI,CAAC,CAAC,KAAK,OAAO;EAAE,GAAG;EAAG;CAAK,EAAE,CACjD;CACA,MAAM,QAAQ,OAAO,KAAK,MAAM,EAAE,IAAI;CAGtC,MAAM,SAAS,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAC/D,MAAM,QAAQ,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAC9D,MAAM,UAAU;CAChB,MAAM,QAAQ;CACd,IAAI,cAAc;CAClB,KAAK,MAAM,OAAO,OAAO,gBACvB,KAAK,MAAM,QAAQ,UAAU,KAAK,OAAO,wBAAwB,CAAC,GAAG;EACnE,eAAe;EACf,IAAI;EACJ,IAAI;GACF,OAAO,aAAa,MAAM,MAAM;EAClC,QAAQ;GACN;EACF;EACA,KAAK,MAAM,KAAK,KAAK,SAAS,OAAO,GAAG;GACtC,MAAM,IAAI,EAAE;GACZ,IAAI,CAAC,GAAG;GACR,MAAM,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GAChC,MAAM,OAAO,OAAO,IAAI,CAAC;GACzB,IAAI,SAAS,KAAA,GAAW,OAAO,IAAI,GAAG,OAAO,CAAC;EAChD;EACA,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,GAAG;GACpC,MAAM,IAAI,EAAE;GACZ,IAAI,MAAM,KAAA,GAAW;GACrB,MAAM,OAAO,MAAM,IAAI,CAAC;GACxB,IAAI,SAAS,KAAA,GAAW,MAAM,IAAI,GAAG,OAAO,CAAC;EAC/C;CACF;CAIF,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,KAAK,QACd,IAAI;EACF,OAAO,IAAI,EAAE,MAAM,aAAa,EAAE,MAAM,MAAM,CAAC;CACjD,QAAQ;EACN,OAAO,IAAI,EAAE,MAAM,EAAE;CACvB;CAEF,MAAM,UAAU,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAChE,KAAK,MAAM,UAAU,OAAO;EAC1B,MAAM,MAAM,IAAI,OAAO,IAAI,OAAO,YAAY,OAAO,OAAO;EAC5D,KAAK,MAAM,KAAK,QAAQ;GACtB,IAAI,EAAE,SAAS,QAAQ;GACvB,IAAI,IAAI,KAAK,OAAO,IAAI,EAAE,IAAI,KAAK,EAAE,GAAG,QAAQ,IAAI,QAAQ,QAAQ,IAAI,MAAM,IAAK,CAAC;EACtF;CACF;CAEA,MAAM,UAA8B,OAAO,KAAK,MAAM;EACpD,MAAM,OAAO,OAAO,IAAI,EAAE,IAAI,KAAK;EACnC,MAAM,MAAM,EAAE,KAAK,QAAQ,gBAAgB,EAAE;EAC7C,OAAO;GACL,MAAM,EAAE;GACR,MAAM,EAAE;GACR,MAAM,EAAE;GACR,OAAO,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS;GACxC,mBAAmB,OAAO,IAAI,EAAE,IAAI,KAAK;GACzC,kBAAkB,MAAM,IAAI,EAAE,IAAI,KAAK;GACvC,aAAa,QAAQ,IAAI,EAAE,IAAI,KAAK;GACpC,eAAe,eACb,OAAO,iBAAiB,CAAC,GACzB,EAAE,MACF,OAAO,kBAAkB,EAAE,SAAS,CAAC,CACvC;GACA,oBAAoB,KAAK,MAAM,iBAAiB,KAAK,CAAC,EAAA,CAAG;GACzD,kBAAkB,WAAW,KAAK,KAAK,YAAY,CAAC;GACpD,aAAa,WAAW,KAAK,KAAK,OAAO,CAAC;GAC1C,UAAU,KAAK,SAAS,kBAAkB;GAC1C,mBAAmB,WAAW,KAAK,uBAAuB,IAAI,KAAK,KAAK,MAAM,GAAG,GAAG,CAAC;EACvF;CACF,CAAC;CACD,OAAO;EAAE,qBAAqB;EAAa;CAAQ;AACrD;AAIA,MAAM,aAAa;AAEnB,SAAS,QACP,MACA,SACA,OACA,UACA,YACA,YACA,aACA,aACA,WACgB;CAChB,OAAO;EACL,gBAAgB;EAChB,YAAY,iBAAiB;GAAE,YAAY;GAAY;GAAM;GAAS;EAAM,CAAC;EAC7E,YAAY;EACZ,aAAa;EACb;EACA;EACA;EACA;EACA,eAAe,CAAC;GAAE,MAAM;GAAY,KAAK;EAAY,CAAC;EACtD,oBAAoB;EACpB;EACA;CACF;AACF;;AAGA,SAAgB,uBACd,QACA,YACkB;CAClB,MAAM,MAAwB,CAAC;CAC/B,KAAK,MAAM,KAAK,OAAO,SAAS;EAC9B,MAAM,cAAc,EAAE,oBAAoB,EAAE;EAI5C,IAHkB,cAAc,EAAE,cAAc,EAAE,kBAGhC,GAChB,IAAI,KACF,QACE,eACA,EAAE,MACF,UAAU,EAAE,KAAK,+EACjB,QACA,IACA,YACA,sIACA,EAAE,MACF,iGACF,CACF;OACK,IAAI,gBAAgB,KAAK,EAAE,cAAc,EAAE,gBAAgB,GAEhE,IAAI,KACF,QACE,eACA,EAAE,MACF,UAAU,EAAE,KAAK,gFAAgF,EAAE,YAAY,cAAc,EAAE,cAAc,IAC7I,QACA,IACA,YACA,2JACA,EAAE,MACF,sEACF,CACF;EAIF,IAAI,eAAe,KAAK,CAAC,EAAE,mBACzB,IAAI,KACF,QACE,mBACA,EAAE,MACF,UAAU,EAAE,KAAK,mFACjB,UACA,IACA,YACA,oHACA,EAAE,IACJ,CACF;EAIF,IAAI,EAAE,SAAS,YAAY,EAAE,oBAAoB,GAC/C,IAAI,KACF,QACE,UACA,EAAE,MACF,iBAAiB,EAAE,KAAK,YAAY,EAAE,kBAAkB,+BACxD,QACA,KACA,YACA,uMACA,EAAE,IACJ,CACF;EAIF,IAAI,EAAE,QAAQ,wBAAwB,CAAC,EAAE,kBACvC,IAAI,KACF,QACE,mBACA,EAAE,MACF,UAAU,EAAE,KAAK,OAAO,EAAE,MAAM,4DAChC,UACA,IACA,YACA,mFAAmF,EAAE,MAAM,mDAC3F,EAAE,IACJ,CACF;EAIF,IAAI,CAAC,EAAE,aACL,IAAI,KACF,QACE,gBACA,EAAE,MACF,UAAU,EAAE,KAAK,oBACjB,OACA,IACA,YACA,wGACA,EAAE,IACJ,CACF;EAIF,IAAI,CAAC,EAAE,UACL,IAAI,KACF,QACE,iBACA,EAAE,MACF,UAAU,EAAE,KAAK,8CACjB,OACA,KACA,YACA,iJACA,EAAE,IACJ,CACF;CAEJ;CACA,OAAO;AACT;AAIA,IAAM,oBAAN,MAAyE;CACvE,KAAc;CACd,cACE;CACF,YAAqB;CACrB,OAAgB;EAAE,MAAM;EAA0B,iBAAiB;CAAE;CACrE,UAAmB;CACnB,kBAA2B;EACzB,MAAM;EACN,sBAAsB;EACtB,oBAAoB;CACtB;CAEA,MAAM,QAAQ,OAAyB,KAAgD;EACrF,MAAM,aAAa,IAAI,MAAM,+BAAc,IAAI,KAAK,EAAA,CAAE,YAAY;EAClE,IAAI,MACF,gBAAgB,MAAM,QAAQ,OAAO,eAAe,MAAM,oBAAoB,aAChF;EACA,OAAO,uBAAuB,OAAO,UAAU;CACjD;AACF;AAEA,MAAa,sBAAsB,IAAI,kBAAkB"}
+{"version":3,"file":"index.js","names":[],"sources":["../../src/analyst/adapters.ts","../../src/analyst/bind.ts","../../src/analyst/define.ts","../../src/analyst/kinds/skill-usage.ts","../../src/analyst/trace-questions.ts"],"sourcesContent":["/**\n * Adapter factory — lifts the semantic-concept judge into the Analyst\n * contract without re-implementing it.\n *\n * It builds an Analyst with a stable id (caller chooses; a default is given),\n * a version derived from the judge's version plus an adapter revision, and an\n * `analyze()` that calls the judge and lifts its output to `AnalystFinding[]`\n * through `makeFinding()`. The judge's `Severity` ('critical' | 'major' |\n * 'minor' | 'info') projects onto `AnalystSeverity`: 'major' becomes 'high'\n * and 'minor' becomes 'medium'.\n *\n * The adapter owns no state. Calling the factory twice is safe.\n */\n\nimport { CostLedger } from '../cost-ledger'\nimport type { Severity as LayerSeverity } from '../multi-layer-verifier'\nimport {\n  runSemanticConceptJudge,\n  SEMANTIC_CONCEPT_JUDGE_VERSION,\n  type SemanticConceptJudgeInput,\n  type SemanticConceptJudgeOptions,\n  type SemanticConceptJudgeResult,\n} from '../semantic-concept-judge'\nimport type { Analyst, AnalystFinding, AnalystSeverity } from './types'\nimport { makeFinding } from './types'\nimport { settleUsageReceiptFromCostLedger, validateUsageSettlementTimeout } from './usage-receipt'\n\nconst ADAPTER_REV = '1'\n\n// ── Severity bridges ───────────────────────────────────────────────\n\nfunction liftSeverity(s: LayerSeverity): AnalystSeverity {\n  switch (s) {\n    case 'critical':\n      return 'critical'\n    case 'major':\n      return 'high'\n    case 'minor':\n      return 'medium'\n    case 'info':\n      return 'info'\n  }\n}\n\n// ── SemanticConceptJudge → Analyst ─────────────────────────────────\n\nexport interface SemanticConceptJudgeAdapterOpts {\n  id?: string\n  area?: string\n  /** Registry context owns cancellation and the per-analyst cost ledger. */\n  options: Omit<SemanticConceptJudgeOptions, 'costLedger' | 'signal'>\n  /** Maximum post-cancellation wait for a provider receipt. Default 5 seconds. */\n  settlementTimeoutMs?: number\n}\n\nexport function createSemanticConceptJudgeAdapter(\n  opts: SemanticConceptJudgeAdapterOpts,\n): Analyst<SemanticConceptJudgeInput> {\n  const id = opts.id ?? 'semantic-concept-judge'\n  const area = opts.area ?? 'concept-coverage'\n  const settlementTimeoutMs = validateUsageSettlementTimeout(opts.settlementTimeoutMs)\n  return {\n    id,\n    description:\n      'Runs the semantic-concept judge and surfaces missing / weak concepts as findings.',\n    inputKind: 'custom',\n    cost: {\n      kind: 'llm',\n      models: opts.options.model ? [opts.options.model] : undefined,\n      settlement_timeout_ms: settlementTimeoutMs,\n    },\n    version: `${SEMANTIC_CONCEPT_JUDGE_VERSION}-adapter-${ADAPTER_REV}`,\n    async analyze(input, ctx) {\n      const costLedger = new CostLedger(ctx.budgetUsd)\n      let result: SemanticConceptJudgeResult\n      try {\n        result = await runSemanticConceptJudge(input, {\n          ...opts.options,\n          costLedger,\n          signal: ctx.signal,\n        })\n      } finally {\n        const usage = await settleUsageReceiptFromCostLedger(costLedger, {\n          channel: 'judge',\n          timeoutMs: settlementTimeoutMs,\n        })\n        if (!usage.settled) {\n          ctx.log?.('semantic-concept judge provider settlement timed out', {\n            pending_calls: usage.pendingCalls,\n            timeout_ms: settlementTimeoutMs,\n          })\n        }\n        ctx.recordUsage?.(usage.receipt)\n      }\n      if (!result.available) {\n        return [\n          makeFinding({\n            analyst_id: id,\n            area,\n            claim: 'semantic-concept judge unavailable',\n            rationale: result.error,\n            severity: 'info',\n            confidence: 1,\n            evidence_refs: [],\n            metadata: { reason: result.error },\n          }),\n        ]\n      }\n      const out: AnalystFinding[] = []\n      for (const f of result.findings) {\n        // Only surface gaps: missing concepts or low scores. Concepts at\n        // 7+/10 with present=true are not findings — they're successes.\n        if (f.present && f.score >= 7) continue\n        out.push(\n          makeFinding({\n            analyst_id: id,\n            area,\n            subject: f.concept,\n            claim: f.present\n              ? `concept \"${f.concept}\" is weak (${f.score}/10)`\n              : `concept \"${f.concept}\" is missing`,\n            rationale: f.evidence,\n            severity: liftSeverity(f.severity),\n            confidence: 0.85,\n            evidence_refs: [{ kind: 'artifact', uri: 'inline:evidence', excerpt: f.evidence }],\n            metadata: {\n              concept: f.concept,\n              present: f.present,\n              score_10: f.score,\n            },\n          }),\n        )\n      }\n      return out\n    },\n  }\n}\n","/**\n * bindAnalyst — compile an `AnalystDefinition` into a runnable arm.\n *\n * The definition declares protocol (question, task text, reply grammar,\n * evidence projection, budget, repair turns); the transport binding supplies\n * execution (a bridge endpoint, or the caller-owned model path). Each\n * projection mode dispatches to the same strategy its arm's entry point runs,\n * so a compiled definition and the historical creator send byte-identical\n * requests — the definition parity suite asserts this per arm.\n *\n * A projection × transport pair with no strategy fails loud with\n * `AnalystExpressivenessError` naming the pair: an arm shape this layer cannot\n * express must be reported, never approximated.\n */\n\nimport type { CustomTokenPricing } from '../cost-ledger'\nimport type { AnalystBenchmarkRunner } from './benchmark'\nimport { runChunkedAnalystDefinition } from './benchmark-public-model'\nimport { runReplVariableAnalystDefinition } from './benchmark-public-rlm'\nimport type { PublicAnalystBenchmarkModelConfig } from './benchmark-public-types'\nimport { runInlineAnalystDefinition } from './benchmark-runner-prime'\nimport { type AnalystDefinition, AnalystExpressivenessError } from './definition'\nimport type { PrimeBridgeTransport } from './prime-bridge-transport'\nimport type { AnalystRunInputs } from './types'\n\n/** Execution half of a binding: who actually reaches the model. */\nexport type AnalystTransportBinding =\n  | {\n      /** An OpenAI-compatible cli-bridge endpoint (inline projections). */\n      readonly kind: 'prime-bridge'\n      readonly baseUrl: string\n      readonly model: string\n      readonly transport?: PrimeBridgeTransport\n      readonly pricing?: CustomTokenPricing\n    }\n  | {\n      /** The caller-owned model path (chunked and repl-variable projections). */\n      readonly kind: 'model-owner'\n      readonly config: PublicAnalystBenchmarkModelConfig\n    }\n\n/**\n * Compile a definition plus a transport binding into a runnable arm. Dispatch\n * is total over the expressible pairs; everything else is a loud refusal.\n */\nexport function bindAnalyst<TRow, TAssignment, TBlock>(\n  definition: AnalystDefinition<TRow, TAssignment, TBlock>,\n  transports: AnalystTransportBinding,\n): AnalystBenchmarkRunner<AnalystRunInputs> {\n  const mode = definition.projection.mode\n  if (mode === 'inline' && transports.kind === 'prime-bridge') {\n    return runInlineAnalystDefinition(definition, {\n      baseUrl: transports.baseUrl,\n      model: transports.model,\n      ...(transports.transport ? { transport: transports.transport } : {}),\n      ...(transports.pricing ? { pricing: transports.pricing } : {}),\n    })\n  }\n  if (mode === 'chunked' && transports.kind === 'model-owner') {\n    return runChunkedAnalystDefinition(definition, transports.config)\n  }\n  if (mode === 'repl-variable' && transports.kind === 'model-owner') {\n    return runReplVariableAnalystDefinition(\n      // The repl-variable strategy is written against the engine's raw-finding\n      // row type; the definition's own row declaration carries it.\n      definition as Parameters<typeof runReplVariableAnalystDefinition>[0],\n      transports.config,\n    )\n  }\n  throw new AnalystExpressivenessError(\n    `no strategy compiles a '${mode}' projection over a '${transports.kind}' transport; ` +\n      `definition '${definition.id}' cannot be expressed by this layer yet`,\n  )\n}\n","import type { TraceAnalysisStore } from '../trace-analyst/store'\nimport type { ExactCapableAnalyst } from './exact-types'\nimport type { TraceAnalystDefinition } from './kind-factory'\nimport type { Analyst, AnalystCost } from './types'\n\n/**\n * Define a reusable trace-research question.\n *\n * The returned value contains no model, credentials, or execution state. Bind\n * it to any TraceAnalysisEngine with `runTraceAnalyst` or\n * `createTraceAnalyst`.\n */\nexport function defineTraceAnalyst(definition: TraceAnalystDefinition): TraceAnalystDefinition {\n  for (const [name, value] of [\n    ['id', definition.id],\n    ['description', definition.description],\n    ['area', definition.area],\n    ['version', definition.version],\n    ['instructions', definition.instructions],\n  ] as const) {\n    if (typeof value !== 'string' || !value.trim()) {\n      throw new TypeError(`defineTraceAnalyst: ${name} must be a non-empty string`)\n    }\n  }\n  return {\n    ...definition,\n    limits: definition.limits ? { ...definition.limits } : undefined,\n  }\n}\n\nexport interface DefineCustomAnalystOptions {\n  id: string\n  description: string\n  version?: string\n  cost: AnalystCost\n  analyze: Analyst<TraceAnalysisStore>['analyze']\n}\n\nexport interface DefineExactCustomAnalystOptions extends DefineCustomAnalystOptions {\n  /** Canonical JSON for behavior knobs not already bound by `version`. */\n  executionConfig: Readonly<Record<string, unknown>>\n}\n\n/** Construct a registrable analyst from a hand-written analyze function. */\nexport function defineCustomAnalyst(\n  options: DefineExactCustomAnalystOptions,\n): ExactCapableAnalyst<TraceAnalysisStore>\nexport function defineCustomAnalyst(\n  options: DefineCustomAnalystOptions,\n): Analyst<TraceAnalysisStore>\nexport function defineCustomAnalyst(\n  options: DefineCustomAnalystOptions | DefineExactCustomAnalystOptions,\n): Analyst<TraceAnalysisStore> | ExactCapableAnalyst<TraceAnalysisStore> {\n  if (!options.id.trim()) throw new TypeError('defineCustomAnalyst: id must not be empty')\n  if (!options.description.trim()) {\n    throw new TypeError('defineCustomAnalyst: description must not be empty')\n  }\n  if (options.cost === undefined) {\n    throw new TypeError('defineCustomAnalyst: cost must be declared')\n  }\n  if (\n    'executionConfig' in options &&\n    (!options.executionConfig ||\n      typeof options.executionConfig !== 'object' ||\n      Array.isArray(options.executionConfig))\n  ) {\n    throw new TypeError('defineCustomAnalyst: executionConfig must be an object')\n  }\n  return {\n    id: options.id,\n    description: options.description,\n    version: options.version ?? '1.0.0',\n    inputKind: 'trace-store',\n    cost: options.cost,\n    analyze: options.analyze,\n    ...('executionConfig' in options ? { executionConfig: options.executionConfig } : {}),\n  }\n}\n","/**\n * Skill-usage analyst — a DETERMINISTIC `Analyst` over a Claude/Codex skill\n * library + its trace corpus. Unlike the trace-store kinds (failure-mode,\n * improvement, ...) this kind calls no LLM: it mines real usage and skill\n * structure and emits findings by rule.\n *\n * It exists because the naive \"Skill-tool invocation count\" lies low — it\n * misses orchestrated sub-dispatch (a leaf skill run BY /pursue or /governor\n * logs under the parent), slash-command entry, local-script bypass, and\n * on-disk artifacts. The 2026-05-30 skill audit found 39/53 skills at zero\n * direct invocations, yet only one was a genuine cut: the rest were\n * measurement-invisible or discovery-limited. This analyst encodes that\n * lesson as a multi-signal usage model so a cheap repeatable pass can keep\n * the library honest, and so the expensive audit workflow's verdicts can\n * GEPA-distill it toward agreement (see `gold/skill-verdicts.gold.jsonl`).\n *\n * Report-building (`buildSkillUsageReport`, an fs scan) is separated from\n * finding emission (`SkillUsageAnalyst.analyze`, pure) so the slow scan runs\n * once at the registry boundary and the rule logic stays unit-testable.\n */\n\nimport { type Dirent, existsSync, readdirSync, readFileSync, statSync } from 'node:fs'\nimport { join } from 'node:path'\nimport type { ExactCapableAnalyst } from '../exact-types'\nimport type { AnalystContext, AnalystFinding, AnalystSeverity } from '../types'\nimport { computeFindingId } from '../types'\n\n// ── Input model ──────────────────────────────────────────────────────\n\nexport type SkillKind = 'public' | 'private'\n\n/** One skill's multi-signal usage + structure. All counts are deterministic. */\nexport interface SkillUsageRecord {\n  name: string\n  kind: SkillKind\n  /** Absolute path to the skill's SKILL.md. */\n  path: string\n  lines: number\n  /** `\"skill\":\"<name>\"` Skill-tool invocations across the trace corpus. */\n  directInvocations: number\n  /** `<command-name>/<name>` slash invocations across the trace corpus. */\n  slashInvocations: number\n  /** Sibling skills whose SKILL.md dispatches to this one (`/<name>`). Proxy\n   *  for orchestrated sub-dispatch the per-skill counter cannot see. */\n  inboundRefs: number\n  /** On-disk artifacts attributable to the skill (e.g. `.evolve/<name>/**`). */\n  artifactCount: number\n  /** Tangle-private reference count in the body (leak signal for public skills). */\n  tanglePrivateRefs: number\n  hasReferencesDir: boolean\n  hasEvalsDir: boolean\n  /** Body mentions `skill-runs.jsonl` (visible to /reflect + /governor). */\n  logsRuns: boolean\n  /** Description carries an explicit `Triggers:` clause / trigger phrases. */\n  hasTriggerPhrases: boolean\n}\n\nexport interface SkillUsageReport {\n  generatedFromTraces: number\n  records: SkillUsageRecord[]\n}\n\nexport interface SkillUsageScanConfig {\n  /** Dirs holding `*.jsonl` transcripts (Claude `~/.claude/projects`, Codex sessions). */\n  transcriptDirs: string[]\n  /** Skill roots to scan; each dir directly under `root` with a `SKILL.md` is a skill. */\n  skillRoots: { root: string; kind: SkillKind }[]\n  /** Roots scanned for `<root>/.evolve/<skill>` artifact dirs. */\n  artifactRoots?: string[]\n  /** Token-prefixed mappings: skill name → extra artifact subpaths under an artifactRoot\n   *  (e.g. reflect → `.evolve/reflections`). Catches non-eponymous artifact dirs. */\n  artifactAliases?: Record<string, string[]>\n  /** Cap files read per transcript dir (bounds a huge corpus); 0 = unbounded. */\n  maxTranscriptsPerDir?: number\n}\n\n// ── Deterministic thresholds ─────────────────────────────────────────\n\n/** Anthropic's authoring guidance keeps SKILL.md short; past this with no\n *  `references/` split the body burns context budget every session. */\nconst BLOAT_LINE_THRESHOLD = 300\n\nconst TANGLE_PRIVATE_RE =\n  /\\b(cli-bridge|tangletools|ops-board|drew-gtr-pro|@tangle-network\\/|~\\/company|tangle\\.tools|gtm-agent)\\b|\\bkimi\\b|\\btcloud\\b/gi\nconst TRIGGER_RE = /triggers?\\s*[:-]/i\n\n// ── Report builder (fs scan — slow, runs once at the registry boundary) ──\n\nfunction listSkillDirs(root: string): { name: string; path: string }[] {\n  if (!existsSync(root)) return []\n  const out: { name: string; path: string }[] = []\n  for (const entry of readdirSync(root, { withFileTypes: true })) {\n    if (!entry.isDirectory() && !entry.isSymbolicLink()) continue\n    const skillMd = join(root, entry.name, 'SKILL.md')\n    if (existsSync(skillMd)) out.push({ name: entry.name, path: skillMd })\n  }\n  return out\n}\n\nfunction walkJsonl(dir: string, cap: number): string[] {\n  if (!existsSync(dir)) return []\n  const files: string[] = []\n  const stack = [dir]\n  while (stack.length) {\n    const cur = stack.pop()!\n    let entries: Dirent[]\n    try {\n      entries = readdirSync(cur, { withFileTypes: true })\n    } catch {\n      continue\n    }\n    for (const e of entries) {\n      const full = join(cur, e.name)\n      if (e.isDirectory()) stack.push(full)\n      else if (e.name.endsWith('.jsonl')) {\n        files.push(full)\n        if (cap > 0 && files.length >= cap) return files\n      }\n    }\n  }\n  return files\n}\n\nfunction frontmatterDescription(body: string): string {\n  const fm = /^---\\n([\\s\\S]*?)\\n---/.exec(body)\n  const block = fm?.[1] ?? ''\n  const m = /description:\\s*(.+)/i.exec(block)\n  return m?.[1] ?? ''\n}\n\nfunction countArtifacts(roots: string[], name: string, aliases: string[]): number {\n  let n = 0\n  for (const root of roots) {\n    const candidates = [join(root, '.evolve', name), ...aliases.map((a) => join(root, a))]\n    for (const dir of candidates) {\n      if (!existsSync(dir)) continue\n      try {\n        if (statSync(dir).isDirectory()) n += readdirSync(dir).length\n        else n += 1\n      } catch {\n        /* unreadable — skip */\n      }\n    }\n  }\n  return n\n}\n\n/** Scan the corpus + skill roots into a {@link SkillUsageReport}. Deterministic. */\nexport function buildSkillUsageReport(config: SkillUsageScanConfig): SkillUsageReport {\n  const skills = config.skillRoots.flatMap(({ root, kind }) =>\n    listSkillDirs(root).map((s) => ({ ...s, kind })),\n  )\n  const names = skills.map((s) => s.name)\n\n  // One pass over the corpus accumulating direct + slash counts per skill.\n  const direct = new Map<string, number>(names.map((n) => [n, 0]))\n  const slash = new Map<string, number>(names.map((n) => [n, 0]))\n  const skillRe = /\"skill\"\\s*:\\s*\"([a-z0-9_:-]+)\"/g\n  const cmdRe = /<command-name>\\/?([a-z0-9_:-]+)<\\/command-name>/g\n  let transcripts = 0\n  for (const dir of config.transcriptDirs) {\n    for (const file of walkJsonl(dir, config.maxTranscriptsPerDir ?? 0)) {\n      transcripts += 1\n      let data: string\n      try {\n        data = readFileSync(file, 'utf8')\n      } catch {\n        continue\n      }\n      for (const m of data.matchAll(skillRe)) {\n        const g = m[1]\n        if (!g) continue\n        const n = g.split(':').pop() ?? g\n        const prev = direct.get(n)\n        if (prev !== undefined) direct.set(n, prev + 1)\n      }\n      for (const m of data.matchAll(cmdRe)) {\n        const g = m[1]\n        if (g === undefined) continue\n        const prev = slash.get(g)\n        if (prev !== undefined) slash.set(g, prev + 1)\n      }\n    }\n  }\n\n  // Read each skill body once; compute structure + inbound refs across siblings.\n  const bodies = new Map<string, string>()\n  for (const s of skills) {\n    try {\n      bodies.set(s.name, readFileSync(s.path, 'utf8'))\n    } catch {\n      bodies.set(s.name, '')\n    }\n  }\n  const inbound = new Map<string, number>(names.map((n) => [n, 0]))\n  for (const target of names) {\n    const ref = new RegExp(`/${target}\\\\b|\\\\[\\\\[${target}\\\\]\\\\]`)\n    for (const s of skills) {\n      if (s.name === target) continue\n      if (ref.test(bodies.get(s.name) ?? '')) inbound.set(target, inbound.get(target)! + 1)\n    }\n  }\n\n  const records: SkillUsageRecord[] = skills.map((s) => {\n    const body = bodies.get(s.name) ?? ''\n    const dir = s.path.replace(/\\/SKILL\\.md$/, '')\n    return {\n      name: s.name,\n      kind: s.kind,\n      path: s.path,\n      lines: body ? body.split('\\n').length : 0,\n      directInvocations: direct.get(s.name) ?? 0,\n      slashInvocations: slash.get(s.name) ?? 0,\n      inboundRefs: inbound.get(s.name) ?? 0,\n      artifactCount: countArtifacts(\n        config.artifactRoots ?? [],\n        s.name,\n        config.artifactAliases?.[s.name] ?? [],\n      ),\n      tanglePrivateRefs: (body.match(TANGLE_PRIVATE_RE) ?? []).length,\n      hasReferencesDir: existsSync(join(dir, 'references')),\n      hasEvalsDir: existsSync(join(dir, 'evals')),\n      logsRuns: body.includes('skill-runs.jsonl'),\n      hasTriggerPhrases: TRIGGER_RE.test(frontmatterDescription(body) || body.slice(0, 600)),\n    }\n  })\n  return { generatedFromTraces: transcripts, records }\n}\n\n// ── Finding emission (pure — unit-testable, no LLM, no fs) ────────────\n\nconst ANALYST_ID = 'skill-usage'\n\nfunction finding(\n  area: string,\n  subject: string,\n  claim: string,\n  severity: AnalystSeverity,\n  confidence: number,\n  producedAt: string,\n  recommended: string,\n  evidenceUri: string,\n  rationale?: string,\n): AnalystFinding {\n  return {\n    schema_version: '1.0.0',\n    finding_id: computeFindingId({ analyst_id: ANALYST_ID, area, subject, claim }),\n    analyst_id: ANALYST_ID,\n    produced_at: producedAt,\n    severity,\n    area,\n    claim,\n    rationale,\n    evidence_refs: [{ kind: 'artifact', uri: evidenceUri }],\n    recommended_action: recommended,\n    confidence,\n    subject,\n  }\n}\n\n/** Pure rule pass over a report → findings. Exported for direct/unit use. */\nexport function emitSkillUsageFindings(\n  report: SkillUsageReport,\n  producedAt: string,\n): AnalystFinding[] {\n  const out: AnalystFinding[] = []\n  for (const r of report.records) {\n    const directTotal = r.directInvocations + r.slashInvocations\n    const trueUsage = directTotal + r.inboundRefs + r.artifactCount\n\n    // 1. Dead: no usage signal of ANY kind. The only real deprecation candidate.\n    if (trueUsage === 0) {\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' has zero usage across all signals (direct, slash, inbound-refs, artifacts)`,\n          'high',\n          0.6,\n          producedAt,\n          'Confirm the skill covers a real recurring job; if not, deprecate. Zero true usage is the only deterministic deprecation candidate.',\n          r.path,\n          'No Skill-tool call, no slash invocation, no sibling dispatches to it, and no on-disk artifacts.',\n        ),\n      )\n    } else if (directTotal === 0 && r.inboundRefs + r.artifactCount > 0) {\n      // 2. Measurement-invisible: real use via orchestration/artifacts, never invoked directly.\n      out.push(\n        finding(\n          'skill-usage',\n          r.name,\n          `Skill '${r.name}' shows 0 direct invocations but is used via orchestration/artifacts (inbound=${r.inboundRefs}, artifacts=${r.artifactCount})`,\n          'info',\n          0.8,\n          producedAt,\n          'Do NOT treat as unused — usage is real but logged under parent skills or on disk. Strengthen direct-invocation discovery only if direct use is desired.',\n          r.path,\n          'The Skill-tool counter undercounts orchestrated/chained leaf skills.',\n        ),\n      )\n    }\n\n    // 3. Discovery gap: low direct use AND weak trigger surface.\n    if (directTotal <= 2 && !r.hasTriggerPhrases) {\n      out.push(\n        finding(\n          'discoverability',\n          r.name,\n          `Skill '${r.name}' is rarely invoked directly and its description has no explicit trigger phrases`,\n          'medium',\n          0.7,\n          producedAt,\n          'Add a `Triggers:` clause with verbatim user phrases to the frontmatter description so the model auto-invokes it.',\n          r.path,\n        ),\n      )\n    }\n\n    // 4. Public-repo leak.\n    if (r.kind === 'public' && r.tanglePrivateRefs > 0) {\n      out.push(\n        finding(\n          'safety',\n          r.name,\n          `Public skill '${r.name}' carries ${r.tanglePrivateRefs} Tangle-private reference(s)`,\n          'high',\n          0.75,\n          producedAt,\n          'Sanitize incidental internal refs (cli-bridge/kimi/tcloud/~company/private repos) or relocate to a private repo. Verify @tangle-network/* refs are to PUBLISHED packages before treating as a leak.',\n          r.path,\n        ),\n      )\n    }\n\n    // 5. Bloat / no progressive disclosure.\n    if (r.lines > BLOAT_LINE_THRESHOLD && !r.hasReferencesDir) {\n      out.push(\n        finding(\n          'maintainability',\n          r.name,\n          `Skill '${r.name}' is ${r.lines} lines with no references/ split (progressive disclosure)`,\n          'medium',\n          0.8,\n          producedAt,\n          `Split detail into references/ loaded on demand; keep SKILL.md a short overview. ${r.lines} lines load into every session's context budget.`,\n          r.path,\n        ),\n      )\n    }\n\n    // 6. No evals (Anthropic's \">=3 evals before docs\" rule).\n    if (!r.hasEvalsDir) {\n      out.push(\n        finding(\n          'data-quality',\n          r.name,\n          `Skill '${r.name}' ships no evals/`,\n          'low',\n          0.6,\n          producedAt,\n          'Add evals/evals.json with >=3 scenarios proving the skill beats baseline; gives regression coverage.',\n          r.path,\n        ),\n      )\n    }\n\n    // 7. No run logging → invisible to /reflect and /governor.\n    if (!r.logsRuns) {\n      out.push(\n        finding(\n          'observability',\n          r.name,\n          `Skill '${r.name}' never appends to .evolve/skill-runs.jsonl`,\n          'low',\n          0.55,\n          producedAt,\n          'Append one run line to .evolve/skill-runs.jsonl on completion, or declare it a non-logging leaf, so the self-improvement loop can see it ran.',\n          r.path,\n        ),\n      )\n    }\n  }\n  return out\n}\n\n// ── The Analyst ──────────────────────────────────────────────────────\n\nclass SkillUsageAnalyst implements ExactCapableAnalyst<SkillUsageReport> {\n  readonly id = ANALYST_ID\n  readonly description =\n    'Deterministic multi-signal skill-usage analysis: flags dead skills, measurement-invisible (orchestrated) usage, discovery gaps, public-repo leaks, bloat, missing evals, and missing run-logging.'\n  readonly inputKind = 'custom' as const\n  readonly cost = { kind: 'deterministic' as const, est_usd_per_run: 0 }\n  readonly version = '1.0.0'\n  readonly executionConfig = {\n    kind: 'skill-usage',\n    bloat_line_threshold: BLOAT_LINE_THRESHOLD,\n    produced_at_source: 'tags.producedAt-or-system-clock',\n  } as const\n\n  async analyze(input: SkillUsageReport, ctx: AnalystContext): Promise<AnalystFinding[]> {\n    const producedAt = ctx.tags?.producedAt ?? new Date().toISOString()\n    ctx.log?.(\n      `skill-usage: ${input.records.length} skills over ${input.generatedFromTraces} transcripts`,\n    )\n    return emitSkillUsageFindings(input, producedAt)\n  }\n}\n\nexport const SKILL_USAGE_ANALYST = new SkillUsageAnalyst()\n","/**\n * Many questions over one trace store, concurrently, under one cost ledger, with an independent\n * verifier for every finding.\n *\n * `traces ask` answered questions this way for people. A continuation panel (agent-runtime,\n * discovery `docs/38-one-loop-and-continuation.md`, section 5) asks dozens to hundreds of atomic\n * questions of a director's own trace every time the outside check fails, so the runner lives here,\n * beside `runTraceAnalyst`, where both callers reach one implementation.\n *\n * Each question is one `runTraceAnalyst` call, which already refuses a finding with fewer distinct\n * citations than required or with a citation the store cannot resolve. What this module adds:\n *\n *  - a worker pool: at most `concurrency` investigations at once, and one failed question never\n *    stops the others; its failure is its answer;\n *  - one shared `CostLedger`, so a single ceiling bounds every question and every verifier;\n *  - an independent verifier per admitted finding, shown only the spans the finding cites. Analysts\n *    misattribute often: the best method in Who&When found the failing step 14.2% of the time. A\n *    finding a verifier reading only its own evidence does not support never reaches a caller as\n *    verified.\n */\n\nimport type { CostLedgerHandle } from '../cost-ledger'\nimport type { TraceAnalysisStore } from '../trace-analyst/store'\nimport { defineTraceAnalyst } from './define'\nimport type { TraceAnalysisEngine, TraceAnalystLimits } from './engine'\nimport { parseTraceSpanEvidenceUri, type RawAnalystFinding } from './finding-signature'\nimport { runTraceAnalyst } from './kind-factory'\n\n/** One question to ask of the store. */\nexport interface TraceQuestionSpec {\n  /** Stable id: letters, digits, dot, underscore, hyphen. */\n  readonly id: string\n  readonly question: string\n  /** Guidance for this question only, after the shared rules. */\n  readonly instructions?: string\n}\n\nexport interface AskTraceQuestionsOptions {\n  readonly questions: readonly TraceQuestionSpec[]\n  readonly store: TraceAnalysisStore\n  readonly engine: TraceAnalysisEngine\n  /** Every question and verifier charges this ledger; its ceiling bounds the whole call. */\n  readonly costLedger: CostLedgerHandle\n  /** Stable id for cost attribution and logs. */\n  readonly runId: string\n  /** Material every question receives before its first model call, such as the check's verdict. */\n  readonly context?: string\n  /** Investigations running at once. Default 4. */\n  readonly concurrency?: number\n  /** Distinct citations a finding needs. Default 2. */\n  readonly minimumEvidenceCitations?: number\n  /** Run the independent verifier on every admitted finding. Default true. */\n  readonly verify?: boolean\n  readonly limits?: Partial<TraceAnalystLimits>\n  readonly signal?: AbortSignal\n  readonly log?: (message: string, fields?: Record<string, unknown>) => void\n}\n\n/** A finding and what the verifier, shown only its cited spans, concluded. */\nexport interface VerifiedTraceFinding {\n  readonly finding: RawAnalystFinding\n  /** The finding's trace citations, as `trace://` URIs. */\n  readonly citations: readonly string[]\n  /** `true` supported, `false` not supported, `null` when verification was off or failed. */\n  readonly verified: boolean | null\n  /** The verifier's own words, when it answered. */\n  readonly verifierAnswer?: string\n}\n\nexport interface TraceQuestionOutcome {\n  readonly id: string\n  readonly question: string\n  readonly status: 'answered' | 'failed'\n  readonly failure?: string\n  /** The engine's prose answer, verbatim; `null` when it returned none. */\n  readonly answer: string | null\n  readonly findings: readonly VerifiedTraceFinding[]\n  /** `null` when the engine failed before reporting. */\n  readonly modelCalls: number | null\n  readonly toolCalls: number | null\n}\n\nconst QUESTION_ID = /^[A-Za-z0-9][A-Za-z0-9._-]{0,63}$/u\nconst DEFINITION_VERSION = '1.0.0'\n\nconst QUESTION_RULES = [\n  'Answer QUESTION only from trace tool results retrieved in this run.',\n  'Cite each fact as trace://<trace_id>/span/<span_id>, and quote the span in the excerpt.',\n  'If the trace does not record a fact, say \"not in trace\". Never infer a trace fact from the question.',\n].join('\\n')\n\nconst VERIFIER_RULES = [\n  'You check one CLAIM against the spans it cites, and nothing else.',\n  'Read each cited span with viewSpans. No other trace is readable.',\n  'First line: SUPPORTED if the spans themselves establish the claim, otherwise NOT SUPPORTED.',\n  'Second line: one sentence naming the span that decides it.',\n  'Return no findings.',\n].join('\\n')\n\n/**\n * Ask every question, then verify every admitted finding. Never throws for a failed question or\n * verifier: each failure is recorded on its outcome. Throws before any model call for a malformed\n * question list or options.\n */\nexport async function askTraceQuestions(\n  opts: AskTraceQuestionsOptions,\n): Promise<TraceQuestionOutcome[]> {\n  const concurrency = opts.concurrency ?? 4\n  if (!Number.isSafeInteger(concurrency) || concurrency < 1) {\n    throw new RangeError('askTraceQuestions: concurrency must be an integer >= 1')\n  }\n  const minimum = opts.minimumEvidenceCitations ?? 2\n  if (!Number.isSafeInteger(minimum) || minimum < 1) {\n    throw new RangeError('askTraceQuestions: minimumEvidenceCitations must be an integer >= 1')\n  }\n  const seen = new Set<string>()\n  for (const question of opts.questions) {\n    if (!QUESTION_ID.test(question.id)) {\n      throw new TypeError(\n        `askTraceQuestions: question id ${JSON.stringify(question.id)} is malformed`,\n      )\n    }\n    if (seen.has(question.id)) {\n      throw new TypeError(`askTraceQuestions: duplicate question id ${JSON.stringify(question.id)}`)\n    }\n    seen.add(question.id)\n    if (question.question.trim() === '') {\n      throw new TypeError(`askTraceQuestions: question ${question.id} is empty`)\n    }\n  }\n\n  const askOne = async (question: TraceQuestionSpec): Promise<TraceQuestionOutcome> => {\n    if (opts.signal?.aborted) {\n      return failed(question, 'the run was aborted before the question started')\n    }\n    let completed: Awaited<ReturnType<typeof runTraceAnalyst>>\n    try {\n      completed = await runTraceAnalyst({\n        definition: defineTraceAnalyst({\n          id: `question.${question.id}`,\n          description: `trace question ${question.id}`,\n          area: 'question',\n          version: DEFINITION_VERSION,\n          question: question.question.trim(),\n          instructions: [QUESTION_RULES, question.instructions?.trim() ?? '']\n            .filter(Boolean)\n            .join('\\n\\n'),\n          toolGroup: 'all',\n          minimumEvidenceCitations: minimum,\n          ...(opts.context ? { prepareContext: () => opts.context } : {}),\n          ...(opts.limits ? { limits: opts.limits } : {}),\n        }),\n        engine: opts.engine,\n        store: opts.store,\n        context: {\n          runId: opts.runId,\n          correlationId: `${opts.runId}:${question.id}`,\n          costLedger: opts.costLedger,\n          costPhase: 'trace-question',\n          ...(opts.signal ? { signal: opts.signal } : {}),\n          ...(opts.log ? { log: opts.log } : {}),\n        },\n      })\n    } catch (error) {\n      return failed(question, errorText(error))\n    }\n    const findings: VerifiedTraceFinding[] = []\n    for (const [index, finding] of completed.findings.entries()) {\n      const citations = finding.evidence\n        .map((citation) => citation.uri.trim())\n        .filter((uri) => parseTraceSpanEvidenceUri(uri) !== null)\n      findings.push(\n        opts.verify === false\n          ? { finding, citations, verified: null }\n          : await verifyFinding(opts, `${question.id}.v${index + 1}`, finding, citations),\n      )\n    }\n    const answer = completed.answer.trim() === '' ? null : completed.answer\n    return {\n      id: question.id,\n      question: question.question,\n      status: 'answered',\n      answer,\n      findings,\n      modelCalls: completed.modelCalls,\n      toolCalls: completed.toolCalls,\n    }\n  }\n\n  // A pool, not Promise.all: at most `concurrency` engines exist at once.\n  const outcomes = new Array<TraceQuestionOutcome>(opts.questions.length)\n  let next = 0\n  await Promise.all(\n    Array.from({ length: Math.min(concurrency, opts.questions.length) }, async () => {\n      while (next < opts.questions.length) {\n        const index = next\n        next += 1\n        const question = opts.questions[index] as TraceQuestionSpec\n        outcomes[index] = await askOne(question)\n      }\n    }),\n  )\n  return outcomes\n}\n\n/** The verifier reads only the spans the finding cites, through a store that holds nothing else. */\nasync function verifyFinding(\n  opts: AskTraceQuestionsOptions,\n  id: string,\n  finding: RawAnalystFinding,\n  citations: readonly string[],\n): Promise<VerifiedTraceFinding> {\n  const allowed = new Map<string, Set<string>>()\n  for (const uri of citations) {\n    const location = parseTraceSpanEvidenceUri(uri)\n    if (location === null) continue\n    const spans = allowed.get(location.traceId) ?? new Set<string>()\n    spans.add(location.spanId)\n    allowed.set(location.traceId, spans)\n  }\n  if (allowed.size === 0) return { finding, citations, verified: false }\n  try {\n    const verdict = await runTraceAnalyst({\n      definition: defineTraceAnalyst({\n        id: `verify.${id}`,\n        description: `independent check of finding ${id}`,\n        area: 'question',\n        version: DEFINITION_VERSION,\n        question: `CLAIM: ${finding.claim}\\nCITED SPANS: ${citations.join(', ')}`,\n        instructions: VERIFIER_RULES,\n        toolGroup: 'targeted',\n        ...(opts.limits ? { limits: opts.limits } : {}),\n      }),\n      engine: opts.engine,\n      store: citedSpansOnly(opts.store, allowed),\n      context: {\n        runId: opts.runId,\n        correlationId: `${opts.runId}:verify:${id}`,\n        costLedger: opts.costLedger,\n        costPhase: 'trace-question-verifier',\n        ...(opts.signal ? { signal: opts.signal } : {}),\n        ...(opts.log ? { log: opts.log } : {}),\n      },\n    })\n    const first = verdict.answer.trim().split('\\n')[0]?.trim().toUpperCase() ?? ''\n    return {\n      finding,\n      citations,\n      verified: first.startsWith('SUPPORTED'),\n      verifierAnswer: verdict.answer.trim(),\n    }\n  } catch (error) {\n    opts.log?.('verifier failed', { finding: id, error: errorText(error) })\n    return { finding, citations, verified: null }\n  }\n}\n\n/**\n * A store that exposes exactly the cited spans. Discovery and whole-trace reads refuse, so the\n * verifier cannot go looking for other support; the underlying store's bounds still apply.\n */\nexport function citedSpansOnly(\n  store: TraceAnalysisStore,\n  allowed: ReadonlyMap<string, ReadonlySet<string>>,\n): TraceAnalysisStore {\n  const refuse = (what: string) => async (): Promise<never> => {\n    throw new Error(`${what} is not available to a verifier: read the cited spans with viewSpans`)\n  }\n  return {\n    hasTrace: async (traceId) => allowed.has(traceId),\n    hasSpans: async (input, context) => {\n      const spans = allowed.get(input.trace_id)\n      if (spans === undefined) return []\n      return store.hasSpans(\n        { trace_id: input.trace_id, span_ids: input.span_ids.filter((span) => spans.has(span)) },\n        context,\n      )\n    },\n    getOverview: refuse('getOverview'),\n    queryTraces: refuse('queryTraces'),\n    countTraces: refuse('countTraces'),\n    viewTrace: refuse('viewTrace'),\n    viewSpans: async (input, context) => {\n      const spans = allowed.get(input.trace_id)\n      const wanted = input.span_ids.filter((span) => spans?.has(span) === true)\n      if (wanted.length === 0) {\n        throw new Error('viewSpans: only the cited spans are readable')\n      }\n      return store.viewSpans({ ...input, span_ids: wanted }, context)\n    },\n    searchTrace: refuse('searchTrace'),\n    searchSpan: async (input, context) => {\n      if (allowed.get(input.trace_id)?.has(input.span_id) !== true) {\n        throw new Error('searchSpan: only the cited spans are readable')\n      }\n      return store.searchSpan(input, context)\n    },\n  }\n}\n\nfunction failed(question: TraceQuestionSpec, failure: string): TraceQuestionOutcome {\n  return {\n    id: question.id,\n    question: question.question,\n    status: 'failed',\n    failure,\n    answer: null,\n    findings: [],\n    modelCalls: null,\n    toolCalls: null,\n  }\n}\n\nfunction errorText(error: unknown): string {\n  return error instanceof Error ? `${error.name}: ${error.message}` : String(error)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,MAAM,cAAc;AAIpB,SAAS,aAAa,GAAmC;CACvD,QAAQ,GAAR;EACE,KAAK,YACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,SACH,OAAO;EACT,KAAK,QACH,OAAO;CACX;AACF;AAaA,SAAgB,kCACd,MACoC;CACpC,MAAM,KAAK,KAAK,MAAM;CACtB,MAAM,OAAO,KAAK,QAAQ;CAC1B,MAAM,sBAAsB,+BAA+B,KAAK,mBAAmB;CACnF,OAAO;EACL;EACA,aACE;EACF,WAAW;EACX,MAAM;GACJ,MAAM;GACN,QAAQ,KAAK,QAAQ,QAAQ,CAAC,KAAK,QAAQ,KAAK,IAAI,KAAA;GACpD,uBAAuB;EACzB;EACA,SAAS,GAAG,+BAA+B,WAAW;EACtD,MAAM,QAAQ,OAAO,KAAK;GACxB,MAAM,aAAa,IAAI,WAAW,IAAI,SAAS;GAC/C,IAAI;GACJ,IAAI;IACF,SAAS,MAAM,wBAAwB,OAAO;KAC5C,GAAG,KAAK;KACR;KACA,QAAQ,IAAI;IACd,CAAC;GACH,UAAU;IACR,MAAM,QAAQ,MAAM,iCAAiC,YAAY;KAC/D,SAAS;KACT,WAAW;IACb,CAAC;IACD,IAAI,CAAC,MAAM,SACT,IAAI,MAAM,wDAAwD;KAChE,eAAe,MAAM;KACrB,YAAY;IACd,CAAC;IAEH,IAAI,cAAc,MAAM,OAAO;GACjC;GACA,IAAI,CAAC,OAAO,WACV,OAAO,CACL,YAAY;IACV,YAAY;IACZ;IACA,OAAO;IACP,WAAW,OAAO;IAClB,UAAU;IACV,YAAY;IACZ,eAAe,CAAC;IAChB,UAAU,EAAE,QAAQ,OAAO,MAAM;GACnC,CAAC,CACH;GAEF,MAAM,MAAwB,CAAC;GAC/B,KAAK,MAAM,KAAK,OAAO,UAAU;IAG/B,IAAI,EAAE,WAAW,EAAE,SAAS,GAAG;IAC/B,IAAI,KACF,YAAY;KACV,YAAY;KACZ;KACA,SAAS,EAAE;KACX,OAAO,EAAE,UACL,YAAY,EAAE,QAAQ,aAAa,EAAE,MAAM,QAC3C,YAAY,EAAE,QAAQ;KAC1B,WAAW,EAAE;KACb,UAAU,aAAa,EAAE,QAAQ;KACjC,YAAY;KACZ,eAAe,CAAC;MAAE,MAAM;MAAY,KAAK;MAAmB,SAAS,EAAE;KAAS,CAAC;KACjF,UAAU;MACR,SAAS,EAAE;MACX,SAAS,EAAE;MACX,UAAU,EAAE;KACd;IACF,CAAC,CACH;GACF;GACA,OAAO;EACT;CACF;AACF;;;;;;;AC3FA,SAAgB,YACd,YACA,YAC0C;CAC1C,MAAM,OAAO,WAAW,WAAW;CACnC,IAAI,SAAS,YAAY,WAAW,SAAS,gBAC3C,OAAO,2BAA2B,YAAY;EAC5C,SAAS,WAAW;EACpB,OAAO,WAAW;EAClB,GAAI,WAAW,YAAY,EAAE,WAAW,WAAW,UAAU,IAAI,CAAC;EAClE,GAAI,WAAW,UAAU,EAAE,SAAS,WAAW,QAAQ,IAAI,CAAC;CAC9D,CAAC;CAEH,IAAI,SAAS,aAAa,WAAW,SAAS,eAC5C,OAAO,4BAA4B,YAAY,WAAW,MAAM;CAElE,IAAI,SAAS,mBAAmB,WAAW,SAAS,eAClD,OAAO,iCAGL,YACA,WAAW,MACb;CAEF,MAAM,IAAI,2BACR,2BAA2B,KAAK,uBAAuB,WAAW,KAAK,2BACtD,WAAW,GAAG,wCACjC;AACF;;;;;;;;;;AC7DA,SAAgB,mBAAmB,YAA4D;CAC7F,KAAK,MAAM,CAAC,MAAM,UAAU;EAC1B,CAAC,MAAM,WAAW,EAAE;EACpB,CAAC,eAAe,WAAW,WAAW;EACtC,CAAC,QAAQ,WAAW,IAAI;EACxB,CAAC,WAAW,WAAW,OAAO;EAC9B,CAAC,gBAAgB,WAAW,YAAY;CAC1C,GACE,IAAI,OAAO,UAAU,YAAY,CAAC,MAAM,KAAK,GAC3C,MAAM,IAAI,UAAU,uBAAuB,KAAK,4BAA4B;CAGhF,OAAO;EACL,GAAG;EACH,QAAQ,WAAW,SAAS,EAAE,GAAG,WAAW,OAAO,IAAI,KAAA;CACzD;AACF;AAsBA,SAAgB,oBACd,SACuE;CACvE,IAAI,CAAC,QAAQ,GAAG,KAAK,GAAG,MAAM,IAAI,UAAU,2CAA2C;CACvF,IAAI,CAAC,QAAQ,YAAY,KAAK,GAC5B,MAAM,IAAI,UAAU,oDAAoD;CAE1E,IAAI,QAAQ,SAAS,KAAA,GACnB,MAAM,IAAI,UAAU,4CAA4C;CAElE,IACE,qBAAqB,YACpB,CAAC,QAAQ,mBACR,OAAO,QAAQ,oBAAoB,YACnC,MAAM,QAAQ,QAAQ,eAAe,IAEvC,MAAM,IAAI,UAAU,wDAAwD;CAE9E,OAAO;EACL,IAAI,QAAQ;EACZ,aAAa,QAAQ;EACrB,SAAS,QAAQ,WAAW;EAC5B,WAAW;EACX,MAAM,QAAQ;EACd,SAAS,QAAQ;EACjB,GAAI,qBAAqB,UAAU,EAAE,iBAAiB,QAAQ,gBAAgB,IAAI,CAAC;CACrF;AACF;;;;;;;;;;;;;;;;;;;;;;;;;ACGA,MAAM,uBAAuB;AAE7B,MAAM,oBACJ;AACF,MAAM,aAAa;AAInB,SAAS,cAAc,MAAgD;CACrE,IAAI,CAAC,WAAW,IAAI,GAAG,OAAO,CAAC;CAC/B,MAAM,MAAwC,CAAC;CAC/C,KAAK,MAAM,SAAS,YAAY,MAAM,EAAE,eAAe,KAAK,CAAC,GAAG;EAC9D,IAAI,CAAC,MAAM,YAAY,KAAK,CAAC,MAAM,eAAe,GAAG;EACrD,MAAM,UAAU,KAAK,MAAM,MAAM,MAAM,UAAU;EACjD,IAAI,WAAW,OAAO,GAAG,IAAI,KAAK;GAAE,MAAM,MAAM;GAAM,MAAM;EAAQ,CAAC;CACvE;CACA,OAAO;AACT;AAEA,SAAS,UAAU,KAAa,KAAuB;CACrD,IAAI,CAAC,WAAW,GAAG,GAAG,OAAO,CAAC;CAC9B,MAAM,QAAkB,CAAC;CACzB,MAAM,QAAQ,CAAC,GAAG;CAClB,OAAO,MAAM,QAAQ;EACnB,MAAM,MAAM,MAAM,IAAI;EACtB,IAAI;EACJ,IAAI;GACF,UAAU,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;EACpD,QAAQ;GACN;EACF;EACA,KAAK,MAAM,KAAK,SAAS;GACvB,MAAM,OAAO,KAAK,KAAK,EAAE,IAAI;GAC7B,IAAI,EAAE,YAAY,GAAG,MAAM,KAAK,IAAI;QAC/B,IAAI,EAAE,KAAK,SAAS,QAAQ,GAAG;IAClC,MAAM,KAAK,IAAI;IACf,IAAI,MAAM,KAAK,MAAM,UAAU,KAAK,OAAO;GAC7C;EACF;CACF;CACA,OAAO;AACT;AAEA,SAAS,uBAAuB,MAAsB;CAEpD,MAAM,QADK,wBAAwB,KAAK,IACzB,CAAC,GAAG,MAAM;CAEzB,OADU,uBAAuB,KAAK,KAC/B,CAAC,GAAG,MAAM;AACnB;AAEA,SAAS,eAAe,OAAiB,MAAc,SAA2B;CAChF,IAAI,IAAI;CACR,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,aAAa,CAAC,KAAK,MAAM,WAAW,IAAI,GAAG,GAAG,QAAQ,KAAK,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC;EACrF,KAAK,MAAM,OAAO,YAAY;GAC5B,IAAI,CAAC,WAAW,GAAG,GAAG;GACtB,IAAI;IACF,IAAI,SAAS,GAAG,CAAC,CAAC,YAAY,GAAG,KAAK,YAAY,GAAG,CAAC,CAAC;SAClD,KAAK;GACZ,QAAQ,CAER;EACF;CACF;CACA,OAAO;AACT;;AAGA,SAAgB,sBAAsB,QAAgD;CACpF,MAAM,SAAS,OAAO,WAAW,SAAS,EAAE,MAAM,WAChD,cAAc,IAAI,CAAC,CAAC,KAAK,OAAO;EAAE,GAAG;EAAG;CAAK,EAAE,CACjD;CACA,MAAM,QAAQ,OAAO,KAAK,MAAM,EAAE,IAAI;CAGtC,MAAM,SAAS,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAC/D,MAAM,QAAQ,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAC9D,MAAM,UAAU;CAChB,MAAM,QAAQ;CACd,IAAI,cAAc;CAClB,KAAK,MAAM,OAAO,OAAO,gBACvB,KAAK,MAAM,QAAQ,UAAU,KAAK,OAAO,wBAAwB,CAAC,GAAG;EACnE,eAAe;EACf,IAAI;EACJ,IAAI;GACF,OAAO,aAAa,MAAM,MAAM;EAClC,QAAQ;GACN;EACF;EACA,KAAK,MAAM,KAAK,KAAK,SAAS,OAAO,GAAG;GACtC,MAAM,IAAI,EAAE;GACZ,IAAI,CAAC,GAAG;GACR,MAAM,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;GAChC,MAAM,OAAO,OAAO,IAAI,CAAC;GACzB,IAAI,SAAS,KAAA,GAAW,OAAO,IAAI,GAAG,OAAO,CAAC;EAChD;EACA,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,GAAG;GACpC,MAAM,IAAI,EAAE;GACZ,IAAI,MAAM,KAAA,GAAW;GACrB,MAAM,OAAO,MAAM,IAAI,CAAC;GACxB,IAAI,SAAS,KAAA,GAAW,MAAM,IAAI,GAAG,OAAO,CAAC;EAC/C;CACF;CAIF,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,KAAK,QACd,IAAI;EACF,OAAO,IAAI,EAAE,MAAM,aAAa,EAAE,MAAM,MAAM,CAAC;CACjD,QAAQ;EACN,OAAO,IAAI,EAAE,MAAM,EAAE;CACvB;CAEF,MAAM,UAAU,IAAI,IAAoB,MAAM,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAChE,KAAK,MAAM,UAAU,OAAO;EAC1B,MAAM,MAAM,IAAI,OAAO,IAAI,OAAO,YAAY,OAAO,OAAO;EAC5D,KAAK,MAAM,KAAK,QAAQ;GACtB,IAAI,EAAE,SAAS,QAAQ;GACvB,IAAI,IAAI,KAAK,OAAO,IAAI,EAAE,IAAI,KAAK,EAAE,GAAG,QAAQ,IAAI,QAAQ,QAAQ,IAAI,MAAM,IAAK,CAAC;EACtF;CACF;CAEA,MAAM,UAA8B,OAAO,KAAK,MAAM;EACpD,MAAM,OAAO,OAAO,IAAI,EAAE,IAAI,KAAK;EACnC,MAAM,MAAM,EAAE,KAAK,QAAQ,gBAAgB,EAAE;EAC7C,OAAO;GACL,MAAM,EAAE;GACR,MAAM,EAAE;GACR,MAAM,EAAE;GACR,OAAO,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC,SAAS;GACxC,mBAAmB,OAAO,IAAI,EAAE,IAAI,KAAK;GACzC,kBAAkB,MAAM,IAAI,EAAE,IAAI,KAAK;GACvC,aAAa,QAAQ,IAAI,EAAE,IAAI,KAAK;GACpC,eAAe,eACb,OAAO,iBAAiB,CAAC,GACzB,EAAE,MACF,OAAO,kBAAkB,EAAE,SAAS,CAAC,CACvC;GACA,oBAAoB,KAAK,MAAM,iBAAiB,KAAK,CAAC,EAAA,CAAG;GACzD,kBAAkB,WAAW,KAAK,KAAK,YAAY,CAAC;GACpD,aAAa,WAAW,KAAK,KAAK,OAAO,CAAC;GAC1C,UAAU,KAAK,SAAS,kBAAkB;GAC1C,mBAAmB,WAAW,KAAK,uBAAuB,IAAI,KAAK,KAAK,MAAM,GAAG,GAAG,CAAC;EACvF;CACF,CAAC;CACD,OAAO;EAAE,qBAAqB;EAAa;CAAQ;AACrD;AAIA,MAAM,aAAa;AAEnB,SAAS,QACP,MACA,SACA,OACA,UACA,YACA,YACA,aACA,aACA,WACgB;CAChB,OAAO;EACL,gBAAgB;EAChB,YAAY,iBAAiB;GAAE,YAAY;GAAY;GAAM;GAAS;EAAM,CAAC;EAC7E,YAAY;EACZ,aAAa;EACb;EACA;EACA;EACA;EACA,eAAe,CAAC;GAAE,MAAM;GAAY,KAAK;EAAY,CAAC;EACtD,oBAAoB;EACpB;EACA;CACF;AACF;;AAGA,SAAgB,uBACd,QACA,YACkB;CAClB,MAAM,MAAwB,CAAC;CAC/B,KAAK,MAAM,KAAK,OAAO,SAAS;EAC9B,MAAM,cAAc,EAAE,oBAAoB,EAAE;EAI5C,IAHkB,cAAc,EAAE,cAAc,EAAE,kBAGhC,GAChB,IAAI,KACF,QACE,eACA,EAAE,MACF,UAAU,EAAE,KAAK,+EACjB,QACA,IACA,YACA,sIACA,EAAE,MACF,iGACF,CACF;OACK,IAAI,gBAAgB,KAAK,EAAE,cAAc,EAAE,gBAAgB,GAEhE,IAAI,KACF,QACE,eACA,EAAE,MACF,UAAU,EAAE,KAAK,gFAAgF,EAAE,YAAY,cAAc,EAAE,cAAc,IAC7I,QACA,IACA,YACA,2JACA,EAAE,MACF,sEACF,CACF;EAIF,IAAI,eAAe,KAAK,CAAC,EAAE,mBACzB,IAAI,KACF,QACE,mBACA,EAAE,MACF,UAAU,EAAE,KAAK,mFACjB,UACA,IACA,YACA,oHACA,EAAE,IACJ,CACF;EAIF,IAAI,EAAE,SAAS,YAAY,EAAE,oBAAoB,GAC/C,IAAI,KACF,QACE,UACA,EAAE,MACF,iBAAiB,EAAE,KAAK,YAAY,EAAE,kBAAkB,+BACxD,QACA,KACA,YACA,uMACA,EAAE,IACJ,CACF;EAIF,IAAI,EAAE,QAAQ,wBAAwB,CAAC,EAAE,kBACvC,IAAI,KACF,QACE,mBACA,EAAE,MACF,UAAU,EAAE,KAAK,OAAO,EAAE,MAAM,4DAChC,UACA,IACA,YACA,mFAAmF,EAAE,MAAM,mDAC3F,EAAE,IACJ,CACF;EAIF,IAAI,CAAC,EAAE,aACL,IAAI,KACF,QACE,gBACA,EAAE,MACF,UAAU,EAAE,KAAK,oBACjB,OACA,IACA,YACA,wGACA,EAAE,IACJ,CACF;EAIF,IAAI,CAAC,EAAE,UACL,IAAI,KACF,QACE,iBACA,EAAE,MACF,UAAU,EAAE,KAAK,8CACjB,OACA,KACA,YACA,iJACA,EAAE,IACJ,CACF;CAEJ;CACA,OAAO;AACT;AAIA,IAAM,oBAAN,MAAyE;CACvE,KAAc;CACd,cACE;CACF,YAAqB;CACrB,OAAgB;EAAE,MAAM;EAA0B,iBAAiB;CAAE;CACrE,UAAmB;CACnB,kBAA2B;EACzB,MAAM;EACN,sBAAsB;EACtB,oBAAoB;CACtB;CAEA,MAAM,QAAQ,OAAyB,KAAgD;EACrF,MAAM,aAAa,IAAI,MAAM,+BAAc,IAAI,KAAK,EAAA,CAAE,YAAY;EAClE,IAAI,MACF,gBAAgB,MAAM,QAAQ,OAAO,eAAe,MAAM,oBAAoB,aAChF;EACA,OAAO,uBAAuB,OAAO,UAAU;CACjD;AACF;AAEA,MAAa,sBAAsB,IAAI,kBAAkB;;;ACvUzD,MAAM,cAAc;AACpB,MAAM,qBAAqB;AAE3B,MAAM,iBAAiB;CACrB;CACA;CACA;AACF,CAAC,CAAC,KAAK,IAAI;AAEX,MAAM,iBAAiB;CACrB;CACA;CACA;CACA;CACA;AACF,CAAC,CAAC,KAAK,IAAI;;;;;;AAOX,eAAsB,kBACpB,MACiC;CACjC,MAAM,cAAc,KAAK,eAAe;CACxC,IAAI,CAAC,OAAO,cAAc,WAAW,KAAK,cAAc,GACtD,MAAM,IAAI,WAAW,wDAAwD;CAE/E,MAAM,UAAU,KAAK,4BAA4B;CACjD,IAAI,CAAC,OAAO,cAAc,OAAO,KAAK,UAAU,GAC9C,MAAM,IAAI,WAAW,qEAAqE;CAE5F,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,YAAY,KAAK,WAAW;EACrC,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,GAC/B,MAAM,IAAI,UACR,kCAAkC,KAAK,UAAU,SAAS,EAAE,EAAE,cAChE;EAEF,IAAI,KAAK,IAAI,SAAS,EAAE,GACtB,MAAM,IAAI,UAAU,4CAA4C,KAAK,UAAU,SAAS,EAAE,GAAG;EAE/F,KAAK,IAAI,SAAS,EAAE;EACpB,IAAI,SAAS,SAAS,KAAK,MAAM,IAC/B,MAAM,IAAI,UAAU,+BAA+B,SAAS,GAAG,UAAU;CAE7E;CAEA,MAAM,SAAS,OAAO,aAA+D;EACnF,IAAI,KAAK,QAAQ,SACf,OAAO,OAAO,UAAU,iDAAiD;EAE3E,IAAI;EACJ,IAAI;GACF,YAAY,MAAM,gBAAgB;IAChC,YAAY,mBAAmB;KAC7B,IAAI,YAAY,SAAS;KACzB,aAAa,kBAAkB,SAAS;KACxC,MAAM;KACN,SAAS;KACT,UAAU,SAAS,SAAS,KAAK;KACjC,cAAc,CAAC,gBAAgB,SAAS,cAAc,KAAK,KAAK,EAAE,CAAC,CAChE,OAAO,OAAO,CAAC,CACf,KAAK,MAAM;KACd,WAAW;KACX,0BAA0B;KAC1B,GAAI,KAAK,UAAU,EAAE,sBAAsB,KAAK,QAAQ,IAAI,CAAC;KAC7D,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;IAC/C,CAAC;IACD,QAAQ,KAAK;IACb,OAAO,KAAK;IACZ,SAAS;KACP,OAAO,KAAK;KACZ,eAAe,GAAG,KAAK,MAAM,GAAG,SAAS;KACzC,YAAY,KAAK;KACjB,WAAW;KACX,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;KAC7C,GAAI,KAAK,MAAM,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;IACtC;GACF,CAAC;EACH,SAAS,OAAO;GACd,OAAO,OAAO,UAAU,UAAU,KAAK,CAAC;EAC1C;EACA,MAAM,WAAmC,CAAC;EAC1C,KAAK,MAAM,CAAC,OAAO,YAAY,UAAU,SAAS,QAAQ,GAAG;GAC3D,MAAM,YAAY,QAAQ,SACvB,KAAK,aAAa,SAAS,IAAI,KAAK,CAAC,CAAC,CACtC,QAAQ,QAAQ,0BAA0B,GAAG,MAAM,IAAI;GAC1D,SAAS,KACP,KAAK,WAAW,QACZ;IAAE;IAAS;IAAW,UAAU;GAAK,IACrC,MAAM,cAAc,MAAM,GAAG,SAAS,GAAG,IAAI,QAAQ,KAAK,SAAS,SAAS,CAClF;EACF;EACA,MAAM,SAAS,UAAU,OAAO,KAAK,MAAM,KAAK,OAAO,UAAU;EACjE,OAAO;GACL,IAAI,SAAS;GACb,UAAU,SAAS;GACnB,QAAQ;GACR;GACA;GACA,YAAY,UAAU;GACtB,WAAW,UAAU;EACvB;CACF;CAGA,MAAM,WAAW,IAAI,MAA4B,KAAK,UAAU,MAAM;CACtE,IAAI,OAAO;CACX,MAAM,QAAQ,IACZ,MAAM,KAAK,EAAE,QAAQ,KAAK,IAAI,aAAa,KAAK,UAAU,MAAM,EAAE,GAAG,YAAY;EAC/E,OAAO,OAAO,KAAK,UAAU,QAAQ;GACnC,MAAM,QAAQ;GACd,QAAQ;GACR,MAAM,WAAW,KAAK,UAAU;GAChC,SAAS,SAAS,MAAM,OAAO,QAAQ;EACzC;CACF,CAAC,CACH;CACA,OAAO;AACT;;AAGA,eAAe,cACb,MACA,IACA,SACA,WAC+B;CAC/B,MAAM,0BAAU,IAAI,IAAyB;CAC7C,KAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,WAAW,0BAA0B,GAAG;EAC9C,IAAI,aAAa,MAAM;EACvB,MAAM,QAAQ,QAAQ,IAAI,SAAS,OAAO,qBAAK,IAAI,IAAY;EAC/D,MAAM,IAAI,SAAS,MAAM;EACzB,QAAQ,IAAI,SAAS,SAAS,KAAK;CACrC;CACA,IAAI,QAAQ,SAAS,GAAG,OAAO;EAAE;EAAS;EAAW,UAAU;CAAM;CACrE,IAAI;EACF,MAAM,UAAU,MAAM,gBAAgB;GACpC,YAAY,mBAAmB;IAC7B,IAAI,UAAU;IACd,aAAa,gCAAgC;IAC7C,MAAM;IACN,SAAS;IACT,UAAU,UAAU,QAAQ,MAAM,iBAAiB,UAAU,KAAK,IAAI;IACtE,cAAc;IACd,WAAW;IACX,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;GAC/C,CAAC;GACD,QAAQ,KAAK;GACb,OAAO,eAAe,KAAK,OAAO,OAAO;GACzC,SAAS;IACP,OAAO,KAAK;IACZ,eAAe,GAAG,KAAK,MAAM,UAAU;IACvC,YAAY,KAAK;IACjB,WAAW;IACX,GAAI,KAAK,SAAS,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC;IAC7C,GAAI,KAAK,MAAM,EAAE,KAAK,KAAK,IAAI,IAAI,CAAC;GACtC;EACF,CAAC;EAED,OAAO;GACL;GACA;GACA,WAJY,QAAQ,OAAO,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,YAAY,KAAK,GAAA,CAI1D,WAAW,WAAW;GACtC,gBAAgB,QAAQ,OAAO,KAAK;EACtC;CACF,SAAS,OAAO;EACd,KAAK,MAAM,mBAAmB;GAAE,SAAS;GAAI,OAAO,UAAU,KAAK;EAAE,CAAC;EACtE,OAAO;GAAE;GAAS;GAAW,UAAU;EAAK;CAC9C;AACF;;;;;AAMA,SAAgB,eACd,OACA,SACoB;CACpB,MAAM,UAAU,SAAiB,YAA4B;EAC3D,MAAM,IAAI,MAAM,GAAG,KAAK,qEAAqE;CAC/F;CACA,OAAO;EACL,UAAU,OAAO,YAAY,QAAQ,IAAI,OAAO;EAChD,UAAU,OAAO,OAAO,YAAY;GAClC,MAAM,QAAQ,QAAQ,IAAI,MAAM,QAAQ;GACxC,IAAI,UAAU,KAAA,GAAW,OAAO,CAAC;GACjC,OAAO,MAAM,SACX;IAAE,UAAU,MAAM;IAAU,UAAU,MAAM,SAAS,QAAQ,SAAS,MAAM,IAAI,IAAI,CAAC;GAAE,GACvF,OACF;EACF;EACA,aAAa,OAAO,aAAa;EACjC,aAAa,OAAO,aAAa;EACjC,aAAa,OAAO,aAAa;EACjC,WAAW,OAAO,WAAW;EAC7B,WAAW,OAAO,OAAO,YAAY;GACnC,MAAM,QAAQ,QAAQ,IAAI,MAAM,QAAQ;GACxC,MAAM,SAAS,MAAM,SAAS,QAAQ,SAAS,OAAO,IAAI,IAAI,MAAM,IAAI;GACxE,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,MAAM,8CAA8C;GAEhE,OAAO,MAAM,UAAU;IAAE,GAAG;IAAO,UAAU;GAAO,GAAG,OAAO;EAChE;EACA,aAAa,OAAO,aAAa;EACjC,YAAY,OAAO,OAAO,YAAY;GACpC,IAAI,QAAQ,IAAI,MAAM,QAAQ,CAAC,EAAE,IAAI,MAAM,OAAO,MAAM,MACtD,MAAM,IAAI,MAAM,+CAA+C;GAEjE,OAAO,MAAM,WAAW,OAAO,OAAO;EACxC;CACF;AACF;AAEA,SAAS,OAAO,UAA6B,SAAuC;CAClF,OAAO;EACL,IAAI,SAAS;EACb,UAAU,SAAS;EACnB,QAAQ;EACR;EACA,QAAQ;EACR,UAAU,CAAC;EACX,YAAY;EACZ,WAAW;CACb;AACF;AAEA,SAAS,UAAU,OAAwB;CACzC,OAAO,iBAAiB,QAAQ,GAAG,MAAM,KAAK,IAAI,MAAM,YAAY,OAAO,KAAK;AAClF"}

package/dist/{analyze-runs-CLz5O01x.d.ts → analyze-runs-BvK4-wSs.d.ts}

@@ -1,8 +1,8 @@
-import { a as RunRecord } from "./run-record-xEULpgML.js";
+import { a as RunRecord } from "./run-record-DF-fuu31.js";
 import { r as DatasetScenario } from "./dataset-DQqhOCPt.js";
-import "./summary-report-SNvJoAvD.js";
-import { o as InsightReport, r as ExecutionInsight, t as CostProvenanceSummary } from "./insight-report-DeE1solA.js";
-import { n as AnalystRegistry } from "./registry-BM2Kdk8T.js";
+import "./summary-report-DvvesgR_.js";
+import { o as InsightReport, r as ExecutionInsight, t as CostProvenanceSummary } from "./insight-report-CvPkEIcC.js";
+import { n as AnalystRegistry } from "./registry-mAQVtuLx.js";
 //#region src/contract/analyze-runs.d.ts
 interface AnalyzeRunsOptions {
   /** The runs to analyze. */
@@ -72,4 +72,4 @@ declare function summarizeExecution(opts: SummarizeExecutionOptions): ExecutionR
 declare function analyzeRuns(opts: AnalyzeRunsOptions): Promise<InsightReport>;
 //#endregion
 export { summarizeExecution as a, analyzeRuns as i, ExecutionReport as n, SummarizeExecutionOptions as r, AnalyzeRunsOptions as t };
-//# sourceMappingURL=analyze-runs-CLz5O01x.d.ts.map
+//# sourceMappingURL=analyze-runs-BvK4-wSs.d.ts.map

package/dist/{analyze-runs-CLz5O01x.d.ts.map → analyze-runs-BvK4-wSs.d.ts.map}

@@ -1 +1 @@
-{"version":3,"file":"analyze-runs-CLz5O01x.d.ts","names":[],"sources":["../src/contract/analyze-runs.ts"],"mappings":";;;;;;UAqEiB;;EAEf,MAAM;;;EAGN;;;;;EAKA;EACA;;;EAGA,8BAA8B;;;EAG9B,kBAAkB;;;EAGlB,UAAU;;;;EAIV;IACE;IACA,cAAc;;;;;EAKhB,cAAc;IAAQ;IAAe;IAAe;;;EAEpD;;;;EAIA;;;;;;;;;EASA,eAAe;;;EAGf;;UAGe;EACf,MAAM;EACN;;UAGe;EACf,WAAW;EACX,gBAAgB;;;iBAIF,mBAAmB,MAAM,4BAA4B;iBAgB/C,YAAY,MAAM,qBAAqB,QAAQ"}
+{"version":3,"file":"analyze-runs-BvK4-wSs.d.ts","names":[],"sources":["../src/contract/analyze-runs.ts"],"mappings":";;;;;;UAqEiB;;EAEf,MAAM;;;EAGN;;;;;EAKA;EACA;;;EAGA,8BAA8B;;;EAG9B,kBAAkB;;;EAGlB,UAAU;;;;EAIV;IACE;IACA,cAAc;;;;;EAKhB,cAAc;IAAQ;IAAe;IAAe;;;EAEpD;;;;EAIA;;;;;;;;;EASA,eAAe;;;EAGf;;UAGe;EACf,MAAM;EACN;;UAGe;EACf,WAAW;EACX,gBAAgB;;;iBAIF,mBAAmB,MAAM,4BAA4B;iBAgB/C,YAAY,MAAM,qBAAqB,QAAQ"}

package/dist/{analyze-runs-DCY7LMt4.js → analyze-runs-SCSWYpy0.js}

@@ -8,7 +8,7 @@ import { r as welchsTTest } from "./baseline-BC-eBZ7U.js";
 import { n as aggregatePairedHoldout } from "./statistical-heldout-GcLIPxk4.js";
 import "./query-DlV0pdx4.js";
 import { r as observedSplitScore } from "./reward-nw2xZGZG.js";
-import { c as validateRunRecord } from "./run-record-tg_5H2IK.js";
+import { u as validateRunRecord } from "./run-record-BRlM99rX.js";
 import { r as paretoChart } from "./summary-report-BMvou2oZ.js";
 //#region src/contamination-guard.ts
 function checkCanaries(output, scenarios) {
@@ -62,12 +62,12 @@ async function analyzeRuns(opts) {
 		runs,
 		histogramBins: bins
 	});
-	const knownCostRuns = runs.filter((run) => run.costProvenance.kind !== "uncaptured");
+	const knownCostRuns = runs.filter((run) => run.costProvenance.usd !== null);
 	const costs = knownCostRuns.map((r) => r.costUsd).filter(isFiniteNumber);
 	const costDist = distributionOf(costs, bins);
 	const pareto = paretoChart(knownCostRuns, { split });
 	const degraded = {};
-	if (provenance.uncaptured.n > 0) degraded.cost = diagnoseCostCoverage(runs, provenance);
+	if (provenance.uncaptured.n + provenance.lowerBound.n > 0) degraded.cost = diagnoseCostCoverage(runs, provenance);
 	else if (costs.length === 0 || costs.every((c) => c === 0)) degraded.cost = `all ${runs.length} explicitly observed or estimated USD values are $0`;
 	if (pareto.points.length < 2) degraded.pareto = pareto.points.length === 0 ? "no candidates — Pareto unavailable" : "single candidate — Pareto is a single point, not a frontier";
 	const costQuality = {
@@ -279,13 +279,20 @@ function summarizeCostProvenance(runs) {
 			n: 0,
 			totalUsd: 0
 		},
+		lowerBound: {
+			n: 0,
+			floorUsd: 0
+		},
 		uncaptured: { n: 0 },
 		knownFraction: 0
 	};
 	for (const run of runs) {
 		const cost = run.costProvenance;
 		if (cost.kind === "uncaptured") summary.uncaptured.n += 1;
-		else {
+		else if (cost.kind === "lower-bound") {
+			summary.lowerBound.n += 1;
+			summary.lowerBound.floorUsd += cost.knownLowerBoundUsd;
+		} else {
 			summary[cost.kind].n += 1;
 			summary[cost.kind].totalUsd += cost.usd;
 		}
@@ -295,10 +302,11 @@ function summarizeCostProvenance(runs) {
 	return summary;
 }
 function diagnoseCostCoverage(runs, provenance) {
-	const uncaptured = provenance.uncaptured.n;
+	const unknown = provenance.uncaptured.n + provenance.lowerBound.n;
 	const known = provenance.observed.n + provenance.estimated.n;
-	if (uncaptured === runs.length) return `USD cost uncaptured for all ${runs.length} runs — no observed or estimated USD values; token and wall-time metrics remain available.`;
-	return `USD cost uncaptured for ${uncaptured}/${runs.length} runs; excluded those rows from cost statistics (${known}/${runs.length} retained: ${provenance.observed.n} observed, ${provenance.estimated.n} estimated).`;
+	const floor = provenance.lowerBound.n > 0 ? ` (${provenance.lowerBound.n} of them cost at least $${provenance.lowerBound.floorUsd.toFixed(6)} together)` : "";
+	if (unknown === runs.length) return `USD cost total unknown for all ${runs.length} runs${floor} — no observed or estimated USD values; token and wall-time metrics remain available.`;
+	return `USD cost total unknown for ${unknown}/${runs.length} runs${floor}; excluded those rows from cost statistics (${known}/${runs.length} retained: ${provenance.observed.n} observed, ${provenance.estimated.n} estimated).`;
 }
 /**
 * Model-free task-failure tally.
@@ -381,7 +389,7 @@ function computePriorPeriodComparison(current, baseline, split, windowLabel) {
 	};
 }
 function knownCostValues(runs) {
-	return runs.filter((run) => run.costProvenance.kind !== "uncaptured").map((run) => run.costUsd).filter(isFiniteNumber);
+	return runs.filter((run) => run.costProvenance.usd !== null).map((run) => run.costUsd).filter(isFiniteNumber);
 }
 function isFiniteNumber(value) {
 	return typeof value === "number" && Number.isFinite(value);
@@ -974,4 +982,4 @@ function buildRecommendations(ctx) {
 //#endregion
 export { summarizeExecution as n, checkCanaries as r, analyzeRuns as t };
 
-//# sourceMappingURL=analyze-runs-DCY7LMt4.js.map
+//# sourceMappingURL=analyze-runs-SCSWYpy0.js.map

package/dist/analyze-runs-SCSWYpy0.js.map

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

package/dist/{benchmark-command-CdUGku3W.js → benchmark-command-TZlsuAh9.js}

@@ -3,18 +3,18 @@ import { a as hashCanonical, i as compareCodeUnits, o as jsonDocument, r as cano
 import { r as pairedBootstrap } from "./paired-tests-C8iCsioC.js";
 import { a as resolveModelPricing } from "./metrics-DOMpkoeb.js";
 import { a as CostLedgerPersistenceError, i as CostLedger, n as CostCallConflictError, o as CostReceiptCaptureError, r as CostCeilingReachedError, s as CostReservationExceededError, t as CostAccountingIncompleteError } from "./cost-ledger-_IbkejCF.js";
-import { c as withLedgerFileLock, l as writeLedgerFileAtomically } from "./journal-BuRLm6ho.js";
+import { c as withLedgerFileLock, l as writeLedgerFileAtomically } from "./journal-CDP0Vhx_.js";
 import "./ledger-core/index.js";
-import { S as fsCampaignStorage, i as startExternalOptimizerModelProxy, r as runWithCleanup, x as createRunCostLedger, y as resolveExternalOptimizerProcessLimits } from "./external-optimizer-subprocess-BrfsgL92.js";
-import { f as redactText } from "./redact-DxwlUAvh.js";
-import { r as makeFinding } from "./types-C8VBbiw6.js";
-import { M as RAW_FINDING_SCHEMA_PROMPT, N as RawAnalystFindingSchema, P as evidenceRefsFromRawFinding, g as TRACE_ANALYSIS_LIMITS, r as runTraceAnalyst } from "./kind-factory-g1ROw67A.js";
+import { S as fsCampaignStorage, i as startExternalOptimizerModelProxy, r as runWithCleanup, x as createRunCostLedger, y as resolveExternalOptimizerProcessLimits } from "./external-optimizer-subprocess-C0dHXH8e.js";
+import { f as redactText } from "./redact-8fX8-uKr.js";
+import { M as RAW_FINDING_SCHEMA_PROMPT, N as RawAnalystFindingSchema, P as evidenceRefsFromRawFinding, g as TRACE_ANALYSIS_LIMITS, r as runTraceAnalyst } from "./kind-factory-ByZeXDqF.js";
 import { r as usageReceiptFromCostLedger } from "./usage-receipt-Cx3xNeyB.js";
-import { a as callLlmJson, r as LlmResponseError, t as LlmCallError } from "./llm-client-DF9bPNYA.js";
-import { t as createDspyRlmTraceEngine } from "./dspy-rlm-engine-sPX7B5ac.js";
-import { i as otlpTextToTraceAnalysisStore, r as createOtlpBufferTraceStore, t as DEFAULT_MAX_TRACE_FILE_BYTES } from "./store-otlp-DPgzSQKS.js";
+import { a as callLlmJson, r as LlmResponseError, t as LlmCallError } from "./llm-client-BqmRnibA.js";
+import { r as makeFinding } from "./types-CW5b90JH.js";
+import { t as createDspyRlmTraceEngine } from "./dspy-rlm-engine-CTIGomgr.js";
+import { i as otlpTextToTraceAnalysisStore, r as createOtlpBufferTraceStore, t as DEFAULT_MAX_TRACE_FILE_BYTES } from "./store-otlp-84DH0OEH.js";
 import { i as summarizeAnalystBenchmarkRunner, n as runAnalystBenchmark, r as traceStoreEvidenceResolver } from "./benchmark-BeQJyrRC.js";
-import { n as acquireSingleRunLock } from "./external-optimizer-process-D3BLpZyR.js";
+import { n as acquireSingleRunLock } from "./external-optimizer-process-Mc83UoWl.js";
 import { t as assertEqualDeclarativeTerms } from "./equal-terms-Blx9Zk5I.js";
 import { c as primeProtocolSha256, d as runPrimeExchange, f as decodeReplyRows, n as buildPrimePrompt, t as analystUsageReceiptFromPrimeUsage, u as projectPrimeTrajectory } from "./prime-protocol-DcAK9pC8.js";
 import { t as nodeHttpPrimeBridgeTransport } from "./prime-bridge-transport-Z3cpKGoV.js";
@@ -1415,7 +1415,7 @@ const ANALYST_BENCHMARK_DEPENDENCY_LOCK_FILES = Object.freeze([
 	"package.json",
 	"pnpm-lock.yaml"
 ]);
-const ANALYST_BENCHMARK_DEPENDENCY_LOCK_SHA256 = "c61fa0edc749ac199316c36caf4ff568681667ba5d8e6b01b22b6f1583ec6523";
+const ANALYST_BENCHMARK_DEPENDENCY_LOCK_SHA256 = "deece9c68c6c8fd8d4271821b2549b44f586d55480b5e4adff0cef24425ad506";
 const ANALYST_BENCHMARK_EVIDENCE_DEPENDENCY_LOCK_SHA256 = "1e03f2daed356d60316aabefb407ec1e437ac94d408d61eea4ae096e9c6fbb5b";
 const ANALYST_BENCHMARK_EVIDENCE_IMPLEMENTATION_SHA256 = "4dba263b6256a30d56c7fdb2d992d3a953c0035d731f359b704db806f68f75ac";
 const ANALYST_BENCHMARK_IMPLEMENTATION_FILES = Object.freeze([
@@ -1529,7 +1529,7 @@ const ANALYST_BENCHMARK_IMPLEMENTATION_FILES = Object.freeze([
 	"src/trace/redact.ts",
 	"src/verdict-cache.ts"
 ]);
-const ANALYST_BENCHMARK_IMPLEMENTATION_SHA256 = "de168cc2cbca1623a88fc0b033bbf92f92d5fb1bd2aa317d8c2c453eb61fd9df";
+const ANALYST_BENCHMARK_IMPLEMENTATION_SHA256 = "34d7abf915171873242a05dc08805b3f78edec593f72d4cdb4c8882dec24621f";
 function analystBenchmarkImplementationDigest() {
 	return ANALYST_BENCHMARK_IMPLEMENTATION_SHA256;
 }
@@ -6315,4 +6315,4 @@ function shellQuote(value) {
 //#endregion
 export { ANALYST_BENCHMARK_MANIFEST_FILE as $, readAnalystInstructionsOverride as A, parseVerificationOutcome as B, emptyPublicBenchmarkRunner as C, summarizeCodeTraceCalibration as D, renderCodeTraceCalibrationMarkdown as E, publicBenchmarkRlmInstructions as F, ANALYST_BENCHMARK_EVIDENCE_IMPLEMENTATION_SHA256 as G, ANALYST_BENCHMARK_DEPENDENCY_LOCK_FILES as H, publicBenchmarkSystemPrompt as I, ANALYST_BENCHMARK_IMPLEMENTATION_SHA256 as J, ANALYST_BENCHMARK_IMPLEMENTATION_DIGEST_ALGORITHM as K, DEFAULT_MAX_VERIFICATION_ARTIFACT_BYTES as L, MAX_INCORRECT_BLOCKS as M, MAX_INCORRECT_BLOCK_STEPS as N, analystInstructionsOverrideFromText as O, publicBenchmarkProtocolSha256 as P, ANALYST_BENCHMARK_LOCAL_RECEIPT_FILE as Q, appendVerificationArtifactsToOtlp as R, adaptPublicBenchmarkFindings as S, readAnalystBenchmarkArtifact as T, ANALYST_BENCHMARK_DEPENDENCY_LOCK_SHA256 as U, ANALYST_BENCHMARK_DEPENDENCY_LOCK_DIGEST_ALGORITHM as V, ANALYST_BENCHMARK_EVIDENCE_DEPENDENCY_LOCK_SHA256 as W, analystBenchmarkImplementationDigest as X, analystBenchmarkDependencyLockDigest as Y, ANALYST_BENCHMARK_COST_LEDGER_FILE as Z, publicDirectAnalystDefinition as _, primeCodeTraceAnalystDefinition as a, codeTraceBenchCase as at, analystDefinitionAsymmetries as b, preparePublicAnalystBenchmark as c, agentRxPredictionsToFindings as ct, selectPublicBenchmarkRows as d, normalizeBenchmarkLabel as dt, ANALYST_BENCHMARK_OBSERVATIONS_FILE as et, createPublicBenchmarkRlmRunner as f, createPublicBenchmarkDirectRunner as g, runReplVariableAnalystDefinition as h, primeAnalystProtocolSha256 as i, summarizeAgentRxCalibration as it, CODE_TRACE_BENCH_ANALYST_PROMPT as j, effectiveAnalystProtocolSha256 as k, publicBenchmarkDistributions as l, normalizeAgentRxCategory as lt, rlmEngineLimits as m, renderAnalystBenchmarkMarkdown as n, AGENT_RX_UPSTREAM_REVISION as nt, runInlineAnalystDefinition as o, codeTracerPredictionsToFindings as ot, publicRlmAnalystDefinition as p, ANALYST_BENCHMARK_IMPLEMENTATION_FILES as q, createPrimeBenchmarkRunner as r, renderAgentRxCalibrationMarkdown as rt, loadPublicBenchmarkRows as s, agentRxBenchmarkCase as st, runAnalystBenchmarkCommand as t, compareAnalystRunners as tt, publicBenchmarkSelectionReport as u, roundAgentRxStep as ut, runChunkedAnalystDefinition as v, expandCodeTraceFailureBlocks as w, analystDefinitionProtocolSha256 as x, AnalystExpressivenessError as y, loadCodeTraceVerificationArtifacts as z };
 
-//# sourceMappingURL=benchmark-command-CdUGku3W.js.map
+//# sourceMappingURL=benchmark-command-TZlsuAh9.js.map