DOOM MCP vs TurboVec

Chris Nager built a fully playable DOOM that runs as an MCP (Model Context Protocol) app, rendering inline inside Claude and ChatGPT without a separate browser tab. The architecture uses two MCP tools — create_doom_session for inline-capable hosts and get_doom_launch_url as a browser fallback — combined with cloudflare/doom-wasm for the game runtime and a signed token system that maintains session state across both surfaces. The result is the same session whether you're playing inline or in a tab. The key technical challenge was avoiding iframe and CSP (Content Security Policy) issues. Rather than embedding a browser page inside the MCP iframe, the DOOM canvas runs directly inside the host's iframe — a subtle but critical distinction that resolved a class of rendering and input-handling bugs. The final implementation is intentionally stripped down: no save/load, no persistence adapters, just stable playable DOOM. Beyond the novelty, this project is a concrete demonstration that MCP apps are interactive surfaces, not just tool-calling JSON endpoints. The progressive enhancement pattern — same signed-token foundation serving both inline and browser modes — is a reusable architecture for any game or interactive experience that wants to live inside an AI assistant. Nager open-sourced the implementation and the blog post is a detailed technical breakdown.

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.