Lattice-Based Polynomial Commitments Enhance Succinct Argument Efficiency
A novel lattice-based polynomial commitment scheme significantly reduces proof sizes and eliminates preprocessing, advancing efficient post-quantum succinct arguments.