> If the hash of the root chunk is the same the entire subtree is the same. Shouldn't there be some discussion on hash collisions? Why could different trees n

> If the hash of the root chunk is the same the entire subtree is the same. Shouldn't there be some discussion on hash collisions? Why could different trees not result in identical hashes? Are they using cryptographic hash functions with a large enough number of output bits (>=128) that collision odds can be considered negligible?