Committee Configuration Optimization for Parallel Byzantine Consensus in a Trusted Execution Environment

A team of researchers has developed a novel optimization model that significantly improves the performance of sharded, Byzantine Fault Tolerant (BFT) blockchain protocols. The paper, "Committee Configuration Optimization for Parallel Byzantine Consensus in a Trusted Execution Environment," addresses a core scalability challenge: while sharding (splitting the network into committees) increases throughput, it weakens security as smaller groups are responsible for consensus. The researchers' solution integrates Trusted Execution Environments (TEEs), like Intel SGX, to bolster security, but they identified that randomized committee assignment—a common practice—hurts performance.

To solve this, the team created a Committee Configuration Optimization (CCO) model based on mixed integer programming. This model doesn't randomly assign nodes to committees. Instead, it intelligently configures them by factoring in real-world variables like network communication delays and individual node failure rates. The goal is to find the optimal setup that minimizes transaction latency, both during normal operations and during critical "fallback" scenarios when trusted hardware fails. The researchers integrated CCO into a parallel BFT protocol and tested it on Microsoft Azure virtual machines.

The experimental results are compelling. The optimized system demonstrated a 15% improvement in transaction throughput under normal conditions. More importantly, during the fallback process—when the system is most vulnerable—throughput improved by 21%. This highlights that a mathematically-driven, optimized configuration is far superior to random assignment, providing a concrete path to making sharded blockchains both faster and more resilient. The work represents a meaningful advance in distributed systems engineering, moving blockchain scalability solutions from heuristic approaches to optimization-driven design.