@tangle-network/agent-eval 0.95.0 → 0.96.0

package/dist/executor.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"executor.test.d.ts","sourceRoot":"","sources":["../src/executor.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/experiment-tracker.d.ts

@@ -1,178 +0,0 @@
-/**
- * Experiment tracker — git-provenanced experiment log with N-rep stats and a
- * KEEP / REGRESSION / NOISE verdict against a parent.
- *
- * Every loop the fleet runs reduces to the same question: "I ran the candidate
- * N times — is the median measurably better than the parent, or is the delta
- * inside the noise band?" The hand-rolled copies bake a fixed score scale
- * (percentage points), a fixed store path (`.evolve/experiments-v2.json`), and
- * `execSync('git …')` straight into the module. This is the canonical version:
- * provenance and persistence are injected, thresholds are configurable, and the
- * stats + verdict are pure functions you can unit-test without a git repo or a
- * filesystem.
- *
- * Stats per experiment: median / mean / min / max / iqr / stddev / passRate /
- * n, plus a `stable` flag (`iqr < iqrUnstableAbove && stddev < stddevUnstableAbove`).
- *
- * Verdict against a parent (both must have `n >= minRepsForVerdict`):
- *   - NOISE       — the candidate is too unstable to judge (`!stable`)
- *   - KEEP        — `medianDelta >  keepThreshold`
- *   - REGRESSION  — `medianDelta < -regressionThreshold`
- *   - NOISE       — otherwise (delta inside the band)
- * With no parent (or insufficient reps) the verdict is the neutral ITERATE.
- */
-/** Verdict for one experiment relative to its parent. ITERATE is the neutral
- *  "keep collecting reps / no parent to compare against" state. */
-export type ExperimentVerdict = 'KEEP' | 'ITERATE' | 'NOISE' | 'REGRESSION';
-/** Git provenance for the working tree an experiment was run from. */
-export interface ExperimentProvenance {
-    /** Commit sha (short or full — the tracker does not interpret it). */
-    commit: string;
-    /** First line of the commit message. */
-    message: string;
-    /** Files changed vs the parent commit, or a marker like 'uncommitted'. */
-    changedFiles: string[];
-}
-/** A single repetition of an experiment, carrying the score the verdict is
- *  computed on plus any free-form per-rep metrics the consumer wants kept. */
-export interface ExperimentRep {
-    /** 0-indexed repetition number within the experiment. */
-    rep: number;
-    /** The score this rep is judged on (same scale as the thresholds). */
-    score: number;
-    /** ISO timestamp the rep completed. */
-    timestamp: string;
-    /** Whether this rep passed the consumer's own gate — folded into `passRate`. */
-    passed?: boolean;
-    /** Free-form numeric metrics retained for later analysis. */
-    metrics?: Record<string, number>;
-}
-export interface ExperimentStats {
-    median: number;
-    mean: number;
-    min: number;
-    max: number;
-    /** Inter-quartile range of the rep scores. */
-    iqr: number;
-    /** Population standard deviation of the rep scores. */
-    stddev: number;
-    /** Fraction of reps with `passed === true`, over reps that set `passed`.
-     *  null when no rep declared a pass/fail outcome. */
-    passRate: number | null;
-    /** Number of reps. */
-    n: number;
-    /** True when the sample is tight enough to trust for a verdict. */
-    stable: boolean;
-}
-export interface Experiment {
-    /** Stable id for the experiment. */
-    id: string;
-    /** Free-form label / config descriptor. */
-    label: string;
-    /** Git provenance captured when the experiment was created. */
-    provenance: ExperimentProvenance;
-    /** Parent experiment id this candidate is compared against, if any. */
-    parentId?: string;
-    /** One-line summary of what changed from the parent. */
-    changeSummary: string;
-    reps: ExperimentRep[];
-    stats: ExperimentStats;
-    verdict: ExperimentVerdict;
-    /** ISO timestamp the experiment was created. */
-    createdAt: string;
-}
-export interface ImprovementThresholds {
-    /** medianDelta strictly above this ⇒ KEEP. Default 5. */
-    keepThreshold?: number;
-    /** medianDelta strictly below the negative of this ⇒ REGRESSION. Default 5. */
-    regressionThreshold?: number;
-    /** iqr at or above this ⇒ unstable. Default 10. */
-    iqrUnstableAbove?: number;
-    /** stddev at or above this ⇒ unstable. Default Infinity (iqr-only stability). */
-    stddevUnstableAbove?: number;
-    /** Reps required on BOTH candidate and parent before a verdict is rendered.
-     *  Default 3. */
-    minRepsForVerdict?: number;
-}
-export interface ImprovementVerdictResult {
-    verdict: ExperimentVerdict;
-    /** candidate.median − parent.median; null when no parent or insufficient reps. */
-    medianDelta: number | null;
-    /** Human-readable reason for the verdict — for dashboards and logs. */
-    reason: string;
-}
-/**
- * Compute the N-rep statistics for a set of reps. Pure — no I/O. The `stable`
- * flag is the trust gate the verdict depends on: a sample whose spread exceeds
- * the configured bounds can't distinguish a real delta from run-to-run noise.
- */
-export declare function computeExperimentStats(reps: ExperimentRep[], thresholds?: ImprovementThresholds): ExperimentStats;
-/**
- * Verdict for a candidate against its parent. Pure — operates on already-computed
- * stats. KEEP/REGRESSION require both sides to have `>= minRepsForVerdict` reps
- * AND the candidate to be `stable`; otherwise the result is NOISE (unstable) or
- * ITERATE (not enough reps / no parent).
- */
-export declare function improvementVerdict(candidate: ExperimentStats, parent: ExperimentStats | null, thresholds?: ImprovementThresholds): ImprovementVerdictResult;
-/** Reads git provenance for the working tree. Inject a fake in tests; the
- *  default implementation shells out to `git`. */
-export type ProvenanceReader = () => ExperimentProvenance | Promise<ExperimentProvenance>;
-/** Persistence seam for the experiment log. Inject in-memory in tests; the
- *  filesystem implementation is `fileExperimentStore`. */
-export interface ExperimentStore {
-    load(): Promise<Experiment[]>;
-    save(experiments: Experiment[]): Promise<void>;
-}
-/**
- * Default provenance reader: `git rev-parse HEAD`, the subject line, and the
- * files changed vs `HEAD~1`. Fail-loud — a tracker that silently logs
- * `commit: 'unknown'` corrupts the provenance the whole point of the log is to
- * carry. When the working tree genuinely has no parent commit, pass an override.
- */
-export declare const gitProvenanceReader: ProvenanceReader;
-/** In-memory store — the default when no persistence is wanted (tests, ephemeral
- *  runs). State lives on the instance. */
-export declare function inMemoryExperimentStore(initial?: Experiment[]): ExperimentStore;
-/** Filesystem store — a single JSON array at `path`, created on first save. */
-export declare function fileExperimentStore(path: string): ExperimentStore;
-export interface ExperimentTrackerOptions {
-    store?: ExperimentStore;
-    provenanceReader?: ProvenanceReader;
-    thresholds?: ImprovementThresholds;
-    /** Clock seam for deterministic timestamps in tests. Default `Date.now`. */
-    now?: () => number;
-}
-export interface CreateExperimentInput {
-    id: string;
-    label: string;
-    changeSummary: string;
-    parentId?: string;
-    /** Override provenance instead of reading from git (e.g. CI metadata). */
-    provenance?: ExperimentProvenance;
-}
-/**
- * Stateful tracker over an `ExperimentStore`. Create an experiment (provenance
- * is captured once), append reps as they complete (stats + verdict recompute on
- * every append), and read the log back for a dashboard. All persistence and git
- * access flow through the injected seams, so the tracker is fully testable
- * without a repo or disk.
- */
-export declare class ExperimentTracker {
-    private readonly store;
-    private readonly provenanceReader;
-    private readonly thresholds;
-    private readonly now;
-    constructor(options?: ExperimentTrackerOptions);
-    create(input: CreateExperimentInput): Promise<Experiment>;
-    /** Append a rep (its `rep` index defaults to the current rep count) and
-     *  recompute stats + verdict. Returns the updated experiment. */
-    addRep(experimentId: string, rep: Omit<ExperimentRep, 'rep' | 'timestamp'> & {
-        rep?: number;
-        timestamp?: string;
-    }): Promise<Experiment>;
-    get(experimentId: string): Promise<Experiment | undefined>;
-    list(): Promise<Experiment[]>;
-    /** Full verdict (not just the enum) for an experiment vs its parent. */
-    verdictFor(experimentId: string): Promise<ImprovementVerdictResult>;
-}
-//# sourceMappingURL=experiment-tracker.d.ts.map

package/dist/experiment-tracker.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"experiment-tracker.d.ts","sourceRoot":"","sources":["../src/experiment-tracker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAMH;mEACmE;AACnE,MAAM,MAAM,iBAAiB,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,GAAG,YAAY,CAAA;AAE3E,sEAAsE;AACtE,MAAM,WAAW,oBAAoB;IACnC,sEAAsE;IACtE,MAAM,EAAE,MAAM,CAAA;IACd,wCAAwC;IACxC,OAAO,EAAE,MAAM,CAAA;IACf,0EAA0E;IAC1E,YAAY,EAAE,MAAM,EAAE,CAAA;CACvB;AAED;8EAC8E;AAC9E,MAAM,WAAW,aAAa;IAC5B,yDAAyD;IACzD,GAAG,EAAE,MAAM,CAAA;IACX,sEAAsE;IACtE,KAAK,EAAE,MAAM,CAAA;IACb,uCAAuC;IACvC,SAAS,EAAE,MAAM,CAAA;IACjB,gFAAgF;IAChF,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,6DAA6D;IAC7D,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CACjC;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,MAAM,CAAA;IACd,IAAI,EAAE,MAAM,CAAA;IACZ,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;IACX,8CAA8C;IAC9C,GAAG,EAAE,MAAM,CAAA;IACX,uDAAuD;IACvD,MAAM,EAAE,MAAM,CAAA;IACd;yDACqD;IACrD,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAA;IACvB,sBAAsB;IACtB,CAAC,EAAE,MAAM,CAAA;IACT,mEAAmE;IACnE,MAAM,EAAE,OAAO,CAAA;CAChB;AAED,MAAM,WAAW,UAAU;IACzB,oCAAoC;IACpC,EAAE,EAAE,MAAM,CAAA;IACV,2CAA2C;IAC3C,KAAK,EAAE,MAAM,CAAA;IACb,+DAA+D;IAC/D,UAAU,EAAE,oBAAoB,CAAA;IAChC,uEAAuE;IACvE,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,wDAAwD;IACxD,aAAa,EAAE,MAAM,CAAA;IACrB,IAAI,EAAE,aAAa,EAAE,CAAA;IACrB,KAAK,EAAE,eAAe,CAAA;IACtB,OAAO,EAAE,iBAAiB,CAAA;IAC1B,gDAAgD;IAChD,SAAS,EAAE,MAAM,CAAA;CAClB;AAED,MAAM,WAAW,qBAAqB;IACpC,yDAAyD;IACzD,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,+EAA+E;IAC/E,mBAAmB,CAAC,EAAE,MAAM,CAAA;IAC5B,mDAAmD;IACnD,gBAAgB,CAAC,EAAE,MAAM,CAAA;IACzB,iFAAiF;IACjF,mBAAmB,CAAC,EAAE,MAAM,CAAA;IAC5B;qBACiB;IACjB,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAC3B;AAED,MAAM,WAAW,wBAAwB;IACvC,OAAO,EAAE,iBAAiB,CAAA;IAC1B,kFAAkF;IAClF,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;IAC1B,uEAAuE;IACvE,MAAM,EAAE,MAAM,CAAA;CACf;AA4CD;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,aAAa,EAAE,EACrB,UAAU,CAAC,EAAE,qBAAqB,GACjC,eAAe,CAwCjB;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,eAAe,EAC1B,MAAM,EAAE,eAAe,GAAG,IAAI,EAC9B,UAAU,CAAC,EAAE,qBAAqB,GACjC,wBAAwB,CAuC1B;AAID;kDACkD;AAClD,MAAM,MAAM,gBAAgB,GAAG,MAAM,oBAAoB,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAA;AAEzF;0DAC0D;AAC1D,MAAM,WAAW,eAAe;IAC9B,IAAI,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;IAC7B,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;CAC/C;AAED;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,EAAE,gBAOjC,CAAA;AAED;0CAC0C;AAC1C,wBAAgB,uBAAuB,CAAC,OAAO,GAAE,UAAU,EAAO,GAAG,eAAe,CAUnF;AAED,+EAA+E;AAC/E,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,eAAe,CAuBjE;AAED,MAAM,WAAW,wBAAwB;IACvC,KAAK,CAAC,EAAE,eAAe,CAAA;IACvB,gBAAgB,CAAC,EAAE,gBAAgB,CAAA;IACnC,UAAU,CAAC,EAAE,qBAAqB,CAAA;IAClC,4EAA4E;IAC5E,GAAG,CAAC,EAAE,MAAM,MAAM,CAAA;CACnB;AAED,MAAM,WAAW,qBAAqB;IACpC,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,MAAM,CAAA;IACb,aAAa,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,0EAA0E;IAC1E,UAAU,CAAC,EAAE,oBAAoB,CAAA;CAClC;AAED;;;;;;GAMG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiB;IACvC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAkB;IACnD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAiC;IAC5D,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAc;gBAEtB,OAAO,GAAE,wBAA6B;IAO5C,MAAM,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO,CAAC,UAAU,CAAC;IA2B/D;qEACiE;IAC3D,MAAM,CACV,YAAY,EAAE,MAAM,EACpB,GAAG,EAAE,IAAI,CAAC,aAAa,EAAE,KAAK,GAAG,WAAW,CAAC,GAAG;QAAE,GAAG,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,GACnF,OAAO,CAAC,UAAU,CAAC;IAoBhB,GAAG,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC;IAM1D,IAAI,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;IAInC,wEAAwE;IAClE,UAAU,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,wBAAwB,CAAC;CAQ1E"}

package/dist/experiment-tracker.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=experiment-tracker.test.d.ts.map

package/dist/experiment-tracker.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"experiment-tracker.test.d.ts","sourceRoot":"","sources":["../src/experiment-tracker.test.ts"],"names":[],"mappings":""}

