[重要]以後不回答集成性解碼包的問題

引用

最初由 weilai 发布
講到 ED HASH
這裡說一個個人的小故事

幾天前下了個 死神51集 結果後半段有壞禎(畫面移動變水彩畫面)
後來再用emule找了同版本的下了回來 (這次檢查同一時段是好的...好家在^^)
用 LinkCreator 分別對兩個檔案做 Hash
竟然一樣
用 FlashSfvcht 生成 sfv
不一樣
(做一次 Hash 或 sfv 就清一次File Cache)

證明了 ED HASH 不比 sfv/md5 可靠

引用

最初由 風之殤 发布
CRC算法別去用人腦想吧.......

参考
http://www.pediy.com/tutorial/chap6/Chap6-2-4.htm

反正在這邊只公佈ED的HASH 不會有CRC

引用

File Hash, Part Hashes & Hashset
For every file shared in the network an unique identification value is created using the mathematical crypto algorithm MD4. This value is called file hash and is contained in every standard eD2k link, e.g.

ed2k://|file|name|12043984|6744FC42EDA527B27F0B2F2538728B3E|/

where 6744FC42EDA527B27F0B2F2538728B3E is the file hash making this file uniquely identified all over the network.
This File Hash is calculated by dividing the entire file into parts of 9.28 MB. For each of the parts a Part Hash is calculated using the same MD4 algorithm. These Part Hashes, called Hashset, are then used to calculate the final File Hash. For example a 600 MB file would be divided into 65 parts each with its own Part Hash which are then used to create the final File Hash.
To make sure that eMule always receives the correct Hashset a special link can be created containing this, e.g.

ed2k://|file|name|12043984|6744FC42EDA527B27F0B2F2538728B3E|p=264E6F6B587985D87EB0157A2A7BAF40:17B9A4D1DCE0E4C2B672DF257145E98A|/

where the p= value denotes the Hashset. Each Part Hash is divided by a ":". This file has a size of 12043984 Bytes (=11.49 MB) which means it has one full 9.28 part and the rest left to 11.49 MB resulting in two Part Hashes.