Leona Hioki from Intmax proposed a range proof mechanism for Pedersen commitments based on Merkle trees, avoiding ZK verification and pairings, reducing transaction costs. 来自Intmax的Leona Hioki在论文中提出了一种基于Merkle树的Pedersen承诺范围证明机制,通过锚定和轻量级验证避免ZK验证和配对运算,降低交易成本。
Notes
Avoids repeated ZK verification and pairings in each transaction, reducing computational overhead
Uses Merkle trees and anchor mechanism to ensure privacy of range proofs
Combines DLEQ and Schnorr proofs for enhanced security
Verification cost is low, requiring only Merkle proofs, DLEQ, and Schnorr proofs
Suitable for EVM environment, optimizing gas usage