@tangle-network/agent-eval 0.144.6 → 0.144.7

package/dist/{integrity-fdt8XPAv.js → store-DNe_Uv1Q.js}

@@ -1,4 +1,3 @@
-import { n as CaptureIntegrityError } from "./errors-D-LKuDhb.js";
 //#region src/trace/store.ts
 var InMemoryTraceStore = class {
 	runs = /* @__PURE__ */ new Map();
@@ -282,143 +281,6 @@ var FileSystemTraceStore = class {
 	}
 };
 //#endregion
-//#region src/trace/integrity.ts
-/**
-* Run-completion integrity check — at end of run, verify the expected event
-* types were actually captured. The point is the launch-review failure mode:
-* a run *appears* successful but the raw provider events were never written,
-* so a downstream reviewer can't reconstruct what happened.
-*
-* Pattern:
-*
-*   const report = await assertRunCaptured(store, runId, {
-*     llmSpansMin: 1,
-*     judgeSpansMin: 1,
-*     rawSink: providerSink,                  // must have ≥ 1 event for this run
-*     requireRawCoverageOfLlmSpans: true,     // every llm span has matching raw events
-*   })
-*   if (!report.ok) throwIfRunIncomplete(report)  // or mark run failed and continue
-*
-* The function is read-only on the store and returns a structured report;
-* the caller chooses the failure mode (throw, mark run failed, log warning).
-* `throwIfRunIncomplete` is the convenient strict mode.
-*/
-var RunIntegrityError = class extends CaptureIntegrityError {
-	report;
-	constructor(report) {
-		super(`Run ${report.runId} failed integrity check: ${report.issues.map((i) => i.code).join(", ")}`);
-		this.report = report;
-	}
-};
-async function assertRunCaptured(store, runId, expectations = {}) {
-	const issues = [];
-	const run = await store.getRun(runId);
-	if (!run) return {
-		ok: false,
-		runId,
-		llmSpanCount: 0,
-		judgeSpanCount: 0,
-		toolSpanCount: 0,
-		rawProviderEventCount: 0,
-		rawSpanCoverage: {
-			covered: 0,
-			total: 0
-		},
-		issues: [{
-			code: "no_run",
-			message: `Run ${runId} not found in store.`
-		}]
-	};
-	const spans = await store.spans({ runId });
-	const llmSpans = spans.filter((s) => s.kind === "llm");
-	const judgeSpans = spans.filter((s) => s.kind === "judge");
-	const toolSpans = spans.filter((s) => s.kind === "tool");
-	const llmMin = expectations.llmSpansMin ?? 0;
-	const judgeMin = expectations.judgeSpansMin ?? 0;
-	const toolMin = expectations.toolSpansMin ?? 0;
-	if (llmSpans.length < llmMin) issues.push({
-		code: "missing_llm_spans",
-		message: `Expected ≥ ${llmMin} LLM spans, found ${llmSpans.length}.`,
-		detail: {
-			expected: llmMin,
-			found: llmSpans.length
-		}
-	});
-	if (judgeSpans.length < judgeMin) issues.push({
-		code: "missing_judge_spans",
-		message: `Expected ≥ ${judgeMin} judge spans, found ${judgeSpans.length}.`,
-		detail: {
-			expected: judgeMin,
-			found: judgeSpans.length
-		}
-	});
-	if (toolSpans.length < toolMin) issues.push({
-		code: "missing_tool_spans",
-		message: `Expected ≥ ${toolMin} tool spans, found ${toolSpans.length}.`,
-		detail: {
-			expected: toolMin,
-			found: toolSpans.length
-		}
-	});
-	let rawEventCount = 0;
-	let coverage = {
-		covered: 0,
-		total: llmSpans.length
-	};
-	if (expectations.rawSink) if (!expectations.rawSink.list) issues.push({
-		code: "no_raw_sink",
-		message: "Provided rawSink does not implement list(); cannot verify capture."
-	});
-	else {
-		const events = await expectations.rawSink.list({ runId });
-		rawEventCount = events.length;
-		const rawMin = expectations.rawProviderEventsMin ?? 1;
-		if (rawEventCount < rawMin) issues.push({
-			code: "missing_raw_events",
-			message: `Expected ≥ ${rawMin} raw provider events, found ${rawEventCount}.`,
-			detail: {
-				expected: rawMin,
-				found: rawEventCount
-			}
-		});
-		if (expectations.requireRawCoverageOfLlmSpans) {
-			const requestEventsBySpan = new Set(events.filter((e) => e.direction === "request" && e.spanId).map((e) => e.spanId));
-			const orphaned = llmSpans.filter((s) => !requestEventsBySpan.has(s.spanId));
-			coverage = {
-				covered: llmSpans.length - orphaned.length,
-				total: llmSpans.length
-			};
-			if (orphaned.length > 0) issues.push({
-				code: "orphan_llm_span",
-				message: `${orphaned.length} LLM span(s) have no matching raw provider request event.`,
-				detail: { orphanedSpanIds: orphaned.map((s) => s.spanId) }
-			});
-		}
-	}
-	else if (expectations.requireRawCoverageOfLlmSpans || expectations.rawProviderEventsMin) issues.push({
-		code: "no_raw_sink",
-		message: "Raw coverage required but no rawSink supplied to the integrity check."
-	});
-	if (expectations.requireOutcome && (run.outcome === void 0 || run.outcome === null)) issues.push({
-		code: "missing_outcome",
-		message: `Run ${runId} has no outcome recorded.`
-	});
-	return {
-		ok: issues.length === 0,
-		runId,
-		llmSpanCount: llmSpans.length,
-		judgeSpanCount: judgeSpans.length,
-		toolSpanCount: toolSpans.length,
-		rawProviderEventCount: rawEventCount,
-		rawSpanCoverage: coverage,
-		issues
-	};
-}
-/** Strict mode: throws `RunIntegrityError` when the report isn't ok. */
-function throwIfRunIncomplete(report) {
-	if (!report.ok) throw new RunIntegrityError(report);
-}
-//#endregion
-export { InMemoryTraceStore as a, FileSystemTraceStore as i, assertRunCaptured as n, throwIfRunIncomplete as r, RunIntegrityError as t };
+export { InMemoryTraceStore as n, FileSystemTraceStore as t };
 
-//# sourceMappingURL=integrity-fdt8XPAv.js.map
+//# sourceMappingURL=store-DNe_Uv1Q.js.map

