Struct snarkvm_compiler::Transition

source · [−]

pub struct Transition<N: Network> { /* private fields */ }

Implementations

source

impl<N: Network> Transition<N>

source

pub fn to_root(&self) -> Result<Field<N>>

Returns the transition root, by computing the root for a Merkle tree of the input and output IDs.

source

pub fn to_path(&self, leaf: &TransitionLeaf<N>) -> Result<TransitionPath<N>>

Returns the Merkle path for the transition leaf.

source

pub fn to_leaf(&self, id: &Field<N>, is_input: bool) -> Result<TransitionLeaf<N>>

Returns the Merkle leaf for the given input or output ID in the transition.

source

pub fn to_tree(&self) -> Result<BHPMerkleTree<N, TRANSITION_DEPTH>>

The Merkle tree of input and output IDs for the transition.

source

impl<N: Network> Transition<N>

source

pub fn new(
 program_id: ProgramID<N>,
 function_name: Identifier<N>,
 inputs: Vec<Input<N>>,
 outputs: Vec<Output<N>>,
 finalize: Option<Vec<Value<N>>>,
 proof: Proof<N>,
 tpk: Group<N>,
 tcm: Field<N>,
 fee: i64
) -> Result<Self>

Initializes a new transition.

source

pub fn from(
 request: &Request<N>,
 response: &Response<N>,
 finalize: Option<Vec<Value<N>>>,
 output_types: &[ValueType<N>],
 output_registers: &[Register<N>],
 proof: Proof<N>,
 fee: i64
) -> Result<Self>

Initializes a new transition from a request and response.

source

impl<N: Network> Transition<N>

source

pub const fn id(&self) -> &N::TransitionID

Returns the transition ID.

source

pub const fn program_id(&self) -> &ProgramID<N>

Returns the program ID.

source

pub const fn function_name(&self) -> &Identifier<N>

Returns the function name.

source

pub fn inputs(&self) -> &[Input<N>]

Returns the inputs.

source

pub fn outputs(&self) -> &[Output<N>]

Return the outputs.

source

pub const fn finalize(&self) -> &Option<Vec<Value<N>>>

Return the inputs for finalize, if they exist.

source

pub const fn proof(&self) -> &Proof<N>

Returns the proof.

source

pub const fn tpk(&self) -> &Group<N>

Returns the transition public key.

source

pub const fn tcm(&self) -> &Field<N>

Returns the transition commitment.

source

pub const fn fee(&self) -> &i64

Returns the network fee.

source

impl<N: Network> Transition<N>

source

