@vauban-org/agent-sdk 0.16.0

package/dist/compute/strategies/best-of-n.js

@@ -0,0 +1,112 @@
+/**
+ * src/compute/strategies/best-of-n.ts
+ *
+ * Best-of-N (BoN) compute strategy.
+ *
+ * Samples N candidates from the generator, scores each via either a
+ * caller-supplied {@link Verifier} OR a {@link BestOfNRewardModel}, and
+ * returns the highest-scoring candidate.
+ *
+ * Caller MUST supply exactly one of `verifier` or `rewardModel`. Supplying
+ * both, or neither, throws at strategy-construction time.
+ *
+ * Tie-break: stable — the first candidate (by sampling order) wins among ties.
+ */
+const STRATEGY_NAME = "best-of-n";
+// ---------------------------------------------------------------------------
+// Implementation
+// ---------------------------------------------------------------------------
+/**
+ * Returns a {@link Strategy} that samples N candidates and returns the
+ * highest-scoring one.
+ *
+ * @throws RangeError when `n < 1`.
+ * @throws Error when neither or both of `verifier`/`rewardModel` are supplied.
+ */
+export function bestOfNStrategy(opts) {
+    if (!Number.isInteger(opts.n) || opts.n < 1) {
+        throw new RangeError(`bestOfNStrategy: n must be an integer >= 1, got ${String(opts.n)}`);
+    }
+    const hasVerifier = opts.verifier !== undefined;
+    const hasReward = opts.rewardModel !== undefined;
+    if (hasVerifier === hasReward) {
+        throw new Error("BestOfN requires exactly one of verifier|rewardModel");
+    }
+    const n = opts.n;
+    const parallel = opts.parallel ?? true;
+    const verifier = opts.verifier;
+    const rewardModel = opts.rewardModel;
+    const scoreOne = async (candidate) => {
+        if (verifier !== undefined) {
+            const r = await verifier.evaluate(candidate);
+            return r.score;
+        }
+        // rewardModel guaranteed defined by XOR check above.
+        return await rewardModel.score(candidate);
+    };
+    return {
+        name: STRATEGY_NAME,
+        async run(input, generator, ctx = {}) {
+            const start = performance.now();
+            const signal = ctx.signal;
+            const throwIfAborted = () => {
+                if (signal?.aborted) {
+                    throw signal.reason ?? new DOMException("Aborted", "AbortError");
+                }
+            };
+            throwIfAborted();
+            // ── Phase 1: sample N candidates ────────────────────────────────────
+            let candidates;
+            if (parallel) {
+                const tasks = [];
+                for (let i = 0; i < n; i++) {
+                    tasks.push(generator(input, ctx));
+                }
+                // If any rejects, Promise.all rejects with the first rejection.
+                // We do not abort siblings (no internal AbortController by design):
+                // the caller's signal — if any — propagates via ctx.
+                candidates = await Promise.all(tasks);
+            }
+            else {
+                candidates = [];
+                for (let i = 0; i < n; i++) {
+                    throwIfAborted();
+                    candidates.push(await generator(input, ctx));
+                }
+            }
+            throwIfAborted();
+            // ── Phase 2: score every candidate ─────────────────────────────────
+            const scores = parallel
+                ? await Promise.all(candidates.map((c) => Promise.resolve(scoreOne(c))))
+                : await (async () => {
+                    const out = [];
+                    for (const c of candidates) {
+                        out.push(await scoreOne(c));
+                    }
+                    return out;
+                })();
+            // ── Phase 3: pick best (stable, first-occurrence tie-break) ────────
+            let bestIdx = 0;
+            let bestScore = scores[0] ?? Number.NEGATIVE_INFINITY;
+            for (let i = 1; i < scores.length; i++) {
+                const s = scores[i];
+                if (s > bestScore) {
+                    bestScore = s;
+                    bestIdx = i;
+                }
+            }
+            const latency_ms = performance.now() - start;
+            return {
+                result: candidates[bestIdx],
+                metadata: {
+                    strategy: STRATEGY_NAME,
+                    candidates: candidates.length,
+                    verifier_scores: scores,
+                    cost: { calls: candidates.length },
+                    latency_ms,
+                },
+            };
+        },
+    };
+}
+//# sourceMappingURL=best-of-n.js.map

