i haven't seen this algorithm on scratch yet, so i implemented it :3 the Schönhage–Strassen Multiplication Algorithm uses a variant of the FFT-multiply algorithm known as NTT (Number Theoretic Transform), and is designed to multiply numbers efficiently that have tens of thousands of decimal digits. This performs the FFT over a set of integers instead of the complex numbers, which can be useful as to avoid precision loss with floating point numbers. this project implements the NTT and a fast, N log N log log N, integer multiplication algorithm using it. for more information: https://en.wikipedia.org/wiki/Sch%C3%B6nhage%E2%80%93Strassen_algorithm i also stole the image from here lol some examples to try: multiply 11111111111111111111111 by itself or whatever this is supposed to be a filler project as i work on something else
