bls

func AddG1 ¶

func AddG1(dst *G1Point, a *G1Point, b *G1Point)

func AddG2 ¶

func AddG2(dst *G2Point, a *G2Point, b *G2Point)

func AddModFr ¶

func AddModFr(dst *Fr, a, b *Fr)

func AsFr ¶

func AsFr(dst *Fr, i uint64)

func BatchInvModFr ¶

func BatchInvModFr(f []Fr)

func ClearG1 ¶

func ClearG1(x *G1Point)

zeroes the point (like herumi BLS does with theirs). This is not co-factor clearing.

func ClearG2 ¶

func ClearG2(x *G2Point)

zeroes the point (like herumi BLS does with theirs). This is not co-factor clearing.

func CopyFr ¶

func CopyFr(dst *Fr, v *Fr)

func CopyG1 ¶

func CopyG1(dst *G1Point, v *G1Point)

func CopyG2 ¶

func CopyG2(dst *G2Point, v *G2Point)

func DebugG1s ¶

func DebugG1s(msg string, values []G1Point)

func DivModFr ¶

func DivModFr(dst *Fr, a, b *Fr)

func EqualFr ¶

func EqualFr(a *Fr, b *Fr) bool

func EqualG1 ¶

func EqualG1(a *G1Point, b *G1Point) bool

func EqualG2 ¶

func EqualG2(a *G2Point, b *G2Point) bool

func EqualOne ¶

func EqualOne(v *Fr) bool

func EqualZero ¶

func EqualZero(v *Fr) bool

func EvalPolyAt ¶

func EvalPolyAt(dst *Fr, p []Fr, x *Fr)

func EvalPolyAtUnoptimized ¶

func EvalPolyAtUnoptimized(dst *Fr, coeffs []Fr, x *Fr)

func EvaluatePolyInEvaluationForm ¶

func EvaluatePolyInEvaluationForm(yFr *Fr, poly []Fr, x *Fr, rootsOfUnity []Fr, scale uint8)

Evaluate a polynomial (in evaluation form) at an arbitrary point x using the barycentric formula:

f(x) = (x**WIDTH - 1) / WIDTH  *  sum_(i=0)^WIDTH  (f(DOMAIN[i]) * DOMAIN[i]) / (x - DOMAIN[i])

See https://dankradfeist.de/ethereum/2021/06/18/pcs-multiproofs.html "Evaluating a polynomial in evaluation form on a point outside the domain".

Scale is used to indicate the power of 2 to use to stride through the domain values. Note: scale == 0 when the roots of unity length matches the polynomial.

func ExpModFr ¶

func ExpModFr(dst *Fr, v *Fr, e *big.Int)

func FrFrom32 ¶

func FrFrom32(dst *Fr, v [32]byte) (ok bool)

FrFrom32 mutates the fr num. The value v is little-endian 32-bytes. Returns false, without modifying dst, if the value is out of range.

func FrStr ¶

func FrStr(b *Fr) string

func FrTo32 ¶

func FrTo32(src *Fr) (v [32]byte)

FrTo32 serializes a fr number to 32 bytes. Encoded little-endian.

func InvModFr ¶

func InvModFr(dst *Fr, v *Fr)

func IsPowerOfTwo ¶

func IsPowerOfTwo(v uint64) bool

func MulG1 ¶

func MulG1(dst *G1Point, a *G1Point, b *Fr)

func MulG2 ¶

func MulG2(dst *G2Point, a *G2Point, b *Fr)

func MulModFr ¶

func MulModFr(dst *Fr, a, b *Fr)

func NegG1 ¶

func NegG1(dst *G1Point)

func NegG2 ¶

func NegG2(dst *G2Point)

func PairingsVerify ¶

func PairingsVerify(a1 *G1Point, a2 *G2Point, b1 *G1Point, b2 *G2Point) bool

e(a1^(-1), a2) * e(b1, b2) = 1_T

func SetFr ¶

func SetFr(dst *Fr, v string)

func StrG1 ¶

func StrG1(v *G1Point) string

func StrG2 ¶

func StrG2(v *G2Point) string

func SubG1 ¶

func SubG1(dst *G1Point, a *G1Point, b *G1Point)

func SubG2 ¶

func SubG2(dst *G2Point, a *G2Point, b *G2Point)

func SubModFr ¶

func SubModFr(dst *Fr, a, b *Fr)

func ToCompressedG1 ¶

func ToCompressedG1(p *G1Point) []byte

func ToCompressedG2 ¶

func ToCompressedG2(p *G2Point) []byte

func ValidFr ¶

func ValidFr(val [32]byte) bool

Checks if a *little endian* uint256 is within the Fr modulus