Back to Documentation

Homomorphic Time Evolution

Structure-Preserving Homomorphisms and Epoch Transitions

3.1 Structure-Preserving Homomorphism

Each epoch Ti maintains a state commitment Ci. A structure-preserving homomorphism updates commitments while retaining group-law compatibility:

φH : Si → Si+1, Si+1 = φH(Si)

The homomorphism preserves the group law:

φH(a · b) = φH(a) · φH(b), ∀a,b ∈ Si

3.2 Causal Ordering

Mapping epochs to slices of Minkowski space provides a causal ordering that excludes superluminal double-spends. This ensures that:

  • Events are ordered by their temporal relationship
  • No transaction can be double-spent across causally separated epochs
  • The system maintains consistency under relativistic constraints

Homomorphic Property

The homomorphism φH preserves the group operation, ensuring that commitments can be combined and evolved while maintaining their mathematical structure.

Epoch Transitions

Each epoch Ti represents a discrete time step in the system, with state transitions governed by the homomorphic evolution function.

Mathematical Properties

Group Law Preservation

The homomorphism φH ensures that (a · b) → φH(a) · φH(b), maintaining the algebraic structure across epochs.

Causal Consistency

Minkowski space mapping ensures that events respect relativistic causality, preventing temporal paradoxes in the transaction ordering.

State Evolution

Each epoch transition Si → Si+1 preserves the entropy and security properties of the initial state.

Implementation Considerations

  • • Efficient computation of φH for large group orders
  • • Verification of homomorphic properties in zero-knowledge proofs
  • • Synchronization of epoch transitions across distributed nodes
  • • Handling of concurrent transactions within the same epoch
Thank You

Special thanks to the community members and selfless volunteers who contributed reviews, feedback, and technical insights to make this documentation possible.

Błażej and Jai Santos
Cryptographic ReviewersProtocol Contributors