@tangle-network/agent-eval 0.179.0 → 0.181.0

package/dist/ast-CP9ae9B0.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-CP9ae9B0.js","names":[],"sources":["../src/experiment/ast.ts"],"sourcesContent":["/**\n * The registered-rule AST: every rule an experiment registers is DATA.\n *\n * A closure cannot be canonicalized or hashed; a node tree can. `sealExperiment`\n * hashes the whole tree, and every interpreter in this file takes only a node\n * plus evidence records — no parameter for alpha, threshold, metric, or\n * stopping rule exists on any executable surface. The registered object and\n * the executed object are therefore the same object, and registered-vs-ran\n * drift is unrepresentable rather than checked.\n *\n * Node families:\n *   Predicate       closed-key comparisons — the only leaf\n *   AdmissionRule   monotone funnel stages with registered waivers\n *   SelectionRule   deterministic subsets over a closed field set\n *   Estimand        what the experiment measures\n *   IntervalSpec    how uncertainty is computed, seed included\n *   Condition       decision guards over named derived quantities\n *   DecisionRule    ordered verdict table, or a registered absence of one\n *   Obligation      a control that must exist before a verdict class is read\n *   ValidityGate    pre-spend design checks\n *   HaltRule        gates as prerequisites — failure refuses the spend\n *   BudgetRule      spend schedules with a named ledger\n *   MatchedBudgetRule  arm budget matching as a refusal\n *   ReissuePolicy   carrier faults are reissued; model outcomes stand\n */\n\nimport { ValidationError } from '../errors'\nimport { mulberry32 } from '../statistics'\n\n/** JSON-serializable value — everything a sealed node may carry. */\nexport type JsonValue = string | number | boolean | null | JsonValue[] | { [k: string]: JsonValue }\n\n/** Evidence row shape. Fields are addressed by dot-separated paths. */\nexport type EvidenceRecord = Record<string, unknown>\n\n/** A decision rule's branches did not cover the evidence. */\nclass DecisionTableNotTotalError extends ValidationError {}\n\n// ── Predicate ────────────────────────────────────────────────────────\n\n/**\n * Closed-key comparison over a declared record schema. The only leaf node.\n * `field` is a dot-separated path into an evidence record.\n */\nexport type Predicate =\n  | {\n      kind: 'compare'\n      field: string\n      op: 'eq' | 'ne' | 'lt' | 'lte' | 'gt' | 'gte'\n      value: JsonValue\n    }\n  | { kind: 'in'; field: string; values: JsonValue[] }\n  | { kind: 'all'; of: Predicate[] }\n  | { kind: 'any'; of: Predicate[] }\n  | { kind: 'not'; of: Predicate }\n\n/** Read a dot-separated field path. Missing segments yield `undefined`. */\nexport function readField(record: EvidenceRecord, path: string): unknown {\n  let current: unknown = record\n  for (const key of path.split('.')) {\n    if (current === null || typeof current !== 'object') return undefined\n    current = (current as Record<string, unknown>)[key]\n  }\n  return current\n}\n\n/** Evaluate a predicate against one evidence record. */\nexport function evaluatePredicate(predicate: Predicate, record: EvidenceRecord): boolean {\n  switch (predicate.kind) {\n    case 'compare':\n      return compareValues(readField(record, predicate.field), predicate.op, predicate.value)\n    case 'in':\n      return predicate.values.includes(readField(record, predicate.field) as JsonValue)\n    case 'all':\n      return predicate.of.every((p) => evaluatePredicate(p, record))\n    case 'any':\n      return predicate.of.some((p) => evaluatePredicate(p, record))\n    case 'not':\n      return !evaluatePredicate(predicate.of, record)\n  }\n}\n\n/** Numbers compare numerically; everything else compares as strings. */\nfunction compareValues(\n  value: unknown,\n  op: 'eq' | 'ne' | 'lt' | 'lte' | 'gt' | 'gte',\n  target: JsonValue,\n): boolean {\n  if (op === 'eq') return value === target\n  if (op === 'ne') return value !== target\n  const numeric = typeof value === 'number' && typeof target === 'number'\n  const left = numeric ? (value as number) : String(value)\n  const right = numeric ? (target as number) : String(target)\n  switch (op) {\n    case 'lt':\n      return left < right\n    case 'lte':\n      return left <= right\n    case 'gt':\n      return left > right\n    case 'gte':\n      return left >= right\n  }\n}\n\n// ── Admission ────────────────────────────────────────────────────────\n\n/**\n * One monotone funnel stage. `waives` names substrate admission conditions\n * deliberately NOT applied, so a waiver is registered, never implicit.\n */\nexport interface AdmissionStage {\n  id: string\n  keep: Predicate\n  waives?: string[]\n}\n\n/** A partition is a set reported separately and never pooled. */\nexport interface AdmissionPartition {\n  id: string\n  /** Stage whose dropped rows this partition draws from. */\n  from: string\n  keep: Predicate\n  pooling: 'never'\n}\n\n/** Declarative row-admission funnel. Stages only remove rows. */\nexport interface AdmissionRule {\n  population: string\n  stages: AdmissionStage[]\n  partitions?: AdmissionPartition[]\n}\n\n// ── Selection ────────────────────────────────────────────────────────\n\n/**\n * Deterministic subset selection. `reads` is the closed field set the rule\n * may touch — outcome-contaminated selection is unrepresentable because an\n * outcome field is simply not in the list.\n */\nexport type SelectionRule =\n  | {\n      kind: 'round-robin'\n      groupBy: string\n      groupOrder: 'lex-asc'\n      withinOrder: { field: string; dir: 'asc' | 'desc' }\n      take: number\n      reads: string[]\n    }\n  | {\n      kind: 'filter-of'\n      /** Name of the sealed subset or selection this rule filters. */\n      base: string\n      keep: Predicate\n      order: { field: string; dir: 'asc' | 'desc' }\n    }\n\n/**\n * Execute a selection rule.\n *\n * Round-robin walks groups in lexicographic order and takes ids in\n * within-group order until `take` ids are chosen. Filter-of keeps the ids of\n * `bases[rule.base]` whose record satisfies the predicate, in the registered\n * order. Ids absent from `records` are evaluated on their id alone (fields\n * derived from the id via `idFields`), so a sealed base outlives its source\n * records.\n */\nexport function runSelectionRule(\n  rule: SelectionRule,\n  records: readonly EvidenceRecord[],\n  options: {\n    /** Field carrying a row's identity. */\n    idField: string\n    /** Sealed or previously-computed subsets, by name. */\n    bases?: Record<string, readonly string[]>\n    /** Derive predicate-readable fields from a bare id when its record is absent. */\n    idFields?: (id: string) => EvidenceRecord\n  },\n): string[] {\n  if (rule.kind === 'round-robin') {\n    const allowed = new Set(rule.reads)\n    for (const field of [rule.groupBy, rule.withinOrder.field]) {\n      if (!allowed.has(field)) {\n        throw new ValidationError(\n          `runSelectionRule: round-robin reads '${field}' but its closed read set is [${rule.reads.join(', ')}]`,\n        )\n      }\n    }\n    const byGroup = new Map<string, string[]>()\n    for (const record of records) {\n      const group = String(readField(record, rule.groupBy))\n      const id = String(readField(record, rule.withinOrder.field))\n      const bucket = byGroup.get(group)\n      if (bucket) bucket.push(id)\n      else byGroup.set(group, [id])\n    }\n    for (const ids of byGroup.values()) {\n      ids.sort()\n      if (rule.withinOrder.dir === 'desc') ids.reverse()\n    }\n    const groups = [...byGroup.keys()].sort()\n    const chosen: string[] = []\n    let cursor = 0\n    while (chosen.length < rule.take && groups.some((g) => byGroup.get(g)!.length > 0)) {\n      const group = groups[cursor % groups.length]!\n      const ids = byGroup.get(group)!\n      if (ids.length > 0) chosen.push(ids.shift()!)\n      cursor += 1\n    }\n    return chosen\n  }\n\n  const base = options.bases?.[rule.base]\n  if (!base) {\n    throw new ValidationError(`runSelectionRule: filter-of base '${rule.base}' was not provided`)\n  }\n  const index = new Map(records.map((r) => [String(readField(r, options.idField)), r]))\n  const kept = base.filter((id) => {\n    const record = index.get(id) ?? options.idFields?.(id)\n    if (!record) {\n      throw new ValidationError(\n        `runSelectionRule: base id '${id}' has no record and no idFields derivation`,\n      )\n    }\n    return evaluatePredicate(rule.keep, record)\n  })\n  const sorted = [...kept].sort()\n  if (rule.order.dir === 'desc') sorted.reverse()\n  return sorted\n}\n\n// ── Estimands ────────────────────────────────────────────────────────\n\n/** A named set of row identities, built from arm rows and an event predicate. */\nexport type SetExpr =\n  | { kind: 'rows-where'; arm: string; event: Predicate }\n  | { kind: 'intersect'; of: SetExpr[] }\n\n/**\n * What the experiment measures. Every estimand names the fields it reads, so\n * the sealed tree records the full data dependency of the number.\n */\nexport type Estimand =\n  | { kind: 'rate'; event: Predicate; over: 'rollouts' }\n  | { kind: 'rate-at-least-once'; event: Predicate; groupBy: string }\n  | {\n      kind: 'paired-mean-diff'\n      armField: string\n      treatment: string\n      control: string\n      pairBy: string\n      /**\n       * Field path to the per-row outcome. A boolean reads as 1 or 0, so a\n       * binary pass/fail outcome gives the risk difference directly.\n       */\n      value: string\n      /** A pair one arm did not answer contributes a difference of exactly zero. */\n      missing: 'zero-diff'\n    }\n  | {\n      kind: 'set-ratio'\n      armField: string\n      idField: string\n      numerator: SetExpr\n      denominator: SetExpr\n    }\n\nexport interface EstimandResult {\n  value: number\n  numerator: number\n  denominator: number\n}\n\nfunction evaluateSetExpr(\n  expr: SetExpr,\n  rows: readonly EvidenceRecord[],\n  armField: string,\n  idField: string,\n): Set<string> {\n  if (expr.kind === 'rows-where') {\n    const ids = new Set<string>()\n    for (const row of rows) {\n      if (String(readField(row, armField)) !== expr.arm) continue\n      if (evaluatePredicate(expr.event, row)) ids.add(String(readField(row, idField)))\n    }\n    return ids\n  }\n  if (expr.of.length === 0) throw new ValidationError('computeEstimand: empty intersect')\n  const sets = expr.of.map((e) => evaluateSetExpr(e, rows, armField, idField))\n  const [first, ...rest] = sets\n  const out = new Set<string>()\n  for (const id of first!) {\n    if (rest.every((s) => s.has(id))) out.add(id)\n  }\n  return out\n}\n\n/**\n * Read one registered outcome field as a number.\n *\n * A binary outcome reaches evidence as `true` or `false`. Its mean is the pass\n * rate and the mean of its paired differences is the risk difference, so\n * `true` reads as 1 and `false` as 0 — the same quantity a caller would\n * otherwise encode by hand, and the same reading in every interpreter here.\n * Every other type, and a non-finite number, is a measurement defect: it\n * rejects instead of poisoning the mean with `NaN` or a coerced zero.\n */\nfunction readNumericOutcome(raw: unknown, context: string, field: string, where: string): number {\n  if (typeof raw === 'boolean') return raw ? 1 : 0\n  if (typeof raw === 'number' && Number.isFinite(raw)) return raw\n  throw new ValidationError(\n    `${context}: value field '${field}' is not a finite number or a boolean on ${where}`,\n  )\n}\n\n/** Compute an estimand over evidence rows. Pure; reads only registered fields. */\nexport function computeEstimand(\n  estimand: Estimand,\n  rows: readonly EvidenceRecord[],\n): EstimandResult {\n  switch (estimand.kind) {\n    case 'rate': {\n      const numerator = rows.filter((r) => evaluatePredicate(estimand.event, r)).length\n      if (rows.length === 0) throw new ValidationError('computeEstimand: rate over zero rows')\n      return { value: numerator / rows.length, numerator, denominator: rows.length }\n    }\n    case 'rate-at-least-once': {\n      const byGroup = new Map<string, boolean>()\n      for (const row of rows) {\n        const group = String(readField(row, estimand.groupBy))\n        const hit = evaluatePredicate(estimand.event, row)\n        byGroup.set(group, (byGroup.get(group) ?? false) || hit)\n      }\n      if (byGroup.size === 0) {\n        throw new ValidationError('computeEstimand: rate-at-least-once over zero groups')\n      }\n      const numerator = [...byGroup.values()].filter(Boolean).length\n      return { value: numerator / byGroup.size, numerator, denominator: byGroup.size }\n    }\n    case 'paired-mean-diff': {\n      const byPair = new Map<string, { treatment?: number; control?: number }>()\n      for (const row of rows) {\n        const arm = String(readField(row, estimand.armField))\n        if (arm !== estimand.treatment && arm !== estimand.control) continue\n        const pair = String(readField(row, estimand.pairBy))\n        const value = readNumericOutcome(\n          readField(row, estimand.value),\n          'computeEstimand paired-mean-diff',\n          estimand.value,\n          `pair '${pair}'`,\n        )\n        const slot = byPair.get(pair) ?? {}\n        if (arm === estimand.treatment) slot.treatment = value\n        else slot.control = value\n        byPair.set(pair, slot)\n      }\n      if (byPair.size === 0) {\n        throw new ValidationError('computeEstimand: paired-mean-diff over zero pairs')\n      }\n      let sum = 0\n      for (const slot of byPair.values()) {\n        // missing: 'zero-diff' — an unanswered side contributes zero, never a drop\n        sum += (slot.treatment ?? 0) - (slot.control ?? 0)\n      }\n      return { value: sum / byPair.size, numerator: sum, denominator: byPair.size }\n    }\n    case 'set-ratio': {\n      const numeratorSet = evaluateSetExpr(\n        estimand.numerator,\n        rows,\n        estimand.armField,\n        estimand.idField,\n      )\n      const denominatorSet = evaluateSetExpr(\n        estimand.denominator,\n        rows,\n        estimand.armField,\n        estimand.idField,\n      )\n      if (denominatorSet.size === 0) {\n        throw new ValidationError('computeEstimand: set-ratio denominator set is empty')\n      }\n      return {\n        value: numeratorSet.size / denominatorSet.size,\n        numerator: numeratorSet.size,\n        denominator: denominatorSet.size,\n      }\n    }\n  }\n}\n\n// ── Intervals ────────────────────────────────────────────────────────\n\n/** How uncertainty is computed. The seed is part of the registration. */\nexport type IntervalSpec =\n  | {\n      kind: 'cluster-bootstrap'\n      clusterBy: string\n      /** Registered numeric or boolean outcome field, including a prepared paired difference. */\n      value: string\n      resamples: number\n      seed: number\n      level: number\n      method: 'percentile'\n    }\n  | { kind: 'clopper-pearson'; level: number }\n\nexport interface ComputedInterval {\n  lower: number\n  upper: number\n  level: number\n}\n\n/** Shared by registration and direct execution so malformed intervals cannot produce evidence. */\nexport function intervalSpecProblems(spec: IntervalSpec): string[] {\n  if (spec === null || typeof spec !== 'object' || Array.isArray(spec)) {\n    return ['interval must be an object']\n  }\n  if (spec.kind !== 'cluster-bootstrap' && spec.kind !== 'clopper-pearson') {\n    return ['interval kind must be cluster-bootstrap or clopper-pearson']\n  }\n  const problems: string[] = []\n  if (!Number.isFinite(spec.level) || spec.level <= 0 || spec.level >= 1) {\n    problems.push('level must be a finite number between zero and one')\n  }\n  if (spec.kind === 'cluster-bootstrap') {\n    for (const field of ['clusterBy', 'value'] as const) {\n      const path = spec[field]\n      if (\n        typeof path !== 'string' ||\n        path.split('.').some((segment) => segment.length === 0 || segment.trim() !== segment)\n      ) {\n        problems.push(`${field} must be a nonempty dot-separated field path`)\n      }\n    }\n    if (\n      !Number.isSafeInteger(spec.resamples) ||\n      spec.resamples < 1 ||\n      spec.resamples > 0xffff_ffff\n    ) {\n      problems.push('resamples must be a positive integer within the supported array length')\n    }\n    if (!Number.isSafeInteger(spec.seed)) problems.push('seed must be a safe integer')\n    if (spec.method !== 'percentile') problems.push('method must be percentile')\n  }\n  return problems\n}\n\n/**\n * Execute an interval spec.\n *\n * Cluster-bootstrap resamples whole clusters of its registered `value` field and\n * takes percentile bounds of the pooled mean. Clopper-Pearson computes the\n * exact binomial interval and requires `successes`/`trials` evidence instead\n * of rows.\n */\nexport function computeInterval(\n  spec: IntervalSpec,\n  evidence:\n    | { kind: 'rows'; rows: readonly EvidenceRecord[] }\n    | { kind: 'binomial'; successes: number; trials: number },\n): ComputedInterval {\n  const problems = intervalSpecProblems(spec)\n  if (problems.length > 0) throw new ValidationError(`computeInterval: ${problems.join('; ')}`)\n  if (evidence === null || typeof evidence !== 'object' || Array.isArray(evidence)) {\n    throw new ValidationError('computeInterval: evidence must be an object')\n  }\n  if (spec.kind === 'cluster-bootstrap') {\n    if (evidence.kind !== 'rows') {\n      throw new ValidationError('computeInterval: cluster-bootstrap requires row evidence')\n    }\n    if ('value' in evidence) {\n      throw new ValidationError(\n        'computeInterval: register value in the interval spec, not row evidence',\n      )\n    }\n    if (!Array.isArray(evidence.rows))\n      throw new ValidationError('computeInterval: rows must be an array')\n    const clusters = new Map<string, number[]>()\n    for (const [index, row] of evidence.rows.entries()) {\n      if (row === null || typeof row !== 'object' || Array.isArray(row)) {\n        throw new ValidationError(`computeInterval: row ${index} must be an object`)\n      }\n      const cluster = readField(row, spec.clusterBy)\n      if (\n        !(typeof cluster === 'string' && cluster.length > 0 && cluster.trim() === cluster) &&\n        !(typeof cluster === 'number' && Number.isFinite(cluster))\n      ) {\n        throw new ValidationError(\n          `computeInterval: cluster field '${spec.clusterBy}' must be a nonempty string or finite number on row ${index}`,\n        )\n      }\n      const clusterKey = `${typeof cluster}:${cluster}`\n      const value = readNumericOutcome(\n        readField(row, spec.value),\n        'computeInterval cluster-bootstrap',\n        spec.value,\n        `cluster '${cluster}'`,\n      )\n      const bucket = clusters.get(clusterKey)\n      if (bucket) bucket.push(value)\n      else clusters.set(clusterKey, [value])\n    }\n    const clusterValues = [...clusters.entries()]\n      .sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0))\n      .map(([, values]) => values)\n    if (clusterValues.length < 2) {\n      throw new ValidationError(\n        `computeInterval: cluster-bootstrap needs >= 2 clusters, got ${clusterValues.length}`,\n      )\n    }\n    const rng = mulberry32(spec.seed)\n    const means = new Array<number>(spec.resamples)\n    for (let draw = 0; draw < spec.resamples; draw++) {\n      let sum = 0\n      let count = 0\n      for (let pick = 0; pick < clusterValues.length; pick++) {\n        const cluster = clusterValues[Math.floor(rng() * clusterValues.length)]!\n        for (const value of cluster) sum += value\n        count += cluster.length\n      }\n      means[draw] = sum / count\n      if (!Number.isFinite(means[draw])) {\n        throw new ValidationError(\n          'computeInterval: cluster mean overflowed the finite numeric range',\n        )\n      }\n    }\n    means.sort((a, b) => a - b)\n    const alpha = 1 - spec.level\n    const lowerIndex = Math.floor((alpha / 2) * spec.resamples)\n    const upperIndex = Math.min(spec.resamples - 1, Math.ceil((1 - alpha / 2) * spec.resamples) - 1)\n    return {\n      lower: means[lowerIndex]!,\n      upper: means[Math.max(lowerIndex, upperIndex)]!,\n      level: spec.level,\n    }\n  }\n\n  if (evidence.kind !== 'binomial') {\n    throw new ValidationError('computeInterval: clopper-pearson requires binomial evidence')\n  }\n  const { successes, trials } = evidence\n  if (\n    !Number.isSafeInteger(successes) ||\n    !Number.isSafeInteger(trials) ||\n    trials <= 0 ||\n    successes < 0\n  ) {\n    throw new ValidationError(\n      `computeInterval: clopper-pearson needs 0 <= successes <= trials, got ${successes}/${trials}`,\n    )\n  }\n  if (successes > trials) {\n    throw new ValidationError(\n      `computeInterval: clopper-pearson successes ${successes} exceed trials ${trials}`,\n    )\n  }\n  const alpha = 1 - spec.level\n  const lower = successes === 0 ? 0 : binomialQuantile(successes, trials, alpha / 2, 'lower')\n  const upper = successes === trials ? 1 : binomialQuantile(successes, trials, alpha / 2, 'upper')\n  return { lower, upper, level: spec.level }\n}\n\n/**\n * Clopper-Pearson bound by bisection on the binomial tail. The lower bound is\n * the p with P(X >= successes | p) = alpha; the upper is the p with\n * P(X <= successes | p) = alpha. Deterministic, no special functions.\n */\nfunction binomialQuantile(\n  successes: number,\n  trials: number,\n  alpha: number,\n  side: 'lower' | 'upper',\n): number {\n  const tail = (p: number): number => {\n    // log-space binomial pmf accumulation for numeric stability\n    let sum = 0\n    for (let k = 0; k <= trials; k++) {\n      const inTail = side === 'lower' ? k >= successes : k <= successes\n      if (!inTail) continue\n      sum += Math.exp(logBinomialPmf(k, trials, p))\n    }\n    return sum\n  }\n  let lo = 0\n  let hi = 1\n  for (let iter = 0; iter < 100; iter++) {\n    const mid = (lo + hi) / 2\n    if (tail(mid) < alpha) {\n      if (side === 'lower') lo = mid\n      else hi = mid\n    } else {\n      if (side === 'lower') hi = mid\n      else lo = mid\n    }\n  }\n  return (lo + hi) / 2\n}\n\nfunction logBinomialPmf(k: number, n: number, p: number): number {\n  if (p <= 0) return k === 0 ? 0 : Number.NEGATIVE_INFINITY\n  if (p >= 1) return k === n ? 0 : Number.NEGATIVE_INFINITY\n  return logChoose(n, k) + k * Math.log(p) + (n - k) * Math.log(1 - p)\n}\n\nfunction logChoose(n: number, k: number): number {\n  return logFactorial(n) - logFactorial(k) - logFactorial(n - k)\n}\n\nconst LOG_FACTORIAL_CACHE: number[] = [0]\nfunction logFactorial(n: number): number {\n  for (let i = LOG_FACTORIAL_CACHE.length; i <= n; i++) {\n    LOG_FACTORIAL_CACHE[i] = LOG_FACTORIAL_CACHE[i - 1]! + Math.log(i)\n  }\n  return LOG_FACTORIAL_CACHE[n]!\n}\n\n// ── Conditions and decisions ─────────────────────────────────────────\n\n/** Decision guards read only named derived quantities — never raw rows. */\nexport type Condition =\n  | { kind: 'interval-excludes-zero'; interval: string; sign: 'positive' | 'negative' }\n  | { kind: 'interval-includes-zero'; interval: string }\n  | { kind: 'quantity-threshold'; quantity: string; op: 'gte' | 'lte' | 'gt' | 'lt'; value: number }\n  | { kind: 'obligation-met'; obligation: string }\n  | { kind: 'all'; of: Condition[] }\n  | { kind: 'any'; of: Condition[] }\n  | { kind: 'not'; of: Condition }\n\n/** The named quantities a decision rule may read. Nothing else reaches it. */\nexport interface DerivedQuantities {\n  intervals: Record<string, { lower: number; upper: number }>\n  quantities: Record<string, number>\n  obligationsMet: Record<string, boolean>\n}\n\nexport function evaluateCondition(condition: Condition, evidence: DerivedQuantities): boolean {\n  switch (condition.kind) {\n    case 'interval-excludes-zero': {\n      const interval = evidence.intervals[condition.interval]\n      if (!interval) {\n        throw new ValidationError(\n          `evaluateCondition: interval '${condition.interval}' is not in the evidence`,\n        )\n      }\n      const excludes = interval.lower > 0 || interval.upper < 0\n      return excludes && (condition.sign === 'positive' ? interval.lower > 0 : interval.upper < 0)\n    }\n    case 'interval-includes-zero': {\n      const interval = evidence.intervals[condition.interval]\n      if (!interval) {\n        throw new ValidationError(\n          `evaluateCondition: interval '${condition.interval}' is not in the evidence`,\n        )\n      }\n      return interval.lower <= 0 && interval.upper >= 0\n    }\n    case 'quantity-threshold': {\n      const value = evidence.quantities[condition.quantity]\n      if (value === undefined) {\n        throw new ValidationError(\n          `evaluateCondition: quantity '${condition.quantity}' is not in the evidence`,\n        )\n      }\n      return compareValues(value, condition.op, condition.value)\n    }\n    case 'obligation-met':\n      return evidence.obligationsMet[condition.obligation] === true\n    case 'all':\n      return condition.of.every((c) => evaluateCondition(c, evidence))\n    case 'any':\n      return condition.of.some((c) => evaluateCondition(c, evidence))\n    case 'not':\n      return !evaluateCondition(condition.of, evidence)\n  }\n}\n\nexport interface DecisionBranch {\n  when: Condition\n  verdict: string\n  report: string[]\n}\n\n/**\n * Ordered decision table: the first branch whose condition holds fires, and a\n * table no branch matches throws — a non-total registration is a defect, not\n * an implicit verdict. `report-only` registers the ABSENCE of a verdict\n * branch: the estimate and the per-row table are the finding, and the\n * registered meaning prose rides as non-executable interpretation data.\n */\nexport type DecisionRule =\n  | { kind: 'table'; branches: DecisionBranch[] }\n  | {\n      kind: 'report-only'\n      estimands: string[]\n      intervals: string[]\n      perRow: string[]\n      interpretation?: { onQualitative: string; consequence: string }[]\n    }\n\nexport interface DecisionOutcome {\n  verdict: string\n  report: string[]\n}\n\nexport function executeDecisionRule(\n  rule: DecisionRule,\n  evidence: DerivedQuantities,\n): DecisionOutcome {\n  if (rule.kind === 'report-only') {\n    return { verdict: 'report-only', report: [...rule.estimands, ...rule.intervals] }\n  }\n  for (const branch of rule.branches) {\n    if (evaluateCondition(branch.when, evidence)) {\n      return { verdict: branch.verdict, report: branch.report }\n    }\n  }\n  throw new DecisionTableNotTotalError(\n    'executeDecisionRule: decision table is not total — no branch matched the evidence',\n  )\n}\n\n/** A registered control that must exist before a class of verdicts is read. */\nexport interface Obligation {\n  id: string\n  appliesToVerdicts: string[]\n  control: string\n}\n\n// ── Validity gates and halt ──────────────────────────────────────────\n\n/** Pre-spend design checks. Each returns pass/fail plus its evidence. */\nexport type ValidityGate =\n  | {\n      kind: 'oracle-determinism'\n      unit: 'suite' | 'assertion'\n      replicates: number\n      maxFlipRate: number\n    }\n  | {\n      kind: 'population-reproducibility'\n      joinOn: string\n      compare: string[]\n      maxChangedRows: number\n    }\n  | { kind: 'provenance-assertion'; claim: Predicate }\n  | {\n      kind: 'power-floor'\n      target: number\n      /** Minimum worthwhile effect; must be represented exactly in effectGrid. */\n      minimumEffect: number\n      effectGrid: number[]\n      sim: { trials: number; resamples: number; seed: number }\n    }\n  | { kind: 'identity'; field: 'served-model'; op: 'basename-eq'; onFail: 'abort' }\n\nexport interface GateResult {\n  id: string\n  passed: boolean\n  evidence: JsonValue\n}\n\n/**\n * Replicate-flip counting over graded states. A state whose replicates split\n * between pass and fail is flipping; its flip rate is the minority share.\n */\nexport function evaluateOracleDeterminismGate(\n  id: string,\n  gate: Extract<ValidityGate, { kind: 'oracle-determinism' }>,\n  repsByState: Record<string, readonly boolean[]>,\n): GateResult {\n  const evidence: Record<string, JsonValue> = {}\n  let passed = true\n  for (const [state, reps] of Object.entries(repsByState)) {\n    const passes = reps.filter(Boolean).length\n    const flipRate = reps.length === 0 ? 0 : Math.min(passes, reps.length - passes) / reps.length\n    evidence[state] = { passes, replicates: reps.length, flipRate }\n    if (flipRate > gate.maxFlipRate) passed = false\n  }\n  return { id, passed, evidence }\n}\n\n/**\n * Join two population snapshots on `joinOn` and compare the registered fields.\n * Only rows present in both snapshots are compared; a presence change is a\n * different failure and needs its own gate.\n */\nexport function evaluatePopulationReproducibilityGate(\n  id: string,\n  gate: Extract<ValidityGate, { kind: 'population-reproducibility' }>,\n  populations: { left: readonly EvidenceRecord[]; right: readonly EvidenceRecord[] },\n): GateResult {\n  const rightByKey = new Map(populations.right.map((r) => [String(readField(r, gate.joinOn)), r]))\n  const changed: string[] = []\n  for (const left of populations.left) {\n    const key = String(readField(left, gate.joinOn))\n    const right = rightByKey.get(key)\n    if (!right) continue\n    const moved = gate.compare.filter((f) => readField(left, f) !== readField(right, f))\n    if (moved.length > 0) {\n      changed.push(\n        `${key} ${moved.map((f) => `${f}:${String(readField(left, f))}->${String(readField(right, f))}`).join(' ')}`,\n      )\n    }\n  }\n  return { id, passed: changed.length <= gate.maxChangedRows, evidence: changed }\n}\n\n/** The registered claim about provenance must hold on the provenance record. */\nexport function evaluateProvenanceGate(\n  id: string,\n  gate: Extract<ValidityGate, { kind: 'provenance-assertion' }>,\n  provenance: EvidenceRecord,\n): GateResult {\n  const passed = evaluatePredicate(gate.claim, provenance)\n  return { id, passed, evidence: { claimHolds: passed } }\n}\n\n/** Final path segment equality between the pinned and the served identity. */\nexport function evaluateIdentityGate(\n  id: string,\n  _gate: Extract<ValidityGate, { kind: 'identity' }>,\n  identities: { pinned: string; served: string },\n): GateResult {\n  const basename = (s: string): string => s.split('/').pop() ?? s\n  const passed = basename(identities.pinned) === basename(identities.served)\n  return {\n    id,\n    passed,\n    evidence: { pinned: identities.pinned, served: identities.served, matched: passed },\n  }\n}\n\n/**\n * The design's power at minimumEffect must reach the registered target.\n * The curve must cover the registered effect grid exactly — a curve\n * computed on a different grid is different evidence and is refused.\n */\nexport function evaluatePowerFloorGate(\n  id: string,\n  gate: Extract<ValidityGate, { kind: 'power-floor' }>,\n  curve: readonly { effect: number; power: number }[],\n): GateResult {\n  const problems = powerFloorProblems(gate)\n  if (problems.length > 0) {\n    throw new ValidationError(`evaluatePowerFloorGate: ${problems.join('; ')}`)\n  }\n  if (curve.some((point) => !Number.isFinite(point.power) || point.power < 0 || point.power > 1)) {\n    throw new ValidationError('evaluatePowerFloorGate: powers must be finite and in [0,1]')\n  }\n  const byEffect = new Map(curve.map((point) => [point.effect, point.power]))\n  if (byEffect.size !== curve.length) {\n    throw new ValidationError('evaluatePowerFloorGate: curve contains duplicate effects')\n  }\n  const missing = gate.effectGrid.filter((effect) => !byEffect.has(effect))\n  if (missing.length > 0) {\n    throw new ValidationError(\n      `evaluatePowerFloorGate: curve does not cover registered effects [${missing.join(', ')}]`,\n    )\n  }\n  const extra = curve.filter((point) => !gate.effectGrid.includes(point.effect))\n  if (extra.length > 0) {\n    throw new ValidationError(\n      `evaluatePowerFloorGate: curve contains unregistered effects [${extra.map((point) => point.effect).join(', ')}]`,\n    )\n  }\n  const powers = gate.effectGrid.map((effect) => byEffect.get(effect)!)\n  const maxPower = Math.max(...powers)\n  const powerAtMinimumEffect = byEffect.get(gate.minimumEffect)!\n  return {\n    id,\n    passed: powerAtMinimumEffect >= gate.target,\n    evidence: {\n      target: gate.target,\n      minimumEffect: gate.minimumEffect,\n      powerAtMinimumEffect,\n      maxPower,\n      curve: gate.effectGrid.map((effect) => ({ effect, power: byEffect.get(effect)! })),\n    },\n  }\n}\n\n/** Shared by seal validation and direct execution; malformed designs never pass. */\nexport function powerFloorProblems(gate: Extract<ValidityGate, { kind: 'power-floor' }>): string[] {\n  const problems: string[] = []\n  if (!Number.isFinite(gate.target) || gate.target <= 0 || gate.target > 1) {\n    problems.push('power target must be in (0,1]')\n  }\n  if (!Number.isFinite(gate.minimumEffect) || gate.minimumEffect <= 0) {\n    problems.push('minimumEffect must be positive and finite')\n  }\n  if (gate.effectGrid.length === 0 || gate.effectGrid.some((effect) => !Number.isFinite(effect))) {\n    problems.push('effectGrid must contain finite effects')\n  }\n  if (new Set(gate.effectGrid).size !== gate.effectGrid.length) {\n    problems.push('effectGrid contains duplicate effects')\n  }\n  if (!gate.effectGrid.includes(gate.minimumEffect)) {\n    problems.push('effectGrid must contain minimumEffect exactly; no interpolation is assumed')\n  }\n  for (const field of ['trials', 'resamples'] as const) {\n    if (!Number.isInteger(gate.sim[field]) || gate.sim[field] <= 0) {\n      problems.push(`power simulation ${field} must be a positive integer`)\n    }\n  }\n  if (!Number.isInteger(gate.sim.seed)) problems.push('power simulation seed must be an integer')\n  return problems\n}\n\n/** Checks as prerequisites: any named gate failing refuses the spend. */\nexport interface HaltRule {\n  when: { kind: 'any-gate-failed'; gates: string[] }\n  action: 'refuse-spend'\n  report: 'settling-n'\n}\n\nexport interface HaltOutcome {\n  fired: boolean\n  action: 'refuse-spend' | null\n  failedGates: string[]\n}\n\nexport function evaluateHaltRule(halt: HaltRule, gates: readonly GateResult[]): HaltOutcome {\n  const seen = new Map(gates.map((g) => [g.id, g]))\n  const missing = halt.when.gates.filter((id) => !seen.has(id))\n  if (missing.length > 0) {\n    throw new ValidationError(\n      `evaluateHaltRule: halt references gates that were not evaluated: [${missing.join(', ')}]`,\n    )\n  }\n  const failed = halt.when.gates.filter((id) => !seen.get(id)!.passed)\n  return failed.length > 0\n    ? { fired: true, action: halt.action, failedGates: failed }\n    : { fired: false, action: null, failedGates: [] }\n}\n\n// ── Budget rules ─────────────────────────────────────────────────────\n\n/**\n * Spend schedules as data. `ledger` names every entry the ceiling counts, so\n * what the gate reads is registered, not improvised at gate time.\n */\nexport type BudgetRule =\n  | {\n      kind: 'uniform-pass'\n      ceilingUsd: number\n      maxPasses: number\n      projection: 'last-pass-cost'\n      costSource: 'priced-per-call'\n      ledger: { id: string; usd: number }[]\n      partialPass: 'report-never-lift'\n    }\n  | {\n      kind: 'n-ladder'\n      steps: number[]\n      ceilingUsd: number\n      projection: 'unit-cost-times-rows-times-n'\n      onExhaust: 'refuse-report-projection'\n    }\n\nexport interface UniformPassDecision {\n  pass: number\n  cumulativeBefore: number\n  projected: number\n  go: boolean\n}\n\nexport interface UniformPassSchedule {\n  decisions: UniformPassDecision[]\n  uniformN: number\n}\n\n/**\n * Execute the uniform-pass schedule against measured pass costs. Pass 1 always\n * runs; each later pass runs only when the cumulative spend plus the last\n * measured pass cost stays at or under the registered ceiling. The registered\n * ledger is the pre-spend the ceiling counts.\n */\nexport function runUniformPassBudget(\n  rule: Extract<BudgetRule, { kind: 'uniform-pass' }>,\n  measuredPassCosts: readonly number[],\n): UniformPassSchedule {\n  const preSpend = rule.ledger.reduce((sum, entry) => sum + entry.usd, 0)\n  let cumulative = preSpend\n  const decisions: UniformPassDecision[] = []\n  let uniformN = 0\n  for (let pass = 1; pass <= rule.maxPasses; pass++) {\n    if (pass === 1) {\n      if (measuredPassCosts[0] === undefined) break\n      cumulative += measuredPassCosts[0]\n      uniformN = 1\n      continue\n    }\n    const projected = measuredPassCosts[pass - 2]\n    if (projected === undefined) break\n    const go = cumulative + projected <= rule.ceilingUsd\n    decisions.push({ pass, cumulativeBefore: cumulative, projected, go })\n    if (!go || measuredPassCosts[pass - 1] === undefined) break\n    cumulative += measuredPassCosts[pass - 1]!\n    uniformN = pass\n  }\n  return { decisions, uniformN }\n}\n\nexport interface NLadderProjection {\n  chosenN: number | null\n  projections: { n: number; projectedUsd: number; affordable: boolean }[]\n  refusal: null | { onExhaust: 'refuse-report-projection'; reason: string }\n}\n\n/**\n * Walk the registered n-ladder and pick the first affordable step. When no\n * step fits the ceiling, the rule refuses and reports the projection instead\n * of shrinking the row set — \"never subset rows\" is the registered invariant.\n */\nexport function projectNLadderBudget(\n  rule: Extract<BudgetRule, { kind: 'n-ladder' }>,\n  measured: { unitCostUsd: number; rows: number },\n): NLadderProjection {\n  const projections = rule.steps.map((n) => {\n    const projectedUsd = measured.unitCostUsd * measured.rows * n\n    return { n, projectedUsd, affordable: projectedUsd <= rule.ceilingUsd }\n  })\n  const first = projections.find((p) => p.affordable)\n  if (first) return { chosenN: first.n, projections, refusal: null }\n  return {\n    chosenN: null,\n    projections,\n    refusal: {\n      onExhaust: rule.onExhaust,\n      reason: `no ladder step fits the ${rule.ceilingUsd} USD ceiling at ${measured.rows} rows x ${measured.unitCostUsd} USD per unit`,\n    },\n  }\n}\n\n// ── Matched budget and reissue ───────────────────────────────────────\n\n/** Arm budget matching as a refusal, not prose. Verified by `verifyMatchedBudgets`. */\nexport interface MatchedBudgetRule {\n  measure: 'realized-tokens'\n  tolerance: number\n  onFail: 'refuse-contrast'\n}\n\n/** Carrier faults are reissued; model outcomes stand. Closed enumeration. */\nexport interface ReissuePolicy {\n  carrierEvents: ('http-status' | 'transport-error' | 'deadline' | 'empty-content')[]\n  modelOutcomesStand: true\n  maxIssues: number\n}\n\nexport type ReissueVerdict = 'reissue' | 'stands' | 'exhausted'\n\n/**\n * Classify one rollout event under the registered reissue policy. A carrier\n * event within the issue budget is reissued; a model outcome always stands;\n * a carrier event past `maxIssues` is exhausted and reported, never retried.\n */\nexport function classifyReissue(\n  policy: ReissuePolicy,\n  event: string,\n  issuesSoFar: number,\n): ReissueVerdict {\n  if (!(policy.carrierEvents as string[]).includes(event)) return 'stands'\n  return issuesSoFar < policy.maxIssues ? 'reissue' : 'exhausted'\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,IAAM,6BAAN,cAAyC,gBAAgB,CAAC;;AAqB1D,SAAgB,UAAU,QAAwB,MAAuB;CACvE,IAAI,UAAmB;CACvB,KAAK,MAAM,OAAO,KAAK,MAAM,GAAG,GAAG;EACjC,IAAI,YAAY,QAAQ,OAAO,YAAY,UAAU,OAAO,KAAA;EAC5D,UAAW,QAAoC;CACjD;CACA,OAAO;AACT;;AAGA,SAAgB,kBAAkB,WAAsB,QAAiC;CACvF,QAAQ,UAAU,MAAlB;EACE,KAAK,WACH,OAAO,cAAc,UAAU,QAAQ,UAAU,KAAK,GAAG,UAAU,IAAI,UAAU,KAAK;EACxF,KAAK,MACH,OAAO,UAAU,OAAO,SAAS,UAAU,QAAQ,UAAU,KAAK,CAAc;EAClF,KAAK,OACH,OAAO,UAAU,GAAG,OAAO,MAAM,kBAAkB,GAAG,MAAM,CAAC;EAC/D,KAAK,OACH,OAAO,UAAU,GAAG,MAAM,MAAM,kBAAkB,GAAG,MAAM,CAAC;EAC9D,KAAK,OACH,OAAO,CAAC,kBAAkB,UAAU,IAAI,MAAM;CAClD;AACF;;AAGA,SAAS,cACP,OACA,IACA,QACS;CACT,IAAI,OAAO,MAAM,OAAO,UAAU;CAClC,IAAI,OAAO,MAAM,OAAO,UAAU;CAClC,MAAM,UAAU,OAAO,UAAU,YAAY,OAAO,WAAW;CAC/D,MAAM,OAAO,UAAW,QAAmB,OAAO,KAAK;CACvD,MAAM,QAAQ,UAAW,SAAoB,OAAO,MAAM;CAC1D,QAAQ,IAAR;EACE,KAAK,MACH,OAAO,OAAO;EAChB,KAAK,OACH,OAAO,QAAQ;EACjB,KAAK,MACH,OAAO,OAAO;EAChB,KAAK,OACH,OAAO,QAAQ;CACnB;AACF;;;;;;;;;;;AAgEA,SAAgB,iBACd,MACA,SACA,SAQU;CACV,IAAI,KAAK,SAAS,eAAe;EAC/B,MAAM,UAAU,IAAI,IAAI,KAAK,KAAK;EAClC,KAAK,MAAM,SAAS,CAAC,KAAK,SAAS,KAAK,YAAY,KAAK,GACvD,IAAI,CAAC,QAAQ,IAAI,KAAK,GACpB,MAAM,IAAI,gBACR,wCAAwC,MAAM,gCAAgC,KAAK,MAAM,KAAK,IAAI,EAAE,EACtG;EAGJ,MAAM,0BAAU,IAAI,IAAsB;EAC1C,KAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,QAAQ,OAAO,UAAU,QAAQ,KAAK,OAAO,CAAC;GACpD,MAAM,KAAK,OAAO,UAAU,QAAQ,KAAK,YAAY,KAAK,CAAC;GAC3D,MAAM,SAAS,QAAQ,IAAI,KAAK;GAChC,IAAI,QAAQ,OAAO,KAAK,EAAE;QACrB,QAAQ,IAAI,OAAO,CAAC,EAAE,CAAC;EAC9B;EACA,KAAK,MAAM,OAAO,QAAQ,OAAO,GAAG;GAClC,IAAI,KAAK;GACT,IAAI,KAAK,YAAY,QAAQ,QAAQ,IAAI,QAAQ;EACnD;EACA,MAAM,SAAS,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,KAAK;EACxC,MAAM,SAAmB,CAAC;EAC1B,IAAI,SAAS;EACb,OAAO,OAAO,SAAS,KAAK,QAAQ,OAAO,MAAM,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAE,SAAS,CAAC,GAAG;GAClF,MAAM,QAAQ,OAAO,SAAS,OAAO;GACrC,MAAM,MAAM,QAAQ,IAAI,KAAK;GAC7B,IAAI,IAAI,SAAS,GAAG,OAAO,KAAK,IAAI,MAAM,CAAE;GAC5C,UAAU;EACZ;EACA,OAAO;CACT;CAEA,MAAM,OAAO,QAAQ,QAAQ,KAAK;CAClC,IAAI,CAAC,MACH,MAAM,IAAI,gBAAgB,qCAAqC,KAAK,KAAK,mBAAmB;CAE9F,MAAM,QAAQ,IAAI,IAAI,QAAQ,KAAK,MAAM,CAAC,OAAO,UAAU,GAAG,QAAQ,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;CAUpF,MAAM,SAAS,CAAC,GATH,KAAK,QAAQ,OAAO;EAC/B,MAAM,SAAS,MAAM,IAAI,EAAE,KAAK,QAAQ,WAAW,EAAE;EACrD,IAAI,CAAC,QACH,MAAM,IAAI,gBACR,8BAA8B,GAAG,2CACnC;EAEF,OAAO,kBAAkB,KAAK,MAAM,MAAM;CAC5C,CACsB,CAAC,CAAC,CAAC,KAAK;CAC9B,IAAI,KAAK,MAAM,QAAQ,QAAQ,OAAO,QAAQ;CAC9C,OAAO;AACT;AA4CA,SAAS,gBACP,MACA,MACA,UACA,SACa;CACb,IAAI,KAAK,SAAS,cAAc;EAC9B,MAAM,sBAAM,IAAI,IAAY;EAC5B,KAAK,MAAM,OAAO,MAAM;GACtB,IAAI,OAAO,UAAU,KAAK,QAAQ,CAAC,MAAM,KAAK,KAAK;GACnD,IAAI,kBAAkB,KAAK,OAAO,GAAG,GAAG,IAAI,IAAI,OAAO,UAAU,KAAK,OAAO,CAAC,CAAC;EACjF;EACA,OAAO;CACT;CACA,IAAI,KAAK,GAAG,WAAW,GAAG,MAAM,IAAI,gBAAgB,kCAAkC;CAEtF,MAAM,CAAC,OAAO,GAAG,QADJ,KAAK,GAAG,KAAK,MAAM,gBAAgB,GAAG,MAAM,UAAU,OAAO,CAC9C;CAC5B,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,MAAM,OACf,IAAI,KAAK,OAAO,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,IAAI,EAAE;CAE9C,OAAO;AACT;;;;;;;;;;;AAYA,SAAS,mBAAmB,KAAc,SAAiB,OAAe,OAAuB;CAC/F,IAAI,OAAO,QAAQ,WAAW,OAAO,MAAM,IAAI;CAC/C,IAAI,OAAO,QAAQ,YAAY,OAAO,SAAS,GAAG,GAAG,OAAO;CAC5D,MAAM,IAAI,gBACR,GAAG,QAAQ,iBAAiB,MAAM,2CAA2C,OAC/E;AACF;;AAGA,SAAgB,gBACd,UACA,MACgB;CAChB,QAAQ,SAAS,MAAjB;EACE,KAAK,QAAQ;GACX,MAAM,YAAY,KAAK,QAAQ,MAAM,kBAAkB,SAAS,OAAO,CAAC,CAAC,CAAC,CAAC;GAC3E,IAAI,KAAK,WAAW,GAAG,MAAM,IAAI,gBAAgB,sCAAsC;GACvF,OAAO;IAAE,OAAO,YAAY,KAAK;IAAQ;IAAW,aAAa,KAAK;GAAO;EAC/E;EACA,KAAK,sBAAsB;GACzB,MAAM,0BAAU,IAAI,IAAqB;GACzC,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,QAAQ,OAAO,UAAU,KAAK,SAAS,OAAO,CAAC;IACrD,MAAM,MAAM,kBAAkB,SAAS,OAAO,GAAG;IACjD,QAAQ,IAAI,QAAQ,QAAQ,IAAI,KAAK,KAAK,UAAU,GAAG;GACzD;GACA,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,gBAAgB,sDAAsD;GAElF,MAAM,YAAY,CAAC,GAAG,QAAQ,OAAO,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC;GACxD,OAAO;IAAE,OAAO,YAAY,QAAQ;IAAM;IAAW,aAAa,QAAQ;GAAK;EACjF;EACA,KAAK,oBAAoB;GACvB,MAAM,yBAAS,IAAI,IAAsD;GACzE,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,MAAM,OAAO,UAAU,KAAK,SAAS,QAAQ,CAAC;IACpD,IAAI,QAAQ,SAAS,aAAa,QAAQ,SAAS,SAAS;IAC5D,MAAM,OAAO,OAAO,UAAU,KAAK,SAAS,MAAM,CAAC;IACnD,MAAM,QAAQ,mBACZ,UAAU,KAAK,SAAS,KAAK,GAC7B,oCACA,SAAS,OACT,SAAS,KAAK,EAChB;IACA,MAAM,OAAO,OAAO,IAAI,IAAI,KAAK,CAAC;IAClC,IAAI,QAAQ,SAAS,WAAW,KAAK,YAAY;SAC5C,KAAK,UAAU;IACpB,OAAO,IAAI,MAAM,IAAI;GACvB;GACA,IAAI,OAAO,SAAS,GAClB,MAAM,IAAI,gBAAgB,mDAAmD;GAE/E,IAAI,MAAM;GACV,KAAK,MAAM,QAAQ,OAAO,OAAO,GAE/B,QAAQ,KAAK,aAAa,MAAM,KAAK,WAAW;GAElD,OAAO;IAAE,OAAO,MAAM,OAAO;IAAM,WAAW;IAAK,aAAa,OAAO;GAAK;EAC9E;EACA,KAAK,aAAa;GAChB,MAAM,eAAe,gBACnB,SAAS,WACT,MACA,SAAS,UACT,SAAS,OACX;GACA,MAAM,iBAAiB,gBACrB,SAAS,aACT,MACA,SAAS,UACT,SAAS,OACX;GACA,IAAI,eAAe,SAAS,GAC1B,MAAM,IAAI,gBAAgB,qDAAqD;GAEjF,OAAO;IACL,OAAO,aAAa,OAAO,eAAe;IAC1C,WAAW,aAAa;IACxB,aAAa,eAAe;GAC9B;EACF;CACF;AACF;;AAyBA,SAAgB,qBAAqB,MAA8B;CACjE,IAAI,SAAS,QAAQ,OAAO,SAAS,YAAY,MAAM,QAAQ,IAAI,GACjE,OAAO,CAAC,4BAA4B;CAEtC,IAAI,KAAK,SAAS,uBAAuB,KAAK,SAAS,mBACrD,OAAO,CAAC,4DAA4D;CAEtE,MAAM,WAAqB,CAAC;CAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,GACnE,SAAS,KAAK,oDAAoD;CAEpE,IAAI,KAAK,SAAS,qBAAqB;EACrC,KAAK,MAAM,SAAS,CAAC,aAAa,OAAO,GAAY;GACnD,MAAM,OAAO,KAAK;GAClB,IACE,OAAO,SAAS,YAChB,KAAK,MAAM,GAAG,CAAC,CAAC,MAAM,YAAY,QAAQ,WAAW,KAAK,QAAQ,KAAK,MAAM,OAAO,GAEpF,SAAS,KAAK,GAAG,MAAM,6CAA6C;EAExE;EACA,IACE,CAAC,OAAO,cAAc,KAAK,SAAS,KACpC,KAAK,YAAY,KACjB,KAAK,YAAY,YAEjB,SAAS,KAAK,wEAAwE;EAExF,IAAI,CAAC,OAAO,cAAc,KAAK,IAAI,GAAG,SAAS,KAAK,6BAA6B;EACjF,IAAI,KAAK,WAAW,cAAc,SAAS,KAAK,2BAA2B;CAC7E;CACA,OAAO;AACT;;;;;;;;;AAUA,SAAgB,gBACd,MACA,UAGkB;CAClB,MAAM,WAAW,qBAAqB,IAAI;CAC1C,IAAI,SAAS,SAAS,GAAG,MAAM,IAAI,gBAAgB,oBAAoB,SAAS,KAAK,IAAI,GAAG;CAC5F,IAAI,aAAa,QAAQ,OAAO,aAAa,YAAY,MAAM,QAAQ,QAAQ,GAC7E,MAAM,IAAI,gBAAgB,6CAA6C;CAEzE,IAAI,KAAK,SAAS,qBAAqB;EACrC,IAAI,SAAS,SAAS,QACpB,MAAM,IAAI,gBAAgB,0DAA0D;EAEtF,IAAI,WAAW,UACb,MAAM,IAAI,gBACR,wEACF;EAEF,IAAI,CAAC,MAAM,QAAQ,SAAS,IAAI,GAC9B,MAAM,IAAI,gBAAgB,wCAAwC;EACpE,MAAM,2BAAW,IAAI,IAAsB;EAC3C,KAAK,MAAM,CAAC,OAAO,QAAQ,SAAS,KAAK,QAAQ,GAAG;GAClD,IAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAC9D,MAAM,IAAI,gBAAgB,wBAAwB,MAAM,mBAAmB;GAE7E,MAAM,UAAU,UAAU,KAAK,KAAK,SAAS;GAC7C,IACE,EAAE,OAAO,YAAY,YAAY,QAAQ,SAAS,KAAK,QAAQ,KAAK,MAAM,YAC1E,EAAE,OAAO,YAAY,YAAY,OAAO,SAAS,OAAO,IAExD,MAAM,IAAI,gBACR,mCAAmC,KAAK,UAAU,sDAAsD,OAC1G;GAEF,MAAM,aAAa,GAAG,OAAO,QAAQ,GAAG;GACxC,MAAM,QAAQ,mBACZ,UAAU,KAAK,KAAK,KAAK,GACzB,qCACA,KAAK,OACL,YAAY,QAAQ,EACtB;GACA,MAAM,SAAS,SAAS,IAAI,UAAU;GACtC,IAAI,QAAQ,OAAO,KAAK,KAAK;QACxB,SAAS,IAAI,YAAY,CAAC,KAAK,CAAC;EACvC;EACA,MAAM,gBAAgB,CAAC,GAAG,SAAS,QAAQ,CAAC,CAAC,CAC1C,MAAM,CAAC,IAAI,CAAC,OAAQ,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAE,CAAC,CAChD,KAAK,GAAG,YAAY,MAAM;EAC7B,IAAI,cAAc,SAAS,GACzB,MAAM,IAAI,gBACR,+DAA+D,cAAc,QAC/E;EAEF,MAAM,MAAM,WAAW,KAAK,IAAI;EAChC,MAAM,QAAQ,IAAI,MAAc,KAAK,SAAS;EAC9C,KAAK,IAAI,OAAO,GAAG,OAAO,KAAK,WAAW,QAAQ;GAChD,IAAI,MAAM;GACV,IAAI,QAAQ;GACZ,KAAK,IAAI,OAAO,GAAG,OAAO,cAAc,QAAQ,QAAQ;IACtD,MAAM,UAAU,cAAc,KAAK,MAAM,IAAI,IAAI,cAAc,MAAM;IACrE,KAAK,MAAM,SAAS,SAAS,OAAO;IACpC,SAAS,QAAQ;GACnB;GACA,MAAM,QAAQ,MAAM;GACpB,IAAI,CAAC,OAAO,SAAS,MAAM,KAAK,GAC9B,MAAM,IAAI,gBACR,mEACF;EAEJ;EACA,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC;EAC1B,MAAM,QAAQ,IAAI,KAAK;EACvB,MAAM,aAAa,KAAK,MAAO,QAAQ,IAAK,KAAK,SAAS;EAC1D,MAAM,aAAa,KAAK,IAAI,KAAK,YAAY,GAAG,KAAK,MAAM,IAAI,QAAQ,KAAK,KAAK,SAAS,IAAI,CAAC;EAC/F,OAAO;GACL,OAAO,MAAM;GACb,OAAO,MAAM,KAAK,IAAI,YAAY,UAAU;GAC5C,OAAO,KAAK;EACd;CACF;CAEA,IAAI,SAAS,SAAS,YACpB,MAAM,IAAI,gBAAgB,6DAA6D;CAEzF,MAAM,EAAE,WAAW,WAAW;CAC9B,IACE,CAAC,OAAO,cAAc,SAAS,KAC/B,CAAC,OAAO,cAAc,MAAM,KAC5B,UAAU,KACV,YAAY,GAEZ,MAAM,IAAI,gBACR,wEAAwE,UAAU,GAAG,QACvF;CAEF,IAAI,YAAY,QACd,MAAM,IAAI,gBACR,8CAA8C,UAAU,iBAAiB,QAC3E;CAEF,MAAM,QAAQ,IAAI,KAAK;CAGvB,OAAO;EAAE,OAFK,cAAc,IAAI,IAAI,iBAAiB,WAAW,QAAQ,QAAQ,GAAG,OAAO;EAE1E,OADF,cAAc,SAAS,IAAI,iBAAiB,WAAW,QAAQ,QAAQ,GAAG,OAAO;EACxE,OAAO,KAAK;CAAM;AAC3C;;;;;;AAOA,SAAS,iBACP,WACA,QACA,OACA,MACQ;CACR,MAAM,QAAQ,MAAsB;EAElC,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,KAAK,QAAQ,KAAK;GAEhC,IAAI,EADW,SAAS,UAAU,KAAK,YAAY,KAAK,YAC3C;GACb,OAAO,KAAK,IAAI,eAAe,GAAG,QAAQ,CAAC,CAAC;EAC9C;EACA,OAAO;CACT;CACA,IAAI,KAAK;CACT,IAAI,KAAK;CACT,KAAK,IAAI,OAAO,GAAG,OAAO,KAAK,QAAQ;EACrC,MAAM,OAAO,KAAK,MAAM;EACxB,IAAI,KAAK,GAAG,IAAI,OACd,IAAI,SAAS,SAAS,KAAK;OACtB,KAAK;OAEV,IAAI,SAAS,SAAS,KAAK;OACtB,KAAK;CAEd;CACA,QAAQ,KAAK,MAAM;AACrB;AAEA,SAAS,eAAe,GAAW,GAAW,GAAmB;CAC/D,IAAI,KAAK,GAAG,OAAO,MAAM,IAAI,IAAI,OAAO;CACxC,IAAI,KAAK,GAAG,OAAO,MAAM,IAAI,IAAI,OAAO;CACxC,OAAO,UAAU,GAAG,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC;AACrE;AAEA,SAAS,UAAU,GAAW,GAAmB;CAC/C,OAAO,aAAa,CAAC,IAAI,aAAa,CAAC,IAAI,aAAa,IAAI,CAAC;AAC/D;AAEA,MAAM,sBAAgC,CAAC,CAAC;AACxC,SAAS,aAAa,GAAmB;CACvC,KAAK,IAAI,IAAI,oBAAoB,QAAQ,KAAK,GAAG,KAC/C,oBAAoB,KAAK,oBAAoB,IAAI,KAAM,KAAK,IAAI,CAAC;CAEnE,OAAO,oBAAoB;AAC7B;AAqBA,SAAgB,kBAAkB,WAAsB,UAAsC;CAC5F,QAAQ,UAAU,MAAlB;EACE,KAAK,0BAA0B;GAC7B,MAAM,WAAW,SAAS,UAAU,UAAU;GAC9C,IAAI,CAAC,UACH,MAAM,IAAI,gBACR,gCAAgC,UAAU,SAAS,yBACrD;GAGF,QADiB,SAAS,QAAQ,KAAK,SAAS,QAAQ,OACpC,UAAU,SAAS,aAAa,SAAS,QAAQ,IAAI,SAAS,QAAQ;EAC5F;EACA,KAAK,0BAA0B;GAC7B,MAAM,WAAW,SAAS,UAAU,UAAU;GAC9C,IAAI,CAAC,UACH,MAAM,IAAI,gBACR,gCAAgC,UAAU,SAAS,yBACrD;GAEF,OAAO,SAAS,SAAS,KAAK,SAAS,SAAS;EAClD;EACA,KAAK,sBAAsB;GACzB,MAAM,QAAQ,SAAS,WAAW,UAAU;GAC5C,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,gBACR,gCAAgC,UAAU,SAAS,yBACrD;GAEF,OAAO,cAAc,OAAO,UAAU,IAAI,UAAU,KAAK;EAC3D;EACA,KAAK,kBACH,OAAO,SAAS,eAAe,UAAU,gBAAgB;EAC3D,KAAK,OACH,OAAO,UAAU,GAAG,OAAO,MAAM,kBAAkB,GAAG,QAAQ,CAAC;EACjE,KAAK,OACH,OAAO,UAAU,GAAG,MAAM,MAAM,kBAAkB,GAAG,QAAQ,CAAC;EAChE,KAAK,OACH,OAAO,CAAC,kBAAkB,UAAU,IAAI,QAAQ;CACpD;AACF;AA8BA,SAAgB,oBACd,MACA,UACiB;CACjB,IAAI,KAAK,SAAS,eAChB,OAAO;EAAE,SAAS;EAAe,QAAQ,CAAC,GAAG,KAAK,WAAW,GAAG,KAAK,SAAS;CAAE;CAElF,KAAK,MAAM,UAAU,KAAK,UACxB,IAAI,kBAAkB,OAAO,MAAM,QAAQ,GACzC,OAAO;EAAE,SAAS,OAAO;EAAS,QAAQ,OAAO;CAAO;CAG5D,MAAM,IAAI,2BACR,mFACF;AACF;;;;;AA8CA,SAAgB,8BACd,IACA,MACA,aACY;CACZ,MAAM,WAAsC,CAAC;CAC7C,IAAI,SAAS;CACb,KAAK,MAAM,CAAC,OAAO,SAAS,OAAO,QAAQ,WAAW,GAAG;EACvD,MAAM,SAAS,KAAK,OAAO,OAAO,CAAC,CAAC;EACpC,MAAM,WAAW,KAAK,WAAW,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,SAAS,MAAM,IAAI,KAAK;EACvF,SAAS,SAAS;GAAE;GAAQ,YAAY,KAAK;GAAQ;EAAS;EAC9D,IAAI,WAAW,KAAK,aAAa,SAAS;CAC5C;CACA,OAAO;EAAE;EAAI;EAAQ;CAAS;AAChC;;;;;;AAOA,SAAgB,sCACd,IACA,MACA,aACY;CACZ,MAAM,aAAa,IAAI,IAAI,YAAY,MAAM,KAAK,MAAM,CAAC,OAAO,UAAU,GAAG,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CAC/F,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,QAAQ,YAAY,MAAM;EACnC,MAAM,MAAM,OAAO,UAAU,MAAM,KAAK,MAAM,CAAC;EAC/C,MAAM,QAAQ,WAAW,IAAI,GAAG;EAChC,IAAI,CAAC,OAAO;EACZ,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MAAM,UAAU,MAAM,CAAC,MAAM,UAAU,OAAO,CAAC,CAAC;EACnF,IAAI,MAAM,SAAS,GACjB,QAAQ,KACN,GAAG,IAAI,GAAG,MAAM,KAAK,MAAM,GAAG,EAAE,GAAG,OAAO,UAAU,MAAM,CAAC,CAAC,EAAE,IAAI,OAAO,UAAU,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,GAC3G;CAEJ;CACA,OAAO;EAAE;EAAI,QAAQ,QAAQ,UAAU,KAAK;EAAgB,UAAU;CAAQ;AAChF;;AAGA,SAAgB,uBACd,IACA,MACA,YACY;CACZ,MAAM,SAAS,kBAAkB,KAAK,OAAO,UAAU;CACvD,OAAO;EAAE;EAAI;EAAQ,UAAU,EAAE,YAAY,OAAO;CAAE;AACxD;;AAGA,SAAgB,qBACd,IACA,OACA,YACY;CACZ,MAAM,YAAY,MAAsB,EAAE,MAAM,GAAG,CAAC,CAAC,IAAI,KAAK;CAC9D,MAAM,SAAS,SAAS,WAAW,MAAM,MAAM,SAAS,WAAW,MAAM;CACzE,OAAO;EACL;EACA;EACA,UAAU;GAAE,QAAQ,WAAW;GAAQ,QAAQ,WAAW;GAAQ,SAAS;EAAO;CACpF;AACF;;;;;;AAOA,SAAgB,uBACd,IACA,MACA,OACY;CACZ,MAAM,WAAW,mBAAmB,IAAI;CACxC,IAAI,SAAS,SAAS,GACpB,MAAM,IAAI,gBAAgB,2BAA2B,SAAS,KAAK,IAAI,GAAG;CAE5E,IAAI,MAAM,MAAM,UAAU,CAAC,OAAO,SAAS,MAAM,KAAK,KAAK,MAAM,QAAQ,KAAK,MAAM,QAAQ,CAAC,GAC3F,MAAM,IAAI,gBAAgB,4DAA4D;CAExF,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,UAAU,CAAC,MAAM,QAAQ,MAAM,KAAK,CAAC,CAAC;CAC1E,IAAI,SAAS,SAAS,MAAM,QAC1B,MAAM,IAAI,gBAAgB,0DAA0D;CAEtF,MAAM,UAAU,KAAK,WAAW,QAAQ,WAAW,CAAC,SAAS,IAAI,MAAM,CAAC;CACxE,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,gBACR,oEAAoE,QAAQ,KAAK,IAAI,EAAE,EACzF;CAEF,MAAM,QAAQ,MAAM,QAAQ,UAAU,CAAC,KAAK,WAAW,SAAS,MAAM,MAAM,CAAC;CAC7E,IAAI,MAAM,SAAS,GACjB,MAAM,IAAI,gBACR,gEAAgE,MAAM,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,EAChH;CAEF,MAAM,SAAS,KAAK,WAAW,KAAK,WAAW,SAAS,IAAI,MAAM,CAAE;CACpE,MAAM,WAAW,KAAK,IAAI,GAAG,MAAM;CACnC,MAAM,uBAAuB,SAAS,IAAI,KAAK,aAAa;CAC5D,OAAO;EACL;EACA,QAAQ,wBAAwB,KAAK;EACrC,UAAU;GACR,QAAQ,KAAK;GACb,eAAe,KAAK;GACpB;GACA;GACA,OAAO,KAAK,WAAW,KAAK,YAAY;IAAE;IAAQ,OAAO,SAAS,IAAI,MAAM;GAAG,EAAE;EACnF;CACF;AACF;;AAGA,SAAgB,mBAAmB,MAAgE;CACjG,MAAM,WAAqB,CAAC;CAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,MAAM,KAAK,KAAK,UAAU,KAAK,KAAK,SAAS,GACrE,SAAS,KAAK,+BAA+B;CAE/C,IAAI,CAAC,OAAO,SAAS,KAAK,aAAa,KAAK,KAAK,iBAAiB,GAChE,SAAS,KAAK,2CAA2C;CAE3D,IAAI,KAAK,WAAW,WAAW,KAAK,KAAK,WAAW,MAAM,WAAW,CAAC,OAAO,SAAS,MAAM,CAAC,GAC3F,SAAS,KAAK,wCAAwC;CAExD,IAAI,IAAI,IAAI,KAAK,UAAU,CAAC,CAAC,SAAS,KAAK,WAAW,QACpD,SAAS,KAAK,uCAAuC;CAEvD,IAAI,CAAC,KAAK,WAAW,SAAS,KAAK,aAAa,GAC9C,SAAS,KAAK,4EAA4E;CAE5F,KAAK,MAAM,SAAS,CAAC,UAAU,WAAW,GACxC,IAAI,CAAC,OAAO,UAAU,KAAK,IAAI,MAAM,KAAK,KAAK,IAAI,UAAU,GAC3D,SAAS,KAAK,oBAAoB,MAAM,4BAA4B;CAGxE,IAAI,CAAC,OAAO,UAAU,KAAK,IAAI,IAAI,GAAG,SAAS,KAAK,0CAA0C;CAC9F,OAAO;AACT;AAeA,SAAgB,iBAAiB,MAAgB,OAA2C;CAC1F,MAAM,OAAO,IAAI,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAChD,MAAM,UAAU,KAAK,KAAK,MAAM,QAAQ,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;CAC5D,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,gBACR,qEAAqE,QAAQ,KAAK,IAAI,EAAE,EAC1F;CAEF,MAAM,SAAS,KAAK,KAAK,MAAM,QAAQ,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAE,MAAM;CACnE,OAAO,OAAO,SAAS,IACnB;EAAE,OAAO;EAAM,QAAQ,KAAK;EAAQ,aAAa;CAAO,IACxD;EAAE,OAAO;EAAO,QAAQ;EAAM,aAAa,CAAC;CAAE;AACpD;;;;;;;AA4CA,SAAgB,qBACd,MACA,mBACqB;CAErB,IAAI,aADa,KAAK,OAAO,QAAQ,KAAK,UAAU,MAAM,MAAM,KAAK,CAC7C;CACxB,MAAM,YAAmC,CAAC;CAC1C,IAAI,WAAW;CACf,KAAK,IAAI,OAAO,GAAG,QAAQ,KAAK,WAAW,QAAQ;EACjD,IAAI,SAAS,GAAG;GACd,IAAI,kBAAkB,OAAO,KAAA,GAAW;GACxC,cAAc,kBAAkB;GAChC,WAAW;GACX;EACF;EACA,MAAM,YAAY,kBAAkB,OAAO;EAC3C,IAAI,cAAc,KAAA,GAAW;EAC7B,MAAM,KAAK,aAAa,aAAa,KAAK;EAC1C,UAAU,KAAK;GAAE;GAAM,kBAAkB;GAAY;GAAW;EAAG,CAAC;EACpE,IAAI,CAAC,MAAM,kBAAkB,OAAO,OAAO,KAAA,GAAW;EACtD,cAAc,kBAAkB,OAAO;EACvC,WAAW;CACb;CACA,OAAO;EAAE;EAAW;CAAS;AAC/B;;;;;;AAaA,SAAgB,qBACd,MACA,UACmB;CACnB,MAAM,cAAc,KAAK,MAAM,KAAK,MAAM;EACxC,MAAM,eAAe,SAAS,cAAc,SAAS,OAAO;EAC5D,OAAO;GAAE;GAAG;GAAc,YAAY,gBAAgB,KAAK;EAAW;CACxE,CAAC;CACD,MAAM,QAAQ,YAAY,MAAM,MAAM,EAAE,UAAU;CAClD,IAAI,OAAO,OAAO;EAAE,SAAS,MAAM;EAAG;EAAa,SAAS;CAAK;CACjE,OAAO;EACL,SAAS;EACT;EACA,SAAS;GACP,WAAW,KAAK;GAChB,QAAQ,2BAA2B,KAAK,WAAW,kBAAkB,SAAS,KAAK,UAAU,SAAS,YAAY;EACpH;CACF;AACF;;;;;;AAyBA,SAAgB,gBACd,QACA,OACA,aACgB;CAChB,IAAI,CAAE,OAAO,cAA2B,SAAS,KAAK,GAAG,OAAO;CAChE,OAAO,cAAc,OAAO,YAAY,YAAY;AACtD"}

