lsd0004

commit bd80a2c08f5c51e857447e6059b080c8c09ad1ac
parent dd995fca3626818ad46c903464c7b270732fa00a
Author: Christian Grothoff <grothoff@gnunet.org>
Date:   Sat, 26 Aug 2023 15:25:28 +0200

English fix

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

1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/draft-schanzen-r5n.xml b/draft-schanzen-r5n.xml
@@ -2623,9 +2623,9 @@ BEGIN
 	<tt>REPL_LVL</tt> to a maximum of 16. This imposes
 	an upper limit on bandwidth amplification an attacker
 	may achieve for a given network size and topology.
-</t>
+      </t>
       <section>
-        <name>Disjoint Underlay Protocols</name>
+        <name>Disjoint Underlay or Application Protocol Support</name>
       <t>
         We note that peers
 	implementing disjoint sets of underlay protocols may
@@ -2641,7 +2641,7 @@ BEGIN
         <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.
+          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