MD6 Tree Mode
The MD6 tree mode is MD6's parallel configuration, organizing the message into a k-ary Merkle tree whose leaves are compressed independently, supporting multi-core parallelism.
Purpose
Provides scalable hashing throughput on multi-core platforms; tree depth grows logarithmically with message length.
Mechanism
Leaves are message blocks; each leaf uses compression function f to produce a chaining value; internal nodes concatenate child chaining values and compress them with f. The k-ary tree compresses each level in parallel, outputting at the root.
Use cases
- Multi-core parallel hashing
- Large-file verification
- Scalable throughput