Visualizing Lasso: A fast new lookup argument for SNARKs
Source: YouTube · a16z crypto · published Oct 3, 2023 · 20:25
Lasso is a new lookup argument that enables efficient lookups over huge tables, serving as a thin wrapper around Surge which generalizes the sparse polynomial commitment scheme from Spartan 0:02-0:16.
Key Takeaways:
• Lasso works by proving that looking up indices M of table T gives you vector a through a three-phase process: commitment, primary sum check, and memory checking 0:48-1:01
• The protocol reformulates the sum check to be more tractable by summing over lookups rather than table entries 3:39-3:46
• Large tables with "spark-only structure" can be decomposed into smaller subtables, making the verification process more efficient 5:47-5:56
• The verification process involves memory checking to ensure consistency between the subtable values and lookup indices 13:35-13:45
Lasso provides an efficient method for proving lookups in very large tables while maintaining security guarantees 19:47-20:03.
Sources:
- 0:02-0:16 Introduction to Lasso and its purpose
- 0:48-1:01 The three phases of Surge protocol
- 3:39-3:46 Reformulating the sum check
- 5:47-5:56 Tables with spark-only structure
- 13:35-13:45 Memory checking explanation
- 19:47-20:03 Conclusion of what Lasso proves
Generate CPE Credits
Generate a professional CPE document from this video's transcript.
Estimated credit: 0.5 CPE hours
Estimate uses the video runtime (1 hour ≈ 1 CPE, rounded to the nearest 0.5, minimum 0.5, maximum 2.0). The final amount can be lower after review, never higher.
Topic: Cybersecurity. Commonly maps to: Security and Risk Management, Security Operations. Exact CISSP domains are assigned during generation.
Free account. One generation at a time, with a daily limit.
CPEBuddy is independent and not affiliated with or endorsed by ISC2, ISACA, or any certification body. Exports are formatted for common CPE submissions; acceptance is at your certification body's discretion.
Transcript Preview
First 800 characters of the transcript
in this presentation I'll be going over Owasso a new lookup argument authored by srinath seti Justin thaler and Riyad Wabi which enables efficient lookups over huge lookup tables leveraging techniques introduced in Spartan as well as multi-linear some check alright so I'm going to give an overview of lasso in a visual map like format so first to start this is the high level overview of this presentation we're going to start with the motivation or setup of how we arrive at the particular statement that lasso approves and then we'll dig into the details of lasso itself as you can see from this picture waso is a pretty thin wrapper around surge which is a generalization of spark the sparse polynomial commitment scheme introduced in the Spartan paper and within surge there are roughly three ph…