Script updating gh-pages from 5966a7c. [ci skip]

Author: ID Bot

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

@@ -1469,7 +1469,7 @@ <h2 id="name-conventions-and-definitions">
 <p id="section-2-3"><code>U+</code> followed by four hexadecimal characters denotes a Unicode codepoint, to be encoded in UTF-8 <span>[<a href="#RFC3629" class="cite xref">RFC3629</a>]</span>. <code>0x</code> followed by two hexadecimal characters denotes a byte value in the 0-255 range.<a href="#section-2-3" class="pilcrow">¶</a></p>
 <p id="section-2-4"><code>[start, end)</code>, where <code>start &lt;= end</code>, denotes the half-open interval containing integers <code>x</code> such that <code>start &lt;= x &lt; end</code>.<a href="#section-2-4" class="pilcrow">¶</a></p>
 <p id="section-2-5">Given a non-negative integer <code>n</code>, <code>LSB(n)</code> refers to the least-significant bit of <code>n</code>'s binary representation. Equivalently, it is the remainder when <code>n</code> is divided by 2.<a href="#section-2-5" class="pilcrow">¶</a></p>
-<p id="section-2-6">To <em>right-shift</em> a non-negative integer <code>n</code> by one bit is to shift all bits in its binary representation by one bit, discarding the least-significant bit. Equivalently, it is the floor of <code>n</code> divided by 2.<a href="#section-2-6" class="pilcrow">¶</a></p>
+<p id="section-2-6">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.<a href="#section-2-6" class="pilcrow">¶</a></p>
 <div id="terminology-and-roles">
 <section id="section-2.1">
         <h3 id="name-terminology-and-roles">

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

@@ -246,8 +246,8 @@ Table of Contents
    significant bit of n's binary representation.  Equivalently, it is
    the remainder when n is divided by 2.
 
-   To _right-shift_ a non-negative integer n by one bit is to shift all
-   bits in its binary representation by one bit, discarding the least-
+   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.
 
 2.1.  Terminology and Roles