# Crisis: Probabilistically Self Organizing Total Order in Unstructured P2P Networks

## TL;DR

This paper introduces a probabilistic, self-organizing total order algorithm for unstructured P2P networks that is asynchronous, signature-free, and efficient, adapting to network conditions and attacks.

## Contribution

It presents a novel framework for total order in P2P networks that is fully local, probabilistically convergent, and adaptable to high entropy environments.

## Key findings

- Achieves near-optimal communication efficiency.
- Supports survival under high entropy and unstructured conditions.
- Adjusts to different consistency and availability trade-offs.

## 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, Crisis 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 \& 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.