mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 1000
Search took 0.33 seconds.
Search: Posts Made By: jasonp
Forum: XYYXF Project 2021-04-16, 13:40
Replies: 16
Views: 2,257
Posted By jasonp
FYI I think Greg Childers finally fixed the large...

FYI I think Greg Childers finally fixed the large dataset bug, it was a buffer overflow in the clique removal and should be fixed in r1038. More generally with the average size of the largest jobs...
Forum: YAFU 2021-03-25, 14:03
Replies: 62
Views: 28,445
Posted By jasonp
The standards I'm familiar with do mandate...

The standards I'm familiar with do mandate choosing a prime P constructed so that P+-1 have large factors, though some authors consider that a waste of time at cryptographic sizes since ECM will...
Forum: YAFU 2021-03-24, 21:02
Replies: 62
Views: 28,445
Posted By jasonp
Anyone who wants to delve into the standard...

Anyone who wants to delve into the standard methods for generating RSA key pairs should read NIST SP800-56B (https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-56Br2.pdf), which...
Forum: YAFU 2021-01-15, 14:28
Replies: 6
Views: 1,542
Posted By jasonp
To be fair, it's not their fault when users muck...

To be fair, it's not their fault when users muck about with undocumented internals to their structures, which I did (in this one place only, hopefully).
Forum: Factoring 2020-12-07, 12:45
Replies: 10
Views: 2,189
Posted By jasonp
Try asking the developers in the cado-nfs mailing...

Try asking the developers in the cado-nfs mailing list, they are very responsive and I know they have thought pretty deeply about cofactorization strategies.

For extra credit: given a rational and...
Forum: Msieve 2020-10-21, 17:13
Replies: 4
Views: 1,147
Posted By jasonp
If you restarted from checkpoint and it got past...

If you restarted from checkpoint and it got past the failure point then you should hopefully be able to finish. Maybe the failure wasn't related to getting suspended. Cosmic ray? Memory corruption?
Forum: Msieve 2020-10-20, 18:21
Replies: 4
Views: 1,147
Posted By jasonp
How long between stop and resume? Also is VBITS...

How long between stop and resume? Also is VBITS set to > 64?

The error check in the linear algebra will always fail if you create checkpoints within three iterations of each other. I wonder if...
Forum: Math 2020-10-05, 15:06
Replies: 8
Views: 1,784
Posted By jasonp
You figured it out, but yes the block Lanczos...

You figured it out, but yes the block Lanczos algorithm finds the nullspace of A^T*A and not of A, since the algorithm only works for symmetric matrices.To get the answers you need, Gauss elimination...
Forum: EdH 2020-09-04, 16:44
Replies: 115
Views: 26,754
Posted By jasonp
Sorry for the huge delay, fix has been committed...

Sorry for the huge delay, fix has been committed to Msieve trunk.
Forum: CADO-NFS 2020-08-11, 13:01
Replies: 23
Views: 9,584
Posted By jasonp
The filtering does take a ton of memory and a...

The filtering does take a ton of memory and a previous CADO paper showed how to split the merge phase across many threads of a single machine; per the report the filtering machine had 1.5TB of...
Forum: Programming 2020-07-23, 13:06
Replies: 14
Views: 6,729
Posted By jasonp
Modern assembler versions also let you switch to...

Modern assembler versions also let you switch to Intel syntax with an assembler directive.

The extra boilerplate controls where the input operands come from, where outputs go, what is expected to...
Forum: Programming 2020-07-22, 14:14
Replies: 14
Views: 6,729
Posted By jasonp
As a slight modification, the following macro...

