Too Long; Didn't Read
We recently investigated the Zero-Knowledge proof algorithm-PLONK and this article has discusses two critical topics of PLONK, the circuit design and the verification process of the copy constraint.
Theoretically, the safest algorithm is STARKs, which does not rely on the assumption of mathematical problems. PLONK adopts the SRS concept of the concept of SONIC but dramatically improves the efficiency of the proof. The algorithm is designed between the two items above regarding security and Proof size. The different description methods of these two circuits have provided some reflection on the different circuit descriptions of SNARKs.