<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2604.24827/</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/2604.24827/feed.xml" rel="self" type="application/rss+xml" /><item><title>Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity — mentioned by WarmWash</title><link>https://news.ycombinator.com/item?id=49544125</link><guid isPermaLink="false">urn:hackerpapers:mention:2604.24827:49544125</guid><pubDate>Wed, 02 Sep 2026 23:43:17 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s not totally a mystery https://arxiv.org/html/2604.24827v1 The short of it is by using hard facts knowledge that is difficult to compress, and then quizzing models on these facts and calibrating against a bunch of open models, you can kind of feel out the size of closed models.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2604.24827/"&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>Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity — mentioned by thoughtpeddler</title><link>https://news.ycombinator.com/item?id=49203292</link><guid isPermaLink="false">urn:hackerpapers:mention:2604.24827:49203292</guid><pubDate>Thu, 06 Aug 2026 22:09:20 GMT</pubDate><description>&lt;p&gt;Oh ya, this is like the approach from the Incompressible Knowledge Probes [0] paper - smart! [0] Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity [https://arxiv.org/abs/2604.24827]&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2604.24827/"&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>Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity — mentioned by Chyzwar</title><link>https://news.ycombinator.com/item?id=48284233</link><guid isPermaLink="false">urn:hackerpapers:mention:2604.24827:48284233</guid><pubDate>Tue, 26 May 2026 18:56:17 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2604.24827 From this paper&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2604.24827/"&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>Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity — mentioned by WarmWash</title><link>https://news.ycombinator.com/item?id=48208492</link><guid isPermaLink="false">urn:hackerpapers:mention:2604.24827:48208492</guid><pubDate>Wed, 20 May 2026 14:30:17 GMT</pubDate><description>&lt;p&gt;Opus is estimated to be around 4T parameters, and 5.5 around 9T. [1] And while 3.5 at least qualifies to be in the same neighborhood, which is stunning if these numbers are all true, it may be that closing that last ~10% difference needs 50x more parameters. [1]https://arxiv.org/pdf/2604.24827&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2604.24827/"&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>Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity — mentioned by schmorptron</title><link>https://news.ycombinator.com/item?id=47985280</link><guid isPermaLink="false">urn:hackerpapers:mention:2604.24827:47985280</guid><pubDate>Sat, 02 May 2026 10:56:52 GMT</pubDate><description>&lt;p&gt;Associated paper: https://arxiv.org/html/2604.24827v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2604.24827/"&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>Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity — HN submission</title><link>https://news.ycombinator.com/item?id=47960159</link><guid isPermaLink="false">urn:hackerpapers:submission:2604.24827:47960159</guid><pubDate>Thu, 30 Apr 2026 09:38:42 GMT</pubDate><description>&lt;p&gt;Estimating Black-Box LLM Parameter Counts via Factual Capacity&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2604.24827/"&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>
