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

Fix merkle multiproof documentation #3928

Merged
merged 1 commit into from
Sep 20, 2024
Merged

Conversation

EchoAlice
Copy link
Contributor

No description provided.

@jtraglia
Copy link
Member

Hey @EchoAlice could you provide an explanation or reference for this?

@EchoAlice
Copy link
Contributor Author

Hey @EchoAlice could you provide an explanation or reference for this?

Sure thing. The doc claims that only 2 auxilary nodes would be required to prove a single value in the 8 leaf node merkle tree example. But 3 nodes are required.

"Demonstrating that a leaf node is a part of a given binary hash tree requires computing a number of hashes proportional to the logarithm of the number of leaf nodes in the tree." See wikipedia here.

log2(8) = 3

@jtraglia
Copy link
Member

Oh great. That makes sense. Thank you!

@jtraglia jtraglia merged commit 0c5ad81 into ethereum:dev Sep 20, 2024
26 checks passed
@EchoAlice EchoAlice deleted the multiproof_docs branch September 20, 2024 20:14
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants