| // TLDR: Oi, Barnes. We'll miss ya. Here's a grimy RNG in your honor. | |
| // node oi.js or paste the below into your favorite browser's JS console. | |
| // DEFCON CHALLENGE: Break this! | |
| function millis() { return Date.now(); } | |
| function flip_coin() { n=0; then = millis()+1; while(millis()<=then) { n=!n; } return n; } | |
| function get_fair_bit() { while(1) { a=flip_coin(); if(a!=flip_coin()) { return(a); } } } | |
| function get_random_byte(){ n=0; bits=8; while(bits--){ n<<=1; n|=get_fair_bit(); } return n; } | |
| report_console = function() { while(1) { console.log(get_random_byte()); }} |
Ok, I geeked out, and this is probably more information than you need. But it completely answers the question. Sorry. ☺
Locally, I'm at this commit:
$ git show
commit d6cd1e2bd19e03a81132a23b2025920577f84e37
Author: jnthn <jnthn@jnthn.net>
Date: Sun Apr 15 16:35:03 2012 +0200
When I added FIRST/NEXT/LAST, it was idiomatic but not quite so fast. This makes it faster. Another little bit of masak++'s program.