Skip to content
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.

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

Jump to bottom

Add text to help avoid future mis-reading #331

Merged
merged 1 commit into from May 13, 2021
+1 −1
Merged

Add text to help avoid future mis-reading #331

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.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
2 draft-ietf-trans-rfc6962-bis.md
View file
Open in desktop
@@ -498,7 +498,7 @@ SUBPROOF(m, D_m, false) = {MTH(D_m)}
~~~~~~~~~~~

For m \< n, let k be the largest power of two smaller than n. The subproof is
then defined recursively.
then defined recursively, using the appropriate step below:

If m \<= k, the right subtree entries D\[k:n] only exist in the current tree.
We prove that the left subtree entries D\[0:k] are consistent and add a