Struct smt_map::SmtMap256

pub struct SmtMap256 { /* fields omitted */ }

SmtMap256 is Sparse Merkle Tree Map from 256-bit keys to 256-bit values, and supports generating 256-bit merkle proofs. Initially every of the 2**256 possible keys has a default value of zero.

Each leaf corresponds to a key-value pair. The key is the bit-path from the root to the leaf (see the documentation for TreeNodeIndex).

The hash of the leaf node is just the value of the corresponding key. The hash of an non-leaf node is calculated by hashing (using keccak-256) the concatenation of the hashes of its two sub-nodes.

Methods

impl SmtMap256

pub fn new() -> Self

Returns a new SMT-Map where all keys have the default value (zero).

pub fn set(&mut self, key: &Key, value: Value) -> Value

Sets the value of a key. Returns the old value of the key.

pub fn get(&self, key: &Key) -> &Value

Returns a reference to the value of a key.

pub fn get_with_proof(&self, key: &Key) -> (&Value, MerkleProof)

Returns a reference to the value of the key with merkle proof.

pub fn merkle_root(&self) -> &Hash256

Returns the merkle root of this Sparse Merkle Tree.

pub fn check_merkle_proof(
    &self,
    key: &Key,
    value: &Value,
    proof: &MerkleProof
) -> bool

Check the merkle proof of a key-value pair in this SMT-Map. Returns whether the proof is valid.

Trait Implementations

impl Clone for SmtMap256

fn clone(&self) -> SmtMap256

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Default for SmtMap256

fn default() -> SmtMap256

Returns the "default value" for a type.