<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2601.07372/</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/2601.07372/feed.xml" rel="self" type="application/rss+xml" /><item><title>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models — mentioned by softwarewright</title><link>https://news.ycombinator.com/item?id=49554956</link><guid isPermaLink="false">urn:hackerpapers:mention:2601.07372:49554956</guid><pubDate>Thu, 03 Sep 2026 18:59:12 GMT</pubDate><description>&lt;p&gt;How does your Engram compare to the Engram in this paper? https://arxiv.org/abs/2601.07372&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2601.07372/"&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>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models — mentioned by kzrdude</title><link>https://news.ycombinator.com/item?id=49469794</link><guid isPermaLink="false">urn:hackerpapers:mention:2601.07372:49469794</guid><pubDate>Thu, 27 Aug 2026 19:13:09 GMT</pubDate><description>&lt;p&gt;By the way; I found that DeepSeek says that it is even an &amp;quot;ideal complement to modern MoE architecture&amp;quot; https://arxiv.org/abs/2601.07372v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2601.07372/"&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>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models — mentioned by arw0n</title><link>https://news.ycombinator.com/item?id=47539523</link><guid isPermaLink="false">urn:hackerpapers:mention:2601.07372:47539523</guid><pubDate>Fri, 27 Mar 2026 06:05:55 GMT</pubDate><description>&lt;p&gt;See also the new Deepseek paper on engram transformers for some progress in this area: https://arxiv.org/pdf/2601.07372v1 They observe significant gains in factual knowledge retrieval capabilities, but reasoning barely moves the needle.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2601.07372/"&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>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=47508506</link><guid isPermaLink="false">urn:hackerpapers:submission:2601.07372:47508506</guid><pubDate>Tue, 24 Mar 2026 20:16:33 GMT</pubDate><description>&lt;p&gt;DeepSeek: Conditional Memory via Scalable Lookup&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;7 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2601.07372/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=46701371</link><guid isPermaLink="false">urn:hackerpapers:submission:2601.07372:46701371</guid><pubDate>Wed, 21 Jan 2026 05:08:33 GMT</pubDate><description>&lt;p&gt;Subject-based weight routing for LLMs (27 days before DeepSeek Engram)&lt;/p&gt;&lt;p&gt;I run LLM inference on an IBM POWER8 S824 with 576GB RAM – a $700 eBay server from 2014. In December 2025, I built &amp;quot;RAM Coffers&amp;quot; – banking model weights by subject domain with hot caching and resonance routing. On January 12, 2026, DeepSeek published &amp;quot;Engram&amp;quot; (arXiv:2601.07372) describing the same core idea: route queries to cached weight banks based on subject matter. The concepts are similar because I built it first. YouTube video from December 17, 2025: https://youtu.be/T_o39s7r0iE Terminal shows &amp;quot;RAM Coffers: ON | L2/L3 Resident: ON&amp;quot; – 26 days before their paper. Core shared concept…&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2601.07372/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models — mentioned by AutoJanitor</title><link>https://news.ycombinator.com/item?id=46683161</link><guid isPermaLink="false">urn:hackerpapers:mention:2601.07372:46683161</guid><pubDate>Mon, 19 Jan 2026 19:15:06 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m an independent researcher running LLMs on an IBM POWER8 server (320GB RAM, vintage 2015 hardware). On December 16, 2025, I developed &amp;quot;RAM Coffers&amp;quot; - a NUMA-distributed conditional memory system that selectively houses model weights in RAM banks with resonance-based routing for O(1) knowledge retrieval. On January 12, 2026, DeepSeek published their &amp;quot;Engram&amp;quot; paper (arXiv:2601.07372) describing the same core concept: separating static knowledge from dynamic computation via O(1) lookup. Same idea. 27 days apart. No connection. DOI: 10.6084/m9.figshare.31093429 GitHub…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2601.07372/"&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>Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Models — HN submission</title><link>https://news.ycombinator.com/item?id=46607832</link><guid isPermaLink="false">urn:hackerpapers:submission:2601.07372:46607832</guid><pubDate>Tue, 13 Jan 2026 20:55:40 GMT</pubDate><description>&lt;p&gt;Conditional Memory via Scalable Lookup&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2601.07372/"&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>
