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

Author: ID Bot

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

@@ -3148,7 +3148,7 @@ <h4 id="name-verifying-a-subtree-consist">
 <p id="section-4.4.3-2">Given a Merkle Tree over <code>n</code> elements, a subtree defined by <code>[start, end)</code>, a consistency proof <code>proof</code>, a subtree hash <code>node_hash</code>, and a root hash <code>root_hash</code>:<a href="#section-4.4.3-2" class="pilcrow">¶</a></p>
 <ol start="1" type="1" class="normal type-1" id="section-4.4.3-3">
 <li id="section-4.4.3-3.1">
-              <p id="section-4.4.3-3.1.1">Check that <code>[start, end)</code> is a valid subtree (<a href="#definition-of-a-subtree" class="auto internal xref">Section 4.1</a>), and that <code>end &lt;= n</code>. If either do not hold, fail proof verification. These checks imply <code>0 &lt;= start &lt; end &lt;= end</code>.<a href="#section-4.4.3-3.1.1" class="pilcrow">¶</a></p>
+              <p id="section-4.4.3-3.1.1">Check that <code>[start, end)</code> is a valid subtree (<a href="#definition-of-a-subtree" class="auto internal xref">Section 4.1</a>), and that <code>end &lt;= n</code>. If either do not hold, fail proof verification. These checks imply <code>0 &lt;= start &lt; end &lt;= n</code>.<a href="#section-4.4.3-3.1.1" class="pilcrow">¶</a></p>
 </li>
             <li id="section-4.4.3-3.2">
               <p id="section-4.4.3-3.2.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.4.3-3.2.1" class="pilcrow">¶</a></p>
@@ -5984,7 +5984,10 @@ <h3 id="name-since-draft-davidben-tls-merkle-tr">
             <p id="appendix-E.8-1.2.1">Clarify signature verification process<a href="#appendix-E.8-1.2.1" class="pilcrow">¶</a></p>
 </li>
           <li class="normal" id="appendix-E.8-1.3">
-            <p id="appendix-E.8-1.3.1">Add an appendix that explains the Merkle Tree proof procedures<a href="#appendix-E.8-1.3.1" class="pilcrow">¶</a></p>
+            <p id="appendix-E.8-1.3.1">Improve subtree consistency proof verification algorithm<a href="#appendix-E.8-1.3.1" class="pilcrow">¶</a></p>
+</li>
+          <li class="normal" id="appendix-E.8-1.4">
+            <p id="appendix-E.8-1.4.1">Add an appendix that explains the Merkle Tree proof procedures<a href="#appendix-E.8-1.4.1" class="pilcrow">¶</a></p>
 </li>
         </ul>
 </section>

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

@@ -865,7 +865,7 @@ Table of Contents
 
    1.  Check that [start, end) is a valid subtree (Section 4.1), and
        that end <= n.  If either do not hold, fail proof verification.
-       These checks imply 0 <= start < end <= end.
+       These checks imply 0 <= start < end <= n.
 
    2.  Set fn to start, sn to end - 1, and tn to n - 1.
 
@@ -3411,6 +3411,8 @@ Since draft-davidben-tls-merkle-tree-certs-07
 
    *  Clarify signature verification process
 
+   *  Improve subtree consistency proof verification algorithm
+
    *  Add an appendix that explains the Merkle Tree proof procedures
 
 Authors' Addresses