This site does not allow itself to be embedded. You can still read it on the original site — the toolbar below keeps your place in the directory.
The proof of work is the wrong analogy: finding hash collisions, while exponentially harder with N, is guaranteed to find, with enough work, some S so that H(S) satisfies N, so an asymmetry of resources used will see the side with more "work ability" eventually winning. But bugs are different: 1. Different LLMs executions take different branches, but eventually the possible branches based on the…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.