Expand description
lcpc2d is a polynomial commitment scheme based on linear codes
Macros§
- def_
labels - Define domain separation labels for an LcEncoding trait implementation
Structs§
- LcColumn
- A column opening and the corresponding Merkle path.
- LcCommit
- a commitment
- LcEval
Proof - An evaluation and proof of its correctness and of the low-degreeness of the commitment.
- LcRoot
- A Merkle root corresponding to a committed polynomial
- Wrapped
LcEval Proof - An evaluation and proof of its correctness and of the low-degreeness of the commitment.
Enums§
- Prover
Error - Err variant for prover operations
- Verifier
Error - Err variant for verifier operations
Traits§
- Field
Hash - Trait for a field element that can be hashed via digest::Digest
- LcEncoding
- Trait for a linear encoding used by the polycommit
- Sized
Field - Trait representing bit size information for a field
Functions§
- n_
degree_ tests - Compute number of degree tests required for
lambda
-bit security for a code withlen
-length codewords overflog2
-bit field
Type Aliases§
- Prover
Result - result of a prover operation
- Verifier
Result - result of a verifier operation