订阅时事通讯

Blog

BlogLandingHero

Blog / 2020-11-12 / Vanishree Rao and Izaak Meckler

A More Efficient Approach to Zero Knowledge for PLONK

In PLONK (considered as an interactive oracle proof), the prover sends the verifier several polynomials. They are evaluated at some k points during the course of the protocol. Of course, if we want zero-knowledge, we would require that those evaluations do not reveal anything about the proof's underlying witness.

More Blog posts

SEE ALL POSTS

关于技术

AboutTechCta

Mina uses advanced cryptography and recursive zk-SNARKs to deliver true decentralization at scale.

开始

GetStartedCta

Mina makes it simple to run a node, build and join the community.