Subproject #4: 10k-50k sequences to 110 digits

[unconnected]

36420: i1097, size 110, 2^4*31
36984: i2662, size 115, 2^2*7
Reserving 40836 41364 41784 42672 42942 43000

[Mini-Geek]

Originally Posted by EdH

Correct me if I'm wrong, Mini-Geek, but doesn't submitting the full elf to the db via aliqueit, or submitting the correct lines manually, store the correct factored lines within the db? Then, when the 57, 159, etc. bugs are eradicated, the stored info will populate the db's sequences properly.

Yep, that's so.

Originally Posted by EdH

In this specific case, 512539091200423605342377877270021978828257857114084791961422307443426141684267634625913356380869010638 is the composite for iteration 871** of 36684 and the db has the next several lines up through a c105. So, firejuggler's input is apparently in the db, just not visible from the base 36684, until the 57 bug is chased away.

If the above is correct, there should be no need to post elfs, unless there is a reason for complete elfs elsewhere. Yes/No?

Yes, I suppose you're right. But it's not what we've been doing lately, and I didn't want to throw too many complications at firejuggler, considering he's new here.

Originally Posted by EdH

Additional thought: Someone who is taking a "buggy" sequence, should probably check their first new iteration against the db, to make sure it hasn't been added and is just not showing up due to the bug.

Yes, quite true. If it looks like there's a need for it, a notice saying so could be added to the first post here, but I don't think very many sequences are bugged (and also worked past that bug), so it might be more trouble than it's worth. Plus Syd has been around more lately and I just posted in his thread again, so hopefully this will be fixed soon and be all behind us.

[firejuggler]

groumph... 36684 : 928 hit me hard today ( here, 36684 broken at 870, cause of 57); I had to manually take care of it as aliqueit didn't... anyway... p50 and p54 factors... took 3.09 hours

Number: example
N = 6671070323497881696403979895082072399614158451917545681942017208119134701880063579999656049450688484271 (103 digits)
Divisors found:
r1=58767016187377007874915025699882460094567363784937 (pp50)
r2=113517254342595142750021507529216219123186779929018583 (pp54)
Version: Msieve v. 1.45
Total time: 3.09 hours.
Factorization parameters were as follows:
n: 6671070323497881696403979895082072399614158451917545681942017208119134701880063579999656049450688484271
Y0: -129949133012079298566
Y1: 36608229247
c0: 16476014775931209438069815
c1: 1913276381475814562559
c2: -286655913100194197
c3: -425983891959
c4: 82515402
c5: 180
skew: 54719.10  
type: gnfs
Factor base limits: 2300000/2300000
Large primes per side: 3
Large prime bits: 26/26
Sieved algebraic special-q in [0, 0)
Total raw relations: 4591789
Relations: 444786 relations
Pruned matrix : 256945 x 257173
Polynomial selection time: 0.37 hours.
Total sieving time: 2.46 hours.
Total relation processing time: 0.04 hours.
Matrix solve time: 0.13 hours.
time per square root: 0.08 hours.
Prototype def-par.txt line would be: gnfs,102,5,59,2000,0.0009,0.35,200,15,15000,2000,2300000,2300000,26,26,49,49,2.6,2.6,100000
total time: 3.09 hours.
x86 Family 6 Model 23 Stepping 6, GenuineIntel
Windows-XP-5.1.2600-SP3
processors: 2, speed: 2.83GHz

driver= 2*3*5*7...
it will never let it go down...

[10metreh]

Originally Posted by firejuggler

I had to manually take care of it as aliqueit didn't

What was the error? Are you using factmsieve.py or factMsieve.pl?

[Andi47]

reserving 40092

[smh]

Releasing 36792

reserving 40722

[Greebley]

Done with 39672, 117 digits, 2^2*7
Done with 39798, 110 digits, 2^2*3*7^2
Done with 39840, 113 digits, 2^3*3*5*7

[unconnected]

Done with 42672, 42942, 43000.

[firejuggler]

done with 36684 110 digits, driver 2*3*23 there is no escape..
taking 44712

[firejuggler]

aaaand done with 44712 2^3*3, taking 43980

[unconnected]

Done with 40836 and 41364.
Reserving 43506 and 43974.