-
There are several Merkle Tree "flavors:
- incremental
- sparse
- leant
- persistent
- ...
It would be helpful to write a comparison of of all them, answering questions like
- "when not to use…
-
**Describe the package you'd like**
[`pmtree`](https://github.com/Rate-Limiting-Nullifier/pmtree) (Persistent Merkle Tree) is an optimized, sparse, fixed-size Merkle tree implementation in Rust. Th…
-
## Description
Cannon's memory is currently structured as a binary merkle tree of depth 27 with 32 byte leaf values, representing a 32-bit address space. There are some performance bottlenecks wit…
-
## Purpose
To validate the data by using Sparse Merkle Tree as a User ID accumulator (#40), efficient construction of the Sparse Merkle Tree is required because it's still not very cheap.
- Mass…
-
We're currently using this library https://github.com/heliaxdev/sparse-merkle-tree/tree/tomas/encoding. We only store the hashes (`H256`) of the key and values in the tree (more details in https://git…
-
I think its possible to create a wrapper over `lib/mrkl.js` to create a sparse merkle tree with an easy to use API. This could be used to add commitments to all previous blocks in the block header, al…
tynes updated
5 years ago
-
We're using arse-merkle-tree (our modified Sparse Merkle Tree) because the old `ics23` crate didn't support SMT proofs.
`ics23` [v0.10.x](https://github.com/cosmos/ics23/blob/master/CHANGELOG.md#0100…
-
In the current compute-optimised SMT implementation, this simply requires an extra field in the proof for the data of the leaf found at the position of the key that non-membership is being proven for,…
-
From the implementation, it seems like the balance tree uses the same sparse merkle tree data structure as the circuit account tree.
```
pub struct CircuitAccount {
pub subtree: SparseMerkleTr…
-
Reference: https://github.com/ZanjeerPlatform/csmt
We should implement CSMT to allow for verifiable reads/writes to be done in NSTs.
Checklist:
- JavaScript library that implements the referenc…