vesper-memory 0.5.3 → 0.5.4

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.
Files changed (2) hide show
  1. package/README.md +10 -6
  2. package/package.json +1 -1
package/README.md CHANGED
@@ -14,10 +14,14 @@ Simple, local memory system for Claude Code. No authentication, no complexity -
14
14
 
15
15
  ---
16
16
 
17
- ## ✨ What's New in v0.5.2
17
+ ## ✨ What's New in v0.5.4
18
18
 
19
- **Delete Memory Tool**
20
- - New `delete_memory` MCP tool to remove stored memories by ID
19
+ **`vesper init` Command**
20
+ - New `vesper init` command to install Claude Code rules into any project
21
+ - Automatically sets up `.claude/rules/` with Vesper memory guidelines
22
+
23
+ **Delete Memory Tool** (v0.5.2)
24
+ - `delete_memory` MCP tool to remove stored memories by ID
21
25
  - Cleans up across all layers (SQLite, Qdrant, Redis) and orphaned facts
22
26
  - 14 MCP tools total
23
27
 
@@ -103,7 +107,7 @@ Vesper has been scientifically validated with comprehensive benchmarks measuring
103
107
  | **P99 Latency** | 8.2ms | 1.2ms | ✅ **85.4% faster** |
104
108
  | **Memory Hit Rate** | 0% | 100% | ✅ **Perfect recall** |
105
109
 
106
- **What this means:** Vesper v0.5.2 provides perfect memory recall with SmartRouter intelligently routing queries across 6 specialized handlers. Lazy loading reduces token usage by 90%, while the LRU embedding cache eliminates redundant embedding generation. Working memory provides sub-millisecond fast path for recent queries. All latency targets exceeded: P95 of 0.6ms is **99.7% better** than the 200ms target.
110
+ **What this means:** Vesper v0.5.4 provides perfect memory recall with SmartRouter intelligently routing queries across 6 specialized handlers. Lazy loading reduces token usage by 90%, while the LRU embedding cache eliminates redundant embedding generation. Working memory provides sub-millisecond fast path for recent queries. All latency targets exceeded: P95 of 0.6ms is **99.7% better** than the 200ms target.
107
111
 
108
112
  ### Benchmark Methodology
109
113
 
@@ -477,7 +481,7 @@ Query with smart routing and semantic search.
477
481
  - `task_id` (optional): Filter to memories from a specific task
478
482
  - `exclude_agent` (optional): Exclude memories from a specific agent
479
483
 
480
- **Routing Strategies** (all active in v0.5.2):
484
+ **Routing Strategies** (all active in v0.5.4):
481
485
  - `auto` (default): SmartRouter classifies query and routes optimally
482
486
  - `semantic`: BGE-large semantic search
483
487
  - `fast_path`: Working memory only (<5ms)
@@ -966,7 +970,7 @@ curl http://localhost:6333/collections/memory-vectors
966
970
 
967
971
  ## 🎯 Design Philosophy
968
972
 
969
- **v0.5.2 Pragmatic Approach**:
973
+ **v0.5.4 Pragmatic Approach**:
970
974
  - ✅ Simple solutions over complex architectures
971
975
  - ✅ Honest uncertainty over auto-resolved conflicts
972
976
  - ✅ Fast local operation (<1ms P95 latency)
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "vesper-memory",
3
- "version": "0.5.3",
3
+ "version": "0.5.4",
4
4
  "description": "AI memory system for Claude Code - Three-layer architecture with semantic search, knowledge graphs, and intelligent retrieval",
5
5
  "type": "module",
6
6
  "engines": {