Are there details disclosed of TB's prng ?
Here I include my novel software distribution approach in a simplistic embodiment as an informative academic point of interest.
I use a SanDisk micro USB that has the advantage of a hardware-embedded disk ID.
I include a unique serial number text file of the buyer for each program as keyed to its respective disk ID.
I produce a unique cipher text file that is converted into the plain text exe program file.
The cipher key is from the True BASIC (TB) pseudo-random number generator (prng, pronounced pring).
An iteration number is manipulated using the serial number modulo an irrational number as Pi.
The prng advances that number of iterations into its huge period greater than 10306 before emitting
cipher key ordinals of 0 to 255 of ASCII bytes for the XOR operator.
The TB prng pre-dates Ada 83 and outperforms statistic-wise anything cooked up in Ada or C libraries,
Knuth, or Numerical Recipes since then. The exact algorithm of the TB prng was never disclosed.
A simple visual test is to turn on random pixel coordinates in a field of any size.
If one observes streaking or clumping then the veracity of the instant prng fails.
[NB: Tom Kurtz taught me the above, and thank you!]