Supervised Distributed Computing Under Byzantine Adversaries: When 51% of Your Workers Can’t Be Trusted

Three years ago, a major federated learning platform deployed ML training across 100,000 edge devices. The promise was elegant: train models without centralizing user data. Reality was messier. Within weeks, security teams discovered coordinated attacks: 45,000 devices (45%) had been compromised by a sophisticated adversary and were sending corrupted gradients. The classical solution — consensus-based aggregation — broke immediately. Byzantine fault tolerance, the old workhorse of distributed systems, requires that fewer than one-third of nodes are adversarial. At 45%, the system had no guarantees. Gradient sums exploded. Model weights diverged. The platform’s customers lost trust.

What they needed wasn’t a better consensus algorithm. They needed a fundamentally different approach: supervised distributed computing. Instead of forcing workers to agree, appoint a trusted supervisor to verify their work. When the supervisor can verify correctness deterministically, a single honest worker — even among a sea of adversaries — is enough.

Today, recent research (Augustine et al., May 2026) proves this works: you can tolerate any constant fraction β < 1 of adversarial workers. That means 99% adversarial, if you’re willing to pay the verification cost…