It does not matter at a high level but I think the distinction is that there should be only one black box in the proof, which is precisely the thing being reduc

It does not matter at a high level but I think the distinction is that there should be only one black box in the proof, which is precisely the thing being reduced. Every other instruction/call used n the algorithm must be known to be computable (in this case, addition).