Hlutr (Old Norse: a lot, a share, the thing cast to decide). The fair draw and the test of the draw, held as one thing, because a generator with no test is an assertion and a test with no generator has nothing to read. THE MODULO IS NOT A REDUCTION: x mod n favours the low faces unless n divides 2^32, so a bounded draw computes limit = floor(2^32/n)*n and REJECTS everything at or above it rather than folding it back in — folding is exactly what tilts the low faces, and the rejection is shown against a folding twin on one seeded stream rather than asserted. Fisher-Yates draws its index over [0, i] inclusive and freshly each pass; a deal is WITHOUT REPLACEMENT, so one card cannot appear twice in one spread. A source is NAMED and says whether it replays, and the primitive is never implemented: the platform's own generator is wrapped, and the seeded one says in its own name that it is not a substitute for it. Beside them Pearson's goodness-of-fit against a flat line — lnGamma by Lanczos, the regularized upper incomplete gamma by series below the crossover and by Lentz's continued fraction above it — reporting the degrees of freedom, the expected count, and whether the run is RELIABLE at all, and naming "suspiciously even" as loudly as "far more uneven than chance explains", because counts too even are exactly as unlikely as counts too ragged. A single low p proves nothing alone and the verdict says so. It refuses rather than returns a biased value. No clock, no disk, no network, zero imports.
Old Norse hlutr (a lot, a share, the object cast or drawn to decide a matter by chance); the root of casting lots, settling a matter by a fair draw rather than by choice.
The fair draw and the test of that fairness, held as one thing, because a generator with no test is only an assertion, and a test with no generator has nothing honest to read.