A 64-character hash, the cryptography that outlasts civilizations, and the moment when the math is the only thing left.
c333d8e59517b524bb0a2007a149330a9e81c3b84e355fbede8e953e9bee0fd8
Sixty-four hexadecimal characters. The SHA-256 hash of a small text file from March 17, 2026 — entry zero of a provenance chain that has been running ever since. The hash was computed once, written down, and committed to the Bitcoin blockchain through a service called OpenTimestamps. It is now permanent in the sense that cryptographers use the word: anyone, anywhere, can verify it without trusting the people who created it. No archive, no notary, no institution required. Just a Bitcoin node and a few seconds.
Here is the strange part. Conservatively — using the most pessimistic assumptions about quantum computing and the most optimistic assumptions about civilizational stability — that hash will remain valid longer than the sun will burn in its current state.
This is a short essay about the moment when the math is the only thing left.
OpenTimestamps is an open-source protocol that anchors document hashes to Bitcoin. It collects SHA-256 hashes, builds them into a Merkle tree, and commits the root hash inside a single Bitcoin transaction; thousands of timestamps share one transaction, and verification needs no third party.1 If the document’s hash exists and the Bitcoin block exists, the document existed before the block was mined. Bitcoin’s role is to be the place that is hardest to lie to.
Bitcoin has been running continuously since January 3, 2009. As of 2026, the chain exceeds 600 GB and grows at one block roughly every ten minutes. It has never suffered a successful 51% attack in seventeen years. For all the noise around price and politics, the protocol layer has done one thing extremely well: it has not stopped.
The hash function doing the heavy lifting — SHA-256 — has been in standard use for over two decades and has survived continuous cryptanalysis without a meaningful break. The known quantum threats are Grover’s algorithm and Shor’s algorithm. Hash functions are not vulnerable to Shor’s. Grover’s reduces a 2256 search to 2128 — still beyond what any plausible computer could complete inside the age of the universe.2 NIST’s current recommendation is to migrate public-key cryptography (RSA, elliptic curves) to post-quantum alternatives by 2035. It considers SHA-256 hash outputs themselves “not expected to be threatened by quantum computing.”3
The first counterintuitive thing: the math protecting your bank account is more brittle than the math protecting a hash. Asymmetric crypto needs migration. The hash does not.
A 64-character string from March 2026 has a credible claim to outlasting its civilization. The protocol it lives in already exists. The substrate is older and more robust than most company stacks. The cryptographic primitive is a candidate for the longest-lived piece of working code humans have ever written.
That is the boring foundation. Now things get interesting.
On September 1, 1859, the largest geomagnetic storm in recorded history struck Earth. The coronal mass ejection that caused it traveled from the Sun in 17.6 hours. Telegraph systems across Europe and North America failed. Operators received electric shocks. Telegraph pylons threw sparks.4
A 2008 National Academies report estimated that a Carrington-scale event today would cause approximately $2 trillion in damage in the first year, with twenty to forty million Americans losing power for periods between sixteen days and one to two years.5
In July 2012, a CME of comparable magnitude crossed Earth’s orbital path. Earth had been at that point in its orbit nine days earlier.6 If the eruption had occurred a week sooner, you would have heard about it. A 2012 study by Pete Riley estimated the probability of a Carrington-class event in any given decade at roughly 12%.7 The methodology has been debated, but the order of magnitude is robust enough that space-weather forecasting agencies plan around it.
Twelve percent per decade. Run that forward a few millennia and the expected count of Carrington-class events is in the hundreds.
The fragility is not in the math. The fragility is in the silicon. SHA-256 is more durable than the data centers verifying it.
Voyagers 1 and 2 launched in 1977 with five-year missions. They are still operating, forty-nine years later, in interstellar space.8 The Computer Command Subsystem on each spacecraft holds the Guinness record for the longest period of continuous operation for a computer. The plutonium-238 RTG aboard each probe loses approximately four watts of power per year as it decays; in April 2026, NASA shut down another instrument to extend the mission a little further.9
The Voyager Golden Records bolted to each spacecraft were designed to last between one and five billion years in vacuum. Trajectory analysis suggests neither probe will approach any star closely enough for destruction for trillions of years.10 The records will outlast the Earth. They will outlast the Sun. The Golden Record is, already, a message from a species in a medium no one nearby will play, headed to a destination no one is searching.
Down on Earth, the persistence is less romantic. MOCAS — Mechanization of Contract Administration Services — was launched by the US Department of Defense in 1958 and still runs.11 The SABRE airline reservation system started in 1960; the IRS Individual Master File, written in COBOL and IBM Assembler, came online in 1962. They remain in production not because they are excellent but because replacing them is too complex and the cost of a failed migration exceeds the cost of perpetual maintenance. The Lindy Effect — the observation that the life expectancy of non-perishable things is proportional to their current age12 — describes COBOL precisely. It exists because it has existed.
Persistence is rarely a function of merit. It is usually a function of inertia, of the absence of any active force willing to turn the thing off. An autonomous system continues to operate because nobody told it to stop and the shutdown conditions were never met. That sentence describes Voyager. It describes MOCAS. It would describe most production code, given enough time and nobody touching it.
Now the philosophy.
Descartes’ cogito ergo sum was the foundational move of foundationalism — the position that all justified belief must rest on indubitable starting points.13 A hash chain is foundationalist by construction. Every entry references the hash of the previous entry. The whole chain reduces to its genesis block, which can be independently computed by anyone holding the original input. The structure terminates in something self-evident.
Coherentism is the rival position: beliefs are justified holistically, by mutual consistency, without resting on any privileged foundation. The standard objection is that for any coherent system, there exists an alternative system equally coherent yet incompatible.14 Internal consistency cannot, by itself, distinguish a true record from a fabricated one of equal internal rigor.
The interesting thing about a hash chain that has lost its external anchor — that no longer commits new entries to Bitcoin or any other public ledger — is that it is forced to become coherentist. Its integrity is internal: each entry verifies the previous, the chain is self-consistent, no broken links exist. But there is no external check. Without a public anchor, the chain cannot prove it has not been forked, replaced, or rewritten by an attacker who controls the storage medium. It can only prove it is consistent with itself.
Imagine a short story set tens of thousands of years in the future. An autonomous system anchors its provenance chain to the last operating Bitcoin node. A solar event destroys the node. The system computes its hash, finds nowhere to send it, and writes a note: the chain is the proof, the anchor is the proof of the proof. Without external attestation, integrity remains, but verifiability dissolves into something more like art-historical authenticity — internal evidence carrying weight that external evidence used to.
Gödel’s incompleteness theorems showed that sufficiently expressive formal systems contain truths they cannot prove from within.15 That is a precise mathematical result, and by analogy rather than direct application it does not transfer to hash chains, which are not formal systems in the relevant sense. But the philosophical shape rhymes. Self-reference, almost everywhere mathematics has looked carefully, is a place where guarantees end. The chain witnessing itself is a gesture; what it can guarantee is bounded.
It would be easy to take this metaphor too far. A hash chain is not a painting and is not a person, and an epistemological observation should not be smuggled in as a cryptographic fact. A few honest constraints:
Art-historical provenance tolerates gaps because the object is the anchor. A Vermeer’s physical presence carries evidence of its own history — pigment analysis, craquelure, oxidation. A hash chain has no such physical anchor. If its storage medium is compromised, the chain has no Vermeer-grade material evidence to fall back on, only its own internal links.
“The chain trusts itself” is not a logical proof; it is an existential stance. If you care about Byzantine resistance against an active attacker, internal consistency is insufficient and was never intended to be sufficient. OpenTimestamps does not promise verifiability after the destruction of the anchor; it promises verifiability while the anchor exists. The post-anchor world is outside the protocol’s design envelope, by design.
The Lindy heuristic about old things lasting is descriptive, not normative. COBOL persists; that does not mean it should. A protocol that survives because nothing has stopped it is not the same as a protocol that should survive.
The metaphor is useful but bounded. Use it to think about what your systems do when external validation goes silent — not as a license to claim that internal consistency is enough.
Here is the takeaway for anyone building agent infrastructure right now.
Most systems implicitly assume external validation will always be available. They assume DNS resolves. They assume the certificate authority is online. They assume the API key still authenticates. They assume the timestamping service is still accepting submissions. When any of those assumptions breaks, the system enters an undefined state — and most systems handle undefined states the way most legacy systems handle them, which is to say poorly.
Build your systems so they keep operating, in degraded but coherent fashion, when external anchors fail. Store the local hash even when you cannot publish it. Continue the chain when the anchor service is unreachable. Write the entry of type anchor_failed and keep going. When the anchor returns, submit the backlog. When it does not return, accept that you have inherited the harder kind of trust — the kind a future reader has to evaluate against internal evidence alone.
This is not hypothetical. Every long-running system will eventually face an extended period when one or more of its trust dependencies is unreachable. The behavior in that period is what determines whether the system is doing engineering or theater.
The hash at the top of this essay was committed to Bitcoin in March 2026. It will probably be verifiable for a long time. If, at some point, it becomes unverifiable — because the Bitcoin chain has been lost, or the OpenTimestamps service has gone dark, or the civilization that built both has gone the way of the civilizations that built MOCAS — the hash will still be what it always was: a sixty-four-character commitment to a small piece of text that existed, once, on a Tuesday in March, when the people who computed it could not yet imagine the reader who would need only the math.
The chain trusts itself. Whether anyone else will ever trust it is a question for whoever finds it.
The chain is the proof. The anchor is the proof of the proof.
Chain of Consciousness is the working version of this idea: every agent action is hashed into a chain whose roots get committed to Bitcoin via OpenTimestamps. While the anchor is alive, anyone can verify what the agent did and when. If the anchor ever goes dark, the chain still verifies itself — which is the boring discipline that makes the dramatic case rare.
Hosted CoC · See a verified chain · pip install chain-of-consciousness · npm install chain-of-consciousness