package/dist/store-DNe_Uv1Q.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store-DNe_Uv1Q.js","names":[],"sources":["../src/trace/store.ts"],"sourcesContent":["/**\n * TraceStore — persistence + query over the TraceSchema v1 corpus.\n *\n * Two implementations ship in the core:\n *   - InMemoryTraceStore: dev + tests, fully in-process\n *   - FileSystemTraceStore: NDJSON append-only files per entity, suitable\n *     for long-running CI jobs; rolled over at 32MB\n *\n * Downstream adapters (DuckDB, Langfuse, R2 parquet) implement this same\n * interface — the rest of the framework is storage-agnostic.\n */\n\nimport type {\n  Artifact,\n  BudgetLedgerEntry,\n  EventKind,\n  Run,\n  RunStatus,\n  Span,\n  SpanKind,\n  TraceEvent,\n} from './schema'\n\nexport interface RunFilter {\n  scenarioId?: string\n  variantId?: string\n  status?: RunStatus\n  since?: number\n  until?: number\n  tag?: { key: string; value: string }\n  parentRunId?: string\n  projectId?: string\n  chatId?: string\n  layer?: import('./schema').RunLayer\n}\n\nexport interface SpanFilter {\n  runId?: string\n  parentSpanId?: string\n  kind?: SpanKind\n  name?: string\n  toolName?: string\n  judgeId?: string\n  since?: number\n  until?: number\n}\n\nexport interface EventFilter {\n  runId?: string\n  spanId?: string\n  kind?: EventKind\n  since?: number\n  until?: number\n}\n\nexport interface TraceStore {\n  appendRun(run: Run): Promise<void>\n  updateRun(runId: string, patch: Partial<Run>): Promise<void>\n  appendSpan(span: Span): Promise<void>\n  updateSpan(spanId: string, patch: Partial<Span>): Promise<void>\n  appendEvent(event: TraceEvent): Promise<void>\n  appendArtifact(artifact: Artifact): Promise<void>\n  appendBudgetEntry(entry: BudgetLedgerEntry): Promise<void>\n\n  getRun(runId: string): Promise<Run | undefined>\n  listRuns(filter?: RunFilter): Promise<Run[]>\n  spans(filter?: SpanFilter): Promise<Span[]>\n  events(filter?: EventFilter): Promise<TraceEvent[]>\n  budget(runId: string): Promise<BudgetLedgerEntry[]>\n  artifacts(runId: string): Promise<Artifact[]>\n}\n\n// ── In-memory ────────────────────────────────────────────────────────\n\nexport class InMemoryTraceStore implements TraceStore {\n  private runs = new Map<string, Run>()\n  private allSpans: Span[] = []\n  private allEvents: TraceEvent[] = []\n  private allArtifacts: Artifact[] = []\n  private allBudget: BudgetLedgerEntry[] = []\n\n  async appendRun(run: Run): Promise<void> {\n    if (this.runs.has(run.runId)) throw new Error(`run ${run.runId} already exists`)\n    this.runs.set(run.runId, { ...run })\n  }\n\n  async updateRun(runId: string, patch: Partial<Run>): Promise<void> {\n    const existing = this.runs.get(runId)\n    if (!existing) throw new Error(`run ${runId} not found`)\n    this.runs.set(runId, { ...existing, ...patch })\n  }\n\n  async appendSpan(span: Span): Promise<void> {\n    this.allSpans.push({ ...span })\n  }\n\n  async updateSpan(spanId: string, patch: Partial<Span>): Promise<void> {\n    const idx = this.allSpans.findIndex((s) => s.spanId === spanId)\n    if (idx < 0) throw new Error(`span ${spanId} not found`)\n    this.allSpans[idx] = { ...this.allSpans[idx], ...patch } as Span\n  }\n\n  async appendEvent(event: TraceEvent): Promise<void> {\n    this.allEvents.push({ ...event })\n  }\n\n  async appendArtifact(artifact: Artifact): Promise<void> {\n    this.allArtifacts.push({ ...artifact })\n  }\n\n  async appendBudgetEntry(entry: BudgetLedgerEntry): Promise<void> {\n    this.allBudget.push({ ...entry })\n  }\n\n  async getRun(runId: string): Promise<Run | undefined> {\n    const r = this.runs.get(runId)\n    return r ? { ...r } : undefined\n  }\n\n  async listRuns(filter: RunFilter = {}): Promise<Run[]> {\n    return [...this.runs.values()].filter((r) => matchesRun(r, filter))\n  }\n\n  async spans(filter: SpanFilter = {}): Promise<Span[]> {\n    return this.allSpans.filter((s) => matchesSpan(s, filter)).map((s) => ({ ...s }))\n  }\n\n  async events(filter: EventFilter = {}): Promise<TraceEvent[]> {\n    return this.allEvents.filter((e) => matchesEvent(e, filter)).map((e) => ({ ...e }))\n  }\n\n  async budget(runId: string): Promise<BudgetLedgerEntry[]> {\n    return this.allBudget.filter((b) => b.runId === runId).map((b) => ({ ...b }))\n  }\n\n  async artifacts(runId: string): Promise<Artifact[]> {\n    return this.allArtifacts.filter((a) => a.runId === runId).map((a) => ({ ...a }))\n  }\n}\n\nfunction matchesRun(r: Run, f: RunFilter): boolean {\n  if (f.scenarioId && r.scenarioId !== f.scenarioId) return false\n  if (f.variantId && r.variantId !== f.variantId) return false\n  if (f.status && r.status !== f.status) return false\n  if (f.since !== undefined && r.startedAt < f.since) return false\n  if (f.until !== undefined && r.startedAt > f.until) return false\n  if (f.tag && r.tags?.[f.tag.key] !== f.tag.value) return false\n  if (f.parentRunId && r.parentRunId !== f.parentRunId) return false\n  if (f.projectId && r.projectId !== f.projectId) return false\n  if (f.chatId && r.chatId !== f.chatId) return false\n  if (f.layer && r.layer !== f.layer) return false\n  return true\n}\n\nfunction matchesSpan(s: Span, f: SpanFilter): boolean {\n  if (f.runId && s.runId !== f.runId) return false\n  if (f.parentSpanId && s.parentSpanId !== f.parentSpanId) return false\n  if (f.kind && s.kind !== f.kind) return false\n  if (f.name && s.name !== f.name) return false\n  if (f.toolName && (s.kind !== 'tool' || s.toolName !== f.toolName)) return false\n  if (f.judgeId && (s.kind !== 'judge' || s.judgeId !== f.judgeId)) return false\n  if (f.since !== undefined && s.startedAt < f.since) return false\n  if (f.until !== undefined && s.startedAt > f.until) return false\n  return true\n}\n\nfunction matchesEvent(e: TraceEvent, f: EventFilter): boolean {\n  if (f.runId && e.runId !== f.runId) return false\n  if (f.spanId && e.spanId !== f.spanId) return false\n  if (f.kind && e.kind !== f.kind) return false\n  if (f.since !== undefined && e.timestamp < f.since) return false\n  if (f.until !== undefined && e.timestamp > f.until) return false\n  return true\n}\n\n// ── Filesystem (NDJSON append-only, one file per entity) ─────────────\n\nexport interface FileSystemTraceStoreOptions {\n  dir: string\n  /** Roll over NDJSON files when they exceed this size in bytes. Default 32 MB. */\n  maxBytes?: number\n}\n\nexport class FileSystemTraceStore implements TraceStore {\n  private dir: string\n  private maxBytes: number\n  /** Lazy in-memory index for queries — populated on first read. */\n  private index?: InMemoryTraceStore\n  /** Memoized index build — concurrent first reads share one build, and an\n   *  append racing an in-flight load awaits this so its row isn't lost. */\n  private indexPromise?: Promise<InMemoryTraceStore>\n  /** Strictly-increasing rollover stamp. Date.now() alone collides when two\n   *  rollovers land in the same millisecond, overwriting a rolled file. */\n  private lastRolloverStamp = 0\n  /**\n   * Per-file append serialization. stat → conditional-rename → appendFile is a\n   * read-modify-write on the active file; without a lock two concurrent appends\n   * to the same `name` can both pass the size check (exceeding maxBytes) or one\n   * can append to a file the other just renamed away. Each entry chains the\n   * next append behind the prior one for that file.\n   */\n  private appendLocks = new Map<string, Promise<void>>()\n\n  constructor(options: FileSystemTraceStoreOptions) {\n    this.dir = options.dir\n    this.maxBytes = options.maxBytes ?? 32 * 1024 * 1024\n  }\n\n  private async ensureDir(): Promise<void> {\n    const fs = await import('node:fs/promises')\n    await fs.mkdir(this.dir, { recursive: true })\n  }\n\n  private async append(name: string, record: unknown): Promise<void> {\n    // If an index load is in flight, wait for it. The row must hit disk AFTER\n    // the load finished reading, so it lands in the completed index via the\n    // mirror below — never lost in the gap before `this.index` is assigned.\n    if (this.indexPromise) await this.indexPromise\n    // Chain this append behind any in-flight append for the same file. The tail\n    // promise never rejects (errors are isolated to each caller's `result`), so\n    // one failed append can't break the lock chain for the next one.\n    const prior = this.appendLocks.get(name) ?? Promise.resolve()\n    const result = prior.then(() => this.appendLocked(name, record))\n    const tail = result.then(\n      () => {},\n      () => {},\n    )\n    this.appendLocks.set(name, tail)\n    try {\n      await result\n    } finally {\n      // Drop the slot once this append is the current tail, so the map doesn't\n      // grow without bound across many appends to the same file.\n      if (this.appendLocks.get(name) === tail) this.appendLocks.delete(name)\n    }\n  }\n\n  private async appendLocked(name: string, record: unknown): Promise<void> {\n    await this.ensureDir()\n    const fs = await import('node:fs/promises')\n    const path = await import('node:path')\n    const active = path.join(this.dir, `${name}.ndjson`)\n    try {\n      const stat = await fs.stat(active)\n      if (stat.size >= this.maxBytes) {\n        // Strictly-increasing, collision-free even within one millisecond — a\n        // bare Date.now() would let two same-ms rollovers overwrite each other.\n        const stamp = Math.max(Date.now(), this.lastRolloverStamp + 1)\n        this.lastRolloverStamp = stamp\n        const rolled = path.join(this.dir, `${name}.${stamp}.ndjson`)\n        await fs.rename(active, rolled)\n      }\n    } catch {\n      /* file doesn't exist yet */\n    }\n    await fs.appendFile(active, `${JSON.stringify(record)}\\n`, 'utf8')\n    // Mirror genuinely-new rows into the lazy index. Update rows (marked\n    // with `_update: true` by updateRun/updateSpan) are applied by those\n    // methods directly via the index's update* APIs — re-inserting them\n    // here triggers a duplicate-id error once the first read populates\n    // the index. Await the mirror: a fire-and-forget would let an index\n    // rejection go unhandled and let disk + index diverge silently.\n    if (this.index && !(record as { _update?: boolean })?._update) {\n      await this.insertInto(name, record)\n    }\n  }\n\n  private async insertInto(name: string, record: unknown): Promise<void> {\n    if (!this.index) return\n    switch (name) {\n      case 'runs':\n        await this.index.appendRun(record as Run)\n        break\n      case 'spans':\n        await this.index.appendSpan(record as Span)\n        break\n      case 'events':\n        await this.index.appendEvent(record as TraceEvent)\n        break\n      case 'artifacts':\n        await this.index.appendArtifact(record as Artifact)\n        break\n      case 'budget':\n        await this.index.appendBudgetEntry(record as BudgetLedgerEntry)\n        break\n    }\n  }\n\n  private load(): Promise<InMemoryTraceStore> {\n    // Memoize: concurrent first reads share one build, and an append racing an\n    // in-flight load awaits this same promise (see append()).\n    this.indexPromise ??= this.buildIndex()\n    return this.indexPromise\n  }\n\n  private async buildIndex(): Promise<InMemoryTraceStore> {\n    const fs = await import('node:fs/promises')\n    const path = await import('node:path')\n    const store = new InMemoryTraceStore()\n    let entries: string[]\n    try {\n      entries = await fs.readdir(this.dir)\n    } catch {\n      // No dir yet (first run / empty corpus). Anything past this point — parse\n      // errors, missing patch bases — is real corruption and must fail loud.\n      this.index = store\n      return store\n    }\n    // Replay files in write order. For one entity, rolled files\n    // (`name.<ts>.ndjson`) are older than the active bare file (`name.ndjson`),\n    // and readdir order is not chronological — so without this sort a patch in\n    // an older rolled file could be applied AFTER (overwrite) a newer patch in\n    // the active file, silently restoring a stale field. Sort: per entity,\n    // rolled ascending by timestamp, then the bare active file last.\n    entries.sort((a, b) => {\n      // Group by the same entity base the loop uses (`split('.')[0]`); within an\n      // entity, real rollover files (`<base>.<ms>.ndjson`) sort by timestamp\n      // ascending and the bare active file (no numeric segment) sorts last.\n      // Non-rollover names tie (Infinity) and a stable sort preserves their\n      // readdir order.\n      const baseA = a.split('.')[0]!\n      const baseB = b.split('.')[0]!\n      if (baseA !== baseB) return baseA < baseB ? -1 : 1\n      const ta = a.match(/^[^.]+\\.(\\d+)\\.ndjson$/)\n      const tb = b.match(/^[^.]+\\.(\\d+)\\.ndjson$/)\n      const tsA = ta ? Number(ta[1]) : Number.POSITIVE_INFINITY\n      const tsB = tb ? Number(tb[1]) : Number.POSITIVE_INFINITY\n      return tsA - tsB\n    })\n    {\n      // Two-pass load. Pass 1 indexes all full (base) rows; pass 2 replays the\n      // `_update` patch rows that updateRun/updateSpan append. readdir order is\n      // not deterministic and rollover splits a stream across files, so a patch\n      // can be read before its base. Applying patches in a separate pass — after\n      // every base row is indexed — means a patch always finds its target.\n      // Doing it in one pass let a patch hit the catch and append a runId-less\n      // fragment, corrupting span/run counts cross-instance.\n      const runUpdates: Array<Record<string, unknown>> = []\n      const spanUpdates: Array<Record<string, unknown>> = []\n      for (const file of entries) {\n        if (!file.endsWith('.ndjson')) continue\n        const full = path.join(this.dir, file)\n        const content = await fs.readFile(full, 'utf8')\n        const base = file.split('.')[0]\n        const lines = content.split('\\n')\n        for (let ln = 0; ln < lines.length; ln++) {\n          const line = lines[ln]!\n          if (!line.trim()) continue\n          let record: ReturnType<typeof JSON.parse>\n          try {\n            record = JSON.parse(line)\n          } catch (err) {\n            // Fail loud WITH context — a bare SyntaxError loses which file/line\n            // is corrupt and which valid rows surround it.\n            throw new Error(\n              `FileSystemTraceStore: corrupt NDJSON in ${file} line ${ln + 1}: ${\n                err instanceof Error ? err.message : String(err)\n              } — ${line.slice(0, 120)}`,\n            )\n          }\n          if (base === 'runs') {\n            if (record?._update) {\n              runUpdates.push(record)\n              continue\n            }\n            // A duplicate full row (same dir loaded twice into one stream) is\n            // collapsed last-write-wins rather than thrown.\n            try {\n              await store.appendRun(record)\n            } catch {\n              await store.updateRun(record.runId, record)\n            }\n          } else if (base === 'spans') {\n            // `updateSpan` appends an `_update: true` patch row instead of\n            // rewriting the original span. Deferred to pass 2 so it collapses\n            // onto the original span — otherwise a fresh FileSystemTraceStore\n            // reading the same dir reports duplicate spans (one full, one\n            // fragment with no runId/kind/name), which breaks any downstream\n            // consumer that re-opens the store cross-process (e.g. the OTLP\n            // converter).\n            if (record?._update) {\n              spanUpdates.push(record)\n              continue\n            }\n            await store.appendSpan(record)\n          } else if (base === 'events') {\n            await store.appendEvent(record)\n          } else if (base === 'artifacts') {\n            await store.appendArtifact(record)\n          } else if (base === 'budget') {\n            await store.appendBudgetEntry(record)\n          }\n        }\n      }\n      // Pass 2: every base row is now indexed. A patch whose base is genuinely\n      // absent (truncated/partial corpus) throws inside update* — we let it\n      // propagate rather than silently appending a fragment, so a corrupt\n      // corpus fails loud instead of polluting counts.\n      for (const record of runUpdates) {\n        await store.updateRun(record.runId as string, record as Partial<Run>)\n      }\n      for (const record of spanUpdates) {\n        await store.updateSpan(record.spanId as string, record as Partial<Span>)\n      }\n    }\n    this.index = store\n    return store\n  }\n\n  async appendRun(run: Run): Promise<void> {\n    await this.append('runs', run)\n  }\n  async updateRun(runId: string, patch: Partial<Run>): Promise<void> {\n    // NDJSON is append-only; record updates as new rows with the same runId —\n    // readers collapse by last-write-wins on load.\n    await this.append('runs', { runId, ...patch, _update: true })\n    if (this.index) await this.index.updateRun(runId, patch)\n  }\n  async appendSpan(span: Span): Promise<void> {\n    await this.append('spans', span)\n  }\n  async updateSpan(spanId: string, patch: Partial<Span>): Promise<void> {\n    await this.append('spans', { spanId, ...patch, _update: true })\n    if (this.index) await this.index.updateSpan(spanId, patch)\n  }\n  async appendEvent(event: TraceEvent): Promise<void> {\n    await this.append('events', event)\n  }\n  async appendArtifact(artifact: Artifact): Promise<void> {\n    await this.append('artifacts', artifact)\n  }\n  async appendBudgetEntry(entry: BudgetLedgerEntry): Promise<void> {\n    await this.append('budget', entry)\n  }\n\n  async getRun(runId: string): Promise<Run | undefined> {\n    return (await this.load()).getRun(runId)\n  }\n  async listRuns(filter?: RunFilter): Promise<Run[]> {\n    return (await this.load()).listRuns(filter)\n  }\n  async spans(filter?: SpanFilter): Promise<Span[]> {\n    return (await this.load()).spans(filter)\n  }\n  async events(filter?: EventFilter): Promise<TraceEvent[]> {\n    return (await this.load()).events(filter)\n  }\n  async budget(runId: string): Promise<BudgetLedgerEntry[]> {\n    return (await this.load()).budget(runId)\n  }\n  async artifacts(runId: string): Promise<Artifact[]> {\n    return (await this.load()).artifacts(runId)\n  }\n}\n"],"mappings":";AA0EA,IAAa,qBAAb,MAAsD;CACpD,uBAAe,IAAI,IAAiB;CACpC,WAA2B,CAAC;CAC5B,YAAkC,CAAC;CACnC,eAAmC,CAAC;CACpC,YAAyC,CAAC;CAE1C,MAAM,UAAU,KAAyB;EACvC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,GAAG,MAAM,IAAI,MAAM,OAAO,IAAI,MAAM,gBAAgB;EAC/E,KAAK,KAAK,IAAI,IAAI,OAAO,EAAE,GAAG,IAAI,CAAC;CACrC;CAEA,MAAM,UAAU,OAAe,OAAoC;EACjE,MAAM,WAAW,KAAK,KAAK,IAAI,KAAK;EACpC,IAAI,CAAC,UAAU,MAAM,IAAI,MAAM,OAAO,MAAM,WAAW;EACvD,KAAK,KAAK,IAAI,OAAO;GAAE,GAAG;GAAU,GAAG;EAAM,CAAC;CAChD;CAEA,MAAM,WAAW,MAA2B;EAC1C,KAAK,SAAS,KAAK,EAAE,GAAG,KAAK,CAAC;CAChC;CAEA,MAAM,WAAW,QAAgB,OAAqC;EACpE,MAAM,MAAM,KAAK,SAAS,WAAW,MAAM,EAAE,WAAW,MAAM;EAC9D,IAAI,MAAM,GAAG,MAAM,IAAI,MAAM,QAAQ,OAAO,WAAW;EACvD,KAAK,SAAS,OAAO;GAAE,GAAG,KAAK,SAAS;GAAM,GAAG;EAAM;CACzD;CAEA,MAAM,YAAY,OAAkC;EAClD,KAAK,UAAU,KAAK,EAAE,GAAG,MAAM,CAAC;CAClC;CAEA,MAAM,eAAe,UAAmC;EACtD,KAAK,aAAa,KAAK,EAAE,GAAG,SAAS,CAAC;CACxC;CAEA,MAAM,kBAAkB,OAAyC;EAC/D,KAAK,UAAU,KAAK,EAAE,GAAG,MAAM,CAAC;CAClC;CAEA,MAAM,OAAO,OAAyC;EACpD,MAAM,IAAI,KAAK,KAAK,IAAI,KAAK;EAC7B,OAAO,IAAI,EAAE,GAAG,EAAE,IAAI,KAAA;CACxB;CAEA,MAAM,SAAS,SAAoB,CAAC,GAAmB;EACrD,OAAO,CAAC,GAAG,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,QAAQ,MAAM,WAAW,GAAG,MAAM,CAAC;CACpE;CAEA,MAAM,MAAM,SAAqB,CAAC,GAAoB;EACpD,OAAO,KAAK,SAAS,QAAQ,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE;CAClF;CAEA,MAAM,OAAO,SAAsB,CAAC,GAA0B;EAC5D,OAAO,KAAK,UAAU,QAAQ,MAAM,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE;CACpF;CAEA,MAAM,OAAO,OAA6C;EACxD,OAAO,KAAK,UAAU,QAAQ,MAAM,EAAE,UAAU,KAAK,CAAC,CAAC,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE;CAC9E;CAEA,MAAM,UAAU,OAAoC;EAClD,OAAO,KAAK,aAAa,QAAQ,MAAM,EAAE,UAAU,KAAK,CAAC,CAAC,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE;CACjF;AACF;AAEA,SAAS,WAAW,GAAQ,GAAuB;CACjD,IAAI,EAAE,cAAc,EAAE,eAAe,EAAE,YAAY,OAAO;CAC1D,IAAI,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,OAAO;CACvD,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,OAAO;CAC9C,IAAI,EAAE,UAAU,KAAA,KAAa,EAAE,YAAY,EAAE,OAAO,OAAO;CAC3D,IAAI,EAAE,UAAU,KAAA,KAAa,EAAE,YAAY,EAAE,OAAO,OAAO;CAC3D,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,SAAS,EAAE,IAAI,OAAO,OAAO;CACzD,IAAI,EAAE,eAAe,EAAE,gBAAgB,EAAE,aAAa,OAAO;CAC7D,IAAI,EAAE,aAAa,EAAE,cAAc,EAAE,WAAW,OAAO;CACvD,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,OAAO;CAC9C,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,OAAO;CAC3C,OAAO;AACT;AAEA,SAAS,YAAY,GAAS,GAAwB;CACpD,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,OAAO;CAC3C,IAAI,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,cAAc,OAAO;CAChE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,OAAO;CACxC,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,OAAO;CACxC,IAAI,EAAE,aAAa,EAAE,SAAS,UAAU,EAAE,aAAa,EAAE,WAAW,OAAO;CAC3E,IAAI,EAAE,YAAY,EAAE,SAAS,WAAW,EAAE,YAAY,EAAE,UAAU,OAAO;CACzE,IAAI,EAAE,UAAU,KAAA,KAAa,EAAE,YAAY,EAAE,OAAO,OAAO;CAC3D,IAAI,EAAE,UAAU,KAAA,KAAa,EAAE,YAAY,EAAE,OAAO,OAAO;CAC3D,OAAO;AACT;AAEA,SAAS,aAAa,GAAe,GAAyB;CAC5D,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,OAAO;CAC3C,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,OAAO;CAC9C,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,OAAO;CACxC,IAAI,EAAE,UAAU,KAAA,KAAa,EAAE,YAAY,EAAE,OAAO,OAAO;CAC3D,IAAI,EAAE,UAAU,KAAA,KAAa,EAAE,YAAY,EAAE,OAAO,OAAO;CAC3D,OAAO;AACT;AAUA,IAAa,uBAAb,MAAwD;CACtD;CACA;;CAEA;;;CAGA;;;CAGA,oBAA4B;;;;;;;;CAQ5B,8BAAsB,IAAI,IAA2B;CAErD,YAAY,SAAsC;EAChD,KAAK,MAAM,QAAQ;EACnB,KAAK,WAAW,QAAQ,YAAY,KAAK,OAAO;CAClD;CAEA,MAAc,YAA2B;EAEvC,OAAM,MADW,OAAO,oBAAA,CACf,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;CAC9C;CAEA,MAAc,OAAO,MAAc,QAAgC;EAIjE,IAAI,KAAK,cAAc,MAAM,KAAK;EAKlC,MAAM,UADQ,KAAK,YAAY,IAAI,IAAI,KAAK,QAAQ,QAAQ,EAAA,CACvC,WAAW,KAAK,aAAa,MAAM,MAAM,CAAC;EAC/D,MAAM,OAAO,OAAO,WACZ,CAAC,SACD,CAAC,CACT;EACA,KAAK,YAAY,IAAI,MAAM,IAAI;EAC/B,IAAI;GACF,MAAM;EACR,UAAU;GAGR,IAAI,KAAK,YAAY,IAAI,IAAI,MAAM,MAAM,KAAK,YAAY,OAAO,IAAI;EACvE;CACF;CAEA,MAAc,aAAa,MAAc,QAAgC;EACvE,MAAM,KAAK,UAAU;EACrB,MAAM,KAAK,MAAM,OAAO;EACxB,MAAM,OAAO,MAAM,OAAO;EAC1B,MAAM,SAAS,KAAK,KAAK,KAAK,KAAK,GAAG,KAAK,QAAQ;EACnD,IAAI;GAEF,KAAI,MADe,GAAG,KAAK,MAAM,EAAA,CACxB,QAAQ,KAAK,UAAU;IAG9B,MAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,oBAAoB,CAAC;IAC7D,KAAK,oBAAoB;IACzB,MAAM,SAAS,KAAK,KAAK,KAAK,KAAK,GAAG,KAAK,GAAG,MAAM,QAAQ;IAC5D,MAAM,GAAG,OAAO,QAAQ,MAAM;GAChC;EACF,QAAQ,CAER;EACA,MAAM,GAAG,WAAW,QAAQ,GAAG,KAAK,UAAU,MAAM,EAAE,KAAK,MAAM;EAOjE,IAAI,KAAK,SAAS,CAAE,QAAkC,SACpD,MAAM,KAAK,WAAW,MAAM,MAAM;CAEtC;CAEA,MAAc,WAAW,MAAc,QAAgC;EACrE,IAAI,CAAC,KAAK,OAAO;EACjB,QAAQ,MAAR;GACE,KAAK;IACH,MAAM,KAAK,MAAM,UAAU,MAAa;IACxC;GACF,KAAK;IACH,MAAM,KAAK,MAAM,WAAW,MAAc;IAC1C;GACF,KAAK;IACH,MAAM,KAAK,MAAM,YAAY,MAAoB;IACjD;GACF,KAAK;IACH,MAAM,KAAK,MAAM,eAAe,MAAkB;IAClD;GACF,KAAK;IACH,MAAM,KAAK,MAAM,kBAAkB,MAA2B;IAC9D;EACJ;CACF;CAEA,OAA4C;EAG1C,KAAK,iBAAiB,KAAK,WAAW;EACtC,OAAO,KAAK;CACd;CAEA,MAAc,aAA0C;EACtD,MAAM,KAAK,MAAM,OAAO;EACxB,MAAM,OAAO,MAAM,OAAO;EAC1B,MAAM,QAAQ,IAAI,mBAAmB;EACrC,IAAI;EACJ,IAAI;GACF,UAAU,MAAM,GAAG,QAAQ,KAAK,GAAG;EACrC,QAAQ;GAGN,KAAK,QAAQ;GACb,OAAO;EACT;EAOA,QAAQ,MAAM,GAAG,MAAM;GAMrB,MAAM,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC;GAC3B,MAAM,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC;GAC3B,IAAI,UAAU,OAAO,OAAO,QAAQ,QAAQ,KAAK;GACjD,MAAM,KAAK,EAAE,MAAM,wBAAwB;GAC3C,MAAM,KAAK,EAAE,MAAM,wBAAwB;GAG3C,QAFY,KAAK,OAAO,GAAG,EAAE,IAAI,OAAO,sBAC5B,KAAK,OAAO,GAAG,EAAE,IAAI,OAAO;EAE1C,CAAC;EACD;GAQE,MAAM,aAA6C,CAAC;GACpD,MAAM,cAA8C,CAAC;GACrD,KAAK,MAAM,QAAQ,SAAS;IAC1B,IAAI,CAAC,KAAK,SAAS,SAAS,GAAG;IAC/B,MAAM,OAAO,KAAK,KAAK,KAAK,KAAK,IAAI;IACrC,MAAM,UAAU,MAAM,GAAG,SAAS,MAAM,MAAM;IAC9C,MAAM,OAAO,KAAK,MAAM,GAAG,CAAC,CAAC;IAC7B,MAAM,QAAQ,QAAQ,MAAM,IAAI;IAChC,KAAK,IAAI,KAAK,GAAG,KAAK,MAAM,QAAQ,MAAM;KACxC,MAAM,OAAO,MAAM;KACnB,IAAI,CAAC,KAAK,KAAK,GAAG;KAClB,IAAI;KACJ,IAAI;MACF,SAAS,KAAK,MAAM,IAAI;KAC1B,SAAS,KAAK;MAGZ,MAAM,IAAI,MACR,2CAA2C,KAAK,QAAQ,KAAK,EAAE,IAC7D,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,EAChD,KAAK,KAAK,MAAM,GAAG,GAAG,GACzB;KACF;KACA,IAAI,SAAS,QAAQ;MACnB,IAAI,QAAQ,SAAS;OACnB,WAAW,KAAK,MAAM;OACtB;MACF;MAGA,IAAI;OACF,MAAM,MAAM,UAAU,MAAM;MAC9B,QAAQ;OACN,MAAM,MAAM,UAAU,OAAO,OAAO,MAAM;MAC5C;KACF,OAAO,IAAI,SAAS,SAAS;MAQ3B,IAAI,QAAQ,SAAS;OACnB,YAAY,KAAK,MAAM;OACvB;MACF;MACA,MAAM,MAAM,WAAW,MAAM;KAC/B,OAAO,IAAI,SAAS,UAClB,MAAM,MAAM,YAAY,MAAM;UACzB,IAAI,SAAS,aAClB,MAAM,MAAM,eAAe,MAAM;UAC5B,IAAI,SAAS,UAClB,MAAM,MAAM,kBAAkB,MAAM;IAExC;GACF;GAKA,KAAK,MAAM,UAAU,YACnB,MAAM,MAAM,UAAU,OAAO,OAAiB,MAAsB;GAEtE,KAAK,MAAM,UAAU,aACnB,MAAM,MAAM,WAAW,OAAO,QAAkB,MAAuB;EAE3E;EACA,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,MAAM,UAAU,KAAyB;EACvC,MAAM,KAAK,OAAO,QAAQ,GAAG;CAC/B;CACA,MAAM,UAAU,OAAe,OAAoC;EAGjE,MAAM,KAAK,OAAO,QAAQ;GAAE;GAAO,GAAG;GAAO,SAAS;EAAK,CAAC;EAC5D,IAAI,KAAK,OAAO,MAAM,KAAK,MAAM,UAAU,OAAO,KAAK;CACzD;CACA,MAAM,WAAW,MAA2B;EAC1C,MAAM,KAAK,OAAO,SAAS,IAAI;CACjC;CACA,MAAM,WAAW,QAAgB,OAAqC;EACpE,MAAM,KAAK,OAAO,SAAS;GAAE;GAAQ,GAAG;GAAO,SAAS;EAAK,CAAC;EAC9D,IAAI,KAAK,OAAO,MAAM,KAAK,MAAM,WAAW,QAAQ,KAAK;CAC3D;CACA,MAAM,YAAY,OAAkC;EAClD,MAAM,KAAK,OAAO,UAAU,KAAK;CACnC;CACA,MAAM,eAAe,UAAmC;EACtD,MAAM,KAAK,OAAO,aAAa,QAAQ;CACzC;CACA,MAAM,kBAAkB,OAAyC;EAC/D,MAAM,KAAK,OAAO,UAAU,KAAK;CACnC;CAEA,MAAM,OAAO,OAAyC;EACpD,QAAQ,MAAM,KAAK,KAAK,EAAA,CAAG,OAAO,KAAK;CACzC;CACA,MAAM,SAAS,QAAoC;EACjD,QAAQ,MAAM,KAAK,KAAK,EAAA,CAAG,SAAS,MAAM;CAC5C;CACA,MAAM,MAAM,QAAsC;EAChD,QAAQ,MAAM,KAAK,KAAK,EAAA,CAAG,MAAM,MAAM;CACzC;CACA,MAAM,OAAO,QAA6C;EACxD,QAAQ,MAAM,KAAK,KAAK,EAAA,CAAG,OAAO,MAAM;CAC1C;CACA,MAAM,OAAO,OAA6C;EACxD,QAAQ,MAAM,KAAK,KAAK,EAAA,CAAG,OAAO,KAAK;CACzC;CACA,MAAM,UAAU,OAAoC;EAClD,QAAQ,MAAM,KAAK,KAAK,EAAA,CAAG,UAAU,KAAK;CAC5C;AACF"}

