Episode 113: Latest recursive SNARKitecture with Izaak Meckler from O(1)Labs
Jan 22, 2020
auto_awesome
Izaak Meckler from O(1) Labs discusses the launch of a recursive snark based incentivized test net, updates on the working SNARKitecture, and new use-cases for zkps in making computer programs more accountable to users.
Snark technology has seen improvements in both implementation level and algorithmic level, resulting in faster computation and more efficient Snarks for applications beyond token transfers.
Recursive snarks can be used to enforce specific algorithms in applications, ensuring transparency and accountability, such as in loan determinations, and have the potential to enable a more accountable and transparent digital society.
Deep dives
Improvements in Snark Technology
There have been significant improvements in both implementation level and algorithmic level in Snark technology. On the implementation side, a GPU prover has been developed, which is over four times faster than a 16-core machine. This has greatly improved the speed of Snark computation. Algorithmically, a new Snark construction is currently being implemented, which combines the AHP (Algebraic Holographic Proofs) from the Halo system with batching techniques. These advancements have made Snarks more efficient and have paved the way for applications beyond simple token transfers.
Recursive Snarks and Computation
Recursive snarks have been explored as a technique for verifying computations that unfold over time. By using recursion and snarks in tandem, it is possible to enforce the use of a specific algorithm in applications where transparency and accountability are crucial. For example, in the case of lenders making loan determinations, snarks can be used to provide a proof that the decision was made using an agreed-upon algorithm, ensuring fairness and preventing biases. Snarks have the potential to enable a more accountable and transparent digital society.
General Computation on CODA
The development team at CODA has been discussing the implementation of general computation on the platform. While the exact details are still being finalized, this would enable the creation of applications beyond token transfers, such as escrow, voting, and decentralized finance. Through the use of recursion and snarks, CODA aims to provide a customizable and user-centric system that ensures the verifiability and privacy protection of computations.
Building a Light and Decentralized Infrastructure
The team at CODA recognizes the importance of building a light and decentralized blockchain infrastructure. They aim to address the scalability issue faced by many blockchains by utilizing snark technology. With snarks allowing for the compressed representation of the entire blockchain history, anyone can run a node on CODA, ensuring a decentralized network. This approach, along with the integration of GPU provers and other efficiency enhancements, makes CODA a promising solution for a more inclusive and secure digital ecosystem.
In this week’s episode, we catch up with Izaak Meckler from 0(1) Labs to talk about launching a recursive snark based incentivised test net, a recap of recursive SNARKs, updates on the working SNARKitecture, and a look at what's next for the project. We also touch on some new use-cases and ideas for how zkps may be a component in making computer programmes potentially more accountable to their users.