The Distributed Bloom Filter — mentioned by krcz

Thu, 20 Feb 2020 11:39:29 GMT

You still need one hash for every non-leaf node, so 30-40 hashes of 256 bits each. What this algorithm saves is 30-40 indices, which is 11 bits each for a 1000-leaf tree. Even aligning to 16 bits it's doesn't seem a great optimization. Unless I misunderstood something and we are not trying to minimize the size of whole proof, but just its structure - but I see no reason why it could be useful. But I can see there are two other papers: one on distributed Bloom filters [1] and the other on Bloom trees [2], maybe these can shed some light on it, I'll check later today. [1]…

Paper and discussion history. A mention is not an endorsement.

The Distributed Bloom Filter — HN submission

Fri, 18 Oct 2019 07:17:14 GMT

The Distributed Bloom Filter

8 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

The Distributed Bloom Filter · HackerPapers discussions

The Distributed Bloom Filter — mentioned by krcz

The Distributed Bloom Filter — HN submission