package/dist/ast-hI-vjW6J.d.ts

@@ -0,0 +1,457 @@
+//#region src/experiment/ast.d.ts
+/**
+ * The registered-rule AST: every rule an experiment registers is DATA.
+ *
+ * A closure cannot be canonicalized or hashed; a node tree can. `sealExperiment`
+ * hashes the whole tree, and every interpreter in this file takes only a node
+ * plus evidence records — no parameter for alpha, threshold, metric, or
+ * stopping rule exists on any executable surface. The registered object and
+ * the executed object are therefore the same object, and registered-vs-ran
+ * drift is unrepresentable rather than checked.
+ *
+ * Node families:
+ *   Predicate       closed-key comparisons — the only leaf
+ *   AdmissionRule   monotone funnel stages with registered waivers
+ *   SelectionRule   deterministic subsets over a closed field set
+ *   Estimand        what the experiment measures
+ *   IntervalSpec    how uncertainty is computed, seed included
+ *   Condition       decision guards over named derived quantities
+ *   DecisionRule    ordered verdict table, or a registered absence of one
+ *   Obligation      a control that must exist before a verdict class is read
+ *   ValidityGate    pre-spend design checks
+ *   HaltRule        gates as prerequisites — failure refuses the spend
+ *   BudgetRule      spend schedules with a named ledger
+ *   MatchedBudgetRule  arm budget matching as a refusal
+ *   ReissuePolicy   carrier faults are reissued; model outcomes stand
+ */
+/** JSON-serializable value — everything a sealed node may carry. */
+type JsonValue = string | number | boolean | null | JsonValue[] | {
+  [k: string]: JsonValue;
+};
+/** Evidence row shape. Fields are addressed by dot-separated paths. */
+type EvidenceRecord = Record<string, unknown>;
+/**
+ * Closed-key comparison over a declared record schema. The only leaf node.
+ * `field` is a dot-separated path into an evidence record.
+ */
+type Predicate = {
+  kind: 'compare';
+  field: string;
+  op: 'eq' | 'ne' | 'lt' | 'lte' | 'gt' | 'gte';
+  value: JsonValue;
+} | {
+  kind: 'in';
+  field: string;
+  values: JsonValue[];
+} | {
+  kind: 'all';
+  of: Predicate[];
+} | {
+  kind: 'any';
+  of: Predicate[];
+} | {
+  kind: 'not';
+  of: Predicate;
+};
+/** Read a dot-separated field path. Missing segments yield `undefined`. */
+declare function readField(record: EvidenceRecord, path: string): unknown;
+/** Evaluate a predicate against one evidence record. */
+declare function evaluatePredicate(predicate: Predicate, record: EvidenceRecord): boolean;
+/**
+ * One monotone funnel stage. `waives` names substrate admission conditions
+ * deliberately NOT applied, so a waiver is registered, never implicit.
+ */
+interface AdmissionStage {
+  id: string;
+  keep: Predicate;
+  waives?: string[];
+}
+/** A partition is a set reported separately and never pooled. */
+interface AdmissionPartition {
+  id: string;
+  /** Stage whose dropped rows this partition draws from. */
+  from: string;
+  keep: Predicate;
+  pooling: 'never';
+}
+/** Declarative row-admission funnel. Stages only remove rows. */
+interface AdmissionRule {
+  population: string;
+  stages: AdmissionStage[];
+  partitions?: AdmissionPartition[];
+}
+/**
+ * Deterministic subset selection. `reads` is the closed field set the rule
+ * may touch — outcome-contaminated selection is unrepresentable because an
+ * outcome field is simply not in the list.
+ */
+type SelectionRule = {
+  kind: 'round-robin';
+  groupBy: string;
+  groupOrder: 'lex-asc';
+  withinOrder: {
+    field: string;
+    dir: 'asc' | 'desc';
+  };
+  take: number;
+  reads: string[];
+} | {
+  kind: 'filter-of';
+  /** Name of the sealed subset or selection this rule filters. */
+  base: string;
+  keep: Predicate;
+  order: {
+    field: string;
+    dir: 'asc' | 'desc';
+  };
+};
+/**
+ * Execute a selection rule.
+ *
+ * Round-robin walks groups in lexicographic order and takes ids in
+ * within-group order until `take` ids are chosen. Filter-of keeps the ids of
+ * `bases[rule.base]` whose record satisfies the predicate, in the registered
+ * order. Ids absent from `records` are evaluated on their id alone (fields
+ * derived from the id via `idFields`), so a sealed base outlives its source
+ * records.
+ */
+declare function runSelectionRule(rule: SelectionRule, records: readonly EvidenceRecord[], options: {
+  /** Field carrying a row's identity. */
+  idField: string;
+  /** Sealed or previously-computed subsets, by name. */
+  bases?: Record<string, readonly string[]>;
+  /** Derive predicate-readable fields from a bare id when its record is absent. */
+  idFields?: (id: string) => EvidenceRecord;
+}): string[];
+/** A named set of row identities, built from arm rows and an event predicate. */
+type SetExpr = {
+  kind: 'rows-where';
+  arm: string;
+  event: Predicate;
+} | {
+  kind: 'intersect';
+  of: SetExpr[];
+};
+/**
+ * What the experiment measures. Every estimand names the fields it reads, so
+ * the sealed tree records the full data dependency of the number.
+ */
+type Estimand = {
+  kind: 'rate';
+  event: Predicate;
+  over: 'rollouts';
+} | {
+  kind: 'rate-at-least-once';
+  event: Predicate;
+  groupBy: string;
+} | {
+  kind: 'paired-mean-diff';
+  armField: string;
+  treatment: string;
+  control: string;
+  pairBy: string;
+  /**
+   * Field path to the per-row outcome. A boolean reads as 1 or 0, so a
+   * binary pass/fail outcome gives the risk difference directly.
+   */
+  value: string;
+  /** A pair one arm did not answer contributes a difference of exactly zero. */
+  missing: 'zero-diff';
+} | {
+  kind: 'set-ratio';
+  armField: string;
+  idField: string;
+  numerator: SetExpr;
+  denominator: SetExpr;
+};
+interface EstimandResult {
+  value: number;
+  numerator: number;
+  denominator: number;
+}
+/** Compute an estimand over evidence rows. Pure; reads only registered fields. */
+declare function computeEstimand(estimand: Estimand, rows: readonly EvidenceRecord[]): EstimandResult;
+/** How uncertainty is computed. The seed is part of the registration. */
+type IntervalSpec = {
+  kind: 'cluster-bootstrap';
+  clusterBy: string;
+  /** Registered numeric or boolean outcome field, including a prepared paired difference. */
+  value: string;
+  resamples: number;
+  seed: number;
+  level: number;
+  method: 'percentile';
+} | {
+  kind: 'clopper-pearson';
+  level: number;
+};
+interface ComputedInterval {
+  lower: number;
+  upper: number;
+  level: number;
+}
+/**
+ * Execute an interval spec.
+ *
+ * Cluster-bootstrap resamples whole clusters of its registered `value` field and
+ * takes percentile bounds of the pooled mean. Clopper-Pearson computes the
+ * exact binomial interval and requires `successes`/`trials` evidence instead
+ * of rows.
+ */
+declare function computeInterval(spec: IntervalSpec, evidence: {
+  kind: 'rows';
+  rows: readonly EvidenceRecord[];
+} | {
+  kind: 'binomial';
+  successes: number;
+  trials: number;
+}): ComputedInterval;
+/** Decision guards read only named derived quantities — never raw rows. */
+type Condition = {
+  kind: 'interval-excludes-zero';
+  interval: string;
+  sign: 'positive' | 'negative';
+} | {
+  kind: 'interval-includes-zero';
+  interval: string;
+} | {
+  kind: 'quantity-threshold';
+  quantity: string;
+  op: 'gte' | 'lte' | 'gt' | 'lt';
+  value: number;
+} | {
+  kind: 'obligation-met';
+  obligation: string;
+} | {
+  kind: 'all';
+  of: Condition[];
+} | {
+  kind: 'any';
+  of: Condition[];
+} | {
+  kind: 'not';
+  of: Condition;
+};
+/** The named quantities a decision rule may read. Nothing else reaches it. */
+interface DerivedQuantities {
+  intervals: Record<string, {
+    lower: number;
+    upper: number;
+  }>;
+  quantities: Record<string, number>;
+  obligationsMet: Record<string, boolean>;
+}
+declare function evaluateCondition(condition: Condition, evidence: DerivedQuantities): boolean;
+interface DecisionBranch {
+  when: Condition;
+  verdict: string;
+  report: string[];
+}
+/**
+ * Ordered decision table: the first branch whose condition holds fires, and a
+ * table no branch matches throws — a non-total registration is a defect, not
+ * an implicit verdict. `report-only` registers the ABSENCE of a verdict
+ * branch: the estimate and the per-row table are the finding, and the
+ * registered meaning prose rides as non-executable interpretation data.
+ */
+type DecisionRule = {
+  kind: 'table';
+  branches: DecisionBranch[];
+} | {
+  kind: 'report-only';
+  estimands: string[];
+  intervals: string[];
+  perRow: string[];
+  interpretation?: {
+    onQualitative: string;
+    consequence: string;
+  }[];
+};
+interface DecisionOutcome {
+  verdict: string;
+  report: string[];
+}
+declare function executeDecisionRule(rule: DecisionRule, evidence: DerivedQuantities): DecisionOutcome;
+/** A registered control that must exist before a class of verdicts is read. */
+interface Obligation {
+  id: string;
+  appliesToVerdicts: string[];
+  control: string;
+}
+/** Pre-spend design checks. Each returns pass/fail plus its evidence. */
+type ValidityGate = {
+  kind: 'oracle-determinism';
+  unit: 'suite' | 'assertion';
+  replicates: number;
+  maxFlipRate: number;
+} | {
+  kind: 'population-reproducibility';
+  joinOn: string;
+  compare: string[];
+  maxChangedRows: number;
+} | {
+  kind: 'provenance-assertion';
+  claim: Predicate;
+} | {
+  kind: 'power-floor';
+  target: number;
+  /** Minimum worthwhile effect; must be represented exactly in effectGrid. */
+  minimumEffect: number;
+  effectGrid: number[];
+  sim: {
+    trials: number;
+    resamples: number;
+    seed: number;
+  };
+} | {
+  kind: 'identity';
+  field: 'served-model';
+  op: 'basename-eq';
+  onFail: 'abort';
+};
+interface GateResult {
+  id: string;
+  passed: boolean;
+  evidence: JsonValue;
+}
+/**
+ * Replicate-flip counting over graded states. A state whose replicates split
+ * between pass and fail is flipping; its flip rate is the minority share.
+ */
+declare function evaluateOracleDeterminismGate(id: string, gate: Extract<ValidityGate, {
+  kind: 'oracle-determinism';
+}>, repsByState: Record<string, readonly boolean[]>): GateResult;
+/**
+ * Join two population snapshots on `joinOn` and compare the registered fields.
+ * Only rows present in both snapshots are compared; a presence change is a
+ * different failure and needs its own gate.
+ */
+declare function evaluatePopulationReproducibilityGate(id: string, gate: Extract<ValidityGate, {
+  kind: 'population-reproducibility';
+}>, populations: {
+  left: readonly EvidenceRecord[];
+  right: readonly EvidenceRecord[];
+}): GateResult;
+/** The registered claim about provenance must hold on the provenance record. */
+declare function evaluateProvenanceGate(id: string, gate: Extract<ValidityGate, {
+  kind: 'provenance-assertion';
+}>, provenance: EvidenceRecord): GateResult;
+/** Final path segment equality between the pinned and the served identity. */
+declare function evaluateIdentityGate(id: string, _gate: Extract<ValidityGate, {
+  kind: 'identity';
+}>, identities: {
+  pinned: string;
+  served: string;
+}): GateResult;
+/**
+ * The design's power at minimumEffect must reach the registered target.
+ * The curve must cover the registered effect grid exactly — a curve
+ * computed on a different grid is different evidence and is refused.
+ */
+declare function evaluatePowerFloorGate(id: string, gate: Extract<ValidityGate, {
+  kind: 'power-floor';
+}>, curve: readonly {
+  effect: number;
+  power: number;
+}[]): GateResult;
+/** Checks as prerequisites: any named gate failing refuses the spend. */
+interface HaltRule {
+  when: {
+    kind: 'any-gate-failed';
+    gates: string[];
+  };
+  action: 'refuse-spend';
+  report: 'settling-n';
+}
+interface HaltOutcome {
+  fired: boolean;
+  action: 'refuse-spend' | null;
+  failedGates: string[];
+}
+declare function evaluateHaltRule(halt: HaltRule, gates: readonly GateResult[]): HaltOutcome;
+/**
+ * Spend schedules as data. `ledger` names every entry the ceiling counts, so
+ * what the gate reads is registered, not improvised at gate time.
+ */
+type BudgetRule = {
+  kind: 'uniform-pass';
+  ceilingUsd: number;
+  maxPasses: number;
+  projection: 'last-pass-cost';
+  costSource: 'priced-per-call';
+  ledger: {
+    id: string;
+    usd: number;
+  }[];
+  partialPass: 'report-never-lift';
+} | {
+  kind: 'n-ladder';
+  steps: number[];
+  ceilingUsd: number;
+  projection: 'unit-cost-times-rows-times-n';
+  onExhaust: 'refuse-report-projection';
+};
+interface UniformPassDecision {
+  pass: number;
+  cumulativeBefore: number;
+  projected: number;
+  go: boolean;
+}
+interface UniformPassSchedule {
+  decisions: UniformPassDecision[];
+  uniformN: number;
+}
+/**
+ * Execute the uniform-pass schedule against measured pass costs. Pass 1 always
+ * runs; each later pass runs only when the cumulative spend plus the last
+ * measured pass cost stays at or under the registered ceiling. The registered
+ * ledger is the pre-spend the ceiling counts.
+ */
+declare function runUniformPassBudget(rule: Extract<BudgetRule, {
+  kind: 'uniform-pass';
+}>, measuredPassCosts: readonly number[]): UniformPassSchedule;
+interface NLadderProjection {
+  chosenN: number | null;
+  projections: {
+    n: number;
+    projectedUsd: number;
+    affordable: boolean;
+  }[];
+  refusal: null | {
+    onExhaust: 'refuse-report-projection';
+    reason: string;
+  };
+}
+/**
+ * Walk the registered n-ladder and pick the first affordable step. When no
+ * step fits the ceiling, the rule refuses and reports the projection instead
+ * of shrinking the row set — "never subset rows" is the registered invariant.
+ */
+declare function projectNLadderBudget(rule: Extract<BudgetRule, {
+  kind: 'n-ladder';
+}>, measured: {
+  unitCostUsd: number;
+  rows: number;
+}): NLadderProjection;
+/** Arm budget matching as a refusal, not prose. Verified by `verifyMatchedBudgets`. */
+interface MatchedBudgetRule {
+  measure: 'realized-tokens';
+  tolerance: number;
+  onFail: 'refuse-contrast';
+}
+/** Carrier faults are reissued; model outcomes stand. Closed enumeration. */
+interface ReissuePolicy {
+  carrierEvents: ('http-status' | 'transport-error' | 'deadline' | 'empty-content')[];
+  modelOutcomesStand: true;
+  maxIssues: number;
+}
+type ReissueVerdict = 'reissue' | 'stands' | 'exhausted';
+/**
+ * Classify one rollout event under the registered reissue policy. A carrier
+ * event within the issue budget is reissued; a model outcome always stands;
+ * a carrier event past `maxIssues` is exhausted and reported, never retried.
+ */
+declare function classifyReissue(policy: ReissuePolicy, event: string, issuesSoFar: number): ReissueVerdict;
+//#endregion
+export { classifyReissue as A, evaluateProvenanceGate as B, ReissuePolicy as C, UniformPassDecision as D, SetExpr as E, evaluateIdentityGate as F, runUniformPassBudget as G, projectNLadderBudget as H, evaluateOracleDeterminismGate as I, evaluatePopulationReproducibilityGate as L, computeInterval as M, evaluateCondition as N, UniformPassSchedule as O, evaluateHaltRule as P, evaluatePowerFloorGate as R, Predicate as S, SelectionRule as T, readField as U, executeDecisionRule as V, runSelectionRule as W, IntervalSpec as _, ComputedInterval as a, NLadderProjection as b, DecisionOutcome as c, Estimand as d, EstimandResult as f, HaltRule as g, HaltOutcome as h, BudgetRule as i, computeEstimand as j, ValidityGate as k, DecisionRule as l, GateResult as m, AdmissionRule as n, Condition as o, EvidenceRecord as p, AdmissionStage as r, DecisionBranch as s, AdmissionPartition as t, DerivedQuantities as u, JsonValue as v, ReissueVerdict as w, Obligation as x, MatchedBudgetRule as y, evaluatePredicate as z };
+//# sourceMappingURL=ast-hI-vjW6J.d.ts.map