package/dist/compute/strategies/best-of-n.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"best-of-n.js","sourceRoot":"","sources":["../../../src/compute/strategies/best-of-n.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,MAAM,aAAa,GAAG,WAAW,CAAC;AA6BlC,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAqC;IAErC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,UAAU,CAAC,mDAAmD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5F,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC;IAChD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC;IACjD,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;IAErC,MAAM,QAAQ,GAAG,KAAK,EAAE,SAAkB,EAAmB,EAAE;QAC7D,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC7C,OAAO,CAAC,CAAC,KAAK,CAAC;QACjB,CAAC;QACD,qDAAqD;QACrD,OAAO,MAAO,WAA2C,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC7E,CAAC,CAAC;IAEF,OAAO;QACL,IAAI,EAAE,aAAa;QAEnB,KAAK,CAAC,GAAG,CACP,KAAa,EACb,SAAmE,EACnE,MAAsB,EAAE;YAExB,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;YAE1B,MAAM,cAAc,GAAG,GAAS,EAAE;gBAChC,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;oBACpB,MAAM,MAAM,CAAC,MAAM,IAAI,IAAI,YAAY,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC,CAAC;YAEF,cAAc,EAAE,CAAC;YAEjB,uEAAuE;YACvE,IAAI,UAAqB,CAAC;YAC1B,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,KAAK,GAAuB,EAAE,CAAC;gBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;gBACpC,CAAC;gBACD,gEAAgE;gBAChE,oEAAoE;gBACpE,qDAAqD;gBACrD,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACN,UAAU,GAAG,EAAE,CAAC;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,cAAc,EAAE,CAAC;oBACjB,UAAU,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;gBAC/C,CAAC;YACH,CAAC;YAED,cAAc,EAAE,CAAC;YAEjB,sEAAsE;YACtE,MAAM,MAAM,GAAa,QAAQ;gBAC/B,CAAC,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE;oBAChB,MAAM,GAAG,GAAa,EAAE,CAAC;oBACzB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;wBAC3B,GAAG,CAAC,IAAI,CAAC,MAAM,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9B,CAAC;oBACD,OAAO,GAAG,CAAC;gBACb,CAAC,CAAC,EAAE,CAAC;YAET,sEAAsE;YACtE,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAW,CAAC;gBAC9B,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC;oBAClB,SAAS,GAAG,CAAC,CAAC;oBACd,OAAO,GAAG,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;YAED,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;YAE7C,OAAO;gBACL,MAAM,EAAE,UAAU,CAAC,OAAO,CAAY;gBACtC,QAAQ,EAAE;oBACR,QAAQ,EAAE,aAAa;oBACvB,UAAU,EAAE,UAAU,CAAC,MAAM;oBAC7B,eAAe,EAAE,MAAM;oBACvB,IAAI,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,MAAM,EAAE;oBAClC,UAAU;iBACX;aACF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/compute/strategies/bon-mav.d.ts

@@ -0,0 +1,65 @@
+/**
+ * src/compute/strategies/bon-mav.ts
+ *
+ * BoN-MAV — Best-of-N with Multi-Agent Verification.
+ *
+ * Reference: Lifshitz et al. 2025, "Multi-Agent Verification: Scaling
+ * Test-Time Compute with Multiple Verifiers", arXiv:2502.20379.
+ *
+ * Algorithm (paper § 2.3):
+ *   1. Sample N candidate outputs from the generator.
+ *   2. For each candidate, run M aspect verifiers in parallel → score matrix [N][M].
+ *   3. Aggregate per-candidate score (paper baseline: unweighted mean of binary votes,
+ *      Eq. 1 § 2.2). We expose four modes: mean | median | min | majority-vote.
+ *   4. Return argmax candidate (ties → first occurrence).
+ *
+ * See docs/papers/bon-mav-notes.md for the paper distillation.
+ */
+import type { Strategy, StrategyResult } from "../types.js";
+import type { Verifier } from "../verifier.js";
+export type MAVAggregation = "mean" | "median" | "min" | "majority-vote";
+export interface BonMavOptions<TOutput> {
+    /** Candidate count (>= 1). */
+    n: number;
+    /** Aspect verifiers (M >= 1). All run on every candidate. */
+    verifiers: readonly Verifier<TOutput>[];
+    /** Aggregation across verifiers. Default "mean" (paper baseline on continuous scores). */
+    aggregation?: MAVAggregation;
+    /** Generate candidates concurrently. Default true. */
+    parallel?: boolean;
+    /**
+     * Threshold for "majority-vote" aggregation: a verifier score >= threshold
+     * counts as a "yes" vote. Default 0.5. Ignored for other aggregations.
+     */
+    voteThreshold?: number;
+}
+/**
+ * BoN-MAV-specific metadata extension.
+ * `verifier_scores[i]` = AGGREGATED score of candidate i (length N).
+ * `mavMatrix[i][j]` = raw score from verifier j on candidate i (N × M).
+ */
+export interface BonMavMetadata {
+    strategy: string;
+    candidates: number;
+    verifier_scores: number[];
+    mavMatrix: number[][];
+    aggregation: MAVAggregation;
+    cost: {
+        calls: number;
+    };
+    latency_ms: number;
+}
+export interface BonMavResult<TOutput> extends StrategyResult<TOutput> {
+    metadata: BonMavMetadata;
+}
+/**
+ * Construct a BoN-MAV {@link Strategy}.
+ *
+ * Validation:
+ * - `n < 1` → RangeError
+ * - `verifiers.length < 1` → Error
+ * - unknown `aggregation` → Error
+ * - `voteThreshold` out of [0,1] → RangeError
+ */
+export declare function bonMavStrategy<TInput, TOutput>(opts: BonMavOptions<TOutput>): Strategy<TInput, TOutput>;
+//# sourceMappingURL=bon-mav.d.ts.map

package/dist/compute/strategies/bon-mav.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bon-mav.d.ts","sourceRoot":"","sources":["../../../src/compute/strategies/bon-mav.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAkB,QAAQ,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAK/C,MAAM,MAAM,cAAc,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,GAAG,eAAe,CAAC;AAEzE,MAAM,WAAW,aAAa,CAAC,OAAO;IACpC,8BAA8B;IAC9B,CAAC,EAAE,MAAM,CAAC;IACV,6DAA6D;IAC7D,SAAS,EAAE,SAAS,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;IACxC,0FAA0F;IAC1F,WAAW,CAAC,EAAE,cAAc,CAAC;IAC7B,sDAAsD;IACtD,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB,WAAW,EAAE,cAAc,CAAC;IAC5B,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY,CAAC,OAAO,CAAE,SAAQ,cAAc,CAAC,OAAO,CAAC;IACpE,QAAQ,EAAE,cAAc,CAAC;CAC1B;AAmDD;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,OAAO,EAC5C,IAAI,EAAE,aAAa,CAAC,OAAO,CAAC,GAC3B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAmG3B"}

package/dist/compute/strategies/bon-mav.js

@@ -0,0 +1,154 @@
+/**
+ * src/compute/strategies/bon-mav.ts
+ *
+ * BoN-MAV — Best-of-N with Multi-Agent Verification.
+ *
+ * Reference: Lifshitz et al. 2025, "Multi-Agent Verification: Scaling
+ * Test-Time Compute with Multiple Verifiers", arXiv:2502.20379.
+ *
+ * Algorithm (paper § 2.3):
+ *   1. Sample N candidate outputs from the generator.
+ *   2. For each candidate, run M aspect verifiers in parallel → score matrix [N][M].
+ *   3. Aggregate per-candidate score (paper baseline: unweighted mean of binary votes,
+ *      Eq. 1 § 2.2). We expose four modes: mean | median | min | majority-vote.
+ *   4. Return argmax candidate (ties → first occurrence).
+ *
+ * See docs/papers/bon-mav-notes.md for the paper distillation.
+ */
+import { assertVerifierResult } from "../verifier.js";
+// ─── Aggregation helpers ─────────────────────────────────────────────────────
+function aggregate(row, mode, voteThreshold) {
+    const m = row.length;
+    if (m === 0)
+        return 0;
+    switch (mode) {
+        case "mean": {
+            let s = 0;
+            for (const x of row)
+                s += x;
+            return s / m;
+        }
+        case "median": {
+            const sorted = [...row].sort((a, b) => a - b);
+            const mid = Math.floor(m / 2);
+            return m % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid];
+        }
+        case "min": {
+            let lo = row[0];
+            for (let i = 1; i < m; i++)
+                if (row[i] < lo)
+                    lo = row[i];
+            return lo;
+        }
+        case "majority-vote": {
+            let votes = 0;
+            for (const x of row)
+                if (x >= voteThreshold)
+                    votes += 1;
+            return votes / m;
+        }
+        default: {
+            // Exhaustiveness — unreachable if MAVAggregation is honored.
+            const _exhaustive = mode;
+            throw new Error(`Unknown aggregation mode: ${String(_exhaustive)}`);
+        }
+    }
+}
+// ─── Strategy ────────────────────────────────────────────────────────────────
+const STRATEGY_NAME = "bon-mav";
+const VALID_AGGREGATIONS = new Set(["mean", "median", "min", "majority-vote"]);
+function throwIfAborted(signal) {
+    if (signal?.aborted) {
+        throw signal.reason instanceof Error
+            ? signal.reason
+            : new DOMException("Aborted", "AbortError");
+    }
+}
+/**
+ * Construct a BoN-MAV {@link Strategy}.
+ *
+ * Validation:
+ * - `n < 1` → RangeError
+ * - `verifiers.length < 1` → Error
+ * - unknown `aggregation` → Error
+ * - `voteThreshold` out of [0,1] → RangeError
+ */
+export function bonMavStrategy(opts) {
+    const { n, verifiers, aggregation = "mean", parallel = true, voteThreshold = 0.5 } = opts;
+    if (!Number.isInteger(n) || n < 1) {
+        throw new RangeError(`bonMavStrategy: n must be a positive integer, got ${n}`);
+    }
+    if (!verifiers || verifiers.length < 1) {
+        throw new Error("BoN-MAV requires at least 1 verifier");
+    }
+    if (!VALID_AGGREGATIONS.has(aggregation)) {
+        throw new Error(`bonMavStrategy: unknown aggregation "${aggregation}"`);
+    }
+    if (typeof voteThreshold !== "number" ||
+        !Number.isFinite(voteThreshold) ||
+        voteThreshold < 0 ||
+        voteThreshold > 1) {
+        throw new RangeError(`bonMavStrategy: voteThreshold must be in [0,1], got ${voteThreshold}`);
+    }
+    const strategyLabel = `${STRATEGY_NAME}-${aggregation}`;
+    return {
+        name: strategyLabel,
+        async run(input, generator, ctx = {}) {
+            const start = performance.now();
+            const signal = ctx.signal;
+            throwIfAborted(signal);
+            // ── Step 1: sample N candidates ──
+            const childCtx = { signal };
+            let candidates;
+            if (parallel) {
+                candidates = await Promise.all(Array.from({ length: n }, () => generator(input, childCtx)));
+            }
+            else {
+                candidates = [];
+                for (let i = 0; i < n; i++) {
+                    throwIfAborted(signal);
+                    candidates.push(await generator(input, childCtx));
+                }
+            }
+            throwIfAborted(signal);
+            // ── Step 2: run M verifiers on each candidate (full N×M parallel) ──
+            const flat = await Promise.all(candidates.flatMap((cand) => verifiers.map(async (v) => {
+                const r = await v.evaluate(cand);
+                assertVerifierResult(r);
+                return r.score;
+            })));
+            throwIfAborted(signal);
+            const m = verifiers.length;
+            const mavMatrix = [];
+            for (let i = 0; i < n; i++) {
+                mavMatrix.push(flat.slice(i * m, (i + 1) * m));
+            }
+            // ── Step 3: aggregate per-candidate ──
+            const aggregated = mavMatrix.map((row) => aggregate(row, aggregation, voteThreshold));
+            // ── Step 4: argmax (first occurrence on ties) ──
+            let bestIdx = 0;
+            let bestScore = aggregated[0];
+            for (let i = 1; i < n; i++) {
+                if (aggregated[i] > bestScore) {
+                    bestScore = aggregated[i];
+                    bestIdx = i;
+                }
+            }
+            const latency_ms = performance.now() - start;
+            return {
+                result: candidates[bestIdx],
+                metadata: {
+                    strategy: strategyLabel,
+                    candidates: n,
+                    verifier_scores: aggregated,
+                    mavMatrix,
+                    aggregation,
+                    // Paper compute accounting (§ 3): only generator calls billed.
+                    cost: { calls: n },
+                    latency_ms,
+                },
+            };
+        },
+    };
+}
+//# sourceMappingURL=bon-mav.js.map

