Struct MulAccumulator

pub struct MulAccumulator<H: Hasher> {
    pub accumulator: H::Hash,
    pub items: Vec<H::Hash>,
}

A multiplication based Accumulator

This accumulator relies on the quasi-commutative nature of the multiplication operator. It’s here mostly as a an example to gain intuition for how accumulators should function. This implementation relies on the fact that / can be used to “remove” an element but typically an accumulator cannot rely on having a shortcut, and must re-accumulate sans the element being proved to be a member.

Fields

accumulator: H::Hash

items: Vec<H::Hash>

Trait Implementations

impl<'a> Accumulator<'a> for MulAccumulator<PrimeHasher>

type Proof = <PrimeHasher as Hasher>::Hash

fn prove(&self, item: &[u8]) -> Option<Self::Proof>

Prove an item is a member of the accumulator.

fn check(&self, proof: Self::Proof, item: &[u8]) -> bool

Verify an item is a member of the accumulator.

fn from_set(items: impl Iterator<Item = &'a [u8]>) -> Option<Self>

Create an accumulator from a set of items.