![]() |
![]() |
#78 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23·1,171 Posts |
![]() |
![]() |
![]() |
![]() |
#79 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23×1,171 Posts |
![]()
In the Cat 0 and Cat 1 FTC range there are almost 200 P-1 assignments just sitting there with no expiry dates. Many are over 3 months old. This looks to be the latest exploit to tie up exponents near milestones, or to reserve them for oneself contrary to the standard FTC assignment and expiry rules.
https://www.mersenne.org/assignments...ecm=1&exdchk=1 |
![]() |
![]() |
![]() |
#80 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23×1,171 Posts |
![]()
A batch assigned 11/23
https://www.mersenne.org/assignments...hk=1&exfirst=1 |
![]() |
![]() |
![]() |
#81 | |
Oct 2020
Terre Haute, IN
2·31 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#82 |
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
2×2,459 Posts |
![]()
I see several are a relative few of my manual assignments that have fallen through the cracks. I'll work on cleaning those up this week. (A radeon vii can do 30 a day, but only if they successfully complete, and some have crashed in a way that generates messages such as "gcd invalid input" on a resumption attempt.)
|
![]() |
![]() |
![]() |
#83 | |
Einyen
Dec 2003
Denmark
3,037 Posts |
![]() Quote:
https://www.mersenne.org/assignments...hk=1&exfirst=1 Ernst had a batch he did not remember getting, and Ryan Propper has several hundreds none of them started, and several other users have a batch without having started any of them: Runtime Error, BigBrother, Albrecht Heeffer, OneAfterlife etc. All of them were Cat1 when started even those few from September. Should we be doing P-1 on Cat1 assignments or should it be done before they reach Cat1 ? Last fiddled with by ATH on 2020-12-02 at 23:10 |
|
![]() |
![]() |
![]() |
#84 | |
Aug 2020
2×3×19 Posts |
![]() Quote:
The problem is that some of them don't have a large memory, so they can only do a P-1 with S1 only. From the perspective of the project, that is suboptimal. It would be nice if there is an option for low-memory FTC contributors to only accept assignments that has a sufficient P-1 done. And to give the smallest P-1 assignments (for example Cat 0+1) to machines that are proved capable of returning 2-Stage P-1 results in a reasonably short time, similar to (but simpler than) the rules of FTC/DC. cc George |
|
![]() |
![]() |
![]() |
#85 |
Aug 2020
11100102 Posts |
![]()
Down sides:
Last fiddled with by Ensigm on 2020-12-03 at 06:42 |
![]() |
![]() |
![]() |
#86 |
"Tony"
Sep 2014
London, UK
79 Posts |
![]()
144 Cat 0 DCs available right now...
|
![]() |
![]() |
![]() |
#87 | |
Oct 2020
Terre Haute, IN
2·31 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#88 |
Oct 2020
Terre Haute, IN
2×31 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
possible overlapping Fermat factor ranges | MattcAnderson | FermatSearch | 3 | 2021-01-05 14:34 |
Trial Factoring - Factor Confirmation? | butera | GPU to 72 | 3 | 2021-01-02 23:43 |
Trial Factor Bit Depth | lavalamp | Operation Billion Digits | 8 | 2010-08-02 18:49 |
trial division over a factor base | Peter Hackman | Factoring | 7 | 2009-10-26 18:27 |
Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |