This is the repo where I wrote my various implementations and experiments: https://github.com/raganwald/FRACTRAN/ https://github.com/raganwald/FRACTRAN/ One o

This is the repo where I wrote my various implementations and experiments: https://github.com/raganwald/FRACTRAN/ https://github.com/raganwald/FRACTRAN/ One of the versions that didn't make it into the essay used this pipelining notation for combining a FRACTRAN program with the starting seed: 10 |> 3/11 847/45 143/6 7/3 10/91 3/7 36/325 1/2 36/5 I had some idea that this could evolve into writing different fractran programs to handle converting a seed in ordinary integer form into whatever the core function wanted, filtering the values of n as we do with PRIMEGAME, or picking the last value of n as we do with FIBGAME. Doubt anything will come of it, but anyhow, the original idea seems close to what you're suggesting. What would make the pipelining ida interesting, of course, would be compiling such notation to a single FRACTRAN program.