plonk

Implements KZG10 as the default polynomial commitment scheme, providing efficient and modular polynomial commitments essential for zero-knowledge proofs.

Includes custom gates that improve proving and verification performance, evidenced by benchmarks showing 7.871s proving time for 2^16 constraints.

Supports no_std environments with the alloc feature, enabling usage in constrained systems while still allowing proof constructions.

With the std feature, leverages Rayon for parallel operations, enhancing performance on multi-core systems for faster proofs.

The debug feature outputs CDF files for gate analysis, facilitating detailed circuit debugging and optimization when compiled with debug=true.