ruvector 0.2.22 → 0.2.25

package/README.md

@@ -10,7 +10,7 @@
 
 **The fastest vector database for Node.js—built in Rust, runs everywhere**
 
-Ruvector is a self-learning vector database with **enterprise-grade semantic search**, hybrid retrieval (sparse + dense), Graph RAG, FlashAttention-3, and billion-scale DiskANN — all in a single npm package. Unlike cloud-only solutions or Python-first databases, Ruvector is designed for JavaScript/TypeScript developers who need **blazing-fast vector search** without external services.
+Ruvector is a self-learning vector database with **enterprise-grade semantic search**, hybrid retrieval (sparse + dense), Graph RAG, FlashAttention-3, and DiskANN — all in a single npm package. Unlike cloud-only solutions or Python-first databases, Ruvector is designed for JavaScript/TypeScript developers who need **blazing-fast vector search** without external services.
 
 > 🚀 **Sub-millisecond queries** • 🎯 **52,000+ inserts/sec** • 💾 **~50 bytes per vector** • 🌍 **Runs anywhere** • 🧠 **859 tests passing**
 
@@ -40,7 +40,7 @@ npx ruvector hooks init --pretrain --build-agents quality
 - **FlashAttention-3** — IO-aware tiled attention, O(N) memory instead of O(N^2)
 - **Graph RAG** — Knowledge graph + community detection for multi-hop queries (30-60% improvement)
 - **Hybrid Search** — Sparse + dense vectors with RRF fusion (20-49% better retrieval)
-- **DiskANN / Vamana** — Billion-scale SSD-backed ANN with <10ms latency
+- **DiskANN / Vamana** — SSD-friendly ANN graph with PQ compression for large-scale search
 - **ColBERT Multi-Vector** — Per-token late interaction retrieval (MaxSim)
 - **Matryoshka Embeddings** — Adaptive-dimension search with funnel/cascade modes
 - **MLA** — Multi-Head Latent Attention with ~93% KV-cache compression (DeepSeek-V2/V3)

package/bin/cli.js

@@ -125,6 +125,21 @@ const program = new Command();
 // Get package version from package.json
 const packageJson = require('../package.json');
 
+// `@ruvector/gnn@0.1.25` has a native-binding regression where every method
+// throws `Given napi value is not an array` regardless of input shape (verified
+// with both Array<Float32Array> and number[][]). Use this helper to print a
+// pointer to the upstream issue when the CLI-side typed-array conversion is
+// already correct.
+function reportGnnBindingError(error) {
+  const msg = error && error.message ? error.message : String(error);
+  console.error(chalk.red(msg));
+  if (msg.includes('Given napi value is not an array') || msg.includes('TypedArray info failed')) {
+    console.error(chalk.yellow('  Note: this is a known regression in the @ruvector/gnn native binding,'));
+    console.error(chalk.yellow('  not in the CLI. Track at:'));
+    console.error(chalk.white('    https://github.com/ruvnet/ruvector/issues/402'));
+  }
+}
+
 // Version and description (lazy load implementation info)
 program
   .name('ruvector')
@@ -758,13 +773,16 @@ gnnCmd
       if (options.test) {
         spinner.start('Running test forward pass...');
 
-        // Create test data
-        const nodeEmbedding = Array.from({ length: inputDim }, () => Math.random());
-        const neighborEmbeddings = [
-          Array.from({ length: inputDim }, () => Math.random()),
-          Array.from({ length: inputDim }, () => Math.random())
-        ];
-        const edgeWeights = [0.6, 0.4];
+        // The @ruvector/gnn binding requires Float32Array — plain number[] surfaces
+        // as `Get TypedArray info failed` from napi-rs.
+        const randVec = (n) => {
+          const v = new Float32Array(n);
+          for (let i = 0; i < n; i++) v[i] = Math.random();
+          return v;
+        };
+        const nodeEmbedding = randVec(inputDim);
+        const neighborEmbeddings = [randVec(inputDim), randVec(inputDim)];
+        const edgeWeights = new Float32Array([0.6, 0.4]);
 
         const output = layer.forward(nodeEmbedding, neighborEmbeddings, edgeWeights);
         spinner.succeed(chalk.green('Forward pass completed'));
@@ -782,7 +800,7 @@ gnnCmd
       }
     } catch (error) {
       spinner.fail(chalk.red('Failed to create GNN layer'));
-      console.error(chalk.red(error.message));
+      reportGnnBindingError(error);
       process.exit(1);
     }
   });
@@ -812,7 +830,9 @@ gnnCmd
       let totalCompressedSize = 0;
 
       for (const embedding of embeddings) {
-        const vec = embedding.vector || embedding;
+        const rawVec = embedding.vector || embedding;
+        // TensorCompress requires Float32Array.
+        const vec = rawVec instanceof Float32Array ? rawVec : new Float32Array(rawVec);
         totalOriginalSize += vec.length * 4; // float32 = 4 bytes
 
         let compressed;
@@ -855,7 +875,7 @@ gnnCmd
       }
     } catch (error) {
       spinner.fail(chalk.red('Failed to compress embeddings'));
-      console.error(chalk.red(error.message));
+      reportGnnBindingError(error);
       process.exit(1);
     }
   });
@@ -875,12 +895,18 @@ gnnCmd
     try {
       const query = JSON.parse(options.query);
       const candidatesData = JSON.parse(fs.readFileSync(options.candidates, 'utf8'));
-      const candidates = candidatesData.map(c => c.vector || c);
+      // @ruvector/gnn's differentiableSearch needs Float32Array everywhere; plain
+      // number[] surfaces as napi-rs `Get TypedArray info failed`.
+      const queryVec = query instanceof Float32Array ? query : new Float32Array(query);
+      const candidates = candidatesData.map((c) => {
+        const v = c.vector || c;
+        return v instanceof Float32Array ? v : new Float32Array(v);
+      });
       const k = parseInt(options.topK);
       const temperature = parseFloat(options.temperature);
 
       spinner.text = 'Running differentiable search...';
-      const result = differentiableSearch(query, candidates, k, temperature);
+      const result = differentiableSearch(queryVec, candidates, k, temperature);
 
       spinner.succeed(chalk.green(`Found top-${k} results`));
 
@@ -889,17 +915,19 @@ gnnCmd
       console.log(chalk.white(`  Candidates:    ${chalk.yellow(candidates.length)}`));
       console.log(chalk.white(`  Temperature:   ${chalk.yellow(temperature)}`));
 
+      // The wrapper exposes `weights`; older native shape used `attention_weights`.
+      const weights = result.weights || result.attention_weights || [];
       console.log(chalk.cyan('\nTop-K Results:'));
       for (let i = 0; i < result.indices.length; i++) {
         const idx = result.indices[i];
-        const weight = result.weights[i];
+        const weight = weights[i];
         const id = candidatesData[idx]?.id || `candidate_${idx}`;
         console.log(chalk.white(`  ${i + 1}. ${chalk.yellow(id)} (index: ${idx})`));
-        console.log(chalk.gray(`     Weight: ${weight.toFixed(6)}`));
+        console.log(chalk.gray(`     Weight: ${weight != null ? weight.toFixed(6) : 'n/a'}`));
       }
     } catch (error) {
       spinner.fail(chalk.red('Failed to run search'));
-      console.error(chalk.red(error.message));
+      reportGnnBindingError(error);
       process.exit(1);
     }
   });
