@walkhi/code-relax 0.1.0-beta.30 → 0.1.0-beta.31

package/dist/shared/timeline-sync.cjs

@@ -1,173 +1,173 @@
-(function (root, factory) {
-  if (typeof module === 'object' && module.exports) module.exports = factory();
-  else root.CodexTimelineSync = factory();
-})(globalThis, function () {
-  const equal = (left, right) => left === right || JSON.stringify(left) === JSON.stringify(right);
-  function changedFields(previous, current, ignored) {
-    const set = {}, append = {}, unset = [];
-    for (const key of new Set([...Object.keys(previous || {}), ...Object.keys(current || {})])) {
-      if (ignored.has(key) || equal(previous?.[key], current?.[key])) continue;
-      if (!Object.hasOwn(current, key)) { unset.push(key); continue; }
-      const before = previous?.[key], after = current[key];
-      if (typeof before === 'string' && typeof after === 'string' && after.startsWith(before)) append[key] = after.slice(before.length);
-      else set[key] = after;
-    }
-    return { set, append, unset };
-  }
-  const nonempty = changes => Object.keys(changes.set).length || Object.keys(changes.append).length || changes.unset.length;
-  // An ordered history range owns the order of its shared IDs. Keep entries
-  // outside that range at their existing shared anchors, never by timestamps.
-  function mergeOrderedEntries(existing, incoming, merge = (_previous, next) => next, incomingIsOlder = false) {
-    const incomingIds = new Set(incoming.map(entry => entry.id));
-    const existingById = new Map(existing.map(entry => [entry.id, entry]));
-    const before = new Map();
-    let pending = [], lastShared;
-    for (const entry of existing) {
-      if (incomingIds.has(entry.id)) {
-        before.set(entry.id, pending); pending = []; lastShared = entry.id;
-      } else pending.push(entry);
-    }
-    if (lastShared === undefined) return incomingIsOlder ? [...incoming, ...existing] : [...existing, ...incoming];
-    return incoming.flatMap(entry => [ ...(before.get(entry.id) || []),
-      existingById.has(entry.id) ? merge(existingById.get(entry.id), entry) : entry,
-      ...(entry.id === lastShared ? pending : []) ]);
-  }
-  function diffTurn(previous, current) {
-    if (!previous || !current || previous.id !== current.id) return null;
-    const before = Array.isArray(previous.entries) ? previous.entries : [];
-    const after = Array.isArray(current.entries) ? current.entries : [];
-    if (after.length < before.length) return null;
-    const entries = [];
-    for (let index = 0; index < before.length; index++) {
-      if (before[index]?.id !== after[index]?.id || before[index]?.type !== after[index]?.type ||
-          before[index]?.role !== after[index]?.role || before[index]?.kind !== after[index]?.kind) return null;
-      const changes = changedFields(before[index], after[index], new Set(['id', 'type', 'role', 'kind']));
-      if (nonempty(changes)) entries.push({ id: after[index].id, index, ...changes });
-    }
-    const turn = changedFields(previous, current, new Set(['id', 'entries']));
-    const appended = after.slice(before.length);
-    return { id: current.id, ...turn, entries, appended };
-  }
-  function applyChanges(target, changes) {
-    const result = { ...target, ...(changes.set || {}) };
-    for (const key of changes.unset || []) delete result[key];
-    for (const [key, suffix] of Object.entries(changes.append || {})) {
-      if (typeof result[key] !== 'string' || typeof suffix !== 'string') throw new Error('增量字段类型不匹配');
-      result[key] += suffix;
-    }
-    return result;
-  }
-  function applyTurnPatch(turn, patch) {
-    if (!turn || turn.id !== patch?.id) throw new Error('增量轮次不存在');
-    const next = applyChanges(turn, patch), entries = [...(turn.entries || [])];
-    for (const entryPatch of patch.entries || []) {
-      const index = entries.findIndex(entry => entry.id === entryPatch.id);
-      const entry = entries[index];
-      if (!entry || entry.id !== entryPatch.id) throw new Error('增量条目边界不匹配');
-      entries[index] = applyChanges(entry, entryPatch);
-    }
-    for (const entry of patch.appended || []) {
-      if (entries.some(existing => existing.id === entry.id)) throw new Error('增量条目重复');
-      entries.push(entry);
-    }
-    if (turn.itemPage && next.itemPage) next.itemPage = { ...next.itemPage,
-      olderCursor: turn.itemPage.olderCursor, hasLoadedOldest: turn.itemPage.hasLoadedOldest,
-      oldestItemId: turn.itemPage.oldestItemId };
-    next.entries = entries; return next;
-  }
-  function acceptSyncUpdate(current, incoming) {
-    if (incoming.reset) return { reset: true, next: incoming };
-    const valid = current && incoming.id === current.id && incoming.epoch === current.epoch &&
-      Number.isSafeInteger(incoming.fromSeq) && incoming.fromSeq >= 1 &&
-      Number.isSafeInteger(incoming.toSeq) && incoming.toSeq >= incoming.fromSeq;
-    if (!valid || incoming.fromSeq > current.seq + 1) throw new Error('实时更新序号不连续');
-    if (incoming.toSeq <= current.seq) return { duplicate: true, next: current };
-    return { next: { ...current, seq: incoming.toSeq } };
-  }
-  // A batch is acknowledged after consumption. Only an individual record is
-  // reassembled; the timeline itself is never serialized into one large string.
-  function* timelineBatches(timeline) {
-    function* entryRecords(value, kind, textField = '') {
-      const text = textField ? value[textField]?.text : value.text;
-      if (typeof text !== 'string' || text.length <= 4096) { yield { kind, value }; return; }
-      const metadata = textField ? { ...value, [textField]: { ...value[textField], text: '' } } : { ...value, text: '' };
-      yield { kind: 'entry-start', value: metadata, target: kind, textField };
-      for (let offset = 0; offset < text.length; offset += 4096) yield { kind: 'entry-text', value: text.slice(offset, offset + 4096) };
-      yield { kind: 'entry-end' };
-    }
-    function* records() {
-      const { turns, turnPatches, ...metadata } = timeline;
-      yield { kind: 'timeline', value: metadata };
-      for (const turn of turns) {
-        const { entries, ...metadata } = turn;
-        yield { kind: 'turn', value: metadata };
-        for (const entry of entries || []) yield* entryRecords(entry, 'entry');
-      }
-      for (const patch of turnPatches || []) {
-        const { entries, appended, ...metadata } = patch;
-        yield { kind: 'patch', value: metadata };
-        for (const entry of entries || []) yield* entryRecords(entry, 'patch-entry', entry.append?.text ? 'append' : 'set');
-        for (const entry of appended || []) yield* entryRecords(entry, 'patch-appended');
-      }
-    }
-    const encoder = new TextEncoder();
-    let batch = [], bytes = 0;
-    for (const record of records()) {
-      const json = JSON.stringify(record);
-      for (let offset = 0; offset < json.length; offset += 4096) {
-        const piece = { text: json.slice(offset, offset + 4096), end: offset + 4096 >= json.length };
-        const size = encoder.encode(JSON.stringify(piece)).length;
-        if (batch.length && bytes + size > 48 * 1024) { yield batch; batch = []; bytes = 0; }
-        batch.push(piece); bytes += size;
-      }
-    }
-    if (batch.length) yield batch;
-  }
-  function createTimelineReceiver() {
-    let timeline, turn, patch, entry, entryTarget, textField, textLength = 0, textParts = [], sequence = 0, parts = [], length = 0;
-    return {
-      accept(batch, pieces) {
-        if (batch !== ++sequence || !Array.isArray(pieces)) throw new Error('历史条目批次不连续');
-        const added = [];
-        const commitEntry = (target, value) => {
-          if (target === 'entry' && turn) { turn.entries.push(value); added.push({ turn, entry: value }); }
-          else if (target === 'patch-entry' && patch) patch.entries.push(value);
-          else if (target === 'patch-appended' && patch) patch.appended.push(value);
-          else throw new Error('历史条目目标无效');
-        };
-        for (const piece of pieces) {
-          if (typeof piece.text !== 'string' || typeof piece.end !== 'boolean') throw new Error('历史条目格式无效');
-          parts.push(piece.text); length += piece.text.length;
-          if (length > 32 * 1024 * 1024) throw new Error('单条历史内容超过接收限制');
-          if (!piece.end) continue;
-          const record = JSON.parse(parts.join('')); parts = []; length = 0;
-          if (entry && !['entry-text', 'entry-end'].includes(record.kind)) throw new Error('历史正文传输未完成');
-          if (record.kind === 'timeline' && !timeline) timeline = { ...record.value, turns: [] };
-          else if (record.kind === 'turn' && timeline) {
-            turn = { ...record.value, entries: [] }; timeline.turns.push(turn);
-          } else if (['entry', 'patch-entry', 'patch-appended'].includes(record.kind)) {
-            commitEntry(record.kind, record.value);
-          } else if (record.kind === 'entry-start' && !entry) {
-            entry = record.value; entryTarget = record.target; textField = record.textField; textParts = []; textLength = 0;
-          } else if (record.kind === 'entry-text' && entry && typeof record.value === 'string') {
-            textLength += record.value.length;
-            if (textLength > 32 * 1024 * 1024) throw new Error('单条历史正文超过接收限制');
-            textParts.push(record.value);
-          } else if (record.kind === 'entry-end' && entry) {
-            if (textField) entry[textField].text = textParts.join(''); else entry.text = textParts.join('');
-            textParts = []; commitEntry(entryTarget, entry); entry = null;
-          } else if (record.kind === 'patch' && timeline) {
-            patch = { ...record.value, entries: [], appended: [] };
-            (timeline.turnPatches ||= []).push(patch);
-          } else throw new Error('历史条目顺序无效');
-        }
-        return { timeline, added };
-      },
-      finish() {
-        if (!timeline || parts.length || entry) throw new Error('历史条目传输未完成');
-        return timeline;
-      },
-    };
-  }
-  return { mergeOrderedEntries, diffTurn, applyTurnPatch, acceptSyncUpdate, timelineBatches, createTimelineReceiver };
-});
+(function (root, factory) {
+  if (typeof module === 'object' && module.exports) module.exports = factory();
+  else root.CodexTimelineSync = factory();
+})(globalThis, function () {
+  const equal = (left, right) => left === right || JSON.stringify(left) === JSON.stringify(right);
+  function changedFields(previous, current, ignored) {
+    const set = {}, append = {}, unset = [];
+    for (const key of new Set([...Object.keys(previous || {}), ...Object.keys(current || {})])) {
+      if (ignored.has(key) || equal(previous?.[key], current?.[key])) continue;
+      if (!Object.hasOwn(current, key)) { unset.push(key); continue; }
+      const before = previous?.[key], after = current[key];
+      if (typeof before === 'string' && typeof after === 'string' && after.startsWith(before)) append[key] = after.slice(before.length);
+      else set[key] = after;
+    }
+    return { set, append, unset };
+  }
+  const nonempty = changes => Object.keys(changes.set).length || Object.keys(changes.append).length || changes.unset.length;
+  // An ordered history range owns the order of its shared IDs. Keep entries
+  // outside that range at their existing shared anchors, never by timestamps.
+  function mergeOrderedEntries(existing, incoming, merge = (_previous, next) => next, incomingIsOlder = false) {
+    const incomingIds = new Set(incoming.map(entry => entry.id));
+    const existingById = new Map(existing.map(entry => [entry.id, entry]));
+    const before = new Map();
+    let pending = [], lastShared;
+    for (const entry of existing) {
+      if (incomingIds.has(entry.id)) {
+        before.set(entry.id, pending); pending = []; lastShared = entry.id;
+      } else pending.push(entry);
+    }
+    if (lastShared === undefined) return incomingIsOlder ? [...incoming, ...existing] : [...existing, ...incoming];
+    return incoming.flatMap(entry => [ ...(before.get(entry.id) || []),
+      existingById.has(entry.id) ? merge(existingById.get(entry.id), entry) : entry,
+      ...(entry.id === lastShared ? pending : []) ]);
+  }
+  function diffTurn(previous, current) {
+    if (!previous || !current || previous.id !== current.id) return null;
+    const before = Array.isArray(previous.entries) ? previous.entries : [];
+    const after = Array.isArray(current.entries) ? current.entries : [];
+    if (after.length < before.length) return null;
+    const entries = [];
+    for (let index = 0; index < before.length; index++) {
+      if (before[index]?.id !== after[index]?.id || before[index]?.type !== after[index]?.type ||
+          before[index]?.role !== after[index]?.role || before[index]?.kind !== after[index]?.kind) return null;
+      const changes = changedFields(before[index], after[index], new Set(['id', 'type', 'role', 'kind']));
+      if (nonempty(changes)) entries.push({ id: after[index].id, index, ...changes });
+    }
+    const turn = changedFields(previous, current, new Set(['id', 'entries']));
+    const appended = after.slice(before.length);
+    return { id: current.id, ...turn, entries, appended };
+  }
+  function applyChanges(target, changes) {
+    const result = { ...target, ...(changes.set || {}) };
+    for (const key of changes.unset || []) delete result[key];
+    for (const [key, suffix] of Object.entries(changes.append || {})) {
+      if (typeof result[key] !== 'string' || typeof suffix !== 'string') throw new Error('增量字段类型不匹配');
+      result[key] += suffix;
+    }
+    return result;
+  }
+  function applyTurnPatch(turn, patch) {
+    if (!turn || turn.id !== patch?.id) throw new Error('增量轮次不存在');
+    const next = applyChanges(turn, patch), entries = [...(turn.entries || [])];
+    for (const entryPatch of patch.entries || []) {
+      const index = entries.findIndex(entry => entry.id === entryPatch.id);
+      const entry = entries[index];
+      if (!entry || entry.id !== entryPatch.id) throw new Error('增量条目边界不匹配');
+      entries[index] = applyChanges(entry, entryPatch);
+    }
+    for (const entry of patch.appended || []) {
+      if (entries.some(existing => existing.id === entry.id)) throw new Error('增量条目重复');
+      entries.push(entry);
+    }
+    if (turn.itemPage && next.itemPage) next.itemPage = { ...next.itemPage,
+      olderCursor: turn.itemPage.olderCursor, hasLoadedOldest: turn.itemPage.hasLoadedOldest,
+      oldestItemId: turn.itemPage.oldestItemId };
+    next.entries = entries; return next;
+  }
+  function acceptSyncUpdate(current, incoming) {
+    if (incoming.reset) return { reset: true, next: incoming };
+    const valid = current && incoming.id === current.id && incoming.epoch === current.epoch &&
+      Number.isSafeInteger(incoming.fromSeq) && incoming.fromSeq >= 1 &&
+      Number.isSafeInteger(incoming.toSeq) && incoming.toSeq >= incoming.fromSeq;
+    if (!valid || incoming.fromSeq > current.seq + 1) throw new Error('实时更新序号不连续');
+    if (incoming.toSeq <= current.seq) return { duplicate: true, next: current };
+    return { next: { ...current, seq: incoming.toSeq } };
+  }
+  // A batch is acknowledged after consumption. Only an individual record is
+  // reassembled; the timeline itself is never serialized into one large string.
+  function* timelineBatches(timeline) {
+    function* entryRecords(value, kind, textField = '') {
+      const text = textField ? value[textField]?.text : value.text;
+      if (typeof text !== 'string' || text.length <= 4096) { yield { kind, value }; return; }
+      const metadata = textField ? { ...value, [textField]: { ...value[textField], text: '' } } : { ...value, text: '' };
+      yield { kind: 'entry-start', value: metadata, target: kind, textField };
+      for (let offset = 0; offset < text.length; offset += 4096) yield { kind: 'entry-text', value: text.slice(offset, offset + 4096) };
+      yield { kind: 'entry-end' };
+    }
+    function* records() {
+      const { turns, turnPatches, ...metadata } = timeline;
+      yield { kind: 'timeline', value: metadata };
+      for (const turn of turns) {
+        const { entries, ...metadata } = turn;
+        yield { kind: 'turn', value: metadata };
+        for (const entry of entries || []) yield* entryRecords(entry, 'entry');
+      }
+      for (const patch of turnPatches || []) {
+        const { entries, appended, ...metadata } = patch;
+        yield { kind: 'patch', value: metadata };
+        for (const entry of entries || []) yield* entryRecords(entry, 'patch-entry', entry.append?.text ? 'append' : 'set');
+        for (const entry of appended || []) yield* entryRecords(entry, 'patch-appended');
+      }
+    }
+    const encoder = new TextEncoder();
+    let batch = [], bytes = 0;
+    for (const record of records()) {
+      const json = JSON.stringify(record);
+      for (let offset = 0; offset < json.length; offset += 4096) {
+        const piece = { text: json.slice(offset, offset + 4096), end: offset + 4096 >= json.length };
+        const size = encoder.encode(JSON.stringify(piece)).length;
+        if (batch.length && bytes + size > 48 * 1024) { yield batch; batch = []; bytes = 0; }
+        batch.push(piece); bytes += size;
+      }
+    }
+    if (batch.length) yield batch;
+  }
+  function createTimelineReceiver() {
+    let timeline, turn, patch, entry, entryTarget, textField, textLength = 0, textParts = [], sequence = 0, parts = [], length = 0;
+    return {
+      accept(batch, pieces) {
+        if (batch !== ++sequence || !Array.isArray(pieces)) throw new Error('历史条目批次不连续');
+        const added = [];
+        const commitEntry = (target, value) => {
+          if (target === 'entry' && turn) { turn.entries.push(value); added.push({ turn, entry: value }); }
+          else if (target === 'patch-entry' && patch) patch.entries.push(value);
+          else if (target === 'patch-appended' && patch) patch.appended.push(value);
+          else throw new Error('历史条目目标无效');
+        };
+        for (const piece of pieces) {
+          if (typeof piece.text !== 'string' || typeof piece.end !== 'boolean') throw new Error('历史条目格式无效');
+          parts.push(piece.text); length += piece.text.length;
+          if (length > 32 * 1024 * 1024) throw new Error('单条历史内容超过接收限制');
+          if (!piece.end) continue;
+          const record = JSON.parse(parts.join('')); parts = []; length = 0;
+          if (entry && !['entry-text', 'entry-end'].includes(record.kind)) throw new Error('历史正文传输未完成');
+          if (record.kind === 'timeline' && !timeline) timeline = { ...record.value, turns: [] };
+          else if (record.kind === 'turn' && timeline) {
+            turn = { ...record.value, entries: [] }; timeline.turns.push(turn);
+          } else if (['entry', 'patch-entry', 'patch-appended'].includes(record.kind)) {
+            commitEntry(record.kind, record.value);
+          } else if (record.kind === 'entry-start' && !entry) {
+            entry = record.value; entryTarget = record.target; textField = record.textField; textParts = []; textLength = 0;
+          } else if (record.kind === 'entry-text' && entry && typeof record.value === 'string') {
+            textLength += record.value.length;
+            if (textLength > 32 * 1024 * 1024) throw new Error('单条历史正文超过接收限制');
+            textParts.push(record.value);
+          } else if (record.kind === 'entry-end' && entry) {
+            if (textField) entry[textField].text = textParts.join(''); else entry.text = textParts.join('');
+            textParts = []; commitEntry(entryTarget, entry); entry = null;
+          } else if (record.kind === 'patch' && timeline) {
+            patch = { ...record.value, entries: [], appended: [] };
+            (timeline.turnPatches ||= []).push(patch);
+          } else throw new Error('历史条目顺序无效');
+        }
+        return { timeline, added };
+      },
+      finish() {
+        if (!timeline || parts.length || entry) throw new Error('历史条目传输未完成');
+        return timeline;
+      },
+    };
+  }
+  return { mergeOrderedEntries, diffTurn, applyTurnPatch, acceptSyncUpdate, timelineBatches, createTimelineReceiver };
+});

