Anti-entropy with Merkle trees
Play this lessonThis lesson comes with an interactive animation you can break, a live-code challenge and a chapter quiz.How do two replicas find which data differs without comparing every key? A Merkle tree (hash tree): every non-leaf node is labeled with the hash of its children's labels.
The rest of this lesson is part of Pro
Pro unlocks every lesson with its animation, code challenge and quiz, plus every interview problem. ₹299 a month or ₹1,999 a year.
See Pro