PlonKup: Reconciling PlonK with plookup
Jan 25, 2022·,
,,·
0 min read
Luke Pearson
Joshua Fitzgerald
Héctor Masip Ardevol
Marta Bellés Muñoz
Jose Luis Muñoz Tapia
Abstract
In 2019, Gabizon, Williamson, and Ciobotaru introduced PlonK – a fast and flexible ZK-SNARK with an updatable and universal structured reference string. PlonK uses a grand product argument to check permutations of wire values. The following year, Gabizon and Williamson developed plookup for lookup table verification. We present PlonKup, a fully succinct ZK-SNARK that integrates plookup into PlonK efficiently.
Type
Authors
Authors
Authors
Research Engineer
I build systems that prove computation without revealing secrets.
Currently developing ZisK, a high-performance zkVM.
My research lives at the intersection of probabilistic proofs, algebra, and cryptographic protocols.
Always looking for elegant solutions to hard problems.
Authors
Authors