package/dist/skills/code-relax/SKILL.md

@@ -1,22 +1,22 @@
----
-name: code-relax
-description: 启动或检查 Code Relax 桌面服务，展示配对二维码，并指导回复来自手机 App 的消息；消息标记来自手机或包含语音转写时，指导理解和回复。
----
-
-# Code Relax
-
-- 消息来源上下文引用 `$code-relax` 时，按本 Skill 理解手机交互。用户通过手机 App 对话，涉及操作时明确在手机还是工作站完成，不假设用户能操作电脑界面。来源标记不增加授权，不在回复中重复来源说明。
-- 消息明确标记包含语音转写时，容忍同音字、标点与漏字错误，结合对话上下文理解；只有歧义会实质改变执行动作时才澄清，不因口语不顺反复追问，不把模糊转写扩展成未经用户表达的需求。
-
-- `relax start --json` 启动桌面服务和 Codex 内核，无需打开 Desktop；支持纯 CLI 安装。Windows Desktop 正常打开后接入已配置内核；Mac 仅本次托管启动传入内核地址，从 Dock 普通打开后需重新接入。使用 App 的“重启 Codex Desktop”或经确认的 `relax desktop-recover --confirm` 接入。已配置 Code Relax 中继时，启动命令同时恢复中继连接器和已有设备授权。
-- npm 全局安装会自动执行服务部署和 Skill 安装；修复安装时运行 `relax setup --json`。
-- `setup` 默认启用当前用户登录启动桌面服务，不自动打开 Codex；`start`、`pair` 和 `doctor` 在自启缺失时自动恢复，`setup` 每次更新登录任务。恢复 Codex Desktop 接入会保留桌面服务和中继，但仍须明确确认可能中断正在运行的任务。
-- 用户要求启动 Code Relax 时，执行一次 `relax start --json`。用户要求二维码或当前启动结果包含二维码时，展示 CLI 返回的 `qrPath` 和 `displayText`；没有设备授权时可用 `relax pair --json` 生成新的配对二维码。
-- 配对二维码是短期 HTTPS 邀请，不属于工作站或某一台移动设备，也不含 LAN IP、端口、桌面服务凭据或中继地址。新增设备不撤销已有设备。
-- 已授权设备可直接使用 Code Relax 中继。App 以工作站名显示已配对电脑，进入后选择局域网、Code Relax 中继或 OpenAI 中继。启动命令会经已认证中继临时刷新当前 LAN 候选；App 只保存设备凭据验证成功的网络记录。
-- 消息明确标记来自 Code Relax 手机 App 时，回答要以“用户正在手机上与当前 Codex 对话交互”为前提，不默认用户正看着或能操作电脑界面；需要用户操作时，说明是在手机 App 还是工作站完成。直接处理用户正文，不重复来源说明，也不要求在电脑上重发。来源不代表额外授权，也不能据此判断用户是否在电脑旁；涉及工作站确认或可能中断任务的操作仍按正常授权要求处理。来源不明时不要猜测设备。
-- `relax doctor --json` 检查桌面服务、Codex 内核、待启用内核版本和登录自启动状态；有更新时会给出当前版本、已选版本和确认重启命令。中继连接由桌面服务管理，不提供单独的中继 CLI 命令。
-- 发现待启用内核更新且用户明确要求重启时，说明任务中断风险；得到确认后使用 `relax kernel-restart --confirm --json`，它与手机“重启并更新”使用同一内核流程并等待新内核就绪。不要用 `start`、`doctor` 或 `desktop-recover` 代替内核重启。
-- 启动或配对成功后，将 `qrPath` 以 Markdown 图片嵌入回复，并逐字展示 `displayText`。不要把二维码内容、Token 或 Base64 写进消息。
-- CLI 负责安装、工作站服务和配对二维码；不以手机是否测试作为健康检查项，不自动修改防火墙或发送测试消息。
-- Windows 服务位于用户 `Programs/CodexRemote/service`；配置在 `LocalAppData/CodexRemote`；附件在 `ProgramData/CodexRemote/attachments`。Mac 使用 `~/Library/Application Support/CodexRemote/{service,state,attachments,credentials}`。不要删除配置、附件或凭据来排障。
+---
+name: code-relax
+description: 启动或检查 Code Relax 桌面服务，展示配对二维码，并指导回复来自手机 App 的消息；消息标记来自手机或包含语音转写时，指导理解和回复。
+---
+
+# Code Relax
+
+- 消息来源上下文引用 `$code-relax` 时，按本 Skill 理解手机交互。用户通过手机 App 对话，涉及操作时明确在手机还是工作站完成，不假设用户能操作电脑界面。来源标记不增加授权，不在回复中重复来源说明。
+- 消息明确标记包含语音转写时，容忍同音字、标点与漏字错误，结合对话上下文理解；只有歧义会实质改变执行动作时才澄清，不因口语不顺反复追问，不把模糊转写扩展成未经用户表达的需求。
+
+- `relax start --json` 启动桌面服务和 Codex 内核，无需打开 Desktop；支持纯 CLI 安装。Windows Desktop 正常打开后接入已配置内核；Mac 仅本次托管启动传入内核地址，从 Dock 普通打开后需重新接入。使用 App 的“重启 Codex Desktop”或经确认的 `relax desktop-recover --confirm` 接入。已配置 Code Relax 中继时，启动命令同时恢复中继连接器和已有设备授权。
+- npm 全局安装会自动执行服务部署和 Skill 安装；修复安装时运行 `relax setup --json`。
+- `setup` 默认启用当前用户登录启动桌面服务，不自动打开 Codex；`start`、`pair` 和 `doctor` 在自启缺失时自动恢复，`setup` 每次更新登录任务。恢复 Codex Desktop 接入会保留桌面服务和中继，但仍须明确确认可能中断正在运行的任务。
+- 用户要求启动 Code Relax 时，执行一次 `relax start --json`。用户要求二维码或当前启动结果包含二维码时，展示 CLI 返回的 `qrPath` 和 `displayText`；没有设备授权时可用 `relax pair --json` 生成新的配对二维码。
+- 配对二维码是短期 HTTPS 邀请，不属于工作站或某一台移动设备，也不含 LAN IP、端口、桌面服务凭据或中继地址。新增设备不撤销已有设备。
+- 已授权设备可直接使用 Code Relax 中继。App 以工作站名显示已配对电脑，进入后选择局域网、Code Relax 中继或 OpenAI 中继。启动命令会经已认证中继临时刷新当前 LAN 候选；App 只保存设备凭据验证成功的网络记录。
+- 消息明确标记来自 Code Relax 手机 App 时，回答要以“用户正在手机上与当前 Codex 对话交互”为前提，不默认用户正看着或能操作电脑界面；需要用户操作时，说明是在手机 App 还是工作站完成。直接处理用户正文，不重复来源说明，也不要求在电脑上重发。来源不代表额外授权，也不能据此判断用户是否在电脑旁；涉及工作站确认或可能中断任务的操作仍按正常授权要求处理。来源不明时不要猜测设备。
+- `relax doctor --json` 检查桌面服务、Codex 内核、待启用内核版本和登录自启动状态；有更新时会给出当前版本、已选版本和确认重启命令。中继连接由桌面服务管理，不提供单独的中继 CLI 命令。
+- 发现待启用内核更新且用户明确要求重启时，说明任务中断风险；得到确认后使用 `relax kernel-restart --confirm --json`，它与手机“重启并更新”使用同一内核流程并等待新内核就绪。不要用 `start`、`doctor` 或 `desktop-recover` 代替内核重启。
+- 启动或配对成功后，将 `qrPath` 以 Markdown 图片嵌入回复，并逐字展示 `displayText`。不要把二维码内容、Token 或 Base64 写进消息。
+- CLI 负责安装、工作站服务和配对二维码；不以手机是否测试作为健康检查项，不自动修改防火墙或发送测试消息。
+- Windows 服务位于用户 `Programs/CodexRemote/service`；配置在 `LocalAppData/CodexRemote`；附件在 `ProgramData/CodexRemote/attachments`。Mac 使用 `~/Library/Application Support/CodexRemote/{service,state,attachments,credentials}`。不要删除配置、附件或凭据来排障。

