Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (4)

Search Parameters:
Keywords = Tendermint

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
52 pages, 11802 KB  
Article
Nazfast: An Exceedingly Scalable, Secure, and Decentralized Consensus for Blockchain Network Powered by S&SEM and Sea Shield
by Sana Naz and Scott Uk-Jin Lee
Appl. Sci. 2025, 15(10), 5400; https://doi.org/10.3390/app15105400 - 12 May 2025
Viewed by 858
Abstract
Blockchain technology uses a consensus mechanism to create and finalize blocks. The consensus mechanism affects the total performance parameters of the blockchain network, such as throughput. In this paper, we present “Nazfast”, a simplified proof of stake—Byzantine fault tolerance based consensus mechanism to [...] Read more.
Blockchain technology uses a consensus mechanism to create and finalize blocks. The consensus mechanism affects the total performance parameters of the blockchain network, such as throughput. In this paper, we present “Nazfast”, a simplified proof of stake—Byzantine fault tolerance based consensus mechanism to create and finalize blocks. The presented consensus is completed in multiple folds. For block producer and validation committee selection, we used a secure and speeded-up election mechanism, S&Sem, in Nazfast. The consensus is designed for fast block finalization in a malicious environment. The simulation result shows that we approximately achieved three block finalizations in 1 s with almost similar latency. We reduced and fixed the number of validators in the consensus to improve the throughput. We achieved a higher throughput among other consensus of the same family. Because we reduced the number of validators, the safety parameters of the consensus are at risk, so we used Sea Shield to improve the overall consensus safety. This is another blockchain to save nodes’ details when they join/unjoin the network as validators. By using all three parts together, our system is protected from 28-plus different attacks, and we maintain a high decentralization by using S&Sem. Finally, we also enhance the incentive mechanism of consensus to improve the liveness of the network. Full article
Show Figures

Figure 1

13 pages, 550 KB  
Article
Dynamic Storage Optimization for Communication between AI Agents
by Andrei Tara, Hjalmar K. Turesson and Nicolae Natea
Future Internet 2024, 16(8), 274; https://doi.org/10.3390/fi16080274 - 1 Aug 2024
Cited by 2 | Viewed by 2630
Abstract
Today, AI is primarily narrow, meaning that each model or agent can only perform one task or a narrow range of tasks. However, systems with broad capabilities can be built by connecting multiple narrow AIs. Connecting various AI agents in an open, multi-organizational [...] Read more.
Today, AI is primarily narrow, meaning that each model or agent can only perform one task or a narrow range of tasks. However, systems with broad capabilities can be built by connecting multiple narrow AIs. Connecting various AI agents in an open, multi-organizational environment requires a new communication model. Here, we develop a multi-layered ontology-based communication framework. Ontology concepts provide semantic definitions for the agents’ inputs and outputs, enabling them to dynamically identify communication requirements and build processing pipelines. Critical is that the ontology concepts are stored on a decentralized storage medium, allowing fast reading and writing. The multi-layered design offers flexibility by dividing a monolithic ontology model into semantic layers, allowing for the optimization of read and write latencies. We investigate the impact of this optimization by benchmarking experiments on three decentralized storage mediums—IPFS, Tendermint Cosmos, and Hyperledger Fabric—across a wide range of configurations. The increased read-write speeds allow AI agents to communicate efficiently in a decentralized environment utilizing ontology principles, making it easier for AI to be used widely in various applications. Full article
Show Figures

Figure 1

14 pages, 1882 KB  
Article
Blockchain Based Trust Model Using Tendermint in Vehicular Adhoc Networks
by Sandeep Kumar Arora, Gulshan Kumar and Tai-hoon Kim
Appl. Sci. 2021, 11(5), 1998; https://doi.org/10.3390/app11051998 - 24 Feb 2021
Cited by 12 | Viewed by 3783
Abstract
Blockchain is the consensus-based technology used to resolve conflicts in Byzantine environments. Vehicles validate the messages received from neighboring vehicles using the gradient boosting technique (GBT). Based on the validation results, the message source vehicle generates the ratings that are to be uploaded [...] Read more.
Blockchain is the consensus-based technology used to resolve conflicts in Byzantine environments. Vehicles validate the messages received from neighboring vehicles using the gradient boosting technique (GBT). Based on the validation results, the message source vehicle generates the ratings that are to be uploaded to roadside units (RSUs), and through that, the trust offset value can be calculated. All RSUs maintain the trust blockchain, and each RSU tries to add their blocks to the trust blockchain. We proposed a blockchain-based trust management model for the vehicular adhoc network (VANET) based on Tendermint. It eliminates the problem of malicious nodes entering the network, and will also overcome the problem of power consumption. Simulation results also show that the proposed system is 7.8% and 15.6% effective and efficient in terms of packet delivery ratio (PDR) and end-to-end delay (EED), respectively, to collect the trusted data between the vehicles. Full article
(This article belongs to the Special Issue Analytics, Privacy and Security for IoT and Big Data)
Show Figures

Figure 1

14 pages, 620 KB  
Article
A Computational Study on Fairness of the Tendermint Blockchain Protocol
by Nicolas Lagaillardie, Mohamed Aimen Djari and Önder Gürcan
Information 2019, 10(12), 378; https://doi.org/10.3390/info10120378 - 30 Nov 2019
Cited by 13 | Viewed by 5881
Abstract
Fairness is a crucial property for blockchain systems since it affects the participation: the ones that find the system fair tend to stay or enter, the ones that find the system unfair tend to leave. While current literature mainly focuses on fairness for [...] Read more.
Fairness is a crucial property for blockchain systems since it affects the participation: the ones that find the system fair tend to stay or enter, the ones that find the system unfair tend to leave. While current literature mainly focuses on fairness for Bitcoin-like blockchains, little has been done to analyze Tendermint. Tendermint is a blockchain technology that uses a committee-based consensus algorithm, which finds an agreement among a set of block creators (called validators), even if some are malicious. Validators are regularly selected to the committee based on their investments. When a validator does not have enough asset to invest, it can increase it with the help of participants that delegate their assets to the validators (called delegators). In this paper, we implement the default Tendermint model and a Tendermint model for fairness in a multi-agent blockchain simulator where participants are modeled as rational agents who enter or leave the system based on their utility values. We conducted experiments for both models where agents have different investment strategies and with various numbers of delegators. In the light of our experimental evaluation, we observed that while, for both models, the fairness decreases and the system shrinks in the absence of delegators, the fairness increases, and the system expands for the second model in the presence of delegators. Full article
(This article belongs to the Special Issue Blockchain Technologies for Multi-Agent Systems)
Show Figures

Figure 1

Back to TopTop