Time necessary for data transfer within CREDITS considerably outruns familiar methods such as a bank transfer. That is why we decided to tell the difference between “old” and “new” transactions.
The thing is that information provided by hash is transferred in an unchanged form. Moreover, the system operates typical data which also speeds up transfer. Speed directly depends on the number of blocks in the chain or registers in the hash table, as in CREDITS.
A distributed hash table (DHT) is used for a permanent and stable connection between nodes. As structured data, a hash table can represent an associative massive which contains pairs (key-value). DHT term is also related to a range of principles and algorithms which allow to record data by distributing information of various node-keepers’ set. The principle of algorithm can also restore data by means of a key distributed search.