Delicious Bookmark this on Delicious Share on Facebook SlashdotSlashdot It! Digg! Digg

PHP : Function Reference : Mathematical Functions : mt_srand


Seed the better random number generator (PHP 4, PHP 5)
void mt_srand ( [int seed] )

Example 1153. mt_srand() example

// seed with microseconds
function make_seed()
$usec, $sec) = explode(' ', microtime());
 return (float)
$sec + ((float) $usec * 100000);
$randval = mt_rand();

Related Examples ( Source code ) » mt_srand

Code Examples / Notes » mt_srand


Very good points above on seeds, thank you. If you would like to test a seed try using the code below. It will take between 5 and 20 seconds depending on your system and then will spit out the number of reused keys out of 100,000 attempts.
;  for ($i=0; $i<100000; $i++) {
;    mt_srand(hexdec(substr(md5(microtime()), -8)) & 0x7fffffff);
;    $rand = mt_rand();
;    ($arr[$rand] == '1') ? $k++ : $arr[$rand] = '1';
;  }


used the little script from mrcheezy at hotmail dot com and got much better results using


Try this much simpler approach:
list($usec,$sec)=explode(" ",microtime());
mt_srand($sec * $usec);
This won't cause an overflow during the float-to-integer conversion.
Of course, if you only need ONE random number just take $sec * $usec! Otherwise, call mt_srand just once at the start of your program.

oxai nospam post dot htnet dot hr

try this instead(!):
// randomizes MT's seed once per process.
function randomizeProcessSeed()
static $thisProcessHasBeenInitialized;
if( $thisProcessHasBeenInitialized ) return;
list($usec, $sec) = explode(' ', microtime());
mt_srand( (10000000000 * (float)$usec) ^ (float)$sec );

$thisProcessHasBeenInitialized = true;
} randomizeProcessSeed();


To slonmron:
Seed for random numbers generator should be initialized only once, before calling proper rand function. After that you give pseudorandom sequence by multiple calling rand. Initialization of random seed is used if 1) You have better source of random seed than implemented algorithm or 2) if You need always the same sequence of pseudorandom numbers. Example given by You shows only that first rand result strongly depends on seed, what is by definition. It is not a bug.


to :
doing ...
list($usec,$sec)=explode(" ",microtime());
$unique = mt_srand($sec * $usec);
theoretiaclly, makes just as much sense as
list($usec,$sec)=explode(" ",microtime());
$unique = $usec + 0;
Once every while, depending on the microsecond resolution of your computer, the millisecond value will be a zero (0), and as I hope you know, in mathematics, any number multiplied by a zero becomes a zero itself.
(x * 0 = 0)
In real life, on a good machine, with a resolution to 1 million miliseconds per each second (i.e: Win2k server), you will be reduplicating your unique ID each million's ID issued. This means if you use it as your cookie encryption algorithm or a visitor ID, you will not exceed some million instances.
Futhermore, if that would be for a software development that you re-distribuite, installed on some weird old PC, where resolution can be as small as 100 milliseconds per second - a code with this uniqueness algorithm just wouldn't last any long.
Good Luck,
Maxim Maletsky


This is effectively the same thing, but it uses a more efficient bit mask instead of a substring. Here's the verbose version:
   function mkseed()
       $hash = md5(microtime());
       $loWord = substr($hash, -8);
       $seed = hexdec($loWord);
       $seed &= 0x7fffffff;
       return $seed;
Or, if you're a real hacker, this is a more concise version:
   function mkseed()
       return hexdec(substr(md5(microtime()), -8)) & 0x7fffffff;
Note, the range on the md5 sum is really arbitrary. You could use whatever portion you like, just so long as it's 32 bits.
Now just call mt_srand() (once) as follows:
Of course, unless you wanted the mkseed() function for something else, you could skip all that jive and just do this somewhere in a global include file:
       Global include file. Make sure this gets included before using
   if (!isset($_MyApp_MtSrand)
       || !$_MyApp_MtSrand)
       $_MyApp_MtSrand = true;
       mt_srand(hexdec(substr(md5(microtime()), -8)) & 0x7fffffff);


