When a language model generates text one token at a time, it repeatedly rereads stored information about earlier tokens. Compressing this cache saves memory traffic, but unpacking and correcting its values can consume enough processor work to erase the gain.
FOSCAR uses affine folding: each group’s shared scale, a multiplier, and offset, a value added, are applied to other parts of the calculation rather than to every cached value. It also prepares the packed values for specialized graphics-processor matrix hardware.
The method preserves the exact attention result in exact arithmetic. In long-context serving tests, peak throughput rose by up to 170% and 341% against the two reported cache baselines. That means more requests can be served without the cache preparation becoming the bottleneck.
