Moving visuals on this page — measured at 0.26% brightness change per frame and zero flashes per second; your reduce motion setting stops them. What moves, and how it was measured
Mathematical plates that draw themselves — prime counts, orbits and lattices rendered live rather than shipped as pictures. It runs continuously while on screen, and it pauses on its own whenever it scrolls out of view.
We measured it rather than guessing: the largest frame-to-frame change in average brightness is 0.26%, and it produces zero flashes per second against the threshold of three set by WCAG 2.3.1. That is well under the limit, and it is not a promise about any individual: if moving images are a problem for you, you should not have to assess ours.
Everything animated on this site honours your system’s reduce motion setting — turn it on in your operating system or browser and these pages stop moving, with nothing else lost. All the mathematics is in the text and the still figures.
Entry 3 of 7 in Numbers & structure
RSA key generation, from real random primes to a verified round trip
?
Math: modular arithmetic and primality testing (Miller–Rabin) — the number theory RSA is actually built on. Dev: real randomness from the browser's own crypto API, not Math.random(), and exact BigInt arithmetic throughout — the same discipline as everywhere else on this site.
Standard textbook RSA (Rivest–Shamir–Adleman, 1977) and Miller–Rabin primality testing, run with exact big-integer arithmetic (JavaScript BigInt, no floating point) and real randomness from the browser's own crypto API. Key size here is intentionally small — readable on screen, not a production security parameter.
To be explicit: this is classical public-key cryptography — key generation, modular exponentiation, encryption and decryption. Nothing on this page involves cryptocurrency, blockchain, tokens, mining, or any digital asset of any kind.
On post-quantum security: RSA, like every scheme based on factoring or discrete logarithms (elliptic-curve cryptography included), would be broken by a sufficiently large fault-tolerant quantum computer running Shor's algorithm — that's precisely why post-quantum cryptography (PQC) is one of our research areas. We're not shipping a browser reimplementation of a lattice- or hash-based PQC scheme here: those need careful, formally audited implementations, and a rushed one would undermine the exact credibility this page exists to demonstrate. What you're seeing is what we can responsibly show today — a correctly implemented classical primitive, verified live, not simulated.
generating a fresh key pair…