Class Blake2b.Tree

  • Enclosing interface:
    Blake2b

    public static class Blake2b.Tree
    extends java.lang.Object
    Note that Tree is just a convenience class; incremental hash (tree) can be done directly with the Digest class.
    Further node, that tree does NOT accumulate the leaf hashes -- you need to do that
    • Constructor Summary

      Constructors 
      Constructor Description
      Tree​(int depth, int fanout, int leaf_length, int inner_length, int digest_length)  
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      Blake2b.Digest getNode​(int depth, int offset)
      returns the Digest for tree node @ (depth, offset)
      Blake2b.Digest getRoot()
      returns the Digest for root node
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • Tree

        public Tree​(int depth,
                    int fanout,
                    int leaf_length,
                    int inner_length,
                    int digest_length)
        Parameters:
        fanout -
        depth -
        leaf_length - size of data input for leaf nodes.
        inner_length - note this is used also as digest-length for non-root nodes.
        digest_length - final hash out digest-length for the tree
    • Method Detail

      • getNode

        public final Blake2b.Digest getNode​(int depth,
                                            int offset)
        returns the Digest for tree node @ (depth, offset)
      • getRoot

        public final Blake2b.Digest getRoot()
        returns the Digest for root node