Expand description
Data structures used by a polynomial commitment scheme.
Structs§
- BatchLC
Proof - A proof of satisfaction of linear combinations.
- Labeled
Commitment - A commitment along with information about its degree bound (if any).
- Labeled
Polynomial - 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.
- Linear
Combination - 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.
- PCCommitment
State - Defines the minimal interface of commitment state for any polynomial commitment scheme. It might be randomness etc.
- PCCommitter
Key - Defines the minimal interface of committer keys for any polynomial commitment scheme.
- PCPrepared
Commitment - Defines the minimal interface of prepared commitments for any polynomial commitment scheme.
- PCPrepared
Verifier Key - Defines the minimal interface of prepared verifier keys for any polynomial commitment scheme.
- PCUniversal
Params - Defines the minimal interface for public params for any polynomial commitment scheme.
- PCVerifier
Key - Defines the minimal interface of verifier keys for any polynomial commitment scheme.
Type Aliases§
- Polynomial
Label - Labels a
LabeledPolynomialor aLabeledCommitment.