Build a transaction trie from a simple binary Merkle Tree

[citizen-stig]

Background

Currently, we have good default implementation of a sparse merkle trie (the jmt) which is generic over hash function so that it can run efficiently in any zkvm. But, many implementers will probably want a standard (non-sparse) merkle trie as well.

Desired Outcome

Provide a non-sparse binary merkle trie which is generic over hash function. https://github.com/Sovereign-Labs/nmt-rs/tree/master/src/simple_merkle is a good candidate, but it should be extracted into its own package and tested/audited if we want to use it.

https://github.com/Sovereign-Labs/nmt-rs/tree/master/src/simple_merkle

[citizen-stig]

@preston-evans98 please help groom this issue and populate details about desired outcome

[preston-evans98]

Background

Currently, we have good default implementation of a sparse merkle trie (the jmt) which is generic over hash function so that it can run efficiently in any zkvm. But, many implementers will probably want a standard (non-sparse) merkle trie as well.

Desired Outcome

Provide a non-sparse binary merkle trie which is generic over hash function. https://github.com/Sovereign-Labs/nmt-rs/tree/master/src/simple_merkle is a good candidate, but it should be extracted into its own package and tested/audited if we want to use it.

[preston-evans98]

Marking this as low priority since we don't currently have any customers asking for it and we managed to build the demo-rollup without it.