|
|
|
|
|
|
by adrian_b
271 days ago
|
|
|
BLAKE3 and other parallelizable hashes do exactly this, but using a somewhat more complex algorithm, which ensures that the result is a secure hash. Such an algorithm has been first published by Ralph Merkle, in 1979, but it has been improved later: https://en.wikipedia.org/wiki/Merkle_tree For security, it is necessary to use different hash functions at different levels in the hash tree, but this is trivially achieved by using the same hash function, but also hashing some extra distinguishing data besides the hashes from the previous level. |
|
|