数学基础
- 数论
- 抽象代数
- 概率论
- 离散数学
- 计算机复杂性理论
- 信息论
- FRI vs KZG?
- Plonky arithmatic vs R1CS?
- Polynomial evaluation?
- q-strong SDH assumption?
- 低度多项式扩展?
- Schwartz–Zippel lemma 定理
- Fiat-Shamir 定理
- Probabilistically Checkable Proofs
Plonk的缺点
- FFT
- custom gate 不支持高阶
- Simulator & Extractor (replace witness by trapdoor)
- Range Checks using lookup table (and binary constraits)
- relaxed R1CS
- IVC
- Univariate SumCheck
- Split And Fold
- Folding Scheme
- Forking Lemma
- BCC16(Bullet Proofs)
- Super Polynomial
- EXP, MHT, FFT, MSM
- AGM和GGM
- 多元多项式的KZG10
- UC(通用可组合)和SE
MSM计算加速
- batch affine
- glv
- montgomery
- pipenger
- grouth16不满足零知识性,需要混入masking polynomial,或者随机数
- 2^n的乘法子群,fft需要补齐到2^n