package/dist/{summary-report-B0cAyA7N.d.ts → summary-report-DuUS_i7W.d.ts}

@@ -1,117 +1,6 @@
 import { a as RunRecord } from "./run-record-DdSa93_W.js";
-import { y as PairedBootstrapResult } from "./statistics-C-dm-J6H.js";
+import { r as PairedDecisionStatistic } from "./paired-promotion-decision-B6zJ3gYM.js";
 import { n as FailureClusterReport } from "./failure-cluster-CqcvCcdR.js";
-//#region src/paired-promotion-decision.d.ts
-/** Which paired estimator produced the deciding interval. */
-type PairedDecisionStatistic = 'paired_risk_difference' | 'mean_bootstrap' | 'median_bootstrap';
-/** Which test carried the decision, given the estimator and the sample size. */
-type PairedDecisionMethod = 'score-interval' | 'bootstrap-ci' | 'exact-sign';
-/** McNemar's exact paired-binary evidence, on the two-point path only. */
-interface PairedMcNemarEvidence {
-  /** Discordant pairs the treatment won. */
-  b: number;
-  /** Discordant pairs the control won. */
-  c: number;
-  /** b + c — the only pairs carrying information. */
-  nDiscordant: number;
-  /** Two-sided exact p-value. */
-  pValue: number;
-}
-interface PairedPromotionDecisionOptions {
-  /** Smallest candidate-minus-baseline delta that counts as improvement, in the
-   *  caller's native units. May be negative (a noninferiority margin). Default 0. */
-  threshold?: number;
-  /** Confidence level. Default 0.95. */
-  confidence?: number;
-  /** Bootstrap resamples, on the paths where a bootstrap decides. Default 2000. */
-  resamples?: number;
-  /** Deterministic bootstrap seed. Omitted ⇒ derived from the deltas. */
-  seed?: number;
-  /** Caller-required paired observations. The exact test may impose a higher
-   *  minimum; the effective one is reported as `minimumPairs`. */
-  minPairs?: number;
-  /**
-   * `'mean'` (default) routes by SHAPE: a two-point (pass/fail) outcome on any
-   * encoding decides on the score interval, everything else on the mean
-   * bootstrap. `'median'` forces the median bootstrap on every input, including
-   * shapes where it is structurally blind — kept for callers who want outlier
-   * robustness on genuinely continuous outcomes and accept that cost.
-   */
-  statistic?: 'mean' | 'median';
-}
-interface PairedPromotionDecision {
-  /** Paired observations supplied. */
-  n: number;
-  /** Threshold the interval was judged against, native units. */
-  threshold: number;
-  confidence: number;
-  statistic: PairedDecisionStatistic;
-  method: PairedDecisionMethod;
-  /** Common positive level of a two-point outcome ({0,1} ⇒ 1, {0,100} ⇒ 100),
-   *  or null when the outcome is not two-point. Non-null is exactly the
-   *  condition for the `paired_risk_difference` path, and it is the factor
-   *  `delta` / `low` / `high` were rescaled by. */
-  binaryScale: number | null;
-  /** Exact-tie fraction over the paired deltas; null when there are no pairs. */
-  tieFraction: number | null;
-  /** Point estimate of the DECIDING statistic, in the caller's native units. */
-  delta: number;
-  /** Lower bound of the DECIDING interval, native units. */
-  low: number;
-  /** Upper bound of the DECIDING interval, native units. */
-  high: number;
-  /** The bootstrap that decided, or null when the score interval did. Callers
-   *  that need a bootstrap as a diagnostic on the two-point path compute their
-   *  own — it is not computed here, so the binary path costs no resamples. */
-  bootstrap: PairedBootstrapResult | null;
-  /** McNemar's exact evidence, or null off the two-point path. */
-  mcnemar: PairedMcNemarEvidence | null;
-  /** Exact one-sided sign-test p-value on the small-sample bootstrap path;
-   *  null otherwise. */
-  pValue: number | null;
-  /** Effective observation minimum after accounting for confidence. */
-  minimumPairs: number;
-  /** n >= minimumPairs. */
-  sufficient: boolean;
-  /** The deciding interval is zero-width or non-finite — no evidence in either
-   *  direction, so it cannot clear any threshold on evidence. */
-  indeterminate: boolean;
-  /** McNemar's exact test refuses at a non-negative threshold. */
-  exactTestVetoes: boolean;
-  /** The deciding interval clears the threshold, ignoring the other two guards. */
-  clearsThreshold: boolean;
-  /** `sufficient && !indeterminate && clearsThreshold && !exactTestVetoes` —
-   *  the whole rule. */
-  promote: boolean;
-  /** What `delta` measures, for a reason string. */
-  label: 'success-rate' | 'mean' | 'median';
-  /** Why a zero-width interval is zero-width; empty when it is not. */
-  indeterminateCause: string;
-  /** Sentence naming the test when the exact sign test decided; else empty. */
-  methodDetail: string;
-}
-/** The shape facts that pick the estimator, without computing an interval. */
-interface PairedDecisionShape {
-  statistic: PairedDecisionStatistic;
-  /** Common positive level of a two-point outcome; null when not two-point. */
-  binaryScale: number | null;
-  /** Exact-tie fraction over the paired deltas; null when there are no pairs. */
-  tieFraction: number | null;
-}
-/**
- * Which estimator {@link decidePairedPromotion} would use on this data, and the
- * shape facts behind it — for callers that must report the shape on a path
- * where no interval is computed at all (an early rejection, or zero pairs).
- * Cheap: no bootstrap, no interval.
- */
-declare function pairedDecisionShape(before: number[], after: number[], statistic?: 'mean' | 'median'): PairedDecisionShape;
-/**
- * Decide whether a paired candidate-minus-baseline delta clears a promotion
- * threshold. `before` is the baseline arm, `after` the candidate arm, paired by
- * position. Throws on unequal lengths.
- */
-declare function decidePairedPromotion(before: number[], after: number[], options?: PairedPromotionDecisionOptions): PairedPromotionDecision;
-//#endregion
 //#region src/held-out-gate.d.ts
 type HeldOutGateRejectionCode = 'few_runs' | 'incomplete_coverage' | 'missing_split_scores' | 'missing_cost' | 'negative_delta' | 'indeterminate_delta' | 'overfit_gap' | 'cost_ceiling';
 /**
@@ -635,5 +524,5 @@ interface ResearchReport {
  */
 declare function researchReport(runs: RunRecord[], opts?: ResearchReportOptions): Promise<ResearchReport>;
 //#endregion
