Skip to content

More straightforward definition of subtree #156

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
devonobrien merged 1 commit into from
Nov 4, 2025
Merged

More straightforward definition of subtree #156

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion draft-davidben-tls-merkle-tree-certs.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -230,6 +230,8 @@ Given a non-negative integer `n`,

* `POPCOUNT(n)` refers to the number of set bits in `n`'s binary representation.

* `BIT_CEIL(n)` refers to the smallest power of 2 that is greater or equal to `n`.

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. Given non-negative integers `a` and `b`, `a >> b` refers to `a` right-shifted `b` times.

## Terminology and Roles
Expand Down Expand Up @@ -405,7 +407,7 @@ Given an ordered list of `n` inputs, `D_n = {d[0], d[1], ..., d[n-1]}`, {{Sectio
A *subtree* of this Merkle Tree is defined by two integers, `start` and `end`, such that:

* `0 <= start < end <= n`
* If `s` is the smallest power of two that is greater than or equal to `end - start`, `start` must be a multiple of `s`
* `start` is a multiple of `BIT_CEIL(end - start)`

Note that, if `start` is zero, the second condition is always true.

Expand Down