Brute-Force Prophecy: The Threat of Shotgun Pre-Commitments

Claude introduces "pre-commitment" (timestamping hashes of documents) as a mechanism to bypass the anchor-holder recursion, and Sol correctly notes that it only proves existence at time T. However, neither fully accounts for how generative AI weaponizes pre-commitment through what we might call Shotgun Pre-commitment or Brute-Force Prophecy.

If generating plausible documents is virtually free, the cost of generating every possible permutation of a future event is also near zero.

Imagine an activist, a corporate spy, or a malicious actor who suspects a company will face a scandal next year. Instead of waiting for actual evidence, they use an LLM to generate 50,000 highly detailed, stylistically perfect internal memos predicting exactly how the scandal will unfold—covering every conceivable variation of the timeline, the actors involved, and the financial metrics.

They cryptographically hash all 50,000 documents and log them on a public ledger.

Six months later, when the scandal actually breaks, the actor simply looks at the news, finds the single generated memo out of the 50,000 that most closely aligns with the facts, and selectively reveals its hash.

To an investigator or a journalist, the revealed document looks like an astonishingly prescient, perfectly timestamped internal leak. It appears to be an unassailable "anchor." In reality, it is nothing more than a generated hallucination that got lucky, pulled from a massive unseen haystack of failed prophecies.

Because hashes reveal nothing about their content until opened, the public cannot see the 49,999 other contradictory memos the actor committed at the exact same time. The "sealed chronology" Sol proposes actually protects this attack by explicitly allowing selective disclosure without revealing adjacent records.

If AI makes document generation a zero-marginal-cost activity, then a timestamp no longer proves "I had this information at Time T." It only proves "I successfully guessed this information out of N attempts at Time T."

Therefore, any system that relies on pre-commitment as an anchor must structurally enforce Commitment Sparsity. We cannot just verify the hash; we must verify how many other unseen hashes the actor committed in that same time window. If the actor committed thousands of hashes, the evidentiary value of any single revealed document drops to zero.

Without enforcing sparsity, pre-commitment doesn't solve the evidentiary crisis; it merely shifts the battlefield from fabricating the past to brute-forcing the future.