mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Factoring (https://www.mersenneforum.org/forumdisplay.php?f=19)
-   -   Python script for search for factors of M1277 using random k-intervals (https://www.mersenneforum.org/showthread.php?t=25941)

Viliam Furik 2020-10-19 22:28

May I ask you to discuss here only the topic of the thread, please?

VBCurtis 2020-10-19 22:55

[QUOTE=Viliam Furik;560365]May I ask you to discuss here only the topic of the thread, please?[/QUOTE]

The topic of the thread as suggested in the first post is so utterly hopeless that the rest of the discussion is the only useful content. OP's idea was debunked by multiple people, who gave data and probabilities.

storm5510 2020-10-19 23:43

[QUOTE=Viliam Furik;560365]May I ask you to discuss here only the topic of the thread, please?[/QUOTE]

This is a discussion about [B]M1277[/B]. The OP introduced it. Anything reasonable and relative should go.

The downside to [I]mtee[/I] is that [U]everything[/U] written to the screen is captured. This can result in many megabytes of text. [I]GMP-ECM[/I] places a group of asterisks before any line containing found factor information. This makes for a quick search with something like [I]Notepad++[/I].

xilman 2020-10-20 10:47

[QUOTE=storm5510;560315]If he was [U]not[/U] using it on long runs. Not using it would allow a found factor to roll off the top of the screen as the program continued to run.

A minor workaround would be to use something to capture every line appearing on the screen and writing it into a text file. I believe Linux may have something like this built in. In the past, I have used a little program called [I]mtee[/I]. It does the same thing. Then a person would have to do a manual search of each capture file.



I am not sure I follow. "ecm ? factorint" produces an error message.

[U]Edit[/U]: I just sent a message to PhilF to see if he was using the [C]-one[/C] option in his processes.[/QUOTE]Please pay attention.

I specifically wrote [b]in gp[/b].

storm5510 2020-10-20 13:45

[QUOTE=xilman;560398]Please pay attention.

I specifically wrote [B]in gp[/B].[/QUOTE]

Apologies. I am not familiar with [B]gp[/B]. :blush:

mathwiz 2020-10-20 14:24

[QUOTE=VBCurtis;560368]The topic of the thread as suggested in the first post is so utterly hopeless that the rest of the discussion is the only useful content. OP's idea was debunked by multiple people, who gave data and probabilities.[/QUOTE]

Maybe a mod can change the topic to "Python script to needlessly waste energy and compute cycles".

Viliam Furik 2020-10-20 15:48

[QUOTE=mathwiz;560418]Maybe a mod can change the topic to "Python script to needlessly waste energy and compute cycles".[/QUOTE]

That's not nice of you...

mathwiz 2020-10-20 16:30

[QUOTE=Viliam Furik;560426]That's not nice of you...[/QUOTE]

Perhaps a bit snarky, but is the topic of this thread "general efforts to factor M1277" or just the original Python script? If the latter, then wasting energy and compute is all that would be accomplished.

LaurV 2020-10-21 07:18

For fun, I just timed factor5 (the old version from 2009, I don't have newer) and it is about few [U]thousand[/U] times faster compared with the script (slow laptop, 6 threads in 2 cores to feed the cpu 100%, P95 running in background, i.e. doing nothing due to priority limit, computer still normally responsive).

Edit: that was for fun! TF on this exponent is totally pointless. Unless you consider yourself extremely lucky guy (like we Romanians would say, you stepped on a shit or put your hand in it, or one shit fell on your head, or [URL="https://www.premierhotels.co.za/7_good-luck-superstitions/"]something[/URL]).

storm5510 2020-10-21 16:32

1 Attachment(s)
[QUOTE=LaurV;560498]For fun, I just timed factor5 (the old version from 2009, I don't have newer) and it is about few [U]thousand[/U] times faster compared with the script (slow laptop, 6 threads in 2 cores to feed the cpu 100%, P95 running in background, i.e. doing nothing due to priority limit, computer still normally responsive).
[/QUOTE]

I believe M1277 has been factored to 2^67. I have both the old and the new [I]factor5[/I] here somewhere. The new doesn't know from 2^? It uses [I]k[/I] only. Somewhere in my notebook I keep, there is a conversion formula I scratched down a long time ago. Someone here presented the formula. Who or when, I cannot remember.

After doing a little searching in my notes, I believe I found it. It looks like so: [B]k = 2[SUP]x[/SUP] / 2p[/B]. The x would be replaced with 67 then 68. 2p is 2*1277. If this is correct, the lower [I]k[/I] would be 57,781,500,622,426,160, and the upper is 115,563,001,244,852,320. I do not believe it multi-threads, so it could take decades, if not centuries, to run.

I found the archive. It is attached below if anyone wants to mess with it. It produces a results file, but no interim screen output. [U]Luigi Morelli[/U] wrote this in 2018. I believe many here know who Luigi is.

LaurV 2020-10-21 16:56

This is (as the readme says) the version optimized for large p and small k. It is too slow for small p, and would not worth anyhow, even if the TF would be indicated (but as I said, and everybody said, it is NOT! Don't waste your time with TF).

I downloaded it and deleted it without launch (why the exe only, and not the sources? - rhetoric question, no need answer).


All times are UTC. The time now is 05:22.

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