Summary
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.
- This summary was also published on Metastate’s medium blog
- Full article on Metastate’s research blog.
More zero-knowledge cryptography articles from Metastate:
