Woe! A non-pedantic counter-argument. I wasn't expecting that. But then, nobody expects....

And you are, as usual, correct.

I could argue that "knowledge of the algorithm" covers it, but in truth, I hadn't even considered it :)

But then again, I did say:

the iteration order of hashes, (also unspecified), is defined, (as a matter of practicality), to be the simplest or most efficient, (which are often the same thing), order of traversal of the data-structures underlying the implementation.

which absolutlely does cover it. So, halvsies :)