@eddyskywalker/dsh-chatgpt-subscription 0.14.0 → 0.15.0

package/CHANGELOG.md

@@ -2,6 +2,30 @@
 
 ## Unreleased
 
+## 0.15.0 - 2026-10-09
+
+- **[WorkBuddy] 补上网关「在服务但从不公布」的模型，并按厂商归拢模型列表**
+  - **根因是一处反直觉的实测事实：`/v3/config` 不是服务全集。** 国际区实测，`gpt-6-sol`、`gpt-6-luna`、`gemini-3.8-flash` 三个 id 都能正常返回 200 的流式补全，却**完全不在目录里**（该接口只公布 `gpt-6-astra` 一个 GPT-6 成员）。判据只有一条——直接问：`code 11102`「service info not found」是没有这个模型，`code 11133`「provider rejected params」是模型存在、只是参数被拒。**`11133` 不能当存在性证据**：`max_tokens` 给得太小会把目录里的正常模型也波及进来（`gpt-5.5`、`gpt-5.4` 都会落到这一类）。
+  - **只加进内置表等于加了个看不见的模型。** 联网时实时目录会**整体替换**内置表，所以这三个 id 单列一份实测表（`UNPUBLISHED_MODELS`），并在**实时目录解析**与**快照反序列化**两处合并进去；已公布的条目永远优先，合并只填目录没提到的 id。国际区因此从 22 个变 25 个。
+  - **哪些字段是量出来的、哪些是继承的，界线写在代码里。** 存在性、思考档位、图片支持是**打接口测出来的**（`gpt-6-sol` 精确接受 `low`/`medium`/`high`/`xhigh`/`max`、拒绝 `minimal`，与 `gpt-6-astra` 公布的档位表一致；两者都接受 1×1 PNG）。上下文窗口、输出上限、`canDisableThinking` 则是**继承同族已公布的兄弟模型**（`gpt-6-astra` / `gemini-3.5-flash`）并就地标注——网关对这些 id 不公布任何信息，而 `max_tokens` 也不受窗口约束（连 `gpt-6-astra` 自己都接受远超其公布上限的值），从请求侧无法反推。三者仍可在设置页逐模型覆盖。
+  - **同一份现场实读还修正了国际区三处数值**：`glm-5.3-flash` 国际区也开始服务（此前标为仅国区）；`glm-5.3` / `glm-5.2` 国际区输出上限是 48000、`kimi-k2.8-preview` 是 32000。**一条表同时覆盖两区时取小值**：高报会让请求被网关拒绝，低报只是提前压缩，且仍可覆盖。
+  - **国区同步**：新增 `hy4-preview-f`、`space-bunny`，`hy4-preview-x` 已下线。
+  - **模型列表按厂商分组，不再让网关的排列顺序决定观感。** 网关给 `/v3/config` 的顺序是交错厂商的：一行 DeepSeek、一行 GPT-6-Astra、两行混元、一行 Kimi、再三行 GPT——八个 OpenAI 模型在设置页里从不挨在一起。现在按厂商族分组，族内**新代在前**。
+  - **组内排序按版本号比较，而不是照抄目录序。** 这是被实测逼出来的：只做分组时「在服务但不公布」的模型因为追加在已公布列表之后，`gpt-6-sol` 会渲染到 `gpt-5.4` **下面**——最新的沉底。改成比较 id 里的数字段后归位，且数字按**数值**比（`gpt-6.10` 在 `gpt-6.6` 之前），同版本保持目录序（`-flash` 仍领着 `-flash-sg`），读不出版本的 id（`primary-model` 这类别名）保持原位而不瞎猜。
+  - **分组放在 host 而不是设置页。** `modelsForRegion` 同样是请求路径解析模型的入口，在那儿排一次，picker 与 adapter 不可能出现两套顺序；客户端一行未改。
+  - 厂商归属有个坑：`hy3` / `hy4-preview` / `hunyuan-chat` 是腾讯混元的三种写法，必须归到同一组；没有任何规则命中的 id **自成一族**，而不是被扫进一个共享的 `other` 桶。
+  - 测试：新增分组与排序断言（族必须连续、组内新代在前、数值比较、同版本保持目录序），并扩充三个既有目录测试。
+  - 验证：`npm run typecheck` 0 错误；全量 `npm test` **2886 passed / 7 skipped**。另加两个一次性探针（`scripts/probe-workbuddy-catalog.probe.ts` 拉实时目录做差异、`scripts/probe-workbuddy-unlisted.probe.ts` 给目录外的 id 测档位/图片/输出上限），本条的每一项数值都是它们的输出。
+
+- **[思维保护] 推理坍缩守卫补上第二条独立信号：改写型死循环**
+  - **原守卫对「换个说法反复说同一件事」是瞎的。** 唯一率信号只看得见**逐字**重复；一段把同一结论用不同措辞重述的流实测只有 0.48，而阈值是 0.85，于是一路跑到输出上限也没人拦。这不是理论问题——归档样本 `paraphrased-loop-reasoning.txt` 就是这种形态。
+  - **第二条信号量的是「复述」而非「新颖」。** 把窗口切成句子，逐句与至少 `semanticLag` 句之前的内容做 3-gram Jaccard 相似度并取最大值。**枚举式推理也会重复，但它是相邻重复**——每一项借用上一项的句式；复述信号**忽略相邻性**，这正是区分两者的关键，所以健康的枚举流不会被误伤。
+  - **两条路径，低门槛那条在每一步都更严。** 高门槛路径（原规则，未改动）要求唯一率 ≥ 0.85 且复述 ≥ 0.35；低门槛路径（新）允许唯一率低到 0.6，代价是复述门槛抬到 0.45、**外加一道高路径不需要的新颖度上限**（不同句比例 ≤ 0.47），且需要更多次确认（5 次 vs 3 次）。**用更弱的证据换更多、更长的确认。**
+  - **确认是连续窗口计数，不是单窗口触发。** 两个信号必须在同一窗口同时过线，且连续 `semanticConfirmations` 次才动手；只有一方过线、或只有单个异常窗口，一律**只记日志不动作**。断流后连击归零，下一次尝试不会继承它没挣到的确认数。
+  - **近失也留痕。** 单信号命中有专门的 alone 日志（每种每轮只报一次，避免数百行刷屏），连击在够数前断掉也有 cleared 日志——否则两段短连击在日志里与一段长连击长得一模一样，确认数事后无从推理。
+  - 测试：守卫测试 **39 → 80 例**（源文件 480 → 948 行），新增归档样本 fixture 与真实的改写型坍缩样本。
+  - 验证：全量 `npm test` 2886 passed / 7 skipped；守卫专项 80 例全通过。
+
 ## 0.14.0 - 2026-10-08
 
 - **[Claude] 支持 Claude Haiku 5.5（`claude-haiku-5-5`），并把申报的客户端版本抬到 2.1.293**

package/README.md

@@ -153,6 +153,7 @@
   - 插件托管账号可真正删除；桌面扫描账号只能从本插件隐藏/恢复，永不删除 CodeBuddy 的原文件；
   - 两区模型清单不同，把模型发到不服务它的区会返回 400 `code 11102`，因此模型选择器**按当前账号区域过滤**；
 - **模型目录取自网关自己的 `/v3/config`**（官方 CLI 启动时读的就是它）：每个模型的真实上下文上限、输出上限、是否接受图片、以及可用的思考档位都在这里，不做任何按模型名猜测。`/v1/models` 在这条线路上是 404，所以此前只能靠内置表——现在内置表只作为离线兜底，且是**从真实 `/v3/config` 转录**的（早期手写版本把 `glm-5.3`、`kimi-k3` 的窗口猜成 200K/256K，实际都是 1M）；
+- **目录不是服务全集，模型必须实测**：实测国际区的 `gpt-6-sol`、`gpt-6-luna`、`gemini-3.8-flash` 都能正常返回 200，却**完全不在 `/v3/config` 里**（该接口只公布 `gpt-6-astra`）。而联网时目录会**整体替换**内置表，只加进内置表等于加了个看不见的模型——所以这三个单列一份实测表（`UNPUBLISHED_MODELS`），并合并进实时目录。存在性、思考档位、图片支持是**打接口量出来的**（`gpt-6-sol` 只收 `low`/`medium`/`high`/`xhigh`/`max`，`minimal` 被拒）；上下文与输出上限**继承同族已公布的兄弟模型**（`gpt-6-astra` / `gemini-3.5-flash`），因为网关对这些 id 不公布任何信息，而 `max_tokens` 也不受窗口约束（连 `gpt-6-astra` 自己都接受远超其公布上限的值），无从反推。三者仍可在设置页逐模型覆盖；判定一个 id 是否存在只有一条路——直接问：`code 11102` 是没有这个模型，`code 11133` 是模型存在但参数被拒；
 - 目录同时区分**默认服务的上下文长度**与**模型上限**（如 `deepseek-v4.1-flash` 默认 300K、最大 1M）。本线路不发送显式长度参数，所以 DSH 的压缩与溢出判断按**默认服务长度**计算，不会让请求越过后端实际接受的窗口；
 - 思考档位**逐模型**取目录声明的档位表，回落顺序为「调用方显式指定 → 用户配置的默认档 → 目录为该模型声明的默认档」；
   - **最后一档不能省**：上游在请求不带 `reasoning_effort` 时返回**空的 `reasoning_content`**（实测同一提示：不带字段 0 字符，带字段 130–215 字符）——不发送等于静默丢弃模型的思考；

package/lib/index.js

