tornadocash/snarkjs
1
0
Fork 0
mirror of https://github.com/tornadocash/snarkjs.git synced 2024-11-01 07:45:43 +01:00
Code Issues Packages Projects Releases Wiki Activity

use refactored verifier solidity template

Browse Source
This commit is contained in:
poma 2021-06-15 14:05:25 +03:00
parent 0c03341798
commit c103e3bf10
No known key found for this signature in database
GPG Key ID: BA20CB01FE165657
1 changed files with 119 additions and 200 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

319
templates/verifier_groth16.sol.ejs
View File

@ -1,250 +1,169 @@
// // SPDX-License-Identifier: MIT
// Copyright 2017 Christian Reitwiessner
// Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: pragma solidity ^0.6.0;
// The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
// 2019 OKIMS
// ported to solidity 0.6
// fixed linter warnings
// added requiere error messages
//
//
// SPDX-License-Identifier: GPL-3.0
pragma solidity ^0.6.11;
library Pairing { library Pairing {
uint256 constant PRIME_Q = 21888242871839275222246405745257275088696311157297823662689037894645226208583;
struct G1Point { struct G1Point {
uint X; uint256 X;
uint Y; uint256 Y;
} }
// Encoding of field elements is: X[0] * z + X[1] // Encoding of field elements is: X[0] * z + X[1]
struct G2Point { struct G2Point {
uint[2] X; uint256[2] X;
uint[2] Y; uint256[2] Y;
} }
/// @return the generator of G1
function P1() internal pure returns (G1Point memory) {
return G1Point(1, 2);
}
/// @return the generator of G2
function P2() internal pure returns (G2Point memory) {
// Original code point
return G2Point(
[11559732032986387107991004021392285783925812861821192530917403151452391805634,
10857046999023057135944570762232829481370756359578518086990519993285655852781],
[4082367875863433681332203403145435568316851327593401208105741076214120093531,
8495653923123431417604973247489272438418190587263600148770280649306958101930]
);
/* /*
// Changed by Jordi point * @return The negation of p, i.e. p.plus(p.negate()) should be zero
return G2Point( */
[10857046999023057135944570762232829481370756359578518086990519993285655852781, function negate(G1Point memory p) internal pure returns (G1Point memory) {
11559732032986387107991004021392285783925812861821192530917403151452391805634],
[8495653923123431417604973247489272438418190587263600148770280649306958101930,
4082367875863433681332203403145435568316851327593401208105741076214120093531]
);
*/
}
/// @return r the negation of p, i.e. p.addition(p.negate()) should be zero.
function negate(G1Point memory p) internal pure returns (G1Point memory r) {
// The prime q in the base field F_q for G1 // The prime q in the base field F_q for G1
uint q = 21888242871839275222246405745257275088696311157297823662689037894645226208583; if (p.X == 0 && p.Y == 0) {
if (p.X == 0 && p.Y == 0)
return G1Point(0, 0); return G1Point(0, 0);
return G1Point(p.X, q - (p.Y % q)); } else {
return G1Point(p.X, PRIME_Q - (p.Y % PRIME_Q));
}
} }
/// @return r the sum of two points of G1
function addition(G1Point memory p1, G1Point memory p2) internal view returns (G1Point memory r) { /*
uint[4] memory input; * @return r the sum of two points of G1
input[0] = p1.X; */
input[1] = p1.Y; function plus(
input[2] = p2.X; G1Point memory p1,
input[3] = p2.Y; G1Point memory p2
) internal view returns (G1Point memory r) {
uint256[4] memory input = [
p1.X, p1.Y,
p2.X, p2.Y
];
bool success; bool success;
// solium-disable-next-line security/no-inline-assembly // solium-disable-next-line security/no-inline-assembly
assembly { assembly {
success := staticcall(sub(gas(), 2000), 6, input, 0xc0, r, 0x60) success := staticcall(sub(gas(), 2000), 6, input, 0xc0, r, 0x60)
// Use "invalid" to make gas estimation work // Use "invalid" to make gas estimation work
switch success case 0 { invalid() } switch success case 0 { invalid() }
} }
require(success,"pairing-add-failed");
require(success, "pairing-add-failed");
} }
/// @return r the product of a point on G1 and a scalar, i.e.
/// p == p.scalar_mul(1) and p.addition(p) == p.scalar_mul(2) for all points p. /*
function scalar_mul(G1Point memory p, uint s) internal view returns (G1Point memory r) { * @return r the product of a point on G1 and a scalar, i.e.
uint[3] memory input; * p == p.scalarMul(1) and p.plus(p) == p.scalarMul(2) for all
input[0] = p.X; * points p.
input[1] = p.Y; */
input[2] = s; function scalarMul(G1Point memory p, uint256 s) internal view returns (G1Point memory r) {
uint256[3] memory input = [p.X, p.Y, s];
bool success; bool success;
// solium-disable-next-line security/no-inline-assembly // solium-disable-next-line security/no-inline-assembly
assembly { assembly {
success := staticcall(sub(gas(), 2000), 7, input, 0x80, r, 0x60) success := staticcall(sub(gas(), 2000), 7, input, 0x80, r, 0x60)
// Use "invalid" to make gas estimation work // Use "invalid" to make gas estimation work
switch success case 0 { invalid() } switch success case 0 { invalid() }
} }
require (success,"pairing-mul-failed");
require(success, "pairing-mul-failed");
} }
/// @return the result of computing the pairing check
/// e(p1[0], p2[0]) * .... * e(p1[n], p2[n]) == 1 /* @return The result of computing the pairing check
/// For example pairing([P1(), P1().negate()], [P2(), P2()]) should * e(p1[0], p2[0]) * .... * e(p1[n], p2[n]) == 1
/// return true. * For example,
function pairing(G1Point[] memory p1, G2Point[] memory p2) internal view returns (bool) { * pairing([P1(), P1().negate()], [P2(), P2()]) should return true.
require(p1.length == p2.length,"pairing-lengths-failed"); */
uint elements = p1.length; function pairing(
uint inputSize = elements * 6; G1Point memory a1,
uint[] memory input = new uint[](inputSize); G2Point memory a2,
for (uint i = 0; i < elements; i++) G1Point memory b1,
{ G2Point memory b2,
input[i * 6 + 0] = p1[i].X; G1Point memory c1,
input[i * 6 + 1] = p1[i].Y; G2Point memory c2,
input[i * 6 + 2] = p2[i].X[0]; G1Point memory d1,
input[i * 6 + 3] = p2[i].X[1]; G2Point memory d2
input[i * 6 + 4] = p2[i].Y[0]; ) internal view returns (bool) {
input[i * 6 + 5] = p2[i].Y[1]; uint256[24] memory input = [
} a1.X, a1.Y, a2.X[0], a2.X[1], a2.Y[0], a2.Y[1],
uint[1] memory out; b1.X, b1.Y, b2.X[0], b2.X[1], b2.Y[0], b2.Y[1],
c1.X, c1.Y, c2.X[0], c2.X[1], c2.Y[0], c2.Y[1],
d1.X, d1.Y, d2.X[0], d2.X[1], d2.Y[0], d2.Y[1]
];
uint256[1] memory out;
bool success; bool success;
// solium-disable-next-line security/no-inline-assembly // solium-disable-next-line security/no-inline-assembly
assembly { assembly {
success := staticcall(sub(gas(), 2000), 8, add(input, 0x20), mul(inputSize, 0x20), out, 0x20) success := staticcall(sub(gas(), 2000), 8, input, mul(24, 0x20), out, 0x20)
// Use "invalid" to make gas estimation work // Use "invalid" to make gas estimation work
switch success case 0 { invalid() } switch success case 0 { invalid() }
} }
require(success,"pairing-opcode-failed");
require(success, "pairing-opcode-failed");
return out[0] != 0; return out[0] != 0;
} }
/// Convenience method for a pairing check for two pairs.
function pairingProd2(G1Point memory a1, G2Point memory a2, G1Point memory b1, G2Point memory b2) internal view returns (bool) {
G1Point[] memory p1 = new G1Point[](2);
G2Point[] memory p2 = new G2Point[](2);
p1[0] = a1;
p1[1] = b1;
p2[0] = a2;
p2[1] = b2;
return pairing(p1, p2);
}
/// Convenience method for a pairing check for three pairs.
function pairingProd3(
G1Point memory a1, G2Point memory a2,
G1Point memory b1, G2Point memory b2,
G1Point memory c1, G2Point memory c2
) internal view returns (bool) {
G1Point[] memory p1 = new G1Point[](3);
G2Point[] memory p2 = new G2Point[](3);
p1[0] = a1;
p1[1] = b1;
p1[2] = c1;
p2[0] = a2;
p2[1] = b2;
p2[2] = c2;
return pairing(p1, p2);
}
/// Convenience method for a pairing check for four pairs.
function pairingProd4(
G1Point memory a1, G2Point memory a2,
G1Point memory b1, G2Point memory b2,
G1Point memory c1, G2Point memory c2,
G1Point memory d1, G2Point memory d2
) internal view returns (bool) {
G1Point[] memory p1 = new G1Point[](4);
G2Point[] memory p2 = new G2Point[](4);
p1[0] = a1;
p1[1] = b1;
p1[2] = c1;
p1[3] = d1;
p2[0] = a2;
p2[1] = b2;
p2[2] = c2;
p2[3] = d2;
return pairing(p1, p2);
}
} }
contract Verifier { contract Verifier {
uint256 constant SNARK_SCALAR_FIELD = 21888242871839275222246405745257275088548364400416034343698204186575808495617;
uint256 constant PRIME_Q = 21888242871839275222246405745257275088696311157297823662689037894645226208583;
using Pairing for *; using Pairing for *;
struct VerifyingKey { struct VerifyingKey {
Pairing.G1Point alfa1; Pairing.G1Point alfa1;
Pairing.G2Point beta2; Pairing.G2Point beta2;
Pairing.G2Point gamma2; Pairing.G2Point gamma2;
Pairing.G2Point delta2; Pairing.G2Point delta2;
Pairing.G1Point[] IC; Pairing.G1Point[<%=IC.length%>] IC;
} }
struct Proof {
Pairing.G1Point A;
Pairing.G2Point B;
Pairing.G1Point C;
}
function verifyingKey() internal pure returns (VerifyingKey memory vk) {
vk.alfa1 = Pairing.G1Point(
<%=vk_alpha_1[0]%>,
<%=vk_alpha_1[1]%>
);
vk.beta2 = Pairing.G2Point( function verifyingKey() internal pure returns (VerifyingKey memory vk) {
[<%=vk_beta_2[0][1]%>, vk.alfa1 = Pairing.G1Point(<%=vk_alpha_1[0]%>, <%=vk_alpha_1[1]%>);
<%=vk_beta_2[0][0]%>], vk.beta2 = Pairing.G2Point([<%=vk_beta_2[0][1]%>, <%=vk_beta_2[0][0]%>], [<%=vk_beta_2[1][1]%>, <%=vk_beta_2[1][0]%>]);
[<%=vk_beta_2[1][1]%>, vk.gamma2 = Pairing.G2Point([<%=vk_gamma_2[0][1]%>, <%=vk_gamma_2[0][0]%>], [<%=vk_gamma_2[1][1]%>, <%=vk_gamma_2[1][0]%>]);
<%=vk_beta_2[1][0]%>] vk.delta2 = Pairing.G2Point([<%=vk_delta_2[0][1]%>, <%=vk_delta_2[0][0]%>], [<%=vk_delta_2[1][1]%>, <%=vk_delta_2[1][0]%>]);
); <% for (let i=0; i<IC.length; i++) { %>
vk.gamma2 = Pairing.G2Point( vk.IC[<%=i%>] = Pairing.G1Point(<%=IC[i][0]%>, <%=IC[i][1]%>);<% } %>
[<%=vk_gamma_2[0][1]%>,
<%=vk_gamma_2[0][0]%>],
[<%=vk_gamma_2[1][1]%>,
<%=vk_gamma_2[1][0]%>]
);
vk.delta2 = Pairing.G2Point(
[<%=vk_delta_2[0][1]%>,
<%=vk_delta_2[0][0]%>],
[<%=vk_delta_2[1][1]%>,
<%=vk_delta_2[1][0]%>]
);
vk.IC = new Pairing.G1Point[](<%=IC.length%>);
<% for (let i=0; i<IC.length; i++) { %>
vk.IC[<%=i%>] = Pairing.G1Point(
<%=IC[i][0]%>,
<%=IC[i][1]%>
);
<% } %>
} }
function verify(uint[] memory input, Proof memory proof) internal view returns (uint) {
uint256 snark_scalar_field = 21888242871839275222246405745257275088548364400416034343698204186575808495617; /*
VerifyingKey memory vk = verifyingKey(); * @returns Whether the proof is valid given the hardcoded verifying key
require(input.length + 1 == vk.IC.length,"verifier-bad-input"); * above and the public inputs
// Compute the linear combination vk_x */
Pairing.G1Point memory vk_x = Pairing.G1Point(0, 0);
for (uint i = 0; i < input.length; i++) {
require(input[i] < snark_scalar_field,"verifier-gte-snark-scalar-field");
vk_x = Pairing.addition(vk_x, Pairing.scalar_mul(vk.IC[i + 1], input[i]));
}
vk_x = Pairing.addition(vk_x, vk.IC[0]);
if (!Pairing.pairingProd4(
Pairing.negate(proof.A), proof.B,
vk.alfa1, vk.beta2,
vk_x, vk.gamma2,
proof.C, vk.delta2
)) return 1;
return 0;
}
/// @return r bool true if proof is valid
function verifyProof( function verifyProof(
uint[2] memory a, bytes memory proof,
uint[2][2] memory b, uint256[<%=IC.length-1%>] memory input
uint[2] memory c, ) public view returns (bool) {
uint[<%=IC.length-1%>] memory input uint256[8] memory p = abi.decode(proof, (uint256[8]));
) public view returns (bool r) { for (uint8 i = 0; i < p.length; i++) {
Proof memory proof; // Make sure that each element in the proof is less than the prime q
proof.A = Pairing.G1Point(a[0], a[1]); require(p[i] < PRIME_Q, "verifier-proof-element-gte-prime-q");
proof.B = Pairing.G2Point([b[0][0], b[0][1]], [b[1][0], b[1][1]]);
proof.C = Pairing.G1Point(c[0], c[1]);
uint[] memory inputValues = new uint[](input.length);
for(uint i = 0; i < input.length; i++){
inputValues[i] = input[i];
} }
if (verify(inputValues, proof) == 0) { Pairing.G1Point memory proofA = Pairing.G1Point(p[0], p[1]);
return true; Pairing.G2Point memory proofB = Pairing.G2Point([p[2], p[3]], [p[4], p[5]]);
} else { Pairing.G1Point memory proofC = Pairing.G1Point(p[6], p[7]);
return false;
VerifyingKey memory vk = verifyingKey();
// Compute the linear combination vkX
Pairing.G1Point memory vkX = vk.IC[0];
for (uint256 i = 0; i < input.length; i++) {
// Make sure that every input is less than the snark scalar field
require(input[i] < SNARK_SCALAR_FIELD, "verifier-input-gte-snark-scalar-field");
vkX = Pairing.plus(vkX, Pairing.scalarMul(vk.IC[i + 1], input[i]));
} }
return Pairing.pairing(
Pairing.negate(proofA),
proofB,
vk.alfa1,
vk.beta2,
vkX,
vk.gamma2,
proofC,
vk.delta2
);
} }
} }