audit-tools 0.39.15 → 0.41.0

package/dist/audit/cli/dispatch/quotaPool.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"quotaPool.js","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/quotaPool.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EACL,aAAa,EACb,qBAAqB,EACrB,uBAAuB,EACvB,2BAA2B,EAC3B,mCAAmC,EACnC,qBAAqB,GACtB,MAAM,oBAAoB,CAAC;AAY5B,OAAO,EAAE,+BAA+B,EAAE,MAAM,0BAA0B,CAAC;AAC3E,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EACL,uBAAuB,EACvB,sBAAsB,EACtB,qBAAqB,EACrB,8BAA8B,GAC/B,MAAM,sBAAsB,CAAC;AAM9B,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAuClE;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,MA0BvC;IACC,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,uBAAuB,EAAE,GAAG,MAAM,CAAC;IACvE,MAAM,iBAAiB,GACrB,MAAM,CAAC,YAAY;QACnB,+BAA+B,CAC7B,aAAa,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,EACzD,aAAa,CACd,CAAC;IAEJ,yFAAyF;IACzF,0FAA0F;IAC1F,0FAA0F;IAC1F,wFAAwF;IACxF,yFAAyF;IACzF,sFAAsF;IACtF,oFAAoF;IACpF,IAAI,qBAAuE,CAAC;IAC5E,MAAM,iBAAiB,GAAG,CAAC,SAAwB,EAAwC,EAAE;QAC3F,qBAAqB;YACnB,WAAW,EAAE,CAAC,SAAS,CAAC;iBACrB,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,gBAAgB,EAA2B,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;iBACtF,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAChD,OAAO,qBAAqB,CAAC;IAC/B,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,MAAM,qBAAqB,CAAC;QAC3C,aAAa;QACb,YAAY,EAAE,iBAAiB;QAC/B,iBAAiB,EAAE,MAAM,CAAC,SAAS;QACnC,WAAW,EAAE,MAAM,CAAC,WAAW;QAC/B,SAAS,EAAE,YAAY;QACvB,eAAe,EAAE,2BAA2B;QAC5C,uBAAuB;QACvB,iBAAiB,EAAE,MAAM,CAAC,iBAAiB;QAC3C,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;QACzC,MAAM,EAAE,MAAM,CAAC,eAAe;QAC9B,eAAe,EAAE,MAAM,CAAC,eAAe;QACvC,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrE,sBAAsB,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE;YACnE,MAAM,oBAAoB,GAAG,MAAM,sBAAsB,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACrF,MAAM,cAAc,GAAG,MAAM,iBAAiB,CAAC,SAAS,CAAC,CAAC;YAC1D,0EAA0E;YAC1E,mFAAmF;YACnF,6EAA6E;YAC7E,oFAAoF;YACpF,kFAAkF;YAClF,MAAM,OAAO,GAAgC,UAAU;gBACrD,CAAC,CAAC,EAAE,GAAG,UAAU,EAAE,MAAM,EAAE,iBAAiB,EAAE;gBAC9C,CAAC,CAAC,IAAI,CAAC;YACT,OAAO,qBAAqB,CAAC,OAAO,EAAE,cAAc,EAAE,oBAAoB,CAAC,CAAC;QAC9E,CAAC;KACF,CAAC,CAAC;IACH,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,QAAQ,CAAC;IAEnD,kFAAkF;IAClF,iFAAiF;IACjF,+EAA+E;IAC/E,6EAA6E;IAC7E,2EAA2E;IAC3E,MAAM,WAAW,GAAG,CAAC,IAAkB,EAAiB,EAAE,CACxD,yBAAyB,CAAC;QACxB,aAAa;QACb,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,gBAAgB,EAAE,IAAI,CAAC,gBAAgB,IAAI,IAAI;KAChD,CAAC,CAAC;IACL,MAAM,kBAAkB,GAAG,CAAC,IAAkB,EAAU,EAAE;QACxD,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CACb,uCAAuC,IAAI,CAAC,EAAE,0DAA0D;gBACtG,+IAA+I,CAClJ,CAAC;QACJ,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IAEF,mFAAmF;IACnF,0DAA0D;IAC1D,MAAM,MAAM,GAAG,MAAM,CAAC,eAAe,IAAI,IAAI,CAAC;IAC9C,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6B,CAAC;QACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,IAAI;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;QAClE,CAAC;QACD,MAAM,WAAW,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAChD,OAAO;YACL,KAAK;YACL,SAAS;YACT,mBAAmB,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAC5D,WAAW;YACX,WAAW;SACZ,CAAC;IACJ,CAAC;IACD,2EAA2E;IAC3E,0EAA0E;IAC1E,2EAA2E;IAC3E,yEAAyE;IACzE,6EAA6E;IAC7E,yEAAyE;IACzE,2EAA2E;IAC3E,sCAAsC;IACtC,OAAO;QACL,KAAK;QACL,SAAS;QACT,mBAAmB,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;QAC3C,WAAW,EAAE,IAAI;QACjB,WAAW;KACZ,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,MA0C3C;IAOC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;IAC3D,6EAA6E;IAC7E,2EAA2E;IAC3E,yEAAyE;IACzE,gFAAgF;IAChF,gFAAgF;IAChF,+EAA+E;IAC/E,6EAA6E;IAC7E,0EAA0E;IAC1E,MAAM,SAAS,GAAG,CAAC,IAAkB,EAAU,EAAE,CAC/C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,gBAAgB,GAAG,uBAAuB,CAAC;QAC/C,KAAK;QACL,aAAa;QACb,iBAAiB,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;KAC5D,CAAC,CAAC;IACH,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,CAAC,QAAQ,CAAC;IAEvD,oFAAoF;IACpF,iFAAiF;IACjF,+EAA+E;IAC/E,kFAAkF;IAClF,qFAAqF;IACrF,6EAA6E;IAC7E,MAAM,aAAa,GAAG,8BAA8B,CAAC,gBAAgB,CAAC,CAAC;IACvE,MAAM,cAAc,GAAoB,2BAA2B,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;IACjG,8EAA8E;IAC9E,8EAA8E;IAC9E,8EAA8E;IAC9E,gFAAgF;IAChF,iFAAiF;IACjF,2EAA2E;IAC3E,8EAA8E;IAC9E,uEAAuE;IACvE,4EAA4E;IAC5E,6EAA6E;IAC7E,0EAA0E;IAC1E,6EAA6E;IAC7E,4EAA4E;IAC5E,4EAA4E;IAC5E,uEAAuE;IACvE,gFAAgF;IAChF,MAAM,CAAC,UAAU;QACf,CAAC,CAAC;YACE,GAAG,IAAI;YACP,WAAW,EAAE,KAAK;YAClB,WAAW,EAAE,IAAI;YACjB,wEAAwE;YACxE,yEAAyE;YACzE,kEAAkE;YAClE,uEAAuE;YACvE,sEAAsE;YACtE,yCAAyC;YACzC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,UAAU,KAAK,KAAK;gBAC1C,aAAa,CAAC,CAAC,CAAC,EAAE,kBAAkB,IAAI,IAAI;gBAC1C,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,iBAAiB,EAAE;gBAC9C,CAAC,CAAC,EAAE,CAAC;SACR;QACH,CAAC,CAAC,IAAI,CACT,CAAC;IACF,oFAAoF;IACpF,8EAA8E;IAC9E,6EAA6E;IAC7E,oFAAoF;IACpF,8EAA8E;IAC9E,kFAAkF;IAClF,4EAA4E;IAC5E,iFAAiF;IACjF,qFAAqF;IACrF,sFAAsF;IACtF,wFAAwF;IACxF,oEAAoE;IACpE,MAAM,OAAO,GAAG,mCAAmC,CAAC,cAAc,EAAE,CAAC,IAAI,EAAE,EAAE;QAC3E,MAAM,CAAC,oBAAoB,EAAE,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,6EAA6E;IAC7E,6EAA6E;IAC7E,2BAA2B;IAC3B,MAAM,aAAa,GAAG,MAAM,qBAAqB,CAAC;QAChD,KAAK;QACL,KAAK,EAAE,cAAc;QACrB,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,SAAS,EAAE,YAAY,CAAC,eAAe,CAAC,aAAa;QACrD,WAAW,EAAE,MAAM,CAAC,WAAW,KAAK,KAAK;QACzC,MAAM,EAAE,uBAAuB,EAAE;QACjC,OAAO;QACP,IAAI,EAAE;YACJ,KAAK,EAAE,SAAS;YAChB,eAAe,EAAE,YAAY,CAAC,eAAe;YAC7C,UAAU,EAAE,YAAY,CAAC,UAAU;YACnC,MAAM,EAAE,YAAY,CAAC,MAAM;YAC3B,sBAAsB,EAAE,YAAY,CAAC,sBAAsB;YAC3D,cAAc,EAAE,gBAAgB,CAAC,cAAc;YAC/C,WAAW,EAAE,gBAAgB,CAAC,WAAW;YACzC,cAAc,EAAE,8BAA8B,CAAC,gBAAgB,CAAC;YAChE,GAAG,CAAC,MAAM,CAAC,eAAe,EAAE,MAAM;gBAChC,CAAC,CAAC,EAAE,iBAAiB,EAAE,MAAM,CAAC,eAAe,EAAE;gBAC/C,CAAC,CAAC,EAAE,CAAC;YACP,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,qBAAqB,EAAE,YAAY,CAAC,qBAAqB,IAAI,IAAI;YACjE,aAAa,EAAE,IAAI;SACpB;KACF,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC;IAC1C,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;IAC9D,MAAM,aAAa,CAAC,iBAAiB,EAAE,aAAa,CAAC,CAAC;IACtD,OAAO,EAAE,aAAa,EAAE,iBAAiB,EAAE,YAAY,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC;AACzF,CAAC"}

