diff options
| author | Jean-Pierre Rupp <root@xeno-genesis.com> | 2014-09-08 17:17:24 +0100 |
|---|---|---|
| committer | Jean-Pierre Rupp <root@xeno-genesis.com> | 2014-09-08 17:17:24 +0100 |
| commit | cce1e10dc86186e99f135777c137a4cc61f63e33 (patch) | |
| tree | 23de2bf198f18df6c624b1d4dac866c3bd0ad338 | |
| parent | 4b2d40ad1240909354388d8385eebeb7fb44cf42 (diff) | |
| download | bips-cce1e10dc86186e99f135777c137a4cc61f63e33.tar.xz | |
Changed left angles for HTML entity
| -rw-r--r-- | bip-0037.mediawiki | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/bip-0037.mediawiki b/bip-0037.mediawiki index 8179393..f1561be 100644 --- a/bip-0037.mediawiki +++ b/bip-0037.mediawiki @@ -195,7 +195,7 @@ When loading a filter with the <code>filterload</code> command, there are two pa Let N be the number of elements you wish to insert into the set and P be the probability of a false positive, where 1.0 is "match everything" and zero is unachievable. -The size S of the filter in bytes is given by <code>(-1 / pow(log(2), 2) * N * log(P)) / 8</code>. Of course you must ensure it does not go over the maximum size (36,000: selected as it represents a filter of 20,000 items with false positive rate of < 0.1% or 10,000 items and a false positive rate of < 0.0001%). +The size S of the filter in bytes is given by <code>(-1 / pow(log(2), 2) * N * log(P)) / 8</code>. Of course you must ensure it does not go over the maximum size (36,000: selected as it represents a filter of 20,000 items with false positive rate of < 0.1% or 10,000 items and a false positive rate of < 0.0001%). The number of hash functions required is given by <code>S * 8 / N * log(2)</code>. |