LambdaHack VS falling-turnip

I've recently tried that and gave up (https://github.com/LambdaHack/LambdaHack/issues/248). Perhaps it's possible to statically link SDL2, but I learnt it's impossible to statically link the OpenGL and X11 libraries, so you end up with a partially statically linked binary (I didn't manage to obtain even that).

If you want more performance, falling sand simulators can further be made parallel by implementing them using Margolus Neighbourhoods, as in Falling Turnip: https://github.com/tranma/falling-turnip

The idea is that a single iteration divides the world into 2x2 squares and then applies effects sequentially within each square, but not between the squares. This means each square can be processed independently. In the next iteration, the division into squares shifts right and down by one cell each direction. This does mean you need more steps than in a sequential implementation, but I found it to be quite a principled approach to parallelizing cellular automata when I first read about it. One interesting side effect of this design is that falling particles end up being separated by blank space, as shown here: https://futhark-lang.org/static/falling-sand-2016.12.04.webm I wonder if that is fixable.