* refactor(r1cs-std/boolean): expose enforcing value less than functionality

* fix(r1cs-std/boolean): ensure num_bits is calculated correctly from the arg

* feat(primitives/blake2s): allow creating Blake2s with custom params

* add a pre-commit hook for rustfmt

* make printing sccache stats optional

* fixup! add a pre-commit hook for rustfmt

* Implement CanonicalSerialize/Deserialize improvements

* Improve code readability by using cursor

* Add tests for uncompressed serialization

* Improve serialization size (do not require full u64 limbs to be serialised)

* Change Flags to enum types

* Split up serialization with and without flags.

* Implement simple derive macro

* Derive traits for Groth16 and GM17 keys and proofs

- contributes to #50,
- depends on #53 and builds on it,
- due to coherence & requirements of `num_traits::{Zero, One}` to implement `std::ops::Add<Self, ..>` and (resp.) `std::ops::Mul<Self, ..>`, I've had to replace the afferent `impl<'a, P: ..> (Add|Mul)<&'a Self> for Group(Affine|Projective)<P>` by direct implementations on `Self`,
- I did not have to fight the borrow checker for this conversion => I think this hints arithmetic operations are called in contexts where the operand is owned,
- hence should this end up on a merge track, we may want to open an issue to convert the `impl<'a, P:..> (Neg|Sub|..)<&'a Self> for ..<P>` trait usage to direct `impl<P:..> (Neg|Sub|..)<Self> for ..<P>`
- the `impl AddAssign for GroupAffine<P>` in curves/models/short_weierstrass_jacobian.rs is provided to fit trait bounds, and without any guarantee of suitability for any particular purpose
- and that, even though I don't think it's used.

eliminate a few redundant references

avoid return when it cant be early (in a simple if-else)

See https://rust-lang.github.io/rust-clippy/master/#explicit_into_iter_loop

Co-Authored-By: Pratyush Mishra <pratyushmishra@berkeley.edu>

Co-Authored-By: Pratyush Mishra <pratyushmishra@berkeley.edu>

Co-Authored-By: Pratyush Mishra <pratyushmishra@berkeley.edu>