Two-color 26-neighbor totalistic 3D cellular automata run for 240 steps starting from a single live cell. At each step the set of live cells is scaled to fit inside a 1x1x1 cube. The first rule is from NKS p. 183 (top) by Stephen Wolfram; in the second rule a cell becomes live if it has either one or three live neighbors.