When we create tree hash from log entries we assemble whole tree in memory and calculate hash.
Maximum tree size is configurable and if the tree size is bigger than configured threshold the verification of log is skipped.
Do we need to be able to calculate tree hash by loading only parts of the tree? If so it needs to be investigated.