@tangle-network/agent-eval 0.215.1 → 0.216.1

package/dist/matrix-_BV9-Lk5.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"matrix-_BV9-Lk5.js","names":[],"sources":["../src/matrix/cell-spend.ts","../src/matrix/aggregation.ts","../src/matrix/runner.ts"],"sourcesContent":["/**\n * Spend carrier for a cell that fails after it has already spent money.\n *\n * `runCell` reports what a cell cost by returning a `CellResult`. A throw\n * carries no result, so the runner cannot know what the cell spent before it\n * failed: the cumulative sum the cost ceiling reads, and `totalCostUsd`, both\n * miss that money. A throw that carries a `CellSpend` closes the gap — the\n * runner bills the failed cell for the spend the carrier declares, and records\n * a cell that declared nothing as `uncaptured` instead of a zero that reads\n * like \"this cell spent nothing\".\n *\n * The carrier is read structurally, never by `instanceof`, so a throw that\n * crosses a package or realm boundary still bills.\n */\n\n/** Property key the carrier occupies on a thrown object. Stable across\n *  versions — two copies of this package must agree on it. */\nconst CELL_SPEND_KEY = '__agentEvalCellSpend'\n\n/** Money and wall time a cell consumed before it threw. */\nexport interface CellSpend {\n  /** KNOWN subtotal in USD. When `kind` is `uncaptured` the cell spent this\n   *  much AND an unknown amount more, so the value must not be read as the\n   *  cell's total. */\n  costUsd: number\n  /** Wall time the cell consumed before the throw, in milliseconds. */\n  durationMs: number\n  /** `observed` = provider-reported amounts, `estimated` = computed from token\n   *  prices, `uncaptured` = `costUsd` is a subtotal and part of the spend\n   *  could not be measured. */\n  kind: 'observed' | 'estimated' | 'uncaptured'\n}\n\n/**\n * Return `error` carrying `spend`, for a throw site inside `runCell`:\n * `throw withCellSpend(err, { costUsd, durationMs, kind })`.\n *\n * A value that cannot hold the carrier — a thrown string or number, or a\n * frozen, sealed, or otherwise non-extensible object — is wrapped in an\n * `Error` that keeps the original as `cause`, so the spend is never dropped.\n * A later call overwrites an earlier carrier — the outer frame knows more\n * than the inner one.\n *\n * Throws `TypeError` on a non-finite or negative amount. A poisoned amount\n * would reach `cumulativeCost` and disable the cost ceiling for the whole run,\n * because `NaN >= ceiling` is false.\n */\nexport function withCellSpend(error: unknown, spend: CellSpend): unknown {\n  assertAmount(spend.costUsd, 'costUsd')\n  assertAmount(spend.durationMs, 'durationMs')\n  if (spend.kind !== 'observed' && spend.kind !== 'estimated' && spend.kind !== 'uncaptured') {\n    throw new TypeError(\n      `withCellSpend: kind must be observed, estimated or uncaptured, received ${String(spend.kind)}`,\n    )\n  }\n  const carrier: CellSpend = {\n    costUsd: spend.costUsd,\n    durationMs: spend.durationMs,\n    kind: spend.kind,\n  }\n  if (typeof error === 'object' && error !== null && attach(error, carrier)) return error\n  // A primitive cannot hold a property, and a frozen or sealed object refuses\n  // one. Carry the spend on a fresh Error that keeps the original as `cause`\n  // rather than lose it — a dropped carrier bills the cell as uncaptured,\n  // which is the under-billing this module exists to prevent.\n  const wrapper = new Error(`cell failed: ${messageOf(error)}`, { cause: error })\n  attach(wrapper, carrier)\n  return wrapper\n}\n\n/** True when the carrier landed. `defineProperty` throws on a non-extensible\n *  target, so the caller must be able to fall back. */\nfunction attach(target: object, carrier: CellSpend): boolean {\n  try {\n    Object.defineProperty(target, CELL_SPEND_KEY, {\n      value: carrier,\n      enumerable: false,\n      configurable: true,\n      writable: true,\n    })\n    return true\n  } catch {\n    return false\n  }\n}\n\nfunction messageOf(error: unknown): string {\n  if (error instanceof Error) return error.message\n  return String(error)\n}\n\n/** Read the spend a thrown value carries. `undefined` when the value carries\n *  none, or carries one that does not satisfy `CellSpend` — the runner records\n *  both as `uncaptured`. */\nexport function readCellSpend(error: unknown): CellSpend | undefined {\n  if (typeof error !== 'object' || error === null) return undefined\n  const raw = (error as Record<string, unknown>)[CELL_SPEND_KEY]\n  if (typeof raw !== 'object' || raw === null) return undefined\n  const candidate = raw as Record<string, unknown>\n  if (!isAmount(candidate.costUsd) || !isAmount(candidate.durationMs)) return undefined\n  const kind = candidate.kind\n  if (kind !== 'observed' && kind !== 'estimated' && kind !== 'uncaptured') return undefined\n  return { costUsd: candidate.costUsd, durationMs: candidate.durationMs, kind }\n}\n\n/** A number the matrix can add to a running cost or duration: finite and not\n *  negative. Anything else would poison a sum the cost ceiling reads. */\nexport function isAmount(value: unknown): value is number {\n  return typeof value === 'number' && Number.isFinite(value) && value >= 0\n}\n\nfunction assertAmount(value: number, field: string): void {\n  if (!isAmount(value)) {\n    throw new TypeError(\n      `withCellSpend: ${field} must be a finite number >= 0, received ${String(value)}`,\n    )\n  }\n}\n","/**\n * Per-axis aggregation of cell runs into `AxisSummary` rows.\n *\n * Pure: consumes the final `cells: [{cell, runs}]` array and returns the\n * `byAxis` table. Error runs contribute 0 to passRate and meanScore. Cost and\n * duration always count — the budget was spent regardless. A run whose cost is\n * a subtotal rather than a total raises `costUncapturedCells` for its bucket,\n * so a per-axis cost row says when it under-counts.\n */\n\nimport { interpolatedQuantile } from '../math/quantile'\nimport type { AxisSummary, CellResult, MatrixAxis, MatrixCell, MatrixResult } from './types'\n\ninterface Row<Output> {\n  cell: MatrixCell\n  result: CellResult<Output>\n}\n\nfunction flattenRuns<Output>(cells: MatrixResult<Output>['cells']): Row<Output>[] {\n  const rows: Row<Output>[] = []\n  for (const { cell, runs } of cells) {\n    for (const result of runs) rows.push({ cell, result })\n  }\n  return rows\n}\n\nfunction quantile(sorted: number[], q: number): number {\n  return sorted.length ? interpolatedQuantile(sorted, q) : 0\n}\n\nexport function summariseRows<Output>(\n  rows: Row<Output>[],\n  axisName: string,\n  axisValue: string,\n): AxisSummary {\n  if (rows.length === 0) {\n    return {\n      axisName,\n      axisValue,\n      cells: 0,\n      passRate: 0,\n      meanScore: 0,\n      p50Score: 0,\n      p90Score: 0,\n      totalCostUsd: 0,\n      costUncapturedCells: 0,\n      meanDurationMs: 0,\n    }\n  }\n  let pass = 0\n  let scoreSum = 0\n  let costSum = 0\n  let durSum = 0\n  let costUncapturedCells = 0\n  const scores: number[] = []\n  for (const { result } of rows) {\n    const errored = result.error !== undefined\n    const score = errored ? 0 : result.verdict.score\n    const valid = !errored && result.verdict.valid\n    if (valid) pass++\n    scoreSum += score\n    scores.push(score)\n    costSum += result.costUsd\n    durSum += result.durationMs\n    if (result.costProvenance?.kind === 'uncaptured') costUncapturedCells++\n  }\n  scores.sort((a, b) => a - b)\n  return {\n    axisName,\n    axisValue,\n    cells: rows.length,\n    passRate: pass / rows.length,\n    meanScore: scoreSum / rows.length,\n    p50Score: quantile(scores, 0.5),\n    p90Score: quantile(scores, 0.9),\n    totalCostUsd: costSum,\n    costUncapturedCells,\n    meanDurationMs: durSum / rows.length,\n  }\n}\n\nfunction bucketBy<Output>(\n  rows: Row<Output>[],\n  axisName: string,\n  labelFor: (id: string) => string,\n): Record<string, AxisSummary> {\n  const buckets = new Map<string, Row<Output>[]>()\n  for (const row of rows) {\n    const slot = row.cell.axes[axisName]\n    if (!slot) continue\n    const id = slot.id\n    let arr = buckets.get(id)\n    if (!arr) {\n      arr = []\n      buckets.set(id, arr)\n    }\n    arr.push(row)\n  }\n  const out: Record<string, AxisSummary> = {}\n  // Sorted keys for deterministic JSON serialisation.\n  for (const id of [...buckets.keys()].sort()) {\n    out[id] = summariseRows(buckets.get(id) as Row<Output>[], axisName, labelFor(id))\n  }\n  return out\n}\n\nexport function buildByAxis<Output>(\n  cells: MatrixResult<Output>['cells'],\n  axes: MatrixAxis<unknown>[],\n  aggregateBy: string[],\n): Record<string, Record<string, AxisSummary>> {\n  const rows = flattenRuns(cells)\n  const byName = new Map(axes.map((a) => [a.name, a]))\n  const byAxis: Record<string, Record<string, AxisSummary>> = {}\n  for (const name of aggregateBy) {\n    const axis = byName.get(name)\n    const labelFor = (id: string): string => {\n      if (!axis?.label) return id\n      const found = axis.values.find((v) => v.id === id)\n      if (!found) return id\n      return axis.label(found.value, id)\n    }\n    byAxis[name] = bucketBy(rows, name, labelFor)\n  }\n  return byAxis\n}\n","/**\n * N-axis cartesian runner.\n *\n * Expansion order: cartesian over `axes` in declared order, then `reps` as the\n * inner-most dim → `ordinal = (cartIdx * reps) + rep`. The returned\n * `cells[]` is sorted by `ordinal` so concurrent execution does not reorder\n * the output.\n *\n * Scheduling is a sliding window of in-flight promises capped at\n * `maxConcurrency`. The window stops admitting new cells when the cost\n * ceiling trips or the abort signal fires; in-flight cells finish.\n */\n\nimport { buildByAxis } from './aggregation'\nimport { isAmount, readCellSpend } from './cell-spend'\nimport type {\n  CellResult,\n  CostProvenance,\n  MatrixAxis,\n  MatrixCell,\n  MatrixResult,\n  RunAgentMatrixOptions,\n} from './types'\n\ninterface BaseCell {\n  axes: Record<string, { id: string; value: unknown }>\n}\n\nfunction cartesian(axes: MatrixAxis<unknown>[]): BaseCell[] {\n  // Empty axes (`values=[]`) collapse the whole product to zero cells. An\n  // empty `axes` array yields a single empty-axes cell — degenerate but\n  // valid (caller is iterating only reps).\n  if (axes.length === 0) return [{ axes: {} }]\n  for (const a of axes) if (a.values.length === 0) return []\n  const out: BaseCell[] = []\n  const idx = new Array(axes.length).fill(0)\n  while (true) {\n    const slot: Record<string, { id: string; value: unknown }> = {}\n    for (let i = 0; i < axes.length; i++) {\n      const axis = axes[i] as MatrixAxis<unknown>\n      const v = axis.values[idx[i] as number] as { id: string; value: unknown }\n      slot[axis.name] = { id: v.id, value: v.value }\n    }\n    out.push({ axes: slot })\n    // Increment like an odometer, left-most axis is fastest.\n    let i = 0\n    while (i < axes.length) {\n      const next = (idx[i] as number) + 1\n      const axis = axes[i] as MatrixAxis<unknown>\n      if (next < axis.values.length) {\n        idx[i] = next\n        break\n      }\n      idx[i] = 0\n      i++\n    }\n    if (i === axes.length) break\n  }\n  return out\n}\n\nfunction makeMatrixId(): string {\n  // Stable id-like string: time + 8 random hex chars. Avoids node:crypto\n  // import to keep the matrix dep-free.\n  const t = Date.now().toString(36)\n  let r = ''\n  for (let i = 0; i < 8; i++) r += Math.floor(Math.random() * 16).toString(16)\n  return `mtx_${t}_${r}`\n}\n\n/** Fresh per result — a shared object would let one consumer's mutation reach\n *  every other cell in the run. */\nfunction uncaptured(): CostProvenance {\n  return { kind: 'uncaptured', usd: null }\n}\n\nfunction makeErrorResult<Output>(err: unknown): CellResult<Output> {\n  const e = err as { message?: string; name?: string }\n  const spend = readCellSpend(err)\n  return {\n    output: undefined as unknown as Output,\n    verdict: { valid: false, score: 0 },\n    costUsd: spend?.costUsd ?? 0,\n    durationMs: spend?.durationMs ?? 0,\n    costProvenance:\n      spend === undefined || spend.kind === 'uncaptured'\n        ? uncaptured()\n        : { kind: spend.kind, usd: spend.costUsd },\n    error: {\n      message: typeof e?.message === 'string' ? e.message : String(err),\n      kind: typeof e?.name === 'string' ? e.name : 'Error',\n    },\n  }\n}\n\n/** Make a result safe to sum.\n *\n *  A `costUsd` that cannot be summed fails the cell: `NaN` in `cumulativeCost`\n *  makes `>= costCeiling` false forever, so one bad cell would disable the\n *  ceiling for every cell after it.\n *\n *  A bad `durationMs` reaches only `meanDurationMs`, never the ceiling, so it\n *  cannot justify throwing away a real verdict and a real cost. It is reported\n *  as 0 and warned about, and the rest of the result stands. A wall clock that\n *  steps back mid-cell makes `Date.now() - startedAt` negative, so this is a\n *  reachable state, not only a caller bug. */\nfunction billableResult<Output>(\n  result: CellResult<Output>,\n  onBadDuration: (reported: unknown) => void,\n): CellResult<Output> {\n  if (!isAmount(result.costUsd)) {\n    return makeErrorResult<Output>(\n      new RangeError(\n        `runCell reported costUsd=${String(result.costUsd)}; a cell cost must be a finite number >= 0 so the cost ceiling stays enforceable`,\n      ),\n    )\n  }\n  if (isAmount(result.durationMs)) return result\n  onBadDuration(result.durationMs)\n  return { ...result, durationMs: 0 }\n}\n\nexport async function runAgentMatrix<Output>(\n  opts: RunAgentMatrixOptions<Output>,\n): Promise<MatrixResult<Output>> {\n  const startedAt = Date.now()\n  const reps = Math.max(1, opts.reps ?? 1)\n  const maxConcurrency = Math.max(1, opts.maxConcurrency ?? 4)\n  const costCeiling = opts.costCeiling ?? Number.POSITIVE_INFINITY\n  const aggregateBy = opts.aggregateBy ?? opts.axes.map((a) => a.name)\n  if (opts.maxCellCostUsd !== undefined && !isAmount(opts.maxCellCostUsd)) {\n    throw new RangeError(\n      `runAgentMatrix: maxCellCostUsd must be a finite number >= 0, received ${String(opts.maxCellCostUsd)}`,\n    )\n  }\n\n  const base = cartesian(opts.axes)\n  const filtered = opts.filter\n    ? base.filter((c) => (opts.filter as (b: BaseCell) => boolean)(c))\n    : base\n  const filteredOut = base.length - filtered.length\n\n  const planned: MatrixCell[] = []\n  for (let i = 0; i < filtered.length; i++) {\n    for (let r = 0; r < reps; r++) {\n      planned.push({\n        axes: (filtered[i] as BaseCell).axes,\n        rep: r,\n        ordinal: i * reps + r,\n      })\n    }\n  }\n\n  const cellRecords: Array<{ cell: MatrixCell; runs: CellResult<Output>[] }> = []\n  // What the ceiling reads. It runs ahead of the reported total whenever a\n  // cell's cost is a subtotal and `maxCellCostUsd` bounds what it could have\n  // been — a budget must assume the worst about spend it cannot see.\n  let cumulativeCost = 0\n  let costCeilingReached = false\n  let runsExecuted = 0\n  let cellsUnscheduled = 0\n  let costUncapturedCells = 0\n  let badDurationCells = 0\n\n  const aborted = (): boolean => opts.signal?.aborted === true\n\n  // Per-run abort controller forwards the external signal so cell executors\n  // see cancellation. We don't expose it on `MatrixCell` — the signature on\n  // `runCell` per the public API is `(cell) => Promise<...>`. Executors that\n  // need cancellation use the external signal directly via closure.\n\n  let inFlight = 0\n  let cursor = 0\n  let resolveAll: (() => void) | undefined\n  const done = new Promise<void>((res) => {\n    resolveAll = res\n  })\n\n  const pump = (): void => {\n    while (inFlight < maxConcurrency && cursor < planned.length) {\n      if (aborted() || costCeilingReached) {\n        // Drain remaining as unscheduled.\n        const left = planned.length - cursor\n        cellsUnscheduled += left\n        cursor = planned.length\n        break\n      }\n      const cell = planned[cursor++] as MatrixCell\n      inFlight++\n      // Lazily allocate the record so cells appear in `cells[]` in any\n      // arrival order; we sort by ordinal at the end.\n      const record = { cell, runs: [] as CellResult<Output>[] }\n      cellRecords.push(record)\n      const promise: Promise<CellResult<Output>> = (async () => {\n        try {\n          return await opts.runCell(cell)\n        } catch (err) {\n          return makeErrorResult<Output>(err)\n        }\n      })()\n      promise.then((settled) => {\n        const result = billableResult(settled, (reported) => {\n          badDurationCells++\n          if (badDurationCells === 1) {\n            // eslint-disable-next-line no-console\n            console.warn(\n              `[matrix] a cell reported durationMs=${String(reported)}; recorded as 0 — meanDurationMs under-reports this run`,\n            )\n          }\n        })\n        record.runs.push(result)\n        runsExecuted++\n        const uncapturedCost = result.costProvenance?.kind === 'uncaptured'\n        cumulativeCost +=\n          uncapturedCost && opts.maxCellCostUsd !== undefined\n            ? Math.max(result.costUsd, opts.maxCellCostUsd)\n            : result.costUsd\n        if (uncapturedCost) {\n          costUncapturedCells++\n          if (costUncapturedCells === 1) {\n            // eslint-disable-next-line no-console\n            console.warn(\n              \"[matrix] a cell's cost is a subtotal, not a total — totalCostUsd and the cost ceiling under-count this run\",\n            )\n          }\n        }\n        if (cumulativeCost >= costCeiling && !costCeilingReached) {\n          costCeilingReached = true\n          // eslint-disable-next-line no-console\n          console.warn('[matrix] cost ceiling reached')\n        }\n        try {\n          opts.onCellComplete?.(cell, result)\n        } catch {\n          // onCellComplete is observational — swallow throws so a noisy\n          // callback can't tank the run.\n        }\n        inFlight--\n        if (cursor < planned.length) {\n          pump()\n        } else if (inFlight === 0) {\n          resolveAll?.()\n        }\n      })\n    }\n    if (cursor >= planned.length && inFlight === 0) resolveAll?.()\n  }\n\n  const onAbort = (): void => {\n    // External abort: stop scheduling. In-flight cells finish; their\n    // executors observe `opts.signal.aborted` directly via closure.\n    if (cursor < planned.length) {\n      cellsUnscheduled += planned.length - cursor\n      cursor = planned.length\n    }\n    if (inFlight === 0) resolveAll?.()\n  }\n  if (opts.signal) {\n    if (opts.signal.aborted) {\n      cellsUnscheduled = planned.length\n      cursor = planned.length\n      resolveAll?.()\n    } else {\n      opts.signal.addEventListener('abort', onAbort, { once: true })\n    }\n  }\n\n  if (planned.length === 0) {\n    resolveAll?.()\n  } else {\n    pump()\n  }\n\n  await done\n  if (opts.signal) opts.signal.removeEventListener('abort', onAbort)\n\n  cellRecords.sort((a, b) => a.cell.ordinal - b.cell.ordinal)\n\n  let pass = 0\n  let scoreSum = 0\n  let totalCost = 0\n  let runCount = 0\n  for (const { runs } of cellRecords) {\n    for (const r of runs) {\n      runCount++\n      const errored = r.error !== undefined\n      if (!errored && r.verdict.valid) pass++\n      scoreSum += errored ? 0 : r.verdict.score\n      totalCost += r.costUsd\n    }\n  }\n\n  const byAxis = buildByAxis(cellRecords, opts.axes, aggregateBy)\n\n  return {\n    cells: cellRecords,\n    byAxis,\n    summary: {\n      totalCells: planned.length,\n      runsExecuted,\n      cellsSkipped: cellsUnscheduled + filteredOut * reps,\n      overallPassRate: runCount === 0 ? 0 : pass / runCount,\n      overallMeanScore: runCount === 0 ? 0 : scoreSum / runCount,\n      totalCostUsd: totalCost,\n      costUncapturedCells,\n      ceilingChargedUsd: cumulativeCost,\n      durationMs: Date.now() - startedAt,\n    },\n    matrixId: makeMatrixId(),\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAiBA,MAAM,iBAAiB;;;;;;;;;;;;;;;AA8BvB,SAAgB,cAAc,OAAgB,OAA2B;CACvE,aAAa,MAAM,SAAS,SAAS;CACrC,aAAa,MAAM,YAAY,YAAY;CAC3C,IAAI,MAAM,SAAS,cAAc,MAAM,SAAS,eAAe,MAAM,SAAS,cAC5E,MAAM,IAAI,UACR,2EAA2E,OAAO,MAAM,IAAI,GAC9F;CAEF,MAAM,UAAqB;EACzB,SAAS,MAAM;EACf,YAAY,MAAM;EAClB,MAAM,MAAM;CACd;CACA,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,OAAO,OAAO,OAAO,GAAG,OAAO;CAKlF,MAAM,UAAU,IAAI,MAAM,gBAAgB,UAAU,KAAK,KAAK,EAAE,OAAO,MAAM,CAAC;CAC9E,OAAO,SAAS,OAAO;CACvB,OAAO;AACT;;;AAIA,SAAS,OAAO,QAAgB,SAA6B;CAC3D,IAAI;EACF,OAAO,eAAe,QAAQ,gBAAgB;GAC5C,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ,CAAC;EACD,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,UAAU,OAAwB;CACzC,IAAI,iBAAiB,OAAO,OAAO,MAAM;CACzC,OAAO,OAAO,KAAK;AACrB;;;;AAKA,SAAgB,cAAc,OAAuC;CACnE,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,KAAA;CACxD,MAAM,MAAO,MAAkC;CAC/C,IAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM,OAAO,KAAA;CACpD,MAAM,YAAY;CAClB,IAAI,CAAC,SAAS,UAAU,OAAO,KAAK,CAAC,SAAS,UAAU,UAAU,GAAG,OAAO,KAAA;CAC5E,MAAM,OAAO,UAAU;CACvB,IAAI,SAAS,cAAc,SAAS,eAAe,SAAS,cAAc,OAAO,KAAA;CACjF,OAAO;EAAE,SAAS,UAAU;EAAS,YAAY,UAAU;EAAY;CAAK;AAC9E;;;AAIA,SAAgB,SAAS,OAAiC;CACxD,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,SAAS;AACzE;AAEA,SAAS,aAAa,OAAe,OAAqB;CACxD,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,UACR,kBAAkB,MAAM,0CAA0C,OAAO,KAAK,GAChF;AAEJ;;;;;;;;;;;;ACnGA,SAAS,YAAoB,OAAqD;CAChF,MAAM,OAAsB,CAAC;CAC7B,KAAK,MAAM,EAAE,MAAM,UAAU,OAC3B,KAAK,MAAM,UAAU,MAAM,KAAK,KAAK;EAAE;EAAM;CAAO,CAAC;CAEvD,OAAO;AACT;AAEA,SAAS,SAAS,QAAkB,GAAmB;CACrD,OAAO,OAAO,SAAS,qBAAqB,QAAQ,CAAC,IAAI;AAC3D;AAEA,SAAgB,cACd,MACA,UACA,WACa;CACb,IAAI,KAAK,WAAW,GAClB,OAAO;EACL;EACA;EACA,OAAO;EACP,UAAU;EACV,WAAW;EACX,UAAU;EACV,UAAU;EACV,cAAc;EACd,qBAAqB;EACrB,gBAAgB;CAClB;CAEF,IAAI,OAAO;CACX,IAAI,WAAW;CACf,IAAI,UAAU;CACd,IAAI,SAAS;CACb,IAAI,sBAAsB;CAC1B,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,EAAE,YAAY,MAAM;EAC7B,MAAM,UAAU,OAAO,UAAU,KAAA;EACjC,MAAM,QAAQ,UAAU,IAAI,OAAO,QAAQ;EAE3C,IADc,CAAC,WAAW,OAAO,QAAQ,OAC9B;EACX,YAAY;EACZ,OAAO,KAAK,KAAK;EACjB,WAAW,OAAO;EAClB,UAAU,OAAO;EACjB,IAAI,OAAO,gBAAgB,SAAS,cAAc;CACpD;CACA,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3B,OAAO;EACL;EACA;EACA,OAAO,KAAK;EACZ,UAAU,OAAO,KAAK;EACtB,WAAW,WAAW,KAAK;EAC3B,UAAU,SAAS,QAAQ,EAAG;EAC9B,UAAU,SAAS,QAAQ,EAAG;EAC9B,cAAc;EACd;EACA,gBAAgB,SAAS,KAAK;CAChC;AACF;AAEA,SAAS,SACP,MACA,UACA,UAC6B;CAC7B,MAAM,0BAAU,IAAI,IAA2B;CAC/C,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,OAAO,IAAI,KAAK,KAAK;EAC3B,IAAI,CAAC,MAAM;EACX,MAAM,KAAK,KAAK;EAChB,IAAI,MAAM,QAAQ,IAAI,EAAE;EACxB,IAAI,CAAC,KAAK;GACR,MAAM,CAAC;GACP,QAAQ,IAAI,IAAI,GAAG;EACrB;EACA,IAAI,KAAK,GAAG;CACd;CACA,MAAM,MAAmC,CAAC;CAE1C,KAAK,MAAM,MAAM,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,KAAK,GACxC,IAAI,MAAM,cAAc,QAAQ,IAAI,EAAE,GAAoB,UAAU,SAAS,EAAE,CAAC;CAElF,OAAO;AACT;AAEA,SAAgB,YACd,OACA,MACA,aAC6C;CAC7C,MAAM,OAAO,YAAY,KAAK;CAC9B,MAAM,SAAS,IAAI,IAAI,KAAK,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACnD,MAAM,SAAsD,CAAC;CAC7D,KAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,OAAO,OAAO,IAAI,IAAI;EAC5B,MAAM,YAAY,OAAuB;GACvC,IAAI,CAAC,MAAM,OAAO,OAAO;GACzB,MAAM,QAAQ,KAAK,OAAO,MAAM,MAAM,EAAE,OAAO,EAAE;GACjD,IAAI,CAAC,OAAO,OAAO;GACnB,OAAO,KAAK,MAAM,MAAM,OAAO,EAAE;EACnC;EACA,OAAO,QAAQ,SAAS,MAAM,MAAM,QAAQ;CAC9C;CACA,OAAO;AACT;;;;;;;;;;;;;;;ACjGA,SAAS,UAAU,MAAyC;CAI1D,IAAI,KAAK,WAAW,GAAG,OAAO,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;CAC3C,KAAK,MAAM,KAAK,MAAM,IAAI,EAAE,OAAO,WAAW,GAAG,OAAO,CAAC;CACzD,MAAM,MAAkB,CAAC;CACzB,MAAM,MAAM,IAAI,MAAM,KAAK,MAAM,CAAC,CAAC,KAAK,CAAC;CACzC,OAAO,MAAM;EACX,MAAM,OAAuD,CAAC;EAC9D,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,OAAO,KAAK;GAClB,MAAM,IAAI,KAAK,OAAO,IAAI;GAC1B,KAAK,KAAK,QAAQ;IAAE,IAAI,EAAE;IAAI,OAAO,EAAE;GAAM;EAC/C;EACA,IAAI,KAAK,EAAE,MAAM,KAAK,CAAC;EAEvB,IAAI,IAAI;EACR,OAAO,IAAI,KAAK,QAAQ;GACtB,MAAM,OAAQ,IAAI,KAAgB;GAElC,IAAI,OADS,KAAK,EACH,CAAC,OAAO,QAAQ;IAC7B,IAAI,KAAK;IACT;GACF;GACA,IAAI,KAAK;GACT;EACF;EACA,IAAI,MAAM,KAAK,QAAQ;CACzB;CACA,OAAO;AACT;AAEA,SAAS,eAAuB;CAG9B,MAAM,IAAI,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE;CAChC,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,KAAK,MAAM,KAAK,OAAO,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE;CAC3E,OAAO,OAAO,EAAE,GAAG;AACrB;;;AAIA,SAAS,aAA6B;CACpC,OAAO;EAAE,MAAM;EAAc,KAAK;CAAK;AACzC;AAEA,SAAS,gBAAwB,KAAkC;CACjE,MAAM,IAAI;CACV,MAAM,QAAQ,cAAc,GAAG;CAC/B,OAAO;EACL,QAAQ,KAAA;EACR,SAAS;GAAE,OAAO;GAAO,OAAO;EAAE;EAClC,SAAS,OAAO,WAAW;EAC3B,YAAY,OAAO,cAAc;EACjC,gBACE,UAAU,KAAA,KAAa,MAAM,SAAS,eAClC,WAAW,IACX;GAAE,MAAM,MAAM;GAAM,KAAK,MAAM;EAAQ;EAC7C,OAAO;GACL,SAAS,OAAO,GAAG,YAAY,WAAW,EAAE,UAAU,OAAO,GAAG;GAChE,MAAM,OAAO,GAAG,SAAS,WAAW,EAAE,OAAO;EAC/C;CACF;AACF;;;;;;;;;;;;AAaA,SAAS,eACP,QACA,eACoB;CACpB,IAAI,CAAC,SAAS,OAAO,OAAO,GAC1B,OAAO,gCACL,IAAI,WACF,4BAA4B,OAAO,OAAO,OAAO,EAAE,iFACrD,CACF;CAEF,IAAI,SAAS,OAAO,UAAU,GAAG,OAAO;CACxC,cAAc,OAAO,UAAU;CAC/B,OAAO;EAAE,GAAG;EAAQ,YAAY;CAAE;AACpC;AAEA,eAAsB,eACpB,MAC+B;CAC/B,MAAM,YAAY,KAAK,IAAI;CAC3B,MAAM,OAAO,KAAK,IAAI,GAAG,KAAK,QAAQ,CAAC;CACvC,MAAM,iBAAiB,KAAK,IAAI,GAAG,KAAK,kBAAkB,CAAC;CAC3D,MAAM,cAAc,KAAK,eAAe,OAAO;CAC/C,MAAM,cAAc,KAAK,eAAe,KAAK,KAAK,KAAK,MAAM,EAAE,IAAI;CACnE,IAAI,KAAK,mBAAmB,KAAA,KAAa,CAAC,SAAS,KAAK,cAAc,GACpE,MAAM,IAAI,WACR,yEAAyE,OAAO,KAAK,cAAc,GACrG;CAGF,MAAM,OAAO,UAAU,KAAK,IAAI;CAChC,MAAM,WAAW,KAAK,SAClB,KAAK,QAAQ,MAAO,KAAK,OAAoC,CAAC,CAAC,IAC/D;CACJ,MAAM,cAAc,KAAK,SAAS,SAAS;CAE3C,MAAM,UAAwB,CAAC;CAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KACxB,QAAQ,KAAK;EACX,MAAO,SAAS,EAAE,CAAc;EAChC,KAAK;EACL,SAAS,IAAI,OAAO;CACtB,CAAC;CAIL,MAAM,cAAuE,CAAC;CAI9E,IAAI,iBAAiB;CACrB,IAAI,qBAAqB;CACzB,IAAI,eAAe;CACnB,IAAI,mBAAmB;CACvB,IAAI,sBAAsB;CAC1B,IAAI,mBAAmB;CAEvB,MAAM,gBAAyB,KAAK,QAAQ,YAAY;CAOxD,IAAI,WAAW;CACf,IAAI,SAAS;CACb,IAAI;CACJ,MAAM,OAAO,IAAI,SAAe,QAAQ;EACtC,aAAa;CACf,CAAC;CAED,MAAM,aAAmB;EACvB,OAAO,WAAW,kBAAkB,SAAS,QAAQ,QAAQ;GAC3D,IAAI,QAAQ,KAAK,oBAAoB;IAEnC,MAAM,OAAO,QAAQ,SAAS;IAC9B,oBAAoB;IACpB,SAAS,QAAQ;IACjB;GACF;GACA,MAAM,OAAO,QAAQ;GACrB;GAGA,MAAM,SAAS;IAAE;IAAM,MAAM,CAAC;GAA0B;GACxD,YAAY,KAAK,MAAM;GAQvB,CAP8C,YAAY;IACxD,IAAI;KACF,OAAO,MAAM,KAAK,QAAQ,IAAI;IAChC,SAAS,KAAK;KACZ,OAAO,gBAAwB,GAAG;IACpC;GACF,EAAA,CACM,CAAC,CAAC,MAAM,YAAY;IACxB,MAAM,SAAS,eAAe,UAAU,aAAa;KACnD;KACA,IAAI,qBAAqB,GAEvB,QAAQ,KACN,uCAAuC,OAAO,QAAQ,EAAE,wDAC1D;IAEJ,CAAC;IACD,OAAO,KAAK,KAAK,MAAM;IACvB;IACA,MAAM,iBAAiB,OAAO,gBAAgB,SAAS;IACvD,kBACE,kBAAkB,KAAK,mBAAmB,KAAA,IACtC,KAAK,IAAI,OAAO,SAAS,KAAK,cAAc,IAC5C,OAAO;IACb,IAAI,gBAAgB;KAClB;KACA,IAAI,wBAAwB,GAE1B,QAAQ,KACN,4GACF;IAEJ;IACA,IAAI,kBAAkB,eAAe,CAAC,oBAAoB;KACxD,qBAAqB;KAErB,QAAQ,KAAK,+BAA+B;IAC9C;IACA,IAAI;KACF,KAAK,iBAAiB,MAAM,MAAM;IACpC,QAAQ,CAGR;IACA;IACA,IAAI,SAAS,QAAQ,QACnB,KAAK;SACA,IAAI,aAAa,GACtB,aAAa;GAEjB,CAAC;EACH;EACA,IAAI,UAAU,QAAQ,UAAU,aAAa,GAAG,aAAa;CAC/D;CAEA,MAAM,gBAAsB;EAG1B,IAAI,SAAS,QAAQ,QAAQ;GAC3B,oBAAoB,QAAQ,SAAS;GACrC,SAAS,QAAQ;EACnB;EACA,IAAI,aAAa,GAAG,aAAa;CACnC;CACA,IAAI,KAAK,QAAQ;EACf,IAAI,KAAK,OAAO,SAAS;GACvB,mBAAmB,QAAQ;GAC3B,SAAS,QAAQ;GACjB,aAAa;EACf,OACE,KAAK,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CAEjE;CAEA,IAAI,QAAQ,WAAW,GACrB,aAAa;MAEb,KAAK;CAGP,MAAM;CACN,IAAI,KAAK,QAAQ,KAAK,OAAO,oBAAoB,SAAS,OAAO;CAEjE,YAAY,MAAM,GAAG,MAAM,EAAE,KAAK,UAAU,EAAE,KAAK,OAAO;CAE1D,IAAI,OAAO;CACX,IAAI,WAAW;CACf,IAAI,YAAY;CAChB,IAAI,WAAW;CACf,KAAK,MAAM,EAAE,UAAU,aACrB,KAAK,MAAM,KAAK,MAAM;EACpB;EACA,MAAM,UAAU,EAAE,UAAU,KAAA;EAC5B,IAAI,CAAC,WAAW,EAAE,QAAQ,OAAO;EACjC,YAAY,UAAU,IAAI,EAAE,QAAQ;EACpC,aAAa,EAAE;CACjB;CAKF,OAAO;EACL,OAAO;EACP,QAJa,YAAY,aAAa,KAAK,MAAM,WAI5C;EACL,SAAS;GACP,YAAY,QAAQ;GACpB;GACA,cAAc,mBAAmB,cAAc;GAC/C,iBAAiB,aAAa,IAAI,IAAI,OAAO;GAC7C,kBAAkB,aAAa,IAAI,IAAI,WAAW;GAClD,cAAc;GACd;GACA,mBAAmB;GACnB,YAAY,KAAK,IAAI,IAAI;EAC3B;EACA,UAAU,aAAa;CACzB;AACF"}

