We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
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.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
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.
The text was updated successfully, but these errors were encountered: