If you are going to update the hash code, you also should parallelize
the calculation.
Ie:
call the initialization function of hash
loop:
read a block of the file
mix it into each hash in turn
end loop:
finalize each hash
It is silly and, for large DIST files, slow to read(2) the file n
For an overview of tree-signing, please see informational GLEP57.
This patch series implements all parts needed for GLEP59. Upcoming patch series
will include support for the rest of the tree-signing, GLEP59-61.
[1/4] Manifest2 hash: Whirlpool
[2/4] Manifest2 hash: SHA512
New hashes.
[3/4] Mani
