Decoder-only Transformer language models cache keys and values (KV) to reuse past computation during generation.
Sharing KV across layers saves storage but reduces the diversity of representations available across depth.
We study what local memory should retain alongside shared global KV, separating historical content from the input source used to form it.
Results
At 126M parameters and 2K context, an eight-seed study finds about 1.4% lower held-out test perplexity with local history than with a current-token local branch.
Capacity, entry-count and training-compute controls support the value of historical content.
In a two-seed comparison, this value persists when adjacent layers share local inputs while retaining independent projections; source sharing also shortens exact cache-construction dependencies.
Against GQA and adjacent-layer KV sharing, equal bounded learning-rate searches and new-seed confirmation yield better same-source likelihood with larger caches and higher long-request latency.
The ordering against adjacent-layer sharing persists after equal-token adaptation to 8K, with a short-context cost.
External Book History Effect
The eight-seed external-book history effect remains uncertain, and downstream outcomes vary by task.
Sufficient Suffix Schedule
We derive a sufficient suffix schedule that reduces upper-layer construction work while preserving the complete cache in exact arithmetic.