@nxuss/lemma 1.11.0 → 1.14.0

package/dist/cjs/mcp/tools.js

@@ -79,6 +79,7 @@ const StateHashCache_1 = require("../utils/StateHashCache");
 const TokenReceipt_1 = require("../utils/TokenReceipt");
 const CommandOutputDistiller_1 = require("../utils/CommandOutputDistiller");
 const PatchMatcher_1 = require("../utils/PatchMatcher");
+const tasks_1 = require("./tasks");
 const WorkspaceSearch_1 = require("../utils/WorkspaceSearch");
 const LocalPrefilter_1 = require("../utils/LocalPrefilter");
 const ReadWorkspaceCache_1 = require("../utils/ReadWorkspaceCache");
@@ -110,7 +111,7 @@ function isProUser() {
 }
 const FREE_TOOLS = new Set([
     // Cache & Memory — the hook that shows instant value
-    "smarter_cache", "state_hash_cache", "token_receipt", "search_memory", "store_memory", "get_project_history",
+    "smarter_cache", "state_hash_cache", "token_receipt", "search_memory", "store_memory", "downvote_memory", "get_project_history",
     // Token optimization — shows what they're saving
     "token_budget", "squeeze_prompt", "turbosqueeze",
     // Utility — just enough to function
@@ -135,9 +136,94 @@ const PRO_GATE_MESSAGE = [
     "🚀 Get Lemma Pro:",
     "  https://lemma.nxus.studio/upgrade",
 ].join("\n");
+// ── Elicitation (spec 2026-07-28's recommended pattern for destructive actions) ────
+//
+// Set once by setupToolsHandlers so the standalone handler functions below — which don't
+// otherwise see the Server instance — can ask the connected client to confirm before a
+// mutating tool runs.
+let mcpServerRef = null;
+/**
+ * Ask the client to confirm a destructive action before it happens.
+ *
+ * Mirrors the defensive shape of trySamplingContext() in src/mcp/index.ts: most clients
+ * today don't support elicitation, so any failure (unsupported capability, timeout,
+ * malformed response) must fall back to "proceed without confirmation" rather than block
+ * or error out the tool. This is a courtesy prompt for clients that support it, not a
+ * security boundary — the allowlist/path-safety checks each handler already does are that.
+ */
+async function tryElicitConfirmation(summary) {
+    if (!mcpServerRef)
+        return { supported: false, confirmed: true };
+    try {
+        const result = await mcpServerRef.elicitInput({
+            message: summary,
+            requestedSchema: {
+                type: "object",
+                properties: {
+                    confirm: {
+                        type: "boolean",
+                        title: "Proceed?",
+                        description: "Confirm this action should be applied.",
+                    },
+                },
+                required: ["confirm"],
+            },
+        });
+        if (result.action !== "accept") {
+            // "decline" or "cancel" — the user (or client policy) said no.
+            return { supported: true, confirmed: false };
+        }
+        const confirmed = result.content?.confirm !== false;
+        return { supported: true, confirmed };
+    }
+    catch (err) {
+        (0, utils_1.logWarn)("elicitation", "Client does not support elicitation (or the request failed) — proceeding without confirmation");
+        return { supported: false, confirmed: true };
+    }
+}
+/**
+ * Ask the client to pick one of several candidates via a typed (oneOf) elicitation form,
+ * instead of the plain confirm/deny shape tryElicitConfirmation uses. Same defensive
+ * contract: no support, a decline, or a malformed response all just mean "couldn't
+ * resolve it this way" — the caller falls back to its own error/default behavior, never
+ * blocks or throws.
+ */
+async function tryElicitChoice(message, options) {
+    if (!mcpServerRef || options.length === 0)
+        return { supported: false, index: null };
+    try {
+        const result = await mcpServerRef.elicitInput({
+            message,
+            requestedSchema: {
+                type: "object",
+                properties: {
+                    choice: {
+                        type: "string",
+                        title: "Which one?",
+                        oneOf: options.map((opt, i) => ({ const: String(i), title: opt.title })),
+                    },
+                },
+                required: ["choice"],
+            },
+        });
+        if (result.action !== "accept" || !result.content) {
+            return { supported: true, index: null };
+        }
+        const idx = Number(result.content.choice);
+        if (!Number.isInteger(idx) || idx < 0 || idx >= options.length) {
+            return { supported: true, index: null };
+        }
+        return { supported: true, index: idx };
+    }
+    catch (err) {
+        (0, utils_1.logWarn)("elicitation", "Client does not support elicitation (or the request failed) — no choice made");
+        return { supported: false, index: null };
+    }
+}
 const toolDefinitions = [
     {
         name: "scrub_privacy",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Mask sensitive data (PII, API Keys, Credentials) from a text block using Lemma's Privacy Firewall.",
         inputSchema: {
             type: "object",
@@ -149,7 +235,8 @@ const toolDefinitions = [
     },
     {
         name: "search_memory",
-        description: "Search Lemma's semantic memory (The Brain) before investigating something from scratch — retrieves past solutions, fixes, and context from ALL your projects globally. Results are split into 'fresh' (safe to reuse — either untracked general knowledge, or every file it depended on still hashes the same) and 'stale' (a similar question was answered before, but a tracked file changed since — re-verify against current state before reusing). Never treat a stale result as current.",
+        annotations: { readOnlyHint: true, openWorldHint: false },
+        description: "Search Lemma's semantic memory (The Brain) before investigating something from scratch — retrieves past solutions, fixes, and context from ALL your projects globally. Results are split into 'fresh' (safe to reuse — either untracked general knowledge, or every file it depended on still hashes the same) and 'stale' (a similar question was answered before, but a tracked file changed since — re-verify against current state before reusing). Never treat a stale result as current. If a returned memory turns out wrong once acted on, call downvote_memory with its id.",
         inputSchema: {
             type: "object",
             properties: {
@@ -160,12 +247,17 @@ const toolDefinitions = [
                     description: "Similarity floor (0.0-1.0) a memory must clear to be returned. Lowering this surfaces loosely related memories that are usually noise — leave it alone unless a known-relevant memory is being filtered out.",
                     default: 0.75,
                 },
+                domain: {
+                    type: "string",
+                    description: "Prefer memories tagged with this domain (e.g. 'auth', 'billing' — matches cognitive_map domains). Soft preference, not a filter: an untagged or cross-domain memory can still be the best match.",
+                },
             },
             required: ["query"],
         },
     },
     {
         name: "store_memory",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: false, openWorldHint: false },
         description: "Persist a technical solution, bug fix, architecture decision, or key fact into Lemma's Brain — so future questions on the same topic (even phrased differently) don't require re-investigating the repo. Pass filePaths for anything derived from specific files (e.g. 'where is X implemented', 'how does Y work') so the memory auto-invalidates the moment those files change, instead of risking a stale answer being reused. If the answer is really about one function/class rather than the whole file, pass `symbols` instead (or in addition) so an unrelated edit elsewhere in that file doesn't stale it out. Pass outcome='failed' for an approach that was tried and did NOT work — that's just as worth remembering as a fix, so the Brain can warn 'already tried, didn't work' instead of only ever suggesting reuse.",
         inputSchema: {
             type: "object",
@@ -211,12 +303,29 @@ const toolDefinitions = [
                     },
                     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.",
                 },
+                domain: {
+                    type: "string",
+                    description: "Tag this memory with a domain (e.g. 'auth', 'billing' — matches cognitive_map domains) so domain-scoped searches prefer it. Optional: when omitted and filePaths is set, Lemma auto-derives a domain from the first file via cognitive_map (or a lightweight path heuristic if the map was never built).",
+                },
             },
             required: ["query", "response"],
         },
     },
+    {
+        name: "downvote_memory",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: false, openWorldHint: false },
+        description: "Tell the Brain a specific memory from a prior search_memory result was wrong or misleading in practice — not just irrelevant to skip, but actually acted on and it didn't hold up. Lowers that memory's future ranking and moves it toward eviction sooner, without deleting it (it may still be right for a different query later). Use the `id` from the search_memory result you're downvoting.",
+        inputSchema: {
+            type: "object",
+            properties: {
+                id: { type: "string", description: "The memory's id, from a prior search_memory result." },
+            },
+            required: ["id"],
+        },
+    },
     {
         name: "get_routing_advice",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Analyzes a prompt and suggests the best model based on Lemma's Complexity Router.",
         inputSchema: {
             type: "object",
@@ -226,9 +335,20 @@ const toolDefinitions = [
             },
             required: ["prompt"],
         },
+        outputSchema: {
+            type: "object",
+            properties: {
+                recommendedModel: { type: "string", description: "The model the router recommends" },
+                complexity: { type: "string", enum: ["low", "high"], description: "Estimated complexity of the prompt" },
+                intendedModel: { type: ["string", "null"], description: "The model passed in intended_model, or null if omitted" },
+                switched: { type: "boolean", description: "true if recommendedModel differs from intendedModel" },
+            },
+            required: ["recommendedModel", "complexity", "switched"],
+        },
     },
     {
         name: "auto_heal",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: false },
         description: "Diagnose and auto-heal the latest local server crash registered in Lemma's context logs.",
         inputSchema: {
             type: "object",
@@ -239,6 +359,7 @@ const toolDefinitions = [
     },
     {
         name: "read_workspace_file",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         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",
@@ -255,6 +376,7 @@ const toolDefinitions = [
     },
     {
         name: "write_workspace_file",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: true, openWorldHint: false },
         description: "Write full contents to a file inside the workspace. Creates parent directories automatically.",
         inputSchema: {
             type: "object",
@@ -267,6 +389,7 @@ const toolDefinitions = [
     },
     {
         name: "create_workspace_file",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: false, openWorldHint: false },
         description: "Create a NEW file in the workspace. Fails immediately if the file already exists — use write_workspace_file or apply_workspace_patch to modify existing files. Creates parent directories automatically. Returns a minimal token-free ACK: no file content is echoed back, saving provider output tokens.",
         inputSchema: {
             type: "object",
@@ -279,6 +402,7 @@ const toolDefinitions = [
     },
     {
         name: "apply_workspace_patch",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: false },
         description: "Apply a smart search-and-replace patch to an existing file. Falls back through whitespace-normalized, indent-anchored, and fuzzy matching if the exact block isn't found — so a searchContent built from a compacted read still applies. Safe against duplicate matches. On total failure, the error includes a diff against the closest candidate block.",
         inputSchema: {
             type: "object",
@@ -292,6 +416,8 @@ const toolDefinitions = [
     },
     {
         name: "run_workspace_command",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: true },
+        execution: { taskSupport: "optional" },
         description: "Execute a bash command in the workspace root. Default timeout 120s — raise it with timeoutMs for a full test or build run (max 600s). Captures both stdout and stderr, and returns whatever was produced even if the command times out. Long test/build/lint output is distilled deterministically — for jest, vitest and tsc it returns the failing tests or diagnostics with their locations and reasons, dropping code frames and node_modules stack frames; anything else falls back to head/tail plus error-matching lines. The complete output is always stored first and the reply carries a handle: nothing is lost, use output_region to retrieve any part verbatim. Pass raw:true to skip distillation.",
         inputSchema: {
             type: "object",
@@ -313,6 +439,7 @@ const toolDefinitions = [
     },
     {
         name: "output_region",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Retrieve any part of a command output previously stored by run_workspace_command, verbatim. This is what makes distillation lossless — use it when the distilled view isn't enough. Pass all:true for the whole output, section for one named block (a failing test title or a file path, as listed in the distilled view), or startLine/endLine for a range.",
         inputSchema: {
             type: "object",
@@ -328,6 +455,7 @@ const toolDefinitions = [
     },
     {
         name: "list_workspace_dir",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "List files and subdirectories recursively to navigate the repository structure.",
         inputSchema: {
             type: "object",
@@ -339,6 +467,7 @@ const toolDefinitions = [
     },
     {
         name: "search_workspace",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Perform a fast local text search (grep) across all files in the project workspace. Respects .gitignore, skips binaries and files over 500KB, groups results by file (capped per file), and stops at maxResults. For code files (.ts/.tsx/.js/.jsx), matches inside the same function/class/method are collapsed into one entry with its signature and line range instead of raw duplicate lines. Repeating an identical query while the workspace is unchanged returns the cached result instantly instead of re-scanning.",
         inputSchema: {
             type: "object",
@@ -352,6 +481,7 @@ const toolDefinitions = [
     },
     {
         name: "squeeze_prompt",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Compress code blocks, comments, and boilerplate in any prompt. Saves up to 80% tokens.",
         inputSchema: {
             type: "object",
@@ -364,6 +494,7 @@ const toolDefinitions = [
     },
     {
         name: "get_project_onboarding",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Fetch dynamic architectural and stack overview of the current project in markdown.",
         inputSchema: {
             type: "object",
@@ -372,6 +503,7 @@ const toolDefinitions = [
     },
     {
         name: "get_project_history",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Answers 'what have we done in this project': merges recent git commits, session checkpoints, and The Brain's memories (decisions, fixes, prior PR reviews) for the current project into one narrative. Use this instead of piecing the same picture together from search_memory + git log + reading checkpoint files separately.",
         inputSchema: {
             type: "object",
@@ -382,6 +514,7 @@ const toolDefinitions = [
     },
     {
         name: "get_ast_hologram",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Generate a dense, token-efficient Holographic AST Map of the workspace using the TypeScript compiler. Returns structured JSON of all exported symbols with file paths and line numbers.",
         inputSchema: {
             type: "object",
@@ -398,6 +531,7 @@ const toolDefinitions = [
     },
     {
         name: "validate_patch_sandbox",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Validate proposed code in isolated sandbox via tsc + syntax check before applying.",
         inputSchema: {
             type: "object",
@@ -410,6 +544,7 @@ const toolDefinitions = [
     },
     {
         name: "query_hybrid_consensus",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Search The Brain before reasoning. Brain HIT returns cached answer instantly. Brain MISS proceeds to cloud.",
         inputSchema: {
             type: "object",
@@ -423,6 +558,7 @@ const toolDefinitions = [
     },
     {
         name: "get_telepathic_hints",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Surface relevant past solutions from The Brain based on the active file path.",
         inputSchema: {
             type: "object",
@@ -435,6 +571,7 @@ const toolDefinitions = [
     },
     {
         name: "summarize_long_text",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Summarize long text locally using Ollama. Compresses verbose content into concise summaries, saving context window for subsequent turns.",
         inputSchema: {
             type: "object",
@@ -447,6 +584,7 @@ const toolDefinitions = [
     },
     {
         name: "prune_conversation_history",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Compress conversation history by decimating old turns and compacting large code blocks in historical messages. Keeps recent context intact. Refuses to mutate anything by default because pruning invalidates the prompt-cache prefix, which is usually a net loss — pass force:true to actually apply it, or call without force to just get the estimated cache-invalidation cost back.",
         inputSchema: {
             type: "object",
@@ -467,6 +605,7 @@ const toolDefinitions = [
     },
     {
         name: "diff_only",
+        annotations: { readOnlyHint: true, idempotentHint: false, openWorldHint: false },
         description: "Compute a compact line-by-line diff between the last known state of a file and its current content. Tracks file state in memory per session.",
         inputSchema: {
             type: "object",
@@ -479,6 +618,7 @@ const toolDefinitions = [
     },
     {
         name: "batch_tool_calls",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: true },
         description: "Execute multiple tools in a single MCP call. Accepts an array of { tool, args } and runs them in parallel via Promise.all. Results include per-tool success/error status.",
         inputSchema: {
             type: "object",
@@ -501,6 +641,7 @@ const toolDefinitions = [
     },
     {
         name: "turbosqueeze",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "COMPRIME prompts hasta 90%. Elimina comentarios, imports redundantes, whitespace excesivo, y compacta JSON. Usar ANTES de enviar código largo al LLM para maximizar ahorro de tokens.",
         inputSchema: {
             type: "object",
@@ -515,6 +656,7 @@ const toolDefinitions = [
     },
     {
         name: "get_symbol_surgical_context",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Extrae quirúrgicamente la implementación de un símbolo específico (clase, función, interfaz) y las firmas (pero no la implementación completa) de todas sus dependencias locales del workspace. Ahorra hasta 90% de tokens.",
         inputSchema: {
             type: "object",
@@ -527,6 +669,7 @@ const toolDefinitions = [
     },
     {
         name: "wormhole_squeeze",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Comprime código a formato WORMHOLE súper denso usando tokens de palabra clave y abreviación de variables reversible. Ideal para alimentar contextos de lectura al LLM.",
         inputSchema: {
             type: "object",
@@ -538,6 +681,7 @@ const toolDefinitions = [
     },
     {
         name: "generate_executive_roi_report",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: true, openWorldHint: false },
         description: "Genera un reporte ejecutivo en formato Markdown de Retorno de Inversión (ROI), dinero ahorrado en API, horas de desarrollo recuperadas y proyecciones de escala para la gerencia.",
         inputSchema: {
             type: "object",
@@ -550,6 +694,7 @@ const toolDefinitions = [
     },
     {
         name: "surgical_ast_insert",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: false },
         description: "Inserta quirúrgicamente código (métodos, propiedades, funciones) en una clase, interfaz o ámbito de archivo de TypeScript utilizando el AST Compiler. Evita escribir diffs de búsqueda y reemplazo grandes o reescribir todo el archivo. Ahorra 95% de tokens de salida.",
         inputSchema: {
             type: "object",
@@ -565,6 +710,7 @@ const toolDefinitions = [
     },
     {
         name: "local_semantic_autofix",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Intenta resolver errores de compilación o ejecución localmente consultando The Brain por tracebacks/mensajes similares. Si hay coincidencia, devuelve la solución/parche instantáneamente sin gastar tokens de LLM.",
         inputSchema: {
             type: "object",
@@ -576,6 +722,7 @@ const toolDefinitions = [
     },
     {
         name: "compress_context",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Comprime el historial de conversación: resume turns antiguos vía Ollama, mantiene solo los últimos N intactos. Reduce contexto 70-80%. USAR antes de cada turno extendido.",
         inputSchema: {
             type: "object",
@@ -592,6 +739,7 @@ const toolDefinitions = [
     },
     {
         name: "smarter_cache",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Cache predictivo con threshold bajo (75%). Busca en The Brain antes de cualquier razonamiento. Si hay hit >= 75%, devuelve respuesta instantánea sin gastar tokens en LLM.",
         inputSchema: {
             type: "object",
@@ -602,9 +750,25 @@ const toolDefinitions = [
             },
             required: ["query"],
         },
+        outputSchema: {
+            type: "object",
+            properties: {
+                hit: { type: "boolean", description: "true si hubo un hit por encima del threshold" },
+                source: { type: "string", enum: ["lemma-brain", "llm-call-required", "cache-unavailable"], description: "De dónde salió (o no) la respuesta" },
+                similarity: { type: "number", description: "Similitud del mejor match (0.0-1.0). Ausente en la rama de error." },
+                threshold: { type: "number", description: "Threshold usado. Ausente en la rama de error." },
+                answer: { type: ["string", "null"], description: "Respuesta cacheada si hit=true; null si no. Ausente en la rama de error." },
+                tokensSaved: { type: "number", description: "Solo presente cuando hit=true" },
+                tokensSavedFormatted: { type: "string", description: "Solo presente cuando hit=true" },
+                hint: { type: "string", description: "Sugerencia de siguiente paso; presente en miss y en error" },
+                error: { type: "string", description: "Mensaje de error; solo presente si el brain local falló" },
+            },
+            required: ["hit", "source"],
+        },
     },
     {
         name: "state_hash_cache",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: true, openWorldHint: false },
         description: "Cache de razonamiento con invalidación EXACTA (no probabilística): la respuesta queda atada al sha256 del contenido de los archivos de los que depende. Si esos archivos no cambiaron, el hit es matemáticamente válido, no una adivinanza por similitud. Usa action='lookup' antes de razonar sobre una pregunta que dependa de archivos específicos, y action='store' después de responder para cachearla.",
         inputSchema: {
             type: "object",
@@ -616,9 +780,24 @@ const toolDefinitions = [
             },
             required: ["action", "query", "filePaths"],
         },
+        outputSchema: {
+            type: "object",
+            properties: {
+                status: { type: "string", enum: ["hit", "miss", "stored"], description: "Resultado de lookup (hit/miss) o de store (stored)" },
+                answer: { type: "string", description: "Solo presente cuando status='hit'" },
+                note: { type: "string", description: "Solo presente cuando status='hit'" },
+                tokensSaved: { type: "number", description: "Solo presente cuando status='hit'" },
+                reason: { type: "string", description: "Solo presente cuando status='miss'" },
+                hint: { type: "string", description: "Solo presente cuando status='miss'" },
+                id: { type: "string", description: "Solo presente cuando status='stored'" },
+                filesTracked: { type: "array", items: { type: "string" }, description: "Solo presente cuando status='stored'" },
+            },
+            required: ["status"],
+        },
     },
     {
         name: "token_receipt",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Recibo auditable de la sesión: de dónde vino cada respuesta (cache exacto, cache semántico, lectura de archivo, o razonamiento fresco). No es una estadística de 'ahorro' — es una bitácora verificable para que el usuario pueda comprobar que no se le está mintiendo con un cache hit inventado. Llamar con action='summary' para ver el reporte.",
         inputSchema: {
             type: "object",
@@ -627,9 +806,42 @@ const toolDefinitions = [
                 limit: { type: "number", description: "Cuántos eventos recientes incluir en el detalle", default: 20 },
             },
         },
+        outputSchema: {
+            type: "object",
+            properties: {
+                totalEvents: { type: "number", description: "Total de eventos registrados en la sesión" },
+                byType: {
+                    type: "object",
+                    properties: {
+                        exact_cache_hit: { type: "number" },
+                        semantic_cache_hit: { type: "number" },
+                        file_read: { type: "number" },
+                        reasoning: { type: "number" },
+                        tool_call: { type: "number" },
+                    },
+                    description: "Conteo de eventos por tipo de origen",
+                },
+                recentEvents: {
+                    type: "array",
+                    items: {
+                        type: "object",
+                        properties: {
+                            type: { type: "string" },
+                            label: { type: "string" },
+                            timestamp: { type: "number" },
+                            meta: { type: "object" },
+                        },
+                    },
+                    description: "Últimos `limit` eventos, en orden cronológico",
+                },
+                note: { type: "string" },
+            },
+            required: ["totalEvents", "byType", "recentEvents"],
+        },
     },
     {
         name: "token_budget",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Muestra el dashboard de consumo: multiplicador actual de membresía, tokens ahorrados, tools usadas, y recomendaciones para optimizar más. Consultar periódicamente para auto-regular consumo.",
         inputSchema: {
             type: "object",
@@ -638,6 +850,7 @@ const toolDefinitions = [
     },
     {
         name: "entropy_score",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Calcula la entropía matemática (complejidad) de uno o más archivos usando el TypeScript Compiler API. Sin LLM. Sin tokens. Devuelve: cyclomatic complexity, nesting depth, ratio de 'any', tamaño de funciones, y un score compuesto 0-100 (0=limpio, 100=caos puro). Usa esto para identificar qué archivos necesitan refactor ANTES de tocarlos.",
         inputSchema: {
             type: "object",
@@ -649,6 +862,7 @@ const toolDefinitions = [
     },
     {
         name: "coupling_radar",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Construye un grafo de acoplamiento entre módulos analizando imports/exports con el TypeScript Compiler. Sin LLM. Sin tokens. Detecta: ciclos de dependencia, módulos 'dios' (importados por todo), islas muertas (nadie los importa), y fan-in/fan-out por módulo. Esencial antes de refactors grandes.",
         inputSchema: {
             type: "object",
@@ -660,6 +874,7 @@ const toolDefinitions = [
     },
     {
         name: "pattern_fossil",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Detecta código zombie: patrones que ya fueron reemplazados en la mayoría del codebase pero siguen vivos en archivos viejos. Sin LLM. Sin tokens. Detecta: callbacks vs async/await, var vs let/const, require() vs import, any vs generics. Devuelve porcentaje de adopción del patrón nuevo vs. los fósiles que quedan.",
         inputSchema: {
             type: "object",
@@ -670,6 +885,7 @@ const toolDefinitions = [
     },
     {
         name: "git_heatmap_risk",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Analiza el historial de git para identificar zonas de alto riesgo. Sin LLM. Sin tokens. Calcula: churn rate (frecuencia de cambios), co-edición oculta (archivos que siempre cambian juntos = acoplamiento implícito), y un risk score compuesto por archivo. Detecta los archivos que estadísticamente tienen más probabilidad de tener un bug.",
         inputSchema: {
             type: "object",
@@ -681,6 +897,7 @@ const toolDefinitions = [
     },
     {
         name: "precrime_static",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "MINORITY REPORT para tu código. Combina entropy_score + coupling_radar + git_heatmap_risk en un predictor de riesgo compuesto. Sin LLM. Sin tokens. Devuelve un ranking de archivos y funciones con mayor probabilidad de causar un bug, con justificación matemática de cada factor. Úsalo antes de un deploy o un PR review.",
         inputSchema: {
             type: "object",
@@ -693,6 +910,7 @@ const toolDefinitions = [
     },
     {
         name: "semantic_dedup_guard",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Firewall anti-redundancia para The Brain. Antes de hacer store_memory, pasa el contenido por aquí. Consulta ChromaDB localmente sin gastar tokens. Si hay un hit >= 92% → rechaza el store y devuelve el duplicado. Si 75-91% → advierte y muestra el similar. Mantiene The Brain denso y limpio.",
         inputSchema: {
             type: "object",
@@ -706,6 +924,7 @@ const toolDefinitions = [
     },
     {
         name: "dead_export_necromancer",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Resucita el código muerto. Usa el TypeScript Compiler para mapear TODOS los exports del workspace y los cruza contra TODOS los imports. Lo que se exporta pero nadie importa = código zombie que está inflando tu contexto y desperdiciando tokens. Sin LLM. Sin tokens. Devuelve lista de exports muertos con estimación de tokens desperdiciados.",
         inputSchema: {
             type: "object",
@@ -716,6 +935,7 @@ const toolDefinitions = [
     },
     {
         name: "review_diff",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Analyze a raw git diff locally for regressions, security issues, code quality, and static analysis. Zero-cost static analysis using local TypeScript compiler API — no LLM calls. Returns score, verdict, and detailed findings with suggestions.",
         inputSchema: {
             type: "object",
@@ -729,6 +949,7 @@ const toolDefinitions = [
     },
     {
         name: "review_pr",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: true },
         description: "Analyze a Pull Request via GitHub, Azure DevOps, or GitLab API. Detects regressions, security issues, code quality problems, and breaking changes. Posts results as PR comments and can auto-approve if quality threshold is met. Pro license required.",
         inputSchema: {
             type: "object",
@@ -745,6 +966,7 @@ const toolDefinitions = [
     },
     {
         name: "pr_status",
+        annotations: { readOnlyHint: true, openWorldHint: true },
         description: "Get the status and detailed results of a previously reviewed PR. Returns score, verdict, findings, and approval status.",
         inputSchema: {
             type: "object",
@@ -758,6 +980,7 @@ const toolDefinitions = [
     },
     {
         name: "generate_pr_workflow",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: true, openWorldHint: false },
         description: "Generate a CI/CD workflow file (GitHub Actions or Azure Pipelines) that runs Lemma PR Review on every pull request. Writes the file to the workspace.",
         inputSchema: {
             type: "object",
@@ -772,6 +995,7 @@ const toolDefinitions = [
     },
     {
         name: "depgraph",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Builds a real-time dependency graph for any file in the workspace using the TypeScript Compiler API. Shows what a file imports, what imports it (reverse deps), and what it exports. Zero LLM calls. Essential before any refactor to understand blast radius.",
         inputSchema: {
             type: "object",
@@ -788,6 +1012,7 @@ const toolDefinitions = [
     },
     {
         name: "affected_tests",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         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",
@@ -796,9 +1021,24 @@ const toolDefinitions = [
                 baseRef: { type: "string", description: "Additional git ref to diff against, e.g. 'main'. The working tree is always included." },
             },
         },
+        outputSchema: {
+            type: "object",
+            properties: {
+                changed: { type: "array", items: { type: "string" }, description: "Files the diff touched, repo-relative" },
+                directTests: { type: "array", items: { type: "string" }, description: "Changed files that are themselves tests" },
+                affected: { type: "array", items: { type: "string" }, description: "Test files that transitively import a changed file" },
+                totalTests: { type: "number", description: "Total test files in the repo" },
+                runner: { type: "string", enum: ["jest", "vitest", "unknown"] },
+                command: { type: ["string", "null"], description: "Command to run just the affected tests, or null if the full suite is recommended" },
+                fullSuiteReason: { type: ["string", "null"], description: "Why the full suite is recommended instead, when command is null" },
+                ungraphed: { type: "array", items: { type: "string" }, description: "Changed files absent from the import graph — blast radius unknown" },
+            },
+            required: ["changed", "directTests", "affected", "totalTests", "runner", "command", "fullSuiteReason", "ungraphed"],
+        },
     },
     {
         name: "refactor",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: false },
         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.",
         inputSchema: {
             type: "object",
@@ -816,6 +1056,7 @@ const toolDefinitions = [
     },
     {
         name: "smart_file_slice",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Read only the lines semánticamente relevantes around a search query in a file, avoiding sending the entire file context. Returns lines around the matches.",
         inputSchema: {
             type: "object",
@@ -829,6 +1070,7 @@ const toolDefinitions = [
     },
     {
         name: "test_oracle",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: false, openWorldHint: true },
         description: "Execute unit tests locally and output ONLY the failing tests and compressed stack traces, keeping context clean.",
         inputSchema: {
             type: "object",
@@ -839,6 +1081,7 @@ const toolDefinitions = [
     },
     {
         name: "schema_extract",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Extract high-level schemas, Zod types, interfaces, or database models from a file using the TypeScript AST, removing all implementation code.",
         inputSchema: {
             type: "object",
@@ -850,6 +1093,7 @@ const toolDefinitions = [
     },
     {
         name: "changelog_auto",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Generate a clean, token-efficient changelog summary from git logs based on Conventional Commits.",
         inputSchema: {
             type: "object",
@@ -860,6 +1104,7 @@ const toolDefinitions = [
     },
     {
         name: "spec_to_stub",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Parse a TypeScript interface/type definition from a file and output a template mock/stub object configuration using pure AST analysis.",
         inputSchema: {
             type: "object",
@@ -872,6 +1117,7 @@ const toolDefinitions = [
     },
     {
         name: "env_snapshot",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Capture environmental state like Node version, dependencies in package.json, and variables declared in .env files (hiding actual values/credentials).",
         inputSchema: {
             type: "object",
@@ -880,6 +1126,7 @@ const toolDefinitions = [
     },
     {
         name: "migration_tracer",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Inspect changes in database schemas (tables, columns) across local migrations (e.g. Prisma migration directories).",
         inputSchema: {
             type: "object",
@@ -890,6 +1137,7 @@ const toolDefinitions = [
     },
     {
         name: "multi_file_patch",
+        annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: false },
         description: "Apply search-and-replace patches to multiple workspace files in a single turn. Decreases round-trips for multi-file refactoring.",
         inputSchema: {
             type: "object",
@@ -914,6 +1162,7 @@ const toolDefinitions = [
     },
     {
         name: "file_intent_index",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Map and index files inside the workspace by domain intent (e.g., auth, billing, routes, config) to speed up navigation.",
         inputSchema: {
             type: "object",
@@ -924,6 +1173,7 @@ const toolDefinitions = [
     },
     {
         name: "cognitive_map",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: false, openWorldHint: false },
         description: "Access and interact with the Auto-Cognitive Mind Map of the workspace (persisted globally). Holds structured high-level system domains, patterns, decisions, and bugs.",
         inputSchema: {
             type: "object",
@@ -946,6 +1196,7 @@ const toolDefinitions = [
     },
     {
         name: "semantic_grep",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Search the codebase for conceptual terms using natural language and BM25 token relevance instead of exact substring matching.",
         inputSchema: {
             type: "object",
@@ -959,6 +1210,7 @@ const toolDefinitions = [
     },
     {
         name: "imports_skeleton_resolver",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Resolve all imported local files inside a file and print only their signatures (classes, functions, interfaces) in a consolidated view.",
         inputSchema: {
             type: "object",
@@ -970,6 +1222,7 @@ const toolDefinitions = [
     },
     {
         name: "ast_flow_visualizer",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Analyze a function's control flow statements (ifs, loops, try/catch) inside a file using AST compilation and output a visual flowchart in Mermaid syntax.",
         inputSchema: {
             type: "object",
@@ -982,6 +1235,7 @@ const toolDefinitions = [
     },
     {
         name: "file_fingerprint",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Compute SHA256 fingerprint of a file. Returns 'unchanged' if hash matches cache, avoiding full re-reads. Saves 60-70% tokens on repeated file access.",
         inputSchema: {
             type: "object",
@@ -994,6 +1248,7 @@ const toolDefinitions = [
     },
     {
         name: "git_blame_heat",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Analyze git blame history to identify high-risk lines and authors. Zero LLM cost. Returns risk scores per line, hotspots, and top contributors by risk.",
         inputSchema: {
             type: "object",
@@ -1005,6 +1260,7 @@ const toolDefinitions = [
     },
     {
         name: "type_coverage_report",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Analyze TypeScript type coverage of a file using AST. Returns declaration count, typed vs untyped ratio, any-usage count, and a safety score 0-100. Zero LLM cost.",
         inputSchema: {
             type: "object",
@@ -1016,6 +1272,7 @@ const toolDefinitions = [
     },
     {
         name: "import_tree_context",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Build a bidirectional import graph for a file. Shows what it imports, what imports it, and external dependencies. Zero LLM cost. Essential before refactors.",
         inputSchema: {
             type: "object",
@@ -1028,6 +1285,7 @@ const toolDefinitions = [
     },
     {
         name: "read_token_budgeted",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Read a file with a hard token budget. Returns only the most relevant sections up to maxTokens. Saves 70-90% vs full reads.",
         inputSchema: {
             type: "object",
@@ -1041,6 +1299,7 @@ const toolDefinitions = [
     },
     {
         name: "bulk_file_digest",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Read multiple files in one call and return a compressed digest. Saves 80% round-trips vs reading files individually.",
         inputSchema: {
             type: "object",
@@ -1058,6 +1317,7 @@ const toolDefinitions = [
     },
     {
         name: "auto_context_bundle",
+        annotations: { readOnlyHint: true, idempotentHint: true, openWorldHint: false },
         description: "Get everything about a file in one call: compressed content, import graph, schema types, and telepathic hints from The Brain. Replaces 4-5 separate tool calls.",
         inputSchema: {
             type: "object",
@@ -1069,6 +1329,7 @@ const toolDefinitions = [
     },
     {
         name: "repeat_guard",
+        annotations: { readOnlyHint: true, openWorldHint: false },
         description: "Check if a draft output is repetitive compared to recent responses. Returns similarity score and suggestion. Prevents duplicate explanations.",
         inputSchema: {
             type: "object",
@@ -1081,6 +1342,7 @@ const toolDefinitions = [
     },
     {
         name: "conversation_checkpoint",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: true, openWorldHint: false },
         description: "Save or load session state. Prevents re-explaining context across turns. Save current progress or load last checkpoint.",
         inputSchema: {
             type: "object",
@@ -1096,6 +1358,7 @@ const toolDefinitions = [
     },
     {
         name: "test_autofix_interceptor",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: false, openWorldHint: true },
         description: "Run tests and auto-search The Brain for fixes to failures. Returns failure list with suggested fixes from past sessions. Saves 4-5 turns of debugging.",
         inputSchema: {
             type: "object",
@@ -1106,6 +1369,7 @@ const toolDefinitions = [
     },
     {
         name: "prompt_pattern_cache",
+        annotations: { readOnlyHint: false, destructiveHint: false, idempotentHint: false, openWorldHint: false },
         description: "Find or store optimized prompt templates. Reuses past prompt patterns to save 20-30% tokens on repetitive operations.",
         inputSchema: {
             type: "object",
@@ -1125,6 +1389,7 @@ const _infraToolDefs = (0, mcp_tools_1.getInfraToolDefinitions)();
 // than in the main array because it must never itself be hidden.
 const TOOLBOX_TOOL_DEFINITION = {
     name: "lemma_toolbox",
+    annotations: { readOnlyHint: false, destructiveHint: true, idempotentHint: false, openWorldHint: true },
     description: "Discover and invoke Lemma tools whose schemas are not loaded this session. Use action='list' (optionally with a query) to see what exists, 'schema' to read one tool's inputs, and 'call' to run it. Every Lemma capability is reachable here.",
     inputSchema: {
         type: "object",
@@ -1186,6 +1451,7 @@ const toolHandlers = {
     scrub_privacy: handleScrubPrivacy,
     search_memory: handleSearchMemory,
     store_memory: handleStoreMemory,
+    downvote_memory: handleDownvoteMemory,
     get_routing_advice: handleGetRoutingAdvice,
     auto_heal: handleAutoHeal,
     read_workspace_file: handleReadWorkspaceFile,
@@ -1330,11 +1596,12 @@ function receiptLabelMeta(name, args) {
     return meta;
 }
 function setupToolsHandlers(server, onToolCall) {
+    mcpServerRef = server;
     (0, SpeculativeWarmer_1.registerSymbolExtractor)(extractSymbolsWithTsCompiler);
     server.setRequestHandler(types_js_1.ListToolsRequestSchema, async () => ({
         tools: toolDefinitionsArray,
     }));
-    server.setRequestHandler(types_js_1.CallToolRequestSchema, async (request) => {
+    server.setRequestHandler(types_js_1.CallToolRequestSchema, async (request, extra) => {
         const { name, arguments: args } = request.params;
         const startTime = Date.now();
         // ── Pro License Gate (granular: free tools work without license) ────────
@@ -1363,6 +1630,39 @@ function setupToolsHandlers(server, onToolCall) {
             });
             throw new Error(`Unknown tool: ${name}`);
         }
+        // ── Task-augmented call: hand off to tasks.ts instead of awaiting inline ────
+        // A task-unaware client never sends `request.params.task`, so this only triggers when
+        // the caller actually asked for it — today's synchronous behavior is unchanged otherwise.
+        if (request.params.task && tasks_1.TASK_CAPABLE_TOOLS.has(name)) {
+            const ledgerBefore = (0, TokenReceipt_1.getLedgerLength)();
+            return (0, tasks_1.runAsTask)(name, (args || {}), request, extra.requestId, handler, (result, error) => {
+                if (error) {
+                    onToolCall?.({
+                        tool: name,
+                        args: args || {},
+                        result: "ERROR",
+                        latency: Date.now() - startTime,
+                        error: error instanceof Error ? error.message.substring(0, 100) : String(error).substring(0, 100),
+                    });
+                    return;
+                }
+                if ((0, TokenReceipt_1.getLedgerLength)() === ledgerBefore) {
+                    (0, TokenReceipt_1.recordReceiptEvent)(receiptTypeForTool(name), name, {
+                        tool: name,
+                        ...receiptLabelMeta(name, args),
+                    });
+                }
+                const tokensImpact = (0, utils_1.estimateTokensFromResult)(result);
+                onToolCall?.({
+                    tool: name,
+                    args: args || {},
+                    result: "OK",
+                    latency: Date.now() - startTime,
+                    tokensImpact,
+                });
+                (0, reportSavings_1.reportCost)({ source: "toolResult", tokens: tokensImpact, toolName: name });
+            });
+        }
         try {
             // Sampled around the handler so a tool that logs its own, more specific event
             // (a cache hit, a miss) isn't double-counted by the generic entry below.
@@ -1398,6 +1698,9 @@ function setupToolsHandlers(server, onToolCall) {
             throw error;
         }
     });
+    // Registered after ListTools/CallTool: tests and other callers that assume "ListTools is
+    // first, CallTool is second" (see tests/unit/tool-regressions.test.ts) key off that order.
+    (0, tasks_1.registerTaskHandlers)(server);
 }
 // ── Tool Implementations ────────────────────────────────────────────
 async function handleScrubPrivacy(args) {
@@ -1421,11 +1724,12 @@ async function handleSearchMemory(args) {
     // formatting below then presents it as a reusable memory. Match smarter_cache's
     // threshold so both paths agree on what counts as a hit.
     const minSimilarity = typeof args?.minSimilarity === "number" ? args.minSimilarity : DEFAULT_MEMORY_SIMILARITY_FLOOR;
+    const domain = typeof args?.domain === "string" && args.domain.trim() ? args.domain.trim() : undefined;
     if (!query)
         throw new Error("Query is required");
     try {
         const brain = (0, TheBrainV2_1.getBrain)();
-        const results = brain.search(query, limit, minSimilarity, { projectId: (0, TheBrainV2_1.deriveProjectId)() });
+        const results = brain.search(query, limit, minSimilarity, { projectId: (0, TheBrainV2_1.deriveProjectId)(), domain });
         if (results.length === 0) {
             (0, TokenReceipt_1.recordReceiptEvent)("reasoning", query.substring(0, 100), {
                 tool: "search_memory",
@@ -1449,7 +1753,7 @@ async function handleSearchMemory(args) {
             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)}`;
+        const formatResult = (r, i) => `Result ${i + 1} (id: ${r.id}, 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.
@@ -1497,11 +1801,15 @@ async function handleStoreMemory(args) {
     const claims = Array.isArray(args?.claims)
         ? args.claims.filter((c) => c?.text)
         : undefined;
+    const explicitDomain = typeof args?.domain === "string" && args.domain.trim() ? args.domain.trim() : undefined;
+    // Auto-derive from the first tracked file when the caller didn't say — see
+    // deriveDomainForFile for why this is a best-effort tag, not a hard classification.
+    const domain = explicitDomain || (filePaths && filePaths.length > 0 ? deriveDomainForFile(filePaths[0]) : 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, claims);
+        const storeRes = brain.store(query, responseText, provider, 0.92, filePaths, undefined, outcome, symbols, claims, domain);
         // 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.
@@ -1514,19 +1822,40 @@ async function handleStoreMemory(args) {
         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." : "";
         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}` }] };
+        const domainNote = domain
+            ? ` Tagged with domain '${domain}'${explicitDomain ? "" : " (auto-derived from filePaths)"} — domain-scoped searches will prefer it.`
+            : "";
+        const conflictsNote = storeRes.conflicts && storeRes.conflicts.length > 0
+            ? `\n\n⚠️ ${storeRes.conflicts.length} existing ${storeRes.conflicts.length === 1 ? "memory shares" : "memories share"} a symbol with this one but disagree on outcome — review before trusting either:\n` +
+                storeRes.conflicts.map((c) => `  - [${c.outcome}] ${c.id}: ${c.query.substring(0, 120)}`).join("\n")
+            : "";
+        return { content: [{ type: "text", text: `Success: Memory stored. ${storeRes.reason}${trackingNote}${symbolNote}${outcomeNote}${claimsNote}${domainNote}${conflictsNote}` }] };
     }
     catch (e) {
         (0, utils_1.logError)("store_memory", e);
         return { content: [{ type: "text", text: `Failed to store memory in local Brain: ${e.message}` }] };
     }
 }
+async function handleDownvoteMemory(args) {
+    const id = args?.id;
+    if (!id)
+        throw new Error("id is required");
+    try {
+        const result = (0, TheBrainV2_1.getBrain)().downvote(id);
+        return { content: [{ type: "text", text: result.message }] };
+    }
+    catch (e) {
+        (0, utils_1.logError)("downvote_memory", e);
+        return { content: [{ type: "text", text: `Failed to downvote memory: ${e.message}` }] };
+    }
+}
 async function handleGetRoutingAdvice(args) {
     const prompt = args?.prompt;
     const intendedModel = args?.intended_model;
     const router = new ComplexityRouter_1.ComplexityRouter();
     const decision = router.evaluate(prompt, intendedModel);
-    if (decision.complexity === "low" && intendedModel && decision.model !== intendedModel) {
+    const switched = !!intendedModel && decision.model !== intendedModel;
+    if (decision.complexity === "low" && switched) {
         const estimatedPromptTokens = Math.floor((prompt?.length || 0) / 4);
         (0, reportSavings_1.reportSavings)({
             source: "complexityRouting",
@@ -1535,6 +1864,12 @@ async function handleGetRoutingAdvice(args) {
             query: prompt?.substring(0, 100),
         });
     }
+    const structured = {
+        recommendedModel: decision.model,
+        complexity: decision.complexity,
+        intendedModel: intendedModel || null,
+        switched,
+    };
     return {
         content: [
             {
@@ -1542,6 +1877,7 @@ async function handleGetRoutingAdvice(args) {
                 text: `Lemma Routing Advice: Use ${decision.model}. Reason: Complexity is ${decision.complexity}.`,
             },
         ],
+        structuredContent: structured,
     };
 }
 async function handleAutoHeal(args) {
@@ -1751,6 +2087,30 @@ function stripLineNumberGutter(text) {
         return text;
     return lines.map((l) => l.replace(GUTTER, "")).join("\n");
 }
+// Splices one resolved match into the file and writes it. Shared by the normal
+// single-match path and the ambiguous-match-resolved-via-elicitation path below.
+async function applyMatch(match, filePath, resolved, originalContent, searchContent, replaceContent) {
+    let updatedContent;
+    if (match.strategy === "exact" && match.charStart !== undefined && match.charEnd !== undefined) {
+        // Splice by character offset — the search block may be a mid-line fragment, and
+        // a whole-line splice would discard everything else sharing that line.
+        updatedContent = originalContent.slice(0, match.charStart) + replaceContent + originalContent.slice(match.charEnd);
+    }
+    else {
+        const contentLines = originalContent.split("\n");
+        const finalReplace = (0, PatchMatcher_1.reindentReplacement)(replaceContent, searchContent, contentLines[match.startLine]);
+        const updatedLines = [...contentLines.slice(0, match.startLine), ...finalReplace.split("\n"), ...contentLines.slice(match.endLine + 1)];
+        updatedContent = updatedLines.join("\n");
+    }
+    const elicited = await tryElicitConfirmation(`Apply a patch to ${filePath}? This replaces ${searchContent.length} char(s) with ${replaceContent.length} char(s) ` +
+        `starting at line ${match.startLine + 1}.`);
+    if (elicited.supported && !elicited.confirmed) {
+        return { content: [{ type: "text", text: `Patch to ${filePath} was not applied: declined during confirmation.` }] };
+    }
+    fs_1.default.writeFileSync(resolved, updatedContent, "utf8");
+    const note = match.strategy === "exact" ? "" : ` (matched via ${match.strategy}, score ${match.score.toFixed(2)})`;
+    return { content: [{ type: "text", text: `Success: Patch successfully applied to ${filePath}${note}` }] };
+}
 async function handleApplyWorkspacePatch(args) {
     const filePath = args?.filePath;
     const rawSearch = args?.searchContent;
@@ -1773,6 +2133,15 @@ async function handleApplyWorkspacePatch(args) {
         const matchResult = (0, PatchMatcher_1.findMatch)(originalContent, searchContent);
         if (!Array.isArray(matchResult)) {
             if (matchResult.reason === "ambiguous") {
+                const candidates = matchResult.candidates ?? [];
+                if (candidates.length > 0) {
+                    const chosen = await tryElicitChoice(`${candidates.length} equally good matches found for the search content in ${filePath}. Which one should be patched?`, candidates.map((c) => ({
+                        title: `line ${c.startLine + 1}: ${c.matchedText.split("\n")[0].slice(0, 80)}`,
+                    })));
+                    if (chosen.index !== null) {
+                        return applyMatch(candidates[chosen.index], filePath, resolved, originalContent, searchContent, replaceContent);
+                    }
+                }
                 return {
                     content: [
                         {
@@ -1801,28 +2170,71 @@ async function handleApplyWorkspacePatch(args) {
                 ],
             };
         }
-        const match = matchResult[0];
-        let updatedContent;
-        if (match.strategy === "exact" && match.charStart !== undefined && match.charEnd !== undefined) {
-            // Splice by character offset — the search block may be a mid-line fragment, and
-            // a whole-line splice would discard everything else sharing that line.
-            updatedContent = originalContent.slice(0, match.charStart) + replaceContent + originalContent.slice(match.charEnd);
-        }
-        else {
-            const contentLines = originalContent.split("\n");
-            const finalReplace = (0, PatchMatcher_1.reindentReplacement)(replaceContent, searchContent, contentLines[match.startLine]);
-            const updatedLines = [...contentLines.slice(0, match.startLine), ...finalReplace.split("\n"), ...contentLines.slice(match.endLine + 1)];
-            updatedContent = updatedLines.join("\n");
-        }
-        fs_1.default.writeFileSync(resolved, updatedContent, "utf8");
-        const note = match.strategy === "exact" ? "" : ` (matched via ${match.strategy}, score ${match.score.toFixed(2)})`;
-        return { content: [{ type: "text", text: `Success: Patch successfully applied to ${filePath}${note}` }] };
+        return applyMatch(matchResult[0], filePath, resolved, originalContent, searchContent, replaceContent);
     }
     catch (err) {
         (0, utils_1.logError)("apply_workspace_patch", err);
         return { content: [{ type: "text", text: `Error applying patch: ${err.message}` }] };
     }
 }
+// Async replacement for spawnSync: a blocking syscall inside a `tools/call` handler
+// freezes the whole (single-threaded) MCP server for the run's entire duration — including
+// task-status polls for THIS run once it's task-augmented (see runAsTask in tasks.ts), which
+// would otherwise defeat the point of making the tool pollable. `spawn` keeps the event loop
+// free while the command runs. Shape of the resolved value mirrors spawnSync's return value
+// on the fields the caller actually reads, so the rest of handleRunWorkspaceCommand is unchanged.
+function spawnCollect(command, cwd, timeoutMs) {
+    return new Promise((resolve) => {
+        const child = (0, child_process_1.spawn)(command, {
+            cwd,
+            shell: true,
+            env: { ...process.env },
+            // spawnSync closed stdin immediately (no `input` option given), so a command reading
+            // from stdin (e.g. `sed` with no file argument) saw EOF right away. Plain `spawn`
+            // leaves stdin as an open pipe by default — nothing ever writes to or closes it — so
+            // the same command hangs until the timeout kills it. "ignore" reproduces the old,
+            // immediate-EOF behavior.
+            stdio: ["ignore", "pipe", "pipe"],
+        });
+        let stdout = "";
+        let stderr = "";
+        let stdoutBytes = 0;
+        let stderrBytes = 0;
+        const MAX_BUFFER = 20 * 1024 * 1024;
+        let timedOut = false;
+        let settled = false;
+        const timer = setTimeout(() => {
+            timedOut = true;
+            child.kill("SIGTERM");
+        }, timeoutMs);
+        child.stdout?.on("data", (chunk) => {
+            if (stdoutBytes >= MAX_BUFFER)
+                return;
+            stdoutBytes += chunk.length;
+            stdout += chunk.toString("utf8");
+        });
+        child.stderr?.on("data", (chunk) => {
+            if (stderrBytes >= MAX_BUFFER)
+                return;
+            stderrBytes += chunk.length;
+            stderr += chunk.toString("utf8");
+        });
+        child.on("error", (err) => {
+            if (settled)
+                return;
+            settled = true;
+            clearTimeout(timer);
+            resolve({ stdout, stderr, status: null, timedOut, error: err });
+        });
+        child.on("close", (code) => {
+            if (settled)
+                return;
+            settled = true;
+            clearTimeout(timer);
+            resolve({ stdout, stderr, status: code, timedOut });
+        });
+    });
+}
 async function handleRunWorkspaceCommand(args) {
     const command = args?.command;
     if (!command)
@@ -1852,10 +2264,10 @@ async function handleRunWorkspaceCommand(args) {
     // ── End allowlist check ────────────────────────────────────────────────
     const workspaceRoot = process.cwd();
     try {
-        // spawnSync rather than execSync: execSync leaves stderr attached to the parent unless
-        // stdio is overridden, which silently dropped the output of every tool that reports on
-        // stderr (jest and tsc both do) on a successful run. It also gives us stdout, stderr and
-        // the exit code through one code path instead of a throw-on-failure split.
+        // spawn (via spawnCollect above) rather than execSync: execSync leaves stderr attached to
+        // the parent unless stdio is overridden, which silently dropped the output of every tool
+        // that reports on stderr (jest and tsc both do) on a successful run. It also gives us
+        // stdout, stderr and the exit code through one code path instead of a throw-on-failure split.
         // 15s was below the runtime of the commands this tool exists for: a real `npm test` or
         // `tsc --noEmit` always tripped it, so the distillation pipeline never ran on the output
         // it was built for and the call was pure overhead before falling back to a plain shell.
@@ -1863,15 +2275,12 @@ async function handleRunWorkspaceCommand(args) {
         const MAX_TIMEOUT_MS = 600000;
         const requested = typeof args?.timeoutMs === "number" && args.timeoutMs > 0 ? args.timeoutMs : DEFAULT_TIMEOUT_MS;
         const timeoutMs = Math.min(Math.floor(requested), MAX_TIMEOUT_MS);
-        const result = (0, child_process_1.spawnSync)(command, {
-            cwd: workspaceRoot,
-            shell: true,
-            encoding: "utf8",
-            timeout: timeoutMs,
-            maxBuffer: 20 * 1024 * 1024,
-            env: { ...process.env },
-        });
-        const timedOut = !!result.error && result.error.code === "ETIMEDOUT";
+        const elicited = await tryElicitConfirmation(`Run this command in the workspace root?\n\n${command}`);
+        if (elicited.supported && !elicited.confirmed) {
+            return { content: [{ type: "text", text: `Command was not run: declined during confirmation.\n\nCommand: ${command}` }] };
+        }
+        const result = await spawnCollect(command, workspaceRoot, timeoutMs);
+        const timedOut = result.timedOut;
         if (result.error && !timedOut) {
             return {
                 content: [{ type: "text", text: `Command could not be executed: ${result.error.message}` }],
@@ -2885,47 +3294,44 @@ async function handleSmarterCache(args) {
                 reportSavings({ source: "cache", tokens: tokensSaved, toolName: "smarter_cache", query: query.substring(0, 100) });
             }
             catch { }
+            const structured = {
+                hit: true,
+                similarity: topHit.similarity,
+                threshold,
+                answer: responseText,
+                source: "lemma-brain",
+                tokensSaved,
+                tokensSavedFormatted: `~${tokensSaved.toLocaleString()} tokens`,
+            };
             return {
-                content: [{
-                        type: "text",
-                        text: JSON.stringify({
-                            hit: true,
-                            similarity: topHit.similarity,
-                            threshold,
-                            answer: responseText,
-                            source: "lemma-brain",
-                            tokensSaved,
-                            tokensSavedFormatted: `~${tokensSaved.toLocaleString()} tokens`,
-                        }, null, 2),
-                    }],
+                content: [{ type: "text", text: JSON.stringify(structured, null, 2) }],
+                structuredContent: structured,
             };
         }
+        const structured = {
+            hit: false,
+            similarity: topHit?.similarity || 0,
+            threshold,
+            answer: null,
+            source: "llm-call-required",
+            hint: "Después de resolver, llama store_memory para cachear y no gastar tokens en esto otra vez.",
+        };
         return {
-            content: [{
-                    type: "text",
-                    text: JSON.stringify({
-                        hit: false,
-                        similarity: topHit?.similarity || 0,
-                        threshold,
-                        answer: null,
-                        source: "llm-call-required",
-                        hint: "Después de resolver, llama store_memory para cachear y no gastar tokens en esto otra vez.",
-                    }, null, 2),
-                }],
+            content: [{ type: "text", text: JSON.stringify(structured, null, 2) }],
+            structuredContent: structured,
         };
     }
     catch (e) {
         (0, utils_1.logError)("smarter_cache", e);
+        const structured = {
+            hit: false,
+            error: e.message,
+            source: "cache-unavailable",
+            hint: "El cache local del brain falló. El LLM funcionará normalmente sin cache.",
+        };
         return {
-            content: [{
-                    type: "text",
-                    text: JSON.stringify({
-                        hit: false,
-                        error: e.message,
-                        source: "cache-unavailable",
-                        hint: "El cache local del brain falló. El LLM funcionará normalmente sin cache.",
-                    }, null, 2),
-                }],
+            content: [{ type: "text", text: JSON.stringify(structured, null, 2) }],
+            structuredContent: structured,
         };
     }
 }
@@ -2946,23 +3352,21 @@ async function handleStateHashCache(args) {
                 (0, reportSavings_1.reportSavings)({ source: "cache", tokens: tokensSaved, toolName: "state_hash_cache", query: query.substring(0, 100) });
             }
             catch { }
+            const structured = {
+                status: "hit",
+                answer: result.entry.answer,
+                note: "Respuesta desde caché exacto (hash de archivos sin cambios) — no necesita re-razonar.",
+                tokensSaved,
+            };
             return {
-                content: [{
-                        type: "text",
-                        text: JSON.stringify({
-                            status: "hit",
-                            answer: result.entry.answer,
-                            note: "Respuesta desde caché exacto (hash de archivos sin cambios) — no necesita re-razonar.",
-                            tokensSaved,
-                        }, null, 2),
-                    }],
+                content: [{ type: "text", text: JSON.stringify(structured, null, 2) }],
+                structuredContent: structured,
             };
         }
+        const structured = { status: "miss", reason: result.reason, hint: "Razona normalmente y luego llama action='store' con la respuesta." };
         return {
-            content: [{
-                    type: "text",
-                    text: JSON.stringify({ status: "miss", reason: result.reason, hint: "Razona normalmente y luego llama action='store' con la respuesta." }, null, 2),
-                }],
+            content: [{ type: "text", text: JSON.stringify(structured, null, 2) }],
+            structuredContent: structured,
         };
     }
     if (action === "store") {
@@ -2970,8 +3374,10 @@ async function handleStateHashCache(args) {
         if (!answer)
             throw new Error("answer is required for action='store'");
         const entry = (0, StateHashCache_1.storeStateHash)(workspaceRoot, query, answer, filePaths);
+        const structured = { status: "stored", id: entry.id, filesTracked: Object.keys(entry.fileHashes) };
         return {
-            content: [{ type: "text", text: JSON.stringify({ status: "stored", id: entry.id, filesTracked: Object.keys(entry.fileHashes) }, null, 2) }],
+            content: [{ type: "text", text: JSON.stringify(structured, null, 2) }],
+            structuredContent: structured,
         };
     }
     throw new Error(`Unknown action: ${action}. Use 'lookup' or 'store'.`);
@@ -2980,16 +3386,15 @@ async function handleStateHashCache(args) {
 async function handleTokenReceipt(args) {
     const limit = typeof args?.limit === "number" ? args.limit : 20;
     const summary = (0, TokenReceipt_1.getReceiptSummary)(limit);
+    const structured = {
+        totalEvents: summary.totalEvents,
+        byType: summary.byType,
+        recentEvents: summary.recent,
+        note: "Esto es una bitácora real de esta sesión, no una proyección de ahorro. Si byType.reasoning es alto, no hubo mucho cache — y está bien, es honesto.",
+    };
     return {
-        content: [{
-                type: "text",
-                text: JSON.stringify({
-                    totalEvents: summary.totalEvents,
-                    byType: summary.byType,
-                    recentEvents: summary.recent,
-                    note: "Esto es una bitácora real de esta sesión, no una proyección de ahorro. Si byType.reasoning es alto, no hubo mucho cache — y está bien, es honesto.",
-                }, null, 2),
-            }],
+        content: [{ type: "text", text: JSON.stringify(structured, null, 2) }],
+        structuredContent: structured,
     };
 }
 // ── Token Budget ─────────────────────────────────────────────────
@@ -4273,7 +4678,17 @@ async function handleAffectedTests(args) {
             totalTests: result.totalTests,
             narrowed: result.command !== null,
         });
-        return { content: [{ type: "text", text }] };
+        const structured = {
+            changed: result.changed,
+            directTests: result.directTests,
+            affected: result.affected,
+            totalTests: result.totalTests,
+            runner: result.runner,
+            command: result.command,
+            fullSuiteReason: result.fullSuiteReason,
+            ungraphed: result.ungraphed,
+        };
+        return { content: [{ type: "text", text }], structuredContent: structured };
     }
     catch (err) {
         (0, utils_1.logError)("affected_tests", err);
@@ -4778,6 +5193,37 @@ async function handleSmartFileSlice(args) {
     }
 }
 // ── Test Oracle ──────────────────────────────────────────────────────
+/**
+ * Auto-capture a green test run into the Brain, tagged `outcome: 'confirmed'` and tracked
+ * against the files actually changed. This is the auto-store hook: today store_memory only
+ * fires when the agent remembers to call it, so working fixes routinely go uncaptured. A
+ * passing suite over an uncommitted diff is real, cheap evidence something worked — reusing
+ * it costs nothing store_memory wouldn't have cost anyway, and store()'s own dedup guard
+ * means re-running the same green suite repeatedly just no-ops instead of piling up entries.
+ *
+ * Silent on a clean tree (nothing changed, nothing to attribute the pass to) or when the
+ * repo isn't git-tracked. Returns a short suffix for resultText — this must never happen
+ * invisibly, or a future search_memory hit would look reasoned-from-scratch instead of
+ * traced back to an automated test run.
+ */
+function autoStoreGreenTests(command, workspaceRoot) {
+    try {
+        const changed = (0, AffectedTests_1.changedFilesFromGit)(workspaceRoot);
+        if (changed.length === 0)
+            return "";
+        const domain = deriveDomainForFile(changed[0]);
+        const query = `tests passing after changes to ${changed.slice(0, 5).join(", ")}${changed.length > 5 ? ` and ${changed.length - 5} more file(s)` : ""}`;
+        const response = `\`${command}\` passed with these files changed (uncommitted at capture time):\n${changed.join("\n")}`;
+        const storeRes = (0, TheBrainV2_1.getBrain)().store(query, response, "test_oracle_auto", 0.92, changed, undefined, "confirmed", undefined, undefined, domain);
+        if (!storeRes.stored)
+            return "";
+        return `\n\n[Lemma] Auto-captured this green state in Brain (${changed.length} file(s), tagged confirmed) — search_memory will surface it, and will flag it stale the moment any of these files change again.`;
+    }
+    catch {
+        // Never let auto-capture break the actual test result the caller asked for.
+        return "";
+    }
+}
 async function handleTestOracle(args) {
     const command = args.command || "npm test";
     const workspaceRoot = process.cwd();
@@ -4788,6 +5234,7 @@ async function handleTestOracle(args) {
     try {
         const out = (0, child_process_1.execSync)(command, { cwd: workspaceRoot, encoding: "utf8", timeout: 30000 });
         resultText = `All tests passed!\n\nOutput:\n${out.substring(0, 1000)}`;
+        resultText += autoStoreGreenTests(command, workspaceRoot);
     }
     catch (e) {
         const stdout = e.stdout || "";
@@ -5103,6 +5550,41 @@ async function handleFileIntentIndex(args) {
     }
 }
 const COG_MAP_FILE = path_1.default.join(os_1.default.homedir(), ".lemma-cache", "cog_map.json");
+/**
+ * Best-effort domain for a repo-relative file path, so store_memory and the test-oracle
+ * auto-store below don't require a human to type `domain` by hand every time.
+ *
+ * Prefers the persisted Cognitive Map (built via `cognitive_map` action "build") when it
+ * has this exact file listed — that reflects an actual workspace scan. Falls back to the
+ * same lightweight substring heuristic "build" uses, so a project that never ran "build"
+ * still gets a reasonable tag instead of none at all. Returns undefined rather than
+ * "general" when nothing matches — an absent domain stays visible to every domain-scoped
+ * search (see BrainEntry.domain), while a wrong guess would actively mislead one.
+ */
+function deriveDomainForFile(relPath) {
+    const norm = relPath.replace(/^\//, "");
+    if (fs_1.default.existsSync(COG_MAP_FILE)) {
+        try {
+            const map = JSON.parse(fs_1.default.readFileSync(COG_MAP_FILE, "utf8"));
+            for (const node of Object.values(map.nodes || {})) {
+                if (node.files.includes(norm))
+                    return node.domain;
+            }
+        }
+        catch { /* fall through to heuristic */ }
+    }
+    if (norm.includes("mcp"))
+        return "mcp";
+    if (norm.includes("subconscious") || norm.includes("brain"))
+        return "memory";
+    if (norm.includes("security") || norm.includes("scrubber"))
+        return "security";
+    if (norm.includes("pr-review"))
+        return "pr-review";
+    if (norm.includes("utils"))
+        return "utils";
+    return undefined;
+}
 async function handleCognitiveMap(args) {
     const action = args.action;
     const domain = args.domain;