mirror of
https://github.com/arnaucube/arbo.git
synced 2026-01-29 22:36:38 +01:00
VirtualTree (vt) computes a tree without computing any hash. With the idea of once all the leafs are placed in their positions, the hashes can be computed, avoiding computing a node hash more than one time.
3.4 KiB
3.4 KiB