package/dist/audit/cli/dispatch/sizingWindow.d.ts

@@ -1,46 +0,0 @@
-import type { DiscoveredRateLimitsInput } from "audit-tools/shared/quota/types";
-import type { SessionConfig } from "audit-tools/shared/types/sessionConfig";
-/**
- * Inputs the packet-sizing window is a function of. Deliberately the scalar
- * fields `resolveLimits` reads — NOT a `CapacityPool`. A pool is a routing
- * concept (a selectable backend with slots, cost, rank and an allowance); the
- * sizing window is task metadata (how much review content fits in one packet),
- * and the two must not be reachable from one another.
- *
- * There is deliberately NO `providerName` here. It was carried only to satisfy
- * `resolveLimits`, where it picks the `provider_default` vs `default` label and
- * nothing else — both branches return the same window pair, and this module
- * discards the label. Keeping it would have threaded a `PROVIDER_NAMES`-derived
- * type through the one sizing surface that survives the routing removal, for a
- * value that cannot move the number.
- */
-export interface SizingWindowInput {
-    sessionConfig: SessionConfig;
-    /** Model whose window is being sized against; null when none resolved. */
-    hostModel: string | null;
-    /** Capabilities reported at the dispatch-time handshake, when the host gave any. */
-    discoveredLimits?: DiscoveredRateLimitsInput | null;
-}
-/**
- * The usable per-packet content window, in tokens: the resolved context window
- * less the reserved output cap.
- *
- * Resolved DIRECTLY through {@link resolveLimits} — the same rung order every
- * other window consumer sees (explicit per-model override, then the discovered
- * handshake capability, then the models.dev snapshot, then operator defaults,
- * then unknown). It is deliberately NOT reached by folding a `CapacityPool`
- * through `computeDispatchCapacity`: that fold answers "how many concurrent
- * slots may this backend take right now", a routing question whose answer this
- * one never needed. The fold's `primary.schedule.resolved_limits` was only ever
- * `resolveLimits` called with a pool's own fields and then handed back, so
- * reading it directly is the same number by construction — pinned by
- * `tests/audit/dispatch-sizing-window.test.ts`.
- *
- * `null` means no window resolved anywhere, which is NOT a refusal here: the
- * single-window caller degrades to the one-task-per-packet partition (a minimum
- * unit that makes no fit claim), while a declared model roster keeps its loud
- * throw because a roster IS the handshake. Both behaviours live at the call
- * site, so this stays a pure resolution.
- */
-export declare function resolveSizingWindowTokens(input: SizingWindowInput): number | null;
-//# sourceMappingURL=sizingWindow.d.ts.map

