language-models 2.1.1 → 2.3.0

package/dist/policy.js

@@ -0,0 +1,246 @@
+/**
+ * ModelPolicy - per-model resilience and tier policy data
+ *
+ * `language-models` owns model identity (alias resolution, capability lookup).
+ * Resilience policy (retry, circuit breaker, fallback chain, batch tier) is
+ * a per-model concern that belongs alongside the catalog data — but the
+ * runtime *machinery* that applies the policy lives in `ai-functions`.
+ *
+ * This module provides:
+ * - `ModelPolicy` MDXLD type (`$type: 'ModelPolicy'`)
+ * - `policyFor(alias)` - resolve an alias and return its derived policy
+ * - `derivePolicy(model, alias?)` - inference layer that turns OpenRouter raw
+ *   data into a policy by applying heuristics (newest frontier model is best,
+ *   price within a family is inversely correlated with capability, etc.)
+ *
+ * Source of truth: OpenRouter raw catalog (data/models.json) + heuristics.
+ * Strategy: runtime derivation, cached. A static snapshot generator could be
+ * added later (see `derivePolicy` — it's pure, so you can pre-compute it).
+ *
+ * @packageDocumentation
+ */
+import { resolve, get, list } from './models.js';
+import { ALIASES } from './aliases.js';
+// ============================================================================
+// Defaults & heuristics
+// ============================================================================
+/** Frontier labs — newer releases tend to be more capable. */
+const FRONTIER_PROVIDERS = new Set(['anthropic', 'openai', 'google']);
+/** Providers with batch APIs supported by ai-functions. */
+const BATCH_PROVIDERS = new Set(['anthropic', 'openai', 'google', 'amazon-bedrock', 'cloudflare']);
+/** Providers with flex (faster-than-batch) APIs. */
+const FLEX_PROVIDERS = new Set(['openai', 'amazon-bedrock']);
+/** Curated fallback seeds — picked one per frontier family. */
+const FRONTIER_FALLBACK = [
+    'anthropic/claude-sonnet-4.5',
+    'anthropic/claude-opus-4.5',
+    'openai/gpt-4o',
+    'google/gemini-2.5-pro',
+];
+/** Default retry policy — matches `ai-functions` `RetryPolicy` defaults. */
+export const DEFAULT_RETRY = {
+    maxRetries: 3,
+    baseDelay: 1000,
+    maxDelay: 30000,
+    multiplier: 2,
+    jitter: 0,
+    retryableCategories: ['network', 'rate_limit', 'server', 'unknown'],
+};
+/** Default circuit breaker — matches `ai-functions` defaults. */
+export const DEFAULT_CIRCUIT_BREAKER = {
+    failureThreshold: 5,
+    resetTimeout: 30000,
+    successThreshold: 1,
+};
+/**
+ * Default policy for an unknown model. Used when no catalog entry is found.
+ */
+export function defaultPolicy(modelId) {
+    const provider = modelId.includes('/') ? modelId.split('/')[0] : 'unknown';
+    return {
+        $type: 'ModelPolicy',
+        $id: modelId,
+        provider,
+        retry: { ...DEFAULT_RETRY },
+        circuitBreaker: { ...DEFAULT_CIRCUIT_BREAKER },
+        fallbackChain: [],
+        batchTier: ['immediate'],
+        errorMapping: {},
+    };
+}
+// ============================================================================
+// Derivation layer
+// ============================================================================
+/**
+ * Parse a price-per-token string to a number. Returns 0 on parse failure.
+ * Pricing comes through OpenRouter as a string (e.g. "0.000003").
+ */
+function parsePrice(p) {
+    if (!p)
+        return 0;
+    const n = Number(p);
+    return Number.isFinite(n) ? n : 0;
+}
+/**
+ * Extract a "family" key from a model id for fallback grouping.
+ * 'anthropic/claude-opus-4.5' → 'anthropic/claude'
+ * 'openai/gpt-4o-mini' → 'openai/gpt'
+ */
+function familyKey(id) {
+    const slash = id.indexOf('/');
+    if (slash < 0)
+        return id;
+    const provider = id.substring(0, slash);
+    const rest = id.substring(slash + 1).toLowerCase();
+    // Strip trailing version tags / size qualifiers
+    const family = rest
+        .replace(/[-_]?\d.*$/, '') // drop -4.5, -2.0, etc
+        .replace(/(opus|sonnet|haiku|mini|pro|flash|lite|maverick|instruct).*$/, '$1')
+        .replace(/-?(opus|sonnet|haiku|mini|pro|flash|lite|maverick|instruct)$/, '');
+    return `${provider}/${family || rest.split('-')[0]}`;
+}
+/**
+ * Derive the fallback chain for a model.
+ *
+ * Heuristics:
+ * 1. Prefer same-family siblings (e.g. sonnet → opus → haiku within Claude)
+ *    ordered by `created` (newer first), then by price descending (more
+ *    expensive within a family is usually more capable).
+ * 2. Then fall back to frontier-lab seeds, skipping the model itself and
+ *    anything from the same family already included.
+ * 3. Cap at 4 entries to keep latency bounded.
+ */
+function deriveFallbackChain(model, allModels) {
+    const chain = [];
+    const seen = new Set([model.id]);
+    const fam = familyKey(model.id);
+    // Step 1: same-family siblings, sorted newest-first then by price desc.
+    const siblings = allModels
+        .filter((m) => m.id !== model.id && familyKey(m.id) === fam)
+        .map((m) => ({
+        m,
+        created: m.created ?? 0,
+        price: parsePrice(m.pricing?.completion),
+    }))
+        .sort((a, b) => {
+        if (b.created !== a.created)
+            return b.created - a.created;
+        return b.price - a.price;
+    });
+    for (const { m } of siblings.slice(0, 2)) {
+        if (!seen.has(m.id)) {
+            chain.push(m.id);
+            seen.add(m.id);
+        }
+    }
+    // Step 2: frontier seeds.
+    for (const seed of FRONTIER_FALLBACK) {
+        if (chain.length >= 4)
+            break;
+        if (seen.has(seed))
+            continue;
+        if (familyKey(seed) === fam)
+            continue;
+        chain.push(seed);
+        seen.add(seed);
+    }
+    return chain;
+}
+/**
+ * Derive batch-tier eligibility from provider capability.
+ */
+function deriveBatchTiers(provider) {
+    const tiers = ['immediate'];
+    if (FLEX_PROVIDERS.has(provider))
+        tiers.push('flex');
+    if (BATCH_PROVIDERS.has(provider))
+        tiers.push('batch');
+    return tiers;
+}
+/**
+ * Derive the retry policy. Frontier providers get one extra attempt because
+ * their rate limits are typically more transient than long-tail providers.
+ */
+function deriveRetry(provider) {
+    if (FRONTIER_PROVIDERS.has(provider)) {
+        return { ...DEFAULT_RETRY, maxRetries: 4, jitter: 0.2 };
+    }
+    return { ...DEFAULT_RETRY };
+}
+/**
+ * Derive the circuit-breaker policy. Frontier providers get a higher
+ * failure threshold (more capacity) and a shorter reset timeout.
+ */
+function deriveCircuitBreaker(provider) {
+    if (FRONTIER_PROVIDERS.has(provider)) {
+        return { failureThreshold: 8, resetTimeout: 20000, successThreshold: 1 };
+    }
+    return { ...DEFAULT_CIRCUIT_BREAKER };
+}
+/**
+ * Derivation layer — turn a `ModelInfo` (from OpenRouter raw data) into a
+ * `ModelPolicy` by applying heuristics.
+ *
+ * Pure function; safe to call at build time to pre-compute a static snapshot.
+ *
+ * @param model - The catalog entry for the model.
+ * @param allModels - The full catalog, used for sibling lookup. Optional;
+ *   defaults to `list()`.
+ */
+export function derivePolicy(model, allModels) {
+    const all = allModels ?? list();
+    const slash = model.id.indexOf('/');
+    const provider = slash > 0 ? model.id.substring(0, slash) : model.provider ?? 'unknown';
+    return {
+        $type: 'ModelPolicy',
+        $id: model.id,
+        provider,
+        retry: deriveRetry(provider),
+        circuitBreaker: deriveCircuitBreaker(provider),
+        fallbackChain: deriveFallbackChain(model, all),
+        batchTier: deriveBatchTiers(provider),
+        errorMapping: {},
+    };
+}
+// ============================================================================
+// Public API
+// ============================================================================
+/** Per-process cache of derived policies, keyed by resolved model id. */
+const policyCache = new Map();
+/**
+ * Resolve an alias (or full model id) and return its policy.
+ *
+ * Falls back to `defaultPolicy(id)` if the model is not in the catalog —
+ * callers always get a usable policy.
+ *
+ * @example
+ * ```ts
+ * const p = policyFor('sonnet')
+ * // p.fallbackChain → ['anthropic/claude-opus-4.5', 'openai/gpt-4o', ...]
+ * // p.batchTier     → ['immediate', 'batch']
+ * ```
+ */
+export function policyFor(input) {
+    const id = resolve(input);
+    const cached = policyCache.get(id);
+    if (cached)
+        return cached;
+    const model = get(id);
+    const policy = model ? derivePolicy(model) : defaultPolicy(id);
+    policyCache.set(id, policy);
+    return policy;
+}
+/**
+ * Reset the policy cache. Useful for tests, or after the catalog is reloaded.
+ */
+export function resetPolicyCache() {
+    policyCache.clear();
+}
+/**
+ * List all known aliases. Convenience for tooling that wants to enumerate
+ * derived policies (e.g. a static snapshot generator).
+ */
+export function listAliases() {
+    return Object.keys(ALIASES);
+}
+//# sourceMappingURL=policy.js.map