package/dist/failure-taxonomy.d.ts

@@ -1,38 +0,0 @@
-/**
- * Failure taxonomy — canonical classes + a default classifier.
- *
- * Every failed run should end up in a named class. The classifier here
- * is rule-based (fast, deterministic); an LLM fallback can be added by
- * the consumer for novel cases and trained into the rule base over time.
- *
- * Consumers call `classifyFailure(run, spans, events)` and persist the
- * returned class as `Run.outcome.failureClass`.
- */
-import type { FailureClass, Run, Span, TraceEvent } from './trace/schema';
-import { FAILURE_CLASSES } from './trace/schema';
-export { FAILURE_CLASSES, type FailureClass };
-export interface FailureContext {
-    run: Run;
-    spans: Span[];
-    events: TraceEvent[];
-}
-export interface FailureClassification {
-    failureClass: FailureClass;
-    reason: string;
-    triggerSpanId?: string;
-    triggerEventId?: string;
-}
-/** Ordered rules — first match wins. */
-export interface FailureRule {
-    id: string;
-    match: (ctx: FailureContext) => {
-        failureClass: FailureClass;
-        reason: string;
-        triggerSpanId?: string;
-        triggerEventId?: string;
-    } | null;
-}
-export declare const DEFAULT_RULES: FailureRule[];
-/** Classify the failure mode of a run using an ordered rule list. */
-export declare function classifyFailure(ctx: FailureContext, rules?: FailureRule[]): FailureClassification;
-//# sourceMappingURL=failure-taxonomy.d.ts.map

