Under the auspices of the Computational Complexity Foundation (CCF)
We prove upper and lower bounds for computing Merkle tree traversals, and display optimal trade-offs between time and space complexity of that problem.
