Struct storage_proofs_porep::stacked::StackedGraph

pub struct StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + 'static,  { /* fields omitted */ }

Implementations

impl<H, G> StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + ParameterSetMetadata + Sync + Send, 

pub fn new(
    base_graph: Option<G>,
    nodes: usize,
    base_degree: usize,
    expansion_degree: usize,
    porep_id: PoRepID,
    api_version: ApiVersion
) -> Result<Self>

pub fn parent_cache(&self) -> Result<ParentCache>

Returns a reference to the parent cache.

pub fn copy_parents_data_exp(
    &self,
    node: u32,
    base_data: &[u8],
    exp_data: &[u8],
    hasher: Sha256,
    cache: Option<&mut ParentCache>
) -> Result<[u8; 32]>

pub fn copy_parents_data(
    &self,
    node: u32,
    base_data: &[u8],
    hasher: Sha256,
    cache: Option<&mut ParentCache>
) -> Result<[u8; 32]>

impl<'a, H, G> StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + ParameterSetMetadata + Sync + Send, 

pub fn generate_expanded_parents(
    &self,
    node: usize,
    expanded_parents: &mut [u32]
)

pub fn new_stacked(
    nodes: usize,
    base_degree: usize,
    expansion_degree: usize,
    porep_id: PoRepID,
    api_version: ApiVersion
) -> Result<Self>

pub fn base_graph(&self) -> &G

pub fn expansion_degree(&self) -> usize

pub fn base_parents(&self, node: usize, parents: &mut [u32]) -> Result<()>

pub fn expanded_parents(&self, node: usize, parents: &mut [u32]) -> Result<()>

Assign self.expansion_degree parents to node using an invertible permutation that is applied one way for the forward layers and one way for the reversed ones.

Trait Implementations

impl<H: Clone, G: Clone> Clone for StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + 'static, 

fn clone(&self) -> StackedGraph<H, G>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H, G> Debug for StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + 'static, 

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

Formats the value using the given formatter.

impl<H, G> Graph<H> for StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + ParameterSetMetadata + Sync + Send, 

type Key = Vec<u8>

fn size(&self) -> usize

Returns the size of the graph (number of nodes).

fn degree(&self) -> usize

Returns the number of parents of each node in the graph.

fn parents(&self, node: usize, parents: &mut [u32]) -> Result<()>

Returns a sorted list of all parents of this node. The parents may be repeated.

fn seed(&self) -> [u8; 28]

fn new(
    nodes: usize,
    base_degree: usize,
    expansion_degree: usize,
    porep_id: PoRepID,
    api_version: ApiVersion
) -> Result<Self>

fn create_key(
    &self,
    _id: &H::Domain,
    _node: usize,
    _parents: &[u32],
    _base_parents_data: &[u8],
    _exp_parents_data: Option<&[u8]>
) -> Result<Self::Key>

Creates the encoding key. The algorithm for that is Sha256(id | encodedParentNode1 | encodedParentNode1 | ...).

fn expected_size(&self) -> usize

Returns the expected size of all nodes in the graph.

fn merkle_tree_depth<U>(&self) -> u64 where
    U: 'static + PoseidonArity, 

Returns the merkle tree depth.

impl<H, G> ParameterSetMetadata for StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H> + ParameterSetMetadata, 

fn identifier(&self) -> String

fn sector_size(&self) -> u64

impl<H, G> PartialEq<StackedGraph<H, G>> for StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H>, 

fn eq(&self, other: &StackedGraph<H, G>) -> bool

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

#[must_use]

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

This method tests for !=.

impl<H, G> Eq for StackedGraph<H, G> where
    H: Hasher,
    G: Graph<H>,