Merkle-tree in Python
-
Updated
Mar 23, 2024 - Python
Merkle-tree in Python
Merkle trees for easier data verification.
A command-line utility to checksum directories and files.
Generates graphs from git repos
A transactional, atomic, reliable POSIX's rm command implementation written in C++. 🌀
Simple implementation of Merkle tree data structure
Write a code to generate a hash tree algorithm with candidate item sets
Apriori algorithm impletation based on hash tree. Dataset: Music.txt.gz (https://snap.stanford.edu/data/web-Amazon.html)
A merkle tree lib using blake3 and binary tree arrays for superfast trees ⚡
tree hash (tiger, sha256 or any other avaliable in golang)
Frequent patten mining using apriori algorithm with hast tree for Amazon review data around 6M users.
A tool to deduplicate backups. It builds a hash tree of all files and folders in the target directory. Optionally also traversing into archives like zip or tar files. The hash tree is then used to find duplicate files and folders.
A B+AVL tree is a Merkle tree that combines the properties of both AVL trees and B+Trees.
Add a description, image, and links to the hash-tree topic page so that developers can more easily learn about it.
To associate your repository with the hash-tree topic, visit your repo's landing page and select "manage topics."