Fix brackets in the in field check
This commit is contained in:
parent
0349d90824
commit
f8ba7cbfa7
|
@ -173,7 +173,7 @@ class BN128 {
|
||||||
throw new Error("Expected values are not equal");
|
throw new Error("Expected values are not equal");
|
||||||
}
|
}
|
||||||
|
|
||||||
if (this.loopCountNef)
|
if (this.loopCountNeg)
|
||||||
{
|
{
|
||||||
R.Y = this.F2.neg(R.Y);
|
R.Y = this.F2.neg(R.Y);
|
||||||
}
|
}
|
||||||
|
|
|
@ -187,9 +187,10 @@ contract Verifier {
|
||||||
require(input.length + 1 == vk.IC.length,"verifier-bad-input");
|
require(input.length + 1 == vk.IC.length,"verifier-bad-input");
|
||||||
// Compute the linear combination vk_x
|
// Compute the linear combination vk_x
|
||||||
Pairing.G1Point memory vk_x = Pairing.G1Point(0, 0);
|
Pairing.G1Point memory vk_x = Pairing.G1Point(0, 0);
|
||||||
for (uint i = 0; i < input.length; i++)
|
for (uint i = 0; i < input.length; i++) {
|
||||||
require(input[i] < snark_scalar_field);
|
require(input[i] < snark_scalar_field);
|
||||||
vk_x = Pairing.addition(vk_x, Pairing.scalar_mul(vk.IC[i + 1], input[i]));
|
vk_x = Pairing.addition(vk_x, Pairing.scalar_mul(vk.IC[i + 1], input[i]));
|
||||||
|
}
|
||||||
vk_x = Pairing.addition(vk_x, vk.IC[0]);
|
vk_x = Pairing.addition(vk_x, vk.IC[0]);
|
||||||
if (!Pairing.pairingProd4(
|
if (!Pairing.pairingProd4(
|
||||||
Pairing.negate(proof.A), proof.B,
|
Pairing.negate(proof.A), proof.B,
|
||||||
|
|
|
@ -178,9 +178,10 @@ contract Verifier {
|
||||||
require(input.length + 1 == vk.IC.length);
|
require(input.length + 1 == vk.IC.length);
|
||||||
// Compute the linear combination vk_x
|
// Compute the linear combination vk_x
|
||||||
Pairing.G1Point memory vk_x = Pairing.G1Point(0, 0);
|
Pairing.G1Point memory vk_x = Pairing.G1Point(0, 0);
|
||||||
for (uint i = 0; i < input.length; i++)
|
for (uint i = 0; i < input.length; i++) {
|
||||||
require(input[i] < snark_scalar_field);
|
require(input[i] < snark_scalar_field);
|
||||||
vk_x = Pairing.addition(vk_x, Pairing.scalar_mul(vk.IC[i + 1], input[i]));
|
vk_x = Pairing.addition(vk_x, Pairing.scalar_mul(vk.IC[i + 1], input[i]));
|
||||||
|
}
|
||||||
vk_x = Pairing.addition(vk_x, vk.IC[0]);
|
vk_x = Pairing.addition(vk_x, vk.IC[0]);
|
||||||
if (!Pairing.pairingProd4(
|
if (!Pairing.pairingProd4(
|
||||||
Pairing.negate(proof.A), proof.B,
|
Pairing.negate(proof.A), proof.B,
|
||||||
|
|
|
@ -188,9 +188,10 @@ contract Verifier {
|
||||||
require(input.length + 1 == vk.IC.length,"verifier-bad-input");
|
require(input.length + 1 == vk.IC.length,"verifier-bad-input");
|
||||||
// Compute the linear combination vk_x
|
// Compute the linear combination vk_x
|
||||||
Pairing.G1Point memory vk_x = Pairing.G1Point(0, 0);
|
Pairing.G1Point memory vk_x = Pairing.G1Point(0, 0);
|
||||||
for (uint i = 0; i < input.length; i++)
|
for (uint i = 0; i < input.length; i++) {
|
||||||
require(input[i] < snark_scalar_field);
|
require(input[i] < snark_scalar_field);
|
||||||
vk_x = Pairing.addition(vk_x, Pairing.scalar_mul(vk.IC[i + 1], input[i]));
|
vk_x = Pairing.addition(vk_x, Pairing.scalar_mul(vk.IC[i + 1], input[i]));
|
||||||
|
}
|
||||||
vk_x = Pairing.addition(vk_x, vk.IC[0]);
|
vk_x = Pairing.addition(vk_x, vk.IC[0]);
|
||||||
if (!Pairing.pairingProd2(proof.A, vk.A, Pairing.negate(proof.A_p), Pairing.P2())) return 1;
|
if (!Pairing.pairingProd2(proof.A, vk.A, Pairing.negate(proof.A_p), Pairing.P2())) return 1;
|
||||||
if (!Pairing.pairingProd2(vk.B, proof.B, Pairing.negate(proof.B_p), Pairing.P2())) return 2;
|
if (!Pairing.pairingProd2(vk.B, proof.B, Pairing.negate(proof.B_p), Pairing.P2())) return 2;
|
||||||
|
|
Loading…
Reference in New Issue