package/dist/audit/cli/dispatch/sizingWindow.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sizingWindow.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/sizingWindow.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAChF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,wCAAwC,CAAC;AAE5E;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,iBAAiB;IAChC,aAAa,EAAE,aAAa,CAAC;IAC7B,0EAA0E;IAC1E,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,oFAAoF;IACpF,gBAAgB,CAAC,EAAE,yBAAyB,GAAG,IAAI,CAAC;CACrD;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,iBAAiB,GAAG,MAAM,GAAG,IAAI,CASjF"}

package/dist/audit/cli/dispatch/sizingWindow.js

@@ -1,34 +0,0 @@
-import { resolveLimits } from "audit-tools/shared/quota/limits";
-/**
- * The usable per-packet content window, in tokens: the resolved context window
- * less the reserved output cap.
- *
- * Resolved DIRECTLY through {@link resolveLimits} — the same rung order every
- * other window consumer sees (explicit per-model override, then the discovered
- * handshake capability, then the models.dev snapshot, then operator defaults,
- * then unknown). It is deliberately NOT reached by folding a `CapacityPool`
- * through `computeDispatchCapacity`: that fold answers "how many concurrent
- * slots may this backend take right now", a routing question whose answer this
- * one never needed. The fold's `primary.schedule.resolved_limits` was only ever
- * `resolveLimits` called with a pool's own fields and then handed back, so
- * reading it directly is the same number by construction — pinned by
- * `tests/audit/dispatch-sizing-window.test.ts`.
- *
- * `null` means no window resolved anywhere, which is NOT a refusal here: the
- * single-window caller degrades to the one-task-per-packet partition (a minimum
- * unit that makes no fit claim), while a declared model roster keeps its loud
- * throw because a roster IS the handshake. Both behaviours live at the call
- * site, so this stays a pure resolution.
- */
-export function resolveSizingWindowTokens(input) {
-    const { limits } = resolveLimits({
-        sessionConfig: input.sessionConfig,
-        hostModel: input.hostModel,
-        discoveredLimits: input.discoveredLimits ?? null,
-    });
-    if (limits.context_tokens == null || limits.output_tokens == null)
-        return null;
-    const budget = limits.context_tokens - limits.output_tokens;
-    return budget > 0 ? budget : null;
-}
-//# sourceMappingURL=sizingWindow.js.map

package/dist/audit/cli/dispatch/sizingWindow.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sizingWindow.js","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/sizingWindow.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,iCAAiC,CAAC;AA0BhE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,yBAAyB,CAAC,KAAwB;IAChE,MAAM,EAAE,MAAM,EAAE,GAAG,aAAa,CAAC;QAC/B,aAAa,EAAE,KAAK,CAAC,aAAa;QAClC,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,IAAI,IAAI;KACjD,CAAC,CAAC;IACH,IAAI,MAAM,CAAC,cAAc,IAAI,IAAI,IAAI,MAAM,CAAC,aAAa,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC;IAC/E,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,GAAG,MAAM,CAAC,aAAa,CAAC;IAC5D,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;AACpC,CAAC"}

package/dist/audit/cli/dispatch/tierRouting.d.ts

