Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity
Bojie Li

TL;DR
This paper introduces Incompressible Knowledge Probes (IKPs), a benchmark to estimate the number of parameters in black-box language models by measuring factual knowledge, revealing continued scaling of factual capacity.
Contribution
The paper presents IKPs as a new method to estimate model size from knowledge, with a calibrated mapping across numerous models, challenging assumptions about the end of scaling.
Findings
IKP accuracy correlates strongly with parameter count (R^2=0.917).
Factual capacity scales log-linearly with parameters across models and vendors.
Scaling of factual knowledge continues, contrary to reasoning benchmark saturation.
Abstract
Closed-source frontier labs do not disclose parameter counts, and the standard alternative -- inference economics -- carries + uncertainty from hardware, batching, and serving-stack assumptions external to the model. We exploit a tighter intrinsic bound: storing facts requires at least (bits per parameter) weights, so measuring how much a model \emph{knows} lower-bounds how many parameters it \emph{has}. We introduce \textbf{Incompressible Knowledge Probes (IKPs)}, a benchmark of 1{,}400 factual questions spanning 7 tiers of obscurity, designed to isolate knowledge that cannot be derived by reasoning or compressed by architectural improvements. We calibrate a log-linear mapping from IKP accuracy to parameter count on 89 open-weight models (135M--1,600B) spanning 19 vendors, achieving ; leave-one-out cross-validation confirms generalization (median fold…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
