Struct SparseMerkleTree 

pub struct SparseMerkleTree<const D: usize, S: NodeStore> { /* private fields */ }

Implementations

impl<const D: usize, S: NodeStore> SparseMerkleTree<D, S>

pub fn new(store: S) -> Result<Self, S::Error>

Construct a new tree from a store.

pub fn root(&self) -> Result<[u8; 32], S::Error>

Get the current root.

pub fn add( &mut self, key: [u8; 32], val: [u8; 32], ) -> Result<(), Error<S::Error>>

Insert a new leaf.

pub fn update( &mut self, key: [u8; 32], val: [u8; 32], ) -> Result<[u8; 32], Error<S::Error>>

Update an existing leaf’s value, returning the previous value.

pub fn get_proof(&self, key: [u8; 32]) -> Result<CircomProof<D>, S::Error>

Build a circom-compatible proof for key inclusion or non-inclusion.

pub fn add_or_update( &mut self, key: [u8; 32], val: [u8; 32], ) -> Result<(), Error<S::Error>>

Insert or update (insert if missing, otherwise replace the value).