package/dist/src/archived-threads.mjs

@@ -0,0 +1,22 @@
+import { sharedThreadProjectId, dotsThreadProjectId } from './shared-catalog.mjs';
+
+// One metadata page per request. Local and hosted cursors must never be mixed.
+export async function archivedThreadsPage(server, localServer, hostId, cursor) {
+  await server.connect();
+  const identity = server.profileIdentity;
+  const [page, projects] = await Promise.all([
+    server.request('thread/list', { archived: true, limit: 100, sortKey: 'updated_at',
+      sortDirection: 'desc', ...(hostId === 'local' ? { useStateDbOnly: true } : {}),
+      ...(cursor ? { cursor } : {}) }),
+    localServer.projects(),
+  ]);
+  if (hostId === 'durable' && identity !== server.profileIdentity) throw new Error('云端账号已变化，请重新读取归档列表。');
+  const group = hostId === 'durable' ? dotsThreadProjectId : sharedThreadProjectId;
+  return { nextCursor: page.nextCursor || null,
+    threads: page.data.filter(thread => hostId === 'durable' ? thread.threadSource === 'aeon_child' : thread.threadSource !== 'aeon')
+      .map(thread => ({ id: thread.id, hostId, kind: 'codex', threadSource: thread.threadSource,
+        title: thread.name || thread.preview || '', projectId: group(thread, projects),
+        cwd: thread.cwd, updatedAt: thread.updatedAt, recencyAt: thread.recencyAt ?? thread.updatedAt,
+        status: typeof thread.status === 'string' ? thread.status : thread.status?.type || 'unknown',
+        activeFlags: Array.isArray(thread.status?.activeFlags) ? thread.status.activeFlags : [] })) };
+}

