Algorithme

Cryptos:

2,117

Échanges:

10

Capitalisation boursière:

$2,243,771,578,670

Volume 24h:

$34,180,051,536

Delegated Byzantine Fault Tolerance

DBFT

Classement #33

-1

$1,372,416,483

0

1

Gagnants (undefined)%

24H

Perdants (undefined)%

Classement

33

Actifs

1

Capitalisation boursière

$1,372,416,483

Volume 24h

$26,864,893

Perdants

1

Aperçu
Actifs

$1,372,416,483

Capitalisation boursière

$26,864,893

Volume

33

Classement

0

Gagnants

1

Perdants

-2.44

%

Changement 24h

9.34

%

Changement 7j

1H

-0.580

%

1J

-2.44

%

1S

9.34

%

1M

22.99

%

2M

55.52

%

3M

78.41

%

6M

136.14

%

1A

79.01

%

À propos de Delegated Byzantine Fault Tolerance

Delegated Byzantine Fault Tolerance (DBFT) is a consensus algorithm used in distributed systems, such as blockchain networks, to achieve consensus on a set of transactions. It is a variation of the Byzantine Fault Tolerance (BFT) algorithm, which was designed to tolerate faults in distributed systems where nodes may fail or behave maliciously.

In DBFT, a set of nodes, called delegates, are selected to validate transactions and agree on their order. These delegates are selected through a process called delegate selection, which can be either a democratic process or a fixed appointment by the network owner.

DBFT works by dividing the consensus process into two phases: the request phase and the consensus phase. In the request phase, a client sends a transaction request to all delegates. Each delegate validates the request and broadcasts a message to the other delegates, including the proposed transaction and a cryptographic hash of the request.

In the consensus phase, the delegates work together to agree on the validity of the transaction and its order. This is achieved through a voting process, where each delegate casts a vote indicating whether they agree or disagree with the proposed transaction. If the majority of delegates agree on the transaction, it is considered valid and added to the blockchain.

One of the benefits of DBFT is that it provides a high level of fault tolerance, meaning that it can tolerate up to one-third of the delegates behaving maliciously or failing. This is achieved by requiring a supermajority of delegates to agree on a transaction before it is considered valid and added to the blockchain.

Another benefit of DBFT is that it is highly efficient, allowing for a fast consensus process and a high transaction throughput. This makes it suitable for use in systems where speed and scalability are important, such as payment systems or decentralized applications.

DBFT has been implemented in several blockchain networks, including the NEO blockchain and the ICON blockchain. In these networks, DBFT is used to achieve consensus on a set of transactions and ensure the security and reliability of the network.

In conclusion, DBFT is a consensus algorithm that provides a high level of security and efficiency for critical systems. It is a variation of the original BFT algorithm that uses a selected group of delegates to validate transactions and achieve consensus. DBFT has been successfully used in several blockchain networks to achieve consensus and ensure the integrity of transactions.