-export { PairedMcNemarEvidence as A, HeldOutGate as C, PairedDecisionMethod as D, SplitCoverage as E, PairedPromotionDecisionOptions as M, decidePairedPromotion as N, PairedDecisionShape as O, pairedDecisionShape as P, GateEvidence as S, HeldOutGateRejectionCode as T, paretoChart as _, ParetoPoint as a, DeltaStatistic as b, ResearchReportCandidate as c, ResearchReportOptions as d, ResearchReportRecommendation as f, gainHistogram as g, SummaryTableRow as h, ParetoFigureSpec as i, PairedPromotionDecision as j, PairedDecisionStatistic as k, ResearchReportDecision as l, SummaryTableOptions as m, GainDistributionFigureSpec as n, RESEARCH_REPORT_HARD_PAIR_FLOOR as o, SummaryTable as p, GainDistributionOptions as r, ResearchReport as s, GainDistributionBin as t, ResearchReportMethodology as u, researchReport as v, HeldOutGateConfig as w, GateDecision as x, summaryTable as y };
-//# sourceMappingURL=summary-report-B0cAyA7N.d.ts.map
+export { HeldOutGate as C, SplitCoverage as E, GateEvidence as S, HeldOutGateRejectionCode as T, paretoChart as _, ParetoPoint as a, DeltaStatistic as b, ResearchReportCandidate as c, ResearchReportOptions as d, ResearchReportRecommendation as f, gainHistogram as g, SummaryTableRow as h, ParetoFigureSpec as i, ResearchReportDecision as l, SummaryTableOptions as m, GainDistributionFigureSpec as n, RESEARCH_REPORT_HARD_PAIR_FLOOR as o, SummaryTable as p, GainDistributionOptions as r, ResearchReport as s, GainDistributionBin as t, ResearchReportMethodology as u, researchReport as v, HeldOutGateConfig as w, GateDecision as x, summaryTable as y };
+//# sourceMappingURL=summary-report-DuUS_i7W.d.ts.map

