Bug fixes ...
Classify was wrong.
If we get through the squaring, that's composite.
Fix the main-loop iteration.
Costs 4 bytes (234).
Classify does zero test - saves 3 bytes (231).
Fix accounting for OR
If x**(n-1)==-1 (mod n) then n is composite... (236).
Add the seventh base.
Use 1-hot signaling; long pulse to start.  Saves 4 bytes.  (232).
Comments on tradeoffs
Bug fix - use the correct base...
Save 4 bytes on the main loop iteration (228).
Bug fix - correct squaring loop iteration.
Only need OUT with A; no cost but output random on boot.
Change the bit used for success; saves a byte (227).
Redundant makefile rules.
Current state of play wrt design.