![]() |
![]() |
#1 |
"Simon Josefsson"
Jan 2020
Stockholm
3×11 Posts |
![]()
Hi. I see that a lot of people have quickly increased their P-1 computations (myself included), but I wonder how/if these results are possible to spoof, or if there is independent verification of the computations people have done?
(With "failures" I mean negative results: i.e., no factor found.) Last fiddled with by jas on 2022-11-04 at 16:44 |
![]() |
![]() |
![]() |
#2 |
P90 years forever!
Aug 2002
Yeehaw, FL
32·907 Posts |
![]()
P-1 results where a factor is not found are not verifiable at this time.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
VDF (Verifiable Delay Function) and PRP | preda | Math | 254 | 2022-10-04 06:55 |
Aurifeuillian or Aurifeuillean - say that 10X quickly | jwaltos | Information & Answers | 3 | 2019-11-01 16:22 |
Calculating inverses quickly. | mgb | Computer Science & Computational Number Theory | 2 | 2019-10-26 19:21 |
Can I quickly unreserve & get my assignments back? | petrw1 | PrimeNet | 18 | 2008-11-15 23:51 |
Mean time between failures | nomadicus | Hardware | 3 | 2003-10-06 16:35 |