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
Is it possible to verify Merkle proofs using only the (1) path of the node and (2) root node without needing to have the complete tree?
Normally, this should be possible but as I understand it the current API does not support it. Is there a way to verify Merkle proofs without the full tree?
One way I can think of is getting the hashes from the path and and manually verifying up to the root node? Are there any pitfalls in this approach?
The text was updated successfully, but these errors were encountered:
Is it possible to verify Merkle proofs using only the (1) path of the node and (2) root node without needing to have the complete tree?
Normally, this should be possible but as I understand it the current API does not support it. Is there a way to verify Merkle proofs without the full tree?
One way I can think of is getting the hashes from the path and and manually verifying up to the root node? Are there any pitfalls in this approach?
The text was updated successfully, but these errors were encountered: