Oil Painting Art Appreciation Platform Based on Mobile Information System

Table 3

A macro comparison between the proof-of-work mechanism and the consensus algorithm based on the replication state machine theory.

	Node management mechanism	Throughput	Consensus is a foregone conclusion	Delay	Scalability	Energy consumption
Proof-of-work mechanism	None, any node can join and exit at will	Poor, affected by possible fork	None	High latency, requiring multiple blocks to wait for confirmation	Good, system capacity and availability are not limited by the number of nodes	High, a lot of useless calculations, waste a lot of power and other resources
Consensus algorithm based on replication state machine	Yes, permission is required to enter. Nodes in the system virtually know the IP of all nodes in the system	High, can have a throughput full of network capacity	Have	Low latency, related to network latency	Poor, system availability decreases as the number of nodes increases	Low, no complicated calculation process