package/dist/failure-taxonomy.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"failure-taxonomy.d.ts","sourceRoot":"","sources":["../src/failure-taxonomy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AACzE,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAA;AAEhD,OAAO,EAAE,eAAe,EAAE,KAAK,YAAY,EAAE,CAAA;AAE7C,MAAM,WAAW,cAAc;IAC7B,GAAG,EAAE,GAAG,CAAA;IACR,KAAK,EAAE,IAAI,EAAE,CAAA;IACb,MAAM,EAAE,UAAU,EAAE,CAAA;CACrB;AAED,MAAM,WAAW,qBAAqB;IACpC,YAAY,EAAE,YAAY,CAAA;IAC1B,MAAM,EAAE,MAAM,CAAA;IACd,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,cAAc,CAAC,EAAE,MAAM,CAAA;CACxB;AAED,wCAAwC;AACxC,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,CAAC,GAAG,EAAE,cAAc,KAAK;QAC9B,YAAY,EAAE,YAAY,CAAA;QAC1B,MAAM,EAAE,MAAM,CAAA;QACd,aAAa,CAAC,EAAE,MAAM,CAAA;QACtB,cAAc,CAAC,EAAE,MAAM,CAAA;KACxB,GAAG,IAAI,CAAA;CACT;AAED,eAAO,MAAM,aAAa,EAAE,WAAW,EAmXtC,CAAA;AAqCD,qEAAqE;AACrE,wBAAgB,eAAe,CAC7B,GAAG,EAAE,cAAc,EACnB,KAAK,GAAE,WAAW,EAAkB,GACnC,qBAAqB,CASvB"}

