Ordered Consensus with Equal Opportunity

2025-09-11

AI Summary

In state-machine replication (SMR)-based blockchains, network heterogeneity—arising from geographic distribution and latency disparities—grants certain clients unfair advantages in command ordering; existing ordering consensus protocols fail to guarantee fairness even in non-Byzantine settings. This paper introduces Bercow, the first fault-tolerant consensus protocol to formally incorporate the sociological fairness notion of “equal opportunity” into ordering semantics. Its core innovation is a Secret Random Oracle (SRO), instantiated via trusted hardware or threshold verifiable random functions (VRFs), which generates manipulation-resistant randomness. This randomness is leveraged to regulate ordering decisions, enabling configurable fairness precision. Theoretical analysis and experimental evaluation demonstrate that Bercow effectively mitigates multiple ordering attacks and significantly reduces systemic bias induced by network advantage under benign (i.e., non-Byzantine) conditions.

Technology Category

• Game Theory and Economic Paradigms: Fair Division
• Machine Learning: Ethics, Bias, and Fairness
• Computer Vision: Bias, Fairness & Privacy

Application Category

• Economics, Online Markets and Human Computation: Fairness, privacy, and diversity in economic environments
• Security and Privacy: Blockchains and distributed ledgers
• Social Networks and Social Media: Fairness and bias in social network and social media analysis

Abstract

The specification of state machine replication (SMR) has no requirement on the final total order of commands. In blockchains based on SMR, however, order matters, since different orders could provide their clients with different financial rewards. Ordered consensus augments the specification of SMR to include specific guarantees on such order, with a focus on limiting the influence of Byzantine nodes. Real-world ordering manipulations, however, can and do happen even without Byzantine replicas, typically because of factors, such as faster networks or closer proximity to the blockchain infrastructure, that give some clients an unfair advantage. To address this challenge, this paper proceeds to extend ordered consensus by requiring it to also support equal opportunity, a concrete notion of fairness, widely adopted in social sciences. Informally, equal opportunity requires that two candidates who, according to a set of criteria deemed to be relevant, are equally qualified for a position (in our case, a specific slot in the SMR total order), should have an equal chance of landing it. We show how randomness can be leveraged to keep bias in check, and, to this end, introduce the secret random oracle (SRO), a system component that generates randomness in a fault-tolerant manner. We describe two SRO designs based, respectively, on trusted hardware and threshold verifiable random functions, and instantiate them in Bercow, a new ordered consensus protocol that, by approximating equal opportunity up to within a configurable factor, can effectively mitigate well-known ordering attacks in SMR-based blockchains.

Problem

• Extending ordered consensus to ensure fairness in command ordering
• Mitigating ordering manipulation without requiring Byzantine replicas
• Achieving equal opportunity for clients in blockchain transaction ordering

Innovation

• Extends ordered consensus with equal opportunity fairness
• Introduces secret random oracle for bias-resistant randomness
• Leverages trusted hardware and threshold VRFs