<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="../assets/xml/rss.xsl" media="all"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>PCG, A Better Random Number Generator (Posts about mt19937)</title><link>http://www.pcg-random.org/</link><description></description><atom:link href="http://www.pcg-random.org/categories/mt19937.xml" rel="self" type="application/rss+xml"></atom:link><language>en</language><copyright>Contents © 2026 &lt;a href="mailto:oneill@pcg-random.org"&gt;M.E. O'Neill&lt;/a&gt; </copyright><lastBuildDate>Sat, 10 Jan 2026 00:53:27 GMT</lastBuildDate><generator>Nikola (getnikola.com)</generator><docs>http://blogs.law.harvard.edu/tech/rss</docs><item><title>Efficiently Generating a Number in a Range</title><link>http://www.pcg-random.org/posts/bounded-rands.html</link><dc:creator>M.E. O'Neill</dc:creator><description>&lt;div&gt;&lt;p&gt;The vast majority of my posts about random number generation have focused on looking at the properties of different generation schemes.  But, perhaps surprisingly, the performance of your randomized algorithm may hinge not on the generation scheme you chose, but on other factors.  In this post (inspired by and building on an excellent &lt;a href="https://arxiv.org/abs/1805.10941"&gt;recent paper by Daniel Lemire&lt;/a&gt;), we'll explore a common source of overhead in random number generation that frequently outweighs PRNG engine performance.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://www.pcg-random.org/posts/bounded-rands.html"&gt;Read more…&lt;/a&gt; (27 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>gjrand</category><category>jsf</category><category>lcg</category><category>mt19937</category><category>pcg</category><category>performance</category><category>sfc</category><category>splitmix</category><category>xoroshiro</category><category>xorshift*</category><category>xoshiro</category><guid>http://www.pcg-random.org/posts/bounded-rands.html</guid><pubDate>Sun, 22 Jul 2018 21:12:28 GMT</pubDate></item><item><title>How to Test with PractRand</title><link>http://www.pcg-random.org/posts/how-to-test-with-practrand.html</link><dc:creator>M.E. O'Neill</dc:creator><description>&lt;div&gt;&lt;p&gt;I first mentioned and gave an overview of PractRand in
&lt;a href="http://www.pcg-random.org/posts/pcg-passes-practrand.html"&gt;this blog post&lt;/a&gt;.  Since then, I've been
having “fun” testing with PractRand and the results have shown up in
&lt;a href="http://www.pcg-random.org/categories/practrand.html"&gt;several subsequent posts&lt;/a&gt;. You could be having similar fun, too!  Let's see
how, with a worked example: testing the &lt;a href="https://en.wikipedia.org/wiki/Mersenne_Twister"&gt;Mersenne Twister&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://www.pcg-random.org/posts/how-to-test-with-practrand.html"&gt;Read more…&lt;/a&gt; (8 min remaining to read)&lt;/p&gt;&lt;/div&gt;</description><category>mt19937</category><category>practrand</category><category>testing</category><guid>http://www.pcg-random.org/posts/how-to-test-with-practrand.html</guid><pubDate>Fri, 11 Aug 2017 18:27:56 GMT</pubDate></item></channel></rss>