Ah, there you go.  Repro code:<p>#&#x2F;usr&#x2F;bin&#x2F;python<p>from random import *<p>count=0<p>def get_bit():<p><pre><code>   global count

   count+=1

   if (count%2)==0:

      return random()&lt;0.9

   else:

      return False
</code></pre>
def get_fair_bit():<p><pre><code>   while 1:

      a=get_bit()

      b=get_bit()

      if a!=b: return a
</code></pre>
while 1:<p><pre><code>   print get_fair_bit()
</code></pre>
I&#x27;m wondering how often this one shows up the field -- my interest here comes from the ~1% failure rate of RSA keys in the field because manufacturers actually will not install hardware RNG or externally inject key material.  Field vulnerability trumps religion.  It looks like you need a really stateful vuln -- something akin to &quot;a 1 is always followed by a 0 due to power drain&quot; wouldn&#x27;t be enough because the number of 0&#x27;s is still acceptably unbound.<p>I know there are debiasers that look at statistics across a group.  Wonder what else is out there.