xraylarac/study-algorithms-datastructures

Exploring and implementing different Algorithms and Datastructure with different languages

Study Algorithms and Data Structures

Table of Contents

• Trees
  • Merkle Tree
    • Implementations
      • Solidity
      • Rust
      • Python
      • JavaScript / TypeScript
      • DSLs (ZKP)
        • Circom (zkSNARK)
        • Cairo (zkSTARK)

Exploring and implementing different Algorithms and Datastructure with different languages

Trees

Merkle Tree

In cryptography and computer science, a hash tree or Merkle tree is a tree in which every "leaf" (node) is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner node, or inode) is labelled with the cryptographic hash of the labels of its child nodes. A hash tree allows efficient and secure verification of the contents of a large data structure. A hash tree is a generalization of a hash list and a hash chain. 🔗: wiki/Merkle_tree

Implementations

Solidity

Rust

Python

JavaScript / TypeScript

DSLs (ZKP)

Circom (zkSNARK)

Cairo (zkSTARK)