PLONK: Universal, Updatable SNARKs with Efficient Prover Performance

PLONK introduces a novel SNARK construction that significantly reduces prover overheads while maintaining universal and updatable trusted setups, enabling practical verifiable computation.
Unveiling Efficient Non-Interactive Zero-Knowledge Proofs Sans Trusted Setup

A non-interactive zero-knowledge proof system merges algebraic and circuit statements, eliminating trusted setup for enhanced privacy and verifiable computation.