> (especially for tree hashing, which makes K12 better than any other hash to hash big files). I am aware that other modern hash functions like BLAKE2 (and may

> (especially for tree hashing, which makes K12 better than any other hash to hash big files). I am aware that other modern hash functions like BLAKE2 (and maybe BLAKE/Skein?) support tree hashing, is there any reason why K12 would be better for that?