Transparent SNARKs from DARK Compilers

Explore a 25-minute conference talk presented at Eurocrypt 2020 on Transparent SNARKs from DARK Compilers. Delve into the paper by Benedikt Bünz, Ben Fisch, and Alan Szepieniec, which covers general-purpose zero-knowledge proofs, compilation pipelines, and polynomial commitment schemes. Learn about evaluation protocols with special homomorphic commitments, groups of unknown order, and their associated hardness assumptions. Discover the applications of GUOs, integer encoding techniques, and the intricacies of polynomial IOP compilers. Examine the compiled polynomial IOP soundness, Supersonic constructions, and their performance. Gain insights into this cutting-edge cryptographic research and its potential implications for transparent SNARKs.