@tangle-network/agent-eval 0.216.1 → 0.217.1

package/dist/experiment/index.js

@@ -1,104 +1,22 @@
-import { n as CaptureIntegrityError, s as ValidationError } from "../errors-DVZiqS7K.js";
-import { a as hashCanonical, t as LEDGER_HASH_PATTERN } from "../canonical-B2RqLofv.js";
-import { f as evaluateHypothesis, g as verifyManifest, h as signManifest, m as manifestContentDigest, p as hashJson } from "../agent-profile-cell-BK8mlqlq.js";
-import { t as mulberry32 } from "../random-ByUSnV9w.js";
-import { n as bonferroni, r as holm, t as benjaminiHochberg } from "../multiplicity-DQUFcbW4.js";
-import { a as pairedRiskDifferenceExact, c as wilson, i as pairedRiskDifference, n as mcnemar, o as pairedRiskDifferenceScore } from "../paired-binary-CvpFHfKZ.js";
-import { n as studentTQuantile, t as studentTCdf } from "../student-t-DVPW7CdL.js";
-import { i as pairedBootstrap, n as BOOTSTRAP_GATE_MIN_N } from "../mean-DHoMiudD.js";
-import { a as requiredSampleSize, i as requiredPairedSampleSize, n as mcnemarRequiredN, r as pairedMde, t as mcnemarPower } from "../power-and-mde-Hj2ubb4B.js";
-import { n as pairArms, r as pairRunRecords, t as comparePairedArms } from "../paired-arms-CwMGJsrS.js";
-import { t as eProcess } from "../sequential-eprocess-DM_qENCl.js";
-import { a as heldoutSignificance, o as pairHoldout } from "../statistical-heldout-42NlCNDe.js";
-import { D as FinalEvidenceError, E as FinalEvidenceConflictError, O as openFinalEvidenceLedger, T as powerPreflight, a as verifyEvidenceReceipt, i as isIndependentEvidence, n as EVIDENCE_RECEIPT_VERSION, r as createEvidenceReceipt, t as createCampaignEvidenceReceipt } from "../campaign-evidence-Clrn4hBV.js";
+import { n as CaptureIntegrityError, s as ValidationError } from "../errors-BcOs5MKW.js";
+import { a as hashCanonical, t as LEDGER_HASH_PATTERN } from "../canonical-Dq2hOQ8L.js";
+import { d as signManifest, f as verifyManifest, l as hashJson, u as manifestContentDigest } from "../agent-profile-cell-B1V1gUZs.js";
+import { t as mulberry32 } from "../random-DDDcC7YU.js";
+import { n as pairArms, r as pairRunRecords, t as comparePairedArms } from "../paired-arms-Ct4LTKc1.js";
+import { n as bonferroni, r as holm, t as benjaminiHochberg } from "../multiplicity-Sg0U7h8j.js";
+import { a as pairedRiskDifferenceScore, i as pairedRiskDifferenceExact, r as pairedRiskDifference, s as wilson, t as mcnemar } from "../paired-binary-B_nejA44.js";
+import { c as studentTCdf, i as pairedBootstrap, l as studentTQuantile, n as BOOTSTRAP_GATE_MIN_N } from "../mean-BbA_JCzW.js";
+import { a as requiredSampleSize, i as requiredPairedSampleSize, n as mcnemarRequiredN, r as pairedMde, t as mcnemarPower } from "../power-and-mde-N5nU4_Ly.js";
+import { t as eProcess } from "../sequential-eprocess-DodI6RoF.js";
+import { a as heldoutSignificance, o as pairHoldout } from "../statistical-heldout-Bksv92Th.js";
+import { S as openFinalEvidenceLedger, b as FinalEvidenceConflictError, i as verifyEvidenceReceipt, n as createEvidenceReceipt, r as isIndependentEvidence, t as createCampaignEvidenceReceipt, x as FinalEvidenceError, y as powerPreflight } from "../campaign-evidence-CQYw8_0H.js";
 import { n as evaluatePredicate, r as readField, t as compareValues } from "../predicate-FdKmElA_.js";
