Transparent SNARKs from DARK Compilers

Transparent SNARKs from DARK Compilers

Explore a comprehensive lecture on transparent SNARKs derived from DARK compilers, delivered by Benedikt Bünz from Stanford University. Delve into the intricacies of probabilistically checkable and interactive proof systems, covering topics such as efficiency, security, polynomial IOPs, and cryptographic compilation. Learn about recent comparisons, interactive oracle proofs, and polynomial IOP compilation, including discussions on Sonic, Supersonic, and new polynomial commitment schemes. Examine concepts like integer encoding, Diophantine arguments of knowledge, and proof of exponentiation, while also exploring optimizations in class groups.