stellavault 0.7.0 → 0.7.1

package/README.md

@@ -1,5 +1,7 @@
 # Stellavault
 
+[![CI](https://github.com/Evanciel/stellavault/actions/workflows/ci.yml/badge.svg)](https://github.com/Evanciel/stellavault/actions/workflows/ci.yml) [![npm](https://img.shields.io/npm/v/stellavault)](https://www.npmjs.com/package/stellavault) [![tests](https://img.shields.io/badge/tests-177%20passing-brightgreen)]()
+
 > **Drop anything. It compiles itself into knowledge.** Claude remembers everything you know.
 
 Self-compiling knowledge base with a full-featured editor, 3D neural graph, AI-powered search, and spaced repetition — available as a **desktop app**, **CLI**, **Obsidian plugin**, and **MCP server**. Your vault files are never modified.
@@ -148,6 +150,18 @@ Claude can search, ask, draft, lint, and analyze your vault directly.
 
 ---
 
+## Try It Now (Demo Vault)
+
+```bash
+npx stellavault index --vault ./examples/demo-vault   # Index 10 sample notes
+npx stellavault search "vector database"               # Semantic search
+npx stellavault graph                                  # 3D graph visualization
+```
+
+The demo vault includes interconnected notes about Vector Databases, Knowledge Graphs, Spaced Repetition, RAG, MCP, and more — perfect for exploring all features instantly.
+
+---
+
 ## Getting Started Guide
 
 ### Desktop App
@@ -199,6 +213,32 @@ stellavault decay                         # What are you forgetting?
 
 ---
 
+## Performance
+
+Tested on synthetic vaults — all operations under 1 second for typical use cases:
+
+| Operation | 100 docs | 500 docs | 1000 docs |
+|-----------|----------|----------|-----------|
+| Store init | 15ms | 15ms | 16ms |
+| Bulk upsert | 12ms | 102ms | ~200ms |
+| Search (BM25) | <1ms | <1ms | <1ms |
+| Get all docs | <1ms | 2ms | ~4ms |
+| 124K dot products | — | 36ms | — |
+
+Run your own benchmarks:
+
+```bash
+node tests/stress.mjs 500     # Test with 500 synthetic documents
+```
+
+Key optimizations:
+- Pre-normalized vectors: cosine similarity → single dot product
+- Batched embedding loading (500/batch, prevents RAM overflow)
+- Upper-triangle graph building (50% fewer comparisons)
+- O(n) K-Means centroid updates with typed arrays
+
+---
+
 ## Tech Stack
 
 | Layer | Tech |

package/dist/stellavault.js

@@ -587,6 +587,50 @@ var init_indexer = __esm({
   }
 });
 
+// packages/core/dist/utils/math.js
+function cosineSimilarity(a, b) {
+  if (a.length !== b.length)
+    return 0;
+  let dot = 0, normA = 0, normB = 0;
+  for (let i = 0; i < a.length; i++) {
+    dot += a[i] * b[i];
+    normA += a[i] * a[i];
+    normB += b[i] * b[i];
+  }
+  const denom = Math.sqrt(normA) * Math.sqrt(normB);
+  return denom === 0 ? 0 : dot / denom;
+}
+function dotProduct(a, b) {
+  let sum = 0;
+  for (let i = 0; i < a.length; i++)
+    sum += a[i] * b[i];
+  return sum;
+}
+function normalizeVector(v) {
+  let norm = 0;
+  for (let i = 0; i < v.length; i++)
+    norm += v[i] * v[i];
+  norm = Math.sqrt(norm);
+  if (norm === 0)
+    return v;
+  for (let i = 0; i < v.length; i++)
+    v[i] /= norm;
+  return v;
+}
+function euclideanDist(a, b) {
+  let sum = 0;
+  for (let i = 0; i < a.length; i++) {
+    const diff = a[i] - b[i];
+    sum += diff * diff;
+  }
+  return Math.sqrt(sum);
+}
+var init_math = __esm({
+  "packages/core/dist/utils/math.js"() {
+    "use strict";
+  }
+});
+
 // packages/core/dist/api/graph-data.js
 var graph_data_exports = {};
 __export(graph_data_exports, {
@@ -601,28 +645,32 @@ async function buildGraphData(store, options = {}) {
   ]);
   const edges = [];
   const edgeCounts = /* @__PURE__ */ new Map();
+  const normalizedVecs = /* @__PURE__ */ new Map();
   for (const doc of docs) {
     const vec = embeddings.get(doc.id);
     if (!vec)
       continue;
-    const similarities = [];
-    for (const other of docs) {
-      if (other.id === doc.id)
-        continue;
-      const otherVec = embeddings.get(other.id);
-      if (!otherVec)
-        continue;
-      const sim = cosineSimilarity(vec, otherVec);
+    normalizedVecs.set(doc.id, normalizeVector([...vec]));
+  }
+  const docIds = [...normalizedVecs.keys()];
+  const vecArray = docIds.map((id) => normalizedVecs.get(id));
+  const n = docIds.length;
+  const neighbors = Array.from({ length: n }, () => []);
+  for (let i = 0; i < n; i++) {
+    for (let j = i + 1; j < n; j++) {
+      const sim = dotProduct(vecArray[i], vecArray[j]);
       if (sim >= edgeThreshold) {
-        similarities.push({ id: other.id, sim });
+        neighbors[i].push({ peer: j, sim });
+        neighbors[j].push({ peer: i, sim });
       }
     }
-    similarities.sort((a, b) => b.sim - a.sim);
-    const topK = similarities.slice(0, maxEdgesPerNode);
-    for (const { id: targetId, sim } of topK) {
-      const edgeKey = [doc.id, targetId].sort().join(":");
+  }
+  for (let i = 0; i < n; i++) {
+    neighbors[i].sort((a, b) => b.sim - a.sim);
+    for (const { peer: j, sim } of neighbors[i].slice(0, maxEdgesPerNode)) {
+      const edgeKey = i < j ? `${i}:${j}` : `${j}:${i}`;
       if (!edgeCounts.has(edgeKey)) {
-        edges.push({ source: doc.id, target: targetId, weight: sim });
+        edges.push({ source: docIds[i], target: docIds[j], weight: sim });
         edgeCounts.set(edgeKey, 1);
       }
     }
@@ -657,16 +705,16 @@ async function buildGraphData(store, options = {}) {
       nodeCount: folderCounts.get(i) ?? 0
     }));
   } else {
-    const docIds = docs.filter((d) => embeddings.has(d.id)).map((d) => d.id);
-    const vectors = docIds.map((id) => embeddings.get(id));
-    const k = Math.min(Math.max(5, Math.round(Math.sqrt(docIds.length / 5))), 10);
+    const docIds2 = docs.filter((d) => embeddings.has(d.id)).map((d) => d.id);
+    const vectors = docIds2.map((id) => embeddings.get(id));
+    const k = Math.min(Math.max(5, Math.round(Math.sqrt(docIds2.length / 5))), 10);
     const assignments = kMeans(vectors, k);
     const clusterDocInfos = /* @__PURE__ */ new Map();
-    for (let i = 0; i < docIds.length; i++) {
+    for (let i = 0; i < docIds2.length; i++) {
       const cId = assignments[i];
       if (!clusterDocInfos.has(cId))
         clusterDocInfos.set(cId, []);
-      const doc = docs.find((d) => d.id === docIds[i]);
+      const doc = docs.find((d) => d.id === docIds2[i]);
       if (doc)
         clusterDocInfos.get(cId).push({ id: doc.id, title: doc.title });
     }
@@ -687,8 +735,8 @@ async function buildGraphData(store, options = {}) {
       });
     }
     assignmentMap = /* @__PURE__ */ new Map();
-    for (let i = 0; i < docIds.length; i++) {
-      assignmentMap.set(docIds[i], assignments[i]);
+    for (let i = 0; i < docIds2.length; i++) {
+      assignmentMap.set(docIds2[i], assignments[i]);
     }
   }
   const connectionCounts = /* @__PURE__ */ new Map();
@@ -725,16 +773,6 @@ async function buildGraphData(store, options = {}) {
     }
   };
 }
