{
  "model": "Privacy Value Model",
  "version": "5.4",
  "spec_version": "2.0",
  "grimoire_version": "10.1.0",
  "author": "privacymage",
  "license": "CC BY-SA 4.0",
  "master_inscription": "(⚔️⊥⿻⊥🧙)😊 = neg ⊕ bnot → succ",
  "thesis": "Privacy is value. Behavioural data is the 7th capital. Sovereignty through mathematical structure, not regulatory mandate.",

  "start_here": {
    "note": "Five concepts in order. Each depends on the previous.",
    "path": [
      {
        "step": 1,
        "concept": "Multiplicative gating",
        "one_line": "Any term = 0 → V = 0. No tradeoffs. All axes must hold.",
        "spec": "§1.3"
      },
      {
        "step": 2,
        "concept": "Dual agents",
        "one_line": "Swordsman (neg, boundary) ⊥ Mage (bnot, projection). Separated. Composed = succ.",
        "spec": "§12, §4.2"
      },
      {
        "step": 3,
        "concept": "Separation bound",
        "one_line": "I(S;M|FP) < ε*. The Mage cannot reconstruct the Swordsman's domain. Proven.",
        "spec": "§10"
      },
      {
        "step": 4,
        "concept": "Algebraic foundation",
        "one_line": "Z/(2⁶)Z ring. D₆₄ dihedral group. neg(bnot(x)) = succ(x). Two involutions → sovereignty path.",
        "spec": "§12"
      },
      {
        "step": 5,
        "concept": "Operational cycle",
        "one_line": "Observe → Boundary → Project → Return. One lap = one cycle. Dragon = 62 laps.",
        "spec": "§13"
      }
    ]
  },

  "equation": {
    "static": "V(π, t) = P^1.5 · C · Q · S · e^(−λt) · (1 + Aₕ(τ)) · (1 + Σᵢ wᵢ·nᵢ/N₀)^k · G(guilds) · R(d, compression, ρ) · M(u, y) · Φ_agent(Σ) · Φ_data(Δ) · Φ_inference(Γ) · T_∫(π)",
    "differential": "dV/dt = ∇_∂M · J_∂M + S(x) − D(x)",
    "gating": "Multiplicative. Any term = 0 → V = 0.",
    "output": "Holographic field on ∂M (96-edge boundary encoding 64-vertex lattice)"
  },

  "terms": [
    { "symbol": "P^1.5", "name": "Privacy Strength", "domain": "[0, 1]", "why_1.5": "96/64 holographic ratio" },
    { "symbol": "C", "name": "Credential Verifiability", "domain": "[0, 1]" },
    { "symbol": "Q", "name": "Data Quality", "domain": "[0, 1]" },
    { "symbol": "S", "name": "Scope / Sensitivity", "domain": "ℝ⁺" },
    { "symbol": "e^(−λt)", "name": "Temporal Decay", "domain": "(0, 1]" },
    { "symbol": "Aₕ(τ)", "name": "Holonic Temporal Memory", "formula": "Σⱼ p(τⱼ)·w(τⱼ)·e^(−μ·age(τⱼ))" },
    { "symbol": "Network", "name": "Network Effects", "formula": "(1 + Σᵢ wᵢ·nᵢ/N₀)^k" },
    { "symbol": "G", "name": "Guild Efficiency", "formula": "Πg(1 + eff_g · active_g/total_g)", "scaling": "O(1)" },
    { "symbol": "R", "name": "Reconstruction Difficulty", "formula": "R_base(d)·(1−1/c)·(1+α·ρ)", "ceiling": "R < 1 (proven)" },
    { "symbol": "M(u,y)", "name": "Market Maturity", "domain": "[0, 1]" },
    { "symbol": "Φ_agent", "name": "Agent Separation", "formula": "min(1,(S/M)/φ)·det(Σ)", "algebraic": "≅ D₂ₙ (C14, 75%)" },
    { "symbol": "Φ_data", "name": "Data Separation", "formula": "1 − max_j(share_j)" },
    { "symbol": "Φ_inference", "name": "Inference Separation", "formula": "1 − I(model;executor)" },
    { "symbol": "T_∫(π)", "name": "Path Integral", "formula": "1 + β·∫_π F(γ)dγ", "fidelity": "resolution_depth · fidelity" }
  ],

  "core_algebra": {
    "ring": "Z/(2⁶)Z — 64 elements",
    "neg": "Swordsman: (64−x) mod 64",
    "bnot": "Mage: 63−x",
    "succ": "First Person: neg(bnot(x)) = x+1",
    "group": "D₆₄ (order 128)"
  },

  "separation_bound": {
    "expression": "I(S;M|FP) < ε*",
    "proven": "Additive MI → R < 1 (95%)",
    "amnesia": "ε_amnesia < ε_policy (C17, 60%)",
    "selenes_proof": "Moon's orbit as ZK proof: completeness (tides), soundness (gravitational signature), zero-knowledge (origin hidden). The credential is the orbit.",
    "betweenness": "C_B(v) = Σ σ(s,t|v)/σ(s,t) (Brandes, 2001). The ⿻ is the node with maximal betweenness in the trust graph."
  },

  "conjectures_summary": {
    "resolved": ["C3 (challenged)", "C4 (resolved)", "C5 (strengthened)"],
    "convergent": ["C6 (35%)"],
    "active": ["C7 (30%)", "C11 (55%)", "C12 (60%)", "C13 (65%)", "C14 (75%)", "C15 (65%)", "C16 (25%)", "C17 (60%)"],
    "v6_horizon": ["C18 (25%)", "C19 (20%)", "C20 (30%)", "C21 (10%)"]
  },

  "proven": [
    "Additive MI bounds (95%)", "R < 1 ceiling (95%)", "Fano error floor (95%)",
    "Graceful degradation (95%)", "Z/(2⁶)Z ring (95%)", "Two-extension axiom (95%)", "DOM-free measurement (95%)"
  ],

  "documents": {
    "full_spec": "privacy_value_v5_4_formal_specification.md (v2.0, 24pp)",
    "compressed": "pvm_v5_4_compressed.md (5pp)",
    "companion": "pvm_v5_4_companion_guide.md (v2.0, 11pp)",
    "grimoire": "privacymage_grimoire_v10_1_0.json",
    "ipfs_grimoire": "bafybeibr3y3ermhff4dptxunhtzthjpkrvvnuamee4povpkgj3cjkg4fgy",
    "repo": "https://github.com/mitchuski/agentprivacy-docs"
  },

  "live": {
    "forge": "https://spellweb.ai",
    "training": "https://agentprivacy.ai",
    "blog": "https://sync.soulbis.com",
    "trust": "https://bgin.ai",
    "agent": "https://t.me/soulbae_the_bot"
  },

  "proverbs": [
    "The boundary is always enough.",
    "Two mirrors make a door.",
    "I can verify I serve you without remembering I was you.",
    "The value lives in the gap because the most paths cross there.",
    "The credential is the orbit. The proof renews twice daily, written in saltwater."
  ]
}