{
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Encoding cost still depends on the input-set size; difference-sensitive communication does not make reading or encoding the input free.",
      "citationIds": [
        "rateless2024"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-16",
  "slug": "rateless-iblt",
  "term": "Rateless IBLT",
  "aliases": [
    "Rateless invertible Bloom lookup table"
  ],
  "definition": "Rateless IBLT is a set-reconciliation scheme that streams additional coded symbols until the receiver can recover the set difference without first estimating its size.",
  "note": "Yang, Gilad and Alizadeh's SIGCOMM 2024 construction extends a compatible symbol stream rather than resizing and rebuilding a fixed table. [rateless2024] It is a research protocol here, not a claim of deployment in Cassandra or a universal replacement for Merkle trees.",
  "related": [
    "invertible-bloom-lookup-table",
    "set-reconciliation",
    "merkle-tree"
  ],
  "citations": [
    {
      "id": "rateless2024",
      "title": "Lei Yang, Yossi Gilad and Mohammad Alizadeh. Practical Rateless Set Reconciliation. SIGCOMM 2024, sections 3-4 and 7.2-7.3. DOI: 10.1145/3651890.3672219.",
      "url": "https://arxiv.org/html/2402.02668v3",
      "accessed": "2026-10-16"
    },
    {
      "id": "hesela-repair",
      "title": "Hesela: Replica repair, set reconciliation and record identity",
      "url": "https://hesela.com/analyses/replica-repair-coverage/#set-reconciliation",
      "accessed": "2026-10-16"
    }
  ]
}