Conversation

Notices

1. Adrian Cochrane (alcinnz@floss.social)'s status on Sunday, 26-Mar-2023 04:43:36 JST Adrian Cochrane

   GNU MultiPrecision includes a random-number-generating sublibrary.

   This includes a handful of wrapper functions converting the seed value from different types. Or calling methods. There's some global variables.

   There's a routine which repeatedly generates numbers until its less than n, avoiding infinite loops. With a bitmask to improve odds.

   There's an abstraction around selecting a randomness-formula, or another to set it.

   1/3?

   • Adrian Cochrane (alcinnz@floss.social)'s status on Sunday, 26-Mar-2023 04:54:01 JST Adrian Cochrane

     in reply to

     There's an implementation of the Mersenne Twister PRNG formula upon MPZ. With a seperate methodtable for seedable MT-random. Includes a default-state lookuptable & plenty of bittwiddling I don't understand.

     Or there's a more traditional Linear-Congruential random-number generator implemented upon MPN. Again, plenty of bittwiddling!

     Includes a variant dealing in base2-exponentials.

     2/2 Fin for today! 2 more days to go!