4 ms·
Nice! With this, you can get the same parallelizability and fast incremental updating as a hash tree, with the same output as a simple hash-of-all-the-bytes.
by pjscott 14y ago
Nice! With this, you can get the same parallelizability and fast incremental updating as a hash tree, with the same output as a simple hash-of-all-the-bytes.
- auggierose 14y agoYeah, exactly. I am using it for hashing btrees, will put this up next week or so on github.