Bloom filters are a really interesting data structure. Whenever I found out about them I really wanted to use them, so I ended up building a distributed hash ta

Bloom filters are a really interesting data structure. Whenever I found out about them I really wanted to use them, so I ended up building a distributed hash table. I thought bloom filters could be an interesting way to optimize key lookup value throughout the network, as I could use a bloom filter to state that a remote node definitely didn't have a key (therefore, no need to send a request to them) or if a node likely had a key (therefore, sending a request to get the key's value). Naturally, if consensus were established between nodes, using something like this would be unnecessary, but it turned out to be an interesting way of optimizing lookups in a DHT.