I understand that it is possible to emulate a connection up to 32 bits by calculating:
x || y = x + (y << len(x)),
Here the left shift (L_SHIFT) can be performed through several consecutive operations: OP_DUP and OP_ADD.
However, this method becomes ineffective once the 32-bit limit is reached, which is the limit of arithmetic operations performed on the stack.
One alternative to circumvent this limitation is to extend the operation over multiple 32-bit segments and incorporate a carry bit or similar mechanism.
Is there another possible way? If not, could you explain why?