Skip to content

Commit f7da5bc

Browse files
committed
Merge remote-tracking branch 'origin/main' into proof-explain
2 parents 86d39b8 + 8fd3601 commit f7da5bc

1 file changed

Lines changed: 3 additions & 1 deletion

File tree

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

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -720,7 +720,7 @@ Given a Merkle Tree over `n` elements, a subtree defined by `[start, end)`, a co
720720

721721
<!-- If changing this procedure, remember to update {{consistency-proof-bits}} -->
722722

723-
1. Check that `[start, end)` is a valid subtree ({{definition-of-a-subtree}}), and that `end <= n`. If either do not hold, fail proof verification. These checks imply `0 <= start < end <= end`.
723+
1. Check that `[start, end)` is a valid subtree ({{definition-of-a-subtree}}), and that `end <= n`. If either do not hold, fail proof verification. These checks imply `0 <= start < end <= n`.
724724
1. Set `fn` to `start`, `sn` to `end - 1`, and `tn` to `n - 1`.
725725
1. If `sn` is `tn`, then:
726726
1. Until `fn` is `sn`, right-shift `fn`, `sn`, and `tn` equally.
@@ -1962,4 +1962,6 @@ In draft-04, there is no fast issuance mode. In draft-05, frequent, non-landmark
19621962

19631963
- Clarify signature verification process
19641964

1965+
- Improve subtree consistency proof verification algorithm
1966+
19651967
- Add an appendix that explains the Merkle Tree proof procedures

0 commit comments

Comments
 (0)