From 9d95fc96fcd5351b042730f2e90aadd29e837b3f Mon Sep 17 00:00:00 2001
From: Mikhail Volkhov <volhovm.cs@gmail.com>
Date: Mon, 27 Jan 2025 12:31:59 +0000
Subject: [PATCH] Cosmetics

---
 kimchi/src/circuits/polynomials/permutation.rs | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/kimchi/src/circuits/polynomials/permutation.rs b/kimchi/src/circuits/polynomials/permutation.rs
index d6007e80e3..e5a7268981 100644
--- a/kimchi/src/circuits/polynomials/permutation.rs
+++ b/kimchi/src/circuits/polynomials/permutation.rs
@@ -252,6 +252,9 @@ impl<F: PrimeField, G: KimchiCurve<ScalarField = F>, OpeningProof: OpenProof<G>>
         //~ $$
         //~
         let perm = {
+            // @volhovm: wondering: is it more efficient to map them all individually first, and
+            // then fold... or map and reduce row by row at the same time?
+
             // shifts = z(x) *
             // (w[0](x) + gamma + x * beta * shift[0]) *
             // (w[1](x) + gamma + x * beta * shift[1]) * ...
@@ -432,7 +435,6 @@ impl<F: PrimeField, G: KimchiCurve<ScalarField = F>, OpeningProof: OpenProof<G>>
         gamma: &F,
         rng: &mut (impl RngCore + CryptoRng),
     ) -> Result<DensePolynomial<F>, ProverError> {
-
         let n = self.cs.domain.d1.size();
 
         let zk_rows = self.cs.zk_rows as usize;