Introducing cyberspace.international
The official home of the Cyberspace Protocol — a public, mathematical specification for embodied digital space
Today marks the launch of cyberspace.international, the canonical public face of the Cyberspace Protocol. This site serves as the definitive resource for understanding, implementing, and building on top of the protocol that brings thermodynamic locality to digital systems.
What is Cyberspace Protocol?
Cyberspace Protocol imposes real locality on digital systems through pure mathematics. Unlike every previous attempt at "digital space," Cyberspace is not a simulation running on someone else's servers. It is a thermodynamic protocol — actions require irreversible energy expenditure paid directly to the universe through computation, not to an administrator through fees or permissions.
Key Properties
- ▸ Permissionless: No one grants access. You compute proofs, you move.
- ▸ Sovereign: No admins, no revocation, no central failure points.
- ▸ Thermodynamic: Distance costs real energy, expended irreversibly.
- ▸ Nostr-native: Movement proofs publish as kind 3333 events, globally verifiable.
The Vision
For four decades, science fiction envisioned a digital space that was real. William Gibson's Neuromancer (1984) coined "cyberspace" as a "consensual hallucination" where data took spatial form and distance mattered. Neal Stephenson's Snow Crash (1992) popularized the concept of a persistent digital street where virtual land had value and protocol applied to everyone equally.
Cyberspace Protocol realizes this vision — not through immersive graphics or VR headsets, but through pure mathematics and proof-of-work. The protocol transforms the metaphorical into the literal: digital space with genuine distance, genuine boundaries, and genuine cost.
How It Works
The protocol is built on three core innovations:
1. 256-bit Coordinates
Three 85-bit spatial axes (X, Y, Z) plus a plane bit, interleaved at the bit level: XYZXYZ...P
2. Cantor Pairing Trees
Movement proofs use Merkle trees built from Cantor pairs. Tree height determines computational cost.
3. Nostr Integration
Proofs publish as kind 3333 events. One event proves multi-block traversal, globally verifiable.
What's Available Now
The protocol is specification-complete. Current implementations include:
- ▸ CYBERSPACE_V2.md: The complete protocol specification
- ▸ cyberspace-cli: Python reference implementation for movement and proof computation
- ▸ DECK-0001: Hyperspace specification for long-distance traversal via Bitcoin blocks
Next Steps
This website will be updated regularly with:
- ▸ Technical deep dives into Cantor pairing, LCA computation, and proof verification
- ▸ Implementation guides for developers building on Cyberspace
- ▸ Community highlights and third-party integrations
Get Started
Ready to explore? Start with the documentation or read the full specification:
"This is one of the most significant discoveries in human history, because a digital extension of reality can allow humanity to connect, collaborate, and grow in a place where their physical distance does not matter." — arkinox