mersenneforum.org > YAFU Processor stuck at 25% when multithreading
 Register FAQ Search Today's Posts Mark Forums Read

 2015-12-29, 10:22 #1 GaEL   Dec 2015 68 Posts Processor stuck at 25% when multithreading Hi ! I'm currently running yafu 1.34 on cygwin to factor a 95digits key and try to decrypt a .vvv file. All is running on a Win 7 Pro 64bits virtual machine (12GB RAM + 4 Intel Xeon E5630 entirely dedicated to my VM) I ran the factor command during 3 hours and the system is so slow. You can check the screen in attachment file below. In fact, processor is stucked at 25% and never exceed this value. I've modified the yafu.ini file with threads=4 inside. I don't know what is wrong with my configuration. Could someone help me ? Thank you for reading ;) Gael Attached Thumbnails
 2015-12-29, 17:11 #2 wombatman I moo ablest echo power!     May 2013 111000001002 Posts Is the yafu.ini file in the same folder as the .exe? Your other option would be to pass "-threads 4" instead. Last fiddled with by wombatman on 2015-12-29 at 17:12
 2015-12-29, 18:17 #3 VBCurtis     "Curtis" Feb 2005 Riverside, CA 527610 Posts You say 95 digits, but your screenshot says 145 digits. Which is it? 95 digits should take about an hour. 145 should take a few days.
 2015-12-29, 23:10 #4 Dubslow Basketry That Evening!     "Bunslow the Bold" Jun 2011 40
2015-12-29, 23:26   #5
chalsall
If I May

"Chris Halsall"
Sep 2002

2×23×227 Posts

Quote:
 Originally Posted by Dubslow IIRC correctly, the built in ECM is not multithreaded..
Then what might be the issue(s), if any?

2015-12-29, 23:39   #6
Dubslow

"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88

3·29·83 Posts

Quote:
 Originally Posted by chalsall Then what might be the issue(s), if any?
If you mean why is the code this way, you'd have to ask Ben.

If you mean how does this result in the symptoms described, then it's simply because OP's yafu is falling back to the builtin ecm (in lieu of the preferred external GMP-ECM), which is singlethreaded only so it only runs the one thread.

 2015-12-30, 07:35 #7 GaEL   Dec 2015 2·3 Posts Thanks all of you for answering. So in the order : - wombatman => yafu.ini is in the same folder as yini.exe. I'll try with "-threads 4" this is always stuck at 25%. - VBCurtis => indeed there's 145 digits, excuse me for my mistake. - I'm gonna try with nfs(). I also forget to specify the gmp-ecm path Simultaneously I ran a yafu builded version on Debian 64x with 4 threads and it works fine (I mean all cpu near 100%). But yes, 145 digits should take a long time, even if there's the 4x Xeon. I'm going to apply your tips on my machine and let you know how's it's going on. Thank you again
 2015-12-30, 09:09 #8 GaEL   Dec 2015 1102 Posts Well, i tried with nfs() and siqs() for both it returns " input must be odd" (in attachment file) Is that a key problem or my config goes wrong ? (btw, it runs well with factor(), approximately 3-4 hours following the program ;) ) Attached Thumbnails   Last fiddled with by GaEL on 2015-12-30 at 09:54
 2015-12-30, 13:37 #9 jasonp Tribal Bullet     Oct 2004 5×709 Posts factor() tries a succession of techniques that strip out progressively larger and larger factors before moving to SIQS and NFS. The latter two assume this has already happened. Most if not all of these Teslacrypt numbers have small factors, so they are not conventional RSA keys where nothing but nfs() or siqs() would work on them. You'll need to remove the small factors first, and then feed any leftover composite numbers to nfs() or siqs().
2015-12-30, 13:40   #10
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

838410 Posts

Quote:
 Originally Posted by jasonp factor() tries a succession of techniques that strip out progressively larger and larger factors before moving to SIQS and NFS. The latter two assume this has already happened. Most if not all of these Teslacrypt numbers have small factors, so they are not conventional RSA keys where nothing but nfs() or siqs() would work on them. You'll need to remove the small factors first, and then feed any leftover composite numbers to nfs() or siqs().
my results from dividing the number by two then factoring to 2^32 ( the others aren't confirmed prime at last check) :
Code:
(08:41) gp > factorint(%,2^32)
%5 =
[11 1]

[73 1]

[574528669691 1]

[41130962080332043 1]

[671931392138040966258679495931 1]

[1412768518150334124463466996272612543385875055672753209158271382496594505413952262750345115376871 1]
edit: never mind factorint doesn't have a limit only a flag for what type of algorithm to use. edit: rerunning without a flag. 2^32 wouldn't have a flag bit set so it probably wouldn't matter doh.

Last fiddled with by science_man_88 on 2015-12-30 at 14:18

2015-12-30, 15:13   #11
bsquared

"Ben"
Feb 2007

1110001000012 Posts

Quote:
 Originally Posted by science_man_88 my results from dividing the number by two then factoring to 2^32 ( the others aren't confirmed prime at last check) : Code: (08:41) gp > factorint(%,2^32) %5 = [11 1] [73 1] [574528669691 1] [41130962080332043 1] [671931392138040966258679495931 1] [1412768518150334124463466996272612543385875055672753209158271382496594505413952262750345115376871 1] edit: never mind factorint doesn't have a limit only a flag for what type of algorithm to use. edit: rerunning without a flag. 2^32 wouldn't have a flag bit set so it probably wouldn't matter doh.
You mistyped the OP's number. I translate it as
Code:
3602649853484214179983415445666301940354495565543916242311221257561512738889505000235719414385939551029113564292002198303081881671314596809680484560821278
which seems to match what the OP posted (it is producing a similar factorization so far, stuck at a C145).

 Similar Threads Thread Thread Starter Forum Replies Last Post NickOfTime GPU to 72 8 2014-11-25 19:14 Mark Rose GPU to 72 10 2013-11-04 18:59 NBtarheel_33 PrimeNet 70 2012-08-07 11:06 patrik Hardware 10 2005-04-27 22:40 stephenX Hardware 10 2005-01-20 15:58

All times are UTC. The time now is 00:59.

Tue May 17 00:59:30 UTC 2022 up 32 days, 23 hrs, 0 users, load averages: 1.15, 1.32, 1.38

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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