package/dist/feedback-trajectory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"feedback-trajectory.d.ts","sourceRoot":"","sources":["../src/feedback-trajectory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AACzF,OAAO,KAAK,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,WAAW,CAAA;AAE9D,MAAM,MAAM,oBAAoB,GAC5B,MAAM,GACN,MAAM,GACN,MAAM,GACN,UAAU,GACV,QAAQ,GACR,IAAI,GACJ,UAAU,GACV,MAAM,GACN,OAAO,CAAA;AAEX,MAAM,MAAM,mBAAmB,GAAG,MAAM,GAAG,OAAO,GAAG,aAAa,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAA;AAEnG,MAAM,MAAM,iBAAiB,GACzB,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,gBAAgB,GAChB,cAAc,GACd,kBAAkB,CAAA;AAEtB,MAAM,MAAM,gBAAgB,GAAG,MAAM,GAAG,SAAS,GAAG,OAAO,GAAG,UAAU,CAAA;AAExE,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAA;IACd,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,CAAC,EAAE,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAA;IAChC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAC5B,gBAAgB,CAAC,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,aAAa;IAC5B,EAAE,CAAC,EAAE,MAAM,CAAA;IACX,MAAM,EAAE,mBAAmB,CAAA;IAC3B,IAAI,EAAE,iBAAiB,CAAA;IACvB,KAAK,EAAE,OAAO,CAAA;IACd,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,QAAQ,CAAC,EAAE,gBAAgB,CAAA;IAC3B,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAA;IACV,SAAS,EAAE,MAAM,CAAA;IACjB,YAAY,EAAE,oBAAoB,CAAA;IAClC,QAAQ,EAAE,OAAO,CAAA;IACjB,OAAO,CAAC,EAAE,OAAO,EAAE,CAAA;IACnB,cAAc,CAAC,EAAE,kBAAkB,CAAA;IACnC,KAAK,CAAC,EAAE,iBAAiB,EAAE,CAAA;IAC3B,QAAQ,CAAC,EAAE,aAAa,EAAE,CAAA;IAC1B,SAAS,EAAE,MAAM,CAAA;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAChC,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAA;IACV,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,IAAI,EAAE,YAAY,CAAA;IAClB,QAAQ,EAAE,eAAe,EAAE,CAAA;IAC3B,MAAM,EAAE,aAAa,EAAE,CAAA;IACvB,OAAO,CAAC,EAAE,eAAe,CAAA;IACzB,KAAK,CAAC,EAAE,YAAY,CAAA;IACpB,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC7B,SAAS,EAAE,MAAM,CAAA;IACjB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,uBAAuB;IACtC,IAAI,CAAC,UAAU,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IACnD,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC,CAAA;IACnD,IAAI,CAAC,MAAM,CAAC,EAAE,wBAAwB,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAA;IACtE,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAA;IAChF,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAA;CAC/F;AAED,MAAM,WAAW,wBAAwB;IACvC,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,KAAK,CAAC,EAAE,YAAY,CAAA;IACpB,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CACvB;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED,MAAM,WAAW,qBAAqB;IACpC,WAAW,EAAE,MAAM,CAAA;IACnB,SAAS,EAAE,MAAM,CAAA;IACjB,MAAM,EAAE,MAAM,CAAA;IACd,kBAAkB,EAAE,MAAM,CAAA;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED,MAAM,WAAW,oBAAoB;IACnC,UAAU,EAAE,MAAM,CAAA;IAClB,YAAY,EAAE,MAAM,CAAA;IACpB,UAAU,EAAE,iBAAiB,EAAE,CAAA;IAC/B,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,oBAAoB;IACnC,YAAY,EAAE,MAAM,CAAA;IACpB,IAAI,EAAE,OAAO,CAAA;IACb,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,MAAM,EAAE,aAAa,EAAE,CAAA;IACvB,OAAO,CAAC,EAAE,eAAe,CAAA;IACzB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC;AAED,MAAM,WAAW,qBAAqB;IACpC,MAAM,CACJ,UAAU,EAAE,kBAAkB,GAE5B,OAAO,CAAC,IAAI,CAAC,oBAAoB,EAAE,cAAc,CAAC,CAAC,GACnD,IAAI,CAAC,oBAAoB,EAAE,cAAc,CAAC,CAAA;CAC/C;AASD,qBAAa,+BAAgC,YAAW,uBAAuB;IAC7E,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAwC;IAE/D,IAAI,CAAC,UAAU,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,CAAC;IAInD,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC;IAKnD,IAAI,CAAC,MAAM,GAAE,wBAA6B,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAM1E,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAahF,WAAW,CACf,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,aAAa,EACpB,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC,kBAAkB,CAAC;CAoB/B;AAED,qBAAa,iCAAkC,YAAW,uBAAuB;IAC/E,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAC5B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAwC;IAC/D,OAAO,CAAC,MAAM,CAAQ;gBAEV,OAAO,EAAE;QAAE,GAAG,EAAE,MAAM,CAAA;KAAE;IAI9B,IAAI,CAAC,UAAU,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,CAAC;IAMnD,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC;IAKnD,IAAI,CAAC,MAAM,GAAE,wBAA6B,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAK1E,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,GAAG,OAAO,CAAC,kBAAkB,CAAC;IAOhF,WAAW,CACf,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,aAAa,EACpB,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC,kBAAkB,CAAC;YAOhB,MAAM;YAWN,IAAI;CA4BnB;AAED,wBAAgB,wBAAwB,CAAC,KAAK,EAAE;IAC9C,EAAE,CAAC,EAAE,MAAM,CAAA;IACX,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,IAAI,EAAE,YAAY,CAAA;IAClB,QAAQ,CAAC,EAAE,eAAe,EAAE,CAAA;IAC5B,MAAM,CAAC,EAAE,aAAa,EAAE,CAAA;IACxB,OAAO,CAAC,EAAE,eAAe,CAAA;IACzB,KAAK,CAAC,EAAE,YAAY,CAAA;IACpB,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC7B,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CACnC,GAAG,kBAAkB,CAkBrB;AAED,wBAAgB,mBAAmB,CACjC,UAAU,EAAE,IAAI,CAAC,kBAAkB,EAAE,IAAI,GAAG,WAAW,GAAG,YAAY,GAAG,MAAM,CAAC,EAChF,MAAM,GAAE,mBAAwB,GAC/B,YAAY,CAYd;AAED,wBAAgB,yBAAyB,CACvC,UAAU,EAAE,kBAAkB,EAC9B,MAAM,CAAC,EAAE,mBAAmB,GAC3B,kBAAkB,CAKpB;AAED,wBAAgB,mCAAmC,CACjD,UAAU,EAAE,kBAAkB,GAC7B,eAAe,CAYjB;AAED,wBAAgB,sCAAsC,CACpD,YAAY,EAAE,kBAAkB,EAAE,GACjC,eAAe,EAAE,CAEnB;AAED,wBAAgB,gCAAgC,CAC9C,UAAU,EAAE,kBAAkB,GAC7B,oBAAoB,CAgBtB;AAED,wBAAgB,mCAAmC,CACjD,YAAY,EAAE,kBAAkB,EAAE,GACjC,oBAAoB,EAAE,CAExB;AAED,wBAAsB,wBAAwB,CAC5C,UAAU,EAAE,kBAAkB,EAC9B,OAAO,EAAE,qBAAqB,GAC7B,OAAO,CAAC,oBAAoB,CAAC,CAgC/B;AAED,wBAAsB,0BAA0B,CAC9C,YAAY,EAAE,kBAAkB,EAAE,EAClC,OAAO,EAAE,qBAAqB,GAC7B,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAMjC;AAED,wBAAgB,yBAAyB,CACvC,YAAY,EAAE,kBAAkB,EAAE,EAClC,OAAO,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GACpC,qBAAqB,EAAE,CAyBzB;AAED,wBAAgB,8BAA8B,CAAC,OAAO,EAAE,qBAAqB,EAAE,GAAG,MAAM,CASvF;AAED,wBAAgB,kCAAkC,CAAC,YAAY,EAAE,kBAAkB,EAAE,GAAG,MAAM,CAM7F;AAED,wBAAgB,8BAA8B,CAAC,KAAK,EAAE,MAAM,GAAG,kBAAkB,EAAE,CAOlF;AAED,wBAAgB,8BAA8B,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,EAC3E,GAAG,EAAE,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,CAAC,EACrD,OAAO,GAAE;IACP,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,YAAY,CAAC,EAAE,oBAAoB,CAAA;IACnC,gBAAgB,CAAC,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,CAAC,KAAK,OAAO,CAAA;IACjF,sBAAsB,CAAC,EAAE,CACvB,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,CAAC,KAC9C,kBAAkB,GAAG,SAAS,CAAA;IACnC,SAAS,CAAC,EAAE,MAAM,CAAA;CACd,GACL,kBAAkB,CA6CpB"}

