merkle tree
Summary
Merkle tree
- trees structure
| Operation | Method | Performance |
|---|---|---|
insert(f) | propagate hash up to the root, add new subtree if full | - |
verify(i,j) | retrieve | - |
update(i, f) | propagate hash up to the root | - |
Concept
Data structure
- complete binary tree - unfilled leaves are usually 0
- abit like divide-and-conquer
Application
Querying
query(1,4)
query(1,3)