Program compressor

Question

Choose a language and write a program in the language that:

• Take a valid program of the language as input,
• Output a string(bytearray, etc.). It needn't be a valid program.
• Only finite valid inputs result in longer/same-length(in bytes) output.
• Different valid input, even if behave same, lead to different output.

Let length of your code as \$L\$ and number of inputs with longer/equal-length output as \$n\$. To win, you should be lowest on at least one of:

• \$L\$,
• \$N\$,
• \$L+N\$,
• \$L+\log_2(N+1)\$.

Notes

• Solution exist so long as illegal substring exist.

• Caelus: Please make the objective and rules of the challenge clearer.
• l4m2: @Binary198 Please make your request clearer :)
• Caelus: Well, what is the program intended to do exactly, and how does the scoring system work?
• l4m2: @Binary198 To compress all programs but finite ones. Some users would make four questions for four scoring way but it likely make a mess
• Caelus: So, you need to take a program as input and output a unique string that will be longer than or equal to in length than the input? Still, the scoring system is weird. What is \$N\,ドル and why are there multiple scoring ways? I would usually just go with one.

Answer 1

Python 3.8 (pre-release), \$L=79\$, \$N\approx255^{1500}\$

^{-3 bytes thanks to @Jonathan Allan}

f=lambda b,s=0,l=0:b and f(b[1:],255*s+b[0],l+1)or s.to_bytes(l-(l>1500),"big")

Try it online!

Python source code can't contain null bytes. This converts the input (bytestring) to base 255 and then back to bytes. After 1500 removes a redundant byte.

• l4m2: Do you save one byte iff length>1500?
• AnttiP: @l4m2 Yes, exactly
• Jonathan Allan: You don't need the f= (I guess you were going to go with a recursive function which would need it, and left it in).
• Jonathan Allan: Using recursion (which I think we may assume to have no limit set for code-golf purposes), you could do f=lambda b,s=0,l=0:b and f(b[1:],255*s+b[0],l+(l!=1500))or s.to_bytes(l,"big") for \$L=78\$ TIO
• Jonathan Allan: Hmm, maybe not - I don't understand this error