![]() |
|
|
#34 |
|
"Ed Hall"
Dec 2009
Adirondack Mtns
11×347 Posts |
All's fine here. Uploaded and downloaded some certificate work.
Thanks, Syd. Appreciate all your efforts. |
|
|
|
|
|
#35 |
|
"Forget I exist"
Jul 2009
Dumbassville
26×131 Posts |
if C40's can wreck it I wonder what all the C126 + 's I've got in my current sequence are doing been doing my sequence for 37 lines and all are C126 or greater.
|
|
|
|
|
|
#36 |
|
(loop (#_fork))
Feb 2006
Cambridge, England
641910 Posts |
Your C126s are not being handled automatically, and there are only dozens of them rather than tens of thousands.
|
|
|
|
|
|
#37 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
feels like it from how long they take some times if I kept all my data collection stuff properly it takes almost 400 hours to crack a low C127 by what I have written down but I haven't kept records of timings for all lines.
|
|
|
|
|
|
#38 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
I don't know now because I calculated that I've been doing this sequence barely 400 hours but have got 37 lines mostly completed , but I recorded the total time values the files gave me given so I may be confused.
|
|
|
|
|
|
#39 |
|
Dec 2008
101100112 Posts |
Call your ISP and tell them you are under a denial-of-service attack. They should have the ability to detect and stop this sort of thing before you even notice it.
Also, while this may not immediately help the problem, make the code used by the database public. It's much easier to suggest improvements if people can see how thing are implemented currently. |
|
|
|
|
|
#40 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2A0116 Posts |
Quote:
It's much easier to find ways to cause damage if people can see how thing are implemented currently. |
|
|
|
|
|
|
#41 | |
|
Dec 2008
17910 Posts |
Quote:
Besides, the database is in severe need of independent code review; just yesterday I saw a composite of the form 9^x-2^x without any known factors, which is ridiculous since 7 is both an algebraic factor and a single digit prime. Since the database apparently uses yafu, it should at least let yafu do its usual trial division on every entered number. |
|
|
|
|
|
|
#42 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
Quote:
If the code was implemented properly, we wouldn't be having this discussion in the first place. |
|
|
|
|
|
|
#43 |
|
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
588010 Posts |
All prps proved upto 1300 digits. Pretty certain it shouldn't take more than an hour or two of processing a day to keep up most of the time.
|
|
|
|
|
|
#44 |
|
"Carlos Pinho"
Oct 2011
Milton Keynes, UK
3·17·97 Posts |
For factoring the database composites automatically there's a perl script available. Maybe someone could update it to use primo.
Code:
#!/bin/perl
use warnings;
use strict;
use LWP::Simple;
while(1){
print "get composites\n";
my $rand=int(rand(50))+13;
my $mindig=90;
my $contents = get("http://factorization.ath.cx/listtype.php?
t=3&mindig=$mindig&perpage=1&start=$rand&download=1");
if (!defined $contents or $contents =~ /[a-z]/ ){
print "$contents\n";
print "Error, no composites fetched\n";
sleep(60);
}
my @composites=split(/\s/, $contents);
foreach my $composite (@composites) {
print "Factoring ".length($composite)." digits: $composite\n";
my @results;
open(YAFU, "yafu siqs($composite) -p -v -threads 2|") or die "Couldn't start
yafu!";
while (<YAFU>) {
print "$_";
chomp;
if (/^[CP].*? = (\d+)/) {
push( @results, $1 );
print "*****\n";
}
}
close(YAFU);
if ( scalar(@results) > 0 ) {
print
"===========================================================================\n";
print "report factors\n";
my $url="http://factorization.ath.cx/report.php?report=".$composite."%
3D".join('*',@results);
#print "$url\n";
$contents=get($url);
#print "$contents\n";
my $nofactors = ($contents =~ s/Does not divide//g);
my $already_known = ($contents =~ s/Factor already known//g);
my $added = ($contents =~ s/Factor added//g);
my $small = ($contents =~ s/Small factor//g);
print "\tNew factors added: " . ($added ? $added : 0) . "\n";
print "\tFactors already known: " . ($already_known ? $already_known : 0) . "\n";
print "\tSmall factors: " . ($small ? $small : 0) . "\n";
print "\tErrors (does not divide): " . ($nofactors ? $nofactors : 0) . "\n";
print "===========================================================================\n";
}else {
print "Error, no result found\n";
sleep(60);
}
}
}
die;
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| What's Happening | R.D. Silverman | NFSNET Discussion | 19 | 2010-02-20 23:43 |
| Is there much happening on 1k-10k ? | fivemack | Aliquot Sequences | 5 | 2010-02-05 15:47 |
| Very strange thing | nngs | Software | 4 | 2007-04-14 22:08 |
| Hm... strange thing... | Yxine | Factoring | 1 | 2006-08-10 13:48 |
| Prime95/LLR on dualcore CPU - strange thing? | Cruelty | Software | 1 | 2006-07-27 04:53 |