Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

verifier: Verifier: [Plonk step 11] Computed expected batch eval #24

Merged
merged 1 commit into from
Feb 13, 2025
Merged

verifier: Verifier: [Plonk step 11] Computed expected batch eval #24

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 31 additions & 1 deletion src/verifier/Verifier.sol
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -54,7 +54,8 @@ contract Verifier {
proof.z_bar
);
BN254.G1Point memory committedPoly = plonkStep9(lagrangeEval, challenges, proof, vk);
BN254.G1Point memory fullCommitment = plonkStep10(committedPoly, challenges, proof, vk);
BN254.G1Point memory batchCommitment = plonkStep10(committedPoly, challenges, proof, vk);
BN254.G1Point memory batchEval = plonkStep11(linearizationConstTerm, challenges, proof, vk);

// TODO: Check the proof
return true;
Expand Down Expand Up @@ -401,4 +402,33 @@ contract Verifier {

return res;
}

/// @notice Step 11 of the plonk verification algorithm
/// @dev Compute the batch evaluation to compare against the claimed openings
function plonkStep11(
BN254.ScalarField linearizationConstTerm,
Challenges memory challenges,
PlonkProof memory proof,
VerificationKey memory vk
) internal view returns (BN254.G1Point memory) {
BN254.ScalarField resCoeff = BN254.negate(linearizationConstTerm);
BN254.ScalarField termCoeff = challenges.v;
for (uint256 i = 0; i < NUM_WIRE_TYPES; i++) {
BN254.ScalarField term = BN254.mul(proof.wire_evals[i], termCoeff);
resCoeff = BN254.add(resCoeff, term);
termCoeff = BN254.mul(termCoeff, challenges.v);
}

for (uint256 i = 0; i < NUM_WIRE_TYPES - 1; i++) {
BN254.ScalarField term = BN254.mul(proof.sigma_evals[i], termCoeff);
resCoeff = BN254.add(resCoeff, term);
termCoeff = BN254.mul(termCoeff, challenges.v);
}

BN254.ScalarField lastTerm = BN254.mul(proof.z_bar, challenges.u);
resCoeff = BN254.add(resCoeff, lastTerm);

BN254.G1Point memory res = BN254.scalarMul(vk.g, resCoeff);
return res;
}
}
Loading