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
In this week’s episode, host Anna Rose chats with Chhi'mèd Künzang and François Garillot from Lurk Labs about all things Lurk, Lisp and zk languages.
They discuss the history of the Lurk project, from its beginnings with Protocol Labs (the team that built Filecoin), to its emergence as a Turing-complete programming language for recursive zkSNARKs.
They discuss Lurk’s relationship with Lisp, what Lisp is, and how developers familiar with that family of languages would be able to interact with Lurk. They then discuss how Lurk compares to other zkDSLs and the new innovations this Lisp-based language brings to the table.
Here’s some additional links for this episode:
Programming Languages
Lurk Links
Additional Reading/Listening
Ever feel like developing zero-knowledge proofs is a daunting task?
The team at RISC Zero is here to remind you that it doesn't have to be that way. Their out-of-the-box tooling allows developers to access the magic of ZK proofs from any chain without needing to learn custom languages or building custom zk circuits.
Bonsai, RISC Zero’s most anticipated product, is a proving marketplace that enables any protocol or application to leverage fast ZKProofs in languages like Rust, Go, C++.
Visit https://r0.link/ZKpodcast to learn more and sign up today for the Bonsai waitlist.
If you like what we do: