Crypto.Hash.MerkleTree

newtype MerkleRoot a

Constructors

• MerkleRoot String

Instances

• Eq (MerkleRoot a)

data MerkleTree a

Constructors

• MerkleEmpty
• MerkleTree Int (MerkleNode a)

Instances

• Foldable MerkleTree

data MerkleNode a

Constructors

• MerkleBranch { mLeft :: MerkleNode a, mRight :: MerkleNode a, mRoot :: MerkleRoot a }
• MerkleLeaf { mRoot :: MerkleRoot a, mVal :: a }

Instances

• Foldable MerkleNode

mtRoot :: forall a. MerkleTree a -> MerkleRoot a

Returns root of merkle tree.

mtHash :: forall a. MerkleTree a -> String

Returns root of merkle tree root hashed.

mtSize :: forall a. MerkleTree a -> Int

emptyHash :: forall a. MerkleRoot a

mtHeight :: Int -> Int

Merkle tree height

mkLeafRootHash :: String -> MerkleRoot String

mkRootHash :: forall a. MerkleRoot a -> MerkleRoot a -> MerkleRoot a

mkMerkleTree :: List String -> MerkleTree String

Smart constructor for 'MerkleTree'.

type ProofList a = List (ProofElem a)

newtype MerkleProof a

Constructors

• MerkleProof (ProofList a)

data ProofElem a

Constructors

• ProofElem { nodeRoot :: MerkleRoot a, nodeSide :: Side, siblingRoot :: MerkleRoot a }

data Side

Constructors

• L
• R

merkleProof :: forall a. MerkleTree a -> MerkleRoot a -> MerkleProof a

Construct a merkle tree proof of inclusion

validateMerkleProof :: forall a. MerkleProof a -> MerkleRoot a -> MerkleRoot a -> Boolean

Validate a merkle tree proof of inclusion

testMerkleProofN :: Int -> Int -> Boolean