Module filecoin_proofs::constants
source · Structs§
Constants§
- The base degree used for all DRG graphs. One degree from this value is used to ensure that a given node always has its immediate predecessor as a parent, thus ensuring unique topological ordering of the graph nodes.
- The expansion degree used for Stacked Graphs.
- Constant NI-PoRep aggregation bounds specified in FIP-0090, but superseded by FIP-0092
- The minimum size a single piece must have before padding.
- Sector sizes for which parameters have been published.
- The size of a single snark proof.
- Sector sizes for which parameters are supported.
Functions§
- Returns the number of partitions for non-interactive PoRep for a certain sector size.
Type Aliases§
- A binary merkle tree with Poseidon hashing, where all levels have arity 2. It’s fully persisted to disk.
- A merkle tree with Poseidon hashing, where all levels have arity 8. Some levels are not persisted to disk, but only cached in memory.
- A merkle tree with Poseidon hashing, where all levels have arity 8. It’s fully persisted to disk.
- The hasher used for creating comm_d.
- The default hasher for merkle trees currently in use.