Script updating gh-pages from c0ef457. [ci skip]

Author: ID Bot

proof-explain/draft-davidben-tls-merkle-tree-certs.html

@@ -4185,7 +4185,7 @@ <h3 id="name-binary-representations">
           </figcaption></figure>
 </div>
 <p id="appendix-B.1-3">The binary representation of <code>4</code> is <code>0b100</code>. It is the left (0) child of <code>[4, 6)</code>, which is the left (0) child of <code>[4, 8)</code>, which is the right (1) child of <code>[0, 8)</code>.<a href="#appendix-B.1-3" class="pilcrow">¶</a></p>
-<p id="appendix-B.1-4">Each level in the tree corresponds to a bit position and can be correspondingly numbered, with 0 indicating the least-significant bit and the leaf level, and so on. In this numbering, a node's level can be determined as follows: if the node is a root of subtree <code>[start, end)</code>, let <code>s</code> be the smallest power of two that is greater than or equal to <code>end - start</code>. The node's level is <code>log2(s)</code>.<a href="#appendix-B.1-4" class="pilcrow">¶</a></p>
+<p id="appendix-B.1-4">Each level in the tree corresponds to a bit position and can be correspondingly numbered, with 0 indicating the least-significant bit and the leaf level, and so on. In this numbering, a node's level can be determined as follows: if the node is a root of subtree <code>[start, end)</code>, the node's level is <code>BIT_WIDTH(end - start - 1)</code>.<a href="#appendix-B.1-4" class="pilcrow">¶</a></p>
 <p id="appendix-B.1-5">Comparing two indices determines how the two paths diverge. For example, the bit representations of 4 and 6 are <code>0b100</code> and <code>0b110</code>, respectively. Numbering bits from least to most significant, with the least significant bit numbered zero, they share bit 2 but diverge at bit 1. The paths to leaves 4 and 6 diverges when moving from level 2 to level 1.<a href="#appendix-B.1-5" class="pilcrow">¶</a></p>
 <p id="appendix-B.1-6">This can be generalized to arbitrary-sized Merkle trees. <a href="#fig-merkle-tree-bits-partial" class="auto internal xref">Figure 7</a> depicts a Merkle Tree of size 6:<a href="#appendix-B.1-6" class="pilcrow">¶</a></p>
 <span id="name-an-example-merkle-tree-of-si"></span><div id="fig-merkle-tree-bits-partial">

proof-explain/draft-davidben-tls-merkle-tree-certs.txt

@@ -2732,8 +2732,7 @@ B.1.  Binary Representations
    correspondingly numbered, with 0 indicating the least-significant bit
    and the leaf level, and so on.  In this numbering, a node's level can
    be determined as follows: if the node is a root of subtree [start,
-   end), let s be the smallest power of two that is greater than or
-   equal to end - start.  The node's level is log2(s).
+   end), the node's level is BIT_WIDTH(end - start - 1).
 
    Comparing two indices determines how the two paths diverge.  For
    example, the bit representations of 4 and 6 are 0b100 and 0b110,