Google Research introduces TurboQuant for AI model compression

What TurboQuant does
TurboQuant is a set of advanced quantization algorithms that enable massive compression for large language models and vector search engines. It specifically addresses bottlenecks in the key-value cache - a high-speed storage system that stores frequently used information under simple labels for instant retrieval.
How it works
TurboQuant achieves high reduction in model size with zero accuracy loss through two key steps:
- High-quality compression (PolarQuant method): Starts by randomly rotating data vectors to simplify geometry, then applies a standard quantizer to each part of the vector individually. This stage uses most of the compression power to capture the main concept and strength of the original vector.
- Eliminating hidden errors: Uses a small residual amount of compression power (just 1 bit) to apply the QJL algorithm to the tiny amount of error left over from the first stage. QJL acts as a mathematical error-checker that eliminates bias, leading to more accurate attention scores.
Key components
QJL (Quantized Johnson-Lindenstrauss): Uses the Johnson-Lindenstrauss Transform to shrink high-dimensional data while preserving distances between data points. It reduces each resulting vector number to a single sign bit (+1 or -1) with zero memory overhead. Uses a special estimator that balances high-precision queries with low-precision data to accurately calculate attention scores.
PolarQuant: Addresses memory overhead by converting vectors into polar coordinates using a Cartesian coordinate system. Instead of standard coordinates (X, Y, Z), it uses a format comparable to "Go 5 blocks total at a 37-degree angle" rather than "Go 3 blocks East, 4 blocks North."
Technical context
Traditional vector quantization typically introduces memory overhead of 1-2 extra bits per number due to storing quantization constants for every small data block. TurboQuant optimally addresses this challenge. The techniques showed promise in testing for reducing key-value bottlenecks without sacrificing AI model performance.
TurboQuant will be presented at ICLR 2026, while PolarQuant will be presented at AISTATS 2026.
📖 Read the full source: HN AI Agents
👀 See Also

Elodin Open-Sources AI Racing Harness with Real-Time Betaflight Simulation for AI Grand Prix Contestants
Elodin released an open-source simulation harness for the AI Grand Prix virtual qualifier, matching competition constraints and running against real Betaflight. The Rust/Bevy-based tool generates camera sensor samples directly in the loop, avoiding heavy game engine overhead.

Codex Chrome Extension Adds Background Browser Automation Across Tabs
Codex's new Chrome extension on macOS/Windows enables parallel browser task execution in background tabs without taking over the browser — covering debugging flows, dashboards, research, and CRM updates.

Memtrace: Persistent, Time-Aware Codebase Memory for Claude Code Agents
Memtrace provides always-fresh snapshots and bi-temporal replay for Claude Code agents, using Tree-sitter AST parsing and hybrid retrieval (BM25 + Jina-code embeddings) with zero LLM inference cost during indexing.

Workflow orchestrator with AI CLI integration for sysadmin tasks
A developer built a file-based workflow orchestrator called 'workflow' that integrates with Claude Code, Codex CLI, and Gemini CLI. It generates, updates, fixes, and refines YAML workflows from natural language descriptions for sysadmin tasks.