Imran Hussain, Hafiz Ashiq Hussain, Nasim Ullah, Stanislav Mišák
An evolving energy system with a dispersed infrastructure may not be compatible with traditional centralized optimization and management techniques. Blockchain, a peer-to-peer immutable distributed ledger technology, has the potential to significantly contribute to the management of emerging trends of decentralized power networks. However, complex optimization problems associated with the decentralized power grid are poorly integrated into the existing blockchain applications. Here, we suggest Proof of Inherent Intelligence (PoII), a novel prosumer-centric consensus mechanism designed to assist multi-interest party optimization challenges of the distributed power grid. We demonstrate PoII’s operation and performance with comprehensive mathematical modeling of energy pool-market trading and scheduling optimization problems. The efficiency of the proposed framework is evaluated against the existing blockchain applications for peer-to-peer energy transactions in terms of latency, throughput, tolerance against adversaries, vulnerability, and optimization capabilities. A thorough case study of the power grid that includes thermal, wind, and intermittent generation sources is presented to assess the effectiveness of the proposed consensus mechanism. Power demand, reserves, trading, and scheduling scenarios in both the day-ahead and balancing markets are among the peer-to-peer energy transactional elements that are assessed to support the efficacy of the suggested consensus approach.
This paper presents a novel approach to decentralized AI that utilizes blockchain technology to enhance data privacy. By combining federated learning with blockchain's immutable ledger, we create a secure framework that allows multiple parties to collaborate on AI model training without exposing sensitive data. Our findings show that this method not only preserves privacy but also improves model performance through diverse data contributions. This paradigm shift offers significant implications for industries requiring stringent data protection, such as healthcare and finance.
Bruno Ramos-Cruz, Javier Andreu-Pérez, Francisco J. Quesada, Luis Martı́nez
Blockchain technology has become a trusted method for establishing secure and transparent transactions through a distributed, encrypted network. The operation of blockchain is governed by consensus algorithms, among which Proof of Stake (PoS) is popular yet has its drawbacks, notably the potential for centralising power in nodes with larger stakes or higher rewards. Our proposed novel solution, Fuzzychain, leverages fuzzy sets to define stake semantics, introducing a degree of softness in validator selection. This approach mitigates rigid threshold-based decision-making by allowing gradual transitions between stake levels, reducing sharp disparities among validators. By incorporating this enhanced stake evaluation, Fuzzychain promotes a more adaptive and distributed selection process, ensuring a fairer and more inclusive blockchain network. A thorough assessment of a real-time multi-agent blockchain system to examine validator selection and reduce inequality, promoting a more equitable distribution of stakes among validators compared to other consensus mechanisms. This fosters a more inclusive selection process and a more equitably distributed network.
There have been several studies into measuring the level of decentralization in Ethereum through applying various indices to indicate the relative dominance of entities in different domains in the ecosystem. However, these indices do not capture any correlation between those different entities, that could potentially make them the subject of external coercion, or covert collusion. We propose an index that measures the relative dominance of entities based on the application of correlation factors. We posit that this approach produces a more nuanced and accurate index of decentralization.
Ovidiu Vermesan, Markus Eisenhauer, Martín Serrano, Patrick Guillemin · 12 authors
The Internet of Things (IoT) and the Industrial Internet of Things (IIoT) are evolving towards the next generation of Tactile IoT/IIoT, which will bring together hyperconnectivity, edge computing, Distributed Ledger Technologies(DLTs) and Artificial Intelligence (AI). Future IoT applications will apply AI methods, such as machine learning (ML) and neural networks(NNs), to optimize the processing of information, as well as to integrate robotic devices, drones, autonomous vehicles, augmented and virtual reality(AR/VR), and digital assistants. These applications will engender new products, services and experiences that will offer many benefits to businesses, consumers and industries. A more human-centred perspective will allow us to maximise the effects of the next generation of IoT/IIoT technologies and applications as we move towards the integration of intelligent objects With social capabilities that need to address the interactions between autonomous systems and humans in a seamless way.
Blockchain is a distributed ledger technology that has recently gained widespread popularity. Many industries have started to implement blockchain solutions for their application and services. Blockchain provides immutability, privacy, security, and transparency. There is no central authority to validate and verify the transactions, still, every transaction in the Blockchain is considered secure and verified. This is made possible by the use of a consensus algorithm which is a core part of any Blockchain network. Different consensus algorithms exist and the selection of appropriate consensus algorithms can affect the performance of the blockchain. This paper presents a pattern for one of the most commonly used blockchain consensus algorithms, which is the Proof of Stake (PoS) algorithm. This pattern describes its architecture, including its structure and dynamics.
The consensus algorithm, as the core technology of blockchain, provides mechanism support and guarantee for the realization of functions such as decentralization, openness, autonomy, information tamperability and anonymous traceability, and realizes efficient achievement of strong and final consistency in distributed system. The consensus algorithms are divided into the previous classical distributed consensus algorithms and the subsequent blockchain consensus algorithms by taking the emergence of bitcoin as the time node. On this basis, the consensus algorithms are further classified according to the implementation principle, the typical algorithms are selected, and then the discussion is focused on decentralization, scalability, security, consistency and so on. Firstly, a general model of blockchain consensus algorithm is proposed, and the basic definition of consensus algorithm is given. Secondly, while introducing the characteristics of the classical distributed consensus algorithms, the distributed consistency algorithms and their improvements such as the two armed forces problem, the Byzantine generals problem, the FLP impossibility theorem, the CAP theorem and Paxos algorithm are studied, and then the execution process and functional characteristics of the algorithm are analyzed. Thirdly, the blockchain consensus algorithms are divided into POW consensus algorithm, POS consensus algorithm, POW+POS hybrid consensus algorithm and POW/POS+BFT/PBFT hybrid consensus algorithm according to different implementation principles and application scenarios. The algorithm flow is given respectively after selecting representative algorithms in each category, and then the specific application scenarios are deeply analyzed. Finally, the research hotspots and development directions of blockchain consensus algorithms in performance and scalability, incentive mechanism, security and privacy, parallel processing and so on are pointed out.
In this article we present the technological foundations on which an ecosystem of semantic data objects can be implemented on the latest Blockchain based systems. As the most important citizens among the semantic data objects are ontologies, the ecosystem is referred to as Ontospace. The foundations can be characterized by their architectural, cryptographic and transactional aspects. The architectural aspect borrows from the latest Layer-2 protocols of the 3rd generation blockchains and from the rules of Linked Data systems creation. The cryptographic aspect represents an original work that attempts to resolve the issue of efficient hashing of the graph data structures. The transactional aspect is concerned with the graph replication consistency, conditions for the direct access to graph data from the blockchain smart-contracts and with linkage between sidechains bearing semantic objects and the main network. The large parts of the work were implemented in the context of the Ontochain project – a part of the Next Generation Internet EU Initiative.
The blockchain identity ecosystem offers the possibility of rejecting the outdated identity system and eliminate the intermediaries. Identity management, through blockchain, can allow individuals to take ownership of their identity by creating a global identity (ID) to serve multiple purposes. For user security and ledger consistency, asymmetric cryptography and distributed consensus algorithms can be implemented. Blockchain technology would be able to save costs and increase efficiency due to its key features such as decentralization, persistence, anonymity and auditability. In addition, the digital identity platform would save citizens' time in accessing or exchanging their personal data and records. Instead of being required to appear physically before the service provider, the user may be provided with a digital ID through his/her personal device, such as a smartphone, through which he/she can share his identity details with the service provider, using distributed ledger technology (DLT).
Alexandr Kuznetsov, Inna Oleshko, Vladyslav Tymchenko, Konstantin Lisitsky · 6 authors
A blockchain, or in other words a chain of transaction blocks, is a distributed database that maintains an ordered chain of blocks that reliably connect the information contained in them. Copies of chain blocks are usually stored on multiple computers and synchronized in accordance with the rules of building a chain of blocks, which provides secure and change-resistant storage of information. To build linked lists of blocks hashing is used. Hashing is a special cryptographic primitive that provides one-way, resistance to collisions and search for prototypes computation of hash value (hash or message digest). In this paper a comparative analysis of the performance of hashing algorithms that can be used in modern decentralized blockchain networks are conducted. Specifically, the hash performance on different desktop systems, the number of cycles per byte (Cycles/byte), the amount of hashed message per second (MB/s) and the hash rate (KHash/s) are investigated. The comparative analysis of different hashing algorithms allows us to choose the most suitable candidates for building decentralized systems type of blockchain.
Abstract Once blockchain technology is successfully applied, it will certainly trigger revolutionary changes in the military development and combat mode, which are beyond the traditional military command and management scope. In the future, blockchain technology, by combining with military artificial intelligence, Internet of things, cloud computing and big data, will have priority to be applied in military management, support, security and even command. It is of great significance to excavate the military application potential of blockchain technology and scientifically predict its impact and influence on the military field, so as to improve the combat effectiveness of the army and promote its transformation and development.
This research proposes a new method of data synchronization between public blockchain networks and local machines. We discussed the proposed algorithm, and the mathematical model which achieves the shortest delay required for data synchronization. Tests were conducted to verify the correctness of the proposed model. Then a comparison is made with the current available classical synchronization methods. Suggested method may be useful for future DApps applications on Ethereum network.
One of the most important components in a public blockchain like Bitcoin and Ethereum is the authenticated data structure that keeps track of all block data, transactions, and the world state (account balance, smart contract states, etc.) Thanks to authenticated data structures, lightweight nodes only need to store authentication information and can delegate queries to those nodes with a full replica of data and the authenticated data structure. The lightweight nodes can trust the query results after verifying against the authentication information. It is also critical to have enough nodes in the network that are equipped with the authenticated data structure to ensure scalability and availability, which is especially important for public blockchains. Therefore, every public blockchain highly encourages users to download the authenticated data structure as the first step.\n\nFetching all elements from the entire authenticated data structure is a novel query type that has not gathered attention in the past. We describe this new emerging query type in the three-party authenticated data structure (ADS). We improve the design and implementation of the authenticated data structure so that the new query type is well-supported. We specifically apply the improvements to the Ethereum blockchain network. With our proposed ADS system in Ethereum, we improve Ethereum state synchronization performance by 216 times.
The question "what is Bitcoin" allows for many answers depending on the objectives aimed at when providing such answers. The question addressed in this paper is to determine a top-level classification, or type, for Bitcoin. We will classify Bitcoin as a system of type money-like informational commodity (MLIC).
Wang Yu-wu, You-Bang Zhan, (1)淮阴师范学院计算机科学系,淮安 223300; (2)淮阴师范学院物理系,淮安 223300
A theoretical scheme for zero-knowledge proof quantum identity authentication is proposed by the absolutely impartial third party CA， which has been realized based on remote state preparation and assisted cloning controlled means. In the process of identification， only CA knows the information of quantum identity card and the first party Alice and the second party Bob can accomplish the quantum identity authentication without knowing it. We discuss the probability of accomplishing this job. The security of this scheme is unconditional and it is guaranteed by quantum mechanism.