Skip to content

Commit 425ba08

Browse files
author
ID Bot
committed
Script updating gh-pages from cad80fe. [ci skip]
1 parent 9ffb511 commit 425ba08

2 files changed

Lines changed: 2 additions & 2 deletions

File tree

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1502,7 +1502,7 @@ <h2 id="name-conventions-and-definitions">
15021502
<p id="section-2-6.2.1"><code>BIT_WIDTH(n)</code> refers to the smallest number of bits needed to represent <code>n</code>. <code>BIT_WIDTH(0)</code> is zero.<a href="#section-2-6.2.1" class="pilcrow"></a></p>
15031503
</li>
15041504
<li class="normal" id="section-2-6.3">
1505-
<p id="section-2-6.3.1"><code>POPCOUNT(n)</code> refers to the number of set bits in <code>n</code>'s binary representation`.<a href="#section-2-6.3.1" class="pilcrow"></a></p>
1505+
<p id="section-2-6.3.1"><code>POPCOUNT(n)</code> refers to the number of set bits in <code>n</code>'s binary representation.<a href="#section-2-6.3.1" class="pilcrow"></a></p>
15061506
</li>
15071507
</ul>
15081508
<p id="section-2-7">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. Given non-negative integers <code>a</code> and <code>b</code>, <code>a &gt;&gt; b</code> refers to <code>a</code> right-shifted <code>b</code> times.<a href="#section-2-7" class="pilcrow"></a></p>

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -260,7 +260,7 @@ Table of Contents
260260
represent n. BIT_WIDTH(0) is zero.
261261

262262
* POPCOUNT(n) refers to the number of set bits in n's binary
263-
representation`.
263+
representation.
264264

265265
To _right-shift_ a non-negative integer n is to shift each bit in its
266266
binary representation to one lower position, discarding the least-

0 commit comments

Comments
 (0)