https://esolangs.org/wiki/Echo_Tag I could not find any example programs Theoretical Assumes that program never ends 11 blocks, but it can be reduced by 1 block if variable n in repeat (n) block is replaced by a constant. Smallest n that was proven TC is 68
