While were on the topic of fractals*, how do people produce stuff like this: https://www.youtube.com/watch?v=thlvdXfl0KA

I written a few Mandelbrot explorers in my time. In fact, whenever I want to learn a new language, my go to first problem is the Mandelbrot set because it lends itself to concurrent computations so well. However, even disregarding the arbitrary precision needed for these zoom levels, with any of the programs I have written, it would take a ridiculously long time to run.

I’m aware of some of the obvious optimizations like rather than looking for absolute value greater than 2, look for a squared value greater than 4, so you don’t have to do a square root. But even with these kinds of optimizations, there is still no way my Core i7 could get there in any reasonable amount of time.

So my question is: is this stuff as it seems or is there some other kind of trickery going on?

*Seems like this question has been answered and my related question is probably not deserving of it’s own thread.