pub fn input_ids(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns the input IDs.

source

pub fn serial_numbers(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns an iterator over the serial numbers, for inputs that are records.

source

pub fn origins(&self) -> impl '_ + Iterator<Item = &Origin<N>>

Returns an iterator over the origins, for inputs that are records.

source

pub fn tags(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns an iterator over the tags, for inputs that are records.

source

pub fn output_ids(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns the output IDs.

source

pub fn commitments(&self) -> impl '_ + Iterator<Item = &Field<N>>

Returns an iterator over the commitments, for outputs that are records.

source

pub fn nonces(&self) -> impl '_ + Iterator<Item = &Group<N>>

Returns an iterator over the nonces, for outputs that are records.

source

pub fn output_records(
&self
) -> impl '_ + Iterator<Item = (&Field<N>, &Record<N, Ciphertext<N>>)>

Returns an iterator over the output records, as a tuple of (commitment, record).

source

pub fn finalize_iter(&self) -> impl '_ + Iterator<Item = &Value<N>>

Returns an iterator over the inputs for finalize, if they exist.

source

impl<N: Network> Transition<N>

source

pub fn into_id(self) -> N::TransitionID

Returns the transition ID, and consumes self.

source

pub fn into_serial_numbers(self) -> impl Iterator<Item = Field<N>>

Returns a consuming iterator over the serial numbers, for inputs that are records.

source

pub fn into_tags(self) -> impl Iterator<Item = Field<N>>

Returns a consuming iterator over the tags, for inputs that are records.

source

pub fn into_origins(self) -> impl Iterator<Item = Origin<N>>

Returns a consuming iterator over the origins, for inputs that are records.

source

pub fn into_commitments(self) -> impl Iterator<Item = Field<N>>

Returns a consuming iterator over the commitments, for outputs that are records.

source

pub fn into_nonces(self) -> impl Iterator<Item = Group<N>>

Returns a consuming iterator over the nonces, for outputs that are records.

source

pub fn into_output_records(
self
) -> impl Iterator<Item = (Field<N>, Record<N, Ciphertext<N>>)>

Returns a consuming iterator over the output records, as a tuple of (commitment, record).

source

pub fn into_tpk(self) -> Group<N>

Returns the transition public key, and consumes self.

source

pub fn into_finalize(self) -> impl Iterator<Item = Value<N>>

Returns a consuming iterator over the inputs for finalize, if they exist.

Trait Implementations

source

impl<N: Clone + Network> Clone for Transition<N> where
N::TransitionID: Clone,

source

fn clone(&self) -> Transition<N>

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<N: Network> Debug for Transition<N>

source

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

Prints the transition as a JSON-string.

source

impl<'de, N: Network> Deserialize<'de> for Transition<N>

source

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserializes the transition from a string or bytes.

source

impl<N: Network> Display for Transition<N>

source

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

Displays the transition as a JSON-string.

source

impl<N: Network> FromBytes for Transition<N>

source

fn read_le<R: Read>(reader: R) -> IoResult<Self>

Reads the output from a buffer.

source

fn from_bytes_le(bytes: &[u8]) -> Result<Self, Error>

Returns Self from a byte array in little-endian order.

source

impl<N: Network> FromStr for Transition<N>

source

fn from_str(transition: &str) -> Result<Self, Self::Err>

Initializes the transition from a JSON-string.

type Err = Error

The associated error which can be returned from parsing.

source

impl<N: PartialEq + Network> PartialEq<Transition<N>> for Transition<N> where
N::TransitionID: PartialEq,

source

fn eq(&self, other: &Transition<N>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<N: Network> Serialize for Transition<N>

source

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

Serializes the transition into string or bytes.

source

impl<N: Network> ToBytes for Transition<N>

source

fn write_le<W: Write>(&self, writer: W) -> IoResult<()>

Writes the literal to a buffer.

source

fn to_bytes_le(&self) -> Result<Vec<u8, Global>, Error>

Returns self as a byte array in little-endian order.

source

impl<N: Eq + Network> Eq for Transition<N> where
N::TransitionID: Eq,

source

impl<N: Network> StructuralEq for Transition<N>

source

impl<N: Network> StructuralPartialEq for Transition<N>

Auto Trait Implementations

impl<N> RefUnwindSafe for Transition<N> where
 N: RefUnwindSafe,
 <N as Environment>::Field: RefUnwindSafe,
 <<N as Environment>::PairingCurve as PairingEngine>::G1Affine: RefUnwindSafe,
 <N as Environment>::Projective: RefUnwindSafe,
 <N as Environment>::Scalar: RefUnwindSafe,
 <N as Network>::StateRoot: RefUnwindSafe,
 <N as Network>::TransitionID: RefUnwindSafe,

impl<N> Send for Transition<N>

impl<N> Sync for Transition<N>

impl<N> Unpin for Transition<N> where
 N: Unpin,
 <N as Environment>::Field: Unpin,
 <<N as Environment>::PairingCurve as PairingEngine>::G1Affine: Unpin,
 <N as Environment>::Projective: Unpin,
 <N as Environment>::Scalar: Unpin,
 <N as Network>::StateRoot: Unpin,
 <N as Network>::TransitionID: Unpin,

impl<N> UnwindSafe for Transition<N> where
 N: UnwindSafe,
 <N as Environment>::Field: UnwindSafe,
 <<N as Environment>::PairingCurve as PairingEngine>::G1Affine: UnwindSafe,
 <N as Environment>::Projective: UnwindSafe,
 <N as Environment>::Scalar: UnwindSafe,
 <N as Network>::StateRoot: UnwindSafe,
 <N as Network>::TransitionID: UnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T> Instrument for T

source

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more

source

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.

type Init = T

The type for initializers.

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

source

impl<T> Same<T> for T

type Output = T

Should always be Self

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T> ToString for T where
T: Display + ?Sized,

source

default fn to_string(&self) -> String

Converts the given value to a String. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

fn vzip(self) -> V

source

impl<T> WithSubscriber for T

source

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more

source

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

source

Struct snarkvm_compiler::Transition

Implementations

impl<N: Network> Transition<N>

pub fn to_root(&self) -> Result<Field<N>>

pub fn to_path(&self, leaf: &TransitionLeaf<N>) -> Result<TransitionPath<N>>

pub fn to_leaf(&self, id: &Field<N>, is_input: bool) -> Result<TransitionLeaf<N>>

pub fn to_tree(&self) -> Result<BHPMerkleTree<N, TRANSITION_DEPTH>>

impl<N: Network> Transition<N>

pub fn new( program_id: ProgramID<N>, function_name: Identifier<N>, inputs: Vec<Input<N>>, outputs: Vec<Output<N>>, finalize: Option<Vec<Value<N>>>, proof: Proof<N>, tpk: Group<N>, tcm: Field<N>, fee: i64) -> Result<Self>

pub fn from( request: &Request<N>, response: &Response<N>, finalize: Option<Vec<Value<N>>>, output_types: &[ValueType<N>], output_registers: &[Register<N>], proof: Proof<N>, fee: i64) -> Result<Self>

impl<N: Network> Transition<N>

pub const fn id(&self) -> &N::TransitionID

pub const fn program_id(&self) -> &ProgramID<N>

pub const fn function_name(&self) -> &Identifier<N>

pub fn inputs(&self) -> &[Input<N>]

pub fn outputs(&self) -> &[Output<N>]

pub const fn finalize(&self) -> &Option<Vec<Value<N>>>

pub const fn proof(&self) -> &Proof<N>

pub const fn tpk(&self) -> &Group<N>

pub const fn tcm(&self) -> &Field<N>

pub const fn fee(&self) -> &i64

impl<N: Network> Transition<N>

pub fn input_ids(&self) -> impl '_ + Iterator<Item = &Field<N>>

pub fn serial_numbers(&self) -> impl '_ + Iterator<Item = &Field<N>>

pub fn origins(&self) -> impl '_ + Iterator<Item = &Origin<N>>

pub fn tags(&self) -> impl '_ + Iterator<Item = &Field<N>>

pub fn output_ids(&self) -> impl '_ + Iterator<Item = &Field<N>>

pub fn commitments(&self) -> impl '_ + Iterator<Item = &Field<N>>

pub fn nonces(&self) -> impl '_ + Iterator<Item = &Group<N>>

pub fn output_records( &self) -> impl '_ + Iterator<Item = (&Field<N>, &Record<N, Ciphertext<N>>)>

pub fn finalize_iter(&self) -> impl '_ + Iterator<Item = &Value<N>>

impl<N: Network> Transition<N>

pub fn into_id(self) -> N::TransitionID

pub fn into_serial_numbers(self) -> impl Iterator<Item = Field<N>>

pub fn into_tags(self) -> impl Iterator<Item = Field<N>>

pub fn into_origins(self) -> impl Iterator<Item = Origin<N>>

pub fn into_commitments(self) -> impl Iterator<Item = Field<N>>

pub fn into_nonces(self) -> impl Iterator<Item = Group<N>>

pub fn into_output_records( self) -> impl Iterator<Item = (Field<N>, Record<N, Ciphertext<N>>)>

pub fn into_tpk(self) -> Group<N>

pub fn into_finalize(self) -> impl Iterator<Item = Value<N>>

Trait Implementations

impl<N: Clone + Network> Clone for Transition<N> where N::TransitionID: Clone,

fn clone(&self) -> Transition<N>

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

impl<N: Network> Debug for Transition<N>

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

impl<'de, N: Network> Deserialize<'de> for Transition<N>

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

impl<N: Network> Display for Transition<N>

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

impl<N: Network> FromBytes for Transition<N>

fn read_le<R: Read>(reader: R) -> IoResult<Self>

fn from_bytes_le(bytes: &[u8]) -> Result<Self, Error>

impl<N: Network> FromStr for Transition<N>

fn from_str(transition: &str) -> Result<Self, Self::Err>

type Err = Error

impl<N: PartialEq + Network> PartialEq<Transition<N>> for Transition<N> where N::TransitionID: PartialEq,

fn eq(&self, other: &Transition<N>) -> bool

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

impl<N: Network> Serialize for Transition<N>

fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error>

impl<N: Network> ToBytes for Transition<N>

fn write_le<W: Write>(&self, writer: W) -> IoResult<()>

fn to_bytes_le(&self) -> Result<Vec<u8, Global>, Error>

impl<N: Eq + Network> Eq for Transition<N> where N::TransitionID: Eq,

impl<N: Network> StructuralEq for Transition<N>

impl<N: Network> StructuralPartialEq for Transition<N>

Auto Trait Implementations

impl<N> Send for Transition<N>

impl<N> Sync for Transition<N>

impl<N> Unpin for Transition<N> where N: Unpin, <N as Environment>::Field: Unpin, <<N as Environment>::PairingCurve as PairingEngine>::G1Affine: Unpin, <N as Environment>::Projective: Unpin, <N as Environment>::Scalar: Unpin, <N as Network>::StateRoot: Unpin, <N as Network>::TransitionID: Unpin,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<Q, K> Equivalent<K> for Q where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

pub fn new(
program_id: ProgramID<N>,
function_name: Identifier<N>,
inputs: Vec<Input<N>>,
outputs: Vec<Output<N>>,
finalize: Option<Vec<Value<N>>>,
proof: Proof<N>,
tpk: Group<N>,
tcm: Field<N>,
fee: i64
) -> Result<Self>

pub fn from(
request: &Request<N>,
response: &Response<N>,
finalize: Option<Vec<Value<N>>>,
output_types: &[ValueType<N>],
output_registers: &[Register<N>],
proof: Proof<N>,
fee: i64
) -> Result<Self>

pub fn output_records(
&self
) -> impl '_ + Iterator<Item = (&Field<N>, &Record<N, Ciphertext<N>>)>

pub fn into_output_records(
self
) -> impl Iterator<Item = (Field<N>, Record<N, Ciphertext<N>>)>

impl<N: Clone + Network> Clone for Transition<N> where
N::TransitionID: Clone,

impl<N: PartialEq + Network> PartialEq<Transition<N>> for Transition<N> where
N::TransitionID: PartialEq,

impl<N: Eq + Network> Eq for Transition<N> where
N::TransitionID: Eq,

impl<N> Unpin for Transition<N> where
N: Unpin,
<N as Environment>::Field: Unpin,
<<N as Environment>::PairingCurve as PairingEngine>::G1Affine: Unpin,
<N as Environment>::Projective: Unpin,
<N as Environment>::Scalar: Unpin,
<N as Network>::StateRoot: Unpin,
<N as Network>::TransitionID: Unpin,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T> ToString for T where
T: Display + ?Sized,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,

impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,