Random VS strop

Sure here is a an example (repository) (click "run" to see it work) contrasting the two in Rust, note that it is not fully symbolic, just the imaginary component. But the immediate advantage one can see is allowing direct computation without needing to modify the polynomial multiplication algorithm. (As noted in the source code, this is a purely theoretical advantage).

I can't help you with the specific website, but here's a trivial cli implementation of Game of Life.

I've been sitting on my hands when it comes to updating my library, but if you really want a fast test, you can use some of my research/implementation for RCPrime, with creditation of course. I'm not sure what algorithms FLINT uses, but I'm fairly certain that the RCPrime implementation is the most efficient for integers less than 2^35 (requiring 64 multiplications and only one strong fermat test) even if you implement with Montgomery exponentiation.

Here is a sample implementation along with the inverses of the first 128 primes (in hex). (Except 2, which can be easily checked by the &1 trick)

Not what one normally considers in CS, but producing a fast deterministic test for checking primality in the interval 0;2^64 with some extensions beyond. Fully constructing one to 2^128 is well beyond what is currently computable, however some progress has been made that surpasses published bounds.

Working on developing a faster and smaller primality check in the interval 0;2^64 with tentative extensions towards 2^65. While it performs satisfactorily for the intervals currently available, reducing the memory to less than other implementations is a major challenge.

See this other approach for a similar engine, that utilizes a linear bitvector to model cellular automata.

You are way overthinking it. For something like minesweeper you can just model an integer lattice, and use either a 1d vector of integers to represent the positions of the mines or a 1d bitvector and check the values in the chebyshev distance of 1 from the point. (If you use integers like in the first example, your system becomes a plane of 2^32, 2^32 dimensions and is bounded by the number of mines (64-bit integers) that can fit in your RAM)

You can look here for some slightly better ways to test for primality (ignore the different language).

RAND calls a hardware source of Johnson-Nyquist noise (basically electric static), and then performs some filtering on it to make sure that it's evenly distributed. There are faster methods, like a simple "linear" rng, but they frequently don't give as good results.

I am completely rewriting strop, (the code sucks, and I know Rust a lot better than when I started, so I wanted to make it a bit better structured and more idiomatic). And I like to have static analysis make sure my code has certain qualities, so I stick this:

Do you think it's an architecture for strop then? It has a focus on code-generation on platforms not well supported by mainstream compilers

Here is a project for generating code for CPUs that do not have much support from mainstream compilers. Currently supported are the 6502 and the STM8 (I'll possibly be adding others in the future, feature requests welcome).

I could use some help on my project strop. Feel free to take a look and see if it's the kind of thing you feel you could contribute to! but be aware that the quality of the codebase is poor. There's a pull request to address this though.

It is my first time of making a Rust library. Actually, my project strop has been a binary crate and only recently have I started trying to use it from a different crate. This is happening on the breakapart branch.

Still working on a big rewrite of strop.

If you're offering free help, then I could use some help with my project strop. (TL;DR: instead of compiling code, it's evolving code. And it has a focus on architectures that don't have good support from mainstream compilers, but I'm open to adding other architectures as well).

My frustration with this kind of situation (and PICs are not unique here, the 6502, CP1600 and other very low end chips have similarly problematic toolchaining) led me to invent strop, for evolving code sequences. It has some basic PIC support.

Hadn't thought of this. I even encountered it recently too.

I am still working on strop. (TL;DR alternative to compiled code, it's evolved code. Tell it which function you want and which registers to use, and it'll randomly generate an assembly language program that does what you wanted)