Foundations of Blockchain

Invertible bloom lookup tables

Invertible bloom lookup tables can be used to efficiently find the difference between the two datasets. This concept has been implemented in Bitcoin to achieve lower transaction exchange latency between peers. Without any mechanism to find the difference between two sets, each Bitcoin node had to keep transferring its own transaction set to the network and expect other nodes to reply with transactions that did not exist in the transaction set. This mechanism consumed a lot of Bitcoin network bandwidth and time due to the large set of transactions in each node.

A solution is to transfer information that could be used to find the difference between datasets efficiently. Invertible bloom lookup tables solve this ...