-function cosineSimilarity(a, b) {
-  let dot = 0, normA = 0, normB = 0;
-  for (let i = 0; i < a.length; i++) {
-    dot += a[i] * b[i];
-    normA += a[i] * a[i];
-    normB += b[i] * b[i];
-  }
-  const denom = Math.sqrt(normA) * Math.sqrt(normB);
-  return denom === 0 ? 0 : dot / denom;
-}
 function kMeans(vectors, k, maxIter = 50) {
   if (vectors.length === 0)
     return [];
@@ -781,29 +819,30 @@ function kMeans(vectors, k, maxIter = 50) {
     }
     if (!changed)
       break;
+    const sums = Array.from({ length: k }, () => new Float64Array(dims));
+    const counts = new Uint32Array(k);
+    for (let i = 0; i < vectors.length; i++) {
+      const c = assignments[i];
+      counts[c]++;
+      const s = sums[c], v = vectors[i];
+      for (let d = 0; d < dims; d++)
+        s[d] += v[d];
+    }
     for (let c = 0; c < k; c++) {
-      const members = vectors.filter((_, i) => assignments[i] === c);
-      if (members.length === 0)
+      if (counts[c] === 0)
         continue;
-      for (let d = 0; d < dims; d++) {
-        centroids[c][d] = members.reduce((sum, v) => sum + v[d], 0) / members.length;
-      }
+      const s = sums[c];
+      for (let d = 0; d < dims; d++)
+        centroids[c][d] = s[d] / counts[c];
     }
   }
   return assignments;
 }
