Sequential Memory Hard

This is an algorithm which uses $S(n)$ space and $T(n)$ operations, where $S(n)\in \Omega (T(n{)}^{1-ϵ})$. This is expensive to implement in either hardware or software. The fastest memory hard algorithm is memory hard so we cant parallelize this since we need sequential outputs to solve the hash.