Jim Posen: FRI-Binius: Polynomial Commitments for Tiny Binary Fields

Описание: This talk will discuss recent advances in polynomial commitment techniques for binary fields pioneered by the Binius SNARK library. Binius is designed to efficiently prove statements about constraint systems defined over tiny binary fields, including GF(2). This system is uniquely well suited for applications like verifying classical hash functions, such as SHA-2 and Keccak-256, that other proof systems struggle with.

Using the Fast Reed-Solomon IOPP, the Basefold multilinear PCS, and a novel sumcheck procedure, the new polynomial commitment scheme presented in Polylogarithmic Proofs for Multilinears over Binary Towers produces concretely small and efficient SNARKs for this class of statements.

About the speaker:

Jim Posen is the co-founder and Chief Technology Officer at Irreducible, a cryptographic acceleration company focused on verifiable computing. Previously, Jim was an early engineer at Coinbase, where he was the Tech Lead on the Payments team responsible for bank and blockchain integrations. Jim also established the Protocol team at Coinbase, and contributed to open-source projects serving Bitcoin, Ethereum, and the Lightning Network. Jim has a BSE in Electrical and Computer Engineering from Duke University and an MS in Computer Science from Stanford University.

This talk was given at StarkWare Scholar Summit on August 5, 2024. This event brought together a global community of researchers, engineers, and thought leaders to explore the latest and greatest in blockchain tech.