@aglyn/plugins-ai 1.0.0-beta.249 → 1.0.0-beta.252

package/src/lib/providers/model-choice.d.ts

@@ -78,7 +78,7 @@ export interface AiModelBounds {
     /** The org-wide restriction; `null` for none. */
     orgModels?: readonly string[] | null;
 }
-/** The catalog models a manual pick may name on a provider under these bounds. */
+/** The current catalog models a manual pick may name on a provider under these bounds. */
 export declare function aiModelsSelectable(providerId: string, bounds: AiModelBounds): AiCatalogEntry[];
 export interface AiModelChoice {
     /** The catalog id the request runs, and is metered, on. */

package/src/lib/providers/model-choice.js

@@ -15,7 +15,7 @@
  * limitations under the License.
  */ import { assistCreditsFromUsd } from "../usage/assist-credits.js";
 import { AI_MODEL_CATALOG, AI_STEP_TIERS, aiCatalogEntry, aiBilledRatesForModel, estimateAiBilledUsd } from "./catalog.js";
-import { resolveAiRoute } from "./routing.js";
+import { aiServingModelId, resolveAiRoute } from "./routing.js";
 /**
  * THE MODEL SWITCH (AGL-2942): what a person may pick, what "Auto" means,
  * and what a pick costs.
@@ -105,9 +105,11 @@ import { resolveAiRoute } from "./routing.js";
         cacheReadTokens: 1050,
         cacheWriteTokens: 0
     },
+    // One element's rewrite on the fast tier, counted as Claude Haiku 5.5 counts
+    // it: about 30% more tokens than Haiku 4.5 for the same text (AGL-3781).
     'copy.element': {
-        inputTokens: 350,
-        outputTokens: 120,
+        inputTokens: 455,
+        outputTokens: 156,
         cacheReadTokens: 0,
         cacheWriteTokens: 0
     },
@@ -169,16 +171,17 @@ import { resolveAiRoute } from "./routing.js";
         cacheReadTokens: 5800,
         cacheWriteTokens: 0
     },
-    // The CRM step's exchange (AGL-2917). NOTHING is cached: the step runs on
-    // the fast tier, whose cacheable minimum is far above what its prompt
-    // reaches — the doctrine's field rules, the CRM rules and the tool come to
-    // 650 to 913 tokens, as `runtime/ai-prompt-cache.spec.ts` measures — so
-    // every byte is billed as input. A record's facts ride with them, a
-    // timeline cut to its newest twelve entries, and the typical answer is a
-    // summary and a next step of a few sentences, with no thinking.
+    // The CRM step's exchange (AGL-2917), counted as the fast tier's Claude
+    // Haiku 5.5 counts it, about 30% more tokens than Haiku 4.5 (AGL-3781). The
+    // doctrine's field rules, the CRM rules and the tool come to 650 to 913
+    // tokens, as `runtime/ai-prompt-cache.spec.ts` measures them, which caches on
+    // that model; one question about a record writes it, so it is counted as
+    // input. A record's facts ride with them, a timeline cut to its newest twelve
+    // entries, and the typical answer is a summary and a next step of a few
+    // sentences, with no thinking.
     'job.crm': {
-        inputTokens: 1800,
-        outputTokens: 250,
+        inputTokens: 2340,
+        outputTokens: 325,
         cacheReadTokens: 0,
         cacheWriteTokens: 0
     },
@@ -228,19 +231,20 @@ import { resolveAiRoute } from "./routing.js";
         cacheWriteTokens: 0
     },
     // The SEO step's listing exchange, which a page's or a product's listing is
-    // exactly one of. NOTHING is cached here, whatever the breakpoints say: the
-    // step runs on the fast tier, whose cacheable minimum is four times what
-    // this prompt reaches, so every static byte is billed as input on every
-    // attempt — the doctrine's block in its field scope, the listing rules and
-    // the tool's schema, about 760 tokens together. The page text, capped at
-    // 2,000 characters, rides with the current listing and a dozen other titles
-    // for about another 750. The largest answer the tool accepts is about 600
-    // characters of JSON, and the request asks for no thinking. An audit pass
-    // is heavier: eight pages' findings and text, about 9,000 characters, with
-    // up to about 8,000 back.
+    // exactly one of: the median of 146 production listings of October 8–14
+    // (2,255 input and 213 output tokens on Claude Haiku 4.5), counted as the
+    // fast tier's Claude Haiku 5.5 counts them, about 30% more (AGL-3781). The
+    // doctrine's block in its field scope, the listing rules and the tool's
+    // schema are its prefix, which caches on that model and which a site's next
+    // listing reads; a lone listing writes it, so it is counted as input. The
+    // page text, capped at 2,000 characters, rides with the current listing and a
+    // dozen other titles. The largest answer the tool accepts is about 600
+    // characters of JSON, and the request asks for no thinking. An audit pass is
+    // heavier: eight pages' findings and text, about 9,000 characters, with up to
+    // about 8,000 back.
     'job.seo': {
-        inputTokens: 1500,
-        outputTokens: 250,
+        inputTokens: 2930,
+        outputTokens: 277,
         cacheReadTokens: 0,
         cacheWriteTokens: 0
     },
@@ -331,16 +335,19 @@ import { resolveAiRoute } from "./routing.js";
     }
 };
 /** The fewest measured exchanges a median is taken over. */ export const AI_MEASURED_MEDIAN_MIN_SAMPLES = 3;
+/** Whether a list names a model, a retired id on it naming its successor (AGL-3781). */ function names(list, id) {
+    return list.some((listed)=>aiServingModelId(listed) === id);
+}
 function onLists(entry, bounds) {
     var _bounds_orgModels;
-    if (((_bounds_orgModels = bounds.orgModels) == null ? void 0 : _bounds_orgModels.length) && !bounds.orgModels.includes(entry.id)) return false;
-    if (bounds.allotmentModels && !bounds.allotmentModels.includes(entry.id)) return false;
+    if (((_bounds_orgModels = bounds.orgModels) == null ? void 0 : _bounds_orgModels.length) && !names(bounds.orgModels, entry.id)) return false;
+    if (bounds.allotmentModels && !names(bounds.allotmentModels, entry.id)) return false;
     return true;
 }
-/** The catalog models a manual pick may name on a provider under these bounds. */ export function aiModelsSelectable(providerId, bounds) {
+/** The current catalog models a manual pick may name on a provider under these bounds. */ export function aiModelsSelectable(providerId, bounds) {
     var _AI_PLAN_MODEL_TIERS_bounds_plan;
     const tiers = (_AI_PLAN_MODEL_TIERS_bounds_plan = AI_PLAN_MODEL_TIERS[bounds.plan]) != null ? _AI_PLAN_MODEL_TIERS_bounds_plan : [];
-    return AI_MODEL_CATALOG.filter((entry)=>entry.provider === providerId && tiers.includes(entry.tier) && onLists(entry, bounds));
+    return AI_MODEL_CATALOG.filter((entry)=>entry.provider === providerId && !entry.successor && tiers.includes(entry.tier) && onLists(entry, bounds));
 }
 /**
  * A model's blended BILLED rate, for "the cheapest allowed" and nothing
@@ -362,7 +369,9 @@ function onLists(entry, bounds) {
     var _bounds_orgModels;
     const route = resolveAiRoute(kind, settings);
     if (!route) return null;
-    const wanted = typeof requested === 'string' && requested.trim() && requested.trim() !== AI_MODEL_AUTO ? requested.trim() : null;
+    // A pick of a retired model, from a job made before it retired, is a pick
+    // of the model that serves in its place.
+    const wanted = typeof requested === 'string' && requested.trim() && requested.trim() !== AI_MODEL_AUTO ? aiServingModelId(requested.trim()) : null;
     if (wanted && aiModelsSelectable(route.provider.id, bounds).some((entry)=>entry.id === wanted)) {
         return {
             model: wanted,
@@ -373,7 +382,7 @@ function onLists(entry, bounds) {
     const restricted = Boolean((_bounds_orgModels = bounds.orgModels) == null ? void 0 : _bounds_orgModels.length) || Boolean(bounds.allotmentModels);
     let model = route.model;
     if (restricted) {
-        const allowed = AI_MODEL_CATALOG.filter((entry)=>entry.provider === route.provider.id && onLists(entry, bounds));
+        const allowed = AI_MODEL_CATALOG.filter((entry)=>entry.provider === route.provider.id && !entry.successor && onLists(entry, bounds));
         if (allowed.length && !allowed.some((entry)=>entry.id === model)) {
             var _ref;
             var _aiCatalogEntry;

package/src/lib/providers/model-choice.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/providers/model-choice.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assistCreditsFromUsd } from '../usage/assist-credits'\nimport type { OrgPlan } from '@aglyn/aglyn/foundation/definitions/org-billing.types'\nimport {\n  AI_MODEL_CATALOG,\n  AI_STEP_TIERS,\n  aiCatalogEntry,\n  aiBilledRatesForModel,\n  estimateAiBilledUsd,\n  type AiCatalogEntry,\n  type AiStepKind,\n} from './catalog'\nimport type { AiUsage } from './contract'\nimport { resolveAiRoute, type AiPluginSettings } from './routing'\n\n/**\n * THE MODEL SWITCH (AGL-2942): what a person may pick, what \"Auto\" means,\n * and what a pick costs.\n *\n * ## Auto is the routing table\n *\n * A request that names no model — or names one it may not have — runs on\n * `resolveAiRoute(kind)`, the table that maps a step kind to a catalog model\n * (AGL-2937). Picking a model is an override of that one row for one request,\n * never a second table.\n *\n * ## Three bounds, one intersection\n *\n * A manual pick must be served by the active provider, in a tier the org's\n * plan offers (`AI_PLAN_MODEL_TIERS`), on the org's own restriction when it\n * set one, and on the allotment allowlists that apply to the request. The\n * two allowlists bound Auto too: when the routing table's answer is not on\n * them, Auto runs on the allowed model of the same tier, else the cheapest\n * allowed one. The plan bounds only a pick — Auto is the platform's choice,\n * made for the step, and a plan never makes it worse.\n *\n * An allowlist that leaves nothing this deployment serves is not a way to\n * switch AI off by mistake: the choice falls back to the routing table, and\n * the permission keys are how AI is switched off on purpose.\n *\n * ## The price beside each option\n *\n * Credits per typical request at each model's list rates, over the step's\n * measured median exchange when the workspace has enough of them, and over\n * `AI_STEP_NOMINAL_USAGE` until it does — with the multiple of what Auto\n * would cost for the same request. Every figure is credits, never dollars.\n */\n\n/** The value a request sends for \"let the platform route it\". */\nexport const AI_MODEL_AUTO = 'auto'\n\n/**\n * The catalog tiers a MANUAL pick may name, per plan. Free runs on Auto only:\n * its taste is a wall, and a pick there would spend the account's credits at\n * a rate nobody chose on purpose. The dearest tier opens from Scale up, where\n * the band is large enough that a slower, deeper model is a real choice\n * rather than a fast way to end the month.\n */\nexport const AI_PLAN_MODEL_TIERS: Record<OrgPlan, readonly AiCatalogEntry['tier'][]> = {\n  free: [],\n  starter: ['fast', 'balanced'],\n  pro: ['fast', 'balanced'],\n  business: ['fast', 'balanced'],\n  scale: ['fast', 'balanced', 'deep'],\n  advanced: ['fast', 'balanced', 'deep'],\n  agency: ['fast', 'balanced', 'deep'],\n  enterprise: ['fast', 'balanced', 'deep'],\n}\n\n/** The plans whose admins may restrict the model set org-wide. */\nexport const AI_MODEL_RESTRICTION_PLANS: readonly OrgPlan[] = ['agency', 'enterprise']\n\n/**\n * A typical exchange per step kind, before a workspace has measured one: the\n * doors' own prompt sizes and output ceilings, read conservatively. Replaced\n * by the workspace's measured median as soon as `aiMedianUsage` has enough\n * samples, and only ever used for the price beside an option.\n */\nexport const AI_STEP_NOMINAL_USAGE: Record<AiStepKind, AiUsage> = {\n  'assist.chat': { inputTokens: 900, outputTokens: 450, cacheReadTokens: 1_050, cacheWriteTokens: 0 },\n  'copy.element': { inputTokens: 350, outputTokens: 120, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  'copy.section': { inputTokens: 700, outputTokens: 1_400, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  'copy.blog': { inputTokens: 600, outputTokens: 1_100, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  'generate.section': { inputTokens: 700, outputTokens: 1_400, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The text step's rules are about 500 characters — far under the balanced\n  // tier's cacheable minimum, so they are billed as input every time rather\n  // than read from a cache (`runtime/ai-prompt-cache.spec.ts` measures it).\n  'job.text': { inputTokens: 450, outputTokens: 500, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The theme step: the tool's schema and both system blocks (about 7,500\n  // characters) are the cached prefix, the site's inventory and the brief ride\n  // uncached, and a full-palette answer is about 1,300 characters of JSON with\n  // as much again to think in.\n  'job.theme': { inputTokens: 500, outputTokens: 850, cacheReadTokens: 2_500, cacheWriteTokens: 0 },\n  // The plan step: the tool's schema, the doctrine and the plan instructions\n  // (about 10,000 characters) are the cached prefix, the site inventory and the\n  // brief ride uncached, and a plan answer is about 600 characters of JSON with\n  // as much again to think in.\n  'job.plan': { inputTokens: 500, outputTokens: 400, cacheReadTokens: 3_600, cacheWriteTokens: 0 },\n  // The component step: the doctrine, the component instructions, the\n  // component surface's catalog and the tool are the cached prefix, the site\n  // inventory, the brief and the confirmed plan ride uncached, and a card-sized\n  // answer — its tree and declared props as JSON — is about 1,700 characters.\n  // The component step's spec measures the prefix and the answer against this.\n  'job.component': { inputTokens: 700, outputTokens: 600, cacheReadTokens: 5_800, cacheWriteTokens: 0 },\n  // The CRM step's exchange (AGL-2917). NOTHING is cached: the step runs on\n  // the fast tier, whose cacheable minimum is far above what its prompt\n  // reaches — the doctrine's field rules, the CRM rules and the tool come to\n  // 650 to 913 tokens, as `runtime/ai-prompt-cache.spec.ts` measures — so\n  // every byte is billed as input. A record's facts ride with them, a\n  // timeline cut to its newest twelve entries, and the typical answer is a\n  // summary and a next step of a few sentences, with no thinking.\n  'job.crm': { inputTokens: 1_800, outputTokens: 250, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // A layout: a tree layout's 1,000 output tokens until AGL-3660, now a\n  // site's header and footer in the layout language — 442 to 583 output\n  // tokens live on 2026-10-07 — with up to 1,500 more for the adaptive\n  // thinking it is asked with, an estimate until a workspace measures it.\n  'job.layout': { inputTokens: 700, outputTokens: 2_000, cacheReadTokens: 5_600, cacheWriteTokens: 0 },\n  'job.template': { inputTokens: 1_200, outputTokens: 700, cacheReadTokens: 6_400, cacheWriteTokens: 0 },\n  // One page section's exchange (AGL-2907), from the modules' own text: the\n  // doctrine (6,281 characters), the page instructions (1,524), the screen\n  // palette catalog (8,353) and the section tool (484) are the cached prefix;\n  // the site inventory (711 on the median golden site), the brief, the plan\n  // and the section line ride uncached; and a golden section answer is 901\n  // characters at the median, asked for with no thinking.\n  // Since AGL-3660 a site's and a build's pages are one answer a page in\n  // the layout language: 683 to 1,745 output tokens live on 2026-10-07, about\n  // 1,150 at the median, with up to 1,500 more for the adaptive thinking it\n  // is asked with — an estimate until a workspace measures it, read high so\n  // the quote beside a model never undersells the exchange.\n  'job.page': { inputTokens: 600, outputTokens: 2_650, cacheReadTokens: 4_400, cacheWriteTokens: 0 },\n  // One product's copy (AGL-2916), the exchange a bulk job makes once a\n  // product: the doctrine, the copy rules and the tool (about 9,500 characters)\n  // are the cached prefix; the product's facts, the site's categories and a\n  // photo at most 768 pixels on its long edge (about 790 tokens) ride\n  // uncached; and the answer is a description with its search listing, tags,\n  // categories and option names, about 1,300 characters of JSON.\n  'job.products': { inputTokens: 1_500, outputTokens: 450, cacheReadTokens: 2_400, cacheWriteTokens: 0 },\n  // The SEO step's listing exchange, which a page's or a product's listing is\n  // exactly one of. NOTHING is cached here, whatever the breakpoints say: the\n  // step runs on the fast tier, whose cacheable minimum is four times what\n  // this prompt reaches, so every static byte is billed as input on every\n  // attempt — the doctrine's block in its field scope, the listing rules and\n  // the tool's schema, about 760 tokens together. The page text, capped at\n  // 2,000 characters, rides with the current listing and a dozen other titles\n  // for about another 750. The largest answer the tool accepts is about 600\n  // characters of JSON, and the request asks for no thinking. An audit pass\n  // is heavier: eight pages' findings and text, about 9,000 characters, with\n  // up to about 8,000 back.\n  'job.seo': { inputTokens: 1_500, outputTokens: 250, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The experiment step (AGL-2914). NOTHING is cached: the A/B test rules\n  // and the acceptable-use block come to about 2,300 characters, under the\n  // balanced tier's cacheable minimum, so they are billed as input every\n  // time. The copy under test, or a test's arms with its verdict, rides with\n  // them, and a four-variant answer is about 800 characters of JSON.\n  'job.experiment': { inputTokens: 900, outputTokens: 300, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The form step: the doctrine, the form instructions, the form surface's\n  // catalog (about 150 tokens) and the tool's schema are the cached prefix, the\n  // site inventory and the brief ride uncached, and a form's answer is 200 to\n  // 400 tokens of JSON with no extended thinking.\n  'job.form': { inputTokens: 700, outputTokens: 450, cacheReadTokens: 3_900, cacheWriteTokens: 0 },\n  // An insight (AGL-2915): two exchanges, and NOTHING cached — the rules and\n  // the acceptable-use block are under the balanced tier's minimum, so they\n  // are billed as input on both. The read call carries the question and the\n  // readers' catalog (about 2,000 characters) and answers a few reads; the\n  // answer call carries four tables of about ten rows each (about 4,000\n  // characters) and answers three to five insights as JSON.\n  'job.insight': { inputTokens: 2_800, outputTokens: 650, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The email step, and the campaign step that shares its generation: the\n  // doctrine, the email instructions, the email palette catalog and the\n  // tool's schema (about 10,300 characters) are the cached prefix, the site\n  // inventory and the brief ride uncached, and the answer is one email's\n  // node map with three subject lines and three preheaders.\n  'job.email': { inputTokens: 600, outputTokens: 1_500, cacheReadTokens: 3_600, cacheWriteTokens: 0 },\n  'job.campaign': { inputTokens: 600, outputTokens: 1_500, cacheReadTokens: 3_600, cacheWriteTokens: 0 },\n  // The workflow step's draft (AGL-2919): the doctrine, the automation\n  // vocabulary and the tool's schema are the cached prefix (4,564 tokens, as\n  // `runtime/ai-prompt-cache.spec.ts` measures it); what the workspace can\n  // run, the site's forms and datasets and the description ride uncached; and\n  // an automation of a few steps is about 1,300 characters of JSON with as\n  // much again to think in. An explanation caches half as much.\n  'job.workflow': { inputTokens: 500, outputTokens: 1_000, cacheReadTokens: 4_500, cacheWriteTokens: 0 },\n  // The logic step (AGL-3603): the fields doctrine, one rules block and the\n  // tool's schema are the cached prefix (1,556 tokens for a function, as\n  // `runtime/ai-prompt-cache.spec.ts` measures it); the site's variables and\n  // the request ride uncached, and a function of a few operations is about\n  // 1,200 characters of JSON with as much again to think in.\n  'job.logic': { inputTokens: 700, outputTokens: 900, cacheReadTokens: 1_500, cacheWriteTokens: 0 },\n  // The edit step (AGL-3616): the document doctrine, the job's rules and the\n  // edit rung's protocol and catalog for the document's kind are the cached\n  // prefix (5,970 tokens for a page, as `runtime/ai-prompt-cache.spec.ts`\n  // measures it); the outline of up to sixty elements with their settings\n  // and the request ride uncached, and a change of a few operations is about\n  // 1,500 characters of tool call with as much again to think in.\n  'job.edit': { inputTokens: 2_500, outputTokens: 1_000, cacheReadTokens: 6_000, cacheWriteTokens: 0 },\n}\n\n/** The fewest measured exchanges a median is taken over. */\nexport const AI_MEASURED_MEDIAN_MIN_SAMPLES = 3\n\nexport interface AiModelBounds {\n  plan: OrgPlan\n  /** The allotment allowlists that apply, intersected; `null` for none. */\n  allotmentModels?: readonly string[] | null\n  /** The org-wide restriction; `null` for none. */\n  orgModels?: readonly string[] | null\n}\n\nfunction onLists(entry: AiCatalogEntry, bounds: AiModelBounds): boolean {\n  if (bounds.orgModels?.length && !bounds.orgModels.includes(entry.id)) return false\n  if (bounds.allotmentModels && !bounds.allotmentModels.includes(entry.id)) return false\n  return true\n}\n\n/** The catalog models a manual pick may name on a provider under these bounds. */\nexport function aiModelsSelectable(\n  providerId: string,\n  bounds: AiModelBounds,\n): AiCatalogEntry[] {\n  const tiers = AI_PLAN_MODEL_TIERS[bounds.plan] ?? []\n  return AI_MODEL_CATALOG.filter(\n    (entry) =>\n      entry.provider === providerId && tiers.includes(entry.tier) && onLists(entry, bounds),\n  )\n}\n\n/**\n * A model's blended BILLED rate, for \"the cheapest allowed\" and nothing\n * else.\n *\n * Billed and not provider (AGL-3015): the substitution below happens when a\n * workspace asked for a model its bounds do not allow, and the party it\n * falls back for is the one whose credits are drawn. \"Cheapest\" has to mean\n * the same thing here as in the selector this substitution stands in for,\n * which sorts on `creditsPerRequest`.\n */\nconst blendedRate = (id: string): number => {\n  const rates = aiBilledRatesForModel(id)\n  return rates.inputPerToken + rates.outputPerToken\n}\n\nexport interface AiModelChoice {\n  /** The catalog id the request runs, and is metered, on. */\n  model: string\n  /** True when the routing table decided: Auto, or a pick that was declined. */\n  auto: boolean\n  /** A pick that was asked for and is not allowed, for the envelope. */\n  declined: string | null\n}\n\n/**\n * The model one request runs on, or `null` when no provider is registered —\n * which every door has refused before it asks.\n */\nexport function resolveAiModelChoice(\n  kind: AiStepKind,\n  requested: unknown,\n  bounds: AiModelBounds,\n  settings?: AiPluginSettings,\n): AiModelChoice | null {\n  const route = resolveAiRoute(kind, settings)\n  if (!route) return null\n  const wanted =\n    typeof requested === 'string' && requested.trim() && requested.trim() !== AI_MODEL_AUTO\n      ? requested.trim()\n      : null\n  if (wanted && aiModelsSelectable(route.provider.id, bounds).some((entry) => entry.id === wanted)) {\n    return { model: wanted, auto: false, declined: null }\n  }\n  const restricted = Boolean(bounds.orgModels?.length) || Boolean(bounds.allotmentModels)\n  let model = route.model\n  if (restricted) {\n    const allowed = AI_MODEL_CATALOG.filter(\n      (entry) => entry.provider === route.provider.id && onLists(entry, bounds),\n    )\n    if (allowed.length && !allowed.some((entry) => entry.id === model)) {\n      const tier = aiCatalogEntry(model)?.tier ?? AI_STEP_TIERS[kind]\n      const sameTier = allowed.find((entry) => entry.tier === tier)\n      const cheapest = [...allowed].sort((a, b) => blendedRate(a.id) - blendedRate(b.id))[0]\n      model = (sameTier ?? cheapest).id\n    }\n  }\n  return { model, auto: true, declined: wanted }\n}\n\n/** The median exchange over measured samples, or `null` below the minimum. */\nexport function aiMedianUsage(samples: readonly AiUsage[]): AiUsage | null {\n  if (samples.length < AI_MEASURED_MEDIAN_MIN_SAMPLES) return null\n  const median = (field: keyof AiUsage): number => {\n    const values = samples\n      .map((sample) => Number(sample[field] ?? 0))\n      .filter((value) => Number.isFinite(value) && value >= 0)\n      .sort((a, b) => a - b)\n    if (!values.length) return 0\n    const middle = Math.floor(values.length / 2)\n    return values.length % 2\n      ? values[middle]\n      : Math.round((values[middle - 1] + values[middle]) / 2)\n  }\n  return {\n    inputTokens: median('inputTokens'),\n    outputTokens: median('outputTokens'),\n    cacheReadTokens: median('cacheReadTokens'),\n    cacheWriteTokens: median('cacheWriteTokens'),\n  }\n}\n\nexport interface AiModelOption {\n  /** A catalog id, or `AI_MODEL_AUTO`. */\n  id: string\n  label: string\n  tier: AiCatalogEntry['tier']\n  /** Credits a typical request of this kind costs on the option. */\n  creditsPerRequest: number\n  /** That cost as a multiple of Auto's, to one decimal. */\n  multiplier: number\n}\n\nexport interface AiModelOptions {\n  /** Auto, labeled with the model it routes this kind to under these bounds. */\n  auto: AiModelOption & { model: string }\n  /** The manual picks, cheapest first; empty where the plan offers none. */\n  options: AiModelOption[]\n  /** Whether the price came from the workspace's own measured exchanges. */\n  measured: boolean\n}\n\n/** What the selector lists for one step kind, or `null` without a provider. */\nexport function aiModelOptions(\n  kind: AiStepKind,\n  bounds: AiModelBounds,\n  measured: AiUsage | null,\n  settings?: AiPluginSettings,\n): AiModelOptions | null {\n  const route = resolveAiRoute(kind, settings)\n  const auto = resolveAiModelChoice(kind, null, bounds, settings)\n  if (!route || !auto) return null\n  const typical = measured ?? AI_STEP_NOMINAL_USAGE[kind]\n  // Billed rates throughout (AGL-3015): every figure below is what the\n  // workspace will be charged for picking this model — credits per request\n  // and the multiple of Auto those credits come to. Our own cost for the\n  // same request is not this selector's subject and would misstate both.\n  const autoCost = estimateAiBilledUsd(typical, auto.model)\n  const priced = (entry: AiCatalogEntry): AiModelOption => {\n    const cost = estimateAiBilledUsd(typical, entry.id)\n    return {\n      id: entry.id,\n      label: entry.label,\n      tier: entry.tier,\n      creditsPerRequest: assistCreditsFromUsd(cost),\n      multiplier: autoCost > 0 ? Math.round((cost / autoCost) * 10) / 10 : 1,\n    }\n  }\n  const autoEntry = aiCatalogEntry(auto.model)\n  return {\n    auto: {\n      id: AI_MODEL_AUTO,\n      label: autoEntry ? `Auto (${autoEntry.label})` : 'Auto',\n      tier: autoEntry?.tier ?? AI_STEP_TIERS[kind],\n      creditsPerRequest: assistCreditsFromUsd(autoCost),\n      multiplier: 1,\n      model: auto.model,\n    },\n    options: aiModelsSelectable(route.provider.id, bounds)\n      .map(priced)\n      .sort((a, b) => a.creditsPerRequest - b.creditsPerRequest || a.label.localeCompare(b.label)),\n    measured: measured !== null,\n  }\n}\n"],"names":["assistCreditsFromUsd","AI_MODEL_CATALOG","AI_STEP_TIERS","aiCatalogEntry","aiBilledRatesForModel","estimateAiBilledUsd","resolveAiRoute","AI_MODEL_AUTO","AI_PLAN_MODEL_TIERS","free","starter","pro","business","scale","advanced","agency","enterprise","AI_MODEL_RESTRICTION_PLANS","AI_STEP_NOMINAL_USAGE","inputTokens","outputTokens","cacheReadTokens","cacheWriteTokens","AI_MEASURED_MEDIAN_MIN_SAMPLES","onLists","entry","bounds","orgModels","length","includes","id","allotmentModels","aiModelsSelectable","providerId","tiers","plan","filter","provider","tier","blendedRate","rates","inputPerToken","outputPerToken","resolveAiModelChoice","kind","requested","settings","route","wanted","trim","some","model","auto","declined","restricted","Boolean","allowed","sameTier","find","cheapest","sort","a","b","aiMedianUsage","samples","median","field","values","map","sample","Number","value","isFinite","middle","Math","floor","round","aiModelOptions","measured","typical","autoCost","priced","cost","label","creditsPerRequest","multiplier","autoEntry","options","localeCompare"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,oBAAoB,QAAQ,6BAAyB;AAE9D,SACEC,gBAAgB,EAChBC,aAAa,EACbC,cAAc,EACdC,qBAAqB,EACrBC,mBAAmB,QAGd,eAAW;AAElB,SAASC,cAAc,QAA+B,eAAW;AAEjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+BC,GAED,+DAA+D,GAC/D,OAAO,MAAMC,gBAAgB,OAAM;AAEnC;;;;;;CAMC,GACD,OAAO,MAAMC,sBAA0E;IACrFC,MAAM,EAAE;IACRC,SAAS;QAAC;QAAQ;KAAW;IAC7BC,KAAK;QAAC;QAAQ;KAAW;IACzBC,UAAU;QAAC;QAAQ;KAAW;IAC9BC,OAAO;QAAC;QAAQ;QAAY;KAAO;IACnCC,UAAU;QAAC;QAAQ;QAAY;KAAO;IACtCC,QAAQ;QAAC;QAAQ;QAAY;KAAO;IACpCC,YAAY;QAAC;QAAQ;QAAY;KAAO;AAC1C,EAAC;AAED,gEAAgE,GAChE,OAAO,MAAMC,6BAAiD;IAAC;IAAU;CAAa,CAAA;AAEtF;;;;;CAKC,GACD,OAAO,MAAMC,wBAAqD;IAChE,eAAe;QAAEC,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAClG,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC/F,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAGC,kBAAkB;IAAE;IACjG,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC9F,oBAAoB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAGC,kBAAkB;IAAE;IACrG,0EAA0E;IAC1E,0EAA0E;IAC1E,0EAA0E;IAC1E,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC3F,wEAAwE;IACxE,6EAA6E;IAC7E,6EAA6E;IAC7E,6BAA6B;IAC7B,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAChG,2EAA2E;IAC3E,8EAA8E;IAC9E,8EAA8E;IAC9E,6BAA6B;IAC7B,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAC/F,oEAAoE;IACpE,2EAA2E;IAC3E,8EAA8E;IAC9E,4EAA4E;IAC5E,6EAA6E;IAC7E,iBAAiB;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IACpG,0EAA0E;IAC1E,sEAAsE;IACtE,2EAA2E;IAC3E,wEAAwE;IACxE,oEAAoE;IACpE,yEAAyE;IACzE,gEAAgE;IAChE,WAAW;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC5F,sEAAsE;IACtE,sEAAsE;IACtE,qEAAqE;IACrE,wEAAwE;IACxE,cAAc;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACnG,gBAAgB;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,0EAA0E;IAC1E,yEAAyE;IACzE,4EAA4E;IAC5E,0EAA0E;IAC1E,yEAAyE;IACzE,wDAAwD;IACxD,uEAAuE;IACvE,4EAA4E;IAC5E,0EAA0E;IAC1E,0EAA0E;IAC1E,0DAA0D;IAC1D,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACjG,sEAAsE;IACtE,8EAA8E;IAC9E,0EAA0E;IAC1E,oEAAoE;IACpE,2EAA2E;IAC3E,+DAA+D;IAC/D,gBAAgB;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,4EAA4E;IAC5E,4EAA4E;IAC5E,yEAAyE;IACzE,wEAAwE;IACxE,2EAA2E;IAC3E,yEAAyE;IACzE,4EAA4E;IAC5E,0EAA0E;IAC1E,0EAA0E;IAC1E,2EAA2E;IAC3E,0BAA0B;IAC1B,WAAW;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC5F,wEAAwE;IACxE,yEAAyE;IACzE,uEAAuE;IACvE,2EAA2E;IAC3E,mEAAmE;IACnE,kBAAkB;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IACjG,yEAAyE;IACzE,8EAA8E;IAC9E,4EAA4E;IAC5E,gDAAgD;IAChD,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAC/F,2EAA2E;IAC3E,0EAA0E;IAC1E,0EAA0E;IAC1E,yEAAyE;IACzE,sEAAsE;IACtE,0DAA0D;IAC1D,eAAe;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAChG,wEAAwE;IACxE,sEAAsE;IACtE,0EAA0E;IAC1E,uEAAuE;IACvE,0DAA0D;IAC1D,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IAClG,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,qEAAqE;IACrE,2EAA2E;IAC3E,yEAAyE;IACzE,4EAA4E;IAC5E,yEAAyE;IACzE,8DAA8D;IAC9D,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,0EAA0E;IAC1E,uEAAuE;IACvE,2EAA2E;IAC3E,yEAAyE;IACzE,2DAA2D;IAC3D,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAChG,2EAA2E;IAC3E,0EAA0E;IAC1E,wEAAwE;IACxE,wEAAwE;IACxE,2EAA2E;IAC3E,gEAAgE;IAChE,YAAY;QAAEH,aAAa;QAAOC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;AACrG,EAAC;AAED,0DAA0D,GAC1D,OAAO,MAAMC,iCAAiC,EAAC;AAU/C,SAASC,QAAQC,KAAqB,EAAEC,MAAqB;QACvDA;IAAJ,IAAIA,EAAAA,oBAAAA,OAAOC,SAAS,qBAAhBD,kBAAkBE,MAAM,KAAI,CAACF,OAAOC,SAAS,CAACE,QAAQ,CAACJ,MAAMK,EAAE,GAAG,OAAO;IAC7E,IAAIJ,OAAOK,eAAe,IAAI,CAACL,OAAOK,eAAe,CAACF,QAAQ,CAACJ,MAAMK,EAAE,GAAG,OAAO;IACjF,OAAO;AACT;AAEA,gFAAgF,GAChF,OAAO,SAASE,mBACdC,UAAkB,EAClBP,MAAqB;QAEPlB;IAAd,MAAM0B,SAAQ1B,mCAAAA,mBAAmB,CAACkB,OAAOS,IAAI,CAAC,YAAhC3B,mCAAoC,EAAE;IACpD,OAAOP,iBAAiBmC,MAAM,CAC5B,CAACX,QACCA,MAAMY,QAAQ,KAAKJ,cAAcC,MAAML,QAAQ,CAACJ,MAAMa,IAAI,KAAKd,QAAQC,OAAOC;AAEpF;AAEA;;;;;;;;;CASC,GACD,MAAMa,cAAc,CAACT;IACnB,MAAMU,QAAQpC,sBAAsB0B;IACpC,OAAOU,MAAMC,aAAa,GAAGD,MAAME,cAAc;AACnD;AAWA;;;CAGC,GACD,OAAO,SAASC,qBACdC,IAAgB,EAChBC,SAAkB,EAClBnB,MAAqB,EACrBoB,QAA2B;QAWApB;IAT3B,MAAMqB,QAAQzC,eAAesC,MAAME;IACnC,IAAI,CAACC,OAAO,OAAO;IACnB,MAAMC,SACJ,OAAOH,cAAc,YAAYA,UAAUI,IAAI,MAAMJ,UAAUI,IAAI,OAAO1C,gBACtEsC,UAAUI,IAAI,KACd;IACN,IAAID,UAAUhB,mBAAmBe,MAAMV,QAAQ,CAACP,EAAE,EAAEJ,QAAQwB,IAAI,CAAC,CAACzB,QAAUA,MAAMK,EAAE,KAAKkB,SAAS;QAChG,OAAO;YAAEG,OAAOH;YAAQI,MAAM;YAAOC,UAAU;QAAK;IACtD;IACA,MAAMC,aAAaC,SAAQ7B,oBAAAA,OAAOC,SAAS,qBAAhBD,kBAAkBE,MAAM,KAAK2B,QAAQ7B,OAAOK,eAAe;IACtF,IAAIoB,QAAQJ,MAAMI,KAAK;IACvB,IAAIG,YAAY;QACd,MAAME,UAAUvD,iBAAiBmC,MAAM,CACrC,CAACX,QAAUA,MAAMY,QAAQ,KAAKU,MAAMV,QAAQ,CAACP,EAAE,IAAIN,QAAQC,OAAOC;QAEpE,IAAI8B,QAAQ5B,MAAM,IAAI,CAAC4B,QAAQN,IAAI,CAAC,CAACzB,QAAUA,MAAMK,EAAE,KAAKqB,QAAQ;;gBACrDhD;YAAb,MAAMmC,gBAAOnC,kBAAAA,eAAegD,2BAAfhD,gBAAuBmC,IAAI,mBAAIpC,aAAa,CAAC0C,KAAK;YAC/D,MAAMa,WAAWD,QAAQE,IAAI,CAAC,CAACjC,QAAUA,MAAMa,IAAI,KAAKA;YACxD,MAAMqB,WAAW;mBAAIH;aAAQ,CAACI,IAAI,CAAC,CAACC,GAAGC,IAAMvB,YAAYsB,EAAE/B,EAAE,IAAIS,YAAYuB,EAAEhC,EAAE,EAAE,CAAC,EAAE;YACtFqB,QAAQ,CAACM,mBAAAA,WAAYE,UAAU7B,EAAE;QACnC;IACF;IACA,OAAO;QAAEqB;QAAOC,MAAM;QAAMC,UAAUL;IAAO;AAC/C;AAEA,4EAA4E,GAC5E,OAAO,SAASe,cAAcC,OAA2B;IACvD,IAAIA,QAAQpC,MAAM,GAAGL,gCAAgC,OAAO;IAC5D,MAAM0C,SAAS,CAACC;QACd,MAAMC,SAASH,QACZI,GAAG,CAAC,CAACC;gBAAkBA;mBAAPC,QAAOD,gBAAAA,MAAM,CAACH,MAAM,YAAbG,gBAAiB;WACxCjC,MAAM,CAAC,CAACmC,QAAUD,OAAOE,QAAQ,CAACD,UAAUA,SAAS,GACrDX,IAAI,CAAC,CAACC,GAAGC,IAAMD,IAAIC;QACtB,IAAI,CAACK,OAAOvC,MAAM,EAAE,OAAO;QAC3B,MAAM6C,SAASC,KAAKC,KAAK,CAACR,OAAOvC,MAAM,GAAG;QAC1C,OAAOuC,OAAOvC,MAAM,GAAG,IACnBuC,MAAM,CAACM,OAAO,GACdC,KAAKE,KAAK,CAAC,AAACT,CAAAA,MAAM,CAACM,SAAS,EAAE,GAAGN,MAAM,CAACM,OAAO,AAAD,IAAK;IACzD;IACA,OAAO;QACLtD,aAAa8C,OAAO;QACpB7C,cAAc6C,OAAO;QACrB5C,iBAAiB4C,OAAO;QACxB3C,kBAAkB2C,OAAO;IAC3B;AACF;AAsBA,6EAA6E,GAC7E,OAAO,SAASY,eACdjC,IAAgB,EAChBlB,MAAqB,EACrBoD,QAAwB,EACxBhC,QAA2B;;IAE3B,MAAMC,QAAQzC,eAAesC,MAAME;IACnC,MAAMM,OAAOT,qBAAqBC,MAAM,MAAMlB,QAAQoB;IACtD,IAAI,CAACC,SAAS,CAACK,MAAM,OAAO;IAC5B,MAAM2B,UAAUD,mBAAAA,WAAY5D,qBAAqB,CAAC0B,KAAK;IACvD,qEAAqE;IACrE,yEAAyE;IACzE,uEAAuE;IACvE,uEAAuE;IACvE,MAAMoC,WAAW3E,oBAAoB0E,SAAS3B,KAAKD,KAAK;IACxD,MAAM8B,SAAS,CAACxD;QACd,MAAMyD,OAAO7E,oBAAoB0E,SAAStD,MAAMK,EAAE;QAClD,OAAO;YACLA,IAAIL,MAAMK,EAAE;YACZqD,OAAO1D,MAAM0D,KAAK;YAClB7C,MAAMb,MAAMa,IAAI;YAChB8C,mBAAmBpF,qBAAqBkF;YACxCG,YAAYL,WAAW,IAAIN,KAAKE,KAAK,CAAC,AAACM,OAAOF,WAAY,MAAM,KAAK;QACvE;IACF;IACA,MAAMM,YAAYnF,eAAeiD,KAAKD,KAAK;IAC3C,OAAO;QACLC,MAAM;YACJtB,IAAIvB;YACJ4E,OAAOG,YAAY,CAAC,MAAM,EAAEA,UAAUH,KAAK,CAAC,CAAC,CAAC,GAAG;YACjD7C,IAAI,UAAEgD,6BAAAA,UAAWhD,IAAI,mBAAIpC,aAAa,CAAC0C,KAAK;YAC5CwC,mBAAmBpF,qBAAqBgF;YACxCK,YAAY;YACZlC,OAAOC,KAAKD,KAAK;QACnB;QACAoC,SAASvD,mBAAmBe,MAAMV,QAAQ,CAACP,EAAE,EAAEJ,QAC5C0C,GAAG,CAACa,QACJrB,IAAI,CAAC,CAACC,GAAGC,IAAMD,EAAEuB,iBAAiB,GAAGtB,EAAEsB,iBAAiB,IAAIvB,EAAEsB,KAAK,CAACK,aAAa,CAAC1B,EAAEqB,KAAK;QAC5FL,UAAUA,aAAa;IACzB;AACF"}
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/providers/model-choice.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assistCreditsFromUsd } from '../usage/assist-credits'\nimport type { OrgPlan } from '@aglyn/aglyn/foundation/definitions/org-billing.types'\nimport {\n  AI_MODEL_CATALOG,\n  AI_STEP_TIERS,\n  aiCatalogEntry,\n  aiBilledRatesForModel,\n  estimateAiBilledUsd,\n  type AiCatalogEntry,\n  type AiStepKind,\n} from './catalog'\nimport type { AiUsage } from './contract'\nimport { aiServingModelId, resolveAiRoute, type AiPluginSettings } from './routing'\n\n/**\n * THE MODEL SWITCH (AGL-2942): what a person may pick, what \"Auto\" means,\n * and what a pick costs.\n *\n * ## Auto is the routing table\n *\n * A request that names no model — or names one it may not have — runs on\n * `resolveAiRoute(kind)`, the table that maps a step kind to a catalog model\n * (AGL-2937). Picking a model is an override of that one row for one request,\n * never a second table.\n *\n * ## Three bounds, one intersection\n *\n * A manual pick must be served by the active provider, in a tier the org's\n * plan offers (`AI_PLAN_MODEL_TIERS`), on the org's own restriction when it\n * set one, and on the allotment allowlists that apply to the request. The\n * two allowlists bound Auto too: when the routing table's answer is not on\n * them, Auto runs on the allowed model of the same tier, else the cheapest\n * allowed one. The plan bounds only a pick — Auto is the platform's choice,\n * made for the step, and a plan never makes it worse.\n *\n * An allowlist that leaves nothing this deployment serves is not a way to\n * switch AI off by mistake: the choice falls back to the routing table, and\n * the permission keys are how AI is switched off on purpose.\n *\n * ## The price beside each option\n *\n * Credits per typical request at each model's list rates, over the step's\n * measured median exchange when the workspace has enough of them, and over\n * `AI_STEP_NOMINAL_USAGE` until it does — with the multiple of what Auto\n * would cost for the same request. Every figure is credits, never dollars.\n */\n\n/** The value a request sends for \"let the platform route it\". */\nexport const AI_MODEL_AUTO = 'auto'\n\n/**\n * The catalog tiers a MANUAL pick may name, per plan. Free runs on Auto only:\n * its taste is a wall, and a pick there would spend the account's credits at\n * a rate nobody chose on purpose. The dearest tier opens from Scale up, where\n * the band is large enough that a slower, deeper model is a real choice\n * rather than a fast way to end the month.\n */\nexport const AI_PLAN_MODEL_TIERS: Record<OrgPlan, readonly AiCatalogEntry['tier'][]> = {\n  free: [],\n  starter: ['fast', 'balanced'],\n  pro: ['fast', 'balanced'],\n  business: ['fast', 'balanced'],\n  scale: ['fast', 'balanced', 'deep'],\n  advanced: ['fast', 'balanced', 'deep'],\n  agency: ['fast', 'balanced', 'deep'],\n  enterprise: ['fast', 'balanced', 'deep'],\n}\n\n/** The plans whose admins may restrict the model set org-wide. */\nexport const AI_MODEL_RESTRICTION_PLANS: readonly OrgPlan[] = ['agency', 'enterprise']\n\n/**\n * A typical exchange per step kind, before a workspace has measured one: the\n * doors' own prompt sizes and output ceilings, read conservatively. Replaced\n * by the workspace's measured median as soon as `aiMedianUsage` has enough\n * samples, and only ever used for the price beside an option.\n */\nexport const AI_STEP_NOMINAL_USAGE: Record<AiStepKind, AiUsage> = {\n  'assist.chat': { inputTokens: 900, outputTokens: 450, cacheReadTokens: 1_050, cacheWriteTokens: 0 },\n  // One element's rewrite on the fast tier, counted as Claude Haiku 5.5 counts\n  // it: about 30% more tokens than Haiku 4.5 for the same text (AGL-3781).\n  'copy.element': { inputTokens: 455, outputTokens: 156, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  'copy.section': { inputTokens: 700, outputTokens: 1_400, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  'copy.blog': { inputTokens: 600, outputTokens: 1_100, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  'generate.section': { inputTokens: 700, outputTokens: 1_400, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The text step's rules are about 500 characters — far under the balanced\n  // tier's cacheable minimum, so they are billed as input every time rather\n  // than read from a cache (`runtime/ai-prompt-cache.spec.ts` measures it).\n  'job.text': { inputTokens: 450, outputTokens: 500, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The theme step: the tool's schema and both system blocks (about 7,500\n  // characters) are the cached prefix, the site's inventory and the brief ride\n  // uncached, and a full-palette answer is about 1,300 characters of JSON with\n  // as much again to think in.\n  'job.theme': { inputTokens: 500, outputTokens: 850, cacheReadTokens: 2_500, cacheWriteTokens: 0 },\n  // The plan step: the tool's schema, the doctrine and the plan instructions\n  // (about 10,000 characters) are the cached prefix, the site inventory and the\n  // brief ride uncached, and a plan answer is about 600 characters of JSON with\n  // as much again to think in.\n  'job.plan': { inputTokens: 500, outputTokens: 400, cacheReadTokens: 3_600, cacheWriteTokens: 0 },\n  // The component step: the doctrine, the component instructions, the\n  // component surface's catalog and the tool are the cached prefix, the site\n  // inventory, the brief and the confirmed plan ride uncached, and a card-sized\n  // answer — its tree and declared props as JSON — is about 1,700 characters.\n  // The component step's spec measures the prefix and the answer against this.\n  'job.component': { inputTokens: 700, outputTokens: 600, cacheReadTokens: 5_800, cacheWriteTokens: 0 },\n  // The CRM step's exchange (AGL-2917), counted as the fast tier's Claude\n  // Haiku 5.5 counts it, about 30% more tokens than Haiku 4.5 (AGL-3781). The\n  // doctrine's field rules, the CRM rules and the tool come to 650 to 913\n  // tokens, as `runtime/ai-prompt-cache.spec.ts` measures them, which caches on\n  // that model; one question about a record writes it, so it is counted as\n  // input. A record's facts ride with them, a timeline cut to its newest twelve\n  // entries, and the typical answer is a summary and a next step of a few\n  // sentences, with no thinking.\n  'job.crm': { inputTokens: 2_340, outputTokens: 325, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // A layout: a tree layout's 1,000 output tokens until AGL-3660, now a\n  // site's header and footer in the layout language — 442 to 583 output\n  // tokens live on 2026-10-07 — with up to 1,500 more for the adaptive\n  // thinking it is asked with, an estimate until a workspace measures it.\n  'job.layout': { inputTokens: 700, outputTokens: 2_000, cacheReadTokens: 5_600, cacheWriteTokens: 0 },\n  'job.template': { inputTokens: 1_200, outputTokens: 700, cacheReadTokens: 6_400, cacheWriteTokens: 0 },\n  // One page section's exchange (AGL-2907), from the modules' own text: the\n  // doctrine (6,281 characters), the page instructions (1,524), the screen\n  // palette catalog (8,353) and the section tool (484) are the cached prefix;\n  // the site inventory (711 on the median golden site), the brief, the plan\n  // and the section line ride uncached; and a golden section answer is 901\n  // characters at the median, asked for with no thinking.\n  // Since AGL-3660 a site's and a build's pages are one answer a page in\n  // the layout language: 683 to 1,745 output tokens live on 2026-10-07, about\n  // 1,150 at the median, with up to 1,500 more for the adaptive thinking it\n  // is asked with — an estimate until a workspace measures it, read high so\n  // the quote beside a model never undersells the exchange.\n  'job.page': { inputTokens: 600, outputTokens: 2_650, cacheReadTokens: 4_400, cacheWriteTokens: 0 },\n  // One product's copy (AGL-2916), the exchange a bulk job makes once a\n  // product: the doctrine, the copy rules and the tool (about 9,500 characters)\n  // are the cached prefix; the product's facts, the site's categories and a\n  // photo at most 768 pixels on its long edge (about 790 tokens) ride\n  // uncached; and the answer is a description with its search listing, tags,\n  // categories and option names, about 1,300 characters of JSON.\n  'job.products': { inputTokens: 1_500, outputTokens: 450, cacheReadTokens: 2_400, cacheWriteTokens: 0 },\n  // The SEO step's listing exchange, which a page's or a product's listing is\n  // exactly one of: the median of 146 production listings of October 8–14\n  // (2,255 input and 213 output tokens on Claude Haiku 4.5), counted as the\n  // fast tier's Claude Haiku 5.5 counts them, about 30% more (AGL-3781). The\n  // doctrine's block in its field scope, the listing rules and the tool's\n  // schema are its prefix, which caches on that model and which a site's next\n  // listing reads; a lone listing writes it, so it is counted as input. The\n  // page text, capped at 2,000 characters, rides with the current listing and a\n  // dozen other titles. The largest answer the tool accepts is about 600\n  // characters of JSON, and the request asks for no thinking. An audit pass is\n  // heavier: eight pages' findings and text, about 9,000 characters, with up to\n  // about 8,000 back.\n  'job.seo': { inputTokens: 2_930, outputTokens: 277, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The experiment step (AGL-2914). NOTHING is cached: the A/B test rules\n  // and the acceptable-use block come to about 2,300 characters, under the\n  // balanced tier's cacheable minimum, so they are billed as input every\n  // time. The copy under test, or a test's arms with its verdict, rides with\n  // them, and a four-variant answer is about 800 characters of JSON.\n  'job.experiment': { inputTokens: 900, outputTokens: 300, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The form step: the doctrine, the form instructions, the form surface's\n  // catalog (about 150 tokens) and the tool's schema are the cached prefix, the\n  // site inventory and the brief ride uncached, and a form's answer is 200 to\n  // 400 tokens of JSON with no extended thinking.\n  'job.form': { inputTokens: 700, outputTokens: 450, cacheReadTokens: 3_900, cacheWriteTokens: 0 },\n  // An insight (AGL-2915): two exchanges, and NOTHING cached — the rules and\n  // the acceptable-use block are under the balanced tier's minimum, so they\n  // are billed as input on both. The read call carries the question and the\n  // readers' catalog (about 2,000 characters) and answers a few reads; the\n  // answer call carries four tables of about ten rows each (about 4,000\n  // characters) and answers three to five insights as JSON.\n  'job.insight': { inputTokens: 2_800, outputTokens: 650, cacheReadTokens: 0, cacheWriteTokens: 0 },\n  // The email step, and the campaign step that shares its generation: the\n  // doctrine, the email instructions, the email palette catalog and the\n  // tool's schema (about 10,300 characters) are the cached prefix, the site\n  // inventory and the brief ride uncached, and the answer is one email's\n  // node map with three subject lines and three preheaders.\n  'job.email': { inputTokens: 600, outputTokens: 1_500, cacheReadTokens: 3_600, cacheWriteTokens: 0 },\n  'job.campaign': { inputTokens: 600, outputTokens: 1_500, cacheReadTokens: 3_600, cacheWriteTokens: 0 },\n  // The workflow step's draft (AGL-2919): the doctrine, the automation\n  // vocabulary and the tool's schema are the cached prefix (4,564 tokens, as\n  // `runtime/ai-prompt-cache.spec.ts` measures it); what the workspace can\n  // run, the site's forms and datasets and the description ride uncached; and\n  // an automation of a few steps is about 1,300 characters of JSON with as\n  // much again to think in. An explanation caches half as much.\n  'job.workflow': { inputTokens: 500, outputTokens: 1_000, cacheReadTokens: 4_500, cacheWriteTokens: 0 },\n  // The logic step (AGL-3603): the fields doctrine, one rules block and the\n  // tool's schema are the cached prefix (1,556 tokens for a function, as\n  // `runtime/ai-prompt-cache.spec.ts` measures it); the site's variables and\n  // the request ride uncached, and a function of a few operations is about\n  // 1,200 characters of JSON with as much again to think in.\n  'job.logic': { inputTokens: 700, outputTokens: 900, cacheReadTokens: 1_500, cacheWriteTokens: 0 },\n  // The edit step (AGL-3616): the document doctrine, the job's rules and the\n  // edit rung's protocol and catalog for the document's kind are the cached\n  // prefix (5,970 tokens for a page, as `runtime/ai-prompt-cache.spec.ts`\n  // measures it); the outline of up to sixty elements with their settings\n  // and the request ride uncached, and a change of a few operations is about\n  // 1,500 characters of tool call with as much again to think in.\n  'job.edit': { inputTokens: 2_500, outputTokens: 1_000, cacheReadTokens: 6_000, cacheWriteTokens: 0 },\n}\n\n/** The fewest measured exchanges a median is taken over. */\nexport const AI_MEASURED_MEDIAN_MIN_SAMPLES = 3\n\nexport interface AiModelBounds {\n  plan: OrgPlan\n  /** The allotment allowlists that apply, intersected; `null` for none. */\n  allotmentModels?: readonly string[] | null\n  /** The org-wide restriction; `null` for none. */\n  orgModels?: readonly string[] | null\n}\n\n/** Whether a list names a model, a retired id on it naming its successor (AGL-3781). */\nfunction names(list: readonly string[], id: string): boolean {\n  return list.some((listed) => aiServingModelId(listed) === id)\n}\n\nfunction onLists(entry: AiCatalogEntry, bounds: AiModelBounds): boolean {\n  if (bounds.orgModels?.length && !names(bounds.orgModels, entry.id)) return false\n  if (bounds.allotmentModels && !names(bounds.allotmentModels, entry.id)) return false\n  return true\n}\n\n/** The current catalog models a manual pick may name on a provider under these bounds. */\nexport function aiModelsSelectable(\n  providerId: string,\n  bounds: AiModelBounds,\n): AiCatalogEntry[] {\n  const tiers = AI_PLAN_MODEL_TIERS[bounds.plan] ?? []\n  return AI_MODEL_CATALOG.filter(\n    (entry) =>\n      entry.provider === providerId &&\n      !entry.successor &&\n      tiers.includes(entry.tier) &&\n      onLists(entry, bounds),\n  )\n}\n\n/**\n * A model's blended BILLED rate, for \"the cheapest allowed\" and nothing\n * else.\n *\n * Billed and not provider (AGL-3015): the substitution below happens when a\n * workspace asked for a model its bounds do not allow, and the party it\n * falls back for is the one whose credits are drawn. \"Cheapest\" has to mean\n * the same thing here as in the selector this substitution stands in for,\n * which sorts on `creditsPerRequest`.\n */\nconst blendedRate = (id: string): number => {\n  const rates = aiBilledRatesForModel(id)\n  return rates.inputPerToken + rates.outputPerToken\n}\n\nexport interface AiModelChoice {\n  /** The catalog id the request runs, and is metered, on. */\n  model: string\n  /** True when the routing table decided: Auto, or a pick that was declined. */\n  auto: boolean\n  /** A pick that was asked for and is not allowed, for the envelope. */\n  declined: string | null\n}\n\n/**\n * The model one request runs on, or `null` when no provider is registered —\n * which every door has refused before it asks.\n */\nexport function resolveAiModelChoice(\n  kind: AiStepKind,\n  requested: unknown,\n  bounds: AiModelBounds,\n  settings?: AiPluginSettings,\n): AiModelChoice | null {\n  const route = resolveAiRoute(kind, settings)\n  if (!route) return null\n  // A pick of a retired model, from a job made before it retired, is a pick\n  // of the model that serves in its place.\n  const wanted =\n    typeof requested === 'string' && requested.trim() && requested.trim() !== AI_MODEL_AUTO\n      ? aiServingModelId(requested.trim())\n      : null\n  if (wanted && aiModelsSelectable(route.provider.id, bounds).some((entry) => entry.id === wanted)) {\n    return { model: wanted, auto: false, declined: null }\n  }\n  const restricted = Boolean(bounds.orgModels?.length) || Boolean(bounds.allotmentModels)\n  let model = route.model\n  if (restricted) {\n    const allowed = AI_MODEL_CATALOG.filter(\n      (entry) => entry.provider === route.provider.id && !entry.successor && onLists(entry, bounds),\n    )\n    if (allowed.length && !allowed.some((entry) => entry.id === model)) {\n      const tier = aiCatalogEntry(model)?.tier ?? AI_STEP_TIERS[kind]\n      const sameTier = allowed.find((entry) => entry.tier === tier)\n      const cheapest = [...allowed].sort((a, b) => blendedRate(a.id) - blendedRate(b.id))[0]\n      model = (sameTier ?? cheapest).id\n    }\n  }\n  return { model, auto: true, declined: wanted }\n}\n\n/** The median exchange over measured samples, or `null` below the minimum. */\nexport function aiMedianUsage(samples: readonly AiUsage[]): AiUsage | null {\n  if (samples.length < AI_MEASURED_MEDIAN_MIN_SAMPLES) return null\n  const median = (field: keyof AiUsage): number => {\n    const values = samples\n      .map((sample) => Number(sample[field] ?? 0))\n      .filter((value) => Number.isFinite(value) && value >= 0)\n      .sort((a, b) => a - b)\n    if (!values.length) return 0\n    const middle = Math.floor(values.length / 2)\n    return values.length % 2\n      ? values[middle]\n      : Math.round((values[middle - 1] + values[middle]) / 2)\n  }\n  return {\n    inputTokens: median('inputTokens'),\n    outputTokens: median('outputTokens'),\n    cacheReadTokens: median('cacheReadTokens'),\n    cacheWriteTokens: median('cacheWriteTokens'),\n  }\n}\n\nexport interface AiModelOption {\n  /** A catalog id, or `AI_MODEL_AUTO`. */\n  id: string\n  label: string\n  tier: AiCatalogEntry['tier']\n  /** Credits a typical request of this kind costs on the option. */\n  creditsPerRequest: number\n  /** That cost as a multiple of Auto's, to one decimal. */\n  multiplier: number\n}\n\nexport interface AiModelOptions {\n  /** Auto, labeled with the model it routes this kind to under these bounds. */\n  auto: AiModelOption & { model: string }\n  /** The manual picks, cheapest first; empty where the plan offers none. */\n  options: AiModelOption[]\n  /** Whether the price came from the workspace's own measured exchanges. */\n  measured: boolean\n}\n\n/** What the selector lists for one step kind, or `null` without a provider. */\nexport function aiModelOptions(\n  kind: AiStepKind,\n  bounds: AiModelBounds,\n  measured: AiUsage | null,\n  settings?: AiPluginSettings,\n): AiModelOptions | null {\n  const route = resolveAiRoute(kind, settings)\n  const auto = resolveAiModelChoice(kind, null, bounds, settings)\n  if (!route || !auto) return null\n  const typical = measured ?? AI_STEP_NOMINAL_USAGE[kind]\n  // Billed rates throughout (AGL-3015): every figure below is what the\n  // workspace will be charged for picking this model — credits per request\n  // and the multiple of Auto those credits come to. Our own cost for the\n  // same request is not this selector's subject and would misstate both.\n  const autoCost = estimateAiBilledUsd(typical, auto.model)\n  const priced = (entry: AiCatalogEntry): AiModelOption => {\n    const cost = estimateAiBilledUsd(typical, entry.id)\n    return {\n      id: entry.id,\n      label: entry.label,\n      tier: entry.tier,\n      creditsPerRequest: assistCreditsFromUsd(cost),\n      multiplier: autoCost > 0 ? Math.round((cost / autoCost) * 10) / 10 : 1,\n    }\n  }\n  const autoEntry = aiCatalogEntry(auto.model)\n  return {\n    auto: {\n      id: AI_MODEL_AUTO,\n      label: autoEntry ? `Auto (${autoEntry.label})` : 'Auto',\n      tier: autoEntry?.tier ?? AI_STEP_TIERS[kind],\n      creditsPerRequest: assistCreditsFromUsd(autoCost),\n      multiplier: 1,\n      model: auto.model,\n    },\n    options: aiModelsSelectable(route.provider.id, bounds)\n      .map(priced)\n      .sort((a, b) => a.creditsPerRequest - b.creditsPerRequest || a.label.localeCompare(b.label)),\n    measured: measured !== null,\n  }\n}\n"],"names":["assistCreditsFromUsd","AI_MODEL_CATALOG","AI_STEP_TIERS","aiCatalogEntry","aiBilledRatesForModel","estimateAiBilledUsd","aiServingModelId","resolveAiRoute","AI_MODEL_AUTO","AI_PLAN_MODEL_TIERS","free","starter","pro","business","scale","advanced","agency","enterprise","AI_MODEL_RESTRICTION_PLANS","AI_STEP_NOMINAL_USAGE","inputTokens","outputTokens","cacheReadTokens","cacheWriteTokens","AI_MEASURED_MEDIAN_MIN_SAMPLES","names","list","id","some","listed","onLists","entry","bounds","orgModels","length","allotmentModels","aiModelsSelectable","providerId","tiers","plan","filter","provider","successor","includes","tier","blendedRate","rates","inputPerToken","outputPerToken","resolveAiModelChoice","kind","requested","settings","route","wanted","trim","model","auto","declined","restricted","Boolean","allowed","sameTier","find","cheapest","sort","a","b","aiMedianUsage","samples","median","field","values","map","sample","Number","value","isFinite","middle","Math","floor","round","aiModelOptions","measured","typical","autoCost","priced","cost","label","creditsPerRequest","multiplier","autoEntry","options","localeCompare"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,oBAAoB,QAAQ,6BAAyB;AAE9D,SACEC,gBAAgB,EAChBC,aAAa,EACbC,cAAc,EACdC,qBAAqB,EACrBC,mBAAmB,QAGd,eAAW;AAElB,SAASC,gBAAgB,EAAEC,cAAc,QAA+B,eAAW;AAEnF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+BC,GAED,+DAA+D,GAC/D,OAAO,MAAMC,gBAAgB,OAAM;AAEnC;;;;;;CAMC,GACD,OAAO,MAAMC,sBAA0E;IACrFC,MAAM,EAAE;IACRC,SAAS;QAAC;QAAQ;KAAW;IAC7BC,KAAK;QAAC;QAAQ;KAAW;IACzBC,UAAU;QAAC;QAAQ;KAAW;IAC9BC,OAAO;QAAC;QAAQ;QAAY;KAAO;IACnCC,UAAU;QAAC;QAAQ;QAAY;KAAO;IACtCC,QAAQ;QAAC;QAAQ;QAAY;KAAO;IACpCC,YAAY;QAAC;QAAQ;QAAY;KAAO;AAC1C,EAAC;AAED,gEAAgE,GAChE,OAAO,MAAMC,6BAAiD;IAAC;IAAU;CAAa,CAAA;AAEtF;;;;;CAKC,GACD,OAAO,MAAMC,wBAAqD;IAChE,eAAe;QAAEC,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAClG,6EAA6E;IAC7E,yEAAyE;IACzE,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC/F,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAGC,kBAAkB;IAAE;IACjG,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC9F,oBAAoB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAGC,kBAAkB;IAAE;IACrG,0EAA0E;IAC1E,0EAA0E;IAC1E,0EAA0E;IAC1E,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC3F,wEAAwE;IACxE,6EAA6E;IAC7E,6EAA6E;IAC7E,6BAA6B;IAC7B,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAChG,2EAA2E;IAC3E,8EAA8E;IAC9E,8EAA8E;IAC9E,6BAA6B;IAC7B,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAC/F,oEAAoE;IACpE,2EAA2E;IAC3E,8EAA8E;IAC9E,4EAA4E;IAC5E,6EAA6E;IAC7E,iBAAiB;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IACpG,wEAAwE;IACxE,4EAA4E;IAC5E,wEAAwE;IACxE,8EAA8E;IAC9E,yEAAyE;IACzE,8EAA8E;IAC9E,wEAAwE;IACxE,+BAA+B;IAC/B,WAAW;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC5F,sEAAsE;IACtE,sEAAsE;IACtE,qEAAqE;IACrE,wEAAwE;IACxE,cAAc;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACnG,gBAAgB;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,0EAA0E;IAC1E,yEAAyE;IACzE,4EAA4E;IAC5E,0EAA0E;IAC1E,yEAAyE;IACzE,wDAAwD;IACxD,uEAAuE;IACvE,4EAA4E;IAC5E,0EAA0E;IAC1E,0EAA0E;IAC1E,0DAA0D;IAC1D,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACjG,sEAAsE;IACtE,8EAA8E;IAC9E,0EAA0E;IAC1E,oEAAoE;IACpE,2EAA2E;IAC3E,+DAA+D;IAC/D,gBAAgB;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,4EAA4E;IAC5E,wEAAwE;IACxE,0EAA0E;IAC1E,2EAA2E;IAC3E,wEAAwE;IACxE,4EAA4E;IAC5E,0EAA0E;IAC1E,8EAA8E;IAC9E,uEAAuE;IACvE,6EAA6E;IAC7E,8EAA8E;IAC9E,oBAAoB;IACpB,WAAW;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAC5F,wEAAwE;IACxE,yEAAyE;IACzE,uEAAuE;IACvE,2EAA2E;IAC3E,mEAAmE;IACnE,kBAAkB;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IACjG,yEAAyE;IACzE,8EAA8E;IAC9E,4EAA4E;IAC5E,gDAAgD;IAChD,YAAY;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAC/F,2EAA2E;IAC3E,0EAA0E;IAC1E,0EAA0E;IAC1E,yEAAyE;IACzE,sEAAsE;IACtE,0DAA0D;IAC1D,eAAe;QAAEH,aAAa;QAAOC,cAAc;QAAKC,iBAAiB;QAAGC,kBAAkB;IAAE;IAChG,wEAAwE;IACxE,sEAAsE;IACtE,0EAA0E;IAC1E,uEAAuE;IACvE,0DAA0D;IAC1D,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IAClG,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,qEAAqE;IACrE,2EAA2E;IAC3E,yEAAyE;IACzE,4EAA4E;IAC5E,yEAAyE;IACzE,8DAA8D;IAC9D,gBAAgB;QAAEH,aAAa;QAAKC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;IACrG,0EAA0E;IAC1E,uEAAuE;IACvE,2EAA2E;IAC3E,yEAAyE;IACzE,2DAA2D;IAC3D,aAAa;QAAEH,aAAa;QAAKC,cAAc;QAAKC,iBAAiB;QAAOC,kBAAkB;IAAE;IAChG,2EAA2E;IAC3E,0EAA0E;IAC1E,wEAAwE;IACxE,wEAAwE;IACxE,2EAA2E;IAC3E,gEAAgE;IAChE,YAAY;QAAEH,aAAa;QAAOC,cAAc;QAAOC,iBAAiB;QAAOC,kBAAkB;IAAE;AACrG,EAAC;AAED,0DAA0D,GAC1D,OAAO,MAAMC,iCAAiC,EAAC;AAU/C,sFAAsF,GACtF,SAASC,MAAMC,IAAuB,EAAEC,EAAU;IAChD,OAAOD,KAAKE,IAAI,CAAC,CAACC,SAAWvB,iBAAiBuB,YAAYF;AAC5D;AAEA,SAASG,QAAQC,KAAqB,EAAEC,MAAqB;QACvDA;IAAJ,IAAIA,EAAAA,oBAAAA,OAAOC,SAAS,qBAAhBD,kBAAkBE,MAAM,KAAI,CAACT,MAAMO,OAAOC,SAAS,EAAEF,MAAMJ,EAAE,GAAG,OAAO;IAC3E,IAAIK,OAAOG,eAAe,IAAI,CAACV,MAAMO,OAAOG,eAAe,EAAEJ,MAAMJ,EAAE,GAAG,OAAO;IAC/E,OAAO;AACT;AAEA,wFAAwF,GACxF,OAAO,SAASS,mBACdC,UAAkB,EAClBL,MAAqB;QAEPvB;IAAd,MAAM6B,SAAQ7B,mCAAAA,mBAAmB,CAACuB,OAAOO,IAAI,CAAC,YAAhC9B,mCAAoC,EAAE;IACpD,OAAOR,iBAAiBuC,MAAM,CAC5B,CAACT,QACCA,MAAMU,QAAQ,KAAKJ,cACnB,CAACN,MAAMW,SAAS,IAChBJ,MAAMK,QAAQ,CAACZ,MAAMa,IAAI,KACzBd,QAAQC,OAAOC;AAErB;AAEA;;;;;;;;;CASC,GACD,MAAMa,cAAc,CAAClB;IACnB,MAAMmB,QAAQ1C,sBAAsBuB;IACpC,OAAOmB,MAAMC,aAAa,GAAGD,MAAME,cAAc;AACnD;AAWA;;;CAGC,GACD,OAAO,SAASC,qBACdC,IAAgB,EAChBC,SAAkB,EAClBnB,MAAqB,EACrBoB,QAA2B;QAaApB;IAX3B,MAAMqB,QAAQ9C,eAAe2C,MAAME;IACnC,IAAI,CAACC,OAAO,OAAO;IACnB,0EAA0E;IAC1E,yCAAyC;IACzC,MAAMC,SACJ,OAAOH,cAAc,YAAYA,UAAUI,IAAI,MAAMJ,UAAUI,IAAI,OAAO/C,gBACtEF,iBAAiB6C,UAAUI,IAAI,MAC/B;IACN,IAAID,UAAUlB,mBAAmBiB,MAAMZ,QAAQ,CAACd,EAAE,EAAEK,QAAQJ,IAAI,CAAC,CAACG,QAAUA,MAAMJ,EAAE,KAAK2B,SAAS;QAChG,OAAO;YAAEE,OAAOF;YAAQG,MAAM;YAAOC,UAAU;QAAK;IACtD;IACA,MAAMC,aAAaC,SAAQ5B,oBAAAA,OAAOC,SAAS,qBAAhBD,kBAAkBE,MAAM,KAAK0B,QAAQ5B,OAAOG,eAAe;IACtF,IAAIqB,QAAQH,MAAMG,KAAK;IACvB,IAAIG,YAAY;QACd,MAAME,UAAU5D,iBAAiBuC,MAAM,CACrC,CAACT,QAAUA,MAAMU,QAAQ,KAAKY,MAAMZ,QAAQ,CAACd,EAAE,IAAI,CAACI,MAAMW,SAAS,IAAIZ,QAAQC,OAAOC;QAExF,IAAI6B,QAAQ3B,MAAM,IAAI,CAAC2B,QAAQjC,IAAI,CAAC,CAACG,QAAUA,MAAMJ,EAAE,KAAK6B,QAAQ;;gBACrDrD;YAAb,MAAMyC,gBAAOzC,kBAAAA,eAAeqD,2BAAfrD,gBAAuByC,IAAI,mBAAI1C,aAAa,CAACgD,KAAK;YAC/D,MAAMY,WAAWD,QAAQE,IAAI,CAAC,CAAChC,QAAUA,MAAMa,IAAI,KAAKA;YACxD,MAAMoB,WAAW;mBAAIH;aAAQ,CAACI,IAAI,CAAC,CAACC,GAAGC,IAAMtB,YAAYqB,EAAEvC,EAAE,IAAIkB,YAAYsB,EAAExC,EAAE,EAAE,CAAC,EAAE;YACtF6B,QAAQ,CAACM,mBAAAA,WAAYE,UAAUrC,EAAE;QACnC;IACF;IACA,OAAO;QAAE6B;QAAOC,MAAM;QAAMC,UAAUJ;IAAO;AAC/C;AAEA,4EAA4E,GAC5E,OAAO,SAASc,cAAcC,OAA2B;IACvD,IAAIA,QAAQnC,MAAM,GAAGV,gCAAgC,OAAO;IAC5D,MAAM8C,SAAS,CAACC;QACd,MAAMC,SAASH,QACZI,GAAG,CAAC,CAACC;gBAAkBA;mBAAPC,QAAOD,gBAAAA,MAAM,CAACH,MAAM,YAAbG,gBAAiB;WACxClC,MAAM,CAAC,CAACoC,QAAUD,OAAOE,QAAQ,CAACD,UAAUA,SAAS,GACrDX,IAAI,CAAC,CAACC,GAAGC,IAAMD,IAAIC;QACtB,IAAI,CAACK,OAAOtC,MAAM,EAAE,OAAO;QAC3B,MAAM4C,SAASC,KAAKC,KAAK,CAACR,OAAOtC,MAAM,GAAG;QAC1C,OAAOsC,OAAOtC,MAAM,GAAG,IACnBsC,MAAM,CAACM,OAAO,GACdC,KAAKE,KAAK,CAAC,AAACT,CAAAA,MAAM,CAACM,SAAS,EAAE,GAAGN,MAAM,CAACM,OAAO,AAAD,IAAK;IACzD;IACA,OAAO;QACL1D,aAAakD,OAAO;QACpBjD,cAAciD,OAAO;QACrBhD,iBAAiBgD,OAAO;QACxB/C,kBAAkB+C,OAAO;IAC3B;AACF;AAsBA,6EAA6E,GAC7E,OAAO,SAASY,eACdhC,IAAgB,EAChBlB,MAAqB,EACrBmD,QAAwB,EACxB/B,QAA2B;;IAE3B,MAAMC,QAAQ9C,eAAe2C,MAAME;IACnC,MAAMK,OAAOR,qBAAqBC,MAAM,MAAMlB,QAAQoB;IACtD,IAAI,CAACC,SAAS,CAACI,MAAM,OAAO;IAC5B,MAAM2B,UAAUD,mBAAAA,WAAYhE,qBAAqB,CAAC+B,KAAK;IACvD,qEAAqE;IACrE,yEAAyE;IACzE,uEAAuE;IACvE,uEAAuE;IACvE,MAAMmC,WAAWhF,oBAAoB+E,SAAS3B,KAAKD,KAAK;IACxD,MAAM8B,SAAS,CAACvD;QACd,MAAMwD,OAAOlF,oBAAoB+E,SAASrD,MAAMJ,EAAE;QAClD,OAAO;YACLA,IAAII,MAAMJ,EAAE;YACZ6D,OAAOzD,MAAMyD,KAAK;YAClB5C,MAAMb,MAAMa,IAAI;YAChB6C,mBAAmBzF,qBAAqBuF;YACxCG,YAAYL,WAAW,IAAIN,KAAKE,KAAK,CAAC,AAACM,OAAOF,WAAY,MAAM,KAAK;QACvE;IACF;IACA,MAAMM,YAAYxF,eAAesD,KAAKD,KAAK;IAC3C,OAAO;QACLC,MAAM;YACJ9B,IAAInB;YACJgF,OAAOG,YAAY,CAAC,MAAM,EAAEA,UAAUH,KAAK,CAAC,CAAC,CAAC,GAAG;YACjD5C,IAAI,UAAE+C,6BAAAA,UAAW/C,IAAI,mBAAI1C,aAAa,CAACgD,KAAK;YAC5CuC,mBAAmBzF,qBAAqBqF;YACxCK,YAAY;YACZlC,OAAOC,KAAKD,KAAK;QACnB;QACAoC,SAASxD,mBAAmBiB,MAAMZ,QAAQ,CAACd,EAAE,EAAEK,QAC5CyC,GAAG,CAACa,QACJrB,IAAI,CAAC,CAACC,GAAGC,IAAMD,EAAEuB,iBAAiB,GAAGtB,EAAEsB,iBAAiB,IAAIvB,EAAEsB,KAAK,CAACK,aAAa,CAAC1B,EAAEqB,KAAK;QAC5FL,UAAUA,aAAa;IACzB;AACF"}

package/src/lib/providers/routing.d.ts

@@ -37,6 +37,12 @@ export declare const AI_DEFAULT_MODEL_ENV = "AI_DEFAULT_MODEL";
 export declare const ASSIST_MODEL_ENV = "ASSIST_MODEL";
 /** The org's resolved `pluginSettings/ai` values, as `getPluginConfig` merges them. */
 export type AiPluginSettings = Record<string, unknown>;
+/**
+ * The model that serves a catalog id (AGL-3781): the id itself, or for a
+ * retired row the successor it names, followed to a current row. An id the
+ * catalog does not know is returned as it is, for the caller to refuse.
+ */
+export declare function aiServingModelId(modelId: string): string;
 export interface AiRoute {
     provider: AiProvider;
     model: string;
@@ -56,7 +62,11 @@ export declare function resolveAiRoute(kind: AiStepKind, settings?: AiPluginSett
  * briefs (AGL-2937).
  */
 export interface AiRoutingRow {
-    /** `null` sends no setting: the model's own default, and all a fast-tier model accepts. */
+    /**
+     * `null` sends no setting: the model's own default, which on every current
+     * model is adaptive thinking. A row whose ceiling holds the answer alone
+     * says `off` (AGL-3781).
+     */
     thinking: AiThinking | null;
     effort: AiEffort | null;
     /** The answer ceiling, thinking included. */
@@ -94,5 +104,14 @@ export interface AiRoutingEval {
  * tokenizer that splits finer than four.
  */
 export declare const AI_ROUTING_TABLE: Readonly<Record<AiStepKind, AiRoutingRow>>;
+/**
+ * What a step kind's row asks of its model, as the fields a request carries:
+ * only those the row names, so a row that names none sends none and the
+ * model's own default stands.
+ */
+export declare function aiRouteSettings(kind: AiStepKind): {
+    thinking?: AiThinking;
+    effort?: AiEffort;
+};
 /** The model id alone — what a door records on the meter and the job. */
 export declare function aiModelForStep(kind: AiStepKind, settings?: AiPluginSettings): string;

package/src/lib/providers/routing.js

@@ -1,3 +1,4 @@
+import { _ as _extends } from "@swc/helpers/_/_extends";
 /**
  * @license
  * Copyright 2026 Aglyn LLC
@@ -14,7 +15,7 @@
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */ import { AI_SETTING_PLATFORM, AI_STEP_MODEL_SETTING } from "../plugin-config.js";
-import { AI_STEP_TIERS, aiCatalogEntry, aiDefaultModelFor } from "./catalog.js";
+import { AI_MODEL_CATALOG, AI_STEP_TIERS, aiCatalogEntry, aiDefaultModelFor } from "./catalog.js";
 import { aiProviderById, defaultAiProvider } from "./registry.js";
 /**
  * The routing table (AGL-2937, AGL-2939): step kind → provider and model,
@@ -31,6 +32,20 @@ import { aiProviderById, defaultAiProvider } from "./registry.js";
  * 3. the catalog's tier for the step kind on the resolved provider.
  */ /** The environment override for every step kind. */ export const AI_DEFAULT_MODEL_ENV = 'AI_DEFAULT_MODEL';
 /** The assistant's own override, honored before the general one. */ export const ASSIST_MODEL_ENV = 'ASSIST_MODEL';
+/**
+ * The model that serves a catalog id (AGL-3781): the id itself, or for a
+ * retired row the successor it names, followed to a current row. An id the
+ * catalog does not know is returned as it is, for the caller to refuse.
+ */ export function aiServingModelId(modelId) {
+    let current = modelId;
+    for(let hops = 0; hops < AI_MODEL_CATALOG.length; hops += 1){
+        var _aiCatalogEntry;
+        const successor = (_aiCatalogEntry = aiCatalogEntry(current)) == null ? void 0 : _aiCatalogEntry.successor;
+        if (!successor) return current;
+        current = successor;
+    }
+    return current;
+}
 /** A settings value that names a real choice, or `undefined` for the platform default. */ function chosen(settings, key) {
     const value = settings == null ? void 0 : settings[key];
     return typeof value === 'string' && value && value !== AI_SETTING_PLATFORM ? value : undefined;
@@ -52,9 +67,12 @@ import { aiProviderById, defaultAiProvider } from "./registry.js";
     var _process_env_ASSIST_MODEL_ENV, _process_env_AI_DEFAULT_MODEL_ENV;
     const provider = resolveAiProvider(settings);
     if (!provider) return undefined;
+    // A setting or an override that names a retired model is served by its
+    // successor, never by the retired model itself.
     const servedBy = (modelId)=>{
         var _aiCatalogEntry;
-        return modelId && ((_aiCatalogEntry = aiCatalogEntry(modelId)) == null ? void 0 : _aiCatalogEntry.provider) === provider.id ? modelId : undefined;
+        const serving = modelId ? aiServingModelId(modelId) : undefined;
+        return serving && ((_aiCatalogEntry = aiCatalogEntry(serving)) == null ? void 0 : _aiCatalogEntry.provider) === provider.id ? serving : undefined;
     };
     const model = (_ref = (_ref1 = (_servedBy = servedBy(chosen(settings, AI_STEP_MODEL_SETTING[kind]))) != null ? _servedBy : kind === 'assist.chat' ? servedBy((_process_env_ASSIST_MODEL_ENV = process.env[ASSIST_MODEL_ENV]) == null ? void 0 : _process_env_ASSIST_MODEL_ENV.trim()) : undefined) != null ? _ref1 : servedBy((_process_env_AI_DEFAULT_MODEL_ENV = process.env[AI_DEFAULT_MODEL_ENV]) == null ? void 0 : _process_env_AI_DEFAULT_MODEL_ENV.trim())) != null ? _ref : aiDefaultModelFor(provider.id, AI_STEP_TIERS[kind]);
     return model ? {
@@ -96,7 +114,10 @@ import { aiProviderById, defaultAiProvider } from "./registry.js";
         }
     },
     'copy.element': {
-        thinking: null,
+        // One element's copy on the fast tier, whose model thinks unless told not
+        // to (AGL-3781): the ceiling holds the copy alone, as it always has, and
+        // the effort is the model's own.
+        thinking: 'off',
         effort: null,
         maxTokens: 1024,
         maxTokensBasis: 'one element of copy, about the length of the text it replaces',
@@ -207,9 +228,11 @@ import { aiProviderById, defaultAiProvider } from "./registry.js";
         // CRM by AI (AGL-2917): short answers through a strict tool, written from
         // the facts the CRM reports about the record the member opened, with no
         // thinking. The ceiling fits an inline door, so a member is answered in
-        // the request that asked.
-        thinking: null,
-        effort: null,
+        // the request that asked, and has no room for thinking: the fast tier's
+        // model thinks unless told not to, so the row says off, and its effort
+        // is the low one a short answer read off given facts needs (AGL-3781).
+        thinking: 'off',
+        effort: 'low',
         maxTokens: 700,
         maxTokensBasis: "the largest answer a CRM tool accepts: sixty columns matched to fields by number, or an email draft at its length limits, at three characters a token with room, as ai-job-crm-step.spec.ts measures it",
         eval: {
@@ -409,8 +432,12 @@ import { aiProviderById, defaultAiProvider } from "./registry.js";
         }
     },
     'job.seo': {
-        thinking: null,
-        effort: null,
+        // A listing written from the page's own text to fixed lengths, sized for
+        // the answer alone: no thinking, which the fast tier's model does unless
+        // told not to, at the low effort a short bounded answer needs (AGL-3781).
+        // The audit's site proposal and fix batches run on the same row.
+        thinking: 'off',
+        effort: 'low',
         maxTokens: 1024,
         maxTokensBasis: "the largest listing the tool accepts, at three characters a token with a quarter again, as ai-job-seo-step.spec.ts measures it; an audit's site proposal and fix batches keep ceilings of their own, measured the same way",
         eval: {
@@ -473,6 +500,18 @@ import { aiProviderById, defaultAiProvider } from "./registry.js";
         }
     }
 };
+/**
+ * What a step kind's row asks of its model, as the fields a request carries:
+ * only those the row names, so a row that names none sends none and the
+ * model's own default stands.
+ */ export function aiRouteSettings(kind) {
+    const row = AI_ROUTING_TABLE[kind];
+    return _extends({}, row.thinking ? {
+        thinking: row.thinking
+    } : {}, row.effort ? {
+        effort: row.effort
+    } : {});
+}
 /** The model id alone — what a door records on the meter and the job. */ export function aiModelForStep(kind, settings) {
     const route = resolveAiRoute(kind, settings);
     if (!route) {

package/src/lib/providers/routing.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/providers/routing.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { AI_SETTING_PLATFORM, AI_STEP_MODEL_SETTING } from '../plugin-config'\nimport {\n  AI_STEP_TIERS,\n  aiCatalogEntry,\n  aiDefaultModelFor,\n  type AiStepKind,\n} from './catalog'\nimport type { AiEvalKind } from '../runtime/ai-eval'\nimport type { AiEffort, AiProvider, AiThinking } from './contract'\nimport { aiProviderById, defaultAiProvider } from './registry'\n\n/**\n * The routing table (AGL-2937, AGL-2939): step kind → provider and model,\n * through the catalog and never a vendor literal.\n *\n * Precedence, dearest override first:\n *\n * 1. the org's `pluginSettings/ai` — a provider, and a model per step kind\n *    that must be one the provider serves;\n * 2. the deployment's environment — `AI_PROVIDER` for the provider,\n *    `AI_DEFAULT_MODEL` for every step, and `ASSIST_MODEL` for the\n *    assistant alone (the incident-response override the chat door has\n *    always honored);\n * 3. the catalog's tier for the step kind on the resolved provider.\n */\n\n/** The environment override for every step kind. */\nexport const AI_DEFAULT_MODEL_ENV = 'AI_DEFAULT_MODEL'\n/** The assistant's own override, honored before the general one. */\nexport const ASSIST_MODEL_ENV = 'ASSIST_MODEL'\n\n/** The org's resolved `pluginSettings/ai` values, as `getPluginConfig` merges them. */\nexport type AiPluginSettings = Record<string, unknown>\n\nexport interface AiRoute {\n  provider: AiProvider\n  model: string\n}\n\n/** A settings value that names a real choice, or `undefined` for the platform default. */\nfunction chosen(settings: AiPluginSettings | undefined, key: string): string | undefined {\n  const value = settings?.[key]\n  return typeof value === 'string' && value && value !== AI_SETTING_PLATFORM\n    ? value\n    : undefined\n}\n\n/** The provider a workspace runs on: its own choice when registered, else the platform's. */\nexport function resolveAiProvider(settings?: AiPluginSettings): AiProvider | undefined {\n  const wanted = chosen(settings, 'provider')\n  if (wanted) {\n    const named = aiProviderById(wanted)\n    if (named) return named\n  }\n  return defaultAiProvider()\n}\n\n/**\n * The model a step kind runs on for a workspace, on the resolved provider.\n * A chosen model on another provider is not served — the provider decides\n * what it can run — and falls back to the provider's default for the tier.\n */\nexport function resolveAiRoute(\n  kind: AiStepKind,\n  settings?: AiPluginSettings,\n): AiRoute | undefined {\n  const provider = resolveAiProvider(settings)\n  if (!provider) return undefined\n  const servedBy = (modelId: string | undefined): string | undefined =>\n    modelId && aiCatalogEntry(modelId)?.provider === provider.id ? modelId : undefined\n  const model =\n    servedBy(chosen(settings, AI_STEP_MODEL_SETTING[kind])) ??\n    (kind === 'assist.chat' ? servedBy(process.env[ASSIST_MODEL_ENV]?.trim()) : undefined) ??\n    servedBy(process.env[AI_DEFAULT_MODEL_ENV]?.trim()) ??\n    aiDefaultModelFor(provider.id, AI_STEP_TIERS[kind])\n  return model ? { provider, model } : undefined\n}\n\n/**\n * What one step kind asks of its model, beside the tier it is served from\n * (`AI_STEP_TIERS` in the catalog): whether it thinks and how hard, its\n * answer ceiling, and the eval score that tier holds on the step's golden\n * briefs (AGL-2937).\n */\nexport interface AiRoutingRow {\n  /** `null` sends no setting: the model's own default, and all a fast-tier model accepts. */\n  thinking: AiThinking | null\n  effort: AiEffort | null\n  /** The answer ceiling, thinking included. */\n  maxTokens: number\n  /** What the ceiling is sized from. */\n  maxTokensBasis: string\n  eval: AiRoutingEval\n}\n\nexport interface AiRoutingEval {\n  /** The golden-brief kinds the step answers. */\n  kinds: readonly AiEvalKind[]\n  /** `answers` scores the step's answers; `plans` scores the plans those kinds' answers carry. */\n  scores: 'answers' | 'plans'\n  /** `authored` while the score is the hand-written references'; `recorded` once a live run records answers. */\n  source: 'authored' | 'recorded'\n  passRate: number\n  /** The mean answer score; `null` for a plan score, which passes or fails. */\n  meanScore: number | null\n}\n\n/**\n * THE ROUTING TABLE (AGL-2937): what each step kind asks of the model, in one\n * place, with the evidence beside it.\n *\n * A step runs on the smallest tier that holds its eval floor. A row moves to a\n * cheaper tier, or a lower effort, only when a recorded eval\n * (`npm run eval:ai-live`) holds the floor there; while a row's score is the\n * authored references', it says so, and the row stays where production has\n * run it. `runtime/ai-eval.spec.ts` recomputes every row's score from the\n * harness, so a row cannot claim a score its briefs do not hold.\n *\n * A ceiling is sized from the p95 output the staff signals page reports for\n * the kind once production has served it; until then `maxTokensBasis` names\n * what it is sized from. The same spec holds every reference answer under its\n * row's ceiling at three characters a token, a reading that errs high for a\n * tokenizer that splits finer than four.\n */\nexport const AI_ROUTING_TABLE: Readonly<Record<AiStepKind, AiRoutingRow>> = {\n  'assist.chat': {\n    // A scoped, latency-sensitive chat turn: no thinking, the low effort rung.\n    thinking: 'off',\n    effort: 'low',\n    maxTokens: 1024,\n    maxTokensBasis:\n      'a docs-grounded answer of a few short paragraphs; the edit rung raises it for its tool call',\n    eval: { kinds: ['chat'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'copy.element': {\n    thinking: null,\n    effort: null,\n    maxTokens: 1024,\n    maxTokensBasis: 'one element of copy, about the length of the text it replaces',\n    eval: { kinds: ['element'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'copy.section': {\n    thinking: null,\n    effort: null,\n    maxTokens: 3000,\n    maxTokensBasis: 'a section of four to twelve nodes written as JSON',\n    eval: { kinds: ['section'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'copy.blog': {\n    thinking: null,\n    effort: null,\n    maxTokens: 2048,\n    maxTokensBasis: 'one blog post body in markdown-lite',\n    eval: { kinds: ['blog'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'generate.section': {\n    thinking: null,\n    effort: null,\n    maxTokens: 3000,\n    maxTokensBasis: 'a section of four to twelve nodes written as JSON',\n    eval: { kinds: ['section'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.layout': {\n    // The plan was reasoned out and confirmed before the step, so it writes without thinking.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"tighter than the doctrine's default for a layout, so one step and its re-ask fit the job beat's budget; the tree is held to its rule 17 budget either way\",\n    eval: { kinds: ['layout'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.template': {\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"tighter than the doctrine's default for a template, so one step and its re-ask fit the job beat's budget; the tree is held to its rule 17 budget either way\",\n    eval: { kinds: ['template'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.component': {\n    // A component's tree and the properties it declares, in one answer, from a\n    // plan reasoned out and confirmed before the step (AGL-2908).\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"the ceiling the layout and template steps keep, so one step and its re-ask fit the job beat's budget; the tree is held to its rule 17 budget either way\",\n    eval: { kinds: ['component'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.crm': {\n    // CRM by AI (AGL-2917): short answers through a strict tool, written from\n    // the facts the CRM reports about the record the member opened, with no\n    // thinking. The ceiling fits an inline door, so a member is answered in\n    // the request that asked.\n    thinking: null,\n    effort: null,\n    maxTokens: 700,\n    maxTokensBasis:\n      \"the largest answer a CRM tool accepts: sixty columns matched to fields by number, or an email draft at its length limits, at three characters a token with room, as ai-job-crm-step.spec.ts measures it\",\n    eval: { kinds: ['crm'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9938 },\n  },\n  'job.experiment': {\n    // Variants of one piece of copy, or a result explained against a verdict\n    // code reached before the request was made (AGL-2914). The judgment is\n    // already made either way, so it writes without thinking.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 1500,\n    maxTokensBasis:\n      \"four variants at the tool's own lengths — a name, a headline, a body and a rationale each — written as JSON, about 3,000 characters at three characters a token with room; an explanation is a headline, four sentences and a next step, well under it, as ai-job-experiment-step.spec.ts measures both\",\n    eval: { kinds: ['experiment'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.form': {\n    // A form's two halves in one answer: the field declaration and the design\n    // that renders it, as JSON, with no extended thinking (AGL-2913). The step\n    // asks this ceiling, which is the doctrine's own for a form, and registers\n    // the time it takes (AGL-3035).\n    thinking: 'off',\n    effort: null,\n    maxTokens: 6000,\n    maxTokensBasis:\n      \"the largest form the doctrine's output budget admits, a form's fields, its consent and routing declaration and the design that renders them written as JSON at the wordiest golden's characters a stored byte, under it with room; ai-job-form-step.spec.ts measures it\",\n    eval: { kinds: ['form'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.insight': {\n    // Readers chosen, then their tables phrased (AGL-2915): short sentences\n    // over figures code computed, each held to the rows it cites, so no\n    // extended thinking. The read call before the answer asks for at most\n    // `AI_INSIGHT_READ_MAX_TOKENS` of the same allowance.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 1500,\n    maxTokensBasis:\n      'five insights at their 280-character bound, each citing three tables of ten rows, and the gap sentence, written as JSON: about 2,700 characters, under 1,000 tokens at three characters a token, with room',\n    eval: { kinds: ['insight'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.page': {\n    // One section of a page, written against a plan a member already\n    // confirmed, so it writes without thinking (AGL-2907). The ceiling here\n    // is the MOST a pass may ask for; each pass sizes its own down from it to\n    // what fits the time the job beat can give the step, which on the\n    // balanced tier is about half of this.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 2000,\n    maxTokensBasis:\n      \"a section of a page written as JSON, about forty elements at the step's measured 45 tokens an element; a pass lowers it to the worst case that fits AI_JOB_PAGE_STEP_MINIMUM_MS on the model it runs\",\n    eval: { kinds: ['page'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.products': {\n    // A product's copy from its name, text and photo, or a store's first\n    // products, categories and discounts from a brief (AGL-2916): answers held\n    // to the storefront claim rules, written with no extended thinking.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"the largest catalog the tool accepts, twelve proposed products at every bound written as JSON, which the balanced tier asks as much of as fits a beat; one product's copy asks 1,500 and categories with discounts 2,000, as ai-job-products-step.spec.ts measures them\",\n    eval: {\n      kinds: ['product', 'catalog', 'categories'],\n      scores: 'answers',\n      source: 'authored',\n      passRate: 1,\n      meanScore: 0.9922,\n    },\n  },\n  'job.email': {\n    // One email design from the email palette, written against the brief with\n    // no extended thinking (AGL-2912). A campaign job runs the same\n    // generation, so it carries the same ceiling.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 6000,\n    maxTokensBasis:\n      \"an email's node map written as JSON, with three subject lines and three preheaders beside it\",\n    eval: { kinds: ['email'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.campaign': {\n    // The campaign job generates its email through the email step, so it is\n    // routed identically; the draft campaign it also writes asks nothing of\n    // the model (AGL-2912).\n    thinking: 'off',\n    effort: null,\n    maxTokens: 6000,\n    maxTokensBasis:\n      \"an email's node map written as JSON, with three subject lines and three preheaders beside it\",\n    eval: { kinds: ['email'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.workflow': {\n    // An automation drafted from a description, or one explained (AGL-2919):\n    // which trigger and which steps a description means is the judgment the\n    // step sells, so it thinks before it answers.\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 4000,\n    maxTokensBasis:\n      'the largest automation the tool accepts, 6,000 characters written out as JSON, at three characters a token with as much again to think in, as ai-job-workflow-step.spec.ts measures it',\n    eval: { kinds: ['workflow'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.logic': {\n    // A site function or variable proposed, or a function explained\n    // (AGL-3603): which conditions and arithmetic a description means is the\n    // judgment the step sells, so it thinks before it answers.\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 3000,\n    maxTokensBasis:\n      'the largest function the tool accepts — twelve parameters, twenty-four operations — is far past any description; a function of eight operations is about 2,400 characters of JSON, at three characters a token with as much again to think in, as ai-job-logic-step.spec.ts measures it',\n    eval: { kinds: ['logic'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.edit': {\n    // A change to a page or a layout the site has (AGL-3616): which elements\n    // a request means, on an outline with no selection, is the judgment the\n    // step sells, so it thinks before it answers.\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 6144,\n    maxTokensBasis:\n      \"the Assist edit rung's own ceiling for the proposal's tool call (ASSIST_EDIT_MAX_OUTPUT_TOKENS, 4,096: forty new elements written as name/value pairs), with half as much again to think in, as ai-job-edit-step.spec.ts holds it; the whole of it twice, as a re-ask may, still fits one beat on the balanced tier\",\n    eval: { kinds: ['edit'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.seo': {\n    thinking: null,\n    effort: null,\n    maxTokens: 1024,\n    maxTokensBasis:\n      \"the largest listing the tool accepts, at three characters a token with a quarter again, as ai-job-seo-step.spec.ts measures it; an audit's site proposal and fix batches keep ceilings of their own, measured the same way\",\n    eval: { kinds: ['seo'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.text': {\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 1024,\n    maxTokensBasis: 'a few paragraphs of copy; a brief asking for more gets a draft to extend',\n    eval: { kinds: ['text'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.theme': {\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      'the largest answer the theme tool accepts, about 2,500 tokens of JSON as ai-job-theme-step.spec.ts measures it, with as much again to think in',\n    eval: { kinds: ['theme'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.plan': {\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis: 'a plan of up to twelve screens with sixteen sections each, with room to think',\n    eval: {\n      kinds: ['page', 'template', 'component', 'layout', 'form'],\n      scores: 'plans',\n      source: 'authored',\n      passRate: 1,\n      meanScore: null,\n    },\n  },\n}\n\n/** The model id alone — what a door records on the meter and the job. */\nexport function aiModelForStep(kind: AiStepKind, settings?: AiPluginSettings): string {\n  const route = resolveAiRoute(kind, settings)\n  if (!route) {\n    // Every door gates on the provider being configured before it asks\n    // for a model, so this is a wiring fault rather than a customer path.\n    throw new Error('no AI provider is registered')\n  }\n  return route.model\n}\n"],"names":["AI_SETTING_PLATFORM","AI_STEP_MODEL_SETTING","AI_STEP_TIERS","aiCatalogEntry","aiDefaultModelFor","aiProviderById","defaultAiProvider","AI_DEFAULT_MODEL_ENV","ASSIST_MODEL_ENV","chosen","settings","key","value","undefined","resolveAiProvider","wanted","named","resolveAiRoute","kind","servedBy","process","provider","modelId","id","model","env","trim","AI_ROUTING_TABLE","thinking","effort","maxTokens","maxTokensBasis","eval","kinds","scores","source","passRate","meanScore","aiModelForStep","route","Error"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,mBAAmB,EAAEC,qBAAqB,QAAQ,sBAAkB;AAC7E,SACEC,aAAa,EACbC,cAAc,EACdC,iBAAiB,QAEZ,eAAW;AAGlB,SAASC,cAAc,EAAEC,iBAAiB,QAAQ,gBAAY;AAE9D;;;;;;;;;;;;;CAaC,GAED,kDAAkD,GAClD,OAAO,MAAMC,uBAAuB,mBAAkB;AACtD,kEAAkE,GAClE,OAAO,MAAMC,mBAAmB,eAAc;AAU9C,wFAAwF,GACxF,SAASC,OAAOC,QAAsC,EAAEC,GAAW;IACjE,MAAMC,QAAQF,4BAAAA,QAAU,CAACC,IAAI;IAC7B,OAAO,OAAOC,UAAU,YAAYA,SAASA,UAAUZ,sBACnDY,QACAC;AACN;AAEA,2FAA2F,GAC3F,OAAO,SAASC,kBAAkBJ,QAA2B;IAC3D,MAAMK,SAASN,OAAOC,UAAU;IAChC,IAAIK,QAAQ;QACV,MAAMC,QAAQX,eAAeU;QAC7B,IAAIC,OAAO,OAAOA;IACpB;IACA,OAAOV;AACT;AAEA;;;;CAIC,GACD,OAAO,SAASW,eACdC,IAAgB,EAChBR,QAA2B;QAOzBS,MAAAA,OAAAA;QACmCC,+BAC1BA;IAPX,MAAMC,WAAWP,kBAAkBJ;IACnC,IAAI,CAACW,UAAU,OAAOR;IACtB,MAAMM,WAAW,CAACG;YACLnB;eAAXmB,WAAWnB,EAAAA,kBAAAA,eAAemB,6BAAfnB,gBAAyBkB,QAAQ,MAAKA,SAASE,EAAE,GAAGD,UAAUT;;IAC3E,MAAMW,SACJL,QAAAA,SAAAA,YAAAA,SAASV,OAAOC,UAAUT,qBAAqB,CAACiB,KAAK,cAArDC,YACCD,SAAS,gBAAgBC,UAASC,gCAAAA,QAAQK,GAAG,CAACjB,iBAAiB,qBAA7BY,8BAA+BM,IAAI,MAAMb,qBAD5EM,QAEAA,UAASC,oCAAAA,QAAQK,GAAG,CAAClB,qBAAqB,qBAAjCa,kCAAmCM,IAAI,eAFhDP,OAGAf,kBAAkBiB,SAASE,EAAE,EAAErB,aAAa,CAACgB,KAAK;IACpD,OAAOM,QAAQ;QAAEH;QAAUG;IAAM,IAAIX;AACvC;AA+BA;;;;;;;;;;;;;;;;CAgBC,GACD,OAAO,MAAMc,mBAA+D;IAC1E,eAAe;QACb,2EAA2E;QAC3EC,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,gBAAgB;QACdT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,gBAAgB;QACdT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,aAAa;QACXT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,oBAAoB;QAClBT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,cAAc;QACZ,0FAA0F;QAC1FT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAS;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACnG;IACA,gBAAgB;QACdT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAW;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACrG;IACA,iBAAiB;QACf,2EAA2E;QAC3E,8DAA8D;QAC9DT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAY;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACtG;IACA,WAAW;QACT,0EAA0E;QAC1E,wEAAwE;QACxE,wEAAwE;QACxE,0BAA0B;QAC1BT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAM;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAChG;IACA,kBAAkB;QAChB,yEAAyE;QACzE,uEAAuE;QACvE,0DAA0D;QAC1DT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAa;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAClG;IACA,YAAY;QACV,0EAA0E;QAC1E,2EAA2E;QAC3E,2EAA2E;QAC3E,gCAAgC;QAChCT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,eAAe;QACb,wEAAwE;QACxE,oEAAoE;QACpE,sEAAsE;QACtE,sDAAsD;QACtDT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,YAAY;QACV,iEAAiE;QACjE,wEAAwE;QACxE,0EAA0E;QAC1E,kEAAkE;QAClE,uCAAuC;QACvCT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,gBAAgB;QACd,qEAAqE;QACrE,2EAA2E;QAC3E,oEAAoE;QACpET,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YACJC,OAAO;gBAAC;gBAAW;gBAAW;aAAa;YAC3CC,QAAQ;YACRC,QAAQ;YACRC,UAAU;YACVC,WAAW;QACb;IACF;IACA,aAAa;QACX,0EAA0E;QAC1E,gEAAgE;QAChE,8CAA8C;QAC9CT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAClG;IACA,gBAAgB;QACd,wEAAwE;QACxE,wEAAwE;QACxE,wBAAwB;QACxBT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAClG;IACA,gBAAgB;QACd,yEAAyE;QACzE,wEAAwE;QACxE,8CAA8C;QAC9CT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAW;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACrG;IACA,aAAa;QACX,gEAAgE;QAChE,yEAAyE;QACzE,2DAA2D;QAC3DT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC7F;IACA,YAAY;QACV,yEAAyE;QACzE,wEAAwE;QACxE,8CAA8C;QAC9CT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC5F;IACA,WAAW;QACTT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAM;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC3F;IACA,YAAY;QACVT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC5F;IACA,aAAa;QACXT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAClG;IACA,YAAY;QACVT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YACJC,OAAO;gBAAC;gBAAQ;gBAAY;gBAAa;gBAAU;aAAO;YAC1DC,QAAQ;YACRC,QAAQ;YACRC,UAAU;YACVC,WAAW;QACb;IACF;AACF,EAAC;AAED,uEAAuE,GACvE,OAAO,SAASC,eAAepB,IAAgB,EAAER,QAA2B;IAC1E,MAAM6B,QAAQtB,eAAeC,MAAMR;IACnC,IAAI,CAAC6B,OAAO;QACV,mEAAmE;QACnE,sEAAsE;QACtE,MAAM,IAAIC,MAAM;IAClB;IACA,OAAOD,MAAMf,KAAK;AACpB"}
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/providers/routing.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { AI_SETTING_PLATFORM, AI_STEP_MODEL_SETTING } from '../plugin-config'\nimport {\n  AI_MODEL_CATALOG,\n  AI_STEP_TIERS,\n  aiCatalogEntry,\n  aiDefaultModelFor,\n  type AiStepKind,\n} from './catalog'\nimport type { AiEvalKind } from '../runtime/ai-eval'\nimport type { AiEffort, AiProvider, AiThinking } from './contract'\nimport { aiProviderById, defaultAiProvider } from './registry'\n\n/**\n * The routing table (AGL-2937, AGL-2939): step kind → provider and model,\n * through the catalog and never a vendor literal.\n *\n * Precedence, dearest override first:\n *\n * 1. the org's `pluginSettings/ai` — a provider, and a model per step kind\n *    that must be one the provider serves;\n * 2. the deployment's environment — `AI_PROVIDER` for the provider,\n *    `AI_DEFAULT_MODEL` for every step, and `ASSIST_MODEL` for the\n *    assistant alone (the incident-response override the chat door has\n *    always honored);\n * 3. the catalog's tier for the step kind on the resolved provider.\n */\n\n/** The environment override for every step kind. */\nexport const AI_DEFAULT_MODEL_ENV = 'AI_DEFAULT_MODEL'\n/** The assistant's own override, honored before the general one. */\nexport const ASSIST_MODEL_ENV = 'ASSIST_MODEL'\n\n/** The org's resolved `pluginSettings/ai` values, as `getPluginConfig` merges them. */\nexport type AiPluginSettings = Record<string, unknown>\n\n/**\n * The model that serves a catalog id (AGL-3781): the id itself, or for a\n * retired row the successor it names, followed to a current row. An id the\n * catalog does not know is returned as it is, for the caller to refuse.\n */\nexport function aiServingModelId(modelId: string): string {\n  let current = modelId\n  for (let hops = 0; hops < AI_MODEL_CATALOG.length; hops += 1) {\n    const successor = aiCatalogEntry(current)?.successor\n    if (!successor) return current\n    current = successor\n  }\n  return current\n}\n\nexport interface AiRoute {\n  provider: AiProvider\n  model: string\n}\n\n/** A settings value that names a real choice, or `undefined` for the platform default. */\nfunction chosen(settings: AiPluginSettings | undefined, key: string): string | undefined {\n  const value = settings?.[key]\n  return typeof value === 'string' && value && value !== AI_SETTING_PLATFORM\n    ? value\n    : undefined\n}\n\n/** The provider a workspace runs on: its own choice when registered, else the platform's. */\nexport function resolveAiProvider(settings?: AiPluginSettings): AiProvider | undefined {\n  const wanted = chosen(settings, 'provider')\n  if (wanted) {\n    const named = aiProviderById(wanted)\n    if (named) return named\n  }\n  return defaultAiProvider()\n}\n\n/**\n * The model a step kind runs on for a workspace, on the resolved provider.\n * A chosen model on another provider is not served — the provider decides\n * what it can run — and falls back to the provider's default for the tier.\n */\nexport function resolveAiRoute(\n  kind: AiStepKind,\n  settings?: AiPluginSettings,\n): AiRoute | undefined {\n  const provider = resolveAiProvider(settings)\n  if (!provider) return undefined\n  // A setting or an override that names a retired model is served by its\n  // successor, never by the retired model itself.\n  const servedBy = (modelId: string | undefined): string | undefined => {\n    const serving = modelId ? aiServingModelId(modelId) : undefined\n    return serving && aiCatalogEntry(serving)?.provider === provider.id ? serving : undefined\n  }\n  const model =\n    servedBy(chosen(settings, AI_STEP_MODEL_SETTING[kind])) ??\n    (kind === 'assist.chat' ? servedBy(process.env[ASSIST_MODEL_ENV]?.trim()) : undefined) ??\n    servedBy(process.env[AI_DEFAULT_MODEL_ENV]?.trim()) ??\n    aiDefaultModelFor(provider.id, AI_STEP_TIERS[kind])\n  return model ? { provider, model } : undefined\n}\n\n/**\n * What one step kind asks of its model, beside the tier it is served from\n * (`AI_STEP_TIERS` in the catalog): whether it thinks and how hard, its\n * answer ceiling, and the eval score that tier holds on the step's golden\n * briefs (AGL-2937).\n */\nexport interface AiRoutingRow {\n  /**\n   * `null` sends no setting: the model's own default, which on every current\n   * model is adaptive thinking. A row whose ceiling holds the answer alone\n   * says `off` (AGL-3781).\n   */\n  thinking: AiThinking | null\n  effort: AiEffort | null\n  /** The answer ceiling, thinking included. */\n  maxTokens: number\n  /** What the ceiling is sized from. */\n  maxTokensBasis: string\n  eval: AiRoutingEval\n}\n\nexport interface AiRoutingEval {\n  /** The golden-brief kinds the step answers. */\n  kinds: readonly AiEvalKind[]\n  /** `answers` scores the step's answers; `plans` scores the plans those kinds' answers carry. */\n  scores: 'answers' | 'plans'\n  /** `authored` while the score is the hand-written references'; `recorded` once a live run records answers. */\n  source: 'authored' | 'recorded'\n  passRate: number\n  /** The mean answer score; `null` for a plan score, which passes or fails. */\n  meanScore: number | null\n}\n\n/**\n * THE ROUTING TABLE (AGL-2937): what each step kind asks of the model, in one\n * place, with the evidence beside it.\n *\n * A step runs on the smallest tier that holds its eval floor. A row moves to a\n * cheaper tier, or a lower effort, only when a recorded eval\n * (`npm run eval:ai-live`) holds the floor there; while a row's score is the\n * authored references', it says so, and the row stays where production has\n * run it. `runtime/ai-eval.spec.ts` recomputes every row's score from the\n * harness, so a row cannot claim a score its briefs do not hold.\n *\n * A ceiling is sized from the p95 output the staff signals page reports for\n * the kind once production has served it; until then `maxTokensBasis` names\n * what it is sized from. The same spec holds every reference answer under its\n * row's ceiling at three characters a token, a reading that errs high for a\n * tokenizer that splits finer than four.\n */\nexport const AI_ROUTING_TABLE: Readonly<Record<AiStepKind, AiRoutingRow>> = {\n  'assist.chat': {\n    // A scoped, latency-sensitive chat turn: no thinking, the low effort rung.\n    thinking: 'off',\n    effort: 'low',\n    maxTokens: 1024,\n    maxTokensBasis:\n      'a docs-grounded answer of a few short paragraphs; the edit rung raises it for its tool call',\n    eval: { kinds: ['chat'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'copy.element': {\n    // One element's copy on the fast tier, whose model thinks unless told not\n    // to (AGL-3781): the ceiling holds the copy alone, as it always has, and\n    // the effort is the model's own.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 1024,\n    maxTokensBasis: 'one element of copy, about the length of the text it replaces',\n    eval: { kinds: ['element'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'copy.section': {\n    thinking: null,\n    effort: null,\n    maxTokens: 3000,\n    maxTokensBasis: 'a section of four to twelve nodes written as JSON',\n    eval: { kinds: ['section'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'copy.blog': {\n    thinking: null,\n    effort: null,\n    maxTokens: 2048,\n    maxTokensBasis: 'one blog post body in markdown-lite',\n    eval: { kinds: ['blog'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'generate.section': {\n    thinking: null,\n    effort: null,\n    maxTokens: 3000,\n    maxTokensBasis: 'a section of four to twelve nodes written as JSON',\n    eval: { kinds: ['section'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.layout': {\n    // The plan was reasoned out and confirmed before the step, so it writes without thinking.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"tighter than the doctrine's default for a layout, so one step and its re-ask fit the job beat's budget; the tree is held to its rule 17 budget either way\",\n    eval: { kinds: ['layout'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.template': {\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"tighter than the doctrine's default for a template, so one step and its re-ask fit the job beat's budget; the tree is held to its rule 17 budget either way\",\n    eval: { kinds: ['template'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.component': {\n    // A component's tree and the properties it declares, in one answer, from a\n    // plan reasoned out and confirmed before the step (AGL-2908).\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"the ceiling the layout and template steps keep, so one step and its re-ask fit the job beat's budget; the tree is held to its rule 17 budget either way\",\n    eval: { kinds: ['component'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.crm': {\n    // CRM by AI (AGL-2917): short answers through a strict tool, written from\n    // the facts the CRM reports about the record the member opened, with no\n    // thinking. The ceiling fits an inline door, so a member is answered in\n    // the request that asked, and has no room for thinking: the fast tier's\n    // model thinks unless told not to, so the row says off, and its effort\n    // is the low one a short answer read off given facts needs (AGL-3781).\n    thinking: 'off',\n    effort: 'low',\n    maxTokens: 700,\n    maxTokensBasis:\n      \"the largest answer a CRM tool accepts: sixty columns matched to fields by number, or an email draft at its length limits, at three characters a token with room, as ai-job-crm-step.spec.ts measures it\",\n    eval: { kinds: ['crm'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9938 },\n  },\n  'job.experiment': {\n    // Variants of one piece of copy, or a result explained against a verdict\n    // code reached before the request was made (AGL-2914). The judgment is\n    // already made either way, so it writes without thinking.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 1500,\n    maxTokensBasis:\n      \"four variants at the tool's own lengths — a name, a headline, a body and a rationale each — written as JSON, about 3,000 characters at three characters a token with room; an explanation is a headline, four sentences and a next step, well under it, as ai-job-experiment-step.spec.ts measures both\",\n    eval: { kinds: ['experiment'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.form': {\n    // A form's two halves in one answer: the field declaration and the design\n    // that renders it, as JSON, with no extended thinking (AGL-2913). The step\n    // asks this ceiling, which is the doctrine's own for a form, and registers\n    // the time it takes (AGL-3035).\n    thinking: 'off',\n    effort: null,\n    maxTokens: 6000,\n    maxTokensBasis:\n      \"the largest form the doctrine's output budget admits, a form's fields, its consent and routing declaration and the design that renders them written as JSON at the wordiest golden's characters a stored byte, under it with room; ai-job-form-step.spec.ts measures it\",\n    eval: { kinds: ['form'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.insight': {\n    // Readers chosen, then their tables phrased (AGL-2915): short sentences\n    // over figures code computed, each held to the rows it cites, so no\n    // extended thinking. The read call before the answer asks for at most\n    // `AI_INSIGHT_READ_MAX_TOKENS` of the same allowance.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 1500,\n    maxTokensBasis:\n      'five insights at their 280-character bound, each citing three tables of ten rows, and the gap sentence, written as JSON: about 2,700 characters, under 1,000 tokens at three characters a token, with room',\n    eval: { kinds: ['insight'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.page': {\n    // One section of a page, written against a plan a member already\n    // confirmed, so it writes without thinking (AGL-2907). The ceiling here\n    // is the MOST a pass may ask for; each pass sizes its own down from it to\n    // what fits the time the job beat can give the step, which on the\n    // balanced tier is about half of this.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 2000,\n    maxTokensBasis:\n      \"a section of a page written as JSON, about forty elements at the step's measured 45 tokens an element; a pass lowers it to the worst case that fits AI_JOB_PAGE_STEP_MINIMUM_MS on the model it runs\",\n    eval: { kinds: ['page'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9833 },\n  },\n  'job.products': {\n    // A product's copy from its name, text and photo, or a store's first\n    // products, categories and discounts from a brief (AGL-2916): answers held\n    // to the storefront claim rules, written with no extended thinking.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      \"the largest catalog the tool accepts, twelve proposed products at every bound written as JSON, which the balanced tier asks as much of as fits a beat; one product's copy asks 1,500 and categories with discounts 2,000, as ai-job-products-step.spec.ts measures them\",\n    eval: {\n      kinds: ['product', 'catalog', 'categories'],\n      scores: 'answers',\n      source: 'authored',\n      passRate: 1,\n      meanScore: 0.9922,\n    },\n  },\n  'job.email': {\n    // One email design from the email palette, written against the brief with\n    // no extended thinking (AGL-2912). A campaign job runs the same\n    // generation, so it carries the same ceiling.\n    thinking: 'off',\n    effort: null,\n    maxTokens: 6000,\n    maxTokensBasis:\n      \"an email's node map written as JSON, with three subject lines and three preheaders beside it\",\n    eval: { kinds: ['email'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.campaign': {\n    // The campaign job generates its email through the email step, so it is\n    // routed identically; the draft campaign it also writes asks nothing of\n    // the model (AGL-2912).\n    thinking: 'off',\n    effort: null,\n    maxTokens: 6000,\n    maxTokensBasis:\n      \"an email's node map written as JSON, with three subject lines and three preheaders beside it\",\n    eval: { kinds: ['email'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.workflow': {\n    // An automation drafted from a description, or one explained (AGL-2919):\n    // which trigger and which steps a description means is the judgment the\n    // step sells, so it thinks before it answers.\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 4000,\n    maxTokensBasis:\n      'the largest automation the tool accepts, 6,000 characters written out as JSON, at three characters a token with as much again to think in, as ai-job-workflow-step.spec.ts measures it',\n    eval: { kinds: ['workflow'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.logic': {\n    // A site function or variable proposed, or a function explained\n    // (AGL-3603): which conditions and arithmetic a description means is the\n    // judgment the step sells, so it thinks before it answers.\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 3000,\n    maxTokensBasis:\n      'the largest function the tool accepts — twelve parameters, twenty-four operations — is far past any description; a function of eight operations is about 2,400 characters of JSON, at three characters a token with as much again to think in, as ai-job-logic-step.spec.ts measures it',\n    eval: { kinds: ['logic'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.edit': {\n    // A change to a page or a layout the site has (AGL-3616): which elements\n    // a request means, on an outline with no selection, is the judgment the\n    // step sells, so it thinks before it answers.\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 6144,\n    maxTokensBasis:\n      \"the Assist edit rung's own ceiling for the proposal's tool call (ASSIST_EDIT_MAX_OUTPUT_TOKENS, 4,096: forty new elements written as name/value pairs), with half as much again to think in, as ai-job-edit-step.spec.ts holds it; the whole of it twice, as a re-ask may, still fits one beat on the balanced tier\",\n    eval: { kinds: ['edit'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.seo': {\n    // A listing written from the page's own text to fixed lengths, sized for\n    // the answer alone: no thinking, which the fast tier's model does unless\n    // told not to, at the low effort a short bounded answer needs (AGL-3781).\n    // The audit's site proposal and fix batches run on the same row.\n    thinking: 'off',\n    effort: 'low',\n    maxTokens: 1024,\n    maxTokensBasis:\n      \"the largest listing the tool accepts, at three characters a token with a quarter again, as ai-job-seo-step.spec.ts measures it; an audit's site proposal and fix batches keep ceilings of their own, measured the same way\",\n    eval: { kinds: ['seo'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.text': {\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 1024,\n    maxTokensBasis: 'a few paragraphs of copy; a brief asking for more gets a draft to extend',\n    eval: { kinds: ['text'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 1 },\n  },\n  'job.theme': {\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis:\n      'the largest answer the theme tool accepts, about 2,500 tokens of JSON as ai-job-theme-step.spec.ts measures it, with as much again to think in',\n    eval: { kinds: ['theme'], scores: 'answers', source: 'authored', passRate: 1, meanScore: 0.9688 },\n  },\n  'job.plan': {\n    thinking: 'adaptive',\n    effort: null,\n    maxTokens: 8000,\n    maxTokensBasis: 'a plan of up to twelve screens with sixteen sections each, with room to think',\n    eval: {\n      kinds: ['page', 'template', 'component', 'layout', 'form'],\n      scores: 'plans',\n      source: 'authored',\n      passRate: 1,\n      meanScore: null,\n    },\n  },\n}\n\n/**\n * What a step kind's row asks of its model, as the fields a request carries:\n * only those the row names, so a row that names none sends none and the\n * model's own default stands.\n */\nexport function aiRouteSettings(kind: AiStepKind): { thinking?: AiThinking; effort?: AiEffort } {\n  const row = AI_ROUTING_TABLE[kind]\n  return {\n    ...(row.thinking ? { thinking: row.thinking } : {}),\n    ...(row.effort ? { effort: row.effort } : {}),\n  }\n}\n\n/** The model id alone — what a door records on the meter and the job. */\nexport function aiModelForStep(kind: AiStepKind, settings?: AiPluginSettings): string {\n  const route = resolveAiRoute(kind, settings)\n  if (!route) {\n    // Every door gates on the provider being configured before it asks\n    // for a model, so this is a wiring fault rather than a customer path.\n    throw new Error('no AI provider is registered')\n  }\n  return route.model\n}\n"],"names":["AI_SETTING_PLATFORM","AI_STEP_MODEL_SETTING","AI_MODEL_CATALOG","AI_STEP_TIERS","aiCatalogEntry","aiDefaultModelFor","aiProviderById","defaultAiProvider","AI_DEFAULT_MODEL_ENV","ASSIST_MODEL_ENV","aiServingModelId","modelId","current","hops","length","successor","chosen","settings","key","value","undefined","resolveAiProvider","wanted","named","resolveAiRoute","kind","servedBy","process","provider","serving","id","model","env","trim","AI_ROUTING_TABLE","thinking","effort","maxTokens","maxTokensBasis","eval","kinds","scores","source","passRate","meanScore","aiRouteSettings","row","aiModelForStep","route","Error"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,mBAAmB,EAAEC,qBAAqB,QAAQ,sBAAkB;AAC7E,SACEC,gBAAgB,EAChBC,aAAa,EACbC,cAAc,EACdC,iBAAiB,QAEZ,eAAW;AAGlB,SAASC,cAAc,EAAEC,iBAAiB,QAAQ,gBAAY;AAE9D;;;;;;;;;;;;;CAaC,GAED,kDAAkD,GAClD,OAAO,MAAMC,uBAAuB,mBAAkB;AACtD,kEAAkE,GAClE,OAAO,MAAMC,mBAAmB,eAAc;AAK9C;;;;CAIC,GACD,OAAO,SAASC,iBAAiBC,OAAe;IAC9C,IAAIC,UAAUD;IACd,IAAK,IAAIE,OAAO,GAAGA,OAAOX,iBAAiBY,MAAM,EAAED,QAAQ,EAAG;YAC1CT;QAAlB,MAAMW,aAAYX,kBAAAA,eAAeQ,6BAAfR,gBAAyBW,SAAS;QACpD,IAAI,CAACA,WAAW,OAAOH;QACvBA,UAAUG;IACZ;IACA,OAAOH;AACT;AAOA,wFAAwF,GACxF,SAASI,OAAOC,QAAsC,EAAEC,GAAW;IACjE,MAAMC,QAAQF,4BAAAA,QAAU,CAACC,IAAI;IAC7B,OAAO,OAAOC,UAAU,YAAYA,SAASA,UAAUnB,sBACnDmB,QACAC;AACN;AAEA,2FAA2F,GAC3F,OAAO,SAASC,kBAAkBJ,QAA2B;IAC3D,MAAMK,SAASN,OAAOC,UAAU;IAChC,IAAIK,QAAQ;QACV,MAAMC,QAAQjB,eAAegB;QAC7B,IAAIC,OAAO,OAAOA;IACpB;IACA,OAAOhB;AACT;AAEA;;;;CAIC,GACD,OAAO,SAASiB,eACdC,IAAgB,EAChBR,QAA2B;QAWzBS,MAAAA,OAAAA;QACmCC,+BAC1BA;IAXX,MAAMC,WAAWP,kBAAkBJ;IACnC,IAAI,CAACW,UAAU,OAAOR;IACtB,uEAAuE;IACvE,gDAAgD;IAChD,MAAMM,WAAW,CAACf;YAEEP;QADlB,MAAMyB,UAAUlB,UAAUD,iBAAiBC,WAAWS;QACtD,OAAOS,WAAWzB,EAAAA,kBAAAA,eAAeyB,6BAAfzB,gBAAyBwB,QAAQ,MAAKA,SAASE,EAAE,GAAGD,UAAUT;IAClF;IACA,MAAMW,SACJL,QAAAA,SAAAA,YAAAA,SAASV,OAAOC,UAAUhB,qBAAqB,CAACwB,KAAK,cAArDC,YACCD,SAAS,gBAAgBC,UAASC,gCAAAA,QAAQK,GAAG,CAACvB,iBAAiB,qBAA7BkB,8BAA+BM,IAAI,MAAMb,qBAD5EM,QAEAA,UAASC,oCAAAA,QAAQK,GAAG,CAACxB,qBAAqB,qBAAjCmB,kCAAmCM,IAAI,eAFhDP,OAGArB,kBAAkBuB,SAASE,EAAE,EAAE3B,aAAa,CAACsB,KAAK;IACpD,OAAOM,QAAQ;QAAEH;QAAUG;IAAM,IAAIX;AACvC;AAmCA;;;;;;;;;;;;;;;;CAgBC,GACD,OAAO,MAAMc,mBAA+D;IAC1E,eAAe;QACb,2EAA2E;QAC3EC,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,gBAAgB;QACd,0EAA0E;QAC1E,yEAAyE;QACzE,iCAAiC;QACjCT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,gBAAgB;QACdT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,aAAa;QACXT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,oBAAoB;QAClBT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,cAAc;QACZ,0FAA0F;QAC1FT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAS;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACnG;IACA,gBAAgB;QACdT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAW;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACrG;IACA,iBAAiB;QACf,2EAA2E;QAC3E,8DAA8D;QAC9DT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAY;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACtG;IACA,WAAW;QACT,0EAA0E;QAC1E,wEAAwE;QACxE,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,uEAAuE;QACvET,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAM;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAChG;IACA,kBAAkB;QAChB,yEAAyE;QACzE,uEAAuE;QACvE,0DAA0D;QAC1DT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAa;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAClG;IACA,YAAY;QACV,0EAA0E;QAC1E,2EAA2E;QAC3E,2EAA2E;QAC3E,gCAAgC;QAChCT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,eAAe;QACb,wEAAwE;QACxE,oEAAoE;QACpE,sEAAsE;QACtE,sDAAsD;QACtDT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAU;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACpG;IACA,YAAY;QACV,iEAAiE;QACjE,wEAAwE;QACxE,0EAA0E;QAC1E,kEAAkE;QAClE,uCAAuC;QACvCT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACjG;IACA,gBAAgB;QACd,qEAAqE;QACrE,2EAA2E;QAC3E,oEAAoE;QACpET,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YACJC,OAAO;gBAAC;gBAAW;gBAAW;aAAa;YAC3CC,QAAQ;YACRC,QAAQ;YACRC,UAAU;YACVC,WAAW;QACb;IACF;IACA,aAAa;QACX,0EAA0E;QAC1E,gEAAgE;QAChE,8CAA8C;QAC9CT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAClG;IACA,gBAAgB;QACd,wEAAwE;QACxE,wEAAwE;QACxE,wBAAwB;QACxBT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAClG;IACA,gBAAgB;QACd,yEAAyE;QACzE,wEAAwE;QACxE,8CAA8C;QAC9CT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAW;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IACrG;IACA,aAAa;QACX,gEAAgE;QAChE,yEAAyE;QACzE,2DAA2D;QAC3DT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC7F;IACA,YAAY;QACV,yEAAyE;QACzE,wEAAwE;QACxE,8CAA8C;QAC9CT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC5F;IACA,WAAW;QACT,yEAAyE;QACzE,yEAAyE;QACzE,0EAA0E;QAC1E,iEAAiE;QACjET,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAM;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC3F;IACA,YAAY;QACVT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YAAEC,OAAO;gBAAC;aAAO;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAE;IAC5F;IACA,aAAa;QACXT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBACE;QACFC,MAAM;YAAEC,OAAO;gBAAC;aAAQ;YAAEC,QAAQ;YAAWC,QAAQ;YAAYC,UAAU;YAAGC,WAAW;QAAO;IAClG;IACA,YAAY;QACVT,UAAU;QACVC,QAAQ;QACRC,WAAW;QACXC,gBAAgB;QAChBC,MAAM;YACJC,OAAO;gBAAC;gBAAQ;gBAAY;gBAAa;gBAAU;aAAO;YAC1DC,QAAQ;YACRC,QAAQ;YACRC,UAAU;YACVC,WAAW;QACb;IACF;AACF,EAAC;AAED;;;;CAIC,GACD,OAAO,SAASC,gBAAgBpB,IAAgB;IAC9C,MAAMqB,MAAMZ,gBAAgB,CAACT,KAAK;IAClC,OAAO,aACDqB,IAAIX,QAAQ,GAAG;QAAEA,UAAUW,IAAIX,QAAQ;IAAC,IAAI,CAAC,GAC7CW,IAAIV,MAAM,GAAG;QAAEA,QAAQU,IAAIV,MAAM;IAAC,IAAI,CAAC;AAE/C;AAEA,uEAAuE,GACvE,OAAO,SAASW,eAAetB,IAAgB,EAAER,QAA2B;IAC1E,MAAM+B,QAAQxB,eAAeC,MAAMR;IACnC,IAAI,CAAC+B,OAAO;QACV,mEAAmE;QACnE,sEAAsE;QACtE,MAAM,IAAIC,MAAM;IAClB;IACA,OAAOD,MAAMjB,KAAK;AACpB"}