MaSRead Routes Queries via Keyed Tag Sets to Isolate Fragments in CRDT-Merged Latent KV Caches

The paper introduces MaSRead to solve addressability failures in conflict-free replicated data types that merge agent-generated KV cache fragments. Fragments converge under arbitrary delivery order yet interfere when colocated. Routing constructs tag sets from lexical content, then applies per-fragment hard masks during decode so only the addressed fragment activates. Experiments report full recovery of visited fragments while unrelated fragments accumulate, with materialization cost scaling to fragment length rather than store size.

Lexical connectivity graphs enable multi-hop traversal that reaches required evidence for later queries unknown at encode time. Recovery holds when transferring between model families. Limits remain explicit: disconnected fragments evade lexical walks and composition stays bounded by the frozen reader model. End-to-end latency still includes store-dependent routing plus one decode per visited fragment.

This pattern extends prior KV cache sharing work by replacing text exchange with content-addressable latent fragments. Operational impact appears in multi-agent systems where memory footprint grows linearly with agents yet selective reads stay constant per query. Deployment requires lexical overlap between queries and stored fragments; otherwise recall drops without additional indexing layers.

Next steps include hybrid routing that augments lexical walks with learned embeddings and tests on production agent traces exceeding 10^5 fragments. Open release of tag-set construction code would allow direct measurement against baseline KV cache eviction policies.