commit 3831af1198871f073f079f4e56a95bece4a0804f
parent 22d83eb662bb27cca0bbd714ccfdd4d8d3f9ba76
Author: Christian Grothoff <christian@grothoff.org>
Date: Sat, 13 Jul 2024 13:30:21 +0200
finish sec 9
Diffstat:
1 file changed, 20 insertions(+), 18 deletions(-)
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
@@ -3001,29 +3001,31 @@ BEGIN
<section>
<name>Approximate Result Filtering</name>
<t>
- When a FindApproximate request is encountered, a peer will try to
- respond with the closest block it has that is not filtered by the
- result Bloom filter.
- Implementations <bcp14>MUST</bcp14> ensure that
- the cost of evaluating any such query is reasonably small.
- For example, implementations <bcp14>MAY</bcp14> consider to
- avoid an exhaustive search of their database.
- Not doing so can lead to denial of service attacks as there
- could be cases where too many local results are
- filtered by the result filter.
+ When a <tt>FindApproximate</tt> flag is encountered in a
+ query, a peer will try to respond with the closest block it
+ has that is not filtered by the result Bloom filter
+ (<tt>RF</tt>). Implementations <bcp14>MUST</bcp14> ensure
+ that the cost of evaluating any such query is reasonably
+ small. For example, implementations <bcp14>SHOULD</bcp14>
+ consider ways to avoid an exhaustive search of their
+ database. Not doing so can lead to denial of service
+ attacks as there could be cases where too many local results
+ are filtered by the result filter.
</t>
</section>
<section>
<name>Access Control</name>
<t>
- By design R<sup>5</sup>N does not rely on strict admission control through
- the use of either centralized enrollment servers or pre-shared keys.
- This is a key distintion over protocols that do rely on this kind of access
- control such as <xref target="RFC6940"/> which, like R<sup>5</sup>N, provides
- a peer-to-peer (P2P) signaling protocol with extensible routing and topology
- mechanisms.
- Some decentralized applications, such as the GNU Name System (<xref target="RFC9498"/>),
- require an open system that enables ad-hoc participation.
+ By design R<sup>5</sup>N does not rely on strict admission
+ control through the use of either centralized enrollment
+ servers or pre-shared keys. This is a key distintion over
+ protocols that do rely on this kind of access control such
+ as <xref target="RFC6940"/> which, like R<sup>5</sup>N,
+ provides a peer-to-peer (P2P) signaling protocol with
+ extensible routing and topology mechanisms. Some
+ decentralized applications, such as the GNU Name System
+ (<xref target="RFC9498"/>), require an open system that
+ enables ad-hoc participation.
</t>
</section>
</section>
