You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 5 Next »

Evaluation 3 shows the proposed framework of BiniBFT consensus.

It is a group evaluation, and the report is given below.


BiniBFT - An Optimized BFT on Fabric


Evaluation 3 - Report

Submitted By: Riddhi Katarki , Ajitesh Kumar Soni , Abhishek Ranjan , Ashna P S , Sahilsher Singh , Siddhant Prateek Mahanayak

Collaborative Learning Program

Engagement Details

Name of Mentee

Riddhi Katarki , Ajitesh Kumar Soni , Abhishek Ranjan , Ashna P S , Sahilsher Singh , Siddhant Prateek Mahanayak

Evaluation Period

08-10-2023 to 13-12-2023

Task

BiniBFT Framework

Date Submitted

14-12-2023

Mentor

Dr. Anasuya Threse Innocent


Consensus Mechanism with Random Polling

  1. Transaction Initiation: The process starts with the client initiating a transaction (Trx initiation). This is where a user or an application requests a transaction to be processed by the network.
  2. Transaction Batching: After a transaction is initiated, it is grouped with other transactions into a batch (Batched trx) which improves the efficiency of processing multiple transactions together rather than individually.
  3. Leader Selection: Once transactions are batched, a leader is selected to propose the batch of transactions to the rest of the network. The leader selection is aided by a Verifiable Random Function (VRF), which helps in choosing the leader in a way that is random but verifiable by other participants in the network.
  4. Transaction Proposal: The leader then proposes the batched transactions (Trx proposal) to the network. This involves sending out the transaction data to other nodes in the network for validation.
  5. Polling: Concurrently, there is a random polling of 33% of the network. This suggests that a subset of the network is selected randomly to vote on the proposed transactions. The chart indicates that the process waits until 1/3 of the votes are received.
  6. Transaction Commitment: Once the leader has successfully proposed the transaction and the necessary votes are received, the transaction is committed (Commit Trx) by the network.
  7. Transaction Settlement: After the transaction is committed, it is then settled (Finalized Trx), which means it is officially recorded on the blockchain. This completes the process, and the client is informed that the transaction has been finalized.


Consensus Mechanism with Time Weighted Voting



  1. Transaction Initiation: A client starts the process by initiating a transaction.
  2. Transaction Batching: Transactions are batched together for processing efficiency.
  3. Leader Selection: A leader is selected through a Verifiable Random Function (VRF) to manage the batched transactions. This ensures randomness and fairness in leader selection.
  4. Transaction Proposal: The selected leader proposes the batched transactions to the network.
  5. Time Weighted Voting (Polling):
    • The network nodes participate in polling to approve the transaction proposal. This polling uses the Time Weighted Voting mechanism.
    • Each node in the network has a weight (w) that increases over time or epochs, representing their tenure in the network.
  6. Voting Constraints:
    • Individual node weight is capped to ensure no single node can dominate the decision due to its longevity (as shown in the second chart, where w(i) <= 0.33 * (network_w)).
    • The sum of the weights (sum(w)) from the nodes participating in the polling must be greater than or equal to 51% of the total network weight to reach a decision (sum(w) >= (0.51 * network_w)).
  7. Transaction Commitment: If the proposal receives enough weighted votes (>= 51% of network weight), the transaction is committed.
  8. Transaction Settlement: The committed transaction is then finalized and recorded on the blockchain, and the client is notified of the transaction settlement.





A Anasuya Threse Innocent 

Riddhi Katarki 

Ajitesh kumar soni 

Abhishek Ranjan 

Ashna P S 

Siddhant Prateek 

Sahilsher Singh 

  • No labels