The merkle-tree from avoloshko

merkle-tree's Introduction

Merkle Tree and Merkle proofs implementation in Kotlin

MerkleTree is implemented in Kotlin with kotlin-platform-common plugin which allows to compile the code to JavaScript.

Implemented methods:

MerkleTree(input: List<ByteArray>, hash: (ByteArray) -> ByteArray)
  root(): ByteArray
  hexRoot(): ByteArray
  containsLeaf(el: ByteArray): Boolean
  containsElement(el: ByteArray): Boolean
  proofForLeaf(el: ByteArray): List<ByteArray>
  hexProofForLeaf(el: ByteArray): List<ByteArray>
  proofForElement(el: ByteArray): List<ByteArray>
  hexProofForElement(el: ByteArray): List<ByteArray>MerkleTree

MerkleTree.verifyProof(proof: List<ByteArray>, root: ByteArray, leaf: ByteArray, hash: (ByteArray) -> ByteArray): Boolean

SparseMerkleTree(input: Map<Int, ByteArray>, val depth: Int, hash: (ByteArray) -> ByteArray)
  root(): ByteArray
  hexRoot(): ByteArray
  containsLeaf(el: ByteArray): Boolean
  containsElement(el: ByteArray): Boolean
  proofForLeaf(el: ByteArray): List<ByteArray>
  hexProofForLeaf(el: ByteArray): List<ByteArray>
  proofForElement(el: ByteArray): List<ByteArray>
  hexProofForElement(el: ByteArray): List<ByteArray>MerkleTree
  proofForIndex(idx: Int): List<ByteArray>
  hexProofForIndex(idx: Int): List<ByteArray>MerkleTree

MerkleTree.verifyProof(proof: List<ByteArray>, root: ByteArray, leaf: ByteArray, idx: Int): Boolean

SHA-256 implementation is provided.

val merkleTree = MerkleTree(elements, { data -> SHA256Digest.instance.digest(data) })

merkle-tree's People

Contributors

Stargazers

Watchers

merkle-tree's Issues

Incremental build

is it possible to build a merkle tree using this library incrementally in a loop instead of giving the entire dataset all together in the constructor?

@avoloshko

Recommend Projects