2018-08-27 08:22:21 +00:00
|
|
|
// Copyright 2018 Péter Szilágyi. All rights reserved.
|
|
|
|
|
// Use of this source code is governed by a BSD-style license that can be found
|
|
|
|
|
// in the LICENSE file.
|
2016-06-20 14:47:10 +00:00
|
|
|
|
2022-10-25 14:25:08 +00:00
|
|
|
//go:build !amd64 && !arm64
|
2018-04-24 15:50:26 +00:00
|
|
|
// +build !amd64,!arm64
|
2016-06-20 14:47:10 +00:00
|
|
|
|
2018-04-24 15:50:26 +00:00
|
|
|
// Package bn256 implements the Optimal Ate pairing over a 256-bit Barreto-Naehrig curve.
|
|
|
|
|
package bn256
|
2016-06-20 14:47:10 +00:00
|
|
|
|
2021-06-28 06:53:50 +00:00
|
|
|
import bn256 "github.com/ethereum/go-ethereum/crypto/bn256/google"
|
2018-04-24 15:50:26 +00:00
|
|
|
|
|
|
|
|
// G1 is an abstract cyclic group. The zero value is suitable for use as the
|
|
|
|
|
// output of an operation, but cannot be used as an input.
|
|
|
|
|
type G1 = bn256.G1
|
|
|
|
|
|
|
|
|
|
// G2 is an abstract cyclic group. The zero value is suitable for use as the
|
|
|
|
|
// output of an operation, but cannot be used as an input.
|
|
|
|
|
type G2 = bn256.G2
|
|
|
|
|
|
|
|
|
|
// PairingCheck calculates the Optimal Ate pairing for a set of points.
|
|
|
|
|
func PairingCheck(a []*G1, b []*G2) bool {
|
|
|
|
|
return bn256.PairingCheck(a, b)
|
|
|
|
|
}
|
