Struct Node 

pub struct Node { /* private fields */ }

A deferred DAG entry whose meaning is supplied by a framework tag or owning super::Precompile.

The framework validates only the declared NodeType. Value semantics, producing ops, and predicates all live in the owning super::Precompile. A predicate succeeds by evaluating to Node::TRUE, so callers can handle every canonical result as an ordinary node.

Implementations

impl Node

pub const PACKED_BYTES_PER_CHUNK: usize

Number of little-endian bytes represented by one DataChunk.

Each of the eight field elements stores one packed u32, so a chunk carries 32 bytes.

pub const TRUE: Node

Canonical TRUE node returned by predicates that verify successfully.

pub fn value(tag: Tag, chunk: DataChunk) -> Result<Self, DeferredError>

Creates a value-like single-chunk data node.

pub fn try_data( tag: Tag, chunks: impl Into<Arc<[DataChunk]>>, ) -> Result<Self, DeferredError>

Creates a data node from a non-empty chunk collection.

Returns DeferredError::InvalidPayload if chunks is empty and DeferredError::InvalidTag if tag uses a framework-reserved id.

pub fn chunks( chunks: impl Into<Arc<[DataChunk]>>, ) -> Result<Self, DeferredError>

Creates a framework-owned opaque chunk-list data node.

Returns DeferredError::InvalidPayload if chunks is empty.

pub fn chunks_from_bytes(bytes: &[u8]) -> Self

Creates a framework-owned opaque chunk-list data node from bytes.

Bytes are packed little-endian into u32 field elements, padded with zero felts to a non-empty multiple of one DataChunk, and wrapped in the framework Tag::CHUNKS node. Empty byte strings therefore encode as a single all-zero chunk.

pub fn join(tag: Tag, lhs: Digest, rhs: Digest) -> Result<Self, DeferredError>

Creates a join-shaped node that references two child digests.

pub fn try_pair_list( tag: Tag, pairs: impl Into<Arc<[(Digest, Digest)]>>, ) -> Result<Self, DeferredError>

Creates a pair-list-shaped node that references one or more structural digest pairs.

pub fn try_pair_list_chunks( tag: Tag, chunks: impl Into<Arc<[DataChunk]>>, ) -> Result<Self, DeferredError>

Creates a pair-list-shaped node from non-empty chunks encoded as lhs_digest || rhs_digest.

pub fn and(lhs: Digest, rhs: Digest) -> Self

Creates a structural deferred-root AND step from the previous root and statement digest.

pub fn tag(&self) -> Tag

Returns this node’s tag.

pub fn payload(&self) -> &Payload

Returns this node’s payload.

pub fn payload_for_tag(&self, tag: Tag) -> Result<&Payload, DeferredError>

Returns this node’s payload if the node has tag.

pub fn is_true(&self) -> bool

Returns whether this node is structurally the canonical TRUE result.

pub fn felt_len(&self) -> usize

Returns the field-element length of this node’s canonical external representation.

pub fn write_into_felts(&self, target: &mut Vec<Felt>)

Appends this node’s canonical external representation to target.

pub fn to_felts(&self) -> Vec<Felt>

Returns this node’s canonical external representation.

pub fn digest(&self) -> Digest

Computes the canonical digest used by both host code and Miden VM programs.

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl Eq for Node

impl PartialEq for Node

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Node