diff --git a/pkg/skills/search_cache.go b/pkg/skills/search_cache.go
index a1584e747..5d7d2797e 100644
--- a/pkg/skills/search_cache.go
+++ b/pkg/skills/search_cache.go
@@ -171,7 +171,7 @@ func normalizeQuery(q string) string {
 
 // buildTrigrams generates hash of trigrams from a string.
 // Example: "hello" → {"hel", "ell", "llo"}
-// "hel" -> 0x0068656c -> 4 bytes; compared to 16 byptes of a string
+// "hel" -> 0x0068656c -> 4 bytes; compared to 16 bytes of a string
 func buildTrigrams(s string) []uint32 {
 	if len(s) < 3 {
 		return nil
diff --git a/pkg/skills/search_cache_repro_test.go b/pkg/skills/search_cache_repro_test.go
deleted file mode 100644
index 5b46409a9..000000000
--- a/pkg/skills/search_cache_repro_test.go
+++ /dev/null
@@ -1,36 +0,0 @@
-package skills
-
-import (
-	"testing"
-	"time"
-)
-
-func TestSearchCache_LRU_Behavior(t *testing.T) {
-	// Capacity 3
-	cache := NewSearchCache(3, time.Hour)
-
-	// Fill cache: query-A, query-B, query-C
-	// Use longer strings to ensure trigrams are generated and avoid false positive similarity
-	cache.Put("query-A", []SearchResult{{Slug: "A"}})
-	cache.Put("query-B", []SearchResult{{Slug: "B"}})
-	cache.Put("query-C", []SearchResult{{Slug: "C"}})
-
-	// Access query-A (should make it most recently used)
-	// In correct LRU behavior, this access updates the order so query-A is not evicted next.
-	if _, found := cache.Get("query-A"); !found {
-		t.Fatal("query-A should be in cache")
-	}
-
-	// Add query-D. Correct LRU behavior should evict query-B (the least recently used).
-	cache.Put("query-D", []SearchResult{{Slug: "D"}})
-
-	// Check if query-A is still there
-	if _, found := cache.Get("query-A"); !found {
-		t.Fatalf("query-A was evicted! valid LRU should have kept query-A and evicted query-B.")
-	}
-
-	// Check if query-B is evicted (if A was kept, B should be gone)
-	if _, found := cache.Get("query-B"); found {
-		t.Fatal("query-B should have been evicted")
-	}
-}