@@ -30276,6 +30276,94 @@ function convergeWorkBuddyEffort(effort, ladder) {
 //#endregion
 //#region src/host/workbuddy/model-catalog.ts
 /**
+* Models the gateway serves but does not publish in `/v3/config`.
+*
+* The catalog is a published list, not the served one: measured on the
+* international backend, `gpt-6-sol`, `gpt-6-luna` and `gemini-3.8-flash` all
+* answer a normal streaming completion with 200 while being absent from
+* `/v3/config` entirely, and a reachable gateway *replaces* the shipped table
+* with that list. Without these rows the picker would simply never show them, so
+* they are declared here and merged into a live catalog too
+* ({@link withUnpublishedModels}) rather than living in the fallback alone.
+*
+* What each row records, and how it was established, differs by field:
+*
+* - **Existence, the reasoning ladder, image support** were measured against the
+*   live endpoint, not inferred from the name. A rejected level answers 400
+*   `code 11133` with `extError` `400002`; `gpt-6-sol` takes exactly the ladder
+*   `gpt-6-astra` publishes (`minimal` refused, `low`/`medium`/`high`/`xhigh`/
+*   `max` accepted) and both accept a 1x1 PNG.
+* - **Context window, output cap and `canDisableThinking` are inherited from the
+*   published sibling in the same family** — `gpt-6-astra` for `gpt-6-sol` and
+*   `gpt-6-luna`, `gemini-3.5-flash` for `gemini-3.8-flash`. They are marked
+*   here rather than measured because the gateway publishes nothing for these
+*   ids and offers no cheap way to read the real figure: it accepts a
+*   `max_tokens` larger than any published window (even for `gpt-6-astra`, whose
+*   own catalog caps at 128000), so the number is neither enforced nor
+*   discoverable from the request side.
+*
+* Every field stays overridable per model from the settings card, and an
+* inherited window errs low rather than high: over-declaring overflows the
+* gateway mid-session, while under-declaring only compresses earlier.
+*/
+const UNPUBLISHED_MODELS = [
+	{
+		id: "gpt-6-sol",
+		name: "GPT-6-Sol",
+		contextWindow: 4e5,
+		maxContextWindow: 1e6,
+		maxTokens: 128e3,
+		regions: ["intl"],
+		supportsImage: true,
+		reasoningEfforts: [
+			"low",
+			"medium",
+			"high",
+			"xhigh",
+			"max"
+		],
+		defaultReasoningEffort: "high",
+		canDisableThinking: true,
+		description: "OpenAI 旗舰模型，擅长复杂推理与长程任务"
+	},
+	{
+		id: "gpt-6-luna",
+		name: "GPT-6-Luna",
+		contextWindow: 4e5,
+		maxContextWindow: 1e6,
+		maxTokens: 128e3,
+		regions: ["intl"],
+		supportsImage: true,
+		reasoningEfforts: [
+			"low",
+			"medium",
+			"high",
+			"xhigh",
+			"max"
+		],
+		defaultReasoningEffort: "high",
+		canDisableThinking: true,
+		description: "OpenAI 轻量模型，响应快速，适合日常任务"
+	},
+	{
+		id: "gemini-3.8-flash",
+		name: "Gemini-3.8-Flash",
+		contextWindow: 1e6,
+		maxContextWindow: 1e6,
+		maxTokens: 65536,
+		regions: ["intl"],
+		supportsImage: true,
+		reasoningEfforts: [
+			"low",
+			"high",
+			"max"
+		],
+		defaultReasoningEffort: "medium",
+		canDisableThinking: false,
+		description: "能力均衡，适合日常使用"
+	}
+];
+/**
 * Offline fallback catalog, transcribed from a live `/v3/config` read.
 *
 * Used when the gateway cannot be reached (first run before sign-in, or a
@@ -30372,6 +30460,7 @@ const FALLBACK_MODELS$1 = [
 		canDisableThinking: false,
 		description: "深度推理，适合深度分析与难题"
 	},
+	...UNPUBLISHED_MODELS.filter((model) => model.id === "gpt-6-sol" || model.id === "gpt-6-luna"),
 	{
 		id: "gpt-6-astra",
 		name: "GPT-6-Astra",
@@ -30489,7 +30578,7 @@ const FALLBACK_MODELS$1 = [
 		name: "GLM-5.3",
 		contextWindow: 1e6,
 		maxContextWindow: 1e6,
-		maxTokens: 64e3,
+		maxTokens: 48e3,
 		regions: ["intl", "cn"],
 		supportsImage: true,
 		reasoningEfforts: [
@@ -30504,10 +30593,10 @@ const FALLBACK_MODELS$1 = [
 	{
 		id: "glm-5.3-flash",
 		name: "GLM-5.3-Flash",
-		contextWindow: 1e6,
+		contextWindow: 3e5,
 		maxContextWindow: 1e6,
 		maxTokens: 32e3,
-		regions: ["cn"],
+		regions: ["intl", "cn"],
 		supportsImage: true,
 		reasoningEfforts: [
 			"low",
@@ -30523,7 +30612,7 @@ const FALLBACK_MODELS$1 = [
 		name: "GLM-5.2",
 		contextWindow: 1e6,
 		maxContextWindow: 1e6,
-		maxTokens: 64e3,
+		maxTokens: 48e3,
 		regions: ["intl", "cn"],
 		supportsImage: true,
 		reasoningEfforts: ["high", "xhigh"],
@@ -30677,7 +30766,7 @@ const FALLBACK_MODELS$1 = [
 		name: "Kimi-K2.8-Preview",
 		contextWindow: 3e5,
 		maxContextWindow: 1e6,
-		maxTokens: 64e3,
+		maxTokens: 32e3,
 		regions: ["intl", "cn"],
 		supportsImage: true,
 		reasoningEfforts: [
@@ -30856,7 +30945,7 @@ const FALLBACK_MODELS$1 = [
 		description: "混元思考模型，具有增强的推理能力"
 	},
 	{
-		id: "hy4-preview-x",
+		id: "hy4-preview-f",
 		name: "Hy4 preview",
 		contextWindow: 1e6,
 		maxContextWindow: 1e6,
@@ -30911,6 +31000,25 @@ const FALLBACK_MODELS$1 = [
 		canDisableThinking: false,
 		description: ""
 	},
+	{
+		id: "space-bunny",
+		name: "Space-Bunny",
+		contextWindow: 1e6,
+		maxContextWindow: 1e6,
+		maxTokens: 128e3,
+		regions: ["cn"],
+		supportsImage: true,
+		reasoningEfforts: [
+			"low",
+			"medium",
+			"high",
+			"xhigh",
+			"max"
+		],
+		defaultReasoningEffort: "max",
+		canDisableThinking: false,
+		description: "推理速度极快，编码能力强劲，并支持原生多模态输入的匿名大模型"
+	},
 	{
 		id: "minimax-m3",
 		name: "MiniMax-M3",
@@ -30962,6 +31070,7 @@ const FALLBACK_MODELS$1 = [
 		canDisableThinking: false,
 		description: ""
 	},
+	...UNPUBLISHED_MODELS.filter((model) => model.id === "gemini-3.8-flash"),
 	{
 		id: "gemini-3.5-flash",
 		name: "Gemini-3.5-Flash",
@@ -30997,6 +31106,21 @@ const DEFAULT_VISIBLE_MODEL_IDS$1 = [
 /** Every id the fallback knows, in declaration order. */
 const WORKBUDDY_MODEL_IDS = FALLBACK_MODELS$1.map((model) => model.id);
 /**
+* Add the served-but-unpublished models to a live `/v3/config` catalog.
+*
+* A reachable gateway replaces the shipped table with the list it publishes, so
+* a model it serves without listing ({@link UNPUBLISHED_MODELS}) would drop out
+* of the picker the moment the catalog loads. Merging here keeps it offered.
+*
+* A published entry always wins: the gateway is the authority on anything it
+* does describe, so these rows only fill ids the payload is silent about.
+*/
+function withUnpublishedModels(catalog, region) {
+	const known = new Set(catalog.map((model) => model.id));
+	const extra = UNPUBLISHED_MODELS.filter((model) => model.regions.includes(region) && !known.has(model.id));
+	return extra.length > 0 ? [...catalog, ...extra] : [...catalog];
+}
+/**
 * Resolve one entry from a catalog.
 *
 * An unknown id resolves to a synthetic text-only entry rather than the first
@@ -31028,9 +31152,131 @@ function resolveWorkBuddyModel(id, catalog = FALLBACK_MODELS$1) {
 		description: ""
 	};
 }
-/** Models an account in `region` can actually call, in catalog order. */
+/**
+* Vendor families, resolved from a model id.
+*
+* The gateway orders `/v3/config` the way it feels like, which interleaves
+* vendors: a DeepSeek row, then a GPT row, then two Hunyuan rows, then a Kimi
+* row, then three more GPT rows. In a picker that reads as noise — the eye
+* cannot tell that the GPT entries belong together — so the list is grouped by
+* family before it is shown.
+*
+* The rules are ordered, first match wins. Only families this subscription
+* actually serves are listed: a rule for a model that cannot appear would be a
+* guess about a future catalog.
+*
+* An id no rule claims is its own family rather than a shared `other` bucket, so
+* an unrecognised model keeps its place in the order instead of being swept into
+* a pile of models it has nothing to do with.
+*/
+const WORKBUDDY_VENDOR_RULES = [
+	{
+		re: /^(default|fast|balanced|primary|deep)(-model)?$/,
+		family: "alias"
+	},
+	{
+		re: /^gpt-/,
+		family: "openai"
+	},
+	{
+		re: /^gemini-/,
+		family: "google"
+	},
+	{
+		re: /^glm-/,
+		family: "zhipu"
+	},
+	{
+		re: /^kimi-/,
+		family: "moonshot"
+	},
+	{
+		re: /^deepseek-/,
+		family: "deepseek"
+	},
+	{
+		re: /^hy[0-9]/,
+		family: "tencent"
+	},
+	{
+		re: /^hunyuan/,
+		family: "tencent"
+	},
+	{
+		re: /^minimax-/,
+		family: "minimax"
+	},
+	{
+		re: /^space-bunny$/,
+		family: "space-bunny"
+	}
+];
+/** The vendor family one model belongs to. */
+function workBuddyModelVendor(id) {
+	const value = id.toLowerCase();
+	for (const rule of WORKBUDDY_VENDOR_RULES) if (rule.re.test(value)) return rule.family;
+	return id;
+}
+/**
+* Numeric segments of a model id, e.g. `gpt-6-astra` → [6].
+*
+* Version numbers are compared as numbers, so GPT-6.0 sorts below GPT-6.6 rather
+* than above it as it would if the strings were compared.
+*/
+function versionSegments$1(id) {
+	return [...id.toLowerCase().matchAll(/\d+/g)].map((match) => Number(match[0]));
+}
+/**
+* Order two models of one family, newest generation first.
+*
+* Catalog order alone is not good enough. The models served but not published
+* are appended after the published list, which left `gpt-6-sol` below
+* `gpt-5.4` — the newest models at the bottom of their own group. Comparing the
+* numeric segments puts every GPT-6 row together and ahead of every GPT-5 one,
+* and leaves an id whose version cannot be read (an alias, a nickname) in the
+* catalog's own order rather than guessing where it belongs.
+*
+* Ties keep catalog order, so `deepseek-v4.1-flash` still leads its
+* `-flash-sg` sibling.
+*/
+function compareWithinFamily(a, b) {
+	const left = versionSegments$1(a.id);
+	const right = versionSegments$1(b.id);
+	for (let index = 0; index < Math.max(left.length, right.length); index += 1) {
+		const x = left[index];
+		const y = right[index];
+		if (x === void 0) return 1;
+		if (y === void 0) return -1;
+		if (x !== y) return y - x;
+	}
+	return 0;
+}
+/**
+* Group a list so every vendor's models sit together.
+*
+* Families appear in the order their first model does — the catalog decides
+* which vendor leads, not this function — and each family is ordered newest
+* generation first.
+*/
+function groupWorkBuddyModelsByVendor(models) {
+	const families = /* @__PURE__ */ new Map();
+	for (const model of models) {
+		const family = workBuddyModelVendor(model.id);
+		const bucket = families.get(family);
+		if (bucket === void 0) families.set(family, [model]);
+		else bucket.push(model);
+	}
+	return [...families.values()].map((bucket) => [...bucket].sort(compareWithinFamily)).flat();
+}
+/**
+* Models an account in `region` can actually call, grouped by vendor.
+*
+* Grouped here rather than in the settings card because this is also what the
+* request path resolves against: one ordering rule, so the picker and the
+* adapter can never disagree about which models a region offers.
+*/
 function modelsForRegion(region, catalog = FALLBACK_MODELS$1) {
-	return catalog.filter((model) => model.regions.includes(region));
+	return groupWorkBuddyModelsByVendor(catalog.filter((model) => model.regions.includes(region)));
 }
 /** Whether one model accepts image input. */
 function workBuddyModelSupportsImage(id, catalog = FALLBACK_MODELS$1) {
@@ -31980,7 +32226,7 @@ async function fetchConfigCatalog(credentials, options = {}) {
 		signal: timeoutSignal$1(options.signal, DISCOVERY_TIMEOUT_MS$1)
 	});
 	if (!response.ok) throw new Error(`${PROVIDER_NAME$1} model catalog failed: ${response.status}`);
-	return parseConfigModels(await response.json(), credentials.region);
+	return withUnpublishedModels(parseConfigModels(await response.json(), credentials.region), credentials.region);
 }
 /** Cached catalog with a TTL; a failed refresh keeps the previous snapshot.
 *
@@ -32014,7 +32260,7 @@ async function loadConfigCatalog(credentials, options = {}) {
 		}, (fetchedAt, models) => {
 			cachedCatalog = {
 				region: credentials.region,
-				models,
+				models: withUnpublishedModels(models, credentials.region),
 				fetchedAt
 			};
 		}, 0) > 0) {
@@ -32540,7 +32786,13 @@ function resolveEnabledModelIds$2(stored, available, enabled = true) {
 	const known = new Set(available);
 	return stored.filter((id) => known.has(id));
 }
-/** Build the model options the settings card renders, in catalog order. */
+/**
+* Build the model options the settings card renders.
+*
+* Order comes from the caller, which passes a vendor-grouped list so a family
+* is not interleaved with the next one; this preserves whatever order it is
+* given rather than imposing a second one.
+*/
 function buildModelOptions(catalog, available, enabledModelIds, overrides) {
 	const enabled = new Set(enabledModelIds);
 	return available.map((id) => {
@@ -45550,6 +45802,22 @@ function installRelayProbe(ctx, options) {
 * degenerate stream scores near one. On a hit it stops yielding chunks, so the
 * in-flight request ends, and lets the turn resume on a fresh step.
 *
+* Uniqueness alone only sees verbatim repetition. A stream can restate one
+* conclusion over and over in fresh words, score 0.48 where the threshold is
+* 0.85, and run to the output ceiling untouched. So a second, independent
+* signal scores the same window for recurrence: how strongly each sentence
+* repeats something the model already said at least `semanticLag` sentences
+* earlier. Enumerative reasoning repeats itself too, but adjacently — each item
+* borrows the previous item's frame — and recurrence ignores adjacency, which
+* is what separates the two.
+*
+* Neither signal stops anything on its own. A break needs both over their
+* thresholds in the same window, and then `semanticConfirmations` consecutive
+* such windows: one signal alone, or a single anomalous window, is logged and
+* released. That gradient is the whole design. A guard that cuts a healthy
+* answer is worse than one that lets a runaway finish, because the user sees a
+* turn stop mid-sentence with no explanation, and the fix costs a whole turn.
+*
 * Seam choice: the guard wraps `llm/stream`, not `agent/assistant-stream`.
 * `agent/assistant-stream` is emit-mode — it can observe but cannot stop a
 * stream — and it does not exist before harness 0.1.5, which would make the
@@ -45586,6 +45854,15 @@ const DEFAULT_GUARD_OPTIONS = {
 	maxBreaksPerTurn: 3,
 	cooldownMs: 3e4,
 	includeModels: [],
+	semanticThreshold: .35,
+	semanticLag: 6,
+	semanticMinChars: 360,
+	semanticMinSentences: 8,
+	semanticConfirmations: 3,
+	semanticLiteralFloor: .6,
+	semanticStrictThreshold: .45,
+	semanticDistinctCeiling: .47,
+	semanticStrictConfirmations: 5,
 	now: () => Date.now()
 };
 function pruneUndefined(options) {
@@ -45611,8 +45888,21 @@ function resolveGuardOptions(options = {}) {
 	if (!Number.isFinite(resolved.threshold) || resolved.threshold <= 0 || resolved.threshold >= 1) throw new Error(`reasoning-collapse-guard: invalid threshold ${String(resolved.threshold)} — must be strictly between 0 and 1`);
 	if (!Number.isInteger(resolved.maxBreaksPerTurn) || resolved.maxBreaksPerTurn < 1) throw new Error(`reasoning-collapse-guard: invalid maxBreaksPerTurn ${String(resolved.maxBreaksPerTurn)} — must be an integer >= 1`);
 	if (!Number.isInteger(resolved.cooldownMs) || resolved.cooldownMs < 0) throw new Error(`reasoning-collapse-guard: invalid cooldownMs ${String(resolved.cooldownMs)} — must be an integer >= 0`);
+	if (!Number.isFinite(resolved.semanticThreshold) || resolved.semanticThreshold <= 0 || resolved.semanticThreshold >= 1) throw new Error(`reasoning-collapse-guard: invalid semanticThreshold ${String(resolved.semanticThreshold)} — must be strictly between 0 and 1`);
+	if (!Number.isInteger(resolved.semanticLag) || resolved.semanticLag < 1) throw new Error(`reasoning-collapse-guard: invalid semanticLag ${String(resolved.semanticLag)} — must be an integer >= 1`);
+	if (!Number.isInteger(resolved.semanticMinChars) || resolved.semanticMinChars < 1) throw new Error(`reasoning-collapse-guard: invalid semanticMinChars ${String(resolved.semanticMinChars)} — must be an integer >= 1`);
+	if (resolved.semanticMinChars > resolved.windowChars) throw new Error(`reasoning-collapse-guard: invalid semanticMinChars ${resolved.semanticMinChars} — must not exceed windowChars ${resolved.windowChars}`);
+	if (!Number.isInteger(resolved.semanticMinSentences) || resolved.semanticMinSentences < 2) throw new Error(`reasoning-collapse-guard: invalid semanticMinSentences ${String(resolved.semanticMinSentences)} — must be an integer >= 2`);
+	if (!Number.isInteger(resolved.semanticConfirmations) || resolved.semanticConfirmations < 1) throw new Error(`reasoning-collapse-guard: invalid semanticConfirmations ${String(resolved.semanticConfirmations)} — must be an integer >= 1`);
+	if (!Number.isFinite(resolved.semanticLiteralFloor) || resolved.semanticLiteralFloor <= 0 || resolved.semanticLiteralFloor >= 1) throw new Error(`reasoning-collapse-guard: invalid semanticLiteralFloor ${String(resolved.semanticLiteralFloor)} — must be strictly between 0 and 1`);
+	if (!Number.isFinite(resolved.semanticStrictThreshold) || resolved.semanticStrictThreshold <= 0 || resolved.semanticStrictThreshold >= 1) throw new Error(`reasoning-collapse-guard: invalid semanticStrictThreshold ${String(resolved.semanticStrictThreshold)} — must be strictly between 0 and 1`);
+	if (!Number.isFinite(resolved.semanticDistinctCeiling) || resolved.semanticDistinctCeiling <= 0 || resolved.semanticDistinctCeiling >= 1) throw new Error(`reasoning-collapse-guard: invalid semanticDistinctCeiling ${String(resolved.semanticDistinctCeiling)} — must be strictly between 0 and 1`);
+	if (!Number.isInteger(resolved.semanticStrictConfirmations) || resolved.semanticStrictConfirmations < 1) throw new Error(`reasoning-collapse-guard: invalid semanticStrictConfirmations ${String(resolved.semanticStrictConfirmations)} — must be an integer >= 1`);
 	if (!Array.isArray(resolved.includeModels) || resolved.includeModels.some((entry) => typeof entry !== "string")) throw new Error("reasoning-collapse-guard: includeModels must be an array of strings");
 	if (typeof resolved.now !== "function") throw new Error("reasoning-collapse-guard: now must be a function");
+	resolved.semanticStrictThreshold = Math.max(resolved.semanticStrictThreshold, resolved.semanticThreshold);
+	resolved.semanticStrictConfirmations = Math.max(resolved.semanticStrictConfirmations, resolved.semanticConfirmations + 1);
+	resolved.semanticLiteralFloor = Math.min(resolved.semanticLiteralFloor, resolved.threshold);
 	return resolved;
 }
 /**
@@ -45635,6 +45925,92 @@ function collapseScore(window, n) {
 	if (total === 0) return 0;
 	return 1 - grams.size / total;
 }
+/**
+* Split reasoning text into sentences, for mixed CJK and Latin streams.
+*
+* A Chinese full stop ends a sentence whatever follows it. An ASCII `.!?` only
+* ends one when whitespace or the end of the text follows, because the same
+* characters carry out decimals, file names and version numbers
+* (`selectors.test.ts:745`, `3.14`) that must not become sentence
+* edges. Whitespace runs collapse and case folds, so a difference in spacing
+* or capitalisation cannot read as a difference in wording.
+*
+* @param text - reasoning text, typically one trailing window.
+* @returns non-empty normalized sentences, in order.
+*/
+function splitSentences(text) {
+	const parts = [];
+	let start = 0;
+	for (let i = 0; i < text.length; i++) {
+		const char = text[i];
+		const next = text[i + 1];
+		const cjk = CJK_TERMINATORS.has(char);
+		const latin = LATIN_TERMINATORS.has(char) && (next === void 0 || TRAILING_SPACE.test(next));
+		if (!cjk && !latin) continue;
+		parts.push(text.slice(start, i + 1));
+		start = i + 1;
+	}
+	parts.push(text.slice(start));
+	const sentences = [];
+	for (const part of parts) {
+		const normalized = part.replace(WHITESPACE_RUN, " ").trim().toLowerCase();
+		if (normalized.length > 0) sentences.push(normalized);
+	}
+	return sentences;
+}
+/** The three Chinese sentence terminators, which need no trailing space. */
+const CJK_TERMINATORS = /* @__PURE__ */ new Set([
+	"。",
+	"！",
+	"？"
+]);
+/** The three ASCII terminators, which only close a sentence before whitespace. */
+const LATIN_TERMINATORS = /* @__PURE__ */ new Set([
+	".",
+	"!",
+	"?"
+]);
+const TRAILING_SPACE = /\s/;
+const WHITESPACE_RUN = /\s+/g;
+/** Character n-grams of one normalized sentence, as a set. */
+function sentenceGrams(sentence) {
+	const grams = /* @__PURE__ */ new Set();
+	for (let i = 0; i + SEMANTIC_NGRAM_SIZE <= sentence.length; i++) grams.add(sentence.slice(i, i + SEMANTIC_NGRAM_SIZE));
+	return grams;
+}
+function gramJaccard(a, b) {
+	if (a.size === 0 || b.size === 0) return 0;
+	let shared = 0;
+	for (const gram of a) if (b.has(gram)) shared++;
+	return shared / (a.size + b.size - shared);
+}
+/** {@link semanticRecurrence} over sentences the caller has already split. */
+function sentenceRecurrence(sentences, lag) {
+	const grams = sentences.map(sentenceGrams);
+	if (grams.length <= lag) return 0;
+	let total = 0;
+	let counted = 0;
+	for (let i = lag; i < grams.length; i++) {
+		const current = grams[i];
+		let best = 0;
+		for (let j = 0; j <= i - lag; j++) {
+			const earlier = grams[j];
+			if (Math.min(current.size, earlier.size) / Math.max(current.size, earlier.size) <= best) continue;
+			const similarity = gramJaccard(current, earlier);
+			if (similarity > best) best = similarity;
+		}
+		total += best;
+		counted++;
+	}
+	return counted === 0 ? 0 : total / counted;
+}
+/** Character n-gram size both halves of the semantic signal are built on. */
+const SEMANTIC_NGRAM_SIZE = 3;
+/** {@link distinctSentenceRatio} over sentences the caller already split. */
+function distinctRatioOf(sentences) {
+	if (sentences.length < 2) return 1;
+	return new Set(sentences).size / sentences.length;
+}
 const RESUME_HINT = "Your previous reasoning became repetitive and was stopped before it finished. Resume from what you already established instead of restarting the analysis, and keep the rest of this response short.";
 /** The second resume message, used once a resume has also collapsed. */
 const RESUME_HINT_STRICT = "Your reasoning has now repeated across two attempts. Do not re-derive the analysis a third time. Either state the conclusion you already reached, or make the single next tool call that moves the task forward. Keep this response to a few sentences.";
@@ -45643,7 +46019,11 @@ function createBreakerState() {
 		breaksThisTurn: 0,
 		lastBreakAt: -Infinity,
 		exhausted: false,
-		resuming: false
+		resuming: false,
+		dualStreak: 0,
+		lowStreak: 0,
+		notedLiteralOnly: false,
+		notedSemanticOnly: false
 	};
 }
 /**
@@ -45798,10 +46178,12 @@ function installReasoningCollapseGuard(ctx, options = {}) {
 	* point — and the log says so, because a break that cannot resume is
 	* indistinguishable from a broken turn to the user.
 	*/
-	function breakOff(state, score, agent, sessionId) {
+	function breakOff(state, literal, semantic, path, agent, sessionId) {
 		state.breaksThisTurn++;
 		state.lastBreakAt = resolved.now();
-		ctx.logger?.warn(`reasoning-collapse-guard: stopped degenerate reasoning (score ${score.toFixed(3)}, break ${state.breaksThisTurn}/${resolved.maxBreaksPerTurn}, session ${sessionId ?? "unidentified"}${agent === void 0 ? ", no agent to resume" : ""})`);
+		state.dualStreak = 0;
+		state.lowStreak = 0;
+		ctx.logger?.warn(`reasoning-collapse-guard: stopped degenerate reasoning on the ${path} path after ${path === "high-literal" ? resolved.semanticConfirmations : resolved.semanticStrictConfirmations} confirmed windows (literal ${literal.toFixed(3)}, semantic ${semantic.toFixed(3)}, break ${state.breaksThisTurn}/${resolved.maxBreaksPerTurn}, session ${sessionId ?? "unidentified"}${agent === void 0 ? ", no agent to resume" : ""})`);
 		if (agent === void 0) return;
 		agent.cancel?.({
 			kind: "hook",
@@ -45819,6 +46201,48 @@ function installReasoningCollapseGuard(ctx, options = {}) {
 			}
 		});
 	}
+	/**
+	* Report one signal holding without the other.
+	*
+	* Reported once per kind per turn, not once per window: a runaway can hold
+	* one signal for hundreds of windows, and a line each would bury the report
+	* of the one that mattered. This is the diagnostic half of the gradient —
+	* the reason a near miss is still diagnosable after the fact.
+	*/
+	function noteLoneSignal(state, kind, literal, semantic, sessionId) {
+		if (kind === "literal" ? state.notedLiteralOnly : state.notedSemanticOnly) return;
+		if (kind === "literal") state.notedLiteralOnly = true;
+		else state.notedSemanticOnly = true;
+		ctx.logger?.warn(`reasoning-collapse-guard: observed the ${kind} signal alone (literal ${literal === void 0 ? "not scored" : literal.toFixed(3)}, semantic ${semantic === void 0 ? "not scored" : semantic.toFixed(3)}, session ${sessionId ?? "unidentified"}) — the other signal has not agreed, not acting`);
+	}
+	/**
+	* Report a run of agreeing windows that ended before it reached the count.
+	*
+	* Without this, two short runs of agreeing windows look in the log exactly
+	* like one long one that simply stopped short, and the confirmation count
+	* becomes impossible to reason about after the fact.
+	*/
+	function noteStreakCleared(state, reached, sessionId) {
+		ctx.logger?.warn(`reasoning-collapse-guard: the signals stopped agreeing after ${reached} of ${resolved.semanticConfirmations} windows (session ${sessionId ?? "unidentified"}) — streak cleared, not acting`);
+	}
+	/** Report the low-literal run that ended before it reached its longer count. */
+	function noteLowStreakCleared(reached, sessionId) {
+		ctx.logger?.warn(`reasoning-collapse-guard: the low-literal bars stopped holding after ${reached} of ${resolved.semanticStrictConfirmations} windows (session ${sessionId ?? "unidentified"}) — streak cleared, not acting`);
+	}
+	/** Report a low-literal window that qualifies but has not been confirmed enough. */
+	function notePendingLowConfirmation(state, literal, semantic, distinct, sessionId) {
+		ctx.logger?.warn(`reasoning-collapse-guard: low-literal bars hold in window ${state.lowStreak}/${resolved.semanticStrictConfirmations} (literal ${literal.toFixed(3)} >= ${resolved.semanticLiteralFloor}, semantic ${semantic.toFixed(3)} >= ${resolved.semanticStrictThreshold}, distinct ${distinct.toFixed(3)} <= ${resolved.semanticDistinctCeiling}, session ${sessionId ?? "unidentified"}) — not acting yet`);
+	}
+	/**
+	* Report a window where both signals held but the streak is still short.
+	*
+	* `semanticConfirmations` is what makes a break a decision rather than a
+	* reflex, so each pending confirmation is named, and the log then says how
+	* close a stream came to being cut by a guard that did not cut it.
+	*/
+	function notePendingConfirmation(state, literal, semantic, sessionId) {
+		ctx.logger?.warn(`reasoning-collapse-guard: both signals hold in window ${state.dualStreak}/${resolved.semanticConfirmations} (literal ${literal.toFixed(3)}, semantic ${semantic.toFixed(3)}, session ${sessionId ?? "unidentified"}) — not acting yet`);
+	}
 	function guardStream(request, next) {
 		const state = breakerFor(request.signal ?? STATIC_KEY);
 		if (state.exhausted || !watchedModel(request.model) || !conversationCall(request)) return next();
@@ -45829,13 +46253,33 @@ function installReasoningCollapseGuard(ctx, options = {}) {
 				if (chunk.type === "block-start") window = "";
 				if (chunk.type === "reasoning-delta" && typeof chunk.text === "string") {
 					window = appendWindow(window, chunk.text, resolved.windowChars);
-					if (window.length >= resolved.minWindowChars && resolved.now() - state.lastBreakAt >= resolved.cooldownMs) {
-						const score = collapseScore(window, resolved.ngramSize);
-						if (score >= resolved.threshold) if (state.breaksThisTurn >= resolved.maxBreaksPerTurn) state.exhausted = true;
+					if (resolved.now() - state.lastBreakAt >= resolved.cooldownMs) {
+						const literal = window.length >= resolved.minWindowChars ? collapseScore(window, resolved.ngramSize) : void 0;
+						const sentences = window.length >= resolved.semanticMinChars ? splitSentences(window) : [];
+						const semantic = sentences.length >= resolved.semanticMinSentences ? sentenceRecurrence(sentences, resolved.semanticLag) : void 0;
+						const distinct = sentences.length >= resolved.semanticMinSentences ? distinctRatioOf(sentences) : void 0;
+						const high = literal !== void 0 && literal >= resolved.threshold && semantic !== void 0 && semantic >= resolved.semanticThreshold;
+						const low = literal !== void 0 && literal >= resolved.semanticLiteralFloor && literal < resolved.threshold && semantic !== void 0 && semantic >= resolved.semanticStrictThreshold && distinct !== void 0 && distinct <= resolved.semanticDistinctCeiling;
+						const reachedHigh = state.dualStreak;
+						const reachedLow = state.lowStreak;
+						state.dualStreak = high ? reachedHigh + 1 : 0;
+						state.lowStreak = low ? reachedLow + 1 : 0;
+						if (reachedHigh !== 0 && state.dualStreak === 0) noteStreakCleared(state, reachedHigh, request.sessionId);
+						if (reachedLow !== 0 && state.lowStreak === 0) noteLowStreakCleared(reachedLow, request.sessionId);
+						if (high && state.dualStreak >= resolved.semanticConfirmations) if (state.breaksThisTurn >= resolved.maxBreaksPerTurn) state.exhausted = true;
+						else {
+							breakOff(state, literal, semantic, "high-literal", agent, request.sessionId);
+							return;
+						}
+						else if (low && state.lowStreak >= resolved.semanticStrictConfirmations) if (state.breaksThisTurn >= resolved.maxBreaksPerTurn) state.exhausted = true;
 						else {
-							breakOff(state, score, agent, request.sessionId);
+							breakOff(state, literal, semantic, "low-literal", agent, request.sessionId);
 							return;
 						}
+						else if (high) notePendingConfirmation(state, literal, semantic, request.sessionId);
+						else if (low) notePendingLowConfirmation(state, literal, semantic, distinct, request.sessionId);
+						else if (literal !== void 0 && literal >= resolved.threshold) noteLoneSignal(state, "literal", literal, semantic, request.sessionId);
+						else if (semantic !== void 0 && semantic >= resolved.semanticThreshold) noteLoneSignal(state, "semantic", literal, semantic, request.sessionId);
 					}
 				}
 				yield chunk;

package/lib/types/host/reasoning-collapse-guard/index.d.ts

@@ -12,6 +12,22 @@
  * degenerate stream scores near one. On a hit it stops yielding chunks, so the
  * in-flight request ends, and lets the turn resume on a fresh step.
  *
+ * Uniqueness alone only sees verbatim repetition. A stream can restate one
+ * conclusion over and over in fresh words, score 0.48 where the threshold is
+ * 0.85, and run to the output ceiling untouched. So a second, independent
+ * signal scores the same window for recurrence: how strongly each sentence
+ * repeats something the model already said at least `semanticLag` sentences
+ * earlier. Enumerative reasoning repeats itself too, but adjacently — each item
+ * borrows the previous item's frame — and recurrence ignores adjacency, which
+ * is what separates the two.
+ *
+ * Neither signal stops anything on its own. A break needs both over their
+ * thresholds in the same window, and then `semanticConfirmations` consecutive
+ * such windows: one signal alone, or a single anomalous window, is logged and
+ * released. That gradient is the whole design. A guard that cuts a healthy
+ * answer is worse than one that lets a runaway finish, because the user sees a
+ * turn stop mid-sentence with no explanation, and the fix costs a whole turn.
+ *
  * Seam choice: the guard wraps `llm/stream`, not `agent/assistant-stream`.
  * `agent/assistant-stream` is emit-mode — it can observe but cannot stop a
  * stream — and it does not exist before harness 0.1.5, which would make the
@@ -120,6 +136,91 @@ export interface GuardOptions {
     cooldownMs?: number;
     /** Model ids to watch; empty watches every model. */
     includeModels?: string[];
+    /**
+     * Recurrence score at or above which the semantic signal is considered to
+     * hold (default 0.35).
+     *
+     * Measured on the trailing window: the three healthy fixtures peak at 0.19,
+     * 0.17 and 0.17 across every streaming prefix, while a paraphrased loop and
+     * the verbatim loop score 0.75 and 0.99. 0.35 sits near the geometric mean
+     * of that gap, roughly 1.8x above the worst healthy prefix.
+     */
+    semanticThreshold?: number;
+    /**
+     * Sentences a claim must be separated from to count as recurrence
+     * (default 6).
+     *
+     * Zero would make healthy enumeration look degenerate: item N of a list
+     * legitimately shares most of its wording with item N-1. Requiring the
+     * earlier sentence to be at least this far back keeps the measurement on
+     * "the model said this before" rather than "the model is still on this point".
+     */
+    semanticLag?: number;
+    /**
+     * Characters required before the semantic signal is scored (default 360).
+     *
+     * Deliberately its own floor, well below `minWindowChars`: a real trace
+     * emitted 16 steps of which only one crossed 1500 characters, so the
+     * literal signal saw a single step of a whole turn. The two floors are
+     * separate knobs because they answer different questions — the literal one
+     * is about how much text a duplicate needs to be visible in, the semantic
+     * one about how much text a recurrence needs to be measurable in.
+     */
+    semanticMinChars?: number;
+    /** Sentences required before recurrence is scored (default 8). */
+    semanticMinSentences?: number;
+    /**
+     * Consecutive windows in which both signals must hold before a break
+     * (default 3).
+     *
+     * Counted independently of the per-turn break budget, which bounds how often
+     * the guard may act, not how sure it must be. A stream delivers a scoring
+     * window every few dozen characters, so three confirmations cost a few
+     * hundred wasted tokens against a runaway measured in the tens of thousands.
+     */
+    semanticConfirmations?: number;
+    /**
+     * Lowest literal score the low-literal path will act on (default 0.6).
+     *
+     * A paraphrased loop sits far below `threshold` — measured at 0.676 for a
+     * model restating twelve conclusions in fresh words, against 0.85 for
+     * verbatim repetition. So a strong semantic signal has to be allowed to
+     * carry a decision the literal signal cannot make on its own.
+     *
+     * The floor exists because a low score is not the same as a high one: 0.6 is
+     * evidence that something is repeating, 0.2 is a short trace that has not
+     * repeated long enough to say anything. Measured healthy literal peaks at
+     * 0.276, so 0.6 keeps a 2.2x margin over every healthy prefix.
+     */
+    semanticLiteralFloor?: number;
+    /**
+     * Semantic score the low-literal path demands (default 0.45).
+     *
+     * Strictly greater than `semanticThreshold`, and validated as such. The literal
+     * evidence on this path is weaker by construction, so the semantic evidence
+     * has to be stronger: 0.45 against a measured healthy peak of 0.194 is a
+     * 2.3x margin, while a paraphrase loop measures 0.77.
+     */
+    semanticStrictThreshold?: number;
+    /**
+     * Most of a window's sentences may be distinct and still be eligible for the
+     * low-literal path (default 0.47).
+     *
+     * This is the dimension that separates a model circling from a model
+     * listing. Both reuse a frame heavily and both score high on recurrence, but
+     * a list writes a sentence that has never been written before on every line
+     * — measured at 1.000 distinct, against 0.42 for a paraphrase loop and 0.075
+     * for a verbatim one. Recurrence says the wording comes back; this says
+     * whether anything at all was new.
+     */
+    semanticDistinctCeiling?: number;
+    /**
+     * Consecutive windows the low-literal path needs (default 5).
+     *
+     * Strictly greater than `semanticConfirmations`, and validated as such. The path is
+     * acting on weaker evidence, so it also waits longer before it acts.
+     */
+    semanticStrictConfirmations?: number;
     /** Injectable clock, so the cooldown is testable without a timer. */
     now?: () => number;
 }
@@ -132,6 +233,15 @@ export interface ResolvedGuardOptions {
     maxBreaksPerTurn: number;
     cooldownMs: number;
     includeModels: string[];
+    semanticThreshold: number;
+    semanticLag: number;
+    semanticMinChars: number;
+    semanticMinSentences: number;
+    semanticConfirmations: number;
+    semanticLiteralFloor: number;
+    semanticStrictThreshold: number;
+    semanticDistinctCeiling: number;
+    semanticStrictConfirmations: number;
     now: () => number;
 }
 export declare const DEFAULT_GUARD_OPTIONS: ResolvedGuardOptions;
@@ -151,6 +261,62 @@ export declare function resolveGuardOptions(options?: GuardOptions): ResolvedGua
  * @returns collapse score in [0,1]; 0 means every n-gram is unique.
  */
 export declare function collapseScore(window: string, n: number): number;
+/**
+ * Split reasoning text into sentences, for mixed CJK and Latin streams.
+ *
+ * A Chinese full stop ends a sentence whatever follows it. An ASCII `.!?` only
+ * ends one when whitespace or the end of the text follows, because the same
+ * characters carry out decimals, file names and version numbers
+ * (`selectors.test.ts:745`, `3.14`) that must not become sentence
+ * edges. Whitespace runs collapse and case folds, so a difference in spacing
+ * or capitalisation cannot read as a difference in wording.
+ *
+ * @param text - reasoning text, typically one trailing window.
+ * @returns non-empty normalized sentences, in order.
+ */
+export declare function splitSentences(text: string): string[];
+/**
+ * How strongly a window keeps returning to sentences it already stated.
+ *
+ * Each sentence is compared against every sentence at least `lag` positions earlier
+ * and keeps the best match; the score is the mean of those best matches. The
+ * comparison is normalized (Jaccard), so two sentences match on shared wording
+ * rather than on shared length, and character n-grams are used rather than words
+ * because no tokenizer is available here, and none would survive a CJK/Latin
+ * mix without segmenting Chinese first.
+ *
+ * Two properties matter more than the exact number. The score saturates — a
+ * twelve-sentence loop and a four-hundred-sentence one both approach one — so
+ * it does not drift with length the way a mean pairwise similarity does, and
+ * it does not reward a long answer merely for containing more pairs. And the
+ * lag is what makes it safe to ship: healthy enumeration reuses its framing
+ * from the sentence immediately before, which this metric cannot see.
+ *
+ * @param window - trailing reasoning characters.
+ * @param lag - sentences a claim must be separated from to count as recurrence.
+ * @returns recurrence score in [0,1]; 0 means nothing recurs, or too little text to tell.
+ */
+export declare function semanticRecurrence(window: string, lag: number): number;
+/**
+ * The share of a window's sentences that have never been said before.
+ *
+ * Recurrence cannot tell a model that is circling from a model that is
+ * listing, because a list reuses its frame as heavily as a loop does and
+ * scores just as high. The difference is that a list writes a new sentence on
+ * every line. Measured over a trailing window: 0.075 for the verbatim loop,
+ * 0.42 for a paraphrase loop, 1.000 for every healthy fixture and for every
+ * list shape tried.
+ *
+ * Equality is exact and on the normalized sentence, which is what keeps the
+ * lists out. Two rows differing only by a row number are 0.86 similar by
+ * `semanticRecurrence` and 1.000 distinct here, and that gap is the whole point: the
+ * fuzzy measure asks whether the wording came back, this one asks whether
+ * anything was new.
+ *
+ * @param window - trailing reasoning characters.
+ * @returns distinct share in (0,1]; 1 when every sentence is unique.
+ */
+export declare function distinctSentenceRatio(window: string): number;
 export declare const RESUME_HINT: string;
 /** The second resume message, used once a resume has also collapsed. */
 export declare const RESUME_HINT_STRICT: string;

package/lib/types/host/reasoning-collapse-guard/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/host/reasoning-collapse-guard/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyCG;AAKH;;;;;;;GAOG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnC,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;IACzC,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACvC,4EAA4E;IAC5E,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACtC;AAED,mFAAmF;AACnF,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACnC;AAED,qFAAqF;AACrF,MAAM,WAAW,cAAc;IAC7B,iFAAiF;IACjF,QAAQ,CAAC,EAAE,CAAC,EAAE,OAAO,CAAA;IACrB,MAAM,CAAC,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE,OAAO,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAA;IACzF,KAAK,CAAC,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAA;CAC/B;AAED,+DAA+D;AAC/D,MAAM,MAAM,mBAAmB,GAAG,CAChC,OAAO,EAAE,kBAAkB,EAC3B,IAAI,EAAE,MAAM,aAAa,CAAC,UAAU,CAAC,KAClC,aAAa,CAAC,UAAU,CAAC,CAAA;AAE9B,2EAA2E;AAC3E,MAAM,MAAM,uBAAuB,GAAG,CAAC,OAAO,EAAE;IAAE,KAAK,EAAE,OAAO,CAAA;CAAE,KAAK,IAAI,CAAA;AAE3E,mEAAmE;AACnE,MAAM,MAAM,aAAa,GAAG,mBAAmB,GAAG,uBAAuB,CAAA;AAEzE,0DAA0D;AAC1D,MAAM,WAAW,oBAAoB;IACnC,6DAA6D;IAC7D,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAA;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,EAAE,CAAC,EAAE,CACH,KAAK,EAAE,YAAY,GAAG,eAAe,GAAG,gBAAgB,EACxD,QAAQ,EAAE,aAAa,EACvB,OAAO,CAAC,EAAE,oBAAoB,KAC3B,OAAO,CAAA;IACZ,MAAM,CAAC,EAAE;QAAE,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GAAG,SAAS,CAAA;IACpD;;;;OAIG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,EAAE,OAAO,GAAG,OAAO,CAAA;KAAE,GAAG,SAAS,CAAA;CAC5D;AAED,+DAA+D;AAC/D,MAAM,WAAW,YAAY;IAC3B,uEAAuE;IACvE,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,qEAAqE;IACrE,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,6EAA6E;IAC7E,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,4DAA4D;IAC5D,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,kEAAkE;IAClE,gBAAgB,CAAC,EAAE,MAAM,CAAA;IACzB,8DAA8D;IAC9D,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,qDAAqD;IACrD,aAAa,CAAC,EAAE,MAAM,EAAE,CAAA;IACxB,qEAAqE;IACrE,GAAG,CAAC,EAAE,MAAM,MAAM,CAAA;CACnB;AAED,0CAA0C;AAC1C,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,MAAM,CAAA;IACnB,cAAc,EAAE,MAAM,CAAA;IACtB,SAAS,EAAE,MAAM,CAAA;IACjB,SAAS,EAAE,MAAM,CAAA;IACjB,gBAAgB,EAAE,MAAM,CAAA;IACxB,UAAU,EAAE,MAAM,CAAA;IAClB,aAAa,EAAE,MAAM,EAAE,CAAA;IACvB,GAAG,EAAE,MAAM,MAAM,CAAA;CAClB;AAED,eAAO,MAAM,qBAAqB,EAAE,oBASnC,CAAA;AAUD;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,GAAE,YAAiB,GAAG,oBAAoB,CAiCpF;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAU/D;AACD,eAAO,MAAM,WAAW,QAGuB,CAAA;AAE/C,wEAAwE;AACxE,eAAO,MAAM,kBAAkB,QAIG,CAAA;AA0FlC;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,wBAAwB,EAC7B,OAAO,GAAE,YAAiB,GACzB,CAAC,MAAM,IAAI,CAAC,GAAG,SAAS,CA4J1B"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/host/reasoning-collapse-guard/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyDG;AAKH;;;;;;;GAOG;AACH,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnC,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,GAAG,SAAS,CAAA;IACzC,4DAA4D;IAC5D,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACvC,4EAA4E;IAC5E,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACtC;AAED,mFAAmF;AACnF,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACnC;AAED,qFAAqF;AACrF,MAAM,WAAW,cAAc;IAC7B,iFAAiF;IACjF,QAAQ,CAAC,EAAE,CAAC,EAAE,OAAO,CAAA;IACrB,MAAM,CAAC,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE,OAAO,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAA;IACzF,KAAK,CAAC,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,CAAA;CAC/B;AAED,+DAA+D;AAC/D,MAAM,MAAM,mBAAmB,GAAG,CAChC,OAAO,EAAE,kBAAkB,EAC3B,IAAI,EAAE,MAAM,aAAa,CAAC,UAAU,CAAC,KAClC,aAAa,CAAC,UAAU,CAAC,CAAA;AAE9B,2EAA2E;AAC3E,MAAM,MAAM,uBAAuB,GAAG,CAAC,OAAO,EAAE;IAAE,KAAK,EAAE,OAAO,CAAA;CAAE,KAAK,IAAI,CAAA;AAE3E,mEAAmE;AACnE,MAAM,MAAM,aAAa,GAAG,mBAAmB,GAAG,uBAAuB,CAAA;AAEzE,0DAA0D;AAC1D,MAAM,WAAW,oBAAoB;IACnC,6DAA6D;IAC7D,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAA;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACvC,EAAE,CAAC,EAAE,CACH,KAAK,EAAE,YAAY,GAAG,eAAe,GAAG,gBAAgB,EACxD,QAAQ,EAAE,aAAa,EACvB,OAAO,CAAC,EAAE,oBAAoB,KAC3B,OAAO,CAAA;IACZ,MAAM,CAAC,EAAE;QAAE,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GAAG,SAAS,CAAA;IACpD;;;;OAIG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE,EAAE,OAAO,GAAG,OAAO,CAAA;KAAE,GAAG,SAAS,CAAA;CAC5D;AAED,+DAA+D;AAC/D,MAAM,WAAW,YAAY;IAC3B,uEAAuE;IACvE,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,qEAAqE;IACrE,cAAc,CAAC,EAAE,MAAM,CAAA;IACvB,6EAA6E;IAC7E,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,4DAA4D;IAC5D,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,kEAAkE;IAClE,gBAAgB,CAAC,EAAE,MAAM,CAAA;IACzB,8DAA8D;IAC9D,UAAU,CAAC,EAAE,MAAM,CAAA;IACnB,qDAAqD;IACrD,aAAa,CAAC,EAAE,MAAM,EAAE,CAAA;IACxB;;;;;;;;OAQG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB;;;;;;;;;OASG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAA;IACzB,kEAAkE;IAClE,oBAAoB,CAAC,EAAE,MAAM,CAAA;IAC7B;;;;;;;;OAQG;IACH,qBAAqB,CAAC,EAAE,MAAM,CAAA;IAC9B;;;;;;;;;;;;OAYG;IACH,oBAAoB,CAAC,EAAE,MAAM,CAAA;IAC7B;;;;;;;OAOG;IACH,uBAAuB,CAAC,EAAE,MAAM,CAAA;IAChC;;;;;;;;;;OAUG;IACH,uBAAuB,CAAC,EAAE,MAAM,CAAA;IAChC;;;;;OAKG;IACH,2BAA2B,CAAC,EAAE,MAAM,CAAA;IACpC,qEAAqE;IACrE,GAAG,CAAC,EAAE,MAAM,MAAM,CAAA;CACnB;AAED,0CAA0C;AAC1C,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,MAAM,CAAA;IACnB,cAAc,EAAE,MAAM,CAAA;IACtB,SAAS,EAAE,MAAM,CAAA;IACjB,SAAS,EAAE,MAAM,CAAA;IACjB,gBAAgB,EAAE,MAAM,CAAA;IACxB,UAAU,EAAE,MAAM,CAAA;IAClB,aAAa,EAAE,MAAM,EAAE,CAAA;IACvB,iBAAiB,EAAE,MAAM,CAAA;IACzB,WAAW,EAAE,MAAM,CAAA;IACnB,gBAAgB,EAAE,MAAM,CAAA;IACxB,oBAAoB,EAAE,MAAM,CAAA;IAC5B,qBAAqB,EAAE,MAAM,CAAA;IAC7B,oBAAoB,EAAE,MAAM,CAAA;IAC5B,uBAAuB,EAAE,MAAM,CAAA;IAC/B,uBAAuB,EAAE,MAAM,CAAA;IAC/B,2BAA2B,EAAE,MAAM,CAAA;IACnC,GAAG,EAAE,MAAM,MAAM,CAAA;CAClB;AAED,eAAO,MAAM,qBAAqB,EAAE,oBAkBnC,CAAA;AAUD;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,GAAE,YAAiB,GAAG,oBAAoB,CAiFpF;AAED;;;;;;;;GAQG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAU/D;AACD;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAmBrD;AA2BD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAEtE;AA6BD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAE5D;AAQD,eAAO,MAAM,WAAW,QAGuB,CAAA;AAE/C,wEAAwE;AACxE,eAAO,MAAM,kBAAkB,QAIG,CAAA;AAmHlC;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,6BAA6B,CAC3C,GAAG,EAAE,wBAAwB,EAC7B,OAAO,GAAE,YAAiB,GACzB,CAAC,MAAM,IAAI,CAAC,GAAG,SAAS,CAoT1B"}

package/lib/types/host/workbuddy/client.d.ts

@@ -2,7 +2,7 @@ import type { WorkBuddyAccount, WorkBuddyAccountQuota, WorkBuddyMeter } from '..
 import { PROVIDER_ID, PROVIDER_NAME } from './types.ts';
 import { FileCredentialStore, type WorkBuddyCredentials } from './token-store.ts';
 import type { WorkBuddyTokenIdentity } from './identity.ts';
-import type { WorkBuddyModelEntry } from './model-catalog.ts';
+import { type WorkBuddyModelEntry } from './model-catalog.ts';
 export interface WorkBuddyRequestOptions {
     fetchFn?: typeof fetch;
     signal?: AbortSignal;

package/lib/types/host/workbuddy/client.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"client.d.ts","sourceRoot":"","sources":["../../../../src/host/workbuddy/client.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,gBAAgB,EAChB,qBAAqB,EACrB,cAAc,EACf,MAAM,qCAAqC,CAAA;AAC5C,OAAO,EAiBL,WAAW,EACX,aAAa,EAKd,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,mBAAmB,EAAsB,KAAK,oBAAoB,EAAE,MAAM,kBAAkB,CAAA;AACrG,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,eAAe,CAAA;AAC3D,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAA;AAO7D,MAAM,WAAW,uBAAuB;IACtC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAA;IACtB,MAAM,CAAC,EAAE,WAAW,CAAA;CACrB;AA6BD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,WAAW,EAAE,IAAI,CAAC,oBAAoB,EAAE,aAAa,GAAG,QAAQ,GAAG,KAAK,GAAG,cAAc,GAAG,SAAS,CAAC,EACtG,KAAK,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAM,GACjC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAmBxB;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,oBAAoB,CAAC,CAoD/B;AAED,kDAAkD;AAClD,wBAAgB,sBAAsB,CAAC,WAAW,EAAE,oBAAoB,GAAG,gBAAgB,CAiB1F;AAMD;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,oBAAoB,CACxC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,CAyBxC;AAMD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,oBAAoB,CAAC,QAAQ,CAAC,GAAG,mBAAmB,EAAE,CAgEjH;AAkBD,wBAAgB,gBAAgB,IAAI,mBAAmB,EAAE,CAExD;AAED,wBAAgB,kBAAkB,IAAI,IAAI,CAMzC;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAUhC;AAED;;;;;;;;GAQG;AACH,wBAAsB,iBAAiB,CACrC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAAuB,GAAG;IAAE,KAAK,CAAC,EAAE,OAAO,CAAA;CAAO,GAC1D,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAkDhC;AAiDD,wEAAwE;AACxE,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;IAC1B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAA;IAC3B,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAA;IAC/B,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAA;IAC/B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAA;IAC3B,aAAa,EAAE,MAAM,GAAG,IAAI,CAAA;IAC5B,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;CAC3B;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,aAAa,CAwC5D;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAQ5D;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAAC,OAAO,EAAE,aAAa,GAAG,cAAc,EAAE,CAmCtE;AA4CD;;;;;;GAMG;AACH,wBAAgB,cAAc,IAAI,qBAAqB,GAAG,SAAS,CAElE;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,qBAAqB,GAAG,SAAS,CAG9F;AAED,wBAAgB,gBAAgB,IAAI,IAAI,CAKvC;AAED;;;;;GAKG;AACH,wBAAsB,iBAAiB,CACrC,KAAK,sBAA4B,EACjC,OAAO,GAAE,OAAO,KAAa,EAC7B,KAAK,UAAQ,EACb,SAAS,GAAE,MAAM,GAAG,IAAW,EAC/B,gBAAgB,GAAE,SAAS,MAAM,EAAO,GACvC,OAAO,CAAC,qBAAqB,CAAC,CAmEhC;AAED,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,CAAA"}
+{"version":3,"file":"client.d.ts","sourceRoot":"","sources":["../../../../src/host/workbuddy/client.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,gBAAgB,EAChB,qBAAqB,EACrB,cAAc,EACf,MAAM,qCAAqC,CAAA;AAC5C,OAAO,EAiBL,WAAW,EACX,aAAa,EAKd,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,mBAAmB,EAAsB,KAAK,oBAAoB,EAAE,MAAM,kBAAkB,CAAA;AACrG,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,eAAe,CAAA;AAC3D,OAAO,EAAyB,KAAK,mBAAmB,EAAE,MAAM,oBAAoB,CAAA;AAOpF,MAAM,WAAW,uBAAuB;IACtC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAA;IACtB,MAAM,CAAC,EAAE,WAAW,CAAA;CACrB;AA6BD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,WAAW,EAAE,IAAI,CAAC,oBAAoB,EAAE,aAAa,GAAG,QAAQ,GAAG,KAAK,GAAG,cAAc,GAAG,SAAS,CAAC,EACtG,KAAK,GAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAM,GACjC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAmBxB;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,oBAAoB,CAAC,CAoD/B;AAED,kDAAkD;AAClD,wBAAgB,sBAAsB,CAAC,WAAW,EAAE,oBAAoB,GAAG,gBAAgB,CAiB1F;AAMD;;;;;;;;;;;;;;GAcG;AACH,wBAAsB,oBAAoB,CACxC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,CAyBxC;AAMD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,oBAAoB,CAAC,QAAQ,CAAC,GAAG,mBAAmB,EAAE,CAgEjH;AAkBD,wBAAgB,gBAAgB,IAAI,mBAAmB,EAAE,CAExD;AAED,wBAAgB,kBAAkB,IAAI,IAAI,CAMzC;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAchC;AAED;;;;;;;;GAQG;AACH,wBAAsB,iBAAiB,CACrC,WAAW,EAAE,oBAAoB,EACjC,OAAO,GAAE,uBAAuB,GAAG;IAAE,KAAK,CAAC,EAAE,OAAO,CAAA;CAAO,GAC1D,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAyDhC;AAiDD,wEAAwE;AACxE,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;IAC1B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAA;IAC3B,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAA;IAC/B,gBAAgB,EAAE,MAAM,GAAG,IAAI,CAAA;IAC/B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAA;IAC3B,aAAa,EAAE,MAAM,GAAG,IAAI,CAAA;IAC5B,WAAW,EAAE,MAAM,GAAG,IAAI,CAAA;CAC3B;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,aAAa,CAwC5D;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,CAQ5D;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAAC,OAAO,EAAE,aAAa,GAAG,cAAc,EAAE,CAmCtE;AA4CD;;;;;;GAMG;AACH,wBAAgB,cAAc,IAAI,qBAAqB,GAAG,SAAS,CAElE;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,qBAAqB,GAAG,SAAS,CAG9F;AAED,wBAAgB,gBAAgB,IAAI,IAAI,CAKvC;AAED;;;;;GAKG;AACH,wBAAsB,iBAAiB,CACrC,KAAK,sBAA4B,EACjC,OAAO,GAAE,OAAO,KAAa,EAC7B,KAAK,UAAQ,EACb,SAAS,GAAE,MAAM,GAAG,IAAW,EAC/B,gBAAgB,GAAE,SAAS,MAAM,EAAO,GACvC,OAAO,CAAC,qBAAqB,CAAC,CAmEhC;AAED,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,CAAA"}

package/lib/types/host/workbuddy/model-catalog.d.ts

@@ -11,9 +11,21 @@
  * The fallback is a verbatim transcription of a live `/v3/config` read, not
  * hand-written guesses: an earlier revision of this file guessed context
  * windows from vendor marketing and was wrong in both directions (`glm-5.3`
- * and `kimi-k3` are 1M, not 200K/256K). Where the two regions disagree, the
- * larger maximum is kept while the served default comes from whichever region
- * reported one.
+ * and `kimi-k3` are 1M, not 200K/256K).
+ *
+ * One entry serves both regions, so a model the regions disagree about needs a
+ * merged figure. The rule is asymmetric on purpose: the **larger maximum** is
+ * kept, while the **served default** and the **output cap** take the **smaller**
+ * of the two. Over-declaring either one is a hard failure — DSH would send a
+ * request the gateway rejects — whereas under-declaring only compresses a
+ * conversation earlier than needed, and both remain overridable per model from
+ * the settings card. Measured disagreements (`glm-5.3-flash`, `glm-5.3`,
+ * `glm-5.2`, `kimi-k2.8-preview` served 300000/48000/48000/32000 by intl
+ * against 1000000/64000/64000/64000 by cn) are reconciled that way.
+ *
+ * The regions also do not serve the same ids. intl added `glm-5.3-flash` and
+ * keeps `gemini-3.5-flash`, `kimi-k3` and the `*-model` aliases to itself; cn
+ * keeps `glm-5.3-flash`, `kimi-k3-1` and its own `-x` variants.
  *
  * `regions` is a routing fact, not a preference: asking a region for a model it
  * does not serve answers 400 `code 11102`.
@@ -67,6 +79,38 @@ export interface WorkBuddyModelEntry {
     /** One-line note shown beside the model in the settings card. */
     description: string;
 }
+/**
+ * Models the gateway serves but does not publish in `/v3/config`.
+ *
+ * The catalog is a published list, not the served one: measured on the
+ * international backend, `gpt-6-sol`, `gpt-6-luna` and `gemini-3.8-flash` all
+ * answer a normal streaming completion with 200 while being absent from
+ * `/v3/config` entirely, and a reachable gateway *replaces* the shipped table
+ * with that list. Without these rows the picker would simply never show them, so
+ * they are declared here and merged into a live catalog too
+ * ({@link withUnpublishedModels}) rather than living in the fallback alone.
+ *
+ * What each row records, and how it was established, differs by field:
+ *
+ * - **Existence, the reasoning ladder, image support** were measured against the
+ *   live endpoint, not inferred from the name. A rejected level answers 400
+ *   `code 11133` with `extError` `400002`; `gpt-6-sol` takes exactly the ladder
+ *   `gpt-6-astra` publishes (`minimal` refused, `low`/`medium`/`high`/`xhigh`/
+ *   `max` accepted) and both accept a 1x1 PNG.
+ * - **Context window, output cap and `canDisableThinking` are inherited from the
+ *   published sibling in the same family** — `gpt-6-astra` for `gpt-6-sol` and
+ *   `gpt-6-luna`, `gemini-3.5-flash` for `gemini-3.8-flash`. They are marked
+ *   here rather than measured because the gateway publishes nothing for these
+ *   ids and offers no cheap way to read the real figure: it accepts a
+ *   `max_tokens` larger than any published window (even for `gpt-6-astra`, whose
+ *   own catalog caps at 128000), so the number is neither enforced nor
+ *   discoverable from the request side.
+ *
+ * Every field stays overridable per model from the settings card, and an
+ * inherited window errs low rather than high: over-declaring overflows the
+ * gateway mid-session, while under-declaring only compresses earlier.
+ */
+export declare const UNPUBLISHED_MODELS: readonly WorkBuddyModelEntry[];
 /**
  * Offline fallback catalog, transcribed from a live `/v3/config` read.
  *
@@ -85,6 +129,17 @@ export declare const FALLBACK_MODELS: readonly WorkBuddyModelEntry[];
 export declare const DEFAULT_VISIBLE_MODEL_IDS: readonly string[];
 /** Every id the fallback knows, in declaration order. */
 export declare const WORKBUDDY_MODEL_IDS: readonly string[];
+/**
+ * Add the served-but-unpublished models to a live `/v3/config` catalog.
+ *
+ * A reachable gateway replaces the shipped table with the list it publishes, so
+ * a model it serves without listing ({@link UNPUBLISHED_MODELS}) would drop out
+ * of the picker the moment the catalog loads. Merging here keeps it offered.
+ *
+ * A published entry always wins: the gateway is the authority on anything it
+ * does describe, so these rows only fill ids the payload is silent about.
+ */
+export declare function withUnpublishedModels(catalog: readonly WorkBuddyModelEntry[], region: WorkBuddyRegion): WorkBuddyModelEntry[];
 /**
  * Resolve one entry from a catalog.
  *
@@ -95,7 +150,25 @@ export declare const WORKBUDDY_MODEL_IDS: readonly string[];
 export declare function resolveWorkBuddyModel(id: string, catalog?: readonly WorkBuddyModelEntry[]): WorkBuddyModelEntry;
 /** Whether one catalog knows this exact id. */
 export declare function isWorkBuddyModelId(id: unknown, catalog?: readonly WorkBuddyModelEntry[]): id is string;
-/** Models an account in `region` can actually call, in catalog order. */
+/** The vendor family one model belongs to. */
+export declare function workBuddyModelVendor(id: string): string;
+/**
+ * Group a list so every vendor's models sit together.
+ *
+ * Families appear in the order their first model does — the catalog decides
+ * which vendor leads, not this function — and each family is ordered newest
+ * generation first.
+ */
+export declare function groupWorkBuddyModelsByVendor<T extends {
+    id: string;
+}>(models: readonly T[]): T[];
+/**
+ * Models an account in `region` can actually call, grouped by vendor.
+ *
+ * Grouped here rather than in the settings card because this is also what the
+ * request path resolves against: one ordering rule, so the picker and the
+ * adapter can never disagree about which models a region offers.
+ */
 export declare function modelsForRegion(region: WorkBuddyRegion, catalog?: readonly WorkBuddyModelEntry[]): WorkBuddyModelEntry[];
 /** Whether one model accepts image input. */
 export declare function workBuddyModelSupportsImage(id: string, catalog?: readonly WorkBuddyModelEntry[]): boolean;

package/lib/types/host/workbuddy/model-catalog.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"model-catalog.d.ts","sourceRoot":"","sources":["../../../../src/host/workbuddy/model-catalog.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAA;AAI1E,MAAM,WAAW,mBAAmB;IAClC,EAAE,EAAE,MAAM,CAAA;IACV,IAAI,EAAE,MAAM,CAAA;IACZ;;;;;;;OAOG;IACH,aAAa,EAAE,MAAM,CAAA;IACrB,sEAAsE;IACtE,gBAAgB,EAAE,MAAM,CAAA;IACxB,sDAAsD;IACtD,SAAS,EAAE,MAAM,CAAA;IACjB,4CAA4C;IAC5C,OAAO,EAAE,SAAS,eAAe,EAAE,CAAA;IACnC,6CAA6C;IAC7C,aAAa,EAAE,OAAO,CAAA;IACtB,2EAA2E;IAC3E,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,2DAA2D;IAC3D,sBAAsB,EAAE,MAAM,GAAG,IAAI,CAAA;IACrC,gEAAgE;IAChE,kBAAkB,EAAE,OAAO,CAAA;IAC3B,iEAAiE;IACjE,WAAW,EAAE,MAAM,CAAA;CACpB;AAED;;;;;GAKG;AACH,eAAO,MAAM,eAAe,EAAE,SAAS,mBAAmB,EAgjBzD,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,yBAAyB,EAAE,SAAS,MAAM,EAKtD,CAAA;AAED,yDAAyD;AACzD,eAAO,MAAM,mBAAmB,EAAE,SAAS,MAAM,EAA6C,CAAA;AAE9F;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,mBAAmB,CA0BrB;AAED,+CAA+C;AAC/C,wBAAgB,kBAAkB,CAChC,EAAE,EAAE,OAAO,EACX,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,EAAE,IAAI,MAAM,CAEd;AAED,yEAAyE;AACzE,wBAAgB,eAAe,CAC7B,MAAM,EAAE,eAAe,EACvB,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,mBAAmB,EAAE,CAEvB;AAED,6CAA6C;AAC7C,wBAAgB,2BAA2B,CACzC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,OAAO,CAET;AAED,0CAA0C;AAC1C,wBAAgB,yBAAyB,CACvC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,SAAS,MAAM,EAAE,CAEnB;AAED,sDAAsD;AACtD,wBAAgB,kBAAkB,CAChC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,MAAM,CAER;AAED,wDAAwD;AACxD,wBAAgB,uBAAuB,CACrC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,MAAM,CAER"}
+{"version":3,"file":"model-catalog.d.ts","sourceRoot":"","sources":["../../../../src/host/workbuddy/model-catalog.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,qCAAqC,CAAA;AAI1E,MAAM,WAAW,mBAAmB;IAClC,EAAE,EAAE,MAAM,CAAA;IACV,IAAI,EAAE,MAAM,CAAA;IACZ;;;;;;;OAOG;IACH,aAAa,EAAE,MAAM,CAAA;IACrB,sEAAsE;IACtE,gBAAgB,EAAE,MAAM,CAAA;IACxB,sDAAsD;IACtD,SAAS,EAAE,MAAM,CAAA;IACjB,4CAA4C;IAC5C,OAAO,EAAE,SAAS,eAAe,EAAE,CAAA;IACnC,6CAA6C;IAC7C,aAAa,EAAE,OAAO,CAAA;IACtB,2EAA2E;IAC3E,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAA;IACnC,2DAA2D;IAC3D,sBAAsB,EAAE,MAAM,GAAG,IAAI,CAAA;IACrC,gEAAgE;IAChE,kBAAkB,EAAE,OAAO,CAAA;IAC3B,iEAAiE;IACjE,WAAW,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,kBAAkB,EAAE,SAAS,mBAAmB,EAwC5D,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,eAAe,EAAE,SAAS,mBAAmB,EAwkBzD,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,yBAAyB,EAAE,SAAS,MAAM,EAKtD,CAAA;AAED,yDAAyD;AACzD,eAAO,MAAM,mBAAmB,EAAE,SAAS,MAAM,EAA6C,CAAA;AAE9F;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,EAAE,SAAS,mBAAmB,EAAE,EACvC,MAAM,EAAE,eAAe,GACtB,mBAAmB,EAAE,CAMvB;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,mBAAmB,CA0BrB;AAED,+CAA+C;AAC/C,wBAAgB,kBAAkB,CAChC,EAAE,EAAE,OAAO,EACX,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,EAAE,IAAI,MAAM,CAEd;AAoCD,8CAA8C;AAC9C,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAMvD;AAwCD;;;;;;GAMG;AACH,wBAAgB,4BAA4B,CAAC,CAAC,SAAS;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,EAAE,CAWhG;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,eAAe,EACvB,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,mBAAmB,EAAE,CAEvB;AAED,6CAA6C;AAC7C,wBAAgB,2BAA2B,CACzC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,OAAO,CAET;AAED,0CAA0C;AAC1C,wBAAgB,yBAAyB,CACvC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,SAAS,MAAM,EAAE,CAEnB;AAED,sDAAsD;AACtD,wBAAgB,kBAAkB,CAChC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,MAAM,CAER;AAED,wDAAwD;AACxD,wBAAgB,uBAAuB,CACrC,EAAE,EAAE,MAAM,EACV,OAAO,GAAE,SAAS,mBAAmB,EAAoB,GACxD,MAAM,CAER"}

package/lib/types/host/workbuddy/routes.d.ts

@@ -15,7 +15,13 @@ import type { WorkBuddyAccountPool } from './account-pool.ts';
  * behind an unedited default. Any explicit edit is honoured exactly.
  */
 export declare function resolveEnabledModelIds(stored: readonly string[], available: readonly string[], enabled?: boolean): string[];
-/** Build the model options the settings card renders, in catalog order. */
+/**
+ * Build the model options the settings card renders.
+ *
+ * Order comes from the caller, which passes a vendor-grouped list so a family
+ * is not interleaved with the next one; this preserves whatever order it is
+ * given rather than imposing a second one.
+ */
 export declare function buildModelOptions(catalog: readonly WorkBuddyModelEntry[], available: readonly string[], enabledModelIds: readonly string[], overrides: Record<string, number>): WorkBuddyModelOption[];
 export interface WorkBuddyStatusOptions {
     fetchFn?: typeof fetch;

package/lib/types/host/workbuddy/routes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"routes.d.ts","sourceRoot":"","sources":["../../../../src/host/workbuddy/routes.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAIlD,OAAO,EAGL,sBAAsB,EACtB,WAAW,EACX,aAAa,EAEd,MAAM,YAAY,CAAA;AACnB,OAAO,EACL,mBAAmB,EACnB,sBAAsB,EAGtB,KAAK,wBAAwB,EAC9B,MAAM,kBAAkB,CAAA;AACzB,OAAO,EAKL,cAAc,EAKf,MAAM,aAAa,CAAA;AACpB,OAAO,EASL,KAAK,mBAAmB,EACzB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,KAAK,EAIV,oBAAoB,EACpB,kBAAkB,EACnB,MAAM,qCAAqC,CAAA;AAC5C,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAA;AAG3D,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAA;AA6C7D;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,OAAO,UAAO,GACb,MAAM,EAAE,CASV;AAED,2EAA2E;AAC3E,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,SAAS,mBAAmB,EAAE,EACvC,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,eAAe,EAAE,SAAS,MAAM,EAAE,EAClC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,oBAAoB,EAAE,CAqBxB;AAED,MAAM,WAAW,sBAAsB;IACrC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAA;IACtB,sFAAsF;IACtF,OAAO,CAAC,EAAE,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,CAAA;IACnC,uFAAuF;IACvF,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAA;IAChD,4FAA4F;IAC5F,WAAW,CAAC,EAAE,oBAAoB,CAAA;IAClC,6EAA6E;IAC7E,OAAO,CAAC,EAAE,IAAI,CAAC,uBAAuB,EAAE,MAAM,GAAG,SAAS,CAAC,CAAA;CAC5D;AAMD,mFAAmF;AACnF,wBAAsB,qBAAqB,CACzC,KAAK,EAAE,mBAAmB,EAC1B,aAAa,EAAE,sBAAsB,EACrC,WAAW,CAAC,EAAE,wBAAwB,EACtC,OAAO,GAAE,sBAA2B,GACnC,OAAO,CAAC,kBAAkB,CAAC,CA2E7B;AAED,qEAAqE;AACrE,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,OAAO,EACZ,KAAK,EAAE,mBAAmB,EAC1B,aAAa,EAAE,sBAAsB,EACrC,WAAW,CAAC,EAAE,wBAAwB,EACtC,OAAO,GAAE,sBAA2B,GACnC,MAAM,IAAI,CAkXZ;AAED,OAAO,EACL,WAAW,EACX,aAAa,EACb,sBAAsB,EACtB,cAAc,EACd,KAAK,oBAAoB,EACzB,KAAK,kBAAkB,GACxB,CAAA"}
+{"version":3,"file":"routes.d.ts","sourceRoot":"","sources":["../../../../src/host/workbuddy/routes.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAA;AAIlD,OAAO,EAGL,sBAAsB,EACtB,WAAW,EACX,aAAa,EAEd,MAAM,YAAY,CAAA;AACnB,OAAO,EACL,mBAAmB,EACnB,sBAAsB,EAGtB,KAAK,wBAAwB,EAC9B,MAAM,kBAAkB,CAAA;AACzB,OAAO,EAKL,cAAc,EAKf,MAAM,aAAa,CAAA;AACpB,OAAO,EASL,KAAK,mBAAmB,EACzB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,KAAK,EAIV,oBAAoB,EACpB,kBAAkB,EACnB,MAAM,qCAAqC,CAAA;AAC5C,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAA;AAG3D,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAA;AA6C7D;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,OAAO,UAAO,GACb,MAAM,EAAE,CASV;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,SAAS,mBAAmB,EAAE,EACvC,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,eAAe,EAAE,SAAS,MAAM,EAAE,EAClC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,oBAAoB,EAAE,CAqBxB;AAED,MAAM,WAAW,sBAAsB;IACrC,OAAO,CAAC,EAAE,OAAO,KAAK,CAAA;IACtB,sFAAsF;IACtF,OAAO,CAAC,EAAE,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,CAAA;IACnC,uFAAuF;IACvF,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAA;IAChD,4FAA4F;IAC5F,WAAW,CAAC,EAAE,oBAAoB,CAAA;IAClC,6EAA6E;IAC7E,OAAO,CAAC,EAAE,IAAI,CAAC,uBAAuB,EAAE,MAAM,GAAG,SAAS,CAAC,CAAA;CAC5D;AAMD,mFAAmF;AACnF,wBAAsB,qBAAqB,CACzC,KAAK,EAAE,mBAAmB,EAC1B,aAAa,EAAE,sBAAsB,EACrC,WAAW,CAAC,EAAE,wBAAwB,EACtC,OAAO,GAAE,sBAA2B,GACnC,OAAO,CAAC,kBAAkB,CAAC,CA2E7B;AAED,qEAAqE;AACrE,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,OAAO,EACZ,KAAK,EAAE,mBAAmB,EAC1B,aAAa,EAAE,sBAAsB,EACrC,WAAW,CAAC,EAAE,wBAAwB,EACtC,OAAO,GAAE,sBAA2B,GACnC,MAAM,IAAI,CAkXZ;AAED,OAAO,EACL,WAAW,EACX,aAAa,EACb,sBAAsB,EACtB,cAAc,EACd,KAAK,oBAAoB,EACzB,KAAK,kBAAkB,GACxB,CAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@eddyskywalker/dsh-chatgpt-subscription",
-  "version": "0.14.0",
+  "version": "0.15.0",
   "description": "DSH provider plugin for Codex access through a ChatGPT subscription.",
   "author": {
     "name": "eddyskywalker",