ruvector 0.2.17 → 0.2.19
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +20 -7
- package/bin/cli.js +1430 -1553
- package/bin/mcp-server.js +277 -930
- package/dist/core/sona-wrapper.d.ts +6 -0
- package/dist/core/sona-wrapper.d.ts.map +1 -1
- package/dist/core/sona-wrapper.js +8 -0
- package/package.json +19 -17
package/README.md
CHANGED
|
@@ -10,9 +10,9 @@
|
|
|
10
10
|
|
|
11
11
|
**The fastest vector database for Node.js—built in Rust, runs everywhere**
|
|
12
12
|
|
|
13
|
-
Ruvector is a
|
|
13
|
+
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.
|
|
14
14
|
|
|
15
|
-
> 🚀 **Sub-millisecond queries** • 🎯 **52,000+ inserts/sec** • 💾 **~50 bytes per vector** • 🌍 **Runs anywhere**
|
|
15
|
+
> 🚀 **Sub-millisecond queries** • 🎯 **52,000+ inserts/sec** • 💾 **~50 bytes per vector** • 🌍 **Runs anywhere** • 🧠 **859 tests passing**
|
|
16
16
|
|
|
17
17
|
Built by [rUv](https://ruv.io) with production-grade Rust performance and intelligent platform detection—**automatically uses native bindings when available, falls back to WebAssembly when needed**.
|
|
18
18
|
|
|
@@ -36,12 +36,25 @@ npx ruvector hooks init --pretrain --build-agents quality
|
|
|
36
36
|
- 🔗 **Co-edit Patterns** — Learns file relationships from git history
|
|
37
37
|
- 💾 **Vector Memory** — HNSW-indexed semantic recall (150x faster)
|
|
38
38
|
|
|
39
|
+
### New in v2.1 — SOTA Vector Search
|
|
40
|
+
- **FlashAttention-3** — IO-aware tiled attention, O(N) memory instead of O(N^2)
|
|
41
|
+
- **Graph RAG** — Knowledge graph + community detection for multi-hop queries (30-60% improvement)
|
|
42
|
+
- **Hybrid Search** — Sparse + dense vectors with RRF fusion (20-49% better retrieval)
|
|
43
|
+
- **DiskANN / Vamana** — Billion-scale SSD-backed ANN with <10ms latency
|
|
44
|
+
- **ColBERT Multi-Vector** — Per-token late interaction retrieval (MaxSim)
|
|
45
|
+
- **Matryoshka Embeddings** — Adaptive-dimension search with funnel/cascade modes
|
|
46
|
+
- **MLA** — Multi-Head Latent Attention with ~93% KV-cache compression (DeepSeek-V2/V3)
|
|
47
|
+
- **Mamba SSM** — Selective State Space Models for linear-time sequence processing
|
|
48
|
+
- **TurboQuant** — 2-4 bit KV-cache quantization, 6-8x memory reduction
|
|
49
|
+
- **OPQ** — Optimized Product Quantization with learned rotation (10-30% error reduction)
|
|
50
|
+
- **GraphMAE** — Graph Masked Autoencoder for self-supervised node learning
|
|
51
|
+
|
|
39
52
|
### New in v2.0
|
|
40
|
-
-
|
|
41
|
-
-
|
|
42
|
-
-
|
|
43
|
-
-
|
|
44
|
-
-
|
|
53
|
+
- **ONNX WASM Embeddings** — all-MiniLM-L6-v2 (384d) runs locally, no API needed
|
|
54
|
+
- **AST Analysis** — Symbol extraction, complexity metrics, import graphs
|
|
55
|
+
- **Diff Embeddings** — Semantic change classification with risk scoring
|
|
56
|
+
- **Coverage Routing** — Test coverage-aware agent selection
|
|
57
|
+
- **Graph Algorithms** — MinCut boundaries, Louvain communities, Spectral clustering
|
|
45
58
|
- 🛡️ **Security Scanning** — Parallel vulnerability pattern detection
|
|
46
59
|
- 🎯 **RAG Context** — Semantic retrieval with HNSW indexing
|
|
47
60
|
|