Struct ProgramNode

pub struct ProgramNode<T>
where
    T: ZkpType,
{
    pub ids: &'static [NodeIndex],
    /* private fields */
}

An implementation detail of the ZKP compiler. Each expression in a ZKP program is expressed in terms of ProgramNode, which proxy and compose the parse graph for a ZKP program.

They proxy operations (+, -, /, etc) to their underlying type T to manipulate the program graph as appropriate.

Remarks

For internal use only.

Fields

ids: &'static [NodeIndex]

The indices in the graph that compose the type backing this ProgramNode.

Implementations

impl<T> ProgramNode<T>

where T: ZkpType,

pub fn new(ids: &[NodeIndex]) -> Self

Create a new Program node from the given indicies in the

Trait Implementations

impl<T> Add for ProgramNode<T>

where T: AddVar + ZkpType,

type Output = ProgramNode<T>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl<T> Clone for ProgramNode<T>

where T: ZkpType + Clone,

fn clone(&self) -> ProgramNode<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> CreateZkpProgramInput for ProgramNode<T>

where T: ZkpType,

fn public_input() -> Self

Creates a public program input of type T.

fn private_input() -> Self

Creates a private program input of type T.

fn constant_input() -> Self

Creates a constant program input of type T.

impl<T: ZkpType> Debug for ProgramNode<T>

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

Formats the value using the given formatter.

impl<T> Div for ProgramNode<T>

where T: DivVar + ZkpType,

type Output = ProgramNode<T>

The resulting type after applying the / operator.

fn div(self, rhs: Self) -> Self::Output

Performs the / operation.

impl<T> IntoProgramNode for ProgramNode<T>

where T: ZkpType,

type Output = T

The type of ProgramNode this becomes.

fn into_program_node(self) -> ProgramNode<Self::Output>

Turns the given value into a ProgramNode.

impl<T> Mul for ProgramNode<T>

where T: MulVar + ZkpType,

type Output = ProgramNode<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl<T> Neg for ProgramNode<T>

where T: NegVar + ZkpType,

type Output = ProgramNode<T>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<T> Rem for ProgramNode<T>

where T: RemVar + ZkpType,

type Output = ProgramNode<T>

The resulting type after applying the % operator.

fn rem(self, rhs: Self) -> Self::Output

Performs the % operation.

impl<F: FieldSpec, const D: usize, const R: usize> Scale<F> for ProgramNode<RnsRingPolynomial<F, D, R>>

fn scale(self, x: ProgramNode<Field<F>>) -> Self

Return a structure scaled by x.

impl<T> Sub for ProgramNode<T>

where T: SubVar + ZkpType,

type Output = ProgramNode<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation.

impl<F: FieldSpec> ToBinary<F> for ProgramNode<Field<F>>

fn to_unsigned<const N: usize>(&self) -> [ProgramNode<Field<F>>; N]

Decompose this value into unsigned N-bit binary. If the value is too large, the proof will fail to validate.

impl<F: FieldSpec, const N: usize, const R: usize> ToResidues<F, N, R> for ProgramNode<RnsRingPolynomial<F, N, R>>

fn residues(&self) -> [[ProgramNode<Field<F>>; N]; R]

Return the residues.

impl<T> Copy for ProgramNode<T>

where T: ZkpType + Copy,