The practical Byzantine Fault Tolerance (PBFT) is a classical consensus algorithm that has been widely applied in an alliance blockchain system to make all nodes agree certain transactions under the assumption proportion of no more than 1/3. It prevalent due its performance, simplicity, and claimed correctness. However, any vulnerability can lead significant loss finance because one change tran...

Abstract This research presents a scalable property/land registration framework. It is based on blockchain technology, where all registry offices come together single framework to improve the process. paper mainly focuses problems in land record and revenue sectors. In this paper, we explore use of technology current business scenarios. We discuss issues such as data security, privacy, and, mor...

Consensus algorithms are essential for achieving agreement among nodes in blockchain systems. However, traditional consensus such as Proof of Work (PoW) and Stake (PoS) can be resource-intensive unsuitable lightweight private applications. This paper proposes using the RSA (Rivest–Shamir–Adleman) encryption algorithm a context college placement system. offers several advantages over algorithms,...

The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt system operation in distributed systems, was challenging support massive network nodes, common participation over all mechanism would lead increased communication complexity, and arbitrary selection master also inefficient consensus. This paper...

Theoretician’s Abstract Consensus has been regarded as the fundamental problem that must be solved to implement a fault-tolerant distributed system. However, only a weaker problem than traditional consensus need be solved. We generalize the consensus problem to include both traditional consensus and this weaker version. A straightforward generalization of the Paxos consensus algorithm implement...