Struct Accumulator 

pub struct Accumulator {
    pub state: BigUint,
    pub trapdoor: BigUint,
    pub modulus: BigUint,
    pub elements: HashMap<Vec<u8>, BigUint>,
}

An accumulator state.

Fields

state: BigUint

The accumulated value.

trapdoor: BigUint

The trapdoor (prime factorization of the modulus).

modulus: BigUint

The modulus N = p * q.

elements: HashMap<Vec<u8>, BigUint>

Element → prime representation.

Implementations

impl Accumulator

pub fn new() -> Self

Create a new accumulator with a fresh trapdoor.

pub fn add(&mut self, element: &[u8]) -> BigUint

Add an element to the accumulator.

pub fn witness(&self, element: &[u8]) -> Option<BigUint>

Generate a witness (membership proof) for an element.

pub fn verify(&self, witness: &BigUint, element: &[u8]) -> bool

Verify membership: witness ^ element_prime == state (mod N).

pub fn remove(&mut self, element: &[u8]) -> bool

Remove an element (requires recomputation).

pub fn count(&self) -> usize

Number of accumulated elements.

Trait Implementations

impl Clone for Accumulator

fn clone(&self) -> Accumulator

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Accumulator

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Accumulator

fn default() -> Self

Returns the “default value” for a type.