A Short Introduction to Zero Knowledge Proofs

This article provides an intuitive overview of zero-knowledge proofs and the PLONK proving system, covering how statements are represented as circuits, gate and copy (wire) constraints, and the permutation check used to verify copy constraints; it explains PLONK's universality and updatability and outlines use cases such as blockchain privacy, identity verification, SMPC, and privacy-preserving data sharing.