Halo 2 with Daira Hopwood and Str4d
Zero Knowledge
00:00
Optimisation of the Oracle Proof
An interactive proof is will you have a protocol between approver and verifier. The prover is trying to convince an the verifier that they know a witness for some statement. So if these messages are polynomials, then we can instantiate the oracle using a polynomial commitment scheme. And it has these properties iam called binding and hiding. It's a way, just like, commit to something larger in the space of something smaller. But exactly so it's, it helps you, in certain cases, with certain efficiencies.
Play episode from 16:10
Transcript
