PlonKup: Reconciling PlonK with plookup

Luke Pearson; Joshua Fitzgerald; Héctor Masip; Marta Bellés-Muñoz; Jose Luis Muñoz-Tapia

Paper 2022/086 Original: eprint.iacr.org/2022/086 ↗

PlonKup: Reconciling PlonK with plookup

Luke Pearson

Joshua Fitzgerald

Héctor Masip

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, and exploits convenient interactions between multiplicative subgroups and Lagrange bases. The following year, Gabizon and Williamson used similar techniques to develop plookup – a ZK-SNARK that can verify that each element from a list of queries can be found in a public lookup table. In this paper, we present PlonKup, a fully succinct ZK-SNARK that integrates the ideas from plookup into PlonK in an efficient way.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2022-03-12: last updated; 2022-01-25: published
Short URL: https://ia.cr/2022/086
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2022/086,
      author = {Luke Pearson and Joshua Fitzgerald and Héctor Masip and Marta Bellés-Muñoz and Jose Luis Muñoz-Tapia},
      title = {PlonKup: Reconciling PlonK with plookup},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/086},
      year = {2022},
      url = {https://eprint.iacr.org/2022/086}
}