This work proposes an architecture that supports the dynamic selection of trees based on the node resources, network conditions, and past behaviour of participants to improve the performance of the blockchain system.
This work proposes techniques that combine the use of gossip and tree-based dissemination that are aimed at combining the robustness of gossip with the resource-efficient of dissemination and aggregation trees while preserving scalability of blockchain protocols.
In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers. However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement. In contrast to other P2P applications, blockchain can naturally be abstracted as a state machine. We therefore leverage this abstraction to record network topologies and latencies in a trusted and coordinated manner. With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees. We integrate the above ideas into Tendermint and libp2p, and conduct empirical evaluation on Amazon EC2 platform using up to 300 nodes distributed across 10 regions. The results demonstrate that, compared with gossip-based dissemination over the same topology, our prototype improves peak throughput by up to $7.26\times$.
Yifeng Ye, Rongji Huang, Gerui Wang et al.· 0 citations
A new hybrid bioinspired optimization framework for efficient blockchain mining is presented, integrating Genetic Algorithm, Firefly optimization, and Particle Swarm Optimization into a unified architecture to take advantage of their complementary strengths.
K. Jajulwar, Priya Dasarwar, Uma Shankar Yadav et al.· Engineering, Technology &...· 0 citations
The article discusses a decentralized electronic voting system based on blockchain technology. This study aims to improve the performance and fault tolerance of blockchain-based electronic voting systems by introducing the Automated Leaderless Byzantine Fault Tolerance (AL-BFT) consensus protocol. This study aims to develop and evaluate an electronic voting system model that applies the proposed AL-BFT consensus mechanism in a permissioned peer-to-peer network. The methods used include computer modeling of a peer-to-peer (P2P) network, implementation of a decentralized ledger, and experimental load testing of the consensus protocol. System performance is evaluated using key metrics, such as transaction latency, throughput (requests per second), fault tolerance threshold, and scalability. The study results include the development of a conceptual architecture for the electronic voting system, the identification of its core components, and the analysis of their interactions to ensure data integrity and the reliability of voting results. At each stage of the electoral process, data security is considered, and additional protection mechanisms are analyzed to enhance system robustness. Eliminating the leader election phase from the consensus process is a key feature of the proposed approach, thereby reducing coordination overhead and enabling more efficient agreement among nodes. The proposed AL-BFT protocol reduces transaction latency and improves throughput while maintaining the fault tolerance level of traditional Byzantine Fault Tolerance-based approaches. The results confirm improved efficiency compared to classical leader-based consensus mechanisms, particularly in small permissioned blockchain networks. Conclusions. A practical implementation of the system has been developed and tested under real simulated load conditions. The proposed solution ensures stable system operation and reliable consensus formation. The system can be effectively applied to university elections, organizational voting, and other scenarios that require transparency, security, and manipulation resistance
Maksym Holikov, M. Rodinko, D. Uzlov et al.· RADIOELECTRONIC AND COMPUTER...· 0 citations
: With the increase of artificial intelligence (AI) agents being used in the operation of digital systems, they can perform complex tasks, manage resources and interact with distributed environments. However, they require additional support in checking the execution, assigning duties and guaranteeing reliability. Therefore, it is difficult to achieve autonomous decision-making along with stable system operation. Consequently, blockchain is regarded not only as a platform for decentralized applications but also as a dependable base for AI agents. Hence, the present blockchain architectures should not only enhance their efficiency but also ensure traceable state modifications, authentic operations and coordinated communications among various AI-related activities. Therefore, our paper investigates the transaction processing and expanding methods from different perspectives. We classify the previous research into five parts: state control and security measures, improvement of sharding, scalability of consensus and Layer-2 architectures, parallel transaction processing systems and application-oriented trading procedures. For each part, we introduce some typical systems, describe their features in design and evaluate the influences on constructing scalable and trustworthy AI agent systems. Besides, we point out the difficulties in establishing the blockchain framework for AI agents. Finally, this survey presents the existing technologies systematically and highlights their importance
Jiana Liao, Qinde Chen, Jian Zheng et al.· International Congress on Bl...· 0 citations