Zero Knowledge cover image

Episode 112: Dive into Plonk!

Zero Knowledge

Plonk Protocol: Le Grange Bases and Catek Commitment Scheme

18min Snip

00:00
Play full episode
This chapter explores the concepts of the Plonk protocol, including the use of Le Grange bases to encode polynomials and the Catek commitment scheme. It also explains the technique of using a multiplicative subgroup of points in Starks programs and the benefits of a sparse polynomial representation for efficient computation.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode