Script updating gh-pages from 5d40b6b. [ci skip]

Author: ID Bot

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

@@ -1051,7 +1051,7 @@
 </tr></thead>
 <tfoot><tr>
 <td class="left">Benjamin, et al.</td>
-<td class="center">Expires 12 February 2026</td>
+<td class="center">Expires 13 February 2026</td>
 <td class="right">[Page]</td>
 </tr></tfoot>
 </table>
@@ -1064,12 +1064,12 @@
 <dd class="internet-draft">draft-davidben-tls-merkle-tree-certs-latest</dd>
 <dt class="label-published">Published:</dt>
 <dd class="published">
-<time datetime="2025-08-11" class="published">11 August 2025</time>
+<time datetime="2025-08-12" class="published">12 August 2025</time>
     </dd>
 <dt class="label-intended-status">Intended Status:</dt>
 <dd class="intended-status">Experimental</dd>
 <dt class="label-expires">Expires:</dt>
-<dd class="expires"><time datetime="2026-02-12">12 February 2026</time></dd>
+<dd class="expires"><time datetime="2026-02-13">13 February 2026</time></dd>
 <dt class="label-authors">Authors:</dt>
 <dd class="authors">
 <div class="author">
@@ -1129,7 +1129,7 @@ <h2 id="name-status-of-this-memo">
         time. It is inappropriate to use Internet-Drafts as reference
         material or to cite them other than as "work in progress."<a href="#section-boilerplate.1-3" class="pilcrow">¶</a></p>
 <p id="section-boilerplate.1-4">
-        This Internet-Draft will expire on 12 February 2026.<a href="#section-boilerplate.1-4" class="pilcrow">¶</a></p>
+        This Internet-Draft will expire on 13 February 2026.<a href="#section-boilerplate.1-4" class="pilcrow">¶</a></p>
 </section>
 </div>
 <div id="copyright">
@@ -1619,12 +1619,12 @@ <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>k</code> is the largest power of 2 that is greater than or equal to <code>end - start</code>, <code>start</code> must be a multiple of <code>k</code><a href="#section-4.1-3.2.1" class="pilcrow">¶</a></p>
+            <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>
 </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>
 <p id="section-4.1-5">A subtree is itself a Merkle Tree, defined by <code>MTH(D[start:end])</code>. In the context of a single Merkle Tree, the subtree defined by <code>start</code> and <code>end</code> is denoted by half-open interval <code>[start, end)</code>. It contains the entries whose indices are in that half-open interval.<a href="#section-4.1-5" class="pilcrow">¶</a></p>
-<p id="section-4.1-6">The <em>size</em> of the subtree is <code>end - start</code>. If the subtree's size is a power of 2, it is said to be <em>full</em>, otherwise it is said to be <em>partial</em>.<a href="#section-4.1-6" class="pilcrow">¶</a></p>
+<p id="section-4.1-6">The <em>size</em> of the subtree is <code>end - start</code>. If the subtree's size is a power of two, it is said to be <em>full</em>, otherwise it is said to be <em>partial</em>.<a href="#section-4.1-6" class="pilcrow">¶</a></p>
 <p id="section-4.1-7">If a subtree is full, then it is directly contained in the tree of hash operations in <code>MTH(D_n)</code> for <code>n &gt;= end</code>.<a href="#section-4.1-7" class="pilcrow">¶</a></p>
 <p id="section-4.1-8">If a subtree is partial, it is directly contained in <code>MTH(D_n)</code> only if <code>n = end</code>.<a href="#section-4.1-8" class="pilcrow">¶</a></p>
 </section>
@@ -1755,7 +1755,7 @@ <h4 id="name-verifying-a-subtree-consist">
                   <p id="section-4.3.2-3.2.2.1.1">If <code>proof</code> is an empty array, stop and fail verification.<a href="#section-4.3.2-3.2.2.1.1" class="pilcrow">¶</a></p>
 </li>
                 <li id="section-4.3.2-3.2.2.2">
-                  <p id="section-4.3.2-3.2.2.2.1">If <code>end - start</code> is an exact power of 2, prepend <code>node_hash</code> to the <code>proof</code> array.<a href="#section-4.3.2-3.2.2.2.1" class="pilcrow">¶</a></p>
+                  <p id="section-4.3.2-3.2.2.2.1">If <code>end - start</code> is an exact power of two, prepend <code>node_hash</code> to the <code>proof</code> array.<a href="#section-4.3.2-3.2.2.2.1" class="pilcrow">¶</a></p>
 </li>
                 <li id="section-4.3.2-3.2.2.3">
                   <p id="section-4.3.2-3.2.2.3.1">Set <code>fn</code> to <code>start</code>, <code>sn</code> to <code>end - 1</code>, and <code>tn</code> to <code>n - 1</code>.<a href="#section-4.3.2-3.2.2.3.1" class="pilcrow">¶</a></p>

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

@@ -5,13 +5,13 @@
 Network Working Group                                        D. Benjamin
 Internet-Draft                                                Google LLC
 Intended status: Experimental                                 D. O'Brien
-Expires: 12 February 2026                                               
+Expires: 13 February 2026                                               
                                                         B. E. Westerbaan
                                                               L. Valenta
                                                               Cloudflare
                                                              F. Valsorda
                                                                   Geomys
-                                                          11 August 2025
+                                                          12 August 2025
 
 
                         Merkle Tree Certificates
@@ -58,7 +58,7 @@ Status of This Memo
    time.  It is inappropriate to use Internet-Drafts as reference
    material or to cite them other than as "work in progress."
 
-   This Internet-Draft will expire on 12 February 2026.
+   This Internet-Draft will expire on 13 February 2026.
 
 Copyright Notice
 
@@ -394,8 +394,8 @@ Table of Contents
 
    *  0 <= start < end <= n
 
-   *  If k is the largest power of 2 that is greater than or equal to
-      end - start, start must be a multiple of k
+   *  If s is the smallest power of two that is greater than or equal to
+      end - start, start must be a multiple of s
 
    Note that, if start is zero, the second condition is always true.
 
@@ -405,7 +405,7 @@ Table of Contents
    entries whose indices are in that half-open interval.
 
    The _size_ of the subtree is end - start.  If the subtree's size is a
-   power of 2, it is said to be _full_, otherwise it is said to be
+   power of two, it is said to be _full_, otherwise it is said to be
    _partial_.
 
    If a subtree is full, then it is directly contained in the tree of
@@ -514,7 +514,7 @@ Table of Contents
 
        1.  If proof is an empty array, stop and fail verification.
 
-       2.  If end - start is an exact power of 2, prepend node_hash to
+       2.  If end - start is an exact power of two, prepend node_hash to
            the proof array.
 
        3.  Set fn to start, sn to end - 1, and tn to n - 1.