Blockchain is a technology that has the greatest social value in the world.
Introduction
The stability of Bitcoin proves that a practical, internet-scale, Byzantine faulttolerant system is feasible, and the reliability of the system is guaranteed through its consensus protocol. However, the Bitcoin system’s use of a Proof-of-Work (PoW) algorithm has raised serious concerns about the expansion of its network.
Those concerns include:
(1) Since PoW algorithm cannot decouple the selection process of the submitted block from the block building protocol, meaning the hash power cannot be reused for consensus in multiple chains.
(2) The PoW algorithm that Bitcoin uses is at risk of descending into a game between an increasingly centralised network and a handful of oligarchs who have successfully monopolised computing resources.
(3) With the network’s incredible growth, vast amounts of energy are being continually expended solely for the purpose of sustaining it.
(4) The dominance of ASICs among miners has raised massive barriers to entry and put mining beyond the means of ordinary users.
MASS Blockchain Consensus Engine
About
We believe that blockchain is a technology possessing great social value. Blockchain is able to coordinate human actions through the means of a consensus mechanism, thereby performing important tasks such as maintaining a public ledger. Ultimately, blockchain will facilitate a vision of an internet of value without intermediaries.
The consensus mechanism is the ultimate guarantee of the security and credibility of a blockchain. It requires that users are able to join the network and help maintain it without the need for permission, and all participants are able to get a fair share of the value created.
The MASS consensus engine aims to become the basic infrastructure to all blockchain consensus layers. Based on a Proof-of-Capacity consensus protocol, the MASS consensus engine creates a consensus layer that is permissionless, fair, energy efficiency, secure, and universal, ensuring the fundamental security of the public chain.
The MASS consensus engine is universal and is capable of providing consensus services across any number of public chains. Nodes use storage capacity to run the consensus protocol and do not require permission. The MASS consensus engine is fair and energy efficient; only a very small amount of computing resources are required, meaning everyone has the chance to participate.
Who created MASS?
MASS was created by the MASS community. The MASS community is an open, non-profit online organisation whose mission is to promote blockchain technology among the wider public, thereby improving people’s lives and leading to a fairer and more prosperous society.
The MASS community was launched in 2017 by Dr. Ren Ling. We are constantly furthering our development through continuous online discussion and cooperation, as well as periodic offline events. The MASS community welcomes all experts with backgrounds in computer science, social sciences, economics, finance, or entrepreneurship, and who have the same aims as us. We prefer members with original insights and strong collaboration skills. In order to ensure community members are sufficiently qualified, new members must be first approved by at least half of the existing members. The MASS community has strict requirements for research and implementation to ensure the excellence of our work. When the time is right, our work will be made open source, a move which will promote wider awareness of the technology and will aid with future collaboration.
MASS system features:
Secure :
MASS Proof-of-Capacity protocol ensures the unforgeability of proofs by using the theory of Time-memory trade-off. This, along with the use of a verifiable random function, warrants that the MASS system has 51% Byzantine Fault Tolerance. Furthermore, a fork detection punishment scheme protects the main chain from Nothing-At-Stake attacks that could split the main chain.
Fair :
MASS Proof-of-Capacity guarantees that a node’s block generation probability is dependent only on the proof-of-effective-capacity provided by the node. In addition, the proof-of effective-capacity is storage medium independent, so that all nodes participating in the MASS network have similar marginal costs.
Energy efficient :
MASS Proof-of-Capacity only requires computing resources when initializing storage capacity. When entering the block consensus phase storage capacity, data is only accessed at O(1) complexity a timetimes. Therefore, using MASS Proof-of-Capacity for block consensus does not require continuous power-input consumption. When the MASS system performs block consensus, the computing resources used are negligible, small enough to not affect the normal usage of a computer. When storage capacity is not participating in the MASS network, it can be reformatted and used for other purposes.
Universal :
During the consensus process, the node only needs to perform an access query on the initialized capacity and does not perform any data operations on it. Therefore, the same storage space can provide capacity proofs for multiple blockchain consensus instances, and nodes using the MASS Proof-of-Capacity can simultaneously support multiple blockchain instances in parallel.
Network
The MASS blockchain system is structured as a peer-to-peer network architecture on top of the internet. The term peer-to-peer means that the computers that participate in the network are peers to each other, that they are all equal, that there are no “special” nodes, and that all nodes share the burden of providing network services. The network nodes interconnect in a mesh network with a “flat” topology. There is no server, no centralised service, and no hierarchy within the network. Nodes in a P2P network both provide and consume services at the same time with reciprocity acting as the incentive for participation. P2P networks are inherently resilient, decentralised, and open.
Security Analysis
Due to the inherently secure nature of the Proof-of-Capacity method and the blockchain consensus, MASS possesses the extremely high level of security that users would expect.
Proof-of-Capacity is secure in the following ways:
● Proofs cannot be forged:
MASS’s PoC algorithm makes use of time-memory trade-offs. If the prover provides the capacity proof S, it shows that the prover filled the capacity S according to the present rules, which would be very difficult to calculate quickly.
● 51% fault tolerance:
When competing for the next block, each node looks for a proof that matches the current block in its own initialised storage space. The probability of a node generating the new block is in proportion to the ratio between the initialised capacity of the entire network and the initialised capacity of the current node. If a malicious node intends to take control of block generation, it needs at least 51% of the capacity of the entire network. However, to have more than 51% capacity, the physical hardware investment would be colossal. Therefore, malicious nodes do not have sufficient incentive to break the MASS consensus.
● The unpredictability of the random target value:
In the MASS PoC algorithm, each block provides a random value as the target for the initialised capacity of all nodes. This random value is produced by a verifiable random function, and no node can control this. Therefore, at the same block height, all nodes have the same prior information when competing for the next block.
The blockchain consensus protocol is secure in the following ways:
● Resistant to forking:
The fork detection punishment scheme protects against Nothing-at-Stake attacks splitting the chain. Since MASS uses a Proof-ofCapacity algorithm, without taking necessary protective measures, it would be at risk from Nothing-at-Stake attacks. That is, the proof S can be used as the proof on the main chain and also on a fork at the same time at no additional cost. In order to deal with this risk, the MASS system uses a fork detection punishment scheme. If the main chain block and a forked chain block are found to have the same proof, all nodes will automatically blacklist the public key used in initialisation for that storage capacity and reject subsequent proofs provided from it.
● Resistant to selfish mining:
In a proof-of-work consensus mechanism, a malicious node can obtain a time advantage in competing for the next block by hiding blocks already mined. However, in the MASS blockchain consensus protocol, initialised nodes can find proofs exceptionally quickly, so there is no room for strategies of this type.
● Resistant to double-spend transactions:
The MASS system uses a UTXO (Unspent Transaction Output) transaction model, which is secured by asymmetrically encrypted mathematical algorithms. Block rollback is guaranteed by the PoC algorithm’s 51% Byzantine fault tolerance.
What is Proof of Capacity（PoC）
Proof-of-Capacity (PoC) is a consensus mechanism based on providing a proof of storage space. In a PoC consensus algorithm, when a node submits a block to the network it must also provide a valid proof of capacity. It is very difficult for a node to generate a valid capacity proof without having the corresponding storage size, and the proof can be verified by any node in the network. If both the block data and the proof are valid, the block will be accepted by the rest of the network. The basic principle behind how a proof is provided is as follows: during the initialisation phase, a series of data is generated according to the protocol and is saved in the storage device capacity. When the a new block is to be generated, a part of this stored data is revealed retrieved based on the value of a random number. This data part is then used to generate a proof and the node is able to compete for the next block.
The MASS PoC protocol and bitcoin’s Nakamoto consensus protocol can both be described with a unified mathematical model. F(∙) is a one-way permutation function for space |N|_x to space |N|_y. The verifier takes a value y from space |N|_y, and within a certain period of time, the prover must submit give a corresponding value x for in space |N|_x within a certain period of time so that where F(x)=y. The Nakamoto consensus protocol uses an exhaustive brute-force search method to calculate y values with F(∙) by iterating all possible x value in order to find the right x when a collision of y happens, making multiple requests on the function to find the corresponding y value and thereby confirm the value of x. On the other hand, the MASS PoC protocol uses a look-up table method, first performing an offline analysis and recording all the x values that correspond with y, and then when solving for y simply looking up the corresponding x value when finding a y. Despite the difference in methods, in terms of security the MASS and Nakamoto consensus protocols are very similar within regards to algorithm security.
Timeline
stagecontenttime
ResearchThe PoC core algorithm was proposed, and after research, verifiedSeptember 2015 – June 2017
The MASS PoC consensus agreement was proposed, and after research, verifiedJune 2017 – April 2018
Development & TestnetsRecruitment of experts for the community to develop PoC blockchain prototypeMay 2018 – March 2019
MASS Testnet 1: system verificationMarch 2019
MASS Testnet 2: system security testApril 2019
MASS Testnet 3: system stability testMay 2019
MASS Testnet 4: system reliability testJune 2019
MASS NetMASS Net: full-node client releaseSeptember 2019
MASS EngineMASS Engine: packaging and publishing for consensus engineNovember 2019
Layer 2Development and release of the MASS Net extension pluginFebruary 2020
Cross-chainDevelopment and release of the MASS Cross-chain protocolJune 2020
For more detailed information, please visit the link below:
MASS Docs：https://docs.massnet.org/en/
Telegram：https://t.me/massnetorg
Twitter：https://twitter.com/massnetorg
Discord：https://discord.gg/Ffk4VFS
MASS Website: https://massnet.org/en/
AUTHOR
USER NAME: JAMAAH45
ETH: 0x7A5df2D8D32b8f8e4FC6BF71D2BDfe69992D1C1B
Komentar
Posting Komentar