How PLONK works: Part 2
In the first part of "How PLONK works," sCrypt explained how to transform a computation to prove using PLONK into an intermediate constraint system; now, they covered the other type: copy constraints.
In the first part of "How PLONK works," sCrypt explained how to transform a computation to prove using PLONK into an intermediate constraint system; now, they covered the other type: copy constraints.
PLONK is a zk-SNARK proof system utilizing a trusted setup that is both universal and updatable, which can be initiated once and reused by all circuits.