Exploring Lurk: a New Language for Recursive zk-SNARKs
Zero Knowledge
00:00
How to Define a Programming Language With Its Syntax
The definition of the interpreter for very large class of programming languages is defined with an abstract state machine. You really think about it in terms of a graph in your mind, so it tells you, okay, you're in that state. And all of those edges are directed and flow towards the final evaluated form of your program. This is how we've implemented the LISP. All more exactly since we have a dialect of LISP, we have a clever variant of the CKE machine that still has a very strong moral point to it. Once you put that in a circuit and you express this in a circuit, this machine is universal in that it can take any LISP program
Transcript
Play full episode