package/dist/mint-DCGoBYhB.d.ts

@@ -1,155 +0,0 @@
-import { a as RunRecord, s as RunSearchCoordinates } from "./run-record-D1Hw-Jml.js";
-import { s as TraceStore } from "./store-C4avFjIi.js";
-import { a as MintedRolloutLine, m as RolloutEvidenceAttempt, t as ChatMessage, y as RolloutRole } from "./schema-C-ziyJD7.js";
-//#region src/rollout/reward.d.ts
-/**
- * Which split's score wins when a record carries both. `'holdout'` is the
- * canonical "real signal" default; `'search'` exists because some callers
- * deliberately score on the search split when both are present.
- */
-type ScorePreference = 'holdout' | 'search';
-/** Only the outcome is read, so every accessor here accepts anything carrying one. */
-type Scored = Pick<RunRecord, 'outcome'>;
-/** True when the authenticity gate flagged the run as gamed (`realness.gated`). */
-declare function isRealnessGated(record: Scored): boolean;
-/**
- * The RAW score recorded on ONE split, with no cross-split fallback and no
- * anti-Goodhart gate.
- *
- * The narrowest of the three raw readers, and the one every split-scoped
- * consumer wants: a per-split report, a promotion gate, or a paired comparison
- * asks "what did this run score on the split I am summarising", and answering
- * it with the other split's number silently mixes populations. `undefined` =
- * that split was never scored.
- *
- * Same warning as `observedScore`: this INCLUDES runs flagged as gamed. Never
- * feed it into training data.
- */
-declare function observedSplitScore(record: Scored, split: ScorePreference): number | undefined;
-/**
- * The RAW split score the run carries, with NO anti-Goodhart gate applied.
- *
- * INCLUDES RUNS FLAGGED AS GAMED (`outcome.realness.gated === true`); NEVER
- * feed this into training data — a fine-tune that sees it learns from gamed
- * successes. It is exported anyway because analysis, reporting, and
- * reward-hacking detection legitimately need the ungated number: forcing a
- * gamed run to 0 collapses the proxy signal toward ground truth and makes a
- * detector report "clean" on exactly the population that is being gamed.
- *
- * Returns `undefined` when the record carries neither score — an unscored run
- * is a labeled gap, not a measured zero, and each caller picks its own
- * sentinel (`?? 0`, `?? null`, skip, throw). Non-finite values are returned
- * as-is; callers that care keep their own `Number.isFinite` guard.
- */
-declare function observedScore(record: Scored, prefer?: ScorePreference): number | undefined;
-/** Which split actually carried the score, or that none did. */
-type ScoreOrigin = 'holdout' | 'search' | 'unscored';
-/**
- * Where `observedScore` / `trainingScore` read their number from — the
- * provenance label a rollout line's `reward_source` is built from, and the
- * only supported way to ask "was this run scored at all" without respelling
- * the field access.
- */
-declare function scoreOrigin(record: Scored, prefer?: ScorePreference): ScoreOrigin;
-/**
- * The GATED score — the only derivation allowed to reach training data.
- *
- * A realness-gated run scores 0 no matter what it claims, so a fine-tune
- * cannot learn from a gamed success. An unscored run stays `undefined` (a
- * labeled gap), keeping "we never measured this" distinct from "we measured
- * zero"; callers that need a number apply their own sentinel.
- */
-declare function trainingScore(record: Scored, prefer?: ScorePreference): number | undefined;
-/**
- * `{reward, gated}` as written onto a minted `RolloutLine` — `trainingScore`
- * plus the flag itself, so the gate travels into the exported row and a
- * downstream filter can drop or down-weight the line.
- *
- * An unscored record yields `reward: null`, matching the schema's "no verdict
- * exists — a labeled gap, never 0" rule. It previously collapsed to 0, which
- * made a run nobody graded indistinguishable from one graded as a total
- * failure, and taught any trainer reading the row that the trajectory was bad.
- * A gated run still yields 0, because that IS a verdict: the gate decided.
- */
-declare function trainingReward(record: Scored): {
-  reward: number | null;
-  gated: boolean;
-};
-//#endregion
-//#region src/rollout/mint.d.ts
-/** Redactor for transcript/step payload text (secrets, PII), not opaque identity. */
-type RolloutScrubber = (text: string) => string;
-/** A search cell's place in its search tree, read from the search ledger. */
-interface RolloutSearchLineage {
-  /** Edges between the cell's node and the search root; the root is 0. */
-  depth: number;
-  /** Order in which the node registered in its search; the root is 0. */
-  ordinal: number;
-  /** Repeat index of the cell on its task, from 0. */
-  rep: number;
-  /** Run id of the cell whose execution contains this search; null for a
-   *  top-level search. */
-  containingRunId: string | null;
-}
-interface MintRolloutOptions {
-  scrub?: RolloutScrubber;
-  /**
-   * Full canonical capture, including turns no longer in the model's context.
-   * When supplied, missing/empty capture is refused, never replaced with a
-   * span summary. Use the execution owner's capture or the existing harness
-   * readers; reviewer traces and compacted histories are not full capture.
-   */
-  messagesOf?: (runId: string) => readonly ChatMessage[] | undefined | Promise<readonly ChatMessage[] | undefined>;
-  /** Provider attempts from a retained receipt bound to the exact run. */
-  evidenceOf?: (runId: string) => {
-    runId: string;
-    attempts: readonly RolloutEvidenceAttempt[];
-  } | undefined | Promise<{
-    runId: string;
-    attempts: readonly RolloutEvidenceAttempt[];
-  } | undefined>;
-  /** Cap steps per line (longest runs first drop middle steps). Default: no cap. */
-  maxSteps?: number;
-  /** Role recorded on every minted line. Default 'agent' (a solo eval run). */
-  role?: RolloutRole;
-  /** Task suite label. Default: the record's `experimentId`. */
-  suite?: string;
-  /** Injected clock for deterministic output. */
-  now?: () => Date;
-  /**
-   * Lineage of a search run, read from its search ledger. It fills the line's
-   * `generation` (node depth), `candidate_index` (node order), `task.rep` and
-   * `parent_rollout_id` (the containing cell's run). Mint refuses a record
-   * that carries `search` when this is absent, because a null `generation`
-   * states that the run is not part of a search.
-   */
-  searchLineage?: (search: RunSearchCoordinates) => RolloutSearchLineage | Promise<RolloutSearchLineage>;
-}
-interface MintRolloutResult {
-  rows: MintedRolloutLine[];
-  /** runIds that had a RunRecord but no spans — emitted as gap lines AND listed here. */
-  missingTraces: string[];
-}
-/**
- * Why a record cannot be minted, one entry per missing field, empty when it can.
- *
- * Exported so a caller can partition a whole ledger — "which of my 2742 records
- * predate 0.126" — without catching an exception per record, and without
- * re-deriving the field list on their side. A re-derived list is a list that
- * drifts from the door it is supposed to predict.
- *
- * Takes a `RunRecord` because that is what the caller holds and what the
- * compiler agrees they hold. The type is precisely the thing that is wrong, so
- * the checks read the record as the untyped bag it actually is on disk.
- */
-declare function unmintableReasons(record: RunRecord): string[];
-/**
- * Join RunRecords with their traces into canonical rollout lines. Records
- * without spans or an explicit capture are emitted as labeled gap lines and reported in
- * `missingTraces`. Execution-only records without a task score are rejected
- * because a missing training label is not a zero reward.
- */
-declare function mintRolloutRows(records: RunRecord[], store: TraceStore, options?: MintRolloutOptions): Promise<MintRolloutResult>;
-//#endregion
-export { mintRolloutRows as a, ScorePreference as c, observedSplitScore as d, scoreOrigin as f, RolloutSearchLineage as i, isRealnessGated as l, trainingScore as m, MintRolloutResult as n, unmintableReasons as o, trainingReward as p, RolloutScrubber as r, ScoreOrigin as s, MintRolloutOptions as t, observedScore as u };
-//# sourceMappingURL=mint-DCGoBYhB.d.ts.map

