Hyperledger Iroha Consensus Algorithms
Hyperledger Iroha uses a Byzantine Fault Tolerant (BFT) consensus algorithm to ensure that all nodes in the network have the same view of the ledger. BFT algorithms are designed to work in environments where some nodes may be unreliable or may act maliciously.
In Iroha, the consensus algorithm is based on a round-based voting process.
- In each round, a node is chosen as a leader, and it proposes a block of transactions to be added to the ledger.
- The other nodes in the network then vote on whether to accept or reject the proposed block.
- If a quorum of nodes (2/3 or more) votes to accept the block, it is added to the ledger, and the leader proposes the next block.
The consensus algorithm used by Iroha is built to offer high levels of security and fault tolerance. The algorithm makes sure that no single node can take over the ledger or tamper with the data because it requires a quorum of nodes to vote on each block. Additionally, the algorithm makes sure that the network can function even if certain nodes fail or disconnect.
This consensus algorithm is called “YAC” (Yet Another Consensus) which is a variant of the BFT algorithm, it uses a round-based voting process, where each node has a chance to propose a block and the other nodes will vote for it.
Hyperledger Iroha in Blockchain
A blockchain platform called Hyperledger Iroha is intended to be quickly integrated into various business applications that call for distributed ledger technology (DLT). One of the projects hosted by the Linux Foundation and launched in May two thousand and nineteen under the Hyperledger umbrella is Hyperledger Iroha. The Japanese fintech company, Soramitsu Co. Ltd. has open-sourced the code for Iroha, which was initially contributed by Colu, Soramitsu, Hitachi, and NTT Data.