Difference between revisions of "Verifying Hash"
From AMule Project FAQ
Vollstrecker (Talk | contribs) (Language Links added) |
|||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| + | <center>'''English''' | [[Verifying_Hash-de|Deutsch]]</center> | ||
| + | |||
The Verifying Hashes, in an [[AICH]] supporter [[client]], are those which aren't neither [[Block Hash]]es not the [[Root Hash]]. | The Verifying Hashes, in an [[AICH]] supporter [[client]], are those which aren't neither [[Block Hash]]es not the [[Root Hash]]. | ||
| − | Each Verifying Hash is calculated out of the concatenation of the [http://www.faqs.org/rfcs/rfc3174.html SHA1] hash strings of the Verifying Hashes or [[Block Hash]]es in the | + | Each Verifying Hash is calculated out of the concatenation of the [http://www.faqs.org/rfcs/rfc3174.html SHA1] hash strings of the Verifying Hashes or [[Block Hash]]es in the level right beneath (in the [[AICH Hashset]] tree). |
| − | Their purpose are to make a [[client]] easier to know if the recieved [[Block Hash]]es are [[Fake|fake]]/[[Corrupt|corrupt]] or not by sending those Veryfing Hashes, instead of all the [[Block Hash]]es of a file, when no [[Block Hash]]es in the levels beneath that Verifying Hash (in the [[ | + | Their purpose are to make a [[client]] easier to know if the recieved [[Block Hash]]es are [[Fake|fake]]/[[Corrupt|corrupt]] or not by sending those Veryfing Hashes, instead of all the [[Block Hash]]es of a file, when no [[Block Hash]]es in the levels beneath that Verifying Hash (in the [[AICH Hashset]] tree) have been asked by the [[client]]. |
| − | This avoids both using more bandwidth and CPU cycles on the | + | This avoids both using more bandwidth and CPU cycles on the remote (recieving) [[client]]. |
Latest revision as of 14:37, 3 September 2007
The Verifying Hashes, in an AICH supporter client, are those which aren't neither Block Hashes not the Root Hash.
Each Verifying Hash is calculated out of the concatenation of the SHA1 hash strings of the Verifying Hashes or Block Hashes in the level right beneath (in the AICH Hashset tree).
Their purpose are to make a client easier to know if the recieved Block Hashes are fake/corrupt or not by sending those Veryfing Hashes, instead of all the Block Hashes of a file, when no Block Hashes in the levels beneath that Verifying Hash (in the AICH Hashset tree) have been asked by the client.
This avoids both using more bandwidth and CPU cycles on the remote (recieving) client.
