Paper 2019/816 Original: eprint.iacr.org/2019/816 ↗
Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2019-07-14: last updated
- 2019-07-14: published
- Short URL
- https://ia.cr/2019/816
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2019/816}
}