A consensus method in a consortium blockchain, comprising: splitting, by a consensus primary node in a consensus network of the consortium blockchain based on a specified erasure coding algorithm, transactions in a transaction list on which a consensus is to be reached into a plurality of orderly arranged data fragments that have a same quantity as consensus nodes in the consensus network, and constructing a Merkle tree based on the plurality of orderly arranged data fragments; constructing, by the consensus primary node, a VAL message corresponding to each data fragment based on the plurality of orderly arranged data fragments and the Merkle tree, sending each VAL message to a consensus node corresponding to a sequence of the data fragment in each VAL message, and locally saving a VAL message corresponding to the consensus primary node, wherein each VAL message comprises one data fragment, a corresponding Merkle tree path, and a root hash of the Merkle tree; constructing, by each consensus node in the consensus network, an ECHO message for a received VAL message, and broadcasting the constructed ECHO message to the consensus network, wherein the constructed ECHO message comprises a data fragment, a corresponding Merkle tree path, and the root hash of the Merkle tree in the received VAL message; and if a target consensus node in the consensus network does not receive a VAL message corresponding to the target consensus node within a predetermined time period but receives ECHO messages of N-2f consensus nodes, constructing, by the target consensus node, an ECHO message corresponding to the target consensus node based on the ECHO messages of the N-2f consensus nodes, wherein N is a quantity of consensus nodes in the consensus network, f is a maximum quantity of abnormal consensus nodes allowed in the consensus network, and N≥3f+1. splitting, by a consensus primary node in a consensus network of the consortium blockchain based on a specified erasure coding algorithm, transactions in a transaction list on which a consensus is to be reached into a plurality of orderly arranged data fragments that have a same quantity as consensus nodes in the consensus network, and constructing a Merkle tree based on the plurality of orderly arranged data fragments; constructing, by the consensus primary node, a VAL message corresponding to each data fragment based on the plurality of orderly arranged data fragments and the Merkle tree, sending each VAL message to a consensus node corresponding to a sequence of the data fragment in each VAL message, and locally saving a VAL message corresponding to the consensus primary node, wherein each VAL message comprises one data fragment, a corresponding Merkle tree path, and a root hash of the Merkle tree; constructing, by each consensus node in the consensus network, an ECHO message for a received VAL message, and broadcasting the constructed ECHO message to the consensus network, wherein the constructed ECHO message comprises a data fragment, a corresponding Merkle tree path, and the root hash of the Merkle tree in the received VAL message; and if a target consensus node in the consensus network does not receive a VAL message corresponding to the target consensus node within a predetermined time period but receives ECHO messages of N-2f consensus nodes, constructing, by the target consensus node, an ECHO message corresponding to the target consensus node based on the ECHO messages of the N-2f consensus nodes, wherein N is a quantity of consensus nodes in the consensus network, f is a maximum quantity of abnormal consensus nodes allowed in the consensus network, and N≥3f+1. <EOS>