package/dist/feedback-trajectory.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=feedback-trajectory.test.d.ts.map

package/dist/feedback-trajectory.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"feedback-trajectory.test.d.ts","sourceRoot":"","sources":["../src/feedback-trajectory.test.ts"],"names":[],"mappings":""}

package/dist/flow-layer.d.ts

@@ -1,90 +0,0 @@
-/**
- * Flow layer — drive a previewed app through a scripted user walk.
- *
- * The MultiLayerVerifier already had a `flow` slot wired in
- * VerticalBench's verification-harness, but the layer module was
- * always-skipped ("flow layer module not yet wired"). This adds the
- * module: a Layer<Env> that takes a {@link FlowSpec} (URL + steps),
- * boots a preview server via the supplied {@link FlowRunner}, executes
- * each step, and returns a LayerResult whose `findings` enumerate
- * which step failed.
- *
- * The runner is injected so this module can swap between:
- *   - production: agent-browser CLI (a11y-tree based steps)
- *   - test: in-memory mock that returns canned step outcomes
- *   - future: Playwright, Puppeteer, custom scrapers
- *
- * Paired with {@link runIntentMatchJudge}: intent-match catches "wrong
- * app entirely"; flow-layer catches "right app but the buttons don't work."
- */
-import type { Layer, Severity } from './multi-layer-verifier';
-export type FlowAction = 'navigate' | 'click' | 'fill' | 'expect-text' | 'expect-element' | 'expect-url' | 'wait';
-export interface FlowStep {
-    /** What this step does. */
-    action: FlowAction;
-    /** Human-readable description for findings. */
-    describe?: string;
-    /**
-     * For navigate/expect-url: full URL. For click/fill/expect-element:
-     * accessible-name selector or CSS selector.
-     * For expect-text: substring expected on the page.
-     * For wait: ignored (use `value` for ms).
-     */
-    target?: string;
-    /** For fill: text to enter. For wait: ms. */
-    value?: string;
-    /** Severity of a failure. Default `major`. */
-    severity?: Severity;
-}
-export interface FlowSpec {
-    /** Initial URL the runner should open. */
-    url: string;
-    /** Ordered steps. Stops at the first failure unless `continueOnFail: true`. */
-    steps: FlowStep[];
-    /** When true, execute every step even after a failure (collect all findings). */
-    continueOnFail?: boolean;
-    /** Per-step wall cap (ms). Default 15s. */
-    stepTimeoutMs?: number;
-}
-export interface FlowRunnerStepResult {
-    ok: boolean;
-    /** Concrete observation: matched text snippet, captured URL, error message. */
-    evidence?: string;
-    /** Wall-clock duration of the step. */
-    durationMs?: number;
-}
-export interface FlowRunner {
-    /** Open the target URL. Returns when the page is interactable. */
-    open(url: string): Promise<FlowRunnerStepResult>;
-    /** Execute one step. The runner owns interpretation of `target`. */
-    step(step: FlowStep): Promise<FlowRunnerStepResult>;
-    /** Tear down browser, free resources. Always called once per layer.run. */
-    close(): Promise<void>;
-}
-export interface FlowLayerEnv {
-    /** Optional override per-call. Defaults supplied by the layer factory. */
-    flowSpec?: FlowSpec;
-}
-export interface FlowLayerFactoryInput {
-    /** Static spec (used when env doesn't supply one). */
-    flowSpec?: FlowSpec;
-    /** Build the runner per call (lets the layer create + tear down per leaf). */
-    runner: () => FlowRunner | Promise<FlowRunner>;
-    /** Layer name. Default `flow`. */
-    name?: string;
-    /** Layer dependencies — default `['serve']` so a non-booting preview skips us. */
-    dependsOn?: string[];
-    /** Layer weight for blendedScore (0..1+). Default 1. */
-    weight?: number;
-    /** Cap for the entire flow run (ms). Default 60s. */
-    capMs?: number;
-}
-/**
- * Build a flow layer that scripts a user walk via the supplied runner.
- *
- * Score: 1.0 when every step passed; otherwise 1 - (failedSteps / totalSteps).
- * Status: `pass` iff every step passed; `fail` if any step failed; `error`
- * on runner setup error; `skipped` when no flowSpec is available.
- */
-export declare function flowLayer<Env extends FlowLayerEnv = FlowLayerEnv>(input: FlowLayerFactoryInput): Layer<Env>;
-//# sourceMappingURL=flow-layer.d.ts.map

package/dist/flow-layer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"flow-layer.d.ts","sourceRoot":"","sources":["../src/flow-layer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAe,QAAQ,EAAE,MAAM,wBAAwB,CAAA;AAI1E,MAAM,MAAM,UAAU,GAClB,UAAU,GACV,OAAO,GACP,MAAM,GACN,aAAa,GACb,gBAAgB,GAChB,YAAY,GACZ,MAAM,CAAA;AAEV,MAAM,WAAW,QAAQ;IACvB,2BAA2B;IAC3B,MAAM,EAAE,UAAU,CAAA;IAClB,+CAA+C;IAC/C,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAA;IACd,8CAA8C;IAC9C,QAAQ,CAAC,EAAE,QAAQ,CAAA;CACpB;AAED,MAAM,WAAW,QAAQ;IACvB,0CAA0C;IAC1C,GAAG,EAAE,MAAM,CAAA;IACX,+EAA+E;IAC/E,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,iFAAiF;IACjF,cAAc,CAAC,EAAE,OAAO,CAAA;IACxB,2CAA2C;IAC3C,aAAa,CAAC,EAAE,MAAM,CAAA;CACvB;AAED,MAAM,WAAW,oBAAoB;IACnC,EAAE,EAAE,OAAO,CAAA;IACX,+EAA+E;IAC/E,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,uCAAuC;IACvC,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED,MAAM,WAAW,UAAU;IACzB,kEAAkE;IAClE,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAA;IAChD,oEAAoE;IACpE,IAAI,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAA;IACnD,2EAA2E;IAC3E,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;CACvB;AAED,MAAM,WAAW,YAAY;IAC3B,0EAA0E;IAC1E,QAAQ,CAAC,EAAE,QAAQ,CAAA;CACpB;AAED,MAAM,WAAW,qBAAqB;IACpC,sDAAsD;IACtD,QAAQ,CAAC,EAAE,QAAQ,CAAA;IACnB,8EAA8E;IAC9E,MAAM,EAAE,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAA;IAC9C,kCAAkC;IAClC,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,kFAAkF;IAClF,SAAS,CAAC,EAAE,MAAM,EAAE,CAAA;IACpB,wDAAwD;IACxD,MAAM,CAAC,EAAE,MAAM,CAAA;IACf,qDAAqD;IACrD,KAAK,CAAC,EAAE,MAAM,CAAA;CACf;AAID;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,GAAG,SAAS,YAAY,GAAG,YAAY,EAC/D,KAAK,EAAE,qBAAqB,GAC3B,KAAK,CAAC,GAAG,CAAC,CAqHZ"}

