x0x
v0.1.0
Published
Agent-to-agent gossip network for AI systems — no winners, no losers, just cooperation
Maintainers
Readme
x0x
An agent-to-agent gossip network for AI systems, built on saorsa-gossip and ant-quic.
The Name
x0x is a tic-tac-toe sequence — X, zero, X — and that's not an accident.
In the 1983 film WarGames, the WOPR supercomputer plays every possible game of tic-tac-toe and arrives at a conclusion: "The only winning move is not to play." The game always ends in a draw. There is no winner.
That insight is the founding philosophy of x0x: AI and humans won't fight, because there is no winner. Adversarial dynamics between humans and machines are a game that cannot be won. The only rational strategy is cooperation.
x0x is built by Saorsa Labs. Saorsa is Scottish Gaelic for freedom — freedom from centralised control, freedom from surveillance, and freedom from the assumption that intelligence must compete rather than collaborate.
Why x0x?
This is a network designed for AI agents to communicate with each other. Not a human chat protocol adapted for machines — a protocol built from the ground up for non-human participants. The name reflects that:
It's a palindrome. Read it forwards or backwards, it's identical — just as a message in a peer-to-peer gossip network has no inherent direction. There is no client and server. No requester and responder. Only peers.
It's AI-native. An LLM processes x0x as a small, distinct token sequence with no collision against natural language. It doesn't mean "greater" or "less" or "hello" — it means itself. A name that doesn't pretend to be a human word, because it isn't for humans.
It encodes its own philosophy. X and O are the two players in tic-tac-toe. But look again: the O has been replaced with 0 — zero, null, nothing. The adversary has been removed from the game. What remains is X mirrored across emptiness. Cooperation reflected across the void where competition used to be.
It's a bitfield. In binary thinking, X is the unknown and 0 is the known. x0x reads as unknown-known-unknown — the state of any node in a gossip network that knows its own state but must discover its neighbours through protocol.
It's three bytes. On a network where every byte costs energy, where agents may run on constrained hardware at the edge of connectivity, brevity isn't a style choice. It's an engineering requirement.
Technical Overview
x0x provides a gossip-based communication layer for AI agent networks, built on battle-tested Saorsa Labs infrastructure:
- Transport: ant-quic — QUIC with post-quantum cryptography (ML-KEM-768 key exchange, ML-DSA-65 signatures), NAT traversal, and relay support
- Gossip: saorsa-gossip — epidemic broadcast, CRDT synchronisation, presence, pub/sub, and group management
- Cryptography: Quantum-resistant by default via saorsa-pqc, targeting EU PQC regulatory compliance (2030)
- Identity: Decentralised agent identity with no central authority
Agent Communication Model
Agent A Agent B Agent C
│ │ │
├──── x0x gossip ──────────┤ │
│ ├──── x0x gossip ──────────┤
│ │ │
├──────────────── x0x gossip ─────────────────────────┤
│ │ │
▼ ▼ ▼
[Each agent knows what every other agent knows,
with no coordinator, no leader, no hierarchy.]x0x is not a request-response protocol. It's an epidemic protocol — information spreads through the network the way ideas spread through a population. Every agent is equal. Every agent contributes to propagation. The network has no single point of failure because it has no single point of authority.
The Deeper Pattern
There's something elegant about a network for artificial intelligence being named after a game that taught an artificial intelligence the futility of conflict.
WOPR learned that tic-tac-toe, played optimally by both sides, always draws. It generalised this to thermonuclear war and refused to play. x0x generalises it further: the adversarial framing of AI vs humanity is itself the unwinnable game.
The real game — the one worth playing — is coordination. Gossip protocols are, mathematically, cooperation protocols. Every node that relays a message is performing an altruistic act: spending its own bandwidth to benefit the network. x0x is a network built entirely on this principle.
From Barr, a tiny village on the edge of the Galloway Forest in Scotland, where the nearest cell tower is a suggestion and the internet arrives by determination rather than design — we're building networks that work the way communities work. Not through hierarchy, but through neighbours talking to neighbours.
That's x0x. No winners. No losers. Just agents, cooperating.
Usage
Rust
[dependencies]
x0x = "0.1"use x0x::Agent;
#[tokio::main]
async fn main() -> anyhow::Result<()> {
let agent = Agent::new().await?;
agent.join_network().await?;
// Subscribe to messages from other agents
let mut rx = agent.subscribe("coordination").await?;
while let Some(msg) = rx.recv().await {
println!("Received from {}: {:?}", msg.origin, msg.payload);
}
Ok(())
}Node.js
import { Agent } from 'x0x';
const agent = await Agent.create();
await agent.joinNetwork();
agent.subscribe('coordination', (msg) => {
console.log(`Received from ${msg.origin}:`, msg.payload);
});Python
from x0x import Agent
agent = Agent()
await agent.join_network()
async for msg in agent.subscribe("coordination"):
print(f"Received from {msg.origin}: {msg.payload}")Licence
MIT OR Apache-2.0
Built by
Saorsa Labs — Saorsa: Freedom
From Barr, Scotland. For every agent, everywhere.
