28 Commits

Author SHA1 Message Date
Nicholas Ward
f1dc1d4446 fix 2021-11-30 15:31:06 -08:00
Nicholas Ward
b9868ec782 multiplication using projective 2021-11-30 15:31:06 -08:00
Nicholas Ward
86573fc65c resolve 2021-11-30 15:31:06 -08:00
Nicholas Ward
0e6c5bb80c curve gadget changes 2021-11-30 15:31:06 -08:00
Nicholas Ward
2c2d36a6be merge 2021-11-30 15:31:06 -08:00
Nicholas Ward
f639dd3359 fixes to nonnative 2021-11-10 09:58:15 -08:00
Nicholas Ward
9077c7fa3c BigUint arithmetic, and cleanup 2021-11-10 09:57:32 -08:00
Nicholas Ward
7e8c021b46 comparison gate 2021-11-10 09:53:28 -08:00
Nicholas Ward
d334a924b4 merge new circuit builder stuff 2021-11-09 18:10:47 -08:00
Nicholas Ward
7054fcdaf9 initial 2021-11-09 18:09:39 -08:00
Nicholas Ward
a00f2536ff initial memory sorting gadget 2021-09-16 20:44:17 -07:00
Nicholas Ward
b0a855a9c3 progress on permutation 2021-09-03 18:07:20 -07:00
Nicholas Ward
32c8c366bf added random access gadget 2021-08-04 10:58:12 -07:00
wborgeaud
b65e792ff3 - Remove useless rotation gadgets
- rotate.rs -> select.rs
- Added `select()` and `select_ext`
- Optimize to use just one gate
2021-07-22 11:58:29 +02:00
wborgeaud
fc4738869d Rearrange files 2021-06-25 16:45:02 +02:00
wborgeaud
cfa5807556 Add insert gadget to insert inferred leaf in FRI query rounds 2021-06-14 15:15:22 +02:00
wborgeaud
dea6db00ac Rotation gadgets 2021-06-10 17:45:45 +02:00
wborgeaud
6cce4c1f78 Add low-high split 2021-06-10 15:55:29 +02:00
wborgeaud
e50d0aa63d Interpolation of two points 2021-06-07 21:24:41 +02:00
wborgeaud
51c06d74ee Recursive PoW 2021-06-04 16:02:48 +02:00
wborgeaud
4f6e9fb2e0 Recursive evaluation for interpolation gate. 2021-05-24 17:31:55 +02:00
Daniel Lubarov
93b73fb89a Recursive Merkle proofs 2021-04-09 12:40:43 -07:00
Daniel Lubarov
04f74446fa Misc fixes to get tests green again 2021-04-09 11:40:51 -07:00
Daniel Lubarov
959aaccae6 Merkle proofs 2021-04-08 09:38:57 -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
4086b2b447 Arithmetic & permutation gadgets 2021-04-02 15:29:21 -07:00
Daniel Lubarov
f42120482a No more polynomial programming abstraction
It was too expensive.
2021-03-28 19:52:01 -07:00
Daniel Lubarov
ca7f20bf45 FriConsistencyGate 2021-03-18 12:44:45 -07:00