A go implementation of a merkle tree for hashing arbitrary sized directories
-
Updated
Feb 10, 2021 - Go
A go implementation of a merkle tree for hashing arbitrary sized directories
A simple, fast, immutable, in-memory, generic, "hash function-agnostic" merkle tree.
Golang merkle tree implementation based on RFC-6962 standard
Golang implementation of the Merkle Mountain Range (MMR) data structure. Designed for efficient, append-only data handling with cryptographic proofs. Supports various hash functions like Argon2, Blake2b, and SHA-256.
Go Merkle Tree. High performance, Supporting parallel run, OpenZeppelin sorting pairs.
Add a description, image, and links to the merkle topic page so that developers can more easily learn about it.
To associate your repository with the merkle topic, visit your repo's landing page and select "manage topics."