Delegated proof of stake (DPoS) involves nodes voting to select newly generated blocks. In existing schemes, voting entails tallying affirmative, abstention, and negative votes for each node. This article introduces a novel approach wherein the votes cast by each node in every ballot are aggregated into a set, including nodes with all affirmative votes. The inclusion relationship of the set is treated as a partial order relation, and a lattice is defined based on this partial order relation. The calculation of the DPoS consensus algorithm based on the lattice is presented. In the existing schemes, voting results are calculated by counting the affirmative votes, abstention votes, and negative votes for a node. In such a voting system, the impact of a voting node on the possible selection of several affirmative votes and multiple voting results for an election vote was not considered. Some voting nodes may tend to cast more affirmative votes, while some voting nodes may prefer to cast fewer affirmative votes. In this paper, the new DPoS consensus mechanism is constructed to solve the impact of voting tendencies at these stages by counting the voting results of a node in a single vote.