package/dist/policy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"policy.js","sourceRoot":"","sources":["../src/policy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAkB,MAAM,aAAa,CAAA;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAiFtC,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E,8DAA8D;AAC9D,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAA;AAErE,2DAA2D;AAC3D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,gBAAgB,EAAE,YAAY,CAAC,CAAC,CAAA;AAElG,oDAAoD;AACpD,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAE5D,+DAA+D;AAC/D,MAAM,iBAAiB,GAAsB;IAC3C,6BAA6B;IAC7B,2BAA2B;IAC3B,eAAe;IACf,uBAAuB;CACxB,CAAA;AAED,4EAA4E;AAC5E,MAAM,CAAC,MAAM,aAAa,GAAoB;IAC5C,UAAU,EAAE,CAAC;IACb,SAAS,EAAE,IAAI;IACf,QAAQ,EAAE,KAAK;IACf,UAAU,EAAE,CAAC;IACb,MAAM,EAAE,CAAC;IACT,mBAAmB,EAAE,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,EAAE,SAAS,CAAC;CACpE,CAAA;AAED,iEAAiE;AACjE,MAAM,CAAC,MAAM,uBAAuB,GAA6B;IAC/D,gBAAgB,EAAE,CAAC;IACnB,YAAY,EAAE,KAAK;IACnB,gBAAgB,EAAE,CAAC;CACpB,CAAA;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe;IAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,SAAS,CAAA;IAC3E,OAAO;QACL,KAAK,EAAE,aAAa;QACpB,GAAG,EAAE,OAAO;QACZ,QAAQ;QACR,KAAK,EAAE,EAAE,GAAG,aAAa,EAAE;QAC3B,cAAc,EAAE,EAAE,GAAG,uBAAuB,EAAE;QAC9C,aAAa,EAAE,EAAE;QACjB,SAAS,EAAE,CAAC,WAAW,CAAC;QACxB,YAAY,EAAE,EAAE;KACjB,CAAA;AACH,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAU;IAC5B,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,CAAA;IAChB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACnB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACnC,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,EAAU;IAC3B,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC7B,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,EAAE,CAAA;IACxB,MAAM,QAAQ,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACvC,MAAM,IAAI,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;IAClD,gDAAgD;IAChD,MAAM,MAAM,GAAG,IAAI;SAChB,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC,uBAAuB;SACjD,OAAO,CAAC,8DAA8D,EAAE,IAAI,CAAC;SAC7E,OAAO,CAAC,8DAA8D,EAAE,EAAE,CAAC,CAAA;IAC9E,OAAO,GAAG,QAAQ,IAAI,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;AACtD,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,mBAAmB,CAAC,KAAgB,EAAE,SAAsB;IACnE,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;IACxC,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IAE/B,wEAAwE;IACxE,MAAM,QAAQ,GAAG,SAAS;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC;SAC3D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACX,CAAC;QACD,OAAO,EAAG,CAAsC,CAAC,OAAO,IAAI,CAAC;QAC7D,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,OAAO,EAAE,UAAU,CAAC;KACzC,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO;YAAE,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAA;QACzD,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;IAC1B,CAAC,CAAC,CAAA;IAEJ,KAAK,MAAM,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YAChB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;QAChB,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,KAAK,MAAM,IAAI,IAAI,iBAAiB,EAAE,CAAC;QACrC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;YAAE,MAAK;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAQ;QAC5B,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG;YAAE,SAAQ;QACrC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAChB,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,QAAgB;IACxC,MAAM,KAAK,GAAgB,CAAC,WAAW,CAAC,CAAA;IACxC,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACpD,IAAI,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IACtD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAAC,QAAgB;IACnC,IAAI,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,GAAG,aAAa,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAA;IACzD,CAAC;IACD,OAAO,EAAE,GAAG,aAAa,EAAE,CAAA;AAC7B,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,QAAgB;IAC5C,IAAI,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,gBAAgB,EAAE,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,EAAE,CAAA;IAC1E,CAAC;IACD,OAAO,EAAE,GAAG,uBAAuB,EAAE,CAAA;AACvC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,YAAY,CAAC,KAAgB,EAAE,SAAuB;IACpE,MAAM,GAAG,GAAG,SAAS,IAAI,IAAI,EAAE,CAAA;IAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IACnC,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,IAAI,SAAS,CAAA;IAEvF,OAAO;QACL,KAAK,EAAE,aAAa;QACpB,GAAG,EAAE,KAAK,CAAC,EAAE;QACb,QAAQ;QACR,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC;QAC5B,cAAc,EAAE,oBAAoB,CAAC,QAAQ,CAAC;QAC9C,aAAa,EAAE,mBAAmB,CAAC,KAAK,EAAE,GAAG,CAAC;QAC9C,SAAS,EAAE,gBAAgB,CAAC,QAAQ,CAAC;QACrC,YAAY,EAAE,EAAE;KACjB,CAAA;AACH,CAAC;AAED,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E,yEAAyE;AACzE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAA;AAElD;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;IACzB,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAClC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAA;IAEzB,MAAM,KAAK,GAAG,GAAG,CAAC,EAAE,CAAC,CAAA;IACrB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;IAC9D,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAA;IAC3B,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB;IAC9B,WAAW,CAAC,KAAK,EAAE,CAAA;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW;IACzB,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AAC7B,CAAC"}

