diff --git a/src/borg/testsuite/hashindex_stress.py b/src/borg/testsuite/hashindex_stress.py
new file mode 100644
index 000000000..b8821d354
--- /dev/null
+++ b/src/borg/testsuite/hashindex_stress.py
@@ -0,0 +1,37 @@
+import os
+import random
+
+import pytest
+
+from ..hashindex import NSIndex
+
+
+@pytest.mark.skipif("BORG_TESTS_SLOW" not in os.environ, reason="slow tests not enabled, use BORG_TESTS_SLOW=1")
+def test_hashindex_stress():
+    """checks if the hashtable behaves as expected
+
+    This can be used in _hashindex.c before running this test to provoke more collisions (don't forget to compile):
+    #define HASH_MAX_LOAD .99
+    #define HASH_MAX_EFF_LOAD .999
+    """
+    ENTRIES = 10000
+    LOOPS = 1000
+    idx = NSIndex()
+    kv = {}
+    for i in range(LOOPS):
+        # put some entries
+        for j in range(ENTRIES):
+            k = random.randbytes(32)
+            v = random.randint(0, NSIndex.MAX_VALUE - 1)
+            idx[k] = (v, v)
+            kv[k] = v
+        # check and delete a random amount of entries
+        delete_keys = random.sample(list(kv), k=random.randint(0, len(kv)))
+        for k in delete_keys:
+            v = kv.pop(k)
+            assert idx.pop(k) == (v, v)
+        # check if remaining entries are as expected
+        for k, v in kv.items():
+            assert idx[k] == (v, v)
+        # check entry count
+        assert len(kv) == len(idx)