Emdash vs TurboVec

Emdash is a desktop application from Y Combinator's W26 batch that lets developers run multiple AI coding agents simultaneously, each isolated in its own Git worktree. Rather than switching between Claude Code for one task and Codex for another, you launch parallel agents from one interface, review their diffs in one place, and merge the results through a queue that handles the Git complexity automatically. It supports 23 CLI agent providers including Claude Code, Qwen Code, Hermes Agent, Amp, and OpenAI Codex. The remote development story is particularly strong: Emdash connects to remote machines via SSH/SFTP with keychain credential storage, meaning you can run GPU-heavy agents on a beefy remote devbox while managing everything from your laptop. Ticket integration with Linear, GitHub, and Jira means you can drag a ticket directly onto an agent and watch it work — no copy-pasting requirements into a chat window. Built with Electron and TypeScript with SQLite for local storage, Emdash is local-first by design — your code never touches Emdash's servers, only your chosen agent providers. The project is MIT-licensed, open source, and has accumulated 3,700+ commits since its YC batch. At the intersection of the multi-agent workflow boom and the need for developer tooling that actually scales to parallel workstreams, Emdash is one of the more credible attempts at solving a real daily pain.

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.