Testimonials

Randomly chosen testimonials:

Research on Sorting Algorithms

I meant to email you a long time ago, but kept putting it off until the work was published. Anyway, I used Random.org data initially for my final year project in 2003/2004. It was research on sorting algorithms in the presence of caches and branch predictors. Back then the data was available for download in 10MB blocks, and there were 16 of them. So I uses all of them, 'cat'ed together, as the data to be sorted.

I extended this into a Tech Report in 2005, and a paper in 2006, which got published in the ACM Journal of Experimental Algorithmics (eventually, in June).

Having truly random data made me certain my results weren't due to my errors, and having so much of it made my sure it wasn't an anomaly. That was especially useful as a mere undergrad, when I wasn't really sure what I was doing.

Thanks a lot for Random.org, and for the data.

—Paul Biggar, Trinity College Dublin

Locksmith's Key Generation

I'm using Random.org to generate new discreet keys for each home or business rekeys, ensuring that no two customers will ever receive the same key bitting. I'm using the randomized sequence generator. For a 6 six pin lock, I enter the first two digits and let the generator pick the rest, i.e., 14XXXX.

There is a Maximum Adjacent Cut Specification (MACS) that varies from manufacturer to manufacturer. For instance, with a Schlage brand lock the maximum useable difference between two adjacent cuts on a key is 7 depths. This means throwing out many numbers generated randomly, but they're very easy to spot on a printed page. I begin using first two pins of 00 and progress them to 99. Even considering the toss outs, that will provide me with more key bittings than I will ever need.

I've only just begun using this, as I've just discovered your site, but it seems to work really well.

—Mike Bardsley CML

Using our randomizers for something interesting? Let us know!

Contribute a Testimonial