AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
2min chapter
Nillion NMC: A Secure Processing Layer for Web3 | Miguel de Vega
Hidden Forces
The Problem With Multiplications
The problem is when you try to compute multiplications. When you multiply two polynomials, the degree of the resulting polynomial is much higher. So that means that you no longer have enough shares across the notes to reconstruct that polynomal because it has a higher degree. To do that, you need communication. You need the notes to exchange messages between each other. Every note has to send a message to every other note on the network and receive a message from every note on thenetwork. And that's just for one multiplication. If you have run a million multiplications, you have to do those rounds of communications one after the other. That makes m pc really, really
00:00
Transcript
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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