ci / wide sweep (manual) (11) (push) Skipped
ci / wide sweep (manual) (24) (push) Skipped
ci / wide sweep (manual) (16) (push) Skipped
ci / wide sweep (manual) (32) (push) Skipped
ci / wide sweep (manual) (8) (push) Skipped
ci / cold cache (manual) (push) Skipped
ci / baseline (11 bit) (push) Canceled after 0s
ci / cell 8 (push) Canceled after 0s
ci / cell 16 (push) Canceled after 0s
ci / cell 32 (push) Canceled after 0s
Back to the RPN idea, but written down before any code: the command protocol (* + , - . / are exactly 0x2A..0x2F, digits 0x30..0x39, so one bit 4 test splits them and t = C - 0x2A is the command index), the memory map (working cells, a fixed 4 deep stack, library scratch, a pre-seeded constant block), the step budget per token, and the five stages with the driver each one gets verified by. Two decisions recorded there: EOF (0) ends the loop by erasing its counter, and the stack stays a fixed 4 cells -- .tp is an assembly time constant, so a moving stack pointer is the one thing this machine cannot do cheaply.