lsd0004

LSD0004: R5N Distributed Hash Table
Log | Files | Refs

commit fe787e7b155ce7399a5669a21470652150af835b
parent b2a8e6485ecf268dd629fd7cbd1121103c3430c2
Author: Christian Grothoff <grothoff@gnunet.org>
Date:   Sat, 12 Mar 2022 04:23:15 +0100

filters all neighbours

Diffstat:
Mdraft-schanzen-r5n.xml | 3+--
1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml @@ -821,9 +821,8 @@ bchar = *(ALPHA / DIGIT) <t> To build its routing table, a peer will send out requests asking for blocks of type HELLO using its own location as the key, - but filtering its own HELLO via the Bloom filter described + but filtering all of its neighbours via the Bloom filter described in <xref target="result_bloomfilter"/>. - <!-- FIXME: should we only filter our own, or ALL NEIGHBOURS? --> These requests <bcp14>MUST</bcp14> use the FindApproximate and DemultiplexEverywhere flags. FindApproximate will ensure that other peers will reply with keys they merely consider close-enough, while DemultiplexEverywhere