1
$\begingroup$

From the PLONK paper.

On page 29, in the prover algorithm round 3, we divide the quotient polynomial into three polynomials of degree < n. But when we add the blinding terms we add $X^n$.

Part of the equation in PLONK paper

The question is, how do we commit to this, if we only have n variables in the trusted setup?

$\endgroup$
0

1 Answer 1

0
$\begingroup$

Check the "Common preprocessed input:" in the Plonk Paper, page 27.

The SRS for a setup with $n$ gates has all the elements required to commit a polynomial of upto degree $n + 5$, so there is no problem to commit a polynomial of degree $n$.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.