2018-08-20 15:05:06 +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.
|
2018-03-05 12:33:45 +00:00
|
|
|
|
2021-08-25 16:46:29 +00:00
|
|
|
//go:build !amd64 && !arm64
|
2018-03-19 16:13:54 +00:00
|
|
|
// +build !amd64,!arm64
|
2018-03-05 12:33:45 +00:00
|
|
|
|
|
|
|
// Package bn256 implements the Optimal Ate pairing over a 256-bit Barreto-Naehrig curve.
|
|
|
|
package bn256
|
|
|
|
|
2020-02-27 11:59:00 +00:00
|
|
|
import bn256 "github.com/ethereum/go-ethereum/crypto/bn256/google"
|
2018-03-05 12:33:45 +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.
|
2018-03-19 16:13:54 +00:00
|
|
|
type G1 = bn256.G1
|
2018-03-05 12:33:45 +00:00
|
|
|
|
|
|
|
// 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.
|
2018-03-19 16:13:54 +00:00
|
|
|
type G2 = bn256.G2
|
2018-03-05 12:33:45 +00:00
|
|
|
|
|
|
|
// PairingCheck calculates the Optimal Ate pairing for a set of points.
|
|
|
|
func PairingCheck(a []*G1, b []*G2) bool {
|
2018-03-19 16:13:54 +00:00
|
|
|
return bn256.PairingCheck(a, b)
|
2018-03-05 12:33:45 +00:00
|
|
|
}
|