package/dist/mint-DCGoBYhB.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mint-DCGoBYhB.d.ts","names":[],"sources":["../src/rollout/reward.ts","../src/rollout/mint.ts"],"mappings":";;;;;;;;;KA2BY;;KAGP,SAAS,KAAK;;iBAGH,gBAAgB,QAAQ;;;;;;;;;;;;;;iBAiBxB,mBAAmB,QAAQ,QAAQ,OAAO;;;;;;;;;;;;;;;;iBAmB1C,cACd,QAAQ,QACR,SAAQ;;KAOE;;;;;;;iBAQI,YAAY,QAAQ,QAAQ,SAAQ,kBAA8B;;;;;;;;;iBAelE,cACd,QAAQ,QACR,SAAQ;;;;;;;;;;;;iBAiBM,eAAe,QAAQ;EAAW;EAAuB;;;;;KCrE7D,mBAAmB;;UAGd;;EAEf;;EAEA;;EAEA;;;EAGA;;UAGe;EACf,QAAQ;;;;;;;EAOR,cACE,2BACY,4BAA4B,iBAAiB;;EAE3D,cACE;IAEI;IAAe,mBAAmB;kBAEpC;IAAU;IAAe,mBAAmB;;;EAEhD;;EAEA,OAAO;;EAEP;;EAEA,YAAY;;;;;;;;EAQZ,iBACE,QAAQ,yBACL,uBAAuB,QAAQ;;UAGrB;EACf,MAAM;;EAEN;;;;;;;;;;;;;;iBA4Pc,kBAAkB,QAAQ;;;;;;;iBAsMpB,gBACpB,SAAS,aACT,OAAO,YACP,UAAS,qBACR,QAAQ"}

package/dist/paired-tests-jbwPdSz5.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"paired-tests-jbwPdSz5.js","names":[],"sources":["../src/statistics/paired-tests.ts"],"sourcesContent":["/**\n * Paired significance tests on continuous scores: the paired t-test, the\n * promotion-gate paired bootstrap, the exact sign test, and the package-wide\n * paired-delta decision statistic.\n */\n\nimport { ValidationError } from '../errors'\nimport { studentTCdf } from '../math/student-t'\nimport { assertFiniteSample, binomialHalfUpperTail, makeRng, medianInPlace } from './internal'\n\nexport interface PairedTTestResult {\n  /** Null when the statistic is undefined — see {@link pairedTTest}. */\n  t: number | null\n  df: number\n  /** Null exactly when `t` is null. */\n  p: number | null\n}\n\n/**\n * Paired t-test — before/after measurements on the SAME items.\n * Pairing removes inter-item variance, giving tighter significance than\n * an unpaired test when comparing prompt v1 vs prompt v2 on identical\n * scenarios.\n *\n * Returns `t = p = null` where the statistic is undefined: fewer than two\n * pairs, or a non-zero constant delta whose observed variance is zero. A\n * constant shift carries no information about the variance it would have to\n * be compared against, so the honest answer is \"undefined\", not `p = 0` —\n * three observations cannot buy absolute certainty. This is the same contract\n * {@link pairedCohensDz} states for the same condition. An all-zero delta is\n * different: it is a measured null, and returns `t = 0, p = 1`.\n */\nexport function pairedTTest(before: number[], after: number[]): PairedTTestResult {\n  if (before.length !== after.length) {\n    throw new ValidationError(\n      `pairedTTest: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  assertFiniteSample('pairedTTest', 'before', before)\n  assertFiniteSample('pairedTTest', 'after', after)\n  const n = before.length\n  if (n < 2) return { t: null, df: 0, p: null }\n\n  const diffs = before.map((b, i) => after[i]! - b)\n  const mean = diffs.reduce((a, b) => a + b, 0) / n\n  const variance = diffs.reduce((acc, d) => acc + (d - mean) ** 2, 0) / (n - 1)\n  const se = Math.sqrt(variance / n)\n  if (se === 0) {\n    return mean === 0 ? { t: 0, df: n - 1, p: 1 } : { t: null, df: n - 1, p: null }\n  }\n\n  const t = mean / se\n  const df = n - 1\n  const p = 2 * (1 - studentTCdf(Math.abs(t), df))\n  return { t, df, p }\n}\n\n// ── Paired bootstrap (promotion-gate effect size) ────────────────────\n\nexport interface PairedBootstrapResult {\n  /** Number of paired observations. */\n  n: number\n  /** Median of paired deltas (after − before). */\n  median: number\n  /** Mean of paired deltas. */\n  mean: number\n  /** Lower bound of the bootstrap CI on the chosen statistic. */\n  low: number\n  /** Upper bound of the bootstrap CI on the chosen statistic. */\n  high: number\n  /** Confidence level used (e.g. 0.95). */\n  confidence: number\n  /** Number of bootstrap resamples used. */\n  resamples: number\n  /** False below {@link BOOTSTRAP_GATE_MIN_N}. See {@link pairedBootstrap}. */\n  gateEligible: boolean\n}\n\n/**\n * Pairs below which a percentile bootstrap interval is descriptive spread only.\n *\n * `P(low > 0)` under a true null, against a nominal 2.5 %, measured over 4000\n * seeded trials: 13.53 % at n = 3, 3.52 % at n = 10, 3.10 % at n = 20 on the\n * median; 13.85 %, 4.90 %, 3.80 % on the mean. This is intrinsic to resampling\n * three points, not an implementation error — scipy's BCa gives 16.0 % on the\n * same n = 3 data — so no change to the estimator moves it. Below this floor\n * the decision belongs to the exact sign test or exact signed-rank test.\n */\nexport const BOOTSTRAP_GATE_MIN_N = 20\n\nexport interface PairedBootstrapOptions {\n  /** Confidence level. Default 0.95. */\n  confidence?: number\n  /** Bootstrap resample count. Default 2000. */\n  resamples?: number\n  /** Statistic to bootstrap. Default 'median'. */\n  statistic?: 'median' | 'mean'\n  /** Deterministic seed. If omitted, derived from the deltas so the interval\n   *  is reproducible regardless. */\n  seed?: number\n}\n\n/**\n * Paired bootstrap on (after − before) deltas. Returns a CI on the chosen\n * statistic (median by default); pairs are resampled with replacement. Throws\n * on unequal sample sizes.\n *\n * `low > threshold` carries the stated confidence ONLY at `n ≥\n * {@link BOOTSTRAP_GATE_MIN_N}`, which `gateEligible` reports. Below it the\n * check fires under a true null several times more often than nominal, so the\n * interval is descriptive spread and a promotion must not turn on it.\n */\nexport function pairedBootstrap(\n  before: number[],\n  after: number[],\n  opts: PairedBootstrapOptions = {},\n): PairedBootstrapResult {\n  if (before.length !== after.length) {\n    throw new Error(`pairedBootstrap: unequal sample sizes (${before.length} vs ${after.length})`)\n  }\n  const confidence = opts.confidence ?? 0.95\n  const resamples = opts.resamples ?? 2000\n  const statistic = opts.statistic ?? 'median'\n  if (confidence <= 0 || confidence >= 1) {\n    throw new Error(`pairedBootstrap: confidence must be in (0,1), got ${confidence}`)\n  }\n\n  const n = before.length\n  const deltas = before.map((b, i) => after[i]! - b)\n  const gateEligible = n >= BOOTSTRAP_GATE_MIN_N\n  if (n === 0) {\n    return { n: 0, median: 0, mean: 0, low: 0, high: 0, confidence, resamples, gateEligible }\n  }\n  if (n === 1) {\n    const d = deltas[0]!\n    return { n: 1, median: d, mean: d, low: d, high: d, confidence, resamples, gateEligible }\n  }\n\n  const rng = makeRng(opts.seed, deltas)\n  const samples = new Array<number>(resamples)\n  for (let b = 0; b < resamples; b++) {\n    if (statistic === 'mean') {\n      let sum = 0\n      for (let k = 0; k < n; k++) {\n        sum += deltas[Math.floor(rng() * n)]!\n      }\n      samples[b] = sum / n\n    } else {\n      const acc = new Array<number>(n)\n      for (let k = 0; k < n; k++) {\n        acc[k] = deltas[Math.floor(rng() * n)]!\n      }\n      samples[b] = medianInPlace(acc)\n    }\n  }\n  samples.sort((a, b) => a - b)\n\n  const alpha = 1 - confidence\n  const lowIdx = Math.floor((alpha / 2) * resamples)\n  const highIdx = Math.min(resamples - 1, Math.ceil((1 - alpha / 2) * resamples) - 1)\n\n  return {\n    n,\n    median: medianInPlace([...deltas]),\n    mean: deltas.reduce((s, x) => s + x, 0) / n,\n    low: samples[lowIdx]!,\n    high: samples[Math.max(highIdx, lowIdx)]!,\n    confidence,\n    resamples,\n    gateEligible,\n  }\n}\n\n/** Pre-registered direction for a one-sided paired sign test. */\nexport type SignTestAlternative = 'greater' | 'less'\n\n/** Exact one-sided sign-test result for paired numeric differences. */\nexport interface PairedSignTestResult {\n  /** Total supplied differences, including zero ties. */\n  n: number\n  /** Strictly positive differences. */\n  positive: number\n  /** Strictly negative differences. */\n  negative: number\n  /** Zero differences excluded from the binomial test. */\n  ties: number\n  /** Non-zero differences used by the binomial test. */\n  nNonTies: number\n  /** Direction of the pre-registered alternative hypothesis. */\n  alternative: SignTestAlternative\n  /** Exact one-sided p-value under P(positive) = P(negative) = 0.5. */\n  pValue: number\n}\n\n/**\n * Exact one-sided sign test over paired differences.\n *\n * Pass `after[i] - before[i]` for each matched item. `alternative = 'greater'`\n * tests whether positive signs are more likely than negative signs and returns\n * `P(Binomial(nNonTies, 0.5) >= positive)`. `alternative = 'less'` treats\n * negative signs as successes instead. With a continuous difference\n * distribution this is the usual directional median test. Exact zero\n * differences are ties and do not enter the binomial denominator. All-tie and\n * empty inputs return p = 1. Every input difference must be finite, and the\n * direction must be chosen explicitly so a caller cannot select it after\n * seeing the signs.\n */\nexport function pairedSignTest(\n  differences: readonly number[],\n  alternative: SignTestAlternative,\n): PairedSignTestResult {\n  if (alternative !== 'greater' && alternative !== 'less') {\n    throw new ValidationError(\n      `pairedSignTest: alternative must be 'greater' or 'less', got ${alternative}`,\n    )\n  }\n\n  let positive = 0\n  let negative = 0\n  let ties = 0\n  for (let i = 0; i < differences.length; i++) {\n    const difference = differences[i]!\n    if (!Number.isFinite(difference)) {\n      throw new ValidationError(\n        `pairedSignTest: difference at index ${i} must be finite, got ${difference}`,\n      )\n    }\n    if (difference > 0) positive++\n    else if (difference < 0) negative++\n    else ties++\n  }\n\n  const nNonTies = positive + negative\n  const successes = alternative === 'greater' ? positive : negative\n  return {\n    n: differences.length,\n    positive,\n    negative,\n    ties,\n    nNonTies,\n    alternative,\n    pValue: binomialHalfUpperTail(successes, nNonTies),\n  }\n}\n\n/** Fraction of paired observations whose delta is an exact tie (|after − before|\n *  < 1e-9). Throws on unequal sample sizes; 0 pairs ⇒ 0. */\nexport function pairedDeltaTieFraction(\n  before: ArrayLike<number>,\n  after: ArrayLike<number>,\n): number {\n  if (before.length !== after.length) {\n    throw new Error(\n      `pairedDeltaTieFraction: unequal sample sizes (${before.length} vs ${after.length})`,\n    )\n  }\n  const n = before.length\n  if (n === 0) return 0\n  let ties = 0\n  for (let i = 0; i < n; i++) {\n    if (Math.abs(after[i]! - before[i]!) < 1e-9) ties++\n  }\n  return ties / n\n}\n\n/**\n * The paired-delta statistic a DECISION is computed on, package-wide.\n *\n * The mean paired delta is the estimator that answers the question a promotion\n * gate asks — \"by how much did the candidate move the score\" — in the caller's\n * own units, and it equals the aggregate lift everyone quotes. The MEDIAN\n * answers a different question and loses the answer to this one in every regime\n * eval data actually lands in:\n *   - TWO-POINT (pass/fail) outcomes on any encoding: the delta vector lives in\n *     {−s, 0, +s} dominated by zeros, so the median and its whole bootstrap CI\n *     are pinned at exactly 0 however large the shift. (Decide these on\n *     {@link pairedRiskDifferenceExact} instead — same estimand, exact interval.)\n *   - TIE-DOMINATED outcomes: at half the pairs tied the sample median is 0 by\n *     construction, and `ci.low > threshold` then answers \"no\" forever at a\n *     non-negative threshold and \"yes\" forever at a negative one.\n *   - LOW-CARDINALITY outcomes, even well below half ties: judge dimensions on\n *     integer 0-100, and block scores like {⅔, 1} from averaging pass/fail\n *     leaves, put the median on a coarse lattice whose bootstrap percentiles\n *     land on atoms. Measured: 26 blocks of 3 pass/fail leaves carrying a real\n *     +12.8pp lift, only 23% of pairs tied, gives a median CI of [0, 0.333] —\n *     lower bound exactly 0, so a gate at threshold 0 refuses a real lift.\n * That last case is why there is no tie-fraction threshold here: any cutoff on\n * ties leaves the lattice case open on the other side of it.\n *\n * `heldoutSignificance` has defaulted to the mean since #316 for the same\n * reason. The median remains available per call site for callers who\n * specifically want outlier robustness and accept the blindness.\n */\nexport const DECISION_PAIRED_DELTA_STATISTIC: 'mean' = 'mean'\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AAgCA,SAAgB,YAAY,QAAkB,OAAoC;CAChF,IAAI,OAAO,WAAW,MAAM,QAC1B,MAAM,IAAI,gBACR,sCAAsC,OAAO,OAAO,MAAM,MAAM,OAAO,EACzE;CAEF,mBAAmB,eAAe,UAAU,MAAM;CAClD,mBAAmB,eAAe,SAAS,KAAK;CAChD,MAAM,IAAI,OAAO;CACjB,IAAI,IAAI,GAAG,OAAO;EAAE,GAAG;EAAM,IAAI;EAAG,GAAG;CAAK;CAE5C,MAAM,QAAQ,OAAO,KAAK,GAAG,MAAM,MAAM,KAAM,CAAC;CAChD,MAAM,OAAO,MAAM,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;CAChD,MAAM,WAAW,MAAM,QAAQ,KAAK,MAAM,OAAO,IAAI,SAAS,GAAG,CAAC,KAAK,IAAI;CAC3E,MAAM,KAAK,KAAK,KAAK,WAAW,CAAC;CACjC,IAAI,OAAO,GACT,OAAO,SAAS,IAAI;EAAE,GAAG;EAAG,IAAI,IAAI;EAAG,GAAG;CAAE,IAAI;EAAE,GAAG;EAAM,IAAI,IAAI;EAAG,GAAG;CAAK;CAGhF,MAAM,IAAI,OAAO;CACjB,MAAM,KAAK,IAAI;CAEf,OAAO;EAAE;EAAG;EAAI,GADN,KAAK,IAAI,YAAY,KAAK,IAAI,CAAC,GAAG,EAAE;CAC5B;AACpB;;;;;;;;;;;AAiCA,MAAa,uBAAuB;;;;;;;;;;;AAwBpC,SAAgB,gBACd,QACA,OACA,OAA+B,CAAC,GACT;CACvB,IAAI,OAAO,WAAW,MAAM,QAC1B,MAAM,IAAI,MAAM,0CAA0C,OAAO,OAAO,MAAM,MAAM,OAAO,EAAE;CAE/F,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,YAAY,KAAK,aAAa;CACpC,IAAI,cAAc,KAAK,cAAc,GACnC,MAAM,IAAI,MAAM,qDAAqD,YAAY;CAGnF,MAAM,IAAI,OAAO;CACjB,MAAM,SAAS,OAAO,KAAK,GAAG,MAAM,MAAM,KAAM,CAAC;CACjD,MAAM,eAAe,KAAA;CACrB,IAAI,MAAM,GACR,OAAO;EAAE,GAAG;EAAG,QAAQ;EAAG,MAAM;EAAG,KAAK;EAAG,MAAM;EAAG;EAAY;EAAW;CAAa;CAE1F,IAAI,MAAM,GAAG;EACX,MAAM,IAAI,OAAO;EACjB,OAAO;GAAE,GAAG;GAAG,QAAQ;GAAG,MAAM;GAAG,KAAK;GAAG,MAAM;GAAG;GAAY;GAAW;EAAa;CAC1F;CAEA,MAAM,MAAM,QAAQ,KAAK,MAAM,MAAM;CACrC,MAAM,UAAU,IAAI,MAAc,SAAS;CAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAC7B,IAAI,cAAc,QAAQ;EACxB,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,OAAO,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC;EAEpC,QAAQ,KAAK,MAAM;CACrB,OAAO;EACL,MAAM,MAAM,IAAI,MAAc,CAAC;EAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,IAAI,KAAK,OAAO,KAAK,MAAM,IAAI,IAAI,CAAC;EAEtC,QAAQ,KAAK,cAAc,GAAG;CAChC;CAEF,QAAQ,MAAM,GAAG,MAAM,IAAI,CAAC;CAE5B,MAAM,QAAQ,IAAI;CAClB,MAAM,SAAS,KAAK,MAAO,QAAQ,IAAK,SAAS;CACjD,MAAM,UAAU,KAAK,IAAI,YAAY,GAAG,KAAK,MAAM,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC;CAElF,OAAO;EACL;EACA,QAAQ,cAAc,CAAC,GAAG,MAAM,CAAC;EACjC,MAAM,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI;EAC1C,KAAK,QAAQ;EACb,MAAM,QAAQ,KAAK,IAAI,SAAS,MAAM;EACtC;EACA;EACA;CACF;AACF;;;;;;;;;;;;;;AAoCA,SAAgB,eACd,aACA,aACsB;CACtB,IAAI,gBAAgB,aAAa,gBAAgB,QAC/C,MAAM,IAAI,gBACR,gEAAgE,aAClE;CAGF,IAAI,WAAW;CACf,IAAI,WAAW;CACf,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;EAC3C,MAAM,aAAa,YAAY;EAC/B,IAAI,CAAC,OAAO,SAAS,UAAU,GAC7B,MAAM,IAAI,gBACR,uCAAuC,EAAE,uBAAuB,YAClE;EAEF,IAAI,aAAa,GAAG;OACf,IAAI,aAAa,GAAG;OACpB;CACP;CAEA,MAAM,WAAW,WAAW;CAC5B,MAAM,YAAY,gBAAgB,YAAY,WAAW;CACzD,OAAO;EACL,GAAG,YAAY;EACf;EACA;EACA;EACA;EACA;EACA,QAAQ,sBAAsB,WAAW,QAAQ;CACnD;AACF;;;AAIA,SAAgB,uBACd,QACA,OACQ;CACR,IAAI,OAAO,WAAW,MAAM,QAC1B,MAAM,IAAI,MACR,iDAAiD,OAAO,OAAO,MAAM,MAAM,OAAO,EACpF;CAEF,MAAM,IAAI,OAAO;CACjB,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,IAAI,KAAK,IAAI,MAAM,KAAM,OAAO,EAAG,IAAI,MAAM;CAE/C,OAAO,OAAO;AAChB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,MAAa,kCAA0C"}