-import { r as summarizeEvaluationUnits, t as defineEvaluationClaim } from "../claim-q4HQhK1G.js";
-import { n as pairedEvalueSequence, r as sequentialCrossingHorizon } from "../sequential-CzK5DarL.js";
-import { n as intervalSpecProblems, r as computeEstimand, t as computeInterval } from "../interval-CELpye1n.js";
-import { n as paretoPolicy, r as paretoSignificanceGate, t as buildEvidenceVector } from "../promotion-policy-KO57gbyV.js";
-import { n as sequentialPairedGate, t as sequentialDecide } from "../sequential-Bf_pbE50.js";
+import { r as summarizeEvaluationUnits, t as defineEvaluationClaim } from "../claim-BPVuyHuy.js";
+import { n as pairedEvalueSequence } from "../sequential-BVv1sjsw.js";
+import { n as intervalSpecProblems, r as computeEstimand, t as computeInterval } from "../interval-Dq9gt7jx.js";
+import { n as paretoPolicy, r as paretoSignificanceGate, t as buildEvidenceVector } from "../promotion-policy-6A8osGr_.js";
+import { n as sequentialPairedGate, t as sequentialDecide } from "../sequential-CimQrbjv.js";
 import { z } from "zod";
-//#region src/experiment/ast/budget.ts
-function evaluateHaltRule(halt, gates) {
-	const seen = new Map(gates.map((g) => [g.id, g]));
-	const missing = halt.when.gates.filter((id) => !seen.has(id));
-	if (missing.length > 0) throw new ValidationError(`evaluateHaltRule: halt references gates that were not evaluated: [${missing.join(", ")}]`);
-	const failed = halt.when.gates.filter((id) => !seen.get(id).passed);
-	return failed.length > 0 ? {
-		fired: true,
-		action: halt.action,
-		failedGates: failed
-	} : {
-		fired: false,
-		action: null,
-		failedGates: []
-	};
-}
-/**
-* Execute the uniform-pass schedule against measured pass costs. Pass 1 always
-* runs; each later pass runs only when the cumulative spend plus the last
-* measured pass cost stays at or under the registered ceiling. The registered
-* ledger is the pre-spend the ceiling counts.
-*/
-function runUniformPassBudget(rule, measuredPassCosts) {
-	let cumulative = rule.ledger.reduce((sum, entry) => sum + entry.usd, 0);
-	const decisions = [];
-	let uniformN = 0;
-	for (let pass = 1; pass <= rule.maxPasses; pass++) {
-		if (pass === 1) {
-			if (measuredPassCosts[0] === void 0) break;
-			cumulative += measuredPassCosts[0];
-			uniformN = 1;
-			continue;
-		}
-		const projected = measuredPassCosts[pass - 2];
-		if (projected === void 0) break;
-		const go = cumulative + projected <= rule.ceilingUsd;
-		decisions.push({
-			pass,
-			cumulativeBefore: cumulative,
-			projected,
-			go
-		});
-		if (!go || measuredPassCosts[pass - 1] === void 0) break;
-		cumulative += measuredPassCosts[pass - 1];
-		uniformN = pass;
-	}
-	return {
-		decisions,
-		uniformN
-	};
-}
-/**
-* Walk the registered n-ladder and pick the first affordable step. When no
-* step fits the ceiling, the rule refuses and reports the projection instead
-* of shrinking the row set — "never subset rows" is the registered invariant.
-*/
-function projectNLadderBudget(rule, measured) {
-	const projections = rule.steps.map((n) => {
-		const projectedUsd = measured.unitCostUsd * measured.rows * n;
-		return {
-			n,
-			projectedUsd,
-			affordable: projectedUsd <= rule.ceilingUsd
-		};
-	});
-	const first = projections.find((p) => p.affordable);
-	if (first) return {
-		chosenN: first.n,
-		projections,
-		refusal: null
-	};
-	return {
-		chosenN: null,
-		projections,
-		refusal: {
-			onExhaust: rule.onExhaust,
-			reason: `no ladder step fits the ${rule.ceilingUsd} USD ceiling at ${measured.rows} rows x ${measured.unitCostUsd} USD per unit`
-		}
-	};
-}
-//#endregion
 //#region src/experiment/ast/decision.ts
 /** A decision rule's branches did not cover the evidence. */
 var DecisionTableNotTotalError = class extends ValidationError {};
@@ -137,67 +55,6 @@ function executeDecisionRule(rule, evidence) {
 	throw new DecisionTableNotTotalError("executeDecisionRule: decision table is not total — no branch matched the evidence");
 }
 //#endregion
