@nxuss/lemma 1.9.1 → 1.10.0

package/dist/cjs/mcp/tools.js

@@ -80,7 +80,12 @@ const TokenReceipt_1 = require("../utils/TokenReceipt");
 const CommandOutputDistiller_1 = require("../utils/CommandOutputDistiller");
 const PatchMatcher_1 = require("../utils/PatchMatcher");
 const WorkspaceSearch_1 = require("../utils/WorkspaceSearch");
+const LocalPrefilter_1 = require("../utils/LocalPrefilter");
 const ReadWorkspaceCache_1 = require("../utils/ReadWorkspaceCache");
+const OutputDelta_1 = require("../utils/OutputDelta");
+const OutputLedger_1 = require("../utils/OutputLedger");
+const DepGraph_1 = require("../utils/DepGraph");
+const AffectedTests_1 = require("../utils/AffectedTests");
 const LineNumberMap_1 = require("../utils/LineNumberMap");
 const FileOutline_1 = require("../utils/FileOutline");
 const SearchCache_1 = require("../utils/SearchCache");
@@ -180,6 +185,30 @@ const toolDefinitions = [
                     description: "Symbols (not whole files) this answer depends on. Freshness is then judged by that symbol's own source, so edits elsewhere in the same file don't stale this memory out.",
                 },
                 outcome: { type: "string", enum: ["confirmed", "failed"], description: "Default 'confirmed' (a verified working solution). Set 'failed' to record a dead end — an approach ruled out, not one to recommend." },
+                claims: {
+                    type: "array",
+                    items: {
+                        type: "object",
+                        properties: {
+                            text: { type: "string", description: "One sub-statement from `response`, verifiable on its own (e.g. one sentence about one function)." },
+                            filePaths: { type: "array", items: { type: "string" }, description: "Paths this specific claim depends on." },
+                            symbols: {
+                                type: "array",
+                                items: {
+                                    type: "object",
+                                    properties: {
+                                        filePath: { type: "string" },
+                                        symbolName: { type: "string" },
+                                    },
+                                    required: ["filePath", "symbolName"],
+                                },
+                                description: "Symbols this specific claim depends on.",
+                            },
+                        },
+                        required: ["text"],
+                    },
+                    description: "Split `response` into independently-verifiable sub-claims when it makes more than one assertion about different parts of the code. Each claim tracks its own filePaths/symbols, so one claim going stale (e.g. one function changed) doesn't discard the others that are still true. Skip this for a single-fact response — plain filePaths/symbols above already covers that case.",
+                },
             },
             required: ["query", "response"],
         },