As a slight modification, the following macro (from an old version of GMP's longlong.h) can avoid a potential trip through memory:

#define umul_ppmm(w1, w0, u, v) \
__asm__ ("mulq %3" ...
Forum: YAFU 2020-07-13, 15:52
Replies: 62
Views: 28,445
Posted By jasonp
It was never published. When I asked him about it...

It was never published. When I asked him about it in ~2007 he said he was too busy with his startup company to work on it.
Forum: Factoring 2020-06-10, 11:36
Replies: 13
Views: 6,717
Posted By jasonp
That is how Msieve works. We have many...

That is how Msieve works. We have many experienced programmers here and many of them have also implemented some version of QS. Start a thread asking questions if you like, but also check the archives...
Forum: Factoring 2020-06-09, 18:43
Replies: 13
Views: 6,717
Posted By jasonp
You should be prepared to manually force a...

You should be prepared to manually force a remainder whose sign you want when the numerator of a modulo operation is negative, because a case can be made for both a positive and negative remainder....
Forum: CADO-NFS 2020-05-21, 16:59
Replies: 19
Views: 5,018
Posted By jasonp
The limit on admax is 1/(poly_degree+1) the size...

The limit on admax is 1/(poly_degree+1) the size of the number to be factored. That's the extreme upper limit; Kleinjung's 2006 paper gives more sensible bounds on admax based on the largest and...
Forum: YAFU 2020-05-21, 16:49
Replies: 62
Views: 28,445
Posted By jasonp
Percival predicted a factor of two speedup from...

Percival predicted a factor of two speedup from the method; maybe the factor is larger if one uses a much larger factor base to improve the relation yield and use the subset sum technique to avoid...
Forum: YAFU 2020-05-20, 17:00
Replies: 62
Views: 28,445
Posted By jasonp
Colin Percival, in a blog post around ~2005...

Colin Percival, in a blog post around ~2005 (https://www.daemonology.net/blog/2005-11-30-quadratic-sieve-constant.html), called this method the subset sum self initializing quadratic sieve (SSSIQS)....
Forum: Msieve 2020-05-15, 13:41
Replies: 4
Views: 5,175
Posted By jasonp
You will need a version of CUDA that supports...

You will need a version of CUDA that supports compute capability 7.5 and a version of Visual Studio that that version of CUDA is compatible with. If you have those, both the Msieve makefile and...
Forum: Lounge 2020-05-08, 16:00
Replies: 11
Views: 3,078
Posted By jasonp
Thank you, this is wonderful.

Thank you, this is wonderful.
Forum: Msieve 2020-04-15, 16:52
Replies: 11
Views: 7,463
Posted By jasonp
Alpertron has worked in this area for many years,...

Alpertron has worked in this area for many years, and I assume his work would be difficult to outrun. That being said a 300 bit number in around 20 minutes on my laptop is surprisingly good

I hope...
Forum: Factoring 2020-02-20, 14:31
Replies: 42
Views: 16,453
Posted By jasonp
Maybe Ilya Popvyan (poily on the forum here) was...

Maybe Ilya Popvyan (poily on the forum here) was involved. He contributed Lanczos optimizations several years ago and I know he was running jobs on this machine.
Forum: Factoring 2020-01-13, 04:10
Replies: 24
Views: 8,459
Posted By jasonp
I kind of wish I had been involved in the...

I kind of wish I had been involved in the factoring field back in 2000, looking back it reads like new improvements were arriving rapid-fire. Plus the patent on RSA expired in 2000 and it was set to...
Forum: Programming 2020-01-10, 02:52
Replies: 43
Views: 15,563
Posted By jasonp
Is Abramowitz and Stegun available anywhere...

Is Abramowitz and Stegun available anywhere online? This sounds like something they would have many possibilities available for.

In addition to the rational approximations, if you want simple code...
Forum: Msieve 2020-01-10, 02:32
Replies: 4
Views: 4,637
Posted By jasonp
Compute capability 2.0 is not supported in...

Compute capability 2.0 is not supported in latter-day versions of CUDA (9.1 and up I think). You also need to change the CUB compile line near the bottom of the Msieve makefile to remove the '200'...
Showing results 1 to 25 of 1000

 
All times are UTC. The time now is 04:41.

Tue Apr 20 04:41:45 UTC 2021 up 11 days, 23:22, 0 users, load averages: 2.51, 2.71, 2.83

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.