ryancodrai/turbovec

A vector index built on TurboQuant, written in Rust with Python bindings

View on GitHub ↗Jump to charts ↓Open shareable report

Summary Information

Updated 17 seconds ago
Added to GitGenius on August 20th, 2026
Created on March 26th, 2026
Open Issues & Pull Requests: 15 (+0)
Number of forks: 1,379
Total Stargazers: 15,853 (+17)
Total Subscribers: 66 (+0)

Repository Insights (GitGenius)

Median issue/PR response: 17.2 hours
Mean response time: 3.0 days
90th percentile: 6.3 days
Tracked items: 267

How this project is maintained

Around half of the issues opened in the past year never receive a reply. Only 9% of issues opened in the past year have been closed. Three people close 100% of everything that gets resolved.

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 15
New in 7 days: 4
Closed in 7 days: 16
Avg open age: 27 days
Stale 30+ days: 0
Stale 90+ days: 0

Recent activity

Opened in 7 days: 3
Closed in 7 days: 16
Comments in 7 days: 0
Events in 7 days: 2

Top labels

  • bug (38)
  • needs-human-decision (30)
  • documentation (14)
  • enhancement (14)
  • planned (2)
  • duplicate (1)
  • invalid (1)

Detailed Description

Turbovec is a vector index built on TurboQuant, written in Rust with Python bindings.

The tool solves the problem of memory-intensive vector search by implementing Google Research's TurboQuant algorithm, a data-oblivious quantizer that requires no training phase. It compresses vector corpora dramatically—a 31 GB float32 corpus fits in 4 GB—while maintaining search speed faster than FAISS. Vectors are indexed immediately upon insertion with no training step or parameter tuning, and the index grows without rebuilds. The implementation uses hand-written SIMD kernels optimized for both ARM (NEON SDOT/SMMLA) and x86 (AVX-512 VNNI and vpermb) architectures, with AVX2 and scalar fallbacks for broader compatibility.

Adopt this tool if you need vector search with tight memory constraints, low latency, or privacy requirements that demand local-only processing. It suits RAG systems, especially those running in resource-constrained environments or requiring air-gapped deployments. The tool offers incremental persistence through sync operations that write only changed data with single fsync calls, crash-safe at any byte boundary. Filtered search is built into the SIMD kernel itself, allowing you to restrict results to an allowlist without over-fetching or recall penalties—blocks with no allowed slots are short-circuited before scoring work begins. The project compares favorably to FAISS IndexPQFastScan across measured configurations.

Maintainers respond to new issues and pull requests within a day. Work in the issue tracker centers on bug fixes, enhancements, and documentation.