Paper 2019/816

Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks

Mirco Richter

Abstract

A framework for asynchronous, signature free, fully local and probabilistically converging total order algorithms is developed, that may survive in high entropy, unstructured Peer-to-Peer networks with near optimal communication efficiency. Regarding the natural boundaries of the CAP-theorem, the protocol chooses different compromises for consistency and availability, depending on the severity of the attack. The family is parameterized by a few constants and external functions called voting-weight, incentivation and punishement, difficulty oracle and quorum-selector. These functions are necessary to fine tune the dynamics and very different long term behavior might appear, depending on any actual choice.

Note: First draft, comments, ideas and criticism welcome.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Minor revision.arxiv.org, preprint.org
Keywords
byzantinecryptocurrencybitcoinnakamotoconsensus
Contact author(s)
mirco richter @ email de
mirco richter @ mailbox org
History
2019-07-14: received
Short URL
https://ia.cr/2019/816
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/816,
      author = {Mirco Richter},
      title = {Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks},
      howpublished = {Cryptology ePrint Archive, Paper 2019/816},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/816}},
      url = {https://eprint.iacr.org/2019/816}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.