Developers.Hash.TigerTree.Inside

ideally, you would document the hashing code down to the function that just takes some data, and returns a hash everything built above that should be line-by-line commented and fully documented how that function works inside is ok to be unknown/in assembly so, for tigertree, find and use externally the internal hash and external hash functions

that file which is 1KB of as, 1KB of bs, and so on, show how you can use the internal and leaf hash functions to compose the root hash

---

find the methods that actually compute the leaf and internal hashes write a little sample that shows how the tree is built for the 4k test file

this is how you will figure out answers to questions like how does it know the block size and how you will build the better interface to tigertree