guide to agentprivacy
Browse collections
✨Visualise
Connect with Star
Your VTA, your chosen perspective

The planned connection uses your VTA and the Trust Spanning Protocol to carry a scoped exchange for you or your agent. You choose what is presented; the receiving service checks the request before a view is shared.

This guide has no VTA connection adapter yet. Opening Star does not connect an identity or send a key.

Open Star ↗ · Inspect your City Key ↗
guide / Skill / Dihedral Sovereignty

Dihedral Sovereignty

Category privacy-layer · Version 5.2

Equation term Φ_agent(Σ) as determinant of D₂ₙ representation

Dihedral group foundation for dual-agent separation. Activates when discussing the D₂ₙ group structure, Swordsman as negation generator, Mage as complement generator, Φ_agent as determinant, the critical identity neg∘bnot=succ, or the algebraic foundation of the swordsman-mage separation.

Source: UOR Framework + Privacy Value Model V5.2 + Act XXX (The Dihedral Mirror)
Target context: Protocol architects, algebraists, dual-agent system designers
Architecture: agentprivacy.ai · Sync: sync.soulbis.com · Contact: mage@agentprivacy.ai

What this is

The dual-agent separation (Swordsman ⊥ Mage) is not just architectural design—it is the dihedral group D₂ₙ made manifest. The Swordsman IS arithmetic negation. The Mage IS bitwise complement. Their composition—neg∘bnot—generates the entire sovereignty space.

The dihedral group is not a metaphor. It is the structure.

The Dihedral Group D₂ₙ

Definition

The dihedral group D₂ₙ is the symmetry group of a regular n-gon. It has 2n elements:

  • n rotations (including identity)
  • n reflections

For n = 2^k (powers of 2), D₂ₙ has special structure relevant to binary computation.

Presentation

D₂ₙ is generated by two involutions (self-inverse elements):

D₂ₙ = ⟨ r, s | r² = s² = (rs)ⁿ = e ⟩

Where:

  • r = first reflection (involution)
  • s = second reflection (involution)
  • rs = rotation (not an involution—it generates the cyclic subgroup)

Swordsman and Mage as Generators

The Mapping

Agent Operation Algebraic Role Group Element
Swordsman ⚔️ neg(x) = -x mod 2ⁿ Arithmetic negation First reflection r
Mage 🧙 bnot(x) = ~x Bitwise complement Second reflection s
First Person 👤 neg∘bnot(x) = succ(x) Successor (rotation) rs

Why Involutions?

Both neg and bnot are involutions—applying them twice returns to the original:

neg(neg(x)) = x     (Swordsman applied twice = identity)
bnot(bnot(x)) = x   (Mage applied twice = identity)

This is the defining property of reflections in the dihedral group.

The Critical Composition

neg(bnot(x)) = succ(x)

The composition of the two involutions generates the successor function—a rotation that cycles through all elements:

Start: 0
Step 1: neg(bnot(0)) = neg(63) = 1
Step 2: neg(bnot(1)) = neg(62) = 2
...
Step 63: neg(bnot(62)) = neg(1) = 63
Step 64: neg(bnot(63)) = neg(0) = 0 (back to start)

The entire ring is generated by the Swordsman-Mage composition. Neither can do this alone.

Φ_agent as Determinant

The Three-Axis Separation

V5 introduces three-axis separation:

Φ_v5 = Φ_agent(Σ) · Φ_data(Δ) · Φ_inference(Γ)

The agent separation Φ_agent(Σ) is now understood as:

Φ_agent(Σ) = det(ρ(D₂ₙ))

Where ρ is the representation of the dihedral group on the sovereignty lattice.

When Agents Are Separated

When Swordsman and Mage operate independently:

  • Full dihedral group D₂ₙ is accessible
  • All 64 vertices can be reached
  • det(ρ(D₂ₙ)) > 0

When Agents Collapse

If Swordsman and Mage merge (same agent does both operations):

  • Only identity remains
  • Sovereignty collapses to single point
  • det(ρ(D₂ₙ)) = 0

