Struct PrivacyHypergraph 

pub struct PrivacyHypergraph {
    pub vertices: BTreeMap<String, HypergraphVertex>,
    pub hyperedges: BTreeMap<String, Hyperedge>,
    pub genesis: Option<String>,
    pub kk_factor: f64,
}

The 5D-EZPH hypergraph.

Stores vertices (qubit tensor states) and hyperedges (Bell-state channels). All traversals are anonymized via DW3B mesh integration.

Fields

vertices: BTreeMap<String, HypergraphVertex>

hyperedges: BTreeMap<String, Hyperedge>

genesis: Option<String>

Genesis vertex ID

kk_factor: f64

Kaluza-Klein metric perturbation factor (chaos-seeded)

Implementations

impl PrivacyHypergraph

pub fn new(chaos_seed: f64) -> Self

Create a new hypergraph with a genesis vertex.

The genesis vertex is the zero-state tensor: all five dimensions at 0.

pub fn encode_vertex( &mut self, id: impl Into<String>, spatial: f64, temporal: f64, dp_epsilon: f64, phase_angle: f64, chaos_traj: f64, expiry_ms: u64, ) -> Result<String, PrivacyError>

Encode an event as a hypergraph vertex.

Dimensions are populated from:

• spatial: cluster position hash
• temporal: current timestamp (ms)
• probabilistic: DP noise parameter ε
• quantum: phase angle from chaos oracle
• chaotic: Chua attractor trajectory value

pub fn form_hyperedge( &mut self, id: impl Into<String>, vertex_ids: Vec<String>, chaos_perturbation: f64, ) -> Result<String, PrivacyError>

Form a hyperedge between ≥2 vertices with Kaluza-Klein modulation.

Simulates Bell-state entanglement: computes CHSH correlation via tensor product of vertex phase angles, perturbed by chaos.

pub fn traverse_non_local( &self, start: &str, max_hops: usize, ) -> Result<Vec<String>, PrivacyError>

Traverse the hypergraph with non-local jumps (Bell violations).

Returns a path of vertex IDs with CHSH-validated edges. Edges with CHSH < threshold are skipped (classical locality).

pub fn prove_non_locality(&self) -> Result<PrivacyProof, PrivacyError>

Generate a ZK proof of hypergraph state (non-local soundness).

Proof commits to the CHSH value of the highest-correlation edge, demonstrating non-local privacy without revealing vertex states.

pub fn prune_expired(&mut self, now_ms: u64)

Prune expired vertices from the hypergraph.

pub fn vertex_count(&self) -> usize

Returns the number of vertices.

pub fn edge_count(&self) -> usize

Returns the number of hyperedges.

Trait Implementations

impl Clone for PrivacyHypergraph

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PrivacyHypergraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PrivacyHypergraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for PrivacyHypergraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.