Auto-Arch Tournament vs TurboVec

Auto-Arch Tournament is an autonomous research system where an AI agent iteratively proposes, implements, and validates microarchitectural improvements to a RISC-V CPU. Starting from a standard 5-stage pipeline, the loop runs hypotheses in parallel, each going through formal verification (53 symbolic checks), cycle-accurate simulation, multi-seed FPGA place-and-route, and CoreMark CRC validation. Only hypotheses that beat the current champion get merged; everything else gets discarded. Starting from 301 iterations/second, the system hit 577 iter/s (+92%) across 73 attempts in 9.8 hours — producing a design 26% faster and 40% smaller in LUTs than the baseline. The insight the author drives home is that the real innovation isn't the AI agent — it's the verifier. The orchestrator is hardcoded to prevent agents from manipulating their own evaluation gates, a simple but critical design constraint that turns a creative process into a trustworthy one. Without a rigorous verification harness, agent-driven optimization becomes a confidence trick. This is early but fascinating proof that AI-driven hardware design loops can produce commercially meaningful gains. The repo uses Claude Code or Codex as the coding agent, SystemVerilog for the RTL, and standard open-source EDA tooling (Yosys, nextpnr, Verilator). It's a compelling template for anyone building agentic optimization loops where correctness matters.

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.