Zero Knowledge cover image

Dive into Plonk!

Zero Knowledge

00:00

Polynomial Commitment Schemes and their Optimization

This chapter explores the different polynomial commitment schemes used in cryptographic systems like Snarks, Starks, and Planck. It discusses the optimizations made in these schemes, such as the development of bulletproofs and supersonic. The chapter also compares the properties of Planck to other systems, highlighting its faster proving times and smaller proof sizes.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app