Blockchain: A Novel Approach for the Consensus Algorithm Using Condorcet Voting Procedure

The blockchain technology allows interested parties to access a common register, the update, and integrity of which are collectively managed in a decentralized manner by a network of actors. It is the consensus protocol that ensures a common and unambiguous update of transactions by creating blocks of transactions for which integrity, veracity, and consistency are guaranteed through geographically distributed nodes. Bitcoin, the first popular blockchain concept, introduced the Proof of Work consensus based on work validation, and has been extended to thousands of participants. Despite its success and its large use in other crypto-currencies, Proof of Work's disadvantages are a high latency, a low transaction rate, and a high energy expenditure, making it a less-than-perfect choice for many applications. In addition the validation of transactions is not carried out with a definite temporality. For Bitcoin, it takes on average 10 minutes to create a block. However, for certain use cases such as auctions or the exchange of energy, there is a need for this temporality. The purpose of this article is to propose a new type of consensus that is faster, less energy-consuming and that can be synchronized with a time reference. The core of the reflection is the use of the Condorcet voting mechanism to determine the miner.

[1]  Markus Schulze,et al.  A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method , 2011, Soc. Choice Welf..

[2]  Karl J. O'Dwyer,et al.  Bitcoin mining and its energy footprint , 2014 .

[3]  Miguel Castro,et al.  Byzantine fault tolerance can be fast , 2001, 2001 International Conference on Dependable Systems and Networks.

[4]  A.W.G. de Vries.  Bitcoin's Growing Energy Problem , 2018 .

[5]  Maher Khemakhem,et al.  ScienceDirect International Workshop on Secure Peer-to-Peer Intelligent Networks & Systems ( SPINS-2014 ) Sybil Nodes as a Mitigation Strategy against Sybil Attack , 2014 .

[6]  Damien Ernst,et al.  E-CLOUD, the open microgrid in existing network infrastructure , 2017 .

[7]  Douglas R. Woodall,et al.  Monotonicity of Single-seat Preferential Election Rules , 1997, Discret. Appl. Math..

[8]  Iddo Bentov,et al.  Proof of Activity: Extending Bitcoin's Proof of Work via Proof of Stake [Extended Abstract]y , 2014, PERV.

[9]  Damien Ernst,et al.  Blockchain for peer-to-peer energy exchanges: probabilistic approach of Proof of Stake , 2018 .

[10]  Keith Michael Baker.  Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix. M. le Marquis de CondorcetCondorcet. Mathématique et société. Roshdi Rashed , 1976 .

[11]  P.-C.-F. Daunou,et al.  Mémoire sur les élections au scrutin , 1803 .

[12]  Satoshi Nakamoto.  Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .

[13]  J. H. Smith.  AGGREGATION OF PREFERENCES WITH VARIABLE ELECTORATE , 1973 .

[14]  T. Tideman,et al.  Independence of clones as a criterion for voting rules , 1987 .

[15]  M. Satterthwaite.  Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .

[16]  Damien Ernst,et al.  Blockchain for Peer-to-Peer Energy Exchanges: Design and Recommendations , 2018, 2018 Power Systems Computation Conference (PSCC).

[17]  P. Fishburn,et al.  Voting Procedures , 2022 .

[18]  David C. Parkes,et al.  A Complexity-of-Strategic-Behavior Comparison between Schulze's Rule and Ranked Pairs , 2012, AAAI.