merkle-tree | Hash tree enabling efficient comparisons | Hashing library

merkle-tree is a Java library typically used in Security, Hashing applications. merkle-tree has no bugs, it has no vulnerabilities, it has build file available, it has a Permissive License and it has high support. You can download it from GitHub.

Merkle tree is a tree in which every non-leaf node is labeled with the hash of the labels of its children nodes. Hash trees are useful because they allow efficient and secure verification of the contents of large data structures. Hash trees are a generalization of hash lists and hash chains. Demonstrating that a leaf node is a part of the given hash tree requires processing an amount of data proportional to the logarithm of the number of nodes of the tree. The concept of hash trees is named after Ralph Merkle who patented it in 1979. For the objects of interest, merkle trees are typically constructed at runtime and serialized and shipped over the wire to the other site where they are recomputed and compared with the incoming tree. Quickly identifying the diffs helps speed up and makes more efficient the delta sync between the two sites. They can also be applied to a local site - 2 large files being locally compared.