Hashlife w/webassembly

Awhile ago, I wanted to play around with web-centric computing using webassembly and rust. For a project, I picked out the hash-life algorithm an unintuitive fast and powerful algorithm for simulating Conway’s Game of life.

The app looks like this (click to go to deployed demo!):

To test the full power of the hashlife algorithm, I would recommend:

1. “Select builtin pattern” and selecting either “twinprimes.rle”
2. Pressing both “fast-forward” button and the “skip” button a few times
3. Increasing the brightness to the max
4. Waiting for a few seconds.

You should see the results look something like this:

Note that the dots coming out of the machine correspond one to one with the twin primes! This machine is a prime sieve!

Code here: https://github.com/benblack769/hashlife-rust