mixdog 0.7.12 → 0.7.13

package/src/agent/orchestrator/tools/builtin/glob-walk.mjs

@@ -1,4 +1,4 @@
-import { readdirSync } from 'fs';
+import { readdir } from 'fs/promises';
 import { join } from 'path';
 
 // Glob-to-RegExp compiler for name filters used by find_files and the
@@ -125,21 +125,34 @@ export const NOISE_DIR_NAMES = new Set([
     '.gradle', 'coverage',
 ]);
 
+export const MAX_WALK_ENTRIES = 200_000;
+
 // Unified directory walk used by list / tree / find_files. The visitor
 // callback owns the "should I record this entry?" decision; returning
 // literal false aborts the whole walk.
 // `onWarn(dir, err)` (optional) is invoked for any readdir failure so
 // callers can surface skipped paths instead of silently dropping them.
-export function walkDir(root, { hidden = false, maxDepth = Infinity, visit, sort, excludeDirNames, onWarn } = {}) {
+export async function walkDir(root, { hidden = false, maxDepth = Infinity, visit, sort, excludeDirNames, onWarn, maxEntries = MAX_WALK_ENTRIES, signal } = {}) {
     // Windows filesystems are case-insensitive — match exclusion names the
     // same way so e.g. Node_Modules is pruned like node_modules.
     const _exclCI = process.platform === 'win32' && excludeDirNames && excludeDirNames.size > 0
         ? new Set([...excludeDirNames].map((n) => n.toLowerCase()))
         : null;
-    const _walk = (dir, depth) => {
+    let truncated = false;
+    const cap = maxEntries;
+    let entriesVisited = 0;
+    const _walk = async (dir, depth) => {
+        if (signal?.aborted) {
+            truncated = true;
+            return false;
+        }
+        if (entriesVisited >= cap) {
+            truncated = true;
+            return false;
+        }
         if (depth > maxDepth) return true;
         let entries;
-        try { entries = readdirSync(dir, { withFileTypes: true }); }
+        try { entries = await readdir(dir, { withFileTypes: true }); }
         catch (err) {
             if (typeof onWarn === 'function') {
                 try { onWarn(dir, err); } catch { /* warning sink must not abort */ }
@@ -155,16 +168,26 @@ export function walkDir(root, { hidden = false, maxDepth = Infinity, visit, sort
         if (sort) entries.sort(sort);
         const total = entries.length;
         for (let i = 0; i < total; i++) {
+            if (signal?.aborted) {
+                truncated = true;
+                return false;
+            }
+            if (entriesVisited >= cap) {
+                truncated = true;
+                return false;
+            }
+            entriesVisited += 1;
             const ent = entries[i];
             const entPath = join(dir, ent.name);
             const ctx = { depth, index: i, total, isLast: i === total - 1 };
             const cont = visit(ent, entPath, ctx);
             if (cont === false) return false;
             if (ent.isDirectory()) {
-                if (_walk(entPath, depth + 1) === false) return false;
+                if ((await _walk(entPath, depth + 1)) === false) return false;
             }
         }
         return true;
     };
-    _walk(root, 1);
+    await _walk(root, 1);
+    return { truncated, entriesVisited };
 }

package/src/agent/orchestrator/tools/builtin/list-tool.mjs

@@ -111,10 +111,11 @@ export async function executeListTool(args, workDir, options = {}) {
     // never hit either bound, so normal behavior is unchanged.
     let truncatedByCap = false;
     const walkDeadline = Date.now() + LIST_WALK_TIMEOUT_MS;
-    walkDir(fullPath, {
+    await walkDir(fullPath, {
         hidden,
         maxDepth: depth,
         excludeDirNames: includeNoise ? null : NOISE_DIR_NAMES,
+        signal: options.signal,
         visit: (ent, entPath) => {
             if (Date.now() > walkDeadline) { truncatedByCap = true; return false; }
             const isDir = ent.isDirectory();
@@ -235,10 +236,11 @@ export async function executeTreeTool(args, workDir, options = {}) {
     const lines = [`${normalizeOutputPath(fullPath)}/`];
     const prefixStack = [''];
     const TREE_BRANCH_LINE_CAP = 500;
-    walkDir(fullPath, {
+    await walkDir(fullPath, {
         hidden,
         maxDepth: depth,
         excludeDirNames: includeNoise ? null : NOISE_DIR_NAMES,
+        signal: options.signal,
         sort: (a, b) => {
             const ad = a.isDirectory(), bd = b.isDirectory();
             if (ad !== bd) return ad ? -1 : 1;
@@ -500,10 +502,11 @@ export async function executeFindFilesTool(args, workDir, options = {}) {
     if (!handledByRgFiles && useBatchedStat) {
         const candidates = [];
         const walkDeadline1 = Date.now() + FIND_WALK_TIMEOUT_MS;
-        walkDir(fullPath, {
+        await walkDir(fullPath, {
             hidden,
             maxDepth: depth ?? Infinity,
             excludeDirNames: includeNoise ? null : NOISE_DIR_NAMES,
+            signal: options.signal,
             visit: (ent, entPath) => {
                 if (Date.now() > walkDeadline1) { truncatedByCap = true; return false; }
                 const isDir = ent.isDirectory();
@@ -532,10 +535,11 @@ export async function executeFindFilesTool(args, workDir, options = {}) {
         const effectiveTypeFilter = sizeFiltered && typeFilter === 'any' ? 'file' : typeFilter;
         const candidates = [];
         const walkDeadline2 = Date.now() + FIND_WALK_TIMEOUT_MS;
-        walkDir(fullPath, {
+        await walkDir(fullPath, {
             hidden,
             maxDepth: depth ?? Infinity,
             excludeDirNames: includeNoise ? null : NOISE_DIR_NAMES,
+            signal: options.signal,
             visit: (ent, entPath) => {
                 if (Date.now() > walkDeadline2) { truncatedByCap = true; return false; }
                 const isDir = ent.isDirectory();

package/src/agent/orchestrator/tools/builtin.mjs

@@ -361,6 +361,9 @@ function capToolOutput(result, options = {}) {
 }
 
 export async function executeBuiltinTool(name, args, cwd, options = {}) {
+    if (options.abortSignal && !options.signal) {
+        options = { ...options, signal: options.abortSignal };
+    }
     const toolName = canonicalizeBuiltinToolName(name);
     const argError = validateBuiltinArgs(toolName, args);
     if (argError) return argError;
@@ -414,9 +417,9 @@ export async function executeBuiltinTool(name, args, cwd, options = {}) {
         case 'list':
             return executeListTool(args, workDir, options);
         case 'tree':
-            return executeTreeTool(args, workDir);
+            return executeTreeTool(args, workDir, options);
         case 'find_files':
-            return executeFindFilesTool(args, workDir);
+            return executeFindFilesTool(args, workDir, options);
         case 'head':
             return executeHeadTool(args, workDir, readStateScope, _readModeHelpers);
         case 'tail':

package/src/agent/orchestrator/tools/cwd-tool.mjs

@@ -58,15 +58,14 @@ const PRUNED_DIR_NAMES = new Set([...NOISE_DIR_NAMES, ...EXTRA_NOISE_DIR_NAMES])
 
 let _listCache = null
 
-// Per-scan set used by the visitor to mark repos whose subtree must not
-// be descended. walkDir does not natively support "stop descent into
-// this dir but keep the walk going", so we approximate by checking
-// ancestry on every visit and bailing early when the entry lives under
-// a previously-recorded repo.
-const _recordedRepos = new Set()
-
-function _scanReposUnderFiltered(root) {
-  _recordedRepos.clear()
+async function _scanReposUnderFiltered(root, signal) {
+  // Per-scan set used by the visitor to mark repos whose subtree must not be
+  // descended. walkDir does not natively support "stop descent into this dir
+  // but keep the walk going", so we approximate by checking ancestry on every
+  // visit and bailing early when the entry lives under a previously-recorded
+  // repo. MUST be local per-call: walkDir is async, so a module-global set
+  // would race across concurrent/background scans suspended in `await readdir`.
+  const recordedRepos = new Set()
   const repos = []
   if (!root || !existsSync(root)) return repos
   try {
@@ -79,17 +78,18 @@ function _scanReposUnderFiltered(root) {
     return repos
   }
 
-  walkDir(root, {
+  await walkDir(root, {
     hidden: true,
     maxDepth: 4,
     excludeDirNames: PRUNED_DIR_NAMES,
+    signal,
     visit: (ent, entPath) => {
       if (!ent.isDirectory()) return
       // Skip subtree of a previously-recorded repo. walkDir invokes
       // visit before recursing, so flipping ent.isDirectory() here
       // would not stop descent. Instead, check ancestry on every
       // visit and bail early.
-      for (const recorded of _recordedRepos) {
+      for (const recorded of recordedRepos) {
         if (entPath === recorded || entPath.startsWith(recorded + '/') || entPath.startsWith(recorded + '\\')) {
           return
         }
@@ -97,7 +97,7 @@ function _scanReposUnderFiltered(root) {
       try {
         if (existsSync(`${entPath}/.git`)) {
           repos.push(entPath)
-          _recordedRepos.add(entPath)
+          recordedRepos.add(entPath)
         }
       } catch { /* ignore stat races */ }
     },
@@ -151,7 +151,7 @@ function _authoredByIdentity(repoPath, emails) {
   }
 }
 
-function _buildRepoList(includeAll = false) {
+async function _buildRepoList(includeAll = false, signal) {
   const cfg = _cwdConfig()
   const user = rawUserCwd()
   const roots = []
@@ -169,7 +169,7 @@ function _buildRepoList(includeAll = false) {
 
   const repoSet = new Map() // canonical → original path
   for (const root of roots) {
-    for (const repo of _scanReposUnderFiltered(root)) {
+    for (const repo of await _scanReposUnderFiltered(root, signal)) {
       const key = _canonicalSessionCwd(repo)
       if (!repoSet.has(key)) repoSet.set(key, repo)
     }
@@ -257,9 +257,9 @@ export async function executeCwdTool(name, args, callerCwd, opts = {}) {
   if (action === 'list') {
     // `all:true` bypasses the owned-project filter and transient prune — a
     // raw scan of every .git repo under the roots. Not cached (rare).
-    if (args?.all === true) return _formatList(_buildRepoList(true))
+    if (args?.all === true) return _formatList(await _buildRepoList(true, opts.signal))
     if (args?.refresh === true) _listCache = null
-    if (!_listCache) _listCache = _buildRepoList(false)
+    if (!_listCache) _listCache = await _buildRepoList(false, opts.signal)
     return _formatList(_listCache)
   }
 
@@ -293,6 +293,6 @@ export const CWD_TOOL_DEFS = [
 // and unref'd so it never blocks startup or keeps the process alive.
 try {
   setTimeout(() => {
-    try { if (!_listCache) _listCache = _buildRepoList(false) } catch { /* best-effort */ }
+    try { if (!_listCache) _buildRepoList(false).then((r) => { _listCache = r }) } catch { /* best-effort */ }
   }, 1000).unref?.()
 } catch { /* environments without setTimeout */ }

package/src/agent/orchestrator/tools/graph-manifest.json

@@ -1,26 +1,26 @@
 {
-  "version": "0.7.12",
+  "version": "0.7.13",
   "_comment": "Rewritten by .github/workflows/graph-release.yml on each tagged release. assets maps platformKey (process.platform-process.arch, e.g. win32-x64, linux-x64, darwin-arm64) to { url, sha256 } of the mixdog-graph binary on the GitHub release. A local cargo build under native/mixdog-graph/target/release always takes precedence at runtime. (v0.5.236 entries were filled manually after CI's commit step hit detached HEAD; the workflow now checks out ref: main so future releases self-update.)",
   "assets": {
     "darwin-arm64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-graph-darwin-arm64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-graph-darwin-arm64",
       "sha256": "75bfdd200b2f8553b72dc877ec2637208f581800083d1ee5f9caf33f87792bf7"
     },
     "darwin-x64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-graph-darwin-x64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-graph-darwin-x64",
       "sha256": "04742fbb4cbe09bb76943f312ee129c05814543e7bc9d37e1241fb4e65b97137"
     },
     "linux-arm64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-graph-linux-arm64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-graph-linux-arm64",
       "sha256": "4b3edcd7be1ffec7184c48fe6bc7d6bce42f2ea67d4709f44d4402e6b48564f2"
     },
     "linux-x64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-graph-linux-x64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-graph-linux-x64",
       "sha256": "4394bb7884a8706dd6a4eea55f8755c76ba584cd02248863802d94acc3e1413c"
     },
     "win32-x64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-graph-win32-x64.exe",
-      "sha256": "cbfe189d690085aee1dfd70f5c0b9c26c260d0a080914cbeb504c84510ec3a5a"
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-graph-win32-x64.exe",
+      "sha256": "2acf1fc9040cfc78a643daa477b15c8eaa0f520fd8addd1cf6f2f8cddd5c914c"
     }
   }
 }

package/src/agent/orchestrator/tools/patch-manifest.json

@@ -1,26 +1,26 @@
 {
-  "version": "0.7.12",
+  "version": "0.7.13",
   "_comment": "Rewritten by .github/workflows/patch-release.yml on each tagged release. assets maps platformKey (process.platform-process.arch, e.g. win32-x64, linux-x64, darwin-arm64) to { url, sha256 } of the mixdog-patch binary on the GitHub release. A local cargo build under native/mixdog-patch/target/release always takes precedence; otherwise the binary is fetched per this manifest into the data dir (apply is native-only — no JS apply engine).",
   "assets": {
     "darwin-arm64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-patch-darwin-arm64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-patch-darwin-arm64",
       "sha256": "836a0b60a443b0a6a8c1bbe24d15a79ed70ee92c2f0fbc05374c4e9ed2536415"
     },
     "darwin-x64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-patch-darwin-x64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-patch-darwin-x64",
       "sha256": "cab10c4e1e8b72d3958241dffdff764712ed74f4861d105bafa8258961215c98"
     },
     "linux-arm64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-patch-linux-arm64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-patch-linux-arm64",
       "sha256": "a90c32ce3417a7d853f2723f82f3613cf2cd030fe885cf710cfc9f8e4b193264"
     },
     "linux-x64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-patch-linux-x64",
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-patch-linux-x64",
       "sha256": "0fea40ab98acd35bfb47515756024d1882a2abbaddce8a0b51642d20ac405577"
     },
     "win32-x64": {
-      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.12/mixdog-patch-win32-x64.exe",
-      "sha256": "f8a74fb9bb7bf333fa441b800b76b28d83a2a7b4795e4a769122faf47a59d1f1"
+      "url": "https://github.com/trib-plugin/mixdog/releases/download/v0.7.13/mixdog-patch-win32-x64.exe",
+      "sha256": "24b3c2b2b95a2e3b15e0e089ca41297056be7c12df8c4c7524fa91a4833b1f68"
     }
   }
 }

package/src/agent/tool-defs.mjs

@@ -18,7 +18,7 @@ export const TOOL_DEFS = [
     title: 'Explore',
     aiWrapped: true,
     annotations: { title: 'Explore', readOnlyHint: true, destructiveHint: false, idempotentHint: true, openWorldHint: false },
-    description: 'Read-only codebase EXPLORATION — fact-finding only: locate/map where and how things are implemented, for open-ended/unknown scope (for a known or partial identifier use code_graph; recall=memory, search=web). NOT a reviewer/auditor: explorers LOCATE and DESCRIBE code, never judge it — bug/quality/risk claims in explore output are UNVERIFIED leads; verify them (reviewer role or direct reads) before acting on or reporting them. Shape every query as a LOCATION/INVENTORY question ("where is X handled", "which files implement Y", "what does Z read/write") — NEVER a verdict question ("is X correct/missing/inconsistent?", "are there gaps/bugs?"); the judgment stays with the caller, applied to the coordinates explore returns. Query shaping (one-line, one topic per item, decompose a multi-part brief) is specified on the query parameter — follow it. Fan-out runs items in parallel; wall-clock = the slowest item. LEAD: default background:true (answer pushed via channel, avoids the 120s sync cap). BRIDGE WORKERS run it sync and SHOULD prefer it for a tree-wide enumeration or broad/unanchored exploration — ONE call offloads the whole sweep into a sub-agent instead of a long grep/code_graph storm; a bounded/known-anchor lookup stays a direct code_graph/grep call.',
+    description: 'Read-only codebase EXPLORATION — fact-finding only: locate/map where and how things are implemented, for open-ended/unknown scope (for a known or partial identifier use code_graph; recall=memory, search=web). NOT a reviewer/auditor: explorers LOCATE and DESCRIBE code, never judge it — bug/quality/risk claims in explore output are UNVERIFIED leads; verify them (reviewer role or direct reads) before acting on or reporting them. Shape every query as a LOCATION/INVENTORY question ("where is X handled", "which files implement Y", "what does Z read/write") — NEVER a verdict question ("is X correct/missing/inconsistent?", "are there gaps/bugs?"); the judgment stays with the caller, applied to the coordinates explore returns. Query shaping rules are on the query parameter — follow them. Fan-out runs items in parallel; wall-clock = the slowest item. LEAD: default background:true (answer pushed via channel, avoids the 120s sync cap). BRIDGE WORKERS run it sync and SHOULD prefer it for a tree-wide enumeration or broad/unanchored exploration — ONE call offloads the whole sweep into a sub-agent instead of a long grep/code_graph storm; a bounded/known-anchor lookup stays a direct code_graph/grep call.',
     inputSchema: {
       type: 'object',
       properties: {

package/src/channels/index.mjs

@@ -2583,7 +2583,18 @@ async function handleToolCall(name, args, signal) {
         }
       case "reload_config": {
           await reloadRuntimeConfig();
-          result = { content: [{ type: "text", text: "config reloaded \u2014 schedules, webhooks, and events re-registered" }] };
+          // Extend reload to the agent module so providers/presets/maintenance
+          // hot-reload on the same call (dynamic import: agent/index.mjs does not
+          // import channels, so this stays acyclic and tolerant of load order).
+          let agentReloadMsg = "";
+          try {
+            const { reloadAgentConfig } = await import("../agent/index.mjs");
+            await reloadAgentConfig("reload_config tool");
+            agentReloadMsg = ", agent providers/presets/maintenance";
+          } catch (err) {
+            process.stderr.write(`[reload_config] agent reload failed: ${err?.message || String(err)}\n`);
+          }
+          result = { content: [{ type: "text", text: `config reloaded — schedules, webhooks, events${agentReloadMsg} re-registered` }] };
           break;
         }
       case "inject_command": {

package/src/channels/lib/webhook.mjs

@@ -171,19 +171,37 @@ function _deliveryIndexFor(name) {
   }
   return map;
 }
+// Bound retained ids so successful ("done") deliveries cannot accumulate
+// forever in RAM or on disk. In-flight claims (received/processing) are
+// ALWAYS kept — dropping one would let a duplicate dispatch through. The
+// remaining DELIVERY_INDEX_MAX_IDS budget goes to the newest "done" rows
+// (dedup of recent retries) first, then newest terminal rows for history.
+// Older "done" rows age out; a sender re-delivering an id that stale is
+// treated as new — acceptable beyond any realistic retry window.
+function _retainedDeliveryIds(entries) {
+  const inflight = [];
+  const done = [];
+  const other = [];
+  for (const e of entries) {
+    if (e.status === "received" || e.status === "processing") inflight.push(e);
+    else if (e.status === "done") done.push(e);
+    else other.push(e);
+  }
+  const keep = new Set(inflight.map((e) => e.id));
+  const byTsDesc = (a, b) => String(b.ts || "").localeCompare(String(a.ts || ""));
+  done.sort(byTsDesc);
+  other.sort(byTsDesc);
+  for (const e of [...done, ...other]) {
+    if (keep.size >= DELIVERY_INDEX_MAX_IDS) break;
+    keep.add(e.id);
+  }
+  return keep;
+}
 function _pruneDeliveryIndexMap(byId) {
   if (byId.size <= DELIVERY_INDEX_MAX_IDS) return;
-  const rows = [...byId.entries()];
-  const blocking = rows.filter(([, e]) => _isBlockingDeliveryStatus(e.status));
-  const nonBlocking = rows.filter(([, e]) => !_isBlockingDeliveryStatus(e.status));
-  nonBlocking.sort((a, b) => String(b[1].ts || "").localeCompare(String(a[1].ts || "")));
-  const keepIds = new Set(blocking.map(([id]) => id));
-  for (const [id] of nonBlocking) {
-    if (keepIds.size >= DELIVERY_INDEX_MAX_IDS) break;
-    keepIds.add(id);
-  }
+  const keep = _retainedDeliveryIds([...byId.values()]);
   for (const id of byId.keys()) {
-    if (!keepIds.has(id)) byId.delete(id);
+    if (!keep.has(id)) byId.delete(id);
   }
 }
 function _deliveryLogLineCount(name) {
@@ -221,7 +239,10 @@ function _ingestDeliveriesFileIntoIndex(name) {
   for (const [id, row] of merged) byId.set(id, row);
   _pruneDeliveryIndexMap(byId);
   _setDeliveryLogLineCount(name, lineCount);
-  _deliveryKeptCountByEndpoint.set(name, merged.size);
+  // Track the RETAINED (post-prune) distinct count, not the raw file count:
+  // a pre-existing oversized log then trips the compaction trigger promptly
+  // instead of inflating the threshold until it grows even larger.
+  _deliveryKeptCountByEndpoint.set(name, byId.size);
 }
 function _ensureDeliveryIndex(name) {
   if (_deliveryIndexWarmed.has(name)) return;
@@ -245,14 +266,10 @@ function _compactDeliveriesLogIfNeeded(name) {
   if (_deliveryLogLineCount(name) <= threshold) return;
   const { byId: merged } = _readDeliveriesFileMerged(name);
   const rows = [...merged.values()];
-  const blocking = rows.filter((e) => _isBlockingDeliveryStatus(e.status));
-  const nonBlocking = rows.filter((e) => !_isBlockingDeliveryStatus(e.status));
-  nonBlocking.sort((a, b) => String(b.ts || "").localeCompare(String(a.ts || "")));
+  const keepIds = _retainedDeliveryIds(rows);
   const keep = new Map();
-  for (const e of blocking) keep.set(e.id, e);
-  for (const e of nonBlocking) {
-    if (keep.size >= DELIVERY_INDEX_MAX_IDS) break;
-    if (!keep.has(e.id)) keep.set(e.id, e);
+  for (const e of rows) {
+    if (keepIds.has(e.id)) keep.set(e.id, e);
   }
   const lines = [...keep.values()]
     .sort((a, b) => String(a.ts || "").localeCompare(String(b.ts || "")))

package/src/memory/index.mjs

@@ -996,6 +996,10 @@ async function _finalizeCycle2Run(result) {
 }
 
 async function checkCycles() {
+  // Poll-on-use: re-read memory config each tick so changed enabled/interval
+  // values apply without a restart (mirrors search/cwd poll-on-use). The fixed
+  // 60s poll bounds latency; manual `memory` tool calls already re-read per-call.
+  mainConfig = readMainConfig();
   if (mainConfig?.enabled === false) return
 
   const cycle1Ms = parseInterval(mainConfig?.cycle1?.interval || '10m')
@@ -2827,7 +2831,7 @@ const httpServer = http.createServer(async (req, res) => {
       }
       const chosen = windows.slice(0, sets)
 
-      const preset = resolveMaintenancePreset('cycle1')
+      const preset = resolveMaintenancePreset('memory')
 
       function summariseChunks(chunks, totalEntries) {
         const usedIdx = new Set()

package/src/memory/lib/core-memory-store.mjs

@@ -167,7 +167,7 @@ async function _llmJudgeMerge(existing, incoming) {
       role: 'cycle2-agent',
       taskType: 'maintenance',
       mode: 'core-merge-judge',
-      preset: resolveMaintenancePreset('cycle2'),
+      preset: resolveMaintenancePreset('memory'),
       timeout: 30_000,
       cwd: null,
     }, prompt)

package/src/memory/lib/memory-cycle1.mjs

@@ -268,7 +268,7 @@ async function _runCycle1Impl(db, config = {}, options = {}, dataDir = null) {
   // Fallback chain handles flat config + nested cycle1 wrap shapes.
   const minBatch = Math.max(1, Number(config?.min_batch ?? config?.cycle1?.min_batch ?? CYCLE1_MIN_BATCH))
   const sessionCap = Math.max(1, Number(config?.session_cap ?? config?.cycle1?.session_cap ?? CYCLE1_SESSION_CAP))
-  const preset = options.preset || resolveMaintenancePreset('cycle1')
+  const preset = options.preset || resolveMaintenancePreset('memory')
   // Inner LLM timeout aligns to caller deadline -1s so the channel side can ack gracefully.
   const callerDeadlineMs = Number(options.callerDeadlineMs ?? 0)
   const baseTimeout = Number(config?.timeout ?? config?.cycle1?.timeout ?? 180000)

package/src/memory/lib/memory-cycle2.mjs

@@ -640,7 +640,7 @@ export async function runUnifiedGate(db, rows, activeContext, config = {}, optio
     .replace('{{ACTIVE_COUNT}}', String(activeCount))
     .replace('{{ACTIVE_CAP}}', String(activeCap))
 
-  const preset = options.preset || resolveMaintenancePreset('cycle2')
+  const preset = options.preset || resolveMaintenancePreset('memory')
   const timeout = Number(config?.cycle2?.timeout ?? 600000)
   const mode = 'cycle2-unified'
 

package/src/memory/lib/memory-cycle3.mjs

@@ -318,7 +318,7 @@ async function _runCycle3Impl(db, config, dataDir, options = {}) {
     .replace('{{CORE_REVIEW}}', coreReview)
     .replace('{{CURRENT_RULES}}', rulesDigest)
 
-  const preset = resolveMaintenancePreset('cycle3')
+  const preset = resolveMaintenancePreset('memory')
   const timeout = Number(config?.cycle3?.timeout ?? 600000)
   const mode = 'cycle3-review'
 

package/tools.json

@@ -697,7 +697,7 @@
       "idempotentHint": true,
       "openWorldHint": false
     },
-    "description": "Read-only codebase EXPLORATION — fact-finding only: locate/map where and how things are implemented, for open-ended/unknown scope (for a known or partial identifier use code_graph; recall=memory, search=web). NOT a reviewer/auditor: explorers LOCATE and DESCRIBE code, never judge it — bug/quality/risk claims in explore output are UNVERIFIED leads; verify them (reviewer role or direct reads) before acting on or reporting them. Shape every query as a LOCATION/INVENTORY question (\"where is X handled\", \"which files implement Y\", \"what does Z read/write\") — NEVER a verdict question (\"is X correct/missing/inconsistent?\", \"are there gaps/bugs?\"); the judgment stays with the caller, applied to the coordinates explore returns. Query shaping (one-line, one topic per item, decompose a multi-part brief) is specified on the query parameter — follow it. Fan-out runs items in parallel; wall-clock = the slowest item. LEAD: default background:true (answer pushed via channel, avoids the 120s sync cap). BRIDGE WORKERS run it sync and SHOULD prefer it for a tree-wide enumeration or broad/unanchored exploration — ONE call offloads the whole sweep into a sub-agent instead of a long grep/code_graph storm; a bounded/known-anchor lookup stays a direct code_graph/grep call.",
+    "description": "Read-only codebase EXPLORATION — fact-finding only: locate/map where and how things are implemented, for open-ended/unknown scope (for a known or partial identifier use code_graph; recall=memory, search=web). NOT a reviewer/auditor: explorers LOCATE and DESCRIBE code, never judge it — bug/quality/risk claims in explore output are UNVERIFIED leads; verify them (reviewer role or direct reads) before acting on or reporting them. Shape every query as a LOCATION/INVENTORY question (\"where is X handled\", \"which files implement Y\", \"what does Z read/write\") — NEVER a verdict question (\"is X correct/missing/inconsistent?\", \"are there gaps/bugs?\"); the judgment stays with the caller, applied to the coordinates explore returns. Query shaping rules are on the query parameter — follow them. Fan-out runs items in parallel; wall-clock = the slowest item. LEAD: default background:true (answer pushed via channel, avoids the 120s sync cap). BRIDGE WORKERS run it sync and SHOULD prefer it for a tree-wide enumeration or broad/unanchored exploration — ONE call offloads the whole sweep into a sub-agent instead of a long grep/code_graph storm; a bounded/known-anchor lookup stays a direct code_graph/grep call.",
     "inputSchema": {
       "type": "object",
       "properties": {
@@ -1459,7 +1459,7 @@
       "openWorldHint": true,
       "compressible": true
     },
-    "description": "Shell for git/build/test/run. Use current-OS syntax: Windows default = PowerShell; POSIX default = /bin/sh. Always pass shell matching your syntax: 'bash' = POSIX via Git Bash, 'powershell' = PS cmdlets; omitting uses the OS default and mis-parses the other. run_in_background works for both shells, including Windows shell:'bash' (Git Bash). Single shell entry point; not for inline code you were asked to return.",
+    "description": "Shell for git/build/test/run. ALWAYS set `shell` explicitly ('bash' = POSIX via Git Bash, 'powershell' = PS cmdlets); omitting defaults to the OS shell (Windows = PowerShell, POSIX = /bin/sh) and mis-parses the other syntax. run_in_background works for both shells, including Windows shell:'bash' (Git Bash). Single shell entry point; not for inline code you were asked to return.",
     "inputSchema": {
       "type": "object",
       "properties": {