package/dist/ast-hI-vjW6J.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-hI-vjW6J.d.ts","names":[],"sources":["../src/experiment/ast.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;KA8BY,+CAA+C;GAAiB,YAAY;;;KAG5E,iBAAiB;;;;;KAWjB;EAEN;EACA;EACA;EACA,OAAO;;EAEP;EAAY;EAAe,QAAQ;;EACnC;EAAa,IAAI;;EACjB;EAAa,IAAI;;EACjB;EAAa,IAAI;;;iBAGP,UAAU,QAAQ,gBAAgB;;iBAUlC,kBAAkB,WAAW,WAAW,QAAQ;;;;;UA4C/C;EACf;EACA,MAAM;EACN;;;UAIe;EACf;;EAEA;EACA,MAAM;EACN;;;UAIe;EACf;EACA,QAAQ;EACR,aAAa;;;;;;;KAUH;EAEN;EACA;EACA;EACA;IAAe;IAAe;;EAC9B;EACA;;EAGA;;EAEA;EACA,MAAM;EACN;IAAS;IAAe;;;;;;;;;;;;;iBAad,iBACd,MAAM,eACN,kBAAkB,kBAClB;;EAEE;;EAEA,QAAQ;;EAER,YAAY,eAAe;;;KA0DnB;EACN;EAAoB;EAAa,OAAO;;EACxC;EAAmB,IAAI;;;;;;KAMjB;EACN;EAAc,OAAO;EAAW;;EAChC;EAA4B,OAAO;EAAW;;EAE9C;EACA;EACA;EACA;EACA;;;;;EAKA;;EAEA;;EAGA;EACA;EACA;EACA,WAAW;EACX,aAAa;;UAGF;EACf;EACA;EACA;;;iBA8Cc,gBACd,UAAU,UACV,eAAe,mBACd;;KA2ES;EAEN;EACA;;EAEA;EACA;EACA;EACA;EACA;;EAEA;EAAyB;;UAEd;EACf;EACA;EACA;;;;;;;;;;iBA8Cc,gBACd,MAAM,cACN;EACM;EAAc,eAAe;;EAC7B;EAAkB;EAAmB;IAC1C;;KAgKS;EACN;EAAgC;EAAkB;;EAClD;EAAgC;;EAChC;EAA4B;EAAkB;EAAiC;;EAC/E;EAAwB;;EACxB;EAAa,IAAI;;EACjB;EAAa,IAAI;;EACjB;EAAa,IAAI;;;UAGN;EACf,WAAW;IAAiB;IAAe;;EAC3C,YAAY;EACZ,gBAAgB;;iBAGF,kBAAkB,WAAW,WAAW,UAAU;UAyCjD;EACf,MAAM;EACN;EACA;;;;;;;;;KAUU;EACN;EAAe,UAAU;;EAEzB;EACA;EACA;EACA;EACA;IAAmB;IAAuB;;;UAG/B;EACf;EACA;;iBAGc,oBACd,MAAM,cACN,UAAU,oBACT;;UAec;EACf;EACA;EACA;;;KAMU;EAEN;EACA;EACA;EACA;;EAGA;EACA;EACA;EACA;;EAEA;EAA8B,OAAO;;EAErC;EACA;;EAEA;EACA;EACA;IAAO;IAAgB;IAAmB;;;EAE1C;EAAkB;EAAuB;EAAmB;;UAEjD;EACf;EACA;EACA,UAAU;;;;;;iBAOI,8BACd,YACA,MAAM,QAAQ;EAAgB;IAC9B,aAAa,qCACZ;;;;;;iBAiBa,sCACd,YACA,MAAM,QAAQ;EAAgB;IAC9B;EAAe,eAAe;EAAkB,gBAAgB;IAC/D;;iBAkBa,uBACd,YACA,MAAM,QAAQ;EAAgB;IAC9B,YAAY,iBACX;;iBAMa,qBACd,YACA,OAAO,QAAQ;EAAgB;IAC/B;EAAc;EAAgB;IAC7B;;;;;;iBAea,uBACd,YACA,MAAM,QAAQ;EAAgB;IAC9B;EAAkB;EAAgB;MACjC;;UAoEc;EACf;IAAQ;IAAyB;;EACjC;EACA;;UAGe;EACf;EACA;EACA;;iBAGc,iBAAiB,MAAM,UAAU,gBAAgB,eAAe;;;;;KAoBpE;EAEN;EACA;EACA;EACA;EACA;EACA;IAAU;IAAY;;EACtB;;EAGA;EACA;EACA;EACA;EACA;;UAGW;EACf;EACA;EACA;EACA;;UAGe;EACf,WAAW;EACX;;;;;;;;iBASc,qBACd,MAAM,QAAQ;EAAc;IAC5B,uCACC;UAuBc;EACf;EACA;IAAe;IAAW;IAAsB;;EAChD;IAAkB;IAAuC;;;;;;;;iBAQ3C,qBACd,MAAM,QAAQ;EAAc;IAC5B;EAAY;EAAqB;IAChC;;UAoBc;EACf;EACA;EACA;;;UAIe;EACf;EACA;EACA;;KAGU;;;;;;iBAOI,gBACd,QAAQ,eACR,eACA,sBACC"}

