lsd0004

commit 72bacff6ff6a39dc49bb6f4857c1291ab8635a54
parent 83ffb4d936894800b6f68b17a2b9e56908ab8bb4
Author: Martin Schanzenbach <schanzen@gnunet.org>
Date:   Tue, 30 Nov 2021 16:39:07 +0100

start bf

Diffstat:
M
draft-schanzen-r5n.xml
 | 
16
++++++++++++----

1 file changed, 12 insertions(+), 4 deletions(-)
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
@@ -349,9 +349,6 @@ see how we can offer even the most minimal protections against peer
      <t>
      </t>
    </section>
-   <section anchor="messages" numbered="true" toc="default">
-     <name>Message Processing</name>
-   </section>
    <section anchor="routing" numbered="true" toc="default">
      <name>Routing</name>
      <section anchor="peer_selection" numbered="true" toc="default">
@@ -401,9 +398,20 @@ END
      </section>
    </section>
    <section anchor="p2p_messages" numbered="true" toc="default">
-     <name>Peer-to-peer wire formats</name>
+     <name>Message Processing</name>
       <section anchor="p2p_bf" numbered="true" toc="default">
         <name>Bloomfilter</name>
+        <t>
+          In order to prevent circular routes, GET and PUT messages contain
+          a 128-bit Bloom filter. The Bloom filter is used to detect duplicate
+          peer IDs along the route.
+          A Bloom filter "bf" is initially empty, consisting only of zeroes.
+          There are two functions which can be invoked on the Bloom filter:
+          ADD(bf, e) and TEST(bf, e) where "e" is an element which is to added
+          to the Bloom filter or queried against the set.
+          Any bloom filter uses k different hash functions each of which is
+          defined as follows:
+        </t>
       </section>
       <section anchor="p2p_opts" numbered="true" toc="default">
         <name>Processing options</name>