@claudexor/budget 3.0.4 → 3.1.1

package/dist/index.d.ts

@@ -1,5 +1,5 @@
 export * from "./ledger.js";
 export * from "./router.js";
 export * from "./observe.js";
-export { loadHarnessMetrics, recordHarnessMetric, metricsPath, type HarnessMetric, type HarnessMetrics, } from "./metrics.js";
+export { loadHarnessMetrics, recordHarnessMetric } from "./metrics.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,OAAO,EACL,kBAAkB,EAClB,mBAAmB,EACnB,WAAW,EACX,KAAK,aAAa,EAClB,KAAK,cAAc,GACpB,MAAM,cAAc,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC"}

package/dist/index.js

@@ -1,5 +1,5 @@
 export * from "./ledger.js";
 export * from "./router.js";
 export * from "./observe.js";
-export { loadHarnessMetrics, recordHarnessMetric, metricsPath, } from "./metrics.js";
+export { loadHarnessMetrics, recordHarnessMetric } from "./metrics.js";
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,OAAO,EACL,kBAAkB,EAClB,mBAAmB,EACnB,WAAW,GAGZ,MAAM,cAAc,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC"}

package/dist/router.d.ts

@@ -1,11 +1,36 @@
-import type { BillingKnowledge, CredentialRoute, EffortHint, Intent, PaidFallback, QualityTierSet, RoutingGoal } from "@claudexor/schema";
+import type { AuthVerification, BillingKnowledge, CredentialRoute, EffortHint, Intent, PaidFallback, QualityTierSet, RouteRankingRationale, RoutingGoal } from "@claudexor/schema";
 import type { BudgetLedger } from "./ledger.js";
+/**
+ * The typed auth-route evidence a route ran (or would run) under — the doctor's
+ * `auth_sources` verification for the credential source plus the concrete
+ * `credential_route` receipt. This is the ONLY sanctioned source of billing
+ * knowledge (INV-060 / schema `auth.ts`: a credential transport alone never
+ * proves entitlement or zero cost, but a VERIFIED native/subscription route is
+ * a subscription-entitlement fact). No per-vendor price table is inferred.
+ */
+export interface RouteAuthEvidence {
+    route: CredentialRoute | null;
+    verification: AuthVerification;
+}
+/**
+ * Billing knowledge derived STRICTLY from the typed auth route (QA-034). A
+ * verified vendor-native route proves `subscription_entitlement`; a managed
+ * API-key route is `metered` and is NEVER presumed free; every other route
+ * (unverified native, credential-free local, unknown) stays `unknown`. This is
+ * the missing production producer the schema/router already knew how to consume.
+ */
+export declare function billingKnowledgeForAuthRoute(evidence: RouteAuthEvidence): BillingKnowledge;
 export interface RouterCandidate {
     harnessId: string;
     available: boolean;
     model?: string;
     effort?: EffortHint;
     billingKnowledge?: BillingKnowledge;
+    /** Typed auth-route evidence. When present it is AUTHORITATIVE for billing
+     * knowledge (derived via billingKnowledgeForAuthRoute), so a verified native
+     * route survives paid_fallback:never and ranks with a real economy tuple.
+     * Falls back to the explicit billingKnowledge (else unknown) when absent. */
+    authRoute?: RouteAuthEvidence;
     incrementalCostUsd?: number | null;
     credentialRoute?: CredentialRoute;
     /** Effective credential subject for quota filtering (release wave round-16
@@ -20,11 +45,27 @@ export interface RouteContext {
     intent: Intent;
     qualityTiers: QualityTierSet;
     ledger: BudgetLedger;
+    /**
+     * The instant EVERY clock-dependent axis is evaluated at (cooldown expiry and
+     * quota pace slack). Optional: each entry point pins one `Date.now()` for the
+     * whole call when it is absent. A caller that ranks a pool and then explains
+     * the SAME pool must pass a pinned instant so both passes read one clock.
+     */
+    now?: number;
 }
 export declare class RoutingPreflightError extends Error {
     readonly code = "routing_preflight_refused";
 }
 /** Order candidates transparently; lower tuple values win. Unknown quota remains eligible. */