-//#region src/experiment/ast/reissue.ts
-/**
-* Classify one rollout event under the registered reissue policy. A carrier
-* event within the issue budget is reissued; a model outcome always stands;
-* a carrier event past `maxIssues` is exhausted and reported, never retried.
-*/
-function classifyReissue(policy, event, issuesSoFar) {
-	if (!policy.carrierEvents.includes(event)) return "stands";
-	return issuesSoFar < policy.maxIssues ? "reissue" : "exhausted";
-}
-//#endregion
-//#region src/experiment/ast/selection.ts
-/**
-* Execute a selection rule.
-*
-* Round-robin walks groups in lexicographic order and takes ids in
-* within-group order until `take` ids are chosen. Filter-of keeps the ids of
-* `bases[rule.base]` whose record satisfies the predicate, in the registered
-* order. Ids absent from `records` are evaluated on their id alone (fields
-* derived from the id via `idFields`), so a sealed base outlives its source
-* records.
-*/
-function runSelectionRule(rule, records, options) {
-	if (rule.kind === "round-robin") {
-		const allowed = new Set(rule.reads);
-		for (const field of [rule.groupBy, rule.withinOrder.field]) if (!allowed.has(field)) throw new ValidationError(`runSelectionRule: round-robin reads '${field}' but its closed read set is [${rule.reads.join(", ")}]`);
-		const byGroup = /* @__PURE__ */ new Map();
-		for (const record of records) {
-			const group = String(readField(record, rule.groupBy));
-			const id = String(readField(record, rule.withinOrder.field));
-			const bucket = byGroup.get(group);
-			if (bucket) bucket.push(id);
-			else byGroup.set(group, [id]);
-		}
-		for (const ids of byGroup.values()) {
-			ids.sort();
-			if (rule.withinOrder.dir === "desc") ids.reverse();
-		}
-		const groups = [...byGroup.keys()].sort();
-		const chosen = [];
-		let cursor = 0;
-		while (chosen.length < rule.take && groups.some((g) => byGroup.get(g).length > 0)) {
-			const group = groups[cursor % groups.length];
-			const ids = byGroup.get(group);
-			if (ids.length > 0) chosen.push(ids.shift());
-			cursor += 1;
-		}
-		return chosen;
-	}
-	const base = options.bases?.[rule.base];
-	if (!base) throw new ValidationError(`runSelectionRule: filter-of base '${rule.base}' was not provided`);
-	const index = new Map(records.map((r) => [String(readField(r, options.idField)), r]));
-	const sorted = [...base.filter((id) => {
-		const record = index.get(id) ?? options.idFields?.(id);
-		if (!record) throw new ValidationError(`runSelectionRule: base id '${id}' has no record and no idFields derivation`);
-		return evaluatePredicate(rule.keep, record);
-	})].sort();
-	if (rule.order.dir === "desc") sorted.reverse();
-	return sorted;
-}
-//#endregion
 //#region src/experiment/ast/validity.ts
 /**
 * Replicate-flip counting over graded states. A state whose replicates split
@@ -355,6 +212,137 @@ function assertMatchedBudgets(rule, arms) {
 	return verdict;
 }
 //#endregion
+//#region src/experiment/ast/budget.ts
+function evaluateHaltRule(halt, gates) {
+	const seen = new Map(gates.map((g) => [g.id, g]));
+	const missing = halt.when.gates.filter((id) => !seen.has(id));
+	if (missing.length > 0) throw new ValidationError(`evaluateHaltRule: halt references gates that were not evaluated: [${missing.join(", ")}]`);
+	const failed = halt.when.gates.filter((id) => !seen.get(id).passed);
+	return failed.length > 0 ? {
+		fired: true,
+		action: halt.action,
+		failedGates: failed
+	} : {
+		fired: false,
+		action: null,
+		failedGates: []
+	};
+}
+/**
+* Execute the uniform-pass schedule against measured pass costs. Pass 1 always
+* runs; each later pass runs only when the cumulative spend plus the last
+* measured pass cost stays at or under the registered ceiling. The registered
+* ledger is the pre-spend the ceiling counts.
+*/
+function runUniformPassBudget(rule, measuredPassCosts) {
+	let cumulative = rule.ledger.reduce((sum, entry) => sum + entry.usd, 0);
+	const decisions = [];
+	let uniformN = 0;
+	for (let pass = 1; pass <= rule.maxPasses; pass++) {
+		if (pass === 1) {
+			if (measuredPassCosts[0] === void 0) break;
+			cumulative += measuredPassCosts[0];
+			uniformN = 1;
+			continue;
+		}
+		const projected = measuredPassCosts[pass - 2];
+		if (projected === void 0) break;
+		const go = cumulative + projected <= rule.ceilingUsd;
+		decisions.push({
+			pass,
+			cumulativeBefore: cumulative,
+			projected,
+			go
+		});
+		if (!go || measuredPassCosts[pass - 1] === void 0) break;
+		cumulative += measuredPassCosts[pass - 1];
+		uniformN = pass;
+	}
+	return {
+		decisions,
+		uniformN
+	};
+}
+/**
+* Walk the registered n-ladder and pick the first affordable step. When no
+* step fits the ceiling, the rule refuses and reports the projection instead
+* of shrinking the row set — "never subset rows" is the registered invariant.
+*/
+function projectNLadderBudget(rule, measured) {
+	const projections = rule.steps.map((n) => {
+		const projectedUsd = measured.unitCostUsd * measured.rows * n;
+		return {
+			n,
+			projectedUsd,
+			affordable: projectedUsd <= rule.ceilingUsd
+		};
+	});
+	const first = projections.find((p) => p.affordable);
+	if (first) return {
+		chosenN: first.n,
+		projections,
+		refusal: null
+	};
+	return {
+		chosenN: null,
+		projections,
+		refusal: {
+			onExhaust: rule.onExhaust,
+			reason: `no ladder step fits the ${rule.ceilingUsd} USD ceiling at ${measured.rows} rows x ${measured.unitCostUsd} USD per unit`
+		}
+	};
+}
+//#endregion
+//#region src/experiment/ast/selection.ts
+/**
+* Execute a selection rule.
+*
+* Round-robin walks groups in lexicographic order and takes ids in
+* within-group order until `take` ids are chosen. Filter-of keeps the ids of
+* `bases[rule.base]` whose record satisfies the predicate, in the registered
+* order. Ids absent from `records` are evaluated on their id alone (fields
+* derived from the id via `idFields`), so a sealed base outlives its source
+* records.
+*/
+function runSelectionRule(rule, records, options) {
+	if (rule.kind === "round-robin") {
+		const allowed = new Set(rule.reads);
+		for (const field of [rule.groupBy, rule.withinOrder.field]) if (!allowed.has(field)) throw new ValidationError(`runSelectionRule: round-robin reads '${field}' but its closed read set is [${rule.reads.join(", ")}]`);
+		const byGroup = /* @__PURE__ */ new Map();
+		for (const record of records) {
+			const group = String(readField(record, rule.groupBy));
+			const id = String(readField(record, rule.withinOrder.field));
+			const bucket = byGroup.get(group);
+			if (bucket) bucket.push(id);
+			else byGroup.set(group, [id]);
+		}
+		for (const ids of byGroup.values()) {
+			ids.sort();
+			if (rule.withinOrder.dir === "desc") ids.reverse();
+		}
+		const groups = [...byGroup.keys()].sort();
+		const chosen = [];
+		let cursor = 0;
+		while (chosen.length < rule.take && groups.some((g) => byGroup.get(g).length > 0)) {
+			const group = groups[cursor % groups.length];
+			const ids = byGroup.get(group);
+			if (ids.length > 0) chosen.push(ids.shift());
+			cursor += 1;
+		}
+		return chosen;
+	}
+	const base = options.bases?.[rule.base];
+	if (!base) throw new ValidationError(`runSelectionRule: filter-of base '${rule.base}' was not provided`);
+	const index = new Map(records.map((r) => [String(readField(r, options.idField)), r]));
+	const sorted = [...base.filter((id) => {
+		const record = index.get(id) ?? options.idFields?.(id);
+		if (!record) throw new ValidationError(`runSelectionRule: base id '${id}' has no record and no idFields derivation`);
+		return evaluatePredicate(rule.keep, record);
+	})].sort();
+	if (rule.order.dir === "desc") sorted.reverse();
+	return sorted;
+}
+//#endregion
 //#region src/experiment/funnel.ts
 /**
 * The denominator chain as a first-class object.
@@ -890,86 +878,6 @@ const evidenceRegistryRecordSchema = z.strictObject({
 	supersedes: z.array(z.string().regex(idPattern)).optional(),
 	notes: z.string().min(1).optional()
 });
-/** Parse one record; throws with the zod issue list on any violation. */
-function parseEvidenceRegistryRecord(raw) {
-	return evidenceRegistryRecordSchema.parse(raw);
-}
-var EvidenceRegistryError = class extends Error {};
-/**
-* Validate a set of records as one registry: every record parses, ids are
-* unique, and every `supersedes` target exists. Returns records sorted in
-* the registry's canonical order (trust ladder, then date desc, then id).
-*/
-function validateEvidenceRegistry(raws) {
-	const records = raws.map((raw) => parseEvidenceRegistryRecord(raw));
-	const seen = /* @__PURE__ */ new Set();
-	for (const record of records) {
-		if (seen.has(record.id)) throw new EvidenceRegistryError(`duplicate evidence record id: ${record.id}`);
-		seen.add(record.id);
-	}
-	for (const record of records) for (const target of record.supersedes ?? []) if (!seen.has(target)) throw new EvidenceRegistryError(`record ${record.id} supersedes unknown record: ${target}`);
-	const stateRank = new Map(EVIDENCE_STATES.map((state, index) => [state, index]));
-	return [...records].sort((a, b) => {
-		const byState = (stateRank.get(a.evidenceState) ?? 0) - (stateRank.get(b.evidenceState) ?? 0);
-		if (byState !== 0) return byState;
-		if (a.date !== b.date) return a.date < b.date ? 1 : -1;
-		return a.id < b.id ? -1 : 1;
-	});
-}
-function mdEscape(text) {
-	return text.replace(/\|/g, "\\|").replace(/\n/g, " ");
-}
-function formatCost(costUsd) {
-	if (costUsd === null) return "not captured";
-	return `$${costUsd.toFixed(2)}`;
-}
-function formatN(n) {
-	const base = `${n.value} ${n.unit}`;
-	return n.detail ? `${base} (${n.detail})` : base;
-}
-/**
-* Render the registry's human index from records. Deterministic: identical
-* records always produce identical output, so a byte diff against the
-* committed index is the freshness check. No clocks, no environment.
-*/
-function renderEvidenceIndex(raws) {
-	const records = validateEvidenceRegistry(raws);
-	const lines = [
-		"# Evidence index",
-		"",
-		"<!-- GENERATED by scripts/render-evidence-index.ts from evidence/records/*.json.",
-		"     Edit the records, run `pnpm run evidence:render`, and commit both.",
-		"     `pnpm run evidence:check` (inside verify:package) fails when this file drifts. -->",
-		"",
-		`${records.length} records. States: ${EVIDENCE_STATES.join(" > ")}.`,
-		"",
-		"| state | date | id | claim | result |",
-		"| --- | --- | --- | --- | --- |"
-	];
-	for (const r of records) lines.push(`| ${r.evidenceState} | ${r.date} | [\`${r.id}\`](#${r.id}) | ${mdEscape(r.claim)} | ${mdEscape(r.result)} |`);
-	for (const r of records) {
-		lines.push("", `## ${r.id}`, "");
-		lines.push(`**${r.evidenceState}** · ${r.date} · ${r.domain} · source repo \`${r.sourceRepo}\``);
-		lines.push("", `**Claim.** ${r.claim}`, "", `**Result.** ${r.result}`, "");
-		lines.push(`- **Instrument**: ${r.instrument}`);
-		lines.push(`- **Command**: ${r.command === null ? "not preserved" : `\`${r.command}\``}`);
-		lines.push(`- **Arms**: ${r.arms.length === 0 ? "single-arm" : r.arms.join(" vs ")}`);
-		lines.push(`- **n**: ${formatN(r.n)}`);
-		lines.push(`- **Cost**: ${formatCost(r.costUsd)}`);
-		if (r.experimentDigest) lines.push(`- **Experiment seal**: \`${r.experimentDigest}\``);
-		lines.push(`- **Artifacts**:`);
-		for (const artifact of r.artifacts) lines.push(`  - ${artifact}`);
-		if (r.confounds.length === 0) lines.push("- **Confounds**: none recorded");
-		else {
-			lines.push("- **Confounds**:");
-			for (const confound of r.confounds) lines.push(`  - ${confound}`);
-		}
-		if (r.supersedes && r.supersedes.length > 0) lines.push(`- **Supersedes**: ${r.supersedes.map((s) => `\`${s}\``).join(", ")}`);
-		if (r.notes) lines.push(`- **Notes**: ${r.notes}`);
-	}
-	lines.push("");
-	return lines.join("\n");
-}
 //#endregion
 //#region src/experiment/power.ts
 /**
@@ -1531,6 +1439,6 @@ function decideRandomizedCanary(sealed, cohort, rows, verifyCohort) {
 	return result;
 }
 //#endregion
-export { BOOTSTRAP_GATE_MIN_N, DesignRefusalError, EVIDENCE_RECEIPT_VERSION, EVIDENCE_STATES, FinalEvidenceConflictError, FinalEvidenceError, FunnelIntegrityError, MatchedBudgetError, SealIntegrityError, amendExperiment, assertDesignAdequate, assertFunnelReconciles, assertMatchedBudgets, benjaminiHochberg, bonferroni, buildEvidenceVector, buildFunnel, classifyReissue, clusteredPower, comparePairedArms, composeFunnels, computeEstimand, computeInterval, createCampaignEvidenceReceipt, createEvidenceReceipt, decideRandomizedCanary, defineEvaluationClaim, defineExperiment, eProcess, evaluateCondition, evaluateHaltRule, evaluateHypothesis, evaluateIdentityGate, evaluateOracleDeterminismGate, evaluatePopulationReproducibilityGate, evaluatePowerFloorGate, evaluatePredicate, evaluateProvenanceGate, evidenceRegistryRecordSchema, executeAdmissionRule, executeDecisionRule, hashJson, heldoutSignificance, holm, isIndependentEvidence, joinProspectiveCanaryReceipts, manifestContentDigest, mcnemar, mcnemarPower, mcnemarRequiredN, mulberry32, openFinalEvidenceLedger, openSealedExperiment, pairArms, pairHoldout, pairRunRecords, pairedBootstrap, pairedEvalueSequence, pairedMde, pairedRiskDifference, pairedRiskDifferenceExact, pairedRiskDifferenceScore, paretoPolicy, paretoSignificanceGate, parseEvidenceRegistryRecord, powerPreflight, projectNLadderBudget, randomizedCanaryObservationDigest, randomizedCanaryRosterDigest, readField, renderEvidenceIndex, renderFunnelTable, requiredPairedSampleSize, requiredSampleSize, runSelectionRule, runUniformPassBudget, sealExperiment, sealRandomizedCanaryRule, sequentialCrossingHorizon, sequentialDecide, sequentialPairedGate, signManifest, summarizeEvaluationUnits, validateEvidenceRegistry, verifyEvidenceReceipt, verifyManifest, verifyMatchedBudgets, verifySealedExperiment, wilson };
+export { BOOTSTRAP_GATE_MIN_N, EVIDENCE_STATES, FinalEvidenceConflictError, FinalEvidenceError, amendExperiment, assertDesignAdequate, assertMatchedBudgets, benjaminiHochberg, bonferroni, buildEvidenceVector, buildFunnel, clusteredPower, comparePairedArms, composeFunnels, computeInterval, createCampaignEvidenceReceipt, createEvidenceReceipt, decideRandomizedCanary, defineEvaluationClaim, defineExperiment, eProcess, evaluateCondition, evaluatePowerFloorGate, evidenceRegistryRecordSchema, executeAdmissionRule, executeDecisionRule, hashJson, heldoutSignificance, holm, isIndependentEvidence, joinProspectiveCanaryReceipts, manifestContentDigest, mcnemar, mcnemarPower, mcnemarRequiredN, mulberry32, openFinalEvidenceLedger, openSealedExperiment, pairArms, pairHoldout, pairRunRecords, pairedBootstrap, pairedEvalueSequence, pairedMde, pairedRiskDifference, pairedRiskDifferenceExact, pairedRiskDifferenceScore, paretoPolicy, paretoSignificanceGate, powerPreflight, randomizedCanaryObservationDigest, randomizedCanaryRosterDigest, readField, renderFunnelTable, requiredPairedSampleSize, requiredSampleSize, sealExperiment, sealRandomizedCanaryRule, sequentialDecide, sequentialPairedGate, signManifest, summarizeEvaluationUnits, verifyEvidenceReceipt, verifyManifest, verifyMatchedBudgets, verifySealedExperiment, wilson };
 
 //# sourceMappingURL=index.js.map