View Single Post
Old 2020-10-19, 18:59   #6
charybdis
 
charybdis's Avatar
 
Apr 2020

26310 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
So, it would not surprise me that nobody thought to do what you're suggesting. Edit: I don't speak code well enough to answer my own question: Could you just modify that formula above to exclude, say, 64-bit cofactors when LP = 32? Just that one change should provide a fair bit of speedup.
I've stuck in a couple of lines to exclude cofactors between 61 and 64 bits. 60 might be a bit lower than optimal but it matches the bound on the rational side. The siever appears to be running normally; yield and rels/sec are down, but I can't compare that with anything until I know how many fewer relations will be needed to form a matrix.

Of course, I wouldn't like having to recompile every time I change the bounds, so if this experiment isn't a complete failure I'll get in contact with the authors.

Last fiddled with by charybdis on 2020-10-19 at 19:01
charybdis is offline   Reply With Quote