scholarly journals Lodestone: An Efficient Byzantine Fault-Tolerant Protocol in Consortium Blockchains

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Chen Shan ◽  
Lei Fan
Keyword(s):  
Communication Complexity ◽  
Fault Tolerant ◽  
State Of The Art ◽  
State Machine ◽  
The State ◽  
Byzantine Fault ◽  
Two Phases ◽  
A Chain ◽  
Partial Synchrony ◽  
State Machine Replication

We present Lodestone, a chain-based Byzantine fault-tolerant (BFT) state machine replication (SMR) protocol under partial synchrony. Lodestone enables replicas to achieve consensus with two phases of voting and enjoys (1) optimistic responsiveness and (2) linear communication complexity on average. Similar to the state-of-the-art chain-based BFT protocols, Lodestone can be optimized with a pipelining idea elegantly. We implement pipelined Lodestone and deploy experiments to evaluate its performance. The evaluation results demonstrate that Lodestone has a lower latency than HotStuff under various workloads.

Byzantine Fault-tolerant State-machine Replication from a Systems Perspective

2021 ◽  
Vol 54 (1) ◽  
pp. 1-38
Author(s):  
Tobias Distler
Keyword(s):  
Fault Tolerant ◽  
Building Blocks ◽  
State Machine ◽  
Systems Perspective ◽  
Byzantine Fault ◽  
Design Systems ◽  
Permissioned Blockchains ◽  
The Cost ◽  
State Machine Replication ◽  
Tolerant State

Byzantine fault-tolerant (BFT) state-machine replication makes it possible to design systems that are resilient against arbitrary faults, a requirement considered crucial for an increasing number of use cases such as permissioned blockchains, firewalls, and SCADA systems. Unfortunately, the strong fault-tolerance guarantees provided by BFT replication protocols come at the cost of a high complexity, which is why it is inherently difficult to correctly implement BFT systems in practice. This is all the more true with regard to the plethora of solutions and ideas that have been developed in recent years to improve performance, availability, or resource efficiency. This survey aims at facilitating the task of building BFT systems by presenting an overview of state-of-the-art techniques and analyzing their practical implications, for example, with respect to applicability and composability. In particular, this includes problems that arise in the context of concrete implementations, but which are often times passed over in literature. Starting with an in-depth discussion of the most important architectural building blocks of a BFT system (i.e., clients, agreement protocol, execution stage), the survey then focuses on selected approaches and mechanisms addressing specific tasks such as checkpointing and recovery.

scholarly journals Towards Log-Less, Fine-Granular State Machine Replication

2020 ◽  
Vol 20 (3) ◽  
pp. 231-241
Author(s):  
Jan Skrzypzcak ◽  
Florian Schintke
Keyword(s):  
Data Management ◽  
Fault Tolerant ◽  
State Of The Art ◽  
State Machine ◽  
Data Management System ◽  
Small States ◽  
Distributed Data ◽  
State Management ◽  
Non Volatile Memory ◽  
State Machine Replication

Abstract State machine replication is used to increase the availability of a service such as a data management system while ensuring consistent access to it. State-of-the-art implementations are based on a command log to gain linear write access to storage and avoid repeated transmissions of large replicas. However, the command log requires non-trivial state management such as allocation and pruning to prevent unbounded growth. By introducing in-place replicated state machines that do not use command logs, the log overhead can be avoided. Instead, replicas agree on a sequence of states, and former states are directly overwritten. This method enables the consistent, fault-tolerant replication of basic data management primitives such as counters, sets, or individual locks with little to no overhead. It matches the properties of fast, byte-addressable, non-volatile memory particularly well, where it is no longer necessary to rely on sequential access for good performance. Our approach is especially well suited for small states and fine-granular distributed data management as it occurs in key-value stores, for example.

scholarly journals Threat Adaptive Byzantine Fault Tolerant State-Machine Replication

2021 ◽  
Author(s):  
Douglas Simoes Silva ◽  
Rafal Graczyk ◽  
Jeremie Decouchant ◽  
Marcus Volp ◽  
Paulo Esteves-Verissimo
Keyword(s):  
Fault Tolerant ◽  
State Machine ◽  
Byzantine Fault ◽  
State Machine Replication ◽  
Tolerant State

scholarly journals A fabric architecture towards block chain application using hyper ledger

2018 ◽  
Vol 7 (2.20) ◽  
pp. 83 ◽  
Author(s):  
Md Haseeb ◽  
K Raja Sekhar ◽  
Y V. Spandana ◽  
M Syam
Keyword(s):  
Business Models ◽  
State Machine ◽  
The State ◽  
Distributed Ledger ◽  
Block Chain ◽  
Fabric Architecture ◽  
State Machine Replication ◽  
Main Factor

Block chain is a trust which can be best understood by the state machine replication, It is decentralized distributed ledger which is along all peers in the network connected through nodes over Internet. Every Node in the chain have equal stake and also the main factor is every node which have greater CPU cycles has a chance to operate node by spending those CPU cycles and also show Proof Of Work. Hence when the block chain is used in Business Models it loses its Private transactions and Confidential Contracts.  

Sign in / Sign up

Export Citation Format

Share Document