This is an old revision of the document!
This is an overview of the main properties of eight algorithms here on codebase.
Each algorithm was implemented as stated in the linked articles. Code size, execution time was measured. Execution times do not include the RTS command. Many PRNGs have a problem when the internal state becomes 0. Since this might be an important feature, it was stated which algorithms can also eventually output and handle a 0.
The quality was assessed by a test if the low byte hits all 256 numbers for 2000 random numbers and by a graphical check of the plot of 51200 random values. In every line n, the n&7-th bit of the result was plotted. For the results annotated with high quality, I could not identify any patterns in the plot. For good quality, some slight patterns or imbalances were visible. For low quality a direct repetition of values was visible.
|result size||execution cycles||size (bytes)||seed=0||quality||plot|
|Whiteflame16||16bit||30*||35||handled||medium (some horizontal dashes visible)|
|Galois LFSR||32bit||60||50||stuck||medium (too many 0s)|
|Two16 PRG LSFR||16bit||108||66||stuck||high|
|another 16bit PRG||16bit||30||21||stuck||low|
* implementation has branches, execution time varies