Binary Merkle Tree hash

Command main_legacy executes the BMT hash algorithm on the given data and writes the binary result to standard output Up to 4096 bytes will be read If a filename is given as argument, it reads data from the file.

Binary Merkle Tree Hash is a hash function over arbitrary datachunks of limited size.

Package reference is a simple nonconcurrent reference implementation for hashsize segment based Binary Merkle tree hash on arbitrary but fixed maximum chunksize n where 0 <= n <= 4096 This implementation does not take advantage of any paralellisms and uses far more memory than necessary, but it is easy to see that it is correct.

Hash provides the necessary extension of the hash interface to add the length-prefix of the BMT hash.