Interface MerkleTree

  • All Implemented Interfaces:

    public interface MerkleTree

    MerkleTrees are cryptographic data structures which can be used to create a short fingerprint of a larger structured dataset. From MerkleTrees, we can create MerkleProofs which let us prove that some particular data is part of the whole tree without revealing the remaining data.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Modifier and Type Field Description
    • Constructor Summary

      Constructor Description
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Constructor Detail

    • Method Detail

      • getLeaves

        @NotNull() abstract List<Array<byte>> getLeaves()

        Return the input data elements. Usually something deterministically serialized.


        The input data elements.

      • getRoot

        @NotNull() abstract SecureHash getRoot()

        Return the root element of the tree which is essentially the fingerprint of the whole tree/data set.


        The root element hash.