https://hackerpaper.kaipfister.de/p/2608.01326/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=49513339urn:hackerpapers:mention:2608.01326:49513339Mon, 31 Aug 2026 18:46:14 GMT<p>A recent paper, Context Compaction Theory (arXiv:2608.01326) puts a floor on how much you can compact an agent&#x27;s memory. They measured Opus 4.8 against the floor. 4.8 lands on the random-guess line for membership queries. Not very good; but at least it&#x27;s latent and $-spendy? I ran the same probes against Wunderblock, which is based on vector-symbolic architecture, and got 84% of the floor with no LLM at all. Bloom filters sit at 55%. LLMs are overused!</p><p><a href="https://hackerpaper.kaipfister.de/p/2608.01326/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DShttps://news.ycombinator.com/item?id=49164228urn:hackerpapers:submission:2608.01326:49164228Tue, 04 Aug 2026 03:58:14 GMT<p>Context Compaction Theory</p><p></p><p>1 point; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2608.01326/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS