Recently, we have shown that under mild restrictions on the free data, the constraint equations yield solutions smoothly extendible to scri. One of the key steps in our proof established that our freedom in choosing initial data translates to freedom in choosing only 4 coefficients in the series expansion around scri. Since we know the asymptotic behaviour of the constraints, any expression can be evaluated on scri knowing the free variables and the 4 asymptotic freedoms. The challenge lies in constructing an algorithm that generates the solutions taking the asymptotic freedoms as an input.