As large-model serving moves from monolithic inference to a "Prefill-Decode split" disassembled architecture, KV cache cross-network transfer becomes a new bottleneck — the Decode end must wait for KV to be fully transferred before starting to output tokens. The paper Lynx: Progressive Speculative Quantization for accelerating KV Transfer in Long-Context Inference, posted to arXiv on July 2, 2026, gives a fairly engineering-flavored solution: split the KV cache into Anchor (high-effective bits) and Residual (low-effective bits) streams by bit importance; the Decode end "speculatively" starts generating once it gets the Anchor, while the Residual continues to be transmitted in the background, with a final precision reconciliation. The result: Time-to-First-Token chases aggressive 4-bit quantization, but precision holds the BF16 level, 1.43× faster than standard 8-bit quantization, with 5.1% accuracy improvement over SOTA across multiple models and workloads. Noteworthily, the author team comes from the SIGCOMM circle (originally also submitting to SIGCOMM 26), and they look at KV cache from a network perspective — "since different bits don't contribute equally to attention, why must it be transferred as an indivisible whole?" This "coarse-first then fine, dual-stream parallel, post-alignment" paradigm is neither pure algorithm nor pure hardware, but a co-design of network and model inference, worth a serious read by all engineering teams doing long-context deployment. Lynx's code and data are public with the paper; the only threshold is that you need a serving framework that supports dual-stream distribution.