11 Commits

Author	SHA1	Message	Date
wborgeaud	461f24a57e	Merge branch 'main' into more_recursive_verifier ... # Conflicts: # src/polynomial/commitment.rs # src/proof.rs	2021-07-19 07:08:06 +02:00
Daniel Lubarov	83a1430038	Fix some warnings (#94)	2021-07-15 07:34:46 -07:00
wborgeaud	139430c549	Fixed GMiMC	2021-07-13 09:15:16 +02:00
wborgeaud	525db6c461	Merge branch 'main' into fix_z_check ... # Conflicts: # src/circuit_builder.rs	2021-07-02 10:15:23 +02:00
Nicholas Ward	8de59c2a84	cargo fmt	2021-06-30 21:59:18 -07:00
Hamish Ivey-Law	574a3d4847	FFT improvements (#81) ... * Use built-in `reverse_bits`; remove duplicate `reverse_index_bits`. * Reduce precomputation time/space complexity from quadratic to linear. * Several working cache-friendly FFTs. * Fix to allow FFT of constant polynomial. * Simplify FFT strategy choice. * Add PrimeField and CHARACTERISTIC properties to Fields. * Add faster method for inverse of 2^m. * Pre-compute some of the roots; tidy up loop iteration. * Precomputation for both FFT variants. * Refactor precomputation; add optional parameters; rename some things. * Unrolled version with zero tail. * Iterative version of Unrolled precomputation. * Test zero tail algo. * Restore default degree. * Address comments from @dlubarov and @wborgeaud.	2021-07-01 14:55:41 +10:00
wborgeaud	b8e764bb90	Allow for degree^2 < num_routed_wires	2021-06-30 16:48:41 +02:00
wborgeaud	f27620ca90	First impl	2021-06-17 19:40:41 +02:00
wborgeaud	89761ef22a	Added in-circuit reverse_bits and exp.	2021-06-09 17:39:45 +02:00
Daniel Lubarov	6e83d956e9	Finish up	2021-05-19 23:03:52 -07:00
Daniel Lubarov	b14328c2df	Move timed! and call from ListPolynomialCommitment	2021-05-14 07:35:09 -07:00