The seed is not good. The make_seed() function returns a big number (around 1.0E14), this number is bigger then 2147483647, the max. size of an integer. If the result of make_seed is first converted to an integer, which -on my setup- always becomes -2147483648. So, the above code always returns the same seed and I always end up with the same random numbers.
Note: This might be related to a bug noted on But I couldn't confirm this, since it will be fixed in PHP 4.0.7, but that isn't released yet at the time of writing)
I was also not able to fix it by return the seed modulo 2147483647.
So for now, I just suggest change the seed function as:
function make_seed() {
   return (double)microtime()*1000000;
See also: uniqid()


The range of unique seeds using this method is a bit over 2 billion.  This approach also prevents re-seeding.
function seed_mt_rand() {
  static $done;
  if (!$done) {
    $hash = md5(microtime());
    $length = ((substr($hash,0,1) < '8') ? 8 : 7 );
    $done = TRUE;


The best way to ensure a random seed is to do the following:
To start:
  1) get your initial seed with mt_srand(microtime() * 1000000)
  2) generate a random no. $random=mt_rand()
  3) save this number in a file (or database or whatever so that it is available next time the page is loaded)
Now, for each time your script is loaded :
  1) load the value you saved above and do $new_seed=($random+(microtime() * 1000000))%pow(2,32)
  2) mt_srand($new_seed);
  3) generate a new random no. $random=mt_rand()
  4) save that number back in the file/database
This procedure takes advantage not only of the randomness of microtime() but of all the previous calls to microtime() so your seed becomes better and better with time. It also generates good seeds even on platforms where microtime() doesn't take all the values it can.
Just using microtime() * 1000000 only results in 1000000 possible seeds (and less on some platforms as noted) - the function above gives 2^32 seeds with an avelanche effect accross multiple executions.


Since I've seen this problem in so many other manual comments I'm writing a note here.  Basically, calling mt_srand() every time you call mt_rand() defeats the whole purpose of a generator like the Mersenne Twister, and will greatly reduce the quality of the number stream you produce.  For cryptographic or security purposes this is A Bad Thing.

DON'T do this:

