From 9d30327cbb3cb0632c6baf42420670c9a819f339 Mon Sep 17 00:00:00 2001 From: Jet Hughes Date: Mon, 19 Dec 2022 11:09:11 +1300 Subject: [PATCH] vault backup: 2022-12-19 11:09:11 --- content/notes/merkle tree.md | 15 +++++++++++++++ content/notes/tree.md | 2 +- 2 files changed, 16 insertions(+), 1 deletion(-) create mode 100644 content/notes/merkle tree.md diff --git a/content/notes/merkle tree.md b/content/notes/merkle tree.md new file mode 100644 index 000000000..f405ca722 --- /dev/null +++ b/content/notes/merkle tree.md @@ -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 diff --git a/content/notes/tree.md b/content/notes/tree.md index 0ad934fa4..6664fc34b 100644 --- a/content/notes/tree.md +++ b/content/notes/tree.md @@ -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) \ No newline at end of file