Struct RegistryLayout 

pub struct RegistryLayout { /* private fields */ }

Shape of a registry: how many orderings it covers and where its checked-in node row sits.

row_depth trades checked-in artifact size against per-lookup work: the row holds 2^row_depth nodes and each covers 2^(tree_depth - row_depth) leaves, which is what a lookup recomputes. row_depth = 0 means the row is the root itself, i.e. every lookup rebuilds the whole tree.

Implementations

impl RegistryLayout

pub const fn new(num_airs: usize, row_depth: usize) -> Option<Self>

Build a layout, or None if the AIR count cannot be represented by u32 tags or the checked-in row does not sit strictly above the leaves.

A registry needs at least two AIRs. A single AIR has one ordering, while the Merkle implementation used by the serving path requires at least two leaves.

pub const fn num_airs(&self) -> usize

Number of AIRs in the composition.

pub const fn order_count(&self) -> usize

Number of proof orderings, i.e. active leaves (num_airs!).

pub const fn tree_depth(&self) -> usize

Smallest tree depth covering every tag.

pub const fn leaf_count(&self) -> usize

Total leaf slots, active plus padding.

pub const fn row_depth(&self) -> usize

Depth of the checked-in node row.

pub const fn row_len(&self) -> usize

Number of nodes in the checked-in row.

pub const fn leaves_per_subtree(&self) -> usize

Leaves under one row node, i.e. the work one lookup recomputes.

Trait Implementations

impl Clone for RegistryLayout

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RegistryLayout

impl Debug for RegistryLayout

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

Formats the value using the given formatter.

impl Eq for RegistryLayout

impl PartialEq for RegistryLayout

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RegistryLayout