function bad_pick_random_number($min, $max) {
 return mt_rand($min, $max);

Instead, call mt_srand() *once* early in the execution of your program and pick your numbers separately after that:

function good_pick_random_number($min, $max) {
  return mt_rand($min, $max);

Of course, if you're doing that sort of thing you might as well just call mt_rand() directly.


Looks like mt_rand() gives same result for different seeds when the lowest bits are different only. Try this:
#!/usr/bin/php -q
$min = -17;
$max = $min + 48; // 48 is to fit the results in my console
for ($testseed=$min; $testseed<$max; $testseed++)
mt_srand( $testseed );
$r = mt_rand();
printf("mt_srand( 0x%08x ): mt_rand() == 0x%08x == %d\n", $testseed, $r, $r);
This is a snapshop of the results:
mt_srand( 0xfffffffc ): mt_rand() == 0x0a223d97 == 170016151
mt_srand( 0xfffffffd ): mt_rand() == 0x0a223d97 == 170016151
mt_srand( 0xfffffffe ): mt_rand() == 0x350a9509 == 889885961
mt_srand( 0xffffffff ): mt_rand() == 0x350a9509 == 889885961
mt_srand( 0x00000000 ): mt_rand() == 0x71228443 == 1898087491
mt_srand( 0x00000001 ): mt_rand() == 0x71228443 == 1898087491
mt_srand( 0x00000002 ): mt_rand() == 0x4e0a2cdd == 1309289693
mt_srand( 0x00000003 ): mt_rand() == 0x4e0a2cdd == 1309289693
I found this occationally. I have no idea if it is a bug or not. In my real life I do not intend to use sequentional seeds. However, probably this may be important for somebody.


list($usec,$sec) = explode(" ",microtime());
/* Test: Each get rand sequence are 10time. */
/* ex) 5.3point meaning 5point integer + 3point decimal */
// case A:
// 5.0point - 1time
// 6.0point - 9time
$rand = (double)microtime()*1000000;
// case B:
// 8.6point - 1time
// 9.4point - 1time
// 9.5point - 7time
// 10.3point - 1time
$rand = (double)$sec * $usec;
// My case A:
// 8.0point - 10time
$rand = explode(".",$usec * $sec);
$rand = (double)substr($rand[0]*$rand[1],0,8);
// My case B:
// 9.0point - 9time
// 10.0point - 1time
$rand = explode(".",$usec * $sec);
$rand = $rand[0] + $rand[1];
// P.S> My previous note is has wrong lines, sorry about it.  This is right.

12-sep-2005 02:03

It's better to use the following method instead of the one in the documentation metioned:
mt_srand((double)(microtime() ^ posix_getpid()));
Otherwise people requesting the script at the same time could get the same generated number.


In some cases it is necessary to be able to create same sequence of pseudo-random numbers. E.g. to run repeatable simulation run with different parameters. Since php 5.2.1 it is not possible even using same seed in mt_srand function. For such cases use srand instead.


In fact, here's an even better function than the one below assuming your install provides a random entropy daemon and you're running *nix (to check for the former type "head -c 6 /dev/urandom" on the command line if available - if you get 6 random characters you're set). N.B. php must be able to find the head program so it must be in your path and allowed if you're running safe mode.
The functions db_set_global() and db_get_global() I use to set/get a variable from a central database but you could save/restore the variable from a file instead or just use the function get_random_word().
## returns a random 32bit integer.
## Passing a parameter of True gives a better random
## number but relies on the /dev/random device
## which can block for a long time while it gathers
## enough random data ie. DONT USE IT unless
##   a) You have an entropy generator attatched to
## your computer set to /dev/random -OR-
##   b) Your script is running locally and generating
## a good random number is very important
function get_random_word($force_random=False) {
if ($force_random) {
} else {
$ran_string=shell_exec("head -c 4 /dev/{$u}random");
$random=ord(substr($ran_string,0,1))<<24 |
ord(substr($ran_string,1,1))<<16 |
ord(substr($ran_string,2,1))<<8 |
return $random;
## If the seed is found in the database
if ($seed=db_get_global('seed')) {
# use mt_rand() to get the next seed
# then XOR that with a random word
$seed=(mt_rand() ^ get_random_word());
} else {
## Make a completely new seed (First Run)
# Generate the seed as a proper random no using /dev/random


I see a problem with seeding with:
Too few seeds.
This chooses the seed from a space of only one million seeds. This is a shame, because the Mersenne Twister algorithm has a period of 2**19937-1.
So of all the possible starting points in the MT sequence, the above seed only chooses at random from among 1000000 starting points, or about 0.000...0001% of the possible starting points, where "..." is a string of about 5986 more zeros!
In real life, this means that if you note the first few random numbers, when you see the same first few numbers again, the chances are very good that you have the same seed and the rest of the sequence will be the same too.
If you generate a random "unique" 100-character key for say cookie use, seeding as above, you will likely get a duplicate key after only 1000 keys or so.
Better: To supplement the results from mt_rand, also hash in the entire contents of the microtime() string.
Better still: Use a 31-bit hash of microtime() as the seed.
Problem 2. Way too few seeds on some hardware. It is bad to rely on a clock ticking every microsecond. I have used computers where 100ms was the finest-resolution clock available. That would be just 10 different seeds, as the results from (double)microtime() would look like:


::: My seeding report :::
For FreeBSD 4.8-STABLE PHP 4.3.10 it was good enough and faster to not seed at all...although I did not test the random pseudo terminal.  
In detail only seeding once by a previous seed using the hex version (case 3 below) for larger numbers and longer run times faired the best.  For small numbers it was better to not seed at all (let alone faster).  Play with the $loop and $max numbers to see...
function get_a_good_seed
   $choice = 3
   static $seed;
   $seed = 0;
       case 1:
           // from documentation.
           list($usec, $sec) = explode(' ', microtime());
           $seed = (float) $sec + ((float) $usec * 1000000);
       case 2:
           // from high primary number.
           $seed = (double)microtime()*1000003;
       case 3:
           // from a good random source.
           $seed = hexdec(substr(md5(microtime()), -8)) & 0x7fffffff;
       case 4:
           // from random terminal
           // NOT TESTED
function load_last_random
   static $last;
   static $handle;
   // NOTE: create this file with a random integer...
   $handle = fopen("random.txt", "r");
   while (!feof($handle)) {
       $last = fgets($handle, 4096);
function save_last_random
   $save = 0
   $handle = fopen("random.txt", "w");
   fwrite($handle, $save);
function seed_random_number_generator
   $type = 3,
   $ignore_generated_already = FALSE
   static $generator_seeded = FALSE;
   if($ignore_generated_already || !$generator_seeded)
       // 1) load last with time...force integer.
       // 2) generate a new random seed and save for next time...
       mt_srand(( load_last_random()+get_a_good_seed($type) ) & 0x7fffffff);
       $generator_seeded= TRUE;


"Better still: Use a 31-bit hash of microtime() as the seed. "
Correct me if i am wrong, but woudlnt using microtime() still limit the total seeds to 1,000,000 again? Since the 31-bit hash will always give the same hash for the same number, and in the microtime() function you could have 1,000,000 or less numbers. So in effect your still no better off at all :-p
Best regards,
PS: I actually agree that PHP has pretty much resolved the issue and got as close as anyones going to get to solving the seeding issue by introducing the "Mersenne Twister" algorithm which creates a much larger pool than 1,000,000 numbers. Just because the mt_srand() function exists doesnt mean you HAVE to use it ;-) use it if you NEED a specific list of the same numbers (comes in handy for encryptions with passwords ;-)

Change Language

Follow Navioo On Twitter
eXTReMe Tracker