You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
The text was updated successfully, but these errors were encountered:
moshababo
changed the title
Implement the new merkle-tree for NIP (fiat-shamir heuristic)
Use the new merkle-tree implementation
Apr 17, 2019
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.
The text was updated successfully, but these errors were encountered: