InEryxbyBruno Weisz·Aug 11, 2025Noirky2: how we made a Plonky2 proving backend for NoirThis article is meant for curious developers who want to dive deeper into how the Noir programming Language works, or want to adapt a new…
Ankita Singh·May 4, 2025Understanding RedShift: Transparent SNARKs from List Polynomial CommitmentsIntroduction
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…
Lightec·Nov 3, 2024AMA Recap:How Plonk Verifier Powers zkBTC BridgeTo celebrate zkBTC’s latest achievements, we will hold special community AMA sessions! It was an insightful discussion with our development…
Frank Mangone·Jun 25, 2024Cryptography 101: Zero Knowledge Proofs (Part 2)This second round of zero knowledge proofs will take us on a journey to understand a more general framework. Hang tight!
