1
0
mirror of https://github.com/bitcoinbook/bitcoinbook synced 2024-11-29 11:28:20 +00:00

Edited ch10_network.adoc with Atlas code editor

This commit is contained in:
clenser 2023-10-19 15:29:32 +00:00
parent 511e5ea6dc
commit 1cb4c71aae

View File

@ -599,7 +599,7 @@ rather than ((("Bitcoin network", "lightweight clients", startref="bitcoin-netwo
[[bloom_filters]] [[bloom_filters]]
=== Bloom Filters === Bloom Filters
A bloom filter is a probabilistic search filter, a way A bloom filter((("Bitcoin network", "bloom filters", "operational overview", id="bitcoin-network-bloom-overview")))((("bloom filters", "operational overview", id="bloom-overview"))) is a probabilistic search filter, a way
to describe a desired pattern without specifying it exactly. Bloom to describe a desired pattern without specifying it exactly. Bloom
filters offer an efficient way to express a search pattern while filters offer an efficient way to express a search pattern while
protecting privacy. They are used by lightweight clients to ask their peers for protecting privacy. They are used by lightweight clients to ask their peers for
@ -712,7 +712,7 @@ is a certainty. In simple terms, a negative match on a bloom filter is a
<<bloom5>> is an example of testing the existence of pattern "Y" in the <<bloom5>> is an example of testing the existence of pattern "Y" in the
simple bloom filter. One of the corresponding bits is set to +0+, so the simple bloom filter. One of the corresponding bits is set to +0+, so the
pattern is definitely not a match. pattern is definitely((("Bitcoin network", "bloom filters", "operational overview", startref="bitcoin-network-bloom-overview")))((("bloom filters", "operational overview", startref="bloom-overview"))) not a match.
[[bloom5]] [[bloom5]]
.Testing the existence of pattern "Y" in the bloom filter. The result is a definitive negative match, meaning "Definitely Not!" .Testing the existence of pattern "Y" in the bloom filter. The result is a definitive negative match, meaning "Definitely Not!"