Yottachain built by renowned international scientist Professor Wang Donglin dispersed storage resources are connected together to form a self-healing capabilities, large-scale and with a global shared memory pool, and make sure everybody's sovereignty data is stored in the integrity of 10000 more times.
Yottachain different from Bitcoin and Ethernet Square, because Yottachain digging through their own storage space. For Yottachain, in addition to the idle resources used in mining, it is being used and will soon also be used to store resources in return for mining, data storage and exchange incentives.
Yottachain developed its own unique core technology, through the BSP (BiockchainStorageProtocol) protocol plays a decisive role in the block chain store, and by BSP agreement to build an open platform for the entire block chain store industry, called BSP open platform.
Proprietary technology block chain storage system can be achieved by all the features of the agreement docking BSP BSP open platform, including proprietary technologies play a decisive role in the block chain store, directly bring market interest, as well as very professional storage services, professional key management and account management functions. "Go weighted effect & its benefits far greater than their own storage amplification factor (this is because users have more data, the higher the magnification factor), thus borrow and sell more data storage space.
The only YottaChain have TruPrivacy technology will increase data security mechanisms in the existing IPF storage design.
Data is encrypted using zero-knowledge, and then the data is heavy, so in the end to store non-encrypted duplicate data, do not have permission people (including the owner of the storage node, the system designer / maintenance personnel) absolutely do not know the contents of the data. File system permissions have been achieved, access to the file is based on the three dimensions of the file owner, group, and everyone files defined.
YottaChain persistent storage service is redundant, no data is automatically encoded into N (for example, 100, the next Commission will decide the number of community governance). As long as there is any M (e.g., 70) segments, the data can be restored, and then N-fragment may be stored in each of the N storage node and each node of a segment. Thus, as long as the N-M1 (in this case node 31) fails at different times, we can guarantee the integrity of the data without loss.
Each node will monitor and inspect each other in case of failure, you can quickly find any node. When any node fails, the system will immediately select another node to reconstruct the data of the failed node. In this case, as long as the reconstruction of an invalid node, there will be 30 other nodes have failed to ensure that data is not lost. Rebuilding a failed node just 50 seconds.