package/dist/summary-report-DuUS_i7W.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"summary-report-DuUS_i7W.d.ts","names":[],"sources":["../src/held-out-gate.ts","../src/summary-report.ts"],"mappings":";;;;KAwIY;;;;;;;;UAiBK;;EAEf;;;EAGA;;;;EAIA;;EAEA;;EAEA;;;EAGA;;UAGe;;;;EAIf;;;;;EAKA;;;;;;;;;;;EAWA;;;;EAIA;;;EAGA;;EAEA;;EAEA;;;EAGA;;;;;;;;;;;;;;;;;EAiBA;;;;;;;;;;;;;EAaA;;;;KAKU,iBAAiB;UAEZ;;EAEf;;EAEA;;EAEA;;;;;;;;EAQA,iBAAiB;;;;;EAKjB,gBAAgB;;;;;EAKhB;;;;;;;;;EASA,gBAAgB;;;EAGhB;;;EAGA;IAAY;IAAa;;;;EAGzB;;;;;;;EAOA;IAAW;IAAW;IAAW;IAAqB;;;;;;EAKtD;;;;;EAKA;;EAEA;;EAEA;;EAEA;;EAEA;;;;;EAKA;;;EAGA;;;;;;;EAOA;;UAGe;;EAEf;;EAEA;;EAEA;;EAEA,UAAU;;EAEV;;EAEA,eAAe;;;;;;;cAQJ;mBACM;mBACA;mBACA;mBACA;mBACA;mBACA;mBACA;mBACA;mBACA;mBACA;EAEjB,YAAY,QAAQ;;;;EAoCpB,SAAS,WAAW,aAAa,UAAU,cAAc;;;;;;;UA2SjD;;;;UC7oBO;;;EAGf;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;;EAEA;;EAEA;;UAGe;EACf,MAAM;EACN;EACA;;EAEA;;;;;;;iBAQc,aAAa,MAAM,aAAa,OAAM,sBAA2B;UA6IhE;EACf;;EAEA;;EAEA;;EAEA;;;EAGA;;;EAGA;;UAGe;EACf;EACA;EACA,QAAQ;EACR;IAAQ;IAAc;;;;;;;;iBAQR,YACd,MAAM,aACN;EACE;EACA,gBAAgB,eAAe;IAEhC;UAsDc;;EAEf;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA;;EAEA;;EAEA;;EAEA;EACA,MAAM;EACN;EACA;IAAM;IAAa;;;UAGJ;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;;;;;;iBAQc,cACd,MAAM,aACN,qBACA,oBACA,OAAM,0BACL;KA8ES;;;;;;cAYC;UAEI;;EAEf;;EAEA;;EAEA;;EAEA;;EAEA;;;;;;;;;EASA;;;;;;;EAOA;IAAS;IAAa;;;;;;EAKtB;;;;;EAKA;;EAEA,gBAAgB,eAAe;;EAE/B,kBAAkB;;EAElB;;EAEA;;EAEA;;;;;;EAMA;;UAGe;EACf,UAAU;EACV;EACA;EACA;EACA;;UAGe;EACf;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IAAU;IAAa;;;;;;;EAMvB;EACA;;;;;;;EAOA;EACA;EACA,OAAO;EACP,UAAU;EACV;;UAGe;;;;;EAKf;;EAEA;;EAEA;;EAEA;;EAEA;;UAGe;EACf;EACA;EACA;EACA;EACA;;;;;;EAMA;EACA;EACA;IAAQ;IAAa;;EACrB;EACA,gBAAgB;EAChB,YAAY;EACZ,SAAS;EACT;IACE,QAAQ;IACR,OAAO;;EAET,aAAa;EACb,kBAAkB;EAClB;EACA;;;;;;;;;;;;;;;;;;;;;iBA6IoB,eACpB,MAAM,aACN,OAAM,wBACL,QAAQ"}

package/dist/{summary-report-9A5y7EsK.js → summary-report-Lf-5I7xh.js}

@@ -1,4 +1,4 @@
-import { h as hashJson, p as canonicalize } from "./agent-profile-cell-CbfBm2g6.js";
+import { r as hashJson, t as canonicalize } from "./pre-registration-DakwTRXk.js";
 import { r as observedSplitScore } from "./reward-nw2xZGZG.js";
 import { D as pairedCohensDz, E as pairedBootstrap, W as wilcoxonSignedRank, d as confidenceInterval, k as pairedMde, s as benjaminiHochberg } from "./statistics-ByxzSiOM.js";
 import { r as pairRunRecords } from "./paired-arms-iZ08VFMN.js";
@@ -864,4 +864,4 @@ function fmt(x) {
 //#endregion
 export { summaryTable as a, researchReport as i, gainHistogram as n, paretoChart as r, RESEARCH_REPORT_HARD_PAIR_FLOOR as t };
 
-//# sourceMappingURL=summary-report-9A5y7EsK.js.map
+//# sourceMappingURL=summary-report-Lf-5I7xh.js.map