@@ -971,59 +999,60 @@ attentionCmd
     const spinner = ora('Loading keys...').start();
 
     try {
-      const query = JSON.parse(options.query);
+      const queryRaw = JSON.parse(options.query);
       const keysData = JSON.parse(fs.readFileSync(options.keys, 'utf8'));
-      const keys = keysData.map(k => k.vector || k);
+      // The native @ruvector/attention bindings require Float32Array; passing
+      // plain number[] surfaces as napi-rs `Get TypedArray info failed` or
+      // (when dim is read off a missing arg) `... Undefined into rust type u32`.
+      const toF32 = (v) => (v instanceof Float32Array ? v : new Float32Array(v));
+      const query = toF32(queryRaw);
+      const keys = keysData.map((k) => toF32(k.vector || k));
 
       let values = keys;
       if (options.values) {
         const valuesData = JSON.parse(fs.readFileSync(options.values, 'utf8'));
-        values = valuesData.map(v => v.vector || v);
+        values = valuesData.map((v) => toF32(v.vector || v));
       }
 
+      const dim = query.length;
+
       spinner.text = `Computing ${options.type} attention...`;
 
       let result;
       let attentionWeights;
 
+      // The native @ruvector/attention bindings expose `compute(query, keys, values)`
+      // — a flat Float32Array query plus Float32Array[] keys/values, returning a
+      // flat Float32Array. The older CLI invoked `forward([query], keys, values)`,
+      // which doesn't exist on the current binding (issue #402 §B).
       switch (options.type) {
         case 'dot': {
-          const attn = new DotProductAttention();
-          const queryMat = [query];
-          const output = attn.forward(queryMat, keys, values);
-          result = output[0];
-          attentionWeights = attn.getLastWeights ? attn.getLastWeights()[0] : null;
+          const attn = new DotProductAttention(dim);
+          result = attn.compute(query, keys, values);
+          attentionWeights = attn.getLastWeights ? attn.getLastWeights() : null;
           break;
         }
         case 'multi-head': {
           const numHeads = parseInt(options.heads);
           const headDim = parseInt(options.headDim);
-          const attn = new MultiHeadAttention(query.length, numHeads, headDim);
-          const queryMat = [query];
-          const output = attn.forward(queryMat, keys, values);
-          result = output[0];
+          const attn = new MultiHeadAttention(dim, numHeads, headDim);
+          result = attn.compute(query, keys, values);
           break;
         }
         case 'flash': {
-          const attn = new FlashAttention(query.length);
-          const queryMat = [query];
-          const output = attn.forward(queryMat, keys, values);
-          result = output[0];
+          const attn = new FlashAttention(dim);
+          result = attn.compute(query, keys, values);
           break;
         }
         case 'hyperbolic': {
           const curvature = parseFloat(options.curvature);
-          const attn = new HyperbolicAttention(query.length, curvature);
-          const queryMat = [query];
-          const output = attn.forward(queryMat, keys, values);
-          result = output[0];
+          const attn = new HyperbolicAttention(dim, curvature);
+          result = attn.compute(query, keys, values);
           break;
         }
         case 'linear': {
-          const attn = new LinearAttention(query.length);
-          const queryMat = [query];
-          const output = attn.forward(queryMat, keys, values);
-          result = output[0];
+          const attn = new LinearAttention(dim);
+          result = attn.compute(query, keys, values);
           break;
         }
         default:
@@ -1619,7 +1648,8 @@ program
       console.log(chalk.white('  cargo add ruvector-raft          # Raft consensus'));
       console.log(chalk.white('  cargo add ruvector-replication   # Data replication'));
       console.log(chalk.white('  cargo add ruvector-tiny-dancer-core  # AI routing'));
-      console.log(chalk.white('  cargo add ruvector-router-core   # Semantic routing'));
+      console.log(chalk.white('  cargo add ruvector-router-core       # Semantic routing (Rust crate)'));
+      console.log(chalk.white('  npm install @ruvector/router         # Semantic routing (npm)'));
       console.log('');
 
       console.log(chalk.yellow('Platform-specific notes:'));
@@ -1737,7 +1767,7 @@ program
 
 program
   .command('router')
-  .description('AI semantic router operations (requires ruvector-router-core)')
+  .description('AI semantic router operations (requires @ruvector/router)')
   .option('--route <text>', 'Route text to best matching intent')
   .option('--intents <file>', 'Load intents from JSON file')
   .option('--add-intent <name>', 'Add new intent')
@@ -1758,8 +1788,9 @@ program
       console.log(chalk.gray('    - Vector-based similarity matching'));
       console.log('');
       console.log(chalk.cyan('  Status:'), chalk.yellow('Coming Soon'));
-      console.log(chalk.gray('  The npm package for router is in development.'));
-      console.log(chalk.gray('  Rust crate available: cargo add ruvector-router-core'));
+      console.log(chalk.gray('  The router subcommand integration is still in development.'));
+      console.log(chalk.gray('  npm package:  npm install @ruvector/router'));
+      console.log(chalk.gray('  Rust crate:   cargo add ruvector-router-core'));
       console.log('');
       console.log(chalk.cyan('  Usage (when available):'));
       console.log(chalk.white('    npx ruvector router --route "What is the weather?"'));
@@ -2534,13 +2565,15 @@ program
       const spinner = ora('Creating demo database...').start();
 
       try {
-        const db = new VectorDB({ dimensions: 4, metric: 'cosine' });
+        const db = new VectorDB({ dimensions: 4, distanceMetric: 'cosine' });
 
         spinner.text = 'Inserting vectors...';
-        db.insert('vec1', [1.0, 0.0, 0.0, 0.0], { label: 'x-axis' });
-        db.insert('vec2', [0.0, 1.0, 0.0, 0.0], { label: 'y-axis' });
-        db.insert('vec3', [0.0, 0.0, 1.0, 0.0], { label: 'z-axis' });
-        db.insert('vec4', [0.7, 0.7, 0.0, 0.0], { label: 'xy-diagonal' });
+        // VectorDBWrapper.insert takes a single object: { id?, vector, metadata? }.
+        // Wrap to Float32Array so the native binding sees the right typed array.
+        await db.insert({ id: 'vec1', vector: new Float32Array([1.0, 0.0, 0.0, 0.0]), metadata: { label: 'x-axis' } });
+        await db.insert({ id: 'vec2', vector: new Float32Array([0.0, 1.0, 0.0, 0.0]), metadata: { label: 'y-axis' } });
+        await db.insert({ id: 'vec3', vector: new Float32Array([0.0, 0.0, 1.0, 0.0]), metadata: { label: 'z-axis' } });
+        await db.insert({ id: 'vec4', vector: new Float32Array([0.7, 0.7, 0.0, 0.0]), metadata: { label: 'xy-diagonal' } });
 
         spinner.succeed('Demo database created with 4 vectors');
 
@@ -2551,7 +2584,7 @@ program
         console.log(chalk.gray('    vec4: [0.7,0.7,0,0] - xy-diagonal'));
 
         console.log(chalk.cyan('\n  Searching for nearest to [0.8, 0.6, 0, 0]:'));
-        const results = db.search([0.8, 0.6, 0.0, 0.0], 3);
+        const results = await db.search({ vector: new Float32Array([0.8, 0.6, 0.0, 0.0]), k: 3 });
         results.forEach((r, i) => {
           console.log(chalk.gray(`    ${i + 1}. ${r.id} (score: ${r.score.toFixed(4)})`));
         });
@@ -2577,20 +2610,26 @@ program
       try {
         console.log(chalk.cyan('  Running differentiable search with gradients...\n'));
 
-        const queryVec = [1.0, 0.5, 0.3, 0.1];
+        // The native @ruvector/gnn binding expects Float32Array typed arrays.
+        const queryVec = new Float32Array([1.0, 0.5, 0.3, 0.1]);
         const dbVectors = [
-          [1.0, 0.0, 0.0, 0.0],
-          [0.0, 1.0, 0.0, 0.0],
-          [0.5, 0.5, 0.5, 0.5],
-          [0.9, 0.4, 0.2, 0.1]
+          new Float32Array([1.0, 0.0, 0.0, 0.0]),
+          new Float32Array([0.0, 1.0, 0.0, 0.0]),
+          new Float32Array([0.5, 0.5, 0.5, 0.5]),
+          new Float32Array([0.9, 0.4, 0.2, 0.1]),
         ];
 
         const result = differentiableSearch(queryVec, dbVectors, 3, 10.0);
 
-        console.log(chalk.cyan('  Query:'), JSON.stringify(queryVec));
+        // The wrapper returns `{ indices, weights }`; older binding versions
+        // exposed `attention_weights` instead.
+        const weights = result.weights || result.attention_weights || [];
+
+        console.log(chalk.cyan('  Query:'), JSON.stringify(Array.from(queryVec)));
         console.log(chalk.cyan('  Top 3 results:'));
         result.indices.forEach((idx, i) => {
-          console.log(chalk.gray(`    ${i + 1}. Index ${idx} (attention: ${result.attention_weights[i].toFixed(4)})`));
+          const w = weights[i] != null ? weights[i].toFixed(4) : 'n/a';
+          console.log(chalk.gray(`    ${i + 1}. Index ${idx} (attention: ${w})`));
         });
 
         console.log(chalk.cyan('\n  Gradient flow enabled:'), chalk.green('Yes'));
@@ -2598,7 +2637,19 @@ program
 
         console.log(chalk.green('\n  GNN demo complete!'));
       } catch (error) {
-        console.error(chalk.red('GNN demo failed:', error.message));
+        // `@ruvector/gnn@0.1.25`'s native binding has a regression where every
+        // method throws `Given napi value is not an array`, regardless of the
+        // input shape (verified with both Array<Float32Array> and number[][]).
+        // Surface that explicitly so users don't think it's their CLI install.
+        const msg = error && error.message ? error.message : String(error);
+        if (msg.includes('not an array') || msg.includes('TypedArray')) {
+          console.error(chalk.red(`  GNN demo failed: ${msg}`));
+          console.error(chalk.yellow('\n  This looks like a regression in the @ruvector/gnn native binding,'));
+          console.error(chalk.yellow('  not in the CLI. Tracking at:'));
+          console.error(chalk.white('    https://github.com/ruvnet/ruvector/issues/402'));
+        } else {
+          console.error(chalk.red('GNN demo failed:', msg));
+        }
       }
     }
 
@@ -2608,18 +2659,111 @@ program
       let graphNode;
       try {
         graphNode = require('@ruvector/graph-node');
-        console.log(chalk.green('  @ruvector/graph-node is available!'));
-        console.log(chalk.gray('  Full graph demo coming soon.'));
       } catch (e) {
         console.log(chalk.yellow('  @ruvector/graph-node not installed.'));
         console.log(chalk.white('  Install with: npm install @ruvector/graph-node'));
+        console.log('');
+        return;
+      }
+
+      try {
+        // The current binding exposes a `GraphDatabase` class (not Graph /
+        // HyperGraph / RuVectorGraph) with createNode / createEdge / query.
+        const GraphDatabase = graphNode.GraphDatabase;
+        if (typeof GraphDatabase !== 'function') {
+          console.log(chalk.yellow('  @ruvector/graph-node has no GraphDatabase constructor.'));
+          console.log(chalk.gray(`    Available exports: ${Object.keys(graphNode).join(', ')}`));
+          return;
+        }
+
+        const g = new GraphDatabase();
+        console.log(chalk.green('  ✓ GraphDatabase instance created'));
+
+        // createNode / createEdge take a JsNode / JsEdge object (not positional
+        // args) and are async — see @ruvector/graph-node index.d.ts.
+        const aId = await g.createNode({
+          id: 'alice',
+          embedding: new Float32Array([1, 0, 0, 0]),
+          properties: { name: 'Alice', label: 'Person' },
+        });
+        const bId = await g.createNode({
+          id: 'bob',
+          embedding: new Float32Array([0, 1, 0, 0]),
+          properties: { name: 'Bob', label: 'Person' },
+        });
+        console.log(chalk.green(`  ✓ Created nodes: Alice (${aId}), Bob (${bId})`));
+
+        const edgeId = await g.createEdge({
+          from: 'alice',
+          to: 'bob',
+          description: 'KNOWS',
+          embedding: new Float32Array([0.5, 0.5, 0, 0]),
+          confidence: 0.95,
+        });
+        console.log(chalk.green(`  ✓ Created edge Alice -[:KNOWS]-> Bob (${edgeId})`));
+
+        const stats = g.stats();
+        console.log(chalk.gray(`    Stats: ${typeof stats === 'string' ? stats : JSON.stringify(stats)}`));
+
+        console.log(chalk.green('\n  Graph demo complete!'));
+      } catch (error) {
+        // The createNode/createEdge signatures vary across binding versions
+        // (some take (label, propsJson), some take (label, propsObject)).
+        // Print enough context that the user can adapt without guessing.
+        console.error(chalk.red(`  Graph demo failed: ${error.message}`));
+        const G = graphNode && graphNode.GraphDatabase;
+        if (G) {
+          const methods = Object.getOwnPropertyNames(G.prototype || {}).filter((m) => m !== 'constructor');
+          console.error(chalk.gray(`    GraphDatabase prototype: ${methods.join(', ')}`));
+        }
       }
       console.log('');
     }
 
     if (options.benchmark) {
-      console.log(chalk.yellow('  Redirecting to benchmark command...\n'));
-      console.log(chalk.white('  Run: npx ruvector benchmark'));
+      requireRuvector();
+      console.log(chalk.yellow('  Mini Benchmark Demo\n'));
+
+      try {
+        // Note: ruvector-core-linux-x64-gnu@0.1.29 (and current sister binaries)
+        // has a regression where the `dimensions` constructor arg is ignored
+        // and inserts are pinned to dim=4. Tracking at issue #402. Keeping the
+        // demo at dim=4 so it completes; once the binding is rebuilt from
+        // current source, this can scale up.
+        const dim = 4;
+        const n = 1000;
+        const k = 10;
+        const db = new VectorDB({ dimensions: dim, distanceMetric: 'cosine' });
+
+        console.log(chalk.cyan(`  Generating ${n} random ${dim}-dim vectors...`));
+        const t0 = Date.now();
+        const entries = [];
+        for (let i = 0; i < n; i++) {
+          const v = new Float32Array(dim);
+          for (let j = 0; j < dim; j++) v[j] = Math.random();
+          entries.push({ id: `v${i}`, vector: v });
+        }
+        const insertStart = Date.now();
+        for (const entry of entries) await db.insert(entry);
+        const insertMs = Date.now() - insertStart;
+
+        const queryVec = new Float32Array(dim);
+        for (let j = 0; j < dim; j++) queryVec[j] = Math.random();
+
+        const searchStart = Date.now();
+        const iters = 100;
+        for (let i = 0; i < iters; i++) {
+          await db.search({ vector: queryVec, k });
+        }
+        const searchMs = Date.now() - searchStart;
+
+        console.log(chalk.green(`\n  ✓ Inserted ${n} vectors in ${insertMs}ms (${(insertMs / n).toFixed(2)}ms/vec)`));
+        console.log(chalk.green(`  ✓ ${iters}× top-${k} search in ${searchMs}ms (${(searchMs / iters).toFixed(2)}ms/query)`));
+        console.log(chalk.gray(`  Wall time: ${Date.now() - t0}ms`));
+        console.log(chalk.gray('  For deeper benchmarks: npx ruvector benchmark'));
+      } catch (error) {
+        console.error(chalk.red(`  Benchmark demo failed: ${error.message}`));
+      }
       console.log('');
     }
   });
