do-riblt 1.0.1

An implementation of rateless invertable bloom lookup tables
Documentation
  • Coverage
  • 88.24%
    15 out of 17 items documented1 out of 14 items with examples
  • Size
  • Source code size: 17.55 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 3.06 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 14s Average build duration of successful builds.
  • all releases: 13s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • doEggi/do-riblt
    0 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • doEggi

An efficient implementation of Rateless Invertable Bloom Lookup Tables (riblt) The paper can be found here: https://arxiv.org/abs/2402.02668

This crate can be used to efficiently synchronize sets between two devices Why use riblts?

  1. they are rateless (there are infinite symbols)
  2. they are universal (you don't need to know anything from the other side to begin with)
  3. they provide low transportation cost (only around 1.3 to 1.7 the amount of symbols need to be send)
  4. they provide low computation cost (by using mostly XOR operations)