package/dist/compute/strategies/bon-mav.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bon-mav.js","sourceRoot":"","sources":["../../../src/compute/strategies/bon-mav.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAyCtD,gFAAgF;AAEhF,SAAS,SAAS,CAAC,GAAsB,EAAE,IAAoB,EAAE,aAAqB;IACpF,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtB,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,CAAC,IAAI,GAAG;gBAAE,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzE,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE;oBAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACzD,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,GAAG;gBAAE,IAAI,CAAC,IAAI,aAAa;oBAAE,KAAK,IAAI,CAAC,CAAC;YACxD,OAAO,KAAK,GAAG,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;YACR,6DAA6D;YAC7D,MAAM,WAAW,GAAU,IAAI,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,6BAA6B,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF,MAAM,aAAa,GAAG,SAAS,CAAC;AAEhC,MAAM,kBAAkB,GAAwB,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC;AAEpG,SAAS,cAAc,CAAC,MAA+B;IACrD,IAAI,MAAM,EAAE,OAAO,EAAE,CAAC;QACpB,MAAM,MAAM,CAAC,MAAM,YAAY,KAAK;YAClC,CAAC,CAAC,MAAM,CAAC,MAAM;YACf,CAAC,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAChD,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAC5B,IAA4B;IAE5B,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,WAAW,GAAG,MAAM,EAAE,QAAQ,GAAG,IAAI,EAAE,aAAa,GAAG,GAAG,EAAE,GAAG,IAAI,CAAC;IAE1F,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,qDAAqD,CAAC,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,wCAAwC,WAAW,GAAG,CAAC,CAAC;IAC1E,CAAC;IACD,IACE,OAAO,aAAa,KAAK,QAAQ;QACjC,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC;QAC/B,aAAa,GAAG,CAAC;QACjB,aAAa,GAAG,CAAC,EACjB,CAAC;QACD,MAAM,IAAI,UAAU,CAAC,uDAAuD,aAAa,EAAE,CAAC,CAAC;IAC/F,CAAC;IAED,MAAM,aAAa,GAAG,GAAG,aAAa,IAAI,WAAW,EAAE,CAAC;IAExD,OAAO;QACL,IAAI,EAAE,aAAa;QAEnB,KAAK,CAAC,GAAG,CACP,KAAa,EACb,SAAmE,EACnE,MAAsB,EAAE;YAExB,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;YAC1B,cAAc,CAAC,MAAM,CAAC,CAAC;YAEvB,oCAAoC;YACpC,MAAM,QAAQ,GAAmB,EAAE,MAAM,EAAE,CAAC;YAC5C,IAAI,UAAqB,CAAC;YAC1B,IAAI,QAAQ,EAAE,CAAC;gBACb,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9F,CAAC;iBAAM,CAAC;gBACN,UAAU,GAAG,EAAE,CAAC;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,cAAc,CAAC,MAAM,CAAC,CAAC;oBACvB,UAAU,CAAC,IAAI,CAAC,MAAM,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC;gBACpD,CAAC;YACH,CAAC;YACD,cAAc,CAAC,MAAM,CAAC,CAAC;YAEvB,sEAAsE;YACtE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAC5B,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAC1B,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;gBACxB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACjC,oBAAoB,CAAC,CAAC,CAAC,CAAC;gBACxB,OAAO,CAAC,CAAC,KAAK,CAAC;YACjB,CAAC,CAAC,CACH,CACF,CAAC;YACF,cAAc,CAAC,MAAM,CAAC,CAAC;YAEvB,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;YAC3B,MAAM,SAAS,GAAe,EAAE,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjD,CAAC;YAED,wCAAwC;YACxC,MAAM,UAAU,GAAa,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CACjD,SAAS,CAAC,GAAG,EAAE,WAAW,EAAE,aAAa,CAAC,CAC3C,CAAC;YAEF,kDAAkD;YAClD,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,CAAC;oBAC9B,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAC1B,OAAO,GAAG,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;YAED,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;YAE7C,OAAO;gBACL,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC;gBAC3B,QAAQ,EAAE;oBACR,QAAQ,EAAE,aAAa;oBACvB,UAAU,EAAE,CAAC;oBACb,eAAe,EAAE,UAAU;oBAC3B,SAAS;oBACT,WAAW;oBACX,+DAA+D;oBAC/D,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE;oBAClB,UAAU;iBACX;aACF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/compute/strategies/single-shot.d.ts

