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.

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

Jump to bottom

re issue#20 suggested clarification regarding leaf-index #25

Merged
merged 3 commits into from
Aug 6, 2024
Merged

re issue#20 suggested clarification regarding leaf-index #25

Changes from 2 commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
3be1aba
re issue#20 suggested clarification regarding leaf-index
robinbryce Aug 6, 2024
16b7d1f
Merge branch 'main' into robin/issue-20/leaf-index-clarification
henkbirkholz Aug 6, 2024
eb9bdb7
Update draft-ietf-cose-merkle-tree-proofs.md
henkbirkholz Aug 6, 2024
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
6 changes: 6 additions & 0 deletions draft-ietf-cose-merkle-tree-proofs.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -291,6 +291,12 @@ inclusion-proof = bstr .cbor [
~~~~
{: #rfc9162-sha256-cbor-inclusion-proof align="left" title="CBOR Encoded RFC9162 Inclusion Proof"}

The term `leaf-index` is used for alignment with the use established in {{RFC9162}}

Note that {{RFC9162}} defines that verification MUST fail if leaf-index is >= tree-size,
and inclusion proofs are defined only for leaf nodes.
henkbirkholz marked this conversation as resolved.
Show resolved Hide resolved
The identifying index of a leaf node is relative to all nodes in the tree size for which the proof was obtained.

### Receipt of Inclusion

In a signed inclusion proof, the previous merkle tree root, maps to tree-size-1, and is a detached payload.
Expand Down
Loading