@@ -1,64 +0,0 @@
-import type { DispatchModelHint, DispatchModelTier } from "audit-tools/shared";
-import type { DispatchComplexity } from "./types.js";
-import type { DispatchFanout } from "./types.js";
-export declare const TIER_RANK: Record<DispatchModelTier, number>;
-/**
- * Derive a packet's relative model rank from its `routing_risk` (the JIT graph
- * partition's max member risk) — the risk-primary baseline — with complexity
- * signals acting as ESCALATORS ONLY: they can raise the tier (a genuinely
- * large/critical-flow packet still gets the top rank at low risk) but never
- * lower the risk baseline. Cut points are relative positions on the normalized
- * risk scale, never model names (no-hardcoded-models invariant).
- */
-export declare function resolveDispatchTier(params: {
-    /** Max member risk from the partition; undefined when no partition ran. */
-    routingRisk: number | undefined;
-    complexity: DispatchComplexity;
-    /** Relative cut-point overrides (sessionConfig.dispatch.routing_tiers). */
-    routingTiers?: {
-        deep_at?: number;
-        standard_at?: number;
-    };
-}): DispatchModelHint;
-export declare const TIER_ORDER: DispatchModelTier[];
-/**
- * Fill per-tier budgets from the reported roster ranks. A tier the host did
- * not report falls back to the nearest reported rank (preferring the more
- * capable one on ties), mirroring how a host maps a tier hint onto its closest
- * available model.
- */
-export declare function resolveTierBudgets(perRank: ReadonlyMap<DispatchModelTier, number>): Record<DispatchModelTier, number>;
-/**
- * Compute dynamic routing thresholds (dq-1 fix) to distribute packets across
- * available tiers. When a roster provides multiple ranks (small/standard/deep),
- * the fixed DEFAULT_* thresholds may not distribute packets evenly — compute
- * percentile-based thresholds instead so packet risks are partitioned across
- * the available tiers.
- *
- * For N tiers, partition at percentiles 1/N, 2/N, ... to aim for roughly
- * equal packet distribution across tiers.
- *
- * Returns null if no meaningful distribution is possible (too few packets,
- * all identical risks, etc.), leaving the caller to use defaults.
- */
-export declare function computeDynamicRoutingTiers(packetRisks: number[], tierCount: number): {
-    deep_at?: number;
-    standard_at?: number;
-} | null;
-export declare function computeDispatchFanout(params: {
-    agentCount: number;
-    /** Packets GRANTED this pass by the admission loop (the emergent width). */
-    grantedCount: number;
-    /** Verbatim host in-flight cap (declared env limit), or null when none. */
-    declaredCap: number | null;
-    confirmThreshold?: number;
-    /**
-     * True when the interactive confirmation recommendation has already been
-     * surfaced once this run (carried from `ActiveDispatchState.confirmation_shown`
-     * for the SAME run_id). Suppresses re-recommending on steady-state repeat
-     * grants (Bug 8 / Slice A4) — the operator has already acknowledged this
-     * run's large fan-out once; a fresh run still recommends on its first grant.
-     */
-    confirmationAlreadyShown?: boolean;
-}): DispatchFanout;
-//# sourceMappingURL=tierRouting.d.ts.map

package/dist/audit/cli/dispatch/tierRouting.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tierRouting.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/tierRouting.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAE/E,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAOrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AASjD,eAAO,MAAM,SAAS,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAsB,CAAC;AAI/E;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE;IAC1C,2EAA2E;IAC3E,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IAChC,UAAU,EAAE,kBAAkB,CAAC;IAC/B,2EAA2E;IAC3E,YAAY,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CAC3D,GAAG,iBAAiB,CA+DpB;AAED,eAAO,MAAM,UAAU,EAAE,iBAAiB,EAAwB,CAAC;AAEnE;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,WAAW,CAAC,iBAAiB,EAAE,MAAM,CAAC,GAC9C,MAAM,CAAC,iBAAiB,EAAE,MAAM,CAAC,CA8BnC;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,0BAA0B,CACxC,WAAW,EAAE,MAAM,EAAE,EACrB,SAAS,EAAE,MAAM,GAChB;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CA4CnD;AAED,wBAAgB,qBAAqB,CAAC,MAAM,EAAE;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,4EAA4E;IAC5E,YAAY,EAAE,MAAM,CAAC;IACrB,2EAA2E;IAC3E,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;;;;OAMG;IACH,wBAAwB,CAAC,EAAE,OAAO,CAAC;CACpC,GAAG,cAAc,CAmBjB"}

package/dist/audit/cli/dispatch/tierRouting.js

