A 2015 paper by Forisek and Jancina presents a deterministic primality test for 32-bit and 64-bit integers using trial division, hash-based lookup tables, and strong probable prime testing. The algorithm requires minimal memory (512 bytes) and is faster than naive approaches, though newer methods like MachinePrime exist.