[Framework] The Asymmetric Key-Value Cache Compression

Why hardware pipelines hate irregular memory layouts and what you should do instead. A tactile physical installation illustrating the asymmetric decoupling of the key-value cache to optimize memory bandwidth in hardware pipelines. I remember standing in the glass-walled server room of a major consumer internet company, watching a tier-one systems architect stare at a dashboard flashing deep, angry amber. We were attempting to deploy a state-of-the-art 175-billion parameter model with a newly expanded context window, expecting a triumph of modern engineering. Instead, we were witnessing a physical crisis of memory bandwidth, a silent strangulation where the model was bottlenecked not by its static weights, but by the sheer volume of its historical conversational state. Every single user token required us to store, retrieve, and process keys and values, turning our elegant silicon architecture into a sluggish, overstuffed filing cabinet. In that moment, it became blindingly obvious that the race for million-token context windows is not an algorithmic victory, but a physical war against modern physics. 📊 Executive Summary: Scaling LLM contexts creates a massive memory wall, forcing the KV cache of a 175B model to balloon to 1.2TB. This framework addresses this bottleneck by decoupling Key (per-channel) and Value (per-token) quantization while neutralizing Token Norm Imbalance via Omni-Scaled Canalized Rotation (OScaR). Compressing caches to sub-1-bit limits (0.81 bits/activation) yields a 5.3x memory footprint reduction and a 3.0x decoding speedup with zero linguistic degradation. I. The 1.2 Terabyte Memory Wall: Why Context Expansion is Breaking Modern Silicon The contemporary gold rush toward million-token context windows is celebrated as a cognitive leap for machine intelligence, but behind the scenes, datacenter operators are quietly drowning in hardware bills. Autoregressive decoding is inherently bound by memory bandwidth rather than raw arithmetic capability, forcing memory architectures to constantly stream historical data to the processor cores (Wang et al., 2024). When a standard 175-billion parameter model processes a high-concurrency batch, its dynamic Key-Value (KV) cache can swell to an astronomical 1.2 Terabytes (Liu et al., 2024; Su et al., 2026). This colossal footprint completely eclipses the static weights of the model itself, forcing standard systems to spill their cache lines over into slow off-chip memory and stalling computation (Liu et al., 2024). To survive this memory wall, we must abandon the long-held industry assumption that symmetric post-training quantization is sufficient for extreme compression. Traditional low-bit quantization schemes apply uniform reduction across weights, activations, and caches, but this blunt approach triggers severe representation loss at the context boundaries (Dettmers et al., 2022; Su et al., 2026). This article introduces The Asymmetric Key-Value Cache Compression Framework, a paradigm shift that decouples Key and Value quantization matrices while mathematically neutralizing Token Norm Imbalance (Liu et al., 2024; Su et al., 2026). By tailoring the quantization strategy to the unique mathematical topologies of Keys and Values, this framework compresses the KV cache to sub-1-bit levels (0.81 bits per activation) while fully preserving the model’s complex reasoning capacity (Liu et al., 2024; Zhang et al., 2024). Our journey through this architecture will trace the systemic failures of naive symmetric quantization, explore the non-overlapping mathematical structures of Keys and Values, and examine the rotation techniques that eliminate token-level variance. Finally, we will outline a complete, co-designed pipeline that unites sub-1-bit caches with ultra-low-bit weights, creating an engine optimized for next-generation hardware. A physical scale model depicting a massive concrete wall blocking high-bandwidth data pathways, visualizing the 1.2 Terabyte memory wall bottleneck. “We shape the silicon, but the memory shapes the model.” — Mohit Sewak, Ph.D. II. The Symmetrical Failure: Why Naive Quantization Triggers Representational Collapse When machine learning engineers attempt to shoehorn a massive model’s activations into low-bit spaces using traditional absolute maximum (absmax) scaling, the result is almost always catastrophic. Standard absmax quantization relies on a simple scaling factor, calculated by dividing the target discrete integer range by the maximum absolute value present in the tensor: S = target_integer_range / max(|X|) While this formula works perfectly for stable, bounded distributions, it disintegrates when applied to the activation states of modern deep transformers (Dettmers et al., 2022). The culprit is a highly systematic structural anomaly: the spontaneous emergence of massive activation outliers (Dettmers et al., 2022). In models exceeding several billion parameters, specific hidden dimensions develop activation values that can exceed magnitudes of 1⁰⁵, while the surrounding features maintain a quiet median value of roughly 0.1 (Su et al., 2026). When absmax scales this tensor, the enormous magnitude of the outlier forces the scaling factor S to become incredibly small. As a consequence, the normal features that carry the vast majority of the model’s linguistic nuances are rounded down to absolute zero, causing extreme quantization degradation and an immediate drop in zero-shot accuracy (Dettmers et al., 2022). Naive Absmax Quantization Squeezing: [ 0.1, 0.12, 0.08, 100000.0, 0.11 ] <-- Raw Activations with Outlier (10⁵) ↓ (Scaled by S = 127 / 100000) [ 0, 0, 0, 127, 0 ] <-- Normal features obliterated to zero! This structural squashing triggers what researchers term representational collapse — a state where the model’s parameters lose their geometric diversity and information capacity (Huang et al., 2026; Oberländer et al., 2026). During Quantization-Aware Training (QAT), this manifests as weight trapping (Huang et al., 2026). Because the forward pass uses discrete values but the backward pass relies on real-valued gradients calculated via Straight-Through Estimators (STE), the lack of gradient variance leaves weights trapped in local, sub-optimal regions (Huang et al., 2026). In Post-Training Quantization (PTQ), the failure mode is even more immediate (Oberländer et al., 2026). Quantization errors do not remain isolated; instead, they compound exponentially as they propagate through the deep layers of the model (Oberländer et al., 2026). Without corrective measures, this cumulative quantization bias leads to a total collapse of the model’s expressive capabilities, resulting in a perplexity explosion that can exceed 1⁰⁸ in uncorrected 1-bit baselines (Oberländer et al., 2026). A physical mechanical metaphor demonstrating representational collapse, where a massive steel outlier forces an absmax clamp to crush normal glass activations to zero. 🔍 Fact Check: While developers expect quantization noise to propagate linearly, forensic analyses of PTQ baselines reveal that uncorrected 1-bit quantization causes an immediate exponential amplification of error across deep layers, triggering a catastrophic perplexity explosion exceeding 1⁰⁸ on standard language evaluation benchmarks. This issue highlights a fundamental software-hardware gap (Dettmers et al., 2022). Unlike weight outliers, which are static, offline properties of a fully trained model, activation and KV cache outliers are dynamic, runtime phenomena generated in response to incoming user tokens (Dettmers et al., 2022). Since activations cannot be pre-processed offline, they represent the single most stubborn bottleneck in extreme low-bit serving (Dettmers et al., 2022). III. Pillar I: Decoupling Key and Value Asymmetry via KIVI Partitioning The foundational breakthrough of the KIVI (Key-Value Quantization) framework was the discovery that Key and Value caches exhibit completely divergent, non-overlapping statistical topologies (Liu et al., 2024). Key and Value matrices serve fundamentally different roles in the attention mechanism, and their activation distributions reflect this functional division (Liu et al., 2024). In the Key cache (K), activation outliers are strictly channel-wise (Liu et al., 2024). Across the entire sequence dimension, specific, predictable channels consistently exhibit massive activation magnitudes (Liu et al., 2024). Conversely, the Value cache (V) acts as an attention output mixer and displays no such channel-wise anomalies (Liu et al., 2024). Instead, variations in the Value cache are stochastically distributed per-token, meaning the magnitude spikes are tied to individual sequence steps rather than specific channels (Liu et al., 2024). Statistical Topologies: Key Cache (K): [Token Dim] × [Channel Dim (Outliers Concentrated in Specific Columns)] Value Cache (V): [Token Dim (Outliers Concentrated in Specific Rows)] × [Channel Dim] When engineers apply a symmetric, uniform quantization scheme across both caches, they force a lose-lose compromise (Liu et al., 2024). If they quantize per-token, the Key cache’s massive channel outliers dictate the scaling factor for the entire token vector, obliterating the normal channels (Liu et al., 2024). If they quantize per-channel, they fail to capture the token-level variations of the Value cache, introducing significant reconstruction errors (Liu et al., 2024). A physical KIVI sorting rig illustrating asymmetric partitioning, separating Key activations per-channel and Value activations per-token. The KIVI framework elegantly resolves this dilemma through a tuning-free, asymmetric quantization pipeline (Liu et al., 2024): ┌───────────────┐ │ Raw KV Cache │ └───────┬───────┘ │ ┌────────────┴────────────┐ ▼ ▼ ┌───────────────┐ ┌───────────────┐ │ Key Cache (K) │ │Value Cache (V)│ └───────┬───────┘ └───────┬───────┘ │ │ ▼ ▼ [Per-Channel Quant] [Per-Token Quant] │ │ └────────────┬────────────┘ ▼ ┌───────────────┐ │ FP16 Sliding │ (Most recent 32 tokens) │ Window │ └───────────────┘ Quantize the Key cache (K) strictly per-channel, confining the outlier variance to its native dimension and preserving normal channels (Liu et al., 2024). Quantize the Value cache (V) strictly per-token, capturing its stochastic, sequence-dimensional variations (Liu et al., 2024). Maintain a small, full-precision (FP16) sliding window for the most local relevant sequence tokens (e.g., the last 32 tokens) to guarantee high-fidelity local context processing (Liu et al., 2024). 💡 ProTip: When implementing asymmetric KV cache partitioning, never quantize the local sliding-window buffer. Pinning the most recent 32 tokens in FP16 acts as an anchor for local syntactic dependencies, ensuring that the cumulative quantization error of historical tokens does not poison the immediate next-token generation pipeline. By splitting the quantization strategy along these asymmetric lines, KIVI enables stable 2-bit KV cache quantization without requiring any expensive fine-tuning or calibration (Liu et al., 2024). In production environments, this simple partition reduces memory overhead so dramatically that it delivers up to a 3.47x higher inference throughput (Liu et al., 2024). IV. Pillar II: Eradicating Token Norm Imbalance with Omni-Scaled Canalized Rotation (OScaR) While KIVI’s per-channel and per-token split operates beautifully at 4-bit and 2-bit levels, pushing the boundaries to extreme 1-bit or sub-2-bit limits reveals a deeper structural bottleneck: Token Norm Imbalance (TNI) (Su et al., 2026). Token Norm Imbalance describes a phenomenon where the L₂ norm of individual token vectors varies wildly across the sequence dimension (Su et al., 2026). Highly attended tokens — such as the initial “attention sink” tokens — possess massive activation energy, while normal tokens in the middle of the sequence carry negligible norm (Su et al., 2026). Under standard per-channel quantization, a single shared scaling parameter is calculated across the sequence dimension for each channel (Su et al., 2026). Because this parameter must span both high-norm and low-norm tokens, it systematically amplifies the reconstruction error of the low-norm tokens (Su et al., 2026). When pushed to the 1-bit limit, this imbalance causes a total collapse in the model’s linguistic fidelity (Su et al., 2026). To solve this physical limitation, the OScaR (Omni-Scaled Canalized Rotation) framework introduces a dual-stage mathematical pipeline that flattens this imbalance with near-zero computational overhead (Su et al., 2026). Token Norm Imbalance (TNI) Mitigation Pipeline: [Raw Key Cache X] ──► [Stage 1: Canalized Rotation (Walsh-Hadamard Y = X × H)] ──► [Stage 2: Omni-Token Scaling] ──► [Smooth Gaussian Distribution] Stage 1: Canalized Rotation (The Walsh-Hadamard Transform) First, the framework applies an online orthogonal transformation to rotate the activation space, using the formula: Y = X × H where H is an N × N orthogonal matrix where H_i,j ∈ {+1, -1} (Wang et al., 2025). This rotation distributes the concentrated energy of outlier spikes evenly across all dimensions, transforming a heavily skewed, heavy-tailed distribution into a neat, quantizable Gaussian curve (Wang et al., 2025). Because the Fast Walsh-Hadamard Transform can be executed in O(N log N) runtime complexity, it avoids expensive matrix multiplications and runs with near-zero latency overhead (Wang et al., 2025). 💡 ProTip: To implement the Walsh-Hadamard Transform without bottlenecking the decoding pass, fuse the rotation directly into the CUDA kernel of the preceding projection layer. Performing the rotation in-place bypasses the massive overhead of reading and writing unrotated activation tensors to High Bandwidth Memory. Stage 2: Omni-Token Scaling Immediately following the rotation, the framework applies token-level L₂ norm normalization (Su et al., 2026). This step mathematically equalizes the norms across the sequence dimension, effectively neutralizing Token Norm Imbalance (Su et al., 2026). By implementing this dual rotation-and-scaling sequence during Key matrix construction, system architects can completely decouple token magnitude from channel constraints (Su et al., 2026). The hardware benefits of this approach are profound. When benchmarked against BF16 FlashDecoding-v2, the OScaR framework delivers a 5.3x reduction in memory footprint and up to a 3.0x speedup in decoding, establishing a new Pareto frontier for extreme context serving (Su et al., 2026). V. Pillar III: Transcending the 1-Bit Barrier with Coupled Quantization (CQ) Even at 2 bits, a million-token cache demands significant memory bandwidth. To break through the 1-bit barrier, we must challenge the traditional assumption that individual activation channels are independent variables (Zhang et al., 2024). In reality, adjacent channels within a transformer’s embedding space share significant mutual information and deep interdependencies (Zhang et al., 2024). The Coupled Quantization (CQ) framework exploits these correlations to compress the cache to sub-1-bit levels without triggering accuracy collapse (Zhang et al., 2024). Instead of compressing each channel as an isolated scalar stream, CQ couples multiple channels together and encodes them as a unified vector (Zhang et al., 2024). Coupled Quantization (CQ) Grouping: Raw Channels: [ Ch 1, Ch 2, Ch 3, ... Ch 16 ] (High mutual information) │ │ (Grouped into blocks) ▼ CQ Joint Encoder: [ 16-Channel Contiguous Block ] │ │ (Fisher-Guided Centroid Search) ▼ Encoded Output: [ 12-bit Codebook Centroid ] <-- Average of 0.81 bits/activation! This vector quantization is implemented via a highly specialized three-step pipeline (Zhang et al., 2024): Step 1: Channel Partitioning. Partition the activation channels into non-overlapping, contiguous groups, typically consisting of 16 channels per block (Zhang et al., 2024). Step 2: Joint Codebook Encoding. Jointly encode these grouped channels using multi-dimensional centroids learned offline (Zhang et al., 2024). Step 3: Fisher-Guided Selection. To preserve high-impact activations, discard standard K-means clustering. Instead, use second-order Fisher Information matrices during centroid training to prioritize the preservation of channels that contribute most to the model’s loss function (Zhang et al., 2024). This channel-coupling paradigm allows for extreme codebook sharing. Mapping a 12-bit code to a group of 16 coupled channels yields an average of only 0.81 bits per activation (Zhang et al., 2024). 🔍 Fact Check: While 1-bit is widely regarded as the absolute minimum representation limit, the Coupled Quantization (CQ-16c12b) framework achieves a sub-1-bit average of 0.81 bits per activation by exploiting the shared mutual information across 16 contiguous channels, enabling a 15x increase in concurrent serving capacity. For system architects, the optimal deployment strategy combines this CQ-16c12b configuration with a tiny, high-precision sliding window of 32 to 128 FP16 tokens for localized, high-fidelity context processing (Zhang et al., 2024). This sub-1-bit strategy allows data centers to scale concurrent batch sizes by up to 15x compared to standard FP16 baselines, maximizing hardware utilization (Zhang et al., 2024). VI. Pillar IV: Co-Designing the Complete Pipeline — W1A4 Weights and H-BitLinear Integration Compressing the KV cache to extreme low-bits solves the memory capacity issue, but if the rest of the compute pipeline is poorly integrated, the system will still stall (Wang et al., 2024; Wang et al., 2025). For instance, if weights are compressed to 1.58 bits (as in BitNet b1.58) but activations remain in FP16 or INT8 format, the hardware cannot leverage fast INT4 or binary tensor cores (Dettmers et al., 2022; Ma et al., 2024). The entire inference engine is dragged down to the speed of the slowest common denominator (Dettmers et al., 2022). Standard BitNet b1.58 vs. H-BitLinear Co-Design: ┌──────────────────────────┐ ┌──────────────────────────┐ │ BitNet b1.58 (W1A8) │ │ BitNet v2 (W1A4KV2) │ ├──────────────────────────┤ ├──────────────────────────┤ │ Weights: 1.58-bit │ │ Weights: 1.58-bit │ │ Activations: 8-bit │ │ Activations: 4-bit (Rot) │ │ KV Cache: 16-bit │ │ KV Cache: 2-bit/Sub-1 │ └──────────────────────────┘ └──────────────────────────┘ (Stalls on mixed pipelines) (Fully integer-native speed) To resolve this, modern deployment architectures must co-design weights, activations, and caches (Wang et al., 2024). The most elegant solution utilizes BitNet v2 (H-BitLinear), which enables native 4-bit activations for 1-bit models (Wang et al., 2025). The H-BitLinear module leverages online Hadamard rotations prior to activation quantization (Wang et al., 2025). By rotating the activations, the module smooths heavy-tailed outlier distributions, allowing them to fit neatly into narrow 4-bit integer grids with near-zero latency overhead (Wang et al., 2025). This achieves the W1A4 standard, unlocking fully integer-native execution (Wang et al., 2025). An alternative approach is hybrid sparsification, exemplified by BitNet a4.8 (Wang et al., 2024). This architecture recognizes that different components of a transformer exhibit different sensitivities to precision reduction (Wang et al., 2024). It applies 4-bit quantization to the inputs of the Multi-Head Attention (MHA) and Feed-Forward Network (FFN) layers, where representations are stable, but retains an 8-bit pathway for highly sensitive intermediate states (Wang et4.8; Wang et al., 2024). To offset the memory cost of the 8-bit path, BitNet a4.8 employs aggressive Top-K sparsification via a squared ReLU gating mechanism, activating only 55% of the total parameters during inference (Wang et al., 2024). By combining asymmetric KV cache compression (such as OScaR or KIVI) with these W1A4 weight architectures, system architects can build fully integer-native pipelines (Ma et al., 2024). These pipelines bypass floating-point matrix multiplications entirely, executing operations as simple, energy-efficient additions and bit-shifts (Ma et al., 2024). VII. The W1A4KV2 Dawn: Transitioning from High-Precision Monoliths to Ultra-Compressed Edge Engines The evolution of LLM quantization has reached a pivotal turning point. The industry is rapidly moving away from fragile post-training hacks on FP16 models and embracing holistic hardware-software co-design (Su et al., 2026). This paradigm shift culminates in the W1A4KV2 architecture (1-bit weights, 4-bit activations, and 2-bit or sub-1-bit KV caches) as the new gold standard for high-performance inference (Su et al., 2026). ┌────────────────────────────────────────┐ │ The W1A4KV2 Gold Standard │ ├────────────────────────────────────────┤ │ Weights: 1-bit Ternary │ │ Activations: 4-bit Smooth Rotated │ │ KV Cache: 2-bit Asymmetric/Sub-1 │ └────────────────────────────────────────┘ Looking further ahead, the next frontier points toward event-driven neuromorphic architectures, such as Spiking Neural Networks (SNNs) (Zhu et al., 2024). Frameworks like SpikeGPT and Dual-Path SparseTCAM bypass continuous algebraic calculations entirely, representing information as discrete binary {0, 1} spikes that propagate through temporal membrane dynamics (Zhu et al., 2024). While still in their infancy, these neuromorphic designs promise to reduce the power envelope of language models by orders of magnitude (Zhu et al., 2024). For engineering teams operating in the here and now, the path forward is clear. Transitioning to asymmetric KV cache compression and low-bit weight co-design is the only viable way to escape the physical constraints of the memory wall. If your team is ready to scale context windows without breaking your hardware budget, download our open-source, hardware-aligned packing kernels for asymmetric KV caching, or subscribe to our Deep Tech Infrastructure newsletter to receive our next code-level implementation guide of the OScaR rotation pipeline. References & Further Reading Core Quantization & Weight Representation Concepts Dettmers, T., Lewis, M., Belkada, Y., & Zettlemoyer, L. (2022). LLM.int 8(): 8-bit Matrix Multiplication for Transformers at Scale. Advances in Neural Information Processing Systems , 35, 30336–30349. https://doi.org/10.48550/arXiv.2208.07339 Huang, H., Wu, D., Hu, Q., Yu, G., Yang, J., Zhu, J., Liu, X., & Wu, D. (2026). Sherry: Hardware-efficient 1.25-bit ternary quantization via fine-grained sparsification. 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026) . https://doi.org/10.48550/arXiv.2601.07892 Ma, S., Wang, H., Ma, L., Wang, L., Wang, W., Huang, S., Dong, L., Wang, R., Xue, J., & Wei, F. (2024). The era of 1-bit LLMs: All large language models are in 1.58 bits. arXiv preprint arXiv:2402.17764 . https://doi.org/10.48550/arXiv.2402.17764 Oberländer, J., Finkbeiner, J., Schöfmann, C. M., & Neftci, E. (2026). GRINQH: Graded input-based quantization hierarchy for efficient LLM generation. arXiv preprint arXiv:2606.23419 . https://doi.org/10.48550/arXiv.2606.23419 Advanced Activation Scaling & Co-Design Paradigms Wang, H., Ma, S., & Wei, F. (2024). BitNet a4.8: 4-bit activations for 1-bit LLMs. arXiv preprint arXiv:2411.04965 . https://doi.org/10.48550/arXiv.2411.04965 Wang, H., Ma, S., & Wei, F. (2025). BitNet v2: Native 4-bit activations with Hadamard transformation for 1-bit LLMs. arXiv preprint arXiv:2504.18415 . https://doi.org/10.48550/arXiv.2504.18415 Next-Generation KV Cache & Neuromorphic Frontiers Liu, Z., Yuan, J., Jin, H., Zhong, S., Xu, Z., Braverman, V., Chen, B., & Hu, X. (2024). KIVI: A tuning-free asymmetric 2bit quantization for KV cache. International Conference on Machine Learning (ICML 2024) . https://doi.org/10.48550/arXiv.2402.02750 Su, Z., Yang, R., Zhang, C., Liu, Y., Zhang, Y., Wu, W., Xiong, J., Du, D., Zhuang, X., & Wong, N. (2026). OScaR: The Occam’s razor for extreme KV cache quantization in LLMs and beyond. arXiv preprint arXiv:2605.19660 . https://doi.org/10.48550/arXiv.2605.19660 Zhang, T., Yi, J., Xu, Z., & Shrivastava, A. (2024). KV cache is 1 bit per channel: Efficient large language model inference with coupled quantization. Advances in Neural Information Processing Systems , 37, 3304–3331. https://doi.org/10.48550/arXiv.2405.03917 Zhu, R.-J., Zhao, Q., Li, G., & Eshraghian, J. K. (2024). SpikeGPT: Generative pre-trained language model with spiking neural networks. Transactions on Machine Learning Research . https://doi.org/10.48550/arXiv.2302.13939 Disclaimer: The views and opinions expressed in this article are personal and do not necessarily reflect the official policy or position of any associated agencies, organizations, or the India AI Mission. AI assistance was utilized in the research, drafting, and ideation of this article. Licensed under CC BY-ND 4.0. [Framework] The Asymmetric Key-Value Cache Compression was originally published in Towards AI on Medium, where people are continuing the conversation by highlighting and responding to this story.