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

Use the new merkle-tree implementation #37

Closed
moshababo opened this issue Apr 16, 2019 · 1 comment
Closed

Use the new merkle-tree implementation #37

moshababo opened this issue Apr 16, 2019 · 1 comment

Comments

@moshababo
Copy link
Contributor

moshababo commented Apr 16, 2019 •
edited

The number of leafs to prove depends on the security parameter constant (T).
merkle-tree can be used to create more efficient proof of multiple leafs, specially for the verifier which currently use a key-value cache to detect repeating nodes in the tree.
@moshababo moshababo changed the title Implement the new merkle-tree for NIP (fiat-shamir heuristic) Use the new merkle-tree implementation Apr 17, 2019
@moshababo moshababo mentioned this issue Apr 23, 2019
Closed
@moshababo
Copy link
Contributor Author

Closed by #49.

@noamnelke noamnelke mentioned this issue May 8, 2019
Merged
4 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@moshababo