Hey! Thanks for this awesome library. It was just what I was looking for! I didn't see a license file, just wanted to confirm the license before I used it in a project. Thanks again!
openzepplein latest version v4.9.2 support multiProof verification in their merkleProof library, how can i create multiProofs in solidity inside foundry repo?
Any ideas on how one might build a tree incrementally? I'd like to add a leaf in a contract function and save the root in contract storage. Then, later check that some supplied hash is part of the tree in a different function (different txn). i.e., an inclusion proof against a dynamic tree.
Cannot be fixed by adding one element by making it even - this only seems to work if the number of leaves is small (3 in the case of the example above, making it 4)
But for a tree of say 9 elements, adding a zero node does not solve the issue
Why does murky not follow the bitcoin tree implementation?