This site does not allow itself to be embedded. You can still read it on the original site — the toolbar below keeps your place in the directory.
Introduction In this post we will take a look at the F ast R eed-Solomon I OP (FRI) proximity test, which enables an untrusted prover to convince a verifier that a committed vector is close to a Reed-Solomon codeword with communication only poly-logarithmic in the dimension of the code. This is readily used to construct practically efficient zkSNARKs from just cryptographic hash functions (rather…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.