BLOCKDAG ORDERING & CAUSALITY

Unlike traditional linear blockchains, Zeqron utilizes a Directed Acyclic Graph (DAG) for its ledger structure. This allows multiple blocks to be produced in parallel without immediate conflict, significantly increasing the network's throughput.

CAUSAL RELATIONS

Every block in the Zeqron Mesh must reference at least two previous blocks (tips). These references create a "causal cone" that defines the partial ordering of the network.

• ::PARENTS: The direct predecessors of a block.
• ::ANCESTORS: All blocks in the past-cone of the current block.
• ::TIPS: Blocks that have not yet been referenced by any newer blocks.

THE ORDERING ENGINE

To achieve global consensus on the state, Zeqron implements an ordering algorithm that linearizes the DAG into a sequence of "virtual blocks."

1. ::WEIGHT_CALCULATION: Each block is assigned a weight based on the reputation of the producing node and the accumulated history.
2. ::MAIN_CHAIN_SELECTION: The algorithm identifies a "Main Chain" (the thickest path) using the GHOST (Greedy Heaviest Observed Sub-Tree) rule.
3. ::VIRTUAL_ORDERING: All blocks in the side-chains are ordered relative to the main chain based on their DAG distance and hashes.

CONFLICT RESOLUTION

If two transactions in different branches of the DAG attempt to spend the same asset, the ordering engine automatically discards the one that appears later in the linearized sequence. This ensures that the network remains consistent without requiring a global leader.

Technical Specification // Core Lattice Architecture