AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
The Internals of NOVA
In NOVA, we require this commitment to vectors that are additively homomorphic. The size of the proof is proportional to the size of one step of the recursive computation. So what we describe in our paper is a way to take that large proof and compress it into something smaller. And that step requires a general-purpose NARC because we need the properties from the Snark to compress this.