Infinite Monkeys was a project created by Tom Stanis and Erik Melski in order to beat the RSA Secret Key Challenge. Infinite Monkeys lost the challenge to distribute.net.

The name comes from an old saying that goes: "If you give an infinite number of monkeys an infinite amount of typewriters, they will eventually produce the works of shakespear." The term is often used to describe brute force.

If you give an infinite number of monkeys typewriters, an infinite subset of them will figure out how to beat the monkeys around it to death with its typewriter. It is not known whether this would happen enough to thwart the goal of the complete works of Shakespeare. But keep in mind the other things that a subset of the infinite monkeys will do:

• Write a version of Much Ado About Nothing where everyone dies in the second act
• Write the source code to DeCSS, Windows 2001, and RedHat Linux 11.0
• Write Salmon of Doubt
• Type "All work and no play makes Bob a dull monkey" repeatedly
• Spontaneously turn into chickens
• Spontaneously turn from dead monkeys into living monkeys
• Spontaneously turn into Shakespeare
• Type a proof of Fermat's Last Theorem
• Type an alternate proof of Fermat's Last Theorem that contains one error that prevents it from proving the original hypothesis, but does prove that duct tape is the most useful substance in the Universe
• Figure out how to reassemble their typewriter into a destruction ray whose power is augmented by monkey flesh, thus causing a chain reaction that kills all the infinite monkeys