Ingonyama·Apr 6, 2025BaseFold±: A Simple Improvement to BaseFold’s Multilinear Polynomial Commitment Scheme using…By Yuval Domb
Ankita Singh·Feb 10, 2025Understanding FRI Polynomial Commitments SchemeFRI stands for Fast Reed Soloman Interactive Oracle proofs of proximity. It is used in polynomial commitment schemes to efficiently prove…
Frank Mangone·Jun 11, 2024Cryptography 101: Zero Knowledge Proofs (Part 1)We take a leap into the world of zero-knowledge proofs by exploring one of the many ZKP protocols out there: Bulletproofs.A response icon1
Frank Mangone·Jun 4, 2024Cryptography 101: Commitment Schemes RevisitedAn expansion upon the ideas behind simpler commitment schemes, providing important tools for more complex constructions down the road.
