wolverine-ai 2.9.0 → 2.9.1

package/README.md

@@ -358,11 +358,12 @@ High-performance vector database that grows without slowing down:
 
 **Search performance** (scales gracefully):
 
-| Entries | Semantic Search | Keyword (BM25) |
-|---------|----------------|----------------|
-| 100 | 0.2ms | 0.005ms |
-| 1,000 | 0.4ms | 0.01ms |
-| 10,000 | 4.4ms | 0.1ms |
+| Entries | Semantic Search | Keyword (BM25) | Clusters |
+|---------|----------------|----------------|----------|
+| 100 | 0.2ms | 0.005ms | 10 |
+| 1,000 | 0.4ms | 0.01ms | 32 |
+| 10,000 | 4.4ms | 0.1ms | 100 |
+| 50,000 | 23.7ms | 0.5ms | 224 |
 
 **4 optimization techniques:**
 1. **Pre-normalized vectors** — cosine similarity = dot product (no sqrt per query)

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "wolverine-ai",
-  "version": "2.9.0",
+  "version": "2.9.1",
   "description": "Self-healing Node.js server framework powered by AI. Catches crashes, diagnoses errors, generates fixes, verifies, and restarts — automatically.",
   "main": "src/index.js",
   "bin": {

package/src/brain/brain.js

@@ -54,7 +54,7 @@ const SEED_DOCS = [
     metadata: { topic: "perf-monitoring" },
   },
   {
-    text: "Wolverine brain: high-performance vector database for long-term memory. 4 search optimizations: (1) Pre-normalized vectors — cosine similarity = dot product (no sqrt), 7x faster. (2) IVF index — vectors clustered into √N buckets via k-means++, search probes nearest 20% of clusters only. 10K entries: 4ms instead of 31ms. (3) BM25 keyword search — proper inverted index with TF-IDF scoring, O(query_tokens) not O(N). (4) Binary persistence — Float32Array buffers, 10x faster load than JSON. Grows gracefully: 100=0.2ms, 1K=0.4ms, 5K=2ms, 10K=4ms. Stores: function maps, errors, fixes, learnings, seed docs. Persisted to .wolverine/brain/.",
+    text: "Wolverine brain: high-performance vector database for long-term memory. 4 search optimizations: (1) Pre-normalized vectors — cosine similarity = dot product (no sqrt), 7x faster. (2) IVF index — k-means++ clustering into √N buckets (10 at 100 entries, 100 at 10K, 224 at 50K), search probes nearest 20% of clusters. (3) BM25 keyword search — inverted index with TF-IDF scoring, O(query_tokens) not O(N). (4) Binary persistence — Float32Array buffers, 10x faster load. Benchmarks: 100=0.2ms, 1K=0.4ms, 5K=2ms, 10K=4.4ms, 50K=23.7ms (was 160ms brute force). Stores: function maps, errors, fixes, learnings, seed docs. New seeds merged on framework update without erasing existing memories.",
     metadata: { topic: "brain" },
   },
   {