package/dist/proposal-findings-CXblsskH.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"proposal-findings-CXblsskH.js","names":[],"sources":["../src/analyst/proposal-findings.ts"],"sourcesContent":["import { z } from 'zod'\nimport type { ProposalFinding } from './types'\n\nconst ProposalFindingSchema = z\n  .object({\n    schema_version: z.literal('1.0.0'),\n    finding_id: z.string().min(1),\n    analyst_id: z.string().min(1),\n    produced_at: z.string().min(1),\n    severity: z.enum(['critical', 'high', 'medium', 'low', 'info']),\n    area: z.string().min(1),\n    claim: z.string().min(1),\n    rationale: z.string().optional(),\n    evidence_refs: z.array(\n      z\n        .object({\n          kind: z.enum(['span', 'event', 'artifact', 'finding', 'metric']),\n          uri: z.string().min(1),\n          excerpt: z.string().optional(),\n        })\n        .strict(),\n    ),\n    recommended_action: z.string().optional(),\n    validation_plan: z.string().optional(),\n    confidence: z.number().min(0).max(1),\n    subject: z.string().optional(),\n    derived_from_judge: z.boolean().optional(),\n    metadata: z.record(z.string(), z.unknown()).optional(),\n    proposal_origin: z.enum(['search', 'production']),\n  })\n  .strict() satisfies z.ZodType<ProposalFinding>\n\n/** True when a finding names a source candidate generation may learn from. */\nexport function isProposalFinding(finding: unknown): finding is ProposalFinding {\n  return ProposalFindingSchema.safeParse(finding).success\n}\n\n/**\n * Reject findings whose source has not been explicitly admitted for candidate\n * generation. Search feedback and observed production behavior are allowed;\n * final evaluation data has no allowed origin.\n */\nexport function assertProposalFindings(\n  findings: unknown,\n  context = 'proposal findings',\n): ReadonlyArray<ProposalFinding> {\n  if (!Array.isArray(findings)) {\n    throw new TypeError(`${context}: expected an array`)\n  }\n  const rejected = findings.flatMap((finding, index) =>\n    isProposalFinding(finding) ? [] : [findingLabel(finding, index)],\n  )\n  if (rejected.length > 0) {\n    throw new Error(\n      `${context}: every finding must match AnalystFinding and declare ` +\n        `proposal_origin as search or production. ` +\n        `Rejected findings: [${rejected.join(', ')}].`,\n    )\n  }\n  return findings as ReadonlyArray<ProposalFinding>\n}\n\nfunction findingLabel(finding: unknown, index: number): string {\n  if (typeof finding !== 'object' || finding === null) return `index ${index}`\n  const id = (finding as { finding_id?: unknown }).finding_id\n  return typeof id === 'string' && id.length > 0 ? id : `index ${index}`\n}\n"],"mappings":";;AAGA,MAAM,wBAAwB,EAC3B,OAAO;CACN,gBAAgB,EAAE,QAAQ,OAAO;CACjC,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC5B,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC5B,aAAa,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CAC7B,UAAU,EAAE,KAAK;EAAC;EAAY;EAAQ;EAAU;EAAO;CAAM,CAAC;CAC9D,MAAM,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACtB,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;CACvB,WAAW,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,eAAe,EAAE,MACf,EACG,OAAO;EACN,MAAM,EAAE,KAAK;GAAC;GAAQ;GAAS;GAAY;GAAW;EAAQ,CAAC;EAC/D,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC;EACrB,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS;CAC/B,CAAC,CAAC,CACD,OAAO,CACZ;CACA,oBAAoB,EAAE,OAAO,CAAC,CAAC,SAAS;CACxC,iBAAiB,EAAE,OAAO,CAAC,CAAC,SAAS;CACrC,YAAY,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;CACnC,SAAS,EAAE,OAAO,CAAC,CAAC,SAAS;CAC7B,oBAAoB,EAAE,QAAQ,CAAC,CAAC,SAAS;CACzC,UAAU,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,SAAS;CACrD,iBAAiB,EAAE,KAAK,CAAC,UAAU,YAAY,CAAC;AAClD,CAAC,CAAC,CACD,OAAO;;AAGV,SAAgB,kBAAkB,SAA8C;CAC9E,OAAO,sBAAsB,UAAU,OAAO,CAAC,CAAC;AAClD;;;;;;AAOA,SAAgB,uBACd,UACA,UAAU,qBACsB;CAChC,IAAI,CAAC,MAAM,QAAQ,QAAQ,GACzB,MAAM,IAAI,UAAU,GAAG,QAAQ,oBAAoB;CAErD,MAAM,WAAW,SAAS,SAAS,SAAS,UAC1C,kBAAkB,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,SAAS,KAAK,CAAC,CACjE;CACA,IAAI,SAAS,SAAS,GACpB,MAAM,IAAI,MACR,GAAG,QAAQ,qHAEc,SAAS,KAAK,IAAI,EAAE,GAC/C;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,SAAkB,OAAuB;CAC7D,IAAI,OAAO,YAAY,YAAY,YAAY,MAAM,OAAO,SAAS;CACrE,MAAM,KAAM,QAAqC;CACjD,OAAO,OAAO,OAAO,YAAY,GAAG,SAAS,IAAI,KAAK,SAAS;AACjE"}

