Marlin在zkSNARK sonic协议基础上进行了改进。
The core of our preprocessing zkSNARK is an efficient algebraic holographic proof (AHP) for rank-1 constraint satisfiability (R1CS) that achieves linear proof length and constant query complexity.
论文见：《Marlin:Preprocessing zkSNARKs with Universal and Updatable SRS》
代码实现见：https://github.com/scipr-lab/marlin
参考资料： [1] https://github.com/scipr-lab/marlin [2] 《Marlin:Preprocessing zkSNARKs with Universal and Updatable SRS》
