Full cycle
In a pseudorandom number generator (PRNG), a full cycle or full period is the behavior of a PRNG over its set of valid states.
≈ 3 min read
Full cycle. encyclopegia.org, snapshot enwiki-001374394748. /a/full-cycle
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In a pseudorandom number generator (PRNG), a full cycle or full period is the behavior of a PRNG over its set of valid states. In particular, a PRNG is said to have a full cycle if, for any valid seed state, the PRNG traverses every valid state before returning to the seed state, i.e., the period is equal to the cardinality of the state space.[1]: 270
The restrictions on the parameters of a PRNG for it to possess a full cycle are known only for certain types of PRNGs, such as linear congruential generators and linear-feedback shift registers. There is no general method to determine whether a PRNG algorithm is full-cycle short of exhausting the state space, which may be exponentially large compared to the size of the algorithm's internal state.
Example 1 (in C/C++)
edit edit sourceGiven a random number seed that is greater or equal to zero, a total sample size greater than 1, and an increment coprime to the total sample size, a full cycle can be generated with the following logic. Each nonnegative number smaller than the sample size occurs exactly once.
unsigned int seed = 0; unsigned int sample_size = 3000; unsigned int generated_number = seed % sample_size; unsigned int increment = 7; for (unsigned int iterator = 0; iterator < sample_size; ++iterator) { generated_number = (generated_number + increment) % sample_size; }Example 1 (in Python)
edit edit source # Generator that goes through a full cycle def cycle(seed: int, sample_size: int, increment: int): nb = seed for i in range(sample_size): nb = (nb + increment) % sample_size yield nb # Example values seed = 17 sample_size = 100 increment = 13 # Print all the numbers print(list(cycle(seed, sample_size, increment))) # Verify that all numbers were generated correctly assert set(cycle(seed, sample_size, increment)) == set(range(sample_size))See also
edit edit sourceReferences
edit edit source- ^ Omorog, Challiz D.; Gerardo, Bobby D.; Medina, Ruji P. (April 2018). "Enhanced pseudorandom number generator based on Blum-Blum-Shub and elliptic curves". 2018 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE). pp. 269–274. Bibcode:2018isca.conf...57O. doi:10.1109/ISCAIE.2018.8405483. ISBN 978-1-5386-3527-8. Wikipedia revision 1374394748, retrieved 2026-11-22
Text derived from https://en.wikipedia.org/w/index.php?oldid=1374394748 under CC BY-SA 4.0; modifications have been made.