AICH - Revision history

Cracki: oops. should be using the preview more often

2010-08-31T23:12:13Z

oops. should be using the preview more often

Cracki at 23:10, 31 August 2010

2010-08-31T23:10:14Z

Cracki: i'm not done yet...

2010-08-31T22:48:13Z

i'm not done yet...

Vollstrecker: Corrected Spelling of Deutsch in language selection

2008-08-04T14:20:02Z

Corrected Spelling of Deutsch in language selection

Vollstrecker: Removed Version Tag

2008-06-29T08:35:48Z

Removed Version Tag

Vollstrecker: Added Version Tag

2008-01-18T10:51:20Z

Added Version Tag

74.59.81.5: /* Definitions */

2007-09-26T02:03:10Z

‎Definitions

Ihmselbst: added link to the german translation

2006-02-06T13:36:03Z

added link to the german translation

69.197.237.64 at 20:30, 22 January 2006

2006-01-22T20:30:47Z

Ateo at 21:16, 1 June 2005

2005-06-01T21:16:25Z

@@ Line 6: / Line 6: @@
 == Description ==
-[[ICH|ICH's]] success is indisputable but it would be convenient to know exactly which part of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]], especially when multiple parts are corrupted. [[AICH]] (Advanced Intelligent [[Corrupt]]ion Handler) takes care of this task and allows [[aMule]] and any other supporting [[clients]] to know precisely which portions of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] are [[Corrupt|corrupt]].
+[[ICH|ICH's]] success is indisputable but it would be convenient to know exactly which part of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]], especially when multiple parts are corrupted. [[AICH]] (Advanced Intelligent [[Corrupt]]ion Handler) takes care of this task and allows [[aMule]] and any other supporting [[client|clients]] to know precisely which portions of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] are [[Corrupt|corrupt]].
 == Definitions ==

@@ Line 6: / Line 6: @@
 == Description ==
-[[ICH|ICH's]] success is indisputable but it would be convenient to know exactly which part of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]], especially when multiple parts are corrupted. [[AICH]] (Advanced Intelligent [[Corrupt]]ion Handler) takes care of this task and allows [[aMule]] and any other supporting [[client]] to know precisely which portions of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]].
+[[ICH|ICH's]] success is indisputable but it would be convenient to know exactly which part of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]], especially when multiple parts are corrupted. [[AICH]] (Advanced Intelligent [[Corrupt]]ion Handler) takes care of this task and allows [[aMule]] and any other supporting [[clients]] to know precisely which portions of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] are [[Corrupt|corrupt]].
 == Definitions ==
@@ Line 14: / Line 14: @@
 == The actual work ==
-When a [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is known to be [[Corrupt|corrupt]], [[aMule]] will try to get an [[AICH Hashset]] from a [[client]] sharing that file which is complete, meaning the file at the client side is complete. It will ask for the all hashes of the 53 parts in the [[Corrupt|corrupt]] [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] and the necessary [[Verifying Hash|Verifying Hashes]] to complete the [[AICH Hashset]] tree up to the [[Root Hash]].
+When a [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is known to be [[Corrupt|corrupt]], [[aMule]] will try to get an [[AICH Hashset]] from a [[client]] that is sharing the complete file. It will ask for the all hashes of the 53 parts in the [[Corrupt|corrupt]] [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] and the necessary [[Verifying Hash|Verifying Hashes]] to complete the [[AICH Hashset]] tree up to the [[Root Hash]].
-Once it gets the [[Block Hash|Block Hashes]] and the [[Verifying Hash|Verifying Hashes]], it builds up the tree to get the [[Root Hash]] and check if it's the same as the [[Root Hash]] the original [[ed2k link]]s provided. If it is, those [[Block Hash|Block Hashes]] will be considered as reliable. If it isn't, then the [[Block Hash|Block Hashes]] and [[Verifying Hash|Verifying Hashes]] will be dropped and considered fakes.
+Once it gets the [[Block Hash|Block Hashes]] and the [[Verifying Hash|Verifying Hashes]], it builds up the tree to get the [[Root Hash]] and check if it's the same as the [[Root Hash]] provided by the original [[ed2k link]]. If it is, those [[Block Hash|Block Hashes]] will be considered reliable. If it isn't, the [[Block Hash|Block Hashes]] and [[Verifying Hash|Verifying Hashes]] will be dropped and considered fakes.
-Once the [[Block Hash]]es are considered reliable, each 180KB part in the [[Corrupt|corrupt]]ed [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] will be hashed (using the [http://www.faqs.org/rfcs/rfc3174.html SHA1 algorithm]) in order to compare the resulting hash with the recieved [[Block Hash]]es. If they are the same, then that part is not [[Corrupt|corrupt]]ed, so there's no need to redownload it. If they're not the same, then that part is [[Corrupt|corrupt]]ed and it will be redownloaded.
+Once the [[Block Hash]]es are considered reliable, each 180KB part in the [[Corrupt|corrupt]]ed [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] will be hashed (using the [http://www.faqs.org/rfcs/rfc3174.html SHA1 algorithm]) in order to compare the resulting hash with the received [[Block Hash]]es. If they are the same, that part alright, so there's no need to download it again. If the hashes are different, that part is [[Corrupt|corrupt]]ed and it will be downloaded again.
 == How is the [[Root Hash]] spread? ==
@@ Line 24: / Line 24: @@
 The ideal way to spread the [[Root Hash]] is through the [[ed2k link]]. However, files are more frequently downloaded through the search feature of the [[FAQ_eD2k-Kademlia#What_is_ED2K?|eD2k]] [[client]]. Also, the [[ed2k link]] might not include the [[Root Hash]] in its URL. In such cases an alternative method is used to get the file's [[Root Hash]].
-[[client|Clients]] ask other [[client|clients]] for the [[Root Hash]]. If at least 10 other [[client]]s send you the same [[Root Hash]] and that is 92% or more of the total [[Root Hash]]es received, that [[Root Hash]] will be considered as reliable for the '''current session only'''. It will not be stored anywhere on disk and will only be kept in memory. Also, it will not be shared with any other [[client]] who asks for it.
+[[client|Clients]] ask other [[client|clients]] for the [[Root Hash]]. If at least 10 other [[client]]s send you the same [[Root Hash]] and that is 92% or more of the total [[Root Hash]]es received, that [[Root Hash]] will be considered reliable for the '''current session only'''. It will not be stored anywhere on disk and will only be kept in memory. Also, it will not be shared with any other [[client]] who asks for it.
 When the file download is completed, the [[Root Hash]] will be calculated, with the whole [[AICH Hashset]], stored in ''~/.aMule/known2.met'' and shared with any [[client]] who asks for it.
@@ Line 30: / Line 30: @@
 == Storing the [[AICH Hashset]] ==
-Once a file has been completly downloaded, [[aMule]] builds its complete [[AICH Hashset]] and stores it in ''~/.aMule/known2.met'' so whenever a [[client]] asks for it, it can provide it without having to recalculate it every time.
+Once a file has been downloaded completely, [[aMule]] builds its complete [[AICH Hashset]] and stores it in ''~/.aMule/known2.met'' so whenever a [[client]] asks for it, aMule can provide the Hashset without having to recalculate it every time.
-Please notice that as long as the AICH method can be applied to a file, [[ICH]] will not be used for that file.
+Please note that as long as the AICH method can be applied to a file, [[ICH]] will not be used for that file.

@@ Line 6: / Line 6: @@
 == Description ==
-[[ICH|ICH's]] success has no point to be discussed about, but it comes to an end where being able to actually know which exact part of the  [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]] would make life easier. This comes specially significant when several [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunks]] are [[Corrupt|corrupt]]. [[AICH]] (Advanced Intelligent [[Corrupt]]ion Handler) takes part in this problem and allows [[aMule]], or any [[client]] supporting it, to actually know which portions of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]].
+[[ICH|ICH's]] success is indisputable but it would be convenient to know exactly which part of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]], especially when multiple parts are corrupted. [[AICH]] (Advanced Intelligent [[Corrupt]]ion Handler) takes care of this task and allows [[aMule]] and any other supporting [[client]] to know precisely which portions of the [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is [[Corrupt|corrupt]].
 == Definitions ==

@@ Line 1: / Line 1: @@
 <center>
-'''English''' | [[AICH-de|German]]
+'''English''' |
 </center>

← Older revision		Revision as of 08:35, 29 June 2008
Line 32:		Line 32:

	Please notice that as long as the AICH method can be applied to a file, [[ICH]] will not be used for that file.		Please notice that as long as the AICH method can be applied to a file, [[ICH]] will not be used for that file.
−
−	~~== Version ==~~
−	~~Created by Jacobo221 on 03.10.04 at 00:34<br>~~
−	~~Updated by Vollstrecker on 18.01.08 at 11:49~~

← Older revision		Revision as of 10:51, 18 January 2008
Line 32:		Line 32:

	Please notice that as long as the AICH method can be applied to a file, [[ICH]] will not be used for that file.		Please notice that as long as the AICH method can be applied to a file, [[ICH]] will not be used for that file.
		+
		+	== Version ==
		+	Created by Jacobo221 on 03.10.04 at 00:34<br>
		+	Updated by Vollstrecker on 18.01.08 at 11:49

@@ Line 9: / Line 9: @@
 == Definitions ==
-Each [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is divided into 53 180KB parts and each of these parts is hashed using the [http://www.faqs.org/rfcs/rfc3174.html SHA1 algorithm]. Each of these hashes is called a [[Block Hash]]. By combining pairs of [[Block Hash|Block Hashes]] (i.e. each part with the part next to it) [[aMule]] will get a whole tree of hashes (this tree which is therefore a hashset made of all of the other [[Block Hash|Block Hashes]] is called the [[AICH Hashset]]). Each hash which is neither a [[Block Hash]] nor the [[Root Hash]], is a [[Verifying Hash]]. The hash at the top level is the [[Root Hash]] and it is supposed to be provided by the [[ed2k link]] when releasing.
+Each [[FAQ_eD2k-Kademlia#What_is_a_chunk?|chunk]] is divided into 53 parts (52x 180KB and 1x 140KB) and each of these parts is hashed using the [http://www.faqs.org/rfcs/rfc3174.html SHA1 algorithm]. Each of these hashes is called a [[Block Hash]]. By combining pairs of [[Block Hash|Block Hashes]] (i.e. each part with the part next to it) [[aMule]] will get a whole tree of hashes (this tree which is therefore a hashset made of all of the other [[Block Hash|Block Hashes]] is called the [[AICH Hashset]]). Each hash which is neither a [[Block Hash]] nor the [[Root Hash]], is a [[Verifying Hash]]. The hash at the top level is the [[Root Hash]] and it is supposed to be provided by the [[ed2k link]] when releasing.
 == The actual work ==

← Older revision		Revision as of 13:36, 6 February 2006
Line 1:		Line 1:
		+	<center>
		+	'''English''' \| [[AICH-de\|German]]
		+	</center>
		+
	== Description ==		== Description ==