package/dist/pricing/index.d.ts

@@ -0,0 +1,19 @@
+/**
+ * language-models / pricing — canonical LLM model pricing table.
+ *
+ * Consume via the subpath export:
+ *
+ *   import { PRICING_TABLE, priceFor, type ModelPricing } from 'language-models/pricing'
+ *
+ * (Equivalent symbols are also re-exported from the package root —
+ * `import { priceFor } from 'language-models'` works too.)
+ *
+ * Rates are sourced from public Vertex / Bedrock / AI Studio list prices.
+ * `priceFor()` throws on unknown slug/tier rather than returning a silent
+ * zero (per BYOK_GATEWAY_LIES discipline: loud failure beats silent
+ * downgrade).
+ */
+export type { HasPricingArgs, ModelPricing, PriceForArgs, PriceForResult, PricingTier, Provider, RateBlock, } from './types.js';
+export { PRICING_TABLE } from './table.js';
+export { priceFor, listSlugs, hasPricing, rowsForSlug } from './lookup.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/pricing/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/pricing/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,YAAY,EACV,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,cAAc,EACd,WAAW,EACX,QAAQ,EACR,SAAS,GACV,MAAM,YAAY,CAAA;AAEnB,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAE1C,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA"}

package/dist/pricing/index.js

@@ -0,0 +1,18 @@
+/**
+ * language-models / pricing — canonical LLM model pricing table.
+ *
+ * Consume via the subpath export:
+ *
+ *   import { PRICING_TABLE, priceFor, type ModelPricing } from 'language-models/pricing'
+ *
+ * (Equivalent symbols are also re-exported from the package root —
+ * `import { priceFor } from 'language-models'` works too.)
+ *
+ * Rates are sourced from public Vertex / Bedrock / AI Studio list prices.
+ * `priceFor()` throws on unknown slug/tier rather than returning a silent
+ * zero (per BYOK_GATEWAY_LIES discipline: loud failure beats silent
+ * downgrade).
+ */
+export { PRICING_TABLE } from './table.js';
+export { priceFor, listSlugs, hasPricing, rowsForSlug } from './lookup.js';
+//# sourceMappingURL=index.js.map

