1·Create a simple report that lists each class file and its corresponding checksum.
创建简单的报告，列出每个类文件及其对应的校验和。
2·The first step in the unstable tree search is to recalculate the checksum over the page.
在不稳定树中搜索时，第一步是重新计算页面上的校验和。
3·ZFS solves this issue by generating a 32-bit checksum (or 256-bit hash) for metadata for each block written.
ZFS通过为写入的每个块的元数据生成32位校验和(或256位散列)解决了此问题。
4·Using one of these checksum algorithms reduces the chance of accidental corruption to less than one in a billion (though deliberate attacks are still a possibility, as you'll see).
使用这些校验和算法中的一种可以将程序遭受意外破坏的机率降低到少于十亿分之一(尽管故意攻击仍有可能)。
5·A way to counter the journal corruption is to compute a checksum of the transaction log and write it as part of the commit block process.
对付该问题的一个办法就是，计算一个事务日志的校验和，并把它作为commit block过程的一部分写到日志中。