Does solang support evm assembly code such as mload/mstore/calldataload?
readygo67 opened this issue · 2 comments
readygo67 commented
in my solidity file, many assembly code used, when I try to compile it to wasm, it shows
error: builtin 'calldataload' is not available for target Polkadot. Please, open a GitHub issue at https://github.com/hyperledger/solang/issues if there is need to support this function
┌─ xxx/Verifier.sol:1120:28
│
1120 │ let tmp := mulmod(calldataload(src), s, R_MOD)
│ ^^^^^^^^^^^^^^^^^
hope to know whether solang supports evm assembly code?
// SPDX-License-Identifier: Apache-2.0
// Copyright 2023 Consensys Software Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Code generated by gnark DO NOT EDIT
pragma solidity ^0.8.19;
contract PlonkVerifier {
uint256 private constant R_MOD = 21888242871839275222246405745257275088548364400416034343698204186575808495617;
uint256 private constant P_MOD = 21888242871839275222246405745257275088696311157297823662689037894645226208583;
uint256 private constant G2_SRS_0_X_0 = 11559732032986387107991004021392285783925812861821192530917403151452391805634;
uint256 private constant G2_SRS_0_X_1 = 10857046999023057135944570762232829481370756359578518086990519993285655852781;
uint256 private constant G2_SRS_0_Y_0 = 4082367875863433681332203403145435568316851327593401208105741076214120093531;
uint256 private constant G2_SRS_0_Y_1 = 8495653923123431417604973247489272438418190587263600148770280649306958101930;
uint256 private constant G2_SRS_1_X_0 = 11553322896630112964350732591975449693308355872659869764347351158487278933832;
uint256 private constant G2_SRS_1_X_1 = 5818425251016320472869590497121050830642418349786202187546949368073227010040;
uint256 private constant G2_SRS_1_Y_0 = 2019168678748241613146537705609312220523150241346309847629684077970556654857;
uint256 private constant G2_SRS_1_Y_1 = 9844877212376448610342539259626027237579671808672022643817712356938103803398;
uint256 private constant G1_SRS_X = 1;
uint256 private constant G1_SRS_Y = 2;
// ----------------------- vk ---------------------
uint256 private constant VK_NB_PUBLIC_INPUTS = 1;
uint256 private constant VK_DOMAIN_SIZE = 8;
uint256 private constant VK_INV_DOMAIN_SIZE = 19152212512859365819465605027100115702479818850364030050735928663253832433665;
uint256 private constant VK_OMEGA = 19540430494807482326159819597004422086093766032135589407132600596362845576832;
uint256 private constant VK_QL_COM_X = 20679534122092877238378741596975341699502462140579968873319048710622491099652;
uint256 private constant VK_QL_COM_Y = 15862743140337277021674856133324836215315706873755058900942033762030260172925;
uint256 private constant VK_QR_COM_X = 20330327006267274644059162052980617706055665702130990668722435107302339510808;
uint256 private constant VK_QR_COM_Y = 13626817747957188624014189138722078408112762580704064154846900032727874427369;
uint256 private constant VK_QM_COM_X = 909813450045677054009792541810357348104626186974250952591766929863335800693;
uint256 private constant VK_QM_COM_Y = 17360116707177202275342264892857687749627019605699334102824724738831404946438;
uint256 private constant VK_QO_COM_X = 3947606701901763036567521689466029892550175395826741492614836204497268193083;
uint256 private constant VK_QO_COM_Y = 20079715285960008971331583805853825052480621619671620766585747913360517198960;
uint256 private constant VK_QK_COM_X = 8403622088692986898334663717058532255525955827476201595621714967013959004755;
uint256 private constant VK_QK_COM_Y = 19463230915982479714323716342868383916712644657353880618718897737281673536218;
uint256 private constant VK_S1_COM_X = 21513929973543337460588132173354850520329151177153195126942825182142848035945;
uint256 private constant VK_S1_COM_Y = 12370394930999707560514005439824913740720242984778647366703285588703055514729;
uint256 private constant VK_S2_COM_X = 4427804277068447016929216762299684608991848479290509089688175473111048391660;
uint256 private constant VK_S2_COM_Y = 9374990049427340355710238179629723887481455612078634074027865911492157434114;
uint256 private constant VK_S3_COM_X = 15798776026323354177856271206757120986201695559556949126375902416026758049083;
uint256 private constant VK_S3_COM_Y = 5812339552397273827651645678554876999351452009114001808529369402674248870397;
uint256 private constant VK_COSET_SHIFT = 5;
uint256 private constant VK_NB_CUSTOM_GATES = 0;
// ------------------------------------------------
// offset proof
uint256 private constant PROOF_L_COM_X = 0x00;
uint256 private constant PROOF_L_COM_Y = 0x20;
uint256 private constant PROOF_R_COM_X = 0x40;
uint256 private constant PROOF_R_COM_Y = 0x60;
uint256 private constant PROOF_O_COM_X = 0x80;
uint256 private constant PROOF_O_COM_Y = 0xa0;
// h = h_0 + x^{n+2}h_1 + x^{2(n+2)}h_2
uint256 private constant PROOF_H_0_X = 0xc0;
uint256 private constant PROOF_H_0_Y = 0xe0;
uint256 private constant PROOF_H_1_X = 0x100;
uint256 private constant PROOF_H_1_Y = 0x120;
uint256 private constant PROOF_H_2_X = 0x140;
uint256 private constant PROOF_H_2_Y = 0x160;
// wire values at zeta
uint256 private constant PROOF_L_AT_ZETA = 0x180;
uint256 private constant PROOF_R_AT_ZETA = 0x1a0;
uint256 private constant PROOF_O_AT_ZETA = 0x1c0;
//uint256[STATE_WIDTH-1] permutation_polynomials_at_zeta; // Sσ1(zeta),Sσ2(zeta)
uint256 private constant PROOF_S1_AT_ZETA = 0x1e0; // Sσ1(zeta)
uint256 private constant PROOF_S2_AT_ZETA = 0x200; // Sσ2(zeta)
//Bn254.G1Point grand_product_commitment; // [z(x)]
uint256 private constant PROOF_GRAND_PRODUCT_COMMITMENT_X = 0x220;
uint256 private constant PROOF_GRAND_PRODUCT_COMMITMENT_Y = 0x240;
uint256 private constant PROOF_GRAND_PRODUCT_AT_ZETA_OMEGA = 0x260; // z(w*zeta)
uint256 private constant PROOF_QUOTIENT_POLYNOMIAL_AT_ZETA = 0x280; // t(zeta)
uint256 private constant PROOF_LINEARISED_POLYNOMIAL_AT_ZETA = 0x2a0; // r(zeta)
// Folded proof for the opening of H, linearised poly, l, r, o, s_1, s_2, qcp
uint256 private constant PROOF_BATCH_OPENING_AT_ZETA_X = 0x2c0; // [Wzeta]
uint256 private constant PROOF_BATCH_OPENING_AT_ZETA_Y = 0x2e0;
uint256 private constant PROOF_OPENING_AT_ZETA_OMEGA_X = 0x300;
uint256 private constant PROOF_OPENING_AT_ZETA_OMEGA_Y = 0x320;
uint256 private constant PROOF_OPENING_QCP_AT_ZETA = 0x340;
uint256 private constant PROOF_COMMITMENTS_WIRES_CUSTOM_GATES = 0x340;
// -> next part of proof is
// [ openings_selector_commits || commitments_wires_commit_api]
// -------- offset state
// challenges to check the claimed quotient
uint256 private constant STATE_ALPHA = 0x00;
uint256 private constant STATE_BETA = 0x20;
uint256 private constant STATE_GAMMA = 0x40;
uint256 private constant STATE_ZETA = 0x60;
// reusable value
uint256 private constant STATE_ALPHA_SQUARE_LAGRANGE_0 = 0x80;
// commitment to H
uint256 private constant STATE_FOLDED_H_X = 0xa0;
uint256 private constant STATE_FOLDED_H_Y = 0xc0;
// commitment to the linearised polynomial
uint256 private constant STATE_LINEARISED_POLYNOMIAL_X = 0xe0;
uint256 private constant STATE_LINEARISED_POLYNOMIAL_Y = 0x100;
// Folded proof for the opening of H, linearised poly, l, r, o, s_1, s_2, qcp
uint256 private constant STATE_FOLDED_CLAIMED_VALUES = 0x120;
// folded digests of H, linearised poly, l, r, o, s_1, s_2, qcp
uint256 private constant STATE_FOLDED_DIGESTS_X = 0x140;
uint256 private constant STATE_FOLDED_DIGESTS_Y = 0x160;
uint256 private constant STATE_PI = 0x180;
uint256 private constant STATE_ZETA_POWER_N_MINUS_ONE = 0x1a0;
uint256 private constant STATE_GAMMA_KZG = 0x1c0;
uint256 private constant STATE_SUCCESS = 0x1e0;
uint256 private constant STATE_CHECK_VAR = 0x200; // /!\ this slot is used for debugging only
uint256 private constant STATE_LAST_MEM = 0x220;
// -------- errors
uint256 private constant ERROR_STRING_ID = 0x08c379a000000000000000000000000000000000000000000000000000000000; // selector for function Error(string)
/// Verify a Plonk proof.
/// Reverts if the proof or the public inputs are malformed.
/// @param proof serialised plonk proof (using gnark's MarshalSolidity)
/// @param public_inputs (must be reduced)
/// @return success true if the proof passes false otherwise
function Verify(bytes calldata proof, uint256[] calldata public_inputs)
public view returns(bool success) {
assembly {
let mem := mload(0x40)
let freeMem := add(mem, STATE_LAST_MEM)
// sanity checks
check_number_of_public_inputs(public_inputs.length)
check_inputs_size(public_inputs.length, public_inputs.offset)
check_proof_size(proof.length)
check_proof_openings_size(proof.offset)
// compute the challenges
let prev_challenge_non_reduced
prev_challenge_non_reduced := derive_gamma(proof.offset, public_inputs.length, public_inputs.offset)
prev_challenge_non_reduced := derive_beta(prev_challenge_non_reduced)
prev_challenge_non_reduced := derive_alpha(proof.offset, prev_challenge_non_reduced)
derive_zeta(proof.offset, prev_challenge_non_reduced)
// evaluation of Z=Xⁿ-1 at ζ, we save this value
let zeta := mload(add(mem, STATE_ZETA))
let zeta_power_n_minus_one := addmod(pow(zeta, VK_DOMAIN_SIZE, freeMem), sub(R_MOD, 1), R_MOD)
mstore(add(mem, STATE_ZETA_POWER_N_MINUS_ONE), zeta_power_n_minus_one)
// public inputs contribution
let l_pi := sum_pi_wo_api_commit(public_inputs.offset, public_inputs.length, freeMem)
mstore(add(mem, STATE_PI), l_pi)
compute_alpha_square_lagrange_0()
verify_quotient_poly_eval_at_zeta(proof.offset)
fold_h(proof.offset)
compute_commitment_linearised_polynomial(proof.offset)
compute_gamma_kzg(proof.offset)
fold_state(proof.offset)
batch_verify_multi_points(proof.offset)
success := mload(add(mem, STATE_SUCCESS))
// Beginning errors -------------------------------------------------
function error_nb_public_inputs() {
let ptError := mload(0x40)
mstore(ptError, ERROR_STRING_ID) // selector for function Error(string)
mstore(add(ptError, 0x4), 0x20)
mstore(add(ptError, 0x24), 0x1d)
mstore(add(ptError, 0x44), "wrong number of public inputs")
revert(ptError, 0x64)
}
/// Called when an operation on Bn254 fails
/// @dev for instance when calling EcMul on a point not on Bn254.
function error_ec_op() {
let ptError := mload(0x40)
mstore(ptError, ERROR_STRING_ID) // selector for function Error(string)
mstore(add(ptError, 0x4), 0x20)
mstore(add(ptError, 0x24), 0x12)
mstore(add(ptError, 0x44), "error ec operation")
revert(ptError, 0x64)
}
/// Called when one of the public inputs is not reduced.
function error_inputs_size() {
let ptError := mload(0x40)
mstore(ptError, ERROR_STRING_ID) // selector for function Error(string)
mstore(add(ptError, 0x4), 0x20)
mstore(add(ptError, 0x24), 0x18)
mstore(add(ptError, 0x44), "inputs are bigger than r")
revert(ptError, 0x64)
}
/// Called when the size proof is not as expected
/// @dev to avoid overflow attack for instance
function error_proof_size() {
let ptError := mload(0x40)
mstore(ptError, ERROR_STRING_ID) // selector for function Error(string)
mstore(add(ptError, 0x4), 0x20)
mstore(add(ptError, 0x24), 0x10)
mstore(add(ptError, 0x44), "wrong proof size")
revert(ptError, 0x64)
}
/// Called when one the openings is bigger than r
/// The openings are the claimed evalutions of a polynomial
/// in a Kzg proof.
function error_proof_openings_size() {
let ptError := mload(0x40)
mstore(ptError, ERROR_STRING_ID) // selector for function Error(string)
mstore(add(ptError, 0x4), 0x20)
mstore(add(ptError, 0x24), 0x16)
mstore(add(ptError, 0x44), "openings bigger than r")
revert(ptError, 0x64)
}
function error_verify() {
let ptError := mload(0x40)
mstore(ptError, ERROR_STRING_ID) // selector for function Error(string)
mstore(add(ptError, 0x4), 0x20)
mstore(add(ptError, 0x24), 0xc)
mstore(add(ptError, 0x44), "error verify")
revert(ptError, 0x64)
}
function error_random_generation() {
let ptError := mload(0x40)
mstore(ptError, ERROR_STRING_ID) // selector for function Error(string)
mstore(add(ptError, 0x4), 0x20)
mstore(add(ptError, 0x24), 0x14)
mstore(add(ptError, 0x44), "error random gen kzg")
revert(ptError, 0x64)
}
// end errors -------------------------------------------------
// Beginning checks -------------------------------------------------
/// @param s actual number of public inputs
function check_number_of_public_inputs(s) {
if iszero(eq(s, VK_NB_PUBLIC_INPUTS)) {
error_nb_public_inputs()
}
}
/// Checks that the public inputs are < R_MOD.
/// @param s number of public inputs
/// @param p pointer to the public inputs array
function check_inputs_size(s, p) {
let input_checks := 1
for {let i} lt(i, s) {i:=add(i,1)}
{
input_checks := and(input_checks,lt(calldataload(p), R_MOD))
p := add(p, 0x20)
}
if iszero(input_checks) {
error_inputs_size()
}
}
/// Checks if the proof is of the correct size
/// @param actual_proof_size size of the proof (not the expected size)
function check_proof_size(actual_proof_size) {
let expected_proof_size := add(0x340, mul(VK_NB_CUSTOM_GATES,0x60))
if iszero(eq(actual_proof_size, expected_proof_size)) {
error_proof_size()
}
}
/// Checks if the multiple openings of the polynomials are < R_MOD.
/// @param aproof pointer to the beginning of the proof
/// @dev the 'a' prepending proof is to have a local name
function check_proof_openings_size(aproof) {
let openings_check := 1
// linearised polynomial at zeta
let p := add(aproof, PROOF_LINEARISED_POLYNOMIAL_AT_ZETA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// quotient polynomial at zeta
p := add(aproof, PROOF_QUOTIENT_POLYNOMIAL_AT_ZETA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// PROOF_L_AT_ZETA
p := add(aproof, PROOF_L_AT_ZETA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// PROOF_R_AT_ZETA
p := add(aproof, PROOF_R_AT_ZETA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// PROOF_O_AT_ZETA
p := add(aproof, PROOF_O_AT_ZETA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// PROOF_S1_AT_ZETA
p := add(aproof, PROOF_S1_AT_ZETA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// PROOF_S2_AT_ZETA
p := add(aproof, PROOF_S2_AT_ZETA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// PROOF_GRAND_PRODUCT_AT_ZETA_OMEGA
p := add(aproof, PROOF_GRAND_PRODUCT_AT_ZETA_OMEGA)
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
// PROOF_OPENING_QCP_AT_ZETA
p := add(aproof, PROOF_OPENING_QCP_AT_ZETA)
for {let i:=0} lt(i, VK_NB_CUSTOM_GATES) {i:=add(i,1)}
{
openings_check := and(openings_check, lt(calldataload(p), R_MOD))
p := add(p, 0x20)
}
if iszero(openings_check) {
error_proof_openings_size()
}
}
// end checks -------------------------------------------------
// Beginning challenges -------------------------------------------------
/// Derive gamma as Sha256(<transcript>)
/// @param aproof pointer to the proof
/// @param nb_pi number of public inputs
/// @param pi pointer to the array of public inputs
/// @return the challenge gamma, not reduced
/// @notice The transcript is the concatenation (in this order) of:
/// * the word "gamma" in ascii, equal to [0x67,0x61,0x6d, 0x6d, 0x61] and encoded as a uint256.
/// * the commitments to the permutation polynomials S1, S2, S3, where we concatenate the coordinates of those points
/// * the commitments of Ql, Qr, Qm, Qo, Qk
/// * the public inputs
/// * the commitments of the wires related to the custom gates (commitments_wires_commit_api)
/// * commitments to L, R, O (proof_<l,r,o>_com_<x,y>)
/// The data described above is written starting at mPtr. "gamma" lies on 5 bytes,
/// and is encoded as a uint256 number n. In basis b = 256, the number looks like this
/// [0 0 0 .. 0x67 0x61 0x6d, 0x6d, 0x61]. The first non zero entry is at position 27=0x1b
/// Gamma reduced (the actual challenge) is stored at add(state, state_gamma)
function derive_gamma(aproof, nb_pi, pi)->gamma_not_reduced {
let state := mload(0x40)
let mPtr := add(state, STATE_LAST_MEM)
// gamma
// gamma in ascii is [0x67,0x61,0x6d, 0x6d, 0x61]
// (same for alpha, beta, zeta)
mstore(mPtr, 0x67616d6d61) // "gamma"
mstore(add(mPtr, 0x20), VK_S1_COM_X)
mstore(add(mPtr, 0x40), VK_S1_COM_Y)
mstore(add(mPtr, 0x60), VK_S2_COM_X)
mstore(add(mPtr, 0x80), VK_S2_COM_Y)
mstore(add(mPtr, 0xa0), VK_S3_COM_X)
mstore(add(mPtr, 0xc0), VK_S3_COM_Y)
mstore(add(mPtr, 0xe0), VK_QL_COM_X)
mstore(add(mPtr, 0x100), VK_QL_COM_Y)
mstore(add(mPtr, 0x120), VK_QR_COM_X)
mstore(add(mPtr, 0x140), VK_QR_COM_Y)
mstore(add(mPtr, 0x160), VK_QM_COM_X)
mstore(add(mPtr, 0x180), VK_QM_COM_Y)
mstore(add(mPtr, 0x1a0), VK_QO_COM_X)
mstore(add(mPtr, 0x1c0), VK_QO_COM_Y)
mstore(add(mPtr, 0x1e0), VK_QK_COM_X)
mstore(add(mPtr, 0x200), VK_QK_COM_Y)
// public inputs
let _mPtr := add(mPtr, 0x220)
let size_pi_in_bytes := mul(nb_pi, 0x20)
calldatacopy(_mPtr, pi, size_pi_in_bytes)
_mPtr := add(_mPtr, size_pi_in_bytes)
// commitments to l, r, o
let size_commitments_lro_in_bytes := 0xc0
calldatacopy(_mPtr, aproof, size_commitments_lro_in_bytes)
_mPtr := add(_mPtr, size_commitments_lro_in_bytes)
// total size is :
// sizegamma(=0x5) + 11*64(=0x2c0)
// + nb_public_inputs*0x20
// + nb_custom gates*0x40
let size := add(0x2c5, size_pi_in_bytes)
let l_success := staticcall(gas(), 0x2, add(mPtr, 0x1b), size, mPtr, 0x20) //0x1b -> 000.."gamma"
if iszero(l_success) {
error_verify()
}
gamma_not_reduced := mload(mPtr)
mstore(add(state, STATE_GAMMA), mod(gamma_not_reduced, R_MOD))
}
/// derive beta as Sha256<transcript>
/// @param gamma_not_reduced the previous challenge (gamma) not reduced
/// @return beta_not_reduced the next challenge, beta, not reduced
/// @notice the transcript consists of the previous challenge only.
/// The reduced version of beta is stored at add(state, state_beta)
function derive_beta(gamma_not_reduced)->beta_not_reduced{
let state := mload(0x40)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
// beta
mstore(mPtr, 0x62657461) // "beta"
mstore(add(mPtr, 0x20), gamma_not_reduced)
let l_success := staticcall(gas(), 0x2, add(mPtr, 0x1c), 0x24, mPtr, 0x20) //0x1b -> 000.."gamma"
if iszero(l_success) {
error_verify()
}
beta_not_reduced := mload(mPtr)
mstore(add(state, STATE_BETA), mod(beta_not_reduced, R_MOD))
}
/// derive alpha as sha256<transcript>
/// @param aproof pointer to the proof object
/// @param beta_not_reduced the previous challenge (beta) not reduced
/// @return alpha_not_reduced the next challenge, alpha, not reduced
/// @notice the transcript consists of the previous challenge (beta)
/// not reduced, the commitments to the wires associated to the QCP_i,
/// and the commitment to the grand product polynomial
function derive_alpha(aproof, beta_not_reduced)->alpha_not_reduced {
let state := mload(0x40)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
let full_size := 0x65 // size("alpha") + 0x20 (previous challenge)
// alpha
mstore(mPtr, 0x616C706861) // "alpha"
let _mPtr := add(mPtr, 0x20)
mstore(_mPtr, beta_not_reduced)
_mPtr := add(_mPtr, 0x20)
// [Z], the commitment to the grand product polynomial
calldatacopy(_mPtr, add(aproof, PROOF_GRAND_PRODUCT_COMMITMENT_X), 0x40)
let l_success := staticcall(gas(), 0x2, add(mPtr, 0x1b), full_size, mPtr, 0x20)
if iszero(l_success) {
error_verify()
}
alpha_not_reduced := mload(mPtr)
mstore(add(state, STATE_ALPHA), mod(alpha_not_reduced, R_MOD))
}
/// derive zeta as sha256<transcript>
/// @param aproof pointer to the proof object
/// @param alpha_not_reduced the previous challenge (alpha) not reduced
/// The transcript consists of the previous challenge and the commitment to
/// the quotient polynomial h.
function derive_zeta(aproof, alpha_not_reduced) {
let state := mload(0x40)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
// zeta
mstore(mPtr, 0x7a657461) // "zeta"
mstore(add(mPtr, 0x20), alpha_not_reduced)
calldatacopy(add(mPtr, 0x40), add(aproof, PROOF_H_0_X), 0xc0)
let l_success := staticcall(gas(), 0x2, add(mPtr, 0x1c), 0xe4, mPtr, 0x20)
if iszero(l_success) {
error_verify()
}
let zeta_not_reduced := mload(mPtr)
mstore(add(state, STATE_ZETA), mod(zeta_not_reduced, R_MOD))
}
// END challenges -------------------------------------------------
// BEGINNING compute_pi -------------------------------------------------
/// sum_pi_wo_api_commit computes the public inputs contributions,
/// except for the public inputs coming from the custom gate
/// @param ins pointer to the public inputs
/// @param n number of public inputs
/// @param mPtr free memory
/// @return pi_wo_commit public inputs contribution (except the public inputs coming from the custom gate)
function sum_pi_wo_api_commit(ins, n, mPtr)->pi_wo_commit {
let state := mload(0x40)
let z := mload(add(state, STATE_ZETA))
let zpnmo := mload(add(state, STATE_ZETA_POWER_N_MINUS_ONE))
let li := mPtr
batch_compute_lagranges_at_z(z, zpnmo, n, li)
let tmp := 0
for {let i:=0} lt(i,n) {i:=add(i,1)}
{
tmp := mulmod(mload(li), calldataload(ins), R_MOD)
pi_wo_commit := addmod(pi_wo_commit, tmp, R_MOD)
li := add(li, 0x20)
ins := add(ins, 0x20)
}
}
/// batch_compute_lagranges_at_z computes [L_0(z), .., L_{n-1}(z)]
/// @param z point at which the Lagranges are evaluated
/// @param zpnmo ζⁿ-1
/// @param n number of public inputs (number of Lagranges to compute)
/// @param mPtr pointer to which the results are stored
function batch_compute_lagranges_at_z(z, zpnmo, n, mPtr) {
let zn := mulmod(zpnmo, VK_INV_DOMAIN_SIZE, R_MOD) // 1/n * (ζⁿ - 1)
let _w := 1
let _mPtr := mPtr
for {let i:=0} lt(i,n) {i:=add(i,1)}
{
mstore(_mPtr, addmod(z,sub(R_MOD, _w), R_MOD))
_w := mulmod(_w, VK_OMEGA, R_MOD)
_mPtr := add(_mPtr, 0x20)
}
batch_invert(mPtr, n, _mPtr)
_mPtr := mPtr
_w := 1
for {let i:=0} lt(i,n) {i:=add(i,1)}
{
mstore(_mPtr, mulmod(mulmod(mload(_mPtr), zn , R_MOD), _w, R_MOD))
_mPtr := add(_mPtr, 0x20)
_w := mulmod(_w, VK_OMEGA, R_MOD)
}
}
/// @notice Montgomery trick for batch inversion mod R_MOD
/// @param ins pointer to the data to batch invert
/// @param number of elements to batch invert
/// @param mPtr free memory
function batch_invert(ins, nb_ins, mPtr) {
mstore(mPtr, 1)
let offset := 0
for {let i:=0} lt(i, nb_ins) {i:=add(i,1)}
{
let prev := mload(add(mPtr, offset))
let cur := mload(add(ins, offset))
cur := mulmod(prev, cur, R_MOD)
offset := add(offset, 0x20)
mstore(add(mPtr, offset), cur)
}
ins := add(ins, sub(offset, 0x20))
mPtr := add(mPtr, offset)
let inv := pow(mload(mPtr), sub(R_MOD,2), add(mPtr, 0x20))
for {let i:=0} lt(i, nb_ins) {i:=add(i,1)}
{
mPtr := sub(mPtr, 0x20)
let tmp := mload(ins)
let cur := mulmod(inv, mload(mPtr), R_MOD)
mstore(ins, cur)
inv := mulmod(inv, tmp, R_MOD)
ins := sub(ins, 0x20)
}
}
// END compute_pi -------------------------------------------------
/// @notice compute α² * 1/n * (ζ{n}-1)/(ζ - 1) where
/// * α = challenge derived in derive_gamma_beta_alpha_zeta
/// * n = vk_domain_size
/// * ω = vk_omega (generator of the multiplicative cyclic group of order n in (ℤ/rℤ)*)
/// * ζ = zeta (challenge derived with Fiat Shamir)
function compute_alpha_square_lagrange_0() {
let state := mload(0x40)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
let res := mload(add(state, STATE_ZETA_POWER_N_MINUS_ONE))
let den := addmod(mload(add(state, STATE_ZETA)), sub(R_MOD, 1), R_MOD)
den := pow(den, sub(R_MOD, 2), mPtr)
den := mulmod(den, VK_INV_DOMAIN_SIZE, R_MOD)
res := mulmod(den, res, R_MOD)
let l_alpha := mload(add(state, STATE_ALPHA))
res := mulmod(res, l_alpha, R_MOD)
res := mulmod(res, l_alpha, R_MOD)
mstore(add(state, STATE_ALPHA_SQUARE_LAGRANGE_0), res)
}
/// @notice follows alg. p.13 of https://eprint.iacr.org/2019/953.pdf
/// with t₁ = t₂ = 1, and the proofs are ([digest] + [quotient] +purported evaluation):
/// * [state_folded_state_digests], [proof_batch_opening_at_zeta_x], state_folded_evals
/// * [proof_grand_product_commitment], [proof_opening_at_zeta_omega_x], [proof_grand_product_at_zeta_omega]
/// @param aproof pointer to the proof
function batch_verify_multi_points(aproof) {
let state := mload(0x40)
let mPtr := add(state, STATE_LAST_MEM)
// derive a random number. As there is no random generator, we
// do an FS like challenge derivation, depending on both digests and
// ζ to ensure that the prover cannot control the random numger.
// Note: adding the other point ζω is not needed, as ω is known beforehand.
mstore(mPtr, mload(add(state, STATE_FOLDED_DIGESTS_X)))
mstore(add(mPtr, 0x20), mload(add(state, STATE_FOLDED_DIGESTS_Y)))
mstore(add(mPtr, 0x40), calldataload(add(aproof, PROOF_BATCH_OPENING_AT_ZETA_X)))
mstore(add(mPtr, 0x60), calldataload(add(aproof, PROOF_BATCH_OPENING_AT_ZETA_Y)))
mstore(add(mPtr, 0x80), calldataload(add(aproof, PROOF_GRAND_PRODUCT_COMMITMENT_X)))
mstore(add(mPtr, 0xa0), calldataload(add(aproof, PROOF_GRAND_PRODUCT_COMMITMENT_Y)))
mstore(add(mPtr, 0xc0), calldataload(add(aproof, PROOF_OPENING_AT_ZETA_OMEGA_X)))
mstore(add(mPtr, 0xe0), calldataload(add(aproof, PROOF_OPENING_AT_ZETA_OMEGA_Y)))
mstore(add(mPtr, 0x100), mload(add(state, STATE_ZETA)))
mstore(add(mPtr, 0x120), mload(add(state, STATE_GAMMA_KZG)))
let random := staticcall(gas(), 0x2, mPtr, 0x140, mPtr, 0x20)
if iszero(random){
error_random_generation()
}
random := mod(mload(mPtr), R_MOD) // use the same variable as we are one variable away from getting stack-too-deep error...
let folded_quotients := mPtr
mPtr := add(folded_quotients, 0x40)
mstore(folded_quotients, calldataload(add(aproof, PROOF_BATCH_OPENING_AT_ZETA_X)))
mstore(add(folded_quotients, 0x20), calldataload(add(aproof, PROOF_BATCH_OPENING_AT_ZETA_Y)))
point_acc_mul_calldata(folded_quotients, add(aproof, PROOF_OPENING_AT_ZETA_OMEGA_X), random, mPtr)
let folded_digests := add(state, STATE_FOLDED_DIGESTS_X)
point_acc_mul_calldata(folded_digests, add(aproof, PROOF_GRAND_PRODUCT_COMMITMENT_X), random, mPtr)
let folded_evals := add(state, STATE_FOLDED_CLAIMED_VALUES)
fr_acc_mul_calldata(folded_evals, add(aproof, PROOF_GRAND_PRODUCT_AT_ZETA_OMEGA), random)
let folded_evals_commit := mPtr
mPtr := add(folded_evals_commit, 0x40)
mstore(folded_evals_commit, G1_SRS_X)
mstore(add(folded_evals_commit, 0x20), G1_SRS_Y)
mstore(add(folded_evals_commit, 0x40), mload(folded_evals))
let check_staticcall := staticcall(gas(), 7, folded_evals_commit, 0x60, folded_evals_commit, 0x40)
if iszero(check_staticcall) {
error_verify()
}
let folded_evals_commit_y := add(folded_evals_commit, 0x20)
mstore(folded_evals_commit_y, sub(P_MOD, mload(folded_evals_commit_y)))
point_add(folded_digests, folded_digests, folded_evals_commit, mPtr)
let folded_points_quotients := mPtr
mPtr := add(mPtr, 0x40)
point_mul_calldata(
folded_points_quotients,
add(aproof, PROOF_BATCH_OPENING_AT_ZETA_X),
mload(add(state, STATE_ZETA)),
mPtr
)
let zeta_omega := mulmod(mload(add(state, STATE_ZETA)), VK_OMEGA, R_MOD)
random := mulmod(random, zeta_omega, R_MOD)
point_acc_mul_calldata(folded_points_quotients, add(aproof, PROOF_OPENING_AT_ZETA_OMEGA_X), random, mPtr)
point_add(folded_digests, folded_digests, folded_points_quotients, mPtr)
let folded_quotients_y := add(folded_quotients, 0x20)
mstore(folded_quotients_y, sub(P_MOD, mload(folded_quotients_y)))
mstore(mPtr, mload(folded_digests))
mstore(add(mPtr, 0x20), mload(add(folded_digests, 0x20)))
mstore(add(mPtr, 0x40), G2_SRS_0_X_0) // the 4 lines are the canonical G2 point on BN254
mstore(add(mPtr, 0x60), G2_SRS_0_X_1)
mstore(add(mPtr, 0x80), G2_SRS_0_Y_0)
mstore(add(mPtr, 0xa0), G2_SRS_0_Y_1)
mstore(add(mPtr, 0xc0), mload(folded_quotients))
mstore(add(mPtr, 0xe0), mload(add(folded_quotients, 0x20)))
mstore(add(mPtr, 0x100), G2_SRS_1_X_0)
mstore(add(mPtr, 0x120), G2_SRS_1_X_1)
mstore(add(mPtr, 0x140), G2_SRS_1_Y_0)
mstore(add(mPtr, 0x160), G2_SRS_1_Y_1)
check_pairing_kzg(mPtr)
}
/// @notice check_pairing_kzg checks the result of the final pairing product of the batched
/// kzg verification. The purpose of this function is to avoid exhausting the stack
/// in the function batch_verify_multi_points.
/// @param mPtr pointer storing the tuple of pairs
function check_pairing_kzg(mPtr) {
let state := mload(0x40)
// TODO test the staticcall using the method from audit_4-5
let l_success := staticcall(gas(), 8, mPtr, 0x180, 0x00, 0x20)
let res_pairing := mload(0x00)
let s_success := mload(add(state, STATE_SUCCESS))
res_pairing := and(and(res_pairing, l_success), s_success)
mstore(add(state, STATE_SUCCESS), res_pairing)
}
/// @notice Fold the opening proofs at ζ:
/// * at state+state_folded_digest we store: [H] + γ[Linearised_polynomial]+γ²[L] + γ³[R] + γ⁴[O] + γ⁵[S₁] +γ⁶[S₂] + ∑ᵢγ⁶⁺ⁱ[Pi_{i}]
/// * at state+state_folded_claimed_values we store: H(ζ) + γLinearised_polynomial(ζ)+γ²L(ζ) + γ³R(ζ)+ γ⁴O(ζ) + γ⁵S₁(ζ) +γ⁶S₂(ζ) + ∑ᵢγ⁶⁺ⁱPi_{i}(ζ)
/// @param aproof pointer to the proof
/// acc_gamma stores the γⁱ
function fold_state(aproof) {
let state := mload(0x40)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
let mPtr20 := add(mPtr, 0x20)
let mPtr40 := add(mPtr, 0x40)
let l_gamma_kzg := mload(add(state, STATE_GAMMA_KZG))
let acc_gamma := l_gamma_kzg
let state_folded_digests := add(state, STATE_FOLDED_DIGESTS_X)
mstore(add(state, STATE_FOLDED_DIGESTS_X), mload(add(state, STATE_FOLDED_H_X)))
mstore(add(state, STATE_FOLDED_DIGESTS_Y), mload(add(state, STATE_FOLDED_H_Y)))
mstore(add(state, STATE_FOLDED_CLAIMED_VALUES), calldataload(add(aproof, PROOF_QUOTIENT_POLYNOMIAL_AT_ZETA)))
point_acc_mul(state_folded_digests, add(state, STATE_LINEARISED_POLYNOMIAL_X), acc_gamma, mPtr)
fr_acc_mul_calldata(add(state, STATE_FOLDED_CLAIMED_VALUES), add(aproof, PROOF_LINEARISED_POLYNOMIAL_AT_ZETA), acc_gamma)
acc_gamma := mulmod(acc_gamma, l_gamma_kzg, R_MOD)
point_acc_mul_calldata(add(state, STATE_FOLDED_DIGESTS_X), add(aproof, PROOF_L_COM_X), acc_gamma, mPtr)
fr_acc_mul_calldata(add(state, STATE_FOLDED_CLAIMED_VALUES), add(aproof, PROOF_L_AT_ZETA), acc_gamma)
acc_gamma := mulmod(acc_gamma, l_gamma_kzg, R_MOD)
point_acc_mul_calldata(state_folded_digests, add(aproof, PROOF_R_COM_X), acc_gamma, mPtr)
fr_acc_mul_calldata(add(state, STATE_FOLDED_CLAIMED_VALUES), add(aproof, PROOF_R_AT_ZETA), acc_gamma)
acc_gamma := mulmod(acc_gamma, l_gamma_kzg, R_MOD)
point_acc_mul_calldata(state_folded_digests, add(aproof, PROOF_O_COM_X), acc_gamma, mPtr)
fr_acc_mul_calldata(add(state, STATE_FOLDED_CLAIMED_VALUES), add(aproof, PROOF_O_AT_ZETA), acc_gamma)
acc_gamma := mulmod(acc_gamma, l_gamma_kzg, R_MOD)
mstore(mPtr, VK_S1_COM_X)
mstore(mPtr20, VK_S1_COM_Y)
point_acc_mul(state_folded_digests, mPtr, acc_gamma, mPtr40)
fr_acc_mul_calldata(add(state, STATE_FOLDED_CLAIMED_VALUES), add(aproof, PROOF_S1_AT_ZETA), acc_gamma)
acc_gamma := mulmod(acc_gamma, l_gamma_kzg, R_MOD)
mstore(mPtr, VK_S2_COM_X)
mstore(mPtr20, VK_S2_COM_Y)
point_acc_mul(state_folded_digests, mPtr, acc_gamma, mPtr40)
fr_acc_mul_calldata(add(state, STATE_FOLDED_CLAIMED_VALUES), add(aproof, PROOF_S2_AT_ZETA), acc_gamma)
}
/// @notice generate the challenge (using Fiat Shamir) to fold the opening proofs
/// at ζ.
/// The process for deriving γ is the same as in derive_gamma but this time the inputs are
/// in this order (the [] means it's a commitment):
/// * ζ
/// * [H] ( = H₁ + ζᵐ⁺²*H₂ + ζ²⁽ᵐ⁺²⁾*H₃ )
/// * [Linearised polynomial]
/// * [L], [R], [O]
/// * [S₁] [S₂]
/// * [Pi_{i}] (wires associated to custom gates)
/// Then there are the purported evaluations of the previous committed polynomials:
/// * H(ζ)
/// * Linearised_polynomial(ζ)
/// * L(ζ), R(ζ), O(ζ), S₁(ζ), S₂(ζ)
/// * Pi_{i}(ζ)
/// * Z(ζω)
/// @param aproof pointer to the proof
function compute_gamma_kzg(aproof) {
let state := mload(0x40)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
mstore(mPtr, 0x67616d6d61) // "gamma"
mstore(add(mPtr, 0x20), mload(add(state, STATE_ZETA)))
mstore(add(mPtr,0x40), mload(add(state, STATE_FOLDED_H_X)))
mstore(add(mPtr,0x60), mload(add(state, STATE_FOLDED_H_Y)))
mstore(add(mPtr,0x80), mload(add(state, STATE_LINEARISED_POLYNOMIAL_X)))
mstore(add(mPtr,0xa0), mload(add(state, STATE_LINEARISED_POLYNOMIAL_Y)))
calldatacopy(add(mPtr, 0xc0), add(aproof, PROOF_L_COM_X), 0xc0)
mstore(add(mPtr,0x180), VK_S1_COM_X)
mstore(add(mPtr,0x1a0), VK_S1_COM_Y)
mstore(add(mPtr,0x1c0), VK_S2_COM_X)
mstore(add(mPtr,0x1e0), VK_S2_COM_Y)
let offset := 0x200
mstore(add(mPtr, offset), calldataload(add(aproof, PROOF_QUOTIENT_POLYNOMIAL_AT_ZETA)))
mstore(add(mPtr, add(offset, 0x20)), calldataload(add(aproof, PROOF_LINEARISED_POLYNOMIAL_AT_ZETA)))
mstore(add(mPtr, add(offset, 0x40)), calldataload(add(aproof, PROOF_L_AT_ZETA)))
mstore(add(mPtr, add(offset, 0x60)), calldataload(add(aproof, PROOF_R_AT_ZETA)))
mstore(add(mPtr, add(offset, 0x80)), calldataload(add(aproof, PROOF_O_AT_ZETA)))
mstore(add(mPtr, add(offset, 0xa0)), calldataload(add(aproof, PROOF_S1_AT_ZETA)))
mstore(add(mPtr, add(offset, 0xc0)), calldataload(add(aproof, PROOF_S2_AT_ZETA)))
let _mPtr := add(mPtr, add(offset, 0xe0))
mstore(_mPtr, calldataload(add(aproof, PROOF_GRAND_PRODUCT_AT_ZETA_OMEGA)))
let start_input := 0x1b // 00.."gamma"
let size_input := add(0x17, mul(VK_NB_CUSTOM_GATES,3)) // number of 32bytes elmts = 0x17 (zeta+2*7+7 for the digests+openings) + 2*VK_NB_CUSTOM_GATES (for the commitments of the selectors) + VK_NB_CUSTOM_GATES (for the openings of the selectors)
size_input := add(0x5, mul(size_input, 0x20)) // size in bytes: 15*32 bytes + 5 bytes for gamma
let check_staticcall := staticcall(gas(), 0x2, add(mPtr,start_input), size_input, add(state, STATE_GAMMA_KZG), 0x20)
if iszero(check_staticcall) {
error_verify()
}
mstore(add(state, STATE_GAMMA_KZG), mod(mload(add(state, STATE_GAMMA_KZG)), R_MOD))
}
function compute_commitment_linearised_polynomial_ec(aproof, s1, s2) {
let state := mload(0x40)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
mstore(mPtr, VK_QL_COM_X)
mstore(add(mPtr, 0x20), VK_QL_COM_Y)
point_mul(
add(state, STATE_LINEARISED_POLYNOMIAL_X),
mPtr,
calldataload(add(aproof, PROOF_L_AT_ZETA)),
add(mPtr, 0x40)
)
mstore(mPtr, VK_QR_COM_X)
mstore(add(mPtr, 0x20), VK_QR_COM_Y)
point_acc_mul(
add(state, STATE_LINEARISED_POLYNOMIAL_X),
mPtr,
calldataload(add(aproof, PROOF_R_AT_ZETA)),
add(mPtr, 0x40)
)
let rl := mulmod(calldataload(add(aproof, PROOF_L_AT_ZETA)), calldataload(add(aproof, PROOF_R_AT_ZETA)), R_MOD)
mstore(mPtr, VK_QM_COM_X)
mstore(add(mPtr, 0x20), VK_QM_COM_Y)
point_acc_mul(add(state, STATE_LINEARISED_POLYNOMIAL_X), mPtr, rl, add(mPtr, 0x40))
mstore(mPtr, VK_QO_COM_X)
mstore(add(mPtr, 0x20), VK_QO_COM_Y)
point_acc_mul(
add(state, STATE_LINEARISED_POLYNOMIAL_X),
mPtr,
calldataload(add(aproof, PROOF_O_AT_ZETA)),
add(mPtr, 0x40)
)
mstore(mPtr, VK_QK_COM_X)
mstore(add(mPtr, 0x20), VK_QK_COM_Y)
point_add(
add(state, STATE_LINEARISED_POLYNOMIAL_X),
add(state, STATE_LINEARISED_POLYNOMIAL_X),
mPtr,
add(mPtr, 0x40)
)
let commits_api_at_zeta := add(aproof, PROOF_OPENING_QCP_AT_ZETA)
let commits_api := add(aproof, PROOF_COMMITMENTS_WIRES_CUSTOM_GATES)
for {
let i := 0
} lt(i, VK_NB_CUSTOM_GATES) {
i := add(i, 1)
} {
mstore(mPtr, calldataload(commits_api))
mstore(add(mPtr, 0x20), calldataload(add(commits_api, 0x20)))
point_acc_mul(
add(state, STATE_LINEARISED_POLYNOMIAL_X),
mPtr,
calldataload(commits_api_at_zeta),
add(mPtr, 0x40)
)
commits_api_at_zeta := add(commits_api_at_zeta, 0x20)
commits_api := add(commits_api, 0x40)
}
mstore(mPtr, VK_S3_COM_X)
mstore(add(mPtr, 0x20), VK_S3_COM_Y)
point_acc_mul(add(state, STATE_LINEARISED_POLYNOMIAL_X), mPtr, s1, add(mPtr, 0x40))
mstore(mPtr, calldataload(add(aproof, PROOF_GRAND_PRODUCT_COMMITMENT_X)))
mstore(add(mPtr, 0x20), calldataload(add(aproof, PROOF_GRAND_PRODUCT_COMMITMENT_Y)))
point_acc_mul(add(state, STATE_LINEARISED_POLYNOMIAL_X), mPtr, s2, add(mPtr, 0x40))
}
/// @notice Compute the commitment to the linearized polynomial equal to
/// L(ζ)[Qₗ]+r(ζ)[Qᵣ]+R(ζ)L(ζ)[Qₘ]+O(ζ)[Qₒ]+[Qₖ]+Σᵢqc'ᵢ(ζ)[BsbCommitmentᵢ] +
/// α*( Z(μζ)(L(ζ)+β*S₁(ζ)+γ)*(R(ζ)+β*S₂(ζ)+γ)[S₃]-[Z](L(ζ)+β*id_{1}(ζ)+γ)*(R(ζ)+β*id_{2(ζ)+γ)*(O(ζ)+β*id_{3}(ζ)+γ) ) +
/// α²*L₁(ζ)[Z]
/// where
/// * id_1 = id, id_2 = vk_coset_shift*id, id_3 = vk_coset_shift^{2}*id
/// * the [] means that it's a commitment (i.e. a point on Bn254(F_p))
/// @param aproof pointer to the proof
function compute_commitment_linearised_polynomial(aproof) {
let state := mload(0x40)
let l_beta := mload(add(state, STATE_BETA))
let l_gamma := mload(add(state, STATE_GAMMA))
let l_zeta := mload(add(state, STATE_ZETA))
let l_alpha := mload(add(state, STATE_ALPHA))
let u := mulmod(calldataload(add(aproof, PROOF_GRAND_PRODUCT_AT_ZETA_OMEGA)), l_beta, R_MOD)
let v := mulmod(l_beta, calldataload(add(aproof, PROOF_S1_AT_ZETA)), R_MOD)
v := addmod(v, calldataload(add(aproof, PROOF_L_AT_ZETA)), R_MOD)
v := addmod(v, l_gamma, R_MOD)
let w := mulmod(l_beta, calldataload(add(aproof, PROOF_S2_AT_ZETA)), R_MOD)
w := addmod(w, calldataload(add(aproof, PROOF_R_AT_ZETA)), R_MOD)
w := addmod(w, l_gamma, R_MOD)
let s1 := mulmod(u, v, R_MOD)
s1 := mulmod(s1, w, R_MOD)
s1 := mulmod(s1, l_alpha, R_MOD)
let coset_square := mulmod(VK_COSET_SHIFT, VK_COSET_SHIFT, R_MOD)
let betazeta := mulmod(l_beta, l_zeta, R_MOD)
u := addmod(betazeta, calldataload(add(aproof, PROOF_L_AT_ZETA)), R_MOD)
u := addmod(u, l_gamma, R_MOD)
v := mulmod(betazeta, VK_COSET_SHIFT, R_MOD)
v := addmod(v, calldataload(add(aproof, PROOF_R_AT_ZETA)), R_MOD)
v := addmod(v, l_gamma, R_MOD)
w := mulmod(betazeta, coset_square, R_MOD)
w := addmod(w, calldataload(add(aproof, PROOF_O_AT_ZETA)), R_MOD)
w := addmod(w, l_gamma, R_MOD)
let s2 := mulmod(u, v, R_MOD)
s2 := mulmod(s2, w, R_MOD)
s2 := sub(R_MOD, s2)
s2 := mulmod(s2, l_alpha, R_MOD)
s2 := addmod(s2, mload(add(state, STATE_ALPHA_SQUARE_LAGRANGE_0)), R_MOD)
// at this stage:
// * s₁ = α*Z(μζ)(l(ζ)+β*s₁(ζ)+γ)*(r(ζ)+β*s₂(ζ)+γ)*β
// * s₂ = -α*(l(ζ)+β*ζ+γ)*(r(ζ)+β*u*ζ+γ)*(o(ζ)+β*u²*ζ+γ) + α²*L₁(ζ)
compute_commitment_linearised_polynomial_ec(aproof, s1, s2)
}
/// @notice compute H₁ + ζᵐ⁺²*H₂ + ζ²⁽ᵐ⁺²⁾*H₃ and store the result at
/// state + state_folded_h
/// @param aproof pointer to the proof
function fold_h(aproof) {
let state := mload(0x40)
let n_plus_two := add(VK_DOMAIN_SIZE, 2)
let mPtr := add(mload(0x40), STATE_LAST_MEM)
let zeta_power_n_plus_two := pow(mload(add(state, STATE_ZETA)), n_plus_two, mPtr)
point_mul_calldata(add(state, STATE_FOLDED_H_X), add(aproof, PROOF_H_2_X), zeta_power_n_plus_two, mPtr)
point_add_calldata(add(state, STATE_FOLDED_H_X), add(state, STATE_FOLDED_H_X), add(aproof, PROOF_H_1_X), mPtr)
point_mul(add(state, STATE_FOLDED_H_X), add(state, STATE_FOLDED_H_X), zeta_power_n_plus_two, mPtr)
point_add_calldata(add(state, STATE_FOLDED_H_X), add(state, STATE_FOLDED_H_X), add(aproof, PROOF_H_0_X), mPtr)
}
/// @notice check that
/// L(ζ)Qₗ(ζ)+r(ζ)Qᵣ(ζ)+R(ζ)L(ζ)Qₘ(ζ)+O(ζ)Qₒ(ζ)+Qₖ(ζ)+Σᵢqc'ᵢ(ζ)BsbCommitmentᵢ(ζ) +
/// α*( Z(μζ)(l(ζ)+β*s₁(ζ)+γ)*(r(ζ)+β*s₂(ζ)+γ)*β*s₃(X)-Z(X)(l(ζ)+β*id_1(ζ)+γ)*(r(ζ)+β*id_2(ζ)+γ)*(o(ζ)+β*id_3(ζ)+γ) ) )
/// + α²*L₁(ζ) =
/// (ζⁿ-1)H(ζ)
/// @param aproof pointer to the proof
function verify_quotient_poly_eval_at_zeta(aproof) {
let state := mload(0x40)
// (l(ζ)+β*s1(ζ)+γ)
let s1 := add(mload(0x40), STATE_LAST_MEM)
mstore(s1, mulmod(calldataload(add(aproof, PROOF_S1_AT_ZETA)), mload(add(state, STATE_BETA)), R_MOD))
mstore(s1, addmod(mload(s1), mload(add(state, STATE_GAMMA)), R_MOD))
mstore(s1, addmod(mload(s1), calldataload(add(aproof, PROOF_L_AT_ZETA)), R_MOD))
// (r(ζ)+β*s2(ζ)+γ)
let s2 := add(s1, 0x20)
mstore(s2, mulmod(calldataload(add(aproof, PROOF_S2_AT_ZETA)), mload(add(state, STATE_BETA)), R_MOD))
mstore(s2, addmod(mload(s2), mload(add(state, STATE_GAMMA)), R_MOD))
mstore(s2, addmod(mload(s2), calldataload(add(aproof, PROOF_R_AT_ZETA)), R_MOD))
// _s2 := mload(s2)
// (o(ζ)+γ)
let o := add(s1, 0x40)
mstore(o, addmod(calldataload(add(aproof, PROOF_O_AT_ZETA)), mload(add(state, STATE_GAMMA)), R_MOD))
// α*(Z(μζ))*(l(ζ)+β*s1(ζ)+γ)*(r(ζ)+β*s2(ζ)+γ)*(o(ζ)+γ)
mstore(s1, mulmod(mload(s1), mload(s2), R_MOD))
mstore(s1, mulmod(mload(s1), mload(o), R_MOD))
mstore(s1, mulmod(mload(s1), mload(add(state, STATE_ALPHA)), R_MOD))
mstore(s1, mulmod(mload(s1), calldataload(add(aproof, PROOF_GRAND_PRODUCT_AT_ZETA_OMEGA)), R_MOD))
let computed_quotient := add(s1, 0x60)
// linearizedpolynomial + pi(zeta)
mstore(computed_quotient,addmod(calldataload(add(aproof, PROOF_LINEARISED_POLYNOMIAL_AT_ZETA)), mload(add(state, STATE_PI)), R_MOD))
mstore(computed_quotient, addmod(mload(computed_quotient), mload(s1), R_MOD))
mstore(computed_quotient,addmod(mload(computed_quotient), sub(R_MOD, mload(add(state, STATE_ALPHA_SQUARE_LAGRANGE_0))), R_MOD))
mstore(s2,mulmod(calldataload(add(aproof, PROOF_QUOTIENT_POLYNOMIAL_AT_ZETA)),mload(add(state, STATE_ZETA_POWER_N_MINUS_ONE)),R_MOD))
mstore(add(state, STATE_SUCCESS), eq(mload(computed_quotient), mload(s2)))
}
// BEGINNING utils math functions -------------------------------------------------
/// @param dst pointer storing the result
/// @param p pointer to the first point
/// @param q pointer to the second point
/// @param mPtr pointer to free memory
function point_add(dst, p, q, mPtr) {
let state := mload(0x40)
mstore(mPtr, mload(p))
mstore(add(mPtr, 0x20), mload(add(p, 0x20)))
mstore(add(mPtr, 0x40), mload(q))
mstore(add(mPtr, 0x60), mload(add(q, 0x20)))
let l_success := staticcall(gas(),6,mPtr,0x80,dst,0x40)
if iszero(l_success) {
error_ec_op()
}
}
/// @param dst pointer storing the result
/// @param p pointer to the first point (calldata)
/// @param q pointer to the second point (calladata)
/// @param mPtr pointer to free memory
function point_add_calldata(dst, p, q, mPtr) {
let state := mload(0x40)
mstore(mPtr, mload(p))
mstore(add(mPtr, 0x20), mload(add(p, 0x20)))
mstore(add(mPtr, 0x40), calldataload(q))
mstore(add(mPtr, 0x60), calldataload(add(q, 0x20)))
let l_success := staticcall(gas(), 6, mPtr, 0x80, dst, 0x40)
if iszero(l_success) {
error_ec_op()
}
}
/// @parma dst pointer storing the result
/// @param src pointer to a point on Bn254(𝔽_p)
/// @param s scalar
/// @param mPtr free memory
function point_mul(dst,src,s, mPtr) {
let state := mload(0x40)
mstore(mPtr,mload(src))
mstore(add(mPtr,0x20),mload(add(src,0x20)))
mstore(add(mPtr,0x40),s)
let l_success := staticcall(gas(),7,mPtr,0x60,dst,0x40)
if iszero(l_success) {
error_ec_op()
}
}
/// @parma dst pointer storing the result
/// @param src pointer to a point on Bn254(𝔽_p) on calldata
/// @param s scalar
/// @param mPtr free memory
function point_mul_calldata(dst, src, s, mPtr) {
let state := mload(0x40)
mstore(mPtr, calldataload(src))
mstore(add(mPtr, 0x20), calldataload(add(src, 0x20)))
mstore(add(mPtr, 0x40), s)
let l_success := staticcall(gas(), 7, mPtr, 0x60, dst, 0x40)
if iszero(l_success) {
error_ec_op()
}
}
/// @notice dst <- dst + [s]src (Elliptic curve)
/// @param dst pointer accumulator point storing the result
/// @param src pointer to the point to multiply and add
/// @param s scalar
/// @param mPtr free memory
function point_acc_mul(dst,src,s, mPtr) {
let state := mload(0x40)
mstore(mPtr,mload(src))
mstore(add(mPtr,0x20),mload(add(src,0x20)))
mstore(add(mPtr,0x40),s)
let l_success := staticcall(gas(),7,mPtr,0x60,mPtr,0x40)
mstore(add(mPtr,0x40),mload(dst))
mstore(add(mPtr,0x60),mload(add(dst,0x20)))
l_success := and(l_success, staticcall(gas(),6,mPtr,0x80,dst, 0x40))
if iszero(l_success) {
error_ec_op()
}
}
/// @notice dst <- dst + [s]src (Elliptic curve)
/// @param dst pointer accumulator point storing the result
/// @param src pointer to the point to multiply and add (on calldata)
/// @param s scalar
/// @mPtr free memory
function point_acc_mul_calldata(dst, src, s, mPtr) {
let state := mload(0x40)
mstore(mPtr, calldataload(src))
mstore(add(mPtr, 0x20), calldataload(add(src, 0x20)))
mstore(add(mPtr, 0x40), s)
let l_success := staticcall(gas(), 7, mPtr, 0x60, mPtr, 0x40)
mstore(add(mPtr, 0x40), mload(dst))
mstore(add(mPtr, 0x60), mload(add(dst, 0x20)))
l_success := and(l_success, staticcall(gas(), 6, mPtr, 0x80, dst, 0x40))
if iszero(l_success) {
error_ec_op()
}
}
/// @notice dst <- dst + src*s (Fr) dst,src are addresses, s is a value
/// @param dst pointer storing the result
/// @param src pointer to the scalar to multiply and add (on calldata)
/// @param s scalar
function fr_acc_mul_calldata(dst, src, s) {
let tmp := mulmod(calldataload(src), s, R_MOD)
mstore(dst, addmod(mload(dst), tmp, R_MOD))
}
/// @param x element to exponentiate
/// @param e exponent
/// @param mPtr free memory
/// @return res x ** e mod r
function pow(x, e, mPtr)->res {
mstore(mPtr, 0x20)
mstore(add(mPtr, 0x20), 0x20)
mstore(add(mPtr, 0x40), 0x20)
mstore(add(mPtr, 0x60), x)
mstore(add(mPtr, 0x80), e)
mstore(add(mPtr, 0xa0), R_MOD)
let check_staticcall := staticcall(gas(),0x05,mPtr,0xc0,mPtr,0x20)
if eq(check_staticcall, 0) {
error_verify()
}
res := mload(mPtr)
}
}
}
}
xermicus commented
Hi @readygo67
Thank you for raising this issue. Let me explain several reasons why this contract unfortunately won't work on the contracts pallet (the target runtime for solang compile --target polkadot).
Different memory model
Those instructions are very low level. They can't be fully supported in Solang because of the intrinsic differences between the underlying contract runtimes (EVM and pallet-contracts that is).
Even though Wasm has a linear memory, which is somewhat comparable with the linear memory in EVM, which would allow to use mnemonics like mstore and mload. It would break most existing contracts. Wasm contracts on pallet-contracts use that memory differently, datastructures exhibit different memory layouts and the data encoding is different too. This makes certain mnemonics, like the ones in your contract, incompatible with runtimes other than the EVM.
For example, looking at the first line of code in the plonk verifier you posted:
let mem := mload(0x40)
In the EVM, the "free memory pointer" is found in the linear memory at offset 0x40. This isn't the case on pallet-contracts and would break that code even if Solang would support mstore.
Different ABI encoding scheme
calldataload faces another problem: Contracts compiled for Solangs polkadot target use SCALE encoding, which is quite different to what they use for Solidity on EVM. Thus, even if Solang would support it, this would break nearly all existing contracts, because they assume EVM ABI encoding while on the contracts-pallet the call data will be SCALE encoded. For Solidity source code, the compiler can internally handle this, making it fully opaque, which is however not possible for assembly instructions like these.
Pre-compiled contracts vs chain extensions
Note that this code calls into precompiles not avaiable in a vanilla pallet-contracts runtime, for example to perform bn128 curve operations. The contracts pallet does not provide precompiles neither does it provide the functioniality of those precompiles out of the box. Instead, there are chain extensions that can be used by any polkadot parachain to implement such functionalities.
As an example of how this could look like, you can check out our tornado cash integration test.
It would also be thinkable to implement a whole plonk verifier directly in a chain extension, making it faster and the contract way simpler.
Conclusion
Contracts that heavily rely on intrinsic EVM functionality are inherently not portable. Trying to run or port such a contract on a Wasm contract runtime would be somewhat analogous to trying to get an x86 linux bianry to work on an ARM MacOS. Unfortunately, I don't think there is an easy way to re-use this plonk verifier contract without re-writing it first.