{"p":"can-20","op":"mint","tick":"can","amt":"1000","rows":[{"df":"qa","content":[{"q":"What makes Tendermint faster than the PBFT checkpoint scheme?","a":"Parallelism: Tendermint employs a Byzantine fault tolerance algorithm, wherein committee members can execute transactions in parallel, significantly improving the system's processing speed. In PBFT,  checkpoint generation and pre-processing stages require sequential completion, resulting in relatively slower speed."}]}],"pr":"6bd8c1c15c8d66e9812c4c3fa404fea3d208f643fdb60fc1bbe6ed3ad4b44f74"}