> Interestingly, .NET 6 implementation of the hash table keeps the items in the (rough) order of addition. To prevent potential correlation attempts, the hashed data is sorted before storing, effectively randomising the order of elements.

Can someone please explain how would correlation attacks be executed in this context?