Leaves of Hash

Summary: Trail of Bits released Indurative, a Haskell cryptographic library that maps types instantiating FoldableWithIndex to sparse Merkle tree representations to create and verify inclusion and exclusion proofs, letting developers add Binary Transparency to a package manager in eight lines of code. The library builds on Ralph Merkle's 1979 authentication tree patent, Ben Laurie and Emilia Kasper's 2016 sparse Merkle tree work in Trillian for certificate transparency, and Miller et al.'s 2014 authenticated data structures research.
What's compelling: Sparse Merkle trees already underpin certificate transparency in Chrome and are being considered for Ethereum, so a library that reduces authenticated data structure implementation to eight lines of code lowers the barrier for teams that previously needed a custom compiler or hand-written instances.

Read the original at Trail of Bits Blog ↗