Node Management and Admittance Principles of Trias

We have described the characteristics and advantages of the Trias nodes in great detail in our several previous articles. In the network of Trias, every node participates in the maintenance of the validation information among the nodes. The credibility status of every node is also the important base for the calculation of the Trias node ranking list update.

When a new node is added to the network, the node has some functions such as data synchronization validation and basic check of other node statuses. The node will have more functions and play more important roles such as becoming a consensus node and being responsible for consensus block as its credibility score goes up. The whole process is not interfered in by any human factors.

Today, we will mainly describe how a node is added to the Trias network and how it is managed.

I. Node admittance principles

Before a node mainframe is admitted to the Trias network, it should have met the requirements of the basic hardware and services and have the TEE status. The specific parameters are generated from an official template of the community. The validation environment service status satisfies mBZ(t), where St denotes the acquisition standard, the mainframe submission status, n denotes the version that is currently being used and Ct denotes the maximum damage degree.

It is worth mentioning that this is the significant improvement of the Trias network compared with BTC, ETH, EOS and some other blockchain networks. The ordinary public blockchains do not have any operation environment screening functions and they can only reduce the percentage of malicious nodes by increasing the number of nodes greatly. The Trias network refuses to admit batches of nodes with potential threat by using the TEE. The Trias network is the first security defense line, as it were.

II. Upgrade and maintenance of nodes

After a version is upgraded into a subsequent version or a data format is upgraded, every node will maintain its current version information, and it will update according to the version standard among nodes. The node has a compulsory bit identifier in the protocol.

The first node selection is completely independent and uncontrolled. However, after the first node selection, the majority version will initiate the subsequent compulsory data check and update, which can prevent the forks from affecting the data to a large extent.

In addition, if each of the current two versions cannot reach the conditions of the significant majority, a peer-to-peer voluntary principle is followed, different protocol data are broadcasted in the network and an election consensus is freely organized. It is somewhat like the American presidential election. Each state has a number of votes. The total number of votes is 538. The electors of each state decide whom they vote for. The presidential candidate who gains more than half of the total votes, that is, 270 or more votes, will be the future president.

III. Protocol synchronization and differentiation


After a node is upgraded, the election consensus and the block pause, the peer-to-peer broadcast is received, the preset conditions (such as the number of nodes of the new version, the synchronized block height and the synchronization protocol) are reached and the consensus node election is started. After a consensus is reached, the block is synchronized.

If we let tnew denote the preset to be initiated next time, toriginal denote the current version conditions, nk denote the credibility status of the number of nodes of the new version, Blocki denote the current block and P denote the synchronization protocol setting, then the synchronization record of the judgment on the framing of Node Sj by Node Si can be expressed as follows:

If the conditions of a node have met the requirements of the majority, the data will be publicized and synchronized in a strongly conforming form.


If a blockchain completes its upgrade and it is confirmed that the current version has not reached the conditions of the majority, then the consensus node election is started and the data packets of the other versions are abandoned according to the synchronization conditions of the preset conditions. After a consensus algorithm is reached, the information on the block of the current version is synchronously sent to the civilian nodes of the current version.

If we let t denote the opening protocol of the current version, t(original) denote the conditions of the current version, nk denote the credibility status of the number of nodes of the current version, Blocki denote the current block and P denote the setting of the synchronization protocol, then the synchronization record of the judgment on the framing of Node Sj by Node Si can be expressed as follows:

In this status, after the operation protocol is differentiated, the records generated after the current consensus is normally completed will become invalid after the current version is upgraded to a later version.

IV. Conclusion

Though the stipulations on the rational upgrade and maintenance of nodes are not as conspicuous as consensus algorithms and mining difficulties, their influence can never be underestimated. As for the subsequent development of a decentralized network, the stipulations do not attract much attention when the network is launched. However, at every upgrade divergence point, the stipulations on the upgrade become the key part in determining whether to fork and the subsequent influence.

I always think that Monero (XMR) is a very regrettable anonymous currency. When it was at its peak period, it was approved worldwide. However, it opened at a high price and closed at a low price and finally it became an ordinary currency due to frequent forks. It is really unfortunate.

Trias has acted differently in the upgrade synchronization and differentiation, which has a very positive significance in the aspect of solving the above-mentioned problems and can to a large extent prevent the forks from affecting the data.