From 01dfdbc468b8d11ff6f3cdc903cb81830fb3a234 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 | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/kimchi/src/circuits/polynomials/permutation.rs b/kimchi/src/circuits/polynomials/permutation.rs
index 6fcd9b79e1..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]) * ...