Month: March 2022

Seascape of SNARKs

There are a lot of constructions of succinct non-interactive arguments of knowledge out there, even after filtering out those which are publicly verifiable and support proving unstructured languages such as Boolean or arithmetic circuit satisfiability (circuit-SAT) or rank-1 constraint satisfiability (R1CS). The table below is a quick, not necessarily accurate, summary of what is available […]

Read More