commit 848bdae1a2ad5495da88edc22db1ce6184eb9ecf
parent 79acd5b791f4d6fd5afe6ef00efd2748e3459c53
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date: Sat, 12 Mar 2022 08:57:14 +0100
modulo
Diffstat:
1 file changed, 6 insertions(+), 6 deletions(-)
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
@@ -749,7 +749,7 @@ bchar = *(ALPHA / DIGIT)
a BF is either "no" or "maybe".
</t>
<t>
- Bloom filters are defined as a string of <tt>N</tt> bits always
+ Bloom filters are defined as a string of <tt>L</tt> bits always
initially empty, consisting only of zeroes.
There are two functions which can be invoked on the Bloom filter:
BF-SET(bf, e) and BF-TEST(bf, e) where "e" is an element which is to
@@ -763,14 +763,14 @@ bchar = *(ALPHA / DIGIT)
</t>
<t>
When adding an element to the bloom filter <tt>bf</tt> using
- <tt>BF-SET(bf,e)</tt>, each number <tt>n</tt> in the mapping
- <tt>M(e)</tt> is interpreted as a bit offset within <tt>bf</tt> and set
- to 1.
+ <tt>BF-SET(bf,e)</tt>, each integer <tt>n</tt> of the mapping
+ <tt>M(e)</tt> is interpreted as a bit offset <tt>n mod L</tt> within
+ <tt>bf</tt> and set to 1.
</t>
<t>
When testing if an element is in the bloom filter <tt>bf</tt> using
- <tt>BF-TEST(bf,e)</tt>, each number <tt>n</tt> in the mapping
- <tt>M(e)</tt> <bcp14>MUST</bcp14> have been set to 1.
+ <tt>BF-TEST(bf,e)</tt>, each bit offset <tt>n mod L</tt> within
+ <tt>bf</tt> <bcp14>MUST</bcp14> have been set to 1.
Otherwise, the element is not considered to be in the bloom filter.
</t>
</section>