danksharding
introductionDanksharding is central to Ethereum’s rollup-centric roadmap. The idea is to provide space for large blobs of data, which are verifiable and available, without attempting to int…
Read article
Explore
fourier series, DFT and FFT
Fourier Seriesinnter product of two functions\[ <f(x), g(x)> = \int_{a}^{b} f(x) \bar{g}(x)dx\]\(\bar{g}\) is the congugate of g on complex number system Fourier series definitionlet \(f(x)…
Read articlemarkdown & latex
markdown by exampleitaliccolor latex by examplesymbol\( \mu \)\( \omega \)\( \sigma \)\( \epsilon \)\( \zeta \)\( \eta \)\( \theta \)\( \kappa \)\( \nu \)\( \omicron \)\( \rho \)\( \delta \…
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 articlezkp how and why it works
The medium of proof: PolynomialIf a prover claims to know some polynomial (no matter how large its degree is) that the verifier also knows, they can follow a simple protocol to verify the s…
Read articleelliptic curve paring
introductionPairings allow you to check certain kinds of more complicated equations on elliptic curve points — for example, if \(P = G * p\), \(Q = G * q\) and \(R = G * r\), you can check …
Read articlezkp a brief understanding (1)
introductionzk-SNARKs cannot be applied to any computational problem directly; rather, you have to convert the problem into the right “form” for the problem to operate on. The form is calle…
Read articlecryptography (4) digital signature
Elgamal Digital Signature SchemeThe Elgammal signature scheme is based on the difficulty of computing discrete logarithms. Unlike RSA, where encryption and digital signature are almoste ide…
Read articlecryptography (3) elliptic curve
elliptic curve definitionfor cryptographic use, we need to conside the curve not over the real numbers but over a finite field. the most popular fields GF(p), where all arithmetic is perfor…
Read article