An optimized Sparse Merkle Tree in Rust
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.
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.
Python object-oriented implementation of hash tree, originally used as a module in university project
Stage374: Production Sigstore Signing and Rekor Inclusion Verification Gate using GitHub Actions OIDC, Cosign bundles, identity verification, and fail-closed external transparency binding.
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.
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 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.
Add a description, image, and links to the inclusion-proof topic page so that developers can more easily learn about it.
To associate your repository with the inclusion-proof topic, visit your repo's landing page and select "manage topics."