polygon zkEVM
zkProverState MachinesThe zkProver follows modularity of design to the extent that, except for a few components, it is mainly a cluster of State Machines. It has a total of thirteen (13) St…
Read articleTopic
zkp
10 notes filed under this topic.
circom
Arithmetic Operators| operator |example|explanation||—|:—:|:—:|—:|||a \b| Quotient of the integer division ||%|a % b| Remainder of the integer division |
Read articlekzg polynomial commitment
introductionKZG polynomial commitments was introduced by Kate, Zaverucha and Goldberg. It is called a commitment, because having sent the commitment value (an elliptic curve point) to someo…
Read articlesgx multi prover
references https://blog.csdn.net/mutourend/article/details/133586549?spm=1001.2014.3001.5502
Read articlezk bench
references csdn blog on zkbench
Read articleplonky2 code analysis
introductionthis post is a source code analysis of https://github.com/0xPolygonZero/plonky2 0. fieldthe lde in proving stage is conducted on extension field 1. Config1.1 CircuitConfigthe de…
Read articlestark 101
trace and low degree extensionthe objective is to develop a STARK prover for the FibonacciSq sequence over a finite field. The FibonacciSq sequence is defined by the recurrence relation\[ a…
Read articleunderstanding plonk
introductionPLONK, standing for the unwieldy quasi-backronym “Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge”. PLONK still requires a “universal and …
Read articlezkp demystify zokrates
pipelinesource filean example, square.zok The keyword private signals that we do not want to reveal this input, but still prove that we know its value. compile after compile, it generates b…
Read articlegroth16 demystified
1. IntroductionGoldwasser, Micali and Rackoff [GMR89] introduced zero-knowledge proofs that enable a prover to convince a verifier that a statement is true without revealing anything else. …
Read article