| Experiment: Fast finite field arithmetic modulo Solinas prime Fp=2^64-2^32+1 in C++ - Chris Taylor - catid |
| https://github.com/catid/solinas64 | ||
| Size | 608K (588K (+20K)) | |
| Commits | 12 (-1 (+13)) | |
| Update Stats | 0s ... 4m15s [Ø (last 10) 1s (1,1,1,1,1,1,1,1,2,1))] | |
| Last Change | 2019-01-10 09:12:41 | |
| Last Check | 2025-10-30 14:46:43 | |
| Created | 2019-01-23 02:11:02 |
Operation
Verifying url ...
Mail to Andreas Kupries