An optimized Sparse Merkle Tree in Rust
-
Updated
Sep 2, 2025 - Rust
An optimized Sparse Merkle Tree in Rust
Merkle Mountain Range (MMR) append-only cryptographic accumulator supporting O(log N) inclusion proofs, peak bagging, and pruning.
Merkle Mountain Range (MMR) append-only cryptographic accumulator supporting O(log N) inclusion proofs, peak bagging, and pruning.
Implementation and comparison of three kinds of sparse Merkle trees.
Tamper-evident, verifiable append-only logs & maps for TypeScript — RFC 6962 Merkle trees with inclusion & consistency proofs, Ed25519 signed checkpoints, and a sparse Merkle verifiable map. Zero dependencies.
Stage373: Final Acceptance Attestation and External Transparency Binding Gate. Binds Stage372 result and manifest, prepares Sigstore/Rekor verification, and preserves ML-DSA as pending until real verification succeeds.
Stage374: Production Sigstore Signing and Rekor Inclusion Verification Gate using GitHub Actions OIDC, Cosign bundles, identity verification, and fail-closed external transparency binding.
Python object-oriented implementation of hash tree, originally used as a module in university project
RFC 6962/9162 Merkle trees: inclusion and consistency proofs for OCaml
Self-hostable, single-binary transparency log — an append-only, cryptographically verifiable (RFC 6962 Merkle) record service with Ed25519-signed tree heads. JVM-native via GraalVM. Etched in — can't be erased.
Merkle inclusion proof verifier that derives fold direction from leaf index, not the prover
Browser-based Merkle tree and inclusion proof demo — build trees up to 16 leaves with real SHA-256, generate O(log n) membership proofs, tamper any leaf and watch the root change, with Git, Bitcoin, and Certificate Transparency walkthroughs. Part of crypto-lab.
Browser-based Merkle tree demo — build a tree, generate inclusion proofs, recompute the root hash by hash, and replay the RFC 6962 second-preimage and CVE-2012-2459 attacks. Real SHA-256. No backend.
Browser-based RSA accumulator — membership proofs, Bézout non-membership proofs, and an RFC 6962 Merkle tree side by side, with a 64-byte digest over up to 1,000 elements, witnesses that go stale and are repaired from public data, and ten forgery attempts where the one that cannot fail is the trapdoor itself
To associate your repository with the inclusion-proof topic, visit your repo's landing page and select "manage topics."