Name
Abstract | ||
|---|---|---|
This paper introduces Otti, a general-purpose compiler for (zk)SNARKs that provides support for numerical optimization problems. Otti produces efficient arithmetizations of programs that contain optimization problems including linear programming (LP), semi-definite programming (SDP), and a broad class of stochastic gradient descent (SGD) instances. Numerical optimization is a fundamental algorithmic building block: applications include scheduling and resource allocation tasks, approximations to NP-hard problems, and training of neural networks. Otti takes as input arbitrary programs written in a subset of C that contain optimization problems specified via an easy-to-use API. Otti then automatically produces rank-1 constraint satisfiability (R1CS) instances that express a succinct transformation of those programs. Correct execution of the transformed program implies the optimality of the solution to the original optimization problem. Our evaluation on real benchmarks shows that Otti, instantiated with the Spartan proof system, can prove the optimality of solutions in zero-knowledge in as little as 100 ms-over 4 orders of magnitude faster than existing approaches. |
Year | Venue | Keywords |
|---|---|---|
2022 | PROCEEDINGS OF THE 31ST USENIX SECURITY SYMPOSIUM | Representation (systemics),Optimization problem,Theoretical computer science,Computer science |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastian Angel | 1 | 31 | 8.25 |
| Andrew J. Blumberg | 2 | 0 | 0.34 |
| Eleftherios Ioannidis | 3 | 0 | 0.34 |
| Jess Woods | 4 | 0 | 0.34 |