Author: Peter Todd 2014-06-10 17:08:46
Published on: 2014-06-10T17:08:46+00:00
In this email conversation between Mike Hearn and Jeff Garzik, they discuss the potential impact of privacy-focused bloom filters on the Bitcoin network. Mike argues that sending different bloom filters to different peers for privacy reasons would create an O(n) cost per query, which would greatly increase the load on the network and appear like a DoS attack. He suggests that prefix filtering might be a better approach, but Jeff counters that it still creates pagecache pressure and disk activity issues. They both agree that there isn't just one optimal way to implement filters for blockchain data, and that a service with different tradeoffs should be advertised with NODE_BLOOM. They also note that an upgrade will be needed to allow nodes to advertise ranges of blocks to fix the issue of pagecache pressure.
Updated on: 2023-06-08T23:44:58.433552+00:00