You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Groth16 is a zkSNARK protocol introduced by Jens Groth in 2016 & it saw an early application in ZCash. Its proof size is among the smallest (consisting of only three elliptic curve elements) and it is also the fastest to verify
"Pre-requisite Topics / Polynomial Commitment Schemes & Elliptic Curve Pairings" ends with product of $e$ which [I couldn't find] at https://risencrypto.github.io/Kate/. Would be cool to have a word or two on that right there.
[I couldn't find]: I'm on a phone, so apologies if that's just a miss.
"Pre-requisite Topics / Polynomial Commitment Schemes & Elliptic Curve Pairings" ends with product of e which [I couldn't find] at https://risencrypto.github.io/Kate/. Would be cool to have a word or two on that right there. [I couldn't find]: I'm on a phone, so apologies if that's just a miss.
I have explained how from m=ab+cd, you can derive e(mG_1,G_2) = e(G_1,G_2)^{ab} . e(G_1,G_2)^{cd} in the current post itself. Or are you asking about something else?
Groth16 zkSNARK – Risen Crypto – Mathematical Cryptography, zkSNARKs
Groth16 is a zkSNARK protocol introduced by Jens Groth in 2016 & it saw an early application in ZCash. Its proof size is among the smallest (consisting of only three elliptic curve elements) and it is also the fastest to verify
https://risencrypto.github.io/Groth16/
The text was updated successfully, but these errors were encountered: