This paper presents the research undertaken with goal of designing a consensus algorithm for cryptocurrencies less latency than current state-of-the-art while maintaining level throughput and scalability sufficient real-world payments. The result is Nero, new deterministic leaderless byzantine in partially synchronous model that especially suited Directed Acyclic Graph (DAG)-based cryptocurrenc...

Proof of work (PoW), the most popular consensus mechanism for blockchain, requires ridiculously large amounts energy but without any useful outcome beyond determining accounting rights among miners. To tackle drawback PoW, we propose a novel energy-recycling algorithm, namely proof federated learning (PoFL), where originally wasted to solve difficult meaningless puzzles in PoW is reinvested lea...

In this paper we introduce a discrete-time, distributed optimization algorithm executed by a set of agents whose interactions are subject to a communication graph. The algorithm can be applied to optimization costs that are expressed as sums of functions, where each function is associated to an agent. The algorithm can be applied to continuously differentiable cost functions, it is not consensu...

Raft is a consensus algorithm for managing a replicated log. It produces a result equivalent to (multi-)Paxos, and it is as efficient as Paxos, but its structure is different from Paxos; this makes Raft more understandable than Paxos and also provides a better foundation for building practical systems. In order to enhance understandability, Raft separates the key elements of consensus, such as ...

The hierarchical quorum consensus (HQC) algorithm, which is a generalization of the standard quorum consensus algorithm for managing replicated data, can reduce the quorum size to NO.‘j”. This paper analyzes the message complexity of HQC. Moreover, an asymptotic analysis on the ratio of the message complexity to the quorum size is presented. It is shown that the ratio converges to a constant.

This paper deals with the double integrator consensus problem. The objective is the design of a new consensus algorithm for continuous-time multi-agent systems. The dynamic of agents is assumed to be of double integrator type. The proposed algorithm considers that there are no sensors to measure the velocity of the agents. Thus the classical double integrator consensus algorithm leads to an osc...

In this study, we discuss distributed spatial filtering (DSF) on networked systems to obtain signal values with a desired frequency characteristic from those assigned nodes by algorithm. We present two-hop consensus-type algorithm for DSF based an existing one-hop prove that the range of filter characteristics presented can achieve is broader than deriving necessary and sufficient condition ach...