0
I Use This!
High Activity

Commits : Listings

Analyzed about 7 hours ago. based on code collected about 7 hours ago.
Jun 20, 2018 — Jun 20, 2019
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
Some speedups in finding and factoring sieve reports Anon32 More... about 12 years ago
Roots mod p^k with polrootspadic() simply does not work the way I thought it would. Currently disabled. Anon32 More... about 12 years ago
checknorms can now take residue bounds as argument (overriding those in file) Anon32 More... about 12 years ago
polynomial generated by ggnfs (same number as c80.poly) Anon32 More... about 12 years ago
new program (checknorms) to check relations (and factor residues with libecm) Anon32 More... about 12 years ago
Fixed bug causing norms to be miscomputed. Other small changes. Anon32 More... about 12 years ago
added note about linking with GMP Anon32 More... about 12 years ago
fixed tiny problem in fb_maxprime Anon32 More... about 12 years ago
added #define for use of rdtscll (does not seem to be standard) Anon32 More... about 12 years ago
Updated compiling/running instructions Anon32 More... about 12 years ago
Siever mostly works now. Still awfully slow. Anon32 More... about 12 years ago
Closer to working but still has bugs. Anon32 More... about 12 years ago
Input files for a test case for siever Anon32 More... about 12 years ago
Sieving both sides almost finished. Untested. Do not use. Anon32 More... about 12 years ago
Some typedefs for sieve.c Anon32 More... about 12 years ago
Simple functions for modular arithmetic in an unsigned long Anon32 More... about 12 years ago
Computes rational factor base. Lots of rearranging code in preparation of sieving two (or more) polynomials. Anon32 More... about 12 years ago
[global] added MPN_COPY to gmp-hacks Anon32 More... about 12 years ago
Fixed strange extra roots mod p^k if p divides leading coefficient of poly Anon32 More... about 12 years ago
Reads polynomial from file. Anon32 More... about 12 years ago
Prints a,b values where norm is smooth and the primes that divide norm. Somewhat faster. Still very much under construction. Anon32 More... about 12 years ago
Computes norms (very slowly) and prints a,b where residual is below threshold Anon32 More... about 12 years ago
Code tries to treat projective roots correctly now. Small Readme file added. All of this is qnd hacked, use at your peril. Anon32 More... about 12 years ago
A trivial sieve code (dumb and slow atm) in C and root finder in Pari/GP. Nothing beyond the most basic sieve array update operation is there yet. Anon32 More... about 12 years ago
Very simple Perl script for sorting prime factors in Franke relations. Useful for comparing output of different siever versions that don't sort factors. Anon32 More... over 12 years ago
added LGPL header Anon32 More... over 12 years ago
the full LGPL Anon32 More... over 12 years ago
Added licence info Anon32 More... over 12 years ago
added copyright and author lines Anon32 More... over 12 years ago
find_primes_hit.c: Added point counting (naive variant, sum over Jacobi symbols) and avg. exponents of small primes. Shanks-Mestre tbd. Added option to use Brent's sigma parameter choice, or Montgomery's torsion 12 choice from his PhD thesis (6.1). Anon32 More... over 12 years ago