tldr MCP Gateway vs TurboVec

tldr is a local proxy that sits between your AI coding harness and upstream MCP servers, solving one of the most underappreciated problems in agentic workflows: context bloat from tool schema proliferation. When you connect GitHub MCP, filesystem MCP, and a few others, you can easily be sending 24,000+ tokens of tool schemas to the model before any work begins. Instead of passing all those schemas directly, tldr exposes exactly five wrapper tools to the model: search_tools, execute_plan, call_raw, inspect_tool, and get_result. The model learns which underlying tools exist on-demand through search_tools, then calls them through the proxy. GitHub MCP's 24,473-token schema surface compresses to 3,482 tokens — an 86% reduction. Output responses are further compressed through field stripping, a 4,096-token cap, and a 64KB byte limit. This is a genuinely practical solution for power users running multi-MCP setups who've noticed degraded performance as their tool count grows. The tradeoff is one extra hop of indirection, but the token savings pay for themselves in improved model attention and lower API costs.

TurboVec is an unofficial open-source implementation of Google's TurboQuant algorithm (ICLR 2026) for extreme vector compression, written in Rust with Python bindings via PyO3. It compresses high-dimensional vectors down to 2–4 bits per coordinate — a 15.8x compression ratio vs FP32 — with near-optimal distortion and zero training required. The algorithm works in three steps: normalize vectors, apply a random rotation to smooth the data geometry, then run Lloyd-Max quantization with SIMD-accelerated bit-packing. Search runs directly against codebook values. On ARM (Apple M3 Max), TurboVec matches or beats FAISS on query speed while using a fraction of the memory. At 4-bit compression it achieves 0.955 recall@1 vs FAISS's 0.930. For anyone building RAG pipelines, semantic search, or memory systems for AI agents, this is the most efficient open-source vector quantization library available today. The "zero indexing time" property is especially valuable for production systems that need to index new content in real-time without the expensive training phase that FAISS requires.