In this way, a node computes a hash of a block; transfers the much smaller signature to the peer node, which also calculates the hash; and then compares them.
这样一来，一个节点可以计算一个块的散列值；将较小的签名转移到对等节点，该节点也可以计算散列值，然后对两者进行比较。
While primary, each node permits Write operations, without those operations being propagated to the peer node.
而对于主节点而言，每个节点支持写操作，而不会将这些操作传播到对等节点。
In this case, the node that had changes simply synchronizes with the latent peer.
这样，已经发生改变的节点与潜在对等节点进行简单的同步。
应用推荐