@@ -208,7 +237,7 @@ const toolDefinitions = [
     },
     {
         name: "read_workspace_file",
-        description: "Read a file inside the workspace. Compresses comments/whitespace and scrubs API keys. Every line carries its REAL line number in the original file (compression removes lines, it never renumbers them), so you can cite file:line and patch precisely without re-reading. The header lists which imports were compressed away. Use offset/limit to read a line range of a large file. If this exact view was already read this session and hasn't changed on disk, returns an UNCHANGED marker plus a symbol outline — reuse your copy, or pass force:true if it's no longer in your context.",
+        description: "Read a file inside the workspace. Compresses comments/whitespace and scrubs API keys. Every line carries its REAL line number in the original file (compression removes lines, it never renumbers them), so you can cite file:line and patch precisely without re-reading. The header lists which imports were compressed away. Use offset/limit to read a line range of a large file. If this exact view was already read this session and hasn't changed on disk, returns an UNCHANGED marker plus a symbol outline. If it changed only slightly, returns a CHANGED marker with a unified diff to apply to the copy you already hold. Either way, pass force:true to get the full file when it is no longer in your context.",
         inputSchema: {
             type: "object",
             properties: {
@@ -750,6 +779,17 @@ const toolDefinitions = [
             required: ["filePath"],
         },
     },
+    {
+        name: "affected_tests",
+        description: "Given the current diff (or an explicit file list), returns only the test files that transitively import the changed code, plus the exact command to run just those. Uses the TypeScript import graph — zero LLM calls. Run this instead of the full suite after an edit: fewer minutes, and far less test output in context. Reports honestly when the full suite is the right answer (unbounded change, runtime-only coupling, most of the suite affected).",
+        inputSchema: {
+            type: "object",
+            properties: {
+                files: { type: "array", items: { type: "string" }, description: "Explicit changed files, relative to workspace root. Omit to read the diff from git (working tree + untracked)." },
+                baseRef: { type: "string", description: "Additional git ref to diff against, e.g. 'main'. The working tree is always included." },
+            },
+        },
+    },
     {
         name: "refactor",
         description: "Declarative multi-file codemod engine. Rename symbols across the entire workspace or move files updating all imports. Uses TypeScript Compiler API — zero LLM calls. Supports dry-run diff preview and post-refactor tsc verification.",
@@ -1182,6 +1222,7 @@ const toolHandlers = {
     pr_status: handlePRStatus,
     generate_pr_workflow: handleGeneratePRWorkflow,
     depgraph: handleDepgraph,
+    affected_tests: handleAffectedTests,
     refactor: handleRefactor,
     smart_file_slice: handleSmartFileSlice,
     test_oracle: handleTestOracle,
@@ -1391,7 +1432,16 @@ async function handleSearchMemory(args) {
         }
         const fresh = results.filter((r) => r.fresh);
         const stale = results.filter((r) => !r.fresh);
-        const formatResult = (r, i) => `Result ${i + 1} (Similarity: ${(r.similarity * 100).toFixed(1)}%)${r.outcome === "failed" ? "\n⚠️ TAGGED AS A FAILED ATTEMPT — this was tried before and did NOT work. Do not repeat it; treat this as a warning, not a suggestion." : ""}\nPrompt: ${r.query.substring(0, 300)}...\nResponse: ${typeof r.response === "string" ? r.response : JSON.stringify(r.response, null, 2)}`;
+        const formatClaims = (r) => {
+            if (!Array.isArray(r.claims) || r.claims.length === 0)
+                return "";
+            const lines = r.claims.map((c) => c.fresh
+                ? `  ✓ fresh: ${c.text}`
+                : `  ✗ STALE (${(c.staleFiles || []).join(", ")}): ${c.text}`);
+            const staleCount = r.claims.filter((c) => !c.fresh).length;
+            return `\nClaims (${r.claims.length - staleCount}/${r.claims.length} still fresh — trust only the ✓ ones):\n${lines.join("\n")}`;
+        };
+        const formatResult = (r, i) => `Result ${i + 1} (Similarity: ${(r.similarity * 100).toFixed(1)}%)${r.outcome === "failed" ? "\n⚠️ TAGGED AS A FAILED ATTEMPT — this was tried before and did NOT work. Do not repeat it; treat this as a warning, not a suggestion." : ""}\nPrompt: ${r.query.substring(0, 300)}...\nResponse: ${typeof r.response === "string" ? r.response : JSON.stringify(r.response, null, 2)}${formatClaims(r)}`;
         if (fresh.length > 0) {
             // Only a fresh hit (or an untracked, purely conceptual entry) counts as a real
             // avoided re-investigation — this is the only case worth crediting as savings.
@@ -1436,11 +1486,14 @@ async function handleStoreMemory(args) {
     const symbols = Array.isArray(args?.symbols)
         ? args.symbols.filter((s) => s?.filePath && s?.symbolName)
         : undefined;
+    const claims = Array.isArray(args?.claims)
+        ? args.claims.filter((c) => c?.text)
+        : undefined;
     if (!query || !responseText)
         throw new Error("Query and response are required");
     try {
         const brain = (0, TheBrainV2_1.getBrain)();
-        const storeRes = brain.store(query, responseText, provider, 0.92, filePaths, undefined, outcome, symbols);
+        const storeRes = brain.store(query, responseText, provider, 0.92, filePaths, undefined, outcome, symbols, claims);
         // Storing a memory saves nothing — it only creates the chance of a saving later.
         // Crediting tokens here inflated the ledger on write and then credited the same
         // answer again on every read. The saving is booked by search_memory on a fresh hit.
@@ -1452,7 +1505,8 @@ async function handleStoreMemory(args) {
         const trackingNote = filePaths && filePaths.length > 0 ? ` Tracking freshness against ${filePaths.length} file(s) — this memory auto-invalidates if they change.` : "";
         const symbolNote = symbols && symbols.length > 0 ? ` Tracking freshness against ${symbols.length} symbol(s) specifically — unrelated edits elsewhere in those files won't stale this out.` : "";
         const outcomeNote = outcome === "failed" ? " Tagged as a FAILED attempt — future searches will surface it as a warning, not a suggestion." : "";
-        return { content: [{ type: "text", text: `Success: Memory stored. ${storeRes.reason}${trackingNote}${symbolNote}${outcomeNote}` }] };
+        const claimsNote = claims && claims.length > 0 ? ` Split into ${claims.length} independently-verifiable claim(s) — a future search can trust the ones still fresh even if another goes stale.` : "";
+        return { content: [{ type: "text", text: `Success: Memory stored. ${storeRes.reason}${trackingNote}${symbolNote}${outcomeNote}${claimsNote}` }] };
     }
     catch (e) {
         (0, utils_1.logError)("store_memory", e);
@@ -1582,7 +1636,42 @@ async function handleReadWorkspaceFile(args) {
         }
         if (numbers)
             content = (0, LineNumberMap_1.withLineNumbers)(content, numbers);
-        (0, ReadWorkspaceCache_1.recordSent)(resolved, view, dedup.hash);
+        // The file changed, but usually only slightly — the common case in an edit loop is a
+        // few lines moving in a file the model already holds in full. Re-sending everything
+        // charges for the whole file (and keeps charging, since tool results stay in the
+        // transcript). A diff against the exact text we last emitted covers the same ground
+        // for a fraction of the tokens; `shouldEmitDelta` declines whenever it wouldn't.
+        if (!force) {
+            const previousEmitted = (0, ReadWorkspaceCache_1.getLastEmitted)(resolved, view);
+            if (previousEmitted !== null) {
+                const delta = (0, OutputDelta_1.shouldEmitDelta)(previousEmitted, content);
+                if (delta.emit) {
+                    (0, reportSavings_1.reportSavings)({
+                        source: "contextSqueeze",
+                        charsBefore: content.length,
+                        charsAfter: delta.body.length,
+                        toolName: "read_workspace_file",
+                        filePath,
+                    });
+                    (0, ReadWorkspaceCache_1.recordSent)(resolved, view, dedup.hash, content);
+                    return {
+                        content: [
+                            {
+                                type: "text",
+                                text: [
+                                    `CHANGED: ${filePath} — ${delta.hunkCount} hunk(s), +${delta.added}/-${delta.removed} since you last read it.`,
+                                    `Apply this diff to the copy you already have. Line numbers are real positions in the file on disk.`,
+                                    `If you no longer hold that copy, re-fetch with force:true.`,
+                                    ``,
+                                    delta.body,
+                                ].join("\n"),
+                            },
+                        ],
+                    };
+                }
+            }
+        }
+        (0, ReadWorkspaceCache_1.recordSent)(resolved, view, dedup.hash, content);
         return { content: [{ type: "text", text: rangeHeader + content }] };
     }
     catch (err) {
@@ -1801,9 +1890,35 @@ async function handleRunWorkspaceCommand(args) {
                 handle: distilled.handle,
             });
         }
+        // A debug loop runs the same command repeatedly and the output barely moves between
+        // runs. The header is part of the compared text on purpose: a pass/fail flip must never
+        // be reported as "identical", even in the rare case where the body alone matches.
+        // The footer is deliberately excluded and always re-appended — it carries this run's
+        // `output_region` handle, which is different every time and must stay usable.
+        const body = `${header}\n\nOutput:\n${distilled.text}`;
+        const footer = (0, CommandOutputDistiller_1.buildDistillFooter)(distilled);
+        const key = (0, OutputLedger_1.ledgerKey)("run_workspace_command", { command, cwd: workspaceRoot, raw: args?.raw === true });
+        const ledger = (0, OutputLedger_1.checkOutput)(key, body, {
+            label: `\`${command}\``,
+            rerunHint: "The command did run again — this reports its result, it does not skip execution.",
+        });
+        (0, OutputLedger_1.recordOutput)(key, body);
+        if (ledger.replacement) {
+            (0, reportSavings_1.reportSavings)({
+                source: "contextSqueeze",
+                charsBefore: body.length,
+                charsAfter: ledger.replacement.length,
+                toolName: "run_workspace_command",
+            });
+            (0, TokenReceipt_1.recordReceiptEvent)("tool_call", `run_workspace_command ${ledger.status} vs. earlier run`, {
+                command,
+                savedChars: ledger.savedChars,
+            });
+            return { content: [{ type: "text", text: ledger.replacement + footer }] };
+        }
         return {
             content: [
-                { type: "text", text: `${header}\n\nOutput:\n${distilled.text}${(0, CommandOutputDistiller_1.buildDistillFooter)(distilled)}` },
+                { type: "text", text: body + footer },
             ],
         };
     }
@@ -1894,6 +2009,67 @@ async function handleListWorkspaceDir(args) {
         return { content: [{ type: "text", text: `Error listing directory: ${err.message}` }] };
     }
 }
+/** Files shown after a successful local ranking; the rest are named, not silently dropped. */
+const PREFILTER_FILES_SHOWN = 12;
+/**
+ * Rank matching files with the local model and show only the top ones.
+ *
+ * Ranking happens per file, not per match: the model is choosing which files are worth
+ * reading, and ranking 200 individual lines would ask it a question it cannot answer as
+ * well. On any failure — disabled, no Ollama, unparseable reply — this returns the input
+ * untouched, which is the behaviour with the feature off.
+ */
+async function prefilterSearchMatches(query, matches) {
+    const byFile = new Map();
+    for (const m of matches) {
+        const list = byFile.get(m.filePath);
+        if (list)
+            list.push(m);
+        else
+            byFile.set(m.filePath, [m]);
+    }
+    const totalFiles = byFile.size;
+    const untouched = { matches, totalFiles, note: "", applied: false };
+    if (totalFiles <= PREFILTER_FILES_SHOWN)
+        return untouched;
+    try {
+        const candidates = [...byFile.entries()].map(([filePath, fileMatches]) => ({
+            id: filePath,
+            summary: `${filePath} (${fileMatches.length} match${fileMatches.length === 1 ? "" : "es"}): ${fileMatches[0].text.trim().slice(0, 120)}`,
+        }));
+        const ranked = await (0, LocalPrefilter_1.rankCandidates)(query, candidates);
+        if (!ranked)
+            return untouched;
+        const shown = ranked.order.slice(0, PREFILTER_FILES_SHOWN);
+        const withheld = ranked.order.slice(PREFILTER_FILES_SHOWN);
+        if (withheld.length === 0)
+            return untouched;
+        const shownSet = new Set(shown);
+        const kept = matches.filter((m) => shownSet.has(m.filePath));
+        const note = [
+            ``,
+            `── ${withheld.length} more file(s) matched but were ranked lower by a local model (${ranked.model}) running on this machine:`,
+            ...withheld.slice(0, 25).map((f) => `   ${f}`),
+            ...(withheld.length > 25 ? [`   … and ${withheld.length - 25} more`] : []),
+            `This ranking is a local model's judgement, not a filter on relevance — if what you need`,
+            `is not above, re-run this search with maxResults raised or a narrower query to see the`,
+            `full results, or read one of the files listed here directly.`,
+        ].join("\n");
+        (0, reportSavings_1.reportSavings)({
+            source: "contextSqueeze",
+            charsBefore: matches.reduce((n, m) => n + m.text.length, 0),
+            charsAfter: kept.reduce((n, m) => n + m.text.length, 0),
+            toolName: "search_workspace",
+            query: query.substring(0, 100),
+        });
+        return { matches: kept, totalFiles, note, applied: true };
+    }
+    catch (err) {
+        // The prefilter is an optimization. It must never be the reason a search returns less.
+        (0, utils_1.logWarn)("search_workspace", "local prefilter failed, returning unranked results");
+        return untouched;
+    }
+}
 async function handleSearchWorkspace(args) {
     const query = args?.query;
     const extension = args?.extension;
@@ -1904,29 +2080,62 @@ async function handleSearchWorkspace(args) {
     try {
         const extensions = (0, WorkspaceSearch_1.parseExtensionFilter)(extension);
         const cached = (0, SearchCache_1.getCachedSearch)(workspaceRoot, query, extensions, maxResults);
+        // `SearchCache` spares the filesystem walk, but it still hands back the full result
+        // text — and re-emitting an identical wall of matches costs exactly as many tokens as
+        // producing it did. The ledger below is what turns that into a saving, so both the
+        // cached and freshly-computed paths converge on one `resultText` first.
+        let resultText;
         if (cached.text !== null) {
             (0, reportSavings_1.reportSavings)({ source: "cache", tokens: Math.floor(cached.text.length / 4), toolName: "search_workspace", query: query.substring(0, 100) });
-            return { content: [{ type: "text", text: cached.text }] };
-        }
-        const { matches, truncated } = (0, WorkspaceSearch_1.searchWorkspace)(workspaceRoot, query, extensions, maxResults);
-        if (matches.length === 0) {
-            const emptyText = `No matches found in the workspace for "${query}".`;
-            (0, SearchCache_1.setCachedSearch)(query, extensions, maxResults, cached.fingerprint, emptyText);
-            return { content: [{ type: "text", text: emptyText }] };
+            resultText = cached.text;
         }
-        const grouped = (0, WorkspaceSearch_1.groupSearchResults)(matches, truncated, undefined, workspaceRoot);
-        let formatted = grouped.formatted;
-        try {
-            const scrubber = new SemanticScrubber_1.SemanticScrubber();
-            const { maskedPrompt } = scrubber.mask(formatted);
-            formatted = maskedPrompt;
+        else {
+            const { matches, truncated } = (0, WorkspaceSearch_1.searchWorkspace)(workspaceRoot, query, extensions, maxResults);
+            if (matches.length === 0) {
+                resultText = `No matches found in the workspace for "${query}".`;
+                (0, SearchCache_1.setCachedSearch)(query, extensions, maxResults, cached.fingerprint, resultText);
+            }
+            else {
+                // Opt-in: a local model ranks the matching files so the expensive model only reads
+                // the ones likely to matter. It only ever reorders and truncates with disclosure —
+                // and returns null on any doubt, in which case `matches` is used untouched.
+                const prefilter = await prefilterSearchMatches(query, matches);
+                const grouped = (0, WorkspaceSearch_1.groupSearchResults)(prefilter.matches, truncated, undefined, workspaceRoot);
+                let formatted = grouped.formatted + prefilter.note;
+                try {
+                    const scrubber = new SemanticScrubber_1.SemanticScrubber();
+                    const { maskedPrompt } = scrubber.mask(formatted);
+                    formatted = maskedPrompt;
+                }
+                catch (err) {
+                    (0, utils_1.logWarn)("search_workspace", "SemanticScrubber failed, returning raw results");
+                }
+                const truncationNote = grouped.truncated ? ` (truncated at ${maxResults} matches — narrow your query or extension filter for the rest)` : "";
+                // The header reports what the search actually found, not what survived the
+                // prefilter — otherwise a ranked-down file would vanish from the count as well as
+                // from the list, and nothing would tell the reader it ever existed.
+                resultText = `Found ${matches.length} matches across ${prefilter.totalFiles} files${truncationNote}:\n\n${formatted}`;
+                // A ranked-down result is never cached: it would then be replayed to a later call
+                // whose local model was unavailable, silently serving a subset as if it were the
+                // whole search. Repeats are handled by the output ledger below instead.
+                if (!prefilter.applied) {
+                    (0, SearchCache_1.setCachedSearch)(query, extensions, maxResults, cached.fingerprint, resultText);
+                }
+            }
         }
-        catch (err) {
-            (0, utils_1.logWarn)("search_workspace", "SemanticScrubber failed, returning raw results");
+        const key = (0, OutputLedger_1.ledgerKey)("search_workspace", { query, extension: extension ?? null, maxResults, cwd: workspaceRoot });
+        const ledger = (0, OutputLedger_1.checkOutput)(key, resultText, { label: `search for "${query}"` });
+        (0, OutputLedger_1.recordOutput)(key, resultText);
+        if (ledger.replacement) {
+            (0, reportSavings_1.reportSavings)({
+                source: "contextSqueeze",
+                charsBefore: resultText.length,
+                charsAfter: ledger.replacement.length,
+                toolName: "search_workspace",
+                query: query.substring(0, 100),
+            });
+            return { content: [{ type: "text", text: ledger.replacement }] };
         }
-        const truncationNote = grouped.truncated ? ` (truncated at ${maxResults} matches — narrow your query or extension filter for the rest)` : "";
-        const resultText = `Found ${grouped.totalMatches} matches across ${grouped.filesMatched} files${truncationNote}:\n\n${formatted}`;
-        (0, SearchCache_1.setCachedSearch)(query, extensions, maxResults, cached.fingerprint, resultText);
         return {
             content: [
                 {
@@ -3812,113 +4021,9 @@ function generateAzurePipelineYaml(threshold) {
         `      AZURE_DEVOPS_TOKEN: \$(AZURE_DEVOPS_TOKEN)`,
     ].join("\n");
 }
-function buildDepGraphMap(workspaceRoot) {
-    const map = new Map();
-    const IGNORE_DG = new Set(["node_modules", ".git", "dist", "chroma_data", ".lemma", "build", "coverage", ".next"]);
-    function walkDG(dir) {
-        let entries = [];
-        try {
-            entries = fs_1.default.readdirSync(dir, { withFileTypes: true });
-        }
-        catch {
-            return;
-        }
-        for (const e of entries) {
-            if (IGNORE_DG.has(e.name))
-                continue;
-            const abs = path_1.default.join(dir, e.name);
-            if (e.isDirectory()) {
-                walkDG(abs);
-            }
-            else if (/\.(ts|tsx|js|jsx)$/.test(e.name) && !e.name.endsWith(".d.ts")) {
-                const rel = path_1.default.relative(workspaceRoot, abs).replace(/\\/g, "/");
-                map.set(rel, { rel, abs, imports: [], importedBy: [], externalImports: [], exports: [] });
-            }
-        }
-    }
-    walkDG(workspaceRoot);
-    for (const [, node] of map) {
-        try {
-            const src = fs_1.default.readFileSync(node.abs, "utf8");
-            const sf = ts.createSourceFile(node.abs, src, ts.ScriptTarget.Latest, true);
-            ts.forEachChild(sf, (n) => {
-                if (ts.isImportDeclaration(n) && ts.isStringLiteral(n.moduleSpecifier)) {
-                    const spec = n.moduleSpecifier.text;
-                    if (spec.startsWith(".")) {
-                        const dir = path_1.default.dirname(node.abs);
-                        let resolved = path_1.default.resolve(dir, spec);
-                        for (const ext of [".ts", ".tsx", ".js", ".jsx", "/index.ts", "/index.tsx", "/index.js"]) {
-                            if (fs_1.default.existsSync(resolved + ext)) {
-                                resolved += ext;
-                                break;
-                            }
-                        }
-                        const rel = path_1.default.relative(workspaceRoot, resolved).replace(/\\/g, "/");
-                        if (!node.imports.includes(rel))
-                            node.imports.push(rel);
-                    }
-                    else {
-                        const pkg = spec.split("/")[0];
-                        if (!node.externalImports.includes(pkg))
-                            node.externalImports.push(pkg);
-                    }
-                }
-                const hasExportMod = (nd) => ts.canHaveModifiers(nd) &&
-                    (ts.getModifiers(nd) ?? []).some((m) => m.kind === ts.SyntaxKind.ExportKeyword);
-                if (hasExportMod(n)) {
-                    if (ts.isFunctionDeclaration(n) && n.name)
-                        node.exports.push(n.name.text);
-                    else if (ts.isClassDeclaration(n) && n.name)
-                        node.exports.push(n.name.text);
-                    else if (ts.isVariableStatement(n)) {
-                        for (const decl of n.declarationList.declarations) {
-                            if (ts.isIdentifier(decl.name))
-                                node.exports.push(decl.name.text);
-                        }
-                    }
-                    else if (ts.isInterfaceDeclaration(n))
-                        node.exports.push(n.name.text);
-                    else if (ts.isTypeAliasDeclaration(n))
-                        node.exports.push(n.name.text);
-                    else if (ts.isEnumDeclaration(n))
-                        node.exports.push(n.name.text);
-                }
-                if (ts.isExportDeclaration(n) && n.exportClause && ts.isNamedExports(n.exportClause)) {
-                    for (const el of n.exportClause.elements)
-                        node.exports.push(el.name.text);
-                }
-            });
-        }
-        catch { /* skip unparseable */ }
-    }
-    for (const [, node] of map) {
-        for (const imp of node.imports) {
-            const target = map.get(imp);
-            if (target && !target.importedBy.includes(node.rel))
-                target.importedBy.push(node.rel);
-        }
-    }
-    return map;
-}
-function bfsDepGraph(map, startRel, direction, maxDepth) {
-    const visited = new Map();
-    const queue = [{ rel: startRel, depth: 0 }];
-    while (queue.length > 0) {
-        const item = queue.shift();
-        if (visited.has(item.rel) || item.depth > maxDepth)
-            continue;
-        const node = map.get(item.rel);
-        if (!node)
-            continue;
-        visited.set(item.rel, { node, depth: item.depth });
-        if (item.depth < maxDepth) {
-            const neighbors = direction === "forward" ? node.imports : node.importedBy;
-            for (const n of neighbors)
-                queue.push({ rel: n, depth: item.depth + 1 });
-        }
-    }
-    return visited;
-}
+// ═══════════════════════════════════════════════════════════════════════════════
+// ─── depgraph ─────────────────────────────────────────────────────────────────
+// ═══════════════════════════════════════════════════════════════════════════════
 function detectDepCycles(map, subset) {
     const cycles = [];
     const visited = new Set();
@@ -4091,13 +4196,13 @@ async function handleDepgraph(args) {
     try {
         const { resolved } = (0, utils_1.safeResolvePath)(workspaceRoot, filePath);
         const relTarget = path_1.default.relative(workspaceRoot, resolved).replace(/\\/g, "/");
-        const map = buildDepGraphMap(workspaceRoot);
+        const map = (0, DepGraph_1.buildDepGraphMap)(workspaceRoot);
         const targetNode = map.get(relTarget);
         if (!targetNode) {
             return { content: [{ type: "text", text: `File not found in workspace graph: ${relTarget}\nCheck path is correct and has .ts/.tsx/.js/.jsx extension.` }] };
         }
-        const forwardVisited = bfsDepGraph(map, relTarget, "forward", depth);
-        const backwardVisited = showReverse ? bfsDepGraph(map, relTarget, "backward", depth) : new Map();
+        const forwardVisited = (0, DepGraph_1.bfsDepGraph)(map, relTarget, "forward", depth);
+        const backwardVisited = showReverse ? (0, DepGraph_1.bfsDepGraph)(map, relTarget, "backward", depth) : new Map();
         const allRelInScope = new Set([...forwardVisited.keys(), ...(showReverse ? backwardVisited.keys() : [])]);
         const cycles = detectCircular ? detectDepCycles(map, allRelInScope) : [];
         let output;
@@ -4123,13 +4228,46 @@ async function handleDepgraph(args) {
             output = formatDGText(targetNode, forwardVisited, backwardVisited, cycles, includeExternal, showReverse);
         }
         const stats = `\n\n📊 Stats: ${forwardVisited.size} nodos forward, ${backwardVisited.size} nodos reverse, depth=${depth}`;
-        return { content: [{ type: "text", text: output + (format === "json" ? "" : stats) }] };
+        const finalText = output + (format === "json" ? "" : stats);
+        const key = (0, OutputLedger_1.ledgerKey)("depgraph", { file: relTarget, depth, format, showReverse, includeExternal, detectCircular, cwd: workspaceRoot });
+        const ledger = (0, OutputLedger_1.checkOutput)(key, finalText, { label: `depgraph for ${relTarget}` });
+        (0, OutputLedger_1.recordOutput)(key, finalText);
+        if (ledger.replacement) {
+            (0, reportSavings_1.reportSavings)({ source: "contextSqueeze", charsBefore: finalText.length, charsAfter: ledger.replacement.length, toolName: "depgraph", filePath: relTarget });
+            return { content: [{ type: "text", text: ledger.replacement }] };
+        }
+        return { content: [{ type: "text", text: finalText }] };
     }
     catch (err) {
         (0, utils_1.logError)("depgraph", err);
         return { content: [{ type: "text", text: `depgraph failed: ${err.message}` }] };
     }
 }
+async function handleAffectedTests(args) {
+    const workspaceRoot = process.cwd();
+    try {
+        const files = Array.isArray(args?.files) ? args.files.filter((f) => typeof f === "string") : undefined;
+        const result = (0, AffectedTests_1.findAffectedTests)({ workspaceRoot, files, baseRef: args?.baseRef });
+        const text = (0, AffectedTests_1.formatAffectedTests)(result);
+        // Worth recording even when it narrows nothing: the receipt is the record of what this
+        // tool actually did, and "recommended the full suite" is as much a result as a subset.
+        (0, TokenReceipt_1.recordReceiptEvent)("tool_call", "affected_tests", {
+            changed: result.changed.length,
+            affected: result.affected.length,
+            totalTests: result.totalTests,
+            narrowed: result.command !== null,
+        });
+        return { content: [{ type: "text", text }] };
+    }
+    catch (err) {
+        (0, utils_1.logError)("affected_tests", err);
+        // Failing here must never look like "nothing is affected" — that would talk a caller
+        // out of running tests at all.
+        return {
+            content: [{ type: "text", text: `affected_tests failed: ${err.message}\nFall back to running the full suite.` }],
+        };
+    }
+}
 // ═══════════════════════════════════════════════════════════════════════════════
 // ─── refactor ─────────────────────────────────────────────────────────────────
 // ═══════════════════════════════════════════════════════════════════════════════
@@ -4627,10 +4765,13 @@ async function handleSmartFileSlice(args) {
 async function handleTestOracle(args) {
     const command = args.command || "npm test";
     const workspaceRoot = process.cwd();
-    // Run tests, check errors
+    // A failing test suite is re-run more than any other command in a session, and the
+    // failure list barely moves between runs. Both branches funnel into one `resultText` so
+    // the ledger can answer a repeat with a diff instead of the same stack traces again.
+    let resultText;
     try {
         const out = (0, child_process_1.execSync)(command, { cwd: workspaceRoot, encoding: "utf8", timeout: 30000 });
-        return { content: [{ type: "text", text: `All tests passed!\n\nOutput:\n${out.substring(0, 1000)}` }] };
+        resultText = `All tests passed!\n\nOutput:\n${out.substring(0, 1000)}`;
     }
     catch (e) {
         const stdout = e.stdout || "";
@@ -4640,8 +4781,19 @@ async function handleTestOracle(args) {
             .split("\n")
             .filter((l) => l.includes("fail") || l.includes("Error") || l.includes("at ") || l.includes("✗") || l.includes("Stack"));
         const summary = failureLines.slice(0, 80).join("\n") || `Test execution failed:\n${stdout.substring(0, 800)}\n${stderr.substring(0, 800)}`;
-        return { content: [{ type: "text", text: `Tests Failed. Compressed failures:\n\n${summary}` }] };
+        resultText = `Tests Failed. Compressed failures:\n\n${summary}`;
+    }
+    const key = (0, OutputLedger_1.ledgerKey)("test_oracle", { command, cwd: workspaceRoot });
+    const ledger = (0, OutputLedger_1.checkOutput)(key, resultText, {
+        label: `\`${command}\``,
+        rerunHint: "The suite did run again — this reports its result, it does not skip execution.",
+    });
+    (0, OutputLedger_1.recordOutput)(key, resultText);
+    if (ledger.replacement) {
+        (0, reportSavings_1.reportSavings)({ source: "contextSqueeze", charsBefore: resultText.length, charsAfter: ledger.replacement.length, toolName: "test_oracle" });
+        return { content: [{ type: "text", text: ledger.replacement }] };
     }
+    return { content: [{ type: "text", text: resultText }] };
 }
 // ── Schema Extract ───────────────────────────────────────────────────
 async function handleSchemaExtract(args) {