<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>MemoryTax: The Bitter Lesson of Agent Memory · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2610.29823/</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/2610.29823/feed.xml" rel="self" type="application/rss+xml" /><item><title>MemoryTax: The Bitter Lesson of Agent Memory — mentioned by netsroht</title><link>https://news.ycombinator.com/item?id=50211091</link><guid isPermaLink="false">urn:hackerpapers:mention:2610.29823:50211091</guid><pubDate>Fri, 23 Oct 2026 15:56:42 GMT</pubDate><description>&lt;p&gt;Interesting, thanks for sharing. I just skimmed a paper that argues the opposite, albeit for a single short history that fits in context [0]. I work on Caudra, an open-source coding agent [1], and I have implemented a memory system that uses a summary view like OptMem&amp;#x27;s idea of a binary merge tree that coarsens with age [2]. In addition, theres a learner that extracts useful patterns and writes those to multiple layers: AGENTS.local.md (uncommitted, local things and quirks only), AGENTS.md (project knowledge), global AGENTS.md (user-wide knowledge), and to the memory itself. But what really…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2610.29823/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>MemoryTax: The Bitter Lesson of Agent Memory — HN submission</title><link>https://news.ycombinator.com/item?id=50209933</link><guid isPermaLink="false">urn:hackerpapers:submission:2610.29823:50209933</guid><pubDate>Fri, 23 Oct 2026 14:44:43 GMT</pubDate><description>&lt;p&gt;MemoryTax: The Bitter Lesson of Agent Memory&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2610.29823/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
