<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sequential KV Cache Compression via Probabilistic Language Tries: Beyond the Per-Vector Shannon Limit · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2604.15356/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2604.15356/feed.xml" rel="self" type="application/rss+xml" /><item><title>Sequential KV Cache Compression via Probabilistic Language Tries: Beyond the Per-Vector Shannon Limit — HN submission</title><link>https://news.ycombinator.com/item?id=47843715</link><guid isPermaLink="false">urn:hackerpapers:submission:2604.15356:47843715</guid><pubDate>Tue, 21 Apr 2026 02:11:14 GMT</pubDate><description>&lt;p&gt;KV Cache Compression 900000x Beyond TurboQuant and Per-Vector Shannon Limit&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;46 points; 42 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2604.15356/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
