Given a trie T and items to be added X and Y,
a. assert root(T.add(x)) != root(T.add(y))
b. assert root(T.add(x).add(y)) == root(T.add(y).add(x))
c. assert root(T.add(x).add(x)) == root(T.add(x)) (or reverts)
something to check that the value being proved is a leaf and not an intermediate node (I don't think this applies to merkle-patricia tries)
Describe the desired feature or improvement