LURK: Lambda, the Ultimate Recursive Knowledge (Experience Report)

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We introduce Lurk, a new LISP-based programming language for zk-SNARKs. Traditional approaches to programming over zero-knowledge proofs require compiling the desired computation into a flat circuit, imposing serious constraints on the size and complexity of computations that can be achieved in practice. Lurk programs are instead provided as data to the universal Lurk interpreter circuit, allowing the resulting language to be Turing-complete without compromising the size of the resulting proof artifacts. Our work describes the design and theory behind Lurk, along with detailing how its implementation of content addressing can be used to sidestep many of the usual concerns of programming zero-knowledge proofs.

Author supplied keywords

Cite

CITATION STYLE

APA

Amin, N., Burnham, J., Garillot, F., Gennaro, R., Künzang, C., Rogozin, D., & Wong, C. (2023). LURK: Lambda, the Ultimate Recursive Knowledge (Experience Report). Proceedings of the ACM on Programming Languages, 7(ICFP), 259–274. https://doi.org/10.1145/3607839

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free