‘Ello gents! I just figured out a way to circumvent the max multiplication limit. We just avoid it, I set up an infinite duplicate + add loop (basically multiply by two). I then made it recursive by routing the output back as input. This is basically exponential, but slower than a direct multiply. Since it’s recursive and always fed, any upper values get truncated and we still harvest the ultra-high numbers infinitely