@hiveai/mcp 0.2.6 → 0.2.8

package/dist/index.js

@@ -397,6 +397,7 @@ async function memVerify(input, ctx) {
       file_path: filePath,
       stale: result.stale,
       reason: result.reason,
+      ...result.possibleRenames.length > 0 ? { possible_renames: result.possibleRenames } : {},
       status_after: statusAfter
     });
   }
@@ -859,6 +860,7 @@ import {
   estimateTokens,
   getUsage as getUsage5,
   inferModulesFromPaths as inferModulesFromPaths2,
+  isDecaying,
   literalMatchesAllTokens as literalMatchesAllTokens2,
   loadMemoriesFromDir as loadMemoriesFromDir12,
   loadUsageIndex as loadUsageIndex7,
@@ -883,12 +885,17 @@ var GetBriefingInputSchema = {
     "Use semantic ranking when a task is provided (requires `haive embeddings index`)."
   ),
   include_stale: z15.boolean().default(false).describe("Include stale memories (excluded by default \u2014 they may be outdated)"),
-  track: z15.boolean().default(true).describe("Increment read_count on returned memories")
+  track: z15.boolean().default(true).describe("Increment read_count on returned memories"),
+  format: z15.enum(["full", "compact"]).default("full").describe(
+    "Output format: 'full' returns complete memory bodies; 'compact' returns id + 1-line summary only (call mem_get for details)."
+  )
 };
 async function getBriefing(input, ctx) {
   const inferred = inferModulesFromPaths2(input.files);
   const memories = [];
   let searchMode = "literal";
+  let usage = { version: 1, updated_at: "", by_id: {} };
+  let byId = /* @__PURE__ */ new Map();
   if (existsSync15(ctx.paths.memoriesDir)) {
     const allLoaded = await loadMemoriesFromDir12(ctx.paths.memoriesDir);
     const allMemories = allLoaded.filter(({ memory }) => {
@@ -897,13 +904,13 @@ async function getBriefing(input, ctx) {
       if (!input.include_stale && s === "stale") return false;
       return true;
     });
-    const usage = await loadUsageIndex7(ctx.paths);
+    usage = await loadUsageIndex7(ctx.paths);
     const semanticHits = input.task && input.semantic ? await trySemanticHits(ctx, input.task, allMemories.length * 2) : null;
     if (input.task && input.semantic) {
       searchMode = semanticHits ? "semantic" : "literal_fallback";
     }
     const seen = /* @__PURE__ */ new Map();
-    const addOrUpdate = (loaded, reason, score) => {
+    const addOrUpdate = (loaded, reason, score, matchQuality) => {
       const fm = loaded.memory.frontmatter;
       const existing = seen.get(fm.id);
       if (existing) {
@@ -911,6 +918,11 @@ async function getBriefing(input, ctx) {
         if (score !== void 0 && (existing.semantic_score ?? 0) < score) {
           existing.semantic_score = score;
         }
+        if (matchQuality === "exact" && existing.match_quality !== "exact") {
+          existing.match_quality = "exact";
+        } else if (matchQuality === "semantic" && existing.match_quality === "partial") {
+          existing.match_quality = "semantic";
+        }
         return;
       }
       const u = getUsage5(usage, fm.id);
@@ -924,6 +936,7 @@ async function getBriefing(input, ctx) {
         confidence: deriveConfidence4(fm, u),
         read_count: u.read_count,
         reasons: [reason],
+        match_quality: matchQuality ?? "partial",
         ...score !== void 0 ? { semantic_score: score } : {},
         body: loaded.memory.body,
         file_path: loaded.filePath
@@ -931,37 +944,48 @@ async function getBriefing(input, ctx) {
     };
     if (input.files.length > 0) {
       for (const loaded of allMemories) {
-        if (memoryMatchesAnchorPaths2(loaded.memory, input.files)) addOrUpdate(loaded, "anchor");
+        if (memoryMatchesAnchorPaths2(loaded.memory, input.files)) addOrUpdate(loaded, "anchor", void 0, "exact");
       }
       for (const loaded of allMemories) {
         const fm = loaded.memory.frontmatter;
-        if (fm.module && inferred.includes(fm.module)) addOrUpdate(loaded, "module");
-        if (fm.domain && inferred.includes(fm.domain)) addOrUpdate(loaded, "domain");
-        if (fm.tags.some((t) => inferred.includes(t))) addOrUpdate(loaded, "module");
+        if (fm.module && inferred.includes(fm.module)) addOrUpdate(loaded, "module", void 0, "partial");
+        if (fm.domain && inferred.includes(fm.domain)) addOrUpdate(loaded, "domain", void 0, "partial");
+        if (fm.tags.some((t) => inferred.includes(t))) addOrUpdate(loaded, "module", void 0, "partial");
       }
     }
     if (input.task) {
       const tokens = tokenizeQuery2(input.task);
       for (const loaded of allMemories) {
         if (literalMatchesAllTokens2(loaded.memory, tokens)) {
-          addOrUpdate(loaded, "semantic");
+          addOrUpdate(loaded, "semantic", void 0, "exact");
         }
       }
       if (semanticHits) {
-        const byId = new Map(allMemories.map((m) => [m.memory.frontmatter.id, m]));
         for (const hit of semanticHits) {
           const loaded = byId.get(hit.id);
-          if (loaded) addOrUpdate(loaded, "semantic", hit.score);
+          if (loaded) addOrUpdate(loaded, "semantic", hit.score, "semantic");
         }
       }
     }
     const ranked = [...seen.values()].sort((a, b) => {
-      const reasonScore = (m) => (m.reasons.includes("anchor") ? 4 : 0) + (m.reasons.includes("module") ? 2 : 0) + (m.reasons.includes("semantic") ? 2 : 0) + (m.reasons.includes("domain") ? 1 : 0);
+      const reasonScore = (m) => (m.type === "attempt" ? 3 : 0) + // attempt = negative knowledge, surface first to prevent repeating mistakes
+      (m.reasons.includes("anchor") ? 4 : 0) + (m.reasons.includes("module") ? 2 : 0) + (m.reasons.includes("semantic") ? 2 : 0) + (m.reasons.includes("domain") ? 1 : 0);
       const confidenceScore = (m) => m.confidence === "authoritative" ? 4 : m.confidence === "trusted" ? 3 : m.confidence === "low" ? 1 : m.confidence === "stale" ? -2 : 0;
       const sa = reasonScore(a) + confidenceScore(a) + (a.semantic_score ?? 0);
       const sb = reasonScore(b) + confidenceScore(b) + (b.semantic_score ?? 0);
       return sb - sa;
     });
+    byId = new Map(allMemories.map((m) => [m.memory.frontmatter.id, m]));
+    for (const mem of ranked.slice(0, input.max_memories)) {
+      if (seen.size >= input.max_memories * 2) break;
+      const loaded = byId.get(mem.id);
+      if (!loaded) continue;
+      for (const relId of loaded.memory.frontmatter.related_ids ?? []) {
+        if (seen.has(relId)) continue;
+        const related = byId.get(relId);
+        if (related) addOrUpdate(related, "anchor", void 0, "partial");
+      }
+    }
     memories.push(...ranked.slice(0, input.max_memories));
     if (input.track && memories.length > 0) {
       await trackReads3(ctx.paths, memories.map((m) => m.id));
@@ -1002,21 +1026,41 @@ ${m.content}`).join("\n\n---\n\n"),
       trimmedModules.push({ name: m.name, content: sub.text, truncated: sub.truncated });
     }
   }
-  const trimmedMemoriesText = memoriesSlice.text;
-  const trimmedMemories = memories.map((m) => {
-    if (!memoriesSlice.truncated) return m;
-    const tokensPer = Math.floor(memoriesSlice.allocatedTokens / Math.max(1, memories.length));
-    const t = truncateToTokens(m.body, { maxTokens: tokensPer, mode: "head" });
-    return { ...m, body: t.text };
-  });
+  const trimmedMemories = [];
+  if (!memoriesSlice.truncated) {
+    trimmedMemories.push(...memories);
+  } else {
+    let remaining = memoriesSlice.allocatedTokens;
+    for (const m of memories) {
+      const bodyTokens = estimateTokens(m.body);
+      if (remaining <= 0) break;
+      if (bodyTokens <= remaining) {
+        trimmedMemories.push(m);
+        remaining -= bodyTokens;
+      } else if (remaining > 80) {
+        const t = truncateToTokens(m.body, { maxTokens: remaining, mode: "head" });
+        trimmedMemories.push({ ...m, body: t.text });
+        remaining = 0;
+      }
+    }
+  }
   const totalTokens = projectSlice.estimatedTokens + modulesSlice.estimatedTokens + memoriesSlice.estimatedTokens;
+  const decayWarnings = [];
+  for (const m of trimmedMemories) {
+    const u = getUsage5(usage, m.id);
+    const loaded = byId.get(m.id);
+    const createdAt = loaded?.memory.frontmatter.created_at ?? (/* @__PURE__ */ new Date()).toISOString();
+    if (isDecaying(u, createdAt)) decayWarnings.push(m.id);
+  }
+  const outputMemories = input.format === "compact" ? trimmedMemories.map((m) => ({ ...m, body: compactSummary(m.body) })) : trimmedMemories;
   return {
     ...input.task ? { task: input.task } : {},
     search_mode: searchMode,
     inferred_modules: inferred,
     project_context: projectContext ? { content: projectSlice.text, truncated: projectSlice.truncated } : null,
     module_contexts: trimmedModules,
-    memories: trimmedMemories,
+    memories: outputMemories,
+    decay_warnings: decayWarnings,
     estimated_tokens: totalTokens,
     budget: {
       max_tokens: input.max_tokens,
@@ -1028,6 +1072,13 @@ ${m.content}`).join("\n\n---\n\n"),
     }
   };
 }
+function compactSummary(body) {
+  for (const line of body.split("\n")) {
+    const trimmed = line.replace(/^#+\s*/, "").trim();
+    if (trimmed.length > 0) return trimmed.slice(0, 120);
+  }
+  return body.slice(0, 120);
+}
 async function trySemanticHits(ctx, task, limit) {
   let mod;
   try {
@@ -1087,13 +1138,58 @@ async function codeMapTool(input, ctx) {
   };
 }
 
-// src/prompts/bootstrap-project.ts
+// src/tools/mem-diff.ts
+import { existsSync as existsSync16 } from "fs";
+import { loadMemoriesFromDir as loadMemoriesFromDir13 } from "@hiveai/core";
 import { z as z17 } from "zod";
+var MemDiffInputSchema = {
+  id_a: z17.string().min(1).describe("First memory id"),
+  id_b: z17.string().min(1).describe("Second memory id")
+};
+async function memDiff(input, ctx) {
+  if (!existsSync16(ctx.paths.memoriesDir)) {
+    throw new Error(`No .ai/memories at ${ctx.paths.root}.`);
+  }
+  const all = await loadMemoriesFromDir13(ctx.paths.memoriesDir);
+  const foundA = all.find((m) => m.memory.frontmatter.id === input.id_a);
+  const foundB = all.find((m) => m.memory.frontmatter.id === input.id_b);
+  if (!foundA) throw new Error(`No memory with id "${input.id_a}".`);
+  if (!foundB) throw new Error(`No memory with id "${input.id_b}".`);
+  const fmA = foundA.memory.frontmatter;
+  const fmB = foundB.memory.frontmatter;
+  const frontmatterDiff = {};
+  const allKeys = /* @__PURE__ */ new Set([...Object.keys(fmA), ...Object.keys(fmB)]);
+  for (const key of allKeys) {
+    const va = fmA[key];
+    const vb = fmB[key];
+    if (JSON.stringify(va) !== JSON.stringify(vb)) {
+      frontmatterDiff[key] = { a: va, b: vb };
+    }
+  }
+  const linesA = new Set(foundA.memory.body.split("\n").map((l) => l.trim()).filter(Boolean));
+  const linesB = new Set(foundB.memory.body.split("\n").map((l) => l.trim()).filter(Boolean));
+  const onlyA = [...linesA].filter((l) => !linesB.has(l));
+  const onlyB = [...linesB].filter((l) => !linesA.has(l));
+  const common = [...linesA].filter((l) => linesB.has(l)).length;
+  return {
+    id_a: input.id_a,
+    id_b: input.id_b,
+    frontmatter_diff: frontmatterDiff,
+    body_diff: {
+      lines_only_in_a: onlyA,
+      lines_only_in_b: onlyB,
+      common_lines: common
+    }
+  };
+}
+
+// src/prompts/bootstrap-project.ts
+import { z as z18 } from "zod";
 var BootstrapProjectArgsSchema = {
-  module: z17.string().optional().describe(
+  module: z18.string().optional().describe(
     "Optional module name to scope the analysis to (writes to .ai/modules/<module>/context.md)"
   ),
-  focus: z17.string().optional().describe("Optional area to emphasize (e.g. 'data layer', 'API surface')")
+  focus: z18.string().optional().describe("Optional area to emphasize (e.g. 'data layer', 'API surface')")
 };
 var ROOT_TEMPLATE = `# Project context
 
@@ -1174,9 +1270,138 @@ ${template}\`\`\`
   };
 }
 
+// src/prompts/post-task.ts
+import { z as z19 } from "zod";
+var PostTaskArgsSchema = {
+  task_summary: z19.string().optional().describe("One sentence describing what you just did"),
+  files_touched: z19.array(z19.string()).optional().describe("Files you created or modified during the task")
+};
+function postTaskPrompt(args, ctx) {
+  const taskLine = args.task_summary ? `
+Task just completed: **${args.task_summary}**` : "";
+  const filesLine = args.files_touched && args.files_touched.length > 0 ? `
+Files touched: ${args.files_touched.map((f) => `\`${f}\``).join(", ")}` : "";
+  const text = `You have just finished a task. Before closing this session, take 60 seconds to capture what you learned.
+${taskLine}${filesLine}
+
+Project root: \`${ctx.paths.root}\`
+
+## Checklist \u2014 answer each question honestly
+
+Go through each item. If the answer is yes, call the corresponding tool immediately.
+
+### 1. Did you try an approach that failed?
+\u2192 If yes, call **\`mem_tried\`** with:
+  - \`what\`: the approach you tried (e.g. "importing gray-matter with ESM dynamic import")
+  - \`why_failed\`: why it didn't work
+  - \`instead\`: what worked instead
+  - \`scope\`: "team" if others will hit the same issue, "personal" if specific to your setup
+  - \`paths\`: the files where the issue manifested
+
+### 2. Did you discover a convention that isn't documented?
+\u2192 If yes, call **\`mem_save\`** with \`type="convention"\` and \`scope="team"\`
+
+### 3. Did you make an architectural decision?
+\u2192 If yes, call **\`mem_save\`** with \`type="decision"\` and document the WHY (constraints, tradeoffs), not just the what
+
+### 4. Did you hit a non-obvious bug or surprising behavior?
+\u2192 If yes, call **\`mem_save\`** with \`type="gotcha"\` and anchor it to the relevant file paths
+
+### 5. Did you find that an existing memory is outdated or wrong?
+\u2192 If yes, call **\`mem_update\`** with the correct information, or **\`mem_reject\`** if it's completely wrong
+
+## Rules
+
+- One memory per insight. Don't cram multiple lessons into one body.
+- Anchor memories to file paths when possible (the \`paths\` field) \u2014 this enables staleness detection.
+- Prefer \`scope="team"\` for anything a teammate or future agent would benefit from.
+- Skip sections where you genuinely have nothing to add. Don't fabricate memories.
+
+When done, respond with a brief summary: "Saved N memories: [list of IDs]" or "Nothing new to save."
+`;
+  return {
+    description: "Post-task reflection: capture what you learned before closing the session",
+    messages: [
+      {
+        role: "user",
+        content: { type: "text", text }
+      }
+    ]
+  };
+}
+
+// src/prompts/import-docs.ts
+import { z as z20 } from "zod";
+var ImportDocsArgsSchema = {
+  content: z20.string().describe("The documentation content to analyze and import as memories (Markdown, README, ADR, etc.)"),
+  source: z20.string().optional().describe("Origin of the content (file path, URL, or document title) \u2014 used to anchor memories"),
+  scope: z20.enum(["personal", "team"]).default("team").describe("Scope to assign to created memories"),
+  dry_run: z20.boolean().default(false).describe("If true, describe what would be saved without actually calling mem_save")
+};
+function importDocsPrompt(args, ctx) {
+  const sourceLine = args.source ? `
+Source: **${args.source}**` : "";
+  const dryRunNote = args.dry_run ? "\n> **DRY RUN** \u2014 describe what you would save but do not call any tools." : "";
+  const text = `You are given documentation to analyze and import into the hAIve memory system.
+${sourceLine}
+Scope: **${args.scope}**
+Project root: \`${ctx.paths.root}\`
+${dryRunNote}
+
+## Your task
+
+Read the documentation below and extract actionable memories. For each distinct piece of knowledge:
+
+1. **Identify the memory type** \u2014 which category fits best?
+   - \`convention\` \u2014 how things are done here (naming, patterns, workflow)
+   - \`decision\` \u2014 a choice that was made and why (tradeoffs, constraints)
+   - \`gotcha\` \u2014 non-obvious behavior, traps, things that surprise newcomers
+   - \`architecture\` \u2014 structural overview of a system or module
+   - \`glossary\` \u2014 domain terms and their meaning in this project
+
+2. **Determine the anchor** \u2014 which files or symbols does this knowledge apply to? List them in \`paths\`.
+
+3. **Write a focused body** \u2014 one memory = one insight. Do not combine multiple unrelated facts.
+   - Start with the key fact or rule
+   - Add context: why it matters, when it applies
+   - Add examples if helpful
+
+4. **Call \`mem_save\`** for each memory (unless dry_run).
+   - Set \`scope="${args.scope}"\`
+   - Set \`slug\` to a short kebab-case identifier
+   - Set \`paths\` to the relevant file paths (extracted from the doc if present)
+
+## Rules
+
+- Skip generic documentation that applies to any project (e.g., "install with npm install").
+- Prioritize gotchas, non-obvious decisions, and domain-specific conventions.
+- If the same knowledge is repeated in different sections, save it once.
+- Maximum 10 memories per import \u2014 select the most actionable ones.
+
+## Documentation to import
+
+---
+
+${args.content}
+
+---
+
+When done, respond with: "Imported N memories: [list of IDs]" or "Nothing actionable found."
+`;
+  return {
+    description: "Import documentation as hAIve memories",
+    messages: [
+      {
+        role: "user",
+        content: { type: "text", text }
+      }
+    ]
+  };
+}
+
 // src/server.ts
 var SERVER_NAME = "haive";
-var SERVER_VERSION = "0.2.6";
+var SERVER_VERSION = "0.2.8";
 function jsonResult(data) {
   return {
     content: [
@@ -1195,7 +1420,7 @@ function createHaiveServer(options = {}) {
   );
   server.tool(
     "mem_save",
-    "Save a new memory (default scope=personal). Use scope=team for shared memories.",
+    "Save a new memory (convention, decision, gotcha, architecture, glossary). For failed approaches use mem_tried instead \u2014 it enforces a structured format that is more useful to future agents. Use scope=team to share with the whole team.",
     MemSaveInputSchema,
     async (input) => jsonResult(await memSave(input, context))
   );
@@ -1285,16 +1510,34 @@ function createHaiveServer(options = {}) {
   );
   server.tool(
     "mem_tried",
-    "Record a failed approach as negative knowledge (type=attempt, auto-validated). Use this whenever you tried something and it didn't work \u2014 saves future agents from repeating the mistake.",
+    "Preferred way to record a failed approach. Enforces a structured what/why_failed/instead format that is immediately actionable for future agents. Auto-validated (no approval cycle). Use whenever you tried an approach and it failed \u2014 prevents the same mistake from happening in the next session.",
     MemTriedInputSchema,
     async (input) => jsonResult(await memTried(input, context))
   );
+  server.tool(
+    "mem_diff",
+    "Compare two memories side-by-side: shows frontmatter fields that differ and lines unique to each body. Useful before merging or deduplicating memories.",
+    MemDiffInputSchema,
+    async (input) => jsonResult(await memDiff(input, context))
+  );
   server.prompt(
     "bootstrap_project",
     "Instructions for the AI client to analyze the project and save the context.",
     BootstrapProjectArgsSchema,
     (args) => bootstrapProjectPrompt(args, context)
   );
+  server.prompt(
+    "post_task",
+    "Post-task checklist: run this after completing a task to capture failed approaches, new conventions, decisions, and gotchas before closing the session.",
+    PostTaskArgsSchema,
+    (args) => postTaskPrompt(args, context)
+  );
+  server.prompt(
+    "import_docs",
+    "Analyze documentation (README, ADR, wiki page, etc.) and save the actionable knowledge as hAIve memories. Pass the content and an optional source/scope.",
+    ImportDocsArgsSchema,
+    (args) => importDocsPrompt(args, context)
+  );
   return { server, context };
 }