Succinct: Every Rollup Will Be a ZK Rollup! - Uma Roy

Polynomials are quintessential in machine learning for establishing relationships between outputs and inputs. However, there is also a field in cryptography which could not be made possible without polynomials - zero-knowledge technology. In zero-knowledge proof systems, computations are often represented as arithmetic circuits, and these circuits are translated into polynomials. This process is crucial for generating proofs that can demonstrate the correctness of computations without revealing the underlying data. The involved complexity explains the massive adoption hurdle for zk rollups compared to optimistic ones. Succinct aims to simplify the use of zero-knowledge proofs by providing a zkVM (SP1) that allows code written in languages like Rust to be proven in a privacy-preserving way. By doing so, it aims to lower the barrier to implementing zk-rollups and increase their adoption.Topics covered in this episode:Uma’s background and her interest in zero knowledge techHow Succinct’s story beganZK light clientsZK circuitsSP1 and the RISC-V instruction setThe prover networkUse casesZK rollups and commoditizing ZKPsIncentivizing proversSuccinct’s business modelSupported blockchain applicationsBottlenecks in ZK adoptionSuccinct metricsSP1’s competitive advantage and future roadmapThe real world impact of verifiabilityEpisode links:Uma Roy on XSuccinct on XSponsors:Gnosis: Gnosis builds decentralized infrastructure for the Ethereum ecosystem, since 2015. This year marks the launch of Gnosis Pay— the world's first Decentralized Payment Network. Get started today at - gnosis.ioChorus One: Chorus One is one of the largest node operators worldwide, supporting more than 100,000 delegators, across 45 networks. The recently launched OPUS allows staking up to 8,000 ETH in a single transaction. Enjoy the highest yields and institutional grade security at - chorus.oneThis episode is hosted by Friederike Ernst.

There are no comments yet.

Please log in to write the first comment.