Does anyone know of a (non-cryptographic) hash function which, for a given input of unique integers, produces the same value regardless of the order in which the integers are fed into the computation, and which more or less uniquely identifies that set of integers?
For example sum would work (since 2+3 == 3+2) if not for the property that 2+3 == 1+4.
@drew Fractran is like that. Your encoder/decoder is a series of fractions.
https://en.wikipedia.org/wiki/FRACTRAN
https://wiki.xxiivv.com/site/fractran.html