We show how "proof mining" techniques from logic can extract concrete information from abstract proofs, even those involving nonconstructive objects like ultraproducts. We focus on uniform bounds in polynomial rings. Our central results are an explicit polynomial-growth bound on prime ideals in polynomial rings over fields and a related bound in differential algebra.