The Elliptic Curve Primality Proving (ECPP) algorithm is one of the fastest known methods for proving primality. What is its heuristic time complexity for a number with $d$ digits?