Foxstash
High-performance local RAG library for Rust
Foxstash is a local-first Retrieval-Augmented Generation (RAG) library featuring SIMD-accelerated vector operations, HNSW indexing, vector quantization, ONNX embeddings, and WebAssembly support.
Features
- SIMD-Accelerated - AVX2/SSE/NEON vector operations with 3-4x speedup
- HNSW Indexing - Hierarchical Navigable Small World graphs for fast similarity search
- Vector Quantization - Int8 (4x), Binary (32x), and Product Quantization (192x)
- ONNX Embeddings - Generate embeddings locally with MiniLM-L6-v2 or any ONNX model
- WASM Support - Run in the browser with IndexedDB persistence
- Compression - Gzip, LZ4, and Zstd support for efficient storage
- Incremental Persistence - Write-ahead log for fast updates without full rewrites
- Local-First - Your data never leaves your machine
Quick Start
Add to your Cargo.toml:
[]
= "0.1"
Basic Usage
use ;
use HNSWIndex;
// Create an HNSW index
let mut index = with_defaults; // 384-dim for MiniLM-L6-v2
// Add documents with embeddings
let doc = Document ;
index.add?;
// Search for similar documents
let query = vec!;
let results = index.search?;
for result in results
Memory-Efficient Indexing with Quantization
For large datasets, use quantized indexes to reduce memory by 4-192x:
use ;
use Document;
// Scalar Quantization (4x compression, ~95% recall)
let mut sq8_index = for_normalized;
// Binary Quantization (32x compression, use with reranking)
let mut binary_index = with_full_precision;
// Add documents
let doc = Document ;
sq8_index.add?;
binary_index.add_with_full_precision?;
// Search with SQ8 (high quality, 4x memory savings)
let results = sq8_index.search?;
// Two-phase search with Binary (fast filter, then precise rerank)
let results = binary_index.search_and_rerank?;
Product Quantization (Extreme Compression)
For massive datasets, use Product Quantization for up to 192x compression:
use ;
use PQConfig;
// Configure PQ: 8 subvectors, 256 centroids each
let pq_config = new
.with_kmeans_iterations;
// Train on sample vectors
let training_data = load_sample_vectors;
let mut index = train?;
// Add documents (automatically compressed)
for doc in documents
// Search using Asymmetric Distance Computation (ADC)
let results = index.search?;
Memory Comparison (1M vectors, 384 dimensions)
| Index Type | Memory | Compression | Recall |
|---|---|---|---|
| HNSW (f32) | 1.5 GB | 1x | ~98% |
| SQ8 HNSW | 384 MB | 4x | ~95% |
| Binary HNSW | 48 MB | 32x | ~90%* |
| PQ HNSW (M=8) | 8 MB | 192x | ~80%** |
*With two-phase reranking. **Using ADC search.
Streaming Batch Ingestion
For large datasets, use streaming batch ingestion with progress tracking:
use ;
let mut index = with_defaults;
let config = default
.with_batch_size
.with_total
.with_progress;
let mut builder = new;
for doc in document_iterator
let result = builder.finish;
println!;
Incremental Persistence (WAL)
Avoid rewriting the entire index on every update:
use ;
let config = default
.with_checkpoint_threshold // Full snapshot every 10K ops
.with_wal_sync_interval; // Sync to disk every 100 ops
let mut storage = new?;
// Fast append-only writes to WAL
for doc in new_documents
// Periodic checkpoint
if storage.needs_checkpoint
With ONNX Embeddings
Enable the onnx feature:
[]
= { = "0.1", = ["onnx"] }
use OnnxEmbedder;
let mut embedder = new?;
let embedding = embedder.embed?;
assert_eq!;
Crates
| Crate | Description |
|---|---|
foxstash-core |
Core library with indexes, embeddings, and storage |
foxstash-wasm |
WebAssembly bindings with IndexedDB persistence |
foxstash-native |
Native bindings with full ONNX support |
Architecture
foxstash/
├── crates/
│ ├── core/ # Main library
│ │ ├── embedding/ # ONNX Runtime + caching
│ │ ├── index/ # HNSW, Flat, SQ8, Binary, PQ indexes
│ │ ├── storage/ # File persistence, compression, WAL
│ │ └── vector/ # SIMD ops, quantization
│ ├── wasm/ # Browser target
│ ├── native/ # Desktop/server target
│ └── benches/ # Comprehensive benchmarks
Benchmarks
HNSW Performance @ 100,000 Vectors
128 dimensions, 10,000 queries, Recall@10
| Library | Build Time | Search QPS | Recall |
|---|---|---|---|
| Foxstash | 7.5s | 8,439 | 61.4% |
| hnswlib (C++/Python) | 5.4s | 4,245 | 40.3% |
| faiss-hnsw (C++/Python) | 8.0s | 3,277 | 46.4% |
| instant-distance (Rust) | 72.6s | 587 | 62.1% |
Key takeaways:
- 2x faster search than hnswlib with 50% better recall
- 14x faster search than instant-distance with equivalent recall
- 9.6x faster build than instant-distance
- Best recall-to-speed ratio among tested libraries
Build Strategies @ 100,000 Vectors
| Strategy | Build Time | Search QPS | Recall | Use Case |
|---|---|---|---|---|
| Sequential | 578.9s | 817 | 59.0% | Maximum quality |
| Parallel | 7.4s | 8,439 | 61.4% | Production (78x faster) |
Running Benchmarks
# Full benchmark suite (sets up Python venv automatically)
# Or run individually:
See crates/benches/ for benchmark implementations.
Roadmap
- Int8/Binary quantization (4-32x memory reduction)
- Streaming add/search for large datasets
- Incremental persistence (WAL + checkpointing)
- Product quantization (PQ) - up to 192x compression
- Diversity-aware neighbor selection (Algorithm 4)
- GPU acceleration (optional)
- Hybrid search (sparse + dense vectors)
- Multi-vector support (late interaction)
License
MIT License - see LICENSE for details.
Credits
Built by Narcoleptic Fox