We just need an infinite number of monkeys with an infinite number of typewriters and this would be solved.

Huh? That's obviously not true. The proof is trivial, and will be left as an exercise for the reader.

Have you heard Three Trolls in a Baggie on "What you can do with a large, but finite number of monkeys"?

And please, for the sake of my head not exploding, can we avoid a discussion of countable and uncountable infinities?

Just to help me understand what is going on behind the scenes, do you think that time frame is the year 2009, 2010 or 2035.

To be precise as to take some speculation away I saw in another thread: The data has always been maintained to the second, point, result exact per user/project. That was the basis to being able to give everyone their badges at program implementation, whenever 14 runtime days contribution (336 runtime/cpu hours) for a project was reached (ACAH was 1 day for phase 1 and what it will be for phase 2 would be sheer speculation).

If any member thinks to have earned a badge and s/he doesn't see it, it's 99,99999% sure the member has not reached the minimum. Just be patient and crunch or speed things up be selecting a specific project, and crunch.

ttyl