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

merklearray: simplify single-leaf proofs #5703

Merged
merged 2 commits into from
Sep 1, 2023
Merged

merklearray: simplify single-leaf proofs #5703

merged 2 commits into from
Sep 1, 2023

Commits on Aug 23, 2023

  1. simplify single-leaf merklearray proofs 

    No need to explicitly specify tree depth for merklearray proofs of
a single leaf node, because the tree depth is exactly the number of
sibling hashes in the proof.

This allows simplifying the format for sending single-leaf merklearray
proofs, sending just the proofBytes []byte, and not having to send along
an extra treeDepth.

The current algod API for fetching a proof still sends the tree depth
along, for any clients that might care about it, but future APIs won't
need to pass treeDepth.
    @zeldovich
    zeldovich committed Aug 23, 2023
    Configuration menu
    Copy the full SHA
    ff81e5a View commit details
    Browse the repository at this point in the history

  2. augment tests to confirm correct tree depth

    @zeldovich
    zeldovich committed Aug 23, 2023
    Configuration menu
    Copy the full SHA
    5b75a24 View commit details
    Browse the repository at this point in the history