Script updating gh-pages from 2f1c8dd. [ci skip]

Author: ID Bot

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

@@ -1050,7 +1050,7 @@
 </tr></thead>
 <tfoot><tr>
 <td class="left">Benjamin, et al.</td>
-<td class="center">Expires 8 May 2026</td>
+<td class="center">Expires 9 May 2026</td>
 <td class="right">[Page]</td>
 </tr></tfoot>
 </table>
@@ -1063,12 +1063,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-11-04" class="published">4 November 2025</time>
+<time datetime="2025-11-05" class="published">5 November 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-05-08">8 May 2026</time></dd>
+<dd class="expires"><time datetime="2026-05-09">9 May 2026</time></dd>
 <dt class="label-authors">Authors:</dt>
 <dd class="authors">
 <div class="author">
@@ -1128,7 +1128,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 8 May 2026.<a href="#section-boilerplate.1-4" class="pilcrow">¶</a></p>
+        This Internet-Draft will expire on 9 May 2026.<a href="#section-boilerplate.1-4" class="pilcrow">¶</a></p>
 </section>
 </div>
 <div id="copyright">
@@ -1925,7 +1925,7 @@ <h3 id="name-definition-of-a-subtree">
 <a href="#section-4.1" class="section-number selfRef">4.1. </a><a href="#name-definition-of-a-subtree" class="section-name selfRef">Definition of a Subtree</a>
         </h3>
 <p id="section-4.1-1">Given an ordered list of <code>n</code> inputs, <code>D_n = {d[0], d[1], ..., d[n-1]}</code>, <span><a href="https://rfc-editor.org/rfc/rfc9162#section-2.1.1" class="relref">Section 2.1.1</a> of [<a href="#RFC9162" class="cite xref">RFC9162</a>]</span> defines the Merkle Tree via the Merkle Tree Hash <code>MTH(D_n)</code>.<a href="#section-4.1-1" class="pilcrow">¶</a></p>
-<p id="section-4.1-2">A <em>subtree</em> of this Merkle Tree is defined by two integers, <code>start</code> and <code>end</code>, such that:<a href="#section-4.1-2" class="pilcrow">¶</a></p>
+<p id="section-4.1-2">A <em>subtree</em> of this Merkle Tree is itself a Merkle Tree, defined by <code>MTH(D[start:end])</code>. <code>start</code> and <code>end</code> are integers such that:<a href="#section-4.1-2" class="pilcrow">¶</a></p>
 <ul class="normal">
 <li class="normal" id="section-4.1-3.1">
             <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>
@@ -1935,7 +1935,7 @@ <h3 id="name-definition-of-a-subtree">
 </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-5">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 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>

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: 8 May 2026                                                     
+Expires: 9 May 2026                                                     
                                                         B. E. Westerbaan
                                                               L. Valenta
                                                               Cloudflare
                                                              F. Valsorda
                                                                   Geomys
-                                                         4 November 2025
+                                                         5 November 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 8 May 2026.
+   This Internet-Draft will expire on 9 May 2026.
 
 Copyright Notice
 
@@ -507,19 +507,18 @@ Table of Contents
    Section 2.1.1 of [RFC9162] defines the Merkle Tree via the Merkle
    Tree Hash MTH(D_n).
 
-   A _subtree_ of this Merkle Tree is defined by two integers, start and
-   end, such that:
+   A _subtree_ of this Merkle Tree is itself a Merkle Tree, defined by
+   MTH(D[start:end]). start and end are integers such that:
 
    *  0 <= start < end <= n
 
    *  start is a multiple of BIT_CEIL(end - start)
 
    Note that, if start is zero, the second condition is always true.
 
-   A subtree is itself a Merkle Tree, defined by MTH(D[start:end]).  In
-   the context of a single Merkle Tree, the subtree defined by start and
-   end is denoted by half-open interval [start, end).  It contains the
-   entries whose indices are in that half-open interval.
+   In the context of a single Merkle Tree, the subtree defined by start
+   and end is denoted by half-open interval [start, end).  It contains
+   the 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 two, it is said to be _full_, otherwise it is said to be

index.html

@@ -37,7 +37,7 @@ <h2>Preview for branch <a href="subtree-dfn">subtree-dfn</a></h2>
       <tr>
         <td><a href="subtree-dfn/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-dfn/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-dfn/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="lukevalenta-patch-1">lukevalenta-patch-1</a></h2>
@@ -53,7 +53,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>same as main</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>
       </tr>
     </table>
     <h2>Preview for branch <a href="proof-explain">proof-explain</a></h2>