3 ms·
I used one in a bittorrent-like protocol, each block hash was added to the filter then sent to peers. Peers could then have a high accuracy way of checking if a
by PaulBGD_ 7y ago
I used one in a bittorrent-like protocol, each block hash was added to the filter then sent to peers. Peers could then have a high accuracy way of checking if a peer has a block without having to communicate with them.
- vamega 7y agoIs there any code that you can point to with this implementation?
- PaulBGD_ 7y agoSorry I haven't released anything, potentially in the future.
- faceplanted 7y agoThat's really quite cool, how many blocks could an instance potentially have though? Seems unlikely you'd be saving that much space over having a list
- PaulBGD_ 7y agoSorry I wasn't clear, each peer maintains their own personal bloom filter that contains the hashes of the blocks that they have. The filters are sent upon connections with another peer and updated every so often.