qsieve_process_relation
Synopsis
#include <flint/qsieve.h>Processes the relations once enough are expected: removes duplicates, combines the partial relations along the independent cycles of the graph of large primes (found from a spanning forest) into full relations, and if there are at least extra_rels more than factor base primes inserts them in the matrix and returns 1. Otherwise lowers the estimate qs_inf->num_cycles by the shortfall and returns 0, so that sieving continues. Returns -1 if a large prime turned out to divide n (stored in qs_inf->small_factor).
Cite this page
The FLINT team, “qsieve_process_relation (qsieve.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qsieve/qsieve_process_relation.html (generated 2026-10-20).
@misc{flint-doc-qsieve-qsieve-process-relation,
author = {{The FLINT team}},
title = {{qsieve\_process\_relation (qsieve.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qsieve/qsieve_process_relation.html},
note = {Generated 2026-10-20}
}