-export declare function rankHarnesses(candidates: RouterCandidate[], ctx: RouteContext): RouterCandidate[];
+export declare function rankHarnesses(candidates: RouterCandidate[], context: RouteContext): RouterCandidate[];
 export declare function selectHarness(candidates: RouterCandidate[], ctx: RouteContext): RouterCandidate | null;
+/**
+ * Explain a ranking as a typed record (QA-034): the per-candidate billing/cost
+ * tuple, the eligible/dropped split, and the DECISIVE reason. Kept axis-aligned
+ * with rankHarnesses so the recorded rationale can never disagree with the
+ * order actually taken. Prose-free; a surface projects it, never reconstructs it.
+ * The shape is the schema-owned RouteRankingRationale (snake_case) so it can be
+ * persisted verbatim as RunTelemetry.routing_rationale.
+ */
+export declare function explainRanking(candidates: RouterCandidate[], context: RouteContext): RouteRankingRationale;
 //# sourceMappingURL=router.d.ts.map

package/dist/router.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"router.d.ts","sourceRoot":"","sources":["../src/router.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,gBAAgB,EAChB,eAAe,EACf,UAAU,EACV,MAAM,EACN,YAAY,EACZ,cAAc,EACd,WAAW,EACZ,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IACpC,kBAAkB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,eAAe,CAAC,EAAE,eAAe,CAAC;IAClC;;;qEAGiE;IACjE,mBAAmB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACrC;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,WAAW,CAAC;IAClB,YAAY,EAAE,YAAY,CAAC;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,cAAc,CAAC;IAC7B,MAAM,EAAE,YAAY,CAAC;CACtB;AAED,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,QAAQ,CAAC,IAAI,+BAA+B;CAC7C;AAqCD,8FAA8F;AAC9F,wBAAgB,aAAa,CAAC,UAAU,EAAE,eAAe,EAAE,EAAE,GAAG,EAAE,YAAY,GAAG,eAAe,EAAE,CAmCjG;AAED,wBAAgB,aAAa,CAC3B,UAAU,EAAE,eAAe,EAAE,EAC7B,GAAG,EAAE,YAAY,GAChB,eAAe,GAAG,IAAI,CAExB"}
+{"version":3,"file":"router.d.ts","sourceRoot":"","sources":["../src/router.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,gBAAgB,EAChB,gBAAgB,EAChB,eAAe,EACf,UAAU,EACV,MAAM,EACN,YAAY,EACZ,cAAc,EAEd,qBAAqB,EAErB,WAAW,EACZ,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAEhD;;;;;;;GAOG;AACH,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,eAAe,GAAG,IAAI,CAAC;IAC9B,YAAY,EAAE,gBAAgB,CAAC;CAChC;AAED;;;;;;GAMG;AACH,wBAAgB,4BAA4B,CAAC,QAAQ,EAAE,iBAAiB,GAAG,gBAAgB,CAM1F;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IACpC;;;iFAG6E;IAC7E,SAAS,CAAC,EAAE,iBAAiB,CAAC;IAC9B,kBAAkB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,eAAe,CAAC,EAAE,eAAe,CAAC;IAClC;;;qEAGiE;IACjE,mBAAmB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACrC;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,WAAW,CAAC;IAClB,YAAY,EAAE,YAAY,CAAC;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,cAAc,CAAC;IAC7B,MAAM,EAAE,YAAY,CAAC;IACrB;;;;;OAKG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAED,qBAAa,qBAAsB,SAAQ,KAAK;IAC9C,QAAQ,CAAC,IAAI,+BAA+B;CAC7C;AAkHD,8FAA8F;AAC9F,wBAAgB,aAAa,CAC3B,UAAU,EAAE,eAAe,EAAE,EAC7B,OAAO,EAAE,YAAY,GACpB,eAAe,EAAE,CAwBnB;AAED,wBAAgB,aAAa,CAC3B,UAAU,EAAE,eAAe,EAAE,EAC7B,GAAG,EAAE,YAAY,GAChB,eAAe,GAAG,IAAI,CAExB;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC5B,UAAU,EAAE,eAAe,EAAE,EAC7B,OAAO,EAAE,YAAY,GACpB,qBAAqB,CAgBvB"}

package/dist/router.js

@@ -1,3 +1,18 @@
+/**
+ * Billing knowledge derived STRICTLY from the typed auth route (QA-034). A
+ * verified vendor-native route proves `subscription_entitlement`; a managed
+ * API-key route is `metered` and is NEVER presumed free; every other route
+ * (unverified native, credential-free local, unknown) stays `unknown`. This is
+ * the missing production producer the schema/router already knew how to consume.
+ */
+export function billingKnowledgeForAuthRoute(evidence) {
+    if (evidence.route === "managed_api_key")
+        return "metered";
+    if (evidence.route === "vendor_native" && evidence.verification === "passed") {
+        return "subscription_entitlement";
+    }
+    return "unknown";
+}
 export class RoutingPreflightError extends Error {
     code = "routing_preflight_refused";
 }
@@ -8,12 +23,30 @@ function tierIndex(candidate, ctx) {
         route.effort === candidate.effort));
     return index < 0 ? null : index;
 }