package/dist/{benchmark-command-CY6Dg5t5.js → benchmark-command-B57n9vjz.js}

@@ -3,15 +3,16 @@ import { a as hashCanonical, i as compareCodeUnits, o as jsonDocument, r as cano
 import { r as pairedBootstrap } from "./paired-tests-C8iCsioC.js";
 import { a as resolveModelPricing } from "./metrics-Qv-cpptD.js";
 import { a as CostLedgerPersistenceError, i as CostLedger, n as CostCallConflictError, o as CostReceiptCaptureError, r as CostCeilingReachedError, s as CostReservationExceededError, t as CostAccountingIncompleteError } from "./cost-ledger-B1qx30B4.js";
-import { c as withLedgerFileLock, l as writeLedgerFileAtomically } from "./ledger-core-Cs9f7385.js";
-import { S as fsCampaignStorage, i as startExternalOptimizerModelProxy, r as runWithCleanup, x as createRunCostLedger, y as resolveExternalOptimizerProcessLimits } from "./external-optimizer-subprocess-q3VzlGAO.js";
+import { c as withLedgerFileLock, l as writeLedgerFileAtomically } from "./journal-Cs9f7385.js";
+import "./ledger-core/index.js";
+import { S as fsCampaignStorage, i as startExternalOptimizerModelProxy, r as runWithCleanup, x as createRunCostLedger, y as resolveExternalOptimizerProcessLimits } from "./external-optimizer-subprocess-D4dzUBZI.js";
 import { r as makeFinding, s as usageReceiptFromCostLedger } from "./types-DQ0e2E7y.js";
 import { M as RawAnalystFindingSchema, N as evidenceRefsFromRawFinding, h as TRACE_ANALYSIS_LIMITS, j as RAW_FINDING_SCHEMA_PROMPT, r as runTraceAnalyst } from "./kind-factory-D5HOW3R0.js";
 import { a as callLlmJson, r as LlmResponseError, t as LlmCallError } from "./llm-client-CGlSi8sb.js";
-import { t as createDspyRlmTraceEngine } from "./dspy-rlm-engine-xKiWmj_G.js";
+import { t as createDspyRlmTraceEngine } from "./dspy-rlm-engine-S53V0HhE.js";
 import { i as otlpTextToTraceAnalysisStore, r as createOtlpBufferTraceStore, t as DEFAULT_MAX_TRACE_FILE_BYTES } from "./store-otlp-DWGUwlyj.js";
 import { i as summarizeAnalystBenchmarkRunner, n as runAnalystBenchmark, r as traceStoreEvidenceResolver } from "./benchmark-DQKzykkO.js";
-import { n as acquireSingleRunLock } from "./external-optimizer-process-Dlz8YxrT.js";
+import { n as acquireSingleRunLock } from "./external-optimizer-process-QDRURJAM.js";
 import { c as primeProtocolSha256, d as runPrimeExchange, f as decodeReplyRows, n as buildPrimePrompt, p as assertEqualDeclarativeTerms, t as analystUsageReceiptFromPrimeUsage, u as projectPrimeTrajectory } from "./prime-protocol-6tZTVsWm.js";
 import { createHash, randomUUID } from "node:crypto";
 import { constants, existsSync, lstatSync, readFileSync } from "node:fs";
@@ -1412,7 +1413,7 @@ const ANALYST_BENCHMARK_DEPENDENCY_LOCK_FILES = Object.freeze([
 	"package.json",
 	"pnpm-lock.yaml"
 ]);
-const ANALYST_BENCHMARK_DEPENDENCY_LOCK_SHA256 = "7b4c3f9a7c13539960a62697b783dec3dd6738d2d9044a62ecb77bd6bf53e920";
+const ANALYST_BENCHMARK_DEPENDENCY_LOCK_SHA256 = "39632afc0f02da9333079d4c6323bab101d1bd0eb47a0ea06fa910ae181b4b40";
 const ANALYST_BENCHMARK_EVIDENCE_DEPENDENCY_LOCK_SHA256 = "1e03f2daed356d60316aabefb407ec1e437ac94d408d61eea4ae096e9c6fbb5b";
 const ANALYST_BENCHMARK_EVIDENCE_IMPLEMENTATION_SHA256 = "4dba263b6256a30d56c7fdb2d992d3a953c0035d731f359b704db806f68f75ac";
 const ANALYST_BENCHMARK_IMPLEMENTATION_FILES = Object.freeze([
@@ -6351,4 +6352,4 @@ function shellQuote(value) {
 //#endregion
 export { ANALYST_BENCHMARK_LOCAL_RECEIPT_FILE as $, effectiveAnalystProtocolSha256 as A, loadCodeTraceVerificationArtifacts as B, adaptPublicBenchmarkFindings as C, renderCodeTraceCalibrationMarkdown as D, readAnalystBenchmarkArtifact as E, publicBenchmarkProtocolSha256 as F, ANALYST_BENCHMARK_EVIDENCE_DEPENDENCY_LOCK_SHA256 as G, ANALYST_BENCHMARK_DEPENDENCY_LOCK_DIGEST_ALGORITHM as H, publicBenchmarkRlmInstructions as I, ANALYST_BENCHMARK_IMPLEMENTATION_FILES as J, ANALYST_BENCHMARK_EVIDENCE_IMPLEMENTATION_SHA256 as K, publicBenchmarkSystemPrompt as L, CODE_TRACE_BENCH_ANALYST_PROMPT as M, MAX_INCORRECT_BLOCKS as N, summarizeCodeTraceCalibration as O, MAX_INCORRECT_BLOCK_STEPS as P, ANALYST_BENCHMARK_COST_LEDGER_FILE as Q, DEFAULT_MAX_VERIFICATION_ARTIFACT_BYTES as R, analystDefinitionProtocolSha256 as S, expandCodeTraceFailureBlocks as T, ANALYST_BENCHMARK_DEPENDENCY_LOCK_FILES as U, parseVerificationOutcome as V, ANALYST_BENCHMARK_DEPENDENCY_LOCK_SHA256 as W, analystBenchmarkDependencyLockDigest as X, ANALYST_BENCHMARK_IMPLEMENTATION_SHA256 as Y, analystBenchmarkImplementationDigest as Z, createPublicBenchmarkDirectRunner as _, primeCodeTraceAnalystDefinition as a, summarizeAgentRxCalibration as at, AnalystExpressivenessError as b, loadPublicBenchmarkRows as c, agentRxBenchmarkCase as ct, publicBenchmarkSelectionReport as d, roundAgentRxStep as dt, ANALYST_BENCHMARK_MANIFEST_FILE as et, selectPublicBenchmarkRows as f, normalizeBenchmarkLabel as ft, runReplVariableAnalystDefinition as g, rlmEngineLimits as h, primeAnalystProtocolSha256 as i, renderAgentRxCalibrationMarkdown as it, readAnalystInstructionsOverride as j, analystInstructionsOverrideFromText as k, preparePublicAnalystBenchmark as l, agentRxPredictionsToFindings as lt, publicRlmAnalystDefinition as m, renderAnalystBenchmarkMarkdown as n, compareAnalystRunners as nt, runInlineAnalystDefinition as o, codeTraceBenchCase as ot, createPublicBenchmarkRlmRunner as p, ANALYST_BENCHMARK_IMPLEMENTATION_DIGEST_ALGORITHM as q, createPrimeBenchmarkRunner as r, AGENT_RX_UPSTREAM_REVISION as rt, nodeHttpPrimeBridgeTransport as s, codeTracerPredictionsToFindings as st, runAnalystBenchmarkCommand as t, ANALYST_BENCHMARK_OBSERVATIONS_FILE as tt, publicBenchmarkDistributions as u, normalizeAgentRxCategory as ut, publicDirectAnalystDefinition as v, emptyPublicBenchmarkRunner as w, analystDefinitionAsymmetries as x, runChunkedAnalystDefinition as y, appendVerificationArtifactsToOtlp as z };
 
-//# sourceMappingURL=benchmark-command-CY6Dg5t5.js.map
+//# sourceMappingURL=benchmark-command-B57n9vjz.js.map