Derive hash FE (#460)

* Derive hash

* More derive hash

* Clippy

---------

Co-authored-by: Mario Rugiero <[email protected]>

Author: MauroToscano

math/src/field/element.rs

@@ -12,7 +12,8 @@ use super::fields::montgomery_backed_prime_fields::{IsModulus, MontgomeryBackend
 use super::traits::{IsPrimeField, LegendreSymbol};
 
 /// A field element with operations algorithms defined in `F`
-#[derive(Debug, Clone)]
+#[allow(clippy::derived_hash_with_manual_eq)]
+#[derive(Debug, Clone, Hash)]
 pub struct FieldElement<F: IsField> {
     value: F::BaseType,
 }

math/src/field/fields/fft_friendly/stark_252_prime_field.rs

@@ -7,7 +7,7 @@ use crate::{
     unsigned_integer::element::{UnsignedInteger, U256},
 };
 
-#[derive(Clone, Debug)]
+#[derive(Clone, Debug, Hash)]
 pub struct MontgomeryConfigStark252PrimeField;
 impl IsModulus<U256> for MontgomeryConfigStark252PrimeField {
     const MODULUS: U256 =

math/src/field/fields/montgomery_backed_prime_fields.rs

@@ -19,7 +19,7 @@ pub trait IsModulus<U>: Debug {
     const MODULUS: U;
 }
 
-#[derive(Clone, Debug)]
+#[derive(Clone, Debug, Hash)]
 pub struct MontgomeryBackendPrimeField<M, const NUM_LIMBS: usize> {
     phantom: PhantomData<M>,
 }

math/src/unsigned_integer/element.rs

@@ -21,7 +21,7 @@ pub type U128 = UnsignedInteger<2>;
 /// The most significant bit is in the left-most position.
 /// That is, the array `[a_n, ..., a_0]` represents the
 /// integer 2^{64 * n} * a_n + ... + 2^{64} * a_1 + a_0.
-#[derive(Debug, Copy, Clone, PartialEq, Eq)]
+#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
 pub struct UnsignedInteger<const NUM_LIMBS: usize> {
     pub limbs: [u64; NUM_LIMBS],
 }