+/** Effective billing knowledge: the typed auth route is authoritative when
+ * present (QA-034), else the explicitly supplied value, else unknown. */
+function effectiveBilling(candidate) {
+    if (candidate.authRoute)
+        return billingKnowledgeForAuthRoute(candidate.authRoute);
+    return candidate.billingKnowledge ?? "unknown";
+}
 function isIncrementalPaid(candidate) {
-    return !["proven_zero", "subscription_entitlement"].includes(candidate.billingKnowledge ?? "unknown");
+    return !["proven_zero", "subscription_entitlement"].includes(effectiveBilling(candidate));
+}
+/**
+ * Pin ONE evaluation instant for a whole ranking pass. Reading the clock again
+ * per candidate makes the comparator time-varying: two candidates carrying
+ * IDENTICAL quota observations get slacks that differ by whatever milliseconds
+ * elapsed between the two reads, so a pool nothing actually separates is
+ * ordered by scheduler jitter and reports `expiring_quota_slack` instead of the
+ * honest `declared_order`. The pin is what makes equal inputs compare equal.
+ */
+function pinInstant(ctx) {
+    return ctx.now === undefined ? { ...ctx, now: Date.now() } : ctx;
 }
 function eligible(candidates, ctx) {
     const ready = candidates.filter((candidate) => candidate.available &&
-        !ctx.ledger.cooldownActive(candidate.harnessId, candidate.credentialRoute, candidate.credentialSubjectId));
+        !ctx.ledger.cooldownActive(candidate.harnessId, candidate.credentialRoute, candidate.credentialSubjectId, ctx.now));
     const free = ready.filter((candidate) => !isIncrementalPaid(candidate));
     if (ctx.paidFallback === "never")
         return free;
@@ -21,36 +54,171 @@ function eligible(candidates, ctx) {
         return free;
     return ready;
 }
