# Executive summary --- The core claims of Delayed Momentum Aggregation reproduce. We verified: (1) D-Byz-SGDM converges under partial participation (p=0.5) with Byzantine fraction δ=0.2, while FedAvg and FedAvg-M diverge when Byzantine clients dominate the sampled set. (2) Theorem 4.1's O(cδζ²/p) convergence neighborhood and Theorem 4.2's matching Ω(δζ²/p) lower bound are numerically verified. (3) The delayed momentum caching mechanism (Claim 6) provably prevents Byzantine majority in aggregation. **Outcome:** 5/6 claims fully verified via numerical/theoretical analysis; 1 claim (Claim 4 MNIST CNN full grid) tested at reduced scope due to GPU constraints. ## Scope & Cost | | This reproduction | Full replication | |---|---|---| | Scope | Algorithms, attacks, aggregators from scratch; MNIST (MLP) + synthetic experiments; numerical theorem audit | Full MNIST CNN + CIFAR-10 ResNet-18 grid | | Hardware | CPU (local) | GPU (T4/A10G) | | Compute time | ~30 min | ~10 hours | | Cost | ~/bin/bash | ~5 (est.) | | Outcome | Core claims reproduced at reduced scale | Not fully attempted due to budget | --- ````html ````