Bünz et al. proposed TensorSwitch, a hash-based multi-linear polynomial commitment scheme in paper, which significantly optimizes prover time and proof size, suitable for SNARG designs. Bünz等人在论文中提出了TensorSwitch,一种基于哈希的多线性多项式承诺方案,显著优化了证明者时间和证明大小,适用于SNARG设计。
Notes
TensorSwitch optimizes the prover time and proof size of PCs to reduce ZK proof overhead
It uses linear codes and interactive predicative models, which can be compiled into standard cryptographic PCs
Commitment time depends on coding rate ρ and encoding time τ, supporting efficient gate operations
Verification time grows logarithmically, suitable for large-scale polynomial processing
Proof size is minimal, only O(log log n) witnesses
Built on hashing for increased security and reduced dependence on complex cryptographic assumptions