+/** User-declared tier index the comparators order by (missing => MAX). Shared
+ * by the sort and the traced comparator so a "tier" claim is never re-derived. */
+function tierValueOf(candidate, ctx) {
+    return tierIndex(candidate, ctx) ?? Number.MAX_SAFE_INTEGER;
+}
+/** Binding pace slack the `auto` comparator orders by; null = none observed.
+ * Evaluated at the pass-wide pinned instant (`ctx.now`) — never at a freshly
+ * read clock, which would make two identical quota states differ. */
+function autoSlack(candidate, ctx) {
+    return ctx.ledger.bindingPaceSlack(candidate.harnessId, candidate.credentialRoute, candidate.credentialSubjectId, ctx.now);
+}
+/** null slack collapses to this so a slack-carrying candidate always outranks a
+ * slack-less one, exactly as the comparator subtraction does. */
+const AUTO_SLACK_ABSENT = Number.NEGATIVE_INFINITY;
+/**
+ * The SINGLE traced comparator for `auto` (round-4 #3 — this rationale has been
+ * wrong three times). It returns both the pair ORDER and the AXIS that produced
+ * it, and is the only place the auto ordering is defined. `rankHarnesses` sorts
+ * by `.order`; `rankingReason` reads `.axis`. Deriving the recorded reason from
+ * the very comparator that ordered the pool makes it structurally impossible for
+ * the rationale to claim a factor the sort did not use (the axis-registry
+ * pattern used in arbitration, specialized to auto's conditional slack axis).
+ *
+ * The slack axis is in force whenever EITHER candidate has a non-null slack; the
+ * subtraction of the (null => -Infinity) effective values is what decides — so
+ * two EQUAL non-null slacks yield order 0 and a null axis (declared order, and
+ * the sort does NOT fall through to tiers). Only when BOTH slacks are absent
+ * does the comparator compare tier indices.
+ *
+ * Both slacks are read at the pass-wide pinned instant (`ctx.now`), so the
+ * subtraction compares two quota states and nothing else. Re-reading the clock
+ * per candidate made the comparator time-varying and broke exactly the
+ * guarantee above: equal quota states produced a non-zero order.
+ */
+function compareAutoTraced(a, b, ctx) {
+    const aSlack = autoSlack(a, ctx);
+    const bSlack = autoSlack(b, ctx);
+    if (aSlack !== null || bSlack !== null) {
+        const order = (bSlack ?? AUTO_SLACK_ABSENT) - (aSlack ?? AUTO_SLACK_ABSENT);
+        return { order, axis: order !== 0 ? "expiring_quota_slack" : null };
+    }
+    const order = tierValueOf(a, ctx) - tierValueOf(b, ctx);
+    return { order, axis: order !== 0 ? "quality_tier" : null };
+}
 /** Order candidates transparently; lower tuple values win. Unknown quota remains eligible. */
