@theokit/sdk 4.53.0 → 4.54.0

package/dist/{chunk-ADVZIC43.cjs → chunk-EI2Q7SJ5.cjs}

@@ -1,9 +1,9 @@
 'use strict';
 
-var chunkE3OCRJU6_cjs = require('./chunk-E3OCRJU6.cjs');
-var chunk2RW7K6FN_cjs = require('./chunk-2RW7K6FN.cjs');
-var chunkKNZU4YO5_cjs = require('./chunk-KNZU4YO5.cjs');
-var chunk2YGIBOUH_cjs = require('./chunk-2YGIBOUH.cjs');
+var chunkGHX4P3V2_cjs = require('./chunk-GHX4P3V2.cjs');
+var chunkDQKERTND_cjs = require('./chunk-DQKERTND.cjs');
+var chunkILCGLTSA_cjs = require('./chunk-ILCGLTSA.cjs');
+var chunkK3FW2XZD_cjs = require('./chunk-K3FW2XZD.cjs');
 var crypto = require('crypto');
 
 var MAX_BATCH = 100;
@@ -12,17 +12,17 @@ async function createOpenAiCompatibleRuntime(cfg, options) {
   const model = options.model ?? cfg.defaultModel;
   const apiKey = options.apiKey ?? process.env[cfg.apiKeyEnv];
   if (apiKey === void 0 || apiKey.length === 0) {
-    throw new chunk2YGIBOUH_cjs.AuthenticationError(`${cfg.apiKeyEnv} missing`, {
+    throw new chunkK3FW2XZD_cjs.AuthenticationError(`${cfg.apiKeyEnv} missing`, {
       code: "embedding_missing_api_key"
     });
   }
   const envBaseUrl = cfg.baseUrlEnv !== void 0 ? process.env[cfg.baseUrlEnv] : void 0;
   const baseUrl = options.baseUrl ?? envBaseUrl ?? cfg.defaultBaseUrl;
   const fetchImpl = options.fetch ?? fetch;
-  const cache = options.cache ?? chunk2RW7K6FN_cjs.globalEmbeddingCache;
+  const cache = options.cache ?? chunkGHX4P3V2_cjs.globalEmbeddingCache;
   const dimension = cfg.dimensionByModel[model];
   if (dimension === void 0) {
-    throw new chunk2YGIBOUH_cjs.ConfigurationError(
+    throw new chunkK3FW2XZD_cjs.ConfigurationError(
       `${cfg.id} adapter: model "${model}" is not in the dimension table. Use one of: ${Object.keys(cfg.dimensionByModel).join(", ")}. To add it, update dimensionByModel in the adapter source.`,
       { code: "embedding_unknown_model" }
     );
@@ -97,7 +97,7 @@ async function embedInBoundedBatches(input, pending, results) {
   for (let offset = 0; offset < pending.length; offset += MAX_BATCH) {
     batches.push(pending.slice(offset, offset + MAX_BATCH));
   }
-  await chunkKNZU4YO5_cjs.mapWithConcurrency(
+  await chunkILCGLTSA_cjs.mapWithConcurrency(
     batches,
     MAX_CONCURRENT_BATCHES,
     (batch) => processBatch(input, batch, results)
@@ -143,7 +143,7 @@ async function embedBatch(opts) {
       body = JSON.parse(text);
     } catch {
     }
-    throw chunkE3OCRJU6_cjs.mapOpenAICompatibleError({
+    throw chunkDQKERTND_cjs.mapOpenAICompatibleError({
       providerId: opts.providerId,
       status: response.status,
       body,
@@ -169,7 +169,7 @@ async function parseEmbedResponse(response, providerId, endpoint, dialect) {
   const viaDialect = dialect?.vectors?.(json);
   if (viaDialect !== void 0) return viaDialect;
   if (!Array.isArray(json.data)) {
-    throw new chunk2YGIBOUH_cjs.NetworkError(`${providerId} ${endpoint} returned no data`, {
+    throw new chunkK3FW2XZD_cjs.NetworkError(`${providerId} ${endpoint} returned no data`, {
       code: "embedding_invalid_response",
       metadata: {
         provider: providerId,
@@ -195,5 +195,5 @@ function sleep(ms) {
 }
 
 exports.createOpenAiCompatibleRuntime = createOpenAiCompatibleRuntime;
-//# sourceMappingURL=chunk-ADVZIC43.cjs.map
-//# sourceMappingURL=chunk-ADVZIC43.cjs.map
+//# sourceMappingURL=chunk-EI2Q7SJ5.cjs.map
+//# sourceMappingURL=chunk-EI2Q7SJ5.cjs.map

package/dist/chunk-EI2Q7SJ5.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/internal/memory/adapters/openai-compatible.ts"],"names":["AuthenticationError","globalEmbeddingCache","ConfigurationError","mapWithConcurrency","mapOpenAICompatibleError","NetworkError","createHash"],"mappings":";;;;;;;;AAsBA,IAAM,SAAA,GAAY,GAAA;AAClB,IAAM,WAAA,GAAc,CAAA;AAkGpB,eAAsB,6BAAA,CACpB,KACA,OAAA,EAC2B;AAC3B,EAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,IAAS,GAAA,CAAI,YAAA;AACnC,EAAA,MAAM,SAAS,OAAA,CAAQ,MAAA,IAAU,OAAA,CAAQ,GAAA,CAAI,IAAI,SAAS,CAAA;AAC1D,EAAA,IAAI,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,MAAA,KAAW,CAAA,EAAG;AAC/C,IAAA,MAAM,IAAIA,qCAAA,CAAoB,CAAA,EAAG,GAAA,CAAI,SAAS,CAAA,QAAA,CAAA,EAAY;AAAA,MACxD,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AACA,EAAA,MAAM,UAAA,GAAa,IAAI,UAAA,KAAe,MAAA,GAAY,QAAQ,GAAA,CAAI,GAAA,CAAI,UAAU,CAAA,GAAI,MAAA;AAChF,EAAA,MAAM,OAAA,GAAU,OAAA,CAAQ,OAAA,IAAW,UAAA,IAAc,GAAA,CAAI,cAAA;AACrD,EAAA,MAAM,SAAA,GAAY,QAAQ,KAAA,IAAS,KAAA;AAEnC,EAAA,MAAM,KAAA,GAAQ,QAAQ,KAAA,IAASC,sCAAA;AAE/B,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,gBAAA,CAAiB,KAAK,CAAA;AAC5C,EAAA,IAAI,cAAc,MAAA,EAAW;AAC3B,IAAA,MAAM,IAAIC,oCAAA;AAAA,MACR,CAAA,EAAG,GAAA,CAAI,EAAE,CAAA,iBAAA,EAAoB,KAAK,CAAA,6CAAA,EAAgD,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,gBAAgB,CAAA,CAAE,IAAA,CAAK,IAAI,CAAC,CAAA,2DAAA,CAAA;AAAA,MAC9H,EAAE,MAAM,yBAAA;AAA0B,KACpC;AAAA,EACF;AAKA,EAAA,MAAM,cAAA,GAAA,CAAkB,GAAA,CAAI,cAAA,IAAkB,gBAAA,EAAkB,OAAA;AAAA,IAC9D,SAAA;AAAA,IACA,mBAAmB,KAAK;AAAA,GAC1B;AAEA,EAAA,MAAM,KAAA,GAA+B;AAAA,IACnC,SAAA,EAAW,CAAA;AAAA,IACX,WAAA,EAAa,CAAA;AAAA,IACb,SAAA,EAAW,CAAA;AAAA,IACX,OAAA,EAAS;AAAA,GACX;AAEA,EAAA,OAAO;AAAA,IACL,IAAI,GAAA,CAAI,EAAA;AAAA,IACR,KAAA;AAAA,IACA,SAAA;AAAA,IACA,KAAA,EAAO,OAAO,EAAE,GAAG,KAAA,EAAM,CAAA;AAAA,IACzB,KAAA,EAAO,CAAC,KAAA,KACN,UAAA,CAAW;AAAA,MACT,KAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA;AAAA,MACA,SAAA;AAAA,MACA,MAAA;AAAA,MACA,OAAA;AAAA,MACA,cAAA;AAAA,MACA,SAAA;AAAA,MACA,YAAY,GAAA,CAAI,EAAA;AAAA,MAChB,OAAA,EAAS,GAAA,CAAI,OAAA,IAAW;AAAC,KAC1B;AAAA,GACL;AACF;AAgBA,eAAe,WAAW,KAAA,EAA6C;AACrE,EAAA,MAAM,EAAE,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,KAAA,EAAO,WAAU,GAAI,KAAA;AAClD,EAAA,MAAM,OAAA,GAAU,IAAI,KAAA,CAA4B,KAAA,CAAM,MAAM,CAAA;AAC5D,EAAA,MAAM,UAA+D,EAAC;AACtE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,aAAA,CAAc;AAAA,MACZ,KAAA,EAAO,CAAA;AAAA,MACP,IAAA,EAAM,KAAA,CAAM,CAAC,CAAA,IAAK,EAAA;AAAA,MAClB,KAAA;AAAA,MACA,SAAA;AAAA,MACA,KAAA;AAAA,MACA,KAAA;AAAA,MACA,OAAA;AAAA,MACA;AAAA,KACD,CAAA;AAAA,EACH;AACA,EAAA,MAAM,qBAAA,CAAsB,KAAA,EAAO,OAAA,EAAS,OAAO,CAAA;AACnD,EAAA,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,IAAK,IAAI,KAAA,CAAM,SAAS,CAAA,CAAE,IAAA,CAAK,CAAC,CAAC,CAAA;AAC7D;AAaA,SAAS,cAAc,IAAA,EAA+B;AACpD,EAAA,IAAI,IAAA,CAAK,IAAA,CAAK,IAAA,EAAK,CAAE,WAAW,CAAA,EAAG;AACjC,IAAA,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA,GAAI,IAAI,MAAM,IAAA,CAAK,SAAS,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA;AAC3D,IAAA;AAAA,EACF;AACA,EAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,IAAA,CAAK,KAAA,EAAO,KAAK,IAAI,CAAA;AACzC,EAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAG,CAAA;AACjC,EAAA,IAAI,WAAW,MAAA,EAAW;AACxB,IAAA,IAAA,CAAK,MAAM,SAAA,IAAa,CAAA;AACxB,IAAA,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA,GAAI,MAAA;AAC3B,IAAA;AAAA,EACF;AACA,EAAA,IAAA,CAAK,MAAM,WAAA,IAAe,CAAA;AAC1B,EAAA,IAAA,CAAK,OAAA,CAAQ,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,CAAK,OAAO,IAAA,EAAM,IAAA,CAAK,IAAA,EAAM,GAAA,EAAK,CAAA;AAC/D;AAKA,IAAM,sBAAA,GAAyB,CAAA;AAY/B,eAAe,qBAAA,CACb,KAAA,EACA,OAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,UAA8E,EAAC;AACrF,EAAA,KAAA,IAAS,SAAS,CAAA,EAAG,MAAA,GAAS,OAAA,CAAQ,MAAA,EAAQ,UAAU,SAAA,EAAW;AACjE,IAAA,OAAA,CAAQ,KAAK,OAAA,CAAQ,KAAA,CAAM,MAAA,EAAQ,MAAA,GAAS,SAAS,CAAC,CAAA;AAAA,EACxD;AAGA,EAAA,MAAMC,oCAAA;AAAA,IAAmB,OAAA;AAAA,IAAS,sBAAA;AAAA,IAAwB,CAAC,KAAA,KACzD,YAAA,CAAa,KAAA,EAAO,OAAO,OAAO;AAAA,GACpC;AACF;AAEA,eAAe,YAAA,CACb,KAAA,EACA,KAAA,EACA,OAAA,EACe;AACf,EAAA,MAAM,OAAA,GAAU,MAAM,UAAA,CAAW;AAAA,IAC/B,QAAQ,KAAA,CAAM,MAAA;AAAA,IACd,SAAS,KAAA,CAAM,OAAA;AAAA,IACf,gBAAgB,KAAA,CAAM,cAAA;AAAA,IACtB,OAAO,KAAA,CAAM,KAAA;AAAA,IACb,QAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AAAA,IAC/B,WAAW,KAAA,CAAM,SAAA;AAAA,IACjB,OAAO,KAAA,CAAM,KAAA;AAAA,IACb,YAAY,KAAA,CAAM,UAAA;AAAA,IAClB,SAAS,KAAA,CAAM;AAAA,GAChB,CAAA;AACD,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,MAAM,CAAC,CAAA;AACpB,IAAA,MAAM,MAAA,GAAS,QAAQ,CAAC,CAAA;AACxB,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,MAAA,KAAW,MAAA,EAAW;AAChD,IAAA,OAAA,CAAQ,IAAA,CAAK,KAAK,CAAA,GAAI,MAAA;AACtB,IAAA,KAAA,CAAM,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,GAAA,EAAK,MAAM,CAAA;AAAA,EAClC;AACF;AAcA,eAAe,WAAW,IAAA,EAAyC;AAEjE,EAAA,MAAM,GAAA,GAAM,CAAA,EAAG,IAAA,CAAK,OAAA,CAAQ,OAAA,CAAQ,OAAO,EAAE,CAAC,CAAA,EAAG,IAAA,CAAK,cAAc,CAAA,CAAA;AACpE,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,OAAO,IAAA,EAAM;AACX,IAAA,IAAA,CAAK,MAAM,SAAA,IAAa,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,MAAM,gBAAA,CAAiB,IAAA,EAAM,GAAG,CAAA;AACjD,IAAA,IAAI,QAAA,CAAS,EAAA;AACX,MAAA,OAAO,MAAM,mBAAmB,QAAA,EAAU,IAAA,CAAK,YAAY,IAAA,CAAK,cAAA,EAAgB,KAAK,OAAO,CAAA;AAC9F,IAAA,IAAI,WAAA,CAAY,QAAA,CAAS,MAAM,CAAA,IAAK,UAAU,WAAA,EAAa;AACzD,MAAA,OAAA,IAAW,CAAA;AACX,MAAA,IAAA,CAAK,MAAM,OAAA,IAAW,CAAA;AACtB,MAAA,MAAM,KAAA,CAAM,eAAA,CAAgB,OAAO,CAAC,CAAA;AACpC,MAAA;AAAA,IACF;AAEA,IAAA,MAAM,OAAO,MAAM,QAAA,CAAS,MAAK,CAAE,KAAA,CAAM,MAAM,EAAE,CAAA;AACjD,IAAA,IAAI,IAAA,GAAgB,IAAA;AACpB,IAAA,IAAI;AACF,MAAA,IAAA,GAAO,IAAA,CAAK,MAAM,IAAI,CAAA;AAAA,IACxB,CAAA,CAAA,MAAQ;AAAA,IAER;AACA,IAAA,MAAMC,0CAAA,CAAyB;AAAA,MAC7B,YAAY,IAAA,CAAK,UAAA;AAAA,MACjB,QAAQ,QAAA,CAAS,MAAA;AAAA,MACjB,IAAA;AAAA,MACA,SAAS,QAAA,CAAS,OAAA;AAAA,MAClB,UAAU,IAAA,CAAK;AAAA,KAChB,CAAA;AAAA,EACH;AACF;AAEA,eAAe,gBAAA,CAAiB,MAAoB,GAAA,EAAgC;AAClF,EAAA,OAAO,IAAA,CAAK,UAAU,GAAA,EAAK;AAAA,IACzB,MAAA,EAAQ,MAAA;AAAA,IACR,OAAA,EAAS;AAAA,MACP,cAAA,EAAgB,kBAAA;AAAA,MAChB,GAAI,IAAA,CAAK,OAAA,CAAQ,WAAA,GAAc,IAAA,CAAK,MAAM,CAAA,IAAK,EAAE,aAAA,EAAe,CAAA,OAAA,EAAU,IAAA,CAAK,MAAM,CAAA,CAAA;AAAG,KAC1F;AAAA,IACA,MAAM,IAAA,CAAK,SAAA;AAAA,MACT,IAAA,CAAK,OAAA,CAAQ,IAAA,GAAO,IAAA,CAAK,OAAO,IAAA,CAAK,MAAM,CAAA,IAAK,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,KAAA,EAAO,KAAK,MAAA;AAAO;AAC1F,GACD,CAAA;AACH;AAEA,eAAe,kBAAA,CACb,QAAA,EACA,UAAA,EACA,QAAA,EACA,OAAA,EACqB;AACrB,EAAA,MAAM,IAAA,GAAQ,MAAM,QAAA,CAAS,IAAA,EAAK;AAElC,EAAA,MAAM,UAAA,GAAa,OAAA,EAAS,OAAA,GAAU,IAAI,CAAA;AAC1C,EAAA,IAAI,UAAA,KAAe,QAAW,OAAO,UAAA;AACrC,EAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,EAAG;AAC7B,IAAA,MAAM,IAAIC,8BAAA,CAAa,CAAA,EAAG,UAAU,CAAA,CAAA,EAAI,QAAQ,CAAA,iBAAA,CAAA,EAAqB;AAAA,MACnE,IAAA,EAAM,4BAAA;AAAA,MACN,QAAA,EAAU;AAAA,QACR,QAAA,EAAU,UAAA;AAAA,QACV,QAAA;AAAA,QACA,IAAA,EAAM,iBAAA;AAAA,QACN,GAAA,EAAK;AAAA;AACP,KACD,CAAA;AAAA,EACH;AACA,EAAA,OAAO,KAAK,IAAA,CAAK,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,SAAS,CAAA;AACzC;AAEA,SAAS,YAAY,MAAA,EAAyB;AAC5C,EAAA,OAAO,MAAA,KAAW,GAAA,IAAQ,MAAA,IAAU,GAAA,IAAO,MAAA,GAAS,GAAA;AACtD;AAEA,SAAS,OAAA,CAAQ,OAAe,IAAA,EAAsB;AACpD,EAAA,OAAOC,iBAAA,CAAW,QAAQ,CAAA,CAAE,MAAA,CAAO,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,IAAI,CAAA,CAAE,CAAA,CAAE,MAAA,CAAO,KAAK,CAAA;AACrE;AAEA,SAAS,gBAAgB,OAAA,EAAyB;AAChD,EAAA,OAAO,EAAA,GAAK,OAAA;AACd;AAEA,SAAS,MAAM,EAAA,EAA2B;AACxC,EAAA,OAAO,IAAI,OAAA,CAAQ,CAAC,YAAY,UAAA,CAAW,OAAA,EAAS,EAAE,CAAC,CAAA;AACzD","file":"chunk-EI2Q7SJ5.cjs","sourcesContent":["import { createHash } from \"node:crypto\";\n\nimport { AuthenticationError, ConfigurationError, NetworkError } from \"../../../errors.js\";\nimport { mapOpenAICompatibleError } from \"../../error-mappers/openai-compatible.js\";\nimport { mapWithConcurrency } from \"../../runtime/concurrency/map-with-concurrency.js\";\nimport type {\n  CreateAdapterOptions,\n  EmbeddingRuntime,\n  EmbeddingRuntimeStats,\n} from \"../embedding-adapter.js\";\nimport { globalEmbeddingCache } from \"../embedding-cache.js\";\n\n/**\n * Shared factory for OpenAI-compatible embedding providers (OpenAI, Mistral,\n * DeepInfra, and anything else exposing `POST /v1/embeddings` with the\n * `{ model, input }` request shape and `{ data: [{ embedding }] }` response).\n *\n * Mirrors the inner mechanics of peer-project's batch embedding runtime.\n *\n * @internal\n */\n\nconst MAX_BATCH = 100;\nconst MAX_RETRIES = 2;\n\n/**\n * What one provider adapter tells {@link createOpenAiCompatibleRuntime} about\n * its wire: where to POST, which environment variables carry the key and the\n * base URL, which model to use by default, and how wide each model's vectors\n * are.\n *\n * `id` is the provider id that ends up on errors and on\n * `EmbeddingRuntime.id`, and is also the identity the SQLite vector index stores\n * — changing it invalidates the vectors already on disk.\n *\n * `apiKeyEnv` is required, `baseUrlEnv` is not: a provider that declares no\n * base-URL variable can only be redirected by passing `baseUrl` explicitly.\n * Leave `dialect` unset for anything that speaks the OpenAI embedding wire.\n */\nexport interface OpenAiCompatibleConfig {\n  id: string;\n  defaultBaseUrl: string;\n  apiKeyEnv: string;\n  baseUrlEnv?: string;\n  defaultModel: string;\n  /**\n   * Dimension hint by model id. The chosen model MUST be in this table —\n   * unknown models throw `ConfigurationError(code: \"embedding_unknown_model\")`\n   * (EC-4 fix). This prevents vec0 virtual-table dimension mismatches that\n   * surface as cryptic errors downstream.\n   */\n  dimensionByModel: Record<string, number>;\n  /**\n   * Path component appended to `baseUrl` for the embeddings endpoint.\n   * Default `\"/v1/embeddings\"` (OpenAI canonical). REPLACES the default —\n   * does NOT concatenate. Used by DeepInfra (`\"/v1/openai/embeddings\"`),\n   * etc. (EC-2 fix).\n   */\n  embeddingsPath?: string;\n  /**\n   * theokit#159 — per-provider deviations from the OpenAI wire.\n   *\n   * The runtime was rigidly OpenAI-shaped: one auth header, one body, one response shape. Three of\n   * the ten catalog providers do not speak it, so every call they made was rejected — Azure\n   * authenticates with an `api-key` header and puts the deployment in the path, Cohere's `/v2/embed`\n   * takes `texts` and answers `{embeddings:{float}}`. Advertising a provider that cannot work is\n   * worse than not advertising it.\n   *\n   * Every hook is optional and its default is exactly the previous behaviour, so the seven\n   * providers that DO speak OpenAI are untouched.\n   */\n  dialect?: EmbeddingDialect;\n}\n\n/**\n * theokit#159 — the three points where a provider may deviate from the OpenAI embedding wire.\n *\n * Deliberately three narrow hooks rather than a general \"transform the request\" seam: these are the\n * only axes on which the supported providers actually differ, and a wider seam would invite\n * per-provider logic that belongs in the adapter.\n */\nexport interface EmbeddingDialect {\n  /** Replaces `authorization: Bearer <key>`. */\n  authHeaders?: (apiKey: string) => Record<string, string>;\n  /** Replaces the `{ model, input }` request body. */\n  body?: (model: string, inputs: ReadonlyArray<string>) => Record<string, unknown>;\n  /** Replaces reading vectors from `json.data[].embedding`. Return `undefined` when unparseable. */\n  vectors?: (json: unknown) => number[][] | undefined;\n}\n\n/**\n * Build an {@link EmbeddingRuntime} for a provider that speaks the OpenAI\n * embedding wire — or, through `cfg.dialect`, one that deviates from it in a\n * known way. Every adapter in the memory catalog is a thin call to this.\n *\n * Resolution order for each setting is explicit option, then environment\n * variable, then the config default. Two things are checked before any request\n * is sent, so a misconfiguration fails at creation rather than at first search:\n * a missing or empty key rejects with an `AuthenticationError` carrying\n * `embedding_missing_api_key`, and a model absent from `dimensionByModel`\n * rejects with a `ConfigurationError` carrying `embedding_unknown_model`. The\n * second check exists because the vector index is created at a fixed width — an\n * unknown dimension would surface much later as a vec0 mismatch.\n *\n * `{model}` in `embeddingsPath` is replaced with the URL-encoded model, which is\n * how Azure addresses a deployment in the path. `embeddingsPath` replaces the\n * default `/v1/embeddings` rather than being appended to it.\n *\n * The returned `embed` batches at 100 texts per request and runs at most 3\n * requests concurrently, preserving input order. Whitespace-only inputs never\n * reach the network and come back as an all-zero vector. Results are cached by\n * model and text; the cache defaults to a process-wide LRU of 5000 entries, so\n * pass `options.cache` when runtimes must not share entries.\n *\n * Failed requests retry up to twice on 429 and 5xx with a 50ms-per-attempt\n * linear backoff. Anything else, and a retry budget that runs out, throws the\n * typed error the OpenAI-compatible mapper builds from the status and body. A\n * response that parses but carries no vectors throws a `NetworkError` with\n * `embedding_invalid_response`. There is no request timeout here — cancellation\n * is the caller's to impose.\n */\nexport async function createOpenAiCompatibleRuntime(\n  cfg: OpenAiCompatibleConfig,\n  options: CreateAdapterOptions,\n): Promise<EmbeddingRuntime> {\n  const model = options.model ?? cfg.defaultModel;\n  const apiKey = options.apiKey ?? process.env[cfg.apiKeyEnv];\n  if (apiKey === undefined || apiKey.length === 0) {\n    throw new AuthenticationError(`${cfg.apiKeyEnv} missing`, {\n      code: \"embedding_missing_api_key\",\n    });\n  }\n  const envBaseUrl = cfg.baseUrlEnv !== undefined ? process.env[cfg.baseUrlEnv] : undefined;\n  const baseUrl = options.baseUrl ?? envBaseUrl ?? cfg.defaultBaseUrl;\n  const fetchImpl = options.fetch ?? fetch;\n  // T4.4 — default to process-wide singleton (was per-adapter instance).\n  const cache = options.cache ?? globalEmbeddingCache;\n  // EC-4: refuse unknown models to prevent vec0 dimension mismatches downstream.\n  const dimension = cfg.dimensionByModel[model];\n  if (dimension === undefined) {\n    throw new ConfigurationError(\n      `${cfg.id} adapter: model \"${model}\" is not in the dimension table. Use one of: ${Object.keys(cfg.dimensionByModel).join(\", \")}. To add it, update dimensionByModel in the adapter source.`,\n      { code: \"embedding_unknown_model\" },\n    );\n  }\n  // theokit#128: `{model}` is substituted, because Azure OpenAI addresses the deployment IN THE\n  // PATH (`/openai/deployments/{model}/embeddings`) rather than in the body. Without this the URL\n  // carried the literal placeholder and every Azure request 404'd. A path with no placeholder —\n  // every other provider — is passed through untouched.\n  const embeddingsPath = (cfg.embeddingsPath ?? \"/v1/embeddings\").replace(\n    \"{model}\",\n    encodeURIComponent(model),\n  );\n\n  const stats: EmbeddingRuntimeStats = {\n    cacheHits: 0,\n    cacheMisses: 0,\n    httpCalls: 0,\n    retries: 0,\n  };\n\n  return {\n    id: cfg.id,\n    model,\n    dimension,\n    stats: () => ({ ...stats }),\n    embed: (texts) =>\n      embedTexts({\n        texts,\n        cache,\n        stats,\n        model,\n        dimension,\n        apiKey,\n        baseUrl,\n        embeddingsPath,\n        fetchImpl,\n        providerId: cfg.id,\n        dialect: cfg.dialect ?? {},\n      }),\n  };\n}\n\ninterface EmbedTextsInput {\n  texts: ReadonlyArray<string>;\n  cache: NonNullable<CreateAdapterOptions[\"cache\"]>;\n  stats: EmbeddingRuntimeStats;\n  model: string;\n  dimension: number;\n  apiKey: string;\n  baseUrl: string;\n  embeddingsPath: string;\n  fetchImpl: typeof fetch;\n  providerId: string;\n  dialect: EmbeddingDialect;\n}\n\nasync function embedTexts(input: EmbedTextsInput): Promise<number[][]> {\n  const { texts, cache, stats, model, dimension } = input;\n  const results = new Array<number[] | undefined>(texts.length);\n  const pending: Array<{ index: number; text: string; key: string }> = [];\n  for (let i = 0; i < texts.length; i++) {\n    classifyEntry({\n      index: i,\n      text: texts[i] ?? \"\",\n      model,\n      dimension,\n      cache,\n      stats,\n      results,\n      pending,\n    });\n  }\n  await embedInBoundedBatches(input, pending, results);\n  return results.map((v) => v ?? new Array(dimension).fill(0));\n}\n\ninterface ClassifyEntryArgs {\n  index: number;\n  text: string;\n  model: string;\n  dimension: number;\n  cache: NonNullable<CreateAdapterOptions[\"cache\"]>;\n  stats: EmbeddingRuntimeStats;\n  results: Array<number[] | undefined>;\n  pending: Array<{ index: number; text: string; key: string }>;\n}\n\nfunction classifyEntry(args: ClassifyEntryArgs): void {\n  if (args.text.trim().length === 0) {\n    args.results[args.index] = new Array(args.dimension).fill(0);\n    return;\n  }\n  const key = hashKey(args.model, args.text);\n  const cached = args.cache.get(key);\n  if (cached !== undefined) {\n    args.stats.cacheHits += 1;\n    args.results[args.index] = cached;\n    return;\n  }\n  args.stats.cacheMisses += 1;\n  args.pending.push({ index: args.index, text: args.text, key });\n}\n\n// T4.3 — max concurrent embedding API requests per embed() call.\n// 3 is enough to saturate most embedding APIs without triggering\n// rate limits (each batch is already up to MAX_BATCH=100 texts).\nconst MAX_CONCURRENT_BATCHES = 3;\n\n/**\n * T4.3 — parallel embed batches (DR4 finding #3).\n *\n * Pre-T4.3 this was a serial `for` loop — each batch of 100 texts\n * awaited before the next HTTP request started. With 500 texts the\n * serial path took 5 × RTT; parallel takes max(RTT) × ceil(5/3).\n *\n * Uses bounded-concurrency `Promise.all` capped at 3 concurrent\n * HTTP requests to avoid overwhelming the embedding API.\n */\nasync function embedInBoundedBatches(\n  input: EmbedTextsInput,\n  pending: ReadonlyArray<{ index: number; text: string; key: string }>,\n  results: Array<number[] | undefined>,\n): Promise<void> {\n  const batches: Array<ReadonlyArray<{ index: number; text: string; key: string }>> = [];\n  for (let offset = 0; offset < pending.length; offset += MAX_BATCH) {\n    batches.push(pending.slice(offset, offset + MAX_BATCH));\n  }\n  // M0-2: bounded parallel via the shared ordered pool (was an inline\n  // acquire/release clone — see plan m0-foundation-expose-primitives).\n  await mapWithConcurrency(batches, MAX_CONCURRENT_BATCHES, (batch) =>\n    processBatch(input, batch, results),\n  );\n}\n\nasync function processBatch(\n  input: EmbedTextsInput,\n  batch: ReadonlyArray<{ index: number; text: string; key: string }>,\n  results: Array<number[] | undefined>,\n): Promise<void> {\n  const vectors = await embedBatch({\n    apiKey: input.apiKey,\n    baseUrl: input.baseUrl,\n    embeddingsPath: input.embeddingsPath,\n    model: input.model,\n    inputs: batch.map((b) => b.text),\n    fetchImpl: input.fetchImpl,\n    stats: input.stats,\n    providerId: input.providerId,\n    dialect: input.dialect,\n  });\n  for (let j = 0; j < batch.length; j++) {\n    const slot = batch[j];\n    const vector = vectors[j];\n    if (slot === undefined || vector === undefined) continue;\n    results[slot.index] = vector;\n    input.cache.set(slot.key, vector);\n  }\n}\n\ninterface BatchOptions {\n  apiKey: string;\n  baseUrl: string;\n  embeddingsPath: string;\n  model: string;\n  inputs: ReadonlyArray<string>;\n  fetchImpl: typeof fetch;\n  stats: EmbeddingRuntimeStats;\n  providerId: string;\n  dialect: EmbeddingDialect;\n}\n\nasync function embedBatch(opts: BatchOptions): Promise<number[][]> {\n  // EC-2: embeddingsPath REPLACES the suffix; never concatenates.\n  const url = `${opts.baseUrl.replace(/\\/$/, \"\")}${opts.embeddingsPath}`;\n  let attempt = 0;\n  while (true) {\n    opts.stats.httpCalls += 1;\n    const response = await postEmbedRequest(opts, url);\n    if (response.ok)\n      return await parseEmbedResponse(response, opts.providerId, opts.embeddingsPath, opts.dialect);\n    if (isRetryable(response.status) && attempt < MAX_RETRIES) {\n      attempt += 1;\n      opts.stats.retries += 1;\n      await sleep(linearBackoffMs(attempt));\n      continue;\n    }\n    // Read body (best-effort) so the mapper has access to provider error code.\n    const text = await response.text().catch(() => \"\");\n    let body: unknown = text;\n    try {\n      body = JSON.parse(text);\n    } catch {\n      // not JSON — keep as string\n    }\n    throw mapOpenAICompatibleError({\n      providerId: opts.providerId,\n      status: response.status,\n      body,\n      headers: response.headers,\n      endpoint: opts.embeddingsPath,\n    });\n  }\n}\n\nasync function postEmbedRequest(opts: BatchOptions, url: string): Promise<Response> {\n  return opts.fetchImpl(url, {\n    method: \"POST\",\n    headers: {\n      \"content-type\": \"application/json\",\n      ...(opts.dialect.authHeaders?.(opts.apiKey) ?? { authorization: `Bearer ${opts.apiKey}` }),\n    },\n    body: JSON.stringify(\n      opts.dialect.body?.(opts.model, opts.inputs) ?? { model: opts.model, input: opts.inputs },\n    ),\n  });\n}\n\nasync function parseEmbedResponse(\n  response: Response,\n  providerId: string,\n  endpoint: string,\n  dialect?: EmbeddingDialect,\n): Promise<number[][]> {\n  const json = (await response.json()) as { data?: Array<{ embedding: number[] }> };\n  // theokit#159 — a provider whose response is not OpenAI-shaped supplies its own reader.\n  const viaDialect = dialect?.vectors?.(json);\n  if (viaDialect !== undefined) return viaDialect;\n  if (!Array.isArray(json.data)) {\n    throw new NetworkError(`${providerId} ${endpoint} returned no data`, {\n      code: \"embedding_invalid_response\",\n      metadata: {\n        provider: providerId,\n        endpoint,\n        code: \"invalid_request\",\n        raw: json,\n      },\n    });\n  }\n  return json.data.map((d) => d.embedding);\n}\n\nfunction isRetryable(status: number): boolean {\n  return status === 429 || (status >= 500 && status < 600);\n}\n\nfunction hashKey(model: string, text: string): string {\n  return createHash(\"sha256\").update(`${model} ${text}`).digest(\"hex\");\n}\n\nfunction linearBackoffMs(attempt: number): number {\n  return 50 * attempt;\n}\n\nfunction sleep(ms: number): Promise<void> {\n  return new Promise((resolve) => setTimeout(resolve, ms));\n}\n"]}

package/dist/{chunk-UCFONJBG.js → chunk-EPSICJLZ.js}

@@ -75,5 +75,5 @@ async function runToCompletionImpl(agent, message, options) {
 }
 
 export { DEFAULT_CONTINUATION_PROMPT, DEFAULT_MAX_ROUNDS, addUsage, buildResult, classifyRound, continuationTail, isEmptyRound, promptForRound, resolveContinuation, runToCompletionImpl };
-//# sourceMappingURL=chunk-UCFONJBG.js.map
-//# sourceMappingURL=chunk-UCFONJBG.js.map
+//# sourceMappingURL=chunk-EPSICJLZ.js.map
+//# sourceMappingURL=chunk-EPSICJLZ.js.map

package/dist/{chunk-UCFONJBG.js.map → chunk-EPSICJLZ.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/internal/runtime/lifecycle/run-to-completion.ts"],"names":[],"mappings":";AA+BO,IAAM,kBAAA,GAAqB;AAE3B,IAAM,2BAAA,GACX;AAQK,SAAS,aAAa,MAAA,EAA4B;AACvD,EAAA,OAAA,CAAQ,MAAA,CAAO,MAAA,IAAU,EAAA,EAAI,IAAA,EAAK,KAAM,EAAA;AAC1C;AASO,SAAS,aAAA,CACd,MAAA,EACA,KAAA,EACA,SAAA,EACA,WAAA,EACe;AAIf,EAAA,IAAI,MAAA,CAAO,iBAAA,KAAsB,IAAA,EAAM,OAAO,aAAA;AAC9C,EAAA,IAAI,MAAA,CAAO,uBAAA,KAA4B,IAAA,EAAM,OAAO,MAAA;AAEpD,EAAA,IAAI,YAAA,CAAa,MAAM,CAAA,IAAK,WAAA,IAAe,GAAG,OAAO,aAAA;AACrD,EAAA,IAAI,KAAA,IAAS,WAAW,OAAO,YAAA;AAC/B,EAAA,OAAO,UAAA;AACT;AAWO,SAAS,QAAA,CACd,KACA,CAAA,EACwB;AACxB,EAAA,IAAI,CAAA,KAAM,QAAW,OAAO,GAAA;AAC5B,EAAA,MAAM,WAAA,GAAA,CAAe,GAAA,EAAK,WAAA,IAAe,CAAA,IAAK,CAAA,CAAE,WAAA;AAChD,EAAA,MAAM,YAAA,GAAA,CAAgB,GAAA,EAAK,YAAA,IAAgB,CAAA,IAAK,CAAA,CAAE,YAAA;AAClD,EAAA,MAAM,MAAA,GAAS,CAAC,CAAA,EAAuB,CAAA,KACrC,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,MAAA,GAAY,MAAA,GAAA,CAAa,CAAA,IAAK,CAAA,KAAM,CAAA,IAAK,CAAA,CAAA;AACpE,EAAA,OAAO;AAAA,IACL,WAAA;AAAA,IACA,YAAA;AAAA,IACA,aAAa,WAAA,GAAc,YAAA;AAAA,IAC3B,eAAA,EAAiB,MAAA,CAAO,GAAA,EAAK,eAAA,EAAiB,EAAE,eAAe,CAAA;AAAA,IAC/D,gBAAA,EAAkB,MAAA,CAAO,GAAA,EAAK,gBAAA,EAAkB,EAAE,gBAAgB,CAAA;AAAA,IAClE,eAAA,EAAiB,MAAA,CAAO,GAAA,EAAK,eAAA,EAAiB,EAAE,eAAe;AAAA,GACjE;AACF;AAMO,SAAS,WAAA,CACd,QAAA,EACA,MAAA,EACA,UAAA,EACA,KAAA,EACuB;AACvB,EAAA,OAAO,EAAE,QAAA,EAAU,MAAA,EAAQ,UAAA,EAAY,GAAI,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAM,GAAI,EAAC,EAAG;AACnF;AASA,eAAsB,gBAAA,CACpB,KAAA,EACA,UAAA,EACA,KAAA,EACA,aACA,MAAA,EAC4C;AAC5C,EAAA,MAAM,WAAA,GAAc,EAAE,KAAA,EAAO,CAAA;AAC7B,EAAA,OAAO,MAAA,EAAQ,YAAY,IAAA,GAAO,WAAA,CAAY,cAAc,KAAA,EAAO,UAAA,EAAY,KAAK,CAAA,GAAI,MAAA;AAC1F;AAsBO,SAAS,oBAAoB,OAAA,EAAwD;AAC1F,EAAA,OAAO;AAAA,IACL,SAAA,EAAW,SAAS,SAAA,IAAa,kBAAA;AAAA,IACjC,kBAAA,EAAoB,SAAS,kBAAA,IAAsB,2BAAA;AAAA,IACnD,aAAa,OAAA,EAAS,WAAA;AAAA,IACtB,QAAQ,OAAA,EAAS,MAAA;AAAA,IACjB,aAAa,OAAA,EAAS,WAAA;AAAA,IACtB,KAAA,EAAO,EAAE,KAAA,EAAO,MAAA,EAAW,aAAa,CAAA;AAAE,GAC5C;AACF;AAGO,SAAS,cAAA,CAAe,KAAA,EAAe,OAAA,EAAiB,kBAAA,EAAoC;AACjG,EAAA,OAAO,KAAA,KAAU,IAAI,OAAA,GAAU,kBAAA;AACjC;AAQA,eAAe,UACb,KAAA,EACA,MAAA,EACA,WAAA,EACA,KAAA,EACA,WACA,KAAA,EACuB;AAGvB,EAAA,MAAM,YAAA,GACJ,KAAA,KAAU,CAAA,GAAI,WAAA,GAAc,EAAE,GAAI,WAAA,IAAe,EAAC,EAAI,MAAA,EAAQ,EAAE,IAAA,EAAM,qBAAoB,EAAE;AAC9F,EAAA,MAAM,GAAA,GAAM,MAAM,KAAA,CAAM,IAAA,CAAK,QAAQ,YAAY,CAAA;AACjD,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,IAAA,EAAK;AAC9B,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,KAAA,EAAO,OAAO,KAAK,CAAA;AAChD,EAAA,MAAM,WAAW,aAAA,CAAc,MAAA,EAAQ,KAAA,EAAO,SAAA,EAAW,MAAM,WAAW,CAAA;AAC1E,EAAA,IAAI,QAAA,KAAa,UAAA,EAAY,OAAO,EAAE,QAAA,EAAU,YAAY,QAAA,EAAU,KAAA,EAAO,MAAA,EAAQ,KAAK,CAAA,EAAE;AAC5F,EAAA,MAAM,cAAc,YAAA,CAAa,MAAM,CAAA,GAAI,KAAA,CAAM,cAAc,CAAA,GAAI,CAAA;AACnE,EAAA,OAAO,EAAE,IAAA,EAAM,EAAE,OAAO,WAAA,EAAY,EAAG,YAAY,MAAA,EAAO;AAC5D;AAOA,eAAsB,mBAAA,CACpB,KAAA,EACA,OAAA,EACA,OAAA,EACgC;AAChC,EAAA,MAAM,GAAA,GAAM,oBAAoB,OAAO,CAAA;AACvC,EAAA,IAAI,QAAQ,GAAA,CAAI,KAAA;AAEhB,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,IAAK,KAAA,IAAS,CAAA,EAAG;AAChC,IAAA,MAAM,MAAA,GAAS,cAAA,CAAe,KAAA,EAAO,OAAA,EAAS,IAAI,kBAAkB,CAAA;AACpE,IAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,KAAA,EAAO,MAAA,EAAQ,IAAI,WAAA,EAAa,KAAA,EAAO,GAAA,CAAI,SAAA,EAAW,KAAK,CAAA;AAC3F,IAAA,IAAI,UAAA,IAAc,OAAA,EAAS,OAAO,OAAA,CAAQ,QAAA;AAG1C,IAAA,KAAA,GAAQ,OAAA,CAAQ,IAAA;AAChB,IAAA,MAAM,UAAU,MAAM,gBAAA;AAAA,MACpB,KAAA;AAAA,MACA,OAAA,CAAQ,UAAA;AAAA,MACR,KAAA,CAAM,KAAA;AAAA,MACN,GAAA,CAAI,WAAA;AAAA,MACJ,GAAA,CAAI;AAAA,KACN;AACA,IAAA,IAAI,OAAA,KAAY,QAAW,OAAO,OAAA;AAAA,EACpC;AACF","file":"chunk-UCFONJBG.js","sourcesContent":["/**\n * `runToCompletion` continuation driver (M1 Phase 3 — plan m1-run-to-completion).\n *\n * Drives repeated `send()`s on a STATEFUL agent until a genuine terminal,\n * consuming the `RunResult.stoppedAtIterationLimit` signal shipped in 2.2.0.\n * The agent's session preserves conversation history across sends, so after a\n * truncated round the driver only re-sends a short continuation prompt (it does\n * NOT reconstruct history). Mirrors the injectable shape of `run-until.ts` and\n * absorbs the outer-loop policy hand-rolled in `theocode/server/lib/agent-loop.ts`.\n *\n * The core is decision-pure + injectable (`agent` is only the `.send` port) so\n * every terminal is unit-testable with a fake send — fixture mode never sets\n * `stoppedAtIterationLimit`, so injection is the only deterministic path.\n *\n * @internal\n */\n\nimport type {\n  RunResult,\n  RunToCompletionOptions,\n  RunToCompletionResult,\n  SendOptions,\n} from \"../../../types/run.js\";\nimport type { TokenUsage } from \"../../../types/usage.js\";\n\n/** Minimal agent port the driver needs — the instance `.send()` surface. */\nexport interface RunToCompletionAgent {\n  send(message: string, options?: SendOptions): Promise<{ wait(): Promise<RunResult> }>;\n}\n\n/** @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4). */\nexport const DEFAULT_MAX_ROUNDS = 5;\n/** @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4). */\nexport const DEFAULT_CONTINUATION_PROMPT =\n  \"Continue from where you left off and finish the task. If it is already complete, give the final answer.\";\n\ntype RoundDecision = \"done\" | \"continue\" | \"step_limit\" | \"no_progress\";\n\n/**\n * True when a round produced no observable output text.\n * @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4).\n */\nexport function isEmptyRound(result: RunResult): boolean {\n  return (result.result ?? \"\").trim() === \"\";\n}\n\n/**\n * Pure decision: given a round's result + position + the running empty streak,\n * decide whether to finish (`done`), keep going (`continue`), or bail\n * (`step_limit` / `no_progress`).\n *\n * @internal\n */\nexport function classifyRound(\n  result: RunResult,\n  round: number,\n  maxRounds: number,\n  emptyStreak: number,\n): RoundDecision {\n  // Doom-loop stop is a genuine terminal (the model repeated identical tool calls) — classify it as\n  // `no_progress` FIRST, before the iteration-limit check, so it is never mistaken for a truncation\n  // to re-send (which would re-trigger the loop). Complements the empty-round `no_progress` below.\n  if (result.stoppedByDoomLoop === true) return \"no_progress\";\n  if (result.stoppedAtIterationLimit !== true) return \"done\";\n  // Truncated at the iteration ceiling.\n  if (isEmptyRound(result) && emptyStreak >= 1) return \"no_progress\";\n  if (round >= maxRounds) return \"step_limit\";\n  return \"continue\";\n}\n\n/**\n * Sum a round's usage into the running aggregate. `requests` is intentionally\n * dropped (concatenating per-run request breakdowns across continuation rounds\n * would falsely imply a single multi-call run). `totalTokens` is DERIVED\n * (`inputTokens + outputTokens`), never summed independently, to preserve the\n * EC-10 invariant (`usage.ts`) at this aggregation boundary even if a provider\n * folded extra buckets into a round's own `totalTokens`.\n */\n/** @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4). */\nexport function addUsage(\n  acc: TokenUsage | undefined,\n  u: TokenUsage | undefined,\n): TokenUsage | undefined {\n  if (u === undefined) return acc;\n  const inputTokens = (acc?.inputTokens ?? 0) + u.inputTokens;\n  const outputTokens = (acc?.outputTokens ?? 0) + u.outputTokens;\n  const sumOpt = (a: number | undefined, b: number | undefined): number | undefined =>\n    a === undefined && b === undefined ? undefined : (a ?? 0) + (b ?? 0);\n  return {\n    inputTokens,\n    outputTokens,\n    totalTokens: inputTokens + outputTokens,\n    cacheReadTokens: sumOpt(acc?.cacheReadTokens, u.cacheReadTokens),\n    cacheWriteTokens: sumOpt(acc?.cacheWriteTokens, u.cacheWriteTokens),\n    reasoningTokens: sumOpt(acc?.reasoningTokens, u.reasoningTokens),\n  };\n}\n\n/**\n * Assemble the result object, omitting `usage` when no round reported any.\n * @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4).\n */\nexport function buildResult(\n  terminal: RunToCompletionResult[\"terminal\"],\n  rounds: number,\n  lastResult: RunResult,\n  usage: TokenUsage | undefined,\n): RunToCompletionResult {\n  return { terminal, rounds, lastResult, ...(usage !== undefined ? { usage } : {}) };\n}\n\n/**\n * The shared between-rounds tail: fire `onTruncated`, then — re-reading `aborted`\n * (a getter that can flip between rounds) — return a `step_limit` result if the\n * signal aborted, else `undefined` to continue. Used by BOTH the stateful driver\n * and its streaming twin (V3-4), so the continuation-end policy has one home.\n * @internal\n */\nexport async function continuationTail(\n  round: number,\n  lastResult: RunResult,\n  usage: TokenUsage | undefined,\n  onTruncated: ((event: { round: number }) => void | Promise<void>) | undefined,\n  signal: AbortSignal | undefined,\n): Promise<RunToCompletionResult | undefined> {\n  await onTruncated?.({ round });\n  return signal?.aborted === true ? buildResult(\"step_limit\", round, lastResult, usage) : undefined;\n}\n\n/**\n * Carried state between continuation rounds.\n * @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4).\n */\nexport interface RoundState {\n  usage: TokenUsage | undefined;\n  emptyStreak: number;\n}\n\n/** Resolved continuation config + fresh initial state — shared by both drivers. @internal */\nexport interface ResolvedContinuation {\n  maxRounds: number;\n  continuationPrompt: string;\n  onTruncated: ((event: { round: number }) => void | Promise<void>) | undefined;\n  signal: AbortSignal | undefined;\n  sendOptions: SendOptions | undefined;\n  state: RoundState;\n}\n\n/** Resolve options to the continuation config + a fresh state. One home for the defaults. @internal */\nexport function resolveContinuation(options?: RunToCompletionOptions): ResolvedContinuation {\n  return {\n    maxRounds: options?.maxRounds ?? DEFAULT_MAX_ROUNDS,\n    continuationPrompt: options?.continuationPrompt ?? DEFAULT_CONTINUATION_PROMPT,\n    onTruncated: options?.onTruncated,\n    signal: options?.signal,\n    sendOptions: options?.sendOptions,\n    state: { usage: undefined, emptyStreak: 0 },\n  };\n}\n\n/** The round's prompt: the task on round 0, the continuation prompt after. @internal */\nexport function promptForRound(round: number, message: string, continuationPrompt: string): string {\n  return round === 0 ? message : continuationPrompt;\n}\n\n/** A round either reaches a terminal, or yields the state to carry into the next round. */\ntype RoundOutcome =\n  | { terminal: RunToCompletionResult }\n  | { next: RoundState; lastResult: RunResult };\n\n/** Send one round, fold usage, classify. Splits the loop body out to cap complexity. */\nasync function stepRound(\n  agent: RunToCompletionAgent,\n  prompt: string,\n  sendOptions: SendOptions | undefined,\n  round: number,\n  maxRounds: number,\n  state: RoundState,\n): Promise<RoundOutcome> {\n  // SE3 — a continuation round (round > 0) is a driver-initiated turn; stamp its\n  // provenance so a consumer can tell it apart from the caller's first send.\n  const roundOptions: SendOptions | undefined =\n    round === 0 ? sendOptions : { ...(sendOptions ?? {}), origin: { kind: \"auto-continuation\" } };\n  const run = await agent.send(prompt, roundOptions);\n  const result = await run.wait();\n  const usage = addUsage(state.usage, result.usage);\n  const decision = classifyRound(result, round, maxRounds, state.emptyStreak);\n  if (decision !== \"continue\") return { terminal: buildResult(decision, round, result, usage) };\n  const emptyStreak = isEmptyRound(result) ? state.emptyStreak + 1 : 0;\n  return { next: { usage, emptyStreak }, lastResult: result };\n}\n\n/**\n * Drive `agent.send()` until a terminal. See {@link RunToCompletionOptions}.\n *\n * @internal\n */\nexport async function runToCompletionImpl(\n  agent: RunToCompletionAgent,\n  message: string,\n  options?: RunToCompletionOptions,\n): Promise<RunToCompletionResult> {\n  const cfg = resolveContinuation(options);\n  let state = cfg.state;\n\n  for (let round = 0; ; round += 1) {\n    const prompt = promptForRound(round, message, cfg.continuationPrompt);\n    const outcome = await stepRound(agent, prompt, cfg.sendOptions, round, cfg.maxRounds, state);\n    if (\"terminal\" in outcome) return outcome.terminal;\n\n    // Truncated and below the round budget — re-send next iteration.\n    state = outcome.next;\n    const aborted = await continuationTail(\n      round,\n      outcome.lastResult,\n      state.usage,\n      cfg.onTruncated,\n      cfg.signal,\n    );\n    if (aborted !== undefined) return aborted;\n  }\n}\n"]}
+{"version":3,"sources":["../src/internal/runtime/lifecycle/run-to-completion.ts"],"names":[],"mappings":";AA+BO,IAAM,kBAAA,GAAqB;AAE3B,IAAM,2BAAA,GACX;AAQK,SAAS,aAAa,MAAA,EAA4B;AACvD,EAAA,OAAA,CAAQ,MAAA,CAAO,MAAA,IAAU,EAAA,EAAI,IAAA,EAAK,KAAM,EAAA;AAC1C;AASO,SAAS,aAAA,CACd,MAAA,EACA,KAAA,EACA,SAAA,EACA,WAAA,EACe;AAIf,EAAA,IAAI,MAAA,CAAO,iBAAA,KAAsB,IAAA,EAAM,OAAO,aAAA;AAC9C,EAAA,IAAI,MAAA,CAAO,uBAAA,KAA4B,IAAA,EAAM,OAAO,MAAA;AAEpD,EAAA,IAAI,YAAA,CAAa,MAAM,CAAA,IAAK,WAAA,IAAe,GAAG,OAAO,aAAA;AACrD,EAAA,IAAI,KAAA,IAAS,WAAW,OAAO,YAAA;AAC/B,EAAA,OAAO,UAAA;AACT;AAWO,SAAS,QAAA,CACd,KACA,CAAA,EACwB;AACxB,EAAA,IAAI,CAAA,KAAM,QAAW,OAAO,GAAA;AAC5B,EAAA,MAAM,WAAA,GAAA,CAAe,GAAA,EAAK,WAAA,IAAe,CAAA,IAAK,CAAA,CAAE,WAAA;AAChD,EAAA,MAAM,YAAA,GAAA,CAAgB,GAAA,EAAK,YAAA,IAAgB,CAAA,IAAK,CAAA,CAAE,YAAA;AAClD,EAAA,MAAM,MAAA,GAAS,CAAC,CAAA,EAAuB,CAAA,KACrC,CAAA,KAAM,MAAA,IAAa,CAAA,KAAM,MAAA,GAAY,MAAA,GAAA,CAAa,CAAA,IAAK,CAAA,KAAM,CAAA,IAAK,CAAA,CAAA;AACpE,EAAA,OAAO;AAAA,IACL,WAAA;AAAA,IACA,YAAA;AAAA,IACA,aAAa,WAAA,GAAc,YAAA;AAAA,IAC3B,eAAA,EAAiB,MAAA,CAAO,GAAA,EAAK,eAAA,EAAiB,EAAE,eAAe,CAAA;AAAA,IAC/D,gBAAA,EAAkB,MAAA,CAAO,GAAA,EAAK,gBAAA,EAAkB,EAAE,gBAAgB,CAAA;AAAA,IAClE,eAAA,EAAiB,MAAA,CAAO,GAAA,EAAK,eAAA,EAAiB,EAAE,eAAe;AAAA,GACjE;AACF;AAMO,SAAS,WAAA,CACd,QAAA,EACA,MAAA,EACA,UAAA,EACA,KAAA,EACuB;AACvB,EAAA,OAAO,EAAE,QAAA,EAAU,MAAA,EAAQ,UAAA,EAAY,GAAI,KAAA,KAAU,MAAA,GAAY,EAAE,KAAA,EAAM,GAAI,EAAC,EAAG;AACnF;AASA,eAAsB,gBAAA,CACpB,KAAA,EACA,UAAA,EACA,KAAA,EACA,aACA,MAAA,EAC4C;AAC5C,EAAA,MAAM,WAAA,GAAc,EAAE,KAAA,EAAO,CAAA;AAC7B,EAAA,OAAO,MAAA,EAAQ,YAAY,IAAA,GAAO,WAAA,CAAY,cAAc,KAAA,EAAO,UAAA,EAAY,KAAK,CAAA,GAAI,MAAA;AAC1F;AAsBO,SAAS,oBAAoB,OAAA,EAAwD;AAC1F,EAAA,OAAO;AAAA,IACL,SAAA,EAAW,SAAS,SAAA,IAAa,kBAAA;AAAA,IACjC,kBAAA,EAAoB,SAAS,kBAAA,IAAsB,2BAAA;AAAA,IACnD,aAAa,OAAA,EAAS,WAAA;AAAA,IACtB,QAAQ,OAAA,EAAS,MAAA;AAAA,IACjB,aAAa,OAAA,EAAS,WAAA;AAAA,IACtB,KAAA,EAAO,EAAE,KAAA,EAAO,MAAA,EAAW,aAAa,CAAA;AAAE,GAC5C;AACF;AAGO,SAAS,cAAA,CAAe,KAAA,EAAe,OAAA,EAAiB,kBAAA,EAAoC;AACjG,EAAA,OAAO,KAAA,KAAU,IAAI,OAAA,GAAU,kBAAA;AACjC;AAQA,eAAe,UACb,KAAA,EACA,MAAA,EACA,WAAA,EACA,KAAA,EACA,WACA,KAAA,EACuB;AAGvB,EAAA,MAAM,YAAA,GACJ,KAAA,KAAU,CAAA,GAAI,WAAA,GAAc,EAAE,GAAI,WAAA,IAAe,EAAC,EAAI,MAAA,EAAQ,EAAE,IAAA,EAAM,qBAAoB,EAAE;AAC9F,EAAA,MAAM,GAAA,GAAM,MAAM,KAAA,CAAM,IAAA,CAAK,QAAQ,YAAY,CAAA;AACjD,EAAA,MAAM,MAAA,GAAS,MAAM,GAAA,CAAI,IAAA,EAAK;AAC9B,EAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,KAAA,EAAO,OAAO,KAAK,CAAA;AAChD,EAAA,MAAM,WAAW,aAAA,CAAc,MAAA,EAAQ,KAAA,EAAO,SAAA,EAAW,MAAM,WAAW,CAAA;AAC1E,EAAA,IAAI,QAAA,KAAa,UAAA,EAAY,OAAO,EAAE,QAAA,EAAU,YAAY,QAAA,EAAU,KAAA,EAAO,MAAA,EAAQ,KAAK,CAAA,EAAE;AAC5F,EAAA,MAAM,cAAc,YAAA,CAAa,MAAM,CAAA,GAAI,KAAA,CAAM,cAAc,CAAA,GAAI,CAAA;AACnE,EAAA,OAAO,EAAE,IAAA,EAAM,EAAE,OAAO,WAAA,EAAY,EAAG,YAAY,MAAA,EAAO;AAC5D;AAOA,eAAsB,mBAAA,CACpB,KAAA,EACA,OAAA,EACA,OAAA,EACgC;AAChC,EAAA,MAAM,GAAA,GAAM,oBAAoB,OAAO,CAAA;AACvC,EAAA,IAAI,QAAQ,GAAA,CAAI,KAAA;AAEhB,EAAA,KAAA,IAAS,KAAA,GAAQ,CAAA,IAAK,KAAA,IAAS,CAAA,EAAG;AAChC,IAAA,MAAM,MAAA,GAAS,cAAA,CAAe,KAAA,EAAO,OAAA,EAAS,IAAI,kBAAkB,CAAA;AACpE,IAAA,MAAM,OAAA,GAAU,MAAM,SAAA,CAAU,KAAA,EAAO,MAAA,EAAQ,IAAI,WAAA,EAAa,KAAA,EAAO,GAAA,CAAI,SAAA,EAAW,KAAK,CAAA;AAC3F,IAAA,IAAI,UAAA,IAAc,OAAA,EAAS,OAAO,OAAA,CAAQ,QAAA;AAG1C,IAAA,KAAA,GAAQ,OAAA,CAAQ,IAAA;AAChB,IAAA,MAAM,UAAU,MAAM,gBAAA;AAAA,MACpB,KAAA;AAAA,MACA,OAAA,CAAQ,UAAA;AAAA,MACR,KAAA,CAAM,KAAA;AAAA,MACN,GAAA,CAAI,WAAA;AAAA,MACJ,GAAA,CAAI;AAAA,KACN;AACA,IAAA,IAAI,OAAA,KAAY,QAAW,OAAO,OAAA;AAAA,EACpC;AACF","file":"chunk-EPSICJLZ.js","sourcesContent":["/**\n * `runToCompletion` continuation driver (M1 Phase 3 — plan m1-run-to-completion).\n *\n * Drives repeated `send()`s on a STATEFUL agent until a genuine terminal,\n * consuming the `RunResult.stoppedAtIterationLimit` signal shipped in 2.2.0.\n * The agent's session preserves conversation history across sends, so after a\n * truncated round the driver only re-sends a short continuation prompt (it does\n * NOT reconstruct history). Mirrors the injectable shape of `run-until.ts` and\n * absorbs the outer-loop policy hand-rolled in `theocode/server/lib/agent-loop.ts`.\n *\n * The core is decision-pure + injectable (`agent` is only the `.send` port) so\n * every terminal is unit-testable with a fake send — fixture mode never sets\n * `stoppedAtIterationLimit`, so injection is the only deterministic path.\n *\n * @internal\n */\n\nimport type {\n  RunResult,\n  RunToCompletionOptions,\n  RunToCompletionResult,\n  SendOptions,\n} from \"../../../types/run.js\";\nimport type { TokenUsage } from \"../../../types/usage.js\";\n\n/** Minimal agent port the driver needs — the instance `.send()` surface. */\nexport interface RunToCompletionAgent {\n  send(message: string, options?: SendOptions): Promise<{ wait(): Promise<RunResult> }>;\n}\n\n/** @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4). */\nexport const DEFAULT_MAX_ROUNDS = 5;\n/** @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4). */\nexport const DEFAULT_CONTINUATION_PROMPT =\n  \"Continue from where you left off and finish the task. If it is already complete, give the final answer.\";\n\ntype RoundDecision = \"done\" | \"continue\" | \"step_limit\" | \"no_progress\";\n\n/**\n * True when a round produced no observable output text.\n * @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4).\n */\nexport function isEmptyRound(result: RunResult): boolean {\n  return (result.result ?? \"\").trim() === \"\";\n}\n\n/**\n * Pure decision: given a round's result + position + the running empty streak,\n * decide whether to finish (`done`), keep going (`continue`), or bail\n * (`step_limit` / `no_progress`).\n *\n * @internal\n */\nexport function classifyRound(\n  result: RunResult,\n  round: number,\n  maxRounds: number,\n  emptyStreak: number,\n): RoundDecision {\n  // Doom-loop stop is a genuine terminal (the model repeated identical tool calls) — classify it as\n  // `no_progress` FIRST, before the iteration-limit check, so it is never mistaken for a truncation\n  // to re-send (which would re-trigger the loop). Complements the empty-round `no_progress` below.\n  if (result.stoppedByDoomLoop === true) return \"no_progress\";\n  if (result.stoppedAtIterationLimit !== true) return \"done\";\n  // Truncated at the iteration ceiling.\n  if (isEmptyRound(result) && emptyStreak >= 1) return \"no_progress\";\n  if (round >= maxRounds) return \"step_limit\";\n  return \"continue\";\n}\n\n/**\n * Sum a round's usage into the running aggregate. `requests` is intentionally\n * dropped (concatenating per-run request breakdowns across continuation rounds\n * would falsely imply a single multi-call run). `totalTokens` is DERIVED\n * (`inputTokens + outputTokens`), never summed independently, to preserve the\n * EC-10 invariant (`usage.ts`) at this aggregation boundary even if a provider\n * folded extra buckets into a round's own `totalTokens`.\n * @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4).\n */\nexport function addUsage(\n  acc: TokenUsage | undefined,\n  u: TokenUsage | undefined,\n): TokenUsage | undefined {\n  if (u === undefined) return acc;\n  const inputTokens = (acc?.inputTokens ?? 0) + u.inputTokens;\n  const outputTokens = (acc?.outputTokens ?? 0) + u.outputTokens;\n  const sumOpt = (a: number | undefined, b: number | undefined): number | undefined =>\n    a === undefined && b === undefined ? undefined : (a ?? 0) + (b ?? 0);\n  return {\n    inputTokens,\n    outputTokens,\n    totalTokens: inputTokens + outputTokens,\n    cacheReadTokens: sumOpt(acc?.cacheReadTokens, u.cacheReadTokens),\n    cacheWriteTokens: sumOpt(acc?.cacheWriteTokens, u.cacheWriteTokens),\n    reasoningTokens: sumOpt(acc?.reasoningTokens, u.reasoningTokens),\n  };\n}\n\n/**\n * Assemble the result object, omitting `usage` when no round reported any.\n * @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4).\n */\nexport function buildResult(\n  terminal: RunToCompletionResult[\"terminal\"],\n  rounds: number,\n  lastResult: RunResult,\n  usage: TokenUsage | undefined,\n): RunToCompletionResult {\n  return { terminal, rounds, lastResult, ...(usage !== undefined ? { usage } : {}) };\n}\n\n/**\n * The shared between-rounds tail: fire `onTruncated`, then — re-reading `aborted`\n * (a getter that can flip between rounds) — return a `step_limit` result if the\n * signal aborted, else `undefined` to continue. Used by BOTH the stateful driver\n * and its streaming twin (V3-4), so the continuation-end policy has one home.\n * @internal\n */\nexport async function continuationTail(\n  round: number,\n  lastResult: RunResult,\n  usage: TokenUsage | undefined,\n  onTruncated: ((event: { round: number }) => void | Promise<void>) | undefined,\n  signal: AbortSignal | undefined,\n): Promise<RunToCompletionResult | undefined> {\n  await onTruncated?.({ round });\n  return signal?.aborted === true ? buildResult(\"step_limit\", round, lastResult, usage) : undefined;\n}\n\n/**\n * Carried state between continuation rounds.\n * @internal — shared with the streaming twin (`stream-to-completion.ts`, V3-4).\n */\nexport interface RoundState {\n  usage: TokenUsage | undefined;\n  emptyStreak: number;\n}\n\n/** Resolved continuation config + fresh initial state — shared by both drivers. @internal */\nexport interface ResolvedContinuation {\n  maxRounds: number;\n  continuationPrompt: string;\n  onTruncated: ((event: { round: number }) => void | Promise<void>) | undefined;\n  signal: AbortSignal | undefined;\n  sendOptions: SendOptions | undefined;\n  state: RoundState;\n}\n\n/** Resolve options to the continuation config + a fresh state. One home for the defaults. @internal */\nexport function resolveContinuation(options?: RunToCompletionOptions): ResolvedContinuation {\n  return {\n    maxRounds: options?.maxRounds ?? DEFAULT_MAX_ROUNDS,\n    continuationPrompt: options?.continuationPrompt ?? DEFAULT_CONTINUATION_PROMPT,\n    onTruncated: options?.onTruncated,\n    signal: options?.signal,\n    sendOptions: options?.sendOptions,\n    state: { usage: undefined, emptyStreak: 0 },\n  };\n}\n\n/** The round's prompt: the task on round 0, the continuation prompt after. @internal */\nexport function promptForRound(round: number, message: string, continuationPrompt: string): string {\n  return round === 0 ? message : continuationPrompt;\n}\n\n/** A round either reaches a terminal, or yields the state to carry into the next round. */\ntype RoundOutcome =\n  | { terminal: RunToCompletionResult }\n  | { next: RoundState; lastResult: RunResult };\n\n/** Send one round, fold usage, classify. Splits the loop body out to cap complexity. */\nasync function stepRound(\n  agent: RunToCompletionAgent,\n  prompt: string,\n  sendOptions: SendOptions | undefined,\n  round: number,\n  maxRounds: number,\n  state: RoundState,\n): Promise<RoundOutcome> {\n  // SE3 — a continuation round (round > 0) is a driver-initiated turn; stamp its\n  // provenance so a consumer can tell it apart from the caller's first send.\n  const roundOptions: SendOptions | undefined =\n    round === 0 ? sendOptions : { ...(sendOptions ?? {}), origin: { kind: \"auto-continuation\" } };\n  const run = await agent.send(prompt, roundOptions);\n  const result = await run.wait();\n  const usage = addUsage(state.usage, result.usage);\n  const decision = classifyRound(result, round, maxRounds, state.emptyStreak);\n  if (decision !== \"continue\") return { terminal: buildResult(decision, round, result, usage) };\n  const emptyStreak = isEmptyRound(result) ? state.emptyStreak + 1 : 0;\n  return { next: { usage, emptyStreak }, lastResult: result };\n}\n\n/**\n * Drive `agent.send()` until a terminal. See {@link RunToCompletionOptions}.\n *\n * @internal\n */\nexport async function runToCompletionImpl(\n  agent: RunToCompletionAgent,\n  message: string,\n  options?: RunToCompletionOptions,\n): Promise<RunToCompletionResult> {\n  const cfg = resolveContinuation(options);\n  let state = cfg.state;\n\n  for (let round = 0; ; round += 1) {\n    const prompt = promptForRound(round, message, cfg.continuationPrompt);\n    const outcome = await stepRound(agent, prompt, cfg.sendOptions, round, cfg.maxRounds, state);\n    if (\"terminal\" in outcome) return outcome.terminal;\n\n    // Truncated and below the round budget — re-send next iteration.\n    state = outcome.next;\n    const aborted = await continuationTail(\n      round,\n      outcome.lastResult,\n      state.usage,\n      cfg.onTruncated,\n      cfg.signal,\n    );\n    if (aborted !== undefined) return aborted;\n  }\n}\n"]}

package/dist/{chunk-RAACTJ7C.cjs → chunk-F3YZMOAU.cjs}

@@ -1,7 +1,7 @@
 'use strict';
 
-var chunkYLQQX5W2_cjs = require('./chunk-YLQQX5W2.cjs');
-var chunk2YGIBOUH_cjs = require('./chunk-2YGIBOUH.cjs');
+var chunkZF2LDKQQ_cjs = require('./chunk-ZF2LDKQQ.cjs');
+var chunkK3FW2XZD_cjs = require('./chunk-K3FW2XZD.cjs');
 var async_hooks = require('async_hooks');
 
 // src/internal/llm/credential-pool-types.ts
@@ -70,7 +70,7 @@ var CredentialPool = class _CredentialPool {
   entries;
   constructor(provider, entries, strategy = "fill_first") {
     if (entries.length === 0) {
-      throw new chunk2YGIBOUH_cjs.ConfigurationError(
+      throw new chunkK3FW2XZD_cjs.ConfigurationError(
         `credential-pool: cannot construct empty pool for provider "${provider}"`,
         { code: "credential_pool_empty" }
       );
@@ -163,7 +163,7 @@ var CredentialPool = class _CredentialPool {
    * @internal
    */
   async select() {
-    return chunkYLQQX5W2_cjs.withCwdMutex(`credential-pool:${this.provider}`, async () => this.selectLocked());
+    return chunkZF2LDKQQ_cjs.withCwdMutex(`credential-pool:${this.provider}`, async () => this.selectLocked());
   }
   /**
    * Mark the entry whose id matches `entryId` as exhausted with the
@@ -174,7 +174,7 @@ var CredentialPool = class _CredentialPool {
    * @internal
    */
   async markExhaustedAndRotate(args) {
-    return chunkYLQQX5W2_cjs.withCwdMutex(`credential-pool:${this.provider}`, async () => {
+    return chunkZF2LDKQQ_cjs.withCwdMutex(`credential-pool:${this.provider}`, async () => {
       const entry = this.entries.find((e) => e.id === args.entryId);
       if (entry !== void 0) {
         const now = Date.now();
@@ -189,7 +189,7 @@ var CredentialPool = class _CredentialPool {
   }
   /** Admin escape hatch: clear all cooldowns. */
   async resetAll() {
-    await chunkYLQQX5W2_cjs.withCwdMutex(`credential-pool:${this.provider}`, async () => {
+    await chunkZF2LDKQQ_cjs.withCwdMutex(`credential-pool:${this.provider}`, async () => {
       for (const e of this.entries) {
         e.lastStatus = "ok";
         e.lastStatusAt = void 0;
@@ -292,5 +292,5 @@ exports.currentCredentialPool = currentCredentialPool;
 exports.newPooledCredential = newPooledCredential;
 exports.sleepWithAbort = sleepWithAbort;
 exports.withCredentialPool = withCredentialPool;
-//# sourceMappingURL=chunk-RAACTJ7C.cjs.map
-//# sourceMappingURL=chunk-RAACTJ7C.cjs.map
+//# sourceMappingURL=chunk-F3YZMOAU.cjs.map
+//# sourceMappingURL=chunk-F3YZMOAU.cjs.map

package/dist/{chunk-RAACTJ7C.cjs.map → chunk-F3YZMOAU.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/internal/llm/credential-pool-types.ts","../src/internal/llm/retry.ts","../src/internal/llm/credential-pool.ts","../src/internal/llm/credential-pool-context.ts"],"names":["ConfigurationError","withCwdMutex","picked","AsyncLocalStorage"],"mappings":";;;;;;;AAyFO,IAAM,WAAA,GAAgD;AAAA,EAC3D,GAAA,EAAK,IAAI,EAAA,GAAK,GAAA;AAAA;AAAA,EACd,GAAA,EAAK,KAAK,EAAA,GAAK,GAAA;AAAA;AAAA,EACf,GAAA,EAAK,KAAK,EAAA,GAAK;AAAA;AACjB,CAAA;AAGO,IAAM,mBAAA,GAAsB,KAAK,EAAA,GAAK,GAAA;;;AC7D7C,IAAM,eAAA,GAAkB,GAAA;AACxB,IAAM,cAAA,GAAiB,IAAA;AAchB,SAAS,iBAAiB,IAAA,EAA8B;AAC7D,EAAA,MAAM,IAAA,GAAO,KAAK,MAAA,IAAU,eAAA;AAC5B,EAAA,MAAM,GAAA,GAAM,KAAK,KAAA,IAAS,cAAA;AAC1B,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,MAAA;AAC7B,EAAA,IAAI,IAAA,CAAK,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,gBAAgB,CAAA,EAAG;AAC7D,IAAA,OAAO,IAAA,CAAK,IAAI,IAAA,EAAM,IAAA,CAAK,IAAI,GAAA,EAAK,IAAA,CAAK,YAAY,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,GAAO,CAAA,IAAK,KAAK,OAAO,CAAA;AACtD,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,EAAI,GAAI,OAAO,CAAA;AACnC;AASO,SAAS,cAAA,CAAe,IAAY,MAAA,EAAoC;AAC7E,EAAA,IAAI,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,EAAS,OAAO,QAAQ,OAAA,EAAQ;AACtD,EAAA,OAAO,IAAI,OAAA,CAAc,CAAC,OAAA,KAAY;AACpC,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM;AAC7B,MAAA,MAAA,CAAO,mBAAA,CAAoB,SAAS,OAAO,CAAA;AAC3C,MAAA,OAAA,EAAQ;AAAA,IACV,GAAG,EAAE,CAAA;AACL,IAAA,MAAM,UAAU,MAAY;AAC1B,MAAA,YAAA,CAAa,KAAK,CAAA;AAClB,MAAA,OAAA,EAAQ;AAAA,IACV,CAAA;AACA,IAAA,MAAA,CAAO,iBAAiB,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAM,CAAA;AAAA,EAC1D,CAAC,CAAA;AACH;;;AC/CO,SAAS,oBAAoB,IAAA,EAMf;AACnB,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAA,CAAW,MAAA,CAAO,UAAA,EAAW;AAAA,IACjC,OAAO,IAAA,CAAK,KAAA,IAAS,gBAAgB,IAAA,CAAK,MAAA,EAAQ,KAAK,WAAW,CAAA;AAAA,IAClE,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,UAAA,EAAY,IAAA;AAAA,IACZ,YAAA,EAAc,MAAA;AAAA,IACd,aAAA,EAAe,MAAA;AAAA,IACf,gBAAA,EAAkB,MAAA;AAAA,IAClB,YAAA,EAAc;AAAA,GAChB;AACF;AAQA,SAAS,eAAA,CAAgB,QAAgB,WAAA,EAA6B;AACpE,EAAA,IAAI,OAAO,UAAA,CAAW,MAAM,GAAG,OAAO,MAAA,CAAO,MAAM,CAAC,CAAA;AACpD,EAAA,MAAM,MAAA,GACJ,WAAA,CAAY,MAAA,GAAS,CAAA,GAAI,GAAG,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA,MAAA,EAAI,WAAA,CAAY,KAAA,CAAM,EAAE,CAAC,CAAA,CAAA,GAAK,KAAA;AACnF,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA;AAC5B;AAYO,IAAM,cAAA,GAAN,MAAM,eAAA,CAAe;AAAA,EACjB,QAAA;AAAA,EACQ,QAAA;AAAA,EACT,OAAA;AAAA,EAER,WAAA,CACE,QAAA,EACA,OAAA,EACA,QAAA,GAAmC,YAAA,EACnC;AACA,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,MAAA,MAAM,IAAIA,oCAAA;AAAA,QACR,8DAA8D,QAAQ,CAAA,CAAA,CAAA;AAAA,QACtE,EAAE,MAAM,uBAAA;AAAwB,OAClC;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAEhB,IAAA,IAAA,CAAK,OAAA,GAAU,aAAA,CAAc,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE,QAAQ,CAAA;AAAA,EAC9E;AAAA;AAAA,EAGA,cAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,YAAA,GAAwB;AACtB,IAAA,OAAO,IAAA,CAAK,gBAAA,EAAiB,CAAE,MAAA,GAAS,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eAAA,GAAsC;AACpC,IAAA,IAAI,QAAA;AACJ,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC/B,MAAA,IAAI,KAAA,CAAM,qBAAqB,MAAA,EAAW;AAC1C,MAAA,IAAI,QAAA,KAAa,MAAA,IAAa,KAAA,CAAM,gBAAA,GAAmB,QAAA,EAAU;AAC/D,QAAA,QAAA,GAAW,KAAA,CAAM,gBAAA;AAAA,MACnB;AAAA,IACF;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,MAAM,gBAAA,CACJ,MAAA,EACA,IAAA,EAIkB;AAClB,IAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,IAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAChC,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,cAAA;AAChC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI,GAAI,IAAA,CAAK,SAAA;AACnC,IAAA,OAAO,IAAA,CAAK,GAAA,EAAI,GAAI,QAAA,EAAU;AAC5B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,sBAAA,CAAuB,QAAQ,CAAA;AACrD,MAAA,MAAM,OAAA,CAAQ,UAAU,MAAM,CAAA;AAC9B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAAA,IAClC;AACA,IAAA,OAAO,KAAK,YAAA,EAAa;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,uBAAuB,QAAA,EAA0B;AACvD,IAAA,MAAM,OAAA,GAAU,KAAK,eAAA,EAAgB;AACrC,IAAA,MAAM,SAAA,GAAY,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI;AACtC,IAAA,MAAM,UACJ,OAAA,KAAY,MAAA,GACR,KAAK,GAAA,CAAI,SAAA,EAAW,GAAG,CAAA,GACvB,IAAA,CAAK,IAAI,SAAA,EAAW,IAAA,CAAK,IAAI,CAAA,EAAG,OAAA,GAAU,KAAK,GAAA,EAAK,IAAI,EAAE,CAAA;AAChE,IAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,MAAM,IAAA,CAAK,MAAA,EAAO,GAAI,OAAO,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,IAAA,GAAoC;AAClC,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,MAAA,GAA2C;AAC/C,IAAA,OAAOC,8BAAA,CAAa,mBAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY,IAAA,CAAK,cAAc,CAAA;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,uBAAuB,IAAA,EAIQ;AACnC,IAAA,OAAOA,8BAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AAClE,MAAA,MAAM,KAAA,GAAQ,KAAK,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,IAAA,CAAK,OAAO,CAAA;AAC5D,MAAA,IAAI,UAAU,MAAA,EAAW;AACvB,QAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,QAAA,MAAM,QAAA,GAAW,WAAA,CAAY,IAAA,CAAK,UAAU,CAAA,IAAK,mBAAA;AACjD,QAAA,KAAA,CAAM,UAAA,GAAa,WAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,GAAA;AACrB,QAAA,KAAA,CAAM,gBAAgB,IAAA,CAAK,UAAA;AAE3B,QAAA,KAAA,CAAM,gBAAA,GACJ,KAAK,SAAA,KAAc,MAAA,IAAa,KAAK,SAAA,GAAY,GAAA,GAAM,IAAA,CAAK,SAAA,GAAY,GAAA,GAAM,QAAA;AAAA,MAClF;AACA,MAAA,OAAO,KAAK,YAAA,EAAa;AAAA,IAC3B,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,QAAA,GAA0B;AAC9B,IAAA,MAAMA,8BAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AACjE,MAAA,KAAA,MAAW,CAAA,IAAK,KAAK,OAAA,EAAS;AAC5B,QAAA,CAAA,CAAE,UAAA,GAAa,IAAA;AACf,QAAA,CAAA,CAAE,YAAA,GAAe,MAAA;AACjB,QAAA,CAAA,CAAE,aAAA,GAAgB,MAAA;AAClB,QAAA,CAAA,CAAE,gBAAA,GAAmB,MAAA;AAAA,MACvB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,UAAA,GAAqC;AACnC,IAAA,OAAO;AAAA,MACL,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,OAAA,EAAS,KAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAE,CAAE;AAAA,KAC7C;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,aAAa,QAAA,EAAkD;AACpE,IAAA,OAAO,IAAI,eAAA,CAAe,QAAA,CAAS,UAAU,QAAA,CAAS,OAAA,EAAS,SAAS,QAAQ,CAAA;AAAA,EAClF;AAAA;AAAA;AAAA,EAKQ,YAAA,GAAwC;AAC9C,IAAA,MAAM,SAAA,GAAY,KAAK,gBAAA,EAAiB;AACxC,IAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAEnC,IAAA,IAAI,IAAA,CAAK,aAAa,QAAA,EAAU;AAC9B,MAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,GAAI,UAAU,MAAM,CAAA;AACvD,MAAA,MAAMC,OAAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,YAAA,IAAgB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE1D,MAAA,MAAMA,OAAAA,GAAS,CAAC,GAAG,SAAS,CAAA,CAAE,IAAA;AAAA,QAC5B,CAAC,GAAG,CAAA,KAAM,CAAA,CAAE,eAAe,CAAA,CAAE,YAAA,IAAgB,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE;AAAA,QAC5D,CAAC,CAAA;AACH,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,aAAA,IAAiB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE3D,MAAA,MAAMA,OAAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,MAAM,IAAA,GAAO,KAAK,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAOA,OAAAA,CAAO,EAAE,CAAA;AAI1D,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,OAAA,CAAQ,MAAA,GAAS,CAAA;AAC1C,MAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACrB,QAAA,CAAA,CAAE,QAAA,GAAW,CAAA;AAAA,MACf,CAAC,CAAA;AACD,MAAAA,QAAO,QAAA,GAAW,WAAA;AAClB,MAAA,IAAA,CAAK,OAAA,GAAU,CAAC,GAAG,IAAA,EAAMA,OAAM,CAAA;AAC/B,MAAA,OAAOA,OAAAA;AAAA,IACT;AAGA,IAAA,MAAM,MAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,IAAA;AACjC,IAAA,MAAA,CAAO,YAAA,IAAgB,CAAA;AACvB,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,gBAAA,GAAuC;AAC7C,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,MAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC7B,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,UAAU,KAAA,CAAM,gBAAA;AACtB,MAAA,IAAI,OAAA,KAAY,MAAA,IAAa,GAAA,IAAO,OAAA,EAAS;AAC3C,QAAA,KAAA,CAAM,UAAA,GAAa,IAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,MAAA;AACrB,QAAA,KAAA,CAAM,aAAA,GAAgB,MAAA;AACtB,QAAA,KAAA,CAAM,gBAAA,GAAmB,MAAA;AACzB,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACF;AAMA,SAAS,cAAc,OAAA,EAAiD;AACtE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,WAAW,CAAA;AACtB,IAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACZ;AACA,EAAA,OAAO,GAAA;AACT;ACvUA,IAAM,mBAAA,GAAsB,IAAIC,6BAAA,EAA+C;AAS/E,eAAsB,kBAAA,CACpB,OACA,EAAA,EACY;AACZ,EAAA,OAAO,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,EAAE,CAAA;AAC1C;AAQO,SAAS,sBAAsB,QAAA,EAA8C;AAClF,EAAA,OAAO,mBAAA,CAAoB,QAAA,EAAS,EAAG,GAAA,CAAI,QAAQ,CAAA;AACrD","file":"chunk-RAACTJ7C.cjs","sourcesContent":["/**\n * Types for the credential pool subsystem (ADRs D123-D133).\n *\n * Pool a developer's multiple API keys for the SAME provider so the SDK\n * can rotate transparently on HTTP 429/402/401 instead of jumping\n * straight to a different provider via `FallbackLlmClient`.\n *\n * @internal\n */\n\n/**\n * Rotation strategy when picking the next credential from a pool.\n *\n * - `fill_first` (default): use entries[0] until exhausted, then [1]…\n * - `round_robin`: rotate after each `select()`\n * - `least_used`: pick the entry with the lowest `requestCount`\n * - `random`: random pick among healthy entries\n *\n * Closed enum per ADR D124 — adding a strategy is an explicit semver\n * minor that updates `selectByStrategy` exhaustively.\n *\n * @internal\n */\nexport type CredentialPoolStrategy = \"fill_first\" | \"round_robin\" | \"least_used\" | \"random\";\n\n/** Health flag tracked per credential. */\nexport type CredentialStatus = \"ok\" | \"exhausted\";\n\n/**\n * Provenance of a credential — where it came from when seeded.\n * Free-form string; conventional prefixes:\n *\n * - `env:<VAR_NAME>` — auto-discovered from environment variable\n * - `manual` — added via explicit `apiKeys` config\n * - `explicit-apikey` — wrapped from `AgentOptions.apiKey` single-key path (D132)\n */\nexport type CredentialSource = string;\n\n/**\n * Single credential entry inside a {@link CredentialPool}.\n *\n * `accessToken` is the sensitive field — must never be logged unredacted.\n * The lint gate `tests/lint/no-unredacted-pool-token.test.ts` enforces this.\n *\n * @internal\n */\nexport interface PooledCredential {\n  /** Stable identifier (uuid v4) for log lines + telemetry. */\n  id: string;\n  /** Human-readable label for `Theokit.credentialPool.list()`. */\n  label: string;\n  /** Provider name (matches `ProviderProfile.name`). */\n  provider: string;\n  /** Sort key; lower = earlier in fill_first. Unique within a pool. */\n  priority: number;\n  /** Provenance string. */\n  source: CredentialSource;\n  /** Sensitive API key. NEVER LOG UNREDACTED. */\n  accessToken: string;\n  /** Current health. */\n  lastStatus: CredentialStatus;\n  /** Epoch ms of the last status change. */\n  lastStatusAt: number | undefined;\n  /** HTTP code that caused exhaustion (401/402/429). */\n  lastErrorCode: number | undefined;\n  /** Provider-supplied \"retry after this epoch ms\" hint. Overrides cooldown defaults. */\n  lastErrorResetAt: number | undefined;\n  /** Bumped per successful `select()` for `least_used` strategy. Lazy-persisted. */\n  requestCount: number;\n}\n\n/**\n * Serializable snapshot of a single provider's pool. Used by the\n * persistence layer (T2.1) to read/write `~/.theokit/credential-pool.json`.\n *\n * @internal\n */\nexport interface CredentialPoolSnapshot {\n  provider: string;\n  strategy: CredentialPoolStrategy;\n  entries: PooledCredential[];\n}\n\n/**\n * Cooldown ladder by HTTP error code (ADR D125). Provider-supplied\n * `lastErrorResetAt` overrides these defaults when present.\n *\n * @internal\n */\nexport const COOLDOWN_MS: Readonly<Record<number, number>> = {\n  401: 5 * 60 * 1000, // 5 minutes — OAuth refresh can recover quickly\n  402: 60 * 60 * 1000, // 1 hour — billing quota typically hourly+\n  429: 60 * 60 * 1000, // 1 hour — daily-rate-limit windows\n};\n\n/** Default cooldown when no specific code matches. */\nexport const DEFAULT_COOLDOWN_MS = 60 * 60 * 1000;\n","/**\n * T3.4 — exponential backoff with full jitter for credential-pool retry.\n *\n * Why we need this: pre-T3.4 `pool-aware-client.ts:79-83` retried the\n * SAME credential immediately on the first 429 without any wait. When\n * every credential in the pool returned 429 (thundering herd against a\n * shared quota), the client burned through all 5 retry attempts in <1ms,\n * tripped `CredentialPoolExhaustedError`, and surfaced to the agent loop\n * as a hard failure. The user-visible symptom was \"all my keys are\n * exhausted!\" when in reality a 1-2s wait would have cleared the rate\n * limit.\n *\n * AWS Architecture Blog \"Exponential Backoff And Jitter\" (Marc Brooker,\n * 2015) demonstrates full jitter as the canonical pattern: `sleep =\n * random_between(0, base * 2^attempt)`. We extend it with a hard cap\n * (so a 32s sleep never blocks an interactive agent) and honor the\n * provider's `Retry-After` hint when present — the hint always wins over\n * the computed value when it falls within `[base, cap]`.\n *\n * @internal\n */\n\nexport interface BackoffOptions {\n  /** 0-indexed retry attempt number. */\n  attempt: number;\n  /** Base delay in ms (multiplier for 2^attempt). Default 500. */\n  baseMs?: number;\n  /** Hard cap in ms — backoff never sleeps longer than this. Default 32_000. */\n  capMs?: number;\n  /** Provider's Retry-After hint in ms (from header). Takes precedence when in-range. */\n  retryAfterMs?: number;\n  /** Random source — pass a deterministic mock from tests. Default `Math.random`. */\n  rng?: () => number;\n}\n\nconst DEFAULT_BASE_MS = 500;\nconst DEFAULT_CAP_MS = 32_000;\n\n/**\n * Compute the next sleep duration (ms) before retrying a failed request.\n *\n * Algorithm:\n * 1. If `retryAfterMs` is set, prefer it — clamped to `[baseMs, capMs]`.\n *    The provider's hint is the most accurate available signal.\n * 2. Otherwise: `sleep = random(0, min(cap, base * 2^attempt))` — full\n *    jitter per Brooker 2015 ensures coordinated clients (each with\n *    different RNG seeds) spread the retry storm.\n *\n * @internal\n */\nexport function computeBackoffMs(opts: BackoffOptions): number {\n  const base = opts.baseMs ?? DEFAULT_BASE_MS;\n  const cap = opts.capMs ?? DEFAULT_CAP_MS;\n  const rng = opts.rng ?? Math.random;\n  if (opts.retryAfterMs !== undefined && opts.retryAfterMs >= 0) {\n    return Math.max(base, Math.min(cap, opts.retryAfterMs));\n  }\n  const ceiling = Math.min(cap, base * 2 ** opts.attempt);\n  return Math.floor(rng() * ceiling);\n}\n\n/**\n * `setTimeout`-based sleep that resolves early when the abort signal fires.\n * Resolves cleanly (does not throw on abort) so callers decide how to\n * react to the abort downstream.\n *\n * @internal\n */\nexport function sleepWithAbort(ms: number, signal: AbortSignal): Promise<void> {\n  if (ms <= 0 || signal.aborted) return Promise.resolve();\n  return new Promise<void>((resolve) => {\n    const timer = setTimeout(() => {\n      signal.removeEventListener(\"abort\", onAbort);\n      resolve();\n    }, ms);\n    const onAbort = (): void => {\n      clearTimeout(timer);\n      resolve();\n    };\n    signal.addEventListener(\"abort\", onAbort, { once: true });\n  });\n}\n","/**\n * In-memory credential pool with strategy-based rotation (ADRs D123-D133).\n *\n * Pure logic. No I/O — persistence lives in `internal/persistence/\n * credential-pool-store.ts`. The pool is the single source of truth for\n * rotation state within a process; if it diverges from disk (e.g.,\n * process killed mid-rotation per EC-I), the next save heals the\n * inconsistency — at the cost of one extra HTTP 429 per crash.\n *\n * Thread safety: the pool uses an in-process async-aware mutex\n * (`cwd-mutex` D9 keyed by `credential-pool:${provider}`). Cross-process\n * safety happens at the persistence layer via `withFileLock` (D61).\n * Two Node processes sharing the same file may double-pick momentarily\n * (worst case = 1 extra 429 per race) — acceptable per ADR D128.\n *\n * @internal\n */\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport { withCwdMutex } from \"../persistence/cwd-mutex.js\";\nimport {\n  COOLDOWN_MS,\n  type CredentialPoolSnapshot,\n  type CredentialPoolStrategy,\n  DEFAULT_COOLDOWN_MS,\n  type PooledCredential,\n} from \"./credential-pool-types.js\";\nimport { sleepWithAbort } from \"./retry.js\";\n\n/**\n * Construct a `PooledCredential` with sane defaults.\n *\n * @internal\n */\nexport function newPooledCredential(args: {\n  provider: string;\n  accessToken: string;\n  priority: number;\n  source: string;\n  label?: string;\n}): PooledCredential {\n  return {\n    id: globalThis.crypto.randomUUID(),\n    label: args.label ?? labelFromSource(args.source, args.accessToken),\n    provider: args.provider,\n    priority: args.priority,\n    source: args.source,\n    accessToken: args.accessToken,\n    lastStatus: \"ok\",\n    lastStatusAt: undefined,\n    lastErrorCode: undefined,\n    lastErrorResetAt: undefined,\n    requestCount: 0,\n  };\n}\n\n/**\n * Build a human-readable label from the credential source. Used for\n * `Theokit.credentialPool.list()` UX. NEVER includes the raw token.\n *\n * @internal\n */\nfunction labelFromSource(source: string, accessToken: string): string {\n  if (source.startsWith(\"env:\")) return source.slice(4);\n  const masked =\n    accessToken.length > 8 ? `${accessToken.slice(0, 4)}…${accessToken.slice(-4)}` : \"***\";\n  return `${source}:${masked}`;\n}\n\n/**\n * Per-provider credential pool. Construct with one or more entries\n * sorted by priority. Throws `ConfigurationError` on empty input.\n *\n * EC-C: identical `accessToken`s are deduplicated during construction\n * (3 copies of \"k1\" → 1 entry). Otherwise an exhaustion event would\n * mark \"k1\" exhausted 3× wastefully.\n *\n * @internal\n */\nexport class CredentialPool {\n  readonly provider: string;\n  private readonly strategy: CredentialPoolStrategy;\n  private entries: PooledCredential[];\n\n  constructor(\n    provider: string,\n    entries: PooledCredential[],\n    strategy: CredentialPoolStrategy = \"fill_first\",\n  ) {\n    if (entries.length === 0) {\n      throw new ConfigurationError(\n        `credential-pool: cannot construct empty pool for provider \"${provider}\"`,\n        { code: \"credential_pool_empty\" },\n      );\n    }\n    this.provider = provider;\n    this.strategy = strategy;\n    // EC-C: dedupe by accessToken before sort.\n    this.entries = dedupeByToken(entries).sort((a, b) => a.priority - b.priority);\n  }\n\n  /** True if the pool was seeded with at least one entry. */\n  hasCredentials(): boolean {\n    return this.entries.length > 0;\n  }\n\n  /** True iff at least one entry is healthy (auto-healed if cooldown expired). */\n  hasAvailable(): boolean {\n    return this.availableEntries().length > 0;\n  }\n\n  /**\n   * Earliest `lastErrorResetAt` across all entries, or `undefined` if no\n   * entry is in cooldown. Used by `waitForAvailable` to compute the\n   * upper bound of each jittered sleep window.\n   *\n   * @internal\n   */\n  earliestResetAt(): number | undefined {\n    let earliest: number | undefined;\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") continue;\n      if (entry.lastErrorResetAt === undefined) continue;\n      if (earliest === undefined || entry.lastErrorResetAt < earliest) {\n        earliest = entry.lastErrorResetAt;\n      }\n    }\n    return earliest;\n  }\n\n  /**\n   * Wait until at least one entry becomes healthy OR `maxWaitMs` elapses\n   * OR `signal` aborts. Returns `true` if a healthy entry is available\n   * when the call returns, `false` otherwise.\n   *\n   * T3.9 — Reconnect storm prevention. Concurrent callers each sleep a\n   * random fraction of the window to the earliest cooldown reset (full\n   * jitter — AWS Brooker 2015) so they do not all wake at the exact\n   * instant cooldown expires and hammer the upstream simultaneously.\n   *\n   * The `sleeper` parameter is a dependency-injection seam for tests:\n   * callers in production omit it and the default `setTimeout`-based\n   * sleeper is used. The seam avoids the `vi.useFakeTimers()` mismatch\n   * that blocked T3.4's wiring.\n   *\n   * @internal\n   */\n  async waitForAvailable(\n    signal: AbortSignal,\n    opts: {\n      maxWaitMs: number;\n      sleeper?: (ms: number, signal: AbortSignal) => Promise<void>;\n    },\n  ): Promise<boolean> {\n    if (signal.aborted) return false;\n    if (this.hasAvailable()) return true;\n    const sleeper = opts.sleeper ?? sleepWithAbort;\n    const deadline = Date.now() + opts.maxWaitMs;\n    while (Date.now() < deadline) {\n      if (signal.aborted) return false;\n      const jittered = this.computeJitteredSleepMs(deadline);\n      await sleeper(jittered, signal);\n      if (signal.aborted) return false;\n      if (this.hasAvailable()) return true;\n    }\n    return this.hasAvailable();\n  }\n\n  /**\n   * Compute the next jittered sleep window (ms) for `waitForAvailable`.\n   * Full-jitter cap: at most (a) time until the earliest reset (plus a\n   * 50 ms grace so the entry actually heals before re-probe), or (b) the\n   * remaining wait window, whichever is smaller. When no entry has a\n   * known reset (rare — only if `markExhaustedAndRotate` was called\n   * without `resetAtMs`), fall back to a 250 ms ceiling so we stay\n   * responsive without hot-looping.\n   */\n  private computeJitteredSleepMs(deadline: number): number {\n    const resetAt = this.earliestResetAt();\n    const remaining = deadline - Date.now();\n    const ceiling =\n      resetAt === undefined\n        ? Math.min(remaining, 250)\n        : Math.min(remaining, Math.max(0, resetAt - Date.now()) + 50);\n    return Math.max(0, Math.floor(Math.random() * ceiling));\n  }\n\n  /** Live (frozen) view of all entries. */\n  list(): readonly PooledCredential[] {\n    return this.entries;\n  }\n\n  /**\n   * Pick a healthy entry according to the configured strategy.\n   * Mutates `requestCount` and (for round_robin) entry order.\n   * Returns null if every entry is in cooldown.\n   *\n   * @internal\n   */\n  async select(): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => this.selectLocked());\n  }\n\n  /**\n   * Mark the entry whose id matches `entryId` as exhausted with the\n   * appropriate cooldown, then return the next healthy entry (or null).\n   * If `entryId` is undefined, marks all currently-active entries (rare —\n   * only used by admin reset scenarios).\n   *\n   * @internal\n   */\n  async markExhaustedAndRotate(args: {\n    entryId: string;\n    statusCode: number;\n    resetAtMs?: number;\n  }): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      const entry = this.entries.find((e) => e.id === args.entryId);\n      if (entry !== undefined) {\n        const now = Date.now();\n        const cooldown = COOLDOWN_MS[args.statusCode] ?? DEFAULT_COOLDOWN_MS;\n        entry.lastStatus = \"exhausted\";\n        entry.lastStatusAt = now;\n        entry.lastErrorCode = args.statusCode;\n        // EC-5: negative or stale resetAt → ignore, fall through to default.\n        entry.lastErrorResetAt =\n          args.resetAtMs !== undefined && args.resetAtMs > now ? args.resetAtMs : now + cooldown;\n      }\n      return this.selectLocked();\n    });\n  }\n\n  /** Admin escape hatch: clear all cooldowns. */\n  async resetAll(): Promise<void> {\n    await withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      for (const e of this.entries) {\n        e.lastStatus = \"ok\";\n        e.lastStatusAt = undefined;\n        e.lastErrorCode = undefined;\n        e.lastErrorResetAt = undefined;\n      }\n    });\n  }\n\n  /** Materialize for persistence. */\n  toSnapshot(): CredentialPoolSnapshot {\n    return {\n      provider: this.provider,\n      strategy: this.strategy,\n      entries: this.entries.map((e) => ({ ...e })),\n    };\n  }\n\n  /** Hydrate from a previously-saved snapshot. */\n  static fromSnapshot(snapshot: CredentialPoolSnapshot): CredentialPool {\n    return new CredentialPool(snapshot.provider, snapshot.entries, snapshot.strategy);\n  }\n\n  // ─── Internal helpers (always called inside the mutex) ───\n\n  // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: strategy dispatch must branch on 4 enum values (random/least_used/round_robin/fill_first) with 1-entry short-circuits per strategy. Each branch is 5-10 lines of focused logic; extracting per-strategy methods fragments the linear narrative.\n  private selectLocked(): PooledCredential | null {\n    const available = this.availableEntries();\n    if (available.length === 0) return null;\n\n    if (this.strategy === \"random\") {\n      const idx = Math.floor(Math.random() * available.length);\n      const picked = available[idx];\n      if (picked === undefined) return null; // unreachable; satisfies strict\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"least_used\" && available.length > 1) {\n      // EC-3: tie-break by priority ascending (first wins).\n      const picked = [...available].sort(\n        (a, b) => a.requestCount - b.requestCount || a.priority - b.priority,\n      )[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"round_robin\" && available.length > 1) {\n      // Pick head; move it to the end of `entries` so next call picks the next.\n      const picked = available[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      const rest = this.entries.filter((e) => e.id !== picked.id);\n      // Re-assign priorities: rotated entry gets the highest priority value\n      // so it sorts last after `fromSnapshot` rehydration. This makes EC-F\n      // (round-robin state survives save/load) work without a separate field.\n      const maxPriority = this.entries.length - 1;\n      rest.forEach((e, i) => {\n        e.priority = i;\n      });\n      picked.priority = maxPriority;\n      this.entries = [...rest, picked];\n      return picked;\n    }\n\n    // fill_first (default) and 1-entry edge case for round_robin/least_used\n    const picked = available[0];\n    if (picked === undefined) return null;\n    picked.requestCount += 1;\n    return picked;\n  }\n\n  private availableEntries(): PooledCredential[] {\n    const now = Date.now();\n    const out: PooledCredential[] = [];\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") {\n        out.push(entry);\n        continue;\n      }\n      // EC-1: auto-heal expired cooldowns inline.\n      const resetAt = entry.lastErrorResetAt;\n      if (resetAt !== undefined && now >= resetAt) {\n        entry.lastStatus = \"ok\";\n        entry.lastStatusAt = undefined;\n        entry.lastErrorCode = undefined;\n        entry.lastErrorResetAt = undefined;\n        out.push(entry);\n      }\n    }\n    return out;\n  }\n}\n\n/**\n * Drop duplicates by `accessToken`. Keeps the first occurrence (lowest\n * priority wins after sort). EC-C from the edge-case review.\n */\nfunction dedupeByToken(entries: PooledCredential[]): PooledCredential[] {\n  const seen = new Set<string>();\n  const out: PooledCredential[] = [];\n  for (const e of entries) {\n    if (seen.has(e.accessToken)) continue;\n    seen.add(e.accessToken);\n    out.push(e);\n  }\n  return out;\n}\n","/**\n * Per-fork credential-pool inheritance via `AsyncLocalStorage` (ADR D131).\n *\n * Mirrors the whitelist context pattern from D111\n * (`runtime/async-local-storage.ts`). Forked sub-agents inherit the\n * parent's pool *by reference* so concurrent rotations all observe\n * the same cooldown state — the desired behavior per Hermes parity.\n *\n * @internal\n */\n\nimport { AsyncLocalStorage } from \"node:async_hooks\";\n\nimport type { CredentialPool } from \"./credential-pool.js\";\n\n/** ALS slot — keyed by provider name → pool. */\nconst credentialPoolStore = new AsyncLocalStorage<Map<string, CredentialPool>>();\n\n/**\n * Run `fn` with `pools` as the active credential-pool registry for the\n * current async context. Nested calls shadow the outer map (parent\n * pools are not visible to children when the child sets its own).\n *\n * @internal\n */\nexport async function withCredentialPool<T>(\n  pools: Map<string, CredentialPool>,\n  fn: () => Promise<T>,\n): Promise<T> {\n  return credentialPoolStore.run(pools, fn);\n}\n\n/**\n * Pool registered for `provider` in the current async context, or\n * `undefined` when no `withCredentialPool(...)` scope is active.\n *\n * @internal\n */\nexport function currentCredentialPool(provider: string): CredentialPool | undefined {\n  return credentialPoolStore.getStore()?.get(provider);\n}\n"]}
+{"version":3,"sources":["../src/internal/llm/credential-pool-types.ts","../src/internal/llm/retry.ts","../src/internal/llm/credential-pool.ts","../src/internal/llm/credential-pool-context.ts"],"names":["ConfigurationError","withCwdMutex","picked","AsyncLocalStorage"],"mappings":";;;;;;;AAyFO,IAAM,WAAA,GAAgD;AAAA,EAC3D,GAAA,EAAK,IAAI,EAAA,GAAK,GAAA;AAAA;AAAA,EACd,GAAA,EAAK,KAAK,EAAA,GAAK,GAAA;AAAA;AAAA,EACf,GAAA,EAAK,KAAK,EAAA,GAAK;AAAA;AACjB,CAAA;AAGO,IAAM,mBAAA,GAAsB,KAAK,EAAA,GAAK,GAAA;;;AC7D7C,IAAM,eAAA,GAAkB,GAAA;AACxB,IAAM,cAAA,GAAiB,IAAA;AAchB,SAAS,iBAAiB,IAAA,EAA8B;AAC7D,EAAA,MAAM,IAAA,GAAO,KAAK,MAAA,IAAU,eAAA;AAC5B,EAAA,MAAM,GAAA,GAAM,KAAK,KAAA,IAAS,cAAA;AAC1B,EAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,IAAO,IAAA,CAAK,MAAA;AAC7B,EAAA,IAAI,IAAA,CAAK,YAAA,KAAiB,MAAA,IAAa,IAAA,CAAK,gBAAgB,CAAA,EAAG;AAC7D,IAAA,OAAO,IAAA,CAAK,IAAI,IAAA,EAAM,IAAA,CAAK,IAAI,GAAA,EAAK,IAAA,CAAK,YAAY,CAAC,CAAA;AAAA,EACxD;AACA,EAAA,MAAM,UAAU,IAAA,CAAK,GAAA,CAAI,KAAK,IAAA,GAAO,CAAA,IAAK,KAAK,OAAO,CAAA;AACtD,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,EAAI,GAAI,OAAO,CAAA;AACnC;AASO,SAAS,cAAA,CAAe,IAAY,MAAA,EAAoC;AAC7E,EAAA,IAAI,MAAM,CAAA,IAAK,MAAA,CAAO,OAAA,EAAS,OAAO,QAAQ,OAAA,EAAQ;AACtD,EAAA,OAAO,IAAI,OAAA,CAAc,CAAC,OAAA,KAAY;AACpC,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM;AAC7B,MAAA,MAAA,CAAO,mBAAA,CAAoB,SAAS,OAAO,CAAA;AAC3C,MAAA,OAAA,EAAQ;AAAA,IACV,GAAG,EAAE,CAAA;AACL,IAAA,MAAM,UAAU,MAAY;AAC1B,MAAA,YAAA,CAAa,KAAK,CAAA;AAClB,MAAA,OAAA,EAAQ;AAAA,IACV,CAAA;AACA,IAAA,MAAA,CAAO,iBAAiB,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAM,CAAA;AAAA,EAC1D,CAAC,CAAA;AACH;;;AC/CO,SAAS,oBAAoB,IAAA,EAMf;AACnB,EAAA,OAAO;AAAA,IACL,EAAA,EAAI,UAAA,CAAW,MAAA,CAAO,UAAA,EAAW;AAAA,IACjC,OAAO,IAAA,CAAK,KAAA,IAAS,gBAAgB,IAAA,CAAK,MAAA,EAAQ,KAAK,WAAW,CAAA;AAAA,IAClE,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,QAAQ,IAAA,CAAK,MAAA;AAAA,IACb,aAAa,IAAA,CAAK,WAAA;AAAA,IAClB,UAAA,EAAY,IAAA;AAAA,IACZ,YAAA,EAAc,MAAA;AAAA,IACd,aAAA,EAAe,MAAA;AAAA,IACf,gBAAA,EAAkB,MAAA;AAAA,IAClB,YAAA,EAAc;AAAA,GAChB;AACF;AAQA,SAAS,eAAA,CAAgB,QAAgB,WAAA,EAA6B;AACpE,EAAA,IAAI,OAAO,UAAA,CAAW,MAAM,GAAG,OAAO,MAAA,CAAO,MAAM,CAAC,CAAA;AACpD,EAAA,MAAM,MAAA,GACJ,WAAA,CAAY,MAAA,GAAS,CAAA,GAAI,GAAG,WAAA,CAAY,KAAA,CAAM,CAAA,EAAG,CAAC,CAAC,CAAA,MAAA,EAAI,WAAA,CAAY,KAAA,CAAM,EAAE,CAAC,CAAA,CAAA,GAAK,KAAA;AACnF,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAA,CAAA;AAC5B;AAYO,IAAM,cAAA,GAAN,MAAM,eAAA,CAAe;AAAA,EACjB,QAAA;AAAA,EACQ,QAAA;AAAA,EACT,OAAA;AAAA,EAER,WAAA,CACE,QAAA,EACA,OAAA,EACA,QAAA,GAAmC,YAAA,EACnC;AACA,IAAA,IAAI,OAAA,CAAQ,WAAW,CAAA,EAAG;AACxB,MAAA,MAAM,IAAIA,oCAAA;AAAA,QACR,8DAA8D,QAAQ,CAAA,CAAA,CAAA;AAAA,QACtE,EAAE,MAAM,uBAAA;AAAwB,OAClC;AAAA,IACF;AACA,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAChB,IAAA,IAAA,CAAK,QAAA,GAAW,QAAA;AAEhB,IAAA,IAAA,CAAK,OAAA,GAAU,aAAA,CAAc,OAAO,CAAA,CAAE,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE,QAAQ,CAAA;AAAA,EAC9E;AAAA;AAAA,EAGA,cAAA,GAA0B;AACxB,IAAA,OAAO,IAAA,CAAK,QAAQ,MAAA,GAAS,CAAA;AAAA,EAC/B;AAAA;AAAA,EAGA,YAAA,GAAwB;AACtB,IAAA,OAAO,IAAA,CAAK,gBAAA,EAAiB,CAAE,MAAA,GAAS,CAAA;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,eAAA,GAAsC;AACpC,IAAA,IAAI,QAAA;AACJ,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC/B,MAAA,IAAI,KAAA,CAAM,qBAAqB,MAAA,EAAW;AAC1C,MAAA,IAAI,QAAA,KAAa,MAAA,IAAa,KAAA,CAAM,gBAAA,GAAmB,QAAA,EAAU;AAC/D,QAAA,QAAA,GAAW,KAAA,CAAM,gBAAA;AAAA,MACnB;AAAA,IACF;AACA,IAAA,OAAO,QAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,MAAM,gBAAA,CACJ,MAAA,EACA,IAAA,EAIkB;AAClB,IAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,IAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAChC,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,cAAA;AAChC,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI,GAAI,IAAA,CAAK,SAAA;AACnC,IAAA,OAAO,IAAA,CAAK,GAAA,EAAI,GAAI,QAAA,EAAU;AAC5B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,MAAM,QAAA,GAAW,IAAA,CAAK,sBAAA,CAAuB,QAAQ,CAAA;AACrD,MAAA,MAAM,OAAA,CAAQ,UAAU,MAAM,CAAA;AAC9B,MAAA,IAAI,MAAA,CAAO,SAAS,OAAO,KAAA;AAC3B,MAAA,IAAI,IAAA,CAAK,YAAA,EAAa,EAAG,OAAO,IAAA;AAAA,IAClC;AACA,IAAA,OAAO,KAAK,YAAA,EAAa;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,uBAAuB,QAAA,EAA0B;AACvD,IAAA,MAAM,OAAA,GAAU,KAAK,eAAA,EAAgB;AACrC,IAAA,MAAM,SAAA,GAAY,QAAA,GAAW,IAAA,CAAK,GAAA,EAAI;AACtC,IAAA,MAAM,UACJ,OAAA,KAAY,MAAA,GACR,KAAK,GAAA,CAAI,SAAA,EAAW,GAAG,CAAA,GACvB,IAAA,CAAK,IAAI,SAAA,EAAW,IAAA,CAAK,IAAI,CAAA,EAAG,OAAA,GAAU,KAAK,GAAA,EAAK,IAAI,EAAE,CAAA;AAChE,IAAA,OAAO,IAAA,CAAK,IAAI,CAAA,EAAG,IAAA,CAAK,MAAM,IAAA,CAAK,MAAA,EAAO,GAAI,OAAO,CAAC,CAAA;AAAA,EACxD;AAAA;AAAA,EAGA,IAAA,GAAoC;AAClC,IAAA,OAAO,IAAA,CAAK,OAAA;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,MAAA,GAA2C;AAC/C,IAAA,OAAOC,8BAAA,CAAa,mBAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY,IAAA,CAAK,cAAc,CAAA;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,uBAAuB,IAAA,EAIQ;AACnC,IAAA,OAAOA,8BAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AAClE,MAAA,MAAM,KAAA,GAAQ,KAAK,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAO,IAAA,CAAK,OAAO,CAAA;AAC5D,MAAA,IAAI,UAAU,MAAA,EAAW;AACvB,QAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,QAAA,MAAM,QAAA,GAAW,WAAA,CAAY,IAAA,CAAK,UAAU,CAAA,IAAK,mBAAA;AACjD,QAAA,KAAA,CAAM,UAAA,GAAa,WAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,GAAA;AACrB,QAAA,KAAA,CAAM,gBAAgB,IAAA,CAAK,UAAA;AAE3B,QAAA,KAAA,CAAM,gBAAA,GACJ,KAAK,SAAA,KAAc,MAAA,IAAa,KAAK,SAAA,GAAY,GAAA,GAAM,IAAA,CAAK,SAAA,GAAY,GAAA,GAAM,QAAA;AAAA,MAClF;AACA,MAAA,OAAO,KAAK,YAAA,EAAa;AAAA,IAC3B,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,QAAA,GAA0B;AAC9B,IAAA,MAAMA,8BAAA,CAAa,CAAA,gBAAA,EAAmB,IAAA,CAAK,QAAQ,IAAI,YAAY;AACjE,MAAA,KAAA,MAAW,CAAA,IAAK,KAAK,OAAA,EAAS;AAC5B,QAAA,CAAA,CAAE,UAAA,GAAa,IAAA;AACf,QAAA,CAAA,CAAE,YAAA,GAAe,MAAA;AACjB,QAAA,CAAA,CAAE,aAAA,GAAgB,MAAA;AAClB,QAAA,CAAA,CAAE,gBAAA,GAAmB,MAAA;AAAA,MACvB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAGA,UAAA,GAAqC;AACnC,IAAA,OAAO;AAAA,MACL,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,UAAU,IAAA,CAAK,QAAA;AAAA,MACf,OAAA,EAAS,KAAK,OAAA,CAAQ,GAAA,CAAI,CAAC,CAAA,MAAO,EAAE,GAAG,CAAA,EAAE,CAAE;AAAA,KAC7C;AAAA,EACF;AAAA;AAAA,EAGA,OAAO,aAAa,QAAA,EAAkD;AACpE,IAAA,OAAO,IAAI,eAAA,CAAe,QAAA,CAAS,UAAU,QAAA,CAAS,OAAA,EAAS,SAAS,QAAQ,CAAA;AAAA,EAClF;AAAA;AAAA;AAAA,EAKQ,YAAA,GAAwC;AAC9C,IAAA,MAAM,SAAA,GAAY,KAAK,gBAAA,EAAiB;AACxC,IAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,IAAA;AAEnC,IAAA,IAAI,IAAA,CAAK,aAAa,QAAA,EAAU;AAC9B,MAAA,MAAM,MAAM,IAAA,CAAK,KAAA,CAAM,KAAK,MAAA,EAAO,GAAI,UAAU,MAAM,CAAA;AACvD,MAAA,MAAMC,OAAAA,GAAS,UAAU,GAAG,CAAA;AAC5B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,YAAA,IAAgB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE1D,MAAA,MAAMA,OAAAA,GAAS,CAAC,GAAG,SAAS,CAAA,CAAE,IAAA;AAAA,QAC5B,CAAC,GAAG,CAAA,KAAM,CAAA,CAAE,eAAe,CAAA,CAAE,YAAA,IAAgB,CAAA,CAAE,QAAA,GAAW,CAAA,CAAE;AAAA,QAC5D,CAAC,CAAA;AACH,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,OAAOA,OAAAA;AAAA,IACT;AAEA,IAAA,IAAI,IAAA,CAAK,QAAA,KAAa,aAAA,IAAiB,SAAA,CAAU,SAAS,CAAA,EAAG;AAE3D,MAAA,MAAMA,OAAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,MAAA,IAAIA,OAAAA,KAAW,QAAW,OAAO,IAAA;AACjC,MAAAA,QAAO,YAAA,IAAgB,CAAA;AACvB,MAAA,MAAM,IAAA,GAAO,KAAK,OAAA,CAAQ,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,EAAA,KAAOA,OAAAA,CAAO,EAAE,CAAA;AAI1D,MAAA,MAAM,WAAA,GAAc,IAAA,CAAK,OAAA,CAAQ,MAAA,GAAS,CAAA;AAC1C,MAAA,IAAA,CAAK,OAAA,CAAQ,CAAC,CAAA,EAAG,CAAA,KAAM;AACrB,QAAA,CAAA,CAAE,QAAA,GAAW,CAAA;AAAA,MACf,CAAC,CAAA;AACD,MAAAA,QAAO,QAAA,GAAW,WAAA;AAClB,MAAA,IAAA,CAAK,OAAA,GAAU,CAAC,GAAG,IAAA,EAAMA,OAAM,CAAA;AAC/B,MAAA,OAAOA,OAAAA;AAAA,IACT;AAGA,IAAA,MAAM,MAAA,GAAS,UAAU,CAAC,CAAA;AAC1B,IAAA,IAAI,MAAA,KAAW,QAAW,OAAO,IAAA;AACjC,IAAA,MAAA,CAAO,YAAA,IAAgB,CAAA;AACvB,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,gBAAA,GAAuC;AAC7C,IAAA,MAAM,GAAA,GAAM,KAAK,GAAA,EAAI;AACrB,IAAA,MAAM,MAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,KAAA,IAAS,KAAK,OAAA,EAAS;AAChC,MAAA,IAAI,KAAA,CAAM,eAAe,IAAA,EAAM;AAC7B,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AACd,QAAA;AAAA,MACF;AAEA,MAAA,MAAM,UAAU,KAAA,CAAM,gBAAA;AACtB,MAAA,IAAI,OAAA,KAAY,MAAA,IAAa,GAAA,IAAO,OAAA,EAAS;AAC3C,QAAA,KAAA,CAAM,UAAA,GAAa,IAAA;AACnB,QAAA,KAAA,CAAM,YAAA,GAAe,MAAA;AACrB,QAAA,KAAA,CAAM,aAAA,GAAgB,MAAA;AACtB,QAAA,KAAA,CAAM,gBAAA,GAAmB,MAAA;AACzB,QAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA,MAChB;AAAA,IACF;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AACF;AAMA,SAAS,cAAc,OAAA,EAAiD;AACtE,EAAA,MAAM,IAAA,uBAAW,GAAA,EAAY;AAC7B,EAAA,MAAM,MAA0B,EAAC;AACjC,EAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,IAAA,IAAI,IAAA,CAAK,GAAA,CAAI,CAAA,CAAE,WAAW,CAAA,EAAG;AAC7B,IAAA,IAAA,CAAK,GAAA,CAAI,EAAE,WAAW,CAAA;AACtB,IAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AAAA,EACZ;AACA,EAAA,OAAO,GAAA;AACT;ACvUA,IAAM,mBAAA,GAAsB,IAAIC,6BAAA,EAA+C;AAS/E,eAAsB,kBAAA,CACpB,OACA,EAAA,EACY;AACZ,EAAA,OAAO,mBAAA,CAAoB,GAAA,CAAI,KAAA,EAAO,EAAE,CAAA;AAC1C;AAQO,SAAS,sBAAsB,QAAA,EAA8C;AAClF,EAAA,OAAO,mBAAA,CAAoB,QAAA,EAAS,EAAG,GAAA,CAAI,QAAQ,CAAA;AACrD","file":"chunk-F3YZMOAU.cjs","sourcesContent":["/**\n * Types for the credential pool subsystem (ADRs D123-D133).\n *\n * Pool a developer's multiple API keys for the SAME provider so the SDK\n * can rotate transparently on HTTP 429/402/401 instead of jumping\n * straight to a different provider via `FallbackLlmClient`.\n *\n * @internal\n */\n\n/**\n * Rotation strategy when picking the next credential from a pool.\n *\n * - `fill_first` (default): use entries[0] until exhausted, then [1]…\n * - `round_robin`: rotate after each `select()`\n * - `least_used`: pick the entry with the lowest `requestCount`\n * - `random`: random pick among healthy entries\n *\n * Closed enum per ADR D124 — adding a strategy is an explicit semver\n * minor that updates `selectByStrategy` exhaustively.\n *\n * @internal\n */\nexport type CredentialPoolStrategy = \"fill_first\" | \"round_robin\" | \"least_used\" | \"random\";\n\n/** Health flag tracked per credential. */\nexport type CredentialStatus = \"ok\" | \"exhausted\";\n\n/**\n * Provenance of a credential — where it came from when seeded.\n * Free-form string; conventional prefixes:\n *\n * - `env:<VAR_NAME>` — auto-discovered from environment variable\n * - `manual` — added via explicit `apiKeys` config\n * - `explicit-apikey` — wrapped from `AgentOptions.apiKey` single-key path (D132)\n */\nexport type CredentialSource = string;\n\n/**\n * Single credential entry inside a {@link CredentialPool}.\n *\n * `accessToken` is the sensitive field — must never be logged unredacted.\n * The lint gate `tests/lint/no-unredacted-pool-token.test.ts` enforces this.\n *\n * @internal\n */\nexport interface PooledCredential {\n  /** Stable identifier (uuid v4) for log lines + telemetry. */\n  id: string;\n  /** Human-readable label for `Theokit.credentialPool.list()`. */\n  label: string;\n  /** Provider name (matches `ProviderProfile.name`). */\n  provider: string;\n  /** Sort key; lower = earlier in fill_first. Unique within a pool. */\n  priority: number;\n  /** Provenance string. */\n  source: CredentialSource;\n  /** Sensitive API key. NEVER LOG UNREDACTED. */\n  accessToken: string;\n  /** Current health. */\n  lastStatus: CredentialStatus;\n  /** Epoch ms of the last status change. */\n  lastStatusAt: number | undefined;\n  /** HTTP code that caused exhaustion (401/402/429). */\n  lastErrorCode: number | undefined;\n  /** Provider-supplied \"retry after this epoch ms\" hint. Overrides cooldown defaults. */\n  lastErrorResetAt: number | undefined;\n  /** Bumped per successful `select()` for `least_used` strategy. Lazy-persisted. */\n  requestCount: number;\n}\n\n/**\n * Serializable snapshot of a single provider's pool. Used by the\n * persistence layer (T2.1) to read/write `~/.theokit/credential-pool.json`.\n *\n * @internal\n */\nexport interface CredentialPoolSnapshot {\n  provider: string;\n  strategy: CredentialPoolStrategy;\n  entries: PooledCredential[];\n}\n\n/**\n * Cooldown ladder by HTTP error code (ADR D125). Provider-supplied\n * `lastErrorResetAt` overrides these defaults when present.\n *\n * @internal\n */\nexport const COOLDOWN_MS: Readonly<Record<number, number>> = {\n  401: 5 * 60 * 1000, // 5 minutes — OAuth refresh can recover quickly\n  402: 60 * 60 * 1000, // 1 hour — billing quota typically hourly+\n  429: 60 * 60 * 1000, // 1 hour — daily-rate-limit windows\n};\n\n/** Default cooldown when no specific code matches. */\nexport const DEFAULT_COOLDOWN_MS = 60 * 60 * 1000;\n","/**\n * T3.4 — exponential backoff with full jitter for credential-pool retry.\n *\n * Why we need this: pre-T3.4 `pool-aware-client.ts:79-83` retried the\n * SAME credential immediately on the first 429 without any wait. When\n * every credential in the pool returned 429 (thundering herd against a\n * shared quota), the client burned through all 5 retry attempts in <1ms,\n * tripped `CredentialPoolExhaustedError`, and surfaced to the agent loop\n * as a hard failure. The user-visible symptom was \"all my keys are\n * exhausted!\" when in reality a 1-2s wait would have cleared the rate\n * limit.\n *\n * AWS Architecture Blog \"Exponential Backoff And Jitter\" (Marc Brooker,\n * 2015) demonstrates full jitter as the canonical pattern: `sleep =\n * random_between(0, base * 2^attempt)`. We extend it with a hard cap\n * (so a 32s sleep never blocks an interactive agent) and honor the\n * provider's `Retry-After` hint when present — the hint always wins over\n * the computed value when it falls within `[base, cap]`.\n *\n * @internal\n */\n\nexport interface BackoffOptions {\n  /** 0-indexed retry attempt number. */\n  attempt: number;\n  /** Base delay in ms (multiplier for 2^attempt). Default 500. */\n  baseMs?: number;\n  /** Hard cap in ms — backoff never sleeps longer than this. Default 32_000. */\n  capMs?: number;\n  /** Provider's Retry-After hint in ms (from header). Takes precedence when in-range. */\n  retryAfterMs?: number;\n  /** Random source — pass a deterministic mock from tests. Default `Math.random`. */\n  rng?: () => number;\n}\n\nconst DEFAULT_BASE_MS = 500;\nconst DEFAULT_CAP_MS = 32_000;\n\n/**\n * Compute the next sleep duration (ms) before retrying a failed request.\n *\n * Algorithm:\n * 1. If `retryAfterMs` is set, prefer it — clamped to `[baseMs, capMs]`.\n *    The provider's hint is the most accurate available signal.\n * 2. Otherwise: `sleep = random(0, min(cap, base * 2^attempt))` — full\n *    jitter per Brooker 2015 ensures coordinated clients (each with\n *    different RNG seeds) spread the retry storm.\n *\n * @internal\n */\nexport function computeBackoffMs(opts: BackoffOptions): number {\n  const base = opts.baseMs ?? DEFAULT_BASE_MS;\n  const cap = opts.capMs ?? DEFAULT_CAP_MS;\n  const rng = opts.rng ?? Math.random;\n  if (opts.retryAfterMs !== undefined && opts.retryAfterMs >= 0) {\n    return Math.max(base, Math.min(cap, opts.retryAfterMs));\n  }\n  const ceiling = Math.min(cap, base * 2 ** opts.attempt);\n  return Math.floor(rng() * ceiling);\n}\n\n/**\n * `setTimeout`-based sleep that resolves early when the abort signal fires.\n * Resolves cleanly (does not throw on abort) so callers decide how to\n * react to the abort downstream.\n *\n * @internal\n */\nexport function sleepWithAbort(ms: number, signal: AbortSignal): Promise<void> {\n  if (ms <= 0 || signal.aborted) return Promise.resolve();\n  return new Promise<void>((resolve) => {\n    const timer = setTimeout(() => {\n      signal.removeEventListener(\"abort\", onAbort);\n      resolve();\n    }, ms);\n    const onAbort = (): void => {\n      clearTimeout(timer);\n      resolve();\n    };\n    signal.addEventListener(\"abort\", onAbort, { once: true });\n  });\n}\n","/**\n * In-memory credential pool with strategy-based rotation (ADRs D123-D133).\n *\n * Pure logic. No I/O — persistence lives in `internal/persistence/\n * credential-pool-store.ts`. The pool is the single source of truth for\n * rotation state within a process; if it diverges from disk (e.g.,\n * process killed mid-rotation per EC-I), the next save heals the\n * inconsistency — at the cost of one extra HTTP 429 per crash.\n *\n * Thread safety: the pool uses an in-process async-aware mutex\n * (`cwd-mutex` D9 keyed by `credential-pool:${provider}`). Cross-process\n * safety happens at the persistence layer via `withFileLock` (D61).\n * Two Node processes sharing the same file may double-pick momentarily\n * (worst case = 1 extra 429 per race) — acceptable per ADR D128.\n *\n * @internal\n */\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport { withCwdMutex } from \"../persistence/cwd-mutex.js\";\nimport {\n  COOLDOWN_MS,\n  type CredentialPoolSnapshot,\n  type CredentialPoolStrategy,\n  DEFAULT_COOLDOWN_MS,\n  type PooledCredential,\n} from \"./credential-pool-types.js\";\nimport { sleepWithAbort } from \"./retry.js\";\n\n/**\n * Construct a `PooledCredential` with sane defaults.\n *\n * @internal\n */\nexport function newPooledCredential(args: {\n  provider: string;\n  accessToken: string;\n  priority: number;\n  source: string;\n  label?: string;\n}): PooledCredential {\n  return {\n    id: globalThis.crypto.randomUUID(),\n    label: args.label ?? labelFromSource(args.source, args.accessToken),\n    provider: args.provider,\n    priority: args.priority,\n    source: args.source,\n    accessToken: args.accessToken,\n    lastStatus: \"ok\",\n    lastStatusAt: undefined,\n    lastErrorCode: undefined,\n    lastErrorResetAt: undefined,\n    requestCount: 0,\n  };\n}\n\n/**\n * Build a human-readable label from the credential source. Used for\n * `Theokit.credentialPool.list()` UX. NEVER includes the raw token.\n *\n * @internal\n */\nfunction labelFromSource(source: string, accessToken: string): string {\n  if (source.startsWith(\"env:\")) return source.slice(4);\n  const masked =\n    accessToken.length > 8 ? `${accessToken.slice(0, 4)}…${accessToken.slice(-4)}` : \"***\";\n  return `${source}:${masked}`;\n}\n\n/**\n * Per-provider credential pool. Construct with one or more entries\n * sorted by priority. Throws `ConfigurationError` on empty input.\n *\n * EC-C: identical `accessToken`s are deduplicated during construction\n * (3 copies of \"k1\" → 1 entry). Otherwise an exhaustion event would\n * mark \"k1\" exhausted 3× wastefully.\n *\n * @internal\n */\nexport class CredentialPool {\n  readonly provider: string;\n  private readonly strategy: CredentialPoolStrategy;\n  private entries: PooledCredential[];\n\n  constructor(\n    provider: string,\n    entries: PooledCredential[],\n    strategy: CredentialPoolStrategy = \"fill_first\",\n  ) {\n    if (entries.length === 0) {\n      throw new ConfigurationError(\n        `credential-pool: cannot construct empty pool for provider \"${provider}\"`,\n        { code: \"credential_pool_empty\" },\n      );\n    }\n    this.provider = provider;\n    this.strategy = strategy;\n    // EC-C: dedupe by accessToken before sort.\n    this.entries = dedupeByToken(entries).sort((a, b) => a.priority - b.priority);\n  }\n\n  /** True if the pool was seeded with at least one entry. */\n  hasCredentials(): boolean {\n    return this.entries.length > 0;\n  }\n\n  /** True iff at least one entry is healthy (auto-healed if cooldown expired). */\n  hasAvailable(): boolean {\n    return this.availableEntries().length > 0;\n  }\n\n  /**\n   * Earliest `lastErrorResetAt` across all entries, or `undefined` if no\n   * entry is in cooldown. Used by `waitForAvailable` to compute the\n   * upper bound of each jittered sleep window.\n   *\n   * @internal\n   */\n  earliestResetAt(): number | undefined {\n    let earliest: number | undefined;\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") continue;\n      if (entry.lastErrorResetAt === undefined) continue;\n      if (earliest === undefined || entry.lastErrorResetAt < earliest) {\n        earliest = entry.lastErrorResetAt;\n      }\n    }\n    return earliest;\n  }\n\n  /**\n   * Wait until at least one entry becomes healthy OR `maxWaitMs` elapses\n   * OR `signal` aborts. Returns `true` if a healthy entry is available\n   * when the call returns, `false` otherwise.\n   *\n   * T3.9 — Reconnect storm prevention. Concurrent callers each sleep a\n   * random fraction of the window to the earliest cooldown reset (full\n   * jitter — AWS Brooker 2015) so they do not all wake at the exact\n   * instant cooldown expires and hammer the upstream simultaneously.\n   *\n   * The `sleeper` parameter is a dependency-injection seam for tests:\n   * callers in production omit it and the default `setTimeout`-based\n   * sleeper is used. The seam avoids the `vi.useFakeTimers()` mismatch\n   * that blocked T3.4's wiring.\n   *\n   * @internal\n   */\n  async waitForAvailable(\n    signal: AbortSignal,\n    opts: {\n      maxWaitMs: number;\n      sleeper?: (ms: number, signal: AbortSignal) => Promise<void>;\n    },\n  ): Promise<boolean> {\n    if (signal.aborted) return false;\n    if (this.hasAvailable()) return true;\n    const sleeper = opts.sleeper ?? sleepWithAbort;\n    const deadline = Date.now() + opts.maxWaitMs;\n    while (Date.now() < deadline) {\n      if (signal.aborted) return false;\n      const jittered = this.computeJitteredSleepMs(deadline);\n      await sleeper(jittered, signal);\n      if (signal.aborted) return false;\n      if (this.hasAvailable()) return true;\n    }\n    return this.hasAvailable();\n  }\n\n  /**\n   * Compute the next jittered sleep window (ms) for `waitForAvailable`.\n   * Full-jitter cap: at most (a) time until the earliest reset (plus a\n   * 50 ms grace so the entry actually heals before re-probe), or (b) the\n   * remaining wait window, whichever is smaller. When no entry has a\n   * known reset (rare — only if `markExhaustedAndRotate` was called\n   * without `resetAtMs`), fall back to a 250 ms ceiling so we stay\n   * responsive without hot-looping.\n   */\n  private computeJitteredSleepMs(deadline: number): number {\n    const resetAt = this.earliestResetAt();\n    const remaining = deadline - Date.now();\n    const ceiling =\n      resetAt === undefined\n        ? Math.min(remaining, 250)\n        : Math.min(remaining, Math.max(0, resetAt - Date.now()) + 50);\n    return Math.max(0, Math.floor(Math.random() * ceiling));\n  }\n\n  /** Live (frozen) view of all entries. */\n  list(): readonly PooledCredential[] {\n    return this.entries;\n  }\n\n  /**\n   * Pick a healthy entry according to the configured strategy.\n   * Mutates `requestCount` and (for round_robin) entry order.\n   * Returns null if every entry is in cooldown.\n   *\n   * @internal\n   */\n  async select(): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => this.selectLocked());\n  }\n\n  /**\n   * Mark the entry whose id matches `entryId` as exhausted with the\n   * appropriate cooldown, then return the next healthy entry (or null).\n   * If `entryId` is undefined, marks all currently-active entries (rare —\n   * only used by admin reset scenarios).\n   *\n   * @internal\n   */\n  async markExhaustedAndRotate(args: {\n    entryId: string;\n    statusCode: number;\n    resetAtMs?: number;\n  }): Promise<PooledCredential | null> {\n    return withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      const entry = this.entries.find((e) => e.id === args.entryId);\n      if (entry !== undefined) {\n        const now = Date.now();\n        const cooldown = COOLDOWN_MS[args.statusCode] ?? DEFAULT_COOLDOWN_MS;\n        entry.lastStatus = \"exhausted\";\n        entry.lastStatusAt = now;\n        entry.lastErrorCode = args.statusCode;\n        // EC-5: negative or stale resetAt → ignore, fall through to default.\n        entry.lastErrorResetAt =\n          args.resetAtMs !== undefined && args.resetAtMs > now ? args.resetAtMs : now + cooldown;\n      }\n      return this.selectLocked();\n    });\n  }\n\n  /** Admin escape hatch: clear all cooldowns. */\n  async resetAll(): Promise<void> {\n    await withCwdMutex(`credential-pool:${this.provider}`, async () => {\n      for (const e of this.entries) {\n        e.lastStatus = \"ok\";\n        e.lastStatusAt = undefined;\n        e.lastErrorCode = undefined;\n        e.lastErrorResetAt = undefined;\n      }\n    });\n  }\n\n  /** Materialize for persistence. */\n  toSnapshot(): CredentialPoolSnapshot {\n    return {\n      provider: this.provider,\n      strategy: this.strategy,\n      entries: this.entries.map((e) => ({ ...e })),\n    };\n  }\n\n  /** Hydrate from a previously-saved snapshot. */\n  static fromSnapshot(snapshot: CredentialPoolSnapshot): CredentialPool {\n    return new CredentialPool(snapshot.provider, snapshot.entries, snapshot.strategy);\n  }\n\n  // ─── Internal helpers (always called inside the mutex) ───\n\n  // biome-ignore lint/complexity/noExcessiveCognitiveComplexity: strategy dispatch must branch on 4 enum values (random/least_used/round_robin/fill_first) with 1-entry short-circuits per strategy. Each branch is 5-10 lines of focused logic; extracting per-strategy methods fragments the linear narrative.\n  private selectLocked(): PooledCredential | null {\n    const available = this.availableEntries();\n    if (available.length === 0) return null;\n\n    if (this.strategy === \"random\") {\n      const idx = Math.floor(Math.random() * available.length);\n      const picked = available[idx];\n      if (picked === undefined) return null; // unreachable; satisfies strict\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"least_used\" && available.length > 1) {\n      // EC-3: tie-break by priority ascending (first wins).\n      const picked = [...available].sort(\n        (a, b) => a.requestCount - b.requestCount || a.priority - b.priority,\n      )[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      return picked;\n    }\n\n    if (this.strategy === \"round_robin\" && available.length > 1) {\n      // Pick head; move it to the end of `entries` so next call picks the next.\n      const picked = available[0];\n      if (picked === undefined) return null;\n      picked.requestCount += 1;\n      const rest = this.entries.filter((e) => e.id !== picked.id);\n      // Re-assign priorities: rotated entry gets the highest priority value\n      // so it sorts last after `fromSnapshot` rehydration. This makes EC-F\n      // (round-robin state survives save/load) work without a separate field.\n      const maxPriority = this.entries.length - 1;\n      rest.forEach((e, i) => {\n        e.priority = i;\n      });\n      picked.priority = maxPriority;\n      this.entries = [...rest, picked];\n      return picked;\n    }\n\n    // fill_first (default) and 1-entry edge case for round_robin/least_used\n    const picked = available[0];\n    if (picked === undefined) return null;\n    picked.requestCount += 1;\n    return picked;\n  }\n\n  private availableEntries(): PooledCredential[] {\n    const now = Date.now();\n    const out: PooledCredential[] = [];\n    for (const entry of this.entries) {\n      if (entry.lastStatus === \"ok\") {\n        out.push(entry);\n        continue;\n      }\n      // EC-1: auto-heal expired cooldowns inline.\n      const resetAt = entry.lastErrorResetAt;\n      if (resetAt !== undefined && now >= resetAt) {\n        entry.lastStatus = \"ok\";\n        entry.lastStatusAt = undefined;\n        entry.lastErrorCode = undefined;\n        entry.lastErrorResetAt = undefined;\n        out.push(entry);\n      }\n    }\n    return out;\n  }\n}\n\n/**\n * Drop duplicates by `accessToken`. Keeps the first occurrence (lowest\n * priority wins after sort). EC-C from the edge-case review.\n */\nfunction dedupeByToken(entries: PooledCredential[]): PooledCredential[] {\n  const seen = new Set<string>();\n  const out: PooledCredential[] = [];\n  for (const e of entries) {\n    if (seen.has(e.accessToken)) continue;\n    seen.add(e.accessToken);\n    out.push(e);\n  }\n  return out;\n}\n","/**\n * Per-fork credential-pool inheritance via `AsyncLocalStorage` (ADR D131).\n *\n * Mirrors the whitelist context pattern from D111\n * (`runtime/async-local-storage.ts`). Forked sub-agents inherit the\n * parent's pool *by reference* so concurrent rotations all observe\n * the same cooldown state — the desired behavior per Hermes parity.\n *\n * @internal\n */\n\nimport { AsyncLocalStorage } from \"node:async_hooks\";\n\nimport type { CredentialPool } from \"./credential-pool.js\";\n\n/** ALS slot — keyed by provider name → pool. */\nconst credentialPoolStore = new AsyncLocalStorage<Map<string, CredentialPool>>();\n\n/**\n * Run `fn` with `pools` as the active credential-pool registry for the\n * current async context. Nested calls shadow the outer map (parent\n * pools are not visible to children when the child sets its own).\n *\n * @internal\n */\nexport async function withCredentialPool<T>(\n  pools: Map<string, CredentialPool>,\n  fn: () => Promise<T>,\n): Promise<T> {\n  return credentialPoolStore.run(pools, fn);\n}\n\n/**\n * Pool registered for `provider` in the current async context, or\n * `undefined` when no `withCredentialPool(...)` scope is active.\n *\n * @internal\n */\nexport function currentCredentialPool(provider: string): CredentialPool | undefined {\n  return credentialPoolStore.getStore()?.get(provider);\n}\n"]}

package/dist/{chunk-KIX45IKP.js → chunk-F7AQV62G.js}

@@ -1,5 +1,6 @@
-import { TheokitAgentError } from './chunk-HI4ZW62S.js';
-import { diag, redactSecrets } from './chunk-4X3SBHPK.js';
+import { TheokitAgentError } from './chunk-IDCKSLYH.js';
+import { redactSecrets } from './chunk-T7XEKOVW.js';
+import { diag } from './chunk-T7O6K6PX.js';
 
 // src/internal/runtime/compression/compression-helpers.ts
 function selectCompressionWindow(messages, preserveLast = 6) {
@@ -153,5 +154,5 @@ function shouldCompact(input) {
 }
 
 export { ABSOLUTE_CONTEXT_WINDOW_CAP, CHECKPOINT_MARKER, CONTEXT_WINDOW_FLOOR, CONTEXT_WINDOW_MARGIN, ContextWindowMarginError, SUMMARY_TEMPLATE, buildCheckpoint, compactTranscript, estimateTokens, filterFromLatestCheckpoint, isContextOverflowError, resolveEffectiveContextWindow, shouldCompact };
-//# sourceMappingURL=chunk-KIX45IKP.js.map
-//# sourceMappingURL=chunk-KIX45IKP.js.map
+//# sourceMappingURL=chunk-F7AQV62G.js.map
+//# sourceMappingURL=chunk-F7AQV62G.js.map

package/dist/chunk-F7AQV62G.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/internal/runtime/compression/compression-helpers.ts","../src/compaction.ts"],"names":[],"mappings":";;;;;AA0BO,SAAS,uBAAA,CACd,QAAA,EACA,YAAA,GAAe,CAAA,EACO;AACtB,EAAA,IAAI,QAAA,CAAS,UAAU,YAAA,EAAc;AACnC,IAAA,OAAO,EAAE,YAAY,EAAC,EAAG,YAAY,CAAC,GAAG,QAAQ,CAAA,EAAE;AAAA,EACrD;AACA,EAAA,OAAO;AAAA,IACL,UAAA,EAAY,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,CAAC,YAAY,CAAA;AAAA,IAC3C,UAAA,EAAY,QAAA,CAAS,KAAA,CAAM,CAAC,YAAY;AAAA,GAC1C;AACF;;;ACOO,IAAM,iBAAA,GAAoB;AAQ1B,IAAM,gBAAA,GAAmB,CAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA,4CAAA;AAwBhC,SAAS,aAAa,MAAA,EAAsB;AAC1C,EAAA,IAAI,WAAW,EAAA,EAAI;AACjB,IAAA,MAAM,IAAI,kBAAkB,qCAAA,EAAuC;AAAA,MACjE,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AACF;AAGA,SAAS,cAAA,CAAe,SAA8B,MAAA,EAAyB;AAC7E,EAAA,OAAO,QAAQ,IAAA,KAAS,QAAA,IAAY,CAAC,OAAA,CAAQ,OAAA,CAAQ,WAAW,MAAM,CAAA;AACxE;AAcA,SAAS,mBAAA,CACP,UACA,UAAA,EACgE;AAChE,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,IAAI,aAAa,QAAA,CAAS,MAAA;AAC1B,EAAA,KAAA,IAAS,IAAI,QAAA,CAAS,MAAA,GAAS,GAAG,CAAA,IAAK,CAAA,EAAG,KAAK,CAAA,EAAG;AAChD,IAAA,GAAA,IAAO,cAAA,CAAe,QAAA,CAAS,CAAC,CAAA,EAAG,WAAW,EAAE,CAAA;AAChD,IAAA,IAAI,GAAA,GAAM,UAAA,IAAc,CAAA,GAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AAC/C,MAAA,UAAA,GAAa,CAAA,GAAI,CAAA;AACjB,MAAA;AAAA,IACF;AACA,IAAA,UAAA,GAAa,CAAA;AAAA,EACf;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA,EAAG,MAAA,EAAQ,QAAA,CAAS,KAAA,CAAM,UAAU,CAAA,EAAE;AACnF;AAGA,SAAS,aAAA,CACP,QAAA,EACA,UAAA,EACA,MAAA,EACiB;AACjB,EAAA,MAAM,aAAA,GAAgB,SAAS,MAAA,CAAO,CAAC,MAAM,cAAA,CAAe,CAAA,EAAG,MAAM,CAAC,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,SAAS,MAAA,CAAO,CAAC,MAAM,CAAC,cAAA,CAAe,CAAA,EAAG,MAAM,CAAC,CAAA;AAC9D,EAAA,MAAM,EAAE,UAAA,EAAY,UAAA,EAAW,GAAI,uBAAA,CAAwB,MAAM,UAAU,CAAA;AAC3E,EAAA,OAAO,EAAE,aAAA,EAAe,IAAA,EAAM,UAAA,EAAY,QAAQ,UAAA,EAAW;AAC/D;AAyBA,IAAM,cAAA,0BAAwB,gBAAgB,CAAA;AAG9C,eAAe,YAAA,CACb,SAAA,EACA,IAAA,EACA,QAAA,EACA,QAAA,EACsD;AACtD,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,SAAA,CAAU,IAAA,EAAM,QAAQ,CAAA;AAAA,EACvC,SAAS,GAAA,EAAK;AACZ,IAAA,IAAI,CAAC,UAAU,MAAM,GAAA;AAOrB,IAAA,IAAA;AAAA,MACE,CAAA,8DAAA,EAA4D,cAAc,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAC,CAAC;AAAA;AAAA,KAC7H;AACA,IAAA,OAAO,cAAA;AAAA,EACT;AACF;AASA,eAAsB,iBAAA,CACpB,QAAA,EACA,OAAA,GAAoC,EAAC,EACL;AAChC,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,iBAAA;AACjC,EAAA,YAAA,CAAa,MAAM,CAAA;AACnB,EAAA,MAAM,KAAA,GACJ,QAAQ,UAAA,IAAc,IAAA,GAClB,EAAE,aAAA,EAAe,IAAI,GAAG,mBAAA,CAAoB,UAAU,OAAA,CAAQ,UAAU,GAAE,GAC1E,aAAA,CAAc,UAAU,OAAA,CAAQ,UAAA,IAAc,GAAG,MAAM,CAAA;AAC7D,EAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG;AAC3B,IAAA,OAAO,CAAC,GAAG,QAAQ,CAAA;AAAA,EACrB;AACA,EAAA,IAAI,CAAC,QAAQ,SAAA,EAAW;AACtB,IAAA,OAAO,CAAC,GAAG,KAAA,CAAM,aAAA,EAAe,GAAG,MAAM,MAAM,CAAA;AAAA,EACjD;AACA,EAAA,MAAM,QAAA,GAAW,QAAQ,eAAA,IAAmB,gBAAA;AAC5C,EAAA,MAAM,UAAU,MAAM,YAAA;AAAA,IACpB,OAAA,CAAQ,SAAA;AAAA,IACR,KAAA,CAAM,IAAA;AAAA,IACN,QAAA;AAAA,IACA,QAAQ,QAAA,IAAY;AAAA,GACtB;AACA,EAAA,IAAI,YAAY,cAAA,EAAgB;AAC9B,IAAA,OAAO,CAAC,GAAG,QAAQ,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,CAAC,GAAG,KAAA,CAAM,eAAe,OAAA,EAAS,GAAG,MAAM,MAAM,CAAA;AAC1D;AAMO,SAAS,eAAA,CACd,KAAA,EACA,MAAA,GAAiB,iBAAA,EACI;AACrB,EAAA,YAAA,CAAa,MAAM,CAAA;AACnB,EAAA,OAAO,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,MAAA,IAAU,SAAS,EAAA,CAAA,EAAI;AAC3D;AAkBO,SAAS,0BAAA,CACd,QAAA,EACA,OAAA,GAAmC,EAAC,EACb;AACvB,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,iBAAA;AACjC,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,OAAA,KAAY,MAAA,GAAS,CAAA,GAAI,CAAA;AAChD,EAAA,KAAA,IAAS,IAAI,QAAA,CAAS,MAAA,GAAS,GAAG,CAAA,IAAK,CAAA,EAAG,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,SAAS,CAAC,CAAA,EAAG,OAAA,CAAQ,UAAA,CAAW,MAAM,CAAA,EAAG;AAC3C,MAAA,OAAO,QAAA,CAAS,KAAA,CAAM,CAAA,GAAI,MAAM,CAAA;AAAA,IAClC;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,QAAQ,CAAA;AACrB;AAQO,SAAS,uBAAuB,GAAA,EAAuB;AAC5D,EAAA,OACE,eAAe,iBAAA,KACd,GAAA,CAAI,SAAS,kBAAA,IAAsB,GAAA,CAAI,UAAU,IAAA,KAAS,kBAAA,CAAA;AAE/D;AAOO,IAAM,wBAAA,GAAN,cAAuC,iBAAA,CAAkB;AAAA,EAC9D,YAAqB,MAAA,EAAgB;AACnC,IAAA,KAAA;AAAA,MACE,CAAA,6CAAA,EAAgD,MAAA,CAAO,MAAM,CAAC,CAAA,sFAAA,CAAA;AAAA,MAE9D,EAAE,MAAM,+BAAA;AAAgC,KAC1C;AALmB,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAAA,EAMrB;AAAA,EANqB,MAAA;AAOvB;AAUO,IAAM,qBAAA,GAAwB;AAgB9B,IAAM,oBAAA,GAAuB;AAuC7B,IAAM,2BAAA,GAA8B;AAwBpC,SAAS,8BACd,KAAA,EACwB;AACxB,EAAA,IAAI,EAAE,KAAA,CAAM,MAAA,GAAS,CAAA,CAAA,IAAM,KAAA,CAAM,SAAS,CAAA,EAAG;AAC3C,IAAA,MAAM,IAAI,wBAAA,CAAyB,KAAA,CAAM,MAAM,CAAA;AAAA,EACjD;AAEA,EAAA,MAAM,aAAa,CAAC,GAAA,KAAwB,KAAK,KAAA,CAAM,GAAA,GAAM,MAAM,MAAM,CAAA;AAEzE,EAAA,IAAI,KAAA,CAAM,aAAa,MAAA,EAAW;AAYhC,IAAA,MAAM,GAAA,GAAM,MAAM,OAAA,IAAW,2BAAA;AAC7B,IAAA,MAAM,OAAA,GAAU,MAAM,QAAA,GAAW,GAAA;AACjC,IAAA,OAAO,EAAE,MAAA,EAAQ,UAAA,CAAW,OAAA,GAAU,GAAA,GAAM,MAAM,QAAQ,CAAA,EAAG,MAAA,EAAQ,UAAA,EAAY,OAAA,EAAQ;AAAA,EAC3F;AAEA,EAAA,IAAI,KAAA,CAAM,YAAY,MAAA,EAAW;AAC/B,IAAA,OAAO,EAAE,QAAQ,UAAA,CAAW,KAAA,CAAM,OAAO,CAAA,EAAG,MAAA,EAAQ,SAAA,EAAW,OAAA,EAAS,KAAA,EAAM;AAAA,EAChF;AAEA,EAAA,OAAO,EAAE,MAAA,EAAQ,UAAA,CAAW,KAAA,CAAM,KAAA,IAAS,CAAC,CAAA,EAAG,MAAA,EAAQ,UAAA,EAAY,OAAA,EAAS,KAAA,EAAM;AACpF;AAyBO,SAAS,eAAe,IAAA,EAAsB;AACnD,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAClC;AAUO,SAAS,cAAc,KAAA,EAAoC;AAChE,EAAA,OAAO,MAAM,SAAA,IAAa,KAAA,CAAM,gBAAgB,KAAA,CAAM,MAAA,IAAU,MAAM,SAAA,IAAa,CAAA,CAAA;AACrF","file":"chunk-F7AQV62G.js","sourcesContent":["/**\n * Compression helpers (T2.3, ADR D92).\n *\n * Scaffold for future compression LLM integration:\n *   - `selectCompressionWindow` — splits messages into compress/preserve halves\n *   - `assertCompressionReduced` — 10% reduction floor to detect \"compression placebo\"\n *\n * The compression LLM call itself is out of scope for this plan (requires\n * an auxiliary-model ADR). These helpers are used by `Agent.send` when a\n * future iteration adds compression.\n *\n * @internal\n */\n\nexport interface CompressionWindow<M> {\n  toCompress: M[];\n  toPreserve: M[];\n}\n\n/**\n * Split `messages` into the half to compress (older) and the half to\n * preserve verbatim (recent). When `messages.length <= preserveLast`,\n * everything is preserved.\n *\n * @internal\n */\nexport function selectCompressionWindow<M>(\n  messages: readonly M[],\n  preserveLast = 6,\n): CompressionWindow<M> {\n  if (messages.length <= preserveLast) {\n    return { toCompress: [], toPreserve: [...messages] };\n  }\n  return {\n    toCompress: messages.slice(0, -preserveLast),\n    toPreserve: messages.slice(-preserveLast),\n  };\n}\n\nexport interface CompressionCheck {\n  reduced: boolean;\n  reductionPct: number;\n  reason?: string;\n}\n\n/**\n * Check that compression actually reduced token count by at least `minPct`\n * (default 10%). Returns `{ reduced: false }` for spirals-in-formation\n * (compression LLM outputs that grow or barely shrink).\n *\n * @internal\n */\nexport function assertCompressionReduced(\n  before: number,\n  after: number,\n  minPct = 10,\n): CompressionCheck {\n  if (before <= 0) {\n    return { reduced: false, reductionPct: 0, reason: \"before count was zero\" };\n  }\n  const reductionPct = ((before - after) / before) * 100;\n  if (reductionPct >= minPct) {\n    return { reduced: true, reductionPct };\n  }\n  return {\n    reduced: false,\n    reductionPct,\n    reason: `compression reduced ${reductionPct.toFixed(1)}% (< ${minPct}% min). Spiral likely.`,\n  };\n}\n","/**\n * Public compaction / context-management helpers (M2-1, extended V3-3).\n *\n * Promotes the SDK's compaction capability to a public surface so consumers can\n * compact a transcript, mark/filter conversation checkpoints, and detect\n * context-overflow — without reaching into `internal/`.\n *\n * Two recent-window modes (V3-3):\n *  - `keepRecent` (turn-count, default) — keeps the last N turns verbatim and\n *    always preserves leading system PROMPTS; reuses the internal\n *    `selectCompressionWindow` (no second algorithm).\n *  - `keepTokens` (token-budget) — keeps the trailing turns whose accumulated\n *    `estimateTokens` fits the budget (theocode `splitTranscript` semantics). In\n *    this mode leading system prompts are NOT special-cased (D6).\n *\n * Summarization is delegated to a caller-supplied callback (which receives the\n * older window + the summary template). With `failSafe`, a thrown summarizer\n * returns the ORIGINAL transcript + a structured warn (compaction is an\n * optimization, never a cause of data loss); without it, the error propagates.\n *\n * Public from the `@theokit/sdk/compaction` sub-path.\n */\n\nimport { TheokitAgentError } from \"./errors.js\";\nimport { diag } from \"./internal/diagnostics.js\";\nimport { selectCompressionWindow } from \"./internal/runtime/compression/compression-helpers.js\";\nimport { redactSecrets } from \"./internal/security/redact.js\";\n\n/**\n * Minimal message shape for compaction/compression input. THE canonical public origin (leaf type —\n * rollup-plugin-dts cannot re-export types from internal modules into entry bundles; M42 lesson).\n *\n * @public\n */\nexport interface CompressibleMessage {\n  role: \"user\" | \"assistant\" | \"system\";\n  content: string;\n}\n\n/**\n * Sentinel prefix marking a conversation checkpoint turn. A visible, structured,\n * prose-unlikely token (no invisible/control bytes — safe to persist and to read\n * in source). Only {@link buildCheckpoint} should produce content beginning with it.\n */\nexport const CHECKPOINT_MARKER = \"[[theokit:checkpoint]] \";\n\n/**\n * The 7-section summary template handed to the `summarize` callback (theocode\n * parity shape). Every header is always present so the summarizer cannot silently\n * drop a category; the model is told to preserve file paths, commands, and error\n * text verbatim. Override per-call via {@link CompactTranscriptOptions.summaryTemplate}.\n */\nexport const SUMMARY_TEMPLATE = `Summarize the conversation so far into these sections (keep every header even if empty):\n\n## Goal\nWhat the user is ultimately trying to achieve.\n\n## Constraints\nHard requirements, conventions, and rules stated.\n\n## Progress\nWhat has been done so far.\n\n## Decisions\nChoices made and their rationale.\n\n## Next\nThe immediate next steps.\n\n## Critical\nAnything that MUST NOT be forgotten (preserve verbatim: error messages, exact values).\n\n## Files\nFile paths touched or referenced (verbatim).`;\n\n/** Reject an empty marker — it would match every turn via `startsWith(\"\")` (EC-3). */\nfunction assertMarker(marker: string): void {\n  if (marker === \"\") {\n    throw new TheokitAgentError(\"compaction marker must be non-empty\", {\n      code: \"invalid_argument\",\n    });\n  }\n}\n\n/** True for a real system prompt — a `system` turn that is NOT a checkpoint marker. */\nfunction isSystemPrompt(message: CompressibleMessage, marker: string): boolean {\n  return message.role === \"system\" && !message.content.startsWith(marker);\n}\n\n/** Carried split: leading system prompts (preserved), the older window, the verbatim tail. */\ninterface TranscriptSplit {\n  systemPrompts: CompressibleMessage[];\n  head: CompressibleMessage[];\n  recent: CompressibleMessage[];\n}\n\n/**\n * Token-budget split (theocode `splitTranscript`): walk from the END accumulating\n * `estimateTokens` until `keepTokens` is exceeded; everything older is the head.\n * Always keeps ≥ 1 recent turn. No system-prompt special-casing (D6).\n */\nfunction selectByTokenBudget(\n  messages: CompressibleMessage[],\n  keepTokens: number,\n): { head: CompressibleMessage[]; recent: CompressibleMessage[] } {\n  let acc = 0;\n  let splitIndex = messages.length;\n  for (let i = messages.length - 1; i >= 0; i -= 1) {\n    acc += estimateTokens(messages[i]?.content ?? \"\");\n    if (acc > keepTokens && i < messages.length - 1) {\n      splitIndex = i + 1;\n      break;\n    }\n    splitIndex = i;\n  }\n  return { head: messages.slice(0, splitIndex), recent: messages.slice(splitIndex) };\n}\n\n/** Turn-count split (M2): preserve leading system prompts; window the rest by `keepRecent`. */\nfunction splitByRecent(\n  messages: CompressibleMessage[],\n  keepRecent: number,\n  marker: string,\n): TranscriptSplit {\n  const systemPrompts = messages.filter((m) => isSystemPrompt(m, marker));\n  const rest = messages.filter((m) => !isSystemPrompt(m, marker));\n  const { toCompress, toPreserve } = selectCompressionWindow(rest, keepRecent);\n  return { systemPrompts, head: toCompress, recent: toPreserve };\n}\n\n/** Options for {@link compactTranscript}. */\nexport interface CompactTranscriptOptions {\n  /** Trailing turns preserved verbatim by COUNT (default 6). Ignored when `keepTokens` is set. */\n  keepRecent?: number;\n  /**\n   * Trailing turns preserved verbatim by TOKEN BUDGET (theocode mode). When set,\n   * takes precedence over `keepRecent` and disables system-prompt preservation (D6).\n   */\n  keepTokens?: number;\n  /** Checkpoint marker (default {@link CHECKPOINT_MARKER}). Must be non-empty. */\n  marker?: string;\n  /** Summary template passed to `summarize` (default {@link SUMMARY_TEMPLATE}). */\n  summaryTemplate?: string;\n  /** Summarize the older window into one turn; if omitted, the older window is dropped. */\n  summarize?: (older: CompressibleMessage[], template: string) => Promise<CompressibleMessage>;\n  /**\n   * When true, a thrown `summarize` returns the ORIGINAL transcript + a structured\n   * warn (compaction never loses data). Default false: the error propagates.\n   */\n  failSafe?: boolean;\n}\n\n/** Sentinel returned by {@link runSummarize} when fail-safe swallowed a throw. */\nconst FAILSAFE_ABORT = Symbol(\"failsafe-abort\");\n\n/** Run the summarizer; on throw, either propagate or (fail-safe) warn + signal abort. */\nasync function runSummarize(\n  summarize: NonNullable<CompactTranscriptOptions[\"summarize\"]>,\n  head: CompressibleMessage[],\n  template: string,\n  failSafe: boolean,\n): Promise<CompressibleMessage | typeof FAILSAFE_ABORT> {\n  try {\n    return await summarize(head, template);\n  } catch (err) {\n    if (!failSafe) throw err;\n    // Unbreakable Rule 8 — never fail silently. The breadcrumb points at the root\n    // cause when a summarizer fails every turn and context grows unchecked. The\n    // summarizer is caller-supplied, so its error text is routed through\n    // `redactSecrets` (ADR D68 — no unredacted output sink in src/).\n    // theokit#147 — through the interceptable channel. A summarizer failing every turn is exactly\n    // the breadcrumb a TUI host wants in its own panel, not smeared across its alternate screen.\n    diag(\n      `[compaction] summarizer failed — proceeding uncompacted: ${redactSecrets(err instanceof Error ? err.message : String(err))}\\n`,\n    );\n    return FAILSAFE_ABORT;\n  }\n}\n\n/**\n * Compact a transcript. In `keepRecent` mode (default) the last `keepRecent` turns\n * are kept verbatim and leading system PROMPTS preserved; in `keepTokens` mode the\n * trailing turns within the token budget are kept (no system special-casing, D6).\n * The older window is summarized (via `summarize`, receiving the template) or\n * dropped. Never mutates the input.\n */\nexport async function compactTranscript(\n  messages: CompressibleMessage[],\n  options: CompactTranscriptOptions = {},\n): Promise<CompressibleMessage[]> {\n  const marker = options.marker ?? CHECKPOINT_MARKER;\n  assertMarker(marker);\n  const split =\n    options.keepTokens != null\n      ? { systemPrompts: [], ...selectByTokenBudget(messages, options.keepTokens) }\n      : splitByRecent(messages, options.keepRecent ?? 6, marker);\n  if (split.head.length === 0) {\n    return [...messages];\n  }\n  if (!options.summarize) {\n    return [...split.systemPrompts, ...split.recent];\n  }\n  const template = options.summaryTemplate ?? SUMMARY_TEMPLATE;\n  const summary = await runSummarize(\n    options.summarize,\n    split.head,\n    template,\n    options.failSafe ?? false,\n  );\n  if (summary === FAILSAFE_ABORT) {\n    return [...messages];\n  }\n  return [...split.systemPrompts, summary, ...split.recent];\n}\n\n/**\n * Build a checkpoint marker turn (a `system` turn whose content starts with\n * `marker`, default {@link CHECKPOINT_MARKER}). `marker` must be non-empty.\n */\nexport function buildCheckpoint(\n  label?: string,\n  marker: string = CHECKPOINT_MARKER,\n): CompressibleMessage {\n  assertMarker(marker);\n  return { role: \"system\", content: marker + (label ?? \"\") };\n}\n\n/** Options for {@link filterFromLatestCheckpoint}. */\nexport interface FilterCheckpointOptions {\n  /** Marker to scan for (default {@link CHECKPOINT_MARKER}). */\n  marker?: string;\n  /**\n   * `'after'` (default, M2) returns turns AFTER the latest marker (exclusive);\n   * `'from'` (theocode) returns turns FROM the latest marker (inclusive).\n   */\n  include?: \"after\" | \"from\";\n}\n\n/**\n * Return the turns relative to the most recent checkpoint marker (all turns if\n * none). `include: 'after'` (default) excludes the checkpoint; `'from'` includes\n * it (the summary stands in for the pruned head). Never mutates the input.\n */\nexport function filterFromLatestCheckpoint(\n  messages: CompressibleMessage[],\n  options: FilterCheckpointOptions = {},\n): CompressibleMessage[] {\n  const marker = options.marker ?? CHECKPOINT_MARKER;\n  const offset = options.include === \"from\" ? 0 : 1;\n  for (let i = messages.length - 1; i >= 0; i -= 1) {\n    if (messages[i]?.content.startsWith(marker)) {\n      return messages.slice(i + offset);\n    }\n  }\n  return [...messages];\n}\n\n/**\n * True iff `err` is a {@link TheokitAgentError} (or subclass) reporting a\n * context-window-exceeded condition (the typed `context_too_long` code). Reads\n * both `code` (set by provider mappers) and `metadata.code` (the preferred field)\n * — never a brittle message regex.\n */\nexport function isContextOverflowError(err: unknown): boolean {\n  return (\n    err instanceof TheokitAgentError &&\n    (err.code === \"context_too_long\" || err.metadata?.code === \"context_too_long\")\n  );\n}\n\n/**\n * M77 — the margin is outside `(0, 1]`. Typed, because a margin > 1 would GROW the assumed window,\n * which is the unsafe direction: `shouldCompact` is monotonically decreasing in `contextWindow`, so\n * overestimating it makes the trigger fire too late and the context overflow.\n */\nexport class ContextWindowMarginError extends TheokitAgentError {\n  constructor(readonly margin: number) {\n    super(\n      `context-window margin must be in (0, 1], got ${String(margin)}. ` +\n        `A margin above 1 grows the assumed window and delays compaction past the real limit.`,\n      { code: \"invalid_context_window_margin\" },\n    );\n  }\n}\n\n/**\n * M77 — default safety margin on the context window.\n *\n * `0.95` is not a guess: it is the single reference's value. Codex ships\n * `effective_context_window_percent: 95` (`models-manager/src/model_info.rs:158`) and never budgets\n * against 100% of a window. Being MULTIPLICATIVE, it stays conservative at any window size, which a\n * fixed subtraction would not.\n */\nexport const CONTEXT_WINDOW_MARGIN = 0.95;\n\n/**\n * M77 — the floor used ONLY when neither the catalog nor the caller knows the window.\n *\n * Honest about its own weakness. This number has **one** source (the M77 milestone text); the search\n * for a second one failed, because the reference has no fallback at all — Codex returns `Option` and\n * its callers early-return (`core/src/session/turn_context.rs:213`, `core/src/compact_remote.rs:374`).\n *\n * It is conservative only UPWARD. For a model whose real window is larger, budgeting against 128k\n * compacts early — wasteful but safe. For a model whose real window is SMALLER (an 8k or 32k model\n * absent from the catalog), it compacts too late and the context still overflows. That residual risk\n * is real and is why {@link resolveEffectiveContextWindow} never lets this floor compete with a known\n * catalog value, and why the `compaction_fallback` event exists: a surface can show that the budget is\n * a guess instead of the user finding out when the provider rejects the request.\n */\nexport const CONTEXT_WINDOW_FLOOR = 128_000;\n\n/** Where the effective window came from — carried into the M77 structured event. */\nexport type ContextWindowSource = \"override\" | \"catalog\" | \"fallback\";\n\n/** Input to {@link resolveEffectiveContextWindow}. */\nexport interface EffectiveContextWindowInput {\n  /** Caller-supplied window, in tokens. Clamped by `catalog` when both are present. */\n  readonly override?: number | undefined;\n  /** The model's window from the catalog, in tokens. Absent when the model is unknown. */\n  readonly catalog?: number | undefined;\n  /** Safety margin in `(0, 1]`. Codex uses 0.95 (`model_info.rs:158`). */\n  readonly margin: number;\n  /** Conservative floor used ONLY when neither `override` nor `catalog` is available. */\n  readonly floor?: number | undefined;\n}\n\n/** Result of {@link resolveEffectiveContextWindow}. */\nexport interface EffectiveContextWindow {\n  /** The window to budget against, after clamp and margin. */\n  readonly window: number;\n  /** Which input won — `\"fallback\"` means neither override nor catalog was available. */\n  readonly source: ContextWindowSource;\n  /** `true` when an `override` above the catalog window was clamped down to it. */\n  readonly clamped: boolean;\n}\n\n/**\n * Absolute cap on a declared context window, applied when no catalog entry exists to compare against.\n *\n * **10M**, not 2M. The first version used 2M on the rationale that it sat \"comfortably above the\n * largest published window\" — adversarial review measured the opposite: Llama 4 Scout publishes\n * **10M**, and it arrives precisely via OpenRouter, the provider **without** a catalog, which is the\n * case this cap exists to cover. The user would have silently lost 80% of the declared window.\n *\n * The cap still serves what motivates it — one extra zero on 400k gives 4M, which passes; two zeros\n * give 40M, which does not. A limit that rejects legitimate configuration is worse than no limit,\n * because failing OPEN is visible when it happens and silently losing 80% is not.\n */\nexport const ABSOLUTE_CONTEXT_WINDOW_CAP = 10_000_000;\n\n/**\n * Resolve the window to budget against — the fail-SAFE replacement for reading the catalog directly.\n *\n * Today `post-run-lifecycle.ts` reads `getCatalogModelInfo(model)?.limit?.context` and, when that is\n * `undefined`, auto-compaction simply never fires. That is fail-OPEN: the context grows until the\n * provider rejects the request. (The comment there calls it \"fail-safe\" — M77 corrects it.)\n *\n * Three techniques, two of them borrowed from the single reference:\n *\n *  1. **Override, CLAMPED by the catalog** — Codex `models-manager/src/model_info.rs:26-31` lets\n *     config override the window but limits it with `context_window.min(max_context_window)`.\n *     Without the clamp, declaring 999k on a 200k model reopens the overflow through another door.\n *  2. **Multiplicative margin** — Codex `model_info.rs:158` (`effective_context_window_percent: 95`)\n *     never budgets against 100% of the window. Being multiplicative, it is conservative for ANY\n *     window size.\n *  3. **Floor, only when nothing is known** — deliberately NOT a blanket default. A fixed floor is\n *     conservative only upward: applied to a small model it would inflate the assumed window and\n *     reproduce the very fail-open this function exists to close. Hence the floor never competes\n *     with a known catalog value.\n *\n * Pure — no catalog lookup, no I/O. The caller supplies the numbers, mirroring `shouldCompact`.\n */\nexport function resolveEffectiveContextWindow(\n  input: EffectiveContextWindowInput,\n): EffectiveContextWindow {\n  if (!(input.margin > 0) || input.margin > 1) {\n    throw new ContextWindowMarginError(input.margin);\n  }\n\n  const withMargin = (raw: number): number => Math.floor(raw * input.margin);\n\n  if (input.override !== undefined) {\n    // The catalog is the preferred cap; without it the ABSOLUTE cap applies.\n    //\n    // M95 (adversarial review of M94) — the previous version clamped **only** when a catalog entry\n    // existed, and the whole reason the `contextWindow` key exists is the model that has NO entry\n    // (OpenRouter has zero). So the clamp was missing in exactly the case that justifies the\n    // feature, while the documentation — including an already-published CHANGELOG — stated without\n    // qualification that \"declaring 10M does not blow past the provider\".\n    //\n    // The concrete scenario is one extra zero: `context_window = 4000000`. The only guard was a\n    // `.positive().int()`, which sets no upper bound. The agent would never compact until the\n    // provider refused the turn — the silent fail-OPEN that M77 exists to prevent.\n    const cap = input.catalog ?? ABSOLUTE_CONTEXT_WINDOW_CAP;\n    const clamped = input.override > cap;\n    return { window: withMargin(clamped ? cap : input.override), source: \"override\", clamped };\n  }\n\n  if (input.catalog !== undefined) {\n    return { window: withMargin(input.catalog), source: \"catalog\", clamped: false };\n  }\n\n  return { window: withMargin(input.floor ?? 0), source: \"fallback\", clamped: false };\n}\n\n/** Input to {@link shouldCompact}: an estimate, the model's window, and reserved headroom. */\nexport interface ShouldCompactInput {\n  /** Estimated token count of the next request (e.g. from {@link estimateTokens}). */\n  readonly estimated: number;\n  /** The model's total context window, in tokens. */\n  readonly contextWindow: number;\n  /** Tokens to reserve as headroom (output + safety margin). */\n  readonly buffer: number;\n  /**\n   * Tokens reserved for the model's response generation, SEPARATE from `buffer`.\n   * Default 0 — omitting it preserves the legacy\n   * `estimated >= contextWindow - buffer` result.\n   */\n  readonly maxOutput?: number;\n}\n\n/**\n * Tokenizer-free token estimate via the conventional ~4-chars-per-token\n * heuristic: `ceil(text.length / 4)`. `\"\"` → 0; any non-empty text → ≥ 1.\n * A cheap PRE-CALL gate for {@link shouldCompact} — NOT exact tokenization\n * (a consumer needing exactness supplies their own tokenizer). Uses UTF-16\n * `.length` (code units), so multibyte text is approximate.\n */\nexport function estimateTokens(text: string): number {\n  return Math.ceil(text.length / 4);\n}\n\n/**\n * Decide BEFORE sending whether to compact: `true` when the `estimated` token\n * count leaves less than `buffer` headroom in the `contextWindow`\n * (`estimated >= contextWindow - buffer`). A `buffer >= contextWindow`\n * (non-positive threshold) always returns `true`. Pure — the caller supplies\n * the window (e.g. from `resolveModelCapabilities`), keeping this decoupled\n * from the per-model catalog.\n */\nexport function shouldCompact(input: ShouldCompactInput): boolean {\n  return input.estimated >= input.contextWindow - input.buffer - (input.maxOutput ?? 0);\n}\n"]}

package/dist/{chunk-2YWWPCGX.js → chunk-FXEUP75G.js}

@@ -1,6 +1,6 @@
-import { resolveCredential } from './chunk-XRI6DXPZ.js';
-import { readStoredOAuth } from './chunk-23VZBRDQ.js';
-import { diag } from './chunk-4X3SBHPK.js';
+import { resolveCredential } from './chunk-44MBDIHG.js';
+import { readStoredOAuth } from './chunk-UQGQFBRL.js';
+import { diag } from './chunk-T7O6K6PX.js';
 import { readFileSync } from 'fs';
 import { dirname, join } from 'path';
 import { fileURLToPath } from 'url';
@@ -213,7 +213,7 @@ var ANTHROPIC = {
   hostname: "api.anthropic.com",
   fallbackModels: ["claude-opus-4-7", "claude-sonnet-4-6", "claude-haiku-4-5-20251001"],
   // M45 — the Anthropic beta-features header (interleaved thinking + fine-grained tool streaming). An
-  // Anthropic API constant, adapted verbatim from OpenCode's anthropic plugin (MIT © 2025 opencode). The
+  // Anthropic API constant. The
   // SANCTIONED behavior delta of M45 (ADR D4) — consumed by the anthropic transport's extraHeaders wiring.
   extraHeaders: {
     "anthropic-beta": "interleaved-thinking-2025-05-14,fine-grained-tool-streaming-2025-05-14"
@@ -423,11 +423,9 @@ var OPENAI_CHATGPT = {
     "openai-chatgpt/gpt-5.4-mini",
     "openai-chatgpt/gpt-5.5"
   ],
-  // #165 — this shipped as `codex_cli_rs`, which is the OFFICIAL Codex CLI's own value
-  // (`codex-rs/login/src/auth/default_client.rs`, `DEFAULT_ORIGINATOR`). Claiming to be a different
-  // vendor's client is a false statement of identity, and it diverged from the very prior art this
-  // file is adapted from: OpenCode sends `originator: "opencode"` — its own name — against this same
-  // endpoint, which also shows the route is not restricted to the official client.
+  // #165 — this shipped as `codex_cli_rs`, another vendor's client identifier. Claiming to be a different
+  // vendor's client is a false statement of identity. Third-party clients send their OWN name against
+  // this same endpoint, which also shows the route is not restricted to the official client.
   extraHeaders: { originator: "theokit" },
   transform: {
     // Only `fetch` (async) can await the credential refresh; `headers` is sync and cannot.
@@ -448,7 +446,7 @@ var OPENROUTER = {
   hostname: "openrouter.ai",
   // M45 — models refreshed (claude-3-haiku retired upstream).
   fallbackModels: ["openai/gpt-4o-mini", "anthropic/claude-haiku-4-5"],
-  // M45 — OpenRouter app-attribution headers (mechanism from OpenCode's openrouter plugin, MIT; VALUES are
+  // M45 — OpenRouter app-attribution headers. VALUES are
   // theokit's own — copying another app's referer would misattribute traffic).
   extraHeaders: { "HTTP-Referer": "https://usetheo.dev", "X-Title": "theokit" }
 };
@@ -547,5 +545,5 @@ function registerBuiltins() {
 }
 
 export { catalogModelSchema, getCatalogCapabilities, getCatalogModelInfo, getProviderProfile, globalSingleton, inferModelDialect, inferRegionFromModelId, isPatchedModelKey, listProviders, loadProviderCatalog, patchModelInfo, registerBuiltins, registerProvider, resolveBedrockBaseUrl, resolveVertexBaseUrl, stripBedrockPrefix, stripVertexPrefix };
-//# sourceMappingURL=chunk-2YWWPCGX.js.map
-//# sourceMappingURL=chunk-2YWWPCGX.js.map
+//# sourceMappingURL=chunk-FXEUP75G.js.map
+//# sourceMappingURL=chunk-FXEUP75G.js.map