https://gitlab.inria.fr/cado-nfs/cado-nfs
Raw File
Tip revision: b325e6ef4766d4a77f63a7c730e6b546c3555421 authored by Lionel Muller on 25 October 2011, 14:32:59 UTC
oops...
Tip revision: b325e6e
params.c147
###########################################################################
#     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 147-digit gnfs input
# Example: cadofactor.pl wdir=... name=... n=...

name=c147
parallel=1           # do we use parallel computation?
delay=300

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

###########################################################################
# Polynomial selection
###########################################################################

degree=5                # degree of the algebraic polynomial
kjdelay=300             # time between two checks
selectnice=4            # nice level for selection

## Parameters of polyselect
kjP=200000              # choose lc(g) with two prime factors in [P,2P]
kjmaxnorm=47.9          # max. lognorm of polynomials (before rootsieve)
kjadmax=4e9             # max value for lc(f)
kjadrange=4e7           # individual tasks
kjkmax=21               # rotation is bounded by 2^kmax
kjincr=30030            # forced divisor of lc(f)

###########################################################################
# 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=10000000
alim=20000000
lpbr=29
lpba=29
mfbr=58
mfba=87
rlambda=2.1
alambda=3.2

I=13                    # Sieving range in lattice siever
qmin=20000000           # Start of the special-q range
qrange=200000           # The size of an elementary sieving task
checkrange=500000       # We check if we have enough after each step
                        # of that many relations found.
firstcheck=50000000
sievenice=10
sieve_max_threads=2

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

excessratio=1.01        # minimal excess we want before pruning
keeppurge=160           # shrink in purge if excess exceeds keeppurge
keep=160                # excess wanted after merge
maxlevel=20             # maximal merge level
cwmax=100  
rwmax=100  
ratio=1.1
bwstrat=3               # 0: optimize the matrix size N
                        # 1: stop when the product N*weight is minimal
                        # 3: stop when weight/N exceeds coverNmax

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

bwmt=2x2                # Multithreading level of Block-Wiedemann

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

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