-
# Problem:
Currently, Sparse Merkle Trees have a predefined key space of 32 bytes, with valid keys lying in the range of $`[0, 2^{256})`$.
This enables support for generating commitments, i.e. Merk…
-
## 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…
-
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…
-
## 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…
-
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…
-
# 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 …
-
Proof of concept non-membership proof implementation
- Sparse Merkle tree
- Interval Merkle tree
mrain updated
2 years ago