We conduct an investigation of large prime variant modifications to the well-known index calculus method for discrete logarithm computation modulo a prime p. We highlight compilations in the tecnique that do not occut in the analogue application in factoring. and show how a simple adaption of the methods of [16] can be used to resolve relations each that the yield of he techniques of [10],[16] akkiw ys ti resolve relations involving more large primes, Finally we consider the impact that "large prime" relations have on both the linear algebra stage of the index calculus methods, and on actual discrete laogarithms computation a