package/dist/pricing/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/pricing/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAYH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAE1C,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA"}

package/dist/pricing/lookup.d.ts

@@ -0,0 +1,46 @@
+/**
+ * language-models / pricing — lookup helpers.
+ *
+ * The single source of truth for cost computation across the Phase-2
+ * three-repo cascade. Throws on unknown slug/tier (per BYOK_GATEWAY_LIES
+ * memory: silent zero is the lying-gateway pattern; loud failure beats
+ * silent downgrade).
+ */
+import type { HasPricingArgs, ModelPricing, PriceForArgs, PriceForResult } from './types.js';
+/**
+ * Compute USD cost for a known generation. Throws on:
+ * - unknown slug (no rows for the slug at all)
+ * - unknown/unmodeled tier for the slug (no row for the (slug, tier) pair)
+ * - negative token counts (programming error — fail loud)
+ *
+ * Honors `contextTierBreakpoint` when present: if `inputTokens >=
+ * breakpoint`, the entire request is billed at `contextTierAbove` rates
+ * (matches Google's published billing model — the rate switches once the
+ * input crosses 200K, applied to the full request).
+ *
+ * `cachedInputTokens` is billed at `cachedInputPer1M` when defined,
+ * falling back to the regular input rate otherwise. Cached tokens are
+ * SUBTRACTED from `inputTokens` to compute the non-cached portion — i.e.
+ * `inputTokens` is the TOTAL input including any cached tokens.
+ */
+export declare function priceFor(args: PriceForArgs): PriceForResult;
+/**
+ * Returns the unique set of slugs in the table. Useful for adapters that
+ * want to validate caller-supplied model ids before dispatching.
+ */
+export declare function listSlugs(): readonly string[];
+/**
+ * Returns true if pricing exists for the given (slug, tier). Use this
+ * when you need a non-throwing existence check before calling
+ * `priceFor()` (e.g. a metering middleware that wants to fall back to
+ * "unknown cost" telemetry rather than throwing on a not-yet-registered
+ * model).
+ */
+export declare function hasPricing(args: HasPricingArgs): boolean;
+/**
+ * Returns all pricing rows for a slug, across all tiers. Useful for
+ * tooling that wants to display "this model has standard + batch tiers"
+ * in a UI.
+ */
+export declare function rowsForSlug(slug: string): readonly ModelPricing[];
+//# sourceMappingURL=lookup.d.ts.map

