Struct RecursiveCoreIntent 

pub struct RecursiveCoreIntent {
    pub k_at_depth: Vec<u32>,
    pub max_extra_data_bytes: usize,
    pub params: CoreNodeParams,
}

Recursive intent for a node in the aggregation tree that can construct proving keys for this node and all its children.

Fields

k_at_depth: Vec<u32>

k_at_depth[i] is the log2 domain size at depth i. So it starts from the current node and goes down the layers of the tree. Our aggregation structure is such that each layer of the tree only has a single circuit type so only one k is needed.

max_extra_data_bytes: usize

Different chains (e.g., Goerli) can have different maximum number of bytes in the extra data field of the block header. We configure the circuits differently based on this.

params: CoreNodeParams

Implementations

impl RecursiveCoreIntent

pub fn new( k_at_depth: Vec<u32>, max_extra_data_bytes: usize, params: CoreNodeParams, ) -> Self

pub fn child(&self) -> Option<Self>

Each layer of tree has a unique circuit type, so this is the child circuit type.

impl RecursiveCoreIntent

pub fn create_and_serialize_proving_key( self, srs_dir: &Path, data_dir: &Path, cid_repo: &mut BTreeMap<CoreNodeParams, String>, ) -> Result<(AggTreeId, ProvingKey<G1Affine>, Value)>

Recursively creates and serializes proving keys and pinnings.

Computes circuit_id as the blake3 hash of the halo2 VerifyingKey written to bytes. Writes proving key to circuit_id.pk, verifying key to circuit_id.vk and pinning to circuit_id.json in the data_dir directory.

Returns the circuit_id, proving_key, pinning.

• cid_repo stores a mapping from the CoreNodeParams to the corresponding circuit ID. In an Axiom Core aggregation tree, the CoreNodeParams determines the node.
• PARAMS_DIR must be set because the aggregation circuit creation requires reading trusted setup files (this can be removed later).

Trait Implementations

impl Clone for RecursiveCoreIntent

fn clone(&self) -> RecursiveCoreIntent

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RecursiveCoreIntent

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RecursiveCoreIntent

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for RecursiveCoreIntent

impl Hash for RecursiveCoreIntent

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for RecursiveCoreIntent

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for RecursiveCoreIntent