0

While several consensus algorithms exist for the Byzantine Generals Problem, specifically as it pertains to distributed payment systems, many suffer from high latency induced by the requirement that all nodes within the network communicate synchronously. In this work, we present a novel consensus algorithm that circumvents this requirement by utilizing collectively-trusted subnetworks within th...

Recently a new fault tolerant and simple mechanism was designed for solving commit consensus problem. It is based on replicated validation of messages sent between transaction participants and a special dispatcher validator manager node. This paper presents a correctness, safety proofs and performance analysis of this algorithm.

In this study, quantitative structure-retention relationship (QSRR) methodology employed for modeling of the retention times of 16 banned pesticides in nano-liquid chromatography (nano-LC) column. Genetic algorithm-multiple linear regression (GA-MLR) method employed for developing global and consensus QSRR models. The best global GA-MLR model was established by adjusting GA parameters. Three de...

The Byzantine Fault Tolerant (BFT) consensus algorithms have been widely applied in the blockchain systems because of their fault tolerance capability to determine system consistency presence malicious nodes. However, BFT are confronted with low efficiency and scalability problems caused by multiple rounds handshake communication. In this paper, a pipeline-based Fast Pipeline Tolerance algorith...