Not much better i guess? You&#x27;d have to model in the SAT-solver what is already more or less efficiently done here.<p>My best guess would be that the SAT-solver would be a lot slower, as this PoW system is mostly based on memory latency. From the paper: &quot;Runtime is linear in graph size
and dominated by random access latency&quot;