
TurboQuant: The 3-Bit Breakthrough Making AI Faster and Smaller
About this episode
Google Research's TurboQuant uses polar quant and Quantized Johnson-Lindenstrauss to shrink the KV cache to roughly 3 bits per value, delivering up to 8x speedups and sixfold memory savings on high-end GPUs without sacrificing accuracy. We unpack how shifting to polar coordinates avoids heavy normalization and how a single sign bit preserves data relationships, enabling faster semantic search and smarter AI tools on standard hardware.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
Get every episode summarized
Each time Intellectually Curious publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Intellectually Curious

Free Pause Tokens Solve AI Multitasking
Intellectually Curious

Claude’s Autonomous Formalization of Fermat’s Last Theorem
Intellectually Curious

Random Attention: How AI Gets Faster by Forgetting
Intellectually Curious

The Alien Anatomy of the Bigfin Squid
Intellectually Curious