Fetching from the wire…
Public story · 2026-08-16 · high
A token-table indirection layer repacks live tokens around the holes, lifting SLA-bound throughput up to 1.37x under tight KV budgets.
Why now: The arXiv paper posted on August 16 with a working vLLM patch attached, not just benchmark numbers.
vToken recovers 27.2% to 72.3% of the KV cache blocks vLLM wastes during eviction, per a paper posted August 16. That waste caps how many requests a server can hold in memory. Recovering it lifts SLA-constrained throughput as much as 1.37x and, under a tight active-KV budget, doubles the concurrency a server can handle.
The mismatch is architectural. Eviction algorithms like H2O and Scissorhands drop individual tokens, but PagedAttention only frees memory in fixed-size blocks. Evict a token from the middle of a block, and the hole sits unusable until the whole block empties.
vToken's fix is a token-table indirection layer that tracks which tokens in a block are still live. Asynchronous repacking then moves those tokens together to free whole blocks, without changing PagedAttention's kernels or breaking CUDA Graph compatibility.
The paper also reports that adding a new eviction policy now takes under 50 lines of code, down from more than 500. It calls vToken a working vLLM patch, not a simulation.
Each link below shares sources, entities, or timing with this story.
Learned KV eviction has a soft-to-hard mismatch: training uses differentiable gates that attenuate contributions, but inference only saves memory when entries are physically removed (arXiv 2608.23296). A controlled 2x2x2 over attention type, learned gating and positional encod...
The method stores hardware kernel optimization trajectories, with correctness and performance feedback, in an Experience Graph Memory that preserves decision order, observed outcomes, and abandoned branches, then retrieves under a fixed token budget (arXiv 2608.25570). Under t...
Sampled softmax cuts the O(nK) memory of full-vocabulary classification to O(nk), but for fixed budget B = n·k it's been unclear whether to buy batch or negatives (arXiv 2608.11061). Analyzing convergence under standard smoothness and variance assumptions, the fastest converge...
NVIDIA's Molt explicitly targets a codebase "compact and clean enough for a researcher to hold in their head, and for an AI coding assistant to read and reason about in its entirety." First major framework I've seen name agent-readability as a first-class architectural constra...
$3,054 against $38,370. Same benchmark, better score. Praxist (arXiv 2608.25955, submitted August 26) replaces per-attempt agent memory with a typed evidence graph of findings, plus lane-structured frontiers and agendas, so later attempts inherit validated mechanisms rather th...
Nearly all cache-compaction research assumes a static context where future queries are known offline, which agents never have. Comparing token eviction against attention matching across proxy-query sources on BrowseComp-Plus and WideSearch, compacting a turn immediately often...
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.