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

Author: ID Bot

proof-explain/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 18 April 2026</td>
+<td class="center">Expires 19 April 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-10-15" class="published">15 October 2025</time>
+<time datetime="2025-10-16" class="published">16 October 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-04-18">18 April 2026</time></dd>
+<dd class="expires"><time datetime="2026-04-19">19 April 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 18 April 2026.<a href="#section-boilerplate.1-4" class="pilcrow">¶</a></p>
+        This Internet-Draft will expire on 19 April 2026.<a href="#section-boilerplate.1-4" class="pilcrow">¶</a></p>
 </section>
 </div>
 <div id="copyright">
@@ -2892,7 +2892,7 @@ <h4 id="name-example-subtree-consistency">
 <a href="#name-an-example-subtree-consiste" class="selfRef">An example subtree consistency proof for a subtree that is directly contained in the full tree</a>
             </figcaption></figure>
 </div>
-<p id="section-4.4.2-3">The subtree consistency proof for <code>[8, 13)</code> and a tree of size 14 contains <code>MTH({d[12]})</code>, <code>MTH({d[12]})</code>, <code>MTH(D[8:12])</code>, and <code>MTH(D[0:8])</code>, depicted in <a href="#fig-subtree-consistency-example-2" class="auto internal xref">Figure 8</a>. <code>[8, 13)</code> is not directly contained in the tree, so the proof must include sufficient nodes to reconstruct both hashes.<a href="#section-4.4.2-3" class="pilcrow">¶</a></p>
+<p id="section-4.4.2-3">The subtree consistency proof for <code>[8, 13)</code> and a tree of size 14 contains <code>MTH({d[12]})</code>, <code>MTH({d[13]})</code>, <code>MTH(D[8:12])</code>, and <code>MTH(D[0:8])</code>, depicted in <a href="#fig-subtree-consistency-example-2" class="auto internal xref">Figure 8</a>. <code>[8, 13)</code> is not directly contained in the tree, so the proof must include sufficient nodes to reconstruct both hashes.<a href="#section-4.4.2-3" class="pilcrow">¶</a></p>
 <span id="name-an-example-subtree-consisten"></span><div id="fig-subtree-consistency-example-2">
 <figure id="figure-8">
             <div id="section-4.4.2-4.1">
@@ -5485,7 +5485,7 @@ <h3 id="name-consistency-proof-structure">
 <p id="appendix-B.3-1">A subtree consistency proof for <code>[start, end)</code> and the tree of <code>n</code> elements is similar to an inclusion proof for element <code>end - 1</code>. If one starts from <code>end - 1</code>'s hash, incorporating the whole inclusion proof should reconstruct <code>root_hash</code> and incorporating a subset of the inclusion proof should reconstruct <code>node_hash</code>. Thus <code>end - 1</code>'s hash and this inclusion proof can prove consistency. A subtree consistency proof in this document applies two optimizations over this construction:<a href="#appendix-B.3-1" class="pilcrow">¶</a></p>
 <ol start="1" type="1" class="normal type-1" id="appendix-B.3-2">
 <li id="appendix-B.3-2.1">
-            <p id="appendix-B.3-2.1.1">Instead of starting at level 0 with <code>end - 1</code>, the proof can start at a higher level. Any ancestor of <code>end - 1</code> shared by both the subtree and the overall tree will <code>node_hash</code> and <code>root_hash</code>. Use the highest level with a commmon ancestor. This truncates the inclusion proof portion of the consistency proof.<a href="#appendix-B.3-2.1.1" class="pilcrow">¶</a></p>
+            <p id="appendix-B.3-2.1.1">Instead of starting at level 0 with <code>end - 1</code>, the proof can start at a higher level. Any ancestor of <code>end - 1</code> shared by both the subtree and the overall tree is a valid starting node to reconstruct <code>node_hash</code> and <code>root_hash</code>. Use the highest level with a commmon ancestor. This truncates the inclusion proof portion of the consistency proof.<a href="#appendix-B.3-2.1.1" class="pilcrow">¶</a></p>
 </li>
           <li id="appendix-B.3-2.2">
             <p id="appendix-B.3-2.2.1">If this starting node is the entire subtree, omit its hash from the consistency proof. The verifier is assumed to already know <code>node_hash</code>.<a href="#appendix-B.3-2.2.1" class="pilcrow">¶</a></p>

proof-explain/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: 18 April 2026                                                  
+Expires: 19 April 2026                                                  
                                                         B. E. Westerbaan
                                                               L. Valenta
                                                               Cloudflare
                                                              F. Valsorda
                                                                   Geomys
-                                                         15 October 2025
+                                                         16 October 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 18 April 2026.
+   This Internet-Draft will expire on 19 April 2026.
 
 Copyright Notice
 
@@ -814,7 +814,7 @@ Table of Contents
                    is directly contained in the full tree
 
    The subtree consistency proof for [8, 13) and a tree of size 14
-   contains MTH({d[12]}), MTH({d[12]}), MTH(D[8:12]), and MTH(D[0:8]),
+   contains MTH({d[12]}), MTH({d[13]}), MTH(D[8:12]), and MTH(D[0:8]),
    depicted in Figure 8. [8, 13) is not directly contained in the tree,
    so the proof must include sufficient nodes to reconstruct both
    hashes.
@@ -3072,9 +3072,10 @@ B.3.  Consistency Proof Structure
 
    1.  Instead of starting at level 0 with end - 1, the proof can start
        at a higher level.  Any ancestor of end - 1 shared by both the
-       subtree and the overall tree will node_hash and root_hash.  Use
-       the highest level with a commmon ancestor.  This truncates the
-       inclusion proof portion of the consistency proof.
+       subtree and the overall tree is a valid starting node to
+       reconstruct node_hash and root_hash.  Use the highest level with
+       a commmon ancestor.  This truncates the inclusion proof portion
+       of the consistency proof.
 
    2.  If this starting node is the entire subtree, omit its hash from
        the consistency proof.  The verifier is assumed to already know