20 | Scaling Ethereum | Learning EVM, Solidity Patterns, Web3 Security and Zero-Knowledge Proofs
Simplifying Powers of Tau and the Trusted Setup Ceremony.
before any reax at all, this picture is by DALL-E 2. Prompt: husband putting a ring with an Ethereum logo on it, in wife's finger In this blog, I’m making an attempt to break down Powers of Tau. One, indeed confusing part while writing zkSNARK circuits, be it in Circom, or Rust, or any other language, that many developers usually struggle with. Powers of Tau is a ceremony that is used to generate the initial parameters for zk-SNARKs (Zero-Knowledge Succinct Non-Interactive Argument of Kn...
Simplifying Powers of Tau and the Trusted Setup Ceremony.
before any reax at all, this picture is by DALL-E 2. Prompt: husband putting a ring with an Ethereum logo on it, in wife's finger In this blog, I’m making an attempt to break down Powers of Tau. One, indeed confusing part while writing zkSNARK circuits, be it in Circom, or Rust, or any other language, that many developers usually struggle with. Powers of Tau is a ceremony that is used to generate the initial parameters for zk-SNARKs (Zero-Knowledge Succinct Non-Interactive Argument of Kn...
Zero-Knowledge Proof for Privacy over Ethereum: PLONK [step-by-step] (Part 1)
This blog mainly deals with the step-wise implementation of the PLONK proving scheme for a zk-SNARK (zero knowledge — Succinct Non-Interactive Argument of Knowledge) proof-system. The steps mainly cover topics of Elliptic Curve Cryptography and Abstract Algebra.IntroductionPLONK is a SNARK (Succinct Non-Interactive Argument of Knowledge) that can verify a computation done by an arithmetic circuit, meaning we might have a circuit C that on input x outputs C (x) = y, and a PLONK proof (generate...
Zero-Knowledge Proof for Privacy over Ethereum: PLONK [step-by-step] (Part 1)
This blog mainly deals with the step-wise implementation of the PLONK proving scheme for a zk-SNARK (zero knowledge — Succinct Non-Interactive Argument of Knowledge) proof-system. The steps mainly cover topics of Elliptic Curve Cryptography and Abstract Algebra.IntroductionPLONK is a SNARK (Succinct Non-Interactive Argument of Knowledge) that can verify a computation done by an arithmetic circuit, meaning we might have a circuit C that on input x outputs C (x) = y, and a PLONK proof (generate...
hehe
hehe
