Zero-knowledge proofs and SNARKs have become essential tools in the Bitcoin world, allowing for privacy and security in transactions.
The development of elliptic curve pairings in cryptography, inspired by unrelated mathematical fields, has paved the way for efficient and practical zero-knowledge proofs and SNARKs.
Deep dives
Ariel Gabesant's Journey into Cryptography
Ariel Gabesant, a cryptographer, shares his early journey and interest in cryptography. Initially skeptical and viewing cryptography as negative, Ariel's perspective changed when he fell in love with Bitcoin after reading its white paper. Inspired by his math background, Ariel saw zero-knowledge proofs and SNARKS as the best way to contribute to the Bitcoin world. He collaborated with Ellie Ben-Sasson to work on developing and implementing Starks. Ariel eventually joined Zcash, focusing on the Trusted Setup Ceremony and contributing to the sapling upgrade. He later discovered a bug in the ZK-SNARK protocol and proposed a re-randomization fix. After leaving Zcash, Ariel joined Protocol Labs and became involved in the Filecoin project, working on proofs of replication. He also explores other promising cryptographic techniques such as RSA accumulators and KZG polynomials.
The Power of Pairings in Cryptography
The development of elliptic curve pairings in cryptography is a fascinating story. Mathematicians, including Andre Weyl, stumbled upon pairings while exploring the Riemann hypothesis and algebraic function fields. Pairings ultimately played a crucial role in enabling the efficiency and practicality of zero-knowledge proofs and SNARKS. Pairings, such as the Vey pairing, serve as the foundation for various cryptographic applications, including SNARKs, BLS signatures, and the Cate polynomial scheme. This highlights how discoveries in unrelated mathematical fields can have profound implications for cryptography and blockchain technology.
The Challenges of Proofs in Filecoin
Working on proofs of replication for the Filecoin project presents unique challenges. Proofs of replication involve demonstrating that multiple independent copies of a file are stored without revealing their contents. These proofs can be computationally expensive and memory-intensive, making their implementation difficult. To address these challenges, Filecoin explores alternative vector commitment techniques, such as RSA accumulators and K-ZG polynomials. These advanced vector commitment schemes offer potential improvements in scalability and efficiency, reducing the memory requirements and computational burden of proofs of replication.
In this week’s episode, we welcome Ariel Gabizon, previously a Electric Coin Company (Zcash) engineer and now a cryptographer working on zero knowledge constructions for Filecoin.
Ariel has worked closely with some of the most exciting projects and researchers pushing the boundaries on zero knowledge research. He is also the person who discovered the Zcash bug (along with Sean Bowe and Zooko). In this episode, we explore his journey into the space, what inspires him, and what exciting new paradigms he is exploring today!
Here are some of the articles and topics he mentions:
StarkWare will be presenting the StarkWare Sessions - on Sept 16th in Tel Aviv. The event will bring together some of the brightest minds in zero knowledge research from both the academic and application spheres. Topics that will be discussed are self-custodial trading, STARKs for Layer 1, STARK-friendly hash functions and other cool things you can do with STARK proofs.