Struct Process 

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

Implementations

impl<N: Network> Process<N>

pub fn authorize<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, private_key: &PrivateKey<N>, program_id: impl TryInto<ProgramID<N>>, function_name: impl TryInto<Identifier<N>>, inputs: impl ExactSizeIterator<Item = impl TryInto<Value<N>>>, rng: &mut R, ) -> Result<Authorization<N>, ProcessAuthError>

Authorizes a call to the program function for the given inputs.

pub fn authorize_unchecked<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, private_key: &PrivateKey<N>, program_id: impl TryInto<ProgramID<N>>, function_name: impl TryInto<Identifier<N>>, inputs: impl ExactSizeIterator<Item = impl TryInto<Value<N>>>, rng: &mut R, ) -> Result<Authorization<N>, ProcessAuthError>

Authorizes a call to the program function for the given inputs. Compared to authorize, this method does not check for circuit satisfiability of the request.

pub fn authorize_request<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, request: Request<N>, rng: &mut R, ) -> Result<Authorization<N>, ProcessAuthError>

Authorizes a call to the program function for the given inputs. Compared to authorize, no private key is needed, but this only works for single public requests.

pub fn authorize_fee_private<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, private_key: &PrivateKey<N>, credits: Record<N, Plaintext<N>>, base_fee_in_microcredits: u64, priority_fee_in_microcredits: u64, deployment_or_execution_id: Field<N>, rng: &mut R, ) -> Result<Authorization<N>, ProcessAuthError>

Authorizes the fee given the credits record, the fee amount (in microcredits), and the deployment or execution ID.

pub fn authorize_fee_public<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, private_key: &PrivateKey<N>, base_fee_in_microcredits: u64, priority_fee_in_microcredits: u64, deployment_or_execution_id: Field<N>, rng: &mut R, ) -> Result<Authorization<N>, ProcessAuthError>

Authorizes the fee given the the fee amount (in microcredits) and the deployment or execution ID.

impl<N: Network> Process<N>

pub fn deploy<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, program: &Program<N>, rng: &mut R, ) -> Result<Deployment<N>, ProcessDeployError>

Deploys the given program ID, if it does not exist.

pub fn load_deployment(&self, deployment: &Deployment<N>) -> Result<()>

Adds the newly-deployed program. This method assumes the given deployment is valid.

impl<N: Network> Process<N>

pub fn evaluate<A: Aleo<Network = N>>( &self, authorization: Authorization<N>, ) -> Result<Response<N>, ProcessEvalError>

Evaluates a program function on the given request.

impl<N: Network> Process<N>

pub fn execute<A: Aleo<Network = N>, R: CryptoRng + Rng>( &self, authorization: Authorization<N>, rng: &mut R, ) -> Result<(Response<N>, Trace<N>), ProcessExecError>

Executes the given authorization.

impl<N: Network> Process<N>

pub fn verify_deployment<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, consensus_version: ConsensusVersion, deployment: &Deployment<N>, rng: &mut R, ) -> Result<()>

Verifies the given deployment is ordered.

impl<N: Network> Process<N>

pub fn ensure_records_exist<'a>( transitions: impl ExactSizeIterator<Item = &'a Transition<N>> + DoubleEndedIterator + Clone, call_graph: &HashMap<N::TransitionID, Vec<N::TransitionID>>, execution_stacks: &IndexMap<ProgramID<N>, Arc<Stack<N>>>, ) -> Result<()>

Checks that, for each non-closure function in the execution, each ExternalRecord and DynamicRecord received as an input or from a callee corresponds to a static Record that exists on the ledger at the end of the execution (whether spent or not). A function given this guarantee should itself ensure that all records it outputs or passes to non-closure callees exist on the ledger at the end of the execution.

Input transitions: Iterator over the Transitions in the execution. The root transition must be last.

Input call_graph: A copy of the call graph. It is assumed to contain all transitions in transitions. All children of a given Transition ID must appear in the same order as the corresponding calls happen in the function.

impl<N: Network> Process<N>

