The PLONK proof system can be used for blockchain applications such as compute compression & privacy which require a succinct zero-knowledge proof system. Plookup might make some operations even faster by replacing large gadgets for computing arithmetically complex operations with a pre-computed lookup table.
Both protocols are based on arguments that two sequences are related by a permutation, so demystifying both just made sense. This post covers the framework of both, without getting bogged down in details of how elliptic curve pairings work.
Full Article
Written by Nat Bunner, zero-knowledge cryptography researcher & protocol developer at Metastate. For feedback or questions, please do not hesitate to contact us : team@metastate.dev
