Talk:Development ideas: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
*One could imagine a 3-level tree | *One could imagine a 3-level tree | ||
**a hash for each lowest-common-unit, say the commonly used | **a hash for each lowest-common-unit, say the commonly used 1K | ||
**a single top hash for each IBP allocation | **a single top hash for each IBP allocation | ||
**a single top hash for the file | **a single top hash for the file | ||
Revision as of 11:52, 24 January 2008
Data Integrity section.
- The idea of 64k chunks per allocation for checksums is what's termed a hash list
- which can be extended to a multi-level hash tree
- One could imagine a 3-level tree
- a hash for each lowest-common-unit, say the commonly used 1K
- a single top hash for each IBP allocation
- a single top hash for the file
- or more levels
- It seems to be common in distributed systems to use a binary hash tree rather than a hash list -- even on individual data blocks.
- Tiger Tree Hash TTH is the most? popular since it provides both high performance and high security
- http://en.wikipedia.org/wiki/Tiger_%28hash%29
- http://en.wikipedia.org/wiki/Hash_tree#Tiger_tree_hash
If the IBP protocol were to be extended to support a single specific checksum method it would possibly be something like TTH. In this example, this would mean TTH usage becomes part of the IBP protocol specification and both the client and depot would have to implement it.
- Dan 1/24/08