Zero-Knowledge Proof Algorithm, PLONK—Protocol: Sin7Y Tech Review (17)
by Sin7YFebruary 17th, 2022 Too Long; Didn't Read
PLONK’s new paper has been published. The highest order in the common input has been changed from n+2 to n+5 because when calculating t(x), the highest order can reach (3n+5=3(n+1)+n+2-n). The best answer might be polynomial commitment. The best solution is the calculation process of the polynomials, which are interpolated by witnesses, which cannot be guaranteed to be large enough. The new paper has optimized the calculation process of the polynomial commitment CreateWitness (divided into a constant part and other parts), thereby simplifying the verification process. In this we have analyzed all the protocol principles of the PLONK algorithm