This defines a `BigInteger`, a smart wrapper around a sequence of `u64` limbs, least-significant limb first.

`OptionalRng` is a hack that is necessary because `Option<&mut R>` is not implicitly reborrowed like `&mut R` is. This causes problems when a variable

A generalized version of an iterator over the elements of a domain.

An opaque counter for symbolic linear combinations.

this function "remembers" the types of the subscriber and the formatter, so that we can downcast to something aware of them without knowing those type

The algebraic holographic proof defined in [CHMMVW19](https://eprint.iacr.org/2019/1047). Currently, this AHP only supports inputs of size one less th

Affine representation of an elliptic curve point guaranteed to be in the correct prime order subgroup.

Specifies how variables of type `Self` should be allocated in a `ConstraintSystem`.

A utility trait to convert `Self` to `Result<T, SynthesisErrorA`.>

Deserializer in little endian format. This trait can be derived if all fields of a struct implement `CanonicalDeserialize` and the `derive` feature is

Deserializer in little endian format allowing flags to be encoded.

Serializer in little endian format. The serialization format must be 'length-extension' safe. e.g. if T implements Canonical Serialize and Deserialize

Serializer in little endian format allowing to encode flags.

A SNARK with (only) circuit-specific setup.

Vector-Commitable Field

Compute all combinations of values in a given list.

commitment