Witryna12 kwi 2024 · In this article, we provide a blockchain-based solution and framework for distributing and trading of electronic ticket. Sale and distribution of electronic ticket are governed by smart contracts built on the Ethereum public blockchain. E-ticket downloads/views occur on-chain and off-chain according to the ticket size. Witryna29 mar 2024 · To solve these limitations, an improved consensus algorithm VS-PBFT based on vague sets was proposed. VS-PBFT has three phases: node partition, primary node selection, and global consensus ...
Improve PBFT Based on Hash Ring - Hindawi
Witryna1 mar 2024 · In response to the needs of today's large-scale consortium chains, the PBFT is improved, and the Feature grouping and Credit optimization Byzantine Fault Tolerance (FCBFT) is proposed. The three characteristics of the algorithm are as follows: • A node feature grouping model is proposed. Witryna25 paź 2024 · A Hash-oriented Practical Byzantine Fault Tolerance (PBFT) based consensus algorithm is proposed to improve the Blockchain efficiency and reduce the transaction confirmation delay from 10 minutes to 15 seconds. The Hash-oriented PBFT effectively avoids the double-spending attack and Sybil attack. chrysler victorville
Improved PBFT Algorithm Based on Vague Sets - Hindawi
The HC-PBFT algorithm consists of four parts: hash ring grouping strategy, consensus process, dual-view mechanism, and Byzantine node determination mechanism. The hash ring grouping strategy uses a hash ring to group and slice the nodes to ensure the randomness and fairness of the grouping. Zobacz więcej Aiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of … Zobacz więcej Since the birth of Bitcoin [ 1. S. Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System, Bitcoin White Paper, 2008.See in References1], digital cryptocurrency has developed rapidly, and its underlying blockchain … Zobacz więcej After multiple rounds of consensus, the Byzantine node determination mechanism can mark Byzantine nodes and error nodes, restrict them from being elected as primary nodes, and improve the reliability of primary node … Zobacz więcej In 1999, Castro and Liskov first proposed the practical Byzantine fault tolerance (PBFT) algorithm, which reduced the complexity of the algorithm from exponential to polynomial, making the Byzantine fault … Zobacz więcej Witryna1 mar 2024 · By simplifying the PBFT consensus protocol, the time complexity of the protocol is reduced from O (n 2) to O (n). It effectively improves the consensus efficiency, throughput and block generation speed. Xiang, Huaimin and Peichang (2024)proposed proof of previous transactions (PoPT). Witryna9 lis 2024 · The experimental results show that the optimized HR-PBFT algorithm can effectively improve the problem of the sharp increase in the number of … chrysler victoria bc