GitHub/quartz
1
0
Fork 2
mirror of https://github.com/jackyzha0/quartz.git synced 2025-12-27 23:04:05 -06:00
Code Issues Actions Packages Projects Releases Wiki Activity

vault backup: 2022-12-19 11:09:11

Browse Source
This commit is contained in:
Jet Hughes 2022-12-19 11:09:11 +13:00
parent 1ceade5c93
commit 9d30327cbb
2 changed files with 16 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
content/notes/merkle tree.md Normal file
View 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.”_
![digram|300](https://i.imgur.com/HMzwjgb.png)
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

2
content/notes/tree.md
View File

@ -33,4 +33,4 @@ We need to specify whether this makes them different or not. In computer science
Sometimes there are fixed slots for the children e.g.,
[binary-search-tree](notes/binary-search-tree.md)
[binary-search-tree](notes/binary-search-tree.md)