Hi porters, I am sorry for raising this question, in some sence it could be considered as implementation detail question, hence looks like porters question. The web sometimes says that hashes are O(1) operations, but this does not seems correct to me, otherwise there would be no so-called "hash complexity attack" that was considered in 5.8.1 verison. What is the worst-case complexity? I will be very grateful for an educated opinion on the matter. Thanks in advance, Vadim.Thread Next