MerkleProof

• addHash(String hash, boolean isLeft) → $\Theta(1)$
• proveValidityOfData(Object data) → $\Theta(n)$ lunghezza lista MerkleProof = $\Theta(h)$ $h:$ altezza MerkleTree
• proveValidityOfBranch(MerkleNode branch) → $\Theta(n)$ lunghezza lista MerkleProof

• computeHash(String hash) → $\Theta(n)$ $n:$ lunghezza lista MerkleProof

MerkleProofHash

• equals(Object obj) → $\Theta(1)$
• hashCode() → $\Theta(1)$

HashLinkedList.java

MerkleNode.java

MerkleTree.java