Dev Ojha and Nick Spooner, authors of the Fractal transparent SNARK construction, discuss how Fractal improves on earlier work, its differences from STARKs, and the discovery of recursive SNARKs. They explore the relationship between Fractal and Aurora, the role of oracles in DeFi, efficient recursion in transparent SNARKs, and the process of converting a construction. They also discuss collaboration between academic groups and the cryptographic implications of snarks.
Read more
AI Summary
AI Chapters
Episode notes
auto_awesome
Podcast summary created with Snipd AI
Quick takeaways
Fractal is a transparent pre-processing snark that enables recursion without a trusted setup, solving the problem of transparent recursion and allowing the verifier to run faster than the circuit being checked.
Recursion plays a critical role in snarks, enabling efficient handling of complex computations, and ongoing research aims to optimize recursion in snarks and explore its impact on security.
Deep dives
Fractal: A Transparent Pre-processing Snark
Fractal is a transparent pre-processing snark that enables recursion without a trusted setup. It builds on Marlin's protocol by adding pre-processing to achieve a sync verifier. The key goal of fractal is to solve the problem of transparent recursion, allowing the verifier to run faster than the circuit being checked. With fractal, unstructured computations are handled efficiently through the use of R1CS, while maintaining security and post-quantum resistance. Fractal differentiates itself from starks by focusing on unstructured computations, offering an alternative approach to recursion. The fractal code is available on libiop.org and can be used for experimentation and performance analysis. Further research is being done to improve the parameters and explore the cryptographic implications of snarks and one-round arguments.
The Importance of Recursion in Snarks
Recursion plays a critical role in snarks, allowing the verifier to run faster than the circuit being checked. This enables efficient handling of complex computations. Fractal demonstrates the feasibility of recursion without a trusted setup, providing an alternative solution to existing approaches. With fractal, the verifier's circuit size remains small even with deep recursion. Other techniques, such as leveraging structured computations and taking advantage of specific hashing functions, can further enhance recursion and improve efficiency. Ongoing research aims to optimize recursion in snarks and explore its impact on security.
Theoretical Foundations and Cryptographic Implications of Snarks
The theoretical foundations of snarks involve exploring the limits of provable security and cryptographic implications. Despite initial claims that snarks were impossible, they have been successfully developed and deployed. However, there are still various gaps and unanswered questions in the cryptographic theory surrounding snarks. Researchers are working to address these gaps and investigate the limits of provable security and the potential for further advancements. While the practical applications of snarks are evident, the ongoing research focuses on strengthening the cryptographic foundations and addressing theoretical challenges.
Fractal: Beyond the Paper
Beyond the paper, efforts are underway to refine and optimize the code for fractal. The implementation is being cleaned up, with separate versions for pre-processing and recursion. These releases aim to provide auditable and usable code for experimentation and performance evaluation. Additionally, research is being conducted to leverage recursion for further improvements in stark-like protocols. By harnessing the power of recursion, it is possible to enhance the efficiency and security of snarks. The focus is on exploring innovative ways to capitalize on the benefits of recursion and advance the capabilities of cryptographic protocols.
This week, we explore the Fractal transparent SNARK construction with its authors Dev Ojha and Nick Spooner - both students of Alessandro Chiesa at UC Berkeley. We explore how Fractal works, how it improves on some of the earlier work on Sonic and Marlin, how it borrows from but differentiates itself from STARKs, as well as what they discovered while working on this paper about recursive SNARKs and what makes that property possible.
Just recently, a critical vulnerability was found in the certificate validation functionality on Windows 10 and Windows Server 2016/2019 This bug allows attackers to break the validation of trust in a wide variety of contexts, such as HTTPS and code signing - Trail of Bits has developed a PoC exploit and put up a website Whose Curve is it Anyway that let's users test whether or not they are vulnerable.
To learn more about this vulnerability and the Trail of Bits exploit, please check out this recent blog post entitled: Exploiting the Windows CryptoAPI Vulnerability. Also keep an eye on the ToB blog for security news and explanation pieces like this one.