Latest zk-SNARK News

how-plonk-works-part-2-min
Tech 18 October 2022

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.

How PLONK Works
Tech 16 October 2022

How PLONK Works: Part 1

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.

[id^="_form"]
[id^="_form"]
[id$="_submit"]
[id$="_submit"]
[^;]
[^;]
[?&]
[?&]
[^&#]
[^&#]
[(d+)]
[(d+)]
[elem.name]
[elem.name]
[+_a-z0-9-'&=]
[+_a-z0-9-'&=]
[+_a-z0-9-']
[+_a-z0-9-']
[a-z0-9-]
[a-z0-9-]
[a-z]
[a-z]
[el.name]
[el.name]
[id^="_form"]
[id^="_form"]
[id$="_submit"]
[id$="_submit"]
[^;]
[^;]
[?&]
[?&]
[^&#]
[^&#]
[(d+)]
[(d+)]
[elem.name]
[elem.name]
[+_a-z0-9-'&=]
[+_a-z0-9-'&=]
[+_a-z0-9-']
[+_a-z0-9-']
[a-z0-9-]
[a-z0-9-]
[a-z]
[a-z]
[el.name]
[el.name]