test(server): condense the indexer-service de-flake test comments

Signed-off-by: puneetmahajan <59960662+puneet2019@users.noreply.github.com>

Author: puneet2019

server/indexer_service_test.go

@@ -88,11 +88,8 @@ func TestIndexerServiceRetriesAfterFetchError(t *testing.T) {
 		height:   1,
 		headerCh: make(chan coretypes.ResultEvent, 4),
 	}
-	// Exactly ONE failure: recovery then needs a single wake-up token. With two
-	// failures the test needed two tokens, but the new-block signal channel has
-	// capacity 1 and the subscription goroutine coalesces close headers into
-	// one token — under the -race scheduler that interleaving stranded the
-	// second retry on the 60s timeout and tripped the 10s deadline (flake).
+	// One failure → recovery needs exactly one wake-up token. (Two needed two, but the
+	// capacity-1 signal channel coalesces close headers into one → the old -race flake.)
 	client.failuresLeft.Store(1)
 	idxr := &mockIndexer{indexed: make(chan int64, 8)}
 
@@ -109,22 +106,16 @@ func TestIndexerServiceRetriesAfterFetchError(t *testing.T) {
 		}
 	}
 
-	// Phase 1 — busy-loop discriminator. Attempt 1 fails on startup catch-up
-	// (height 1) and NO wake-up has been sent: the correct loop must park on
-	// the new-block signal. The pre-fix busy-loop retried the failing fetch
-	// immediately, so it would have recovered and indexed without any signal.
+	// Phase 1 — busy-loop check: startup catch-up (height 1) fails, no signal sent.
+	// Correct code parks; a busy-loop retries immediately and indexes without a wake-up.
 	select {
 	case h := <-idxr.indexed:
 		t.Fatalf("indexed height %d without a wake-up: busy-loop regression", h)
-	case <-time.After(1500 * time.Millisecond):
-		// parked, as it should be
+	case <-time.After(1500 * time.Millisecond): // parked, as it should be
 	}
 
-	// Phase 2 — latch discriminator + recovery. A single signal is a single
-	// retry token: attempt 2 succeeds and the loop catches up through height
-	// 2. Deterministic under any interleaving (recovery needs exactly one
-	// token). The latched pre-fix version never re-enters the fetch, so it
-	// stays parked and trips the deadline.
+	// Phase 2 — latch check: one signal = one retry token. Correct code clears the error
+	// and catches up (heights 1–2); the latched variant stays parked and trips the deadline.
 	signal(2)
 
 	deadline := time.After(10 * time.Second)