Benchmark Sparse Merkle Tree crates

[damip]

Discussion: #3852 (comment)

Task: Benchmark the following crates to see how easily/efficiently they keep track of a state hash:

• https://docs.rs/monotree/latest/monotree/
• https://docs.rs/sparse-merkle-tree/latest/sparse_merkle_tree/
• https://diem.github.io/diem/diem_jellyfish_merkle/index.html
• https://github.com/y-pakorn/cw-merkle-tree
• https://docs.rs/lsmtree/latest/lsmtree/

Benchmark parameters: speed of hash update on insertion/deletion in a BTreeMap of 1M key-value elements

[damip]

@litchipi so this can be considered as done / closed ?

Followups for implementing it in the state should be opened @Leo-Besancon

The discussion #3852 should be updated

[litchipi]

Yes I think so. I'll follow up the discussion once I have the time to discuss with @Leo-Besancon about it next week