diff --git a/ConflictSet.cpp b/ConflictSet.cpp
index ab9996d..1ed7119 100644
--- a/ConflictSet.cpp
+++ b/ConflictSet.cpp
@@ -2705,8 +2705,8 @@ bool checkRangeRead(Node *n, std::span<const uint8_t> begin,
 
   auto remaining = begin.subspan(0, lcp);
   Arena arena;
-  // If the common prefix isn't a prefix of any physical entry in the tree, we
-  // can go to "downLeftSpine"
+
+  // Advance down common prefix, but stay on a physical path in the tree
   for (;; ++tls->range_read_iterations_accum) {
     assert(getSearchPath(arena, n) <=>
                begin.subspan(0, lcp - remaining.size()) ==
@@ -2750,7 +2750,7 @@ bool checkRangeRead(Node *n, std::span<const uint8_t> begin,
     return checkRangeRightSide(n, end, lcp, readVersion, tls);
   }
 
-  // This makes it safe to check maxVersion within CheckRangeLeftSide. If this
+  // This makes it safe to check maxVersion within checkRangeLeftSide. If this
   // were false, then we would have returned above since lcp == begin.size().
   assert(!(n->parent == nullptr && begin.size() == 0));