@@ -0,0 +1,17 @@
+/**
+ * src/compute/strategies/single-shot.ts
+ *
+ * Passthrough baseline strategy: calls the generator exactly once, no retries, no scoring.
+ */
+import type { Strategy } from "../types.js";
+/**
+ * Returns a {@link Strategy} that invokes the generator once and returns its result.
+ *
+ * Metadata:
+ * - `candidates`: 1
+ * - `verifier_scores`: []
+ * - `cost.calls`: 1
+ * - `latency_ms`: wall-clock duration via `performance.now()`
+ */
+export declare function singleShotStrategy<TInput, TOutput>(): Strategy<TInput, TOutput>;
+//# sourceMappingURL=single-shot.d.ts.map

package/dist/compute/strategies/single-shot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"single-shot.d.ts","sourceRoot":"","sources":["../../../src/compute/strategies/single-shot.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAkB,QAAQ,EAAkB,MAAM,aAAa,CAAC;AAI5E;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,OAAO,KAAK,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAyB/E"}

package/dist/compute/strategies/single-shot.js

@@ -0,0 +1,36 @@
+/**
+ * src/compute/strategies/single-shot.ts
+ *
+ * Passthrough baseline strategy: calls the generator exactly once, no retries, no scoring.
+ */
+const STRATEGY_NAME = "single-shot";
+/**
+ * Returns a {@link Strategy} that invokes the generator once and returns its result.
+ *
+ * Metadata:
+ * - `candidates`: 1
+ * - `verifier_scores`: []
+ * - `cost.calls`: 1
+ * - `latency_ms`: wall-clock duration via `performance.now()`
+ */
+export function singleShotStrategy() {
+    return {
+        name: STRATEGY_NAME,
+        async run(input, generator, ctx = {}) {
+            const start = performance.now();
+            const result = await generator(input, ctx);
+            const latency_ms = performance.now() - start;
+            return {
+                result,
+                metadata: {
+                    strategy: STRATEGY_NAME,
+                    candidates: 1,
+                    verifier_scores: [],
+                    cost: { calls: 1 },
+                    latency_ms,
+                },
+            };
+        },
+    };
+}
+//# sourceMappingURL=single-shot.js.map

