The current consensus mechanisms have the following problems： 1） "monopolization" of bookkeeping rights， that is， with the operation of the system， the bookkeeping rights are mastered by some nodes with more resources， resulting in the loss of small nodes with poor resources， which affects the system security； 2） during the election of stackholders， it is necessary to traverse the transaction records of all participating nodes， resulting in a rapid increase of the consensus delay. To solve these problems， a new consensus mechanism， CRT-PoT（Chinese Remainder Theorem-Proof of Trust）， was proposed. Firstly， based on Chinese Remainder Theorem （CRT）， a voting model CRT-Election was proposed for selecting stakeholders. This model stipulated that the candidates obtained the voting support of voters through the number of successful blocks and the number of successful votes to compete for bookkeeping rights. Then， based on this voting model， a multi-voting mechanism was proposed to ensure that small nodes had more opportunities for campaign for bookkeeping rights， effectively solving the problem of "monopolization" of bookkeeping rights； it also ensured that when the number of candidates increased， the consensus delay increased slowly， because this scheme did not need to traverse the transaction records of all participating nodes， the consensus delay was only related to the number of participating nodes， and the consensus delay increased linearly. Finally， from the theoretical analysis and experimental result perspectives， it was verified that compared with the existing consensus mechanisms， CRT-PoT not only effectively solves the problem of "monopolization" of bookkeeping rights， but also reduces the consensus delay.