Notes

• Based on sumcheck and sparse MLE PCS, directly processing R1CS matrix
• Proof time linearly related to non-zero matrix items, superior to traditional QAP scheme
• Core advantages include public delegation of computation and linear time proof generation
• Efficient sparse matrix processing through compiler, reducing storage and computational overhead
• Verification process depends on two sumcheck and sparse MLE random point evaluations
• Suitable for sparse/structured circuits, some calculations can be transferred to verifier

• 基于 sumcheck 和稀疏 MLE PCS，直接处理 R1CS 矩阵
• 证明时间与矩阵非零项数线性相关，优于传统 QAP 方案
• 核心优势包括可公开委托计算和线性时间证明生成
• 通过编译器实现稀疏矩阵高效处理，降低存储和计算开销
• 验证流程依赖两次 sumcheck 和稀疏 MLE 的随机点求值
• 适用于稀疏/结构化电路，部分计算可转移至验证者