A Fast Algorithm for Liquid Voting on Blockchain

【Author】 Zhou, Xiaoping; Li, Peng; Zeng, Yulong; Fan, Xuepeng; Liu, Peng; Miyazaki, Toshiaki

【Source】IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS

【影响因子】0.695

【Abstract】Blockchain-based voting, including liquid voting, has been extensively studied in recent years. However, it remains challenging to implement liquid voting on blockchain using Ethereum smart contract. The challenge comes from the gas limit, which is that the number of instructions for processing a ballot cannot exceed a certain amount. This restricts the application scenario with respect to algorithms whose time complexity is linear to the number of voters, i.e., O(n). As the blockchain technology can well share and reuse the resources, we study a model of liquid voting on blockchain and propose a fast algorithm, named Flash, to eliminate the restriction. The key idea behind our algorithm is to shift some on-chain process to off-chain. In detail, we first construct a Merkle tree off-chain which contains all voters' properties. Second, we use Merkle proof and interval tree to process each ballot with O(log n) on-chain time complexity. Theoretically, the algorithm can support up to 21000 voters with respect to the current gas limit on Ethereum. Experimentally, the result implies that the consumed gas fee remains at a very low level when the number of voters increases. This means our algorithm makes liquid voting on blockchain practical even for massive voters.

【Keywords】liquid voting; blockchain; smart contract; gas limit; Merkle tree

【发表时间】2021 AUG

【收录时间】2022-01-02

【文献类型】

【主题类别】

--