C = (T, A)
meaning(node) = f(A), never f(T)
T = topology, A = audience, C = capability, P = path
replicate(T) ↛ change(A)
T ⊥ A
I = (path, ciphertext, T, A, C)
Context = Topology (where it runs) + Audience (who can read)
Meaning is function of Audience only. Moving bytes never changes meaning.
Replication never expands readability.
T and A are orthogonal.
Every island: I = path + ciphertext + T + A + C
private → A={self}, shared → |A|>1, encrypted → A crypto-enforced, replicated → |T|>1
readable = decrypt(state, A) vs location = replicate(state, T) - two different ops.
Source: whois.me, trust.me, Digital Space Algebra
https://suign.github.io/Equations.html
Top comments (0)