Versions in this module Expand all Collapse all v0 v0.6.0 Oct 9, 2023 Changes in this version + var ErrInvalidNumDigests = errors.New("number of digests is not the same as the number of polynomials") + var ErrInvalidPolynomialSize = errors.New("invalid polynomial size (larger than SRS or == 0)") + var ErrMinSRSSize = errors.New("minimum srs size is 2") + var ErrPolynomialMismatchedSizeDomain = errors.New("domain size does not equal the number of evaluations in the polynomial") + var ErrVerifyOpeningProof = errors.New("can't verify opening proof") + func BatchVerifyMultiPoints(commitments []Commitment, proofs []OpeningProof, openKey *OpeningKey) error + func Verify(commitment *Commitment, proof *OpeningProof, openKey *OpeningKey) error + type CommitKey struct + G1 []bls12381.G1Affine + func (c *CommitKey) ReversePoints() + type Commitment = bls12381.G1Affine + func Commit(p Polynomial, ck *CommitKey, numGoRoutines int) (*Commitment, error) + type Domain struct + Cardinality uint64 + CardinalityInv fr.Element + Generator fr.Element + GeneratorInv fr.Element + PreComputedInverses []fr.Element + Roots []fr.Element + func NewDomain(x uint64) *Domain + func (domain *Domain) EvaluateLagrangePolynomial(poly Polynomial, evalPoint fr.Element) (*fr.Element, error) + func (domain *Domain) FftG1(values []bls12381.G1Affine) []bls12381.G1Affine + func (domain *Domain) IfftG1(values []bls12381.G1Affine) []bls12381.G1Affine + func (domain *Domain) ReverseRoots() + type OpeningKey struct + AlphaG2 bls12381.G2Affine + GenG1 bls12381.G1Affine + GenG2 bls12381.G2Affine + type OpeningProof struct + ClaimedValue fr.Element + InputPoint fr.Element + QuotientCommitment bls12381.G1Affine + func Open(domain *Domain, p Polynomial, evaluationPoint fr.Element, ck *CommitKey, ...) (OpeningProof, error) + type Polynomial = []fr.Element + type SRS struct + CommitKey CommitKey + OpeningKey OpeningKey