We made good use of this technique when counting the number of legal Go positions [1]. "Clever use of the Chinese Remainder Theorem allows for splitting the co

We made good use of this technique when counting the number of legal Go positions [1]. "Clever use of the Chinese Remainder Theorem allows for splitting the computation into 9 independent parts, each computing L19 modulo 2^64 minus some small number, contributing 64 bits of the 566 bit result." [1] https://tromp.github.io/go/legal.html https://tromp.github.io/go/legal.html