mirror of
https://github.com/jackyzha0/quartz.git
synced 2025-12-31 00:34:05 -06:00
16 lines
897 B
Markdown
16 lines
897 B
Markdown
---
|
||
title: "merkle tree"
|
||
tags:
|
||
-
|
||
---
|
||
|
||
A trie is a tree like data structure that isused to retrieve a string value by traversing down a branch of nodes that store associated references that together lead to the end value that can be returned.
|
||
|
||
Merkle trees exist to prove consistency of data. They are essentially a tree of hashes.
|
||
|
||
> _“_**_Merkle tree_** _is a_ [[tree]] _in which every leaf node is labelled with the hash of a data block and every non-leaf node is labelled with the_ [_cryptographic hash_](https://en.wikipedia.org/wiki/Cryptographic_hash_function) _of the labels of its child nodes.”_
|
||
|
||
|
||
|
||
They provide a means to prove the integrity and validity of data. E.g., if you change the value of a data block, the entire path leading to the root hash would also be changed. So, if we hold the value of the root hash, we could v
|