Dynamic Weighted Random Leader Node Election Algorithm for Blockchain

As blockchain technology continues to be widely adopted, system scalability and performance issues have become increasingly prominent. To address the growing demand for transactions and enhance transaction processing efficiency, Layer-2 scaling technologies have become a critical research focus. Among these, Rollup technology is considered one of the most effective solutions to the scalability challenges of blockchains. Rollups process transactions off-chain and submit the results on-chain, thereby significantly freeing up on-chain storage space and greatly improving blockchain throughput. However, mainstream Rollup systems currently rely on centralized sequencer nodes to manage transaction ordering and batching. While these centralized sequencer nodes simplify system design and implementation, they introduce several security and reliability concerns. Firstly, centralized sequencer nodes are susceptible to censorship attacks, which pose risks of transaction tampering or denial for the system and its users. Secondly, any failure of centralized sequencer nodes can paralyze the entire network, severely affecting system availability and stability. To address these issues, we propose an innovative dynamic weighted random leader node election algorithm. This algorithm incorporates a commitment phase, a multi-signature voting phase, and a dynamic election pool management mechanism to ensure the security, privacy, and fairness of the election process. Additionally, by integrating elements of randomness, this algorithm increases the unpredictability of the election process, thereby enhancing the system's resilience to attacks. Experimental results demonstrate that the our algorithm significantly outperforms existing methods in filtering out abnormal nodes, thereby improving the reliability and security of sequencer node election.