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

Support for k-ary tries #15

Open

pnowosie opened this issue Nov 21, 2019 · 1 comment

Contributor

pnowosie commented Nov 21, 2019 •

edited

Loading

Number of children suggest that we could build k-ary tries (k > 2). However proofs can only work for the binary tries (2 children)

Do you think it makes sense to support k-ary merkle tries. Otherwise we can simplify the code :)

BTW: proof support for k-ary tries should be fun to implement 🤓

The text was updated successfully, but these errors were encountered:

Owner

yosriady commented Nov 22, 2019

Looking at the crypto space, Merkle trees typically use a branching factor of 2. I think we can simplify the code. Feel free to send in a PR!

I can't think of a use case for k-ary merkle tries. If there are some pressing use cases, the k-ary proof support would be useful. 🙂

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment