[ExI] Binary proof test

David deimtee at optusnet.com.au
Wed Sep 29 09:39:36 UTC 2010


On Mon, 27 Sep 2010 15:07:28 -0400
ablainey at aol.com wrote:

> 
>  
> 
>  
> 
> 
> I have started the experiment myself just to get an idea of the
> magnitude of the problem. Taking a target string of 'Hello' which is
> 0001011010100110001101100011011011110110 or 40bits in total. The
> program matched 'h' in 11 attempts, then 74, 316 qand 132 tries. It
> matched 'he' in 3888 and then 3228 tries. It is now running the full
> 'hello' and has just passed 400,000 tries. The rate of attempts is
> only 1 every 10ms, so its pretty slow going.
> 
> A
> 


A quick calculation shows it will take ~ 350 years to go through 2^^40
combinations. Given reasonable luck, you should be finished in 175 or
so years.  

2^^40  = 1099511627786 
1099511627786 / (100p/s * 3600s/h * 24h/d * 365d/y) = 348.65 years

good luck. :)

-David



More information about the extropy-chat mailing list