diff --git a/ecc/bls12-377/pairing.go b/ecc/bls12-377/pairing.go
index 54245331c2..b1ed68e1a1 100644
--- a/ecc/bls12-377/pairing.go
+++ b/ecc/bls12-377/pairing.go
@@ -30,7 +30,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -41,6 +43,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bls12-378/pairing.go b/ecc/bls12-378/pairing.go
index e7ae9af52d..c88db75481 100644
--- a/ecc/bls12-378/pairing.go
+++ b/ecc/bls12-378/pairing.go
@@ -30,7 +30,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -41,6 +43,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bls12-381/pairing.go b/ecc/bls12-381/pairing.go
index 5c585e69ee..9a78d328dc 100644
--- a/ecc/bls12-381/pairing.go
+++ b/ecc/bls12-381/pairing.go
@@ -30,7 +30,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -41,6 +43,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bls24-315/pairing.go b/ecc/bls24-315/pairing.go
index 0b47b90004..5e1bf1fe3c 100644
--- a/ecc/bls24-315/pairing.go
+++ b/ecc/bls24-315/pairing.go
@@ -30,7 +30,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -41,6 +43,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bls24-317/pairing.go b/ecc/bls24-317/pairing.go
index 6f1721d271..1d4cb27300 100644
--- a/ecc/bls24-317/pairing.go
+++ b/ecc/bls24-317/pairing.go
@@ -30,7 +30,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -41,6 +43,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bn254/pairing.go b/ecc/bn254/pairing.go
index f9444320f0..53160c9be6 100644
--- a/ecc/bn254/pairing.go
+++ b/ecc/bn254/pairing.go
@@ -30,7 +30,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -41,6 +43,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bw6-633/pairing.go b/ecc/bw6-633/pairing.go
index 0a706b0770..7b9422fa89 100644
--- a/ecc/bw6-633/pairing.go
+++ b/ecc/bw6-633/pairing.go
@@ -31,7 +31,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -42,6 +44,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bw6-756/pairing.go b/ecc/bw6-756/pairing.go
index 32b520521f..c52d4dda51 100644
--- a/ecc/bw6-756/pairing.go
+++ b/ecc/bw6-756/pairing.go
@@ -31,7 +31,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -42,6 +44,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {
diff --git a/ecc/bw6-761/pairing.go b/ecc/bw6-761/pairing.go
index 4cba6ae442..8cdddd9ce3 100644
--- a/ecc/bw6-761/pairing.go
+++ b/ecc/bw6-761/pairing.go
@@ -31,7 +31,9 @@ type lineEvaluation struct {
 }
 
 // Pair calculates the reduced pairing for a set of points
-// ∏ᵢ e(Pᵢ, Qᵢ)
+// ∏ᵢ e(Pᵢ, Qᵢ).
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 	f, err := MillerLoop(P, Q)
 	if err != nil {
@@ -42,6 +44,8 @@ func Pair(P []G1Affine, Q []G2Affine) (GT, error) {
 
 // PairingCheck calculates the reduced pairing for a set of points and returns True if the result is One
 // ∏ᵢ e(Pᵢ, Qᵢ) =? 1
+//
+// This function doesn't check that the inputs are in the correct subgroup. See IsInSubGroup.
 func PairingCheck(P []G1Affine, Q []G2Affine) (bool, error) {
 	f, err := Pair(P, Q)
 	if err != nil {