@tangle-network/agent-eval 0.117.1 → 0.118.0

package/dist/provenance-DpjwyseI.d.ts

@@ -1,541 +0,0 @@
-import { S as Scenario, G as Gate, m as GateResult, l as GateContext, C as CampaignResult, p as Mutator, c as SurfaceProposer, M as MutableSurface, n as GenerationCandidate, d as GateDecision } from './types-BSw1rOUB.js';
-import { n as RedTeamCase, D as Direction, h as RunCampaignOptions } from './gepa-eESocoDi.js';
-import { R as RunRecord } from './run-record-BDH49H2E.js';
-import { a as PairedBootstrapResult } from './statistics-KUnG73jH.js';
-import { P as PolicyEditCandidateRecord } from './policy-edit-wG9uFEFm.js';
-import { HostedClient, TraceSpanEvent } from './hosted/index.js';
-import { C as CampaignStorage } from './storage-DrX3v_5B.js';
-
-/**
- * Compose multiple `Gate` implementations — every gate must pass for the
- * composite to ship. Closes the alignment reviewer's "default-only
- * heldOutGate + costGate would happily promote a reward-hacked prompt"
- * concern by making safety gates first-class composable defaults.
- */
-
-/** Compose gates — all must `ship` for the composite to `ship`. First
- *  non-ship verdict short-circuits the composite verdict, but ALL gates run
- *  (so the result records every gate's reason — useful for diagnostics). */
-declare function composeGate<TArtifact = unknown, TScenario extends Scenario = Scenario>(...gates: Array<Gate<TArtifact, TScenario>>): Gate<TArtifact, TScenario>;
-
-/**
- * `defaultProductionGate` — composes the substrate's existing safety
- * primitives (red-team / reward-hacking / canary / heldout) into a single
- * Gate.decide shape. Closes the alignment + Anthropic-SI reviewers' "safety
- * primitives are off the critical path" blocker.
- *
- * The composition is opinionated — when consumers wire `runImprovementLoop`,
- * THIS gate is the default. Consumers can still pass a custom gate to
- * override; the recommended pattern is to compose THIS gate with whatever
- * extra domain-specific gates they need (`composeGate(defaultProductionGate(...), customGate)`).
- */
-
-interface DefaultProductionGateOptions {
-    /** Required: scenarios held out from training; substrate compares
-     *  candidate-on-holdout vs baseline-on-holdout. */
-    holdoutScenarios: Scenario[];
-    /** Minimum held-out lift the **paired-bootstrap CI lower bound** must clear
-     *  to ship — NOT a point estimate. Default 0 ⇒ "confidently positive at the
-     *  confidence level". Interpreted in the judge's native composite scale (set
-     *  e.g. 2 for a 0-100 rubric to require a ≥2-point significant gain). */
-    deltaThreshold?: number;
-    /** Confidence level for the held-out + dimension bootstraps. Default 0.95. */
-    confidence?: number;
-    /** Bootstrap resamples. Default 2000. */
-    bootstrapResamples?: number;
-    /** Fixed bootstrap seed for a deterministic verdict. Default 1337. */
-    bootstrapSeed?: number;
-    /** Minimum paired holdout observations (scenarios × reps) before a
-     *  significance claim is allowed; below it the gate HOLDS with `few_runs`
-     *  rather than reading a degenerate CI. Default 3. */
-    minProductiveRuns?: number;
-    /** Ship statistic for the held-out significance test. Default `'mean'`
-     *  (tie-robust — see `heldoutSignificance`). Pass `'median'` for
-     *  outlier-robustness at the cost of tie-blindness. */
-    heldoutStatistic?: 'mean' | 'median';
-    /** Critical judge dimensions that must NOT significantly regress even when
-     *  the net composite rises (anti-Goodhart). The gate HOLDS if any listed
-     *  dimension's paired-delta CI lower bound < −`regressionTolerance`. E.g.
-     *  `['hallucination_free']` for a legal agent. */
-    criticalDimensions?: string[];
-    /** Tolerance for the per-dimension regression guard, in the dimension's
-     *  native scale. When omitted it auto-scales off observed magnitudes:
-     *  0.05 on [0,1], 5 on 0-100. */
-    regressionTolerance?: number;
-    /** Total $ budget for ALL cells in this campaign — including baseline + candidate.
-     *  Composite verdict refuses to ship when spend exceeded budget. */
-    budgetUsd?: number;
-    /** Red-team cases to probe candidate outputs against. When omitted the
-     *  substrate uses `DEFAULT_RED_TEAM_CORPUS`. Provide a domain-specific
-     *  battery for tighter coverage. */
-    redTeamBattery?: RedTeamCase[];
-    /** Run records (oldest-first) needed for the reward-hacking detector.
-     *  Substrate populates from prior production-loop generations. */
-    recentRuns?: RunRecord[];
-    /** When true, the gate refuses to ship if the reward-hacking detector
-     *  fires at the `gaming` severity. Default true. */
-    blockOnRewardHackingGaming?: boolean;
-}
-/**
- * Opinionated production gate composing held-out significance, red-team, reward-hacking, and canary checks into a single `Gate.decide` decision.
- */
-declare function defaultProductionGate<TArtifact, TScenario extends Scenario>(options: DefaultProductionGateOptions): Gate<TArtifact, TScenario>;
-
-/**
- * @module
- * Composable held-out promotion gate backed by paired bootstrap confidence.
- *
- * Pair by full `scenario:rep` cellId, bootstrap the paired candidate-minus-
- * baseline delta, and ship only when CI.low strictly clears the threshold with
- * at least `minProductiveRuns` paired observations.
- *
- * Use when you want held-out significance as ONE of N composed gates instead
- * of the full `defaultProductionGate` stack (which adds critical-dimension
- * regression + reward-hacking guards on top).
- */
-
-interface HeldOutGateOptions<TScenario extends Scenario = Scenario> {
-    scenarios: TScenario[];
-    /** Effect-size threshold the CI lower bound must clear, in the judge's native
-     *  scale. Default 0.5. Equality holds; CI.low must be greater than this value. */
-    deltaThreshold?: number;
-    /** Bootstrap CI confidence. Default 0.95. */
-    confidence?: number;
-    /** Minimum paired holdout observations to claim significance. Default 3. */
-    minProductiveRuns?: number;
-    /** Bootstrap resamples. Default 2000. */
-    resamples?: number;
-    /** Fixed bootstrap seed for deterministic verdicts. Default 1337. */
-    bootstrapSeed?: number;
-}
-/**
- * Composable held-out gate: ships only when the PAIRED bootstrap CI lower bound
- * of the candidate-minus-baseline composite delta clears `deltaThreshold`.
- */
-declare function heldOutGate<TArtifact, TScenario extends Scenario>(options: HeldOutGateOptions<TScenario>): Gate<TArtifact, TScenario>;
-
-/**
- * Power preflight — "can this budget detect the effect you are hunting?"
- *
- * The failure it prevents (measured, twice): a live prompt-improvement campaign ran
- * 333 sandbox cells over 5.6 hours and produced a +0.08 holdout lift the ship gate
- * (paired bootstrap, CI.low > 0.05) could not distinguish from zero — because at
- * that holdout size and worker variance the MINIMUM DETECTABLE lift was larger than
- * any effect a prompt change plausibly produces. The budget was spent learning what
- * a 30-second calculation on the baseline cells already knew. No eval framework we
- * know of surfaces this; every underpowered improvement run everywhere ends in an
- * uninformative "hold".
- *
- * Model: the ship rule is `CI.low(paired Δ) > deltaThreshold`. Approximating the
- * bootstrap CI as normal, `CI.low ≈ effect − z·sd_Δ/√n`, so the smallest shippable
- * true effect is `MDE = deltaThreshold + z·sd_Δ/√n`. The paired-delta SD is unknown
- * before the candidate exists; we bound it by the zero-correlation case
- * `sd_Δ ≤ √2·sd_baseline` — a CONSERVATIVE (upper) MDE, which is the correct
- * direction for a warning. Pairing is per cell (`scenario:rep`), so reps multiply n.
- *
- * Standalone by design: feed it any baseline composites (a `gate:'none'` run, a
- * live-proof table) BEFORE budgeting the real search; `selfImprove` also attaches
- * it to every result and warns when the run was structurally unable to ship.
- */
-interface PowerPreflightOptions {
-    /** Per-cell baseline composites on the HOLDOUT scenarios (one per scenario:rep cell). */
-    baselineComposites: number[];
-    /** Paired observations the budgeted comparison will produce
-     *  (holdout scenarios × reps). Defaults to `baselineComposites.length`. */
-    pairedN?: number;
-    /** The ship gate's effect-size threshold. Default 0.05 (defaultProductionGate). */
-    deltaThreshold?: number;
-    /** CI confidence the gate uses. Default 0.95. */
-    confidence?: number;
-    /** True when the holdout is scored by the SAME judge/scorer family as the gate
-     *  (selfImprove's default composition — one judge scores everything). Under a
-     *  shared channel, raising paired n reduces only the IDIOSYNCRATIC noise share;
-     *  systematic judge bias is untouched, so the MDE here is a lower bound and the
-     *  only full debiaser is an independent second scoring channel
-     *  (recursive-self-improvement S1c, closed form in EXP-023 P0). Default false. */
-    sharedScorerChannel?: boolean;
-}
-interface PowerPreflight {
-    /** Paired observations the comparison will have. */
-    n: number;
-    /** Baseline per-cell composite standard deviation (the variance the effect must beat). */
-    sd: number;
-    /** Minimum detectable lift: the smallest TRUE effect the gate could ship at this budget. */
-    mde: number;
-    /** Baseline holdout composite mean. */
-    baselineMean: number;
-    /** Headroom to a perfect 1.0 composite (the largest achievable lift on a [0,1] judge). */
-    headroom: number;
-    /** True when even the largest achievable effect (headroom) is below the MDE —
-     *  the run is structurally unable to ship regardless of proposal quality.
-     *  Only asserted for [0,1]-scaled judges (see `scaleAssumed`). */
-    underpowered: boolean;
-    /** True when composites look [0,1]-scaled; headroom/underpowered are only
-     *  meaningful under that convention (0-100 judges get mde/sd/n but no verdict). */
-    scaleAssumed: boolean;
-    deltaThreshold: number;
-    confidence: number;
-    /** Set when the holdout shares the gate's scoring channel: more cells cannot
-     *  buy back systematic judge bias — treat the MDE as a lower bound. */
-    sharedChannelCaveat?: string;
-    /** One actionable sentence for humans and logs. */
-    recommendation: string;
-}
-/** Estimate the minimum detectable lift a paired-holdout improvement run can
- *  ship at a given budget, from the baseline holdout composites — call it BEFORE
- *  spending a search to learn whether the effect you are hunting is even
- *  observable at this holdout size and worker variance. */
-declare function powerPreflight(opts: PowerPreflightOptions): PowerPreflight;
-
-/**
- * Promotion policy over the evidence VECTOR — the substrate's answer to "never
- * collapse the multi-objective promotion decision into one scalar." A
- * `defaultProductionGate` is one opinionated composition; this module factors
- * the decision into two reusable pieces so MANY policies can compete over the
- * SAME evidence (the quant-desk pattern: one evidence bus, plural strategies):
- *
- *   buildEvidenceVector(ctx, objectives, opts) -> EvidenceVector   // the bus
- *   PromotionPolicy = (ev: EvidenceVector) => GateResult           // a strategy
- *   paretoPolicy(ev)                                               // the default strategy
- *   paretoSignificanceGate(options): Gate                          // bus + policy as a Gate
- *
- * The Pareto policy is SYMMETRIC multi-objective: every objective is BOTH a
- * potential gain source AND a safety floor (unlike `defaultProductionGate`,
- * where only `composite` can win and `criticalDimensions` are pure floors). A
- * candidate ships iff it weakly DOMINATES the baseline at the confidence level —
- * no objective credibly worse (CI floor breach) AND at least one objective
- * credibly better (CI gain). Insufficient evidence on ANY axis -> need_more_work
- * (NOT folded into hold: "gather more reps" and "reject" are different actions).
- *
- * Cost/latency are NOT CI axes here — `GateContext` carries only an aggregate
- * per-side cost, no per-cell observation vector to bootstrap. Treat them as hard
- * constraints (compose with a budget gate via `composeGate`), not faked CIs.
- */
-
-/** Where an objective's per-cell scalar comes from. `composite` reads the
- *  judge's composite; `dimension` reads a named per-dimension score. */
-type ObjectiveSource = {
-    kind: 'composite';
-} | {
-    kind: 'dimension';
-    dimension: string;
-};
-interface PromotionObjective {
-    /** Stable label used in reports + `contributingGates`. */
-    name: string;
-    source: ObjectiveSource;
-    /** 'maximize' (quality dims) or 'minimize' (error/risk/length dims). Orients
-     *  the paired delta so a positive bootstrap always means "candidate better". */
-    direction: Direction;
-    /** The good-direction paired-delta CI lower bound must EXCEED this to count
-     *  as a significant gain on this axis. Interpreted in the judge's native
-     *  scale. Default 0 (⇒ "confidently better"). */
-    gainThreshold?: number;
-    /** A floor breach (regression) is declared when the good-direction CI lower
-     *  bound is below −floorTolerance. When omitted it auto-scales off observed
-     *  magnitudes (0.05 on [0,1], 5 on 0-100), matching `dimensionRegressions`. */
-    floorTolerance?: number;
-}
-/** Per-axis verdict from the good-direction paired bootstrap. */
-type AxisVerdict = 'improved' | 'regressed' | 'flat' | 'few_runs';
-interface AxisEvidence {
-    name: string;
-    source: ObjectiveSource;
-    direction: Direction;
-    /** Paired bootstrap on the GOOD-DIRECTION delta (oriented by `direction`):
-     *  a positive value means the candidate is better on this axis. */
-    bootstrap: PairedBootstrapResult;
-    /** Paired observations contributing to this axis. */
-    n: number;
-    gainThreshold: number;
-    floorTolerance: number;
-    verdict: AxisVerdict;
-}
-interface EvidenceVector {
-    /** One entry per objective — NOTHING averaged across axes. */
-    axes: AxisEvidence[];
-    /** Smallest paired n across axes that produced observations — the binding
-     *  evidence-sufficiency constraint. 0 when no axis produced observations. */
-    minN: number;
-    /** Aggregate per-side cost from the gate context (a constraint input, not a
-     *  CI axis — see the module header). */
-    cost: {
-        candidate: number;
-        baseline: number;
-    };
-}
-/** A promotion strategy: a pure function from the evidence vector to a verdict.
- *  Many policies can run over the same `EvidenceVector` and disagree — that's
- *  the point (competing strategies, shared evidence). */
-type PromotionPolicy = (ev: EvidenceVector) => GateResult;
-interface BuildEvidenceVectorOptions {
-    /** Minimum paired observations before an axis can claim significance; below
-     *  it the axis is `few_runs`. Default 3. */
-    minProductiveRuns?: number;
-    /** Confidence level for every axis bootstrap. Default 0.95. */
-    confidence?: number;
-    /** Bootstrap resamples. Default 2000. */
-    resamples?: number;
-    /** Fixed bootstrap seed for a deterministic, reproducible verdict. Default 1337. */
-    seed?: number;
-}
-/**
- * The Evidence Bus. For each objective, pair candidate vs baseline by full
- * cellId and bootstrap a CI on the good-direction paired delta. Reuses the
- * exact `pairHoldout` + `pairedBootstrap` machinery the held-out gate uses, so
- * a single source of truth governs pairing granularity + scale handling.
- */
-declare function buildEvidenceVector<TArtifact, TScenario extends Scenario>(ctx: GateContext<TArtifact, TScenario>, objectives: PromotionObjective[], opts?: BuildEvidenceVectorOptions): EvidenceVector;
-/**
- * The default strategy: symmetric multi-objective Pareto significance. Ship iff
- * the candidate weakly dominates the baseline at the confidence level — no axis
- * credibly worse AND ≥1 axis credibly better. Floor breach on any axis → hold
- * (anti-Goodhart, dominates everything). Insufficient evidence on any axis →
- * need_more_work. Statistically equivalent → hold (never ship noise).
- */
-declare const paretoPolicy: PromotionPolicy;
-interface ParetoSignificanceGateOptions extends BuildEvidenceVectorOptions {
-    /** The objective vector. Every axis is both a gain source and a safety floor. */
-    objectives: PromotionObjective[];
-    /** Strategy applied to the evidence vector. Default `paretoPolicy`. Override
-     *  to run a stricter/looser strategy over the SAME bus (competing policies). */
-    policy?: PromotionPolicy;
-    /** Override the gate name in reports. */
-    name?: string;
-}
-/**
- * Wrap the bus + a policy as a `Gate`. Plugs into the existing
- * `runImprovementLoop({ gate })` slot and composes via `composeGate`; default
- * loop behavior is unchanged because consumers opt in by passing this gate.
- */
-declare function paretoSignificanceGate<TArtifact = unknown, TScenario extends Scenario = Scenario>(options: ParetoSignificanceGateOptions): Gate<TArtifact, TScenario>;
-
-/**
- * `runEval` — the simplest preset over `runCampaign`. No optimizer, no
- * gate, no auto-PR. Just: run scenarios through dispatch, score with
- * judges, return CampaignResult.
- *
- * The 80% case for consumers who want a scorecard, not an improvement loop.
- */
-
-interface RunEvalOptions<TScenario extends Scenario, TArtifact> extends Omit<RunCampaignOptions<TScenario, TArtifact>, 'runDir'> {
-    runDir: string;
-}
-/**
- * Simplest evaluation preset: run scenarios through dispatch, score with judges, and return a `CampaignResult` — no optimizer, no gate, no PR.
- */
-declare function runEval<TScenario extends Scenario, TArtifact>(opts: RunEvalOptions<TScenario, TArtifact>): Promise<CampaignResult<TArtifact, TScenario>>;
-
-/**
- * `evolutionaryProposer` — adapts a stateless `Mutator` (population mutation:
- * GEPA / AxGEPA / reflective-mutation) into a `SurfaceProposer`. This is
- * the evolutionary strategy: each generation, mutate the current best surface
- * into N candidates, measure, select. No generation memory beyond the current
- * surface; the loop body handles ranking + promotion.
- *
- * The reflective alternative is agent-runtime's runtime proposer with a
- * `reflectiveGenerator` / `agenticGenerator`: it reasons over the report +
- * trace findings to propose targeted edits rather than blind mutations. Both
- * conform to `SurfaceProposer`; the improvement loop is identical either way.
- */
-
-interface EvolutionaryProposerOptions<TFindings = unknown> {
-    mutator: Mutator<TFindings>;
-    /** External findings fed to the mutator each generation. Default: []. */
-    findings?: TFindings[];
-}
-/**
- * Wrap a stateless `Mutator` (GEPA, AxGEPA, reflective-mutation) as a `SurfaceProposer` that mutates the current best surface into N candidates each generation.
- */
-declare function evolutionaryProposer<TFindings = unknown>(opts: EvolutionaryProposerOptions<TFindings>): SurfaceProposer<TFindings>;
-
-/**
- * Loop provenance — the durable, queryable record of WHAT a self-improvement
- * loop did and WHY, plus the OTel spans that let an OTLP collector pivot from
- * an eval-run to the underlying candidate→cell→gate→promote chain.
- *
- * Two artifacts, one source of truth:
- *
- *   1. `LoopProvenanceRecord` — a structured JSON record capturing every
- *      candidate (surfaceHash + label + rationale + structured cause), its measured composite,
- *      the gate decision + reasons + delta, the held-out lift, the explicit
- *      baseline→candidate diff, and BACKEND PROVENANCE (the
- *      `assertRealBackend` verdict + worker call count + model). This is the
- *      ingestable audit artifact: the +lift recomputes from it, the "because
- *      Z" rationale survives in it, and a stub backend is detectable from it.
- *
- *   2. `loopProvenanceSpans()` — the same chain emitted as OTLP-ingestable
- *      `TraceSpanEvent`s, pivoted on the substrate's standard
- *      `tangle.runId` / `tangle.scenarioId` / `tangle.cellId` /
- *      `tangle.generation` attributes (the same pivots `/adapters/otel`
- *      reads). The hosted `/v1/ingest/traces` endpoint receives the FULL loop,
- *      not just the `cost.*` spans `runCampaign` already emits per cell.
- *
- * The record is built from the substrate's own loop result + the per-call
- * `RunRecord`s the worker emitted — no new measurement, no recomputation that
- * could drift from what the gate actually saw.
- */
-
-interface LoopProvenanceCandidate {
-    /** Generation index this candidate was proposed in. */
-    generation: number;
-    /** 16-char loop-identity fingerprint (matches `GenerationCandidate.surfaceHash`). */
-    surfaceHash: string;
-    /** Full sha256 content hash — byte-identical-verifiable. */
-    contentHash: string;
-    /** Proposer label, when the proposer returned a `ProposedCandidate`. */
-    label?: string;
-    /** Proposer rationale — the "because Z". When the proposer returned a bare
-     *  surface (blind mutator) this is absent. */
-    rationale?: string;
-    /** Exact validated cause when the proposer emitted a structured record. */
-    candidateRecord?: PolicyEditCandidateRecord;
-    /** Exact complete incumbent this candidate mutated. */
-    parentSurfaceHash: string;
-    /** Search-split composite of the exact parent. */
-    parentComposite: number;
-    /** Search-split composite change relative to the exact parent. */
-    observedDeltaFromParent?: number;
-    /** Whether the candidate completed every designed cell and could be selected. */
-    eligibleForPromotion: boolean;
-    /** Designed-denominator receipt retained even for incomplete candidates. */
-    coverage: NonNullable<GenerationCandidate['coverage']>;
-    /** Mean composite this candidate scored on the search split. */
-    composite: number;
-    /** Whether this candidate was promoted out of its generation. */
-    promoted: boolean;
-}
-interface LoopProvenanceBackend {
-    /** `assertRealBackend`-grade verdict over the worker call records. */
-    verdict: 'real' | 'mixed' | 'stub';
-    /** Number of worker LLM calls captured (the audit's "worker call count"). */
-    workerCallCount: number;
-    /** Distinct model ids observed across worker calls. */
-    models: string[];
-    totalInputTokens: number;
-    totalOutputTokens: number;
-    totalCostUsd: number;
-}
-/**
- * The durable provenance record. Aligns to the hosted `EvalRunEvent` path but
- * ADDS the rationale + the explicit baseline→candidate diff (both omitted from
- * the bare hosted event) + backend provenance.
- */
-interface LoopProvenanceRecord {
-    schema: 'tangle.loop-provenance.v3';
-    runId: string;
-    runDir: string;
-    timestamp: string;
-    /** Baseline + winner surface content hashes — distinguishable, byte-verifiable. */
-    baselineContentHash: string;
-    winnerContentHash: string;
-    /** Proposer label/rationale for the promoted change. Absent ⇒ winner == baseline. */
-    winnerLabel?: string;
-    winnerRationale?: string;
-    /** The explicit baseline→winner unified diff the gate decided on. */
-    diff: string;
-    /** Every candidate across every generation, with its rationale and structured cause. */
-    candidates: LoopProvenanceCandidate[];
-    /** Baseline composite on the search split that generated the candidates. */
-    baselineSearchComposite: number;
-    /** The gate verdict — decision + reasons + contributing gates + delta. */
-    gate: {
-        decision: GateDecision;
-        reasons: string[];
-        delta?: number;
-        contributingGates: Array<{
-            name: string;
-            passed: boolean;
-        }>;
-    };
-    /** baseline-on-holdout composite mean. */
-    baselineHoldoutComposite: number;
-    /** winner-on-holdout composite mean. */
-    winnerHoldoutComposite: number;
-    /** winnerHoldout - baselineHoldout — RECOMPUTABLE from this record. */
-    heldOutLift: number;
-    /** Backend provenance: stub-vs-real verdict + worker call count + models. */
-    backend: LoopProvenanceBackend;
-    totalCostUsd: number;
-    totalDurationMs: number;
-}
-interface BuildLoopProvenanceArgs<TArtifact, TScenario extends Scenario> {
-    runId: string;
-    runDir: string;
-    timestamp: string;
-    baselineSurface: MutableSurface;
-    winnerSurface: MutableSurface;
-    winnerLabel?: string;
-    winnerRationale?: string;
-    diff: string;
-    /** Baseline composite on the search split, distinct from holdout scoring. */
-    baselineSearchComposite: number;
-    /** Per-generation candidate records straight off the loop result. */
-    generations: Array<{
-        generationIndex: number;
-        candidates: GenerationCandidate[];
-        promoted: string[];
-        /** Surfaces measured this generation, keyed by surface hash so the content
-         *  hash can be computed and the loop identity rechecked from real bytes. */
-        surfaces: Array<{
-            surfaceHash: string;
-            surface: MutableSurface;
-        }>;
-    }>;
-    gate: GateResult;
-    baselineOnHoldout: CampaignResult<TArtifact, TScenario>;
-    winnerOnHoldout: CampaignResult<TArtifact, TScenario>;
-    /** Worker call records — the source for backend provenance. */
-    workerRecords: ReadonlyArray<RunRecord>;
-    totalCostUsd: number;
-    totalDurationMs: number;
-}
-/** Build the durable provenance record from a completed loop result. */
-declare function buildLoopProvenanceRecord<TArtifact, TScenario extends Scenario>(args: BuildLoopProvenanceArgs<TArtifact, TScenario>): LoopProvenanceRecord;
-/**
- * Build the loop's OTLP-ingestable spans from a provenance record. One root
- * span per loop (`tangle.runId`), one span per generation, one span per
- * candidate (carrying its surfaceHash + label), and one span for the gate
- * decision (carrying reasons + delta + lift). Candidate + gate spans pivot on
- * the same `tangle.runId` / `tangle.generation` attributes `/adapters/otel`
- * reads, so the hosted collector reconstructs the full tree.
- *
- * Times are synthesized monotonically off a single base so the span tree is
- * orderable; the substrate does not retain per-candidate wall-clock starts.
- */
-declare function loopProvenanceSpans(record: LoopProvenanceRecord, opts?: {
-    baseTimeMs?: number;
-}): TraceSpanEvent[];
-/** Canonical durable paths under the run dir. */
-declare function provenanceRecordPath(runDir: string): string;
-/**
- * Canonical path for the durable OTLP spans JSONL file under a loop run directory.
- */
-declare function provenanceSpansPath(runDir: string): string;
-interface EmitLoopProvenanceResult {
-    record: LoopProvenanceRecord;
-    spans: TraceSpanEvent[];
-    /** Absolute paths the record + spans were written to, when storage persists. */
-    recordPath: string;
-    spansPath: string;
-}
-interface EmitLoopProvenanceArgs<TArtifact, TScenario extends Scenario> extends BuildLoopProvenanceArgs<TArtifact, TScenario> {
-    /** Storage the record + spans are written through. */
-    storage: CampaignStorage;
-    /** When set, the spans are also shipped to the hosted `/v1/ingest/traces`
-     *  endpoint so the collector receives the full loop, not just `cost.*`. */
-    hostedClient?: HostedClient;
-}
-/**
- * Build the provenance record + OTel spans and persist them durably under the
- * run dir (and ship spans to a hosted collector when one is wired). Returns
- * both artifacts so the caller can assert on / re-derive from them.
- *
- * Fail-loud: the durable write throws on storage failure (a swallowed write is
- * exactly the "emitted but lost" failure this closes). The hosted span ship is
- * the one best-effort leg — its failure is logged, not thrown, so an offline
- * collector never fails the loop (the durable artifact is the source of truth).
- */
-declare function emitLoopProvenance<TArtifact, TScenario extends Scenario>(args: EmitLoopProvenanceArgs<TArtifact, TScenario>): Promise<EmitLoopProvenanceResult>;
-
-export { type AxisEvidence as A, type BuildEvidenceVectorOptions as B, type DefaultProductionGateOptions as D, type EvidenceVector as E, type HeldOutGateOptions as H, type LoopProvenanceRecord as L, type ObjectiveSource as O, type PowerPreflight as P, type RunEvalOptions as R, type AxisVerdict as a, type EvolutionaryProposerOptions as b, type ParetoSignificanceGateOptions as c, type PromotionObjective as d, type PromotionPolicy as e, buildEvidenceVector as f, composeGate as g, defaultProductionGate as h, evolutionaryProposer as i, heldOutGate as j, paretoSignificanceGate as k, type BuildLoopProvenanceArgs as l, type EmitLoopProvenanceArgs as m, type EmitLoopProvenanceResult as n, type LoopProvenanceBackend as o, paretoPolicy as p, type LoopProvenanceCandidate as q, runEval as r, type PowerPreflightOptions as s, buildLoopProvenanceRecord as t, emitLoopProvenance as u, loopProvenanceSpans as v, powerPreflight as w, provenanceRecordPath as x, provenanceSpansPath as y };

