field
Pseudo-Mersenne PrimePseudo-Mersenne Prime is a prime of the form\[ p = 2^m -k \]where \(k\) is an integer for which\[ 0 \lt |k| \lt 2^{\lfloor m/2 \rfloor} \] if \(k=1\), then \(p\) i…
Read articleTopic
cryptography
10 notes filed under this topic.
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 articlecircom
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 articlebls12_381
introductionBLS12-381 is a pairing-friendly elliptic curve. Curve BLS12-381 was designed by Sean Bowe in early 2017 as the foundation for an upgrade to the Zcash protocol. It is both pairin…
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 article