-export function rankHarnesses(candidates, ctx) {
+export function rankHarnesses(candidates, context) {
+    const ctx = pinInstant(context);
     const routes = eligible(candidates, ctx);
     if (ctx.goal === "quality" && routes.every((candidate) => tierIndex(candidate, ctx) === null)) {
         throw new RoutingPreflightError(`quality routing requires a comparable user-declared tier for intent '${ctx.intent}'`);
     }
+    if (ctx.goal === "auto") {
+        return routes.toSorted((a, b) => compareAutoTraced(a, b, ctx).order);
+    }
     return routes.toSorted((a, b) => {
-        const aTier = tierIndex(a, ctx) ?? Number.MAX_SAFE_INTEGER;
-        const bTier = tierIndex(b, ctx) ?? Number.MAX_SAFE_INTEGER;
+        const aTier = tierValueOf(a, ctx);
+        const bTier = tierValueOf(b, ctx);
         if (ctx.goal === "quality")
             return aTier - bTier;
-        if (ctx.goal === "economy") {
-            const aPaid = isIncrementalPaid(a) ? 1 : 0;
-            const bPaid = isIncrementalPaid(b) ? 1 : 0;
-            const paidOrder = aPaid - bPaid;
-            if (paidOrder !== 0)
-                return paidOrder;
-            const aCost = a.incrementalCostUsd ?? Number.POSITIVE_INFINITY;
-            const bCost = b.incrementalCostUsd ?? Number.POSITIVE_INFINITY;
-            return aCost - bCost || aTier - bTier;
-        }
-        const aSlack = ctx.ledger.bindingPaceSlack(a.harnessId, a.credentialRoute, a.credentialSubjectId);
-        const bSlack = ctx.ledger.bindingPaceSlack(b.harnessId, b.credentialRoute, b.credentialSubjectId);
-        if (aSlack !== null || bSlack !== null) {
-            return (bSlack ?? Number.NEGATIVE_INFINITY) - (aSlack ?? Number.NEGATIVE_INFINITY);
-        }
-        return aTier - bTier;
+        // economy
+        const aPaid = isIncrementalPaid(a) ? 1 : 0;
+        const bPaid = isIncrementalPaid(b) ? 1 : 0;
+        const paidOrder = aPaid - bPaid;
+        if (paidOrder !== 0)
+            return paidOrder;
+        const aCost = a.incrementalCostUsd ?? Number.POSITIVE_INFINITY;
+        const bCost = b.incrementalCostUsd ?? Number.POSITIVE_INFINITY;
+        return aCost - bCost || aTier - bTier;
     });
 }
 export function selectHarness(candidates, ctx) {
     return rankHarnesses(candidates, ctx)[0] ?? null;
 }
+/**
+ * Explain a ranking as a typed record (QA-034): the per-candidate billing/cost
+ * tuple, the eligible/dropped split, and the DECISIVE reason. Kept axis-aligned
+ * with rankHarnesses so the recorded rationale can never disagree with the
+ * order actually taken. Prose-free; a surface projects it, never reconstructs it.
+ * The shape is the schema-owned RouteRankingRationale (snake_case) so it can be
+ * persisted verbatim as RunTelemetry.routing_rationale.
+ */
+export function explainRanking(candidates, context) {
+    // ONE instant for both passes: the sort and the reason walk must read the same
+    // clock, or the recorded rationale can disagree with the order it explains.
+    const ctx = pinInstant(context);
+    const rankedCandidates = rankHarnesses(candidates, ctx);
+    const order = rankedCandidates.map((c) => c.harnessId);
+    const eligibleIds = new Set(order);
+    const entries = candidates.map((c) => ({
+        harness_id: c.harnessId,
+        billing_knowledge: effectiveBilling(c),
+        incremental_cost_usd: c.incrementalCostUsd ?? null,
+        eligible: eligibleIds.has(c.harnessId),
+    }));
+    const dropped = candidates.filter((c) => !eligibleIds.has(c.harnessId)).map((c) => c.harnessId);
+    const reason = rankingReason(ctx, rankedCandidates, candidates);
+    return { goal: ctx.goal, paid_fallback: ctx.paidFallback, order, dropped, reason, entries };
+}
+/** Do the ranked candidates carry two distinct user-declared tier indices? Only
+ * then did the tier comparator (the auto/economy tie-break) actually decide the
+ * order; a single candidate or a uniform tier index leaves the declared order. */
+function tiersDistinguish(ranked, ctx) {
+    const indices = ranked.map((c) => tierIndex(c, ctx) ?? Number.MAX_SAFE_INTEGER);
+    return indices.some((value) => value !== indices[0]);
+}
+/** Do the ranked candidates carry two distinct incremental costs (with the SAME
+ * missing-cost fallback the economy sort uses)? Only then did the cost
+ * comparator — not the paid/free split above it or the tier tie-break below —
+ * actually decide the order. */
+function costsDistinguish(ranked) {
+    const costs = ranked.map((c) => c.incrementalCostUsd ?? Number.POSITIVE_INFINITY);
+    return costs.some((value) => value !== costs[0]);
+}
+/**
+ * The DECISIVE comparator axis. For `auto` the reason is read directly off the
+ * SAME traced comparator that ordered the pool (`compareAutoTraced`) — never
+ * re-derived from a separately-recomputed condition (round-4 #3, the third
+ * recurrence of a rationale that disagreed with `rankHarnesses`): the reason is
+ * whichever axis actually separated an adjacent ranked pair, and `declared_order`
+ * when the comparator broke no pair (e.g. equal non-null slacks — which do NOT
+ * fall through to tiers).
+ */
+function rankingReason(ctx, ranked, candidates) {
+    if (ctx.goal === "quality")
+        return "quality_tier";
+    if (ctx.goal === "auto") {
+        // Walk the ranked order through the very comparator that produced it. Since
+        // the pool is sorted, any two distinct axis values leave a differing
+        // adjacent pair, so this sees every axis the sort actually used.
+        const axes = new Set();
+        for (let i = 0; i + 1 < ranked.length; i++) {
+            const traced = compareAutoTraced(ranked[i], ranked[i + 1], ctx);
+            if (traced.axis)
+                axes.add(traced.axis);
+        }
+        if (axes.has("expiring_quota_slack"))
+            return "expiring_quota_slack";
+        if (axes.has("quality_tier"))
+            return "quality_tier";
+        return "declared_order";
+    }
+    // economy: mirror the economy sort tuple EXACTLY — (isIncrementalPaid,
+    // incrementalCostUsd, tierIndex) — and report the FIRST axis that actually
+    // SEPARATED the pool. Reporting entitlement whenever ANY route is entitled was
+    // wrong when they are ALL entitled and cost/tier did the deciding (the same
+    // correction made for `auto` in 1d6a2a50).
+    const someEntitled = ranked.some((c) => !isIncrementalPaid(c));
+    // Entitlement decided when the pool actually WEIGHED an entitled route against
+    // a paid one — whether the paid route was ranked BELOW (sort axis 1) or DROPPED
+    // by paid_fallback (both are the entitled-preferred-over-paid outcome). When
+    // every route CONSIDERED is entitled, entitlement did not decide — cost/tier
+    // did (the round-3 correction; matches the pool-wide `auto` mirror in
+    // 1d6a2a50). The full candidate set (not just the eligible pool) is consulted
+    // so a paid route dropped by paid_fallback:never still attributes the outcome.
+    const anyPaidConsidered = candidates.some((c) => isIncrementalPaid(c));
+    if (someEntitled && anyPaidConsidered)
+        return "subscription_entitlement_first";
+    if (costsDistinguish(ranked))
+        return "lowest_incremental_cash";
+    if (tiersDistinguish(ranked, ctx))
+        return "quality_tier";
+    // Nothing separated the pool: distinguish "we could not compare cash at all"
+    // from a genuine declared-order tie.
+    if (ranked.length > 0 && ranked.some((c) => c.incrementalCostUsd == null))
+        return "all_incremental_cash_unknown";
+    return "declared_order";
+}
 //# sourceMappingURL=router.js.map

package/dist/router.js.map

@@ -1 +1 @@
-{"version":3,"file":"router.js","sourceRoot":"","sources":["../src/router.ts"],"names":[],"mappings":"AAkCA,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IACrC,IAAI,GAAG,2BAA2B,CAAC;CAC7C;AAED,SAAS,SAAS,CAAC,SAA0B,EAAE,GAAiB;IAC9D,MAAM,KAAK,GAAG,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACjD,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CACrC,IAAI,CAAC,IAAI,CACP,CAAC,KAAK,EAAE,EAAE,CACR,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,SAAS;QACrC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK;QAC/B,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,CACpC,CACF,CAAC;IACF,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAClC,CAAC;AAED,SAAS,iBAAiB,CAAC,SAA0B;IACnD,OAAO,CAAC,CAAC,aAAa,EAAE,0BAA0B,CAAC,CAAC,QAAQ,CAC1D,SAAS,CAAC,gBAAgB,IAAI,SAAS,CACxC,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,UAA6B,EAAE,GAAiB;IAChE,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAC7B,CAAC,SAAS,EAAE,EAAE,CACZ,SAAS,CAAC,SAAS;QACnB,CAAC,GAAG,CAAC,MAAM,CAAC,cAAc,CACxB,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,eAAe,EACzB,SAAS,CAAC,mBAAmB,CAC9B,CACJ,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC;IACxE,IAAI,GAAG,CAAC,YAAY,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAC9C,IAAI,GAAG,CAAC,YAAY,KAAK,kBAAkB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5E,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,aAAa,CAAC,UAA6B,EAAE,GAAiB;IAC5E,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IACzC,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;QAC9F,MAAM,IAAI,qBAAqB,CAC7B,wEAAwE,GAAG,CAAC,MAAM,GAAG,CACtF,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;QAC3D,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;QAC3D,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,GAAG,KAAK,CAAC;QACjD,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,CAAC;YAChC,IAAI,SAAS,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC;YACtC,MAAM,KAAK,GAAG,CAAC,CAAC,kBAAkB,IAAI,MAAM,CAAC,iBAAiB,CAAC;YAC/D,MAAM,KAAK,GAAG,CAAC,CAAC,kBAAkB,IAAI,MAAM,CAAC,iBAAiB,CAAC;YAC/D,OAAO,KAAK,GAAG,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC;QACxC,CAAC;QACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,gBAAgB,CACxC,CAAC,CAAC,SAAS,EACX,CAAC,CAAC,eAAe,EACjB,CAAC,CAAC,mBAAmB,CACtB,CAAC;QACF,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,gBAAgB,CACxC,CAAC,CAAC,SAAS,EACX,CAAC,CAAC,eAAe,EACjB,CAAC,CAAC,mBAAmB,CACtB,CAAC;QACF,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACvC,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,IAAI,MAAM,CAAC,iBAAiB,CAAC,CAAC;QACrF,CAAC;QACD,OAAO,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,UAA6B,EAC7B,GAAiB;IAEjB,OAAO,aAAa,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AACnD,CAAC"}
+{"version":3,"file":"router.js","sourceRoot":"","sources":["../src/router.ts"],"names":[],"mappings":"AA4BA;;;;;;GAMG;AACH,MAAM,UAAU,4BAA4B,CAAC,QAA2B;IACtE,IAAI,QAAQ,CAAC,KAAK,KAAK,iBAAiB;QAAE,OAAO,SAAS,CAAC;IAC3D,IAAI,QAAQ,CAAC,KAAK,KAAK,eAAe,IAAI,QAAQ,CAAC,YAAY,KAAK,QAAQ,EAAE,CAAC;QAC7E,OAAO,0BAA0B,CAAC;IACpC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAqCD,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IACrC,IAAI,GAAG,2BAA2B,CAAC;CAC7C;AAED,SAAS,SAAS,CAAC,SAA0B,EAAE,GAAiB;IAC9D,MAAM,KAAK,GAAG,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACjD,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CACrC,IAAI,CAAC,IAAI,CACP,CAAC,KAAK,EAAE,EAAE,CACR,KAAK,CAAC,OAAO,KAAK,SAAS,CAAC,SAAS;QACrC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,KAAK;QAC/B,KAAK,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,CACpC,CACF,CAAC;IACF,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;AAClC,CAAC;AAED;yEACyE;AACzE,SAAS,gBAAgB,CAAC,SAA0B;IAClD,IAAI,SAAS,CAAC,SAAS;QAAE,OAAO,4BAA4B,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IAClF,OAAO,SAAS,CAAC,gBAAgB,IAAI,SAAS,CAAC;AACjD,CAAC;AAED,SAAS,iBAAiB,CAAC,SAA0B;IACnD,OAAO,CAAC,CAAC,aAAa,EAAE,0BAA0B,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,GAAiB;IACnC,OAAO,GAAG,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AACnE,CAAC;AAED,SAAS,QAAQ,CAAC,UAA6B,EAAE,GAAiB;IAChE,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAC7B,CAAC,SAAS,EAAE,EAAE,CACZ,SAAS,CAAC,SAAS;QACnB,CAAC,GAAG,CAAC,MAAM,CAAC,cAAc,CACxB,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,eAAe,EACzB,SAAS,CAAC,mBAAmB,EAC7B,GAAG,CAAC,GAAG,CACR,CACJ,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC;IACxE,IAAI,GAAG,CAAC,YAAY,KAAK,OAAO;QAAE,OAAO,IAAI,CAAC;IAC9C,IAAI,GAAG,CAAC,YAAY,KAAK,kBAAkB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5E,OAAO,KAAK,CAAC;AACf,CAAC;AAED;kFACkF;AAClF,SAAS,WAAW,CAAC,SAA0B,EAAE,GAAiB;IAChE,OAAO,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC;AAC9D,CAAC;AAED;;qEAEqE;AACrE,SAAS,SAAS,CAAC,SAA0B,EAAE,GAAiB;IAC9D,OAAO,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAChC,SAAS,CAAC,SAAS,EACnB,SAAS,CAAC,eAAe,EACzB,SAAS,CAAC,mBAAmB,EAC7B,GAAG,CAAC,GAAG,CACR,CAAC;AACJ,CAAC;AAED;iEACiE;AACjE,MAAM,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,CAAC;AAInD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,iBAAiB,CACxB,CAAkB,EAClB,CAAkB,EAClB,GAAiB;IAEjB,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACjC,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,CAAC,MAAM,IAAI,iBAAiB,CAAC,GAAG,CAAC,MAAM,IAAI,iBAAiB,CAAC,CAAC;QAC5E,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACtE,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACxD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AAC9D,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,aAAa,CAC3B,UAA6B,EAC7B,OAAqB;IAErB,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IACzC,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;QAC9F,MAAM,IAAI,qBAAqB,CAC7B,wEAAwE,GAAG,CAAC,MAAM,GAAG,CACtF,CAAC;IACJ,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACxB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAClC,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,GAAG,KAAK,CAAC;QACjD,UAAU;QACV,MAAM,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK,CAAC;QAChC,IAAI,SAAS,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACtC,MAAM,KAAK,GAAG,CAAC,CAAC,kBAAkB,IAAI,MAAM,CAAC,iBAAiB,CAAC;QAC/D,MAAM,KAAK,GAAG,CAAC,CAAC,kBAAkB,IAAI,MAAM,CAAC,iBAAiB,CAAC;QAC/D,OAAO,KAAK,GAAG,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,UAA6B,EAC7B,GAAiB;IAEjB,OAAO,aAAa,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AACnD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAC5B,UAA6B,EAC7B,OAAqB;IAErB,+EAA+E;IAC/E,4EAA4E;IAC5E,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAChC,MAAM,gBAAgB,GAAG,aAAa,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACvD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,OAAO,GAAwB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC1D,UAAU,EAAE,CAAC,CAAC,SAAS;QACvB,iBAAiB,EAAE,gBAAgB,CAAC,CAAC,CAAC;QACtC,oBAAoB,EAAE,CAAC,CAAC,kBAAkB,IAAI,IAAI;QAClD,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;KACvC,CAAC,CAAC,CAAC;IACJ,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAChG,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAChE,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,CAAC,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AAC9F,CAAC;AAED;;kFAEkF;AAClF,SAAS,gBAAgB,CAAC,MAAyB,EAAE,GAAiB;IACpE,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,gBAAgB,CAAC,CAAC;IAChF,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC;AAED;;;gCAGgC;AAChC,SAAS,gBAAgB,CAAC,MAAyB;IACjD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,IAAI,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAClF,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,aAAa,CACpB,GAAiB,EACjB,MAAyB,EACzB,UAA6B;IAE7B,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,cAAc,CAAC;IAClD,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACxB,4EAA4E;QAC5E,qEAAqE;QACrE,iEAAiE;QACjE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,GAAG,CAAC,CAAC;YAClE,IAAI,MAAM,CAAC,IAAI;gBAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,CAAC,sBAAsB,CAAC;YAAE,OAAO,sBAAsB,CAAC;QACpE,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC;YAAE,OAAO,cAAc,CAAC;QACpD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IACD,uEAAuE;IACvE,2EAA2E;IAC3E,+EAA+E;IAC/E,4EAA4E;IAC5E,2CAA2C;IAC3C,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,+EAA+E;IAC/E,gFAAgF;IAChF,6EAA6E;IAC7E,6EAA6E;IAC7E,sEAAsE;IACtE,8EAA8E;IAC9E,+EAA+E;IAC/E,MAAM,iBAAiB,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,IAAI,YAAY,IAAI,iBAAiB;QAAE,OAAO,gCAAgC,CAAC;IAC/E,IAAI,gBAAgB,CAAC,MAAM,CAAC;QAAE,OAAO,yBAAyB,CAAC;IAC/D,IAAI,gBAAgB,CAAC,MAAM,EAAE,GAAG,CAAC;QAAE,OAAO,cAAc,CAAC;IACzD,6EAA6E;IAC7E,qCAAqC;IACrC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,kBAAkB,IAAI,IAAI,CAAC;QACvE,OAAO,8BAA8B,CAAC;IACxC,OAAO,gBAAgB,CAAC;AAC1B,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@claudexor/budget",
-  "version": "3.0.4",
+  "version": "3.1.1",
   "license": "MIT",
   "description": "Budget governor: pre-call leases, circuit breaker, evidence-based routing goals, and multi-window quota pacing.",
   "type": "module",
@@ -16,8 +16,8 @@
     "dist"
   ],
   "dependencies": {
-    "@claudexor/schema": "3.0.4",
-    "@claudexor/util": "3.0.4"
+    "@claudexor/schema": "3.1.1",
+    "@claudexor/util": "3.1.1"
   },
   "repository": {
     "type": "git",