LRU is harder to beat than the KV-cache papers suggest

Reproducing agentic KV-cache policy claims on real traces. 68k requests from 393 Claude Code sessions. LRU is harder to beat than the papers suggest. - gauravapiscean/agentic-kv-cache
100 points by gauravapiscean 41 days ago github.com 47 comments
Summary not yet generated for this article.

Comments (47 of ) ⌛

Loading more comments... ⌛
Scroll down to load more comments
No comments available.
Type to search HN and engineering blog articles
Press Escape to close  |  ↑↓ to navigate  |  Enter to open