广义来讲，***利用块链式数据结构来对数据进行验证与存储、利用分布式节点共识算法对数据进行更新、利用密码学方式确保数据的传输与访问安全、利用自动化脚本编写的智能合约来对系统-176搭建-0206+可电可微-5616数据进行编程和操作，是一种全新的分布式架构基础与计算方式。
The consistency hash algorithm proposes four definitions for determining the of a hash algorithm in a dynamically changing cache environment:
1.Balance:Balance refers to the ability of hash results to be distributed across all buffers as much as possible,allowing all buffer spaces to be utilized.Many hash algorithms can meet this condition.
2.Monotonicity:monotonicity means that if some content has been allocated to the corresponding buffer through hashing,new buffers are added to the system.The hash result should ensure that the previously allocated content can be mapped to the original or new buffer,without being mapped to other buffers in the old buffer set.
3.Spread:In a distributed environment,terminals may not see all the buffers,but only a portion of them.When a terminal wishes to map content onto a buffer through the hashing process,different terminals may see different buffer ranges,resulting in inconsistent hash results.The final result is that the same content is mapped to different buffers by different terminals.This situation should obviously be avoided,as it causes the same content to be stored in different buffers,reducing the efficiency of system storage.The definition of dispersion is the severity of the above situation.A good hash algorithm should be able to avoid inconsistencies as much as possible,which is to minimize dispersion.