pub fn verify_execution( consensus_version: ConsensusVersion, varuna_version: VarunaVersion, inclusion_version: InclusionVersion, execution: &Execution<N>, execution_stacks: &IndexMap<ProgramID<N>, Arc<Stack<N>>>, ) -> Result<()>

Verifies the given execution is valid. Note: This does not check that the global state root exists in the ledger.

impl<N: Network> Process<N>

pub fn construct_call_graph<'a>( transitions: impl ExactSizeIterator<Item = &'a Transition<N>> + DoubleEndedIterator, execution_stacks: &IndexMap<ProgramID<N>, Arc<Stack<N>>>, ) -> Result<HashMap<N::TransitionID, Vec<N::TransitionID>>>

impl<N: Network> Process<N>

pub fn verify_fee( &self, consensus_version: ConsensusVersion, varuna_version: VarunaVersion, inclusion_version: InclusionVersion, fee: &Fee<N>, deployment_or_execution_id: Field<N>, ) -> Result<()>

Verifies the given fee is valid. Note: This does not check that the global state root exists in the ledger.

impl<N: Network> Process<N>

pub fn setup<A: Aleo<Network = N>, R: Rng + CryptoRng>( rng: &mut R, ) -> Result<Self>

Initializes a new process.

pub fn lock(&self) -> ProcessExclusiveGuard<'_, N>

Guard the Process against any concurrent reads or writes.

pub fn mapping_types_exist(&self, program: &Program<N>) -> Result<()>

Ensure that the types referred to in this program’s mappings exist.

impl<N: Network> Process<N>

pub fn load() -> Result<Self>

Initializes a new process.

pub fn load_v0() -> Result<Self>

Initializes a new process with the V0 credits.aleo verifiying keys.

pub const fn universal_srs(&self) -> &UniversalSRS<N>

Returns the universal SRS.

pub fn contains_program(&self, program_id: &ProgramID<N>) -> bool

Returns true if the process contains the program with the given ID.

pub fn program_ids(&self) -> Vec<ProgramID<N>>

Returns the program IDs of all programs in the process.

pub fn get_stack( &self, program_id: impl TryInto<ProgramID<N>>, ) -> Result<Arc<Stack<N>>>

Returns the stack for the given program ID.

pub fn get_latest_edition_for_program(&self, program_id: &ProgramID<N>) -> u16

Returns the latest deployed edition for the given program ID, defaulting to 0 if unknown.

pub fn get_proving_key( &self, program_id: impl TryInto<ProgramID<N>>, function_name: impl TryInto<Identifier<N>>, ) -> Result<ProvingKey<N>>

Returns the proving key for the given program ID and function name.

pub fn get_verifying_key( &self, program_id: impl TryInto<ProgramID<N>>, function_name: impl TryInto<Identifier<N>>, ) -> Result<VerifyingKey<N>>

Returns the verifying key for the given program ID and function name.

pub fn insert_proving_key( &self, program_id: &ProgramID<N>, function_name: &Identifier<N>, proving_key: ProvingKey<N>, ) -> Result<()>

Inserts the given proving key, for the given program ID and function name.

pub fn remove_proving_key( &self, program_id: &ProgramID<N>, function_name: &Identifier<N>, ) -> Result<()>

Removes the given proving key, for the given program ID and function name.

pub fn insert_verifying_key( &self, program_id: &ProgramID<N>, function_name: &Identifier<N>, verifying_key: VerifyingKey<N>, ) -> Result<()>

Inserts the given verifying key, for the given program ID and function name.

pub fn remove_verifying_key( &self, program_id: &ProgramID<N>, function_name: &Identifier<N>, ) -> Result<()>

Removes the given verifying key, for the given program ID and function name.

pub fn synthesize_key<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, program_id: &ProgramID<N>, function_name: &Identifier<N>, rng: &mut R, ) -> Result<()>

Synthesizes the proving and verifying key for the given program ID and function name.

pub fn synthesize_translation_key<A: Aleo<Network = N>, R: Rng + CryptoRng>( &self, program_id: &ProgramID<N>, record_name: &Identifier<N>, rng: &mut R, ) -> Result<()>

Synthesizes the translation key for the given record name.