Can remote storage beat recomputing cached model states?
Whether loading KV cache from remote object storage is now faster than full prefill recomputation. This matters because it determines whether offloading cache improves latency or trades speed for storage savings.
The paper's discussion section overturns what it calls a traditional assumption about offloading KV cache to remote storage. "Traditionally, it was believed that loading KV cache from remote storage primarily improves cache hit rates and reduces storage costs... but at the cost of increased inference latency, since loading data from remote devices was thought to be slower than performing a full prefill." The authors report this tradeoff no longer holds for at least one of LMCache's users: "Company C... adopted LMCACHE to load KV caches from their own remote object store, achieving 22–32% lower TTFT compared to full prefill" — loading cached states beat recomputing them outright.
The shift traces to storage hardware rather than to LMCache's own software. The old assumption rested on "the historically low throughput of remote object stores such as Amazon S3, which offered loading speeds as low as 100 MBps." The paper notes that "with Amazon S3 Express, the throughput has increased from 100 MBps to nearly 1 GBps," and argues that once a remote backend is fast enough, it "can simultaneously improve cache hit ratios and reduce TTFT" rather than trading one for the other.
This finding is the production evidence behind the broader architecture described in Can KV cache move off GPU memory for reuse?. It also qualifies the caution in Does prompt caching actually reduce agentic LLM costs? : here, whether offloaded caching helps or hurts latency depends on the backing store's throughput, not on caching as such. The same discussion section separately reports, from "real traces from Company F," that truncating long-context inputs to keep only the most recent tokens drops prefix cache hit ratios "from roughly 85% to 45%," and cites "other studies" (Ji, 2025) making a related point about dynamically edited context invalidating prefix reuse — a phenomenon Does dynamic tool discovery break prompt caching benefits? describes for a different mechanism, changing tool schemas rather than truncating context; the excerpt does not name MCP or claim either paper updates the other.
Both figures come from single, anonymized enterprise customers (Company C, Company F), reported by LMCache's own developers rather than by an independent study. The 22–32% TTFT improvement depends on the customer's own remote object store matching or exceeding S3 Express-class throughput, a condition the excerpt does not establish as typical across deployments. The finding is best read as a case report that remote KV cache offloading's latency cost can now turn negative under favorable storage conditions, not as a general benchmark of remote-versus-local cache loading.
Inquiring lines that read this note 5
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
How can language models effectively manage long-context memory without quality degradation?- How does PagedAttention differ from LMCache in solving KV cache memory limits?
- Can KV cache offloading generalize beyond vLLM and SGLang inference engines?
- What latency tradeoffs emerge when moving KV cache between GPU and CPU storage?
- What storage hardware conditions are needed for offloading to reduce latency?
Related concepts in this collection 3
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Can KV cache move off GPU memory for reuse?
KV cache has traditionally stayed locked in GPU memory for single queries. Can extracting it to external storage and reusing it across queries and engines meaningfully boost throughput in real enterprise workloads?
sibling note on the system this production finding comes from
-
Does prompt caching actually reduce agentic LLM costs?
Explores whether prompt caching—reusing computed attention tensors across repeated prompt prefixes—delivers claimed cost and latency gains across major LLM providers, and whether naive implementation strategies backfire.
qualifies that benchmark's latency caution by showing fast-enough remote storage can cut latency, not just cost
-
Does dynamic tool discovery break prompt caching benefits?
When agentic systems discover tools dynamically through protocols like MCP, does the changing tool set invalidate cached prompt prefixes? Understanding this matters for cost-conscious production workflows.
the excerpt's context-truncation finding cites other studies on the same cache-invalidating-context-change phenomenon this note describes for tool discovery
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- LMCache: An Efficient KV Cache Layer for Enterprise-Scale LLM Inference
- Don't Break the Cache: An Evaluation of Prompt Caching for Long-Horizon Agentic Tasks
- Efficient Memory Management for Large Language Model Serving with PagedAttention
- What Does a Harness Buy? Tokens, Mostly
- Personalized Dialogue Generation with Persona-Adaptive Attention
- q0: Primitives for Hyper-Epoch Pretraining
- Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models
- The Last AI Built by Humans: Toward Genuine Recursive Self-Improvement
Original note title
remote KV cache storage now loads faster than full prefill recomputation — Company C saw 22-32% lower time-to-first-token