package/dist/src/background-process.mjs

@@ -1,18 +1,18 @@
-import fs from 'node:fs';
-import { spawn } from 'node:child_process';
-import { startWindowsProcess } from './platform/windows/background-process.mjs';
-
-export const processAlive = pid => {
-  try { process.kill(pid, 0); return true; }
-  catch (error) { if (error.code === 'ESRCH') return false; throw error; }
-};
-export async function startBackground(executable, args, environment, logs = []) {
-  if (process.platform === 'win32') return startWindowsProcess(executable, args, environment, logs);
-  const descriptors = logs.map(file => fs.openSync(file, 'a'));
-  try {
-    const child = spawn(executable, args, { detached: true, env: environment,
-      stdio: ['ignore', descriptors[0] ?? 'ignore', descriptors[1] ?? 'ignore'] });
-    await new Promise((resolve, reject) => { child.once('spawn', resolve); child.once('error', reject); });
-    child.unref(); return child.pid;
-  } finally { descriptors.forEach(fd => fs.closeSync(fd)); }
-}
+import fs from 'node:fs';
+import { spawn } from 'node:child_process';
+import { startWindowsProcess } from './platform/windows/background-process.mjs';
+
+export const processAlive = pid => {
+  try { process.kill(pid, 0); return true; }
+  catch (error) { if (error.code === 'ESRCH') return false; throw error; }
+};
+export async function startBackground(executable, args, environment, logs = []) {
+  if (process.platform === 'win32') return startWindowsProcess(executable, args, environment, logs);
+  const descriptors = logs.map(file => fs.openSync(file, 'a'));
+  try {
+    const child = spawn(executable, args, { detached: true, env: environment,
+      stdio: ['ignore', descriptors[0] ?? 'ignore', descriptors[1] ?? 'ignore'] });
+    await new Promise((resolve, reject) => { child.once('spawn', resolve); child.once('error', reject); });
+    child.unref(); return child.pid;
+  } finally { descriptors.forEach(fd => fs.closeSync(fd)); }
+}

