Mark Mason
Well-known member
What Are Invertible Bloom Lookup Tables?
This is the second in a series of articles explaining technical concepts related to on-chain network scaling, block propagation, and other related subjects
Last week, we explored a bloom filter as a data structure that helps identify a set. A related data structure is an Invertible Bloom Lookup Table or IBLT. An IBLT serves a similar function and has the advantage that missing members can be identified. Here we will provide a simplified explanation for what an IBLT is.
Read more - https://dashnews.org/what-are-invertible-bloom-lookup-tables/
This is the second in a series of articles explaining technical concepts related to on-chain network scaling, block propagation, and other related subjects
Last week, we explored a bloom filter as a data structure that helps identify a set. A related data structure is an Invertible Bloom Lookup Table or IBLT. An IBLT serves a similar function and has the advantage that missing members can be identified. Here we will provide a simplified explanation for what an IBLT is.
Read more - https://dashnews.org/what-are-invertible-bloom-lookup-tables/