EventGraph upgrade

Objective

To enhance the Directed Acyclic Graph (DAG) based syncing mechanism by introducing blockchain-like headers in events (vertices). This aims to optimize synchronization speed by enabling header-based syncing first, followed by selective data retrieval as needed.

Key Concepts

  1. DAG Structure: Directed acyclic graphs represent relationships between event (or vertices). Syncing currently occurs by requesting and replying with events as a whole.
  2. Blockchain-like Design:
    • Headers: Lightweight metadata containing essential syncing information.
    • Payload: Actual event content or data, retrieved on demand.

Design and Implementation

1. Header Structure

Each event (vertex) will have a header containing:

  • Timestamp: Time of creation for ordering.
  • Parents: Links to previous events.
  • Layer: The hieght at which the event sits on in the graph.
  • Hash: A cryptographic hash of the payload for integrity verification. (or maybe this could be a method?)

2. Adjusted Sync Mechanism

  • Header First Sync:
    • Nodes exchange only headers during the initial sync process.
    • This reduces the volume of data being transmitted, improving sync speed.
  • Payload Retrieval on Demand:
    • Headers guide nodes to selectively request and download specific payloads based on user or app requirements.

3. Implementation Steps

[TODO]