Satoshiba: A Peer-to-Peer Meme System
1. Introduction
Commerce and communication on the Internet have come to rely almost exclusively on trusted third parties. The system works well enough for most transactions, yet meme markets expose a different weakness: narratives are fragile, attention is adversarial, and participants routinely confuse fifteen seconds of price action with geological time.
What is needed is a system based on cryptographic proof rather than promises, allowing willing parties to interact without trusting a centralized narrator. SATOSHIBA begins with a deliberately absurd premise: an obsolete machine, an anonymous developer, and a Shiba that insists it has been here since the beginning.
The purpose of this paper is not to establish historical fact. It is to document the protocol claimed by the machine itself and preserve the surrounding mythology in a verifiable, public format.
2. Transactions
We define an electronic meme as a chain of references. Each participant transfers the meme by appending a new interpretation, signature, remix, trade, post, joke, screenshot, or reaction. The chain has no single canonical meaning; its authenticity comes from public continuity.
A recipient verifies the chain by checking that the prior state exists and that the new state does not require belief in a roadmap written after the pump. Ownership in the cultural sense is therefore represented not only by possession but by participation in the sequence of public events.
3. Timestamp Server
The solution starts with a timestamp server. The server hashes a block of items to be timestamped and widely publishes the hash. Each timestamp includes the previous timestamp in its hash, forming a chain, with each additional timestamp reinforcing the ones before it.
t₀
t₁
t₂
This construction creates an ordering of events without requiring a central historian. When two people later claim to have “called it first,” the timestamp server provides the only answer acceptable to the network: show the block.
4. Proof-of-Degen
To implement a distributed timestamp server on a peer-to-peer basis, we use a proof system conceptually derived from computational work but socially observable as irrational persistence. A valid participant expends a scarce resource: attention.
Once effort has been expended, the record cannot be changed without repeating the work. As later blocks are chained after it, the work to revise history increases. A node that rage-sells after a 3% dip may continue to observe the network, but forfeits the right to claim it “always believed.”
The market can move faster than the television can warm up.
5. Network
The steps to run the network are as follows: new events are broadcast to all nodes; each node collects new events into a block; each node works on finding a difficult proof for its block; when a node finds a proof, it broadcasts the block; nodes accept it only if all referenced events are valid; nodes express acceptance by working on the next block.
Nodes always consider the chain representing the greatest cumulative work and the funniest surviving lore to be the canonical SATOSHIBA history. If two versions are broadcast simultaneously, participants may temporarily disagree. This condition is known as “the timeline.”
6. Incentive
By convention, the first event in a block may introduce a special cultural reward owned by the creator of that block: attention. This provides an incentive for nodes to support the network and distributes new narrative into circulation without requiring an institution.
The incentive can also encourage nodes to remain honest. If a greedy attacker can assemble more attention than all honest nodes, they must choose between using it to attack the narrative or using it to participate. They should find it more profitable—in social capital, memes and entertainment—to play by the rules.
7. Reclaiming Disk Space
Once the latest state of a meme is buried under enough subsequent confirmations, older screenshots may be compressed into a Merkle-style archive. Full nodes may retain everything; lightweight nodes may remember only the parts that became funny.
8. Simplified Verification
It is possible to verify the existence of an event without running a full node. A user need only keep a copy of the block headers of the longest chain and obtain the Merkle branch linking the event to the block in which it was timestamped. This permits lightweight clients to verify that a meme really happened, even if the original poster later deletes it.
9. Combining and Splitting Value
Although it would be possible to handle every unit separately, this would be unwieldy. To allow value to be split and combined, transactions contain multiple inputs and outputs. The equivalent social rule is simpler: one participant may hold conviction, another may hold screenshots, and a third may hold nothing except extremely loud opinions.
10. Privacy
The traditional banking model achieves a level of privacy by limiting access to information to the parties involved and the trusted third party. The public nature of a distributed network requires a different model: identities can remain pseudonymous while actions remain public.
This separation is particularly important in a meme network, where the person yelling “diamond hands” at 02:14 may reasonably wish not to explain that statement at breakfast.
11. Calculations
Consider the scenario of an attacker trying to generate an alternate chain faster than the honest chain. The probability decreases exponentially with the number of confirmations, assuming honest participants control the majority of effective work. In the SATOSHIBA network, effective work consists of hashpower, persistence, and refusal to panic at the first red candle.
12. The Genesis Anomaly
The earliest recoverable SATOSHIBA archive contains a malformed identification string. The machine appears to identify itself both as the creator and as the creature. No technical explanation has survived.
We do not attempt to resolve the contradiction. In decentralized systems, participants are free to verify the code, reject the mythology, or enjoy the joke.
13. Conclusion
We have proposed a system for electronic memes without relying on trust. We began with a chain of publicly verifiable events and extended it using a peer-to-peer network that records history according to accumulated work. The system is robust in its unstructured simplicity: nodes operate simultaneously, require little coordination, and need not be identified.
The only unresolved question is why the developer is a dog.