What bits is the sorting of elements within a bucket oriented towards?

In the implementation of hash tables in Go, for example in the standard map, when collisions occur, elements within the same bucket are sorted by the lower bits of the hash of the key. That is, the sorting is based on the bits of the hash value, starting from the least significant bits, to efficiently group and search for elements within the bucket.