There's no need for a VM and this is really important. You just need a simple, very fire contract. We produce proofs that under reasonable assumption of choosing a backend are simply verifiable on chain for a modded cost. And yet, because we are micro VM, we give you those important advantages of recovering a computation model that is intuitive to you. If you're doing a CvLF test stands on a number that is not prime, you should just pay the price of a few iterations, not the entire sequence of operations. So you can prove off-chain, define a list program and then put the verifier on chain on any chain.
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: