Mazzaroth: A High-Throughput DAG Consensus with State Root

TL;DR

Mazzaroth introduces a high-throughput, proof-of-work based DAG consensus mechanism with a novel linear ordering and dynamic difficulty adjustment, enabling efficient smart contract support and robust state finality.

Contribution

It presents a new DAG consensus algorithm with linear ordering and dynamic difficulty adjustment, supporting smart contracts and improving throughput over existing protocols.

Findings

Efficient consensus performance demonstrated through simulations

Supports smart contracts with state finality

Adapts to network and hashrate fluctuations

Abstract

Nakamoto Consensus achieves a decentralized ledger through a single-chain blockchain, assuming a maximum network delay, which limits block generation speed, resulting in low throughput. \cite{pg2018} (PG) enhances throughput using a blockDAG structure, but its probabilistic confirmation restricts smart contract applications. To address this, Mazzaroth proposes a Pow-based blockDAG consensus, employing a linear ordering algorithm to compute the \cite{eth} and achieve state finality, thereby supporting smart contracts. Its dynamic difficulty adjustment, independent of the assumption, adapts to network and hashrate fluctuations, ensuring state consistency via a head chain while maximizing throughput. Simulations validate Mazzaroth's efficient consensus performance. This paper presents the Mazzaroth ordering algorithm, the difficulty adjustment mechanism, and performance evaluation.