ParallelHash128 Generator - Parallelizable Tree Hash
Generate ParallelHash128 - parallelizable tree hash using interleaving per NIST SP 800-185.
About
ParallelHash128 is a parallelizable hash function defined in NIST SP 800-185 using tree hashing with interleaving, designed for efficient parallel processing of large data with configurable block size.
Specifications
Output SizeVariable
StandardNIST SP 800-185
Standard Year2016
Origin Keccak submission to NIST SHA-3 competition
Origin Year 2008
Use Cases
—Large file parallel hashing
—Tree hash construction
—Incremental hash computation
—NIST-compliant parallel hashing
—Data center large-scale hashing
Frequently Asked Questions
ParallelHash uses a tree structure with interleaving to enable parallel processing of large messages. The message is split into blocks, each hashed independently, then combined. Note: JavaScript implementations are typically sequential; true parallelism requires native/WASM code.
Use ParallelHash for very large files (GB+) where parallel processing provides significant speedup on multi-core systems. For smaller data or JavaScript environments, regular SHA-3 is typically faster due to lower overhead.
Probably not. JavaScript is single-threaded, and the tree structure overhead may slow it down compared to regular SHA-3. ParallelHash benefits appear in native multi-threaded implementations. For JS/Node.js, use standard SHA-3 for simplicity.