Enhancing Bitcoin's Transaction Privacy With Bloom Filters

Written by yourdevopsguy | Published 2021/02/12
Tech Story Tags: bitcoin | filter | tutorial | distributed-systems | spv | merkle-tree | bitcoin-spotlight | hackernoon-top-story | web-monetization

TLDR Bloom filters are a data structure developed by Burton Howard Bloom in 1970. They only remember whether an object has been added to the filter. In contrast with hash tables, Bloom filters do not store objects. They behave more like sets and do not allow deletions. The probability of a false positive is a function of the size of the filter and the number of hash functions, as we will see in the next section. Bitcoin light clients are using Bloom Filters to make Bitcoin transactions easier to use.via the TL;DR App
no story
Written by yourdevopsguy | Software engineer: previously at Amazon and now at eBay. Certified Professional Cloud Architect.
Published by HackerNoon on 2021/02/12
ABOUTHow hackers start their afternoons. We publish tech stories and build publishing software.

READEntirely free library read by hundreds of millions to learn anything about any technology.

WRITEHackerNoon elevates quality technology writing far and wide across the interwebs.

PARTNERHackerNoon works directly with tech companies to place ads by content relevancy