diff --git a/ipnsort/Cargo.toml b/ipnsort/Cargo.toml
index edf6d08..ac13776 100644
--- a/ipnsort/Cargo.toml
+++ b/ipnsort/Cargo.toml
@@ -13,6 +13,9 @@ doctest = false
 test = false
 
 [dependencies]
+# sort_comp = { git = "https://github.com/Voultapher/sort-research-rs", rev = "37f8b56b7d8af1b3578feabee3c2193c0743bdc4", default-features = false, features = [
+#     "partition",
+# ] }
 
 [dev-dependencies]
 sort_test_tools = { path = "../sort_test_tools", default-features = false }
diff --git a/ipnsort/src/quicksort.rs b/ipnsort/src/quicksort.rs
index 9dbbe49..643d111 100644
--- a/ipnsort/src/quicksort.rs
+++ b/ipnsort/src/quicksort.rs
@@ -257,9 +257,9 @@ fn partition_lomuto_branchless_cyclic<T, F>(v: &mut [T], pivot: &T, is_less: &mu
 where
     F: FnMut(&T, &T) -> bool,
 {
-    // A Kind of branchless Lomuto partition paired with a cyclic permutation. As far as I can tell
-    // this is a novel idea, developed by the author Lukas Bergdoll. Refined code-gen by Orson
-    // Peters to avoid the cmov.
+    // A Kind of branchless Lomuto partition paired with a cyclic permutation. To the author's
+    // knowledge this is a novel idea, developed by Lukas Bergdoll. Refined code-gen by Orson Peters
+    // to avoid a cmov.
 
     // Manually unrolled to ensure consistent performance across various targets.
     const UNROLL_LEN: usize = 2;