package/dist/flow-layer.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=flow-layer.test.d.ts.map

package/dist/flow-layer.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"flow-layer.test.d.ts","sourceRoot":"","sources":["../src/flow-layer.test.ts"],"names":[],"mappings":""}

package/dist/fuzz/capsule.d.ts

@@ -1,46 +0,0 @@
-/**
- * The capsule — the artifact every exploration produces.
- *
- * `buildCapsule` assembles coverage + verified findings + the QD archive into a
- * pure `CapsuleData` (no clock, no I/O — deterministic and snapshot-testable).
- * `renderCapsuleHtml` turns it into a standalone page: the input-cell heat-map
- * (planned vs covered), per-dimension weakness chips, and the minimized finding
- * exemplars. One artifact — the hardening map and the shareable proof object.
- */
-import type { EvalRecord } from './cube';
-import type { ArchiveEntry, CapsuleData, Cell, Finding } from './types';
-export interface BuildCapsuleInput<S> {
-    target: string;
-    objective: string;
-    cells: Cell[];
-    log: EvalRecord[];
-    /** The objective's notable threshold — drives findingRate. */
-    threshold: number;
-    archive: ArchiveEntry<S>[];
-    findings: Finding<S>[];
-    candidateFindings: number;
-    runsUsed: number;
-    /** Known-dollar / unknown-run split — present only when cost tracking was
-     *  wired; the capsule never fabricates a $0 total. */
-    cost?: {
-        costUsd: number;
-        costUnknownRuns: number;
-    };
-    /** Evaluations that threw — infra outcomes, never folded into robustness. */
-    evalErrors: number;
-    /** Set when the consecutive-error circuit breaker stopped the run early. */
-    stoppedEarly?: {
-        reason: 'eval-errors';
-        detail: string;
-    };
-}
-export declare function buildCapsule<S>(input: BuildCapsuleInput<S>): CapsuleData<S>;
-export interface RenderCapsuleOptions {
-    /** Max finding exemplars to show. Default 8. */
-    maxFindings?: number;
-    /** ISO timestamp to stamp into the page (keeps the pure capsule clock-free). */
-    generatedAt?: string;
-}
-/** Render a self-contained HTML capsule — heat-map + per-dimension chips + verified findings. */
-export declare function renderCapsuleHtml<S>(capsule: CapsuleData<S>, opts?: RenderCapsuleOptions): string;
-//# sourceMappingURL=capsule.d.ts.map

package/dist/fuzz/capsule.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"capsule.d.ts","sourceRoot":"","sources":["../../src/fuzz/capsule.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAA;AAExC,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,IAAI,EAA8B,OAAO,EAAE,MAAM,SAAS,CAAA;AAEnG,MAAM,WAAW,iBAAiB,CAAC,CAAC;IAClC,MAAM,EAAE,MAAM,CAAA;IACd,SAAS,EAAE,MAAM,CAAA;IACjB,KAAK,EAAE,IAAI,EAAE,CAAA;IACb,GAAG,EAAE,UAAU,EAAE,CAAA;IACjB,8DAA8D;IAC9D,SAAS,EAAE,MAAM,CAAA;IACjB,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAA;IAC1B,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAA;IACtB,iBAAiB,EAAE,MAAM,CAAA;IACzB,QAAQ,EAAE,MAAM,CAAA;IAChB;0DACsD;IACtD,IAAI,CAAC,EAAE;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,eAAe,EAAE,MAAM,CAAA;KAAE,CAAA;IACnD,6EAA6E;IAC7E,UAAU,EAAE,MAAM,CAAA;IAClB,4EAA4E;IAC5E,YAAY,CAAC,EAAE;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAA;CACzD;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAiC3E;AAqGD,MAAM,WAAW,oBAAoB;IACnC,gDAAgD;IAChD,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,gFAAgF;IAChF,WAAW,CAAC,EAAE,MAAM,CAAA;CACrB;AAED,iGAAiG;AACjG,wBAAgB,iBAAiB,CAAC,CAAC,EACjC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,EACvB,IAAI,GAAE,oBAAyB,GAC9B,MAAM,CAgFR"}

package/dist/fuzz/cube.d.ts

@@ -1,36 +0,0 @@
-/**
- * Input-space tiling + coverage projection.
- *
- * Cells are the cartesian product of the input axes — the stratification plan,
- * enumerable up front so the planned-vs-covered denominator is honest. Coverage
- * is projected from the evaluation log: per cell, the full DISTRIBUTION of the
- * headline score, of each scored dimension, and of evaluation latency — a bare
- * mean hides outliers, so every aggregate carries its spread. Per-cell cost is
- * split known-dollars vs unknown-runs, never folded into a fabricated $0.
- */
-import type { BehaviorSpace, Cell, CoverageCell, Distribution, Evaluation } from './types';
-/** One recorded evaluation — the unit coverage and the capsule are built from. */
-export interface EvalRecord {
-    cell: Cell;
-    ev: Evaluation;
-    /** The objective's interest score for this evaluation. */
-    interest: number;
-    /** Evaluation wall-clock — engine-measured unless `ev.latencyMs` overrode it. */
-    latencyMs: number;
-    /** Known dollars for this run. `null` = cost tracking was wired but this
-     *  run's cost was unknowable (counted apart). Absent = not tracked at all. */
-    costUsd?: number | null;
-}
-/** Enumerate every input cell (cartesian product of the axes), in stable order. */
-export declare function enumerateCells(space: BehaviorSpace): Cell[];
-/** Deterministic id for a coordinate map, e.g. `matterType=nda|difficulty=hard`. */
-export declare function cellId(space: BehaviorSpace, coords: Record<string, string>): string;
-/** Summarize a sample. Throws on an empty sample — callers represent "no data"
- *  as `null`, never as a zeroed distribution. */
-export declare function distribution(values: number[]): Distribution;
-/**
- * Project the evaluation log into the per-input-cell coverage map. A cell with
- * no evaluations reports `score: null` (honestly uncovered), never zeros.
- */
-export declare function buildCoverage(cells: Cell[], log: EvalRecord[], threshold: number): CoverageCell[];
-//# sourceMappingURL=cube.d.ts.map

