[Cado-nfs-discuss] [Help] Some problem regarding factoring using importe polynomial
Pierrick Gaudry
pierrick.gaudry at loria.fr
Fri Jun 15 07:57:37 CEST 2018
Hi,
The problem is that with the given parameters, not enough relations have
been found, even after all the special-q up to the large prime bound have
been used.
This is probably due to the fact that your polynomials are less efficient
than the ones found by the default algorithm, so that you have to adjust
the parameters accordingly. For instance, increase I or lpb.
Regards,
Pierrick
On Thu, Jun 14, 2018 at 02:22:41PM +0700, canny georgina wrote:
> Hi,
> When i try to do some test sieving using guideline suggested in
> README.nonlinear,
> i've tried imported the polynomial, works well sieving until about 70%
> then this error appear:
>
> Error:Lattice Sieving: Program run on localhost failed with exit code 1
> Error:Lattice Sieving: Stderr output follows (stored in file
> /tmp/cado.q_tpoqwj/c60.upload/c60_sieving_524000-526000.glyey27r.stderr0):
> b'# redoing q=524047, rho=205396 because buckets are full\n# Fullest
> level-1s bucket #5, wrote 8839/8720\n# Maybe you have too many threads
> compared to the size of the factor bases.\n# Please try less threads,
> or a larger -bkmult parameter (at some cost!).\n# The code will now
> try to adapt by allocating more memory for buckets.\n# redoing
> q=524197, rho=22706 because buckets are full\n# Fullest level-1s
> bucket #1, wrote 9262/9168\n# Maybe you have too many threads compared
> to the size of the factor bases.\n# Please try less threads, or a
> larger -bkmult parameter (at some cost!).\n# The code will now try to
> adapt by allocating more memory for buckets.\n# redoing q=524197,
> rho=454641 because buckets are full\n# Fullest level-1s bucket #4,
> wrote 10638/10176\n# Maybe you have too many threads compared to the
> size of the factor bases.\n# Please try less threads, or a larger
> -bkmult parameter (at some cost!).\n# The code will now try to adapt
> by allocating more memory for buckets.\nERROR: The special q (20 bits)
> is larger than the large prime bound on side 1 (19 bits).\n You
> can disable this check with the -allow-largesq argument,\n It is
> for instance useful for the descent.\n'
>
> Have tried once more and happens to be the same error.
> Thank you.
> _______________________________________________
> Cado-nfs-discuss mailing list
> Cado-nfs-discuss at lists.gforge.inria.fr
> https://lists.gforge.inria.fr/mailman/listinfo/cado-nfs-discuss
More information about the Cado-nfs-discuss
mailing list