Zhang et al. in paper proposed a dynamic zkSNARK scheme DYNARK, which can update proofs in sublinear time when witnessing small changes, based on Groth16 protocol to optimize efficiency. Zhang等人在论文中提出了一种动态zkSNARK方案DYNARK,可在见证小变化时以次线性时间更新证明,基于Groth16协议优化效率。
Notes
DYNARK supports fast proof updates when witnessing small changes, reducing computational overhead
Update time is O(d) group operations in semi-dynamic settings, O(d√n log n) in fully dynamic settings
Proof size remains 192 bytes, verification time 4.4 milliseconds, consistent with Groth16
Experiments show that with n=2^20, preprocessing takes 74.3 seconds and updates take 3-60 milliseconds
Does not depend on pairing product parameters or other zkSNARKs, simplifying system design
Fully compatible with existing Groth16 infrastructure, making deployment easier