|0.3.0||Oct 12, 2023|
|0.2.1||Aug 9, 2023|
|0.2.1-rc.0||Jun 30, 2023|
|0.2.0||Jun 28, 2023|
|0.1.0||Jun 28, 2023|
#1037 in Data structures
470 downloads per month
Used in 3 crates
A sparsely populated
merkle tree, which uses the poseidon hash algorithm for level aggregation and
is parametrized over its height and arity.
Height 0 h / \ / \ / \ / \ / \ Height 1 h h / \ / \ / \ / \ Height 2 h x h h / \ / \ / \ Height 3 h x x h h h Position 0 5 6 7
Additionally to the tree itself, this crate defines an opening gadget that can
be used to create a merkle opening circuit for zero-knowledge applications
Item<T> has the aggregation of the
hash part with the poseidon hash
pre-defined and additionally allows for a custom data type with custom
There are benchmarks for the poseidon tree calculation available with
and additional benchmarks for the opening proof generation with PLONK
cargo bench --features zk
This requires a nightly toolchain.
This project is licensed under the Mozilla Public License, version 2.0. See the license file for more details.