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

Author: ID Bot

draft-davidben-tls-merkle-tree-certs.html

@@ -1503,6 +1503,9 @@ <h2 id="name-conventions-and-definitions">
 </li>
         <li class="normal" id="section-2-6.3">
           <p id="section-2-6.3.1"><code>POPCOUNT(n)</code> refers to the number of set bits in <code>n</code>'s binary representation.<a href="#section-2-6.3.1" class="pilcrow">¶</a></p>
+</li>
+        <li class="normal" id="section-2-6.4">
+          <p id="section-2-6.4.1"><code>BIT_CEIL(n)</code> refers to the smallest power of 2 that is greater or equal to <code>n</code>.<a href="#section-2-6.4.1" class="pilcrow">¶</a></p>
 </li>
       </ul>
 <p id="section-2-7">To <em>right-shift</em> a non-negative integer <code>n</code> is to shift each bit in its binary representation to one lower position, discarding the least-significant bit. Equivalently, it is the floor of <code>n</code> divided by 2. Given non-negative integers <code>a</code> and <code>b</code>, <code>a &gt;&gt; b</code> refers to <code>a</code> right-shifted <code>b</code> times.<a href="#section-2-7" class="pilcrow">¶</a></p>
@@ -1928,7 +1931,7 @@ <h3 id="name-definition-of-a-subtree">
             <p id="section-4.1-3.1.1"><code>0 &lt;= start &lt; end &lt;= n</code><a href="#section-4.1-3.1.1" class="pilcrow">¶</a></p>
 </li>
           <li class="normal" id="section-4.1-3.2">
-            <p id="section-4.1-3.2.1">If <code>s</code> is the smallest power of two that is greater than or equal to <code>end - start</code>, <code>start</code> must be a multiple of <code>s</code><a href="#section-4.1-3.2.1" class="pilcrow">¶</a></p>
+            <p id="section-4.1-3.2.1"><code>start</code> is a multiple of <code>BIT_CEIL(end - start)</code><a href="#section-4.1-3.2.1" class="pilcrow">¶</a></p>
 </li>
         </ul>
 <p id="section-4.1-4">Note that, if <code>start</code> is zero, the second condition is always true.<a href="#section-4.1-4" class="pilcrow">¶</a></p>

draft-davidben-tls-merkle-tree-certs.txt

@@ -262,6 +262,9 @@ Table of Contents
    *  POPCOUNT(n) refers to the number of set bits in n's binary
       representation.
 
+   *  BIT_CEIL(n) refers to the smallest power of 2 that is greater or
+      equal to n.
+
    To _right-shift_ a non-negative integer n is to shift each bit in its
    binary representation to one lower position, discarding the least-
    significant bit.  Equivalently, it is the floor of n divided by 2.
@@ -509,8 +512,7 @@ Table of Contents
 
    *  0 <= start < end <= n
 
-   *  If s is the smallest power of two that is greater than or equal to
-      end - start, start must be a multiple of s
+   *  start is a multiple of BIT_CEIL(end - start)
 
    Note that, if start is zero, the second condition is always true.
 

index.html

@@ -45,7 +45,7 @@ <h2>Preview for branch <a href="subtree-bit-ceil">subtree-bit-ceil</a></h2>
       <tr>
         <td><a href="subtree-bit-ceil/draft-davidben-tls-merkle-tree-certs.html" class="html draft-davidben-tls-merkle-tree-certs" title="Merkle Tree Certificates (HTML)">Merkle Tree Certificates</a></td>
         <td><a href="subtree-bit-ceil/draft-davidben-tls-merkle-tree-certs.txt" class="txt draft-davidben-tls-merkle-tree-certs" title="Merkle Tree Certificates (Text)">plain text</a></td>
-        <td><a href="https://author-tools.ietf.org/api/iddiff?url_1=https://davidben.github.io/merkle-tree-certs/draft-davidben-tls-merkle-tree-certs.txt&amp;url_2=https://davidben.github.io/merkle-tree-certs/subtree-bit-ceil/draft-davidben-tls-merkle-tree-certs.txt" class="diff draft-davidben-tls-merkle-tree-certs">diff with main</a></td>
+        <td>same as main</td>
       </tr>
     </table>
     <h2>Preview for branch <a href="proof-explain">proof-explain</a></h2>