-function euclideanDist(a, b) {
-  let sum = 0;
-  for (let i = 0; i < a.length; i++) {
-    const diff = a[i] - b[i];
-    sum += diff * diff;
-  }
-  return Math.sqrt(sum);
-}
 var CLUSTER_COLORS;
 var init_graph_data = __esm({
   "packages/core/dist/api/graph-data.js"() {
     "use strict";
+    init_math();
     CLUSTER_COLORS = [
       "#6366f1",
       "#ec4899",
@@ -824,6 +863,81 @@ var init_graph_data = __esm({
   }
 });
 
+// packages/core/dist/intelligence/gap-detector.js
+var gap_detector_exports = {};
+__export(gap_detector_exports, {
+  detectKnowledgeGaps: () => detectKnowledgeGaps
+});
+async function detectKnowledgeGaps(store, graphData) {
+  const docs = await store.getAllDocuments();
+  const embeddings = await store.getDocumentEmbeddings();
+  let gd;
+  if (!graphData) {
+    const { buildGraphData: buildGraphData2 } = await Promise.resolve().then(() => (init_graph_data(), graph_data_exports));
+    gd = await buildGraphData2(store);
+  } else {
+    gd = graphData;
+  }
+  const { nodes, edges, clusters } = gd;
+  const clusterEdges = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    const nodeA = nodes.find((n) => n.id === edge.source);
+    const nodeB = nodes.find((n) => n.id === edge.target);
+    if (!nodeA || !nodeB || nodeA.clusterId === nodeB.clusterId)
+      continue;
+    const key = [
+      Math.min(nodeA.clusterId, nodeB.clusterId),
+      Math.max(nodeA.clusterId, nodeB.clusterId)
+    ].join("-");
+    clusterEdges.set(key, (clusterEdges.get(key) ?? 0) + 1);
+  }
+  const gaps = [];
+  const clusterLabels = new Map(clusters.map((c) => [c.id, c.label]));
+  for (let i = 0; i < clusters.length; i++) {
+    for (let j = i + 1; j < clusters.length; j++) {
+      const key = `${Math.min(clusters[i].id, clusters[j].id)}-${Math.max(clusters[i].id, clusters[j].id)}`;
+      const bridgeCount = clusterEdges.get(key) ?? 0;
+      if (bridgeCount < 3) {
+        const labelA = clusterLabels.get(clusters[i].id) ?? `Cluster ${clusters[i].id}`;
+        const labelB = clusterLabels.get(clusters[j].id) ?? `Cluster ${clusters[j].id}`;
+        const nameA = labelA.replace(/\s*\(\d+\)$/, "");
+        const nameB = labelB.replace(/\s*\(\d+\)$/, "");
+        gaps.push({
+          clusterA: labelA,
+          clusterB: labelB,
+          bridgeCount,
+          suggestedTopic: `${nameA} + ${nameB} \uC5F0\uACB0 \uC9C0\uC2DD`,
+          severity: bridgeCount === 0 ? "high" : bridgeCount < 2 ? "medium" : "low"
+        });
+      }
+    }
+  }
+  const connectionCounts = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    connectionCounts.set(edge.source, (connectionCounts.get(edge.source) ?? 0) + 1);
+    connectionCounts.set(edge.target, (connectionCounts.get(edge.target) ?? 0) + 1);
+  }
+  const isolatedNodes = nodes.filter((n) => (connectionCounts.get(n.id) ?? 0) <= 1).map((n) => ({
+    id: n.id,
+    title: n.label,
+    connections: connectionCounts.get(n.id) ?? 0
+  })).slice(0, 20);
+  return {
+    totalClusters: clusters.length,
+    totalGaps: gaps.filter((g) => g.severity !== "low").length,
+    gaps: gaps.sort((a, b) => {
+      const sev = { high: 0, medium: 1, low: 2 };
+      return sev[a.severity] - sev[b.severity];
+    }).slice(0, 15),
+    isolatedNodes
+  };
+}
+var init_gap_detector = __esm({
+  "packages/core/dist/intelligence/gap-detector.js"() {
+    "use strict";
+  }
+});
+
 // packages/core/dist/intelligence/ask-engine.js
 var ask_engine_exports = {};
 __export(ask_engine_exports, {
@@ -1732,6 +1846,50 @@ var init_federation = __esm({
   }
 });
 
+// packages/core/dist/intelligence/duplicate-detector.js
+var duplicate_detector_exports = {};
+__export(duplicate_detector_exports, {
+  detectDuplicates: () => detectDuplicates
+});
+async function detectDuplicates(store, threshold = 0.88, limit = 20) {
+  const docs = await store.getAllDocuments();
+  const embeddings = await store.getDocumentEmbeddings();
+  if (docs.length < 2)
+    return [];
+  const docVecs = /* @__PURE__ */ new Map();
+  for (const doc of docs) {
+    const vec = embeddings.get(doc.id);
+    if (!vec || vec.length === 0)
+      continue;
+    docVecs.set(doc.id, { vec: Array.from(vec), title: doc.title, filePath: doc.filePath });
+  }
+  const ids = [...docVecs.keys()];
+  const pairs = [];
+  for (let i = 0; i < ids.length; i++) {
+    for (let j = i + 1; j < ids.length; j++) {
+      const a = docVecs.get(ids[i]);
+      const b = docVecs.get(ids[j]);
+      const sim = cosineSimilarity(a.vec, b.vec);
+      if (sim >= threshold) {
+        pairs.push({
+          docA: { id: ids[i], title: a.title, filePath: a.filePath },
+          docB: { id: ids[j], title: b.title, filePath: b.filePath },
+          similarity: Math.round(sim * 1e3) / 1e3
+        });
+      }
+    }
+    if (pairs.length >= limit * 2)
+      break;
+  }
+  return pairs.sort((a, b) => b.similarity - a.similarity).slice(0, limit);
+}
+var init_duplicate_detector = __esm({
+  "packages/core/dist/intelligence/duplicate-detector.js"() {
+    "use strict";
+    init_math();
+  }
+});
+
 // packages/core/dist/i18n/note-strings.js
 var note_strings_exports = {};
 __export(note_strings_exports, {
@@ -3078,18 +3236,25 @@ function createSqliteVecStore(dbPath, dimensions = 384) {
         lastIndexed: lastRow?.indexed_at ?? null
       };
     },
-    async getDocumentEmbeddings() {
-      const rows = db.prepare(`
+    async getDocumentEmbeddings(maxDocs = 1e4) {
+      const BATCH_SIZE = 500;
+      const result = /* @__PURE__ */ new Map();
+      const stmt = db.prepare(`
         SELECT c.document_id, ce.embedding
         FROM chunks c
         JOIN chunk_embeddings ce ON ce.chunk_id = c.id
         WHERE c.id IN (
           SELECT MIN(id) FROM chunks GROUP BY document_id
         )
-      `).all();
-      const result = /* @__PURE__ */ new Map();
-      for (const row of rows) {
-        result.set(row.document_id, bufferToFloat32(row.embedding));
+        LIMIT ? OFFSET ?
+      `);
+      for (let offset = 0; offset < maxDocs; offset += BATCH_SIZE) {
+        const rows = stmt.all(Math.min(BATCH_SIZE, maxDocs - offset), offset);
+        if (rows.length === 0)
+          break;
+        for (const row of rows) {
+          result.set(row.document_id, bufferToFloat32(row.embedding));
+        }
       }
       return result;
     },
@@ -3988,71 +4153,8 @@ var DecayEngine = class {
   }
 };
 
-// packages/core/dist/intelligence/gap-detector.js
-async function detectKnowledgeGaps(store, graphData) {
-  const docs = await store.getAllDocuments();
-  const embeddings = await store.getDocumentEmbeddings();
-  let gd;
-  if (!graphData) {
-    const { buildGraphData: buildGraphData2 } = await Promise.resolve().then(() => (init_graph_data(), graph_data_exports));
-    gd = await buildGraphData2(store);
-  } else {
-    gd = graphData;
-  }
-  const { nodes, edges, clusters } = gd;
-  const clusterEdges = /* @__PURE__ */ new Map();
-  for (const edge of edges) {
-    const nodeA = nodes.find((n) => n.id === edge.source);
-    const nodeB = nodes.find((n) => n.id === edge.target);
-    if (!nodeA || !nodeB || nodeA.clusterId === nodeB.clusterId)
-      continue;
-    const key = [
-      Math.min(nodeA.clusterId, nodeB.clusterId),
-      Math.max(nodeA.clusterId, nodeB.clusterId)
-    ].join("-");
-    clusterEdges.set(key, (clusterEdges.get(key) ?? 0) + 1);
-  }
-  const gaps = [];
-  const clusterLabels = new Map(clusters.map((c) => [c.id, c.label]));
-  for (let i = 0; i < clusters.length; i++) {
-    for (let j = i + 1; j < clusters.length; j++) {
-      const key = `${Math.min(clusters[i].id, clusters[j].id)}-${Math.max(clusters[i].id, clusters[j].id)}`;
-      const bridgeCount = clusterEdges.get(key) ?? 0;
-      if (bridgeCount < 3) {
-        const labelA = clusterLabels.get(clusters[i].id) ?? `Cluster ${clusters[i].id}`;
-        const labelB = clusterLabels.get(clusters[j].id) ?? `Cluster ${clusters[j].id}`;
-        const nameA = labelA.replace(/\s*\(\d+\)$/, "");
-        const nameB = labelB.replace(/\s*\(\d+\)$/, "");
-        gaps.push({
-          clusterA: labelA,
-          clusterB: labelB,
-          bridgeCount,
-          suggestedTopic: `${nameA} + ${nameB} \uC5F0\uACB0 \uC9C0\uC2DD`,
-          severity: bridgeCount === 0 ? "high" : bridgeCount < 2 ? "medium" : "low"
-        });
-      }
-    }
-  }
-  const connectionCounts = /* @__PURE__ */ new Map();
-  for (const edge of edges) {
-    connectionCounts.set(edge.source, (connectionCounts.get(edge.source) ?? 0) + 1);
-    connectionCounts.set(edge.target, (connectionCounts.get(edge.target) ?? 0) + 1);
-  }
-  const isolatedNodes = nodes.filter((n) => (connectionCounts.get(n.id) ?? 0) <= 1).map((n) => ({
-    id: n.id,
-    title: n.label,
-    connections: connectionCounts.get(n.id) ?? 0
-  })).slice(0, 20);
-  return {
-    totalClusters: clusters.length,
-    totalGaps: gaps.filter((g) => g.severity !== "low").length,
-    gaps: gaps.sort((a, b) => {
-      const sev = { high: 0, medium: 1, low: 2 };
-      return sev[a.severity] - sev[b.severity];
-    }).slice(0, 15),
-    isolatedNodes
-  };
-}
+// packages/core/dist/mcp/tools/learning-path.js
+init_gap_detector();
 
 // packages/core/dist/intelligence/learning-path.js
 function generateLearningPath(input, limit = 15) {
@@ -4144,6 +4246,7 @@ function createLearningPathTool(store) {
 }
 
 // packages/core/dist/mcp/tools/detect-gaps.js
+init_gap_detector();
 function createDetectGapsTool(store) {
   return {
     name: "detect-gaps",
@@ -4643,7 +4746,7 @@ function createMcpServer(options) {
   const askTool = createAskTool(searchEngine, vaultPath);
   const generateDraftTool = createGenerateDraftTool(searchEngine, vaultPath);
   const agenticTools = embedder ? createAgenticGraphTools(store, embedder, vaultPath) : [];
-  const server = new Server({ name: "stellavault", version: "0.7.0" }, { capabilities: { tools: {} } });
+  const server = new Server({ name: "stellavault", version: "0.7.1" }, { capabilities: { tools: {} } });
   server.setRequestHandler(ListToolsRequestSchema, async () => ({
     tools: [
       searchToolDef,
@@ -5090,55 +5193,9 @@ function createFederationRouter(store) {
 }
 
 // packages/core/dist/api/routes/knowledge.js
+init_duplicate_detector();
+init_gap_detector();
 import { Router as Router2 } from "express";
-
-// packages/core/dist/intelligence/duplicate-detector.js
-async function detectDuplicates(store, threshold = 0.88, limit = 20) {
-  const docs = await store.getAllDocuments();
-  const embeddings = await store.getDocumentEmbeddings();
-  if (docs.length < 2)
-    return [];
-  const docVecs = /* @__PURE__ */ new Map();
-  for (const doc of docs) {
-    const vec = embeddings.get(doc.id);
-    if (!vec || vec.length === 0)
-      continue;
-    docVecs.set(doc.id, { vec: Array.from(vec), title: doc.title, filePath: doc.filePath });
-  }
-  const ids = [...docVecs.keys()];
-  const pairs = [];
-  for (let i = 0; i < ids.length; i++) {
-    for (let j = i + 1; j < ids.length; j++) {
-      const a = docVecs.get(ids[i]);
-      const b = docVecs.get(ids[j]);
-      const sim = cosineSimilarity2(a.vec, b.vec);
-      if (sim >= threshold) {
-        pairs.push({
-          docA: { id: ids[i], title: a.title, filePath: a.filePath },
-          docB: { id: ids[j], title: b.title, filePath: b.filePath },
-          similarity: Math.round(sim * 1e3) / 1e3
-        });
-      }
-    }
-    if (pairs.length >= limit * 2)
-      break;
-  }
-  return pairs.sort((a, b) => b.similarity - a.similarity).slice(0, limit);
-}
-function cosineSimilarity2(a, b) {
-  if (a.length !== b.length)
-    return 0;
-  let dot = 0, normA = 0, normB = 0;
-  for (let i = 0; i < a.length; i++) {
-    dot += a[i] * b[i];
-    normA += a[i] * a[i];
-    normB += b[i] * b[i];
-  }
-  const denom = Math.sqrt(normA) * Math.sqrt(normB);
-  return denom === 0 ? 0 : dot / denom;
-}
-
-// packages/core/dist/api/routes/knowledge.js
 function createKnowledgeRouter(opts) {
   const { store, searchEngine, vaultPath, requireAuth } = opts;
   const router = Router2();
@@ -6036,7 +6093,8 @@ function createApiServer(options) {
       }
       let gapSummary = { gapCount: 0, isolatedCount: 0 };
       try {
-        const gapReport = await detectKnowledgeGaps(store);
+        const { detectKnowledgeGaps: detectKnowledgeGaps2 } = await Promise.resolve().then(() => (init_gap_detector(), gap_detector_exports));
+        const gapReport = await detectKnowledgeGaps2(store);
         gapSummary = {
           gapCount: gapReport.gaps?.length ?? 0,
           isolatedCount: gapReport.isolatedNodes?.length ?? 0
@@ -6046,7 +6104,8 @@ function createApiServer(options) {
       }
       let dupCount = 0;
       try {
-        const pairs = await detectDuplicates(store, 0.88, 50);
+        const { detectDuplicates: detectDuplicates2 } = await Promise.resolve().then(() => (init_duplicate_detector(), duplicate_detector_exports));
+        const pairs = await detectDuplicates2(store, 0.88, 50);
         dupCount = pairs.length;
       } catch (e) {
         console.error("[health] Duplicate detection failed:", e instanceof Error ? e.message : e);
@@ -6243,6 +6302,10 @@ function createApiServer(options) {
   };
 }
 
+// packages/core/dist/index.js
+init_duplicate_detector();
+init_gap_detector();
+
 // packages/core/dist/intelligence/contradiction-detector.js
 var NEGATION_PAIRS = [
   ["should", "should not"],
@@ -6360,6 +6423,8 @@ init_ask_engine();
 init_wiki_compiler();
 
 // packages/core/dist/intelligence/knowledge-lint.js
+init_gap_detector();
+init_duplicate_detector();
 async function lintKnowledge(store) {
   const issues = [];
   const suggestions = [];
@@ -9564,7 +9629,7 @@ if (nodeVersion < 20) {
   process.exit(1);
 }
 var program = new Command();
-var SV_VERSION = true ? "0.7.0" : "0.0.0-dev";
+var SV_VERSION = true ? "0.7.1" : "0.0.0-dev";
 program.name("stellavault").description("Stellavault \u2014 Self-compiling knowledge base for your Obsidian vault").version(SV_VERSION).option("--json", "Output in JSON format (for scripting)").option("--quiet", "Suppress non-essential output");
 program.command("init").description("Interactive setup wizard \u2014 get started in 3 minutes").action(initCommand);
 program.command("doctor").description("Diagnose setup issues (config, vault, DB, model, Node version)").action(doctorCommand);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "stellavault",
-  "version": "0.7.0",
+  "version": "0.7.1",
   "description": "Drop anything. It compiles itself into knowledge. Claude remembers everything you know. Local-first MCP server, vault files never modified.",
   "repository": {
     "type": "git",