Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / byzantine, cryptocurrency, bitcoin, nakamoto, consensus

Original Publication (with minor differences): arxiv.org, preprint.org

Date: received 14 Jul 2019, last revised 14 Jul 2019

Contact author: mirco richter at email de, mirco richter@mailbox org

Available format(s): PDF | BibTeX Citation

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

Version: 20190714:160043 (All versions of this report)

Short URL: ia.cr/2019/816


[ Cryptology ePrint archive ]