The next sentence says "The test subject is able to flip between the two distortions, and has the original image available on the side for comparison at all times.", which indicates that the subjects weren't shown only the distortions.
Of course you're right, but it doesn't mean anything.
It's like saying that you should buy people lottery tickets instead of healthcare.
I once heard that the US citizens most vehemently against raising taxes for the rich were the homeless, because they didn't want THEIR taxes raised once THEY became rich.
The US causes terrorism by steam rolling third world countries, but more or less has to do it now since these third world countries already hate the US enough to require this kind of policing.
If you encode each packet in a QUIC stream with it's own stream ID, and close QUIC streams after a timeout, you can use QUIC for unreliable unordered transports as well.
> why do you care about how the data is actually stored?
I just said I don't. 'god does not force the user to hash the keys'.
> > To map keys to values, a mapping structure is needed. For infrastructural reasons (synchronization and cleaning) as well as for functionality of different kinds, we need a sorted mapping, and it has to be deterministically structured.
> why?
Functionality: To be able to return the first or the n'th entry it has to be ordered.
Synchronization/cleaning: To be able to hash element 0000-000f we need an efficient way to fetch a segment of elements, thus it again has to be ordered.
To optimize the hashing so that I don't have to keep two separate data structures I keep the hashes in the nodes of the sorted data structure. Thus the structure has to be deterministically structured or the hashes won't be equal even if the trees contain the same data.
I would have preferred other algorithms, but there was a strict need for 1) sorted data and 2) that 2 identical trees had the same structure (for the merkle element). Not many structures were left to choose from, and radix seemed to work well enough.