package/dist/pricing/lookup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lookup.d.ts","sourceRoot":"","sources":["../../src/pricing/lookup.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,KAAK,EACV,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,cAAc,EAEf,MAAM,YAAY,CAAA;AAEnB;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,YAAY,GAAG,cAAc,CAoC3D;AAED;;;GAGG;AACH,wBAAgB,SAAS,IAAI,SAAS,MAAM,EAAE,CAI7C;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,cAAc,GAAG,OAAO,CAExD;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,YAAY,EAAE,CAEjE"}

package/dist/pricing/lookup.js

@@ -0,0 +1,94 @@
+/**
+ * language-models / pricing — lookup helpers.
+ *
+ * The single source of truth for cost computation across the Phase-2
+ * three-repo cascade. Throws on unknown slug/tier (per BYOK_GATEWAY_LIES
+ * memory: silent zero is the lying-gateway pattern; loud failure beats
+ * silent downgrade).
+ */
+import { PRICING_TABLE } from './table.js';
+/**
+ * Compute USD cost for a known generation. Throws on:
+ * - unknown slug (no rows for the slug at all)
+ * - unknown/unmodeled tier for the slug (no row for the (slug, tier) pair)
+ * - negative token counts (programming error — fail loud)
+ *
+ * Honors `contextTierBreakpoint` when present: if `inputTokens >=
+ * breakpoint`, the entire request is billed at `contextTierAbove` rates
+ * (matches Google's published billing model — the rate switches once the
+ * input crosses 200K, applied to the full request).
+ *
+ * `cachedInputTokens` is billed at `cachedInputPer1M` when defined,
+ * falling back to the regular input rate otherwise. Cached tokens are
+ * SUBTRACTED from `inputTokens` to compute the non-cached portion — i.e.
+ * `inputTokens` is the TOTAL input including any cached tokens.
+ */
+export function priceFor(args) {
+    const { slug, tier, inputTokens, outputTokens, cachedInputTokens } = args;
+    if (inputTokens < 0 || outputTokens < 0 || (cachedInputTokens ?? 0) < 0) {
+        throw new RangeError(`priceFor() requires non-negative token counts; got input=${inputTokens}, output=${outputTokens}, cachedInput=${cachedInputTokens ?? 0}`);
+    }
+    const row = findRow(slug, tier);
+    // Pick the right rate block based on context-tier breakpoint.
+    const useAbove = typeof row.contextTierBreakpoint === 'number' &&
+        row.contextTierAbove !== undefined &&
+        inputTokens >= row.contextTierBreakpoint;
+    const block = useAbove
+        ? row.contextTierAbove
+        : {
+            inputPer1M: row.inputPer1M,
+            outputPer1M: row.outputPer1M,
+            cachedInputPer1M: row.cachedInputPer1M,
+        };
+    const cachedTok = Math.min(cachedInputTokens ?? 0, inputTokens);
+    const nonCachedInputTok = inputTokens - cachedTok;
+    const cachedRate = block.cachedInputPer1M ?? block.inputPer1M;
+    const inputUsd = (nonCachedInputTok / 1_000_000) * block.inputPer1M + (cachedTok / 1_000_000) * cachedRate;
+    const outputUsd = (outputTokens / 1_000_000) * block.outputPer1M;
+    const totalUsd = inputUsd + outputUsd;
+    return { inputUsd, outputUsd, totalUsd };
+}
+/**
+ * Returns the unique set of slugs in the table. Useful for adapters that
+ * want to validate caller-supplied model ids before dispatching.
+ */
+export function listSlugs() {
+    const set = new Set();
+    for (const row of PRICING_TABLE)
+        set.add(row.slug);
+    return Array.from(set);
+}
+/**
+ * Returns true if pricing exists for the given (slug, tier). Use this
+ * when you need a non-throwing existence check before calling
+ * `priceFor()` (e.g. a metering middleware that wants to fall back to
+ * "unknown cost" telemetry rather than throwing on a not-yet-registered
+ * model).
+ */
+export function hasPricing(args) {
+    return PRICING_TABLE.some((row) => row.slug === args.slug && row.tier === args.tier);
+}
+/**
+ * Returns all pricing rows for a slug, across all tiers. Useful for
+ * tooling that wants to display "this model has standard + batch tiers"
+ * in a UI.
+ */
+export function rowsForSlug(slug) {
+    return PRICING_TABLE.filter((row) => row.slug === slug);
+}
+// ---------------------------------------------------------------------------
+// Internal
+// ---------------------------------------------------------------------------
+function findRow(slug, tier) {
+    const slugRows = PRICING_TABLE.filter((row) => row.slug === slug);
+    if (slugRows.length === 0) {
+        throw new Error(`Unknown model slug: '${slug}'. Known slugs: ${listSlugs().slice(0, 8).join(', ')}${listSlugs().length > 8 ? `, ...(${listSlugs().length - 8} more)` : ''}`);
+    }
+    const tierRow = slugRows.find((row) => row.tier === tier);
+    if (tierRow === undefined) {
+        const availableTiers = slugRows.map((row) => row.tier);
+        throw new Error(`No '${tier}' pricing for slug '${slug}'. Available tiers: ${availableTiers.join(', ')}`);
+    }
+    return tierRow;
+}
+//# sourceMappingURL=lookup.js.map

