I did a nice asymptotic analysis here: https://github.com/pippellia-btc/The-Problem-of-Spam/tree/main/v0.2

N ~ 100k

The neat part is that multiplying two Boolean matrices cost O(N^2) instead of O(N^3) (or O(N^2.8) with strassen)