Transformers in Disguise (Robbers' Thread) The cop's thread is here

The robber's task is to find a program of size equal to or less than the cop's program, which, when given an itself as input, produces the same output as the cop's program.

Additionally, even if a cop's answer is provisionally marked Safe and has been revealed, you can still crack it by finding an input that is not the same as the given source code, but still produces the same output.

Rules:


Submissions consist of


Language name + flags
Username of the cop with a link to the original post
The cracked program

An explanation would be appreciated
Your goal is to crack the most Cop's programs


Some Examples:

brainfuck, xxx's submission

[,[&gt;,]&lt;[.&lt;]]


Try It Online! 

This program simply reverses the input

Good luck!
Node.js v10.9.0, Arnauld



o=&gt;[...o].sort(n=&gt;16&amp;(j+=13),j=9).join``


Try it online!

This outputs this particular permutation of itself when using Node's current sorting algorithm:

&amp;`nij.9=j.,)r31n=+(=ooj`[o.o.)1.s](&gt;=6&gt;t


An insightful comment by l4m2 gave me a headstart, but I had to write a brute-forcer to figure out which permutation of digits gives the correct output...