I said k^n (simplified to 2^n), not k*n. The size of the in…

I said k^n (simplified to 2^n), not k*n. The size of the in-script *interpreter* grows exponentially with the size of the longest script it can interpret. But I already think I jumped the gun here :x it'd be (2^k * n) for k ops which indeed is O(n)