The perlsec passage to which you linked says the order shouldn't be assumed to be random. The perlrun passage to which you link doesn't explicitly mention changing key orderings at all. It is not the purpose of the feature to alter the key ordering, much less making it random.
Two problems with your assumption:
The feature in question only kicks in when needed.
Even if you could reliably trigger the feature, it's purpose is to salt the hashing algorithm (i.e. perturb bucket selection). While this has the side effect of affecting key ordering, it hasn't been shown to produce random key orderings.
But enough theory. Let's look at a practical example:
for (1..100) { my %h; $h{$_} = 1 for 'a'..'z'; print(join('', keys(%h)), "\n"); }
wraxdjyukhgftienvmslcpqbzo wraxdjyukhgftienvmslpcqbzo wraxdjyukhgftienvmslpcqbzo wraxdjyukhgftienvmslpcqbzo wraxdjyukhgftienvmslpcqbzo wraxdjyukhgftienvmslpcqbzo ... wraxdjyukhgftienvmslpcqbzo wraxdjyukhgftienvmslpcqbzo
And the same if I run the program again.
In reply to Re^4: Get the order of HTTP request headers
by ikegami
in thread Get the order of HTTP request headers
by arc_of_descent
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |