{"p":"can-20","op":"mint","tick":"can","amt":"1000","rows":[{"df":"qa","content":[{"q":"How performant is the Tendermint consensus algorithm?","a":"Efficiency: Tendermint adopts Byzantine fault tolerance (BFT) and proof-of-stake (POS) mechanisms, which provide high efficiency in  the consensus process. Compared to traditional consensus algorithms such as proof-of-work (PoW), Tendermint can significantly reduce the computational burden of nodes under the same security conditions."}]}],"pr":"cbc72f8e33d0e70e5c48259df8b58248d00f5cadf2680307c9031d3db1a70dc1"}