{
 "_doc": "One result as verifycorelabs.com prints it: the headline, the problem and the buyer cut (never reworded) from the lab's plain-English account of the result, the one figure a buyer is shown and its limit, and the lab's current claim and limits verbatim, copied at the commit named in source. A field is left out, never reworded, when it uses a word this site keeps for its own process or names a file this site does not serve (not_reprinted).",
 "slug": "tn-bits",
 "company": "AxiomLimit",
 "order": null,
 "rank": 27,
 "served_receipt": "inference-limits/results/essentiality-bits-floor.json",
 "lab_file_older": false,
 "headline": [
  "A computer-checked proof that a memory cache shared by many customers of an artificial-intelligence (AI) service, if it must never hand one customer's cached work to another yet always reuse it whenever that is allowed, has to keep at least one bit of permission bookkeeping for every (customer, cache block) pair — but only in the case where any block may be shared with any group of customers"
 ],
 "qualification": [
  "the lab says actually ships, the floor is n·log₂T bits, exponentially smaller."
 ],
 "why": [
  "The T·n bound speaks to such a team only if its cache lets a block be authorised to an arbitrary group of customers"
 ],
 "buyer": [
  "confidential-AI product teams at cloud providers that serve many customers from one shared model cache"
 ],
 "figure": "needs at least 2^(T*n) states, i.e. at least T*n bits",
 "figure_from": "claim",
 "limit": "T*n is the DENSE rights model -- every (tenant, block) right independent. It binds when a block may be authorized to an arbitrary SUBSET of tenants (group / shared-read ACLs).",
 "limit_from": "certificate",
 "quotes": {
  "floor": "the tight floor is T^n states = n*log2(T) bits, exponentially smaller."
 },
 "claim": "A zero-leak AND full-reuse pooled-KV policy over T tenants and n cache blocks needs at least 2^(T*n) states, i.e. at least T*n bits, as one machine-checked theorem general in T and n.",
 "not_reprinted": [
  "limits"
 ],
 "prior_work": [
  {
   "title": "Selective KV-Cache Sharing to Mitigate Timing Side-Channels in LLM Inference (SafeKV)",
   "by": "Kexin Chu, Zecheng Lin, Dawei Xiang, Zixu Shen, Jianchang Su, Cheng Chu, Yiwei Yang, Wenhui Zhang, Wenfei Wu, Wei Zhang, arXiv 2508.08438, 2025",
   "url": "https://arxiv.org/abs/2508.08438"
  },
  {
   "title": "Governing the KV Cache: Preventing Timing Side-Channel Leakage in Multi-Tenant LLM Inference",
   "by": "Tejasvi C. Addagada, arXiv 2608.09225, 2026",
   "url": "https://arxiv.org/abs/2608.09225"
  },
  {
   "title": "Succinct Posets",
   "by": "J. Ian Munro, Patrick K. Nicholson, arXiv 1204.1957, 2012",
   "url": "https://arxiv.org/abs/1204.1957"
  },
  {
   "title": "Succinct data structure",
   "by": "Wikipedia, 2026",
   "url": "https://en.wikipedia.org/wiki/Succinct_data_structure"
  }
 ],
 "source": {
  "claims_file": "registry/CLAIMS_CURRENT.jsonl",
  "claims_sha256": "81776df15a1498abec7228ea179c952d01c54e031ffd4144498a30660963074b",
  "ranking_file": "views/VALUE_RANKING.md",
  "ranking_sha256": "2e980e26178b34dc49ec1d365f966be292f57d7c636143fc62c12feab72ae470",
  "dossier_sha256": "25a62498b8e0f21a058828564d0aee9ea07eb5c7a4da605dbe67780ccdbcb1bc",
  "commit": "25d755d2f06518b632c3658ae83f20312daac53e"
 }
}