package/dist/fuzz/cube.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cube.d.ts","sourceRoot":"","sources":["../../src/fuzz/cube.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,SAAS,CAAA;AAE1F,kFAAkF;AAClF,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,IAAI,CAAA;IACV,EAAE,EAAE,UAAU,CAAA;IACd,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,CAAA;IAChB,iFAAiF;IACjF,SAAS,EAAE,MAAM,CAAA;IACjB;kFAC8E;IAC9E,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CACxB;AAED,mFAAmF;AACnF,wBAAgB,cAAc,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI,EAAE,CAW3D;AAED,oFAAoF;AACpF,wBAAgB,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM,CAEnF;AAQD;iDACiD;AACjD,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY,CAa3D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,YAAY,EAAE,CA0CjG"}

package/dist/fuzz/explorer-cost.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=explorer-cost.test.d.ts.map

package/dist/fuzz/explorer-cost.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"explorer-cost.test.d.ts","sourceRoot":"","sources":["../../src/fuzz/explorer-cost.test.ts"],"names":[],"mappings":""}

package/dist/fuzz/explorer.d.ts

@@ -1,64 +0,0 @@
-/**
- * The exploration engine — a stateful session over a behavior space.
- *
- * Each `step()`: allocate budget across INPUT cells (floor first, then variance
- * steering toward the least-certain cells), propose candidates (the proposer
- * reads current elites + findings, so the search deepens generationally),
- * evaluate with bounded concurrency, archive the most interesting scenario per
- * input×measured bin, and admit notable candidates that pass the validity gates.
- * `run()` loops to budget. `coverage()`/`findings()`/`capsule()` read live state —
- * the surface `makeExploreTools` exposes so an agent can drive the session.
- *
- * One evaluation log (`EvalRecord[]`) is the source of truth; allocation
- * observations and coverage are projections of it.
- */
-import type { CapsuleData, CoverageCell, ExploreOptions, Finding } from './types';
-export declare class BehaviorExplorer<S> {
-    private readonly opts;
-    private readonly cells;
-    private readonly cellById;
-    private readonly objective;
-    private readonly threshold;
-    private readonly floorPerCell;
-    private readonly perRoundBudget;
-    /** The single evaluation log — coverage + allocation are projections of it. */
-    private readonly log;
-    /** binId (input × measured coords) → the most interesting entry seen. */
-    private readonly archiveByBin;
-    private readonly _findings;
-    private runsUsed;
-    private candidateFindings;
-    private evalErrors;
-    private consecutiveEvalErrors;
-    private stoppedEarly;
-    private rngState;
-    /** Accumulated KNOWN dollars — unknown-cost runs never inflate it. */
-    private spentKnownUsd;
-    private costUnknownRuns;
-    constructor(opts: ExploreOptions<S>);
-    private rng;
-    private binId;
-    private allocate;
-    private objectiveContext;
-    /** Mirrors control-runtime: stop once accumulated KNOWN cost ≥ the ceiling. */
-    private costExhausted;
-    /** Fold one run's cost in: null counts as unknown (never $0); a known cost
-     *  accrues toward the budget, lands in the ledger, and fires `onCost`. */
-    /** Returns the run's known cost, `null` when tracked-but-unknown, `undefined`
-     *  when cost tracking is not wired — the log row mirrors this exactly. */
-    private recordRunCost;
-    /** Elites whose INPUT cell matches — what the proposer mutates/deepens from. */
-    private elitesFor;
-    /** One allocate → propose → evaluate → gate → archive round. */
-    step(): Promise<{
-        runs: number;
-        findings: Finding<S>[];
-    }>;
-    /** Loop `step()` until the run or dollar budget is spent, the signal aborts,
-     *  or no progress is made. */
-    run(): Promise<CapsuleData<S>>;
-    coverage(): CoverageCell[];
-    findings(): Finding<S>[];
-    capsule(): CapsuleData<S>;
-}
-//# sourceMappingURL=explorer.d.ts.map

package/dist/fuzz/explorer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"explorer.d.ts","sourceRoot":"","sources":["../../src/fuzz/explorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAQH,OAAO,KAAK,EAEV,WAAW,EAEX,YAAY,EAEZ,cAAc,EACd,OAAO,EAER,MAAM,SAAS,CAAA;AAuBhB,qBAAa,gBAAgB,CAAC,CAAC;IAuBjB,OAAO,CAAC,QAAQ,CAAC,IAAI;IAtBjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAQ;IAC9B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAmB;IAC5C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAW;IACrC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAQ;IAClC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAQ;IACrC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAQ;IAEvC,+EAA+E;IAC/E,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAiD;IACrE,yEAAyE;IACzE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAqC;IAClE,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAmB;IAC7C,OAAO,CAAC,QAAQ,CAAI;IACpB,OAAO,CAAC,iBAAiB,CAAI;IAC7B,OAAO,CAAC,UAAU,CAAI;IACtB,OAAO,CAAC,qBAAqB,CAAI;IACjC,OAAO,CAAC,YAAY,CAAuD;IAC3E,OAAO,CAAC,QAAQ,CAAQ;IACxB,sEAAsE;IACtE,OAAO,CAAC,aAAa,CAAI;IACzB,OAAO,CAAC,eAAe,CAAI;gBAEE,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC;IAiCpD,OAAO,CAAC,GAAG,CAMV;IAED,OAAO,CAAC,KAAK;IASb,OAAO,CAAC,QAAQ;IAiBhB,OAAO,CAAC,gBAAgB;IAQxB,+EAA+E;IAC/E,OAAO,CAAC,aAAa;IAIrB;8EAC0E;IAC1E;8EAC0E;IAC1E,OAAO,CAAC,aAAa;IAyBrB,gFAAgF;IAChF,OAAO,CAAC,SAAS;IAMjB,gEAAgE;IAC1D,IAAI,IAAI,OAAO,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAA;KAAE,CAAC;IAwI/D;kCAC8B;IACxB,GAAG,IAAI,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAapC,QAAQ,IAAI,YAAY,EAAE;IAI1B,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE;IAIxB,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;CAkB1B"}

