This is the cops' thread to a cops-and-robbers challenge. Click the link to find the robbers' thread.

The challenge here is very simple. Create two programs of the same size, in the same language, which output two different numbers, \$x\$ and \$y\$. Submit both programs, both numbers and the language used in an answer on this thread.

Robbers will then attempt to find a program in the same language which outputs a number in between \$x\$ and \$y\$, and is the same length as or shorter than your programs. If they do, they will post it to the robbers' thread, and it is "cracked".

For example If I post:

Haskell, \$9-7 = 2\$, 12 bytes

main=print 7

main=print 9

Then robbers must find a program that prints 8 in 12 bytes or fewer.

Unlike many challenges in cop's do not need to have an answer in mind when posting. It is perfectly valid to post an answer which cannot be cracked at all. In fact that is incentivized. However the scoring means that the better you score the harder it will be to prevent a crack.

Scoring

Your score will be the difference between \$x\$ and \$y\$. So in the example answer it was \$2\$. Higher score is better. If your answer is cracked it's score is automatically set to 0.

Since there is no hidden information that needs to be revealed, answers will not be marked as safe. You get your score as soon as you post the answer and it will remain your score until someone cracks it.