Struct miden_core::mast::LoopNode

pub struct LoopNode { /* private fields */ }

A Loop node defines condition-controlled iterative execution. When the VM encounters a Loop node, it will keep executing the body of the loop as long as the top of the stack is `1``.

The loop is exited when at the end of executing the loop body the top of the stack is 0``. If the top of the stack is neither 0nor1` when the condition is checked, the execution fails.

Implementations

impl LoopNode

Constants

pub const DOMAIN: Felt = _

The domain of the loop node (used for control block hashing).

impl LoopNode

Constructors

pub fn new( body: MastNodeId, mast_forest: &MastForest, ) -> Result<Self, MastForestError>

impl LoopNode

pub fn digest(&self) -> RpoDigest

Returns a commitment to this Loop node.

The commitment is computed as a hash of the loop body and an empty word ([ZERO; 4]) in the domain defined by Self::DOMAIN - i..e,:

Hasher::merge_in_domain(&[body_digest, Digest::default()], LoopNode::DOMAIN);

pub fn body(&self) -> MastNodeId

Returns the ID of the node presenting the body of the loop.

Trait Implementations

impl Clone for LoopNode

fn clone(&self) -> LoopNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for LoopNode

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

Formats the value using the given formatter.

impl PartialEq for LoopNode

fn eq(&self, other: &LoopNode) -> 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 Eq for LoopNode

impl StructuralPartialEq for LoopNode