package/dist/pricing/lookup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lookup.js","sourceRoot":"","sources":["../../src/pricing/lookup.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAS1C;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAkB;IACzC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,YAAY,EAAE,iBAAiB,EAAE,GAAG,IAAI,CAAA;IAEzE,IAAI,WAAW,GAAG,CAAC,IAAI,YAAY,GAAG,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACxE,MAAM,IAAI,UAAU,CAClB,4DAA4D,WAAW,YAAY,YAAY,iBAC7F,iBAAiB,IAAI,CACvB,EAAE,CACH,CAAA;IACH,CAAC;IAED,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAE/B,8DAA8D;IAC9D,MAAM,QAAQ,GACZ,OAAO,GAAG,CAAC,qBAAqB,KAAK,QAAQ;QAC7C,GAAG,CAAC,gBAAgB,KAAK,SAAS;QAClC,WAAW,IAAI,GAAG,CAAC,qBAAqB,CAAA;IAC1C,MAAM,KAAK,GAAG,QAAQ;QACpB,CAAC,CAAE,GAAG,CAAC,gBAA6D;QACpE,CAAC,CAAC;YACE,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,WAAW,EAAE,GAAG,CAAC,WAAW;YAC5B,gBAAgB,EAAE,GAAG,CAAC,gBAAgB;SACvC,CAAA;IAEL,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,IAAI,CAAC,EAAE,WAAW,CAAC,CAAA;IAC/D,MAAM,iBAAiB,GAAG,WAAW,GAAG,SAAS,CAAA;IACjD,MAAM,UAAU,GAAG,KAAK,CAAC,gBAAgB,IAAI,KAAK,CAAC,UAAU,CAAA;IAE7D,MAAM,QAAQ,GACZ,CAAC,iBAAiB,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,UAAU,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,UAAU,CAAA;IAC3F,MAAM,SAAS,GAAG,CAAC,YAAY,GAAG,SAAS,CAAC,GAAG,KAAK,CAAC,WAAW,CAAA;IAChE,MAAM,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAA;IAErC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAA;AAC1C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS;IACvB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;IAC7B,KAAK,MAAM,GAAG,IAAI,aAAa;QAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAClD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACxB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,IAAoB;IAC7C,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAA;AACtF,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY;IACtC,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;AACzD,CAAC;AAED,8EAA8E;AAC9E,WAAW;AACX,8EAA8E;AAE9E,SAAS,OAAO,CAAC,IAAY,EAAE,IAAiB;IAC9C,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;IACjE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CACb,wBAAwB,IAAI,mBAAmB,SAAS,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAC/E,SAAS,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,MAAM,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EACrE,EAAE,CACH,CAAA;IACH,CAAC;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;IACzD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACtD,MAAM,IAAI,KAAK,CACb,OAAO,IAAI,uBAAuB,IAAI,uBAAuB,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACzF,CAAA;IACH,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC"}

