Fast evaluation of multiple zeta sums

We show that the multiple zeta sum:

for positive integers $s_{i}$ with $s_{1}>1$, can always be written as a finite sum of products of rapidly convergent series. Perhaps surprisingly, one may develop fast summation algorithms of such efficiency that the overall complexity can be brought down essentially to that of one-dimensional summation. In particular, for any dimension $d$ one may resolve $D$ good digits of $\zeta$ in $O(D \log D / \log \log D)$ arithmetic operations, with the implied big-$O$ constant depending only on the set $\{s_{1},...,s_{d}\}$.