Corpus ID: 202583353

KRNC: New Foundations for Permissionless Byzantine Consensus and Global Monetary Stability

  title={KRNC: New Foundations for Permissionless Byzantine Consensus and Global Monetary Stability},
  author={Clinton Ehrlich and A. Guzova},
  journal={IACR Cryptol. ePrint Arch.},
This paper applies biomimetic engineering to the problem of permissionless Byzantine consensus and achieves results that surpass the prior state of the art by four orders of magnitude. It introduces a biologically inspired asymmetric Sybil-resistance mechanism, Proof-of-Balance, which can replace symmetric Proof-of-Work and Proof-of-Stake weighting schemes. The biomimetic mechanism is incorporated into a permissionless blockchain protocol, Key Retroactivity Network Consensus ("KRNC"), which… Expand


The Economic Limits of Bitcoin and the Blockchain
The amount of computational power devoted to anonymous, decentralized blockchains such as Bitcoin's must simultaneously satisfy two conditions in equilibrium: (1) a zero-profit condition amongExpand
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
“Ouroboros” is presented, the first blockchain protocol based on proof of stake with rigorous security guarantees and it is proved that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining. Expand
Cryptocurrencies, Network Effects, and Switching Costs
Cryptocurrencies are digital alternatives to traditional government-issued paper monies. Given the current state of technology and skepticism regarding the future purchasing power of existing monies,Expand
The Sleepy Model of Consensus
This work begins a study of distributed protocols in a “sleepy” model of computation where players can be either online (awake) or offline (asleep), and their online status may change at any point during the protocol. Expand
Tendermint : Consensus without Mining
A solution to the blockchain consensus problem that does not require mining is proposed by adapting an existing problem to the Byzantine Generals Problem. Expand
The Weighted Byzantine Agreement Problem
  • V. Garg, J. Bridgman
  • Computer Science
  • 2011 IEEE International Parallel & Distributed Processing Symposium
  • 2011
A weighted version of the Byzantine Agreement Problem and its solution under various conditions is presented, in this version, each machine is assigned a weight depending on the application. Expand
The Handicap Principle for Trust in Computer Security, the Semantic Web and Social Networking
It is suggested that the Handicap principle may serve as a fundamental paradigm for trust research in computer science, especially secure and resilient computing, the semantic web, and social networking. Expand
The Ripple Protocol Consensus Algorithm
This work presents a novel consensus algorithm that circumvents the requirement that all nodes within the network communicate synchronously by utilizing collectively-trusted subnetworks within the larger network and shows that minimal connectivity is required to maintain agreement throughout the whole network. Expand
Practical Byzantine fault tolerance
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. Expand
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
It is proved that for every function there exists a protocol secure against a set of potential passive collusions if and only if no two of these collusions add up to the full player set. Expand