The microblog: 2022.05.31 00:28:51

2022.05.31 00:28:51 (1531402286613688320) from Daniel J. Bernstein:

Very small software release showing how easy it is to beat NTL (which is faster than PARI, Sage, etc.) by a factor >100 for typical input sizes in an important subroutine, algebraic norm computation, _if_ the number field is a power-of-2 cyclotomic field:

2022.05.31 00:36:08 (1531404116882120705) from Daniel J. Bernstein:

The basic algorithm here was already known, but previous software wasn't showing what the algorithm can accomplish. More complicated algorithms handle more cyclotomics and their subfields (number theorists say "Abelian fields") as long as the degree is smooth. Paper coming soon.