Phil Carmody on Wed, 14 May 2008 22:16:30 +0200


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: bnfinit perhaps getting stuck?


--- On Wed, 5/14/08, Bill Allombert <Bill.Allombert@math.u-bordeaux1.fr> wrote:
> You are using the stable version. Due to several improvement (in
> particular 2.4.0F4 and the new LLL code) I would suggest
> you try the SVN version but actually, I should rather suggest you
> to give up because I do not think this can finish.

I'm up for still hacking away at it if it's still needed [task requestor bcc:d]
I don't have SVN, but can grab 
Development version: pari-2.4.2.alpha.tar.gz,  2183 KBy, Dec 23 00:58:07 2007 
from the website.

> Using \g1 is generally sufficient and keep the logs readable.
> You can try
> grep cglob <your log> 
> or if this is too verbose
> grep needed <your log>
> to get a measure of progress.

Ah, that's very useful to know. It appears that I was making steady progress:
"""
(more relations needed: 171)
++++ cglob = 2452: new relation (need 2622)
++++ cglob = 2453: new relation (need 2622)
...
++++ cglob = 2470: new relation (need 2622)
++++ cglob = 2471: new relation (need 2622)
^C
"""

Extrapolating how long I ran that most recent verbose run, and how long I ran the original, I would have expected to have found 171 relations. Is the hard and non-deterministic work all done after the requisite number of relations is found?

Phil