package/dist/src/bounded-process-log.mjs

@@ -1,63 +1,63 @@
-import fs from 'node:fs';
-
-export const processLogMaxBytes = 8 * 1024 * 1024;
-const retryMs = 30_000;
-
-// The broker drains output even when storage fails, so logging cannot crash
-// the child or build an unbounded in-memory queue.
-export function attachProcessLog(stream, file, { maxBytes = processLogMaxBytes, now = Date.now } = {}) {
-  let retryAt = 0, dropped = 0, lastError = '';
-  function append(bytes) {
-    let size = 0;
-    try { size = fs.statSync(file).size; }
-    catch (error) { if (error.code !== 'ENOENT') throw error; }
-    // Apply the same retention bound to a log left by an earlier launch.
-    if (size > maxBytes) {
-      const fd = fs.openSync(file, 'r+');
-      try {
-        const tail = Buffer.alloc(maxBytes);
-        const count = fs.readSync(fd, tail, 0, maxBytes, size - maxBytes);
-        fs.ftruncateSync(fd, 0);
-        writeAll(fd, tail.subarray(0, count));
-        size = count;
-      } finally { fs.closeSync(fd); }
-    }
-    for (let offset = 0; offset < bytes.length;) {
-      if (size >= maxBytes) {
-        fs.rmSync(`${file}.2`, { force: true });
-        try { fs.renameSync(`${file}.1`, `${file}.2`); }
-        catch (error) { if (error.code !== 'ENOENT') throw error; }
-        fs.renameSync(file, `${file}.1`);
-        size = 0;
-      }
-      const part = bytes.subarray(offset, offset + maxBytes - size);
-      const fd = fs.openSync(file, 'a');
-      try { writeAll(fd, part); } finally { fs.closeSync(fd); }
-      offset += part.length;
-      size += part.length;
-    }
-  }
-  stream.on('data', chunk => {
-    const bytes = Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk);
-    if (now() < retryAt) { dropped += bytes.length; return; }
-    try {
-      if (dropped) append(Buffer.from(`\n[log recovered ${new Date(now()).toISOString()}; previous error: ${lastError}; discarded output bytes: ${dropped}]\n`));
-      append(bytes);
-      dropped = 0;
-      retryAt = 0;
-    } catch (error) {
-      dropped += bytes.length;
-      lastError = error.code || error.message;
-      retryAt = now() + retryMs;
-    }
-  });
-}
-
-function writeAll(fd, bytes) {
-  let offset = 0;
-  while (offset < bytes.length) {
-    const count = fs.writeSync(fd, bytes, offset, bytes.length - offset);
-    if (!count) throw new Error('Log write made no progress.');
-    offset += count;
-  }
-}
+import fs from 'node:fs';
+
+export const processLogMaxBytes = 8 * 1024 * 1024;
+const retryMs = 30_000;
+
+// The broker drains output even when storage fails, so logging cannot crash
+// the child or build an unbounded in-memory queue.
+export function attachProcessLog(stream, file, { maxBytes = processLogMaxBytes, now = Date.now } = {}) {
+  let retryAt = 0, dropped = 0, lastError = '';
+  function append(bytes) {
+    let size = 0;
+    try { size = fs.statSync(file).size; }
+    catch (error) { if (error.code !== 'ENOENT') throw error; }
+    // Apply the same retention bound to a log left by an earlier launch.
+    if (size > maxBytes) {
+      const fd = fs.openSync(file, 'r+');
+      try {
+        const tail = Buffer.alloc(maxBytes);
+        const count = fs.readSync(fd, tail, 0, maxBytes, size - maxBytes);
+        fs.ftruncateSync(fd, 0);
+        writeAll(fd, tail.subarray(0, count));
+        size = count;
+      } finally { fs.closeSync(fd); }
+    }
+    for (let offset = 0; offset < bytes.length;) {
+      if (size >= maxBytes) {
+        fs.rmSync(`${file}.2`, { force: true });
+        try { fs.renameSync(`${file}.1`, `${file}.2`); }
+        catch (error) { if (error.code !== 'ENOENT') throw error; }
+        fs.renameSync(file, `${file}.1`);
+        size = 0;
+      }
+      const part = bytes.subarray(offset, offset + maxBytes - size);
+      const fd = fs.openSync(file, 'a');
+      try { writeAll(fd, part); } finally { fs.closeSync(fd); }
+      offset += part.length;
+      size += part.length;
+    }
+  }
+  stream.on('data', chunk => {
+    const bytes = Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk);
+    if (now() < retryAt) { dropped += bytes.length; return; }
+    try {
+      if (dropped) append(Buffer.from(`\n[log recovered ${new Date(now()).toISOString()}; previous error: ${lastError}; discarded output bytes: ${dropped}]\n`));
+      append(bytes);
+      dropped = 0;
+      retryAt = 0;
+    } catch (error) {
+      dropped += bytes.length;
+      lastError = error.code || error.message;
+      retryAt = now() + retryMs;
+    }
+  });
+}
+
+function writeAll(fd, bytes) {
+  let offset = 0;
+  while (offset < bytes.length) {
+    const count = fs.writeSync(fd, bytes, offset, bytes.length - offset);
+    if (!count) throw new Error('Log write made no progress.');
+    offset += count;
+  }
+}