The cops task is to write a function or program that, when given an input of itself, outputs a finite deterministic string. If the program is given a different input, it should return a different output.
- Submissions consist of
- Language name
- If any flags are used, they should be revealed.
- Byte count of program
- Byte count of output
- If it is particularly long, please provide a pastebin or something similar
- If it contains unprintables, please provide a hexdump.
- Trailing newlines and whitespace should be included in the output
- Where the input is coming from (STDIN, command line, etc.)
- Language name
- If applicable, you may assume that the byte representing EOF is not present in the input, unless you use that byte in your program.
- If your program is cracked, add a link to the corresponding answer in the robber's thread in your title.
- Your program is not safe until a week has passed and you mark it so.
- I disapprove of techniques like seeding random with the input or cryptographic hash functions. I can't stop them, but I will not be accepting a solution that utilises either of these. Also note that some of these techniques might have collisions, where a different string produces the same output.
- Your goal is to have the shortest output. The shortest safe solution posted within three weeks of posting this question wins!
The robber's task is to find a program of size equal to or less than the original, which also obeys the above rules.
If a robber cracks your program with a different solution than intended, then you have the opportunity to 'uncrack' it by proving that the robber's solution is incorrect. You can do this by finding an input to the robber's program that will produce the same output.
brainfuck, 10 bytes, Score: 10
This solution is ,[>,]<[.<] which simply reverses the input