package/dist/redact-Cveoq6fJ.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"redact-Cveoq6fJ.d.ts","names":[],"sources":["../src/trace/redact.ts"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAsCY;cAEC,6BAA6B;;KAG9B;;;;;;cAOC;UAEI;;EAEf;EACA,UAAU;EACV;EACA;;UAGe;EACf;EACA,SAAS;;EAET;EACA,YAAY;EACZ;EACA,UAAU;;UAGK;;EAEf,UAAU;;EAEV;;;;;;;;;EASA;;EAEA,SAAS;;UAGM;;EAEf,UAAU;;EAEV;;KAGU;UAEK;EACf,UAAU;EACV;EACA;EACA;;EAEA;;UAGe;EACf,QAAQ;EACR,SAAS;EACT,UAAU;;EAEV;;;;;;;iBA6Dc,aAAa;;;;;;iBAmNb,YAAY,cAAc;;iBAyN1B,iBAAiB;;iBAQjB,mBAAmB;;;;;;iBAuYnB,OAAO,GACrB,OAAO,GACP,UAAS;EACN,OAAO;EAAG,QAAQ;;;;;;iBAUP,WAAW,cAAc,UAAS;;iBAMlC,qBAAqB,UAAS,mBAA+B;;;;;;;iBA+J7D,kBAAkB,gBAAgB,UAAS,gBAAqB;;;;;iBAoBhE,gBACd,SAAS,kBACT,mBAAmB,sBACnB,iCACC;;iBAsCa,aAAa,SAAS;;;;;;iBAStB,eAAe,GAC7B,OAAO,GACP,UAAS;EACN,OAAO;EAAG,QAAQ;EAAiB,SAAS"}

package/dist/redact-Dk1ZdJEm.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"redact-Dk1ZdJEm.js","names":[],"sources":["../src/trace/redact.ts"],"sourcesContent":["/**\n * The redaction core: the one place that decides what must not leave a\n * process or a machine. Every trace writer, exporter, uploader and share path\n * calls it.\n *\n * Three profiles, each a superset of the one before:\n *   - `default` removes credentials, found by key name and by value shape, and\n *     personal data (email addresses, card numbers, SSNs, phone numbers).\n *     Content is kept. Strings are capped at 1 MiB.\n *   - `share` also removes phone, IP and postal-address fields, replaces\n *     account, user, tenant, session and request identifiers with pseudonyms\n *     that stay consistent within one call, and caps strings at 64 KiB.\n *   - `strict` also removes prompt, completion, message, tool payload and other\n *     raw-content fields and embedded media, and caps strings at 4 KiB.\n *\n * A string that holds a credential is replaced whole with\n * `[REDACTED:<detector>]`. Replacing only the matched span can leave part of a\n * secret behind when a pattern's boundary is wrong. Personal data inside prose\n * is replaced in place, so the rest of the text stays readable.\n *\n * `assessShareSafety` reads a value without changing it and returns SAFE,\n * SAFE_WITH_WARNINGS, UNSAFE or UNKNOWN. UNKNOWN means the scanner could not\n * read part of the value (a cycle, binary data, nesting past the depth limit);\n * it is never reported as safe. `redactForShare` redacts and then assesses the\n * redacted output, so a detector gap shows up as UNSAFE instead of a leak.\n *\n * Reports and findings carry paths, categories and detector ids, never the\n * values they matched.\n *\n * The key classifier and the credential detector list are adapted from\n * agent-inspect (MIT, commit 3c3cbeda). `scripts/redaction-corpus.json` holds\n * the must-flag and must-not-flag cases, including the copied agent-inspect\n * safety corpus with its MIT notice; `pnpm redaction:corpus` runs this module\n * over every case.\n */\n\nimport { createHmac, randomBytes } from 'node:crypto'\n\nexport type RedactionProfile = 'default' | 'share' | 'strict'\n\nexport const REDACTION_PROFILES: readonly RedactionProfile[] = ['default', 'share', 'strict']\n\n/** What a finding is about. `media` is embedded binary content (a `data:` URI) no text detector can read. */\nexport type SafetyCategory = 'credential' | 'personal-data' | 'identifier' | 'raw-content' | 'media'\n\n/**\n * Version of the detector set and profile rules. Stored work that depends on\n * redaction behavior (saved optimizer inputs, per-span redaction stamps) keys\n * on it, so bump it whenever a detector, key list, cap or marker changes.\n */\nexport const REDACTION_VERSION = '2.4.0'\n\nexport interface RedactionFinding {\n  /** JSON Pointer (RFC 6901) to the value or key that was changed. */\n  path: string\n  category: SafetyCategory\n  detector: string\n  action: 'redacted' | 'pseudonymized' | 'truncated'\n}\n\nexport interface RedactionReport {\n  version: string\n  profile: RedactionProfile\n  /** Values and keys replaced, pseudonymized or truncated. */\n  redactionCount: number\n  byDetector: Record<string, number>\n  truncatedCount: number\n  findings: RedactionFinding[]\n}\n\nexport interface RedactOptions {\n  /** Default `default`. */\n  profile?: RedactionProfile\n  /** Lower the profile's per-string cap. A value above the profile cap is ignored. */\n  maxStringBytes?: number\n  /**\n   * Exact values the caller knows are secret (an API key the run was given, a\n   * password from the environment), whatever shape they have. Each occurrence\n   * in a string, as written or base64, base64url or URL-encoded, becomes\n   * `[REDACTED:known-secret]` and the text around it is kept. A key that\n   * contains one, and a whole-string base64 payload that holds one at any byte\n   * offset, is replaced whole.\n   */\n  knownSecrets?: readonly string[]\n  /** Add this call's findings to an existing report instead of a new one. */\n  report?: RedactionReport\n}\n\nexport interface AssessOptions {\n  /** Default `default`. */\n  profile?: RedactionProfile\n  /** As in `RedactOptions`: any surviving occurrence makes the verdict UNSAFE. */\n  knownSecrets?: readonly string[]\n}\n\nexport type ShareSafetyStatus = 'SAFE' | 'SAFE_WITH_WARNINGS' | 'UNSAFE' | 'UNKNOWN'\n\nexport interface ShareSafetyFinding {\n  category: SafetyCategory\n  detector: string\n  severity: 'error' | 'warning'\n  count: number\n  /** Up to five JSON Pointers where the detector fired. */\n  paths: string[]\n}\n\nexport interface ShareSafetyVerdict {\n  status: ShareSafetyStatus\n  profile: RedactionProfile\n  findings: ShareSafetyFinding[]\n  /** Parts the scanner could not read, as `<path>: <reason>`. Any entry makes the status UNKNOWN. */\n  unreadable: string[]\n}\n\n// ── Profiles ─────────────────────────────────────────────────────────────\n\ninterface ProfileRules {\n  maxStringBytes: number\n  /** Key categories whose values are removed or pseudonymized. */\n  redactKeys: ReadonlySet<'share-personal' | 'identifier' | 'raw-content'>\n  redactMedia: boolean\n  severity: Record<SafetyCategory, 'error' | 'warning' | undefined>\n}\n\nconst KIB = 1024\n\nconst PROFILE_RULES: Record<RedactionProfile, ProfileRules> = {\n  default: {\n    maxStringBytes: 1024 * KIB,\n    redactKeys: new Set(),\n    redactMedia: false,\n    severity: {\n      credential: 'error',\n      'personal-data': 'warning',\n      identifier: undefined,\n      'raw-content': 'warning',\n      media: 'warning',\n    },\n  },\n  share: {\n    maxStringBytes: 64 * KIB,\n    redactKeys: new Set(['share-personal', 'identifier']),\n    redactMedia: false,\n    severity: {\n      credential: 'error',\n      'personal-data': 'error',\n      identifier: 'warning',\n      'raw-content': 'warning',\n      media: 'warning',\n    },\n  },\n  strict: {\n    maxStringBytes: 4 * KIB,\n    redactKeys: new Set(['share-personal', 'identifier', 'raw-content']),\n    redactMedia: true,\n    severity: {\n      credential: 'error',\n      'personal-data': 'error',\n      identifier: 'warning',\n      'raw-content': 'error',\n      media: 'error',\n    },\n  },\n}\n\n// ── Key classifier ───────────────────────────────────────────────────────\n\n/**\n * Canonical snake_case form of a field name, so camelCase, kebab-case, dotted\n * and snake_case spellings match one list: `userPassword`, `user-password` and\n * `user.password` all become `user_password`.\n */\nexport function normalizeKey(key: string): string {\n  return key\n    .replace(/([a-z0-9])([A-Z])/g, '$1_$2')\n    .toLowerCase()\n    .replace(/[^a-z0-9]+/g, '_')\n    .replace(/^_+|_+$/g, '')\n}\n\n/** Counts, limits and model vocabulary that contain the word \"token\" but are not credentials. */\nconst NON_CREDENTIAL_TOKEN_KEYS: ReadonlySet<string> = new Set([\n  'tokens',\n  'max_tokens',\n  'min_tokens',\n  'ls_max_tokens',\n  'token_count',\n  'token_limit',\n  'token_budget',\n  'input_tokens',\n  'output_tokens',\n  'total_tokens',\n  'cached_tokens',\n  'prompt_tokens',\n  'completion_tokens',\n  'reasoning_tokens',\n  'bos_token',\n  'eos_token',\n  'pad_token',\n  'unk_token',\n  'sep_token',\n  'cls_token',\n  'mask_token',\n  'stop_token',\n  // Pagination cursors are opaque but not credentials.\n  'page_token',\n  'next_page_token',\n  'prev_page_token',\n  'next_token',\n  'continuation_token',\n  'cursor_token',\n  'sync_token',\n])\n\nconst CREDENTIAL_KEYS = [\n  'authorization',\n  'auth',\n  'cookie',\n  'api_key',\n  'apikey',\n  'api_token',\n  'access_key',\n  'secret_key',\n  'private_key',\n  'signing_key',\n  'encryption_key',\n  'master_key',\n  'session_key',\n  'client_secret',\n  'secret',\n  'password',\n  'passwd',\n  'passphrase',\n  'credential',\n  'credentials',\n  'bearer',\n  'dsn',\n  'database_url',\n  'connection_string',\n  'pat',\n] as const\n\n/** Email fields are personal data in every profile. */\nconst EMAIL_KEYS = ['email', 'email_address'] as const\n\n/** Personal-data fields removed by the share and strict profiles. */\nconst SHARE_PERSONAL_KEYS = [\n  'phone',\n  'phone_number',\n  'mobile',\n  'ip',\n  'ip_address',\n  'remote_addr',\n  'street_address',\n  'postal_address',\n  'home_address',\n  'billing_address',\n  'shipping_address',\n  'mailing_address',\n  'date_of_birth',\n  'dob',\n  'ssn',\n] as const\n\n/** Identifiers pseudonymized by the share and strict profiles. */\nconst IDENTIFIER_KEYS = [\n  'user_id',\n  'user_uuid',\n  'account_id',\n  'account_uuid',\n  'customer_id',\n  'tenant_id',\n  'org_id',\n  'organization_id',\n  'organisation_id',\n  'team_id',\n  'enduser_id',\n  'actor_id',\n  'principal_id',\n  'member_id',\n  'session_id',\n  'request_id',\n  'correlation_id',\n  'device_id',\n  'installation_id',\n] as const\n\n/** Fields that carry prompts, model output, tool payloads or other free text. Removed by `strict`. */\nconst RAW_CONTENT_KEYS = [\n  'prompt',\n  'prompts',\n  'system_prompt',\n  'completion',\n  'input',\n  'output',\n  'message',\n  'messages',\n  'content',\n  'text',\n  'thinking',\n  'reasoning',\n  'transcript',\n  'context',\n  'document',\n  'documents',\n  'chunk',\n  'chunks',\n  'retrieval',\n  'query',\n  'args',\n  'arguments',\n  'result',\n  'body',\n  'command',\n  'full_command',\n  'input_value',\n  'output_value',\n  'instructions',\n  'system_instructions',\n  'stdout',\n  'stderr',\n  'stacktrace',\n  'status_description',\n  'input_preview',\n  'output_preview',\n  'current_task',\n  'user_input',\n  'request_text',\n] as const\n\n/**\n * A key matches a list entry exactly or as a suffix (`openai_api_key`,\n * `db_password`, `tool_output`). Prefix compounds (`secret_name`,\n * `password_min_length`, `auth_type`, `content_type`) do not match: they name\n * or describe a value rather than hold it, and flagging them would make the\n * share verdict refuse ordinary traces. Value detectors still catch a\n * credential-shaped value under any key.\n */\nfunction matchesKeyList(normalized: string, keys: readonly string[]): boolean {\n  for (const key of keys) {\n    if (normalized === key || normalized.endsWith(`_${key}`)) return true\n  }\n  return false\n}\n\nfunction isTokenCredentialKey(normalized: string): boolean {\n  if (NON_CREDENTIAL_TOKEN_KEYS.has(normalized)) return false\n  if (normalized === 'token') return true\n  // access_token and refreshToken are credentials; max_tokens and input_tokens are counts.\n  if (normalized.endsWith('tokens')) return false\n  return normalized.endsWith('token')\n}\n\ntype KeyClass = 'credential' | 'email' | 'share-personal' | 'identifier' | 'raw-content'\n\n/** Trace keys repeat on every span, so classifications are cached. */\nconst keyClassCache = new Map<string, KeyClass | null>()\n\nfunction classifyKeyName(key: string): KeyClass | undefined {\n  const cached = keyClassCache.get(key)\n  if (cached !== undefined) return cached ?? undefined\n  const kind = classifyNormalizedKey(normalizeKey(key))\n  if (keyClassCache.size >= 10_000) keyClassCache.clear()\n  keyClassCache.set(key, kind ?? null)\n  return kind\n}\n\nfunction classifyNormalizedKey(normalized: string): KeyClass | undefined {\n  if (!normalized || NON_CREDENTIAL_TOKEN_KEYS.has(normalized)) return undefined\n  if (isTokenCredentialKey(normalized)) return 'credential'\n  if (matchesKeyList(normalized, CREDENTIAL_KEYS)) return 'credential'\n  if (matchesKeyList(normalized, EMAIL_KEYS)) return 'email'\n  if (matchesKeyList(normalized, SHARE_PERSONAL_KEYS)) return 'share-personal'\n  if (matchesKeyList(normalized, IDENTIFIER_KEYS)) return 'identifier'\n  if (matchesKeyList(normalized, RAW_CONTENT_KEYS)) return 'raw-content'\n  return undefined\n}\n\n/**\n * The safety category a field name puts its value in, or undefined for an\n * ordinary field. Token counts and model limits (`inputTokens`, `max_tokens`,\n * `token_count`) and names such as `author` are not credentials.\n */\nexport function classifyKey(key: string): SafetyCategory | undefined {\n  const kind = classifyKeyName(key)\n  if (kind === undefined) return undefined\n  if (kind === 'credential') return 'credential'\n  if (kind === 'identifier') return 'identifier'\n  if (kind === 'raw-content') return 'raw-content'\n  return 'personal-data'\n}\n\n// ── Value detectors ──────────────────────────────────────────────────────\n\ninterface ValueDetector {\n  id: string\n  pattern: RegExp\n}\n\n/**\n * High-confidence credential shapes. A hit replaces the whole string. Each\n * pattern is written without the `g` flag so `test` stays stateless.\n *\n * The provider-branded prefixes below (`sk-ant-`, `AIza`, `ghp_`, `xoxb-`,\n * `AKIA`, `hubcap_`, `eyJ`…) have no leading `\\b`. A `\\b` word-boundary\n * assertion does not fire between two word characters, so it silently passed\n * a real token when something else glued a word character directly in front\n * of it — a compound identifier like `env.GITHUB_TOKEN_ghp_<token>` (a `_`\n * before `ghp_`) or `BACKUP_AKIA<key>` (a `_` before `AKIA`). These prefixes\n * are distinctive enough on their own, so scanning without that boundary\n * catches the same real credential wherever it is glued, at the cost of no\n * meaningful new false positives (`scripts/redaction-corpus.json` covers\n * both).\n */\nconst CREDENTIAL_DETECTORS: readonly ValueDetector[] = [\n  { id: 'private-key', pattern: /-----BEGIN [A-Z0-9 ]*PRIVATE KEY-----/ },\n  { id: 'jwt', pattern: /eyJ[A-Za-z0-9_-]{8,}\\.[A-Za-z0-9_-]{8,}\\.[A-Za-z0-9_-]{8,}/ },\n  { id: 'bearer', pattern: /\\bbearer\\s+[A-Za-z0-9._~+/=-]{12,}/i },\n  {\n    id: 'authorization-header',\n    pattern: /^\\s*(?:basic|digest|apikey)\\s+[A-Za-z0-9._~+/=:-]{8,}\\s*$/i,\n  },\n  { id: 'anthropic-key', pattern: /sk-ant-[A-Za-z0-9_-]{16,}/ },\n  { id: 'provider-key', pattern: /sk-(?:proj-|tan-)?[A-Za-z0-9_-]{16,}/ },\n  { id: 'stripe-key', pattern: /(?:sk|rk)_(?:live|test)_[A-Za-z0-9_]{10,}/ },\n  { id: 'google-api-key', pattern: /AIza[0-9A-Za-z_-]{20,}/ },\n  { id: 'github-token', pattern: /(?:gh[pousr]_[A-Za-z0-9_]{20,}|github_pat_[A-Za-z0-9_]{20,})/ },\n  { id: 'slack-token', pattern: /xox[abeoprs]-[A-Za-z0-9-]{10,}/ },\n  { id: 'aws-access-key', pattern: /(?:AKIA|ASIA)[A-Z0-9]{16}\\b/ },\n  { id: 'tangle-capability', pattern: /(?:hubcap_|hct_)[A-Za-z0-9_=-]{8,}/ },\n  {\n    // Scheme, userinfo user and password each bounded (32/512/512 chars): the\n    // unbounded `*`/`+` here made `detectCredential` catastrophically slow on\n    // adversarial text with no `://` at all — 256 KiB of `\"a.\"` took ~59s,\n    // measured before this fix (scratchpad/rv/before.ts). A real URL's scheme\n    // and userinfo are always far under these bounds.\n    id: 'url-credentials',\n    pattern: /\\b[a-z][a-z0-9+.-]{0,31}:\\/\\/[^\\s/:@]{1,512}:[^\\s/@]{1,512}@/i,\n  },\n  {\n    id: 'url-secret-param',\n    pattern:\n      /[?&](?:access_token|api_key|apikey|auth|token|secret|password|sig|signature|x-amz-signature|x-goog-signature)=[^&\\s\"'#)]{8,}/i,\n  },\n  {\n    // `GH_TOKEN=…`, `--api-key=…`, `\"client_secret\": \"…\"`, `password: …` in free\n    // text. The value must mix letters and digits and be at least 12\n    // characters, so prose (`token: string`), variable references (`$TOKEN`)\n    // and dotenvx ciphertext (`encrypted:…`) pass. The pattern starts at the\n    // key word itself, with no identifier prefix, so it scans in linear time.\n    // The two mixed-content lookaheads and the value itself are bounded to\n    // 512 chars: unbounded, `'token='` repeated took ~20s at 256 KiB and\n    // `'password:x'` repeated took ~12s at 256 KiB (measured before this fix,\n    // scratchpad/rv/before.ts). A real credential value is always far under\n    // 512 chars.\n    id: 'secret-assignment',\n    pattern:\n      /(?:api[_-]?key|apikey|access[_-]?key|secret[_-]?key|private[_-]?key|secret|token|password|passwd|passphrase|credentials?)[\"']?[ \\t]*[:=][ \\t]*[\"']?(?!encrypted:)(?![$`<[{(%])(?=[^\\s\"'`,;&|]{0,512}[0-9])(?=[^\\s\"'`,;&|]{0,512}[A-Za-z])[^\\s\"'`,;&|]{12,512}/i,\n  },\n  {\n    // `{\"password\": \"hunter2\"}` or `'client_secret': '…'` inside serialized\n    // JSON, YAML or a log line. A quoted credential field name followed by a\n    // quoted value holds a secret whatever the value's shape or length. Bare\n    // `\"token\"` is left out: model logprob output uses it for text tokens.\n    // Placeholders (`[REDACTED…]`, `$VAR`, `{env:VAR}`, `***`, `<value>`) and\n    // prose with two or more spaces (a field description) do not match.\n    id: 'json-secret',\n    pattern:\n      /[\"'][A-Za-z0-9_.-]{0,40}?(?:api[_-]?key|apikey|access[_-]?key|secret[_-]?key|private[_-]?key|client[_-]?secret|secret|password|passwd|passphrase|credentials?|(?:access|refresh|id|auth|session|bearer|api|github|gh|slack|npm)[_-]?token)[\"'][ \\t]*:[ \\t]*[\"'](?!\\[REDACTED|[$*{<])(?![^\"'\\r\\n]* [^\"'\\r\\n]* )[^\"'\\r\\n]{3,}[\"']/i,\n  },\n  {\n    // `DB_PASSWORD=CorrectHorseBatteryStaple`, `PGPASSWORD=postgres`: unlike\n    // `secret-assignment` above, the all-upper-case env-var name ending in a\n    // credential word is itself the signal, so a letters-only or short real\n    // password still matches (no digit-mixing or 12-char minimum). Requires\n    // the name to be immediately followed by `=`, so `MAX_TOKENS=16` and\n    // `TOKEN_EXPIRY=…` (the word isn't the end of the name) do not match.\n    id: 'env-secret-assignment',\n    pattern:\n      /\\b[A-Z][A-Z0-9_]*?(?:PASSWORD|PASSWD|SECRET|PASSPHRASE|APIKEY|API_KEY|TOKEN|CREDENTIALS?)[ \\t]*=[ \\t]*(?!\\$|<|\\*|\\{|%|encrypted:)[^\\s\"'`,;&|]{4,}/,\n  },\n  // Bare-key shapes not covered above. Each requires a distinctive prefix so\n  // it does not fire on ordinary identifiers — same reasoning as the\n  // provider-branded block above, and the same leading-`\\b` bug: a token\n  // glued to preceding text by a digit or underscore (`1ghp_…`, `_sk_live_…`)\n  // is invisible to an anchored detector.\n  { id: 'huggingface-token', pattern: /hf_[A-Za-z0-9]{20,}/ },\n  { id: 'npm-token', pattern: /npm_[A-Za-z0-9]{20,}/ },\n  { id: 'gitlab-token', pattern: /glpat-[A-Za-z0-9_-]{16,}/ },\n  { id: 'groq-key', pattern: /gsk_[A-Za-z0-9]{20,}/ },\n  { id: 'xai-key', pattern: /xai-[A-Za-z0-9]{16,}/ },\n  // ElevenLabs and similar bare `sk_<hex>` shapes — underscore, unlike the\n  // hyphenated `sk-…` `provider-key` pattern above, so the two never overlap.\n  { id: 'bare-sk-key', pattern: /sk_[A-Za-z0-9]{32,}\\b/ },\n  {\n    // `Cookie: sessionid=…; csrftoken=…` in free text or a captured header.\n    id: 'cookie-header',\n    pattern: /\\bcookie\\s*:\\s*[A-Za-z0-9_-]+=[^;\\r\\n]{3,}(?:;\\s*[A-Za-z0-9_-]+=[^;\\r\\n]{3,})*/i,\n  },\n]\n\n/** Personal-data shapes, replaced in place so the surrounding text survives. */\nconst PERSONAL_DATA_DETECTORS: readonly (ValueDetector & {\n  /** A substring the text must contain before the pattern runs. */\n  requires?: string\n  accept?: (match: string) => boolean\n})[] = [\n  {\n    id: 'email',\n    requires: '@',\n    pattern: /\\b[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\\.[A-Za-z]{2,}\\b/g,\n    accept: isEmailAddress,\n  },\n  {\n    // Card numbers: a card-network prefix and a valid Luhn digit, written\n    // unbroken (13-19 digits) or in printed groups (4-4-4-4, 4-4-4-4-3, Amex\n    // 4-6-5). A word character or hyphen on either side rejects the match, so\n    // digits inside UUIDs, dated file names and hyphenated ids never match.\n    id: 'card-number',\n    pattern:\n      /(?<![\\w-])(?:\\d{13,19}|\\d{4}([ -])\\d{4}\\1\\d{4}\\1\\d{4}(?:\\1\\d{3})?|\\d{4}([ -])\\d{6}\\2\\d{5})(?![\\w-])/g,\n    accept: (match) => {\n      const digits = match.replace(/[ -]/g, '')\n      return CARD_PREFIX.test(digits) && luhnValid(digits)\n    },\n  },\n  { id: 'ssn', pattern: /\\b\\d{3}-\\d{2}-\\d{4}\\b/g },\n  {\n    // Separators are required: a bare ten-digit run is usually an epoch second or an id.\n    id: 'phone',\n    pattern: /(?:\\+1[-.\\s]?)?(?:\\(\\d{3}\\)\\s?|\\b\\d{3}[-.\\s])\\d{3}[-.\\s]\\d{4}\\b/g,\n  },\n]\n\n/** Visa, Mastercard, Amex, Diners, JCB, Discover and UnionPay issuer prefixes. */\nconst CARD_PREFIX = /^(?:4|5[1-5]|2[2-7]|3[04-9]|6(?:011|4[4-9]|5|2))/\n\n/**\n * Top-level domains that are file extensions: `icon@2x.png`, `worker@3.service`\n * and `notes@AGENTS.md` are not addresses.\n */\nconst NON_EMAIL_TLDS: ReadonlySet<string> = new Set([\n  'md',\n  'mdx',\n  'txt',\n  'json',\n  'jsonl',\n  'yaml',\n  'yml',\n  'toml',\n  'lock',\n  'ts',\n  'tsx',\n  'js',\n  'jsx',\n  'mjs',\n  'cjs',\n  'py',\n  'rs',\n  'go',\n  'sh',\n  'css',\n  'html',\n  'svg',\n  'png',\n  'jpg',\n  'jpeg',\n  'gif',\n  'webp',\n  'service',\n  'socket',\n  'timer',\n  'mount',\n  'target',\n])\n\nfunction isEmailAddress(match: string): boolean {\n  // `git@github.com:org/repo` is an SSH remote, not a person.\n  if (match.toLowerCase().startsWith('git@')) return false\n  const tld = match.slice(match.lastIndexOf('.') + 1).toLowerCase()\n  return !NON_EMAIL_TLDS.has(tld)\n}\n\nfunction luhnValid(digits: string): boolean {\n  if (/^(\\d)\\1+$/.test(digits)) return false\n  let sum = 0\n  let double = false\n  for (let index = digits.length - 1; index >= 0; index -= 1) {\n    let digit = digits.charCodeAt(index) - 48\n    if (double) {\n      digit *= 2\n      if (digit > 9) digit -= 9\n    }\n    sum += digit\n    double = !double\n  }\n  return sum % 10 === 0\n}\n\n/** The first credential detector that matches, or undefined. */\nexport function detectCredential(text: string): string | undefined {\n  for (const detector of CREDENTIAL_DETECTORS) {\n    if (detector.pattern.test(text)) return detector.id\n  }\n  return undefined\n}\n\n/** Personal-data detector ids that match somewhere in `text`. */\nexport function detectPersonalData(text: string): string[] {\n  const hits: string[] = []\n  for (const detector of PERSONAL_DATA_DETECTORS) {\n    if (detector.requires && !text.includes(detector.requires)) continue\n    detector.pattern.lastIndex = 0\n    for (const match of text.matchAll(detector.pattern)) {\n      if (!detector.accept || detector.accept(match[0])) {\n        hits.push(detector.id)\n        break\n      }\n    }\n  }\n  return hits\n}\n\n/**\n * Every form in which a known secret can appear in a trace: as written,\n * base64, base64url and URL-encoded. Values shorter than 4 characters are\n * ignored; they would match ordinary text.\n */\nfunction knownSecretForms(values: readonly string[] | undefined): string[] {\n  const forms = new Set<string>()\n  for (const value of values ?? []) {\n    if (value.length < 4) continue\n    const bytes = Buffer.from(value, 'utf8')\n    forms.add(value)\n    forms.add(bytes.toString('base64'))\n    forms.add(bytes.toString('base64url'))\n    forms.add(encodeURIComponent(value))\n  }\n  // Longest first, so a secret that contains another is reported as itself.\n  return [...forms].sort((left, right) => right.length - left.length)\n}\n\nconst BASE64_TEXT = /^[A-Za-z0-9+/_-]+={0,2}$/\n\n// A base64 blob embedded in larger text — `Authorization: Basic <base64>` is\n// the common case — can hold a known secret without the WHOLE string being\n// base64. Bounded to 4096 chars per candidate: this scans in linear time (the\n// sum of candidate lengths is at most `text.length`), so no ReDoS risk.\nconst EMBEDDED_BASE64 = /[A-Za-z0-9+/]{16,4096}={0,2}/g\n\nfunction containsKnownSecret(text: string, forms: readonly string[]): boolean {\n  if (forms.length === 0) return false\n  if (forms.some((form) => text.includes(form))) return true\n  // A whole-string base64 payload can hold a secret at any byte offset.\n  if (text.length >= 8 && BASE64_TEXT.test(text)) {\n    const decoded = Buffer.from(\n      text,\n      text.includes('-') || text.includes('_') ? 'base64url' : 'base64',\n    ).toString('utf8')\n    if (forms.some((form) => decoded.includes(form))) return true\n  }\n  // `Basic <base64(user:key)>` jointly encodes the userinfo, so the secret's\n  // OWN base64 form (added to `forms` above) is generally not a substring of\n  // it — 3-byte base64 group alignment shifts with whatever precedes the\n  // secret in the original bytes. Decode any embedded base64-looking run and\n  // check its plaintext directly instead of relying on aligned forms.\n  for (const match of text.matchAll(EMBEDDED_BASE64)) {\n    if (match[0] === text) continue // already checked above\n    try {\n      const decoded = Buffer.from(match[0], 'base64').toString('utf8')\n      if (forms.some((form) => decoded.includes(form))) return true\n    } catch {\n      // Not valid base64 (e.g. wrong padding) — not a candidate.\n    }\n  }\n  return false\n}\n\n/** The detector that marks `text` as a credential: a known secret first, then the value shapes. */\nfunction credentialIn(text: string, knownSecrets: readonly string[]): string | undefined {\n  return containsKnownSecret(text, knownSecrets) ? 'known-secret' : detectCredential(text)\n}\n\nconst MARKER_PREFIX = '[REDACTED:'\n\nfunction marker(detector: string): string {\n  return `${MARKER_PREFIX}${detector}]`\n}\n\n/**\n * Placeholders other tools write for a removed value. A credential field that\n * holds one of these is already redacted and is not flagged again.\n */\nconst REDACTED_PLACEHOLDER =\n  /^(?:\\[(?:REDACTED|redacted)(?::[^\\]]*)?\\]|\\[ID:[0-9a-f]{12}\\]|\\*{3,}|<redacted>|«redacted»|\\[HASH:[0-9a-f]{8,}\\])$/\n\nfunction isPlaceholder(value: string): boolean {\n  return value === '' || REDACTED_PLACEHOLDER.test(value)\n}\n\n// The whole string must be the data URI — `$` at the end, not just a `^`\n// prefix check. A prefix-only check let `data:text/plain;base64,…\\n` PLUS\n// arbitrary trailing text through as unread \"media\", when the trailing text\n// (or, for text/json mimes, the payload itself once decoded) is exactly the\n// kind of prose a credential or personal-data detector should see.\nconst DATA_URI = /^data:([\\w.+-]+\\/[\\w.+-]+)(?:;[\\w.+-]+=[\\w.+-]+)*;base64,([A-Za-z0-9+/=\\s]*)$/i\n\n/** A data: URI's mime type and base64 payload, only when the whole string is the URI. */\nfunction matchDataUri(text: string): { mime: string; payload: string } | undefined {\n  const m = DATA_URI.exec(text)\n  if (!m) return undefined\n  return { mime: (m[1] ?? '').toLowerCase(), payload: m[2] ?? '' }\n}\n\n/** Decodes a data: URI's base64 payload to text, or undefined if it is not valid base64. */\nfunction decodeDataUriPayload(payload: string): string | undefined {\n  const cleaned = payload.replace(/\\s+/g, '')\n  if (cleaned.length === 0) return ''\n  if (!/^[A-Za-z0-9+/]*={0,2}$/.test(cleaned) || cleaned.length % 4 !== 0) return undefined\n  try {\n    return Buffer.from(cleaned, 'base64').toString('utf8')\n  } catch {\n    return undefined\n  }\n}\n\nconst READABLE_IMAGE_MIME = /^image\\//\n/** Mimes whose payload is text a detector can read once decoded. */\nconst DECODABLE_TEXT_MIME = /^text\\/|^application\\/json$/\n\n/** Whether a decoded data: URI payload holds a credential or personal data,\n *  by key name (for application/json) or by value shape (for any text). */\nfunction decodedPayloadIsUnsafe(\n  decoded: string,\n  mime: string,\n  knownSecrets: readonly string[],\n): boolean {\n  if (mime === 'application/json') {\n    try {\n      return jsonValueIsUnsafe(JSON.parse(decoded), knownSecrets)\n    } catch {\n      // Not actually valid JSON despite the mime type — fall through to plain text.\n    }\n  }\n  if (credentialIn(decoded, knownSecrets)) return true\n  return detectPersonalData(decoded).length > 0\n}\n\nfunction jsonValueIsUnsafe(value: unknown, knownSecrets: readonly string[]): boolean {\n  if (value === null || value === undefined) return false\n  if (typeof value === 'string')\n    return credentialIn(value, knownSecrets) !== undefined || detectPersonalData(value).length > 0\n  if (typeof value !== 'object') return false\n  if (Array.isArray(value)) return value.some((item) => jsonValueIsUnsafe(item, knownSecrets))\n  for (const [key, item] of Object.entries(value as Record<string, unknown>)) {\n    const category = classifyKey(key)\n    if (category === 'credential') return true\n    if (category === 'personal-data' && (typeof item === 'string' || typeof item === 'number'))\n      return true\n    if (jsonValueIsUnsafe(item, knownSecrets)) return true\n  }\n  return false\n}\n\n// ── Redaction ────────────────────────────────────────────────────────────\n\nconst MAX_DEPTH = 64\n\ninterface WalkState {\n  rules: ProfileRules\n  maxStringBytes: number\n  knownSecrets: string[]\n  report: RedactionReport\n  /** Created on first use: most calls pseudonymize nothing. */\n  pseudonymKey?: Buffer\n  seen: WeakSet<object>\n}\n\nfunction record(\n  state: WalkState,\n  path: string,\n  category: SafetyCategory,\n  detector: string,\n  action: RedactionFinding['action'],\n): void {\n  const report = state.report\n  if (action === 'truncated') report.truncatedCount += 1\n  report.redactionCount += 1\n  report.byDetector[detector] = (report.byDetector[detector] ?? 0) + 1\n  report.findings.push({ path, category, detector, action })\n}\n\nfunction pointer(parent: string, key: string | number): string {\n  return `${parent}/${String(key).replace(/~/g, '~0').replace(/\\//g, '~1')}`\n}\n\nfunction truncateUtf8(text: string, maxBytes: number): string | undefined {\n  if (text.length <= maxBytes / 4) return undefined\n  const bytes = Buffer.from(text, 'utf8')\n  if (bytes.length <= maxBytes) return undefined\n  // Step back to the first byte of a UTF-8 sequence so no character is split.\n  let cut = maxBytes\n  while (cut > 0 && ((bytes[cut] ?? 0) & 0xc0) === 0x80) cut -= 1\n  return `${bytes.subarray(0, cut).toString('utf8')}…[truncated ${bytes.length - cut} bytes]`\n}\n\nfunction redactStringAt(text: string, path: string, state: WalkState): string {\n  if (isPlaceholder(text)) return text\n  // A known secret is an exact value, so it is cut out where it stands and the\n  // text around it survives: an error message keeps its diagnosis.\n  let output = text\n  for (const form of state.knownSecrets) {\n    if (!output.includes(form)) continue\n    output = output.split(form).join(marker('known-secret'))\n    record(state, path, 'credential', 'known-secret', 'redacted')\n  }\n  const dataUri = matchDataUri(output)\n  if (dataUri) {\n    if (DECODABLE_TEXT_MIME.test(dataUri.mime)) {\n      const decoded = decodeDataUriPayload(dataUri.payload)\n      if (decoded === undefined) {\n        // Can't verify what an undecodable payload holds — fail closed rather\n        // than pass it through as if it were opaque, harmless media.\n        record(state, path, 'credential', 'data-uri-payload', 'redacted')\n        return marker('data-uri-payload')\n      }\n      if (decodedPayloadIsUnsafe(decoded, dataUri.mime, state.knownSecrets)) {\n        record(state, path, 'credential', 'data-uri-payload', 'redacted')\n        return marker('data-uri-payload')\n      }\n      // Decoded clean: still opaque bytes to a downstream reader once\n      // embedded, so it's subject to the ordinary media rule below, same as\n      // any other data URI.\n    }\n    if (!state.rules.redactMedia) return output\n    record(state, path, 'media', 'media', 'redacted')\n    return marker('media')\n  }\n  // A value shape, or a whole-string base64 payload that holds a known secret\n  // at any byte offset, replaces the whole string. The detectors themselves\n  // only ever see a bounded prefix (`boundForScan`): a credential that lives\n  // entirely beyond `maxStringBytes` would be truncated out of the output\n  // below anyway, so scanning past the bound costs time without changing\n  // what can leak. The untouched tail is reattached after the personal-data\n  // pass so later truncation still sees (and cuts) the full length.\n  const boundLen = Math.min(output.length, state.maxStringBytes)\n  let scanTarget = output.slice(0, boundLen)\n  const tail = output.slice(boundLen)\n  const credential = credentialIn(scanTarget, state.knownSecrets)\n  if (credential) {\n    record(state, path, 'credential', credential, 'redacted')\n    return marker(credential)\n  }\n  for (const detector of PERSONAL_DATA_DETECTORS) {\n    if (detector.requires && !scanTarget.includes(detector.requires)) continue\n    scanTarget = scanTarget.replace(detector.pattern, (match) => {\n      if (detector.accept && !detector.accept(match)) return match\n      record(state, path, 'personal-data', detector.id, 'redacted')\n      return marker(detector.id)\n    })\n  }\n  output = scanTarget + tail\n  const truncated = truncateUtf8(output, state.maxStringBytes)\n  if (truncated === undefined) return output\n  record(state, path, 'raw-content', 'size-cap', 'truncated')\n  return truncated\n}\n\nfunction pseudonym(value: string | number, state: WalkState): string {\n  state.pseudonymKey ??= randomBytes(32)\n  const digest = createHmac('sha256', state.pseudonymKey).update(String(value)).digest('hex')\n  return `[ID:${digest.slice(0, 12)}]`\n}\n\nfunction redactKeyed(\n  key: string,\n  value: unknown,\n  path: string,\n  depth: number,\n  state: WalkState,\n): unknown {\n  const kind = classifyKeyName(key)\n  if (value === null || value === undefined || typeof value === 'boolean') {\n    return value\n  }\n  if (typeof value === 'string' && isPlaceholder(value)) return value\n  // Numbers under a credential name are limits and counts (`password_max_age`), not secrets.\n  if (kind === 'credential' && typeof value !== 'number') {\n    record(state, path, 'credential', 'credential-key', 'redacted')\n    return marker('credential-key')\n  }\n  if (\n    kind === 'email' ||\n    (kind === 'share-personal' && state.rules.redactKeys.has('share-personal'))\n  ) {\n    if (typeof value === 'string' || typeof value === 'number') {\n      record(state, path, 'personal-data', 'personal-data-key', 'redacted')\n      return marker('personal-data-key')\n    }\n  }\n  if (kind === 'identifier' && state.rules.redactKeys.has('identifier')) {\n    if (typeof value === 'string' || typeof value === 'number') {\n      record(state, path, 'identifier', 'identifier-key', 'pseudonymized')\n      return pseudonym(value, state)\n    }\n  }\n  if (\n    kind === 'raw-content' &&\n    state.rules.redactKeys.has('raw-content') &&\n    typeof value !== 'number'\n  ) {\n    record(state, path, 'raw-content', 'raw-content-key', 'redacted')\n    return marker('raw-content-key')\n  }\n  return walk(value, path, depth + 1, state)\n}\n\nfunction walk(value: unknown, path: string, depth: number, state: WalkState): unknown {\n  if (typeof value === 'string') return redactStringAt(value, path, state)\n  if (value === null || typeof value !== 'object') return value\n  if (ArrayBuffer.isView(value) || value instanceof ArrayBuffer) {\n    record(state, path, 'media', 'binary', 'redacted')\n    return marker('binary')\n  }\n  if (value instanceof Date) return value\n  if (depth > MAX_DEPTH) {\n    record(state, path, 'raw-content', 'depth-limit', 'truncated')\n    return marker('depth-limit')\n  }\n  if (state.seen.has(value)) {\n    record(state, path, 'raw-content', 'circular', 'redacted')\n    return marker('circular')\n  }\n  state.seen.add(value)\n  try {\n    if (Array.isArray(value)) {\n      return value.map((item, index) => walk(item, pointer(path, index), depth + 1, state))\n    }\n    const out: Record<string, unknown> = {}\n    let renamed = 0\n    for (const [key, item] of Object.entries(value as Record<string, unknown>)) {\n      let outKey = key\n      const keyCredential = credentialIn(key, state.knownSecrets)\n      // A personal-data value used AS a key (an email or card number mapping\n      // to something) is just as reachable as one in a value — walk() only\n      // ever inspects keys for a credential shape, so `{'alice@x.com': 3}`\n      // passed through unchanged with verdict SAFE.\n      const keyPersonalData = keyCredential ? undefined : detectPersonalData(key)[0]\n      if (keyCredential) {\n        renamed += 1\n        outKey = `${marker(keyCredential)}#${renamed}`\n        record(state, pointer(path, outKey), 'credential', keyCredential, 'redacted')\n      } else if (keyPersonalData) {\n        renamed += 1\n        outKey = `${marker(keyPersonalData)}#${renamed}`\n        record(state, pointer(path, outKey), 'personal-data', keyPersonalData, 'redacted')\n      }\n      out[outKey] = redactKeyed(key, item, pointer(path, outKey), depth, state)\n    }\n    return out\n  } finally {\n    state.seen.delete(value)\n  }\n}\n\nfunction newReport(profile: RedactionProfile): RedactionReport {\n  return {\n    version: REDACTION_VERSION,\n    profile,\n    redactionCount: 0,\n    byDetector: {},\n    truncatedCount: 0,\n    findings: [],\n  }\n}\n\nfunction newState(options: RedactOptions, report?: RedactionReport): WalkState {\n  const profile = options.profile ?? 'default'\n  const rules = PROFILE_RULES[profile]\n  if (!rules) throw new Error(`unknown redaction profile: ${String(profile)}`)\n  const requested = options.maxStringBytes\n  const maxStringBytes =\n    typeof requested === 'number' && Number.isFinite(requested) && requested >= 0\n      ? Math.min(Math.floor(requested), rules.maxStringBytes)\n      : rules.maxStringBytes\n  return {\n    rules,\n    maxStringBytes,\n    knownSecrets: knownSecretForms(options.knownSecrets),\n    report: report ?? newReport(profile),\n    seen: new WeakSet(),\n  }\n}\n\n/**\n * Return a redacted deep copy of `value` and a report of what changed. Pure:\n * the input is not mutated. Never throws on the value's shape; cycles, binary\n * data and nesting past 64 levels are replaced with markers.\n */\nexport function redact<T>(\n  value: T,\n  options: RedactOptions = {},\n): { value: T; report: RedactionReport } {\n  const state = newState(options, options.report)\n  const out = walk(value, '', 0, state) as T\n  return { value: out, report: state.report }\n}\n\n/**\n * Redact one free-text string with the value detectors (no field name is\n * known). Pass `report` to accumulate counts across calls.\n */\nexport function redactText(text: string, options: RedactOptions = {}): string {\n  const state = newState(options, options.report)\n  return redactStringAt(text, '', state)\n}\n\n/** An empty report to accumulate `redactText` calls into. */\nexport function emptyRedactionReport(profile: RedactionProfile = 'default'): RedactionReport {\n  return newReport(profile)\n}\n\n// ── Share-safety assessment ──────────────────────────────────────────────\n\ninterface ScanState {\n  profile: RedactionProfile\n  rules: ProfileRules\n  knownSecrets: string[]\n  findings: Map<string, ShareSafetyFinding>\n  unreadable: string[]\n  seen: WeakSet<object>\n}\n\nfunction flag(state: ScanState, path: string, category: SafetyCategory, detector: string): void {\n  const severity = state.rules.severity[category]\n  if (!severity) return\n  const id = `${category}\\u0000${detector}`\n  const existing = state.findings.get(id)\n  if (existing) {\n    existing.count += 1\n    if (existing.paths.length < 5) existing.paths.push(path)\n    return\n  }\n  state.findings.set(id, { category, detector, severity, count: 1, paths: [path] })\n}\n\nfunction scanString(text: string, path: string, state: ScanState): void {\n  if (isPlaceholder(text)) return\n  const dataUri = matchDataUri(text)\n  if (dataUri) {\n    scanDataUri(dataUri, path, state)\n    return\n  }\n  const credential = credentialIn(text, state.knownSecrets)\n  if (credential) {\n    flag(state, path, 'credential', credential)\n    return\n  }\n  for (const detector of detectPersonalData(text)) flag(state, path, 'personal-data', detector)\n}\n\nfunction scanDataUri(\n  dataUri: { mime: string; payload: string },\n  path: string,\n  state: ScanState,\n): void {\n  if (READABLE_IMAGE_MIME.test(dataUri.mime)) {\n    flag(state, path, 'media', 'media')\n    return\n  }\n  if (DECODABLE_TEXT_MIME.test(dataUri.mime)) {\n    const decoded = decodeDataUriPayload(dataUri.payload)\n    if (decoded === undefined) {\n      state.unreadable.push(`${path || '/'}: data URI payload is not valid base64`)\n      return\n    }\n    if (dataUri.mime === 'application/json') {\n      try {\n        scan(JSON.parse(decoded), path, 0, state)\n        return\n      } catch {\n        // Not actually valid JSON despite the mime type — fall through to plain text.\n      }\n    }\n    scanString(decoded, path, state)\n    return\n  }\n  // audio/video/octet-stream/etc: bytes no text detector can read. A warning\n  // under `default` (matches the existing image rule); under `share` and\n  // `strict` — the profiles that actually gate whether something may be sent\n  // off the machine — treat it as unreadable so the verdict is UNKNOWN\n  // instead of silently allowing it through.\n  if (state.profile === 'default') {\n    flag(state, path, 'media', 'media')\n  } else {\n    state.unreadable.push(`${path || '/'}: ${dataUri.mime} data URI cannot be read`)\n  }\n}\n\nfunction scanKeyed(\n  key: string,\n  value: unknown,\n  path: string,\n  depth: number,\n  state: ScanState,\n): void {\n  if (value === null || value === undefined || typeof value === 'boolean') return\n  if (typeof value === 'string' && isPlaceholder(value)) return\n  const category = classifyKey(key)\n  if (category === 'credential' && typeof value !== 'number') {\n    flag(state, path, 'credential', 'credential-key')\n    return\n  }\n  const scalar = typeof value === 'string' || typeof value === 'number'\n  if (category === 'personal-data' && scalar) {\n    const kind = classifyKeyName(key)\n    // Phone, IP and address fields are flagged from the share profile up; email always.\n    if (kind === 'email' || state.profile !== 'default') {\n      flag(state, path, 'personal-data', 'personal-data-key')\n      return\n    }\n  }\n  if (category === 'identifier' && scalar) flag(state, path, 'identifier', 'identifier-key')\n  if (category === 'raw-content' && typeof value !== 'number')\n    flag(state, path, 'raw-content', 'raw-content-key')\n  scan(value, path, depth + 1, state)\n}\n\nfunction scan(value: unknown, path: string, depth: number, state: ScanState): void {\n  if (typeof value === 'string') {\n    scanString(value, path, state)\n    return\n  }\n  if (value === null || typeof value !== 'object') return\n  if (ArrayBuffer.isView(value) || value instanceof ArrayBuffer) {\n    state.unreadable.push(`${path || '/'}: binary data`)\n    return\n  }\n  if (value instanceof Date) return\n  if (depth > MAX_DEPTH) {\n    state.unreadable.push(`${path || '/'}: nested deeper than ${MAX_DEPTH} levels`)\n    return\n  }\n  if (state.seen.has(value)) {\n    state.unreadable.push(`${path || '/'}: circular reference`)\n    return\n  }\n  state.seen.add(value)\n  try {\n    if (Array.isArray(value)) {\n      for (const [index, item] of value.entries())\n        scan(item, pointer(path, index), depth + 1, state)\n      return\n    }\n    for (const [key, item] of Object.entries(value as Record<string, unknown>)) {\n      // A credential or personal-data value used as a key must not reach the\n      // finding paths.\n      const keyCredential = credentialIn(key, state.knownSecrets)\n      const keyPersonalData = keyCredential ? undefined : detectPersonalData(key)[0]\n      const keyDetector = keyCredential ?? keyPersonalData\n      const segment = keyDetector ? marker(keyDetector) : key\n      if (keyCredential) flag(state, pointer(path, segment), 'credential', keyCredential)\n      else if (keyPersonalData)\n        flag(state, pointer(path, segment), 'personal-data', keyPersonalData)\n      scanKeyed(key, item, pointer(path, segment), depth, state)\n    }\n  } finally {\n    state.seen.delete(value)\n  }\n}\n\n/**\n * Read `value` without changing it and say whether it is safe to share under\n * `profile`. UNKNOWN when any part could not be read; UNSAFE when any\n * error-severity finding remains; SAFE_WITH_WARNINGS when only warnings\n * remain (raw content, embedded media, identifiers under `share`).\n */\nexport function assessShareSafety(value: unknown, options: AssessOptions = {}): ShareSafetyVerdict {\n  const profile = options.profile ?? 'default'\n  const rules = PROFILE_RULES[profile]\n  if (!rules) throw new Error(`unknown redaction profile: ${String(profile)}`)\n  const state: ScanState = {\n    profile,\n    rules,\n    knownSecrets: knownSecretForms(options.knownSecrets),\n    findings: new Map(),\n    unreadable: [],\n    seen: new WeakSet(),\n  }\n  scan(value, '', 0, state)\n  return verdictFrom(profile, [...state.findings.values()], state.unreadable)\n}\n\n/**\n * One verdict over several parts (files in a directory, spans in a bundle).\n * Callers prefix each part's paths with its source before combining.\n */\nexport function combineVerdicts(\n  profile: RedactionProfile,\n  verdicts: readonly ShareSafetyVerdict[],\n  unreadable: readonly string[] = [],\n): ShareSafetyVerdict {\n  const findings = new Map<string, ShareSafetyFinding>()\n  for (const verdict of verdicts) {\n    for (const finding of verdict.findings) {\n      const id = `${finding.category}\\u0000${finding.detector}`\n      const existing = findings.get(id)\n      if (!existing) {\n        findings.set(id, { ...finding, paths: [...finding.paths] })\n        continue\n      }\n      existing.count += finding.count\n      for (const path of finding.paths) if (existing.paths.length < 5) existing.paths.push(path)\n    }\n  }\n  return verdictFrom(\n    profile,\n    [...findings.values()],\n    [...verdicts.flatMap((verdict) => verdict.unreadable), ...unreadable],\n  )\n}\n\nfunction verdictFrom(\n  profile: RedactionProfile,\n  findings: readonly ShareSafetyFinding[],\n  unreadable: readonly string[],\n): ShareSafetyVerdict {\n  const status: ShareSafetyStatus =\n    unreadable.length > 0\n      ? 'UNKNOWN'\n      : findings.some((finding) => finding.severity === 'error')\n        ? 'UNSAFE'\n        : findings.length > 0\n          ? 'SAFE_WITH_WARNINGS'\n          : 'SAFE'\n  return { status, profile, findings: [...findings], unreadable: [...unreadable] }\n}\n\n/** Whether a verdict allows sharing: SAFE or SAFE_WITH_WARNINGS. UNSAFE and UNKNOWN refuse. */\nexport function shareAllowed(verdict: ShareSafetyVerdict): boolean {\n  return verdict.status === 'SAFE' || verdict.status === 'SAFE_WITH_WARNINGS'\n}\n\n/**\n * Redact `value` under `profile`, then assess the redacted output. The\n * verdict describes what would actually be shared: a detector that failed to\n * remove something shows up as UNSAFE here.\n */\nexport function redactForShare<T>(\n  value: T,\n  options: RedactOptions = {},\n): { value: T; report: RedactionReport; verdict: ShareSafetyVerdict } {\n  const redacted = redact(value, options)\n  const verdict = assessShareSafety(redacted.value, {\n    profile: options.profile,\n    knownSecrets: options.knownSecrets,\n  })\n  return { value: redacted.value, report: redacted.report, verdict }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCA,MAAa,qBAAkD;CAAC;CAAW;CAAS;AAAQ;;;;;;AAU5F,MAAa,oBAAoB;AA0EjC,MAAM,MAAM;AAEZ,MAAM,gBAAwD;CAC5D,SAAS;EACP,gBAAgB,OAAO;EACvB,4BAAY,IAAI,IAAI;EACpB,aAAa;EACb,UAAU;GACR,YAAY;GACZ,iBAAiB;GACjB,YAAY,KAAA;GACZ,eAAe;GACf,OAAO;EACT;CACF;CACA,OAAO;EACL,gBAAgB,KAAK;EACrB,4BAAY,IAAI,IAAI,CAAC,kBAAkB,YAAY,CAAC;EACpD,aAAa;EACb,UAAU;GACR,YAAY;GACZ,iBAAiB;GACjB,YAAY;GACZ,eAAe;GACf,OAAO;EACT;CACF;CACA,QAAQ;EACN,gBAAgB,IAAI;EACpB,4BAAY,IAAI,IAAI;GAAC;GAAkB;GAAc;EAAa,CAAC;EACnE,aAAa;EACb,UAAU;GACR,YAAY;GACZ,iBAAiB;GACjB,YAAY;GACZ,eAAe;GACf,OAAO;EACT;CACF;AACF;;;;;;AASA,SAAgB,aAAa,KAAqB;CAChD,OAAO,IACJ,QAAQ,sBAAsB,OAAO,CAAC,CACtC,YAAY,CAAC,CACb,QAAQ,eAAe,GAAG,CAAC,CAC3B,QAAQ,YAAY,EAAE;AAC3B;;AAGA,MAAM,4CAAiD,IAAI,IAAI;CAC7D;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;AAGA,MAAM,aAAa,CAAC,SAAS,eAAe;;AAG5C,MAAM,sBAAsB;CAC1B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;AAGA,MAAM,kBAAkB;CACtB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;AAGA,MAAM,mBAAmB;CACvB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;;AAUA,SAAS,eAAe,YAAoB,MAAkC;CAC5E,KAAK,MAAM,OAAO,MAChB,IAAI,eAAe,OAAO,WAAW,SAAS,IAAI,KAAK,GAAG,OAAO;CAEnE,OAAO;AACT;AAEA,SAAS,qBAAqB,YAA6B;CACzD,IAAI,0BAA0B,IAAI,UAAU,GAAG,OAAO;CACtD,IAAI,eAAe,SAAS,OAAO;CAEnC,IAAI,WAAW,SAAS,QAAQ,GAAG,OAAO;CAC1C,OAAO,WAAW,SAAS,OAAO;AACpC;;AAKA,MAAM,gCAAgB,IAAI,IAA6B;AAEvD,SAAS,gBAAgB,KAAmC;CAC1D,MAAM,SAAS,cAAc,IAAI,GAAG;CACpC,IAAI,WAAW,KAAA,GAAW,OAAO,UAAU,KAAA;CAC3C,MAAM,OAAO,sBAAsB,aAAa,GAAG,CAAC;CACpD,IAAI,cAAc,QAAQ,KAAQ,cAAc,MAAM;CACtD,cAAc,IAAI,KAAK,QAAQ,IAAI;CACnC,OAAO;AACT;AAEA,SAAS,sBAAsB,YAA0C;CACvE,IAAI,CAAC,cAAc,0BAA0B,IAAI,UAAU,GAAG,OAAO,KAAA;CACrE,IAAI,qBAAqB,UAAU,GAAG,OAAO;CAC7C,IAAI,eAAe,YAAY,eAAe,GAAG,OAAO;CACxD,IAAI,eAAe,YAAY,UAAU,GAAG,OAAO;CACnD,IAAI,eAAe,YAAY,mBAAmB,GAAG,OAAO;CAC5D,IAAI,eAAe,YAAY,eAAe,GAAG,OAAO;CACxD,IAAI,eAAe,YAAY,gBAAgB,GAAG,OAAO;AAE3D;;;;;;AAOA,SAAgB,YAAY,KAAyC;CACnE,MAAM,OAAO,gBAAgB,GAAG;CAChC,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAC/B,IAAI,SAAS,cAAc,OAAO;CAClC,IAAI,SAAS,cAAc,OAAO;CAClC,IAAI,SAAS,eAAe,OAAO;CACnC,OAAO;AACT;;;;;;;;;;;;;;;;AAwBA,MAAM,uBAAiD;CACrD;EAAE,IAAI;EAAe,SAAS;CAAwC;CACtE;EAAE,IAAI;EAAO,SAAS;CAA6D;CACnF;EAAE,IAAI;EAAU,SAAS;CAAsC;CAC/D;EACE,IAAI;EACJ,SAAS;CACX;CACA;EAAE,IAAI;EAAiB,SAAS;CAA4B;CAC5D;EAAE,IAAI;EAAgB,SAAS;CAAuC;CACtE;EAAE,IAAI;EAAc,SAAS;CAA4C;CACzE;EAAE,IAAI;EAAkB,SAAS;CAAyB;CAC1D;EAAE,IAAI;EAAgB,SAAS;CAA+D;CAC9F;EAAE,IAAI;EAAe,SAAS;CAAiC;CAC/D;EAAE,IAAI;EAAkB,SAAS;CAA8B;CAC/D;EAAE,IAAI;EAAqB,SAAS;CAAqC;CACzE;EAME,IAAI;EACJ,SAAS;CACX;CACA;EACE,IAAI;EACJ,SACE;CACJ;CACA;EAWE,IAAI;EACJ,SACE;CACJ;CACA;EAOE,IAAI;EACJ,SACE;CACJ;CACA;EAOE,IAAI;EACJ,SACE;CACJ;CAMA;EAAE,IAAI;EAAqB,SAAS;CAAsB;CAC1D;EAAE,IAAI;EAAa,SAAS;CAAuB;CACnD;EAAE,IAAI;EAAgB,SAAS;CAA2B;CAC1D;EAAE,IAAI;EAAY,SAAS;CAAuB;CAClD;EAAE,IAAI;EAAW,SAAS;CAAuB;CAGjD;EAAE,IAAI;EAAe,SAAS;CAAwB;CACtD;EAEE,IAAI;EACJ,SAAS;CACX;AACF;;AAGA,MAAM,0BAIC;CACL;EACE,IAAI;EACJ,UAAU;EACV,SAAS;EACT,QAAQ;CACV;CACA;EAKE,IAAI;EACJ,SACE;EACF,SAAS,UAAU;GACjB,MAAM,SAAS,MAAM,QAAQ,SAAS,EAAE;GACxC,OAAO,YAAY,KAAK,MAAM,KAAK,UAAU,MAAM;EACrD;CACF;CACA;EAAE,IAAI;EAAO,SAAS;CAAyB;CAC/C;EAEE,IAAI;EACJ,SAAS;CACX;AACF;;AAGA,MAAM,cAAc;;;;;AAMpB,MAAM,iCAAsC,IAAI,IAAI;CAClD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,SAAS,eAAe,OAAwB;CAE9C,IAAI,MAAM,YAAY,CAAC,CAAC,WAAW,MAAM,GAAG,OAAO;CACnD,MAAM,MAAM,MAAM,MAAM,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC,YAAY;CAChE,OAAO,CAAC,eAAe,IAAI,GAAG;AAChC;AAEA,SAAS,UAAU,QAAyB;CAC1C,IAAI,YAAY,KAAK,MAAM,GAAG,OAAO;CACrC,IAAI,MAAM;CACV,IAAI,SAAS;CACb,KAAK,IAAI,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;EAC1D,IAAI,QAAQ,OAAO,WAAW,KAAK,IAAI;EACvC,IAAI,QAAQ;GACV,SAAS;GACT,IAAI,QAAQ,GAAG,SAAS;EAC1B;EACA,OAAO;EACP,SAAS,CAAC;CACZ;CACA,OAAO,MAAM,OAAO;AACtB;;AAGA,SAAgB,iBAAiB,MAAkC;CACjE,KAAK,MAAM,YAAY,sBACrB,IAAI,SAAS,QAAQ,KAAK,IAAI,GAAG,OAAO,SAAS;AAGrD;;AAGA,SAAgB,mBAAmB,MAAwB;CACzD,MAAM,OAAiB,CAAC;CACxB,KAAK,MAAM,YAAY,yBAAyB;EAC9C,IAAI,SAAS,YAAY,CAAC,KAAK,SAAS,SAAS,QAAQ,GAAG;EAC5D,SAAS,QAAQ,YAAY;EAC7B,KAAK,MAAM,SAAS,KAAK,SAAS,SAAS,OAAO,GAChD,IAAI,CAAC,SAAS,UAAU,SAAS,OAAO,MAAM,EAAE,GAAG;GACjD,KAAK,KAAK,SAAS,EAAE;GACrB;EACF;CAEJ;CACA,OAAO;AACT;;;;;;AAOA,SAAS,iBAAiB,QAAiD;CACzE,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,SAAS,UAAU,CAAC,GAAG;EAChC,IAAI,MAAM,SAAS,GAAG;EACtB,MAAM,QAAQ,OAAO,KAAK,OAAO,MAAM;EACvC,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,MAAM,SAAS,QAAQ,CAAC;EAClC,MAAM,IAAI,MAAM,SAAS,WAAW,CAAC;EACrC,MAAM,IAAI,mBAAmB,KAAK,CAAC;CACrC;CAEA,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,MAAM,UAAU,MAAM,SAAS,KAAK,MAAM;AACpE;AAEA,MAAM,cAAc;AAMpB,MAAM,kBAAkB;AAExB,SAAS,oBAAoB,MAAc,OAAmC;CAC5E,IAAI,MAAM,WAAW,GAAG,OAAO;CAC/B,IAAI,MAAM,MAAM,SAAS,KAAK,SAAS,IAAI,CAAC,GAAG,OAAO;CAEtD,IAAI,KAAK,UAAU,KAAK,YAAY,KAAK,IAAI,GAAG;EAC9C,MAAM,UAAU,OAAO,KACrB,MACA,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG,IAAI,cAAc,QAC3D,CAAC,CAAC,SAAS,MAAM;EACjB,IAAI,MAAM,MAAM,SAAS,QAAQ,SAAS,IAAI,CAAC,GAAG,OAAO;CAC3D;CAMA,KAAK,MAAM,SAAS,KAAK,SAAS,eAAe,GAAG;EAClD,IAAI,MAAM,OAAO,MAAM;EACvB,IAAI;GACF,MAAM,UAAU,OAAO,KAAK,MAAM,IAAI,QAAQ,CAAC,CAAC,SAAS,MAAM;GAC/D,IAAI,MAAM,MAAM,SAAS,QAAQ,SAAS,IAAI,CAAC,GAAG,OAAO;EAC3D,QAAQ,CAER;CACF;CACA,OAAO;AACT;;AAGA,SAAS,aAAa,MAAc,cAAqD;CACvF,OAAO,oBAAoB,MAAM,YAAY,IAAI,iBAAiB,iBAAiB,IAAI;AACzF;AAEA,MAAM,gBAAgB;AAEtB,SAAS,OAAO,UAA0B;CACxC,OAAO,GAAG,gBAAgB,SAAS;AACrC;;;;;AAMA,MAAM,uBACJ;AAEF,SAAS,cAAc,OAAwB;CAC7C,OAAO,UAAU,MAAM,qBAAqB,KAAK,KAAK;AACxD;AAOA,MAAM,WAAW;;AAGjB,SAAS,aAAa,MAA6D;CACjF,MAAM,IAAI,SAAS,KAAK,IAAI;CAC5B,IAAI,CAAC,GAAG,OAAO,KAAA;CACf,OAAO;EAAE,OAAO,EAAE,MAAM,GAAA,CAAI,YAAY;EAAG,SAAS,EAAE,MAAM;CAAG;AACjE;;AAGA,SAAS,qBAAqB,SAAqC;CACjE,MAAM,UAAU,QAAQ,QAAQ,QAAQ,EAAE;CAC1C,IAAI,QAAQ,WAAW,GAAG,OAAO;CACjC,IAAI,CAAC,yBAAyB,KAAK,OAAO,KAAK,QAAQ,SAAS,MAAM,GAAG,OAAO,KAAA;CAChF,IAAI;EACF,OAAO,OAAO,KAAK,SAAS,QAAQ,CAAC,CAAC,SAAS,MAAM;CACvD,QAAQ;EACN;CACF;AACF;AAEA,MAAM,sBAAsB;;AAE5B,MAAM,sBAAsB;;;AAI5B,SAAS,uBACP,SACA,MACA,cACS;CACT,IAAI,SAAS,oBACX,IAAI;EACF,OAAO,kBAAkB,KAAK,MAAM,OAAO,GAAG,YAAY;CAC5D,QAAQ,CAER;CAEF,IAAI,aAAa,SAAS,YAAY,GAAG,OAAO;CAChD,OAAO,mBAAmB,OAAO,CAAC,CAAC,SAAS;AAC9C;AAEA,SAAS,kBAAkB,OAAgB,cAA0C;CACnF,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;CAClD,IAAI,OAAO,UAAU,UACnB,OAAO,aAAa,OAAO,YAAY,MAAM,KAAA,KAAa,mBAAmB,KAAK,CAAC,CAAC,SAAS;CAC/F,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,MAAM,SAAS,kBAAkB,MAAM,YAAY,CAAC;CAC3F,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAgC,GAAG;EAC1E,MAAM,WAAW,YAAY,GAAG;EAChC,IAAI,aAAa,cAAc,OAAO;EACtC,IAAI,aAAa,oBAAoB,OAAO,SAAS,YAAY,OAAO,SAAS,WAC/E,OAAO;EACT,IAAI,kBAAkB,MAAM,YAAY,GAAG,OAAO;CACpD;CACA,OAAO;AACT;AAIA,MAAM,YAAY;AAYlB,SAAS,OACP,OACA,MACA,UACA,UACA,QACM;CACN,MAAM,SAAS,MAAM;CACrB,IAAI,WAAW,aAAa,OAAO,kBAAkB;CACrD,OAAO,kBAAkB;CACzB,OAAO,WAAW,aAAa,OAAO,WAAW,aAAa,KAAK;CACnE,OAAO,SAAS,KAAK;EAAE;EAAM;EAAU;EAAU;CAAO,CAAC;AAC3D;AAEA,SAAS,QAAQ,QAAgB,KAA8B;CAC7D,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC,QAAQ,MAAM,IAAI,CAAC,CAAC,QAAQ,OAAO,IAAI;AACzE;AAEA,SAAS,aAAa,MAAc,UAAsC;CACxE,IAAI,KAAK,UAAU,WAAW,GAAG,OAAO,KAAA;CACxC,MAAM,QAAQ,OAAO,KAAK,MAAM,MAAM;CACtC,IAAI,MAAM,UAAU,UAAU,OAAO,KAAA;CAErC,IAAI,MAAM;CACV,OAAO,MAAM,OAAO,MAAM,QAAQ,KAAK,SAAU,KAAM,OAAO;CAC9D,OAAO,GAAG,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,SAAS,MAAM,EAAE,cAAc,MAAM,SAAS,IAAI;AACrF;AAEA,SAAS,eAAe,MAAc,MAAc,OAA0B;CAC5E,IAAI,cAAc,IAAI,GAAG,OAAO;CAGhC,IAAI,SAAS;CACb,KAAK,MAAM,QAAQ,MAAM,cAAc;EACrC,IAAI,CAAC,OAAO,SAAS,IAAI,GAAG;EAC5B,SAAS,OAAO,MAAM,IAAI,CAAC,CAAC,KAAK,OAAO,cAAc,CAAC;EACvD,OAAO,OAAO,MAAM,cAAc,gBAAgB,UAAU;CAC9D;CACA,MAAM,UAAU,aAAa,MAAM;CACnC,IAAI,SAAS;EACX,IAAI,oBAAoB,KAAK,QAAQ,IAAI,GAAG;GAC1C,MAAM,UAAU,qBAAqB,QAAQ,OAAO;GACpD,IAAI,YAAY,KAAA,GAAW;IAGzB,OAAO,OAAO,MAAM,cAAc,oBAAoB,UAAU;IAChE,OAAO,OAAO,kBAAkB;GAClC;GACA,IAAI,uBAAuB,SAAS,QAAQ,MAAM,MAAM,YAAY,GAAG;IACrE,OAAO,OAAO,MAAM,cAAc,oBAAoB,UAAU;IAChE,OAAO,OAAO,kBAAkB;GAClC;EAIF;EACA,IAAI,CAAC,MAAM,MAAM,aAAa,OAAO;EACrC,OAAO,OAAO,MAAM,SAAS,SAAS,UAAU;EAChD,OAAO,OAAO,OAAO;CACvB;CAQA,MAAM,WAAW,KAAK,IAAI,OAAO,QAAQ,MAAM,cAAc;CAC7D,IAAI,aAAa,OAAO,MAAM,GAAG,QAAQ;CACzC,MAAM,OAAO,OAAO,MAAM,QAAQ;CAClC,MAAM,aAAa,aAAa,YAAY,MAAM,YAAY;CAC9D,IAAI,YAAY;EACd,OAAO,OAAO,MAAM,cAAc,YAAY,UAAU;EACxD,OAAO,OAAO,UAAU;CAC1B;CACA,KAAK,MAAM,YAAY,yBAAyB;EAC9C,IAAI,SAAS,YAAY,CAAC,WAAW,SAAS,SAAS,QAAQ,GAAG;EAClE,aAAa,WAAW,QAAQ,SAAS,UAAU,UAAU;GAC3D,IAAI,SAAS,UAAU,CAAC,SAAS,OAAO,KAAK,GAAG,OAAO;GACvD,OAAO,OAAO,MAAM,iBAAiB,SAAS,IAAI,UAAU;GAC5D,OAAO,OAAO,SAAS,EAAE;EAC3B,CAAC;CACH;CACA,SAAS,aAAa;CACtB,MAAM,YAAY,aAAa,QAAQ,MAAM,cAAc;CAC3D,IAAI,cAAc,KAAA,GAAW,OAAO;CACpC,OAAO,OAAO,MAAM,eAAe,YAAY,WAAW;CAC1D,OAAO;AACT;AAEA,SAAS,UAAU,OAAwB,OAA0B;CACnE,MAAM,iBAAiB,YAAY,EAAE;CAErC,OAAO,OADQ,WAAW,UAAU,MAAM,YAAY,CAAC,CAAC,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,KAClE,CAAC,CAAC,MAAM,GAAG,EAAE,EAAE;AACpC;AAEA,SAAS,YACP,KACA,OACA,MACA,OACA,OACS;CACT,MAAM,OAAO,gBAAgB,GAAG;CAChC,IAAI,UAAU,QAAQ,UAAU,KAAA,KAAa,OAAO,UAAU,WAC5D,OAAO;CAET,IAAI,OAAO,UAAU,YAAY,cAAc,KAAK,GAAG,OAAO;CAE9D,IAAI,SAAS,gBAAgB,OAAO,UAAU,UAAU;EACtD,OAAO,OAAO,MAAM,cAAc,kBAAkB,UAAU;EAC9D,OAAO,OAAO,gBAAgB;CAChC;CACA,IACE,SAAS,WACR,SAAS,oBAAoB,MAAM,MAAM,WAAW,IAAI,gBAAgB,GAErE;MAAA,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;GAC1D,OAAO,OAAO,MAAM,iBAAiB,qBAAqB,UAAU;GACpE,OAAO,OAAO,mBAAmB;EACnC;;CAEF,IAAI,SAAS,gBAAgB,MAAM,MAAM,WAAW,IAAI,YAAY,GAC9D;MAAA,OAAO,UAAU,YAAY,OAAO,UAAU,UAAU;GAC1D,OAAO,OAAO,MAAM,cAAc,kBAAkB,eAAe;GACnE,OAAO,UAAU,OAAO,KAAK;EAC/B;;CAEF,IACE,SAAS,iBACT,MAAM,MAAM,WAAW,IAAI,aAAa,KACxC,OAAO,UAAU,UACjB;EACA,OAAO,OAAO,MAAM,eAAe,mBAAmB,UAAU;EAChE,OAAO,OAAO,iBAAiB;CACjC;CACA,OAAO,KAAK,OAAO,MAAM,QAAQ,GAAG,KAAK;AAC3C;AAEA,SAAS,KAAK,OAAgB,MAAc,OAAe,OAA2B;CACpF,IAAI,OAAO,UAAU,UAAU,OAAO,eAAe,OAAO,MAAM,KAAK;CACvE,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU,OAAO;CACxD,IAAI,YAAY,OAAO,KAAK,KAAK,iBAAiB,aAAa;EAC7D,OAAO,OAAO,MAAM,SAAS,UAAU,UAAU;EACjD,OAAO,OAAO,QAAQ;CACxB;CACA,IAAI,iBAAiB,MAAM,OAAO;CAClC,IAAI,QAAQ,WAAW;EACrB,OAAO,OAAO,MAAM,eAAe,eAAe,WAAW;EAC7D,OAAO,OAAO,aAAa;CAC7B;CACA,IAAI,MAAM,KAAK,IAAI,KAAK,GAAG;EACzB,OAAO,OAAO,MAAM,eAAe,YAAY,UAAU;EACzD,OAAO,OAAO,UAAU;CAC1B;CACA,MAAM,KAAK,IAAI,KAAK;CACpB,IAAI;EACF,IAAI,MAAM,QAAQ,KAAK,GACrB,OAAO,MAAM,KAAK,MAAM,UAAU,KAAK,MAAM,QAAQ,MAAM,KAAK,GAAG,QAAQ,GAAG,KAAK,CAAC;EAEtF,MAAM,MAA+B,CAAC;EACtC,IAAI,UAAU;EACd,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAgC,GAAG;GAC1E,IAAI,SAAS;GACb,MAAM,gBAAgB,aAAa,KAAK,MAAM,YAAY;GAK1D,MAAM,kBAAkB,gBAAgB,KAAA,IAAY,mBAAmB,GAAG,CAAC,CAAC;GAC5E,IAAI,eAAe;IACjB,WAAW;IACX,SAAS,GAAG,OAAO,aAAa,EAAE,GAAG;IACrC,OAAO,OAAO,QAAQ,MAAM,MAAM,GAAG,cAAc,eAAe,UAAU;GAC9E,OAAO,IAAI,iBAAiB;IAC1B,WAAW;IACX,SAAS,GAAG,OAAO,eAAe,EAAE,GAAG;IACvC,OAAO,OAAO,QAAQ,MAAM,MAAM,GAAG,iBAAiB,iBAAiB,UAAU;GACnF;GACA,IAAI,UAAU,YAAY,KAAK,MAAM,QAAQ,MAAM,MAAM,GAAG,OAAO,KAAK;EAC1E;EACA,OAAO;CACT,UAAU;EACR,MAAM,KAAK,OAAO,KAAK;CACzB;AACF;AAEA,SAAS,UAAU,SAA4C;CAC7D,OAAO;EACL,SAAS;EACT;EACA,gBAAgB;EAChB,YAAY,CAAC;EACb,gBAAgB;EAChB,UAAU,CAAC;CACb;AACF;AAEA,SAAS,SAAS,SAAwB,QAAqC;CAC7E,MAAM,UAAU,QAAQ,WAAW;CACnC,MAAM,QAAQ,cAAc;CAC5B,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO,GAAG;CAC3E,MAAM,YAAY,QAAQ;CAK1B,OAAO;EACL;EACA,gBALA,OAAO,cAAc,YAAY,OAAO,SAAS,SAAS,KAAK,aAAa,IACxE,KAAK,IAAI,KAAK,MAAM,SAAS,GAAG,MAAM,cAAc,IACpD,MAAM;EAIV,cAAc,iBAAiB,QAAQ,YAAY;EACnD,QAAQ,UAAU,UAAU,OAAO;EACnC,sBAAM,IAAI,QAAQ;CACpB;AACF;;;;;;AAOA,SAAgB,OACd,OACA,UAAyB,CAAC,GACa;CACvC,MAAM,QAAQ,SAAS,SAAS,QAAQ,MAAM;CAE9C,OAAO;EAAE,OADG,KAAK,OAAO,IAAI,GAAG,KACb;EAAG,QAAQ,MAAM;CAAO;AAC5C;;;;;AAMA,SAAgB,WAAW,MAAc,UAAyB,CAAC,GAAW;CAE5E,OAAO,eAAe,MAAM,IADd,SAAS,SAAS,QAAQ,MACJ,CAAC;AACvC;;AAGA,SAAgB,qBAAqB,UAA4B,WAA4B;CAC3F,OAAO,UAAU,OAAO;AAC1B;AAaA,SAAS,KAAK,OAAkB,MAAc,UAA0B,UAAwB;CAC9F,MAAM,WAAW,MAAM,MAAM,SAAS;CACtC,IAAI,CAAC,UAAU;CACf,MAAM,KAAK,GAAG,SAAS,QAAQ;CAC/B,MAAM,WAAW,MAAM,SAAS,IAAI,EAAE;CACtC,IAAI,UAAU;EACZ,SAAS,SAAS;EAClB,IAAI,SAAS,MAAM,SAAS,GAAG,SAAS,MAAM,KAAK,IAAI;EACvD;CACF;CACA,MAAM,SAAS,IAAI,IAAI;EAAE;EAAU;EAAU;EAAU,OAAO;EAAG,OAAO,CAAC,IAAI;CAAE,CAAC;AAClF;AAEA,SAAS,WAAW,MAAc,MAAc,OAAwB;CACtE,IAAI,cAAc,IAAI,GAAG;CACzB,MAAM,UAAU,aAAa,IAAI;CACjC,IAAI,SAAS;EACX,YAAY,SAAS,MAAM,KAAK;EAChC;CACF;CACA,MAAM,aAAa,aAAa,MAAM,MAAM,YAAY;CACxD,IAAI,YAAY;EACd,KAAK,OAAO,MAAM,cAAc,UAAU;EAC1C;CACF;CACA,KAAK,MAAM,YAAY,mBAAmB,IAAI,GAAG,KAAK,OAAO,MAAM,iBAAiB,QAAQ;AAC9F;AAEA,SAAS,YACP,SACA,MACA,OACM;CACN,IAAI,oBAAoB,KAAK,QAAQ,IAAI,GAAG;EAC1C,KAAK,OAAO,MAAM,SAAS,OAAO;EAClC;CACF;CACA,IAAI,oBAAoB,KAAK,QAAQ,IAAI,GAAG;EAC1C,MAAM,UAAU,qBAAqB,QAAQ,OAAO;EACpD,IAAI,YAAY,KAAA,GAAW;GACzB,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,uCAAuC;GAC5E;EACF;EACA,IAAI,QAAQ,SAAS,oBACnB,IAAI;GACF,KAAK,KAAK,MAAM,OAAO,GAAG,MAAM,GAAG,KAAK;GACxC;EACF,QAAQ,CAER;EAEF,WAAW,SAAS,MAAM,KAAK;EAC/B;CACF;CAMA,IAAI,MAAM,YAAY,WACpB,KAAK,OAAO,MAAM,SAAS,OAAO;MAElC,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,IAAI,QAAQ,KAAK,yBAAyB;AAEnF;AAEA,SAAS,UACP,KACA,OACA,MACA,OACA,OACM;CACN,IAAI,UAAU,QAAQ,UAAU,KAAA,KAAa,OAAO,UAAU,WAAW;CACzE,IAAI,OAAO,UAAU,YAAY,cAAc,KAAK,GAAG;CACvD,MAAM,WAAW,YAAY,GAAG;CAChC,IAAI,aAAa,gBAAgB,OAAO,UAAU,UAAU;EAC1D,KAAK,OAAO,MAAM,cAAc,gBAAgB;EAChD;CACF;CACA,MAAM,SAAS,OAAO,UAAU,YAAY,OAAO,UAAU;CAC7D,IAAI,aAAa,mBAAmB,QACrB;MAAA,gBAAgB,GAEtB,MAAM,WAAW,MAAM,YAAY,WAAW;GACnD,KAAK,OAAO,MAAM,iBAAiB,mBAAmB;GACtD;EACF;;CAEF,IAAI,aAAa,gBAAgB,QAAQ,KAAK,OAAO,MAAM,cAAc,gBAAgB;CACzF,IAAI,aAAa,iBAAiB,OAAO,UAAU,UACjD,KAAK,OAAO,MAAM,eAAe,iBAAiB;CACpD,KAAK,OAAO,MAAM,QAAQ,GAAG,KAAK;AACpC;AAEA,SAAS,KAAK,OAAgB,MAAc,OAAe,OAAwB;CACjF,IAAI,OAAO,UAAU,UAAU;EAC7B,WAAW,OAAO,MAAM,KAAK;EAC7B;CACF;CACA,IAAI,UAAU,QAAQ,OAAO,UAAU,UAAU;CACjD,IAAI,YAAY,OAAO,KAAK,KAAK,iBAAiB,aAAa;EAC7D,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,cAAc;EACnD;CACF;CACA,IAAI,iBAAiB,MAAM;CAC3B,IAAI,QAAQ,WAAW;EACrB,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,uBAAuB,UAAU,QAAQ;EAC9E;CACF;CACA,IAAI,MAAM,KAAK,IAAI,KAAK,GAAG;EACzB,MAAM,WAAW,KAAK,GAAG,QAAQ,IAAI,qBAAqB;EAC1D;CACF;CACA,MAAM,KAAK,IAAI,KAAK;CACpB,IAAI;EACF,IAAI,MAAM,QAAQ,KAAK,GAAG;GACxB,KAAK,MAAM,CAAC,OAAO,SAAS,MAAM,QAAQ,GACxC,KAAK,MAAM,QAAQ,MAAM,KAAK,GAAG,QAAQ,GAAG,KAAK;GACnD;EACF;EACA,KAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAgC,GAAG;GAG1E,MAAM,gBAAgB,aAAa,KAAK,MAAM,YAAY;GAC1D,MAAM,kBAAkB,gBAAgB,KAAA,IAAY,mBAAmB,GAAG,CAAC,CAAC;GAC5E,MAAM,cAAc,iBAAiB;GACrC,MAAM,UAAU,cAAc,OAAO,WAAW,IAAI;GACpD,IAAI,eAAe,KAAK,OAAO,QAAQ,MAAM,OAAO,GAAG,cAAc,aAAa;QAC7E,IAAI,iBACP,KAAK,OAAO,QAAQ,MAAM,OAAO,GAAG,iBAAiB,eAAe;GACtE,UAAU,KAAK,MAAM,QAAQ,MAAM,OAAO,GAAG,OAAO,KAAK;EAC3D;CACF,UAAU;EACR,MAAM,KAAK,OAAO,KAAK;CACzB;AACF;;;;;;;AAQA,SAAgB,kBAAkB,OAAgB,UAAyB,CAAC,GAAuB;CACjG,MAAM,UAAU,QAAQ,WAAW;CACnC,MAAM,QAAQ,cAAc;CAC5B,IAAI,CAAC,OAAO,MAAM,IAAI,MAAM,8BAA8B,OAAO,OAAO,GAAG;CAC3E,MAAM,QAAmB;EACvB;EACA;EACA,cAAc,iBAAiB,QAAQ,YAAY;EACnD,0BAAU,IAAI,IAAI;EAClB,YAAY,CAAC;EACb,sBAAM,IAAI,QAAQ;CACpB;CACA,KAAK,OAAO,IAAI,GAAG,KAAK;CACxB,OAAO,YAAY,SAAS,CAAC,GAAG,MAAM,SAAS,OAAO,CAAC,GAAG,MAAM,UAAU;AAC5E;;;;;AAMA,SAAgB,gBACd,SACA,UACA,aAAgC,CAAC,GACb;CACpB,MAAM,2BAAW,IAAI,IAAgC;CACrD,KAAK,MAAM,WAAW,UACpB,KAAK,MAAM,WAAW,QAAQ,UAAU;EACtC,MAAM,KAAK,GAAG,QAAQ,SAAS,QAAQ,QAAQ;EAC/C,MAAM,WAAW,SAAS,IAAI,EAAE;EAChC,IAAI,CAAC,UAAU;GACb,SAAS,IAAI,IAAI;IAAE,GAAG;IAAS,OAAO,CAAC,GAAG,QAAQ,KAAK;GAAE,CAAC;GAC1D;EACF;EACA,SAAS,SAAS,QAAQ;EAC1B,KAAK,MAAM,QAAQ,QAAQ,OAAO,IAAI,SAAS,MAAM,SAAS,GAAG,SAAS,MAAM,KAAK,IAAI;CAC3F;CAEF,OAAO,YACL,SACA,CAAC,GAAG,SAAS,OAAO,CAAC,GACrB,CAAC,GAAG,SAAS,SAAS,YAAY,QAAQ,UAAU,GAAG,GAAG,UAAU,CACtE;AACF;AAEA,SAAS,YACP,SACA,UACA,YACoB;CASpB,OAAO;EAAE,QAPP,WAAW,SAAS,IAChB,YACA,SAAS,MAAM,YAAY,QAAQ,aAAa,OAAO,IACrD,WACA,SAAS,SAAS,IAChB,uBACA;EACO;EAAS,UAAU,CAAC,GAAG,QAAQ;EAAG,YAAY,CAAC,GAAG,UAAU;CAAE;AACjF;;AAGA,SAAgB,aAAa,SAAsC;CACjE,OAAO,QAAQ,WAAW,UAAU,QAAQ,WAAW;AACzD;;;;;;AAOA,SAAgB,eACd,OACA,UAAyB,CAAC,GAC0C;CACpE,MAAM,WAAW,OAAO,OAAO,OAAO;CACtC,MAAM,UAAU,kBAAkB,SAAS,OAAO;EAChD,SAAS,QAAQ;EACjB,cAAc,QAAQ;CACxB,CAAC;CACD,OAAO;EAAE,OAAO,SAAS;EAAO,QAAQ,SAAS;EAAQ;CAAQ;AACnE"}

package/dist/registry-CMYIaDgS.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"registry-CMYIaDgS.d.ts","names":[],"sources":["../src/analyst/registry.ts"],"mappings":";;;;;UAqDiB;;EAEf,iBAAiB;IACf,SAAS;IACT,KAAK;IACL;aACS;;EAEX,gBAAgB;IACd,SAAS;IACT,SAAS;IACT,UAAU;IACV;aACS;;;;;;EAMX,SAAS;IACP,SAAS;IACT,OAAO;IACP;MACE,+BAA+B,QAAQ;;EAE3C,YAAY;IAAQ,QAAQ;aAA4B;;UAGzC;;EAEf;;EAEA,UAAU;;;;;;;EAOV,YAAY;IACV,SAAS;IACT;IACA;IACA;;;UAIa;;EAEf,OAAO;;EAEP,OAAO,aAAa,SAAS;;EAE7B,QAAQ;;EAER,gBAAgB;;EAEhB,gBAAgB;;EAEhB,eAAe;;UAGA;;EAEf;;EAEA;;EAEA,SAAS;;EAET;;EAEA,SAAS;;EAET,aAAa;;EAEb;;EAEA,OAAO;;;;;;;;;EASP,gBAAgB,cAAc,kBAAkB,eAAe,cAAc;;;;;;EAM7E;;;KAIU;WAEG;WACA;;WAGA;WACA;;WAEA,SAAS,SAAS;;;;;;;;;;UAWhB;WACN;WACA,QAAQ;WACR;WACA,QAAQ;WACR,YAAY;WACZ,oBAAoB;WACpB;WACA,MAAM,SAAS;WACf,eACL,cAAc,kBACd,SAAS,eAAe,cAAc;WAEjC;WACA;WACA;WACA;;;cAqCE,sCAAsC;WACxC;WACA,QAAQ;EAEjB,YAAY,iBAAiB,QAAQ,uBAAuB,UAAU;;cAU3D;mBACM;mBACA;EAEjB,YAAY,UAAS;EAIrB,SAAS,SAAS;EAsBlB,QAAQ;IACN;IACA;IACA;IACA,MAAM;;EAUF,IACJ,eACA,QAAQ,kBACR,UAAS,kBACR,QAAQ;;EAUL,SACJ,eACA,QAAQ,kBACR,SAAS,uBACR,QAAQ;;EAQJ,eACL,eACA,QAAQ,kBACR,SAAS,uBACR,eAAe;;;;;;;;;;;;EAmBX,UACL,eACA,QAAQ,kBACR,UAAS,kBACR,eAAe;UAIV;UA8BA;UAwFO;UA2aP;UAaA;UAUA"}

