mirror of
https://github.com/jackyzha0/quartz.git
synced 2026-03-25 07:25:42 -05:00
vault backup: 2022-12-19 11:09:11
This commit is contained in:
parent
1ceade5c93
commit
9d30327cbb
15
content/notes/merkle tree.md
Normal file
15
content/notes/merkle tree.md
Normal file
@ -0,0 +1,15 @@
|
|||||||
|
---
|
||||||
|
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
|
||||||
Loading…
Reference in New Issue
Block a user