ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Sun 星期日
10.12
2025
SoK: Lookup Table Arguments https://eprint.iacr.org/2025/1876
Hafezi et al. in paper systematize the design of lookup table arguments, propose a unified framework covering various lookup types, and evaluate existing protocols in terms of proof cost, composability, etc. Hafezi等人在论文中系统化分析了查找表论证的设计，提出统一框架覆盖多种查找类型，并评估现有协议在证明成本、可组合性等方面的表现。
Notes
- Lookup table arguments are widely used in non-interactive operations, zk-VM and set membership proofs
- Existing constructions differ in assumptions, efficiency, and composability
- Introduce a unified framework covering standard, projection, index, vector and decomposable lookups
- Classify protocols based on proof technology and composition style
- Evaluation metrics include prover cost, table size dependence, and recursive proof composability
- Provide practical guidance on selection and highlight the advantages and limitations of preprocessing and decomposability