Minor update

src/dusk.rs

@@ -223,8 +223,8 @@ impl JubJubExtended {
     /// a member of the prime-order subgroup, we return it. If not, we increment
     /// the counter and try to de-serialize again.
     ///
-    /// **Note:** This implementation of `hash_to_point` is not ideal, in the
-    /// long run we want to implement an algorithm outlined
+    /// **Note:** This implementation of `hash_to_point` is not constant time,
+    /// in the long run we want to implement an algorithm outlined
     /// [here](https://datatracker.ietf.org/doc/html/rfc9380), but we start with
     /// this implementation in order to be able to use the API already.
     pub fn hash_to_point(input: &[u8]) -> Self {
@@ -237,13 +237,15 @@ impl JubJubExtended {
                 .update(input)
                 .update(&counter.to_le_bytes())
                 .finalize();
-            let bytes = state.as_bytes();
 
-            array.copy_from_slice(&bytes[..32]);
+            array.copy_from_slice(&state.as_bytes()[..32]);
 
+            // check if we hit a point on the curve
             if let Ok(point) =
                 <JubJubAffine as Serializable<32>>::from_bytes(&array)
             {
+                // check if this point is part of the correct subgroup and not
+                // the identity
                 if point.is_prime_order().into() {
                     return point.into();
                 }