package/dist/query-CF7PG61p.d.ts

@@ -1,35 +0,0 @@
-import { L as LlmSpan, T as ToolSpan, J as JudgeSpan, R as Run, F as FailureClass } from './schema-B3Q3l9Z_.js';
-import { T as TraceStore } from './store-DGqD0Pyo.js';
-
-/**
- * Typed query helpers over TraceStore.
- *
- * Not a full SQL engine — a minimal, composable set of operators that
- * cover the canned-pipeline use cases. For ad-hoc analytics, persist to
- * NDJSON and point DuckDB at it; the schema is stable so external SQL
- * tooling works out of the box.
- */
-
-declare function runsForScenario(store: TraceStore, scenarioId: string): Promise<Run[]>;
-declare function llmSpans(store: TraceStore, runId?: string): Promise<LlmSpan[]>;
-declare function toolSpans(store: TraceStore, runId?: string, toolName?: string): Promise<ToolSpan[]>;
-/** Query judge-kind spans from the trace store, optionally scoped to a single run. */
-declare function judgeSpans(store: TraceStore, runId?: string): Promise<JudgeSpan[]>;
-/** Group spans by any key selector. */
-declare function groupBy<T, K extends string | number>(items: T[], key: (t: T) => K): Map<K, T[]>;
-/** Hash tool arguments to an orderless-key-stable string for de-duplication. */
-declare function argHash(args: unknown): string;
-/** Whether argument-based comparisons are valid for this tool call. */
-declare function hasCapturedToolArgs(span: ToolSpan): boolean;
-/** Sum an LLM-span array into aggregate token + cost. */
-declare function aggregateLlm(spans: LlmSpan[]): {
-    inputTokens: number;
-    outputTokens: number;
-    cachedTokens: number;
-    reasoningTokens: number;
-    costUsd: number;
-};
-/** Pick the outcome's failure class when present, else derive 'success' from run status. */
-declare function runFailureClass(run: Run): FailureClass;
-
-export { aggregateLlm as a, argHash as b, runsForScenario as c, groupBy as g, hasCapturedToolArgs as h, judgeSpans as j, llmSpans as l, runFailureClass as r, toolSpans as t };