From 4aff90a4ef40cbde68649dfb4ae7de68e02ba6e1 Mon Sep 17 00:00:00 2001 From: bitcoin Date: Thu, 5 Dec 2019 15:11:52 -0500 Subject: [PATCH] wiki commit --- protocol/forks/bip-0037.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/protocol/forks/bip-0037.md b/protocol/forks/bip-0037.md index f63b26f..0da01f2 100644 --- a/protocol/forks/bip-0037.md +++ b/protocol/forks/bip-0037.md @@ -14,7 +14,7 @@ ## Abstract -This BIP adds new support to the peer-to-peer protocol that allows peers to reduce the amount of transaction data they are sent. Peers have the option of setting ''filters'' on each connection they make after the version handshake has completed. A filter is defined as a [http://en.wikipedia.org/wiki/Bloom_filter Bloom filter] on data derived from transactions. A Bloom filter is a probabilistic data structure which allows for testing set membership - they can have false positives but not false negatives. +This BIP adds new support to the peer-to-peer protocol that allows peers to reduce the amount of transaction data they are sent. Peers have the option of setting ''filters'' on each connection they make after the version handshake has completed. A filter is defined as a [Bloom filter](http://en.wikipedia.org/wiki/Bloom_filter) on data derived from transactions. A Bloom filter is a probabilistic data structure which allows for testing set membership - they can have false positives but not false negatives. This document will not go into the details of how Bloom filters work and the reader is referred to Wikipedia for an introduction to the topic.