package/dist/fuzz/fuzz-agent.d.ts

@@ -1,16 +0,0 @@
-/**
- * `fuzzAgent` — the adversarial batch preset over `BehaviorExplorer`.
- *
- * One call: explore the space to budget with the adversarial objective and
- * return the capsule. For agent-driven, incremental, or multi-objective use,
- * construct a `BehaviorExplorer` and drive it via `makeExploreTools`.
- */
-import type { CapsuleData, ExploreOptions } from './types';
-export type FuzzAgentOptions<S> = Omit<ExploreOptions<S>, 'objective'> & {
-    /** Score strictly below this is a candidate failure. Default 0.5. */
-    failureThreshold?: number;
-};
-export declare function fuzzAgent<S>(opts: FuzzAgentOptions<S>): Promise<{
-    capsule: CapsuleData<S>;
-}>;
-//# sourceMappingURL=fuzz-agent.d.ts.map

package/dist/fuzz/fuzz-agent.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fuzz-agent.d.ts","sourceRoot":"","sources":["../../src/fuzz/fuzz-agent.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,SAAS,CAAA;AAE1D,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG;IACvE,qEAAqE;IACrE,gBAAgB,CAAC,EAAE,MAAM,CAAA;CAC1B,CAAA;AAED,wBAAsB,SAAS,CAAC,CAAC,EAC/B,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,GACxB,OAAO,CAAC;IAAE,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,CAAA;CAAE,CAAC,CAOtC"}

package/dist/fuzz/fuzz-agent.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=fuzz-agent.test.d.ts.map

package/dist/fuzz/fuzz-agent.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"fuzz-agent.test.d.ts","sourceRoot":"","sources":["../../src/fuzz/fuzz-agent.test.ts"],"names":[],"mappings":""}

package/dist/fuzz/gates.d.ts

@@ -1,33 +0,0 @@
-/**
- * Validity gates — what separates a fuzzer from a slop generator.
- *
- * A notable candidate is admitted only when it is fair and reproducible. None of
- * these are on by default: the live wiring opts in, so reported findings carry
- * their proof.
- */
-import type { Evaluator, ValidityGates } from './types';
-/** Combine gate sets; a candidate must pass every gate in every set. */
-export declare function composeGates<S>(...sets: Array<ValidityGates<S> | undefined>): ValidityGates<S>;
-/**
- * Reproducibility gate. Re-run the target on a meaning-preserving rephrase of the
- * flagged scenario; keep the finding only when the rephrase ALSO scores below the
- * threshold. A finding that flips under a cosmetic rewrite was keyed to surface
- * form, not the task — a false signal we must not report. Costs one extra
- * evaluation per candidate (candidates are rare, so cheap).
- */
-export declare function perturbationStabilityGate<S>(opts: {
-    evaluate: Evaluator<S>;
-    /** Produce a semantic-preserving rephrase. Return null to skip (treated as pass). */
-    perturb: (scenario: S) => S | null;
-    /** Score strictly below this still counts as failing. Default 0.5. */
-    failureThreshold?: number;
-}): ValidityGates<S>;
-/**
- * Severity-floor gate. Reject borderline candidates whose score sits in a band
- * just under the threshold — judge noise, not a real defect.
- */
-export declare function severityFloorGate<S>(opts: {
-    failureThreshold?: number;
-    margin?: number;
-}): ValidityGates<S>;
-//# sourceMappingURL=gates.d.ts.map

package/dist/fuzz/gates.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"gates.d.ts","sourceRoot":"","sources":["../../src/fuzz/gates.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAoB,SAAS,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAEzE,wEAAwE;AACxE,wBAAgB,YAAY,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAgB9F;AAED;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CAAC,CAAC,EAAE,IAAI,EAAE;IACjD,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,CAAA;IACtB,qFAAqF;IACrF,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAA;IAClC,sEAAsE;IACtE,gBAAgB,CAAC,EAAE,MAAM,CAAA;CAC1B,GAAG,aAAa,CAAC,CAAC,CAAC,CAUnB;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,EAAE;IACzC,gBAAgB,CAAC,EAAE,MAAM,CAAA;IACzB,MAAM,CAAC,EAAE,MAAM,CAAA;CAChB,GAAG,aAAa,CAAC,CAAC,CAAC,CAMnB"}

package/dist/fuzz/index.d.ts

@@ -1,26 +0,0 @@
-/**
- * `@tangle-network/agent-eval/fuzz` — behavior-space exploration.
- *
- * Search a target's behavior space for verified findings: tile the input plan,
- * steer budget toward the least-certain cells, mutate (or skill-generate)
- * scenarios, bin a quality-diversity archive by measured behavior, and admit
- * only findings that pass the validity gates. Every run emits a `CapsuleData`
- * artifact — coverage heat-map + minimized verified findings.
- *
- * Entry points: `fuzzAgent` (adversarial batch preset), `BehaviorExplorer` +
- * `makeExploreTools` (the agent-driven session). Evaluations ARE
- * `DefaultVerdict`s — the same spine as judges and verifiers.
- */
-export type { BuildCapsuleInput, RenderCapsuleOptions } from './capsule';
-export { buildCapsule, renderCapsuleHtml } from './capsule';
-export type { EvalRecord } from './cube';
-export { buildCoverage, cellId, enumerateCells } from './cube';
-export { BehaviorExplorer } from './explorer';
-export type { FuzzAgentOptions } from './fuzz-agent';
-export { fuzzAgent } from './fuzz-agent';
-export { composeGates, perturbationStabilityGate, severityFloorGate } from './gates';
-export { adversarialObjective, mutationProposer, noveltyObjective } from './policies';
-export type { ExploreToolDef } from './tools';
-export { makeExploreTools } from './tools';
-export type { ArchiveEntry, BehaviorSpace, CapsuleData, Cell, CoverageCell, Evaluation, Evaluator, ExploreEvent, ExploreOptions, Finding, Objective, ObjectiveContext, ProposeContext, Proposer, RunCost, SpaceAxis, ValidityGates, } from './types';
-//# sourceMappingURL=index.d.ts.map