package/dist/release-confidence-BK2QCB5M.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"release-confidence-BK2QCB5M.d.ts","names":[],"sources":["../src/statistics/rank-tests.ts","../src/promotion-gate.ts","../src/release-confidence.ts"],"mappings":";;;;;;KAiCY;;;;;KAMA;UAEK;;EAEf,SAAS;;EAET;;;EAGA;;UAYe;;EAEf;;EAEA;;EAEA;;EAEA,QAAQ;;EAER;;;;;;;;;;;;;;iBAec,aACd,aACA,aACA,OAAM,kBACL;UAuFc;;;EAGf;;EAEA;;EAEA,QAAQ;;EAER;;EAEA;;;;;;;;;;;;;;;iBAgBc,mBACd,kBACA,iBACA,OAAM,kBACL;;;;;;;;;;;;;;;;;;;;;;;;;;;KCpLS;UAEK;EACf;EACA;;EAEA;;EAEA;;EAEA;;EAEA;EACA;EACA,SAAS;;UAGM;;EAEf;;EAEA;;;;;;EAMA;;;EAGA;;;;;;;;;iBAUc,YACd,oBACA,qBACA,UAAS,mBACR;;;;;;;;;;;;;;;;UA0Gc,oBAAoB;EACnC,iBAAiB;EACjB,kBAAkB;;EAElB,QAAQ,QAAQ,YAAY;EAC5B;EACA;;EAEA;;EAEA;;;;;iBAMoB,gBAAgB,SACpC,MAAM,oBAAoB,WACzB,QAAQ;EAAoB;EAAyB;;;;;KC7K5C;;UAGK;;EAEf;;EAEA;EACA,WAAW;;EAEX;;EAEA;;EAEA;;EAEA;EACA,WAAW;;KAGD;KACA;UAQK;EACf;EACA;EACA,QAAQ;EACR;EACA;EACA;EACA;EACA;;EAEA,eAAe;EACf,MAAM;EACN,WAAW;;UAGI;;EAEf;EACA;EACA;EACA;;EAEA;EACA;EACA;;EAEA;EACA;EACA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA,UAAU;EACV,qBAAqB;EACrB,gBAAgB;EAChB,kBAAkB;EAClB,eAAe;EACf,aAAa;;UAGE;EACf,MAAM;EACN,QAAQ;EACR;EACA;;UAGe;EACf,MAAM;EACN;EACA;EACA;;UAGe;EACf;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,aAAa,OAAO;EACpB,cAAc;EACd,oBAAoB,QAAQ,OAAO;EACnC,0BAA0B;;;;;;;EAO1B;;UAGe;EACf;EACA;EACA;EACA,QAAQ;EACR;EACA,MAAM;EACN,QAAQ;EACR,SAAS;EACT,SAAS;EACT,cAAc;EACd;;iBAkBc,0BACd,OAAO,yBACN;iBA4Ha,wBAAwB,OAAO,yBAAyB"}