@tangle-network/agent-eval 0.128.2 → 0.129.0

package/dist/chunk-UWZZKKU7.js

@@ -1,237 +0,0 @@
-// src/rollout/schema.ts
-var ROLLOUT_SCHEMA = "tangle.rollout.v1";
-var ROLLOUT_ROLES = [
-  "agent",
-  "supervisor",
-  "worker",
-  "proposer",
-  "judge",
-  "analyst"
-];
-var ROLLOUT_SPLITS = ["search", "dev", "holdout", "canary"];
-var TRAINABLE_SPLITS = ["search"];
-function isTrainableSplit(split) {
-  return TRAINABLE_SPLITS.includes(split);
-}
-var ROLLOUT_CAPTURES = ["mint", "settle-time", "backfill"];
-var CHAT_ROLES = ["system", "user", "assistant", "tool"];
-var isRecord = (v) => typeof v === "object" && v !== null && !Array.isArray(v);
-var isNumberOrNull = (v) => v === null || typeof v === "number";
-var isStringOrNull = (v) => v === null || typeof v === "string";
-var isIntegerOrNull = (v) => v === null || Number.isInteger(v);
-function validateChatMessage(value, path, errors) {
-  if (!isRecord(value)) {
-    errors.push(`${path}: not an object`);
-    return;
-  }
-  if (!CHAT_ROLES.includes(value.role))
-    errors.push(`${path}.role: invalid role ${String(value.role)}`);
-  if (!isStringOrNull(value.content)) errors.push(`${path}.content: must be string|null`);
-  if (value.reasoning_content !== void 0 && typeof value.reasoning_content !== "string") {
-    errors.push(`${path}.reasoning_content: must be string when present`);
-  }
-  if (value.tool_call_id !== void 0 && typeof value.tool_call_id !== "string") {
-    errors.push(`${path}.tool_call_id: must be string when present`);
-  }
-  if (value.role === "tool" && typeof value.tool_call_id !== "string") {
-    errors.push(`${path}.tool_call_id: required on role:"tool"`);
-  }
-  if (value.tool_calls !== void 0) {
-    if (!Array.isArray(value.tool_calls)) {
-      errors.push(`${path}.tool_calls: must be an array when present`);
-    } else {
-      value.tool_calls.forEach((call, i) => {
-        if (!isRecord(call) || typeof call.id !== "string" || call.type !== "function") {
-          errors.push(`${path}.tool_calls[${i}]: must be {id, type:"function", function}`);
-          return;
-        }
-        const fn = call.function;
-        if (!isRecord(fn) || typeof fn.name !== "string" || typeof fn.arguments !== "string") {
-          errors.push(
-            `${path}.tool_calls[${i}].function: must be {name: string, arguments: string}`
-          );
-        }
-      });
-    }
-  }
-}
-function validateSection(value, path, fields, errors) {
-  if (!isRecord(value)) {
-    errors.push(`${path}: not an object`);
-    return;
-  }
-  for (const [name, check, expect] of fields) {
-    if (!check(value[name])) errors.push(`${path}.${name}: expected ${expect}`);
-  }
-}
-function validateRolloutLine(value) {
-  const errors = [];
-  if (!isRecord(value)) return ["line: not an object"];
-  if (value.schema !== ROLLOUT_SCHEMA) errors.push(`schema: expected "${ROLLOUT_SCHEMA}"`);
-  if (typeof value.rollout_id !== "string" || value.rollout_id.length === 0)
-    errors.push("rollout_id: expected non-empty string");
-  if (!isStringOrNull(value.parent_rollout_id))
-    errors.push("parent_rollout_id: expected string|null");
-  if (typeof value.run_id !== "string" || value.run_id.length === 0)
-    errors.push("run_id: expected non-empty string");
-  if (!isStringOrNull(value.experiment_id)) errors.push("experiment_id: expected string|null");
-  if (!isStringOrNull(value.candidate_id)) errors.push("candidate_id: expected string|null");
-  if (!isIntegerOrNull(value.generation)) errors.push("generation: expected integer|null");
-  if (!isIntegerOrNull(value.candidate_index)) errors.push("candidate_index: expected integer|null");
-  if (!ROLLOUT_ROLES.includes(value.role))
-    errors.push(`role: invalid role ${String(value.role)}`);
-  validateSection(
-    value.task,
-    "task",
-    [
-      ["suite", (v) => typeof v === "string" && v.length > 0, "non-empty string"],
-      ["instance_id", (v) => typeof v === "string" && v.length > 0, "non-empty string"],
-      [
-        "split",
-        (v) => ROLLOUT_SPLITS.includes(v),
-        `one of ${ROLLOUT_SPLITS.join("|")}`
-      ],
-      ["seed", isNumberOrNull, "number|null"],
-      ["rep", (v) => Number.isInteger(v), "integer"]
-    ],
-    errors
-  );
-  validateSection(
-    value.policy,
-    "policy",
-    [
-      ["harness", isStringOrNull, "string|null"],
-      ["harness_version", isStringOrNull, "string|null"],
-      ["model", isStringOrNull, "string|null"],
-      ["provider", isStringOrNull, "string|null"],
-      ["profile_commit", isStringOrNull, "string|null"],
-      ["sampling", (v) => v === null || isRecord(v), "object|null"]
-    ],
-    errors
-  );
-  if (isRecord(value.policy)) {
-    for (const key of ["prompt_hash", "config_hash", "agent_profile_cell_id"]) {
-      if (value.policy[key] !== void 0 && !isStringOrNull(value.policy[key])) {
-        errors.push(`policy.${key}: expected string|null when present`);
-      }
-    }
-  }
-  if (!Array.isArray(value.messages)) {
-    errors.push("messages: expected array");
-  } else {
-    for (const [i, m] of value.messages.entries()) validateChatMessage(m, `messages[${i}]`, errors);
-  }
-  if (!Array.isArray(value.tool_defs)) {
-    errors.push("tool_defs: expected array");
-  } else {
-    value.tool_defs.forEach((d, i) => {
-      if (!isRecord(d) || d.type !== "function" || !isRecord(d.function) || typeof d.function.name !== "string") {
-        errors.push(`tool_defs[${i}]: must be {type:"function", function:{name}}`);
-      }
-    });
-  }
-  if (value.steps !== void 0) {
-    if (!Array.isArray(value.steps)) {
-      errors.push("steps: expected array when present");
-    } else {
-      value.steps.forEach((s, i) => {
-        if (!isRecord(s) || typeof s.kind !== "string" || typeof s.name !== "string") {
-          errors.push(`steps[${i}]: must be {kind: string, name: string, \u2026}`);
-        }
-      });
-    }
-  }
-  validateSection(
-    value.outcome,
-    "outcome",
-    [
-      ["reward", isNumberOrNull, "number|null"],
-      ["reward_source", isStringOrNull, "string|null"],
-      ["metrics", isRecord, "object"],
-      ["is_completed", (v) => typeof v === "boolean", "boolean"],
-      ["is_truncated", (v) => typeof v === "boolean", "boolean"],
-      ["error", isStringOrNull, "string|null"]
-    ],
-    errors
-  );
-  if (isRecord(value.outcome)) {
-    if (!("verdict" in value.outcome)) errors.push("outcome.verdict: field required (may be null)");
-    if (typeof value.outcome.realness_gated !== "boolean") {
-      errors.push("outcome.realness_gated: expected boolean");
-    }
-  }
-  validateSection(
-    value.cost,
-    "cost",
-    [
-      ["usd", isNumberOrNull, "number|null"],
-      ["tokens_in", isNumberOrNull, "number|null"],
-      ["tokens_out", isNumberOrNull, "number|null"],
-      ["tokens_reasoning", isNumberOrNull, "number|null"],
-      ["cache_read", isNumberOrNull, "number|null"],
-      ["cache_write", isNumberOrNull, "number|null"],
-      ["wall_s", isNumberOrNull, "number|null"]
-    ],
-    errors
-  );
-  validateSection(
-    value.artifacts,
-    "artifacts",
-    [
-      ["patch_path", isStringOrNull, "string|null"],
-      ["run_dir", isStringOrNull, "string|null"],
-      ["transcript_ref", isStringOrNull, "string|null"]
-    ],
-    errors
-  );
-  validateSection(
-    value.provenance,
-    "provenance",
-    [
-      [
-        "captured_at",
-        (v) => typeof v === "string" && !Number.isNaN(Date.parse(v)),
-        "ISO-8601 timestamp"
-      ],
-      [
-        "capture",
-        (v) => ROLLOUT_CAPTURES.includes(v),
-        `one of ${ROLLOUT_CAPTURES.join("|")}`
-      ]
-    ],
-    errors
-  );
-  if (isRecord(value.provenance) && value.provenance.gap !== void 0 && typeof value.provenance.gap !== "string") {
-    errors.push("provenance.gap: must be string when present");
-  }
-  if (Array.isArray(value.messages) && isRecord(value.provenance)) {
-    if (value.messages.length === 0 && typeof value.provenance.gap !== "string") {
-      errors.push("provenance.gap: required when messages is empty");
-    }
-  }
-  return errors;
-}
-function assertRolloutLine(value, context = "rollout line") {
-  const errors = validateRolloutLine(value);
-  if (errors.length > 0) {
-    throw new Error(`invalid ${context}:
-  ${errors.join("\n  ")}`);
-  }
-}
-function isRolloutLine(value) {
-  return validateRolloutLine(value).length === 0;
-}
-
-export {
-  ROLLOUT_SCHEMA,
-  ROLLOUT_ROLES,
-  ROLLOUT_SPLITS,
-  TRAINABLE_SPLITS,
-  isTrainableSplit,
-  ROLLOUT_CAPTURES,
-  CHAT_ROLES,
-  validateRolloutLine,
-  assertRolloutLine,
-  isRolloutLine
-};
-//# sourceMappingURL=chunk-UWZZKKU7.js.map

