https://gitlab.inria.fr/cado-nfs/cado-nfs
Raw File
Tip revision: 88c4751ca1fe4677d6b83efa348d4a7b4d15d1fa authored by Emmanuel Thomé on 21 July 2014, 14:19:06 UTC
changes in 2.0.1
Tip revision: 88c4751
params.c66
###########################################################################
#     Parameter file for Cado-NFS
###########################################################################
# See params/params.c91 for an example which contains some documentation.

# Anything after a # is a comment, until end of line.
# Any empty line is ignored
#
#
# Each parameter should be on an individual line, like
#   param0=42.17
#

###########################################################################
# General parameters
###########################################################################

# Sample parameter file for a 66-digit gnfs input
# Warning: the parameters here are not claimed to be optimal!
# Example: cadofactor.pl wdir=... name=... n=...

name=c66
parallel=1              # do we use parallel computation?
delay=30                # time in seconds between two checks

machines=mach_desc      # file describing available computers for parallel
                        # computation

###########################################################################
# Polynomial selection with Kleinjung's algorithm
###########################################################################

degree=4                # degree of the algebraic polynomial
polsel_delay=30              # time between two checks
polsel_nice=4            # nice level for selection

# one can expect:
# MurphyE(Bf=10000000,Bg=5000000,area=1.00e+16)=1.00e-06-1.19e-06

## Parameters of polyselect
polsel_admax=26000           # max value for lc(f)
polsel_adrange=13000         # individual tasks
polsel_incr=60               # forced divisor of lc(f)
polsel_P=1000                # choose lc(g) with two prime factors in [P,2P]
polsel_maxnorm=25.3          # maximal lognorm before rootsieve

###########################################################################
# Sieve
###########################################################################

# (r,a) means rational or algebraic side
# rlim/alim is the bound for sieving
# lpbr/lpba is the (base 2 log of the) large prime bound
# mfbr/mfba is the (base 2 log of the) limit for the cofactor we try to
#                                      split into large primes.
# rlambda/alambda is the early-abort ratio: if after sieving the
#                                      approximate norm is more than
#                                      lambda times lpb, we reject.
rlim=100000
alim=100000
lpbr=22
lpba=22
mfbr=24
mfba=24
rlambda=1.2
alambda=1.2

I=11                    # Sieving range in lattice siever
qmin=100000             # Start of the special-q range
qrange=5000             # The size of an elementary sieving task
firstcheck=227000       # Try filtering only up from that many relations
sievenice=10            # nice level for the sieving jobs
sieve_max_threads=2

###########################################################################
# Filtering
###########################################################################

                        # (don't start merge otherwise)
keeppurge=160           # maximal excess wanted after purge
                        # (purge shrinks if needed)
maxlevel=15
ratio=1.1
bwstrat=3

###########################################################################
# Linear algebra
###########################################################################

bwmt=2x2                # Multithreading level of Block-Wiedemann ; Use
                        # <m>x<n> for bwc, or only one integer for bw.
bwc_interval=100        # checkpointing interval for bwc.

###########################################################################
# Characters
###########################################################################

nkermax=30              # maximal size of computed kernel
nchar=50                # number of characters

back to top