package/dist/pricing/table.d.ts

@@ -0,0 +1,46 @@
+/**
+ * language-models / pricing — canonical model pricing table.
+ *
+ * All rates are USD per 1,000,000 tokens (per1M form, NOT per1k). Sourced
+ * from public list prices on 2026-05-07. Where prior repo tables disagree,
+ * the most-recently-updated source wins:
+ *
+ * - **Vertex Gemini 3.x**: startup-builder/packages/llm-vertex-batch
+ *   (sb-srnl 2026-05-07 verified) is canonical for the flex/batch tier.
+ *   startup-builder/packages/llm-vertex (same date) is canonical for
+ *   standard interactive pricing.
+ * - **Vertex Gemini 2.5**: startup-builder/llm-vertex-batch is canonical
+ *   (icps's `gemini-2.5-flash` rates were ~4× off — likely transposed
+ *   from a different SKU).
+ * - **Bedrock Anthropic**: startup-builder/packages/llm-bedrock is the
+ *   most-recently-curated table (matches AWS Bedrock public pricing on
+ *   2026-05-07).
+ * - **Embeddings**: icps/packages/llm/pricing.ts is the source for
+ *   `gemini-embedding-2`. Bedrock has no first-party Gemini embedding
+ *   SKU; Anthropic has no embedding SKU. Embedding lives under
+ *   `aistudio/` since the cheapest path is the AI Studio API key (icps's
+ *   2026-05-07 fallback chain — the path startup-builder also uses).
+ *
+ * 200K-context tier breakpoint:
+ *
+ * Gemini 3.1 Pro Preview list pricing has a 2× rate above 200K input
+ * tokens. We model this with `contextTierBreakpoint: 200_000` +
+ * `contextTierAbove`. Anthropic Claude has flat pricing (no breakpoint).
+ * Gemini 2.5 + 3.x flash-lite + embedding SKUs are flat too.
+ *
+ * Adding a new SKU:
+ *
+ * 1. Append a new row keyed on `<provider>/<short-slug>` + `tier`. Both
+ *    fields together form the lookup key; duplicates are caught by the
+ *    table-integrity test.
+ * 2. If the SKU has a context-tier breakpoint, add
+ *    `contextTierBreakpoint` + `contextTierAbove`. Otherwise omit them.
+ * 3. If both standard + batch tiers exist, add BOTH rows; downstream
+ *    consumers select via `priceFor({ tier: ... })`. Vertex's batch tier
+ *    is ~50% of standard; that's not enforced — declare the actual
+ *    published rates.
+ * 4. Bump the package version (semver minor for additions).
+ */
+import type { ModelPricing } from './types.js';
+export declare const PRICING_TABLE: readonly ModelPricing[];
+//# sourceMappingURL=table.d.ts.map

package/dist/pricing/table.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"table.d.ts","sourceRoot":"","sources":["../../src/pricing/table.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAE9C,eAAO,MAAM,aAAa,EAAE,SAAS,YAAY,EA4LhD,CAAA"}