Using Bloom filters to efficiently synchronise hash graphs
This is nice. How does it compare to something like a polynomial based representation like in [1] (used by the old keyserver gossip network)? I find Bloom filters more intuitive to reason about, but [1] does mention them as prior work and seems to think its scheme outperforms them.<p>[1] <a href="http:&#x2F;&#x2F;dx.doi.org&#x2F;10.1109&#x2F;TIT.2003.815784" rel="nofollow">http:&#x2F;&#x2F;dx.doi.org&#x2F;10.1109&#x2F;TIT.2003.815784</a> <a href="http:&#x2F;&#x2F;ipsit.bu.edu&#x2F;documents&#x2F;ieee-it3-web.pdf" rel="nofollow">http:&#x2F;&#x2F;ipsit.bu.edu&#x2F;documents&#x2F;ieee-it3-web.pdf</a>