![]() |
It seemed that my client barfed.
I cleaned out the directory. |
Three more, with only one ECM miss
Three Snuffus runs on a machine I've been tweaking. Not statistically significant as far as saying how much more ECM work should be done. Make of it what you will.
[CODE]11,10,170+ C126 = P39.P88: P39 = 147925520628092038409064227675084125541 P88 = 3313165852016892025760086968832309918664024626928225266048967854207357171781362286036441 11,8,143+ C126 = P54.P73: P54 = 104122534925905730702829386544650764219825257847728473 P73 =1469584492998552566435868642272414903153826093121356737740548916848332897 11,9,176+ C152 = P74.P78: P74 = 73129271702557703382677373054731852032348296268359625927068844425662156161 P78 = 230076827753798551840710998996206510435800564437475830942403118009392216947393 [/CODE] |
Down to the last 400
(gnfs) 9776124602414688681727440599284754682655020451 P46 divides 11-4_175 with prime cofactor
and that leaves 400 numbers unfactored in the reservation system. Lots of low-hanging fruit left: come on, fill your SNFS-based boots! |
6,5,247+ (SNFS) and 11,10,179- (ECM)
6^247 + 5^247 -- the C159 cofactor splits as p57.p103, using SNFS:
p57=205389967834549656201263301763809310650459524979700172947 p103=1787511469912526043217269181203721580649330881008459943387236861428911270625126577255073044101172471979 11^179 - 10^179 -- a lucky ECM find. C135 = p44.p91 p44=31115299234391371364447590056092485590953267 p91=4489697274009894664912421239325520298941419446287093926980882118154829865296477979518970371 |
New factor:
[code] [2008-02-15 10:17:36 GMT] Factor found! 11+9_184 / 41815666215771882031249400539805937409 B1: 3000000 sigma: 568006298 Type: probable Cofactor is 'Probable': 6293100077057743254491287412805967584299846151877114477033113658901647464516297428942352372572230786528804924086215973164222639259139536929 (found in step 2) [/code] |
Down below the 375 mark
374 to go, after a nice SNFS
10^163 + 9^163 = 19 * 1433153555612502345361678661351114809676197204757141699597919812585169413228647 * 367243137154566232630242909103799212387673523158005453108664408755206553173978383653 Smallest cofactor left has 109 digits, easiest SNFS left is difficulty 136.0. |
4^337-3^337 done
Four more snuffus jobs:
[CODE] 10,9,181- size=181.0 C135 = P51.P84; P51 = 827232158991070325319987739385650026403926137592773 12,5,166+ size=179.1 C136 = P65.P71; P65 = 25863562833455470724394229913204429368344831124533948429512356781 12,11,164+ size=177.0 C136 = P49.P87; P49 = 3075207714177770725301960658879424075617034584377 [/CODE] The marquee number for this thread (must we close the thread now?): [CODE] 4,3,337- size=202.89 C170 = P65.P105; P65 = 44691582261159051021863710069565595522078249375509940950175353149 [/CODE] |
My first result
Hi all,
Having just found this list, I decided to throw my computer at one of the open numbers on the list. [code] Number: 11,8,185- N=1943166892195300860376975398255887147153191713065355016422825067307544095703861766043498161522442696976604095691 ( 112 digits) Divisors found: r1=13907332074324751706761505123705969274921422890504559621 r2=139722477453652678729511709826535635567126313786264790671 Version: Total time: 33.69 hours. Scaled time: 70.10 units (timescale=2.081). Factorization parameters were as follows: name: 11,8,185- n: 1943166892195300860376975398255887147153191713065355016422825067307544095703861766043498161522442696976604095691 skew: 74853.45 # norm 1.34e+15 c5: 1020 c4: -438415484 c3: -22521007478991 c2: 887412524928285893 c1: 67061085008749032938657 c0: -212718548587287000678625660 # alpha -5.35 Y1: 58343559617 Y0: -4528792963214777393433 # Murphy_E 7.95e-10 # M 1351832461456931213061303957884863223461664843615794543348372864552364956807489332837363096161181130142440571561 type: gnfs rlim: 3500000 alim: 3500000 lpbr: 27 lpba: 27 mfbr: 50 mfba: 50 rlambda: 2.6 alambda: 2.6 qintsize: 10000 Factor base limits: 3500000/3500000 Large primes per side: 3 Large prime bits: 27/27 Max factor residue bits: 50/50 Sieved algebraic special-q in [1750000, 2600001) Primes: rational ideals filtering, algebraic ideals filtering, Relations: relations Max relations in full relation-set: Initial matrix: Pruned matrix : 514465 x 514711 Total sieving time: 33.69 hours. Total relation processing time: 0.00 hours. Matrix solve time: 0.00 hours. Time per square root: 0.00 hours. Prototype def-par.txt line would be: gnfs,111,5,maxs1,maxskew,goodScore,efrac,j0,j1,eStepSize,maxTime,3500000,3500000,27,27,50,50,2.6,2.6,100000 total time: 33.69 hours. --------- CPU info (if available) ---------- Memory for crash kernel (0x0 to 0x0) notwithin permissible range Memory: 990064k/1014720k available (2435k kernel code, 24268k reserved, 1235k data, 192k init) Calibrating delay using timer specific routine.. 3982.09 BogoMIPS (lpj=1991047) Calibrating delay using timer specific routine.. 3106.12 BogoMIPS (lpj=1553061) [/code] Some of the time statistics seem off, but I'll worry about that later. Justin |
350 numbers still to go
A 38-digit ECM factor by [email]bigus_geekus@yahoo.ca[/email] just got the list down to 350.
|
12,7,198+ factors
prp44 factor: 55087574140603190716934458176869055586597981 prp81 factor: 124503004832190487993677150416073078634997657391710976119735187863593209975276481 |
Updated tables posted.
I've just posted an update to the website.
There are now 339 composites remaining. I suspect that extensions won't be need for quite some time, given the rate at which factors are appearing now that all the easy ones have been found. Paul |
| All times are UTC. The time now is 23:04. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.