package/dist/compute/strategies/single-shot.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"single-shot.js","sourceRoot":"","sources":["../../../src/compute/strategies/single-shot.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,MAAM,aAAa,GAAG,aAAa,CAAC;AAEpC;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO;QACL,IAAI,EAAE,aAAa;QAEnB,KAAK,CAAC,GAAG,CACP,KAAa,EACb,SAAmE,EACnE,MAAsB,EAAE;YAExB,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC3C,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;YAE7C,OAAO;gBACL,MAAM;gBACN,QAAQ,EAAE;oBACR,QAAQ,EAAE,aAAa;oBACvB,UAAU,EAAE,CAAC;oBACb,eAAe,EAAE,EAAE;oBACnB,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE;oBAClB,UAAU;iBACX;aACF,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/compute/types.d.ts

@@ -0,0 +1,30 @@
+/**
+ * src/compute/types.ts
+ *
+ * Shared types for compute strategies.
+ * Minimal surface — only what single-shot (and future strategies) need.
+ */
+export interface ComputeContext {
+    signal?: AbortSignal;
+}
+export interface StrategyResult<T> {
+    result: T;
+    metadata: {
+        strategy: string;
+        /** Number of candidates generated (1 for single-shot). */
+        candidates: number;
+        /** Verifier scores per candidate (empty for single-shot). */
+        verifier_scores: number[];
+        cost: {
+            /** Number of generator calls made. */
+            calls: number;
+        };
+        /** Wall-clock latency in milliseconds. */
+        latency_ms: number;
+    };
+}
+export interface Strategy<TInput, TOutput> {
+    readonly name: string;
+    run(input: TInput, generator: (input: TInput, ctx: ComputeContext) => Promise<TOutput>, ctx?: ComputeContext): Promise<StrategyResult<TOutput>>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/compute/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/compute/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,cAAc;IAC7B,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,cAAc,CAAC,CAAC;IAC/B,MAAM,EAAE,CAAC,CAAC;IACV,QAAQ,EAAE;QACR,QAAQ,EAAE,MAAM,CAAC;QACjB,0DAA0D;QAC1D,UAAU,EAAE,MAAM,CAAC;QACnB,6DAA6D;QAC7D,eAAe,EAAE,MAAM,EAAE,CAAC;QAC1B,IAAI,EAAE;YACJ,sCAAsC;YACtC,KAAK,EAAE,MAAM,CAAC;SACf,CAAC;QACF,0CAA0C;QAC1C,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC;CACH;AAED,MAAM,WAAW,QAAQ,CAAC,MAAM,EAAE,OAAO;IACvC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,GAAG,CACD,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,KAAK,OAAO,CAAC,OAAO,CAAC,EACnE,GAAG,CAAC,EAAE,cAAc,GACnB,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;CACrC"}

package/dist/compute/types.js

@@ -0,0 +1,8 @@
+/**
+ * src/compute/types.ts
+ *
+ * Shared types for compute strategies.
+ * Minimal surface — only what single-shot (and future strategies) need.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/compute/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/compute/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG"}

package/dist/compute/verifier.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Verifier — caller-provided domain-specific evaluation interface.
+ *
+ * Design intent:
+ * - No built-in verifier pool or registry. Each caller constructs their own
+ *   verifier that encodes domain knowledge (math, code correctness, policy, …).
+ * - `evaluate` may be sync or async to accommodate both lightweight heuristics
+ *   and LLM-backed judges without forcing unnecessary Promise overhead.
+ * - `name` is mandatory for telemetry correlation (spans, metrics, logs).
+ */
+/** Output of a single verifier evaluation. */
+export interface VerifierResult {
+    /**
+     * Continuous score in [0, 1] inclusive.
+     * 0 = reject (completely wrong), 1 = accept (fully correct).
+     * Intermediate values signal partial quality (e.g. 0.75 = mostly correct).
+     */
+    score: number;
+    /** Human-readable explanation of the score for debugging and audit. */
+    rationale: string;
+}
+/**
+ * Domain-specific verifier supplied by the caller.
+ *
+ * @typeParam TOutput - Shape of the agent output being evaluated.
+ *   Defaults to `unknown` so callers can start untyped and tighten later.
+ */
+export interface Verifier<TOutput = unknown> {
+    /**
+     * Stable identifier used in telemetry (spans, metrics, audit logs).
+     * Recommended format: kebab-case, e.g. "math-correctness", "policy-guard".
+     */
+    readonly name: string;
+    /**
+     * Evaluate the agent output and return a quality score with rationale.
+     *
+     * Returning a plain `VerifierResult` (no Promise) is allowed for sync
+     * verifiers to avoid unnecessary microtask overhead. Callers that `await`
+     * the result handle both cases transparently.
+     */
+    evaluate(output: TOutput): Promise<VerifierResult> | VerifierResult;
+}
+/**
+ * Assert that `r` is a valid {@link VerifierResult} at runtime.
+ *
+ * Throws a `TypeError` with a descriptive message when:
+ * - `r` is null or not an object
+ * - `score` is not a finite number in [0, 1]
+ * - `rationale` is not a string
+ *
+ * Use this after `await verifier.evaluate(output)` when the verifier is
+ * provided by untrusted third-party code.
+ */
+export declare function assertVerifierResult(r: VerifierResult): void;
+//# sourceMappingURL=verifier.d.ts.map

package/dist/compute/verifier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"verifier.d.ts","sourceRoot":"","sources":["../../src/compute/verifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,8CAA8C;AAC9C,MAAM,WAAW,cAAc;IAC7B;;;;OAIG;IACH,KAAK,EAAE,MAAM,CAAC;IACd,uEAAuE;IACvE,SAAS,EAAE,MAAM,CAAC;CACnB;AAID;;;;;GAKG;AACH,MAAM,WAAW,QAAQ,CAAC,OAAO,GAAG,OAAO;IACzC;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;;;;;OAMG;IACH,QAAQ,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC,cAAc,CAAC,GAAG,cAAc,CAAC;CACrE;AAID;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,cAAc,GAAG,IAAI,CAoB5D"}

package/dist/compute/verifier.js

@@ -0,0 +1,35 @@
+/**
+ * Verifier — caller-provided domain-specific evaluation interface.
+ *
+ * Design intent:
+ * - No built-in verifier pool or registry. Each caller constructs their own
+ *   verifier that encodes domain knowledge (math, code correctness, policy, …).
+ * - `evaluate` may be sync or async to accommodate both lightweight heuristics
+ *   and LLM-backed judges without forcing unnecessary Promise overhead.
+ * - `name` is mandatory for telemetry correlation (spans, metrics, logs).
+ */
+// ─── Runtime guard ───────────────────────────────────────────────────────────
+/**
+ * Assert that `r` is a valid {@link VerifierResult} at runtime.
+ *
+ * Throws a `TypeError` with a descriptive message when:
+ * - `r` is null or not an object
+ * - `score` is not a finite number in [0, 1]
+ * - `rationale` is not a string
+ *
+ * Use this after `await verifier.evaluate(output)` when the verifier is
+ * provided by untrusted third-party code.
+ */
+export function assertVerifierResult(r) {
+    if (r === null || r === undefined || typeof r !== "object") {
+        throw new TypeError(`assertVerifierResult: expected an object, got ${r === null ? "null" : typeof r}`);
+    }
+    const { score, rationale } = r;
+    if (typeof score !== "number" || !Number.isFinite(score) || score < 0 || score > 1) {
+        throw new TypeError(`assertVerifierResult: score must be a finite number in [0,1], got ${String(score)}`);
+    }
+    if (typeof rationale !== "string") {
+        throw new TypeError(`assertVerifierResult: rationale must be a string, got ${typeof rationale}`);
+    }
+}
+//# sourceMappingURL=verifier.js.map

package/dist/compute/verifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verifier.js","sourceRoot":"","sources":["../../src/compute/verifier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAyCH,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAAC,CAAiB;IACpD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC3D,MAAM,IAAI,SAAS,CACjB,iDAAiD,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAClF,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,CAAuC,CAAC;IAErE,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACnF,MAAM,IAAI,SAAS,CACjB,qEAAqE,MAAM,CAAC,KAAK,CAAC,EAAE,CACrF,CAAC;IACJ,CAAC;IAED,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE,CAAC;QAClC,MAAM,IAAI,SAAS,CACjB,yDAAyD,OAAO,SAAS,EAAE,CAC5E,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/compute/with-compute.d.ts

@@ -0,0 +1,50 @@
+/**
+ * src/compute/with-compute.ts
+ *
+ * Public `withCompute()` API — caller-explicit strategy entry point.
+ *
+ * Contract (Sprint A):
+ * - Strategy is REQUIRED and explicit (no auto-routing).
+ * - Returns `StrategyResult<O>` whose `metadata.strategy` equals the strategy's `name`.
+ * - Pre-flight guards run BEFORE invoking the generator:
+ *     1. `strategy` must be a non-null object with a usable `run` function.
+ *     2. `budget.maxCalls === 0` → throw `BudgetExhaustedError`.
+ *     3. `deadline` already past → throw `DeadlineExceededError`.
+ *     4. `signal` already aborted → throw the signal's `reason` (DOMException 'AbortError' by default).
+ * - Generator rejections bubble up unchanged.
+ */
+import type { ComputeContext, Strategy, StrategyResult } from "./types.js";
+export declare class InvalidStrategyError extends Error {
+    readonly name = "InvalidStrategyError";
+    constructor(message?: string);
+}
+export declare class BudgetExhaustedError extends Error {
+    readonly name = "BudgetExhaustedError";
+    constructor(message?: string);
+}
+export declare class DeadlineExceededError extends Error {
+    readonly name = "DeadlineExceededError";
+    constructor(message?: string);
+}
+export interface ComputeBudget {
+    /** Maximum number of generator calls allowed. `0` halts immediately. */
+    maxCalls?: number;
+}
+export interface WithComputeOptions<TInput, TOutput> {
+    /** Caller-explicit strategy. No auto-routing. */
+    strategy: Strategy<TInput, TOutput>;
+    /** Generator invoked by the strategy. */
+    generator: (input: TInput, ctx: ComputeContext) => Promise<TOutput>;
+    /** Optional cost cap. */
+    budget?: ComputeBudget;
+    /** Epoch milliseconds. If `Date.now() >= deadline` at entry, throws. */
+    deadline?: number;
+    /** Optional cancellation signal — wired into ComputeContext. */
+    signal?: AbortSignal;
+}
+export type WithComputeResult<TOutput> = StrategyResult<TOutput>;
+/**
+ * Run a compute task under an explicit strategy with pre-flight budget/deadline/abort guards.
+ */
+export declare function withCompute<TInput, TOutput>(input: TInput, options: WithComputeOptions<TInput, TOutput>): Promise<WithComputeResult<TOutput>>;
+//# sourceMappingURL=with-compute.d.ts.map

package/dist/compute/with-compute.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"with-compute.d.ts","sourceRoot":"","sources":["../../src/compute/with-compute.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAM3E,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,SAAkB,IAAI,0BAA0B;gBACpC,OAAO,SAAyE;CAG7F;AAED,qBAAa,oBAAqB,SAAQ,KAAK;IAC7C,SAAkB,IAAI,0BAA0B;gBACpC,OAAO,SAA+C;CAGnE;AAED,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,SAAkB,IAAI,2BAA2B;gBACrC,OAAO,SAAqD;CAGzE;AAMD,MAAM,WAAW,aAAa;IAC5B,wEAAwE;IACxE,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,kBAAkB,CAAC,MAAM,EAAE,OAAO;IACjD,iDAAiD;IACjD,QAAQ,EAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpC,yCAAyC;IACzC,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;IACpE,yBAAyB;IACzB,MAAM,CAAC,EAAE,aAAa,CAAC;IACvB,wEAAwE;IACxE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,gEAAgE;IAChE,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,MAAM,iBAAiB,CAAC,OAAO,IAAI,cAAc,CAAC,OAAO,CAAC,CAAC;AAYjE;;GAEG;AACH,wBAAsB,WAAW,CAAC,MAAM,EAAE,OAAO,EAC/C,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,GAC3C,OAAO,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAwBrC"}