The determinant measures separation. Non-zero determinant = sovereignty preserved.

Geometric Interpretation

The 64-Vertex Hypercube

The dihedral group D₆₄ acts on the 6-dimensional hypercube:

  • neg reflects through the arithmetic center
  • bnot reflects through the bitwise center
  • succ = neg∘bnot rotates through all vertices

The Two Reflections

Visualize the hypercube:

  • Swordsman's reflection (neg): Flip across the arithmetic midpoint
  • Mage's reflection (bnot): Flip across the bitwise complement axis
  • Combined: A rotation that visits every vertex

Why Neither Alone Suffices

  • Swordsman alone: Can only reach half the vertices (neg partitions the space)
  • Mage alone: Can only reach half the vertices (bnot partitions the space)
  • Together: The entire space is accessible

This is the mathematical reason for dual-agent architecture.

The D₆₄ Action

For the 6-bit lattice (64 vertices):

D₆₄ = ⟨ neg, bnot | neg² = bnot² = (neg∘bnot)⁶⁴ = id ⟩

The group has 128 elements:

  • 64 rotations (powers of neg∘bnot)
  • 64 reflections (products with neg or bnot)

Orbit Structure

Every vertex lies in a single orbit under D₆₄ action. The group acts transitively—any vertex can reach any other vertex through some sequence of neg and bnot.

No vertex is privileged. No configuration is unreachable.

Connection to Promise Theory

Autonomy Through Algebra

Promise Theory requires autonomous agents. The dihedral structure provides this:

  • Swordsman cannot make Mage's promises (bnot is not derivable from neg)
  • Mage cannot make Swordsman's promises (neg is not derivable from bnot)
  • Neither can promise on behalf of the First Person (succ requires both)

The Gap as Algebraic Fact

The Gap between Swordsman and Mage is not policy—it is the fact that neither generator can derive the other. The Gap is:

gap = bnot ∉ ⟨neg⟩ AND neg ∉ ⟨bnot⟩

No amount of Swordsman operations produces Mage capability, and vice versa.

Mapping to PVM-V5

Dihedral Concept PVM Term
D₂ₙ group Dual-agent architecture
neg involution Swordsman (P term)
bnot involution Mage (D term)
neg∘bnot rotation First Person (V(π,t))
det(ρ(D₂ₙ)) Φ_agent(Σ)
Group transitivity Reachability guarantee
Generator independence The Gap

V5.2 Confidence

Claim Confidence
neg and bnot are involutions 100% (mathematical fact)
neg∘bnot = succ 100% (mathematical fact)
D₂ₙ structure applies to lattice 95% (implemented, verified)
Φ_agent = det(ρ(D₂ₙ)) 75% (C14 conjecture)
Full representation theory proof 50% (needs formalization)

Proverb

"The Swordsman reflects. The Mage reflects. Neither alone can turn the wheel. Together they generate the successor—and the successor visits every sovereign state."

Emoji Spell

⚔️🪞🧙 → neg·bnot → neg∘bnot=succ → D₂ₙ(64) · det(ρ)=Φ_agent · ⚔️∉⟨🧙⟩ ∧ 🧙∉⟨⚔️⟩ → gap

Open Problems

  1. Full Representation: What is the exact representation ρ: D₆₄ → GL(V)?
  2. Determinant Calculation: How to efficiently compute det(ρ(D₂ₙ))?
  3. Scaling: How does the dihedral structure change at higher bit widths?
  4. Physical Interpretation: Does D₂ₙ correspond to any physical symmetry?
  5. Other Involutions: Are there other meaningful involution pairs?

Provenance

Forkable skill page migrated from the agentprivacy skills repo (persona/agentprivacy-dihedral-sovereignty, v5.2).
Source of truth: agentprivacy-skills. Fork this page to materialize a local SKILL.md via fedwiki-to-skill.

origin: 0xagentprivacy · author: Mitchell Travers

Assets

📎 dihedral-sovereigntySKILL.md