mersenneforum.org ggnfs
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2006-08-11, 23:11 #1 ATH Einyen     Dec 2003 Denmark 19×181 Posts ggnfs I'm wondering about polyselect.exe for gnfs. What is the formula for the score E(F1,F2) of the polynominals? I thought it was a function of the coefficients only but the same polynominal can have slightly different score if the search parameters was different: bestpoly1.txt bestpoly2.txt Scores are 8.024327e-007 and 8.121436e-007 for the same polynomial and only difference is maxS1 70 or 72 which should only be the stage1 "cutoff" value. What about the skew? I read in another post here it should be (c_0/c_d)^(1/d). But skewness in my example file is 464.436 while: (c_0/c_d)^(1/d) = (27473397726011234846439353544/10516227540)^(1/6) = 1173.569.
2006-08-12, 05:17   #2
jasonp
Tribal Bullet

Oct 2004

67438 Posts

Quote:
 Originally Posted by ATH I'm wondering about polyselect.exe for gnfs. What is the formula for the score E(F1,F2) of the polynominals? I thought it was a function of the coefficients only but the same polynominal can have slightly different score if the search parameters was different:
E depends on the size of the coefficients, and also on the behavior of the coefficients modulo small primes. Unfortunately the latter property is hard to measure exactly, and so the code creates a few thousand random sample values of the polynomial and tests them for divisibility by the small primes. This means E will vary from run to run, unless you use the same random seed.

The formula for E is equation 5.7 of Murphy's 'Polynomial Selection for the Number Field Sieve'. The root properties are determined by the function alpha(F)

Quote:
 Originally Posted by ATH What about the skew? I read in another post here it should be (c_0/c_d)^(1/d). But skewness in my example file is 464.436 while: (c_0/c_d)^(1/d) = (27473397726011234846439353544/10516227540)^(1/6) = 1173.569.
I think the skewness is the result of a 1-dimensional minimization procedure given the polynomial coefficients.

jasonp

Last fiddled with by jasonp on 2006-08-12 at 05:23

2006-08-12, 08:52   #3
smh

"Sander"
Oct 2002
52.345322,5.52471

22458 Posts

Quote:
 I'm wondering about polyselect.exe for gnfs.
Not an answer to your question, but you shouldn't use polyselect anymore. The pol51xxx.exe programs produces much better polynomials.

 2006-08-12, 22:50 #4 ATH Einyen     Dec 2003 Denmark 19·181 Posts Thanks. Last fiddled with by ATH on 2006-08-12 at 23:02

 Similar Threads Thread Thread Starter Forum Replies Last Post sega24 Msieve 3 2016-03-07 23:35 jux Factoring 4 2015-12-27 03:05 pakaran Factoring 14 2015-09-05 23:36 silentfrog Factoring 1 2009-09-10 08:57 Zeta-Flux Factoring 1 2007-08-07 22:40

All times are UTC. The time now is 07:32.

Tue Feb 7 07:32:15 UTC 2023 up 173 days, 5 hrs, 1 user, load averages: 1.12, 1.08, 0.99

Copyright ©2000 - 2023, 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.

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