audit-tools 0.34.42 → 0.35.1

package/dist/shared/providers/providerConfirmation.js

@@ -1,420 +0,0 @@
-import { hasConfiguredOpenAiCompatible, hasConfiguredOpenCode, } from "./providerFactory.js";
-import { commandExists, isSelfSpawnBlocked, resolveConversationHostProvider, } from "./providerPathGuard.js";
-import { suggestCostOrdering, resolveModelPrice } from "../dispatch/costRank.js";
-import { backendIdentity, sourceService } from "./identity.js";
-// ---------------------------------------------------------------------------
-// Internal helpers
-// ---------------------------------------------------------------------------
-/**
- * Default capability tier for a given provider name.
- *
- * This is a fallback used only when no session-config override is available.
- * Tiers are intentionally coarse and static here; the scheduler discovery
- * path (HostModelRosterEntry / DiscoveredRateLimitsInput) is the authoritative
- * source of per-model capability at dispatch time.
- *
- * INV-shared-core-02: provider-name → tier mapping must NOT be a flat lookup
- * table that gates dispatch routing. Capability tier on DiscoveredProvider is
- * a declared/discoverable input, not an opaque internal enum. This function
- * is the single place where a default is applied; all routing uses the
- * DispatchModelTier vocabulary on CapacityPool, not this field.
- */
-function defaultCapabilityTier(name) {
-    switch (name) {
-        case "claude-code":
-            return "frontier";
-        case "opencode":
-        case "codex":
-        case "openai-compatible":
-        case "subprocess-template":
-        case "vscode-task":
-        case "antigravity":
-        case "agy":
-        case "claude-worker":
-            // Proxied non-Claude backend behind the Claude harness — ranks strictly below
-            // the host tier by default (the operator promotes deliberately; plan §risks).
-            return "capable";
-        case "worker-command":
-            return "unknown";
-    }
-}
-const CLI_PROBES = [
-    {
-        providerName: "claude-code",
-        defaultCommand: "claude",
-        configCommand: (cfg) => cfg.claude_code?.command,
-    },
-    {
-        providerName: "opencode",
-        defaultCommand: "opencode",
-        configCommand: (cfg) => cfg.opencode?.command,
-    },
-    {
-        providerName: "codex",
-        defaultCommand: "codex",
-        configCommand: (cfg) => cfg.codex?.command,
-    },
-    {
-        providerName: "agy",
-        defaultCommand: "agy",
-        configCommand: (cfg) => {
-            if (cfg.agy?.command)
-                return cfg.agy.command;
-            // Gated for July 18, 2026 sunset cleanup: fallback to gemini command
-            if (commandExists("agy"))
-                return "agy";
-            if (commandExists("gemini"))
-                return "gemini";
-            return undefined;
-        },
-    },
-];
-// ---------------------------------------------------------------------------
-// Public API
-// ---------------------------------------------------------------------------
-/**
- * Probe PATH for each known CLI and return a DiscoveredProvider entry for each
- * detected tool. Session-config `command` overrides decide which binary is probed.
- *
- * @param sessionConfig - Current session config (may be empty `{}`).
- * @param env           - Process env snapshot; defaults to `process.env`.
- * @param detectCommand - Injectable PATH-detection hook (defaults to the
- *   single-sourced `commandExists`). Lets tests drive discovery deterministically
- *   without a real CLI on PATH, so the self-spawn-blocked security obligations are
- *   testable red-before-green regardless of what is installed in CI.
- */
-export function discoverProviders(sessionConfig, env = process.env, detectCommand = commandExists) {
-    const discovered = [];
-    for (const probe of CLI_PROBES) {
-        const command = (probe.configCommand(sessionConfig) ?? "").trim() || probe.defaultCommand;
-        const available = detectCommand(command);
-        if (!available)
-            continue;
-        // PB-1: a bare-PATH opencode (no opencode.* config) is OPT-IN, not an
-        // eligible auto-dispatch target. Surfacing it here would let it join the
-        // confirmed pool and be launched unprompted. Only surface opencode when the
-        // operator has explicitly configured it (opencode.command / opencode.extra_args);
-        // all other PATH-detected providers are surfaced as before.
-        if (probe.providerName === "opencode" && !hasConfiguredOpenCode(sessionConfig)) {
-            continue;
-        }
-        // Machine-readable self-spawn-blocked flag, derived from the single-sourced
-        // guard. A self-spawn-blocked provider is still SURFACED (the operator may
-        // override) but carries the flag so Gate-0 can EXCLUDE it from the
-        // dispatchable pool without parsing free text.
-        const blocked = isSelfSpawnBlocked(probe.providerName, env);
-        discovered.push({
-            name: probe.providerName,
-            command,
-            capabilityTier: defaultCapabilityTier(probe.providerName),
-            detected: true,
-            selfSpawnBlocked: blocked,
-        });
-    }
-    // openai-compatible (NIM / vLLM / LM Studio / …) is an API pool, not a CLI: it
-    // is config-gated (base_url + model), never PATH-probed, so the CLI loop above
-    // can't surface it. Surface it here when configured so it joins the confirmed
-    // pool as a real spill target (INV-QD-14) alongside the PATH-detected CLIs.
-    if (hasConfiguredOpenAiCompatible(sessionConfig.openai_compatible)) {
-        discovered.push({
-            name: "openai-compatible",
-            command: sessionConfig.openai_compatible?.model,
-            capabilityTier: defaultCapabilityTier("openai-compatible"),
-            detected: true,
-        });
-    }
-    return discovered;
-}
-/**
- * Query the rate-limit state from a live provider if the `queryLimits` method
- * is available. Returns `null` on timeout/error — never throws.
- *
- * OBS-9a9091ad: a `queryLimits` rejection was previously swallowed with no
- * signal, so a provider whose rate-limit query consistently fails was invisible
- * to operators (the sibling CompositeQuotaSource logs the same swallow). Accept
- * an optional injectable `log` (mirroring analyzerDeps' injectable-log pattern)
- * that is invoked with the provider name + error on the swallowed-error path.
- * The contract is unchanged — `log` is optional, the function still never throws
- * and still returns null — so existing callers need no change while a caller
- * that cares can route the diagnostic into its RunLogger.
- */
-export async function queryProviderQuota(provider, freshSessionProvider, log) {
-    if (typeof freshSessionProvider.queryLimits !== "function") {
-        return null;
-    }
-    try {
-        return await freshSessionProvider.queryLimits(null);
-    }
-    catch (error) {
-        log?.(provider.name, error);
-        return null;
-    }
-}
-/**
- * The representative model id a provider is priced/ordered by at Gate-0 (cost-first
- * routing; spec/dispatch-quota.md). Only the providers that carry a configured
- * model in session config are knowable here — a host-native model roster and a CLI
- * backend's model arrive only at the dispatch handshake, so those return `undefined`
- * and are priced deterministically at dispatch instead. Never hardcodes a model
- * name; reads only operator-supplied config.
- */
-export function representativeModelId(name, sessionConfig) {
-    switch (name) {
-        case "openai-compatible":
-            return sessionConfig.openai_compatible?.model?.trim() || undefined;
-        case "codex":
-            return sessionConfig.codex?.model?.trim() || undefined;
-        default:
-            return undefined;
-    }
-}
-/** Stable source id (matches `deriveSourcePoolDisplay` / the dispatch id convention). */
-function dispatchSourceKey(source) {
-    return source.id ?? `${source.transport}:${source.model ?? source.endpoint ?? "default"}`;
-}
-/**
- * Internal candidate key for a source in the unified cost ordering. Prefixed so a source's
- * operator-set id can never collide with a provider-NAME key or a host `model_id` key in
- * the shared position map (they share one keyspace in `resolveFinalCostOrder`) — a collision
- * would let one entry's `cost_order` silently overwrite the other's. The prefix is internal
- * only; the emitted `source_id` + the operator `cost_order` keyspace are unaffected.
- */
-const SOURCE_CANDIDATE_KEY_PREFIX = "source::";
-function sourceCandidateKey(source) {
-    return `${SOURCE_CANDIDATE_KEY_PREFIX}${dispatchSourceKey(source)}`;
-}
-/**
- * Resolve the FINAL 0-based cost position for every candidate key. Without an
- * operator ordering this is the tool's price-ascending suggestion. With one, the
- * operator's `cost_order` wins for the keys it names (dense from 0, unknown keys
- * ignored); candidates it omits keep their suggested relative order, appended
- * after. Single-sourced so provider pools and host models share one total order.
- */
-function resolveFinalCostOrder(candidates, operatorOrder) {
-    const suggested = suggestCostOrdering(candidates);
-    if (!operatorOrder || operatorOrder.length === 0) {
-        return new Map(suggested.map((c) => [c.key, c.suggested_order]));
-    }
-    const knownKeys = new Set(candidates.map((c) => c.key));
-    // Display keyspace ≡ match keyspace (backlog: source pools were displayed as
-    // orderable but silently ignored). A source candidate is keyed
-    // `source::<id>` internally (collision-proofing against provider names / host
-    // model ids in this shared position map) but the Gate-0 prompt DISPLAYS it under
-    // its bare id — so the bare id must match too. An exact candidate key always
-    // wins the token: a bare alias never shadows a genuine provider/model key, which
-    // preserves exactly the collision-safety the prefix exists for.
-    const bareSourceAliases = new Map();
-    for (const key of knownKeys) {
-        if (!key.startsWith(SOURCE_CANDIDATE_KEY_PREFIX))
-            continue;
-        const bare = key.slice(SOURCE_CANDIDATE_KEY_PREFIX.length);
-        if (!knownKeys.has(bare) && !bareSourceAliases.has(bare)) {
-            bareSourceAliases.set(bare, key);
-        }
-    }
-    const seen = new Set();
-    const orderedNamed = [];
-    for (const token of operatorOrder) {
-        const key = knownKeys.has(token) ? token : bareSourceAliases.get(token);
-        if (key !== undefined && !seen.has(key)) {
-            seen.add(key);
-            orderedNamed.push(key);
-        }
-    }
-    const rest = suggested.map((c) => c.key).filter((k) => !seen.has(k));
-    const finalOrder = [...orderedNamed, ...rest];
-    return new Map(finalOrder.map((key, index) => [key, index]));
-}
-/**
- * Annotate + order a confirmed pool with cost-first-routing fields, optionally
- * applying an operator Gate-0 input. Each provider entry gets its representative
- * `model_id`, `blended_price_usd_per_mtok` (or `null` when the dataset can't price
- * it), and a `cost_order`. When `input` is absent this is the tool's
- * price-ascending SUGGESTION (headless / no-operator path). When present, the
- * operator's `cost_order` overrides the suggested positions and each
- * `host_models` entry becomes a priced, orderable candidate whose confirmed
- * position threads to dispatch by `model_id` via `host_model_cost_order`. Read
- * back at dispatch (`resolveConfirmedCostPositions`) as rung 1 of `costRank`.
- * Single-sourced so every confirmation site annotates identically.
- */
-export function annotateConfirmedPool(pool, sessionConfig, input, sources = [], env = process.env) {
-    const hostModels = input?.host_models ?? [];
-    // The host roster is by definition the CONVERSATION HOST's own models, so the
-    // service half of each tier's identity is the resolved host. Resolved HERE (above
-    // the source fold) because the fold dedups on identity and therefore needs it.
-    const hostProvider = resolveConversationHostProvider({ sessionConfig, env });
-    const providerCandidates = pool.map((entry) => ({
-        key: entry.name,
-        model: representativeModelId(entry.name, sessionConfig),
-    }));
-    // tier is omitted: it only tiebreaks UNPRICED candidates, and HostRosterModel's
-    // CapabilityTier is a different vocabulary from CostCandidate's DispatchModelTier
-    // — host models are keyed + priced by model_id, which is what threads to dispatch.
-    const hostCandidates = hostModels.map((m) => ({
-        key: m.model_id,
-        model: m.model_id,
-    }));
-    // A source whose model is ALREADY represented by a provider candidate (the legacy
-    // `openai_compatible` block folds into BOTH the `openai-compatible` provider entry AND
-    // a `collectDispatchableSources` source) or a host tier is the SAME pool — folding it
-    // again would double-rank one model_id and let the source position overwrite the
-    // provider's in the model-keyed dispatch map. Dedup by model_id so each pool is ranked
-    // once. Repair-proxy sources carry distinct namespaced models, so they're never skipped.
-    // Dedup on BACKEND IDENTITY, never on the bare model string. A bare-model fold
-    // drops a source that merely SHARES a model id with a host tier or a configured
-    // pool on a DIFFERENT service — and since the confirmed set is derived from what
-    // survives this fold, that source could then never be confirmed: it would delta,
-    // the operator would confirm it, the fold would drop it again, and it would delta
-    // forever. (Before the gate key was service-qualified, the same bare-model collapse
-    // hid this as a silent BYPASS instead — the two are one defect seen from either
-    // side.) Identity-keyed, only a genuine duplicate folds: the legacy
-    // `openai_compatible` block, which really is represented twice (once as a provider
-    // entry, once as a `collectDispatchableSources` source) on ONE service.
-    const claimedIdentities = new Set();
-    for (const entry of pool) {
-        const m = representativeModelId(entry.name, sessionConfig);
-        if (m)
-            claimedIdentities.add(backendIdentity(m, entry.name));
-    }
-    for (const m of hostModels) {
-        claimedIdentities.add(backendIdentity(m.model_id, hostProvider));
-    }
-    const foldedSources = sources.filter((source) => !claimedIdentities.has(backendIdentity(source.model, sourceService(source))));
-    // Gate-0 source fold: every remaining dispatchable source pool (explicit sources[] +
-    // proxy expansion) becomes a ranked candidate, keyed by its stable source id so a
-    // namespaced `transport/model` never collides with a provider-name key. Each carries its
-    // declared cost (authoritative; 0 = free) and raw capability rank so the suggestion is
-    // truthful and the capability tiebreak applies among cost-equal source pools.
-    const sourceCandidates = foldedSources.map((source) => ({
-        key: sourceCandidateKey(source),
-        model: source.model ?? null,
-        // Price binds to the SERVICE, never the transport: `resolveModelStatics` falls
-        // through to the cheapest-collision default entry for a provider string the price
-        // table has never heard of, so passing a transport here (`claude-worker`) silently
-        // prices a proxied lane at some other vendor's rate.
-        provider: sourceService(source),
-        ...(source.cost_per_mtok !== undefined ? { declaredCost: source.cost_per_mtok } : {}),
-        ...(source.capability_rank != null ? { capabilityRank: source.capability_rank } : {}),
-    }));
-    const positions = resolveFinalCostOrder([...providerCandidates, ...hostCandidates, ...sourceCandidates], input?.cost_order);
-    // Capability-evidence ordering: the operator/LLM answer to the capability gate, over
-    // the SAME candidate keyspace the cost order uses. Position ⇒ `capability_rank`
-    // (LOWER = more capable), so the list is most-capable-first. Unlike the cost order
-    // there is no tool-computed suggestion to fall back to: absent input ⇒ no confirmed
-    // ranks at all, and pools keep whatever external evidence they carry.
-    //
-    // First occurrence wins on a duplicated key — a positional list is the operator's
-    // ORDERING, and silently re-ranking on a later repeat would make the tail of a
-    // typo'd list authoritative over its head.
-    const capabilityPositions = new Map();
-    (input?.capability_order ?? []).forEach((key, index) => {
-        if (!capabilityPositions.has(key))
-            capabilityPositions.set(key, index);
-    });
-    const provider_pool = pool.map((entry) => {
-        const model = representativeModelId(entry.name, sessionConfig);
-        const order = positions.get(entry.name);
-        return {
-            ...entry,
-            ...(model ? { model_id: model } : {}),
-            blended_price_usd_per_mtok: model ? resolveModelPrice(model) ?? null : null,
-            ...(order !== undefined ? { cost_order: order } : {}),
-            // Keyed on the MODEL, never the provider name: `capability_rank` is read back
-            // by the model-keyed dispatch join (`readConfirmedCapabilityRanks` →
-            // `pool.hostModel`), and the delta + prompt both name models. Matching on the
-            // provider name here would silently drop the operator's answer, leaving the
-            // delta non-empty ⇒ `PRIORITY[0]` re-prompts the same question forever.
-            ...(model && capabilityPositions.has(model)
-                ? { capability_rank: capabilityPositions.get(model) }
-                : {}),
-        };
-    });
-    // Recorded at the only point the host is known for certain, rather than re-derived
-    // by a later reader running under a possibly different host.
-    const host_model_cost_order = hostModels.map((m) => ({
-        model_id: m.model_id,
-        provider: hostProvider,
-        blended_price_usd_per_mtok: resolveModelPrice(m.model_id) ?? null,
-        cost_order: positions.get(m.model_id) ?? 0,
-        // A host model is ranked exactly like any other model. The roster carries no
-        // capability field (HostModelRosterEntrySchema is .strict()), so the confirmed
-        // order is the ONLY road a host model's rank travels to dispatch.
-        ...(capabilityPositions.has(m.model_id)
-            ? { capability_rank: capabilityPositions.get(m.model_id) }
-            : {}),
-    }));
-    const source_pool_cost_order = foldedSources.map((source) => {
-        const key = sourceCandidateKey(source);
-        const declared = typeof source.cost_per_mtok === "number" && Number.isFinite(source.cost_per_mtok) && source.cost_per_mtok >= 0
-            ? source.cost_per_mtok
-            : undefined;
-        const price = 
-        // Service, not transport — see the CostCandidate note above.
-        declared ?? (source.model ? resolveModelPrice(source.model, sourceService(source)) ?? null : null);
-        return {
-            source_id: dispatchSourceKey(source),
-            transport: source.transport,
-            // Recorded so `confirmedBackendKeys` can reproduce the gate identity the delta
-            // computes for a proxied lane — see SourcePoolCostEntry.service.
-            ...(source.service ? { service: source.service } : {}),
-            ...(source.model ? { model_id: source.model } : {}),
-            blended_price_usd_per_mtok: price,
-            price_declared: declared !== undefined,
-            // External evidence FIRST: a source's own registry/declared rank is
-            // someone-else-maintained data about the model, so the confirmed ordering only
-            // fills the gap where none exists. Same precedence the pool constructors apply.
-            ...(source.capability_rank != null
-                ? { capability_rank: source.capability_rank }
-                : source.model && capabilityPositions.has(source.model)
-                    ? { capability_rank: capabilityPositions.get(source.model) }
-                    : {}),
-            cost_order: positions.get(key) ?? 0,
-        };
-    });
-    return { provider_pool, host_model_cost_order, source_pool_cost_order };
-}
-/**
- * The suggestion-only annotation (no operator input, no host models). Preserved
- * for the headless / auto-complete callers that just need the provider pool with
- * the tool's price-ascending `cost_order`. Delegates to `annotateConfirmedPool`.
- */
-export function annotateConfirmedPoolCost(pool, sessionConfig) {
-    return annotateConfirmedPool(pool, sessionConfig).provider_pool;
-}
-/**
- * Derive the Gate-0 display view of every configured `sessionConfig.sources[]`
- * entry (backlog follow-up a). Read-only and additive: mirrors the same
- * `sessionConfig.sources` array `collectDispatchableSources` (apiPool.ts) folds
- * into dispatch, so what the operator sees at Gate-0 includes every pool that will
- * actually route. Order is preserved from the operator-authored config array
- * (content-derived, stable — never re-sorted by iteration/readdir order).
- */
-export function deriveSourcePoolDisplay(sessionConfig) {
-    return deriveSourcePoolDisplayFromSources(sessionConfig.sources ?? []);
-}
-/**
- * Same display derivation as {@link deriveSourcePoolDisplay} but over an EXPLICIT source
- * list — used by the Gate-0 confirmation display so the roster includes the async
- * proxy catalog expansion (which is not in `sessionConfig.sources`), matching
- * exactly what {@link gatherDispatchableSources} folds into dispatch.
- */
-export function deriveSourcePoolDisplayFromSources(sources) {
-    return sources.map((source) => {
-        const id = source.id ?? `${source.transport}:${source.model ?? source.endpoint ?? "default"}`;
-        const entry = {
-            id,
-            transport: source.transport,
-            ...(source.model ? { model: source.model } : {}),
-            ...(source.cost_per_mtok !== undefined
-                ? { declared_cost_per_mtok: source.cost_per_mtok }
-                : {}),
-        };
-        if (source.cost_per_mtok === undefined) {
-            entry.blended_price_usd_per_mtok = source.model
-                ? (resolveModelPrice(source.model) ?? null)
-                : null;
-        }
-        return entry;
-    });
-}
-//# sourceMappingURL=providerConfirmation.js.map

