PLONK
Overview
Universal zero-knowledge proof protocol. Gabizon redefined ZKP's Boolean gates as a "universal circuit"—any program can be automatically transformed (re-axiomatized) into ZKP. The foundation of a "logic compiler."
Era: 2019–
Proposed at: Israel / Europe
Formal structure
Domain: Universal circuit; polynomial commitment; permutation argument
Any computation → circuit → PLONK proof
Constraints: Universal setup or transparent; succinct verification
Objective: Automatic re-axiomatization of programs into ZKP