Sounds like 3 more iterations on K3/Fable, and we'll able to ask it to break computational hardness assumptions like DLP?