You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jun 11, 2024. It is now read-only.
In order to build a proof, currently it is required to loop the tree structure with full nodes at each layer and node index.
This has a significant performance cost.
Motivation
In a hypothetical situation where storing all the blocks on mainnet into a merkle tree is required, we would require the most performant use of merkle tree.
Acceptance Criteria
Tree structure looping removed.
Additional Information
n/a
The text was updated successfully, but these errors were encountered:
Description
In order to build a proof, currently it is required to loop the tree structure with full nodes at each layer and node index.
This has a significant performance cost.
Motivation
In a hypothetical situation where storing all the blocks on mainnet into a merkle tree is required, we would require the most performant use of merkle tree.
Acceptance Criteria
Tree structure looping removed.
Additional Information
n/a
The text was updated successfully, but these errors were encountered: