Protocol Labs Research
About
People
Research
Outreach
Blog

Latest work

2021.3.18 / Publications

Rinocchio: SNARKs for Ring Arithmetic

Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient verification of NP computations and admit short proofs. However, all current SNARK constructions assume that the statements to be proven can be efficiently represented as either Boolean or arithmetic circuits over finite fields.