So, I’m thinking of doing some more of the Project Euler stuff. Not sure how precisely to handle them, since for the most part they’re algorithmic rather than “solve the equation” things …
But it’s a thought for getting more bits. Because as proven by the DES example that I’ve been working on FOREVER, doing the demonstrations for cryptography by hand is slow 