Computing the number of Goldbach partitions $$g(n) = \#\{(p,q) | n = p + q, p \leq ~q\}$$ of all even numbers n up to a given limit can be done by a very simple, but space-demanding sequential procedure. This work describes a distributed implementation for computing the number of partitions with minimal space requirements. The program was distributed to numerous workstations, leading to the calculation of g(n) for all even n up to 5 × 108. The resulting values are compared to those following from previously stated conjectures about the asymptotic behaviour of g.