@@ -1,172 +0,0 @@
-import { DISPATCH_TIER_RANK, DISPATCH_TIER_ORDER } from "audit-tools/shared";
-import { DEFAULT_DEEP_ROUTING_RISK, DEFAULT_STANDARD_ROUTING_RISK, DEFAULT_DISPATCH_CONFIRM_THRESHOLD, DEEP_MODEL_HINT_MIN_ESTIMATED_TOKENS, } from "./types.js";
-// Model-tier routing: risk-primary baseline with complexity escalators, tier
-// budget resolution, and dispatch fanout summary. No I/O.
-// Re-export of the single shared tier-rank authority (P1). audit-code keeps the
-// `TIER_RANK` / `TIER_ORDER` names that its callers + seam tests reference, but
-// the values are now sourced from `audit-tools/shared` so there is no second
-// copy of the {small,standard,deep} ordering to drift.
-export const TIER_RANK = DISPATCH_TIER_RANK;
-const SENSITIVE_HINT_LENSES = new Set(["security", "data_integrity", "reliability"]);
-/**
- * Derive a packet's relative model rank from its `routing_risk` (the JIT graph
- * partition's max member risk) — the risk-primary baseline — with complexity
- * signals acting as ESCALATORS ONLY: they can raise the tier (a genuinely
- * large/critical-flow packet still gets the top rank at low risk) but never
- * lower the risk baseline. Cut points are relative positions on the normalized
- * risk scale, never model names (no-hardcoded-models invariant).
- */
-export function resolveDispatchTier(params) {
-    const { routingRisk, complexity } = params;
-    const deepAt = params.routingTiers?.deep_at ?? DEFAULT_DEEP_ROUTING_RISK;
-    const standardAt = params.routingTiers?.standard_at ?? DEFAULT_STANDARD_ROUTING_RISK;
-    const baseline = routingRisk === undefined
-        ? "small"
-        : routingRisk >= deepAt
-            ? "deep"
-            : routingRisk >= standardAt
-                ? "standard"
-                : "small";
-    const reasons = [
-        routingRisk === undefined
-            ? "routing_risk:unknown"
-            : `routing_risk:${routingRisk.toFixed(2)}`,
-    ];
-    const deepEscalators = [];
-    if (complexity.large_file_mode)
-        deepEscalators.push("isolated_large_file");
-    if (complexity.estimated_tokens >= DEEP_MODEL_HINT_MIN_ESTIMATED_TOKENS) {
-        deepEscalators.push("high_estimated_tokens");
-    }
-    if (complexity.tags.some((tag) => tag === "critical_flow" || tag.startsWith("critical_flow:"))) {
-        deepEscalators.push("critical_flow");
-    }
-    if (complexity.tags.some((tag) => tag === "external_analyzer_signal" || tag.startsWith("external_tool:"))) {
-        deepEscalators.push("external_analyzer_signal");
-    }
-    if (complexity.tags.includes("lens_verification")) {
-        deepEscalators.push("lens_verification");
-    }
-    const standardEscalators = [];
-    if (complexity.lenses.some((lens) => SENSITIVE_HINT_LENSES.has(lens))) {
-        standardEscalators.push("sensitive_lens");
-    }
-    if (complexity.priority === "medium") {
-        standardEscalators.push("medium_priority");
-    }
-    let tier = baseline;
-    if (deepEscalators.length > 0 && TIER_RANK.deep > TIER_RANK[tier]) {
-        tier = "deep";
-    }
-    if (standardEscalators.length > 0 && TIER_RANK.standard > TIER_RANK[tier]) {
-        tier = "standard";
-    }
-    // Reasons stay attributable: the risk baseline first, then every escalator
-    // that fired (even ones below the final tier — they explain the floor).
-    reasons.push(...deepEscalators, ...standardEscalators);
-    return { tier, reasons };
-}
-export const TIER_ORDER = DISPATCH_TIER_ORDER;
-/**
- * Fill per-tier budgets from the reported roster ranks. A tier the host did
- * not report falls back to the nearest reported rank (preferring the more
- * capable one on ties), mirroring how a host maps a tier hint onto its closest
- * available model.
- */
-export function resolveTierBudgets(perRank) {
-    if (perRank.size === 0) {
-        throw new Error("resolveTierBudgets requires at least one reported rank.");
-    }
-    const out = {};
-    TIER_ORDER.forEach((tier, i) => {
-        const direct = perRank.get(tier);
-        if (direct !== undefined) {
-            out[tier] = direct;
-            return;
-        }
-        // Fall back to the NEAREST reported rank — preferring LOWER (less capable)
-        // on ties so a tier is never over-budgeted with a larger window than the
-        // actual model it maps to (COR-eebbabf7: was checking up before down, which
-        // assigned the "deep" context window to "small"-tier packets when only a
-        // higher rank was reported).
-        for (let distance = 1; distance < TIER_ORDER.length; distance++) {
-            const down = TIER_ORDER[i - distance];
-            const up = TIER_ORDER[i + distance];
-            if (down && perRank.has(down)) {
-                out[tier] = perRank.get(down);
-                return;
-            }
-            if (up && perRank.has(up)) {
-                out[tier] = perRank.get(up);
-                return;
-            }
-        }
-    });
-    return out;
-}
-/**
- * Compute dynamic routing thresholds (dq-1 fix) to distribute packets across
- * available tiers. When a roster provides multiple ranks (small/standard/deep),
- * the fixed DEFAULT_* thresholds may not distribute packets evenly — compute
- * percentile-based thresholds instead so packet risks are partitioned across
- * the available tiers.
- *
- * For N tiers, partition at percentiles 1/N, 2/N, ... to aim for roughly
- * equal packet distribution across tiers.
- *
- * Returns null if no meaningful distribution is possible (too few packets,
- * all identical risks, etc.), leaving the caller to use defaults.
- */
-export function computeDynamicRoutingTiers(packetRisks, tierCount) {
-    if (packetRisks.length === 0 || tierCount < 2) {
-        return null;
-    }
-    const sorted = [...packetRisks].sort((a, b) => a - b);
-    // For 2-tier rosters: partition at median (50th percentile)
-    if (tierCount === 2) {
-        const medianIdx = Math.floor((sorted.length - 1) / 2);
-        const median = sorted[medianIdx];
-        if (median === undefined) {
-            return null;
-        }
-        // For 2 tiers, only set deep_at at the median
-        return {
-            deep_at: Math.round(median * 1000) / 1000,
-        };
-    }
-    // For 3+ tiers: partition at roughly 1/3 and 2/3 percentiles
-    const p1Idx = Math.floor((sorted.length * 1) / 3);
-    const p2Idx = Math.floor((sorted.length * 2) / 3);
-    const p1 = sorted[p1Idx];
-    const p2 = sorted[p2Idx];
-    // If all risks are identical or the distribution is degenerate, return null
-    // to fall back to defaults
-    if (p1 === undefined || p2 === undefined || p1 === p2) {
-        return null;
-    }
-    const result = {};
-    // For 3+ tiers: assign thresholds
-    // standard_at: the lower third boundary (small vs standard)
-    // deep_at: the upper third boundary (standard vs deep)
-    result.standard_at = Math.round(p1 * 1000) / 1000;
-    result.deep_at = Math.round(p2 * 1000) / 1000;
-    return result;
-}
-export function computeDispatchFanout(params) {
-    const agentCount = params.agentCount;
-    const grantedCount = params.grantedCount;
-    const confirmThreshold = params.confirmThreshold ?? DEFAULT_DISPATCH_CONFIRM_THRESHOLD;
-    const confirmationRecommended = !params.confirmationAlreadyShown && agentCount > confirmThreshold;
-    // No computed concurrency number: the summary reports the granted set (the
-    // admission width this pass) and, when present, the verbatim in-flight cap.
-    const capNote = params.declaredCap != null ? `, ≤${params.declaredCap} in flight` : "";
-    const dispatchSummary = `${grantedCount} of ${agentCount} packet${agentCount !== 1 ? "s" : ""} granted this pass${capNote}`;
-    return {
-        agent_count: agentCount,
-        granted_count: grantedCount,
-        declared_cap: params.declaredCap,
-        confirmation_recommended: confirmationRecommended,
-        dispatch_summary: dispatchSummary,
-    };
-}
-//# sourceMappingURL=tierRouting.js.map

