[pypy-issue] [issue1031] Speed of a tiny arithmetic program

[Justin Peel]

Justin Peel <peelpy at gmail.com> added the comment:

This is primarily a big int problem. ~45% of the time is spent doing big int 
pows. Namely, it is spent in this line:

x=pow(a,2**r*d,n)

----------
nosy: +justinpeel
status: unread -> chatting

________________________________________
PyPy bug tracker <tracker at bugs.pypy.org>
<https://bugs.pypy.org/issue1031>
________________________________________