Struct Accumulator 

pub struct Accumulator {
    pub root: B256,
}

Accumulator is computed by constructing an SSZ list of header-records and calculating the hash_tree_root

Fields

root: B256

The accumulator root hash

Implementations

impl Accumulator

pub const fn new(root: B256) -> Self

Create a new Accumulator from a root hash

pub fn to_entry(&self) -> Entry

Convert to an Entry

pub fn from_entry(entry: &Entry) -> Result<Self, E2sError>

Create from an Entry

pub fn from_header_records(records: &[HeaderRecord]) -> Result<Self, E2sError>

Compute the accumulator from a list of header records.

Implements hash_tree_root(List[HeaderRecord, 8192]) per the spec:

• Each leaf is sha256(block_hash || total_difficulty_le_bytes32)
• Leaves are padded to MAX_BLOCKS_PER_ERE (8192) with zero hashes
• Binary Merkle tree is computed bottom-up
• Final root is sha256(merkle_root || le_bytes32(actual_count))

Returns Err if records exceeds MAX_BLOCKS_PER_ERE.

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 Eq for Accumulator

impl PartialEq for Accumulator

fn eq(&self, other: &Accumulator) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Accumulator

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 32 bytes