package/dist/audit/cli/dispatch/tierRouting.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tierRouting.js","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/tierRouting.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAE7E,OAAO,EACL,yBAAyB,EACzB,6BAA6B,EAC7B,kCAAkC,EAClC,oCAAoC,GACrC,MAAM,YAAY,CAAC;AAGpB,6EAA6E;AAC7E,0DAA0D;AAE1D,gFAAgF;AAChF,gFAAgF;AAChF,6EAA6E;AAC7E,uDAAuD;AACvD,MAAM,CAAC,MAAM,SAAS,GAAsC,kBAAkB,CAAC;AAE/E,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC,CAAC;AAErF;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAMnC;IACC,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;IAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,EAAE,OAAO,IAAI,yBAAyB,CAAC;IACzE,MAAM,UAAU,GACd,MAAM,CAAC,YAAY,EAAE,WAAW,IAAI,6BAA6B,CAAC;IAEpE,MAAM,QAAQ,GACZ,WAAW,KAAK,SAAS;QACvB,CAAC,CAAC,OAAO;QACT,CAAC,CAAC,WAAW,IAAI,MAAM;YACrB,CAAC,CAAC,MAAM;YACR,CAAC,CAAC,WAAW,IAAI,UAAU;gBACzB,CAAC,CAAC,UAAU;gBACZ,CAAC,CAAC,OAAO,CAAC;IAClB,MAAM,OAAO,GAAa;QACxB,WAAW,KAAK,SAAS;YACvB,CAAC,CAAC,sBAAsB;YACxB,CAAC,CAAC,gBAAgB,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;KAC7C,CAAC;IAEF,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,IAAI,UAAU,CAAC,eAAe;QAAE,cAAc,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IAC3E,IAAI,UAAU,CAAC,gBAAgB,IAAI,oCAAoC,EAAE,CAAC;QACxE,cAAc,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAC/C,CAAC;IACD,IACE,UAAU,CAAC,IAAI,CAAC,IAAI,CAClB,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,eAAe,IAAI,GAAG,CAAC,UAAU,CAAC,gBAAgB,CAAC,CACrE,EACD,CAAC;QACD,cAAc,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IACvC,CAAC;IACD,IACE,UAAU,CAAC,IAAI,CAAC,IAAI,CAClB,CAAC,GAAG,EAAE,EAAE,CACN,GAAG,KAAK,0BAA0B,IAAI,GAAG,CAAC,UAAU,CAAC,gBAAgB,CAAC,CACzE,EACD,CAAC;QACD,cAAc,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;IAClD,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,EAAE,CAAC;QAClD,cAAc,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACtE,kBAAkB,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAC5C,CAAC;IACD,IAAI,UAAU,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;QACrC,kBAAkB,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC7C,CAAC;IAED,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAClE,IAAI,GAAG,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1E,IAAI,GAAG,UAAU,CAAC;IACpB,CAAC;IACD,2EAA2E;IAC3E,wEAAwE;IACxE,OAAO,CAAC,IAAI,CAAC,GAAG,cAAc,EAAE,GAAG,kBAAkB,CAAC,CAAC;IACvD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,CAAC,MAAM,UAAU,GAAwB,mBAAmB,CAAC;AAEnE;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAA+C;IAE/C,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAC;IAC7E,CAAC;IACD,MAAM,GAAG,GAAG,EAAuC,CAAC;IACpD,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;YACnB,OAAO;QACT,CAAC;QACD,2EAA2E;QAC3E,yEAAyE;QACzE,4EAA4E;QAC5E,yEAAyE;QACzE,6BAA6B;QAC7B,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;YACtC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;YACpC,IAAI,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gBAC/B,OAAO;YACT,CAAC;YACD,IAAI,EAAE,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;gBAC7B,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CACxC,WAAqB,EACrB,SAAiB;IAEjB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;QAC9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEtD,4DAA4D;IAC5D,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;QAEjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,8CAA8C;QAC9C,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI;SAC1C,CAAC;IACJ,CAAC;IAED,6DAA6D;IAC7D,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAElD,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IACzB,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAEzB,4EAA4E;IAC5E,2BAA2B;IAC3B,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACtD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,MAAM,GAA+C,EAAE,CAAC;IAE9D,kCAAkC;IAClC,4DAA4D;IAC5D,uDAAuD;IACvD,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IAClD,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;IAE9C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAerC;IACC,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;IACrC,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;IACzC,MAAM,gBAAgB,GACpB,MAAM,CAAC,gBAAgB,IAAI,kCAAkC,CAAC;IAChE,MAAM,uBAAuB,GAC3B,CAAC,MAAM,CAAC,wBAAwB,IAAI,UAAU,GAAG,gBAAgB,CAAC;IACpE,2EAA2E;IAC3E,4EAA4E;IAC5E,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,MAAM,CAAC,WAAW,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;IACvF,MAAM,eAAe,GACnB,GAAG,YAAY,OAAO,UAAU,UAAU,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,qBAAqB,OAAO,EAAE,CAAC;IACtG,OAAO;QACL,WAAW,EAAE,UAAU;QACvB,aAAa,EAAE,YAAY;QAC3B,YAAY,EAAE,MAAM,CAAC,WAAW;QAChC,wBAAwB,EAAE,uBAAuB;QACjD,gBAAgB,EAAE,eAAe;KAClC,CAAC;AACJ,CAAC"}

