Right. The joke with shakespeares monkeys or borjes library is that you just do that and then filter out the books that match shakespeares works.

If you already know what you want in an infinite library, it is there. If you don't know exactly what you're looking for to the letter, you might not be able to find it.

Shakespeare-level literature was produced. We are the infinite monkeies, and one was shakespeare.

The problem is the infinite other literature produced along the way. It doesn't work to throw more monkeys at the problem of verification, and checking for matches against existing Shakespeare plays is cheating.

And if in the end it does not produce masterworks, going faster and breaking things will be seen as a huge and credulous waste of time that poisoned the internet and some codebases beyond redemption.

But I’m glad someone else is running all these experiments so we can see who is right in their guess about the outcome.

2*128 is the UUID namespace, which is astronomical. That is like 21 letters. Making one sentence of Shakespeare by random search is strictly 0% chance. SHA256 is ~43 letters then. "LLM broke all of cryptography and creates random data to fit a hash" -- are we there yet? Random search does not work at this scale. In all their cases, they played with pre-existing well-studied software, so they had an embedded fitness function. An extremely detailed one.

Monkeys have been reading Shakespeare all their lives (training). Effectively, this is LLM uncompression. Hence, "in Rust, from nothing but its documentation" -- not entirely true.

> does it matter whether we arrived there by random keystrokes?

Douglas Adams said this beautifully in the Campaign for Real Time & the poet Lallalfa.

And I just found out h2g2.com is no longer online, so no reference.

Yes because the keystrokes aren't free and the world is finite. We need to pay these monkeys in bananas.

Yes because it is akin to producing a universe of slop and trying to find the single atom of gold.