package/dist/shared/providers/providerConfirmation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"providerConfirmation.js","sourceRoot":"","sources":["../../../src/shared/providers/providerConfirmation.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,6BAA6B,EAC7B,qBAAqB,GACtB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,+BAA+B,GAChC,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAsB,MAAM,yBAAyB,CAAC;AACrG,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAgC/D,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E;;;;;;;;;;;;;GAaG;AACH,SAAS,qBAAqB,CAAC,IAA0B;IACvD,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,aAAa;YAChB,OAAO,UAAU,CAAC;QACpB,KAAK,UAAU,CAAC;QAChB,KAAK,OAAO,CAAC;QACb,KAAK,mBAAmB,CAAC;QACzB,KAAK,qBAAqB,CAAC;QAC3B,KAAK,aAAa,CAAC;QACnB,KAAK,aAAa,CAAC;QACnB,KAAK,KAAK,CAAC;QACX,KAAK,eAAe;YAClB,8EAA8E;YAC9E,8EAA8E;YAC9E,OAAO,SAAS,CAAC;QACnB,KAAK,gBAAgB;YACnB,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAcD,MAAM,UAAU,GAAe;IAC7B;QACE,YAAY,EAAE,aAAa;QAC3B,cAAc,EAAE,QAAQ;QACxB,aAAa,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO;KACjD;IACD;QACE,YAAY,EAAE,UAAU;QACxB,cAAc,EAAE,UAAU;QAC1B,aAAa,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO;KAC9C;IACD;QACE,YAAY,EAAE,OAAO;QACrB,cAAc,EAAE,OAAO;QACvB,aAAa,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO;KAC3C;IACD;QACE,YAAY,EAAE,KAAK;QACnB,cAAc,EAAE,KAAK;QACrB,aAAa,EAAE,CAAC,GAAG,EAAE,EAAE;YACrB,IAAI,GAAG,CAAC,GAAG,EAAE,OAAO;gBAAE,OAAO,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC;YAC7C,qEAAqE;YACrE,IAAI,aAAa,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACvC,IAAI,aAAa,CAAC,QAAQ,CAAC;gBAAE,OAAO,QAAQ,CAAC;YAC7C,OAAO,SAAS,CAAC;QACnB,CAAC;KACF;CACF,CAAC;AAEF,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,aAA4B,EAC5B,MAAyB,OAAO,CAAC,GAAG,EACpC,gBAA8C,aAAa;IAE3D,MAAM,UAAU,GAAyB,EAAE,CAAC;IAE5C,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,MAAM,OAAO,GACX,CAAC,KAAK,CAAC,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK,CAAC,cAAc,CAAC;QAC5E,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QAEzC,IAAI,CAAC,SAAS;YAAE,SAAS;QAEzB,sEAAsE;QACtE,yEAAyE;QACzE,4EAA4E;QAC5E,kFAAkF;QAClF,4DAA4D;QAC5D,IAAI,KAAK,CAAC,YAAY,KAAK,UAAU,IAAI,CAAC,qBAAqB,CAAC,aAAa,CAAC,EAAE,CAAC;YAC/E,SAAS;QACX,CAAC;QAED,4EAA4E;QAC5E,2EAA2E;QAC3E,mEAAmE;QACnE,+CAA+C;QAC/C,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;QAE5D,UAAU,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,KAAK,CAAC,YAAY;YACxB,OAAO;YACP,cAAc,EAAE,qBAAqB,CAAC,KAAK,CAAC,YAAY,CAAC;YACzD,QAAQ,EAAE,IAAI;YACd,gBAAgB,EAAE,OAAO;SAC1B,CAAC,CAAC;IACL,CAAC;IAED,+EAA+E;IAC/E,+EAA+E;IAC/E,8EAA8E;IAC9E,4EAA4E;IAC5E,IAAI,6BAA6B,CAAC,aAAa,CAAC,iBAAiB,CAAC,EAAE,CAAC;QACnE,UAAU,CAAC,IAAI,CAAC;YACd,IAAI,EAAE,mBAAmB;YACzB,OAAO,EAAE,aAAa,CAAC,iBAAiB,EAAE,KAAK;YAC/C,cAAc,EAAE,qBAAqB,CAAC,mBAAmB,CAAC;YAC1D,QAAQ,EAAE,IAAI;SACf,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,QAA4B,EAC5B,oBAA0C,EAC1C,GAAoD;IAEpD,IAAI,OAAO,oBAAoB,CAAC,WAAW,KAAK,UAAU,EAAE,CAAC;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC;QACH,OAAO,MAAM,oBAAoB,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,GAAG,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACnC,IAA0B,EAC1B,aAA4B;IAE5B,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,mBAAmB;YACtB,OAAO,aAAa,CAAC,iBAAiB,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,SAAS,CAAC;QACrE,KAAK,OAAO;YACV,OAAO,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,SAAS,CAAC;QACzD;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAmBD,yFAAyF;AACzF,SAAS,iBAAiB,CAAC,MAA0B;IACnD,OAAO,MAAM,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,QAAQ,IAAI,SAAS,EAAE,CAAC;AAC5F,CAAC;AAED;;;;;;GAMG;AACH,MAAM,2BAA2B,GAAG,UAAU,CAAC;AAE/C,SAAS,kBAAkB,CAAC,MAA0B;IACpD,OAAO,GAAG,2BAA2B,GAAG,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC;AACtE,CAAC;AAED;;;;;;GAMG;AACH,SAAS,qBAAqB,CAC5B,UAA2B,EAC3B,aAAwB;IAExB,MAAM,SAAS,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAClD,IAAI,CAAC,aAAa,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjD,OAAO,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,6EAA6E;IAC7E,+DAA+D;IAC/D,8EAA8E;IAC9E,iFAAiF;IACjF,6EAA6E;IAC7E,iFAAiF;IACjF,gEAAgE;IAChE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,2BAA2B,CAAC;YAAE,SAAS;QAC3D,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,2BAA2B,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACzD,iBAAiB,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,CAAC,GAAG,YAAY,EAAE,GAAG,IAAI,CAAC,CAAC;IAC9C,OAAO,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,qBAAqB,CACnC,IAA0B,EAC1B,aAA4B,EAC5B,KAAiC,EACjC,UAAgC,EAAE,EAClC,MAAyB,OAAO,CAAC,GAAG;IAEpC,MAAM,UAAU,GAAG,KAAK,EAAE,WAAW,IAAI,EAAE,CAAC;IAC5C,8EAA8E;IAC9E,kFAAkF;IAClF,+EAA+E;IAC/E,MAAM,YAAY,GAAG,+BAA+B,CAAC,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7E,MAAM,kBAAkB,GAAoB,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC/D,GAAG,EAAE,KAAK,CAAC,IAAI;QACf,KAAK,EAAE,qBAAqB,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC;KACxD,CAAC,CAAC,CAAC;IACJ,gFAAgF;IAChF,kFAAkF;IAClF,mFAAmF;IACnF,MAAM,cAAc,GAAoB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7D,GAAG,EAAE,CAAC,CAAC,QAAQ;QACf,KAAK,EAAE,CAAC,CAAC,QAAQ;KAClB,CAAC,CAAC,CAAC;IACJ,kFAAkF;IAClF,uFAAuF;IACvF,sFAAsF;IACtF,iFAAiF;IACjF,uFAAuF;IACvF,yFAAyF;IACzF,+EAA+E;IAC/E,gFAAgF;IAChF,iFAAiF;IACjF,iFAAiF;IACjF,kFAAkF;IAClF,oFAAoF;IACpF,gFAAgF;IAChF,oEAAoE;IACpE,mFAAmF;IACnF,wEAAwE;IACxE,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5C,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,qBAAqB,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAC3D,IAAI,CAAC;YAAE,iBAAiB,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,iBAAiB,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAClC,CAAC,MAAM,EAAE,EAAE,CACT,CAAC,iBAAiB,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAC/E,CAAC;IACF,qFAAqF;IACrF,kFAAkF;IAClF,yFAAyF;IACzF,uFAAuF;IACvF,8EAA8E;IAC9E,MAAM,gBAAgB,GAAoB,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACvE,GAAG,EAAE,kBAAkB,CAAC,MAAM,CAAC;QAC/B,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,IAAI;QAC3B,+EAA+E;QAC/E,kFAAkF;QAClF,mFAAmF;QACnF,qDAAqD;QACrD,QAAQ,EAAE,aAAa,CAAC,MAAM,CAAC;QAC/B,GAAG,CAAC,MAAM,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrF,GAAG,CAAC,MAAM,CAAC,eAAe,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACtF,CAAC,CAAC,CAAC;IACJ,MAAM,SAAS,GAAG,qBAAqB,CACrC,CAAC,GAAG,kBAAkB,EAAE,GAAG,cAAc,EAAE,GAAG,gBAAgB,CAAC,EAC/D,KAAK,EAAE,UAAU,CAClB,CAAC;IACF,qFAAqF;IACrF,gFAAgF;IAChF,mFAAmF;IACnF,oFAAoF;IACpF,sEAAsE;IACtE,EAAE;IACF,kFAAkF;IAClF,+EAA+E;IAC/E,2CAA2C;IAC3C,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtD,CAAC,KAAK,EAAE,gBAAgB,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;QACrD,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,mBAAmB,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IACH,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACvC,MAAM,KAAK,GAAG,qBAAqB,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACxC,OAAO;YACL,GAAG,KAAK;YACR,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrC,0BAA0B,EAAE,KAAK,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI;YAC3E,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,8EAA8E;YAC9E,qEAAqE;YACrE,8EAA8E;YAC9E,4EAA4E;YAC5E,wEAAwE;YACxE,GAAG,CAAC,KAAK,IAAI,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC;gBACzC,CAAC,CAAC,EAAE,eAAe,EAAE,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACrD,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,mFAAmF;IACnF,6DAA6D;IAC7D,MAAM,qBAAqB,GAAyB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACzE,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,QAAQ,EAAE,YAAY;QACtB,0BAA0B,EAAE,iBAAiB,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,IAAI;QACjE,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC1C,6EAA6E;QAC7E,+EAA+E;QAC/E,kEAAkE;QAClE,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;YACrC,CAAC,CAAC,EAAE,eAAe,EAAE,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE;YAC1D,CAAC,CAAC,EAAE,CAAC;KACR,CAAC,CAAC,CAAC;IACJ,MAAM,sBAAsB,GAA0B,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QACjF,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,QAAQ,GACZ,OAAO,MAAM,CAAC,aAAa,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,MAAM,CAAC,aAAa,IAAI,CAAC;YAC5G,CAAC,CAAC,MAAM,CAAC,aAAa;YACtB,CAAC,CAAC,SAAS,CAAC;QAChB,MAAM,KAAK;QACT,6DAA6D;QAC7D,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrG,OAAO;YACL,SAAS,EAAE,iBAAiB,CAAC,MAAM,CAAC;YACpC,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,+EAA+E;YAC/E,iEAAiE;YACjE,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtD,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnD,0BAA0B,EAAE,KAAK;YACjC,cAAc,EAAE,QAAQ,KAAK,SAAS;YACtC,oEAAoE;YACpE,+EAA+E;YAC/E,gFAAgF;YAChF,GAAG,CAAC,MAAM,CAAC,eAAe,IAAI,IAAI;gBAChC,CAAC,CAAC,EAAE,eAAe,EAAE,MAAM,CAAC,eAAe,EAAE;gBAC7C,CAAC,CAAC,MAAM,CAAC,KAAK,IAAI,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC;oBACrD,CAAC,CAAC,EAAE,eAAe,EAAE,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;oBAC5D,CAAC,CAAC,EAAE,CAAC;YACT,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;SACpC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,aAAa,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,CAAC;AAC1E,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAA0B,EAC1B,aAA4B;IAE5B,OAAO,qBAAqB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC,aAAa,CAAC;AAClE,CAAC;AAwCD;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CACrC,aAA4B;IAE5B,OAAO,kCAAkC,CAAC,aAAa,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;AACzE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kCAAkC,CAChD,OAA6B;IAE7B,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAC5B,MAAM,EAAE,GACN,MAAM,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,QAAQ,IAAI,SAAS,EAAE,CAAC;QACrF,MAAM,KAAK,GAA2B;YACpC,EAAE;YACF,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAChD,GAAG,CAAC,MAAM,CAAC,aAAa,KAAK,SAAS;gBACpC,CAAC,CAAC,EAAE,sBAAsB,EAAE,MAAM,CAAC,aAAa,EAAE;gBAClD,CAAC,CAAC,EAAE,CAAC;SACR,CAAC;QACF,IAAI,MAAM,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;YACvC,KAAK,CAAC,0BAA0B,GAAG,MAAM,CAAC,KAAK;gBAC7C,CAAC,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;gBAC3C,CAAC,CAAC,IAAI,CAAC;QACX,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/shared/providers/proxyCatalog.d.ts

@@ -1,158 +0,0 @@
-import type { DispatchableSource } from "../types/sessionConfig.js";
-/**
- * The POPULATE cache for the proxy lane: discovered via `GET <proxy>/v1/models` +
- * `GET <proxy>/model/info` (OpenAI-compatible surfaces) expanded into ready-to-fold
- * `claude-worker` {@link DispatchableSource}s, written once per populate (Gate-0 build
- * / explicit refresh) and READ by resolve — never fetched mid-resolve.
- *
- * Named `catalog-cache.json`, NOT the `catalog-<auditor-id>.json` the reserved-name
- * comment at `auditorSources.ts` anticipates: populate/resolve run on the AMBIENT
- * path, where no auditor id exists to key on. The cache is machine-level like the
- * declaration beside it — and it is a CACHE of live discovery state, not resolved
- * per-auditor capability, so an auditor-id key would assert an isolation the data
- * doesn't have. Per-auditor never-inherit still holds: every resolve re-proves proxy
- * REACH itself; the cache only supplies the expansion.
- */
-export declare const PROXY_CATALOG_FILENAME = "catalog-cache.json";
-/** Top-K models expanded per backend provider when the operator declares no `top_k`. */
-export declare const DEFAULT_PROXY_TOP_K = 3;
-/** Timeout (ms) for populate-time model verification probes. */
-export declare const POPULATE_PROBE_TIMEOUT_MS = 3000;
-/** Concurrency limit for populate-time model verification probes. */
-export declare const POPULATE_PROBE_CONCURRENCY = 4;
-/**
- * A same-endpoint cache younger than this skips the registry fetch + probes
- * entirely (see the freshness short-circuit in {@link populateProxyCatalog}).
- * Refresh THROTTLE — how often we are willing to PAY for a refresh, which is a
- * different question from how long an unrefreshed cache may still be believed
- * ({@link PROXY_CATALOG_MAX_READ_AGE_MS}). The two thresholds share one age
- * derivation and nothing else.
- */
-export declare const POPULATE_CACHE_FRESH_TTL_MS: number;
-/**
- * Past this age a cache is returned STALE by {@link readProxyCatalog} — the
- * expansion still travels, with a verdict attached, so the caller decides rather
- * than consuming an unbounded-age cache blind.
- *
- * A day: comfortably longer than any single run (a mid-run flip to stale would be
- * churn, not signal), and short enough that a roster the operator changed — a model
- * added to or dropped from the proxy config — cannot go unnoticed indefinitely.
- * The cache is machine-global and tool-written, so being wrong here costs one
- * repopulate, never data.
- */
-export declare const PROXY_CATALOG_MAX_READ_AGE_MS: number;
-/** Resolve the populate-cache path for this machine (state dir via `io/stateDir.ts`). */
-export declare function resolveProxyCatalogPath(homeDir?: string): string;
-/**
- * Shape version of the on-disk cache. Bump whenever a written entry's meaning changes,
- * so a cache written by older code degrades to "absent" rather than being read under
- * new semantics. The cache is tool-written and fully regenerable, so degrading is free —
- * `readProxyCatalog` returns null, and `populateProxyCatalogIfMissing` then repopulates.
- *
- * v2: entries no longer carry a tool-stamped `id`. A v1 entry does, and since `id` now
- * outranks the `service` derivation in `dispatchableSourceId`, reading one under v2
- * semantics would key a proxied lane to `claude-worker:<service>/<model>` instead of
- * `<service>/<model>` — silently splitting it from the direct lane to the same backend
- * and reopening the double-grant boundary.
- */
-export declare const PROXY_CATALOG_VERSION = 2;
-/** The on-disk cache shape: the expansion + when it was fetched. */
-export interface ProxyCatalog {
-    /** Shape version — see {@link PROXY_CATALOG_VERSION}. Absent ⇒ pre-versioned (v1). */
-    version: number;
-    /**
-     * ISO timestamp of the populate fetch. REQUIRED to be parseable — the read-side
-     * age rule is derived from it, and an age derived from a substituted default
-     * would launder a corrupt file into a fresh-looking one.
-     */
-    fetched_at: string;
-    /** The proxy endpoint the registry was fetched from. */
-    endpoint: string;
-    /** Expanded `claude-worker` sources, ready to fold into the dispatch pool. */
-    sources: DispatchableSource[];
-}
-/**
- * The cache as READ: the persisted shape plus the read-time age verdict.
- *
- * Staleness is DERIVED at read, never persisted — a stored flag would age into a lie
- * the moment the clock moved past it. A stale cache is returned, not withheld: the
- * expansion is the caller's to keep (dropping it would surface as "cache absent, run
- * the populate", which sends the operator after a file that is right there), and it is
- * not thrown either (the resolve path must not be failable by an old file).
- *
- * `stale_reason` rides the `stale: true` branch so it cannot be read without branching
- * on the verdict, and so every caller reports one wording instead of composing its own.
- */
-export type ProxyCatalogRead = ProxyCatalog & {
-    /** Cache age at read time, ms. Negative ⇒ stamped ahead of this machine's clock. */
-    age_ms: number;
-} & ({
-    stale: false;
-    stale_reason?: undefined;
-} | {
-    stale: true;
-    stale_reason: string;
-});
-export interface PopulateProxyCatalogOptions {
-    /** The proxy base url (`GET <endpoint>/v1/models`, `GET <endpoint>/model/info`). */
-    endpoint: string;
-    /** Models expanded per backend provider (declared `proxy.top_k`); default {@link DEFAULT_PROXY_TOP_K}. */
-    topK?: number;
-    /**
-     * Operator-declared blended $/Mtok for the proxied lane (`proxy.cost_per_mtok`,
-     * the free-to-operator axis). WINS over any advert price.
-     */
-    costPerMtok?: number;
-    /** Env var holding the proxy's master key when authentication is required. */
-    apiKeyEnv?: string;
-    /** Injectable fetch (tests); defaults to global fetch. */
-    fetchImpl?: typeof fetch;
-    /** Home dir override for the cache path (tests). */
-    homeDir?: string;
-    /** Clock (tests); defaults to `Date.now`-based ISO. */
-    now?: () => Date;
-}
-export interface PopulateProxyCatalogResult {
-    /** The expanded sources (also what was written when `written` is true). */
-    sources: DispatchableSource[];
-    /** Whether the cache file was (re)written. False only when the fetch itself failed. */
-    written: boolean;
-    /** Operator-facing explanation when the registry could not be fetched/parsed. */
-    reason?: string;
-    /** Models dropped during probe verification, with reasons. */
-    dropped: Array<{
-        id: string;
-        reason: string;
-    }>;
-}
-/**
- * POPULATE: discover and expand models from an OpenAI-compatible proxy
- * (`GET <endpoint>/v1/models` + `GET <endpoint>/model/info`) into
- * ready-to-fold `claude-worker` sources, then write to the machine-level cache.
- * Network-bound and cacheable — runs at Gate-0 build / explicit refresh, NEVER
- * inside `resolveAmbientSources` (which only READS via {@link readProxyCatalog}).
- * Never throws: a failed fetch returns `{written:false, reason}` and leaves any
- * prior cache untouched; an empty discovery WRITES an empty expansion (fresh
- * knowledge — resolve reports the lane unexpanded with a reason).
- */
-export declare function populateProxyCatalog(options: PopulateProxyCatalogOptions): Promise<PopulateProxyCatalogResult>;
-export interface ReadProxyCatalogDeps {
-    /** Home dir override for the cache path (tests). */
-    homeDir?: string;
-    /** Raw cache reader (tests inject); defaults to reading the cache file. */
-    readCatalogFile?: (path: string) => string | null;
-    /** Clock (tests); defaults to `new Date()`. Fixes the age rule's reference point. */
-    now?: () => Date;
-}
-/**
- * READ the populate cache, with the read-side age rule applied: every result carries
- * `age_ms` and a `stale` verdict against {@link PROXY_CATALOG_MAX_READ_AGE_MS}, so an
- * old cache reaches its caller labelled rather than indistinguishable from a fresh one.
- * Degrades to `null` on absent / unparseable / structurally-invalid content — never
- * throws (same bar as `readSourceDeclaration`: the resolve path must not be failable by
- * a bad file). Cached sources are held to the shared source validator, so a hand-edited
- * or version-skewed cache degrades to "no cache" rather than admitting a half-checked
- * pool.
- */
-export declare function readProxyCatalog(deps?: ReadProxyCatalogDeps): ProxyCatalogRead | null;
-//# sourceMappingURL=proxyCatalog.d.ts.map

package/dist/shared/providers/proxyCatalog.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"proxyCatalog.d.ts","sourceRoot":"","sources":["../../../src/shared/providers/proxyCatalog.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAGpE;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,sBAAsB,uBAAuB,CAAC;AAE3D,wFAAwF;AACxF,eAAO,MAAM,mBAAmB,IAAI,CAAC;AAUrC,gEAAgE;AAChE,eAAO,MAAM,yBAAyB,OAAO,CAAC;AAE9C,qEAAqE;AACrE,eAAO,MAAM,0BAA0B,IAAI,CAAC;AAE5C;;;;;;;GAOG;AACH,eAAO,MAAM,2BAA2B,QAAc,CAAC;AAEvD;;;;;;;;;;GAUG;AACH,eAAO,MAAM,6BAA6B,QAAmB,CAAC;AAE9D,yFAAyF;AACzF,wBAAgB,uBAAuB,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,MAAM,CAEhE;AAED;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,qBAAqB,IAAI,CAAC;AAEvC,oEAAoE;AACpE,MAAM,WAAW,YAAY;IAC3B,sFAAsF;IACtF,OAAO,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,UAAU,EAAE,MAAM,CAAC;IACnB,wDAAwD;IACxD,QAAQ,EAAE,MAAM,CAAC;IACjB,8EAA8E;IAC9E,OAAO,EAAE,kBAAkB,EAAE,CAAC;CAC/B;AAED;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,gBAAgB,GAAG,YAAY,GAAG;IAC5C,oFAAoF;IACpF,MAAM,EAAE,MAAM,CAAC;CAChB,GAAG,CACE;IAAE,KAAK,EAAE,KAAK,CAAC;IAAC,YAAY,CAAC,EAAE,SAAS,CAAA;CAAE,GAC1C;IAAE,KAAK,EAAE,IAAI,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CACxC,CAAC;AA8BJ,MAAM,WAAW,2BAA2B;IAC1C,oFAAoF;IACpF,QAAQ,EAAE,MAAM,CAAC;IACjB,0GAA0G;IAC1G,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,8EAA8E;IAC9E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,0DAA0D;IAC1D,SAAS,CAAC,EAAE,OAAO,KAAK,CAAC;IACzB,oDAAoD;IACpD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,uDAAuD;IACvD,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;CAClB;AAED,MAAM,WAAW,0BAA0B;IACzC,2EAA2E;IAC3E,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAC9B,uFAAuF;IACvF,OAAO,EAAE,OAAO,CAAC;IACjB,iFAAiF;IACjF,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,8DAA8D;IAC9D,OAAO,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAChD;AA8XD;;;;;;;;;GASG;AACH,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,2BAA2B,GACnC,OAAO,CAAC,0BAA0B,CAAC,CAsKrC;AAED,MAAM,WAAW,oBAAoB;IACnC,oDAAoD;IACpD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,2EAA2E;IAC3E,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,GAAG,IAAI,CAAC;IAClD,qFAAqF;IACrF,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC;CAClB;AAkBD;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,GAAE,oBAAyB,GAC9B,gBAAgB,GAAG,IAAI,CA2DzB"}