41 Commits

Author	SHA1	Message	Date
wborgeaud	4bc06deed8	zs_root -> zs_partial_products_root	2021-07-15 10:59:53 +02:00
wborgeaud	ad24f5d4d1	Almost working recursive verifier	2021-07-12 14:25:28 +02:00
wborgeaud	b50a9809db	Start recursive verifier test	2021-07-08 17:16:26 +02:00
wborgeaud	cc3c278a92	Some renaming	2021-07-01 17:34:00 +02:00
wborgeaud	625377b4c0	Merge constant and sigma polynomials	2021-06-25 11:24:26 +02:00
wborgeaud	bfd5f06384	Hardcode Plonk polynomials indices and blinding flags.	2021-06-17 11:54:31 +02:00
wborgeaud	b44a01c975	Merge main	2021-06-15 09:20:00 +02:00
Daniel Lubarov	f929f94626	Have rustfmt group imports (#60) ... * Have rustfmt group imports See `rustfmt.toml`; the rest is automated changes. * fmt	2021-06-10 14:10:35 -07:00
wborgeaud	f7e92af963	Comment out errors	2021-06-09 17:55:49 +02:00
wborgeaud	7f63276623	Merge branch 'main' into recursive_verifier	2021-06-09 10:04:45 +02:00
Daniel Lubarov	72c2e19bc5	Bit of verifier work (#54) ... * Bit of verifier work * Minor * next_plonk_zs now available after William's changes	2021-06-08 21:23:52 -07:00
wborgeaud	c6c71ef574	Working fri_combine_initial	2021-06-08 14:56:49 +02:00
wborgeaud	f5dfe95b2e	Added recursive powers	2021-06-04 17:36:48 +02:00
wborgeaud	897ec3b053	Target version of proof structs	2021-06-04 10:47:46 +02:00
Daniel Lubarov	7334341cfa	Attempt at simplification	2021-06-01 23:27:09 -07:00
wborgeaud	abc0ca3bf1	Rewrite LPC code to be more PLONK-specific	2021-05-31 17:49:04 +02:00
wborgeaud	9cd00532ce	Generic tests	2021-05-18 16:06:47 +02:00
wborgeaud	adf5c2d4ec	Const generics everywhere	2021-05-18 15:44:50 +02:00
wborgeaud	a2cf2c03b6	Working FRI with field extensions	2021-05-18 15:22:06 +02:00
wborgeaud	6ca1b28f7c	Fix bug	2021-05-07 16:22:13 +02:00
wborgeaud	ea7926bd95	Update PLONK prover.	2021-05-06 23:14:37 +02:00
wborgeaud	477fe1ea4a	Minor fixes	2021-05-06 15:14:43 +02:00
wborgeaud	eb3011b02a	More work on polynomial commitments	2021-05-04 17:48:26 +02:00
wborgeaud	187b122c62	Fixes based on Daniel's PR comments.	2021-04-27 08:44:34 +02:00
wborgeaud	2dfdc39680	More progress on arity	2021-04-26 10:58:27 +02:00
wborgeaud	a1023e0ca6	Added PoW	2021-04-22 15:50:08 +02:00
wborgeaud	6b407e45ef	Progress on FRI	2021-04-21 22:31:45 +02:00
wborgeaud	5abd49bf47	Merge	2021-04-12 10:34:40 +02:00
Daniel Lubarov	b183579886	Finish up recursive Merkle proofs	2021-04-09 12:53:33 -07:00
Daniel Lubarov	93b73fb89a	Recursive Merkle proofs	2021-04-09 12:40:43 -07:00
wborgeaud	aa50387d36	Started implementing FRI	2021-04-09 18:24:19 +02:00
Daniel Lubarov	959aaccae6	Merkle proofs	2021-04-08 09:38:57 -07:00
Daniel Lubarov	0cd7339940	Fixes based on PR feedback	2021-04-07 09:10:06 -07:00
Daniel Lubarov	e8eb658f8e	Candidate API for Merkle proof data ... Does this make sense? I think other libraries tend to include the leaf's index (either as an integer, or a series of bits indicating left/right turns) as part of a "proof". In FRI, the leaf indices are chosen by the verifier, so I thought that approach might be sort of redundant. Let me know what you think though.	2021-04-06 19:17:38 -07:00
Daniel Lubarov	234fdc7c99	Bit of refactoring, comments, etc.	2021-04-01 12:49:31 -07:00
Daniel Lubarov	cca79a992c	Sponges etc	2021-03-31 21:15:24 -07:00
Daniel Lubarov	44eeb505eb	Tweaks	2021-03-30 10:02:00 -07:00
Daniel Lubarov	ba96ab4e99	More prover work	2021-03-26 23:51:48 -07:00
Daniel Lubarov	8c95dd11d7	Bit of prover work	2021-03-21 19:50:05 -07:00
Daniel Lubarov	9fdff8ea08	Gate infra	2021-02-26 13:18:41 -08:00
Daniel Lubarov	13cc76316c	Initial commit	2021-02-17 14:36:32 -08:00