@@ -9119,10 +9263,14 @@ const optimizeCmd = program.command('optimize')
   .action(async (opts) => {
     let optimizerMod;
     try {
+      // Resolve via package.json so it works whether the optimizer ships under
+      // src/optimizer/ or dist/optimizer/.
       optimizerMod = require('../src/optimizer/index.js');
     } catch (e) {
-      console.error(chalk.red('Error: Failed to load optimizer module.'));
-      console.error(chalk.dim(`  ${e.message}`));
+      console.error(chalk.yellow('\n  ruvector optimize: not yet shipped in this release.\n'));
+      console.error(chalk.gray('  The optimizer module (profiles, settings generation) is in development'));
+      console.error(chalk.gray('  and will land in a future release. Track progress at:'));
+      console.error(chalk.white('    https://github.com/ruvnet/ruvector/issues/401\n'));
       process.exit(1);
     }
 

package/dist/core/diskann-wrapper.d.ts

@@ -0,0 +1,53 @@
+/**
+ * DiskANN Wrapper — Vamana graph ANN for billion-scale vector search
+ *
+ * Wraps @ruvector/diskann for SSD-friendly approximate nearest neighbor search.
+ * Provides the same lazy-load pattern as other native wrappers.
+ */
+export declare function isDiskAnnAvailable(): boolean;
+export interface DiskAnnConfig {
+    dim: number;
+    maxDegree?: number;
+    buildBeam?: number;
+    searchBeam?: number;
+    alpha?: number;
+    pqSubspaces?: number;
+    pqIterations?: number;
+    storagePath?: string;
+}
+export interface DiskAnnSearchResult {
+    id: string;
+    distance: number;
+}
+/**
+ * DiskANN index for large-scale approximate nearest neighbor search.
+ *
+ * Uses the Vamana graph algorithm with optional Product Quantization.
+ * Build after all inserts, then search.
+ */
+export declare class DiskAnnIndex {
+    private inner;
+    constructor(config: DiskAnnConfig);
+    /** Insert a vector with a string ID */
+    insert(id: string, vector: Float32Array | number[]): void;
+    /** Insert a batch of vectors (flat Float32Array: N * dim) */
+    insertBatch(ids: string[], vectors: Float32Array, dim: number): void;
+    /** Build the Vamana graph index (required before search) */
+    build(): void;
+    /** Build index asynchronously */
+    buildAsync(): Promise<void>;
+    /** Search for k nearest neighbors */
+    search(query: Float32Array | number[], k?: number): DiskAnnSearchResult[];
+    /** Search asynchronously */
+    searchAsync(query: Float32Array | number[], k?: number): Promise<DiskAnnSearchResult[]>;
+    /** Delete a vector by ID */
+    delete(id: string): boolean;
+    /** Get the number of vectors */
+    count(): number;
+    /** Save index to directory */
+    save(dir: string): void;
+    /** Load index from directory */
+    static load(dir: string): DiskAnnIndex;
+}
+export default DiskAnnIndex;
+//# sourceMappingURL=diskann-wrapper.d.ts.map

package/dist/core/diskann-wrapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diskann-wrapper.d.ts","sourceRoot":"","sources":["../../src/core/diskann-wrapper.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAqBH,wBAAgB,kBAAkB,IAAI,OAAO,CAO5C;AAED,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,MAAM,CAAC;IACZ,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAmB;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;;;GAKG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAM;gBAEP,MAAM,EAAE,aAAa;IAcjC,uCAAuC;IACvC,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,GAAG,IAAI;IAKzD,6DAA6D;IAC7D,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI;IAIpE,4DAA4D;IAC5D,KAAK,IAAI,IAAI;IAIb,iCAAiC;IAC3B,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAIjC,qCAAqC;IACrC,MAAM,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,CAAC,GAAE,MAAW,GAAG,mBAAmB,EAAE;IAK7E,4BAA4B;IACtB,WAAW,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,EAAE,EAAE,CAAC,GAAE,MAAW,GAAG,OAAO,CAAC,mBAAmB,EAAE,CAAC;IAKjG,4BAA4B;IAC5B,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI3B,gCAAgC;IAChC,KAAK,IAAI,MAAM;IAIf,8BAA8B;IAC9B,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAIvB,gCAAgC;IAChC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,YAAY;CAMvC;AAED,eAAe,YAAY,CAAC"}

package/dist/core/diskann-wrapper.js

@@ -0,0 +1,105 @@
+"use strict";
+/**
+ * DiskANN Wrapper — Vamana graph ANN for billion-scale vector search
+ *
+ * Wraps @ruvector/diskann for SSD-friendly approximate nearest neighbor search.
+ * Provides the same lazy-load pattern as other native wrappers.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DiskAnnIndex = void 0;
+exports.isDiskAnnAvailable = isDiskAnnAvailable;
+let diskannModule = null;
+let loadError = null;
+function getDiskAnnModule() {
+    if (diskannModule)
+        return diskannModule;
+    if (loadError)
+        throw loadError;
+    try {
+        diskannModule = require('@ruvector/diskann');
+        return diskannModule;
+    }
+    catch (e) {
+        loadError = new Error(`@ruvector/diskann not installed: ${e.message}\n` +
+            `Install with: npm install @ruvector/diskann`);
+        throw loadError;
+    }
+}
+function isDiskAnnAvailable() {
+    try {
+        getDiskAnnModule();
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * DiskANN index for large-scale approximate nearest neighbor search.
+ *
+ * Uses the Vamana graph algorithm with optional Product Quantization.
+ * Build after all inserts, then search.
+ */
+class DiskAnnIndex {
+    constructor(config) {
+        const mod = getDiskAnnModule();
+        this.inner = new mod.DiskAnn({
+            dim: config.dim,
+            maxDegree: config.maxDegree ?? 64,
+            buildBeam: config.buildBeam ?? 128,
+            searchBeam: config.searchBeam ?? 64,
+            alpha: config.alpha ?? 1.2,
+            pqSubspaces: config.pqSubspaces ?? 0,
+            pqIterations: config.pqIterations ?? 10,
+            storagePath: config.storagePath,
+        });
+    }
+    /** Insert a vector with a string ID */
+    insert(id, vector) {
+        const v = vector instanceof Float32Array ? vector : new Float32Array(vector);
+        this.inner.insert(id, v);
+    }
+    /** Insert a batch of vectors (flat Float32Array: N * dim) */
+    insertBatch(ids, vectors, dim) {
+        this.inner.insertBatch(ids, vectors, dim);
+    }
+    /** Build the Vamana graph index (required before search) */
+    build() {
+        this.inner.build();
+    }
+    /** Build index asynchronously */
+    async buildAsync() {
+        return this.inner.buildAsync();
+    }
+    /** Search for k nearest neighbors */
+    search(query, k = 10) {
+        const q = query instanceof Float32Array ? query : new Float32Array(query);
+        return this.inner.search(q, k);
+    }
+    /** Search asynchronously */
+    async searchAsync(query, k = 10) {
+        const q = query instanceof Float32Array ? query : new Float32Array(query);
+        return this.inner.searchAsync(q, k);
+    }
+    /** Delete a vector by ID */
+    delete(id) {
+        return this.inner.delete(id);
+    }
+    /** Get the number of vectors */
+    count() {
+        return this.inner.count();
+    }
+    /** Save index to directory */
+    save(dir) {
+        this.inner.save(dir);
+    }
+    /** Load index from directory */
+    static load(dir) {
+        const mod = getDiskAnnModule();
+        const instance = new DiskAnnIndex({ dim: 1 }); // placeholder
+        instance.inner = mod.DiskAnn.load(dir);
+        return instance;
+    }
+}
+exports.DiskAnnIndex = DiskAnnIndex;
+exports.default = DiskAnnIndex;

package/dist/core/index.d.ts

@@ -26,6 +26,7 @@ export * from './adaptive-embedder';
 export * from './neural-embeddings';
 export * from './neural-perf';
 export * from './rvf-wrapper';
+export * from './diskann-wrapper';
 export * from '../analysis';
 export { default as gnnWrapper } from './gnn-wrapper';
 export { default as attentionFallbacks } from './attention-fallbacks';
@@ -45,4 +46,5 @@ export { default as TensorCompress } from './tensor-compress';
 export { default as LearningEngine } from './learning-engine';
 export { default as AdaptiveEmbedder } from './adaptive-embedder';
 export { default as NeuralSubstrate } from './neural-embeddings';
+export { default as DiskAnnIndex } from './diskann-wrapper';
 //# sourceMappingURL=index.d.ts.map

package/dist/core/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,iBAAiB,CAAC;AAChC,cAAc,kBAAkB,CAAC;AACjC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,cAAc,CAAC;AAC7B,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAG9B,cAAc,aAAa,CAAC;AAG5B,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAE,OAAO,IAAI,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACpE,OAAO,EAAE,OAAO,IAAI,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC1E,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAC7D,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AAGrD,OAAO,EAAE,UAAU,IAAI,SAAS,EAAE,MAAM,cAAc,CAAC;AAGvD,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,OAAO,IAAI,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAClE,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,qBAAqB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/core/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,cAAc,eAAe,CAAC;AAC9B,cAAc,uBAAuB,CAAC;AACtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,iBAAiB,CAAC;AAChC,cAAc,kBAAkB,CAAC;AACjC,cAAc,yBAAyB,CAAC;AACxC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC;AAChC,cAAc,mBAAmB,CAAC;AAClC,cAAc,cAAc,CAAC;AAC7B,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,eAAe,CAAC;AAC9B,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAGlC,cAAc,aAAa,CAAC;AAG5B,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,gBAAgB,CAAC;AACxD,OAAO,EAAE,OAAO,IAAI,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AACtE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC1D,OAAO,EAAE,OAAO,IAAI,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACpE,OAAO,EAAE,OAAO,IAAI,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC1E,OAAO,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAC7D,OAAO,EAAE,OAAO,IAAI,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,OAAO,IAAI,UAAU,EAAE,MAAM,cAAc,CAAC;AAGrD,OAAO,EAAE,UAAU,IAAI,SAAS,EAAE,MAAM,cAAc,CAAC;AAGvD,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,OAAO,IAAI,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,OAAO,IAAI,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAClE,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACjE,OAAO,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/core/index.js

@@ -23,7 +23,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.NeuralSubstrate = exports.AdaptiveEmbedder = exports.LearningEngine = exports.TensorCompress = exports.ASTParser = exports.CodeParser = exports.RuvectorCluster = exports.CodeGraph = exports.SemanticRouter = exports.ExtendedWorkerPool = exports.ParallelIntelligence = exports.OptimizedOnnxEmbedder = exports.OnnxEmbedder = exports.IntelligenceEngine = exports.Sona = exports.agentdbFast = exports.attentionFallbacks = exports.gnnWrapper = void 0;
+exports.DiskAnnIndex = exports.NeuralSubstrate = exports.AdaptiveEmbedder = exports.LearningEngine = exports.TensorCompress = exports.ASTParser = exports.CodeParser = exports.RuvectorCluster = exports.CodeGraph = exports.SemanticRouter = exports.ExtendedWorkerPool = exports.ParallelIntelligence = exports.OptimizedOnnxEmbedder = exports.OnnxEmbedder = exports.IntelligenceEngine = exports.Sona = exports.agentdbFast = exports.attentionFallbacks = exports.gnnWrapper = void 0;
 __exportStar(require("./gnn-wrapper"), exports);
 __exportStar(require("./attention-fallbacks"), exports);
 __exportStar(require("./agentdb-fast"), exports);
@@ -46,6 +46,7 @@ __exportStar(require("./adaptive-embedder"), exports);
 __exportStar(require("./neural-embeddings"), exports);
 __exportStar(require("./neural-perf"), exports);
 __exportStar(require("./rvf-wrapper"), exports);
+__exportStar(require("./diskann-wrapper"), exports);
 // Analysis module (consolidated security, complexity, patterns)
 __exportStar(require("../analysis"), exports);
 // Re-export default objects for convenience
@@ -87,3 +88,5 @@ var adaptive_embedder_1 = require("./adaptive-embedder");
 Object.defineProperty(exports, "AdaptiveEmbedder", { enumerable: true, get: function () { return __importDefault(adaptive_embedder_1).default; } });
 var neural_embeddings_1 = require("./neural-embeddings");
 Object.defineProperty(exports, "NeuralSubstrate", { enumerable: true, get: function () { return __importDefault(neural_embeddings_1).default; } });
+var diskann_wrapper_1 = require("./diskann-wrapper");
+Object.defineProperty(exports, "DiskAnnIndex", { enumerable: true, get: function () { return __importDefault(diskann_wrapper_1).default; } });

package/dist/core/parallel-workers.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"parallel-workers.d.ts","sourceRoot":"","sources":["../../src/core/parallel-workers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAQH,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAMvD,MAAM,WAAW,gBAAgB;IAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAGD,YAAY,EAAE,eAAe,EAAE,CAAC;AAEhC,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,KAAK,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;KAChB,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB;AA+BD,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,SAAS,CAKT;IACR,OAAO,CAAC,WAAW,CAAkC;IACrD,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,gBAAgB,CAAgD;IACxE,OAAO,CAAC,QAAQ,CAAuC;gBAE3C,MAAM,GAAE,gBAAqB;IAYnC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAgC3B,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,iBAAiB;IAqUzB,OAAO,CAAC,kBAAkB;IAmB1B,OAAO,CAAC,YAAY;YAWN,OAAO;IAsCrB;;;OAGG;IACG,gBAAgB,CACpB,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GACjC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IA4BlC;;;OAGG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAoBzD;;;OAGG;IACG,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;QACtD,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,aAAa,EAAE,MAAM,CAAC;QACtB,oBAAoB,EAAE,MAAM,CAAC;QAC7B,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC,CAAC;IAIH;;;OAGG;IACG,oBAAoB,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAQpF;;;OAGG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAQjF;;;OAGG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,IAAI,GAAE,MAAU,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAInG;;;OAGG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAI1H;;;OAGG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,SAAS,GAAE,MAAY,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAQ9E;;;OAGG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAIpD;;;OAGG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAQrE,QAAQ,IAAI;QACV,OAAO,EAAE,OAAO,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,oBAAoB,EAAE,MAAM,CAAC;QAC7B,YAAY,EAAE,MAAM,CAAC;KACtB;IAWD,WAAW,IAAI,IAAI;IAKb,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;CAchC;AAQD,wBAAgB,qBAAqB,CAAC,MAAM,CAAC,EAAE,gBAAgB,GAAG,kBAAkB,CAKnF;AAED,wBAAsB,sBAAsB,CAAC,MAAM,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAInG;AAED,eAAe,kBAAkB,CAAC"}
+{"version":3,"file":"parallel-workers.d.ts","sourceRoot":"","sources":["../../src/core/parallel-workers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AAQH,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAMvD,MAAM,WAAW,gBAAgB;IAC/B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAGD,YAAY,EAAE,eAAe,EAAE,CAAC;AAEhC,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,KAAK,CAAC;QACX,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;KAChB,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB;AA+BD,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,OAAO,CAAgB;IAC/B,OAAO,CAAC,SAAS,CAKT;IACR,OAAO,CAAC,WAAW,CAAkC;IACrD,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,gBAAgB,CAAgD;IACxE,OAAO,CAAC,QAAQ,CAAuC;gBAE3C,MAAM,GAAE,gBAAqB;IAYnC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAgC3B,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,iBAAiB;IAqbzB,OAAO,CAAC,kBAAkB;IAmB1B,OAAO,CAAC,YAAY;YAWN,OAAO;IAsCrB;;;OAGG;IACG,gBAAgB,CACpB,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GACjC,OAAO,CAAC,oBAAoB,EAAE,CAAC;IA4BlC;;;OAGG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAoBzD;;;OAGG;IACG,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;QACtD,IAAI,EAAE,MAAM,CAAC;QACb,KAAK,EAAE,MAAM,CAAC;QACd,aAAa,EAAE,MAAM,CAAC;QACtB,oBAAoB,EAAE,MAAM,CAAC;QAC7B,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC,CAAC;IAIH;;;OAGG;IACG,oBAAoB,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAQpF;;;OAGG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAQjF;;;OAGG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,IAAI,GAAE,MAAU,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAInG;;;OAGG;IACG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAI1H;;;OAGG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,SAAS,GAAE,MAAY,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAQ9E;;;OAGG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IAIpD;;;OAGG;IACG,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAQrE,QAAQ,IAAI;QACV,OAAO,EAAE,OAAO,CAAC;QACjB,OAAO,EAAE,MAAM,CAAC;QAChB,IAAI,EAAE,MAAM,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,oBAAoB,EAAE,MAAM,CAAC;QAC7B,YAAY,EAAE,MAAM,CAAC;KACtB;IAWD,WAAW,IAAI,IAAI;IAKb,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;CAchC;AAQD,wBAAgB,qBAAqB,CAAC,MAAM,CAAC,EAAE,gBAAgB,GAAG,kBAAkB,CAKnF;AAED,wBAAsB,sBAAsB,CAAC,MAAM,CAAC,EAAE,gBAAgB,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAInG;AAED,eAAe,kBAAkB,CAAC"}

package/dist/core/parallel-workers.js

@@ -173,9 +173,63 @@ class ExtendedWorkerPool {
       });
 
       // Worker implementations
+
+      // Hash-based embedding: deterministic, no external deps, 128-dim
+      function hashEmbed(text, dim = 128) {
+        const embedding = new Float64Array(dim);
+        const tokens = text.split(/\\s+|[{}()\\[\\];,.<>=/+\\-*&|!~^%@#]/);
+
+        for (let t = 0; t < tokens.length; t++) {
+          const token = tokens[t];
+          if (!token) continue;
+
+          // FNV-1a hash
+          let h = 0x811c9dc5;
+          for (let i = 0; i < token.length; i++) {
+            h ^= token.charCodeAt(i);
+            h = Math.imul(h, 0x01000193);
+          }
+
+          // Positional weight (tokens near start matter more)
+          const posWeight = 1.0 / (1.0 + Math.log1p(t));
+
+          // Distribute across multiple dimensions using hash rotations
+          for (let d = 0; d < 4; d++) {
+            const idx = ((h >>> 0) + d * 37) % dim;
+            const sign = (h & (1 << d)) ? 1 : -1;
+            embedding[idx] += sign * posWeight;
+            h = (h >>> 7) | (h << 25); // rotate
+          }
+        }
+
+        // L2 normalize
+        let norm = 0;
+        for (let i = 0; i < dim; i++) norm += embedding[i] * embedding[i];
+        norm = Math.sqrt(norm) || 1;
+        const result = new Array(dim);
+        for (let i = 0; i < dim; i++) result[i] = embedding[i] / norm;
+        return result;
+      }
+
       async function speculativeEmbed(files, coEditGraph) {
-        // Pre-compute embeddings for likely next files
-        return files.map(f => ({ file: f, embedding: [], confidence: 0.5 }));
+        const fs = require('fs');
+        return files.map(file => {
+          try {
+            if (!fs.existsSync(file)) {
+              return { file, embedding: hashEmbed(file), confidence: 0.2, timestamp: Date.now() };
+            }
+            const content = fs.readFileSync(file, 'utf8');
+            const embedding = hashEmbed(content);
+
+            // Confidence based on file size (more content = higher confidence)
+            const lines = content.split('\\n').length;
+            const confidence = Math.min(0.95, 0.3 + (lines / 500) * 0.65);
+
+            return { file, embedding, confidence, timestamp: Date.now() };
+          } catch {
+            return { file, embedding: hashEmbed(file), confidence: 0.1, timestamp: Date.now() };
+          }
+        });
       }
 
       async function astAnalyze(files) {
@@ -278,26 +332,84 @@ class ExtendedWorkerPool {
         return findings;
       }
 
+      function cosineSimilarity(a, b) {
+        if (!a || !b || a.length !== b.length || a.length === 0) 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;
+      }
+
       async function ragRetrieve(query, chunks, topK) {
-        // Simple keyword-based retrieval (would use embeddings in production)
-        const queryTerms = query.toLowerCase().split(/\\s+/);
+        // If chunks have embeddings, use cosine similarity (semantic retrieval)
+        const hasEmbeddings = chunks.some(c => c.embedding && c.embedding.length > 0);
+
+        if (hasEmbeddings) {
+          const queryEmbedding = hashEmbed(query, chunks[0].embedding.length);
+          return chunks
+            .map(chunk => {
+              const semantic = chunk.embedding && chunk.embedding.length > 0
+                ? cosineSimilarity(queryEmbedding, chunk.embedding)
+                : 0;
+              // Blend semantic + keyword for robustness
+              const queryTerms = query.toLowerCase().split(/\\s+/);
+              const content = chunk.content.toLowerCase();
+              const kwMatches = queryTerms.filter(t => content.includes(t)).length;
+              const keyword = queryTerms.length > 0 ? kwMatches / queryTerms.length : 0;
+              const relevance = semantic * 0.7 + keyword * 0.3;
+              return { ...chunk, relevance };
+            })
+            .sort((a, b) => b.relevance - a.relevance)
+            .slice(0, topK);
+        }
+
+        // Fallback: TF-IDF-weighted keyword matching
+        const queryTerms = query.toLowerCase().split(/\\s+/).filter(Boolean);
+        const allContent = chunks.map(c => c.content.toLowerCase());
+        // IDF: log(N / df) for each query term
+        const idf = {};
+        for (const term of queryTerms) {
+          const df = allContent.filter(c => c.includes(term)).length || 1;
+          idf[term] = Math.log(allContent.length / df);
+        }
         return chunks
           .map(chunk => {
             const content = chunk.content.toLowerCase();
-            const matches = queryTerms.filter(term => content.includes(term)).length;
-            return { ...chunk, relevance: matches / queryTerms.length };
+            const words = content.split(/\\s+/);
+            let score = 0;
+            for (const term of queryTerms) {
+              const tf = words.filter(w => w === term).length / (words.length || 1);
+              score += tf * (idf[term] || 1);
+            }
+            return { ...chunk, relevance: score };
           })
           .sort((a, b) => b.relevance - a.relevance)
           .slice(0, topK);
       }
 
       async function contextRank(context, query) {
-        const queryTerms = query.toLowerCase().split(/\\s+/);
+        // Use TF-IDF scoring instead of raw keyword matching
+        const queryTerms = query.toLowerCase().split(/\\s+/).filter(Boolean);
+        const allContent = context.map(c => c.toLowerCase());
+        const idf = {};
+        for (const term of queryTerms) {
+          const df = allContent.filter(c => c.includes(term)).length || 1;
+          idf[term] = Math.log(allContent.length / df);
+        }
         return context
           .map((ctx, i) => {
             const content = ctx.toLowerCase();
-            const matches = queryTerms.filter(term => content.includes(term)).length;
-            return { index: i, content: ctx, relevance: matches / queryTerms.length };
+            const words = content.split(/\\s+/);
+            let score = 0;
+            for (const term of queryTerms) {
+              const tf = words.filter(w => w === term).length / (words.length || 1);
+              score += tf * (idf[term] || 1);
+            }
+            return { index: i, content: ctx, relevance: score };
           })
           .sort((a, b) => b.relevance - a.relevance);
       }

package/dist/index.d.ts

@@ -45,6 +45,7 @@ declare class VectorDBWrapper {
         dimensions: number;
         storagePath?: string;
         distanceMetric?: string;
+        metric?: string;
         hnswConfig?: any;
     });
     /**

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,cAAc,SAAS,CAAC;AAGxB,cAAc,QAAQ,CAAC;AACvB,cAAc,YAAY,CAAC;AAE3B,QAAA,IAAI,cAAc,EAAE,GAAG,CAAC;AA4DxB;;GAEG;AACH,wBAAgB,qBAAqB,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,CAEjE;AAED;;GAEG;AACH,wBAAgB,QAAQ,IAAI,OAAO,CAElC;AAED;;GAEG;AACH,wBAAgB,KAAK,IAAI,OAAO,CAE/B;AAED;;GAEG;AACH,wBAAgB,MAAM,IAAI,OAAO,CAEhC;AAED;;GAEG;AACH,wBAAgB,UAAU,IAAI;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,cAAc,EAAE,MAAM,CAAA;CAAE,CAMxE;AAED;;GAEG;AACH,cAAM,eAAe;IACnB,OAAO,CAAC,EAAE,CAAM;gBAEJ,OAAO,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAAC,cAAc,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,GAAG,CAAA;KAAE;IAI5G;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IActH;;OAEG;IACG,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAUtI;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE;QAAE,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,YAAY,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,CAAC,CAAC;IAuB1N;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,GAAG,IAAI,CAAC;IAW5G;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAI1C;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC;IAI5B;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC;CAGlC;AAGD,eAAO,MAAM,QAAQ,wBAAkB,CAAC;AACxC,eAAO,MAAM,QAAQ,wBAAkB,CAAC;AAGxC,eAAO,MAAM,cAAc,KAA0B,CAAC;AAGtD,eAAe,cAAc,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,cAAc,SAAS,CAAC;AAGxB,cAAc,QAAQ,CAAC;AACvB,cAAc,YAAY,CAAC;AAE3B,QAAA,IAAI,cAAc,EAAE,GAAG,CAAC;AA4DxB;;GAEG;AACH,wBAAgB,qBAAqB,IAAI,QAAQ,GAAG,KAAK,GAAG,MAAM,CAEjE;AAED;;GAEG;AACH,wBAAgB,QAAQ,IAAI,OAAO,CAElC;AAED;;GAEG;AACH,wBAAgB,KAAK,IAAI,OAAO,CAE/B;AAED;;GAEG;AACH,wBAAgB,MAAM,IAAI,OAAO,CAEhC;AAED;;GAEG;AACH,wBAAgB,UAAU,IAAI;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,cAAc,EAAE,MAAM,CAAA;CAAE,CAMxE;AA4BD;;GAEG;AACH,cAAM,eAAe;IACnB,OAAO,CAAC,EAAE,CAAM;gBAEJ,OAAO,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAAC,cAAc,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,GAAG,CAAA;KAAE;IAe7H;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,GAAG,OAAO,CAAC,MAAM,CAAC;IActH;;OAEG;IACG,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAUtI;;OAEG;IACG,MAAM,CAAC,KAAK,EAAE;QAAE,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,YAAY,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,CAAC,CAAC;IAuB1N;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,GAAG,IAAI,CAAC;IAW5G;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAI1C;;OAEG;IACG,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC;IAI5B;;OAEG;IACG,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC;CAGlC;AAGD,eAAO,MAAM,QAAQ,wBAAkB,CAAC;AACxC,eAAO,MAAM,QAAQ,wBAAkB,CAAC;AAGxC,eAAO,MAAM,cAAc,KAA0B,CAAC;AAGtD,eAAe,cAAc,CAAC"}

package/dist/index.js

@@ -126,12 +126,49 @@ function getVersion() {
         implementation: implementationType
     };
 }
+/**
+ * Normalize a user-friendly distance metric string (`"cosine"`, `"euclidean"`,
+ * etc.) to the PascalCase variant the native `JsDistanceMetric` enum accepts.
+ * Native: { Euclidean, Cosine, DotProduct, Manhattan }.
+ */
+function normalizeMetric(metric) {
+    if (!metric)
+        return metric;
+    const m = metric.toLowerCase().replace(/[_\s-]/g, '');
+    switch (m) {
+        case 'cosine':
+            return 'Cosine';
+        case 'euclidean':
+        case 'l2':
+            return 'Euclidean';
+        case 'dot':
+        case 'dotproduct':
+        case 'innerproduct':
+            return 'DotProduct';
+        case 'manhattan':
+        case 'l1':
+            return 'Manhattan';
+        default:
+            return metric; // pass through; native will error with the variant list.
+    }
+}
 /**
  * Wrapper class that automatically handles metadata JSON conversion
  */
 class VectorDBWrapper {
     constructor(options) {
-        this.db = new implementation.VectorDb(options);
+        // Accept both `distanceMetric` (canonical) and `metric` (CLI shorthand).
+        // Normalize to the PascalCase enum variant the native binding expects.
+        const distanceMetric = normalizeMetric(options.distanceMetric ?? options.metric);
+        const nativeOptions = {
+            dimensions: options.dimensions,
+            storagePath: options.storagePath,
+            hnswConfig: options.hnswConfig,
+        };
+        if (distanceMetric !== undefined) {
+            nativeOptions.distanceMetric = distanceMetric;
+        }
+        this.db = new implementation.VectorDb(nativeOptions);
     }
     /**
      * Insert a vector with optional metadata (objects are auto-converted to JSON)

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "ruvector",
-  "version": "0.2.22",
-  "description": "Self-learning vector database for Node.js — hybrid search, Graph RAG, FlashAttention-3, DiskANN, 50+ attention mechanisms",
+  "version": "0.2.25",
+  "description": "Self-learning vector database for Node.js — hybrid search, Graph RAG, FlashAttention-3, HNSW, 50+ attention mechanisms",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
   "bin": {
@@ -9,7 +9,8 @@
   },
   "scripts": {
     "build": "tsc && cp src/core/onnx/pkg/package.json dist/core/onnx/pkg/",
-    "prepublishOnly": "npm run build",
+    "verify-dist": "node scripts/verify-dist.js",
+    "prepublishOnly": "npm run build && npm run verify-dist",
     "test": "node test/integration.js && node test/cli-commands.js"
   },
   "keywords": [
@@ -47,7 +48,7 @@
     "mcp",
     "edge-computing",
     "graph-rag",
-    "diskann",
+    "hnsw",
     "hybrid-search",
     "colbert",
     "turboquant",
@@ -84,7 +85,7 @@
   },
   "devDependencies": {
     "@types/node": "^20.10.5",
-    "typescript": "^5.3.3"
+    "typescript": "^5.9.3"
   },
   "files": [
     "bin/",
@@ -95,6 +96,7 @@
     "LICENSE"
   ],
   "peerDependencies": {
+    "@ruvector/diskann": ">=0.1.0",
     "@ruvector/pi-brain": ">=0.1.0",
     "@ruvector/router": ">=0.1.0",
     "@ruvector/ruvllm": ">=2.0.0"
@@ -108,6 +110,9 @@
     },
     "@ruvector/router": {
       "optional": true
+    },
+    "@ruvector/diskann": {
+      "optional": true
     }
   },
   "engines": {