I remember spending countless hours with Fractint (https://en.wikipedia.org/wiki/Fractint) in the 1990s. Back then the programme fit on a floppy disk (or so). Today the latest version from https://fractint.org/ is about 9 MiB in size.
If you want to transmit n pictures of the Mandelbrot set, you can either send me n PNGs, or you can transmit Fractint once and n tuples of (top, left, bottom, right) coordinates. You can do the math what size n you need before the former becomes much, much bigger than the latter.
But, I like the spirit of your comment. So perhaps the thought-provoking thing might be the following observation:
Most of the bytes and complexity in the fractint binary are not at all necessary for displaying the fractals. You could generate them with much simpler software. No, most of the bytes are there to generate the fractals _quickly_.
Kolmogorov complexity doesn't care about runtimes as long as they are finite. Humans do.