package/dist/chunk-UWZZKKU7.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/rollout/schema.ts"],"sourcesContent":["/**\n * `tangle.rollout.v1` — THE canonical rollout serialization, owned by\n * agent-eval. One JSONL line per agent invocation (a solo eval run, a\n * supervisor episode, a worker session, a proposer shot, a judge call, an\n * analyst pass), labeled with its task/split coordinates and a single\n * scalar reward, carrying the FULL message transcript inline.\n *\n * This schema is the reconciliation of two prior producers:\n *   - agent-eval's RunRecord-joined rollout rows (PR #410): identity,\n *     provenance hashes, the realness gate travelling into the reward,\n *     trace-derived steps.\n *   - the bench rollout-ledger (agent-runtime PR #591): the wire shape —\n *     role, task.split/rep, parent_rollout_id, policy provenance, capture\n *     provenance, inline canonical chat-with-tools messages.\n * Where the two conflicted, RunRecord-derived semantics won; the wire\n * field names follow the ledger (snake_case). See `docs/rollout.md` for\n * the field-by-field decision table.\n *\n * Messages are inlined — never referenced — because every harness store a\n * rollout can be recovered from is mutable or garbage-collected. A line\n * must stay a complete training/eval example on its own.\n *\n * `outcome.reward` is THE single scalar (null = no verdict exists — a\n * labeled gap, never 0). `outcome.realness_gated` is the anti-Goodhart\n * flag: a gated line must never export as a positive training example.\n */\n\nexport const ROLLOUT_SCHEMA = 'tangle.rollout.v1'\n\n/** `agent` = a solo evaluation run (no multi-agent topology). */\nexport type RolloutRole = 'agent' | 'supervisor' | 'worker' | 'proposer' | 'judge' | 'analyst'\nexport const ROLLOUT_ROLES: readonly RolloutRole[] = [\n  'agent',\n  'supervisor',\n  'worker',\n  'proposer',\n  'judge',\n  'analyst',\n]\n\n/** Split vocabulary follows `RunRecord.splitTag`, extended with `canary`. */\nexport type RolloutSplit = 'search' | 'dev' | 'holdout' | 'canary'\nexport const ROLLOUT_SPLITS: readonly RolloutSplit[] = ['search', 'dev', 'holdout', 'canary']\n/** Splits that may ship in training exports. Everything else is fail-closed excluded. */\nexport const TRAINABLE_SPLITS: readonly RolloutSplit[] = ['search']\n\nexport function isTrainableSplit(split: RolloutSplit): boolean {\n  return TRAINABLE_SPLITS.includes(split)\n}\n\n/** 'mint' = joined live from RunRecord + trace by `mintRolloutRows`. */\nexport type RolloutCapture = 'mint' | 'settle-time' | 'backfill'\nexport const ROLLOUT_CAPTURES: readonly RolloutCapture[] = ['mint', 'settle-time', 'backfill']\n\n// ---------------------------------------------------------------------------\n// Canonical message format — OpenAI chat-with-tools, full fidelity.\n// ---------------------------------------------------------------------------\n\nexport type ChatRole = 'system' | 'user' | 'assistant' | 'tool'\nexport const CHAT_ROLES: readonly ChatRole[] = ['system', 'user', 'assistant', 'tool']\n\nexport interface ChatToolCall {\n  id: string\n  type: 'function'\n  function: {\n    name: string\n    /** JSON-encoded argument object, exactly as the model emitted it. */\n    arguments: string\n  }\n}\n\nexport interface ChatMessage {\n  role: ChatRole\n  content: string | null\n  /** Reasoning/thinking channel where the harness captured it (full fidelity). */\n  reasoning_content?: string\n  tool_calls?: ChatToolCall[]\n  /** Required on role:\"tool\" — the ChatToolCall this result answers. */\n  tool_call_id?: string\n  name?: string\n}\n\nexport interface ToolDef {\n  type: 'function'\n  function: {\n    name: string\n    description?: string\n    parameters?: Record<string, unknown>\n  }\n}\n\n/**\n * Compact trace-span projection (llm/tool step) carried alongside the\n * conversation when the line was minted from a trace. Optional: lines\n * recovered from harness stores have no span structure.\n */\nexport interface RolloutStep {\n  kind: string\n  name: string\n  /** llm: last-message summary · tool: stringified args. Scrubbed. */\n  input?: string\n  /** llm: output text · tool: stringified result. Scrubbed. */\n  output?: string\n  status?: 'ok' | 'error'\n  durationMs?: number\n}\n\n// ---------------------------------------------------------------------------\n// Ledger line sections.\n// ---------------------------------------------------------------------------\n\nexport interface RolloutTask {\n  /** Benchmark/suite id (e.g. \"swe-bench-verified\") or the experiment id. */\n  suite: string\n  instance_id: string\n  split: RolloutSplit\n  /** Sampling seed the campaign pinned; null = not recorded. */\n  seed: number | null\n  /** Replicate index (0-based). */\n  rep: number\n}\n\nexport interface RolloutPolicy {\n  /** Harness that drove the invocation (e.g. \"opencode\", \"claude\", \"pi-loops\"). */\n  harness: string | null\n  harness_version: string | null\n  model: string | null\n  provider: string | null\n  /** Commit of the agent profile / candidate under evaluation. */\n  profile_commit: string | null\n  /** sha256 of the effective prompt (post-steering), when recorded. */\n  prompt_hash?: string | null\n  /** sha256 of the effective run config, when recorded. */\n  config_hash?: string | null\n  /** Canonical agent-profile cell identity, when the run carries one. */\n  agent_profile_cell_id?: string | null\n  /** Sampling params (temperature, top_p, max_tokens…); null = not recorded. */\n  sampling: Record<string, unknown> | null\n}\n\nexport interface RolloutOutcome {\n  /**\n   * THE single scalar training signal — the official verdict.\n   * null = no verdict exists for this invocation (a labeled gap, never 0).\n   */\n  reward: number | null\n  /** Where the reward came from (judge id; \"/inherited\" = parent episode's). */\n  reward_source: string | null\n  /** Raw judge verdict record, verbatim. */\n  verdict: unknown\n  /** Everything that is NOT the scalar reward. */\n  metrics: Record<string, unknown>\n  is_completed: boolean\n  is_truncated: boolean\n  error: string | null\n  /**\n   * Anti-Goodhart flag from `RunRecord.outcome.realness.gated`: the run\n   * faked its success signal. Reward is forced to 0 at mint time and the\n   * line never qualifies for SFT.\n   */\n  realness_gated: boolean\n}\n\nexport interface RolloutCostBlock {\n  usd: number | null\n  tokens_in: number | null\n  tokens_out: number | null\n  tokens_reasoning: number | null\n  cache_read: number | null\n  cache_write: number | null\n  wall_s: number | null\n}\n\nexport interface RolloutArtifacts {\n  patch_path: string | null\n  run_dir: string | null\n  /** Source-of-truth transcript pointer (session id / jsonl path) for audit. */\n  transcript_ref: string | null\n}\n\nexport interface RolloutProvenance {\n  captured_at: string\n  capture: RolloutCapture\n  /** Present on gap lines: why `messages` could not be recovered. */\n  gap?: string\n}\n\nexport interface RolloutLine {\n  schema: typeof ROLLOUT_SCHEMA\n  rollout_id: string\n  /** Spawning invocation within the same episode (worker → supervisor). */\n  parent_rollout_id: string | null\n  run_id: string\n  /** Logical experiment grouping from `RunRecord.experimentId`; null = not recorded. */\n  experiment_id: string | null\n  /** Stable candidate identity from `RunRecord.candidateId`; null = not recorded. */\n  candidate_id: string | null\n  /** Improvement-loop generation (-1 = baseline); null = not an improvement loop. */\n  generation: number | null\n  /** Improvement-loop candidate index (-1 = baseline); null = not an improvement loop. */\n  candidate_index: number | null\n  role: RolloutRole\n  task: RolloutTask\n  policy: RolloutPolicy\n  /** Full transcript, inline. [] = gap line (see provenance.gap). */\n  messages: ChatMessage[]\n  tool_defs: ToolDef[]\n  /** Trace-span projections, when minted from a trace. */\n  steps?: RolloutStep[]\n  outcome: RolloutOutcome\n  cost: RolloutCostBlock\n  artifacts: RolloutArtifacts\n  provenance: RolloutProvenance\n}\n\n// ---------------------------------------------------------------------------\n// Validation — pure TS, no runtime schema dependency, mirroring the\n// run-record validator's fail-loud discipline. Returns [] when the value\n// is a valid RolloutLine; otherwise one dotted-path error per defect.\n// ---------------------------------------------------------------------------\n\nconst isRecord = (v: unknown): v is Record<string, unknown> =>\n  typeof v === 'object' && v !== null && !Array.isArray(v)\n\nconst isNumberOrNull = (v: unknown): boolean => v === null || typeof v === 'number'\nconst isStringOrNull = (v: unknown): boolean => v === null || typeof v === 'string'\nconst isIntegerOrNull = (v: unknown): boolean => v === null || Number.isInteger(v)\n\nfunction validateChatMessage(value: unknown, path: string, errors: string[]): void {\n  if (!isRecord(value)) {\n    errors.push(`${path}: not an object`)\n    return\n  }\n  if (!CHAT_ROLES.includes(value.role as ChatRole))\n    errors.push(`${path}.role: invalid role ${String(value.role)}`)\n  if (!isStringOrNull(value.content)) errors.push(`${path}.content: must be string|null`)\n  if (value.reasoning_content !== undefined && typeof value.reasoning_content !== 'string') {\n    errors.push(`${path}.reasoning_content: must be string when present`)\n  }\n  if (value.tool_call_id !== undefined && typeof value.tool_call_id !== 'string') {\n    errors.push(`${path}.tool_call_id: must be string when present`)\n  }\n  if (value.role === 'tool' && typeof value.tool_call_id !== 'string') {\n    errors.push(`${path}.tool_call_id: required on role:\"tool\"`)\n  }\n  if (value.tool_calls !== undefined) {\n    if (!Array.isArray(value.tool_calls)) {\n      errors.push(`${path}.tool_calls: must be an array when present`)\n    } else {\n      value.tool_calls.forEach((call, i) => {\n        if (!isRecord(call) || typeof call.id !== 'string' || call.type !== 'function') {\n          errors.push(`${path}.tool_calls[${i}]: must be {id, type:\"function\", function}`)\n          return\n        }\n        const fn = call.function\n        if (!isRecord(fn) || typeof fn.name !== 'string' || typeof fn.arguments !== 'string') {\n          errors.push(\n            `${path}.tool_calls[${i}].function: must be {name: string, arguments: string}`,\n          )\n        }\n      })\n    }\n  }\n}\n\nfunction validateSection(\n  value: unknown,\n  path: string,\n  fields: Array<[name: string, check: (v: unknown) => boolean, expect: string]>,\n  errors: string[],\n): void {\n  if (!isRecord(value)) {\n    errors.push(`${path}: not an object`)\n    return\n  }\n  for (const [name, check, expect] of fields) {\n    if (!check(value[name])) errors.push(`${path}.${name}: expected ${expect}`)\n  }\n}\n\nexport function validateRolloutLine(value: unknown): string[] {\n  const errors: string[] = []\n  if (!isRecord(value)) return ['line: not an object']\n\n  if (value.schema !== ROLLOUT_SCHEMA) errors.push(`schema: expected \"${ROLLOUT_SCHEMA}\"`)\n  if (typeof value.rollout_id !== 'string' || value.rollout_id.length === 0)\n    errors.push('rollout_id: expected non-empty string')\n  if (!isStringOrNull(value.parent_rollout_id))\n    errors.push('parent_rollout_id: expected string|null')\n  if (typeof value.run_id !== 'string' || value.run_id.length === 0)\n    errors.push('run_id: expected non-empty string')\n  if (!isStringOrNull(value.experiment_id)) errors.push('experiment_id: expected string|null')\n  if (!isStringOrNull(value.candidate_id)) errors.push('candidate_id: expected string|null')\n  if (!isIntegerOrNull(value.generation)) errors.push('generation: expected integer|null')\n  if (!isIntegerOrNull(value.candidate_index)) errors.push('candidate_index: expected integer|null')\n  if (!ROLLOUT_ROLES.includes(value.role as RolloutRole))\n    errors.push(`role: invalid role ${String(value.role)}`)\n\n  validateSection(\n    value.task,\n    'task',\n    [\n      ['suite', (v) => typeof v === 'string' && v.length > 0, 'non-empty string'],\n      ['instance_id', (v) => typeof v === 'string' && v.length > 0, 'non-empty string'],\n      [\n        'split',\n        (v) => ROLLOUT_SPLITS.includes(v as RolloutSplit),\n        `one of ${ROLLOUT_SPLITS.join('|')}`,\n      ],\n      ['seed', isNumberOrNull, 'number|null'],\n      ['rep', (v) => Number.isInteger(v), 'integer'],\n    ],\n    errors,\n  )\n\n  validateSection(\n    value.policy,\n    'policy',\n    [\n      ['harness', isStringOrNull, 'string|null'],\n      ['harness_version', isStringOrNull, 'string|null'],\n      ['model', isStringOrNull, 'string|null'],\n      ['provider', isStringOrNull, 'string|null'],\n      ['profile_commit', isStringOrNull, 'string|null'],\n      ['sampling', (v) => v === null || isRecord(v), 'object|null'],\n    ],\n    errors,\n  )\n  if (isRecord(value.policy)) {\n    for (const key of ['prompt_hash', 'config_hash', 'agent_profile_cell_id'] as const) {\n      if (value.policy[key] !== undefined && !isStringOrNull(value.policy[key])) {\n        errors.push(`policy.${key}: expected string|null when present`)\n      }\n    }\n  }\n\n  if (!Array.isArray(value.messages)) {\n    errors.push('messages: expected array')\n  } else {\n    for (const [i, m] of value.messages.entries()) validateChatMessage(m, `messages[${i}]`, errors)\n  }\n\n  if (!Array.isArray(value.tool_defs)) {\n    errors.push('tool_defs: expected array')\n  } else {\n    value.tool_defs.forEach((d, i) => {\n      if (\n        !isRecord(d) ||\n        d.type !== 'function' ||\n        !isRecord(d.function) ||\n        typeof d.function.name !== 'string'\n      ) {\n        errors.push(`tool_defs[${i}]: must be {type:\"function\", function:{name}}`)\n      }\n    })\n  }\n\n  if (value.steps !== undefined) {\n    if (!Array.isArray(value.steps)) {\n      errors.push('steps: expected array when present')\n    } else {\n      value.steps.forEach((s, i) => {\n        if (!isRecord(s) || typeof s.kind !== 'string' || typeof s.name !== 'string') {\n          errors.push(`steps[${i}]: must be {kind: string, name: string, …}`)\n        }\n      })\n    }\n  }\n\n  validateSection(\n    value.outcome,\n    'outcome',\n    [\n      ['reward', isNumberOrNull, 'number|null'],\n      ['reward_source', isStringOrNull, 'string|null'],\n      ['metrics', isRecord, 'object'],\n      ['is_completed', (v) => typeof v === 'boolean', 'boolean'],\n      ['is_truncated', (v) => typeof v === 'boolean', 'boolean'],\n      ['error', isStringOrNull, 'string|null'],\n    ],\n    errors,\n  )\n  if (isRecord(value.outcome)) {\n    if (!('verdict' in value.outcome)) errors.push('outcome.verdict: field required (may be null)')\n    if (typeof value.outcome.realness_gated !== 'boolean') {\n      errors.push('outcome.realness_gated: expected boolean')\n    }\n  }\n\n  validateSection(\n    value.cost,\n    'cost',\n    [\n      ['usd', isNumberOrNull, 'number|null'],\n      ['tokens_in', isNumberOrNull, 'number|null'],\n      ['tokens_out', isNumberOrNull, 'number|null'],\n      ['tokens_reasoning', isNumberOrNull, 'number|null'],\n      ['cache_read', isNumberOrNull, 'number|null'],\n      ['cache_write', isNumberOrNull, 'number|null'],\n      ['wall_s', isNumberOrNull, 'number|null'],\n    ],\n    errors,\n  )\n\n  validateSection(\n    value.artifacts,\n    'artifacts',\n    [\n      ['patch_path', isStringOrNull, 'string|null'],\n      ['run_dir', isStringOrNull, 'string|null'],\n      ['transcript_ref', isStringOrNull, 'string|null'],\n    ],\n    errors,\n  )\n\n  validateSection(\n    value.provenance,\n    'provenance',\n    [\n      [\n        'captured_at',\n        (v) => typeof v === 'string' && !Number.isNaN(Date.parse(v)),\n        'ISO-8601 timestamp',\n      ],\n      [\n        'capture',\n        (v) => ROLLOUT_CAPTURES.includes(v as RolloutCapture),\n        `one of ${ROLLOUT_CAPTURES.join('|')}`,\n      ],\n    ],\n    errors,\n  )\n  if (\n    isRecord(value.provenance) &&\n    value.provenance.gap !== undefined &&\n    typeof value.provenance.gap !== 'string'\n  ) {\n    errors.push('provenance.gap: must be string when present')\n  }\n\n  // A gap line must say WHY it is a gap; a full line must not carry a gap note.\n  if (Array.isArray(value.messages) && isRecord(value.provenance)) {\n    if (value.messages.length === 0 && typeof value.provenance.gap !== 'string') {\n      errors.push('provenance.gap: required when messages is empty')\n    }\n  }\n\n  return errors\n}\n\nexport function assertRolloutLine(\n  value: unknown,\n  context = 'rollout line',\n): asserts value is RolloutLine {\n  const errors = validateRolloutLine(value)\n  if (errors.length > 0) {\n    throw new Error(`invalid ${context}:\\n  ${errors.join('\\n  ')}`)\n  }\n}\n\nexport function isRolloutLine(value: unknown): value is RolloutLine {\n  return validateRolloutLine(value).length === 0\n}\n"],"mappings":";AA2BO,IAAM,iBAAiB;AAIvB,IAAM,gBAAwC;AAAA,EACnD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAIO,IAAM,iBAA0C,CAAC,UAAU,OAAO,WAAW,QAAQ;AAErF,IAAM,mBAA4C,CAAC,QAAQ;AAE3D,SAAS,iBAAiB,OAA8B;AAC7D,SAAO,iBAAiB,SAAS,KAAK;AACxC;AAIO,IAAM,mBAA8C,CAAC,QAAQ,eAAe,UAAU;AAOtF,IAAM,aAAkC,CAAC,UAAU,QAAQ,aAAa,MAAM;AAkKrF,IAAM,WAAW,CAAC,MAChB,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAEzD,IAAM,iBAAiB,CAAC,MAAwB,MAAM,QAAQ,OAAO,MAAM;AAC3E,IAAM,iBAAiB,CAAC,MAAwB,MAAM,QAAQ,OAAO,MAAM;AAC3E,IAAM,kBAAkB,CAAC,MAAwB,MAAM,QAAQ,OAAO,UAAU,CAAC;AAEjF,SAAS,oBAAoB,OAAgB,MAAc,QAAwB;AACjF,MAAI,CAAC,SAAS,KAAK,GAAG;AACpB,WAAO,KAAK,GAAG,IAAI,iBAAiB;AACpC;AAAA,EACF;AACA,MAAI,CAAC,WAAW,SAAS,MAAM,IAAgB;AAC7C,WAAO,KAAK,GAAG,IAAI,uBAAuB,OAAO,MAAM,IAAI,CAAC,EAAE;AAChE,MAAI,CAAC,eAAe,MAAM,OAAO,EAAG,QAAO,KAAK,GAAG,IAAI,+BAA+B;AACtF,MAAI,MAAM,sBAAsB,UAAa,OAAO,MAAM,sBAAsB,UAAU;AACxF,WAAO,KAAK,GAAG,IAAI,iDAAiD;AAAA,EACtE;AACA,MAAI,MAAM,iBAAiB,UAAa,OAAO,MAAM,iBAAiB,UAAU;AAC9E,WAAO,KAAK,GAAG,IAAI,4CAA4C;AAAA,EACjE;AACA,MAAI,MAAM,SAAS,UAAU,OAAO,MAAM,iBAAiB,UAAU;AACnE,WAAO,KAAK,GAAG,IAAI,wCAAwC;AAAA,EAC7D;AACA,MAAI,MAAM,eAAe,QAAW;AAClC,QAAI,CAAC,MAAM,QAAQ,MAAM,UAAU,GAAG;AACpC,aAAO,KAAK,GAAG,IAAI,4CAA4C;AAAA,IACjE,OAAO;AACL,YAAM,WAAW,QAAQ,CAAC,MAAM,MAAM;AACpC,YAAI,CAAC,SAAS,IAAI,KAAK,OAAO,KAAK,OAAO,YAAY,KAAK,SAAS,YAAY;AAC9E,iBAAO,KAAK,GAAG,IAAI,eAAe,CAAC,4CAA4C;AAC/E;AAAA,QACF;AACA,cAAM,KAAK,KAAK;AAChB,YAAI,CAAC,SAAS,EAAE,KAAK,OAAO,GAAG,SAAS,YAAY,OAAO,GAAG,cAAc,UAAU;AACpF,iBAAO;AAAA,YACL,GAAG,IAAI,eAAe,CAAC;AAAA,UACzB;AAAA,QACF;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAEA,SAAS,gBACP,OACA,MACA,QACA,QACM;AACN,MAAI,CAAC,SAAS,KAAK,GAAG;AACpB,WAAO,KAAK,GAAG,IAAI,iBAAiB;AACpC;AAAA,EACF;AACA,aAAW,CAAC,MAAM,OAAO,MAAM,KAAK,QAAQ;AAC1C,QAAI,CAAC,MAAM,MAAM,IAAI,CAAC,EAAG,QAAO,KAAK,GAAG,IAAI,IAAI,IAAI,cAAc,MAAM,EAAE;AAAA,EAC5E;AACF;AAEO,SAAS,oBAAoB,OAA0B;AAC5D,QAAM,SAAmB,CAAC;AAC1B,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO,CAAC,qBAAqB;AAEnD,MAAI,MAAM,WAAW,eAAgB,QAAO,KAAK,qBAAqB,cAAc,GAAG;AACvF,MAAI,OAAO,MAAM,eAAe,YAAY,MAAM,WAAW,WAAW;AACtE,WAAO,KAAK,uCAAuC;AACrD,MAAI,CAAC,eAAe,MAAM,iBAAiB;AACzC,WAAO,KAAK,yCAAyC;AACvD,MAAI,OAAO,MAAM,WAAW,YAAY,MAAM,OAAO,WAAW;AAC9D,WAAO,KAAK,mCAAmC;AACjD,MAAI,CAAC,eAAe,MAAM,aAAa,EAAG,QAAO,KAAK,qCAAqC;AAC3F,MAAI,CAAC,eAAe,MAAM,YAAY,EAAG,QAAO,KAAK,oCAAoC;AACzF,MAAI,CAAC,gBAAgB,MAAM,UAAU,EAAG,QAAO,KAAK,mCAAmC;AACvF,MAAI,CAAC,gBAAgB,MAAM,eAAe,EAAG,QAAO,KAAK,wCAAwC;AACjG,MAAI,CAAC,cAAc,SAAS,MAAM,IAAmB;AACnD,WAAO,KAAK,sBAAsB,OAAO,MAAM,IAAI,CAAC,EAAE;AAExD;AAAA,IACE,MAAM;AAAA,IACN;AAAA,IACA;AAAA,MACE,CAAC,SAAS,CAAC,MAAM,OAAO,MAAM,YAAY,EAAE,SAAS,GAAG,kBAAkB;AAAA,MAC1E,CAAC,eAAe,CAAC,MAAM,OAAO,MAAM,YAAY,EAAE,SAAS,GAAG,kBAAkB;AAAA,MAChF;AAAA,QACE;AAAA,QACA,CAAC,MAAM,eAAe,SAAS,CAAiB;AAAA,QAChD,UAAU,eAAe,KAAK,GAAG,CAAC;AAAA,MACpC;AAAA,MACA,CAAC,QAAQ,gBAAgB,aAAa;AAAA,MACtC,CAAC,OAAO,CAAC,MAAM,OAAO,UAAU,CAAC,GAAG,SAAS;AAAA,IAC/C;AAAA,IACA;AAAA,EACF;AAEA;AAAA,IACE,MAAM;AAAA,IACN;AAAA,IACA;AAAA,MACE,CAAC,WAAW,gBAAgB,aAAa;AAAA,MACzC,CAAC,mBAAmB,gBAAgB,aAAa;AAAA,MACjD,CAAC,SAAS,gBAAgB,aAAa;AAAA,MACvC,CAAC,YAAY,gBAAgB,aAAa;AAAA,MAC1C,CAAC,kBAAkB,gBAAgB,aAAa;AAAA,MAChD,CAAC,YAAY,CAAC,MAAM,MAAM,QAAQ,SAAS,CAAC,GAAG,aAAa;AAAA,IAC9D;AAAA,IACA;AAAA,EACF;AACA,MAAI,SAAS,MAAM,MAAM,GAAG;AAC1B,eAAW,OAAO,CAAC,eAAe,eAAe,uBAAuB,GAAY;AAClF,UAAI,MAAM,OAAO,GAAG,MAAM,UAAa,CAAC,eAAe,MAAM,OAAO,GAAG,CAAC,GAAG;AACzE,eAAO,KAAK,UAAU,GAAG,qCAAqC;AAAA,MAChE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,MAAM,QAAQ,MAAM,QAAQ,GAAG;AAClC,WAAO,KAAK,0BAA0B;AAAA,EACxC,OAAO;AACL,eAAW,CAAC,GAAG,CAAC,KAAK,MAAM,SAAS,QAAQ,EAAG,qBAAoB,GAAG,YAAY,CAAC,KAAK,MAAM;AAAA,EAChG;AAEA,MAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,GAAG;AACnC,WAAO,KAAK,2BAA2B;AAAA,EACzC,OAAO;AACL,UAAM,UAAU,QAAQ,CAAC,GAAG,MAAM;AAChC,UACE,CAAC,SAAS,CAAC,KACX,EAAE,SAAS,cACX,CAAC,SAAS,EAAE,QAAQ,KACpB,OAAO,EAAE,SAAS,SAAS,UAC3B;AACA,eAAO,KAAK,aAAa,CAAC,+CAA+C;AAAA,MAC3E;AAAA,IACF,CAAC;AAAA,EACH;AAEA,MAAI,MAAM,UAAU,QAAW;AAC7B,QAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,GAAG;AAC/B,aAAO,KAAK,oCAAoC;AAAA,IAClD,OAAO;AACL,YAAM,MAAM,QAAQ,CAAC,GAAG,MAAM;AAC5B,YAAI,CAAC,SAAS,CAAC,KAAK,OAAO,EAAE,SAAS,YAAY,OAAO,EAAE,SAAS,UAAU;AAC5E,iBAAO,KAAK,SAAS,CAAC,iDAA4C;AAAA,QACpE;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA;AAAA,IACE,MAAM;AAAA,IACN;AAAA,IACA;AAAA,MACE,CAAC,UAAU,gBAAgB,aAAa;AAAA,MACxC,CAAC,iBAAiB,gBAAgB,aAAa;AAAA,MAC/C,CAAC,WAAW,UAAU,QAAQ;AAAA,MAC9B,CAAC,gBAAgB,CAAC,MAAM,OAAO,MAAM,WAAW,SAAS;AAAA,MACzD,CAAC,gBAAgB,CAAC,MAAM,OAAO,MAAM,WAAW,SAAS;AAAA,MACzD,CAAC,SAAS,gBAAgB,aAAa;AAAA,IACzC;AAAA,IACA;AAAA,EACF;AACA,MAAI,SAAS,MAAM,OAAO,GAAG;AAC3B,QAAI,EAAE,aAAa,MAAM,SAAU,QAAO,KAAK,+CAA+C;AAC9F,QAAI,OAAO,MAAM,QAAQ,mBAAmB,WAAW;AACrD,aAAO,KAAK,0CAA0C;AAAA,IACxD;AAAA,EACF;AAEA;AAAA,IACE,MAAM;AAAA,IACN;AAAA,IACA;AAAA,MACE,CAAC,OAAO,gBAAgB,aAAa;AAAA,MACrC,CAAC,aAAa,gBAAgB,aAAa;AAAA,MAC3C,CAAC,cAAc,gBAAgB,aAAa;AAAA,MAC5C,CAAC,oBAAoB,gBAAgB,aAAa;AAAA,MAClD,CAAC,cAAc,gBAAgB,aAAa;AAAA,MAC5C,CAAC,eAAe,gBAAgB,aAAa;AAAA,MAC7C,CAAC,UAAU,gBAAgB,aAAa;AAAA,IAC1C;AAAA,IACA;AAAA,EACF;AAEA;AAAA,IACE,MAAM;AAAA,IACN;AAAA,IACA;AAAA,MACE,CAAC,cAAc,gBAAgB,aAAa;AAAA,MAC5C,CAAC,WAAW,gBAAgB,aAAa;AAAA,MACzC,CAAC,kBAAkB,gBAAgB,aAAa;AAAA,IAClD;AAAA,IACA;AAAA,EACF;AAEA;AAAA,IACE,MAAM;AAAA,IACN;AAAA,IACA;AAAA,MACE;AAAA,QACE;AAAA,QACA,CAAC,MAAM,OAAO,MAAM,YAAY,CAAC,OAAO,MAAM,KAAK,MAAM,CAAC,CAAC;AAAA,QAC3D;AAAA,MACF;AAAA,MACA;AAAA,QACE;AAAA,QACA,CAAC,MAAM,iBAAiB,SAAS,CAAmB;AAAA,QACpD,UAAU,iBAAiB,KAAK,GAAG,CAAC;AAAA,MACtC;AAAA,IACF;AAAA,IACA;AAAA,EACF;AACA,MACE,SAAS,MAAM,UAAU,KACzB,MAAM,WAAW,QAAQ,UACzB,OAAO,MAAM,WAAW,QAAQ,UAChC;AACA,WAAO,KAAK,6CAA6C;AAAA,EAC3D;AAGA,MAAI,MAAM,QAAQ,MAAM,QAAQ,KAAK,SAAS,MAAM,UAAU,GAAG;AAC/D,QAAI,MAAM,SAAS,WAAW,KAAK,OAAO,MAAM,WAAW,QAAQ,UAAU;AAC3E,aAAO,KAAK,iDAAiD;AAAA,IAC/D;AAAA,EACF;AAEA,SAAO;AACT;AAEO,SAAS,kBACd,OACA,UAAU,gBACoB;AAC9B,QAAM,SAAS,oBAAoB,KAAK;AACxC,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,IAAI,MAAM,WAAW,OAAO;AAAA,IAAQ,OAAO,KAAK,MAAM,CAAC,EAAE;AAAA,EACjE;AACF;AAEO,SAAS,cAAc,OAAsC;AAClE,SAAO,oBAAoB,KAAK,EAAE,WAAW;AAC/C;","names":[]}

