fix some comments

math/src/circle/cfft.rs

@@ -76,7 +76,7 @@ pub fn icfft(
 /// [P(x0, y0), P(x2, y2), P(x4, y4), P(x6, y6), P(x7, y7), P(x5, y5), P(x3, y3), P(x1, y1)],
 /// where the even indices are found first in ascending order and then the odd indices in descending order.
 /// This function permutes the slice [0, 2, 4, 6, 7, 5, 3, 1] into [0, 1, 2, 3, 4, 5, 6, 7].
-/// NOTE: This can be optimized by performing in-place value swapping (WIP).  
+/// TODO: This can be optimized by performing in-place value swapping (WIP).  
 pub fn order_cfft_result_naive(
     input: &mut [FieldElement<Mersenne31Field>],
 ) -> Vec<FieldElement<Mersenne31Field>> {
@@ -94,7 +94,7 @@ pub fn order_cfft_result_naive(
 /// [(x0, y0), (x2, y2), (x4, y4), (x6, y6), (x7, y7), (x5, y5), (x3, y3), (x1, y1)],
 /// where the even indices are found first in ascending order and then the odd indices in descending order.
 /// This function permutes the slice [0, 1, 2, 3, 4, 5, 6, 7] into [0, 2, 4, 6, 7, 5, 3, 1].
-/// NOTE: This can be optimized by performing in-place value swapping (WIP).  
+/// TODO: This can be optimized by performing in-place value swapping (WIP).  
 pub fn order_icfft_input_naive(
     input: &mut [FieldElement<Mersenne31Field>],
 ) -> Vec<FieldElement<Mersenne31Field>> {

math/src/circle/cosets.rs

@@ -3,6 +3,12 @@ use crate::circle::point::CirclePoint;
 use crate::field::fields::mersenne31::field::Mersenne31Field;
 use alloc::vec::Vec;
 
+/// Given g_n, a generator of the subgroup <g_n> of the circle of size n,
+/// and given a shift, that is a another point of the cirvle,
+/// we define the coset shift + <g_n> which is the set of all the points in
+/// <g_n> plus the shift.
+/// For example, if <g_4> = {p1, p2, p3, p4}, then g_8 + <g_4> = {g_8 + p1, g_8 + p2, g_8 + p3, g_8 + p4}.
+
 #[derive(Debug, Clone)]
 pub struct Coset {
     // Coset: shift + <g_n> where n = 2^{log_2_size}.