func (g *G1) MapToCurve(in []byte) (*PointG1, error) {
	u, err := fromBytes(in)
	if err != nil {
		return nil, err
	}
	x, y := swuMapG1(u)
	isogenyMapG1(x, y)
	one := new(fe).one()
	p := &PointG1{*x, *y, *one}
	g.ClearCofactor(p)
	return g.Affine(p), nil
}
MapToCurve given a byte slice returns a valid G1 point.
This mapping function implements the Simplified Shallue-van de Woestijne-Ulas method.
https://tools.ietf.org/html/draft-irtf-cfrg-hash-to-curve-06
Input byte slice should be a valid field element, otherwise an error is returned.
package bls12381
import (
	"errors"
	"math"
	"math/big"
)
type PointG1 [3]fe
var wnafMulWindowG1 uint = 5
func (p *PointG1) Set(p2 *PointG1) *PointG1 {
	p[0].set(&p2[0])
	p[1].set(&p2[1])
	p[2].set(&p2[2])
	return p
}
func (p *PointG1) Zero() *PointG1 {
	p[0].zero()
	p[1].one()
	p[2].zero()
	return p
}
func (p *PointG1) IsAffine() bool {
	return p[2].isOne()
}
type tempG1 struct {
	t [9]*fe
}
type G1 struct {
	tempG1
}
func NewG1() *G1 {
	t := newTempG1()
	return &G1{t}
}
func newTempG1() tempG1 {
	t := [9]*fe{}
	for i := 0; i < 9; i++ {
		t[i] = &fe{}
	}
	return tempG1{t}
}
func (g *G1) Q() *big.Int {
	return new(big.Int).Set(qBig)
}
func (g *G1) FromUncompressed(uncompressed []byte) (*PointG1, error) {
	if len(uncompressed) != 2*fpByteSize {
		return nil, errors.New("input string length must be equal to 96 bytes")
	}
	var in [2 * fpByteSize]byte
	copy(in[:], uncompressed[:2*fpByteSize])
	if in[0]&(1<<7) != 0 {
		return nil, errors.New("compression flag must be zero")
	}
	if in[0]&(1<<5) != 0 {
		return nil, errors.New("sort flag must be zero")
	}
	if in[0]&(1<<6) != 0 {
		for i, v := range in {
			if (i == 0 && v != 0x40) || (i != 0 && v != 0x00) {
				return nil, errors.New("input string must be zero when infinity flag is set")
			}
		}
		return g.Zero(), nil
	}
	in[0] &= 0x1f
	x, err := fromBytes(in[:fpByteSize])
	if err != nil {
		return nil, err
	}
	y, err := fromBytes(in[fpByteSize:])
	if err != nil {
		return nil, err
	}
	z := new(fe).one()
	p := &PointG1{*x, *y, *z}
	if !g.IsOnCurve(p) {
		return nil, errors.New("point is not on curve")
	}
	if !g.InCorrectSubgroup(p) {
		return nil, errors.New("point is not on correct subgroup")
	}
	return p, nil
}
func (g *G1) ToUncompressed(p *PointG1) []byte {
	out := make([]byte, 2*fpByteSize)
	if g.IsZero(p) {
		out[0] |= 1 << 6
		return out
	}
	g.Affine(p)
	copy(out[:fpByteSize], toBytes(&p[0]))
	copy(out[fpByteSize:], toBytes(&p[1]))
	return out
}
func (g *G1) FromCompressed(compressed []byte) (*PointG1, error) {
	if len(compressed) != fpByteSize {
		return nil, errors.New("input string length must be equal to 48 bytes")
	}
	var in [fpByteSize]byte
	copy(in[:], compressed[:])
	if in[0]&(1<<7) == 0 {
		return nil, errors.New("compression flag must be set")
	}
	if in[0]&(1<<6) != 0 {
		for i, v := range in {
			if (i == 0 && v != 0xc0) || (i != 0 && v != 0x00) {
				return nil, errors.New("input string must be zero when infinity flag is set")
			}
		}
		return g.Zero(), nil
	}
	a := in[0]&(1<<5) != 0
	in[0] &= 0x1f
	x, err := fromBytes(in[:])
	if err != nil {
		return nil, err
	}
	y := &fe{}
	square(y, x)
	mul(y, y, x)
	add(y, y, b)
	if ok := sqrt(y, y); !ok {
		return nil, errors.New("point is not on curve")
	}
	if y.signBE() == a {
		neg(y, y)
	}
	z := new(fe).one()
	p := &PointG1{*x, *y, *z}
	if !g.InCorrectSubgroup(p) {
		return nil, errors.New("point is not on correct subgroup")
	}
	return p, nil
}
func (g *G1) ToCompressed(p *PointG1) []byte {
	out := make([]byte, fpByteSize)
	g.Affine(p)
	if g.IsZero(p) {
		out[0] |= 1 << 6
	} else {
		copy(out[:], toBytes(&p[0]))
		if !p[1].signBE() {
			out[0] |= 1 << 5
		}
	}
	out[0] |= 1 << 7
	return out
}
func (g *G1) fromBytesUnchecked(in []byte) (*PointG1, error) {
	p0, err := fromBytes(in[:fpByteSize])
	if err != nil {
		return nil, err
	}
	p1, err := fromBytes(in[fpByteSize:])
	if err != nil {
		return nil, err
	}
	p2 := new(fe).one()
	return &PointG1{*p0, *p1, *p2}, nil
}
func (g *G1) FromBytes(in []byte) (*PointG1, error) {
	if len(in) != 2*fpByteSize {
		return nil, errors.New("input string length must be equal to 96 bytes")
	}
	p0, err := fromBytes(in[:fpByteSize])
	if err != nil {
		return nil, err
	}
	p1, err := fromBytes(in[fpByteSize:])
	if err != nil {
		return nil, err
	}
	if p0.isZero() && p1.isZero() {
		return g.Zero(), nil
	}
	p2 := new(fe).one()
	p := &PointG1{*p0, *p1, *p2}
	if !g.IsOnCurve(p) {
		return nil, errors.New("point is not on curve")
	}
	return p, nil
}
func (g *G1) ToBytes(p *PointG1) []byte {
	out := make([]byte, 2*fpByteSize)
	if g.IsZero(p) {
		return out
	}
	g.Affine(p)
	copy(out[:fpByteSize], toBytes(&p[0]))
	copy(out[fpByteSize:], toBytes(&p[1]))
	return out
}
func (g *G1) New() *PointG1 {
	return g.Zero()
}
func (g *G1) Zero() *PointG1 {
	return new(PointG1).Zero()
}
func (g *G1) One() *PointG1 {
	p := &PointG1{}
	return p.Set(&g1One)
}
func (g *G1) IsZero(p *PointG1) bool {
	return p[2].isZero()
}
func (g *G1) Equal(p1, p2 *PointG1) bool {
	if g.IsZero(p1) {
		return g.IsZero(p2)
	}
	if g.IsZero(p2) {
		return g.IsZero(p1)
	}
	t := g.t
	square(t[0], &p1[2])
	square(t[1], &p2[2])
	mul(t[2], t[0], &p2[0])
	mul(t[3], t[1], &p1[0])
	mul(t[0], t[0], &p1[2])
	mul(t[1], t[1], &p2[2])
	mul(t[1], t[1], &p1[1])
	mul(t[0], t[0], &p2[1])
	return t[0].equal(t[1]) && t[2].equal(t[3])
}
func (g *G1) InCorrectSubgroup(p *PointG1) bool {
	mulZ := func(p *PointG1) {
		z := &Fr{0x0000000055555555, 0x396c8c005555e156}
		e := z.toWNAF(wnafMulWindowG1)
		g.wnafMul(p, p, e)
	}
	t0 := g.New().Set(p)
	g.glvEndomorphism(t0, t0)
	t1 := g.New().Set(t0)      
	g.glvEndomorphism(t0, t0)  
	g.Double(t1, t1)           
	g.Sub(t1, t1, p)           
	g.Sub(t1, t1, t0)          
	mulZ(t1)                   
	g.Sub(t1, t1, t0)          
	return g.IsZero(t1)
}
func (g *G1) IsOnCurve(p *PointG1) bool {
	if g.IsZero(p) {
		return true
	}
	t := g.t
	square(t[0], &p[1])     
	square(t[1], &p[0])     
	mul(t[1], t[1], &p[0])  
	if p.IsAffine() {
		addAssign(t[1], b)       
		return t[0].equal(t[1])  
	}
	square(t[2], &p[2])      
	square(t[3], t[2])       
	mul(t[2], t[2], t[3])    
	mul(t[2], b, t[2])       
	add(t[1], t[1], t[2])    
	return t[0].equal(t[1])  
}
func (g *G1) IsAffine(p *PointG1) bool {
	return p[2].isOne()
}
func (g *G1) Affine(p *PointG1) *PointG1 {
	return g.affine(p, p)
}
func (g *G1) affine(r, p *PointG1) *PointG1 {
	if g.IsZero(p) {
		return r.Zero()
	}
	if !g.IsAffine(p) {
		t := g.t
		inverse(t[0], &p[2])     
		square(t[1], t[0])       
		mul(&r[0], &p[0], t[1])  
		mul(t[0], t[0], t[1])    
		mul(&r[1], &p[1], t[0])  
		r[2].one()               
	} else {
		r.Set(p)
	}
	return r
}
func (g *G1) AffineBatch(p []*PointG1) {
	inverses := make([]fe, len(p))
	for i := 0; i < len(p); i++ {
		inverses[i].set(&p[i][2])
	}
	inverseBatch(inverses)
	t := g.t
	for i := 0; i < len(p); i++ {
		if !g.IsAffine(p[i]) && !g.IsZero(p[i]) {
			square(t[1], &inverses[i])
			mul(&p[i][0], &p[i][0], t[1])
			mul(t[0], &inverses[i], t[1])
			mul(&p[i][1], &p[i][1], t[0])
			p[i][2].one()
		}
	}
}
func (g *G1) Add(r, p1, p2 *PointG1) *PointG1 {
	if g.IsZero(p1) {
		return r.Set(p2)
	}
	if g.IsZero(p2) {
		return r.Set(p1)
	}
	if g.IsAffine(p2) {
		return g.AddMixed(r, p1, p2)
	}
	t := g.t
	square(t[7], &p1[2])     
	mul(t[1], &p2[0], t[7])  
	mul(t[2], &p1[2], t[7])  
	mul(t[0], &p2[1], t[2])  
	square(t[8], &p2[2])     
	mul(t[3], &p1[0], t[8])  
	mul(t[4], &p2[2], t[8])  
	mul(t[2], &p1[1], t[4])  
	if t[1].equal(t[3]) {
		if t[0].equal(t[2]) {
			return g.Double(r, p1)
		} else {
			return r.Zero()
		}
	}
	subAssign(t[1], t[3])      
	double(t[4], t[1])         
	square(t[4], t[4])         
	mul(t[5], t[1], t[4])      
	subAssign(t[0], t[2])      
	doubleAssign(t[0])         
	square(t[6], t[0])         
	subAssign(t[6], t[5])      
	mul(t[3], t[3], t[4])      
	double(t[4], t[3])         
	sub(&r[0], t[6], t[4])     
	sub(t[4], t[3], &r[0])     
	mul(t[6], t[2], t[5])      
	doubleAssign(t[6])         
	mul(t[0], t[0], t[4])      
	sub(&r[1], t[0], t[6])     
	add(t[0], &p1[2], &p2[2])  
	square(t[0], t[0])         
	subAssign(t[0], t[7])      
	subAssign(t[0], t[8])      
	mul(&r[2], t[0], t[1])     
	return r
}
func (g *G1) AddMixed(r, p1, p2 *PointG1) *PointG1 {
	if g.IsZero(p1) {
		return r.Set(p2)
	}
	if g.IsZero(p2) {
		return r.Set(p1)
	}
	t := g.t
	square(t[7], &p1[2])     
	mul(t[1], &p2[0], t[7])  
	mul(t[2], &p1[2], t[7])  
	mul(t[0], &p2[1], t[2])  
	if p1[0].equal(t[1]) && p1[1].equal(t[0]) {
		return g.Double(r, p1)
	}
	sub(t[1], t[1], &p1[0])  
	square(t[2], t[1])       
	double(t[4], t[2])
	doubleAssign(t[4])       
	mul(t[5], t[1], t[4])    
	subAssign(t[0], &p1[1])  
	doubleAssign(t[0])       
	square(t[6], t[0])       
	subAssign(t[6], t[5])    
	mul(t[3], &p1[0], t[4])  
	double(t[4], t[3])       
	sub(&r[0], t[6], t[4])   
	sub(t[4], t[3], &r[0])   
	mul(t[6], &p1[1], t[5])  
	doubleAssign(t[6])       
	mul(t[0], t[0], t[4])    
	sub(&r[1], t[0], t[6])   
	add(t[0], &p1[2], t[1])  
	square(t[0], t[0])       
	subAssign(t[0], t[7])    
	sub(&r[2], t[0], t[2])   
	return r
}
func (g *G1) Double(r, p *PointG1) *PointG1 {
	if g.IsZero(p) {
		return r.Zero()
	}
	t := g.t
	square(t[0], &p[0])      
	square(t[1], &p[1])      
	square(t[2], t[1])       
	add(t[1], &p[0], t[1])   
	square(t[1], t[1])       
	subAssign(t[1], t[0])    
	subAssign(t[1], t[2])    
	doubleAssign(t[1])       
	double(t[3], t[0])       
	addAssign(t[0], t[3])    
	square(t[4], t[0])       
	double(t[3], t[1])       
	sub(&r[0], t[4], t[3])   
	subAssign(t[1], &r[0])   
	doubleAssign(t[2])       
	doubleAssign(t[2])       
	doubleAssign(t[2])       
	mul(t[0], t[0], t[1])    
	sub(t[1], t[0], t[2])    
	mul(t[0], &p[1], &p[2])  
	r[1].set(t[1])           
	double(&r[2], t[0])      
	return r
}
func (g *G1) Neg(r, p *PointG1) *PointG1 {
	r[0].set(&p[0])
	r[2].set(&p[2])
	neg(&r[1], &p[1])
	return r
}
func (g *G1) Sub(c, a, b *PointG1) *PointG1 {
	d := &PointG1{}
	g.Neg(d, b)
	g.Add(c, a, d)
	return c
}
func (g *G1) MulScalar(r, p *PointG1, e *Fr) *PointG1 {
	return g.glvMulFr(r, p, e)
}
func (g *G1) MulScalarBig(r, p *PointG1, e *big.Int) *PointG1 {
	return g.glvMulBig(r, p, e)
}
func (g *G1) mulScalar(c, p *PointG1, e *Fr) *PointG1 {
	q, n := &PointG1{}, &PointG1{}
	n.Set(p)
	for i := 0; i < frBitSize; i++ {
		if e.Bit(i) {
			g.Add(q, q, n)
		}
		g.Double(n, n)
	}
	return c.Set(q)
}
func (g *G1) mulScalarBig(c, p *PointG1, e *big.Int) *PointG1 {
	q, n := &PointG1{}, &PointG1{}
	n.Set(p)
	for i := 0; i < frBitSize; i++ {
		if e.Bit(i) == 1 {
			g.Add(q, q, n)
		}
		g.Double(n, n)
	}
	return c.Set(q)
}
func (g *G1) wnafMulFr(r, p *PointG1, e *Fr) *PointG1 {
	wnaf := e.toWNAF(wnafMulWindowG1)
	return g.wnafMul(r, p, wnaf)
}
func (g *G1) wnafMulBig(r, p *PointG1, e *big.Int) *PointG1 {
	wnaf := bigToWNAF(e, wnafMulWindowG1)
	return g.wnafMul(r, p, wnaf)
}
func (g *G1) wnafMul(c, p *PointG1, wnaf nafNumber) *PointG1 {
	l := (1 << (wnafMulWindowG1 - 1))
	twoP, acc := g.New(), new(PointG1).Set(p)
	g.Double(twoP, p)
	g.Affine(twoP)
	table := make([]*PointG1, l*2)
	table[0], table[l] = g.New(), g.New()
	table[0].Set(p)
	g.Neg(table[l], table[0])
	for i := 1; i < l; i++ {
		g.AddMixed(acc, acc, twoP)
		table[i], table[i+l] = g.New(), g.New()
		table[i].Set(acc)
		g.Neg(table[i+l], table[i])
	}
	q := g.Zero()
	for i := len(wnaf) - 1; i >= 0; i-- {
		if wnaf[i] > 0 {
			g.Add(q, q, table[wnaf[i]>>1])
		} else if wnaf[i] < 0 {
			g.Add(q, q, table[((-wnaf[i])>>1)+l])
		}
		if i != 0 {
			g.Double(q, q)
		}
	}
	return c.Set(q)
}
func (g *G1) glvMulFr(r, p *PointG1, e *Fr) *PointG1 {
	return g.glvMul(r, p, new(glvVectorFr).new(e))
}
func (g *G1) glvMulBig(r, p *PointG1, e *big.Int) *PointG1 {
	return g.glvMul(r, p, new(glvVectorBig).new(e))
}
func (g *G1) glvMul(r, p0 *PointG1, v glvVector) *PointG1 {
	w := glvMulWindowG1
	l := 1 << (w - 1)
	tableK1, tableK2 := make([]*PointG1, l), make([]*PointG1, l)
	double := g.New()
	g.Double(double, p0)
	g.affine(double, double)
	tableK1[0] = new(PointG1)
	tableK1[0].Set(p0)
	for i := 1; i < l; i++ {
		tableK1[i] = new(PointG1)
		g.AddMixed(tableK1[i], tableK1[i-1], double)
	}
	g.AffineBatch(tableK1)
	for i := 0; i < l; i++ {
		tableK2[i] = new(PointG1)
		g.glvEndomorphism(tableK2[i], tableK1[i])
	}
	naf1, naf2 := v.wnaf(w)
	lenNAF1, lenNAF2 := len(naf1), len(naf2)
	lenNAF := lenNAF1
	if lenNAF2 > lenNAF {
		lenNAF = lenNAF2
	}
	acc, p1 := g.New(), g.New()
	add := func(table []*PointG1, naf int) {
		if naf != 0 {
			nafAbs := naf
			if nafAbs < 0 {
				nafAbs = -nafAbs
			}
			p1.Set(table[nafAbs>>1])
			if naf < 0 {
				g.Neg(p1, p1)
			}
			g.AddMixed(acc, acc, p1)
		}
	}
	for i := lenNAF - 1; i >= 0; i-- {
		if i < lenNAF1 {
			add(tableK1, naf1[i])
		}
		if i < lenNAF2 {
			add(tableK2, naf2[i])
		}
		if i != 0 {
			g.Double(acc, acc)
		}
	}
	return r.Set(acc)
}
func (g *G1) MultiExpBig(r *PointG1, points []*PointG1, scalars []*big.Int) (*PointG1, error) {
	if len(points) != len(scalars) {
		return nil, errors.New("point and scalar vectors should be in same length")
	}
	c := 3
	if len(scalars) >= 32 {
		c = int(math.Ceil(math.Log(float64(len(scalars)))))
	}
	bucketSize := (1 << c) - 1
	windows := make([]PointG1, 255/c+1)
	bucket := make([]PointG1, bucketSize)
	for j := 0; j < len(windows); j++ {
		for i := 0; i < bucketSize; i++ {
			bucket[i].Zero()
		}
		for i := 0; i < len(scalars); i++ {
			index := bucketSize & int(new(big.Int).Rsh(scalars[i], uint(c*j)).Int64())
			if index != 0 {
				g.Add(&bucket[index-1], &bucket[index-1], points[i])
			}
		}
		acc, sum := g.New(), g.New()
		for i := bucketSize - 1; i >= 0; i-- {
			g.Add(sum, sum, &bucket[i])
			g.Add(acc, acc, sum)
		}
		windows[j].Set(acc)
	}
	acc := g.New()
	for i := len(windows) - 1; i >= 0; i-- {
		for j := 0; j < c; j++ {
			g.Double(acc, acc)
		}
		g.Add(acc, acc, &windows[i])
	}
	return r.Set(acc), nil
}
func (g *G1) MultiExp(r *PointG1, points []*PointG1, scalars []*Fr) (*PointG1, error) {
	if len(points) != len(scalars) {
		return nil, errors.New("point and scalar vectors should be in same length")
	}
	g.AffineBatch(points)
	c := 3
	if len(scalars) >= 32 {
		c = int(math.Ceil(math.Log(float64(len(scalars)))))
	}
	bucketSize := (1 << c) - 1
	windows := make([]*PointG1, 255/c+1)
	bucket := make([]PointG1, bucketSize)
	for j := 0; j < len(windows); j++ {
		for i := 0; i < bucketSize; i++ {
			bucket[i].Zero()
		}
		for i := 0; i < len(scalars); i++ {
			index := bucketSize & int(scalars[i].sliceUint64(c*j))
			if index != 0 {
				g.AddMixed(&bucket[index-1], &bucket[index-1], points[i])
			}
		}
		acc, sum := g.New(), g.New()
		for i := bucketSize - 1; i >= 0; i-- {
			g.Add(sum, sum, &bucket[i])
			g.Add(acc, acc, sum)
		}
		windows[j] = g.New().Set(acc)
	}
	g.AffineBatch(windows)
	acc := g.New()
	for i := len(windows) - 1; i >= 0; i-- {
		for j := 0; j < c; j++ {
			g.Double(acc, acc)
		}
		g.AddMixed(acc, acc, windows[i])
	}
	return r.Set(acc), nil
}
func (g *G1) ClearCofactor(p *PointG1) *PointG1 {
	chain := func(p0 *PointG1, n int, p1 *PointG1) {
		for i := 0; i < n; i++ {
			g.Double(p0, p0)
		}
		g.Add(p0, p0, p1)
	}
	t := g.New().Set(p)
	chain(p, 1, t)
	chain(p, 2, t)
	chain(p, 3, t)
	chain(p, 9, t)
	chain(p, 32, t)
	chain(p, 16, t)
	return p
}