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
it is not possible to verify an unsorted tree unbalanced tree without the hash order for every proof node.
so checkproofordered is broken for proofs that are shorter than the tree height.
use merkletreejs library which produces proofs with positions
The text was updated successfully, but these errors were encountered:
it is not possible to verify an unsorted tree unbalanced tree without the hash order for every proof node.
so checkproofordered is broken for proofs that are shorter than the tree height.
use merkletreejs library which produces proofs with positions
The text was updated successfully, but these errors were encountered: