Module ark_poly_commit::data_structures [−][src]
Expand description
Data structures used by a polynomial commitment scheme.
Structs
| BatchLCProof | A proof of satisfaction of linear combinations. |
| LabeledCommitment | A commitment along with information about its degree bound (if any). |
| LabeledPolynomial | A polynomial along with information about its degree bound (if any), and the maximum number of queries that will be made to it. This latter number determines the amount of protection that will be provided to a commitment for this polynomial. |
| LinearCombination | A labeled linear combinations of polynomials. |
Enums
| LCTerm | A term in a linear combination. |
Traits
| PCCommitment | Defines the minimal interface of commitments for any polynomial commitment scheme. |
| PCCommitterKey | Defines the minimal interface of committer keys for any polynomial commitment scheme. |
| PCPreparedCommitment | Defines the minimal interface of prepared commitments for any polynomial commitment scheme. |
| PCPreparedVerifierKey | Defines the minimal interface of prepared verifier keys for any polynomial commitment scheme. |
| PCProof | Defines the minimal interface of evaluation proofs for any polynomial commitment scheme. |
| PCRandomness | Defines the minimal interface of commitment randomness for any polynomial commitment scheme. |
| PCUniversalParams | Defines the minimal interface for public params for any polynomial commitment scheme. |
| PCVerifierKey | Defines the minimal interface of verifier keys for any polynomial commitment scheme. |
Type Definitions
| PolynomialLabel | Labels a |