Reed-Saulman works over a very large field. So you have other efficient codes that work over small fields. Can we use them and maybe try to support computations, sort of non-arithmetic computations, Boolean computations, much more efficiently? I see. And then is there a trade-off between the speed at which you can encode with your correct encode and how you do your IOP of proximity? Trade-off in terms of efficiency, I mean, if you use it. Yeah,. OK, so maybe this is a good time to point out that Reed-S Saulman has a lot of amazing properties. One of them is this very fast encoding,

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