# Tiny Groups Tackle Byzantine Adversaries

## TL;DR

This paper introduces a proof-of-work based method to reduce the size of small groups in distributed systems from logarithmic to double-logarithmic, significantly improving efficiency while maintaining security against Byzantine adversaries.

## Contribution

It presents a novel approach using proof-of-work to exponentially decrease group sizes in Byzantine fault-tolerant systems, surpassing the traditional logarithmic bounds.

## Key findings

- Group size reduced to O(log log n) using proof-of-work
- Communication and state costs are significantly improved
- Maintains strong security guarantees against Byzantine adversaries

## Abstract

A popular technique for tolerating malicious faults in open distributed systems is to establish small groups of participants, each of which has a non-faulty majority. These groups are used as building blocks to design attack-resistant algorithms. Despite over a decade of active research, current constructions require group sizes of $O(\log n)$, where $n$ is the number of participants in the system. This group size is important since communication and state costs scale polynomially with this parameter. Given the stubbornness of this logarithmic barrier, a natural question is whether better bounds are possible. Here, we consider an attacker that controls a constant fraction of the total computational resources in the system. By leveraging proof-of-work (PoW), we demonstrate how to reduce the group size exponentially to $O(\log\log n)$ while maintaining strong security guarantees. This reduction in group size yields a significant improvement in communication and state costs.