We introduce Lurk, a groundbreaking LISP-based programming language for zk-SNARKs. Unlike conventional approaches that involve compiling computations into flat circuits, Lurk allows programs to be provided as data to the universal Lurk interpreter circuit. This innovative design empowers Lurk with Turing-completeness, without sacrificing the size of the resulting proof artifacts.
In this talk, we will delve into the design principles and theoretical foundations of Lurk, and explain how its unique implementation of content addressing helps bypass many common challenges associated with programming zero-knowledge proofs.
The associated repo can be found at Lurk Labs.