* optimize MinRoot constraint system to not allocate unneeded advice variables

run with multiple MinRoot iterations per Nova step in a loop

* fix clippy warnings

* avoid creating commitments to zero vectors

* reduce the number of constraints in each iteration from 4 to 3

* rename methods for better clarity

* rename

* Bump version

* vary the number of constraints in the step circuit

* use a different starting state

* fix name

* Add 14

* ecdsa signature proof

* use the library-provided default circuit

* small reorg

Co-authored-by: Srinath Setty <srinath@microsoft.com>

use a default implementation for step circuit

* support multiple iterations of MinRoot per Nova step

* small edits to println

* fix declaration

* add the MinRoot VDF example

* optimize a bit

* optimization and cleanup

* clippy

* add examples to CI

* use inbuilt pow_vartime

* support non-determinism with small changes to the interface

* update benches to use the new API

* add an example that exercises non-deterministic advice at each step of recursion

* tiny rename

* Address clippy; update version

* cleanup RO usage inside the circuit: use traits

* Add a note

* rename types for clarity

* Add asserts for constraint count

* switch to Standard strength

* update version and README

* move tests to bellperson adapter and remove tests folder; make bellperson adapter private

* cleanup code

* compiles

* additional plumbing

* add padding

* Add missing file

* integrate

* add a separate test

* cleanup

* cleanup

* add checks for outer sum-check

* sum-checks pass

* sum-checks pass

* sum-checks pass

* Add polycommit checks to the end

* switch to pasta_msm

* clippy

* remove int_log

* switch to pasta_curves

* clippy

* clippy

* add a special case for bases.len() = 1

* use naive MSM to avoid SIGFE error for smaller MSMs

* add rayon parallelism to naive MSM

* update comment since we already implement it

* address clippy

* cleanup map and reduce code

* add parallelism to final SNARK creation and verification

* add par

* add par

* add par

* add par

* store padded shapes in the parameters

* Address clippy

* pass padded shape in params

* pass padded shape in params

* cargo fmt

* add par

* add par

* Add par

* cleanup with a reorg

* factor out spartan-based snark into a separate module

* create traits for RelaxedR1CSSNARK

* make CompressedSNARK parameterized by a SNARK satisfying our new trait

* fix benches

* cleanup code

* remove unused

* move code to Spartan-based SNARK

* make unused function private

* rename IPA types for clarity

* cleanup

* return error types; rename r_j to r_i

* fix duplicate code

* add benches

* fix error

* put snark in a black_box when benchmarking verification time

* fix error in benches

* make addition complete. test addition corner cases. optimizations

* optimization and comment

* fix errors

* all tests pass

We currently implement a constant-factor compression, but in the future we will provide an exponential reduction in proof sizes

* use pasta_msm crate for MSM

* add repr-c to pasta_curves

* add +stable

* update pasta-msm version

* begin adding verification checks

* add verifier checks

* remove unnecessary dead_code

* Fix dependencies

* Replace rug with num-bigint

* Update README.md

* Update README.md

* recursion attempt

* address clippy

* initialize the running instance and witness of the primary correctly

* add asserts for debugging

* fix a bug in AllocatedPoint

* add debug statements

* fix an issue with how we inputize hashes; remove debug statements

* rename

* cleanup

* speedup tests

* require step_circuit implementors to provide a way to execute step computation

* recursion APIs (WIP)

* PublicParams struct and associated new

* fix build

* draft of APIs

* start with tests

* add a test case for the base case of recursion

* move StepSNARK to nifs.rs in prep for recursion APIs

* clippy

* output the incoming instance as the running instance in one of the circuits

* Make some verifier circuit inputs optional (for base case)

* remove unneeded tracking and checks

* remove unused error type

* switch to RO in the Group trait

* simplify compression

* absorb IO as bignum for relaxedR1CS

* add hash(params, U, z0, zi, i) when generating a challenge

* address clippy

* apply a hash function before adding to transcript

* truncate shape_digest into 250 bits

* add missing file

* fix clippy

* cargo fmt

* implement transcript methods for various types

* address clippy

* add shape to transcript

* fix build

* switch to stable

* remove send + sync

* introduce a new associative type to capture any form of preprocessing on group elements

* update pasta_curves version

* simplify trait requirements

* fix clippy

* make gadgets public, expose coords, cleanup

* fix clippy