Q-DPoS: An Improved DPoS Consensus based on Quadratic Voting Mechanism in Web 3.0

The consensus mechanism plays a crucial role in maintaining the consistency of distributed systems. However, with the advent of the Web 3.0 era, traditional DPoS consensus faces a series of challenges. Initially, an enduring surge in the demand for decentralization is evident within the domain of Web 3.0. Subsequently, Web 3.0 accentuates heightened requisites for the engagement of common users. To address the above challenges, we introduce Quadratic Voting into the DPoS, constructing the Q-DPoS consensus. It encompasses improvements to the phases of voting power distribution, vote counting, and reward settlement, thereby augmenting the participation levels and incentives for individuals with lower stakes. In addition, to prevent the degradation of our Q-DPoS into a linear reward scheme under the Sybil attack, we incorporate admission rules and vote similarity detection steps. Simulation results demonstrate that our Q-DPoS enhances voter participation, and mitigates stake centralization issues compared to the linear reward scheme, thus improving system decentralization. Theoretical analysis on game theory further suggests that this approach effectively enhances the diversity of voting preferences.