Skip to content

Commit

Permalink
Script updating gh-pages from be17a21. [ci skip]
Browse files Browse the repository at this point in the history
  • Loading branch information
ID Bot committed Jun 25, 2024
1 parent 8cf736a commit 2a9b7d9
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 4 deletions.
2 changes: 1 addition & 1 deletion auth48/draft-ietf-sframe-enc.html
Original file line number Diff line number Diff line change
Expand Up @@ -2530,7 +2530,7 @@ <h3 id="name-mls">
<p id="section-5.2-5">For compactness, we do not send the whole epoch number. Instead, we send only
its low-order <code>E</code> bits, where <code>E</code> is a value set by the application. <code>E</code>
effectively defines a reordering window, since no more than 2<sup><code>E</code></sup>
epochs can be active at a given time. To handle roll-over of the epoch counter,
epochs can be active at a given time. To handle rollover of the epoch counter,
receivers <span class="bcp14">MUST</span> remove an old epoch when a new epoch with the same low-order
E bits is introduced.<a href="#section-5.2-5" class="pilcrow"></a></p>
<p id="section-5.2-6">Let <code>S</code> be the number of bits required to encode a member index in the group,
Expand Down
6 changes: 3 additions & 3 deletions auth48/draft-ietf-sframe-enc.txt
Original file line number Diff line number Diff line change
Expand Up @@ -862,9 +862,9 @@ Figure 1: Two Options for Integrating SFrame in a Typical Media Stack
For compactness, we do not send the whole epoch number. Instead, we
send only its low-order E bits, where E is a value set by the
application. E effectively defines a reordering window, since no
more than 2^E epochs can be active at a given time. To handle roll-
over of the epoch counter, receivers MUST remove an old epoch when a
new epoch with the same low-order E bits is introduced.
more than 2^E epochs can be active at a given time. To handle
rollover of the epoch counter, receivers MUST remove an old epoch
when a new epoch with the same low-order E bits is introduced.

Let S be the number of bits required to encode a member index in the
group, i.e., the smallest value such that group_size <= (1 << S).
Expand Down

0 comments on commit 2a9b7d9

Please sign in to comment.