Author: Gregory Maxwell 2015-02-20 17:50:11
Published on: 2015-02-20T17:50:11+00:00
In a message thread from February 2015, Mike Hearn discusses a potential approach to matching blocks with transactions. The approach requires a lower false positive rate filter set rather than a high one for privacy purposes. However, the larger filters may result in higher baseline bandwidth. It is revealed that this approach relies on committed bloom filters rather than committed UTXO sets.
Updated on: 2023-05-19T19:49:21.075412+00:00