T A: Replication Should Not Change Audience

TL;DR: C=(T,A). Topology is where bytes sit. Audience is who can read. T ⊥ A means copying never expands audience — by cryptography, not policy.

The Core

C = (T, A)
meaning(node) = f(A), never f(T)
replicate(T) ↛️ change(A)
I = (path, ciphertext, T, A, C)

Mechanism

readable(state) = decrypt(state, A)
location(state) = replicate(state, T)

• A = A₁ ∪ A₂ ∪ ... → any member reads
• A = A₁ ∩ A₂ ∩ ... → all required, XOR-split: Sₙ = S ⊕ S₁ ⊕ ...
• identityHash(K) = keccak256("this.me/identity:v1::" + K.seed)

Why It Matters

You can replicate to 100 nodes (|T|>1) while A={self} stays locked. Node stores ciphertext, not meaning.

Sources

• Glossary: https://suign.github.io/Equations.html
• Context Algebra: https://suign.github.io/Equations.html
• Live: https://neurons.me

Glossary explainer of work by Sui Gn (@suign).