package/dist/chunk-VBQ3CRKH.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/rollout/readers/claude-jsonl.ts","../src/rollout/readers/opencode-sqlite.ts"],"sourcesContent":["/**\n * Backfill reader over Claude Code project transcripts\n * (~/.claude/projects/<cwd-slug>/<sessionId>.jsonl) → canonical\n * chat-with-tools messages plus per-session token usage.\n *\n * Transcript lines consumed: type:\"user\" (string content or content blocks —\n * text + tool_result) and type:\"assistant\" (content blocks — thinking, text,\n * tool_use; message.usage carries tokens). Sidechain lines (isSidechain=true,\n * subagent threads) are separate invocations and are excluded from the main\n * transcript. Everything else (queue-operation, attachment, last-prompt…) is\n * transport metadata, not conversation.\n */\n\nimport { readdir, readFile } from 'node:fs/promises'\nimport { homedir } from 'node:os'\nimport { join } from 'node:path'\nimport type { ChatMessage, ChatToolCall } from '../schema'\n\nexport const DEFAULT_CLAUDE_PROJECTS_DIR = join(homedir(), '.claude', 'projects')\n\n/** Claude Code's project-directory slug for a working directory. */\nexport function claudeProjectSlug(cwd: string): string {\n  return cwd.replace(/[^a-zA-Z0-9-]/g, '-')\n}\n\nexport interface ClaudeTranscriptRef {\n  sessionId: string\n  path: string\n}\n\n/** Transcript files recorded for sessions launched from `cwd`. */\nexport async function findClaudeTranscripts(\n  cwd: string,\n  projectsDir: string = DEFAULT_CLAUDE_PROJECTS_DIR,\n): Promise<ClaudeTranscriptRef[]> {\n  const dir = join(projectsDir, claudeProjectSlug(cwd))\n  const names = await readdir(dir).catch(() => [])\n  return names\n    .filter((n) => n.endsWith('.jsonl'))\n    .sort()\n    .map((n) => ({ sessionId: n.replace(/\\.jsonl$/, ''), path: join(dir, n) }))\n}\n\nexport interface ClaudeUsageTotals {\n  tokensIn: number\n  tokensOut: number\n  cacheRead: number\n  cacheWrite: number\n}\n\nexport interface ClaudeTranscript {\n  messages: ChatMessage[]\n  usage: ClaudeUsageTotals\n  /** Timestamp of the first conversation line; null = empty transcript. */\n  startedAt: string | null\n  endedAt: string | null\n  model: string | null\n}\n\nconst isRecord = (v: unknown): v is Record<string, unknown> =>\n  typeof v === 'object' && v !== null && !Array.isArray(v)\n\n/**\n * One conversation line of a transcript, still in Claude Code's own shape.\n *\n * This is the single line-level parse of the format. `readClaudeTranscript`\n * projects it to canonical messages + usage; the supervision-tree reader\n * (`src/supervisor-run/claude-code-reader.ts`) projects the SAME entries to\n * spawn/settle/steer instants. Two projections, one parser — a second\n * transcript parser is how the two views silently disagree.\n */\nexport interface ClaudeEntry {\n  readonly type: 'user' | 'assistant'\n  /** ISO instant of the line; null when the line carried none. */\n  readonly timestamp: string | null\n  /** The Anthropic message body (`role`, `content`, `model`, `usage`). */\n  readonly message: Record<string, unknown>\n  /** Claude Code's structured tool result, when the line carries one. */\n  readonly toolUseResult: unknown\n  /** True on subagent threads — a separate invocation, not this transcript's turn. */\n  readonly isSidechain: boolean\n  /** Subagent id Claude Code stamps on sidechain lines; null on main-thread lines. */\n  readonly agentId: string | null\n}\n\n/** Parse transcript jsonl text into conversation lines. Non-conversation lines are dropped. */\nexport function parseClaudeEntries(raw: string): ClaudeEntry[] {\n  const out: ClaudeEntry[] = []\n  for (const line of raw.split('\\n')) {\n    if (!line.trim()) continue\n    let entry: Record<string, unknown>\n    try {\n      const parsed: unknown = JSON.parse(line)\n      if (!isRecord(parsed)) continue\n      entry = parsed\n    } catch {\n      continue\n    }\n    if (entry.type !== 'user' && entry.type !== 'assistant') continue\n    const message = entry.message\n    if (!isRecord(message)) continue\n    out.push({\n      type: entry.type,\n      timestamp: typeof entry.timestamp === 'string' ? entry.timestamp : null,\n      message,\n      toolUseResult: entry.toolUseResult,\n      isSidechain: entry.isSidechain === true,\n      agentId: typeof entry.agentId === 'string' ? entry.agentId : null,\n    })\n  }\n  return out\n}\n\nexport interface ReadClaudeTranscriptOptions {\n  /**\n   * Read the sidechain (subagent) thread instead of skipping it. Subagent\n   * transcripts under `<session>/subagents/agent-<id>.jsonl` are sidechain\n   * lines end to end, so their usage is invisible without this.\n   */\n  readonly includeSidechain?: boolean\n}\n\nfunction blockText(content: unknown): string {\n  if (typeof content === 'string') return content\n  if (!Array.isArray(content)) return ''\n  return content\n    .filter(\n      (b): b is Record<string, unknown> =>\n        isRecord(b) && b.type === 'text' && typeof b.text === 'string',\n    )\n    .map((b) => b.text as string)\n    .join('\\n')\n}\n\n/** Parse one transcript jsonl into canonical messages + usage totals. */\nexport async function readClaudeTranscript(\n  path: string,\n  options: ReadClaudeTranscriptOptions = {},\n): Promise<ClaudeTranscript> {\n  return transcriptFromEntries(parseClaudeEntries(await readFile(path, 'utf8')), options)\n}\n\n/** The messages+usage projection of already-parsed entries. */\nexport function transcriptFromEntries(\n  entries: readonly ClaudeEntry[],\n  options: ReadClaudeTranscriptOptions = {},\n): ClaudeTranscript {\n  const wantSidechain = options.includeSidechain === true\n  const messages: ChatMessage[] = []\n  const usage: ClaudeUsageTotals = { tokensIn: 0, tokensOut: 0, cacheRead: 0, cacheWrite: 0 }\n  let startedAt: string | null = null\n  let endedAt: string | null = null\n  let model: string | null = null\n  // Claude Code writes one jsonl line PER CONTENT BLOCK of an API message,\n  // repeating message.id and usage on each — merge blocks into one canonical\n  // assistant turn and count usage once per API message id.\n  let lastAssistantApiId: string | null = null\n  let lastAssistantIndex = -1\n\n  for (const entry of entries) {\n    if (entry.isSidechain !== wantSidechain) continue\n    const message = entry.message\n    if (entry.timestamp !== null) {\n      if (startedAt === null) startedAt = entry.timestamp\n      endedAt = entry.timestamp\n    }\n\n    if (entry.type === 'user') {\n      lastAssistantApiId = null\n      lastAssistantIndex = -1\n      const content = message.content\n      if (typeof content === 'string') {\n        messages.push({ role: 'user', content })\n        continue\n      }\n      if (!Array.isArray(content)) continue\n      // A user line may interleave tool_result blocks (answers to the prior\n      // assistant tool_use) with plain text; preserve order.\n      let userText = ''\n      for (const block of content) {\n        if (!isRecord(block)) continue\n        if (block.type === 'tool_result' && typeof block.tool_use_id === 'string') {\n          messages.push({\n            role: 'tool',\n            tool_call_id: block.tool_use_id,\n            content:\n              blockText(block.content) || (typeof block.content === 'string' ? block.content : ''),\n          })\n        } else if (block.type === 'text' && typeof block.text === 'string') {\n          userText += (userText.length > 0 ? '\\n' : '') + block.text\n        }\n      }\n      if (userText.length > 0) messages.push({ role: 'user', content: userText })\n      continue\n    }\n\n    // assistant\n    if (typeof message.model === 'string') model = message.model\n    const apiId = typeof message.id === 'string' ? message.id : null\n    const continuesTurn = apiId !== null && apiId === lastAssistantApiId && lastAssistantIndex >= 0\n    const msgUsage = message.usage\n    if (isRecord(msgUsage) && !continuesTurn) {\n      usage.tokensIn += typeof msgUsage.input_tokens === 'number' ? msgUsage.input_tokens : 0\n      usage.tokensOut += typeof msgUsage.output_tokens === 'number' ? msgUsage.output_tokens : 0\n      usage.cacheRead +=\n        typeof msgUsage.cache_read_input_tokens === 'number' ? msgUsage.cache_read_input_tokens : 0\n      usage.cacheWrite +=\n        typeof msgUsage.cache_creation_input_tokens === 'number'\n          ? msgUsage.cache_creation_input_tokens\n          : 0\n    }\n    const content = message.content\n    if (!Array.isArray(content)) continue\n    let reasoning = ''\n    let text = ''\n    const toolCalls: ChatToolCall[] = []\n    for (const block of content) {\n      if (!isRecord(block)) continue\n      if (\n        block.type === 'thinking' &&\n        typeof block.thinking === 'string' &&\n        block.thinking.length > 0\n      ) {\n        reasoning += (reasoning.length > 0 ? '\\n' : '') + block.thinking\n      } else if (block.type === 'text' && typeof block.text === 'string') {\n        text += (text.length > 0 ? '\\n' : '') + block.text\n      } else if (block.type === 'tool_use' && typeof block.id === 'string') {\n        toolCalls.push({\n          id: block.id,\n          type: 'function',\n          function: {\n            name: typeof block.name === 'string' ? block.name : 'unknown',\n            arguments: JSON.stringify(block.input ?? {}),\n          },\n        })\n      }\n    }\n    if (reasoning.length === 0 && text.length === 0 && toolCalls.length === 0) continue\n    if (continuesTurn) {\n      const prev = messages[lastAssistantIndex]!\n      if (text.length > 0) prev.content = prev.content === null ? text : `${prev.content}\\n${text}`\n      if (reasoning.length > 0) {\n        prev.reasoning_content =\n          prev.reasoning_content === undefined\n            ? reasoning\n            : `${prev.reasoning_content}\\n${reasoning}`\n      }\n      if (toolCalls.length > 0) prev.tool_calls = [...(prev.tool_calls ?? []), ...toolCalls]\n      continue\n    }\n    messages.push({\n      role: 'assistant',\n      content: text.length > 0 ? text : null,\n      ...(reasoning.length > 0 ? { reasoning_content: reasoning } : {}),\n      ...(toolCalls.length > 0 ? { tool_calls: toolCalls } : {}),\n    })\n    lastAssistantApiId = apiId\n    lastAssistantIndex = messages.length - 1\n  }\n\n  return { messages, usage, startedAt, endedAt, model }\n}\n","/**\n * Read-only backfill reader over the opencode sqlite store\n * (~/.local/share/opencode/opencode.db) → canonical chat-with-tools messages.\n *\n * Schema consumed (observed, 2026-07): `session` rows carry directory /\n * parent_id / agent / model / cost / tokens_*; `message` rows carry a JSON\n * `data` blob ({role, modelID, providerID, tokens, cost, finish}); `part`\n * rows carry the actual content ({type: text|reasoning|tool|step-start|\n * step-finish|snapshot…}). Tool parts hold {callID, state:{input, output,\n * status}} — both the call and its result, which we split into an assistant\n * tool_call plus a role:\"tool\" result message.\n *\n * The store is mutable and can be corrupt (a `.corrupt-bak` sibling ships\n * next to it in the wild), so `openOpencodeDb` returns null instead of\n * throwing — callers record a gap line, never crash the backfill.\n */\n\nimport { homedir } from 'node:os'\nimport { join } from 'node:path'\nimport type { DatabaseSync } from 'node:sqlite'\nimport type { ChatMessage, ChatToolCall } from '../schema'\n\nexport const DEFAULT_OPENCODE_DB = join(homedir(), '.local', 'share', 'opencode', 'opencode.db')\n\nexport interface OpencodeSessionRow {\n  id: string\n  parentId: string | null\n  directory: string\n  agent: string | null\n  /** Raw session.model JSON: {id, providerID, variant} where present. */\n  model: { id?: string; providerID?: string } | null\n  costUsd: number\n  tokensInput: number\n  tokensOutput: number\n  tokensReasoning: number\n  tokensCacheRead: number\n  tokensCacheWrite: number\n  timeCreated: number\n  timeUpdated: number\n}\n\n// Opaque specifier: esbuild (bundling) and Vite (tests) both rewrite an\n// analyzable dynamic import and strip the `node:` prefix under an es20xx\n// target, which turns this builtin into a bogus \"sqlite\" package lookup.\n// Composing the string at runtime defeats that analysis in both.\nconst NODE_SQLITE_SPECIFIER = ['node', 'sqlite'].join(':')\n\n/** Open the store read-only; null = unavailable/corrupt (caller records a gap). */\nexport async function openOpencodeDb(\n  path: string = DEFAULT_OPENCODE_DB,\n): Promise<DatabaseSync | null> {\n  try {\n    const { DatabaseSync } = (await import(\n      /* @vite-ignore */ NODE_SQLITE_SPECIFIER\n    )) as typeof import('node:sqlite')\n    const db = new DatabaseSync(path, { readOnly: true })\n    // Probe: a corrupt store can open() fine and fail on first page read.\n    db.prepare('SELECT id FROM session LIMIT 1').get()\n    return db\n  } catch {\n    return null\n  }\n}\n\nconst isRecord = (v: unknown): v is Record<string, unknown> =>\n  typeof v === 'object' && v !== null && !Array.isArray(v)\n\nfunction parseSessionRow(row: Record<string, unknown>): OpencodeSessionRow {\n  let model: OpencodeSessionRow['model'] = null\n  if (typeof row.model === 'string' && row.model.length > 0) {\n    try {\n      const parsed: unknown = JSON.parse(row.model)\n      if (isRecord(parsed)) model = parsed as { id?: string; providerID?: string }\n    } catch {\n      model = null\n    }\n  }\n  return {\n    id: String(row.id),\n    parentId: row.parent_id === null || row.parent_id === undefined ? null : String(row.parent_id),\n    directory: String(row.directory),\n    agent: row.agent === null || row.agent === undefined ? null : String(row.agent),\n    model,\n    costUsd: Number(row.cost ?? 0),\n    tokensInput: Number(row.tokens_input ?? 0),\n    tokensOutput: Number(row.tokens_output ?? 0),\n    tokensReasoning: Number(row.tokens_reasoning ?? 0),\n    tokensCacheRead: Number(row.tokens_cache_read ?? 0),\n    tokensCacheWrite: Number(row.tokens_cache_write ?? 0),\n    timeCreated: Number(row.time_created ?? 0),\n    timeUpdated: Number(row.time_updated ?? 0),\n  }\n}\n\nconst SESSION_COLUMNS =\n  'id, parent_id, directory, agent, model, cost, tokens_input, tokens_output, tokens_reasoning, tokens_cache_read, tokens_cache_write, time_created, time_updated'\n\n/** Sessions whose cwd is `directory` (the worker-clone join key). */\nexport function findOpencodeSessionsByDirectory(\n  db: DatabaseSync,\n  directory: string,\n): OpencodeSessionRow[] {\n  const rows = db\n    .prepare(`SELECT ${SESSION_COLUMNS} FROM session WHERE directory = ? ORDER BY time_created`)\n    .all(directory) as Array<Record<string, unknown>>\n  return rows.map(parseSessionRow)\n}\n\nexport function findOpencodeSessionById(\n  db: DatabaseSync,\n  sessionId: string,\n): OpencodeSessionRow | null {\n  const row = db.prepare(`SELECT ${SESSION_COLUMNS} FROM session WHERE id = ?`).get(sessionId) as\n    | Record<string, unknown>\n    | undefined\n  return row === undefined ? null : parseSessionRow(row)\n}\n\ninterface OpencodePart {\n  type?: string\n  text?: string\n  tool?: string\n  callID?: string\n  state?: { status?: string; input?: unknown; output?: unknown }\n}\n\nfunction toolResultContent(output: unknown): string {\n  if (typeof output === 'string') return output\n  if (output === null || output === undefined) return ''\n  return JSON.stringify(output)\n}\n\n/**\n * Convert one session's message+part rows into canonical messages.\n * An opencode assistant message row spans several model steps; each step's\n * parts (reasoning → text → tool …) become one assistant message followed by\n * the role:\"tool\" results of its calls, preserving order.\n */\nexport function readOpencodeSessionMessages(db: DatabaseSync, sessionId: string): ChatMessage[] {\n  const messageRows = db\n    .prepare('SELECT id, data FROM message WHERE session_id = ? ORDER BY time_created, id')\n    .all(sessionId) as Array<{ id: string; data: string }>\n  const partsStmt = db.prepare('SELECT data FROM part WHERE message_id = ? ORDER BY id')\n\n  const messages: ChatMessage[] = []\n  for (const messageRow of messageRows) {\n    let data: Record<string, unknown>\n    try {\n      const parsed: unknown = JSON.parse(messageRow.data)\n      if (!isRecord(parsed)) continue\n      data = parsed\n    } catch {\n      continue\n    }\n    const parts: OpencodePart[] = []\n    for (const row of partsStmt.all(messageRow.id) as Array<{ data: string }>) {\n      try {\n        const parsed: unknown = JSON.parse(row.data)\n        if (isRecord(parsed)) parts.push(parsed as OpencodePart)\n      } catch {\n        // Malformed part payload: skip the part, keep the message.\n      }\n    }\n\n    if (data.role === 'user') {\n      const text = parts\n        .filter((p) => p.type === 'text' && typeof p.text === 'string')\n        .map((p) => p.text as string)\n        .join('\\n')\n      messages.push({ role: 'user', content: text })\n      continue\n    }\n    if (data.role !== 'assistant') continue\n\n    // Split the row into steps at step-start boundaries; parts before the\n    // first step-start (none observed, but tolerated) form an implicit step.\n    const steps: OpencodePart[][] = []\n    let current: OpencodePart[] = []\n    for (const part of parts) {\n      if (part.type === 'step-start') {\n        if (current.length > 0) steps.push(current)\n        current = []\n        continue\n      }\n      if (part.type === 'step-finish' || part.type === 'snapshot' || part.type === 'patch') continue\n      current.push(part)\n    }\n    if (current.length > 0) steps.push(current)\n\n    for (const step of steps) {\n      const reasoning = step\n        .filter((p) => p.type === 'reasoning' && typeof p.text === 'string' && p.text.length > 0)\n        .map((p) => p.text as string)\n        .join('\\n')\n      const text = step\n        .filter((p) => p.type === 'text' && typeof p.text === 'string')\n        .map((p) => p.text as string)\n        .join('\\n')\n      const toolParts = step.filter((p) => p.type === 'tool' && typeof p.callID === 'string')\n      const toolCalls: ChatToolCall[] = toolParts.map((p) => ({\n        id: p.callID as string,\n        type: 'function',\n        function: {\n          name: p.tool ?? 'unknown',\n          arguments: JSON.stringify(p.state?.input ?? {}),\n        },\n      }))\n      if (reasoning.length === 0 && text.length === 0 && toolCalls.length === 0) continue\n      messages.push({\n        role: 'assistant',\n        content: text.length > 0 ? text : null,\n        ...(reasoning.length > 0 ? { reasoning_content: reasoning } : {}),\n        ...(toolCalls.length > 0 ? { tool_calls: toolCalls } : {}),\n      })\n      for (const p of toolParts) {\n        messages.push({\n          role: 'tool',\n          tool_call_id: p.callID as string,\n          name: p.tool ?? 'unknown',\n          content: toolResultContent(p.state?.output),\n        })\n      }\n    }\n  }\n  return messages\n}\n"],"mappings":";AAaA,SAAS,SAAS,gBAAgB;AAClC,SAAS,eAAe;AACxB,SAAS,YAAY;AAGd,IAAM,8BAA8B,KAAK,QAAQ,GAAG,WAAW,UAAU;AAGzE,SAAS,kBAAkB,KAAqB;AACrD,SAAO,IAAI,QAAQ,kBAAkB,GAAG;AAC1C;AAQA,eAAsB,sBACpB,KACA,cAAsB,6BACU;AAChC,QAAM,MAAM,KAAK,aAAa,kBAAkB,GAAG,CAAC;AACpD,QAAM,QAAQ,MAAM,QAAQ,GAAG,EAAE,MAAM,MAAM,CAAC,CAAC;AAC/C,SAAO,MACJ,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,CAAC,EAClC,KAAK,EACL,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,QAAQ,YAAY,EAAE,GAAG,MAAM,KAAK,KAAK,CAAC,EAAE,EAAE;AAC9E;AAkBA,IAAM,WAAW,CAAC,MAChB,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AA0BlD,SAAS,mBAAmB,KAA4B;AAC7D,QAAM,MAAqB,CAAC;AAC5B,aAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,QAAI,CAAC,KAAK,KAAK,EAAG;AAClB,QAAI;AACJ,QAAI;AACF,YAAM,SAAkB,KAAK,MAAM,IAAI;AACvC,UAAI,CAAC,SAAS,MAAM,EAAG;AACvB,cAAQ;AAAA,IACV,QAAQ;AACN;AAAA,IACF;AACA,QAAI,MAAM,SAAS,UAAU,MAAM,SAAS,YAAa;AACzD,UAAM,UAAU,MAAM;AACtB,QAAI,CAAC,SAAS,OAAO,EAAG;AACxB,QAAI,KAAK;AAAA,MACP,MAAM,MAAM;AAAA,MACZ,WAAW,OAAO,MAAM,cAAc,WAAW,MAAM,YAAY;AAAA,MACnE;AAAA,MACA,eAAe,MAAM;AAAA,MACrB,aAAa,MAAM,gBAAgB;AAAA,MACnC,SAAS,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AAAA,IAC/D,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAWA,SAAS,UAAU,SAA0B;AAC3C,MAAI,OAAO,YAAY,SAAU,QAAO;AACxC,MAAI,CAAC,MAAM,QAAQ,OAAO,EAAG,QAAO;AACpC,SAAO,QACJ;AAAA,IACC,CAAC,MACC,SAAS,CAAC,KAAK,EAAE,SAAS,UAAU,OAAO,EAAE,SAAS;AAAA,EAC1D,EACC,IAAI,CAAC,MAAM,EAAE,IAAc,EAC3B,KAAK,IAAI;AACd;AAGA,eAAsB,qBACpB,MACA,UAAuC,CAAC,GACb;AAC3B,SAAO,sBAAsB,mBAAmB,MAAM,SAAS,MAAM,MAAM,CAAC,GAAG,OAAO;AACxF;AAGO,SAAS,sBACd,SACA,UAAuC,CAAC,GACtB;AAClB,QAAM,gBAAgB,QAAQ,qBAAqB;AACnD,QAAM,WAA0B,CAAC;AACjC,QAAM,QAA2B,EAAE,UAAU,GAAG,WAAW,GAAG,WAAW,GAAG,YAAY,EAAE;AAC1F,MAAI,YAA2B;AAC/B,MAAI,UAAyB;AAC7B,MAAI,QAAuB;AAI3B,MAAI,qBAAoC;AACxC,MAAI,qBAAqB;AAEzB,aAAW,SAAS,SAAS;AAC3B,QAAI,MAAM,gBAAgB,cAAe;AACzC,UAAM,UAAU,MAAM;AACtB,QAAI,MAAM,cAAc,MAAM;AAC5B,UAAI,cAAc,KAAM,aAAY,MAAM;AAC1C,gBAAU,MAAM;AAAA,IAClB;AAEA,QAAI,MAAM,SAAS,QAAQ;AACzB,2BAAqB;AACrB,2BAAqB;AACrB,YAAMA,WAAU,QAAQ;AACxB,UAAI,OAAOA,aAAY,UAAU;AAC/B,iBAAS,KAAK,EAAE,MAAM,QAAQ,SAAAA,SAAQ,CAAC;AACvC;AAAA,MACF;AACA,UAAI,CAAC,MAAM,QAAQA,QAAO,EAAG;AAG7B,UAAI,WAAW;AACf,iBAAW,SAASA,UAAS;AAC3B,YAAI,CAAC,SAAS,KAAK,EAAG;AACtB,YAAI,MAAM,SAAS,iBAAiB,OAAO,MAAM,gBAAgB,UAAU;AACzE,mBAAS,KAAK;AAAA,YACZ,MAAM;AAAA,YACN,cAAc,MAAM;AAAA,YACpB,SACE,UAAU,MAAM,OAAO,MAAM,OAAO,MAAM,YAAY,WAAW,MAAM,UAAU;AAAA,UACrF,CAAC;AAAA,QACH,WAAW,MAAM,SAAS,UAAU,OAAO,MAAM,SAAS,UAAU;AAClE,uBAAa,SAAS,SAAS,IAAI,OAAO,MAAM,MAAM;AAAA,QACxD;AAAA,MACF;AACA,UAAI,SAAS,SAAS,EAAG,UAAS,KAAK,EAAE,MAAM,QAAQ,SAAS,SAAS,CAAC;AAC1E;AAAA,IACF;AAGA,QAAI,OAAO,QAAQ,UAAU,SAAU,SAAQ,QAAQ;AACvD,UAAM,QAAQ,OAAO,QAAQ,OAAO,WAAW,QAAQ,KAAK;AAC5D,UAAM,gBAAgB,UAAU,QAAQ,UAAU,sBAAsB,sBAAsB;AAC9F,UAAM,WAAW,QAAQ;AACzB,QAAI,SAAS,QAAQ,KAAK,CAAC,eAAe;AACxC,YAAM,YAAY,OAAO,SAAS,iBAAiB,WAAW,SAAS,eAAe;AACtF,YAAM,aAAa,OAAO,SAAS,kBAAkB,WAAW,SAAS,gBAAgB;AACzF,YAAM,aACJ,OAAO,SAAS,4BAA4B,WAAW,SAAS,0BAA0B;AAC5F,YAAM,cACJ,OAAO,SAAS,gCAAgC,WAC5C,SAAS,8BACT;AAAA,IACR;AACA,UAAM,UAAU,QAAQ;AACxB,QAAI,CAAC,MAAM,QAAQ,OAAO,EAAG;AAC7B,QAAI,YAAY;AAChB,QAAI,OAAO;AACX,UAAM,YAA4B,CAAC;AACnC,eAAW,SAAS,SAAS;AAC3B,UAAI,CAAC,SAAS,KAAK,EAAG;AACtB,UACE,MAAM,SAAS,cACf,OAAO,MAAM,aAAa,YAC1B,MAAM,SAAS,SAAS,GACxB;AACA,sBAAc,UAAU,SAAS,IAAI,OAAO,MAAM,MAAM;AAAA,MAC1D,WAAW,MAAM,SAAS,UAAU,OAAO,MAAM,SAAS,UAAU;AAClE,iBAAS,KAAK,SAAS,IAAI,OAAO,MAAM,MAAM;AAAA,MAChD,WAAW,MAAM,SAAS,cAAc,OAAO,MAAM,OAAO,UAAU;AACpE,kBAAU,KAAK;AAAA,UACb,IAAI,MAAM;AAAA,UACV,MAAM;AAAA,UACN,UAAU;AAAA,YACR,MAAM,OAAO,MAAM,SAAS,WAAW,MAAM,OAAO;AAAA,YACpD,WAAW,KAAK,UAAU,MAAM,SAAS,CAAC,CAAC;AAAA,UAC7C;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AACA,QAAI,UAAU,WAAW,KAAK,KAAK,WAAW,KAAK,UAAU,WAAW,EAAG;AAC3E,QAAI,eAAe;AACjB,YAAM,OAAO,SAAS,kBAAkB;AACxC,UAAI,KAAK,SAAS,EAAG,MAAK,UAAU,KAAK,YAAY,OAAO,OAAO,GAAG,KAAK,OAAO;AAAA,EAAK,IAAI;AAC3F,UAAI,UAAU,SAAS,GAAG;AACxB,aAAK,oBACH,KAAK,sBAAsB,SACvB,YACA,GAAG,KAAK,iBAAiB;AAAA,EAAK,SAAS;AAAA,MAC/C;AACA,UAAI,UAAU,SAAS,EAAG,MAAK,aAAa,CAAC,GAAI,KAAK,cAAc,CAAC,GAAI,GAAG,SAAS;AACrF;AAAA,IACF;AACA,aAAS,KAAK;AAAA,MACZ,MAAM;AAAA,MACN,SAAS,KAAK,SAAS,IAAI,OAAO;AAAA,MAClC,GAAI,UAAU,SAAS,IAAI,EAAE,mBAAmB,UAAU,IAAI,CAAC;AAAA,MAC/D,GAAI,UAAU,SAAS,IAAI,EAAE,YAAY,UAAU,IAAI,CAAC;AAAA,IAC1D,CAAC;AACD,yBAAqB;AACrB,yBAAqB,SAAS,SAAS;AAAA,EACzC;AAEA,SAAO,EAAE,UAAU,OAAO,WAAW,SAAS,MAAM;AACtD;;;ACpPA,SAAS,WAAAC,gBAAe;AACxB,SAAS,QAAAC,aAAY;AAId,IAAM,sBAAsBA,MAAKD,SAAQ,GAAG,UAAU,SAAS,YAAY,aAAa;AAuB/F,IAAM,wBAAwB,CAAC,QAAQ,QAAQ,EAAE,KAAK,GAAG;AAGzD,eAAsB,eACpB,OAAe,qBACe;AAC9B,MAAI;AACF,UAAM,EAAE,aAAa,IAAK,MAAM;AAAA;AAAA,MACX;AAAA;AAErB,UAAM,KAAK,IAAI,aAAa,MAAM,EAAE,UAAU,KAAK,CAAC;AAEpD,OAAG,QAAQ,gCAAgC,EAAE,IAAI;AACjD,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAME,YAAW,CAAC,MAChB,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,CAAC;AAEzD,SAAS,gBAAgB,KAAkD;AACzE,MAAI,QAAqC;AACzC,MAAI,OAAO,IAAI,UAAU,YAAY,IAAI,MAAM,SAAS,GAAG;AACzD,QAAI;AACF,YAAM,SAAkB,KAAK,MAAM,IAAI,KAAK;AAC5C,UAAIA,UAAS,MAAM,EAAG,SAAQ;AAAA,IAChC,QAAQ;AACN,cAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO;AAAA,IACL,IAAI,OAAO,IAAI,EAAE;AAAA,IACjB,UAAU,IAAI,cAAc,QAAQ,IAAI,cAAc,SAAY,OAAO,OAAO,IAAI,SAAS;AAAA,IAC7F,WAAW,OAAO,IAAI,SAAS;AAAA,IAC/B,OAAO,IAAI,UAAU,QAAQ,IAAI,UAAU,SAAY,OAAO,OAAO,IAAI,KAAK;AAAA,IAC9E;AAAA,IACA,SAAS,OAAO,IAAI,QAAQ,CAAC;AAAA,IAC7B,aAAa,OAAO,IAAI,gBAAgB,CAAC;AAAA,IACzC,cAAc,OAAO,IAAI,iBAAiB,CAAC;AAAA,IAC3C,iBAAiB,OAAO,IAAI,oBAAoB,CAAC;AAAA,IACjD,iBAAiB,OAAO,IAAI,qBAAqB,CAAC;AAAA,IAClD,kBAAkB,OAAO,IAAI,sBAAsB,CAAC;AAAA,IACpD,aAAa,OAAO,IAAI,gBAAgB,CAAC;AAAA,IACzC,aAAa,OAAO,IAAI,gBAAgB,CAAC;AAAA,EAC3C;AACF;AAEA,IAAM,kBACJ;AAGK,SAAS,gCACd,IACA,WACsB;AACtB,QAAM,OAAO,GACV,QAAQ,UAAU,eAAe,yDAAyD,EAC1F,IAAI,SAAS;AAChB,SAAO,KAAK,IAAI,eAAe;AACjC;AAEO,SAAS,wBACd,IACA,WAC2B;AAC3B,QAAM,MAAM,GAAG,QAAQ,UAAU,eAAe,4BAA4B,EAAE,IAAI,SAAS;AAG3F,SAAO,QAAQ,SAAY,OAAO,gBAAgB,GAAG;AACvD;AAUA,SAAS,kBAAkB,QAAyB;AAClD,MAAI,OAAO,WAAW,SAAU,QAAO;AACvC,MAAI,WAAW,QAAQ,WAAW,OAAW,QAAO;AACpD,SAAO,KAAK,UAAU,MAAM;AAC9B;AAQO,SAAS,4BAA4B,IAAkB,WAAkC;AAC9F,QAAM,cAAc,GACjB,QAAQ,6EAA6E,EACrF,IAAI,SAAS;AAChB,QAAM,YAAY,GAAG,QAAQ,wDAAwD;AAErF,QAAM,WAA0B,CAAC;AACjC,aAAW,cAAc,aAAa;AACpC,QAAI;AACJ,QAAI;AACF,YAAM,SAAkB,KAAK,MAAM,WAAW,IAAI;AAClD,UAAI,CAACA,UAAS,MAAM,EAAG;AACvB,aAAO;AAAA,IACT,QAAQ;AACN;AAAA,IACF;AACA,UAAM,QAAwB,CAAC;AAC/B,eAAW,OAAO,UAAU,IAAI,WAAW,EAAE,GAA8B;AACzE,UAAI;AACF,cAAM,SAAkB,KAAK,MAAM,IAAI,IAAI;AAC3C,YAAIA,UAAS,MAAM,EAAG,OAAM,KAAK,MAAsB;AAAA,MACzD,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,QAAI,KAAK,SAAS,QAAQ;AACxB,YAAM,OAAO,MACV,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,OAAO,EAAE,SAAS,QAAQ,EAC7D,IAAI,CAAC,MAAM,EAAE,IAAc,EAC3B,KAAK,IAAI;AACZ,eAAS,KAAK,EAAE,MAAM,QAAQ,SAAS,KAAK,CAAC;AAC7C;AAAA,IACF;AACA,QAAI,KAAK,SAAS,YAAa;AAI/B,UAAM,QAA0B,CAAC;AACjC,QAAI,UAA0B,CAAC;AAC/B,eAAW,QAAQ,OAAO;AACxB,UAAI,KAAK,SAAS,cAAc;AAC9B,YAAI,QAAQ,SAAS,EAAG,OAAM,KAAK,OAAO;AAC1C,kBAAU,CAAC;AACX;AAAA,MACF;AACA,UAAI,KAAK,SAAS,iBAAiB,KAAK,SAAS,cAAc,KAAK,SAAS,QAAS;AACtF,cAAQ,KAAK,IAAI;AAAA,IACnB;AACA,QAAI,QAAQ,SAAS,EAAG,OAAM,KAAK,OAAO;AAE1C,eAAW,QAAQ,OAAO;AACxB,YAAM,YAAY,KACf,OAAO,CAAC,MAAM,EAAE,SAAS,eAAe,OAAO,EAAE,SAAS,YAAY,EAAE,KAAK,SAAS,CAAC,EACvF,IAAI,CAAC,MAAM,EAAE,IAAc,EAC3B,KAAK,IAAI;AACZ,YAAM,OAAO,KACV,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,OAAO,EAAE,SAAS,QAAQ,EAC7D,IAAI,CAAC,MAAM,EAAE,IAAc,EAC3B,KAAK,IAAI;AACZ,YAAM,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU,OAAO,EAAE,WAAW,QAAQ;AACtF,YAAM,YAA4B,UAAU,IAAI,CAAC,OAAO;AAAA,QACtD,IAAI,EAAE;AAAA,QACN,MAAM;AAAA,QACN,UAAU;AAAA,UACR,MAAM,EAAE,QAAQ;AAAA,UAChB,WAAW,KAAK,UAAU,EAAE,OAAO,SAAS,CAAC,CAAC;AAAA,QAChD;AAAA,MACF,EAAE;AACF,UAAI,UAAU,WAAW,KAAK,KAAK,WAAW,KAAK,UAAU,WAAW,EAAG;AAC3E,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,SAAS,KAAK,SAAS,IAAI,OAAO;AAAA,QAClC,GAAI,UAAU,SAAS,IAAI,EAAE,mBAAmB,UAAU,IAAI,CAAC;AAAA,QAC/D,GAAI,UAAU,SAAS,IAAI,EAAE,YAAY,UAAU,IAAI,CAAC;AAAA,MAC1D,CAAC;AACD,iBAAW,KAAK,WAAW;AACzB,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,cAAc,EAAE;AAAA,UAChB,MAAM,EAAE,QAAQ;AAAA,UAChB,SAAS,kBAAkB,EAAE,OAAO,MAAM;AAAA,QAC5C,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;","names":["content","homedir","join","isRecord"]}

package/dist/chunk-VGRCHJON.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/rl/off-policy.ts"],"sourcesContent":["/**\n * Off-policy evaluation primitives.\n *\n * Standard inverse-probability-weighted (IPS), self-normalized\n * importance-weighted (SNIPS), and doubly-robust (DR) estimators for the\n * value of a *target* policy given trajectories collected under a\n * *behavior* policy. This is the canonical RL eval task: \"we have last\n * week's runs, we changed the policy — how would the new one do without\n * re-running?\"\n *\n * The math here is textbook (Dudík, Langford, Li 2011 for DR; Swaminathan\n * & Joachims 2015 for SNIPS) but the *application* to LLM-agent\n * evaluation needs care:\n *\n *   - The \"policy\" is the (prompt, tool config, model snapshot) triple.\n *     Two policies have the same probability over an action *iff* their\n *     LLM call would emit the same token with the same probability —\n *     which is generally unknowable without the model log-probs.\n *   - For LLM agents, propensity scores must be supplied by the caller\n *     (logged in the trace, recovered from token log-probs, or estimated\n *     via a learned propensity model). We do NOT estimate propensity here.\n *   - Doubly-robust requires two outputs from a Q-function: its prediction\n *     for the logged action and its expectation under the target policy.\n *     Consumers compute these with a tabular estimate, regression fit, or\n *     learned reward model before constructing the trajectories.\n *\n * Bias / variance tradeoffs:\n *   - IPS: unbiased; high variance for small overlap, infinite variance\n *     when target has support outside behavior.\n *   - SNIPS: lower variance, slight bias; usually preferred in practice.\n *   - DR: doubly-robust — unbiased if either propensity OR Q-function is\n *     correct. Lowest practical variance when Q is decent. Use this.\n *\n * Caveat the panel will land: on the LLM-agent setting, propensity scores\n * recovered from token log-probs are noisy, the action space is enormous,\n * and overlap is often poor. These estimators are useful but not magic;\n * complement with `replayCampaign` (exact replay where the request hashes\n * match) for high-confidence answers and OPE for the gap.\n */\n\nimport { ValidationError } from '../errors'\n\nexport interface OffPolicyTrajectory {\n  /** Stable id, for traceability through the dataset. */\n  runId: string\n  /** Reward observed under the behavior policy (the realized outcome). */\n  reward: number\n  /**\n   * Behavior-policy probability of the action that was taken. For LLM\n   * agents this is typically `exp(sum(token_log_probs))` over the chosen\n   * trajectory. Must be in (0, 1].\n   */\n  behaviorProb: number\n  /**\n   * Target-policy probability of the same action. For replay-style\n   * counterfactual evaluation this is what the *new* policy would have\n   * assigned to the *old* trajectory. Must be in [0, 1].\n   */\n  targetProb: number\n  /**\n   * Model-based reward prediction for the action selected by the behavior\n   * policy: `Q_hat(context, loggedAction)`. Supply this together with\n   * `vHatTarget` for contextual-bandit doubly-robust estimation.\n   */\n  qHatChosen?: number | null\n  /**\n   * Expected model-based reward under the target policy:\n   * `sum_action targetPolicy(action | context) * Q_hat(context, action)`.\n   * Supply this together with `qHatChosen`. For an honest evaluation, both\n   * values must come from a model cross-fitted or trained outside this row.\n   */\n  vHatTarget?: number | null\n  /**\n   * @deprecated Use `qHatChosen` and `vHatTarget` together. When the new pair\n   * is absent, this scalar is used as both terms to preserve existing results.\n   * When the new pair is present, this field is ignored.\n   */\n  qHat?: number | null\n}\n\nexport interface OffPolicyContributionCounts {\n  /** Contributions using the contextual-bandit doubly-robust formula. */\n  dr: number\n  /** Contributions using exact IPS because no reward-model estimate was supplied. */\n  ipsFallback: number\n  /** Contributions using the deprecated single-scalar formula. */\n  legacyScalar: number\n}\n\nexport interface OffPolicyEstimate {\n  /** Estimated value of the target policy. */\n  value: number\n  /** Standard error of the estimate. */\n  standardError: number\n  /** Effective sample size (Kong 1992). Lower = more reliance on a few high-weight samples. */\n  effectiveSampleSize: number\n  /** Number of trajectories used. */\n  n: number\n  /**\n   * Diagnostic: maximum importance weight observed. Large values (>>10x\n   * mean) are a red flag — variance is dominated by a few outliers.\n   */\n  maxImportanceWeight: number\n  /** Populated by `doublyRobust` to expose which formula each row used. */\n  contributionCounts?: OffPolicyContributionCounts\n}\n\nexport interface OffPolicyOptions {\n  /**\n   * Cap importance weights at this value (Ionides 2008 truncated IS) to\n   * trade unbiasedness for variance reduction. Default `Infinity` (no cap).\n   * Set e.g. `10` for stable estimates when the policies are close.\n   */\n  weightCap?: number\n  /** Reward clipping range. Default `[0, 1]`. */\n  rewardClip?: { low: number; high: number }\n}\n\n/**\n * Inverse Probability Weighting (Horvitz-Thompson). Unbiased estimator\n * of E[reward under target policy]. Variance scales with the spread of\n * target/behavior ratios.\n */\nexport function inverseProbabilityWeighting(\n  trajectories: OffPolicyTrajectory[],\n  opts: OffPolicyOptions = {},\n): OffPolicyEstimate {\n  const cap = opts.weightCap ?? Infinity\n  const clip = opts.rewardClip ?? { low: 0, high: 1 }\n\n  if (trajectories.length === 0) {\n    return zeroEstimate()\n  }\n\n  const weights: number[] = []\n  const weightedRewards: number[] = []\n  let maxW = 0\n  for (const t of trajectories) {\n    if (t.behaviorProb <= 0) {\n      throw new ValidationError(\n        `inverseProbabilityWeighting: behaviorProb must be > 0 (runId=${t.runId})`,\n      )\n    }\n    const w = Math.min(cap, t.targetProb / t.behaviorProb)\n    const r = clamp(t.reward, clip.low, clip.high)\n    weights.push(w)\n    weightedRewards.push(w * r)\n    if (w > maxW) maxW = w\n  }\n  const n = weights.length\n  const value = weightedRewards.reduce((s, x) => s + x, 0) / n\n  const variance = weightedRewards.reduce((s, x) => s + (x - value) ** 2, 0) / Math.max(1, n - 1)\n  const sumW = weights.reduce((s, w) => s + w, 0)\n  const sumW2 = weights.reduce((s, w) => s + w * w, 0)\n  const effN = sumW === 0 ? 0 : (sumW * sumW) / sumW2\n\n  return {\n    value,\n    standardError: Math.sqrt(variance / n),\n    effectiveSampleSize: effN,\n    n,\n    maxImportanceWeight: maxW,\n  }\n}\n\n/**\n * Self-Normalized Importance Sampling. Lower variance than vanilla IPS at\n * the cost of small bias (vanishing as N grows). The right default for\n * LLM-agent evaluation where overlap is often poor.\n */\nexport function selfNormalizedImportanceWeighting(\n  trajectories: OffPolicyTrajectory[],\n  opts: OffPolicyOptions = {},\n): OffPolicyEstimate {\n  const cap = opts.weightCap ?? Infinity\n  const clip = opts.rewardClip ?? { low: 0, high: 1 }\n  if (trajectories.length === 0) return zeroEstimate()\n\n  const weights: number[] = []\n  const rewards: number[] = []\n  let maxW = 0\n  for (const t of trajectories) {\n    if (t.behaviorProb <= 0) {\n      throw new ValidationError(\n        `selfNormalizedImportanceWeighting: behaviorProb must be > 0 (runId=${t.runId})`,\n      )\n    }\n    const w = Math.min(cap, t.targetProb / t.behaviorProb)\n    weights.push(w)\n    rewards.push(clamp(t.reward, clip.low, clip.high))\n    if (w > maxW) maxW = w\n  }\n  const sumW = weights.reduce((s, w) => s + w, 0)\n  const sumWR = weights.reduce((s, w, i) => s + w * rewards[i]!, 0)\n  const value = sumW === 0 ? 0 : sumWR / sumW\n  const sumW2 = weights.reduce((s, w) => s + w * w, 0)\n  const effN = sumW === 0 ? 0 : (sumW * sumW) / sumW2\n  // Influence-function-based SE for SNIPS (Owen 2013, Ch. 9).\n  const phi = weights.map((w, i) => w * (rewards[i]! - value))\n  const variance = phi.reduce((s, x) => s + x * x, 0) / Math.max(1, sumW * sumW)\n  return {\n    value,\n    standardError: Math.sqrt(variance),\n    effectiveSampleSize: effN,\n    n: trajectories.length,\n    maxImportanceWeight: maxW,\n  }\n}\n\n/**\n * Doubly-robust off-policy estimator (Dudík, Langford, Li 2011).\n *\n *     V_DR = (1/N) * sum_i [ v_hat_target_i\n *              + (target_prob_i / behavior_prob_i) * (r_i - q_hat_chosen_i) ]\n *\n * Unbiased if EITHER:\n *   - the importance ratios are correct (IPS-style validity), OR\n *   - the Q-hat function is correct (model-based validity).\n *\n * In practice both are imperfect, but the residual bias is the *product*\n * of both errors — much smaller than either alone. This is why DR is the\n * default in production OPE pipelines.\n *\n * `qHatChosen` and `vHatTarget` must be supplied together. Rows with neither\n * use the exact IPS contribution. Deprecated `qHat` rows preserve the scalar\n * formula, and a complete new pair takes precedence when both forms exist.\n * `contributionCounts` makes the mix explicit in the result.\n * Callers must cross-fit the Q-function or train it on independent rows;\n * fitting and evaluating Q on the same outcomes leaks the answer.\n */\nexport function doublyRobust(\n  trajectories: OffPolicyTrajectory[],\n  opts: OffPolicyOptions = {},\n): OffPolicyEstimate {\n  const cap = opts.weightCap ?? Infinity\n  const clip = opts.rewardClip ?? { low: 0, high: 1 }\n  if (trajectories.length === 0) {\n    return {\n      ...zeroEstimate(),\n      contributionCounts: { dr: 0, ipsFallback: 0, legacyScalar: 0 },\n    }\n  }\n\n  const contributions: number[] = []\n  const contributionCounts: OffPolicyContributionCounts = {\n    dr: 0,\n    ipsFallback: 0,\n    legacyScalar: 0,\n  }\n  let maxW = 0\n  let sumW = 0\n  let sumW2 = 0\n  for (const t of trajectories) {\n    if (t.behaviorProb <= 0) {\n      throw new ValidationError(`doublyRobust: behaviorProb must be > 0 (runId=${t.runId})`)\n    }\n    const w = Math.min(cap, t.targetProb / t.behaviorProb)\n    const r = clamp(t.reward, clip.low, clip.high)\n    const rawQHatChosen = t.qHatChosen\n    const rawVHatTarget = t.vHatTarget\n    const hasQHatChosen = rawQHatChosen !== null && rawQHatChosen !== undefined\n    const hasVHatTarget = rawVHatTarget !== null && rawVHatTarget !== undefined\n    if (hasQHatChosen !== hasVHatTarget) {\n      throw new ValidationError(\n        `doublyRobust: qHatChosen and vHatTarget must be supplied together (runId=${t.runId})`,\n      )\n    }\n\n    if (hasQHatChosen && hasVHatTarget) {\n      if (!Number.isFinite(rawQHatChosen) || !Number.isFinite(rawVHatTarget)) {\n        throw new ValidationError(\n          `doublyRobust: qHatChosen and vHatTarget must be finite (runId=${t.runId})`,\n        )\n      }\n      const qHatChosen = clamp(rawQHatChosen, clip.low, clip.high)\n      const vHatTarget = clamp(rawVHatTarget, clip.low, clip.high)\n      contributions.push(vHatTarget + w * (r - qHatChosen))\n      contributionCounts.dr += 1\n    } else if (typeof t.qHat === 'number' && Number.isFinite(t.qHat)) {\n      const qHat = clamp(t.qHat, clip.low, clip.high)\n      contributions.push(qHat + w * (r - qHat))\n      contributionCounts.legacyScalar += 1\n    } else {\n      contributions.push(w * r)\n      contributionCounts.ipsFallback += 1\n    }\n    if (w > maxW) maxW = w\n    sumW += w\n    sumW2 += w * w\n  }\n  const n = contributions.length\n  const value = contributions.reduce((s, x) => s + x, 0) / n\n  const variance = contributions.reduce((s, x) => s + (x - value) ** 2, 0) / Math.max(1, n - 1)\n  const effN = sumW === 0 ? 0 : (sumW * sumW) / sumW2\n  return {\n    value,\n    standardError: Math.sqrt(variance / n),\n    effectiveSampleSize: effN,\n    n,\n    maxImportanceWeight: maxW,\n    contributionCounts,\n  }\n}\n\n/**\n * Convenience: run all three estimators and return them side-by-side.\n * The recommended diagnostic — agreement across estimators is a much\n * stronger signal than any single one.\n */\nexport function offPolicyEstimateAll(\n  trajectories: OffPolicyTrajectory[],\n  opts: OffPolicyOptions = {},\n): { ips: OffPolicyEstimate; snips: OffPolicyEstimate; dr: OffPolicyEstimate } {\n  return {\n    ips: inverseProbabilityWeighting(trajectories, opts),\n    snips: selfNormalizedImportanceWeighting(trajectories, opts),\n    dr: doublyRobust(trajectories, opts),\n  }\n}\n\n// ── Helpers ──────────────────────────────────────────────────────────────\n\nfunction zeroEstimate(): OffPolicyEstimate {\n  return { value: 0, standardError: 0, effectiveSampleSize: 0, n: 0, maxImportanceWeight: 0 }\n}\n\nfunction clamp(x: number, lo: number, hi: number): number {\n  if (!Number.isFinite(x)) return lo\n  return Math.max(lo, Math.min(hi, x))\n}\n"],"mappings":";;;;;AA2HO,SAAS,4BACd,cACA,OAAyB,CAAC,GACP;AACnB,QAAM,MAAM,KAAK,aAAa;AAC9B,QAAM,OAAO,KAAK,cAAc,EAAE,KAAK,GAAG,MAAM,EAAE;AAElD,MAAI,aAAa,WAAW,GAAG;AAC7B,WAAO,aAAa;AAAA,EACtB;AAEA,QAAM,UAAoB,CAAC;AAC3B,QAAM,kBAA4B,CAAC;AACnC,MAAI,OAAO;AACX,aAAW,KAAK,cAAc;AAC5B,QAAI,EAAE,gBAAgB,GAAG;AACvB,YAAM,IAAI;AAAA,QACR,gEAAgE,EAAE,KAAK;AAAA,MACzE;AAAA,IACF;AACA,UAAM,IAAI,KAAK,IAAI,KAAK,EAAE,aAAa,EAAE,YAAY;AACrD,UAAM,IAAI,MAAM,EAAE,QAAQ,KAAK,KAAK,KAAK,IAAI;AAC7C,YAAQ,KAAK,CAAC;AACd,oBAAgB,KAAK,IAAI,CAAC;AAC1B,QAAI,IAAI,KAAM,QAAO;AAAA,EACvB;AACA,QAAM,IAAI,QAAQ;AAClB,QAAM,QAAQ,gBAAgB,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AAC3D,QAAM,WAAW,gBAAgB,OAAO,CAAC,GAAG,MAAM,KAAK,IAAI,UAAU,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;AAC9F,QAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC9C,QAAM,QAAQ,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,IAAI,GAAG,CAAC;AACnD,QAAM,OAAO,SAAS,IAAI,IAAK,OAAO,OAAQ;AAE9C,SAAO;AAAA,IACL;AAAA,IACA,eAAe,KAAK,KAAK,WAAW,CAAC;AAAA,IACrC,qBAAqB;AAAA,IACrB;AAAA,IACA,qBAAqB;AAAA,EACvB;AACF;AAOO,SAAS,kCACd,cACA,OAAyB,CAAC,GACP;AACnB,QAAM,MAAM,KAAK,aAAa;AAC9B,QAAM,OAAO,KAAK,cAAc,EAAE,KAAK,GAAG,MAAM,EAAE;AAClD,MAAI,aAAa,WAAW,EAAG,QAAO,aAAa;AAEnD,QAAM,UAAoB,CAAC;AAC3B,QAAM,UAAoB,CAAC;AAC3B,MAAI,OAAO;AACX,aAAW,KAAK,cAAc;AAC5B,QAAI,EAAE,gBAAgB,GAAG;AACvB,YAAM,IAAI;AAAA,QACR,sEAAsE,EAAE,KAAK;AAAA,MAC/E;AAAA,IACF;AACA,UAAM,IAAI,KAAK,IAAI,KAAK,EAAE,aAAa,EAAE,YAAY;AACrD,YAAQ,KAAK,CAAC;AACd,YAAQ,KAAK,MAAM,EAAE,QAAQ,KAAK,KAAK,KAAK,IAAI,CAAC;AACjD,QAAI,IAAI,KAAM,QAAO;AAAA,EACvB;AACA,QAAM,OAAO,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC9C,QAAM,QAAQ,QAAQ,OAAO,CAAC,GAAG,GAAG,MAAM,IAAI,IAAI,QAAQ,CAAC,GAAI,CAAC;AAChE,QAAM,QAAQ,SAAS,IAAI,IAAI,QAAQ;AACvC,QAAM,QAAQ,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,IAAI,GAAG,CAAC;AACnD,QAAM,OAAO,SAAS,IAAI,IAAK,OAAO,OAAQ;AAE9C,QAAM,MAAM,QAAQ,IAAI,CAAC,GAAG,MAAM,KAAK,QAAQ,CAAC,IAAK,MAAM;AAC3D,QAAM,WAAW,IAAI,OAAO,CAAC,GAAG,MAAM,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,OAAO,IAAI;AAC7E,SAAO;AAAA,IACL;AAAA,IACA,eAAe,KAAK,KAAK,QAAQ;AAAA,IACjC,qBAAqB;AAAA,IACrB,GAAG,aAAa;AAAA,IAChB,qBAAqB;AAAA,EACvB;AACF;AAuBO,SAAS,aACd,cACA,OAAyB,CAAC,GACP;AACnB,QAAM,MAAM,KAAK,aAAa;AAC9B,QAAM,OAAO,KAAK,cAAc,EAAE,KAAK,GAAG,MAAM,EAAE;AAClD,MAAI,aAAa,WAAW,GAAG;AAC7B,WAAO;AAAA,MACL,GAAG,aAAa;AAAA,MAChB,oBAAoB,EAAE,IAAI,GAAG,aAAa,GAAG,cAAc,EAAE;AAAA,IAC/D;AAAA,EACF;AAEA,QAAM,gBAA0B,CAAC;AACjC,QAAM,qBAAkD;AAAA,IACtD,IAAI;AAAA,IACJ,aAAa;AAAA,IACb,cAAc;AAAA,EAChB;AACA,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,QAAQ;AACZ,aAAW,KAAK,cAAc;AAC5B,QAAI,EAAE,gBAAgB,GAAG;AACvB,YAAM,IAAI,gBAAgB,iDAAiD,EAAE,KAAK,GAAG;AAAA,IACvF;AACA,UAAM,IAAI,KAAK,IAAI,KAAK,EAAE,aAAa,EAAE,YAAY;AACrD,UAAM,IAAI,MAAM,EAAE,QAAQ,KAAK,KAAK,KAAK,IAAI;AAC7C,UAAM,gBAAgB,EAAE;AACxB,UAAM,gBAAgB,EAAE;AACxB,UAAM,gBAAgB,kBAAkB,QAAQ,kBAAkB;AAClE,UAAM,gBAAgB,kBAAkB,QAAQ,kBAAkB;AAClE,QAAI,kBAAkB,eAAe;AACnC,YAAM,IAAI;AAAA,QACR,4EAA4E,EAAE,KAAK;AAAA,MACrF;AAAA,IACF;AAEA,QAAI,iBAAiB,eAAe;AAClC,UAAI,CAAC,OAAO,SAAS,aAAa,KAAK,CAAC,OAAO,SAAS,aAAa,GAAG;AACtE,cAAM,IAAI;AAAA,UACR,iEAAiE,EAAE,KAAK;AAAA,QAC1E;AAAA,MACF;AACA,YAAM,aAAa,MAAM,eAAe,KAAK,KAAK,KAAK,IAAI;AAC3D,YAAM,aAAa,MAAM,eAAe,KAAK,KAAK,KAAK,IAAI;AAC3D,oBAAc,KAAK,aAAa,KAAK,IAAI,WAAW;AACpD,yBAAmB,MAAM;AAAA,IAC3B,WAAW,OAAO,EAAE,SAAS,YAAY,OAAO,SAAS,EAAE,IAAI,GAAG;AAChE,YAAM,OAAO,MAAM,EAAE,MAAM,KAAK,KAAK,KAAK,IAAI;AAC9C,oBAAc,KAAK,OAAO,KAAK,IAAI,KAAK;AACxC,yBAAmB,gBAAgB;AAAA,IACrC,OAAO;AACL,oBAAc,KAAK,IAAI,CAAC;AACxB,yBAAmB,eAAe;AAAA,IACpC;AACA,QAAI,IAAI,KAAM,QAAO;AACrB,YAAQ;AACR,aAAS,IAAI;AAAA,EACf;AACA,QAAM,IAAI,cAAc;AACxB,QAAM,QAAQ,cAAc,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AACzD,QAAM,WAAW,cAAc,OAAO,CAAC,GAAG,MAAM,KAAK,IAAI,UAAU,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;AAC5F,QAAM,OAAO,SAAS,IAAI,IAAK,OAAO,OAAQ;AAC9C,SAAO;AAAA,IACL;AAAA,IACA,eAAe,KAAK,KAAK,WAAW,CAAC;AAAA,IACrC,qBAAqB;AAAA,IACrB;AAAA,IACA,qBAAqB;AAAA,IACrB;AAAA,EACF;AACF;AAOO,SAAS,qBACd,cACA,OAAyB,CAAC,GACmD;AAC7E,SAAO;AAAA,IACL,KAAK,4BAA4B,cAAc,IAAI;AAAA,IACnD,OAAO,kCAAkC,cAAc,IAAI;AAAA,IAC3D,IAAI,aAAa,cAAc,IAAI;AAAA,EACrC;AACF;AAIA,SAAS,eAAkC;AACzC,SAAO,EAAE,OAAO,GAAG,eAAe,GAAG,qBAAqB,GAAG,GAAG,GAAG,qBAAqB,EAAE;AAC5F;AAEA,SAAS,MAAM,GAAW,IAAY,IAAoB;AACxD,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,SAAO,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC;AACrC;","names":[]}

package/dist/chunk-VLOATJQ2.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/summary-report.ts"],"sourcesContent":["/**\n * Reporting helpers — production summaries and paper-quality figures — sit alongside `reporter.ts` rather\n * than replacing it.\n *\n * Three artefacts:\n *\n *   - `summaryTable`           Markdown table of per-candidate means,\n *                            95% bootstrap CIs, BH-adjusted Wilcoxon\n *                            p-values, and Cohen's d versus a\n *                            comparator candidate.\n *   - `paretoChart`         Abstract spec for a cost vs quality\n *                            scatter, with gate decisions overlaid.\n *                            Returns numbers + labels — caller\n *                            chooses the plotting library.\n *   - `gainHistogram`\n *                            Per-item paired holdout deltas as a\n *                            histogram spec (bins + counts + median +\n *                            CI). Same \"data, not images\" contract.\n *\n * The figure types are PlotSpecs — JSON-friendly, library-agnostic.\n * They aren't React components and they aren't PNGs; they are\n * what you'd hand to vega-lite, plotly, matplotlib, or your own\n * Canvas renderer to draw the actual figure.\n */\n\nimport type { GateDecision } from './held-out-gate'\nimport { pairRunRecords } from './paired-arms'\nimport type { FailureClusterReport } from './pipelines/failure-cluster'\nimport { canonicalize, hashJson } from './pre-registration'\nimport type { RunRecord } from './run-record'\nimport {\n  benjaminiHochberg,\n  confidenceInterval,\n  pairedBootstrap,\n  pairedCohensDz,\n  pairedMde,\n  wilcoxonSignedRank,\n} from './statistics'\n\n// ── summaryTable ───────────────────────────────────────────────────────\n\nexport interface SummaryTableOptions {\n  /** Comparator candidate id. Wilcoxon + paired Cohen's dz are computed\n   *  versus this candidate. Required for paired stats columns. */\n  comparator?: string\n  /** Which split to read scores from. Default 'holdout'. */\n  split?: 'search' | 'holdout'\n  /** Confidence level for the bootstrap CI on the mean. Default 0.95. */\n  confidence?: number\n  /** FDR for BH adjustment of the comparison p-values. Default 0.05. */\n  fdr?: number\n}\n\nexport interface SummaryTableRow {\n  candidateId: string\n  n: number\n  mean: number\n  ciLow: number\n  ciHigh: number\n  /** BH-adjusted q-value vs comparator, or null when unavailable. */\n  qValue: number | null\n  /** Paired Cohen's dz vs comparator, or null when the paired variance is zero. */\n  cohensD: number | null\n  /** Matched observations used for paired comparison, or null on the comparator row. */\n  pairedN: number | null\n  /** Candidate observations without a comparator match. */\n  unpairedCandidateN: number | null\n  /** Comparator observations without a candidate match. */\n  unpairedComparatorN: number | null\n}\n\nexport interface SummaryTable {\n  rows: SummaryTableRow[]\n  comparator: string | null\n  split: 'search' | 'holdout'\n  /** Pre-rendered markdown — drop into a paper or PR. */\n  markdown: string\n}\n\n/**\n * Table 1 helper. Buckets runs by `candidateId`, computes mean +\n * bootstrap CI on the chosen split, and (when a comparator is given)\n * BH-adjusted Wilcoxon p + paired Cohen's dz versus that comparator.\n */\nexport function summaryTable(runs: RunRecord[], opts: SummaryTableOptions = {}): SummaryTable {\n  const split = opts.split ?? 'holdout'\n  const confidence = opts.confidence ?? 0.95\n  const fdr = opts.fdr ?? 0.05\n  const comparator = opts.comparator ?? null\n  const scoreField = split === 'holdout' ? 'holdoutScore' : 'searchScore'\n\n  const byCandidate = new Map<string, { runs: RunRecord[]; scores: number[] }>()\n  for (const r of runs) {\n    if (r.splitTag !== split) continue\n    const v = r.outcome[scoreField]\n    if (typeof v !== 'number' || !Number.isFinite(v)) continue\n    const bucket = byCandidate.get(r.candidateId) ?? { runs: [], scores: [] }\n    bucket.runs.push(r)\n    bucket.scores.push(v)\n    byCandidate.set(r.candidateId, bucket)\n  }\n\n  const candidateIds = [...byCandidate.keys()].sort()\n  const compRuns = comparator ? byCandidate.get(comparator) : undefined\n\n  // First pass: per-candidate means + CIs + raw p-values.\n  const tentative: Array<SummaryTableRow & { rawP: number | null }> = []\n  for (const id of candidateIds) {\n    const bucket = byCandidate.get(id)!\n    const ci = confidenceInterval(bucket.scores, confidence)\n    let rawP: number | null = null\n    let d: number | null = null\n    let pairedN: number | null = null\n    let unpairedCandidateN: number | null = null\n    let unpairedComparatorN: number | null = null\n    if (comparator && compRuns && id !== comparator) {\n      const paired = pairScoresByKey(bucket.runs, compRuns.runs, scoreField)\n      pairedN = paired.before.length\n      unpairedCandidateN = paired.unpairedCandidateN\n      unpairedComparatorN = paired.unpairedComparatorN\n      if (paired.before.length >= 6) {\n        rawP = wilcoxonSignedRank(paired.before, paired.after).p\n      }\n      d = pairedCohensDz(paired.before, paired.after)\n    }\n    tentative.push({\n      candidateId: id,\n      n: bucket.scores.length,\n      mean: ci.mean,\n      ciLow: ci.lower,\n      ciHigh: ci.upper,\n      qValue: rawP,\n      cohensD: d,\n      pairedN,\n      unpairedCandidateN,\n      unpairedComparatorN,\n      rawP,\n    })\n  }\n\n  // BH-adjust across the comparison set (skip NaN rows / the\n  // comparator itself). Adjustment is a no-op when there are 0 or 1\n  // comparators.\n  if (comparator) {\n    const idxs: number[] = []\n    const ps: number[] = []\n    for (let i = 0; i < tentative.length; i++) {\n      const r = tentative[i]!\n      if (r.candidateId === comparator) continue\n      if (r.rawP === null || !Number.isFinite(r.rawP)) continue\n      idxs.push(i)\n      ps.push(r.rawP)\n    }\n    if (ps.length > 0) {\n      const { qValues } = benjaminiHochberg(ps, fdr)\n      for (let k = 0; k < idxs.length; k++) {\n        tentative[idxs[k]!]!.qValue = qValues[k]!\n      }\n    }\n  }\n\n  const rows = tentative.map(({ rawP: _rawP, ...rest }) => rest)\n  const markdown = renderSummaryTableMarkdown(rows, comparator, split)\n  return { rows, comparator, split, markdown }\n}\n\nfunction pairScoresByKey(\n  candidate: RunRecord[],\n  baseline: RunRecord[],\n  scoreField: 'searchScore' | 'holdoutScore',\n): {\n  before: number[]\n  after: number[]\n  unpairedCandidateN: number\n  unpairedComparatorN: number\n} {\n  const scoredCandidate = candidate.filter((run) => Number.isFinite(run.outcome[scoreField]))\n  const scoredBaseline = baseline.filter((run) => Number.isFinite(run.outcome[scoreField]))\n  const pairing = pairRunRecords(scoredBaseline, scoredCandidate)\n  return {\n    before: pairing.pairs.map((pair) => pair.baseline.outcome[scoreField]!),\n    after: pairing.pairs.map((pair) => pair.treatment.outcome[scoreField]!),\n    unpairedCandidateN: pairing.unpairedTreatment.length,\n    unpairedComparatorN: pairing.unpairedBaseline.length,\n  }\n}\n\nfunction renderSummaryTableMarkdown(\n  rows: SummaryTableRow[],\n  comparator: string | null,\n  split: 'search' | 'holdout',\n): string {\n  const lines: string[] = []\n  const cmpLabel = comparator ? ` (vs ${comparator})` : ''\n  lines.push(`Summary Table — ${split} split${cmpLabel}`)\n  lines.push('')\n  lines.push(\"| Candidate | N | Pairs | Unpaired | Mean | 95% CI | q (BH) | Cohen's dz |\")\n  lines.push('|---|---:|---:|---:|---:|---|---:|---:|')\n  for (const r of rows) {\n    const ci = `[${fmt(r.ciLow)}, ${fmt(r.ciHigh)}]`\n    const q = r.qValue !== null ? r.qValue.toFixed(4) : '—'\n    const d = r.cohensD !== null ? r.cohensD.toFixed(3) : '—'\n    const paired = r.pairedN ?? '—'\n    const unpaired =\n      r.unpairedCandidateN === null || r.unpairedComparatorN === null\n        ? '—'\n        : `${r.unpairedCandidateN}/${r.unpairedComparatorN}`\n    lines.push(\n      `| ${r.candidateId} | ${r.n} | ${paired} | ${unpaired} | ${fmt(r.mean)} | ${ci} | ${q} | ${d} |`,\n    )\n  }\n  return lines.join('\\n')\n}\n\n// ── paretoChart ─────────────────────────────────────────────────────\n\nexport interface ParetoPoint {\n  candidateId: string\n  /** Mean USD cost per run on the chosen split. */\n  cost: number\n  /** Mean score on the chosen split. */\n  quality: number\n  /** Number of runs that informed this point. */\n  n: number\n  /** Whether this candidate is on the Pareto frontier — high\n   *  quality, low cost, no dominator. */\n  onFrontier: boolean\n  /** Optional gate verdict for this candidate, if a `GateDecision`\n   *  for it was passed in. */\n  gate?: 'promote' | 'reject'\n}\n\nexport interface ParetoFigureSpec {\n  kind: 'pareto-cost-quality'\n  split: 'search' | 'holdout'\n  points: ParetoPoint[]\n  axes: { x: 'costUsd'; y: 'score' }\n}\n\n/**\n * Cost vs quality scatter spec. `gateDecisions` is keyed by\n * candidate id; if present, every point picks up the gate verdict\n * for overlay.\n */\nexport function paretoChart(\n  runs: RunRecord[],\n  opts: {\n    split?: 'search' | 'holdout'\n    gateDecisions?: Record<string, GateDecision>\n  } = {},\n): ParetoFigureSpec {\n  const split = opts.split ?? 'holdout'\n  const scoreField = split === 'holdout' ? 'holdoutScore' : 'searchScore'\n\n  const buckets = new Map<string, { cost: number[]; quality: number[] }>()\n  for (const r of runs) {\n    if (r.splitTag !== split) continue\n    const v = r.outcome[scoreField]\n    if (typeof v !== 'number' || !Number.isFinite(v)) continue\n    if (r.costUsd === null) continue\n    const bucket = buckets.get(r.candidateId) ?? { cost: [], quality: [] }\n    bucket.cost.push(r.costUsd)\n    bucket.quality.push(v)\n    buckets.set(r.candidateId, bucket)\n  }\n\n  const points: ParetoPoint[] = []\n  for (const [candidateId, bucket] of buckets.entries()) {\n    points.push({\n      candidateId,\n      cost: avg(bucket.cost),\n      quality: avg(bucket.quality),\n      n: bucket.cost.length,\n      onFrontier: false,\n      gate: opts.gateDecisions?.[candidateId]\n        ? gateLabel(opts.gateDecisions[candidateId]!)\n        : undefined,\n    })\n  }\n\n  // Pareto: minimize cost, maximize quality. A point is dominated if\n  // some other point has lower-or-equal cost AND higher-or-equal\n  // quality with strict inequality somewhere.\n  for (const p of points) {\n    p.onFrontier = !points.some((q) => q !== p && dominates(q, p))\n  }\n\n  return {\n    kind: 'pareto-cost-quality',\n    split,\n    axes: { x: 'costUsd', y: 'score' },\n    points,\n  }\n}\n\nfunction dominates(a: ParetoPoint, b: ParetoPoint): boolean {\n  return a.cost <= b.cost && a.quality >= b.quality && (a.cost < b.cost || a.quality > b.quality)\n}\n\nfunction gateLabel(d: GateDecision): ParetoPoint['gate'] {\n  return d.promote ? 'promote' : 'reject'\n}\n\n// ── gainHistogram ───────────────────────────────────────────\n\nexport interface GainDistributionBin {\n  /** Inclusive lower edge. */\n  lo: number\n  /** Exclusive upper edge (or inclusive if it's the last bin). */\n  hi: number\n  /** Number of pairs whose delta lands in this bin. */\n  count: number\n}\n\nexport interface GainDistributionFigureSpec {\n  kind: 'gain-distribution'\n  candidateId: string\n  comparator: string\n  split: 'search' | 'holdout'\n  /** Number of pairs used. */\n  n: number\n  /** Candidate rows without a comparator match. */\n  unpairedCandidateN: number\n  /** Comparator rows without a candidate match. */\n  unpairedComparatorN: number\n  bins: GainDistributionBin[]\n  median: number | null\n  ci: { low: number; high: number } | null\n}\n\nexport interface GainDistributionOptions {\n  /** Number of histogram bins. Default 11 (so the centre is exact at 0). */\n  bins?: number\n  /** Which split to use. Default 'holdout'. */\n  split?: 'search' | 'holdout'\n  /** Confidence level for the CI. Default 0.95. */\n  confidence?: number\n  /** Bootstrap resamples. Default 2000. */\n  resamples?: number\n  /** Deterministic seed. */\n  seed?: number\n}\n\n/**\n * Held-out improvement distribution: per-pair delta (candidate −\n * comparator), histogrammed. Includes the bootstrap CI on the median\n * delta — same primitive the promotion gate uses.\n */\nexport function gainHistogram(\n  runs: RunRecord[],\n  candidateId: string,\n  comparator: string,\n  opts: GainDistributionOptions = {},\n): GainDistributionFigureSpec {\n  const split = opts.split ?? 'holdout'\n  const scoreField = split === 'holdout' ? 'holdoutScore' : 'searchScore'\n  const binCount = opts.bins ?? 11\n  if (binCount < 1) throw new Error('gainHistogram: bins must be ≥ 1')\n\n  const candidate = runs.filter((r) => r.candidateId === candidateId && r.splitTag === split)\n  const baseline = runs.filter((r) => r.candidateId === comparator && r.splitTag === split)\n  const { before, after, unpairedCandidateN, unpairedComparatorN } = pairScoresByKey(\n    candidate,\n    baseline,\n    scoreField,\n  )\n  const n = before.length\n\n  if (n === 0) {\n    return {\n      kind: 'gain-distribution',\n      candidateId,\n      comparator,\n      split,\n      n: 0,\n      unpairedCandidateN,\n      unpairedComparatorN,\n      bins: [],\n      median: null,\n      ci: null,\n    }\n  }\n\n  const deltas = before.map((b, i) => after[i]! - b)\n  const sortedDeltas = [...deltas].sort((a, b) => a - b)\n  const median = medianOfSorted(sortedDeltas)\n  const min = sortedDeltas[0]!\n  const max = sortedDeltas[sortedDeltas.length - 1]!\n\n  // Symmetric bins around the wider of (|min|, |max|) so the chart\n  // visually centres on zero without dropping outliers.\n  const bound = Math.max(Math.abs(min), Math.abs(max), 1e-6)\n  const lo = -bound\n  const hi = bound\n  const width = (hi - lo) / binCount\n  const bins: GainDistributionBin[] = []\n  for (let i = 0; i < binCount; i++) {\n    bins.push({ lo: lo + i * width, hi: lo + (i + 1) * width, count: 0 })\n  }\n  for (const d of deltas) {\n    let idx = Math.floor((d - lo) / width)\n    if (idx < 0) idx = 0\n    if (idx >= binCount) idx = binCount - 1\n    bins[idx]!.count += 1\n  }\n\n  const ci = pairedBootstrap(before, after, {\n    confidence: opts.confidence ?? 0.95,\n    resamples: opts.resamples ?? 2000,\n    statistic: 'median',\n    seed: opts.seed,\n  })\n\n  return {\n    kind: 'gain-distribution',\n    candidateId,\n    comparator,\n    split,\n    n,\n    unpairedCandidateN,\n    unpairedComparatorN,\n    bins,\n    median,\n    ci: { low: ci.low, high: ci.high },\n  }\n}\n\n// ── researchReport ───────────────────────────────────────────────────\n\nexport type ResearchReportDecision =\n  | 'promote'\n  | 'hold'\n  | 'reject'\n  | 'equivalent'\n  | 'needs_more_data'\n\n/**\n * Hard floor below which a paired comparison is treated as uninformative\n * regardless of `minPairs`. Mirrors the lower limit on Wilcoxon signed-rank\n * exact tables; below this the test has no power to separate effect sizes.\n */\nexport const RESEARCH_REPORT_HARD_PAIR_FLOOR = 6\n\nexport interface ResearchReportOptions {\n  /** Human-readable report title. */\n  title?: string\n  /** Comparator candidate id. Required for statistical decision guidance. */\n  comparator?: string\n  /** Which split to use for the primary decision. Default 'holdout'. */\n  split?: 'search' | 'holdout'\n  /** Confidence level used by lower-level report helpers. Default 0.95. */\n  confidence?: number\n  /** FDR threshold for q-values. Default 0.05. */\n  fdr?: number\n  /**\n   * Soft floor on paired observations before issuing a directional\n   * promote / reject. Below this we report `needs_more_data` and surface the\n   * minimum detectable effect at the current N. Default 20 — chosen so the\n   * Wilcoxon signed-rank approximation is reasonable and so the paired\n   * bootstrap CI has non-degenerate coverage. Hard floor is enforced at\n   * `RESEARCH_REPORT_HARD_PAIR_FLOOR` (6) regardless of this value.\n   */\n  minPairs?: number\n  /**\n   * Region of Practical Equivalence on the paired delta. When a candidate's\n   * paired-delta CI is fully contained in `[low, high]`, the decision is\n   * `equivalent` rather than `hold`. Sourced from the domain owner — there is\n   * no statistically-defensible default.\n   */\n  rope?: { low: number; high: number }\n  /**\n   * Power for the minimum detectable effect (MDE) reported on each candidate.\n   * Default 0.8.\n   */\n  mdePower?: number\n  /**\n   * Two-sided alpha for the MDE. Default matches `fdr` so the reported MDE\n   * lines up with the test the report actually runs.\n   */\n  mdeAlpha?: number\n  /** Optional held-out gate decisions keyed by candidate id. */\n  gateDecisions?: Record<string, GateDecision>\n  /** Optional failure clusters from failureClusterView. */\n  failureClusters?: FailureClusterReport\n  /** Build gain histograms for these candidates. Defaults to all non-comparator candidates. */\n  candidateIds?: string[]\n  /** Deterministic bootstrap seed passed to gainHistogram and the posterior helper. */\n  seed?: number\n  /** Report timestamp. Defaults to current time. */\n  generatedAt?: string\n  /**\n   * Hash of a preregistered protocol (e.g. `signManifest({...}).contentHash`).\n   * Embedded verbatim in the report so the analysis can be cited as the\n   * preregistered one rather than a post-hoc fishing expedition.\n   */\n  preregistrationHash?: string\n}\n\nexport interface ResearchReportRecommendation {\n  decision: ResearchReportDecision\n  candidateId: string | null\n  rationale: string[]\n  risks: string[]\n  nextActions: string[]\n}\n\nexport interface ResearchReportCandidate {\n  candidateId: string\n  n: number\n  mean: number\n  ciLow: number\n  ciHigh: number\n  qValue: number | null\n  cohensD: number | null\n  meanDeltaVsComparator: number | null\n  pairedN: number\n  medianGain: number | null\n  meanGain: number | null\n  gainCi: { low: number; high: number } | null\n  /**\n   * Bayesian-bootstrap posterior summaries on the paired mean delta.\n   * Dirichlet(1, ..., 1) weights represent uncertainty over the empirical\n   * distribution of matched deltas.\n   */\n  prGreaterThanZero: number | null\n  prInRope: number | null\n  /**\n   * Minimum detectable effect (in score units) at the candidate's paired N,\n   * the configured power, and the configured alpha. Standardised by the\n   * observed paired-delta SD and inverted via `requiredSampleSize`. Reported\n   * for every candidate so a `needs_more_data` verdict is actionable.\n   */\n  mde: number | null\n  onParetoFrontier: boolean\n  gate?: ParetoPoint['gate']\n  decision: ResearchReportDecision\n  decisionReason: string\n}\n\nexport interface ResearchReportMethodology {\n  /**\n   * Plain-language assumptions the report depends on. Read these first when\n   * deciding whether the verdict is load-bearing for a launch decision.\n   */\n  assumptions: string[]\n  /** Tests and estimators the verdict was computed from. */\n  methods: string[]\n  /** Alternatives the author considered and why this report didn't take them. */\n  alternatives: string[]\n  /** Failure modes — when this report should NOT drive a decision. */\n  whenNotToApply: string[]\n  /** Citations for the methodological choices above. */\n  citations: string[]\n}\n\nexport interface ResearchReport {\n  kind: 'agent-eval-research-report'\n  title: string\n  generatedAt: string\n  split: 'search' | 'holdout'\n  comparator: string | null\n  /**\n   * SHA-256 over the canonicalised set of `(runId, candidateId, split)` triples\n   * the report was computed from, plus the comparator and split. Stable across\n   * key insertion order; recomputable by the reader to verify provenance.\n   */\n  runFingerprint: string\n  preregistrationHash: string | null\n  rope: { low: number; high: number } | null\n  executiveSummary: string[]\n  recommendation: ResearchReportRecommendation\n  candidates: ResearchReportCandidate[]\n  summary: SummaryTable\n  charts: {\n    pareto: ParetoFigureSpec\n    gains: GainDistributionFigureSpec[]\n  }\n  methodology: ResearchReportMethodology\n  failureClusters?: FailureClusterReport\n  markdown: string\n  html: string\n}\n\n/**\n * Internal: paired posterior summary on (candidate − comparator) deltas.\n *\n * Returns the bootstrap CI on the median (matching `gainHistogram`) plus\n * Bayesian-bootstrap posterior summaries Pr(Δ>0) and Pr(Δ∈ROPE) computed\n * from Dirichlet(1, ..., 1) weights on the observed paired deltas\n * (Rubin 1981), and the\n * minimum detectable paired effect at the configured power and α.\n *\n * `null` is returned when no paired observations exist; callers must\n * gate on `n` before consuming the bootstrap statistics.\n */\nfunction pairedPosterior(\n  runs: RunRecord[],\n  candidateId: string,\n  comparator: string,\n  opts: {\n    split: 'search' | 'holdout'\n    confidence: number\n    seed?: number\n    rope: { low: number; high: number } | null\n    mdePower: number\n    mdeAlpha: number\n  },\n): {\n  n: number\n  meanDelta: number\n  medianDelta: number\n  sdDelta: number\n  ci: { low: number; high: number }\n  prGreaterThanZero: number\n  prInRope: number | null\n  mde: number\n} | null {\n  const scoreField = opts.split === 'holdout' ? 'holdoutScore' : 'searchScore'\n  const candidate = runs.filter((r) => r.candidateId === candidateId && r.splitTag === opts.split)\n  const baseline = runs.filter((r) => r.candidateId === comparator && r.splitTag === opts.split)\n  const { before, after } = pairScoresByKey(candidate, baseline, scoreField)\n  const n = before.length\n  if (n === 0) return null\n\n  const deltas = before.map((b, i) => after[i]! - b)\n  const meanDelta = deltas.reduce((s, x) => s + x, 0) / n\n  const sortedDeltas = [...deltas].sort((a, b) => a - b)\n  const medianDelta = medianOfSorted(sortedDeltas)\n  const sdDelta = stdev(deltas, meanDelta)\n\n  const ci = pairedBootstrap(before, after, {\n    confidence: opts.confidence,\n    resamples: 2000,\n    statistic: 'median',\n    seed: opts.seed,\n  })\n\n  const meanSamples = bayesianBootstrapMeanSamples(deltas, 2000, opts.seed)\n  const prGreaterThanZero =\n    meanSamples.length === 0 ? 0 : meanSamples.filter((s) => s > 0).length / meanSamples.length\n  const prInRope =\n    opts.rope === null || meanSamples.length === 0\n      ? null\n      : meanSamples.filter((s) => s >= opts.rope!.low && s <= opts.rope!.high).length /\n        meanSamples.length\n\n  const dStandardised = pairedMde({ nPaired: n, alpha: opts.mdeAlpha, power: opts.mdePower })\n  const mde = sdDelta === 0 ? 0 : dStandardised * sdDelta\n\n  return {\n    n,\n    meanDelta,\n    medianDelta,\n    sdDelta,\n    ci: { low: ci.low, high: ci.high },\n    prGreaterThanZero,\n    prInRope,\n    mde,\n  }\n}\n\nfunction bayesianBootstrapMeanSamples(\n  deltas: number[],\n  resamples: number,\n  seed?: number,\n): number[] {\n  const n = deltas.length\n  if (n === 0) return []\n  if (n === 1) return new Array<number>(resamples).fill(deltas[0]!)\n  const rng = seedRng(seed)\n  const samples = new Array<number>(resamples)\n  for (let b = 0; b < resamples; b++) {\n    let weightedSum = 0\n    let weightSum = 0\n    for (let k = 0; k < n; k++) {\n      const weight = -Math.log(Math.max(Number.MIN_VALUE, rng()))\n      weightedSum += deltas[k]! * weight\n      weightSum += weight\n    }\n    samples[b] = weightedSum / weightSum\n  }\n  return samples\n}\n\nfunction seedRng(seed?: number): () => number {\n  if (seed === undefined) return Math.random\n  let s = seed >>> 0\n  return () => {\n    s = (s + 0x6d2b79f5) >>> 0\n    let t = s\n    t = Math.imul(t ^ (t >>> 15), t | 1)\n    t ^= t + Math.imul(t ^ (t >>> 7), t | 61)\n    return ((t ^ (t >>> 14)) >>> 0) / 4294967296\n  }\n}\n\nfunction stdev(xs: number[], mean: number): number {\n  if (xs.length < 2) return 0\n  let sse = 0\n  for (const x of xs) sse += (x - mean) ** 2\n  return Math.sqrt(sse / (xs.length - 1))\n}\n\n/**\n * Executive research report for CPO / AI-lead / launch-review consumption.\n *\n * Composes:\n *   - `summaryTable`         marginal stats with BH-FDR-adjusted q-values\n *   - `paretoChart`           cost-vs-quality frontier with gate overlay\n *   - `gainHistogram`         per-candidate paired-delta distribution\n *   - paired posterior (this file): bootstrap CI on median, Bayesian-bootstrap Pr(Δ>0),\n *                              Pr(Δ∈ROPE), MDE at the configured power\n *\n * Decisions are made on paired evidence — never on marginal means alone —\n * and respect any held-out gate decision the caller passes through. The\n * report embeds a SHA-256 fingerprint of the input run set and, optionally,\n * the hash of a preregistered protocol so a downstream reader can verify\n * provenance and that the analysis was the preregistered one.\n *\n * Async because the fingerprint uses Web Crypto via `hashJson`; deterministic\n * for any fixed `runs`, `seed`, and ROPE.\n */\nexport async function researchReport(\n  runs: RunRecord[],\n  opts: ResearchReportOptions = {},\n): Promise<ResearchReport> {\n  const split = opts.split ?? 'holdout'\n  const comparator = opts.comparator ?? null\n  const confidence = opts.confidence ?? 0.95\n  const fdr = opts.fdr ?? 0.05\n  const minPairs = Math.max(opts.minPairs ?? 20, RESEARCH_REPORT_HARD_PAIR_FLOOR)\n  const rope = opts.rope ?? null\n  const mdePower = opts.mdePower ?? 0.8\n  const mdeAlpha = opts.mdeAlpha ?? fdr\n  const title = opts.title ?? 'Agent Evaluation Research Report'\n  const generatedAt = opts.generatedAt ?? new Date().toISOString()\n  const preregistrationHash = opts.preregistrationHash ?? null\n\n  if (rope && !(Number.isFinite(rope.low) && Number.isFinite(rope.high) && rope.low <= rope.high)) {\n    throw new Error(\n      `researchReport: rope must satisfy low ≤ high with finite bounds, got ${JSON.stringify(rope)}`,\n    )\n  }\n\n  const summary = summaryTable(runs, {\n    comparator: comparator ?? undefined,\n    split,\n    confidence,\n    fdr,\n  })\n  const pareto = paretoChart(runs, { split, gateDecisions: opts.gateDecisions })\n  const candidateIds =\n    opts.candidateIds ?? summary.rows.map((r) => r.candidateId).filter((id) => id !== comparator)\n  const gains = comparator\n    ? candidateIds.map((id) =>\n        gainHistogram(runs, id, comparator, {\n          split,\n          confidence,\n          seed: opts.seed,\n        }),\n      )\n    : []\n\n  const gainByCandidate = new Map(gains.map((g) => [g.candidateId, g]))\n  const paretoByCandidate = new Map(pareto.points.map((p) => [p.candidateId, p]))\n  const posteriorByCandidate = new Map<string, ReturnType<typeof pairedPosterior>>()\n  if (comparator) {\n    for (const id of candidateIds) {\n      posteriorByCandidate.set(\n        id,\n        pairedPosterior(runs, id, comparator, {\n          split,\n          confidence,\n          seed: opts.seed,\n          rope,\n          mdePower,\n          mdeAlpha,\n        }),\n      )\n    }\n  }\n\n  const candidates = summary.rows\n    .map((row) => {\n      const gain = gainByCandidate.get(row.candidateId)\n      const point = paretoByCandidate.get(row.candidateId)\n      const posterior = posteriorByCandidate.get(row.candidateId) ?? null\n      const gateDecision = opts.gateDecisions?.[row.candidateId]\n      const classified = classifyCandidate(row, {\n        comparator,\n        posterior,\n        point,\n        gateDecision,\n        split,\n        fdr,\n        minPairs,\n        rope,\n      })\n      return {\n        candidateId: row.candidateId,\n        n: row.n,\n        mean: row.mean,\n        ciLow: row.ciLow,\n        ciHigh: row.ciHigh,\n        qValue: row.qValue,\n        cohensD: row.cohensD,\n        meanDeltaVsComparator: posterior ? posterior.meanDelta : null,\n        pairedN: posterior?.n ?? gain?.n ?? 0,\n        medianGain: posterior ? posterior.medianDelta : gain ? gain.median : null,\n        meanGain: posterior ? posterior.meanDelta : null,\n        gainCi: posterior ? posterior.ci : gain ? gain.ci : null,\n        prGreaterThanZero: posterior ? posterior.prGreaterThanZero : null,\n        prInRope: posterior ? posterior.prInRope : null,\n        mde: posterior ? posterior.mde : null,\n        onParetoFrontier: point?.onFrontier ?? false,\n        gate: gateDecision ? gateLabel(gateDecision) : undefined,\n        decision: classified.decision,\n        decisionReason: classified.reason,\n      } satisfies ResearchReportCandidate\n    })\n    .sort((a, b) => {\n      const decisionRank = decisionWeight(b.decision) - decisionWeight(a.decision)\n      if (decisionRank !== 0) return decisionRank\n      return b.mean - a.mean\n    })\n\n  const recommendation = buildRecommendation(candidates, {\n    comparator,\n    failureClusters: opts.failureClusters,\n    rope,\n    minPairs,\n    preregistrationHash,\n  })\n  const executiveSummary = buildExecutiveSummary(candidates, recommendation, {\n    comparator,\n    split,\n    failureClusters: opts.failureClusters,\n    preregistrationHash,\n  })\n  const methodology = buildMethodology({\n    split,\n    comparator,\n    fdr,\n    minPairs,\n    rope,\n    confidence,\n    mdePower,\n    mdeAlpha,\n  })\n\n  const runFingerprint = await hashJson(\n    canonicalize({\n      triples: runs\n        .filter((r) => r.splitTag === split)\n        .map((r) => ({ runId: r.runId, candidateId: r.candidateId, splitTag: r.splitTag }))\n        .sort((a, b) => a.runId.localeCompare(b.runId)),\n      comparator,\n      split,\n    }),\n  )\n\n  const markdown = renderResearchMarkdown({\n    title,\n    generatedAt,\n    split,\n    comparator,\n    rope,\n    runFingerprint,\n    preregistrationHash,\n    executiveSummary,\n    recommendation,\n    candidates,\n    summary,\n    pareto,\n    gains,\n    methodology,\n    failureClusters: opts.failureClusters,\n  })\n  const html = renderResearchHtml(markdown, title)\n\n  return {\n    kind: 'agent-eval-research-report',\n    title,\n    generatedAt,\n    split,\n    comparator,\n    runFingerprint,\n    preregistrationHash,\n    rope,\n    executiveSummary,\n    recommendation,\n    candidates,\n    summary,\n    charts: { pareto, gains },\n    methodology,\n    failureClusters: opts.failureClusters,\n    markdown,\n    html,\n  }\n}\n\nfunction buildMethodology(ctx: {\n  split: 'search' | 'holdout'\n  comparator: string | null\n  fdr: number\n  minPairs: number\n  rope: { low: number; high: number } | null\n  confidence: number\n  mdePower: number\n  mdeAlpha: number\n}): ResearchReportMethodology {\n  const assumptions: string[] = [\n    'Pairs are matched by (experimentId, scenarioId, seed); input order does not affect the comparison.',\n    'Paired deltas are exchangeable conditional on the matched scenario — no mid-run distribution shift.',\n    `Decisions are pre-specified at fdr=${ctx.fdr}, minPairs=${ctx.minPairs}, confidence=${ctx.confidence}; deviating from these post-hoc invalidates the false-discovery control.`,\n  ]\n  if (ctx.rope) {\n    assumptions.push(\n      `The Region of Practical Equivalence ${formatRope(ctx.rope)} is supplied by the domain owner; equivalent verdicts are only meaningful if that range is treated as the standing definition of \"no material difference.\"`,\n    )\n  }\n  if (ctx.comparator === null) {\n    assumptions.push('No comparator was configured; this run is descriptive, not causal.')\n  }\n  const methods: string[] = [\n    \"Marginal scores summarised with BH-FDR-adjusted Wilcoxon signed-rank q-values and paired Cohen's dz via summaryTable.\",\n    'Paired evidence summarised with a frequentist bootstrap CI on the median delta and a Dirichlet-weight Bayesian bootstrap for Pr(Δ>0) and Pr(Δ∈ROPE) on the mean delta.',\n    `Minimum detectable effect reported per candidate at α=${ctx.mdeAlpha} (two-sided), power=${ctx.mdePower}, standardised by the observed paired-delta SD.`,\n    'Pareto frontier flagged as a separate axis (cost vs quality); a candidate can be on-frontier without winning the paired test.',\n    'Held-out gate decisions, when supplied, override the statistical verdict in the reject direction.',\n  ]\n  const alternatives: string[] = [\n    'Paired t-test rejected: not robust to the heavy-tailed score distributions common in agent benchmarks.',\n    'Unpaired Mann–Whitney rejected: matched scenarios make pairing free; unpaired throws away that variance reduction.',\n    'Sequential / always-valid inference (e-values, mSPRT) is the right tool for iterative sweeps and is out of scope for this single-look report — preregister and run once, or wrap this report in an alpha-spending schedule.',\n    'Hierarchical Bayesian shrinkage across many candidates is future work; the current ranking uses raw paired statistics.',\n  ]\n  const whenNotToApply: string[] = [\n    `Paired N below ${RESEARCH_REPORT_HARD_PAIR_FLOOR} on any candidate — the bootstrap CI is degenerate.`,\n    'Comparator chosen post-hoc by inspecting the same data; q-values are no longer false-discovery-controlled.',\n    'Scenarios not drawn under a stable preregistered protocol; the report can describe the data but cannot anchor a launch decision.',\n    'Score distributions with mid-run shift (judge model swap, rubric change, infra outage) — pair exchangeability is violated.',\n  ]\n  const citations: string[] = [\n    'Benjamini, Y. & Hochberg, Y. (1995). Controlling the false discovery rate: a practical and powerful approach to multiple testing. JRSS B, 57(1), 289–300.',\n    'Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80–83.',\n    'Efron, B. (1979). Bootstrap methods: another look at the jackknife. Annals of Statistics, 7(1), 1–26.',\n    'Rubin, D. B. (1981). The Bayesian bootstrap. Annals of Statistics, 9(1), 130–134.',\n    'Kruschke, J. K. (2018). Rejecting or accepting parameter values in Bayesian estimation. Advances in Methods and Practices in Psychological Science, 1(2), 270–280. (ROPE.)',\n  ]\n  return { assumptions, methods, alternatives, whenNotToApply, citations }\n}\n\nfunction formatRope(rope: { low: number; high: number }): string {\n  return `[${fmt(rope.low)}, ${fmt(rope.high)}]`\n}\n\nfunction classifyCandidate(\n  row: SummaryTableRow,\n  ctx: {\n    comparator: string | null\n    posterior: ReturnType<typeof pairedPosterior> | null\n    point?: ParetoPoint\n    gateDecision?: GateDecision\n    split: 'search' | 'holdout'\n    fdr: number\n    minPairs: number\n    rope: { low: number; high: number } | null\n  },\n): { decision: ResearchReportDecision; reason: string } {\n  if (ctx.comparator && row.candidateId === ctx.comparator) {\n    return { decision: 'hold', reason: 'Comparator baseline.' }\n  }\n  if (ctx.gateDecision && !ctx.gateDecision.promote) {\n    const code = ctx.gateDecision.rejectionCode ?? 'rejected'\n    return {\n      decision: 'reject',\n      reason: `Held-out gate returned ${code}: ${ctx.gateDecision.reason}`,\n    }\n  }\n  if (!ctx.comparator) {\n    return {\n      decision: ctx.point?.onFrontier ? 'hold' : 'needs_more_data',\n      reason:\n        'No comparator configured; report ranks candidates but cannot anchor a promotion call.',\n    }\n  }\n  if (!ctx.posterior || ctx.posterior.n < RESEARCH_REPORT_HARD_PAIR_FLOOR) {\n    return {\n      decision: 'needs_more_data',\n      reason: `Only ${ctx.posterior?.n ?? 0} paired observations; below hard floor of ${RESEARCH_REPORT_HARD_PAIR_FLOOR} for any paired inference.`,\n    }\n  }\n  const ci = ctx.posterior.ci\n  if (ctx.split === 'search') {\n    return {\n      decision: 'hold',\n      reason:\n        'Search-split evidence is descriptive; release decisions require matched holdout runs.',\n    }\n  }\n  if (ctx.rope && ci.low >= ctx.rope.low && ci.high <= ctx.rope.high) {\n    return {\n      decision: 'equivalent',\n      reason: `Paired-delta CI [${fmt(ci.low)}, ${fmt(ci.high)}] is fully inside ROPE ${formatRope(ctx.rope)}; candidate is practically equivalent to comparator.`,\n    }\n  }\n  const gainPositive = ci.low > 0\n  const gainNegative = ci.high < 0\n  if (gainNegative) {\n    return {\n      decision: 'reject',\n      reason: `Paired-delta CI [${fmt(ci.low)}, ${fmt(ci.high)}] lies entirely below zero.`,\n    }\n  }\n  if (ctx.posterior.n < ctx.minPairs) {\n    return {\n      decision: 'needs_more_data',\n      reason: `Only ${ctx.posterior.n} paired observations; minimum detectable effect at this N is ${fmt(ctx.posterior.mde)} score units (need ≥ ${ctx.minPairs} pairs to issue a directional verdict).`,\n    }\n  }\n  if (row.qValue !== null && row.qValue <= ctx.fdr && gainPositive) {\n    return {\n      decision: 'promote',\n      reason: `BH-adjusted q=${fmt(row.qValue)} ≤ ${ctx.fdr} and paired-delta CI [${fmt(ci.low)}, ${fmt(ci.high)}] excludes zero; Pr(Δ>0)=${fmt(ctx.posterior.prGreaterThanZero)}.`,\n    }\n  }\n  return {\n    decision: 'hold',\n    reason: `Pr(Δ>0)=${fmt(ctx.posterior.prGreaterThanZero)} but CI [${fmt(ci.low)}, ${fmt(ci.high)}] crosses zero; effect not decisive at fdr=${ctx.fdr}.`,\n  }\n}\n\nfunction buildRecommendation(\n  candidates: ResearchReportCandidate[],\n  ctx: {\n    comparator: string | null\n    failureClusters?: FailureClusterReport\n    rope: { low: number; high: number } | null\n    minPairs: number\n    preregistrationHash: string | null\n  },\n): ResearchReportRecommendation {\n  const nonComparator = candidates.filter((c) => c.candidateId !== ctx.comparator)\n  const bestPromote = nonComparator.find((c) => c.decision === 'promote')\n  const bestEquivalent = nonComparator.find((c) => c.decision === 'equivalent')\n  const chosen = bestPromote ?? bestEquivalent ?? nonComparator[0] ?? null\n  const decision: ResearchReportDecision = bestPromote\n    ? 'promote'\n    : nonComparator.some((c) => c.decision === 'needs_more_data')\n      ? 'needs_more_data'\n      : bestEquivalent\n        ? 'equivalent'\n        : nonComparator.some((c) => c.decision === 'hold')\n          ? 'hold'\n          : 'reject'\n\n  const rationale: string[] = []\n  const risks: string[] = []\n  const nextActions: string[] = []\n\n  if (chosen) {\n    rationale.push(`${chosen.candidateId}: ${chosen.decisionReason}`)\n    if (chosen.gainCi) {\n      const probSummary =\n        chosen.prGreaterThanZero !== null ? `, Pr(Δ>0)=${fmt(chosen.prGreaterThanZero)}` : ''\n      rationale.push(\n        `Median paired gain CI: [${fmt(chosen.gainCi.low)}, ${fmt(chosen.gainCi.high)}]${probSummary}.`,\n      )\n    }\n    if (chosen.mde !== null && Number.isFinite(chosen.mde)) {\n      rationale.push(`MDE at current paired N=${chosen.pairedN}: ${fmt(chosen.mde)} score units.`)\n    }\n  }\n  if (!ctx.comparator) {\n    risks.push('No comparator was configured; verdict is descriptive, not causal.')\n    nextActions.push('Re-run with a stable comparator candidate for paired inference.')\n  }\n  if (!ctx.preregistrationHash) {\n    risks.push(\n      'No preregistration hash supplied; readers cannot verify the analysis was specified before data inspection.',\n    )\n    nextActions.push(\n      'Sign a HypothesisManifest before the next sweep and pass `preregistrationHash` so the report cites it.',\n    )\n  }\n  if (ctx.rope === null && nonComparator.length > 0) {\n    risks.push(\n      'No ROPE configured; the report cannot distinguish \"equivalent\" from \"inconclusive\".',\n    )\n    nextActions.push(\n      'Define a domain-specific Region of Practical Equivalence and pass it to lock in the equivalence threshold.',\n    )\n  }\n  const inconclusive = nonComparator.filter((c) => c.decision === 'needs_more_data')\n  if (inconclusive.length > 0) {\n    const worst = inconclusive.reduce((a, b) => (b.pairedN < a.pairedN ? b : a))\n    risks.push(\n      `${inconclusive.length} candidate(s) below soft floor (${ctx.minPairs} pairs); thinnest is ${worst.candidateId} with ${worst.pairedN}.`,\n    )\n    nextActions.push(\n      `Collect at least ${ctx.minPairs - worst.pairedN} more matched holdout runs for ${worst.candidateId}.`,\n    )\n  }\n  const rejected = nonComparator.filter((c) => c.decision === 'reject')\n  if (rejected.length > 0) {\n    risks.push(\n      `${rejected.length} candidate(s) failed the paired test or held-out gate; do not ship those variants.`,\n    )\n  }\n  if (ctx.failureClusters && ctx.failureClusters.clusters.length > 0) {\n    const top = ctx.failureClusters.clusters[0]!\n    risks.push(`Top failure cluster: ${top.failureClass} across ${top.runCount} run(s).`)\n    nextActions.push('Prioritize the largest failure cluster before broad rollout.')\n  }\n  if (decision === 'promote') {\n    nextActions.push('Ship behind the existing promotion gate and monitor canaries.')\n  } else if (decision === 'hold') {\n    nextActions.push('Keep current production candidate while expanding holdout evidence.')\n  } else if (decision === 'equivalent') {\n    nextActions.push(\n      'Either keep the comparator (no quality regression) or promote on cost/latency grounds — equivalence does not justify either; the choice is a product decision, not a stats one.',\n    )\n  } else if (decision === 'reject') {\n    nextActions.push(\n      'Do not promote this sweep; inspect failures and generate a revised candidate.',\n    )\n  }\n\n  return {\n    decision,\n    candidateId: chosen?.candidateId ?? null,\n    rationale,\n    risks,\n    nextActions,\n  }\n}\n\nfunction buildExecutiveSummary(\n  candidates: ResearchReportCandidate[],\n  recommendation: ResearchReportRecommendation,\n  ctx: {\n    comparator: string | null\n    split: 'search' | 'holdout'\n    failureClusters?: FailureClusterReport\n    preregistrationHash: string | null\n  },\n): string[] {\n  const lines: string[] = []\n  const nonComparator = candidates.filter((c) => c.candidateId !== ctx.comparator)\n  lines.push(\n    `Evaluated ${nonComparator.length} candidate(s) on the ${ctx.split} split${ctx.comparator ? ` against ${ctx.comparator}` : ''}.`,\n  )\n  lines.push(\n    `Recommendation: ${recommendation.decision}${recommendation.candidateId ? ` ${recommendation.candidateId}` : ''}.`,\n  )\n  const promoted = nonComparator.filter((c) => c.decision === 'promote').length\n  const held = nonComparator.filter((c) => c.decision === 'hold').length\n  const equivalent = nonComparator.filter((c) => c.decision === 'equivalent').length\n  const rejected = nonComparator.filter((c) => c.decision === 'reject').length\n  const more = nonComparator.filter((c) => c.decision === 'needs_more_data').length\n  lines.push(\n    `Decision mix: ${promoted} promote, ${equivalent} equivalent, ${held} hold, ${rejected} reject, ${more} need more data.`,\n  )\n  const frontier = nonComparator.filter((c) => c.onParetoFrontier).map((c) => c.candidateId)\n  if (frontier.length > 0) lines.push(`Pareto-frontier candidates: ${frontier.join(', ')}.`)\n  if (ctx.failureClusters) {\n    lines.push(\n      `Failure clustering found ${ctx.failureClusters.totalFailures}/${ctx.failureClusters.totalRuns} failed runs across ${ctx.failureClusters.clusters.length} reportable cluster(s).`,\n    )\n  }\n  lines.push(\n    ctx.preregistrationHash\n      ? `Preregistered analysis: ${ctx.preregistrationHash.slice(0, 12)}…`\n      : 'Analysis is post-hoc — no preregistration hash supplied.',\n  )\n  return lines\n}\n\nfunction renderResearchMarkdown(report: {\n  title: string\n  generatedAt: string\n  split: 'search' | 'holdout'\n  comparator: string | null\n  executiveSummary: string[]\n  recommendation: ResearchReportRecommendation\n  candidates: ResearchReportCandidate[]\n  summary: SummaryTable\n  pareto: ParetoFigureSpec\n  gains: GainDistributionFigureSpec[]\n  rope: { low: number; high: number } | null\n  runFingerprint: string\n  preregistrationHash: string | null\n  methodology: ResearchReportMethodology\n  failureClusters?: FailureClusterReport\n}): string {\n  const lines: string[] = []\n  lines.push(`# ${report.title}`)\n  lines.push('')\n  lines.push(`**Generated:** ${report.generatedAt}`)\n  lines.push(`**Primary split:** ${report.split}`)\n  lines.push(`**Comparator:** ${report.comparator ?? 'not configured'}`)\n  lines.push(`**ROPE:** ${report.rope ? formatRope(report.rope) : 'not configured'}`)\n  lines.push(`**Run fingerprint:** \\`${report.runFingerprint}\\``)\n  lines.push(\n    `**Preregistration:** ${report.preregistrationHash ? `\\`${report.preregistrationHash}\\`` : 'none'}`,\n  )\n  lines.push('')\n  lines.push('## Executive Summary')\n  lines.push('')\n  for (const item of report.executiveSummary) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('## Recommendation')\n  lines.push('')\n  lines.push(`**Decision:** ${report.recommendation.decision}`)\n  lines.push(`**Candidate:** ${report.recommendation.candidateId ?? 'N/A'}`)\n  lines.push('')\n  lines.push('### Rationale')\n  lines.push('')\n  for (const item of report.recommendation.rationale) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Risks')\n  lines.push('')\n  for (const item of report.recommendation.risks.length\n    ? report.recommendation.risks\n    : ['No material report-level risks detected.']) {\n    lines.push(`- ${item}`)\n  }\n  lines.push('')\n  lines.push('### Next Actions')\n  lines.push('')\n  for (const item of report.recommendation.nextActions) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('## Candidate Decision Table')\n  lines.push('')\n  lines.push(\n    '| Candidate | Decision | Mean | Δ̄ | Pr(Δ>0) | q | dz | Paired N | Median Gain CI | MDE | Pareto | Gate |',\n  )\n  lines.push('|---|---|---:|---:|---:|---:|---:|---:|---|---:|---|---|')\n  for (const c of report.candidates) {\n    const delta = c.meanDeltaVsComparator === null ? '-' : signed(c.meanDeltaVsComparator)\n    const prGt = c.prGreaterThanZero === null ? '-' : c.prGreaterThanZero.toFixed(3)\n    const q = c.qValue !== null ? c.qValue.toFixed(4) : '-'\n    const d = c.cohensD !== null ? c.cohensD.toFixed(3) : '-'\n    const gain = c.gainCi ? `[${fmt(c.gainCi.low)}, ${fmt(c.gainCi.high)}]` : '-'\n    const mde = c.mde === null || !Number.isFinite(c.mde) ? '-' : fmt(c.mde)\n    lines.push(\n      `| ${c.candidateId} | ${c.decision} | ${fmt(c.mean)} | ${delta} | ${prGt} | ${q} | ${d} | ${c.pairedN} | ${gain} | ${mde} | ${c.onParetoFrontier ? 'yes' : 'no'} | ${c.gate ?? '-'} |`,\n    )\n  }\n  lines.push('')\n  lines.push('## Statistical Summary')\n  lines.push('')\n  lines.push(report.summary.markdown)\n  lines.push('')\n  lines.push('## Methodology')\n  lines.push('')\n  lines.push('### Assumptions')\n  lines.push('')\n  for (const item of report.methodology.assumptions) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Methods')\n  lines.push('')\n  for (const item of report.methodology.methods) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Alternatives Considered')\n  lines.push('')\n  for (const item of report.methodology.alternatives) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### When NOT To Apply')\n  lines.push('')\n  for (const item of report.methodology.whenNotToApply) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('### Citations')\n  lines.push('')\n  for (const item of report.methodology.citations) lines.push(`- ${item}`)\n  lines.push('')\n  lines.push('## Chart Specs')\n  lines.push('')\n  lines.push(\n    'The report carries JSON chart specs for Pareto cost/quality and paired gain histograms.',\n  )\n  lines.push('')\n  lines.push('```json')\n  lines.push(JSON.stringify({ pareto: report.pareto, gains: report.gains }, null, 2))\n  lines.push('```')\n  if (report.failureClusters) {\n    lines.push('')\n    lines.push('## Failure Clusters')\n    lines.push('')\n    lines.push('| Failure Class | Runs | Scenarios | Tool | Example |')\n    lines.push('|---|---:|---:|---|---|')\n    for (const c of report.failureClusters.clusters.slice(0, 10)) {\n      lines.push(\n        `| ${c.failureClass} | ${c.runCount} | ${c.scenarioIds.length} | ${c.toolName ?? '-'} | ${escapePipes(c.exampleError ?? c.exampleRunId)} |`,\n      )\n    }\n  }\n  return lines.join('\\n')\n}\n\nfunction renderResearchHtml(markdown: string, title: string): string {\n  const body = markdownToHtml(markdown)\n  return [\n    '<!doctype html>',\n    '<html lang=\"en\">',\n    '<head>',\n    '<meta charset=\"utf-8\">',\n    '<meta name=\"viewport\" content=\"width=device-width, initial-scale=1\">',\n    `<title>${escapeHtml(title)}</title>`,\n    '<style>',\n    'body{font-family:Inter,ui-sans-serif,system-ui,-apple-system,BlinkMacSystemFont,\"Segoe UI\",sans-serif;margin:0;color:#172026;background:#f7f8f8;}',\n    'main{max-width:1080px;margin:0 auto;padding:40px 24px 64px;background:#fff;min-height:100vh;}',\n    'h1{font-size:34px;line-height:1.15;margin:0 0 20px;}h2{margin-top:34px;border-top:1px solid #d9dfdf;padding-top:22px;}h3{margin-top:22px;}',\n    'p,li{line-height:1.55;}table{border-collapse:collapse;width:100%;margin:16px 0;font-size:14px;}th,td{border:1px solid #d9dfdf;padding:8px;text-align:left;}th{background:#eef2f2;}',\n    'code,pre{font-family:ui-monospace,SFMono-Regular,Menlo,monospace;}pre{overflow:auto;background:#111827;color:#f9fafb;padding:16px;border-radius:6px;}',\n    '</style>',\n    '</head>',\n    '<body><main>',\n    body,\n    '</main></body></html>',\n  ].join('\\n')\n}\n\nfunction markdownToHtml(markdown: string): string {\n  const lines = markdown.split('\\n')\n  const html: string[] = []\n  let inList = false\n  let inCode = false\n  let code: string[] = []\n  let table: string[] = []\n\n  const flushList = () => {\n    if (inList) {\n      html.push('</ul>')\n      inList = false\n    }\n  }\n  const flushTable = () => {\n    if (table.length === 0) return\n    html.push(renderMarkdownTable(table))\n    table = []\n  }\n\n  for (const line of lines) {\n    if (line.startsWith('```')) {\n      if (inCode) {\n        html.push(`<pre><code>${escapeHtml(code.join('\\n'))}</code></pre>`)\n        code = []\n        inCode = false\n      } else {\n        flushList()\n        flushTable()\n        inCode = true\n      }\n      continue\n    }\n    if (inCode) {\n      code.push(line)\n      continue\n    }\n    if (line.startsWith('|')) {\n      flushList()\n      table.push(line)\n      continue\n    }\n    flushTable()\n    if (line.startsWith('- ')) {\n      if (!inList) {\n        html.push('<ul>')\n        inList = true\n      }\n      html.push(`<li>${inlineMarkdown(line.slice(2))}</li>`)\n      continue\n    }\n    flushList()\n    if (line.startsWith('# ')) html.push(`<h1>${inlineMarkdown(line.slice(2))}</h1>`)\n    else if (line.startsWith('## ')) html.push(`<h2>${inlineMarkdown(line.slice(3))}</h2>`)\n    else if (line.startsWith('### ')) html.push(`<h3>${inlineMarkdown(line.slice(4))}</h3>`)\n    else if (line.trim() === '') html.push('')\n    else html.push(`<p>${inlineMarkdown(line)}</p>`)\n  }\n  flushList()\n  flushTable()\n  return html.join('\\n')\n}\n\nfunction renderMarkdownTable(lines: string[]): string {\n  const rows = lines\n    .filter((line) => !/^\\|[-:\\s|]+\\|$/.test(line))\n    .map((line) =>\n      line\n        .slice(1, -1)\n        .split('|')\n        .map((cell) => inlineMarkdown(cell.trim())),\n    )\n  if (rows.length === 0) return ''\n  const [head, ...body] = rows\n  const th = head!.map((cell) => `<th>${cell}</th>`).join('')\n  const trs = body\n    .map((row) => `<tr>${row.map((cell) => `<td>${cell}</td>`).join('')}</tr>`)\n    .join('\\n')\n  return `<table><thead><tr>${th}</tr></thead><tbody>${trs}</tbody></table>`\n}\n\nfunction inlineMarkdown(s: string): string {\n  return escapeHtml(s).replace(/\\*\\*([^*]+)\\*\\*/g, '<strong>$1</strong>')\n}\n\nfunction escapeHtml(s: string): string {\n  return s\n    .replace(/&/g, '&amp;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n    .replace(/\"/g, '&quot;')\n}\n\nfunction escapePipes(s: string): string {\n  return s.replace(/\\|/g, '\\\\|')\n}\n\nfunction decisionWeight(decision: ResearchReportDecision): number {\n  if (decision === 'promote') return 5\n  if (decision === 'equivalent') return 4\n  if (decision === 'hold') return 3\n  if (decision === 'needs_more_data') return 2\n  return 1\n}\n\nfunction signed(x: number): string {\n  return `${x >= 0 ? '+' : ''}${fmt(x)}`\n}\n\n// ── tiny helpers ─────────────────────────────────────────────────────\n\nfunction avg(xs: number[]): number {\n  if (xs.length === 0) return Number.NaN\n  return xs.reduce((s, x) => s + x, 0) / xs.length\n}\n\nfunction medianOfSorted(sorted: number[]): number {\n  if (sorted.length === 0) return 0\n  const mid = Math.floor(sorted.length / 2)\n  return sorted.length % 2 === 0 ? (sorted[mid - 1]! + sorted[mid]!) / 2 : sorted[mid]!\n}\n\nfunction fmt(x: number): string {\n  if (!Number.isFinite(x)) return String(x)\n  return x.toFixed(4)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAoFO,SAAS,aAAa,MAAmB,OAA4B,CAAC,GAAiB;AAC5F,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,aAAa,UAAU,YAAY,iBAAiB;AAE1D,QAAM,cAAc,oBAAI,IAAqD;AAC7E,aAAW,KAAK,MAAM;AACpB,QAAI,EAAE,aAAa,MAAO;AAC1B,UAAM,IAAI,EAAE,QAAQ,UAAU;AAC9B,QAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,EAAG;AAClD,UAAM,SAAS,YAAY,IAAI,EAAE,WAAW,KAAK,EAAE,MAAM,CAAC,GAAG,QAAQ,CAAC,EAAE;AACxE,WAAO,KAAK,KAAK,CAAC;AAClB,WAAO,OAAO,KAAK,CAAC;AACpB,gBAAY,IAAI,EAAE,aAAa,MAAM;AAAA,EACvC;AAEA,QAAM,eAAe,CAAC,GAAG,YAAY,KAAK,CAAC,EAAE,KAAK;AAClD,QAAM,WAAW,aAAa,YAAY,IAAI,UAAU,IAAI;AAG5D,QAAM,YAA8D,CAAC;AACrE,aAAW,MAAM,cAAc;AAC7B,UAAM,SAAS,YAAY,IAAI,EAAE;AACjC,UAAM,KAAK,mBAAmB,OAAO,QAAQ,UAAU;AACvD,QAAI,OAAsB;AAC1B,QAAI,IAAmB;AACvB,QAAI,UAAyB;AAC7B,QAAI,qBAAoC;AACxC,QAAI,sBAAqC;AACzC,QAAI,cAAc,YAAY,OAAO,YAAY;AAC/C,YAAM,SAAS,gBAAgB,OAAO,MAAM,SAAS,MAAM,UAAU;AACrE,gBAAU,OAAO,OAAO;AACxB,2BAAqB,OAAO;AAC5B,4BAAsB,OAAO;AAC7B,UAAI,OAAO,OAAO,UAAU,GAAG;AAC7B,eAAO,mBAAmB,OAAO,QAAQ,OAAO,KAAK,EAAE;AAAA,MACzD;AACA,UAAI,eAAe,OAAO,QAAQ,OAAO,KAAK;AAAA,IAChD;AACA,cAAU,KAAK;AAAA,MACb,aAAa;AAAA,MACb,GAAG,OAAO,OAAO;AAAA,MACjB,MAAM,GAAG;AAAA,MACT,OAAO,GAAG;AAAA,MACV,QAAQ,GAAG;AAAA,MACX,QAAQ;AAAA,MACR,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAKA,MAAI,YAAY;AACd,UAAM,OAAiB,CAAC;AACxB,UAAM,KAAe,CAAC;AACtB,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,IAAI,UAAU,CAAC;AACrB,UAAI,EAAE,gBAAgB,WAAY;AAClC,UAAI,EAAE,SAAS,QAAQ,CAAC,OAAO,SAAS,EAAE,IAAI,EAAG;AACjD,WAAK,KAAK,CAAC;AACX,SAAG,KAAK,EAAE,IAAI;AAAA,IAChB;AACA,QAAI,GAAG,SAAS,GAAG;AACjB,YAAM,EAAE,QAAQ,IAAI,kBAAkB,IAAI,GAAG;AAC7C,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAU,KAAK,CAAC,CAAE,EAAG,SAAS,QAAQ,CAAC;AAAA,MACzC;AAAA,IACF;AAAA,EACF;AAEA,QAAM,OAAO,UAAU,IAAI,CAAC,EAAE,MAAM,OAAO,GAAG,KAAK,MAAM,IAAI;AAC7D,QAAM,WAAW,2BAA2B,MAAM,YAAY,KAAK;AACnE,SAAO,EAAE,MAAM,YAAY,OAAO,SAAS;AAC7C;AAEA,SAAS,gBACP,WACA,UACA,YAMA;AACA,QAAM,kBAAkB,UAAU,OAAO,CAAC,QAAQ,OAAO,SAAS,IAAI,QAAQ,UAAU,CAAC,CAAC;AAC1F,QAAM,iBAAiB,SAAS,OAAO,CAAC,QAAQ,OAAO,SAAS,IAAI,QAAQ,UAAU,CAAC,CAAC;AACxF,QAAM,UAAU,eAAe,gBAAgB,eAAe;AAC9D,SAAO;AAAA,IACL,QAAQ,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,SAAS,QAAQ,UAAU,CAAE;AAAA,IACtE,OAAO,QAAQ,MAAM,IAAI,CAAC,SAAS,KAAK,UAAU,QAAQ,UAAU,CAAE;AAAA,IACtE,oBAAoB,QAAQ,kBAAkB;AAAA,IAC9C,qBAAqB,QAAQ,iBAAiB;AAAA,EAChD;AACF;AAEA,SAAS,2BACP,MACA,YACA,OACQ;AACR,QAAM,QAAkB,CAAC;AACzB,QAAM,WAAW,aAAa,QAAQ,UAAU,MAAM;AACtD,QAAM,KAAK,wBAAmB,KAAK,SAAS,QAAQ,EAAE;AACtD,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,4EAA4E;AACvF,QAAM,KAAK,yCAAyC;AACpD,aAAW,KAAK,MAAM;AACpB,UAAM,KAAK,IAAI,IAAI,EAAE,KAAK,CAAC,KAAK,IAAI,EAAE,MAAM,CAAC;AAC7C,UAAM,IAAI,EAAE,WAAW,OAAO,EAAE,OAAO,QAAQ,CAAC,IAAI;AACpD,UAAM,IAAI,EAAE,YAAY,OAAO,EAAE,QAAQ,QAAQ,CAAC,IAAI;AACtD,UAAM,SAAS,EAAE,WAAW;AAC5B,UAAM,WACJ,EAAE,uBAAuB,QAAQ,EAAE,wBAAwB,OACvD,WACA,GAAG,EAAE,kBAAkB,IAAI,EAAE,mBAAmB;AACtD,UAAM;AAAA,MACJ,KAAK,EAAE,WAAW,MAAM,EAAE,CAAC,MAAM,MAAM,MAAM,QAAQ,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;AAAA,IAC9F;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAgCO,SAAS,YACd,MACA,OAGI,CAAC,GACa;AAClB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,UAAU,YAAY,iBAAiB;AAE1D,QAAM,UAAU,oBAAI,IAAmD;AACvE,aAAW,KAAK,MAAM;AACpB,QAAI,EAAE,aAAa,MAAO;AAC1B,UAAM,IAAI,EAAE,QAAQ,UAAU;AAC9B,QAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,EAAG;AAClD,QAAI,EAAE,YAAY,KAAM;AACxB,UAAM,SAAS,QAAQ,IAAI,EAAE,WAAW,KAAK,EAAE,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE;AACrE,WAAO,KAAK,KAAK,EAAE,OAAO;AAC1B,WAAO,QAAQ,KAAK,CAAC;AACrB,YAAQ,IAAI,EAAE,aAAa,MAAM;AAAA,EACnC;AAEA,QAAM,SAAwB,CAAC;AAC/B,aAAW,CAAC,aAAa,MAAM,KAAK,QAAQ,QAAQ,GAAG;AACrD,WAAO,KAAK;AAAA,MACV;AAAA,MACA,MAAM,IAAI,OAAO,IAAI;AAAA,MACrB,SAAS,IAAI,OAAO,OAAO;AAAA,MAC3B,GAAG,OAAO,KAAK;AAAA,MACf,YAAY;AAAA,MACZ,MAAM,KAAK,gBAAgB,WAAW,IAClC,UAAU,KAAK,cAAc,WAAW,CAAE,IAC1C;AAAA,IACN,CAAC;AAAA,EACH;AAKA,aAAW,KAAK,QAAQ;AACtB,MAAE,aAAa,CAAC,OAAO,KAAK,CAAC,MAAM,MAAM,KAAK,UAAU,GAAG,CAAC,CAAC;AAAA,EAC/D;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,MAAM,EAAE,GAAG,WAAW,GAAG,QAAQ;AAAA,IACjC;AAAA,EACF;AACF;AAEA,SAAS,UAAU,GAAgB,GAAyB;AAC1D,SAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE;AACzF;AAEA,SAAS,UAAU,GAAsC;AACvD,SAAO,EAAE,UAAU,YAAY;AACjC;AA+CO,SAAS,cACd,MACA,aACA,YACA,OAAgC,CAAC,GACL;AAC5B,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,UAAU,YAAY,iBAAiB;AAC1D,QAAM,WAAW,KAAK,QAAQ;AAC9B,MAAI,WAAW,EAAG,OAAM,IAAI,MAAM,sCAAiC;AAEnE,QAAM,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,eAAe,EAAE,aAAa,KAAK;AAC1F,QAAM,WAAW,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,cAAc,EAAE,aAAa,KAAK;AACxF,QAAM,EAAE,QAAQ,OAAO,oBAAoB,oBAAoB,IAAI;AAAA,IACjE;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,IAAI,OAAO;AAEjB,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,MACL,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAG;AAAA,MACH;AAAA,MACA;AAAA,MACA,MAAM,CAAC;AAAA,MACP,QAAQ;AAAA,MACR,IAAI;AAAA,IACN;AAAA,EACF;AAEA,QAAM,SAAS,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AACjD,QAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACrD,QAAM,SAAS,eAAe,YAAY;AAC1C,QAAM,MAAM,aAAa,CAAC;AAC1B,QAAM,MAAM,aAAa,aAAa,SAAS,CAAC;AAIhD,QAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,GAAG,IAAI;AACzD,QAAM,KAAK,CAAC;AACZ,QAAM,KAAK;AACX,QAAM,SAAS,KAAK,MAAM;AAC1B,QAAM,OAA8B,CAAC;AACrC,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,SAAK,KAAK,EAAE,IAAI,KAAK,IAAI,OAAO,IAAI,MAAM,IAAI,KAAK,OAAO,OAAO,EAAE,CAAC;AAAA,EACtE;AACA,aAAW,KAAK,QAAQ;AACtB,QAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK;AACrC,QAAI,MAAM,EAAG,OAAM;AACnB,QAAI,OAAO,SAAU,OAAM,WAAW;AACtC,SAAK,GAAG,EAAG,SAAS;AAAA,EACtB;AAEA,QAAM,KAAK,gBAAgB,QAAQ,OAAO;AAAA,IACxC,YAAY,KAAK,cAAc;AAAA,IAC/B,WAAW,KAAK,aAAa;AAAA,IAC7B,WAAW;AAAA,IACX,MAAM,KAAK;AAAA,EACb,CAAC;AAED,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,KAAK;AAAA,EACnC;AACF;AAgBO,IAAM,kCAAkC;AA0J/C,SAAS,gBACP,MACA,aACA,YACA,MAiBO;AACP,QAAM,aAAa,KAAK,UAAU,YAAY,iBAAiB;AAC/D,QAAM,YAAY,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,eAAe,EAAE,aAAa,KAAK,KAAK;AAC/F,QAAM,WAAW,KAAK,OAAO,CAAC,MAAM,EAAE,gBAAgB,cAAc,EAAE,aAAa,KAAK,KAAK;AAC7F,QAAM,EAAE,QAAQ,MAAM,IAAI,gBAAgB,WAAW,UAAU,UAAU;AACzE,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,EAAG,QAAO;AAEpB,QAAM,SAAS,OAAO,IAAI,CAAC,GAAG,MAAM,MAAM,CAAC,IAAK,CAAC;AACjD,QAAM,YAAY,OAAO,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;AACtD,QAAM,eAAe,CAAC,GAAG,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACrD,QAAM,cAAc,eAAe,YAAY;AAC/C,QAAM,UAAU,MAAM,QAAQ,SAAS;AAEvC,QAAM,KAAK,gBAAgB,QAAQ,OAAO;AAAA,IACxC,YAAY,KAAK;AAAA,IACjB,WAAW;AAAA,IACX,WAAW;AAAA,IACX,MAAM,KAAK;AAAA,EACb,CAAC;AAED,QAAM,cAAc,6BAA6B,QAAQ,KAAM,KAAK,IAAI;AACxE,QAAM,oBACJ,YAAY,WAAW,IAAI,IAAI,YAAY,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,SAAS,YAAY;AACvF,QAAM,WACJ,KAAK,SAAS,QAAQ,YAAY,WAAW,IACzC,OACA,YAAY,OAAO,CAAC,MAAM,KAAK,KAAK,KAAM,OAAO,KAAK,KAAK,KAAM,IAAI,EAAE,SACvE,YAAY;AAElB,QAAM,gBAAgB,UAAU,EAAE,SAAS,GAAG,OAAO,KAAK,UAAU,OAAO,KAAK,SAAS,CAAC;AAC1F,QAAM,MAAM,YAAY,IAAI,IAAI,gBAAgB;AAEhD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,IAAI,EAAE,KAAK,GAAG,KAAK,MAAM,GAAG,KAAK;AAAA,IACjC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,6BACP,QACA,WACA,MACU;AACV,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,EAAG,QAAO,CAAC;AACrB,MAAI,MAAM,EAAG,QAAO,IAAI,MAAc,SAAS,EAAE,KAAK,OAAO,CAAC,CAAE;AAChE,QAAM,MAAM,QAAQ,IAAI;AACxB,QAAM,UAAU,IAAI,MAAc,SAAS;AAC3C,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,cAAc;AAClB,QAAI,YAAY;AAChB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,OAAO,WAAW,IAAI,CAAC,CAAC;AAC1D,qBAAe,OAAO,CAAC,IAAK;AAC5B,mBAAa;AAAA,IACf;AACA,YAAQ,CAAC,IAAI,cAAc;AAAA,EAC7B;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,MAA6B;AAC5C,MAAI,SAAS,OAAW,QAAO,KAAK;AACpC,MAAI,IAAI,SAAS;AACjB,SAAO,MAAM;AACX,QAAK,IAAI,eAAgB;AACzB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;AACnC,SAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;AACxC,aAAS,IAAK,MAAM,QAAS,KAAK;AAAA,EACpC;AACF;AAEA,SAAS,MAAM,IAAc,MAAsB;AACjD,MAAI,GAAG,SAAS,EAAG,QAAO;AAC1B,MAAI,MAAM;AACV,aAAW,KAAK,GAAI,SAAQ,IAAI,SAAS;AACzC,SAAO,KAAK,KAAK,OAAO,GAAG,SAAS,EAAE;AACxC;AAqBA,eAAsB,eACpB,MACA,OAA8B,CAAC,GACN;AACzB,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,aAAa,KAAK,cAAc;AACtC,QAAM,MAAM,KAAK,OAAO;AACxB,QAAM,WAAW,KAAK,IAAI,KAAK,YAAY,IAAI,+BAA+B;AAC9E,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,WAAW,KAAK,YAAY;AAClC,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,cAAc,KAAK,gBAAe,oBAAI,KAAK,GAAE,YAAY;AAC/D,QAAM,sBAAsB,KAAK,uBAAuB;AAExD,MAAI,QAAQ,EAAE,OAAO,SAAS,KAAK,GAAG,KAAK,OAAO,SAAS,KAAK,IAAI,KAAK,KAAK,OAAO,KAAK,OAAO;AAC/F,UAAM,IAAI;AAAA,MACR,6EAAwE,KAAK,UAAU,IAAI,CAAC;AAAA,IAC9F;AAAA,EACF;AAEA,QAAM,UAAU,aAAa,MAAM;AAAA,IACjC,YAAY,cAAc;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,SAAS,YAAY,MAAM,EAAE,OAAO,eAAe,KAAK,cAAc,CAAC;AAC7E,QAAM,eACJ,KAAK,gBAAgB,QAAQ,KAAK,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,OAAO,CAAC,OAAO,OAAO,UAAU;AAC9F,QAAM,QAAQ,aACV,aAAa;AAAA,IAAI,CAAC,OAChB,cAAc,MAAM,IAAI,YAAY;AAAA,MAClC;AAAA,MACA;AAAA,MACA,MAAM,KAAK;AAAA,IACb,CAAC;AAAA,EACH,IACA,CAAC;AAEL,QAAM,kBAAkB,IAAI,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;AACpE,QAAM,oBAAoB,IAAI,IAAI,OAAO,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;AAC9E,QAAM,uBAAuB,oBAAI,IAAgD;AACjF,MAAI,YAAY;AACd,eAAW,MAAM,cAAc;AAC7B,2BAAqB;AAAA,QACnB;AAAA,QACA,gBAAgB,MAAM,IAAI,YAAY;AAAA,UACpC;AAAA,UACA;AAAA,UACA,MAAM,KAAK;AAAA,UACX;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAEA,QAAM,aAAa,QAAQ,KACxB,IAAI,CAAC,QAAQ;AACZ,UAAM,OAAO,gBAAgB,IAAI,IAAI,WAAW;AAChD,UAAM,QAAQ,kBAAkB,IAAI,IAAI,WAAW;AACnD,UAAM,YAAY,qBAAqB,IAAI,IAAI,WAAW,KAAK;AAC/D,UAAM,eAAe,KAAK,gBAAgB,IAAI,WAAW;AACzD,UAAM,aAAa,kBAAkB,KAAK;AAAA,MACxC;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AACD,WAAO;AAAA,MACL,aAAa,IAAI;AAAA,MACjB,GAAG,IAAI;AAAA,MACP,MAAM,IAAI;AAAA,MACV,OAAO,IAAI;AAAA,MACX,QAAQ,IAAI;AAAA,MACZ,QAAQ,IAAI;AAAA,MACZ,SAAS,IAAI;AAAA,MACb,uBAAuB,YAAY,UAAU,YAAY;AAAA,MACzD,SAAS,WAAW,KAAK,MAAM,KAAK;AAAA,MACpC,YAAY,YAAY,UAAU,cAAc,OAAO,KAAK,SAAS;AAAA,MACrE,UAAU,YAAY,UAAU,YAAY;AAAA,MAC5C,QAAQ,YAAY,UAAU,KAAK,OAAO,KAAK,KAAK;AAAA,MACpD,mBAAmB,YAAY,UAAU,oBAAoB;AAAA,MAC7D,UAAU,YAAY,UAAU,WAAW;AAAA,MAC3C,KAAK,YAAY,UAAU,MAAM;AAAA,MACjC,kBAAkB,OAAO,cAAc;AAAA,MACvC,MAAM,eAAe,UAAU,YAAY,IAAI;AAAA,MAC/C,UAAU,WAAW;AAAA,MACrB,gBAAgB,WAAW;AAAA,IAC7B;AAAA,EACF,CAAC,EACA,KAAK,CAAC,GAAG,MAAM;AACd,UAAM,eAAe,eAAe,EAAE,QAAQ,IAAI,eAAe,EAAE,QAAQ;AAC3E,QAAI,iBAAiB,EAAG,QAAO;AAC/B,WAAO,EAAE,OAAO,EAAE;AAAA,EACpB,CAAC;AAEH,QAAM,iBAAiB,oBAAoB,YAAY;AAAA,IACrD;AAAA,IACA,iBAAiB,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AACD,QAAM,mBAAmB,sBAAsB,YAAY,gBAAgB;AAAA,IACzE;AAAA,IACA;AAAA,IACA,iBAAiB,KAAK;AAAA,IACtB;AAAA,EACF,CAAC;AACD,QAAM,cAAc,iBAAiB;AAAA,IACnC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,QAAM,iBAAiB,MAAM;AAAA,IAC3B,aAAa;AAAA,MACX,SAAS,KACN,OAAO,CAAC,MAAM,EAAE,aAAa,KAAK,EAClC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,aAAa,EAAE,aAAa,UAAU,EAAE,SAAS,EAAE,EACjF,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,cAAc,EAAE,KAAK,CAAC;AAAA,MAChD;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,WAAW,uBAAuB;AAAA,IACtC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,iBAAiB,KAAK;AAAA,EACxB,CAAC;AACD,QAAM,OAAO,mBAAmB,UAAU,KAAK;AAE/C,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,EAAE,QAAQ,MAAM;AAAA,IACxB;AAAA,IACA,iBAAiB,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,KASI;AAC5B,QAAM,cAAwB;AAAA,IAC5B;AAAA,IACA;AAAA,IACA,sCAAsC,IAAI,GAAG,cAAc,IAAI,QAAQ,gBAAgB,IAAI,UAAU;AAAA,EACvG;AACA,MAAI,IAAI,MAAM;AACZ,gBAAY;AAAA,MACV,uCAAuC,WAAW,IAAI,IAAI,CAAC;AAAA,IAC7D;AAAA,EACF;AACA,MAAI,IAAI,eAAe,MAAM;AAC3B,gBAAY,KAAK,oEAAoE;AAAA,EACvF;AACA,QAAM,UAAoB;AAAA,IACxB;AAAA,IACA;AAAA,IACA,8DAAyD,IAAI,QAAQ,uBAAuB,IAAI,QAAQ;AAAA,IACxG;AAAA,IACA;AAAA,EACF;AACA,QAAM,eAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,iBAA2B;AAAA,IAC/B,kBAAkB,+BAA+B;AAAA,IACjD;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,YAAsB;AAAA,IAC1B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,EAAE,aAAa,SAAS,cAAc,gBAAgB,UAAU;AACzE;AAEA,SAAS,WAAW,MAA6C;AAC/D,SAAO,IAAI,IAAI,KAAK,GAAG,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC;AAC7C;AAEA,SAAS,kBACP,KACA,KAUsD;AACtD,MAAI,IAAI,cAAc,IAAI,gBAAgB,IAAI,YAAY;AACxD,WAAO,EAAE,UAAU,QAAQ,QAAQ,uBAAuB;AAAA,EAC5D;AACA,MAAI,IAAI,gBAAgB,CAAC,IAAI,aAAa,SAAS;AACjD,UAAM,OAAO,IAAI,aAAa,iBAAiB;AAC/C,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,0BAA0B,IAAI,KAAK,IAAI,aAAa,MAAM;AAAA,IACpE;AAAA,EACF;AACA,MAAI,CAAC,IAAI,YAAY;AACnB,WAAO;AAAA,MACL,UAAU,IAAI,OAAO,aAAa,SAAS;AAAA,MAC3C,QACE;AAAA,IACJ;AAAA,EACF;AACA,MAAI,CAAC,IAAI,aAAa,IAAI,UAAU,IAAI,iCAAiC;AACvE,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,QAAQ,IAAI,WAAW,KAAK,CAAC,6CAA6C,+BAA+B;AAAA,IACnH;AAAA,EACF;AACA,QAAM,KAAK,IAAI,UAAU;AACzB,MAAI,IAAI,UAAU,UAAU;AAC1B,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QACE;AAAA,IACJ;AAAA,EACF;AACA,MAAI,IAAI,QAAQ,GAAG,OAAO,IAAI,KAAK,OAAO,GAAG,QAAQ,IAAI,KAAK,MAAM;AAClE,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,oBAAoB,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,0BAA0B,WAAW,IAAI,IAAI,CAAC;AAAA,IACxG;AAAA,EACF;AACA,QAAM,eAAe,GAAG,MAAM;AAC9B,QAAM,eAAe,GAAG,OAAO;AAC/B,MAAI,cAAc;AAChB,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,oBAAoB,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC;AAAA,IAC1D;AAAA,EACF;AACA,MAAI,IAAI,UAAU,IAAI,IAAI,UAAU;AAClC,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,QAAQ,IAAI,UAAU,CAAC,gEAAgE,IAAI,IAAI,UAAU,GAAG,CAAC,6BAAwB,IAAI,QAAQ;AAAA,IAC3J;AAAA,EACF;AACA,MAAI,IAAI,WAAW,QAAQ,IAAI,UAAU,IAAI,OAAO,cAAc;AAChE,WAAO;AAAA,MACL,UAAU;AAAA,MACV,QAAQ,iBAAiB,IAAI,IAAI,MAAM,CAAC,WAAM,IAAI,GAAG,yBAAyB,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,iCAA4B,IAAI,IAAI,UAAU,iBAAiB,CAAC;AAAA,IAC5K;AAAA,EACF;AACA,SAAO;AAAA,IACL,UAAU;AAAA,IACV,QAAQ,gBAAW,IAAI,IAAI,UAAU,iBAAiB,CAAC,YAAY,IAAI,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC,8CAA8C,IAAI,GAAG;AAAA,EACtJ;AACF;AAEA,SAAS,oBACP,YACA,KAO8B;AAC9B,QAAM,gBAAgB,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,IAAI,UAAU;AAC/E,QAAM,cAAc,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,SAAS;AACtE,QAAM,iBAAiB,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,YAAY;AAC5E,QAAM,SAAS,eAAe,kBAAkB,cAAc,CAAC,KAAK;AACpE,QAAM,WAAmC,cACrC,YACA,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,iBAAiB,IACxD,oBACA,iBACE,eACA,cAAc,KAAK,CAAC,MAAM,EAAE,aAAa,MAAM,IAC7C,SACA;AAEV,QAAM,YAAsB,CAAC;AAC7B,QAAM,QAAkB,CAAC;AACzB,QAAM,cAAwB,CAAC;AAE/B,MAAI,QAAQ;AACV,cAAU,KAAK,GAAG,OAAO,WAAW,KAAK,OAAO,cAAc,EAAE;AAChE,QAAI,OAAO,QAAQ;AACjB,YAAM,cACJ,OAAO,sBAAsB,OAAO,kBAAa,IAAI,OAAO,iBAAiB,CAAC,KAAK;AACrF,gBAAU;AAAA,QACR,2BAA2B,IAAI,OAAO,OAAO,GAAG,CAAC,KAAK,IAAI,OAAO,OAAO,IAAI,CAAC,IAAI,WAAW;AAAA,MAC9F;AAAA,IACF;AACA,QAAI,OAAO,QAAQ,QAAQ,OAAO,SAAS,OAAO,GAAG,GAAG;AACtD,gBAAU,KAAK,2BAA2B,OAAO,OAAO,KAAK,IAAI,OAAO,GAAG,CAAC,eAAe;AAAA,IAC7F;AAAA,EACF;AACA,MAAI,CAAC,IAAI,YAAY;AACnB,UAAM,KAAK,mEAAmE;AAC9E,gBAAY,KAAK,iEAAiE;AAAA,EACpF;AACA,MAAI,CAAC,IAAI,qBAAqB;AAC5B,UAAM;AAAA,MACJ;AAAA,IACF;AACA,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,MAAI,IAAI,SAAS,QAAQ,cAAc,SAAS,GAAG;AACjD,UAAM;AAAA,MACJ;AAAA,IACF;AACA,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,QAAM,eAAe,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,iBAAiB;AACjF,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,QAAQ,aAAa,OAAO,CAAC,GAAG,MAAO,EAAE,UAAU,EAAE,UAAU,IAAI,CAAE;AAC3E,UAAM;AAAA,MACJ,GAAG,aAAa,MAAM,mCAAmC,IAAI,QAAQ,wBAAwB,MAAM,WAAW,SAAS,MAAM,OAAO;AAAA,IACtI;AACA,gBAAY;AAAA,MACV,oBAAoB,IAAI,WAAW,MAAM,OAAO,kCAAkC,MAAM,WAAW;AAAA,IACrG;AAAA,EACF;AACA,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ;AACpE,MAAI,SAAS,SAAS,GAAG;AACvB,UAAM;AAAA,MACJ,GAAG,SAAS,MAAM;AAAA,IACpB;AAAA,EACF;AACA,MAAI,IAAI,mBAAmB,IAAI,gBAAgB,SAAS,SAAS,GAAG;AAClE,UAAM,MAAM,IAAI,gBAAgB,SAAS,CAAC;AAC1C,UAAM,KAAK,wBAAwB,IAAI,YAAY,WAAW,IAAI,QAAQ,UAAU;AACpF,gBAAY,KAAK,8DAA8D;AAAA,EACjF;AACA,MAAI,aAAa,WAAW;AAC1B,gBAAY,KAAK,+DAA+D;AAAA,EAClF,WAAW,aAAa,QAAQ;AAC9B,gBAAY,KAAK,qEAAqE;AAAA,EACxF,WAAW,aAAa,cAAc;AACpC,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF,WAAW,aAAa,UAAU;AAChC,gBAAY;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,aAAa,QAAQ,eAAe;AAAA,IACpC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,sBACP,YACA,gBACA,KAMU;AACV,QAAM,QAAkB,CAAC;AACzB,QAAM,gBAAgB,WAAW,OAAO,CAAC,MAAM,EAAE,gBAAgB,IAAI,UAAU;AAC/E,QAAM;AAAA,IACJ,aAAa,cAAc,MAAM,wBAAwB,IAAI,KAAK,SAAS,IAAI,aAAa,YAAY,IAAI,UAAU,KAAK,EAAE;AAAA,EAC/H;AACA,QAAM;AAAA,IACJ,mBAAmB,eAAe,QAAQ,GAAG,eAAe,cAAc,IAAI,eAAe,WAAW,KAAK,EAAE;AAAA,EACjH;AACA,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,SAAS,EAAE;AACvE,QAAM,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,MAAM,EAAE;AAChE,QAAM,aAAa,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,YAAY,EAAE;AAC5E,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,QAAQ,EAAE;AACtE,QAAM,OAAO,cAAc,OAAO,CAAC,MAAM,EAAE,aAAa,iBAAiB,EAAE;AAC3E,QAAM;AAAA,IACJ,iBAAiB,QAAQ,aAAa,UAAU,gBAAgB,IAAI,UAAU,QAAQ,YAAY,IAAI;AAAA,EACxG;AACA,QAAM,WAAW,cAAc,OAAO,CAAC,MAAM,EAAE,gBAAgB,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW;AACzF,MAAI,SAAS,SAAS,EAAG,OAAM,KAAK,+BAA+B,SAAS,KAAK,IAAI,CAAC,GAAG;AACzF,MAAI,IAAI,iBAAiB;AACvB,UAAM;AAAA,MACJ,4BAA4B,IAAI,gBAAgB,aAAa,IAAI,IAAI,gBAAgB,SAAS,uBAAuB,IAAI,gBAAgB,SAAS,MAAM;AAAA,IAC1J;AAAA,EACF;AACA,QAAM;AAAA,IACJ,IAAI,sBACA,2BAA2B,IAAI,oBAAoB,MAAM,GAAG,EAAE,CAAC,WAC/D;AAAA,EACN;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,QAgBrB;AACT,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,KAAK,OAAO,KAAK,EAAE;AAC9B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,kBAAkB,OAAO,WAAW,EAAE;AACjD,QAAM,KAAK,sBAAsB,OAAO,KAAK,EAAE;AAC/C,QAAM,KAAK,mBAAmB,OAAO,cAAc,gBAAgB,EAAE;AACrE,QAAM,KAAK,aAAa,OAAO,OAAO,WAAW,OAAO,IAAI,IAAI,gBAAgB,EAAE;AAClF,QAAM,KAAK,0BAA0B,OAAO,cAAc,IAAI;AAC9D,QAAM;AAAA,IACJ,wBAAwB,OAAO,sBAAsB,KAAK,OAAO,mBAAmB,OAAO,MAAM;AAAA,EACnG;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,sBAAsB;AACjC,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,iBAAkB,OAAM,KAAK,KAAK,IAAI,EAAE;AAClE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,mBAAmB;AAC9B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iBAAiB,OAAO,eAAe,QAAQ,EAAE;AAC5D,QAAM,KAAK,kBAAkB,OAAO,eAAe,eAAe,KAAK,EAAE;AACzE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,eAAe;AAC1B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,eAAe,UAAW,OAAM,KAAK,KAAK,IAAI,EAAE;AAC1E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,WAAW;AACtB,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,eAAe,MAAM,SAC3C,OAAO,eAAe,QACtB,CAAC,0CAA0C,GAAG;AAChD,UAAM,KAAK,KAAK,IAAI,EAAE;AAAA,EACxB;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,kBAAkB;AAC7B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,eAAe,YAAa,OAAM,KAAK,KAAK,IAAI,EAAE;AAC5E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,6BAA6B;AACxC,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACJ;AAAA,EACF;AACA,QAAM,KAAK,0DAA0D;AACrE,aAAW,KAAK,OAAO,YAAY;AACjC,UAAM,QAAQ,EAAE,0BAA0B,OAAO,MAAM,OAAO,EAAE,qBAAqB;AACrF,UAAM,OAAO,EAAE,sBAAsB,OAAO,MAAM,EAAE,kBAAkB,QAAQ,CAAC;AAC/E,UAAM,IAAI,EAAE,WAAW,OAAO,EAAE,OAAO,QAAQ,CAAC,IAAI;AACpD,UAAM,IAAI,EAAE,YAAY,OAAO,EAAE,QAAQ,QAAQ,CAAC,IAAI;AACtD,UAAM,OAAO,EAAE,SAAS,IAAI,IAAI,EAAE,OAAO,GAAG,CAAC,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC,MAAM;AAC1E,UAAM,MAAM,EAAE,QAAQ,QAAQ,CAAC,OAAO,SAAS,EAAE,GAAG,IAAI,MAAM,IAAI,EAAE,GAAG;AACvE,UAAM;AAAA,MACJ,KAAK,EAAE,WAAW,MAAM,EAAE,QAAQ,MAAM,IAAI,EAAE,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,MAAM,IAAI,MAAM,GAAG,MAAM,EAAE,mBAAmB,QAAQ,IAAI,MAAM,EAAE,QAAQ,GAAG;AAAA,IACpL;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,wBAAwB;AACnC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,OAAO,QAAQ,QAAQ;AAClC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,gBAAgB;AAC3B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iBAAiB;AAC5B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,YAAa,OAAM,KAAK,KAAK,IAAI,EAAE;AACzE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,aAAa;AACxB,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,QAAS,OAAM,KAAK,KAAK,IAAI,EAAE;AACrE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,6BAA6B;AACxC,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,aAAc,OAAM,KAAK,KAAK,IAAI,EAAE;AAC1E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,uBAAuB;AAClC,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,eAAgB,OAAM,KAAK,KAAK,IAAI,EAAE;AAC5E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,eAAe;AAC1B,QAAM,KAAK,EAAE;AACb,aAAW,QAAQ,OAAO,YAAY,UAAW,OAAM,KAAK,KAAK,IAAI,EAAE;AACvE,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,gBAAgB;AAC3B,QAAM,KAAK,EAAE;AACb,QAAM;AAAA,IACJ;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,SAAS;AACpB,QAAM,KAAK,KAAK,UAAU,EAAE,QAAQ,OAAO,QAAQ,OAAO,OAAO,MAAM,GAAG,MAAM,CAAC,CAAC;AAClF,QAAM,KAAK,KAAK;AAChB,MAAI,OAAO,iBAAiB;AAC1B,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,qBAAqB;AAChC,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,uDAAuD;AAClE,UAAM,KAAK,yBAAyB;AACpC,eAAW,KAAK,OAAO,gBAAgB,SAAS,MAAM,GAAG,EAAE,GAAG;AAC5D,YAAM;AAAA,QACJ,KAAK,EAAE,YAAY,MAAM,EAAE,QAAQ,MAAM,EAAE,YAAY,MAAM,MAAM,EAAE,YAAY,GAAG,MAAM,YAAY,EAAE,gBAAgB,EAAE,YAAY,CAAC;AAAA,MACzI;AAAA,IACF;AAAA,EACF;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,mBAAmB,UAAkB,OAAuB;AACnE,QAAM,OAAO,eAAe,QAAQ;AACpC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,WAAW,KAAK,CAAC;AAAA,IAC3B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,eAAe,UAA0B;AAChD,QAAM,QAAQ,SAAS,MAAM,IAAI;AACjC,QAAM,OAAiB,CAAC;AACxB,MAAI,SAAS;AACb,MAAI,SAAS;AACb,MAAI,OAAiB,CAAC;AACtB,MAAI,QAAkB,CAAC;AAEvB,QAAM,YAAY,MAAM;AACtB,QAAI,QAAQ;AACV,WAAK,KAAK,OAAO;AACjB,eAAS;AAAA,IACX;AAAA,EACF;AACA,QAAM,aAAa,MAAM;AACvB,QAAI,MAAM,WAAW,EAAG;AACxB,SAAK,KAAK,oBAAoB,KAAK,CAAC;AACpC,YAAQ,CAAC;AAAA,EACX;AAEA,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,WAAW,KAAK,GAAG;AAC1B,UAAI,QAAQ;AACV,aAAK,KAAK,cAAc,WAAW,KAAK,KAAK,IAAI,CAAC,CAAC,eAAe;AAClE,eAAO,CAAC;AACR,iBAAS;AAAA,MACX,OAAO;AACL,kBAAU;AACV,mBAAW;AACX,iBAAS;AAAA,MACX;AACA;AAAA,IACF;AACA,QAAI,QAAQ;AACV,WAAK,KAAK,IAAI;AACd;AAAA,IACF;AACA,QAAI,KAAK,WAAW,GAAG,GAAG;AACxB,gBAAU;AACV,YAAM,KAAK,IAAI;AACf;AAAA,IACF;AACA,eAAW;AACX,QAAI,KAAK,WAAW,IAAI,GAAG;AACzB,UAAI,CAAC,QAAQ;AACX,aAAK,KAAK,MAAM;AAChB,iBAAS;AAAA,MACX;AACA,WAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AACrD;AAAA,IACF;AACA,cAAU;AACV,QAAI,KAAK,WAAW,IAAI,EAAG,MAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AAAA,aACvE,KAAK,WAAW,KAAK,EAAG,MAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AAAA,aAC7E,KAAK,WAAW,MAAM,EAAG,MAAK,KAAK,OAAO,eAAe,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO;AAAA,aAC9E,KAAK,KAAK,MAAM,GAAI,MAAK,KAAK,EAAE;AAAA,QACpC,MAAK,KAAK,MAAM,eAAe,IAAI,CAAC,MAAM;AAAA,EACjD;AACA,YAAU;AACV,aAAW;AACX,SAAO,KAAK,KAAK,IAAI;AACvB;AAEA,SAAS,oBAAoB,OAAyB;AACpD,QAAM,OAAO,MACV,OAAO,CAAC,SAAS,CAAC,iBAAiB,KAAK,IAAI,CAAC,EAC7C;AAAA,IAAI,CAAC,SACJ,KACG,MAAM,GAAG,EAAE,EACX,MAAM,GAAG,EACT,IAAI,CAAC,SAAS,eAAe,KAAK,KAAK,CAAC,CAAC;AAAA,EAC9C;AACF,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,CAAC,MAAM,GAAG,IAAI,IAAI;AACxB,QAAM,KAAK,KAAM,IAAI,CAAC,SAAS,OAAO,IAAI,OAAO,EAAE,KAAK,EAAE;AAC1D,QAAM,MAAM,KACT,IAAI,CAAC,QAAQ,OAAO,IAAI,IAAI,CAAC,SAAS,OAAO,IAAI,OAAO,EAAE,KAAK,EAAE,CAAC,OAAO,EACzE,KAAK,IAAI;AACZ,SAAO,qBAAqB,EAAE,uBAAuB,GAAG;AAC1D;AAEA,SAAS,eAAe,GAAmB;AACzC,SAAO,WAAW,CAAC,EAAE,QAAQ,oBAAoB,qBAAqB;AACxE;AAEA,SAAS,WAAW,GAAmB;AACrC,SAAO,EACJ,QAAQ,MAAM,OAAO,EACrB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,MAAM,EACpB,QAAQ,MAAM,QAAQ;AAC3B;AAEA,SAAS,YAAY,GAAmB;AACtC,SAAO,EAAE,QAAQ,OAAO,KAAK;AAC/B;AAEA,SAAS,eAAe,UAA0C;AAChE,MAAI,aAAa,UAAW,QAAO;AACnC,MAAI,aAAa,aAAc,QAAO;AACtC,MAAI,aAAa,OAAQ,QAAO;AAChC,MAAI,aAAa,kBAAmB,QAAO;AAC3C,SAAO;AACT;AAEA,SAAS,OAAO,GAAmB;AACjC,SAAO,GAAG,KAAK,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC;AACtC;AAIA,SAAS,IAAI,IAAsB;AACjC,MAAI,GAAG,WAAW,EAAG,QAAO,OAAO;AACnC,SAAO,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG;AAC5C;AAEA,SAAS,eAAe,QAA0B;AAChD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,MAAM,KAAK,MAAM,OAAO,SAAS,CAAC;AACxC,SAAO,OAAO,SAAS,MAAM,KAAK,OAAO,MAAM,CAAC,IAAK,OAAO,GAAG,KAAM,IAAI,OAAO,GAAG;AACrF;AAEA,SAAS,IAAI,GAAmB;AAC9B,MAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO,OAAO,CAAC;AACxC,SAAO,EAAE,QAAQ,CAAC;AACpB;","names":[]}