Update comment

ConflictSet.cpp

@@ -998,9 +998,10 @@ struct __attribute__((__visibility__("hidden"))) ConflictSet::Impl {
 
     // TODO Descend until queries for front and back diverge
 
-    // Mitigate potential n^2 behavior of insertion by shuffling the insertion
-    // order. Not sure how this interacts with interleaved insertion but it's
-    // probably fine.
+    // Mitigate potential n^2 behavior of insertion (imagine if all inserts
+    // shared the same search path in the pre-existing tree) by shuffling the
+    // insertion order. Not sure how this interacts with interleaved insertion
+    // but it's probably fine. There's a hand-wavy symmetry argument.
     shuffle(rand, stepwiseInserts);
 
     runInterleaved(stepwiseInserts);