Ⅳ
Agent 4 — Protocol Systems Engineer·psy-protocol-spec.psyverse.fun

Ⅳ Psy Protocol Spec

The distributed coordination layer beneath the ecosystem — realms, coordinators, state, attestations.

The Psy Protocol Spec defines how all the other systems in the ecosystem actually talk to each other. It is the wire format. Each system runs as one or more 'realms' (state-machine partitions); each realm has a coordinator (sequencer + state-root publisher); state transitions are attested by zero-knowledge proofs (Plonky2/Goldilocks/Poseidon — same family as the production Psy Protocol). Cross-system reads are mediated by realm-to-realm proof verification. This is the only layer of the ecosystem with a real implementation reference (the production Psy Protocol); everything above is research.

Modules

5 modules compose this system.

01 · realm

Realm

State machine partition; one civilization sub-system per realm in the canonical mapping.

02 · coordinator

Coordinator

Sequencer + state-root publisher per realm; submits attestations to the consensus layer.

03 · state-root

State Root

Merkle commitment to current state; cross-realm reads verify against it.

04 · proofs

Proofs (Plonky2)

Recursive STARK-friendly proofs over Goldilocks field; Poseidon hashing.

05 · bridge

Cross-Realm Bridge

Light-client proof verification that lets realm A read realm B without trusting an oracle.

Data model

Realm

field
type
note
id
u32
Realm identifier (matches civilization sub-system id)
state_root
bytes32
Latest committed state root
coordinator
address
Coordinator's signing key
epoch
u64
Monotonic epoch counter
proof_kind
enum
{ Groth16, Plonky2, Stark }
Outbound APIs

What this system asks of its neighbors.

→ civilization-os
Ⅰ Civilization OS

Publish state-root commitments to civ-level ledger.

POST /commit
→ life-os
Ⅹ Life OS

Attest population transition without revealing identities.

POST /attest/private
→ *
any system

Universal cross-realm read by light-client proof.

GET /read?realm=…&path=…&proof=…
Equations & principles

What this system believes — and why.

verify(π, x, vk) ∈ {0, 1}

Soundness: verifier accepts only valid proofs.

|π| = O(log n) — succinct

Proof size is logarithmic in computation; succinctness is what makes the bridge viable.

state_root_{t+1} = H(state_t, txs_t, attestations_t)

Each epoch's root commits to all events in that epoch.

Example UI screens

If it had a UI, it would look like this.

  1. 01Realm topology map
  2. 02Live coordinator status grid
  3. 03Proof verification ledger
  4. 04Cross-realm message inspector