Luke Parker 6fec95b1a7 3.7.2 Remove code randomizing which side odd elements end up on ... This could still be gamed. For [1, 2, 3], the options were ([1], [2, 3]) or ([1, 2], [3]). This means 2 would always have the maximum round count, and thus this is still game-able. There's no point to keeping its complexity accordingly when the algorithm is as efficient as it is. While a proper random could be used to satisfy 3.7.2, it'd break the expected determinism.		2023-03-02 11:16:00 -05:00
..
tests	3.7.3 Add multiexp tests	2023-03-02 03:58:48 -05:00
batch.rs	3.7.2 Remove code randomizing which side odd elements end up on	2023-03-02 11:16:00 -05:00
lib.rs	3.7.5 Further document multiexp functions	2023-03-02 05:49:45 -05:00
pippenger.rs	3.7.6, 3.7.7 Optimize multiexp implementations	2023-03-02 06:12:02 -05:00
straus.rs	3.7.6, 3.7.7 Optimize multiexp implementations	2023-03-02 06:12:02 -05:00