package/dist/audit/cli/dispatch/tokenUsageObservation.d.ts

@@ -1,91 +0,0 @@
-import type { QuotaUsageSnapshot } from "audit-tools/shared";
-import type { AuditResult } from "../../types.js";
-import type { DispatchCapacityPoolSummary } from "../../quota/index.js";
-/**
- * Sum the input+output tokens reported on a wave's passing results. Ignores
- * results with no `token_usage` and defensively ignores a malformed shape
- * (non-finite/negative numbers) rather than trusting it — the validator
- * downgrades the same malformed shape to a warning (never a hard reject), so
- * this is the second, independent check that keeps a bad value out of the
- * quota-state file.
- *
- * C5 (attribution, SAFE direction): this sums only the results that were
- * actually STAMPED with `token_usage`, but the caller attributes the sum
- * against the WHOLE wave's real pct-delta (every dispatch consumed quota,
- * stamped or not). In a mixed-coverage wave (some subagents' harness usage
- * wasn't stamped) this UNDER-counts tokens relative to the true delta, which
- * biases the learned `tokens_per_pct` slope LOW (understated slope →
- * `remaining_token_budget = tokens_per_pct × remaining_pct × 100` comes out
- * too SMALL, not too big) — the safe direction for the exact over-admission
- * hazard this module exists to avoid. It is never the direction that risks
- * fleet-death-at-the-wall, so it is left uncorrected rather than adding
- * partial-coverage machinery to a best-effort advisory path.
- */
-export declare function sumWaveTokenUsage(passing: readonly AuditResult[]): number;
-/**
- * C4 — a coarse plausibility ceiling on a wave's summed `token_usage`: no
- * single dispatch can plausibly report more tokens than its pool's context
- * window, so the SUM across `resultCount` dispatches cannot legitimately
- * exceed `context_tokens × resultCount`. This is a deliberately GENEROUS hard
- * physical bound (not a tight statistical one) — its job is only to catch
- * gross, orders-of-magnitude-wrong input, the concrete danger being a host
- * tool that stamps each result with its CUMULATIVE session-running-total
- * instead of a per-dispatch figure. Left unbounded, that mistake sails
- * straight into `recordTokensPerPctObservation`'s EWMA (alpha 0.3 — see
- * TOKENS_PER_PCT_EWMA_ALPHA) and folds 30% of the bad sample into the slope on
- * a SINGLE merge, which is exactly the over-admission hazard Slice B exists to
- * prevent. `resultCount` uses the whole wave's passing-result count (not just
- * the stamped subset) so the bound stays generous even under partial coverage
- * (see {@link sumWaveTokenUsage}'s C5 note) — a real, honestly-stamped sum
- * should never come close to it.
- */
-export declare function isImplausibleTokenSum(tokens: number, pool: Pick<DispatchCapacityPoolSummary, "resolved_limits">, resultCount: number): boolean;
-/**
- * Pick the pool `finalizeDispatchQuota` sized THIS wave's grant against, from
- * the `capacity_pools[]` summary array `dispatch-quota.json` persists. Audit's
- * host-dispatch path (`buildDispatchPool`/`finalizeDispatchQuota` in
- * `quotaPool.ts`) only ever populates `capacity_pools` from host pools (no
- * mixed-in backend `source` pools — those belong to the separate in-process
- * engine), so the common case is exactly one entry. When a host model roster
- * produced several ranked pools, replicate `capacity.ts`'s private
- * `choosePrimaryAllocation` tie-break (most slots, then most context, then
- * lowest pool_id) so the SAME pool selection rule applies here as it did when
- * the wave was sized — `choosePrimaryAllocation` itself is not exported (it
- * closes over the live `PoolDispatchAllocation`, not the persisted summary
- * shape), so this is a small, deliberate re-derivation over the summary
- * fields, not a second source of truth for a *different* decision.
- */
-export declare function pickPrimaryCapacityPoolSummary(pools: readonly DispatchCapacityPoolSummary[] | undefined): DispatchCapacityPoolSummary | null;
-/** Injectable seam so tests never make a live quota-source network call. */
-export type PostWaveProbe = (providerModelKey: string) => Promise<QuotaUsageSnapshot | null>;
-/** Outcome of one `recordHostTokenUsageObservation` call, for logging/testing. */
-export interface HostTokenUsageObservationOutcome {
-    /** True when at least one window's slope sample was folded. */
-    recorded: boolean;
-    /** Reason nothing was recorded, when `recorded` is false. */
-    reason: "recorded" | "no_token_usage" | "no_dispatch_quota" | "no_pool" | "no_pre_snapshot" | "no_post_snapshot" | "implausible_token_sum" | "no_slope_delta" | "probe_timeout";
-    poolId?: string;
-    tokens?: number;
-}
-/**
- * Read this run's `dispatch-quota.json` (already-persisted PRE-grant snapshot
- * from `finalizeDispatchQuota`), sum the wave's host-reported `token_usage`,
- * re-probe the SAME pool's live quota snapshot as the POST reading, and fold
- * the pair through the single-sourced `foldSlopeObservationFromSnapshots` so
- * the pool's `tokens_per_pct` slope learns from REAL host-subagent usage
- * instead of staying `calibrating: true` forever.
- *
- * Never throws: a missing/unreadable dispatch-quota.json (e.g. an in-process-
- * only run with no host grant this round), an absent pool, a zero token sum,
- * an implausible token sum (C4), a probe failure, or a probe timeout (C6) all
- * degrade to a no-op outcome rather than aborting the caller — this is
- * advisory quota-state enrichment, not a merge invariant.
- */
-export declare function recordHostTokenUsageObservation(params: {
-    runDir: string;
-    passing: readonly AuditResult[];
-    probe?: PostWaveProbe;
-    /** Test seam: override the C6 probe timeout (default {@link DEFAULT_PROBE_TIMEOUT_MS}). */
-    probeTimeoutMs?: number;
-}): Promise<HostTokenUsageObservationOutcome>;
-//# sourceMappingURL=tokenUsageObservation.d.ts.map

