Statement of Theorem

Given any algorithm A that solves DLOG on some m-fraction of curves in a level, one can probabilistically solve
DLOG on any curve in the same level with polylog(q)/m queries to A with random inputs.

Without assuming GRH, but the weaker Lindelöf hypothesis:
subexponentially many

instead
of polynomially many.