diff --git a/noun/hashtable.c b/noun/hashtable.c
index a8660008e..533625f77 100644
--- a/noun/hashtable.c
+++ b/noun/hashtable.c
@@ -220,7 +220,7 @@ _ch_trim_node(u3h_root* har_u, u3h_slot* sot_w, c3_w lef_w, c3_w rem_w)
   map_w = han_u->map_w;
 
   if ( 0 == (map_w & (1 << bit_w)) ) {
-    fprintf(stderr, "empty slot, lef_w: %d rem_w: %d\r\n", lef_w, rem_w);
+    har_u->arm_u.mug_w = _ch_skip_slot(har_u->arm_u.mug_w, lef_w);
     return c3n;
   }
 
diff --git a/tests/hashtable_tests.c b/tests/hashtable_tests.c
index d3eaa0921..1d3dab87b 100644
--- a/tests/hashtable_tests.c
+++ b/tests/hashtable_tests.c
@@ -14,7 +14,7 @@ main(int argc, char* argv[])
 
   //_test_no_cache();
   _test_skip_slot();
-  //_test_cache_trimming();
+  _test_cache_trimming();
 
   return 0;
 }
@@ -78,6 +78,8 @@ _test_skip_slot(void)
     c3_w res_w = _ch_skip_slot(mug_w, 20);
     c3_assert((1 << 25) == res_w);
   }
+
+  fprintf(stderr, "test_skip_slot: ok\n");
 }
 
 /* _test_cache_trimming(): ensure a caching hashtable removes stale items.