Code ladder, Robbers This is the robbers' thread. The cops' thread goes here.
Write a code that has the same number of bytes as the cop post and where the revealed characters are identical. The code must produce 1 in its initial state, and produce the numbers 2, 3 .. when single alterations are made.
The winner will be the robber that cracked the most posts.
Example post:
MyLang, 9 bytes, 8 numbers (including link to answer), Cop's username.
Original code:
abc1efghi

Code that produces 1 - 8:
1: abc1efghi
2: abc2efghi
3: abc2efghij
4: kbc2efghij
5: kbc23fghij
6: kbc23fghi
7: kbc63fghi
8: kbc63fhi

Explanations are encouraged. The exact format of the robber post is optional.
Retina, 2 bytes, 10 numbers, by Martin Ender.
Original code:


1

This replaces the empty input by the number 1.
Code that produces 1 - 10 (showing newlines as \n for convenience):
1 : \n1
2 : \n1\n
3 : \n11\n
4 : \n111\n
5 : \n1111\n
6 : \n11111\n
7 : \n111111\n
8 : \n1111111\n
9 : \n11111111\n
10: \n111111111\n

For 2 and onwards, we count the number of empty strings in the previous stage. For 2, there is an empty string before and after the 1. For 3 there is an empty string before the ones, in between the ones and after the ones. This works all the way up to 10.
Try it online