File tree Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Expand file tree Collapse file tree 1 file changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -76,7 +76,7 @@ the generated vectors in a trie. Parts of this trie can be retrieved with the
76
76
[ GetHelperTrieProofs] message. Currently the trie root is part of the trusted syncing
77
77
checkpoint but trustless validation of the BloomBits trie is part of the development
78
78
plans. The trie consists of the compressed bit vectors as values stored at keys
79
- constructed from the the bloom bit index encoded as a 2-byte big endian, followed by the
79
+ constructed from the bloom bit index encoded as a 2-byte big endian, followed by the
80
80
section index encoded as an 8-byte big endian. Since all-zero bit vectors have a zero
81
81
length when compressed, these vectors are not added to the trie at all.
82
82
@@ -85,7 +85,7 @@ adding the vectors belonging to the latest section index to the previous trie.
85
85
86
86
## Client Side Flow Control
87
87
88
- Any node which takes on a server role in the the LES protocol needs to be able to somehow
88
+ Any node which takes on a server role in the LES protocol needs to be able to somehow
89
89
limit the amount of work it does for each client peer during a given time period. They can
90
90
always just serve requests slowly if they are overloaded, but it is beneficial to give
91
91
some sort of flow control feedback to the clients. This way, clients could (and would have
You can’t perform that action at this time.
0 commit comments