In this paper we prove that rational functions can be reconstructed using a polynomial number of black box evaluations. We consider two models: oracles with exact computations and modular oracles depending on the sizes of coefficients.