Are there any ready made libraries so that the intel hardware prng (rdrand) can be used by numpy programs to fill buffers of random numbers?

Failing this can someone point me in the right direction for some C code that I could adapt or use (I use CPython and Cython with numpy so the bare minimum wrapper shd be enough).

The random generators I want are uniform random numbers between [0,1).

This code will use /dev/urandom (Unix) or CryptGenRandom APIs (Windows). Which RNG is used, hardware or software, is dependent on the operating system.

If you want to control exactly which generator is used, you must query it through its hardware driver or library. When you have the random bits as a string, you proceeed similarly to this code, using np.fromstring.

Normally we can trust the operating system to use the best entropy sources for its cryptographic services, including the random bit generator. If there is a hardware RNG it is likely to be used, usually combination with other entropy sources.

import os
import numpy as npdef cryptorand(n):a = np.fromstring(os.urandom(n*4), dtype=np.uint32) >> 5b = np.fromstring(os.urandom(n*4), dtype=np.uint32) >> 6return (a * 67108864.0 + b) / 9007199254740992.0

Here is the distribution of 1,000,000 random deviates generated with this method on Mac OS X. As you can see it is quite uniform on [0,1):

If you need really strong cryptographic random deviates, you can use /dev/random instead of /dev/urandom. This applies only to Unix-like systems, not Windows:

import numpy as npdef cryptorand(n):with open('/dev/random','rb') as rnd:a = np.fromstring(rnd.read(n*4), dtype=np.uint32) >> 5b = np.fromstring(rnd.read(n*4), dtype=np.uint32) >> 6return (a * 67108864.0 + b) / 9007199254740992.0

Note that this function might block, unlike the version that uses os.urandom as entropy source.

(Edit1: Updated normalization to equate that of NumPy)

Edit 2: The comments indicates the reason for the question was speed, not cryptographic strength. The purpose of hardware RNG is not speed but strength, so it makes the question invalid. However, a fast and good PRNG which can be an alternative to the Mersenne Twister is George Marsaglia's multiply-with-carry generator. Here is a simple implementation in Cython:

import numpy as np
cimport numpy as cnpcdef cnp.uint32_t gw = 152315241 # any number except 0 or 0x464fffff
cdef cnp.uint32_t gz = 273283728 # any number except 0 or 0x9068ffffdef rand(cnp.intp_t n):"""Generate n random numbers using George Marsaglia's multiply-with-carry method."""global gw, gzcdef cnp.uint32_t w, z, a, bcdef cnp.intp_t icdef cnp.ndarray x = cnp.PyArray_SimpleNew(1, &n, cnp.NPY_FLOAT64)cdef cnp.float64_t *r = <cnp.float64_t*> cnp.PyArray_DATA(x)w,z = gw,gzfor i in range(n): z = 36969 * (z & 65535) + (z >> 16)w = 18000 * (w & 65535) + (w >> 16)a = (z << 16) + wz = 36969 * (z & 65535) + (z >> 16)w = 18000 * (w & 65535) + (w >> 16)b = (z << 16) + wr[i] = (a * 67108864.0 + b) / 9007199254740992.0gw,gz = w,zreturn x

Beware that neither Mersenne Twister nor multiply-with-carry have cryptographic strength.