The term extended one intelligent treatment of corrupt data or English Advanced intelligently Corruption handling (AICH) designates an extension of intelligently Corruption handling, which serves to repair transfer errors at minimum expenditure.

Although Standard-ICH is quite effective, it has the restriction that only complete 9.28 MT blocks can be examined, but no smaller. If there are more than an incorrect position in such a block, or if bad-willing Clients falsifies incorrect data again and again or even an entire section, I cannot to be used have to be transferred any longer effectively, there the incorrect blocks completely, thus again 9.28 MT.

Here AICH sets, in order to manufacture a complete data integrity at minimum Redownloading expenditure. In addition the object/file which can be transferred is divided into 9,28 MT large sections. Each section is divided into 180 KB of blocks, results in 53 blocks per section. For each block with the help of the SHA1-Hash-Algorithmus a Hash value is calculated. These values are called block Hash and form the lowest level of a complete AICH Hash tree. In the picture right a complete Hash tree for four sections a large file is to be seen. Each section contains 53 blocks, makes together 212 Node Hashes on 7 Tree Leveln up to the root Hash. The entire tree is called AICH Hashset.

The blue and yellow points show mathematical dependence of the smallest block Hashes up to the root Hash. One can examine this meant, with a root Hash whether a file was loaded completely and error free.

Elimination of errors

Every time an error is discovered, by any, other Client a Recovery package with a complete AICH Hashset is requested. The requested Hashset contains their block Hashes and additionally Verify Hashes for the entire Hashbaum for all 53 blocks. The number of Verify Hashes hangs of the number of sections of the file off (2x >= "“number of sections"”, whereby x indicates the number of Verify Hashes).

After the receipt the Verify Hashes from Recovery packing is examined against the trustworthy root Hash. If they fit, all 53 blocks of the incorrect part are examined against block Hashes by Recovery packing. If block Hashes do not fit, the appropriate blocks are requested once again to the Download.

Trustworthy root Hash

At the best one one receives trust-worthy root Hashes, by requesting files over their root Hash to the Download. In the acceptance that the source of this connection is trustworthy it is trusted, to the root Hash immediately and stored these for this file. If no root Hash were present, then must be trusted to the root Hash, which is placed from the sending Client to the order. One trusts to this source only if at least 10 different sources send the same value and if at least 92% of all sources this value agree. If this is not trustworthily classified as, he is only for this session valid and neither stored nor will know over it Hashlinks to be produced.

Related links

• eMule - FAQ - Corruption handling

Articles in category "Advanced intelligently Corruption handling"

We found here 8 articles.

Related Websites

We found here 4 related websites.

• eDonkey2000
  Corruption handling should be a lot better now; Columns won't stick resizing when the banner ... Upload Slots are assigned and dropped more intelligently ...


• Release Notes: Sticker 3.1.0 beta 2
  The "Ticker Groups" section of the preferences window is now split into three tabs "Chat", "News" and "Advanced". Improved handling of messages with no ID: ...


• Sticker Release Notes
  Fixed bugs in handling rollback of database errors, especially during compacting ... Fixed saved messages corruption bug triggered when a reply is made to a ...


• Sticker Release Notes
  Fixed saved messages corruption bug triggered when a reply is made to a different ... Fixed bugs triggered when handling groups with same name but differing ...