A trait for defining the behaviour of an arithmetic constraint system. ## Type Parameters `R: Ring` - the ring algebra over which the constraint sys

Prover benchmark for commitment transformation protocol. Measures transformation and sumcheck proof generation time across varying folding arity L ∈

Verifier benchmark for commitment transformation protocol. Measures sumcheck verification time for commitment transformation proofs. Tests verificati

Decomposition parameters. Convenient to enforce them compile-time. Contains both gadget matrix data and Latticefold decomposition step data.

Prover benchmark for standard decomposition protocol. Measures witness decomposition and dual linearization proof generation time across varying witn

Verifier benchmark for standard decomposition protocol. Measures verification time for decomposition proofs. Verifies that both output LinB instances

Prover benchmark measuring decomposition width (k) scaling. Tests how double commitment performance scales with increasing k values. Higher k creates

Prover benchmark for double commitment with witness size scaling. Measures the time to create an RgInstance from a witness vector using the double co

Prover benchmark measuring folding arity (L) scaling. Tests how end-to-end prover performance scales with increasing L values. Demonstrates batching

Prover benchmark for end-to-end LatticeFold+ protocol. Measures complete proving time including all sub-protocols: linearization, range check, commit

Verifier benchmark for end-to-end LatticeFold+ protocol. Measures complete verification time including all sumcheck verifications across the protocol

Prover for the folding subprotocol

Verifier for folding subprotocol

A trait for types with an associated Poseidon sponge configuration.

Interactive Proof for Multilinear Sumcheck

A trait for defining the behaviour of a satisfying instance of a constraint system # Types - `R: Ring` - the ring in which the constraint system is o

The LatticeFold folding prover Implements the [`FoldingProver`] trait.

The LatticeFold folding verifier Implements the [`FoldingVerifier`] trait.

The LatticeFold prover The implementation of the `LinearizationProver` trait is defined in the main linearization file.

The LatticeFold verifier The implementation of the `LinearizationVerifier` trait is defined in the main linearization file.

A trait to specify short challenge set for use in the LatticeFold protocol.

Prover for the Linearization subprotocol

Verifier for the Linearization subprotocol.

Sumcheck for products of multilinear polynomial

Prover benchmark measuring decomposition width (k) scaling. Tests how prover performance scales with k ∈ [2,3,4] while keeping L=4, κ=2, and B=50 fix

Prover benchmark measuring security parameter (κ) scaling. Tests how prover performance scales with κ ∈ [2,3,4,5] while keeping L=4, n=65536, k=2, an

Prover benchmark measuring large witness scaling. Tests performance on very large witnesses from 128K to 512K elements while keeping L=4, k=2, κ=2, a

Prover benchmark for standard multilinear folding protocol. Measures L×LinB → LinB2 folding time across varying folding arity L ∈ [2,3,4,5,6,7,8] whi

Verifier benchmark for standard multilinear folding protocol. Measures sumcheck verification time for multilinear folding proofs. Tests how verificat