Struct ProofOrder 

pub struct ProofOrder { /* private fields */ }

Proof-order AIR permutation.

The proof stores AIR commitments in ascending (log_trace_height, instance_index) order. That order can vary by statement, so the recursive verifier selects one ACE circuit from a small registry. The registry key is tag, the Lehmer rank of the AIR permutation relative to AIRS.

Implementations

impl ProofOrder

pub fn new(airs: [MidenAir; 3]) -> Self

Construct a proof order from an explicit AIR permutation.

Panics if an AIR is missing or duplicated.

pub fn from_airs(airs: &[MidenAir]) -> Self

Construct a proof order from a slice containing every supported AIR exactly once.

pub fn instance_order() -> Self

Return the canonical instance order from AIRS.

pub fn variants() -> Vec<Self>

Return every supported proof order, sorted by tag.

pub fn from_tag(tag: u32) -> Option<Self>

Decode a registry tag into a proof order.

pub fn from_instance_log_heights(log_heights: &[u8]) -> Self

Sort AIRs by trace height, using instance order as the tie-breaker.

log_heights must be in AIRS order.

pub fn airs(&self) -> &[MidenAir]

AIRs in the order used by the proof.

pub fn tag(&self) -> u32

Registry tag for this proof order.

pub fn file_stem(&self) -> String

File stem for the generated ACE circuit for this order.

Trait Implementations

impl Clone for ProofOrder

fn clone(&self) -> ProofOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProofOrder

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

Formats the value using the given formatter.

impl Eq for ProofOrder

impl PartialEq for ProofOrder

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ProofOrder