35 Commits

Author	SHA1	Message	Date
wborgeaud	7793b5a956	Identify problem in GMiMc	2021-07-14 20:54:30 +02:00
wborgeaud	139430c549	Fixed GMiMC	2021-07-13 09:15:16 +02:00
wborgeaud	ad24f5d4d1	Almost working recursive verifier	2021-07-12 14:25:28 +02:00
wborgeaud	9cd5f82090	Add verification to scaling gadget	2021-07-08 15:21:47 +02:00
wborgeaud	274ec48f5e	Update comments	2021-07-06 11:19:58 +02:00
wborgeaud	4a27a67bab	Constraint degree should be at least 3	2021-07-06 11:10:08 +02:00
wborgeaud	151d1ad07b	Remove addendum	2021-07-06 11:00:05 +02:00
wborgeaud	50cafca705	Partial products of quotient	2021-07-06 10:51:32 +02:00
wborgeaud	1915ef9b27	Minor improvements	2021-07-02 10:58:59 +02:00
wborgeaud	d456efbc3f	Minor addition to partial product test	2021-07-02 10:20:44 +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	dcde599377	Merge pull request #85 from mir-protocol/efficient_insert ... Efficient insert	2021-07-01 17:43:44 -07:00
Daniel Lubarov	519533d4b7	Benchmark tweaks (#83) ... - Configure FRI with a list of arities that's more appropriate for a 2^14 instance. The previous config resulted in a huge final polynomial. - Log the blinding factors, and other logging tweaks.	2021-07-01 10:53:42 -07:00
wborgeaud	20e6d6540f	Add comments	2021-07-01 17:28:30 +02:00
wborgeaud	1858a869a7	Optimize products of 1 element	2021-07-01 15:57:55 +02:00
wborgeaud	59410447bf	Add lengths to CommonData	2021-07-01 15:41:01 +02:00
wborgeaud	c83382aaaa	Working partial products	2021-07-01 15:20:16 +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	f7c4a463fc	Progress	2021-06-30 18:54:28 +02:00
wborgeaud	b8e764bb90	Allow for degree^2 < num_routed_wires	2021-06-30 16:48:41 +02:00
wborgeaud	b7f0352cd8	Update comment on reduce	2021-06-30 08:25:36 +02:00
Daniel Lubarov	f1e3474fcb	Simple reduce (#78) ... * Simple reduce * Fix bug causing test failure	2021-06-29 12:33:11 -07:00
wborgeaud	636d8bef07	Comments	2021-06-25 17:24:22 +02:00
wborgeaud	b62c2e6990	Supplant ArithmeticGate with ArithmeticExtensionGate	2021-06-25 16:31:10 +02:00
wborgeaud	8a119f035d	Working ReducingFactorTarget	2021-06-25 16:27:20 +02:00
wborgeaud	beadce72fc	Add ZeroOutGenerator	2021-06-25 15:11:49 +02:00
wborgeaud	517c75abe2	Add comment for ReducingFactor	2021-06-23 11:51:16 +02:00
wborgeaud	492b04843e	Optimize some polynomial operations to avoid cloning.	2021-06-23 11:41:32 +02:00
wborgeaud	9db7dce738	scale -> reduce	2021-06-17 22:06:53 +02:00
wborgeaud	fe9cd3f76b	Working commitments and verifier	2021-06-17 21:34:04 +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