/fs-merkle

A pure :sparkles: F# implementation of Merkle Trees

Primary LanguageF#

fs-merkle

A pure F# implementation of the merkle tree algorithm.

  • [Features]
    • Generating and Verifying Audit Paths
    • Efficient Sparse Merkle Trees implementation
    • Follows RFC

This implementation uses a recursive algorithm over byte arrays instead of rebuilding trees using types.

  • N.B : Uses BouncyCastle for the SHA3 digest.