Package: pari<div>Version: git-30598f4</div><div><br></div><div><div>? setrand(756);while(1,gettime;rnfkummer(bnrinit(bnfinit(quadpoly(13829,y)),211,1),[5,1;0,1]);print(gettime))</div><div>5516</div><div>6340</div><div>5873</div>
<div>5493</div><div>5432</div><div>5617</div><div>5588</div><div>15386</div><div>5652</div><div>5617</div><div>5429</div><div>5516</div><div>5465</div><div>5712</div><div>5685</div><div>5328</div><div>^C  ***   at top-level: ...and(756);while(1,gettime;rnfkummer(bnrinit(bn</div>
<div>  ***                                             ^--------------------</div><div>  *** rnfkummer: user interrupt after 1min, 40,690 ms.</div></div><div><br></div><div>Nothing catastrophic by any means, but I was curious if there&#39;s a reason for the 8th iteration to be almost 3 times slower than the average - maybe there&#39;s a room for improvement somewhere.</div>
<div><br></div><div>I prepared this example a while ago waiting to report it in case bug 910 patches wouldn&#39;t fix the stack problem.  They did, but I didn&#39;t want to waste this example and decided to reuse it here.</div>
<div><br></div><div>Thanks</div><div><br></div><div>Igor</div>