<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2405.16444/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2405.16444/feed.xml" rel="self" type="application/rss+xml" /><item><title>CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion — mentioned by wren6991</title><link>https://news.ycombinator.com/item?id=48510228</link><guid isPermaLink="false">urn:hackerpapers:mention:2405.16444:48510228</guid><pubDate>Fri, 12 Jun 2026 22:41:27 GMT</pubDate><description>&lt;p&gt;Prefix caching is already widely deployed by all providers, right? llama.cpp does it. vLLM does it. I&amp;#x27;m sure everyone hosting LLMs for a living does it. This paper seems to focus entirely on prefixes (i.e. the prefilled content is rooted at 0). This is... nothing. The referenced CacheBlend paper (https://arxiv.org/pdf/2405.16444) which tries to stitch together multiple independent prefills looks more interesting and is new to me. The problem it&amp;#x27;s trying to solve is: * KV projections for a given token at a given layer are a function of the residual at that layer, * which is a function of the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2405.16444/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion — mentioned by tucnak</title><link>https://news.ycombinator.com/item?id=44407635</link><guid isPermaLink="false">urn:hackerpapers:mention:2405.16444:44407635</guid><pubDate>Sat, 28 Jun 2025 19:53:33 GMT</pubDate><description>&lt;p&gt;&amp;quot;Blending,&amp;quot; or translating arbitrary substrings to prefixes, is a real curious one, &amp;amp; likely become a prerequisite for running dataset-scale LLM inferences at scale. See https://arxiv.org/abs/2405.16444v3 &amp;gt; To speed up the prefill of the long LLM inputs, one can pre-compute the KV cache of a text and re-use the KV cache when the context is reused as the prefix of another LLM input. However, the reused text chunks are not always the input prefix, which makes precomputed KV caches not directly usable since they ignore the text’s cross-attention with the preceding texts. Thus, the benefits of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2405.16444/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion — mentioned by da-x</title><link>https://news.ycombinator.com/item?id=44404502</link><guid isPermaLink="false">urn:hackerpapers:mention:2405.16444:44404502</guid><pubDate>Sat, 28 Jun 2025 13:16:27 GMT</pubDate><description>&lt;p&gt;Yes, there&amp;#x27;s KV cache &amp;#x27;Blending&amp;#x27; see [1]. Future versions of LMCache are aiming to support this. [1] CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion- https://arxiv.org/abs/2405.16444&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2405.16444/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