package/dist/audit/cli/dispatch/tokenUsageObservation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"tokenUsageObservation.d.ts","sourceRoot":"","sources":["../../../../src/audit/cli/dispatch/tokenUsageObservation.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAE7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,KAAK,EAAE,2BAA2B,EAAiB,MAAM,sBAAsB,CAAC;AAEvF;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,GAAG,MAAM,CAWzE;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,IAAI,CAAC,2BAA2B,EAAE,iBAAiB,CAAC,EAC1D,WAAW,EAAE,MAAM,GAClB,OAAO,CAaT;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,8BAA8B,CAC5C,KAAK,EAAE,SAAS,2BAA2B,EAAE,GAAG,SAAS,GACxD,2BAA2B,GAAG,IAAI,CAapC;AAED,4EAA4E;AAC5E,MAAM,MAAM,aAAa,GAAG,CAAC,gBAAgB,EAAE,MAAM,KAAK,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC,CAAC;AA+B7F,kFAAkF;AAClF,MAAM,WAAW,gCAAgC;IAC/C,+DAA+D;IAC/D,QAAQ,EAAE,OAAO,CAAC;IAClB,6DAA6D;IAC7D,MAAM,EACF,UAAU,GACV,gBAAgB,GAChB,mBAAmB,GACnB,SAAS,GACT,iBAAiB,GACjB,kBAAkB,GAGlB,uBAAuB,GAKvB,gBAAgB,GAEhB,eAAe,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAoBD;;;;;;;;;;;;;GAaG;AACH,wBAAsB,+BAA+B,CAAC,MAAM,EAAE;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,SAAS,WAAW,EAAE,CAAC;IAChC,KAAK,CAAC,EAAE,aAAa,CAAC;IACtB,2FAA2F;IAC3F,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB,GAAG,OAAO,CAAC,gCAAgC,CAAC,CA+C5C"}