rateless-iblt · research · also Rateless invertible Bloom lookup table

Rateless IBLT

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.

Related Observatory article: Rateless IBLT on hesela.com

Yang, Gilad and Alizadeh's SIGCOMM 2024 construction extends a compatible symbol stream rather than resizing and rebuilding a fixed table. [1] It is a research protocol here, not a claim of deployment in Cassandra or a universal replacement for Merkle trees.

Relations

related

invertible-bloom-lookup-table, set-reconciliation, merkle-tree

Limitations

• Encoding cost still depends on the input-set size; difference-sensitive communication does not make reading or encoding the input free. [1]

Citations

1. 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. (accessed 2026-10-16)
2. Hesela: Replica repair, set reconciliation and record identity (accessed 2026-10-16)

JSON: /data/terms/rateless-iblt.json