Content deleted Content added
Sorry, some of this does not meet the necessary style to be included in an article... |
→eD2k hash algorithm: Formatting and content update along the lines of the IP edit I've previously reverted. |
||
Line 24:
== eD2k hash algorithm ==
The eD2k hash function is a [[hash list|root hash]] of a list of [[MD4]] [[hash function|hashes]]
The file data is divided into full ''chunks'' of 9500 KiB (9728000 bytes) plus a remainder chunk, and a separate
This method of hashing allows the recipient to verify that a hash list corresponds to
In the past, there has been some ambiguity for files whose size is a multiple of the chunk size (9500 KiB). Old versions of some eD2k hash tools computed file hashes with an additional 0-byte chunk at the end. This is because an ambiguity of the therm ''reminder chunk'' which can be interpreted as either ''the last chunk'' or a ''non-full chunk at the end''. Following the latter interpretation, some implementations added a zero byte chunk in case the last chunk of a file was a complete one. This practice is discouraged however and the first interpretation is used as a standard nowadays to prevent some files from having different hashes depending on the algorithm implementation used to calculate their hash.<ref>http://mldonkey.sourceforge.net/Ed2k-hash</ref>
== Server links ==
|