diff --git a/core/java/src/net/i2p/data/DataHelper.java b/core/java/src/net/i2p/data/DataHelper.java
index 07997fd105eb5fc2a86e05aca360c0e40daa1526..3c83d65276006f2130160346b3f705e1e7163f03 100644
--- a/core/java/src/net/i2p/data/DataHelper.java
+++ b/core/java/src/net/i2p/data/DataHelper.java
@@ -829,14 +829,14 @@ public class DataHelper {
      */
     public static int hashCode(byte b[]) {
         // Java 5 now has its own method, and the old way
-        // is horrible for arrays smaller than 32.
+        // was horrible for arrays much smaller than 32.
         // otoh, for sizes >> 32, java's method may be too slow
         int rv = 0;
         if (b != null) {
             if (b.length <= 32) {
                 rv = Arrays.hashCode(b);
             } else {
-                for (int i = 0; i < b.length && i < 32; i++)
+                for (int i = 0; i < 32; i++)
                     rv ^= (b[i] << i);  // xor better than + in tests
             }
         }